5 #include "blk-mq-tag.h"
7 int blk_mq_sched_init_hctx_data(struct request_queue *q, size_t size,
8 int (*init)(struct blk_mq_hw_ctx *),
9 void (*exit)(struct blk_mq_hw_ctx *));
11 void blk_mq_sched_free_hctx_data(struct request_queue *q,
12 void (*exit)(struct blk_mq_hw_ctx *));
14 struct request *blk_mq_sched_get_request(struct request_queue *q, struct bio *bio, unsigned int op, struct blk_mq_alloc_data *data);
15 void blk_mq_sched_put_request(struct request *rq);
17 void blk_mq_sched_request_inserted(struct request *rq);
18 bool blk_mq_sched_try_merge(struct request_queue *q, struct bio *bio,
19 struct request **merged_request);
20 bool __blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio);
21 bool blk_mq_sched_try_insert_merge(struct request_queue *q, struct request *rq);
22 void blk_mq_sched_restart_queues(struct blk_mq_hw_ctx *hctx);
24 void blk_mq_sched_insert_request(struct request *rq, bool at_head,
25 bool run_queue, bool async, bool can_block);
26 void blk_mq_sched_insert_requests(struct request_queue *q,
27 struct blk_mq_ctx *ctx,
28 struct list_head *list, bool run_queue_async);
30 void blk_mq_sched_dispatch_requests(struct blk_mq_hw_ctx *hctx);
31 void blk_mq_sched_move_to_dispatch(struct blk_mq_hw_ctx *hctx,
32 struct list_head *rq_list,
33 struct request *(*get_rq)(struct blk_mq_hw_ctx *));
35 int blk_mq_sched_setup(struct request_queue *q);
36 void blk_mq_sched_teardown(struct request_queue *q);
38 int blk_mq_sched_init(struct request_queue *q);
41 blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio)
43 struct elevator_queue *e = q->elevator;
45 if (!e || blk_queue_nomerges(q) || !bio_mergeable(bio))
48 return __blk_mq_sched_bio_merge(q, bio);
51 static inline int blk_mq_sched_get_rq_priv(struct request_queue *q,
54 struct elevator_queue *e = q->elevator;
56 if (e && e->type->ops.mq.get_rq_priv)
57 return e->type->ops.mq.get_rq_priv(q, rq);
62 static inline void blk_mq_sched_put_rq_priv(struct request_queue *q,
65 struct elevator_queue *e = q->elevator;
67 if (e && e->type->ops.mq.put_rq_priv)
68 e->type->ops.mq.put_rq_priv(q, rq);
72 blk_mq_sched_allow_merge(struct request_queue *q, struct request *rq,
75 struct elevator_queue *e = q->elevator;
77 if (e && e->type->ops.mq.allow_merge)
78 return e->type->ops.mq.allow_merge(q, rq, bio);
84 blk_mq_sched_completed_request(struct blk_mq_hw_ctx *hctx, struct request *rq)
86 struct elevator_queue *e = hctx->queue->elevator;
88 if (e && e->type->ops.mq.completed_request)
89 e->type->ops.mq.completed_request(hctx, rq);
91 BUG_ON(rq->internal_tag == -1);
93 blk_mq_put_tag(hctx, hctx->sched_tags, rq->mq_ctx, rq->internal_tag);
96 static inline void blk_mq_sched_started_request(struct request *rq)
98 struct request_queue *q = rq->q;
99 struct elevator_queue *e = q->elevator;
101 if (e && e->type->ops.mq.started_request)
102 e->type->ops.mq.started_request(rq);
105 static inline void blk_mq_sched_requeue_request(struct request *rq)
107 struct request_queue *q = rq->q;
108 struct elevator_queue *e = q->elevator;
110 if (e && e->type->ops.mq.requeue_request)
111 e->type->ops.mq.requeue_request(rq);
114 static inline bool blk_mq_sched_has_work(struct blk_mq_hw_ctx *hctx)
116 struct elevator_queue *e = hctx->queue->elevator;
118 if (e && e->type->ops.mq.has_work)
119 return e->type->ops.mq.has_work(hctx);
124 static inline void blk_mq_sched_mark_restart(struct blk_mq_hw_ctx *hctx)
126 if (!test_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state)) {
127 set_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state);
128 if (hctx->flags & BLK_MQ_F_TAG_SHARED) {
129 struct request_queue *q = hctx->queue;
131 if (!test_bit(QUEUE_FLAG_RESTART, &q->queue_flags))
132 set_bit(QUEUE_FLAG_RESTART, &q->queue_flags);
137 static inline bool blk_mq_sched_needs_restart(struct blk_mq_hw_ctx *hctx)
139 return test_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state);