mm/memblock.c: do not complain about top-down allocations for !MEMORY_HOTREMOVE
[linux-2.6-block.git] / block / blk-mq-sched.h
CommitLineData
b2441318 1/* SPDX-License-Identifier: GPL-2.0 */
bd166ef1
JA
2#ifndef BLK_MQ_SCHED_H
3#define BLK_MQ_SCHED_H
4
5#include "blk-mq.h"
6#include "blk-mq-tag.h"
7
bd166ef1
JA
8void blk_mq_sched_free_hctx_data(struct request_queue *q,
9 void (*exit)(struct blk_mq_hw_ctx *));
10
44e8c2bf 11void blk_mq_sched_assign_ioc(struct request *rq, struct bio *bio);
bd166ef1
JA
12
13void blk_mq_sched_request_inserted(struct request *rq);
e4d750c9
JA
14bool blk_mq_sched_try_merge(struct request_queue *q, struct bio *bio,
15 struct request **merged_request);
bd166ef1
JA
16bool __blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio);
17bool blk_mq_sched_try_insert_merge(struct request_queue *q, struct request *rq);
6d8c6c0f 18void blk_mq_sched_restart(struct blk_mq_hw_ctx *hctx);
bd166ef1 19
bd6737f1 20void blk_mq_sched_insert_request(struct request *rq, bool at_head,
9e97d295 21 bool run_queue, bool async);
bd6737f1
JA
22void blk_mq_sched_insert_requests(struct request_queue *q,
23 struct blk_mq_ctx *ctx,
24 struct list_head *list, bool run_queue_async);
25
bd166ef1 26void blk_mq_sched_dispatch_requests(struct blk_mq_hw_ctx *hctx);
bd166ef1 27
6917ff0b 28int blk_mq_init_sched(struct request_queue *q, struct elevator_type *e);
54d5329d 29void blk_mq_exit_sched(struct request_queue *q, struct elevator_queue *e);
bd166ef1 30
93252632
OS
31int blk_mq_sched_init_hctx(struct request_queue *q, struct blk_mq_hw_ctx *hctx,
32 unsigned int hctx_idx);
33void blk_mq_sched_exit_hctx(struct request_queue *q, struct blk_mq_hw_ctx *hctx,
34 unsigned int hctx_idx);
35
bd166ef1
JA
36static inline bool
37blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio)
38{
9bddeb2a 39 if (blk_queue_nomerges(q) || !bio_mergeable(bio))
bd166ef1
JA
40 return false;
41
42 return __blk_mq_sched_bio_merge(q, bio);
43}
44
bd166ef1
JA
45static inline bool
46blk_mq_sched_allow_merge(struct request_queue *q, struct request *rq,
47 struct bio *bio)
48{
49 struct elevator_queue *e = q->elevator;
50
51 if (e && e->type->ops.mq.allow_merge)
52 return e->type->ops.mq.allow_merge(q, rq, bio);
53
54 return true;
55}
56
c05f8525 57static inline void blk_mq_sched_completed_request(struct request *rq)
bd166ef1 58{
c05f8525 59 struct elevator_queue *e = rq->q->elevator;
bd166ef1
JA
60
61 if (e && e->type->ops.mq.completed_request)
c05f8525 62 e->type->ops.mq.completed_request(rq);
bd166ef1
JA
63}
64
65static inline void blk_mq_sched_started_request(struct request *rq)
66{
67 struct request_queue *q = rq->q;
68 struct elevator_queue *e = q->elevator;
69
70 if (e && e->type->ops.mq.started_request)
71 e->type->ops.mq.started_request(rq);
72}
73
74static inline void blk_mq_sched_requeue_request(struct request *rq)
75{
76 struct request_queue *q = rq->q;
77 struct elevator_queue *e = q->elevator;
78
79 if (e && e->type->ops.mq.requeue_request)
80 e->type->ops.mq.requeue_request(rq);
81}
82
83static inline bool blk_mq_sched_has_work(struct blk_mq_hw_ctx *hctx)
84{
85 struct elevator_queue *e = hctx->queue->elevator;
86
87 if (e && e->type->ops.mq.has_work)
88 return e->type->ops.mq.has_work(hctx);
89
90 return false;
91}
92
bd166ef1
JA
93static inline bool blk_mq_sched_needs_restart(struct blk_mq_hw_ctx *hctx)
94{
95 return test_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state);
96}
97
98#endif