1 /* SPDX-License-Identifier: GPL-2.0 */
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
8 void blk_mq_sched_free_hctx_data(struct request_queue *q,
9 void (*exit)(struct blk_mq_hw_ctx *));
10
11 void blk_mq_sched_assign_ioc(struct request *rq, struct bio *bio);
12
13 void blk_mq_sched_request_inserted(struct request *rq);
14 bool blk_mq_sched_try_merge(struct request_queue *q, struct bio *bio,
15 struct request **merged_request);
16 bool __blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio);
17 bool blk_mq_sched_try_insert_merge(struct request_queue *q, struct request *rq);
18 void blk_mq_sched_restart(struct blk_mq_hw_ctx *hctx);
19
20 void blk_mq_sched_insert_request(struct request *rq, bool at_head,
21 bool run_queue, bool async);
22 void 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
26 void blk_mq_sched_dispatch_requests(struct blk_mq_hw_ctx *hctx);
27
28 int blk_mq_init_sched(struct request_queue *q, struct elevator_type *e);
29 void blk_mq_exit_sched(struct request_queue *q, struct elevator_queue *e);
30
31 static inline bool
blk_mq_sched_bio_merge(struct request_queue * q,struct bio * bio)32 blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio)
33 {
34 if (blk_queue_nomerges(q) || !bio_mergeable(bio))
35 return false;
36
37 return __blk_mq_sched_bio_merge(q, bio);
38 }
39
40 static inline bool
blk_mq_sched_allow_merge(struct request_queue * q,struct request * rq,struct bio * bio)41 blk_mq_sched_allow_merge(struct request_queue *q, struct request *rq,
42 struct bio *bio)
43 {
44 struct elevator_queue *e = q->elevator;
45
46 if (e && e->type->ops.mq.allow_merge)
47 return e->type->ops.mq.allow_merge(q, rq, bio);
48
49 return true;
50 }
51
blk_mq_sched_completed_request(struct request * rq)52 static inline void blk_mq_sched_completed_request(struct request *rq)
53 {
54 struct elevator_queue *e = rq->q->elevator;
55
56 if (e && e->type->ops.mq.completed_request)
57 e->type->ops.mq.completed_request(rq);
58 }
59
blk_mq_sched_started_request(struct request * rq)60 static inline void blk_mq_sched_started_request(struct request *rq)
61 {
62 struct request_queue *q = rq->q;
63 struct elevator_queue *e = q->elevator;
64
65 if (e && e->type->ops.mq.started_request)
66 e->type->ops.mq.started_request(rq);
67 }
68
blk_mq_sched_requeue_request(struct request * rq)69 static inline void blk_mq_sched_requeue_request(struct request *rq)
70 {
71 struct request_queue *q = rq->q;
72 struct elevator_queue *e = q->elevator;
73
74 if (e && e->type->ops.mq.requeue_request)
75 e->type->ops.mq.requeue_request(rq);
76 }
77
blk_mq_sched_has_work(struct blk_mq_hw_ctx * hctx)78 static inline bool blk_mq_sched_has_work(struct blk_mq_hw_ctx *hctx)
79 {
80 struct elevator_queue *e = hctx->queue->elevator;
81
82 if (e && e->type->ops.mq.has_work)
83 return e->type->ops.mq.has_work(hctx);
84
85 return false;
86 }
87
blk_mq_sched_needs_restart(struct blk_mq_hw_ctx * hctx)88 static inline bool blk_mq_sched_needs_restart(struct blk_mq_hw_ctx *hctx)
89 {
90 return test_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state);
91 }
92
93 #endif
94
