2 * blk-mq scheduling framework
4 * Copyright (C) 2016 Jens Axboe
6 #include <linux/kernel.h>
7 #include <linux/module.h>
8 #include <linux/blk-mq.h>
10 #include <trace/events/block.h>
14 #include "blk-mq-sched.h"
15 #include "blk-mq-tag.h"
18 void blk_mq_sched_free_hctx_data(struct request_queue *q,
19 void (*exit)(struct blk_mq_hw_ctx *))
21 struct blk_mq_hw_ctx *hctx;
24 queue_for_each_hw_ctx(q, hctx, i) {
25 if (exit && hctx->sched_data)
27 kfree(hctx->sched_data);
28 hctx->sched_data = NULL;
31 EXPORT_SYMBOL_GPL(blk_mq_sched_free_hctx_data);
33 int blk_mq_sched_init_hctx_data(struct request_queue *q, size_t size,
34 int (*init)(struct blk_mq_hw_ctx *),
35 void (*exit)(struct blk_mq_hw_ctx *))
37 struct blk_mq_hw_ctx *hctx;
41 queue_for_each_hw_ctx(q, hctx, i) {
42 hctx->sched_data = kmalloc_node(size, GFP_KERNEL, hctx->numa_node);
43 if (!hctx->sched_data) {
52 * We don't want to give exit() a partially
53 * initialized sched_data. init() must clean up
56 kfree(hctx->sched_data);
57 hctx->sched_data = NULL;
65 blk_mq_sched_free_hctx_data(q, exit);
68 EXPORT_SYMBOL_GPL(blk_mq_sched_init_hctx_data);
70 static void __blk_mq_sched_assign_ioc(struct request_queue *q,
71 struct request *rq, struct io_context *ioc)
75 spin_lock_irq(q->queue_lock);
76 icq = ioc_lookup_icq(ioc, q);
77 spin_unlock_irq(q->queue_lock);
80 icq = ioc_create_icq(ioc, q, GFP_ATOMIC);
86 if (!blk_mq_sched_get_rq_priv(q, rq)) {
87 rq->rq_flags |= RQF_ELVPRIV;
88 get_io_context(icq->ioc);
95 static void blk_mq_sched_assign_ioc(struct request_queue *q,
96 struct request *rq, struct bio *bio)
98 struct io_context *ioc;
102 __blk_mq_sched_assign_ioc(q, rq, ioc);
105 struct request *blk_mq_sched_get_request(struct request_queue *q,
108 struct blk_mq_alloc_data *data)
110 struct elevator_queue *e = q->elevator;
111 struct blk_mq_hw_ctx *hctx;
112 struct blk_mq_ctx *ctx;
114 const bool is_flush = op & (REQ_PREFLUSH | REQ_FUA);
116 blk_queue_enter_live(q);
117 ctx = blk_mq_get_ctx(q);
118 hctx = blk_mq_map_queue(q, ctx->cpu);
120 blk_mq_set_alloc_data(data, q, data->flags, ctx, hctx);
123 data->flags |= BLK_MQ_REQ_INTERNAL;
126 * Flush requests are special and go directly to the
129 if (!is_flush && e->type->ops.mq.get_request) {
130 rq = e->type->ops.mq.get_request(q, op, data);
132 rq->rq_flags |= RQF_QUEUED;
134 rq = __blk_mq_alloc_request(data, op);
136 rq = __blk_mq_alloc_request(data, op);
137 data->hctx->tags->rqs[rq->tag] = rq;
143 if (e && e->type->icq_cache)
144 blk_mq_sched_assign_ioc(q, rq, bio);
146 data->hctx->queued++;
154 void blk_mq_sched_put_request(struct request *rq)
156 struct request_queue *q = rq->q;
157 struct elevator_queue *e = q->elevator;
159 if (rq->rq_flags & RQF_ELVPRIV) {
160 blk_mq_sched_put_rq_priv(rq->q, rq);
162 put_io_context(rq->elv.icq->ioc);
167 if ((rq->rq_flags & RQF_QUEUED) && e && e->type->ops.mq.put_request)
168 e->type->ops.mq.put_request(rq);
170 blk_mq_finish_request(rq);
173 void blk_mq_sched_dispatch_requests(struct blk_mq_hw_ctx *hctx)
175 struct elevator_queue *e = hctx->queue->elevator;
178 if (unlikely(blk_mq_hctx_stopped(hctx)))
184 * If we have previous entries on our dispatch list, grab them first for
185 * more fair dispatch.
187 if (!list_empty_careful(&hctx->dispatch)) {
188 spin_lock(&hctx->lock);
189 if (!list_empty(&hctx->dispatch))
190 list_splice_init(&hctx->dispatch, &rq_list);
191 spin_unlock(&hctx->lock);
195 * Only ask the scheduler for requests, if we didn't have residual
196 * requests from the dispatch list. This is to avoid the case where
197 * we only ever dispatch a fraction of the requests available because
198 * of low device queue depth. Once we pull requests out of the IO
199 * scheduler, we can no longer merge or sort them. So it's best to
200 * leave them there for as long as we can. Mark the hw queue as
201 * needing a restart in that case.
203 if (list_empty(&rq_list)) {
204 if (e && e->type->ops.mq.dispatch_requests)
205 e->type->ops.mq.dispatch_requests(hctx, &rq_list);
207 blk_mq_flush_busy_ctxs(hctx, &rq_list);
209 blk_mq_sched_mark_restart(hctx);
211 blk_mq_dispatch_rq_list(hctx, &rq_list);
214 void blk_mq_sched_move_to_dispatch(struct blk_mq_hw_ctx *hctx,
215 struct list_head *rq_list,
216 struct request *(*get_rq)(struct blk_mq_hw_ctx *))
225 list_add_tail(&rq->queuelist, rq_list);
228 EXPORT_SYMBOL_GPL(blk_mq_sched_move_to_dispatch);
230 bool blk_mq_sched_try_merge(struct request_queue *q, struct bio *bio)
235 ret = elv_merge(q, &rq, bio);
236 if (ret == ELEVATOR_BACK_MERGE) {
237 if (!blk_mq_sched_allow_merge(q, rq, bio))
239 if (bio_attempt_back_merge(q, rq, bio)) {
240 if (!attempt_back_merge(q, rq))
241 elv_merged_request(q, rq, ret);
244 } else if (ret == ELEVATOR_FRONT_MERGE) {
245 if (!blk_mq_sched_allow_merge(q, rq, bio))
247 if (bio_attempt_front_merge(q, rq, bio)) {
248 if (!attempt_front_merge(q, rq))
249 elv_merged_request(q, rq, ret);
256 EXPORT_SYMBOL_GPL(blk_mq_sched_try_merge);
258 bool __blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio)
260 struct elevator_queue *e = q->elevator;
262 if (e->type->ops.mq.bio_merge) {
263 struct blk_mq_ctx *ctx = blk_mq_get_ctx(q);
264 struct blk_mq_hw_ctx *hctx = blk_mq_map_queue(q, ctx->cpu);
267 return e->type->ops.mq.bio_merge(hctx, bio);
273 bool blk_mq_sched_try_insert_merge(struct request_queue *q, struct request *rq)
275 return rq_mergeable(rq) && elv_attempt_insert_merge(q, rq);
277 EXPORT_SYMBOL_GPL(blk_mq_sched_try_insert_merge);
279 void blk_mq_sched_request_inserted(struct request *rq)
281 trace_block_rq_insert(rq->q, rq);
283 EXPORT_SYMBOL_GPL(blk_mq_sched_request_inserted);
285 bool blk_mq_sched_bypass_insert(struct blk_mq_hw_ctx *hctx, struct request *rq)
288 rq->rq_flags |= RQF_SORTED;
293 * If we already have a real request tag, send directly to
296 spin_lock(&hctx->lock);
297 list_add(&rq->queuelist, &hctx->dispatch);
298 spin_unlock(&hctx->lock);
301 EXPORT_SYMBOL_GPL(blk_mq_sched_bypass_insert);
303 static void blk_mq_sched_free_tags(struct blk_mq_tag_set *set,
304 struct blk_mq_hw_ctx *hctx,
305 unsigned int hctx_idx)
307 if (hctx->sched_tags) {
308 blk_mq_free_rqs(set, hctx->sched_tags, hctx_idx);
309 blk_mq_free_rq_map(hctx->sched_tags);
310 hctx->sched_tags = NULL;
314 int blk_mq_sched_setup(struct request_queue *q)
316 struct blk_mq_tag_set *set = q->tag_set;
317 struct blk_mq_hw_ctx *hctx;
321 * Default to 256, since we don't split into sync/async like the
322 * old code did. Additionally, this is a per-hw queue depth.
324 q->nr_requests = 2 * BLKDEV_MAX_RQ;
327 * We're switching to using an IO scheduler, so setup the hctx
328 * scheduler tags and switch the request map from the regular
329 * tags to scheduler tags. First allocate what we need, so we
330 * can safely fail and fallback, if needed.
333 queue_for_each_hw_ctx(q, hctx, i) {
334 hctx->sched_tags = blk_mq_alloc_rq_map(set, i, q->nr_requests, 0);
335 if (!hctx->sched_tags) {
339 ret = blk_mq_alloc_rqs(set, hctx->sched_tags, i, q->nr_requests);
345 * If we failed, free what we did allocate
348 queue_for_each_hw_ctx(q, hctx, i) {
349 if (!hctx->sched_tags)
351 blk_mq_sched_free_tags(set, hctx, i);
360 void blk_mq_sched_teardown(struct request_queue *q)
362 struct blk_mq_tag_set *set = q->tag_set;
363 struct blk_mq_hw_ctx *hctx;
366 queue_for_each_hw_ctx(q, hctx, i)
367 blk_mq_sched_free_tags(set, hctx, i);
370 int blk_mq_sched_init(struct request_queue *q)
374 #if defined(CONFIG_DEFAULT_SQ_NONE)
375 if (q->nr_hw_queues == 1)
378 #if defined(CONFIG_DEFAULT_MQ_NONE)
379 if (q->nr_hw_queues > 1)
383 mutex_lock(&q->sysfs_lock);
384 ret = elevator_init(q, NULL);
385 mutex_unlock(&q->sysfs_lock);