]>
Commit | Line | Data |
---|---|---|
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 |
8 | void blk_mq_sched_free_hctx_data(struct request_queue *q, |
9 | void (*exit)(struct blk_mq_hw_ctx *)); | |
10 | ||
44e8c2bf | 11 | void blk_mq_sched_assign_ioc(struct request *rq, struct bio *bio); |
bd166ef1 JA |
12 | |
13 | void blk_mq_sched_request_inserted(struct request *rq); | |
e4d750c9 JA |
14 | bool blk_mq_sched_try_merge(struct request_queue *q, struct bio *bio, |
15 | struct request **merged_request); | |
bd166ef1 JA |
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); | |
6d8c6c0f | 18 | void blk_mq_sched_restart(struct blk_mq_hw_ctx *hctx); |
bd166ef1 | 19 | |
bd6737f1 JA |
20 | void blk_mq_sched_insert_request(struct request *rq, bool at_head, |
21 | bool run_queue, bool async, bool can_block); | |
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 | ||
bd166ef1 | 26 | void blk_mq_sched_dispatch_requests(struct blk_mq_hw_ctx *hctx); |
bd166ef1 | 27 | |
6917ff0b | 28 | int blk_mq_init_sched(struct request_queue *q, struct elevator_type *e); |
54d5329d | 29 | void blk_mq_exit_sched(struct request_queue *q, struct elevator_queue *e); |
bd166ef1 | 30 | |
93252632 OS |
31 | int blk_mq_sched_init_hctx(struct request_queue *q, struct blk_mq_hw_ctx *hctx, |
32 | unsigned int hctx_idx); | |
33 | void blk_mq_sched_exit_hctx(struct request_queue *q, struct blk_mq_hw_ctx *hctx, | |
34 | unsigned int hctx_idx); | |
35 | ||
d3484991 JA |
36 | int blk_mq_sched_init(struct request_queue *q); |
37 | ||
bd166ef1 JA |
38 | static inline bool |
39 | blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio) | |
40 | { | |
9bddeb2a | 41 | if (blk_queue_nomerges(q) || !bio_mergeable(bio)) |
bd166ef1 JA |
42 | return false; |
43 | ||
44 | return __blk_mq_sched_bio_merge(q, bio); | |
45 | } | |
46 | ||
bd166ef1 JA |
47 | static inline bool |
48 | blk_mq_sched_allow_merge(struct request_queue *q, struct request *rq, | |
49 | struct bio *bio) | |
50 | { | |
51 | struct elevator_queue *e = q->elevator; | |
52 | ||
53 | if (e && e->type->ops.mq.allow_merge) | |
54 | return e->type->ops.mq.allow_merge(q, rq, bio); | |
55 | ||
56 | return true; | |
57 | } | |
58 | ||
c05f8525 | 59 | static inline void blk_mq_sched_completed_request(struct request *rq) |
bd166ef1 | 60 | { |
c05f8525 | 61 | struct elevator_queue *e = rq->q->elevator; |
bd166ef1 JA |
62 | |
63 | if (e && e->type->ops.mq.completed_request) | |
c05f8525 | 64 | e->type->ops.mq.completed_request(rq); |
bd166ef1 JA |
65 | } |
66 | ||
67 | static inline void blk_mq_sched_started_request(struct request *rq) | |
68 | { | |
69 | struct request_queue *q = rq->q; | |
70 | struct elevator_queue *e = q->elevator; | |
71 | ||
72 | if (e && e->type->ops.mq.started_request) | |
73 | e->type->ops.mq.started_request(rq); | |
74 | } | |
75 | ||
76 | static inline void blk_mq_sched_requeue_request(struct request *rq) | |
77 | { | |
78 | struct request_queue *q = rq->q; | |
79 | struct elevator_queue *e = q->elevator; | |
80 | ||
81 | if (e && e->type->ops.mq.requeue_request) | |
82 | e->type->ops.mq.requeue_request(rq); | |
83 | } | |
84 | ||
85 | static inline bool blk_mq_sched_has_work(struct blk_mq_hw_ctx *hctx) | |
86 | { | |
87 | struct elevator_queue *e = hctx->queue->elevator; | |
88 | ||
89 | if (e && e->type->ops.mq.has_work) | |
90 | return e->type->ops.mq.has_work(hctx); | |
91 | ||
92 | return false; | |
93 | } | |
94 | ||
bd166ef1 JA |
95 | static inline bool blk_mq_sched_needs_restart(struct blk_mq_hw_ctx *hctx) |
96 | { | |
97 | return test_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state); | |
98 | } | |
99 | ||
100 | #endif |