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