]>
Commit | Line | Data |
---|---|---|
1 | #ifndef BLK_MQ_SCHED_H | |
2 | #define BLK_MQ_SCHED_H | |
3 | ||
4 | #include "blk-mq.h" | |
5 | #include "blk-mq-tag.h" | |
6 | ||
7 | void blk_mq_sched_free_hctx_data(struct request_queue *q, | |
8 | void (*exit)(struct blk_mq_hw_ctx *)); | |
9 | ||
10 | void blk_mq_sched_assign_ioc(struct request_queue *q, struct request *rq, | |
11 | 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, 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 | ||
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 | 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 | ||
36 | int blk_mq_sched_init(struct request_queue *q); | |
37 | ||
38 | static inline bool | |
39 | blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio) | |
40 | { | |
41 | if (blk_queue_nomerges(q) || !bio_mergeable(bio)) | |
42 | return false; | |
43 | ||
44 | return __blk_mq_sched_bio_merge(q, bio); | |
45 | } | |
46 | ||
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 | ||
59 | static inline void blk_mq_sched_completed_request(struct request *rq) | |
60 | { | |
61 | struct elevator_queue *e = rq->q->elevator; | |
62 | ||
63 | if (e && e->type->ops.mq.completed_request) | |
64 | e->type->ops.mq.completed_request(rq); | |
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 | ||
95 | /* | |
96 | * Mark a hardware queue as needing a restart. | |
97 | */ | |
98 | static inline void blk_mq_sched_mark_restart_hctx(struct blk_mq_hw_ctx *hctx) | |
99 | { | |
100 | if (!test_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state)) | |
101 | set_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state); | |
102 | } | |
103 | ||
104 | static inline bool blk_mq_sched_needs_restart(struct blk_mq_hw_ctx *hctx) | |
105 | { | |
106 | return test_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state); | |
107 | } | |
108 | ||
109 | #endif |