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 | ||
2e9bc346 | 5 | #include "elevator.h" |
bd166ef1 JA |
6 | #include "blk-mq.h" |
7 | #include "blk-mq-tag.h" | |
8 | ||
d2a27964 | 9 | #define MAX_SCHED_RQ (16 * BLKDEV_DEFAULT_RQ) |
d97e594c | 10 | |
e2b3fa5a | 11 | void blk_mq_sched_assign_ioc(struct request *rq); |
bd166ef1 | 12 | |
e4d750c9 | 13 | bool blk_mq_sched_try_merge(struct request_queue *q, struct bio *bio, |
14ccb66b CH |
14 | unsigned int nr_segs, struct request **merged_request); |
15 | bool __blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio, | |
16 | unsigned int nr_segs); | |
fd2ef39c JK |
17 | bool blk_mq_sched_try_insert_merge(struct request_queue *q, struct request *rq, |
18 | struct list_head *free); | |
7211aef8 | 19 | void blk_mq_sched_mark_restart_hctx(struct blk_mq_hw_ctx *hctx); |
e9ea1596 | 20 | void __blk_mq_sched_restart(struct blk_mq_hw_ctx *hctx); |
bd166ef1 | 21 | |
bd6737f1 | 22 | void blk_mq_sched_insert_request(struct request *rq, bool at_head, |
9e97d295 | 23 | bool run_queue, bool async); |
67cae4c9 | 24 | void blk_mq_sched_insert_requests(struct blk_mq_hw_ctx *hctx, |
bd6737f1 JA |
25 | struct blk_mq_ctx *ctx, |
26 | struct list_head *list, bool run_queue_async); | |
27 | ||
bd166ef1 | 28 | void blk_mq_sched_dispatch_requests(struct blk_mq_hw_ctx *hctx); |
bd166ef1 | 29 | |
6917ff0b | 30 | int blk_mq_init_sched(struct request_queue *q, struct elevator_type *e); |
54d5329d | 31 | void blk_mq_exit_sched(struct request_queue *q, struct elevator_queue *e); |
1820f4f0 | 32 | void blk_mq_sched_free_rqs(struct request_queue *q); |
bd166ef1 | 33 | |
e9ea1596 PB |
34 | static inline void blk_mq_sched_restart(struct blk_mq_hw_ctx *hctx) |
35 | { | |
36 | if (test_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state)) | |
37 | __blk_mq_sched_restart(hctx); | |
38 | } | |
39 | ||
bd166ef1 | 40 | static inline bool |
14ccb66b CH |
41 | blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio, |
42 | unsigned int nr_segs) | |
bd166ef1 | 43 | { |
9bddeb2a | 44 | if (blk_queue_nomerges(q) || !bio_mergeable(bio)) |
bd166ef1 JA |
45 | return false; |
46 | ||
14ccb66b | 47 | return __blk_mq_sched_bio_merge(q, bio, nr_segs); |
bd166ef1 JA |
48 | } |
49 | ||
bd166ef1 JA |
50 | static inline bool |
51 | blk_mq_sched_allow_merge(struct request_queue *q, struct request *rq, | |
52 | struct bio *bio) | |
53 | { | |
54 | struct elevator_queue *e = q->elevator; | |
55 | ||
f9cd4bfe JA |
56 | if (e && e->type->ops.allow_merge) |
57 | return e->type->ops.allow_merge(q, rq, bio); | |
bd166ef1 JA |
58 | |
59 | return true; | |
60 | } | |
61 | ||
ed88660a | 62 | static inline void blk_mq_sched_completed_request(struct request *rq, u64 now) |
bd166ef1 | 63 | { |
c05f8525 | 64 | struct elevator_queue *e = rq->q->elevator; |
bd166ef1 | 65 | |
f9cd4bfe JA |
66 | if (e && e->type->ops.completed_request) |
67 | e->type->ops.completed_request(rq, now); | |
bd166ef1 JA |
68 | } |
69 | ||
bd166ef1 JA |
70 | static inline void blk_mq_sched_requeue_request(struct request *rq) |
71 | { | |
72 | struct request_queue *q = rq->q; | |
73 | struct elevator_queue *e = q->elevator; | |
74 | ||
e8a8a185 | 75 | if ((rq->rq_flags & RQF_ELVPRIV) && e && e->type->ops.requeue_request) |
f9cd4bfe | 76 | e->type->ops.requeue_request(rq); |
bd166ef1 JA |
77 | } |
78 | ||
79 | static inline bool blk_mq_sched_has_work(struct blk_mq_hw_ctx *hctx) | |
80 | { | |
81 | struct elevator_queue *e = hctx->queue->elevator; | |
82 | ||
f9cd4bfe JA |
83 | if (e && e->type->ops.has_work) |
84 | return e->type->ops.has_work(hctx); | |
bd166ef1 JA |
85 | |
86 | return false; | |
87 | } | |
88 | ||
bd166ef1 JA |
89 | static inline bool blk_mq_sched_needs_restart(struct blk_mq_hw_ctx *hctx) |
90 | { | |
91 | return test_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state); | |
92 | } | |
93 | ||
94 | #endif |