xref: /linux/block/blk-mq-sched.h (revision b7019ac550eb3916f34d79db583e9b7ea2524afa)
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);
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_mark_restart_hctx(struct blk_mq_hw_ctx *hctx);
19 void blk_mq_sched_restart(struct blk_mq_hw_ctx *hctx);
20 
21 void blk_mq_sched_insert_request(struct request *rq, bool at_head,
22 				 bool run_queue, bool async);
23 void blk_mq_sched_insert_requests(struct blk_mq_hw_ctx *hctx,
24 				  struct blk_mq_ctx *ctx,
25 				  struct list_head *list, bool run_queue_async);
26 
27 void blk_mq_sched_dispatch_requests(struct blk_mq_hw_ctx *hctx);
28 
29 int blk_mq_init_sched(struct request_queue *q, struct elevator_type *e);
30 void blk_mq_exit_sched(struct request_queue *q, struct elevator_queue *e);
31 void blk_mq_sched_free_requests(struct request_queue *q);
32 
33 static inline bool
34 blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio)
35 {
36 	if (blk_queue_nomerges(q) || !bio_mergeable(bio))
37 		return false;
38 
39 	return __blk_mq_sched_bio_merge(q, bio);
40 }
41 
42 static inline bool
43 blk_mq_sched_allow_merge(struct request_queue *q, struct request *rq,
44 			 struct bio *bio)
45 {
46 	struct elevator_queue *e = q->elevator;
47 
48 	if (e && e->type->ops.allow_merge)
49 		return e->type->ops.allow_merge(q, rq, bio);
50 
51 	return true;
52 }
53 
54 static inline void blk_mq_sched_completed_request(struct request *rq, u64 now)
55 {
56 	struct elevator_queue *e = rq->q->elevator;
57 
58 	if (e && e->type->ops.completed_request)
59 		e->type->ops.completed_request(rq, now);
60 }
61 
62 static inline void blk_mq_sched_started_request(struct request *rq)
63 {
64 	struct request_queue *q = rq->q;
65 	struct elevator_queue *e = q->elevator;
66 
67 	if (e && e->type->ops.started_request)
68 		e->type->ops.started_request(rq);
69 }
70 
71 static inline void blk_mq_sched_requeue_request(struct request *rq)
72 {
73 	struct request_queue *q = rq->q;
74 	struct elevator_queue *e = q->elevator;
75 
76 	if (e && e->type->ops.requeue_request)
77 		e->type->ops.requeue_request(rq);
78 }
79 
80 static inline bool blk_mq_sched_has_work(struct blk_mq_hw_ctx *hctx)
81 {
82 	struct elevator_queue *e = hctx->queue->elevator;
83 
84 	if (e && e->type->ops.has_work)
85 		return e->type->ops.has_work(hctx);
86 
87 	return false;
88 }
89 
90 static inline bool blk_mq_sched_needs_restart(struct blk_mq_hw_ctx *hctx)
91 {
92 	return test_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state);
93 }
94 
95 #endif
96