13dcf60bcSChristoph Hellwig // SPDX-License-Identifier: GPL-2.0 2bd166ef1SJens Axboe /* 3bd166ef1SJens Axboe * blk-mq scheduling framework 4bd166ef1SJens Axboe * 5bd166ef1SJens Axboe * Copyright (C) 2016 Jens Axboe 6bd166ef1SJens Axboe */ 7bd166ef1SJens Axboe #include <linux/kernel.h> 8bd166ef1SJens Axboe #include <linux/module.h> 9bd166ef1SJens Axboe #include <linux/blk-mq.h> 106e6fcbc2SMing Lei #include <linux/list_sort.h> 11bd166ef1SJens Axboe 12bd166ef1SJens Axboe #include <trace/events/block.h> 13bd166ef1SJens Axboe 14bd166ef1SJens Axboe #include "blk.h" 15bd166ef1SJens Axboe #include "blk-mq.h" 16d332ce09SOmar Sandoval #include "blk-mq-debugfs.h" 17bd166ef1SJens Axboe #include "blk-mq-sched.h" 18bd166ef1SJens Axboe #include "blk-mq-tag.h" 19bd166ef1SJens Axboe #include "blk-wbt.h" 20bd166ef1SJens Axboe 21e2b3fa5aSDamien Le Moal void blk_mq_sched_assign_ioc(struct request *rq) 22bd166ef1SJens Axboe { 2344e8c2bfSChristoph Hellwig struct request_queue *q = rq->q; 240c62bff1SJens Axboe struct io_context *ioc; 25bd166ef1SJens Axboe struct io_cq *icq; 26bd166ef1SJens Axboe 270c62bff1SJens Axboe /* 280c62bff1SJens Axboe * May not have an IO context if it's a passthrough request 290c62bff1SJens Axboe */ 300c62bff1SJens Axboe ioc = current->io_context; 310c62bff1SJens Axboe if (!ioc) 320c62bff1SJens Axboe return; 330c62bff1SJens Axboe 340d945c1fSChristoph Hellwig spin_lock_irq(&q->queue_lock); 35bd166ef1SJens Axboe icq = ioc_lookup_icq(ioc, q); 360d945c1fSChristoph Hellwig spin_unlock_irq(&q->queue_lock); 37bd166ef1SJens Axboe 38bd166ef1SJens Axboe if (!icq) { 39bd166ef1SJens Axboe icq = ioc_create_icq(ioc, q, GFP_ATOMIC); 40bd166ef1SJens Axboe if (!icq) 41bd166ef1SJens Axboe return; 42bd166ef1SJens Axboe } 43ea511e3cSChristoph Hellwig get_io_context(icq->ioc); 4444e8c2bfSChristoph Hellwig rq->elv.icq = icq; 45bd166ef1SJens Axboe } 46bd166ef1SJens Axboe 478e8320c9SJens Axboe /* 488e8320c9SJens Axboe * Mark a hardware queue as needing a restart. For shared queues, maintain 498e8320c9SJens Axboe * a count of how many hardware queues are marked for restart. 508e8320c9SJens Axboe */ 517211aef8SDamien Le Moal void blk_mq_sched_mark_restart_hctx(struct blk_mq_hw_ctx *hctx) 528e8320c9SJens Axboe { 538e8320c9SJens Axboe if (test_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state)) 548e8320c9SJens Axboe return; 558e8320c9SJens Axboe 568e8320c9SJens Axboe set_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state); 578e8320c9SJens Axboe } 587211aef8SDamien Le Moal EXPORT_SYMBOL_GPL(blk_mq_sched_mark_restart_hctx); 598e8320c9SJens Axboe 6097889f9aSMing Lei void blk_mq_sched_restart(struct blk_mq_hw_ctx *hctx) 618e8320c9SJens Axboe { 628e8320c9SJens Axboe if (!test_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state)) 6397889f9aSMing Lei return; 648e8320c9SJens Axboe clear_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state); 658e8320c9SJens Axboe 66d7d8535fSMing Lei /* 67d7d8535fSMing Lei * Order clearing SCHED_RESTART and list_empty_careful(&hctx->dispatch) 68d7d8535fSMing Lei * in blk_mq_run_hw_queue(). Its pair is the barrier in 69d7d8535fSMing Lei * blk_mq_dispatch_rq_list(). So dispatch code won't see SCHED_RESTART, 70d7d8535fSMing Lei * meantime new request added to hctx->dispatch is missed to check in 71d7d8535fSMing Lei * blk_mq_run_hw_queue(). 72d7d8535fSMing Lei */ 73d7d8535fSMing Lei smp_mb(); 74d7d8535fSMing Lei 7597889f9aSMing Lei blk_mq_run_hw_queue(hctx, true); 768e8320c9SJens Axboe } 778e8320c9SJens Axboe 786e6fcbc2SMing Lei static int sched_rq_cmp(void *priv, struct list_head *a, struct list_head *b) 796e6fcbc2SMing Lei { 806e6fcbc2SMing Lei struct request *rqa = container_of(a, struct request, queuelist); 816e6fcbc2SMing Lei struct request *rqb = container_of(b, struct request, queuelist); 826e6fcbc2SMing Lei 836e6fcbc2SMing Lei return rqa->mq_hctx > rqb->mq_hctx; 846e6fcbc2SMing Lei } 856e6fcbc2SMing Lei 866e6fcbc2SMing Lei static bool blk_mq_dispatch_hctx_list(struct list_head *rq_list) 876e6fcbc2SMing Lei { 886e6fcbc2SMing Lei struct blk_mq_hw_ctx *hctx = 896e6fcbc2SMing Lei list_first_entry(rq_list, struct request, queuelist)->mq_hctx; 906e6fcbc2SMing Lei struct request *rq; 916e6fcbc2SMing Lei LIST_HEAD(hctx_list); 926e6fcbc2SMing Lei unsigned int count = 0; 936e6fcbc2SMing Lei 946e6fcbc2SMing Lei list_for_each_entry(rq, rq_list, queuelist) { 956e6fcbc2SMing Lei if (rq->mq_hctx != hctx) { 966e6fcbc2SMing Lei list_cut_before(&hctx_list, rq_list, &rq->queuelist); 976e6fcbc2SMing Lei goto dispatch; 986e6fcbc2SMing Lei } 996e6fcbc2SMing Lei count++; 1006e6fcbc2SMing Lei } 1016e6fcbc2SMing Lei list_splice_tail_init(rq_list, &hctx_list); 1026e6fcbc2SMing Lei 1036e6fcbc2SMing Lei dispatch: 104106e71c5SBaolin Wang return blk_mq_dispatch_rq_list(hctx, &hctx_list, count); 1056e6fcbc2SMing Lei } 1066e6fcbc2SMing Lei 107a0823421SDouglas Anderson #define BLK_MQ_BUDGET_DELAY 3 /* ms units */ 108a0823421SDouglas Anderson 1091f460b63SMing Lei /* 1101f460b63SMing Lei * Only SCSI implements .get_budget and .put_budget, and SCSI restarts 1111f460b63SMing Lei * its queue by itself in its completion handler, so we don't need to 1121f460b63SMing Lei * restart queue if .get_budget() returns BLK_STS_NO_RESOURCE. 11328d65729SSalman Qazi * 11428d65729SSalman Qazi * Returns -EAGAIN if hctx->dispatch was found non-empty and run_work has to 11528d65729SSalman Qazi * be run again. This is necessary to avoid starving flushes. 1161f460b63SMing Lei */ 1176e6fcbc2SMing Lei static int __blk_mq_do_dispatch_sched(struct blk_mq_hw_ctx *hctx) 118caf8eb0dSMing Lei { 119caf8eb0dSMing Lei struct request_queue *q = hctx->queue; 120caf8eb0dSMing Lei struct elevator_queue *e = q->elevator; 1216e6fcbc2SMing Lei bool multi_hctxs = false, run_queue = false; 1226e6fcbc2SMing Lei bool dispatched = false, busy = false; 1236e6fcbc2SMing Lei unsigned int max_dispatch; 124caf8eb0dSMing Lei LIST_HEAD(rq_list); 1256e6fcbc2SMing Lei int count = 0; 1266e6fcbc2SMing Lei 1276e6fcbc2SMing Lei if (hctx->dispatch_busy) 1286e6fcbc2SMing Lei max_dispatch = 1; 1296e6fcbc2SMing Lei else 1306e6fcbc2SMing Lei max_dispatch = hctx->queue->nr_requests; 131caf8eb0dSMing Lei 132445874e8SMing Lei do { 1336e6fcbc2SMing Lei struct request *rq; 1346e6fcbc2SMing Lei 135f9cd4bfeSJens Axboe if (e->type->ops.has_work && !e->type->ops.has_work(hctx)) 136caf8eb0dSMing Lei break; 137de148297SMing Lei 13828d65729SSalman Qazi if (!list_empty_careful(&hctx->dispatch)) { 1396e6fcbc2SMing Lei busy = true; 14028d65729SSalman Qazi break; 14128d65729SSalman Qazi } 14228d65729SSalman Qazi 14365c76369SMing Lei if (!blk_mq_get_dispatch_budget(q)) 1441f460b63SMing Lei break; 145de148297SMing Lei 146f9cd4bfeSJens Axboe rq = e->type->ops.dispatch_request(hctx); 147de148297SMing Lei if (!rq) { 14865c76369SMing Lei blk_mq_put_dispatch_budget(q); 149a0823421SDouglas Anderson /* 150a0823421SDouglas Anderson * We're releasing without dispatching. Holding the 151a0823421SDouglas Anderson * budget could have blocked any "hctx"s with the 152a0823421SDouglas Anderson * same queue and if we didn't dispatch then there's 153a0823421SDouglas Anderson * no guarantee anyone will kick the queue. Kick it 154a0823421SDouglas Anderson * ourselves. 155a0823421SDouglas Anderson */ 1566e6fcbc2SMing Lei run_queue = true; 157de148297SMing Lei break; 158caf8eb0dSMing Lei } 159caf8eb0dSMing Lei 160de148297SMing Lei /* 161de148297SMing Lei * Now this rq owns the budget which has to be released 162de148297SMing Lei * if this rq won't be queued to driver via .queue_rq() 163de148297SMing Lei * in blk_mq_dispatch_rq_list(). 164de148297SMing Lei */ 1656e6fcbc2SMing Lei list_add_tail(&rq->queuelist, &rq_list); 1666e6fcbc2SMing Lei if (rq->mq_hctx != hctx) 1676e6fcbc2SMing Lei multi_hctxs = true; 1686e6fcbc2SMing Lei } while (++count < max_dispatch); 1696e6fcbc2SMing Lei 1706e6fcbc2SMing Lei if (!count) { 1716e6fcbc2SMing Lei if (run_queue) 1726e6fcbc2SMing Lei blk_mq_delay_run_hw_queues(q, BLK_MQ_BUDGET_DELAY); 1736e6fcbc2SMing Lei } else if (multi_hctxs) { 1746e6fcbc2SMing Lei /* 1756e6fcbc2SMing Lei * Requests from different hctx may be dequeued from some 1766e6fcbc2SMing Lei * schedulers, such as bfq and deadline. 1776e6fcbc2SMing Lei * 1786e6fcbc2SMing Lei * Sort the requests in the list according to their hctx, 1796e6fcbc2SMing Lei * dispatch batching requests from same hctx at a time. 1806e6fcbc2SMing Lei */ 1816e6fcbc2SMing Lei list_sort(NULL, &rq_list, sched_rq_cmp); 1826e6fcbc2SMing Lei do { 1836e6fcbc2SMing Lei dispatched |= blk_mq_dispatch_hctx_list(&rq_list); 1846e6fcbc2SMing Lei } while (!list_empty(&rq_list)); 1856e6fcbc2SMing Lei } else { 1866e6fcbc2SMing Lei dispatched = blk_mq_dispatch_rq_list(hctx, &rq_list, count); 1876e6fcbc2SMing Lei } 1886e6fcbc2SMing Lei 1896e6fcbc2SMing Lei if (busy) 1906e6fcbc2SMing Lei return -EAGAIN; 1916e6fcbc2SMing Lei return !!dispatched; 1926e6fcbc2SMing Lei } 1936e6fcbc2SMing Lei 1946e6fcbc2SMing Lei static int blk_mq_do_dispatch_sched(struct blk_mq_hw_ctx *hctx) 1956e6fcbc2SMing Lei { 1966e6fcbc2SMing Lei int ret; 1976e6fcbc2SMing Lei 1986e6fcbc2SMing Lei do { 1996e6fcbc2SMing Lei ret = __blk_mq_do_dispatch_sched(hctx); 2006e6fcbc2SMing Lei } while (ret == 1); 20128d65729SSalman Qazi 20228d65729SSalman Qazi return ret; 203de148297SMing Lei } 204de148297SMing Lei 205b347689fSMing Lei static struct blk_mq_ctx *blk_mq_next_ctx(struct blk_mq_hw_ctx *hctx, 206b347689fSMing Lei struct blk_mq_ctx *ctx) 207b347689fSMing Lei { 208f31967f0SJens Axboe unsigned short idx = ctx->index_hw[hctx->type]; 209b347689fSMing Lei 210b347689fSMing Lei if (++idx == hctx->nr_ctx) 211b347689fSMing Lei idx = 0; 212b347689fSMing Lei 213b347689fSMing Lei return hctx->ctxs[idx]; 214b347689fSMing Lei } 215b347689fSMing Lei 2161f460b63SMing Lei /* 2171f460b63SMing Lei * Only SCSI implements .get_budget and .put_budget, and SCSI restarts 2181f460b63SMing Lei * its queue by itself in its completion handler, so we don't need to 2191f460b63SMing Lei * restart queue if .get_budget() returns BLK_STS_NO_RESOURCE. 22028d65729SSalman Qazi * 22128d65729SSalman Qazi * Returns -EAGAIN if hctx->dispatch was found non-empty and run_work has to 222c4aecaa2SRandy Dunlap * be run again. This is necessary to avoid starving flushes. 2231f460b63SMing Lei */ 22428d65729SSalman Qazi static int blk_mq_do_dispatch_ctx(struct blk_mq_hw_ctx *hctx) 225b347689fSMing Lei { 226b347689fSMing Lei struct request_queue *q = hctx->queue; 227b347689fSMing Lei LIST_HEAD(rq_list); 228b347689fSMing Lei struct blk_mq_ctx *ctx = READ_ONCE(hctx->dispatch_from); 22928d65729SSalman Qazi int ret = 0; 230b347689fSMing Lei struct request *rq; 231b347689fSMing Lei 232445874e8SMing Lei do { 23328d65729SSalman Qazi if (!list_empty_careful(&hctx->dispatch)) { 23428d65729SSalman Qazi ret = -EAGAIN; 23528d65729SSalman Qazi break; 23628d65729SSalman Qazi } 23728d65729SSalman Qazi 238b347689fSMing Lei if (!sbitmap_any_bit_set(&hctx->ctx_map)) 239b347689fSMing Lei break; 240b347689fSMing Lei 24165c76369SMing Lei if (!blk_mq_get_dispatch_budget(q)) 2421f460b63SMing Lei break; 243b347689fSMing Lei 244b347689fSMing Lei rq = blk_mq_dequeue_from_ctx(hctx, ctx); 245b347689fSMing Lei if (!rq) { 24665c76369SMing Lei blk_mq_put_dispatch_budget(q); 247a0823421SDouglas Anderson /* 248a0823421SDouglas Anderson * We're releasing without dispatching. Holding the 249a0823421SDouglas Anderson * budget could have blocked any "hctx"s with the 250a0823421SDouglas Anderson * same queue and if we didn't dispatch then there's 251a0823421SDouglas Anderson * no guarantee anyone will kick the queue. Kick it 252a0823421SDouglas Anderson * ourselves. 253a0823421SDouglas Anderson */ 254a0823421SDouglas Anderson blk_mq_delay_run_hw_queues(q, BLK_MQ_BUDGET_DELAY); 255b347689fSMing Lei break; 256b347689fSMing Lei } 257b347689fSMing Lei 258b347689fSMing Lei /* 259b347689fSMing Lei * Now this rq owns the budget which has to be released 260b347689fSMing Lei * if this rq won't be queued to driver via .queue_rq() 261b347689fSMing Lei * in blk_mq_dispatch_rq_list(). 262b347689fSMing Lei */ 263b347689fSMing Lei list_add(&rq->queuelist, &rq_list); 264b347689fSMing Lei 265b347689fSMing Lei /* round robin for fair dispatch */ 266b347689fSMing Lei ctx = blk_mq_next_ctx(hctx, rq->mq_ctx); 267b347689fSMing Lei 2681fd40b5eSMing Lei } while (blk_mq_dispatch_rq_list(rq->mq_hctx, &rq_list, 1)); 269b347689fSMing Lei 270b347689fSMing Lei WRITE_ONCE(hctx->dispatch_from, ctx); 27128d65729SSalman Qazi return ret; 272b347689fSMing Lei } 273b347689fSMing Lei 274e1b586f2SZheng Bin static int __blk_mq_sched_dispatch_requests(struct blk_mq_hw_ctx *hctx) 275bd166ef1SJens Axboe { 27681380ca1SOmar Sandoval struct request_queue *q = hctx->queue; 27781380ca1SOmar Sandoval struct elevator_queue *e = q->elevator; 278f9cd4bfeSJens Axboe const bool has_sched_dispatch = e && e->type->ops.dispatch_request; 27928d65729SSalman Qazi int ret = 0; 280bd166ef1SJens Axboe LIST_HEAD(rq_list); 281bd166ef1SJens Axboe 282bd166ef1SJens Axboe /* 283bd166ef1SJens Axboe * If we have previous entries on our dispatch list, grab them first for 284bd166ef1SJens Axboe * more fair dispatch. 285bd166ef1SJens Axboe */ 286bd166ef1SJens Axboe if (!list_empty_careful(&hctx->dispatch)) { 287bd166ef1SJens Axboe spin_lock(&hctx->lock); 288bd166ef1SJens Axboe if (!list_empty(&hctx->dispatch)) 289bd166ef1SJens Axboe list_splice_init(&hctx->dispatch, &rq_list); 290bd166ef1SJens Axboe spin_unlock(&hctx->lock); 291bd166ef1SJens Axboe } 292bd166ef1SJens Axboe 293bd166ef1SJens Axboe /* 294bd166ef1SJens Axboe * Only ask the scheduler for requests, if we didn't have residual 295bd166ef1SJens Axboe * requests from the dispatch list. This is to avoid the case where 296bd166ef1SJens Axboe * we only ever dispatch a fraction of the requests available because 297bd166ef1SJens Axboe * of low device queue depth. Once we pull requests out of the IO 298bd166ef1SJens Axboe * scheduler, we can no longer merge or sort them. So it's best to 299bd166ef1SJens Axboe * leave them there for as long as we can. Mark the hw queue as 300bd166ef1SJens Axboe * needing a restart in that case. 301caf8eb0dSMing Lei * 3025e3d02bbSMing Lei * We want to dispatch from the scheduler if there was nothing 3035e3d02bbSMing Lei * on the dispatch list or we were able to dispatch from the 3045e3d02bbSMing Lei * dispatch list. 30564765a75SJens Axboe */ 306caf8eb0dSMing Lei if (!list_empty(&rq_list)) { 307caf8eb0dSMing Lei blk_mq_sched_mark_restart_hctx(hctx); 3081fd40b5eSMing Lei if (blk_mq_dispatch_rq_list(hctx, &rq_list, 0)) { 309b347689fSMing Lei if (has_sched_dispatch) 31028d65729SSalman Qazi ret = blk_mq_do_dispatch_sched(hctx); 311b347689fSMing Lei else 31228d65729SSalman Qazi ret = blk_mq_do_dispatch_ctx(hctx); 313b347689fSMing Lei } 314caf8eb0dSMing Lei } else if (has_sched_dispatch) { 31528d65729SSalman Qazi ret = blk_mq_do_dispatch_sched(hctx); 3166e768717SMing Lei } else if (hctx->dispatch_busy) { 3176e768717SMing Lei /* dequeue request one by one from sw queue if queue is busy */ 31828d65729SSalman Qazi ret = blk_mq_do_dispatch_ctx(hctx); 319caf8eb0dSMing Lei } else { 320caf8eb0dSMing Lei blk_mq_flush_busy_ctxs(hctx, &rq_list); 3211fd40b5eSMing Lei blk_mq_dispatch_rq_list(hctx, &rq_list, 0); 322c13660a0SJens Axboe } 32328d65729SSalman Qazi 32428d65729SSalman Qazi return ret; 32528d65729SSalman Qazi } 32628d65729SSalman Qazi 32728d65729SSalman Qazi void blk_mq_sched_dispatch_requests(struct blk_mq_hw_ctx *hctx) 32828d65729SSalman Qazi { 32928d65729SSalman Qazi struct request_queue *q = hctx->queue; 33028d65729SSalman Qazi 33128d65729SSalman Qazi /* RCU or SRCU read lock is needed before checking quiesced flag */ 33228d65729SSalman Qazi if (unlikely(blk_mq_hctx_stopped(hctx) || blk_queue_quiesced(q))) 33328d65729SSalman Qazi return; 33428d65729SSalman Qazi 33528d65729SSalman Qazi hctx->run++; 33628d65729SSalman Qazi 33728d65729SSalman Qazi /* 33828d65729SSalman Qazi * A return of -EAGAIN is an indication that hctx->dispatch is not 33928d65729SSalman Qazi * empty and we must run again in order to avoid starving flushes. 34028d65729SSalman Qazi */ 34128d65729SSalman Qazi if (__blk_mq_sched_dispatch_requests(hctx) == -EAGAIN) { 34228d65729SSalman Qazi if (__blk_mq_sched_dispatch_requests(hctx) == -EAGAIN) 34328d65729SSalman Qazi blk_mq_run_hw_queue(hctx, true); 34428d65729SSalman Qazi } 345bd166ef1SJens Axboe } 346bd166ef1SJens Axboe 34714ccb66bSChristoph Hellwig bool __blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio, 34814ccb66bSChristoph Hellwig unsigned int nr_segs) 349bd166ef1SJens Axboe { 350bd166ef1SJens Axboe struct elevator_queue *e = q->elevator; 351bd166ef1SJens Axboe struct blk_mq_ctx *ctx = blk_mq_get_ctx(q); 3528ccdf4a3SJianchao Wang struct blk_mq_hw_ctx *hctx = blk_mq_map_queue(q, bio->bi_opf, ctx); 3539bddeb2aSMing Lei bool ret = false; 354c16d6b5aSMing Lei enum hctx_type type; 355bd166ef1SJens Axboe 356c05f4220SBart Van Assche if (e && e->type->ops.bio_merge) 35714ccb66bSChristoph Hellwig return e->type->ops.bio_merge(hctx, bio, nr_segs); 358bd166ef1SJens Axboe 359c16d6b5aSMing Lei type = hctx->type; 360cdfcef9eSBaolin Wang if (!(hctx->flags & BLK_MQ_F_SHOULD_MERGE) || 361cdfcef9eSBaolin Wang list_empty_careful(&ctx->rq_lists[type])) 362cdfcef9eSBaolin Wang return false; 363cdfcef9eSBaolin Wang 3649bddeb2aSMing Lei /* default per sw-queue merge */ 3659bddeb2aSMing Lei spin_lock(&ctx->lock); 366cdfcef9eSBaolin Wang /* 367cdfcef9eSBaolin Wang * Reverse check our software queue for entries that we could 368cdfcef9eSBaolin Wang * potentially merge with. Currently includes a hand-wavy stop 369cdfcef9eSBaolin Wang * count of 8, to not spend too much time checking for merges. 370cdfcef9eSBaolin Wang */ 371cdfcef9eSBaolin Wang if (blk_bio_list_merge(q, &ctx->rq_lists[type], bio, nr_segs)) { 372cdfcef9eSBaolin Wang ctx->rq_merged++; 373cdfcef9eSBaolin Wang ret = true; 3749bddeb2aSMing Lei } 3759bddeb2aSMing Lei 376cdfcef9eSBaolin Wang spin_unlock(&ctx->lock); 377cdfcef9eSBaolin Wang 3789bddeb2aSMing Lei return ret; 379bd166ef1SJens Axboe } 380bd166ef1SJens Axboe 381bd166ef1SJens Axboe bool blk_mq_sched_try_insert_merge(struct request_queue *q, struct request *rq) 382bd166ef1SJens Axboe { 383bd166ef1SJens Axboe return rq_mergeable(rq) && elv_attempt_insert_merge(q, rq); 384bd166ef1SJens Axboe } 385bd166ef1SJens Axboe EXPORT_SYMBOL_GPL(blk_mq_sched_try_insert_merge); 386bd166ef1SJens Axboe 3870cacba6cSOmar Sandoval static bool blk_mq_sched_bypass_insert(struct blk_mq_hw_ctx *hctx, 3880cacba6cSOmar Sandoval struct request *rq) 389bd166ef1SJens Axboe { 39001e99aecSMing Lei /* 39101e99aecSMing Lei * dispatch flush and passthrough rq directly 39201e99aecSMing Lei * 39301e99aecSMing Lei * passthrough request has to be added to hctx->dispatch directly. 39401e99aecSMing Lei * For some reason, device may be in one situation which can't 39501e99aecSMing Lei * handle FS request, so STS_RESOURCE is always returned and the 39601e99aecSMing Lei * FS request will be added to hctx->dispatch. However passthrough 39701e99aecSMing Lei * request may be required at that time for fixing the problem. If 39801e99aecSMing Lei * passthrough request is added to scheduler queue, there isn't any 39901e99aecSMing Lei * chance to dispatch it given we prioritize requests in hctx->dispatch. 40001e99aecSMing Lei */ 40101e99aecSMing Lei if ((rq->rq_flags & RQF_FLUSH_SEQ) || blk_rq_is_passthrough(rq)) 402bd166ef1SJens Axboe return true; 403bd166ef1SJens Axboe 404a6a252e6SMing Lei return false; 405a6a252e6SMing Lei } 406a6a252e6SMing Lei 407bd6737f1SJens Axboe void blk_mq_sched_insert_request(struct request *rq, bool at_head, 4089e97d295SMike Snitzer bool run_queue, bool async) 409bd6737f1SJens Axboe { 410bd6737f1SJens Axboe struct request_queue *q = rq->q; 411bd6737f1SJens Axboe struct elevator_queue *e = q->elevator; 412bd6737f1SJens Axboe struct blk_mq_ctx *ctx = rq->mq_ctx; 413ea4f995eSJens Axboe struct blk_mq_hw_ctx *hctx = rq->mq_hctx; 414bd6737f1SJens Axboe 415e44a6a23SXianting Tian WARN_ON(e && (rq->tag != BLK_MQ_NO_TAG)); 416923218f6SMing Lei 417*5218e12eSJean Delvare if (blk_mq_sched_bypass_insert(hctx, rq)) { 418cc3200eaSMing Lei /* 419cc3200eaSMing Lei * Firstly normal IO request is inserted to scheduler queue or 420cc3200eaSMing Lei * sw queue, meantime we add flush request to dispatch queue( 421cc3200eaSMing Lei * hctx->dispatch) directly and there is at most one in-flight 422cc3200eaSMing Lei * flush request for each hw queue, so it doesn't matter to add 423cc3200eaSMing Lei * flush request to tail or front of the dispatch queue. 424cc3200eaSMing Lei * 425cc3200eaSMing Lei * Secondly in case of NCQ, flush request belongs to non-NCQ 426cc3200eaSMing Lei * command, and queueing it will fail when there is any 427cc3200eaSMing Lei * in-flight normal IO request(NCQ command). When adding flush 428cc3200eaSMing Lei * rq to the front of hctx->dispatch, it is easier to introduce 429cc3200eaSMing Lei * extra time to flush rq's latency because of S_SCHED_RESTART 430cc3200eaSMing Lei * compared with adding to the tail of dispatch queue, then 431cc3200eaSMing Lei * chance of flush merge is increased, and less flush requests 432cc3200eaSMing Lei * will be issued to controller. It is observed that ~10% time 433cc3200eaSMing Lei * is saved in blktests block/004 on disk attached to AHCI/NCQ 434cc3200eaSMing Lei * drive when adding flush rq to the front of hctx->dispatch. 435cc3200eaSMing Lei * 436cc3200eaSMing Lei * Simply queue flush rq to the front of hctx->dispatch so that 437cc3200eaSMing Lei * intensive flush workloads can benefit in case of NCQ HW. 438cc3200eaSMing Lei */ 439cc3200eaSMing Lei at_head = (rq->rq_flags & RQF_FLUSH_SEQ) ? true : at_head; 44001e99aecSMing Lei blk_mq_request_bypass_insert(rq, at_head, false); 4410cacba6cSOmar Sandoval goto run; 44201e99aecSMing Lei } 4430cacba6cSOmar Sandoval 444f9cd4bfeSJens Axboe if (e && e->type->ops.insert_requests) { 445bd6737f1SJens Axboe LIST_HEAD(list); 446bd6737f1SJens Axboe 447bd6737f1SJens Axboe list_add(&rq->queuelist, &list); 448f9cd4bfeSJens Axboe e->type->ops.insert_requests(hctx, &list, at_head); 449bd6737f1SJens Axboe } else { 450bd6737f1SJens Axboe spin_lock(&ctx->lock); 451bd6737f1SJens Axboe __blk_mq_insert_request(hctx, rq, at_head); 452bd6737f1SJens Axboe spin_unlock(&ctx->lock); 453bd6737f1SJens Axboe } 454bd6737f1SJens Axboe 4550cacba6cSOmar Sandoval run: 456bd6737f1SJens Axboe if (run_queue) 457bd6737f1SJens Axboe blk_mq_run_hw_queue(hctx, async); 458bd6737f1SJens Axboe } 459bd6737f1SJens Axboe 46067cae4c9SJens Axboe void blk_mq_sched_insert_requests(struct blk_mq_hw_ctx *hctx, 461bd6737f1SJens Axboe struct blk_mq_ctx *ctx, 462bd6737f1SJens Axboe struct list_head *list, bool run_queue_async) 463bd6737f1SJens Axboe { 464f9afca4dSJens Axboe struct elevator_queue *e; 465e87eb301SMing Lei struct request_queue *q = hctx->queue; 466e87eb301SMing Lei 467e87eb301SMing Lei /* 468e87eb301SMing Lei * blk_mq_sched_insert_requests() is called from flush plug 469e87eb301SMing Lei * context only, and hold one usage counter to prevent queue 470e87eb301SMing Lei * from being released. 471e87eb301SMing Lei */ 472e87eb301SMing Lei percpu_ref_get(&q->q_usage_counter); 473f9afca4dSJens Axboe 474f9afca4dSJens Axboe e = hctx->queue->elevator; 475f9cd4bfeSJens Axboe if (e && e->type->ops.insert_requests) 476f9cd4bfeSJens Axboe e->type->ops.insert_requests(hctx, list, false); 4776ce3dd6eSMing Lei else { 4786ce3dd6eSMing Lei /* 4796ce3dd6eSMing Lei * try to issue requests directly if the hw queue isn't 4806ce3dd6eSMing Lei * busy in case of 'none' scheduler, and this way may save 4816ce3dd6eSMing Lei * us one extra enqueue & dequeue to sw queue. 4826ce3dd6eSMing Lei */ 483fd9c40f6SBart Van Assche if (!hctx->dispatch_busy && !e && !run_queue_async) { 4846ce3dd6eSMing Lei blk_mq_try_issue_list_directly(hctx, list); 485fd9c40f6SBart Van Assche if (list_empty(list)) 486e87eb301SMing Lei goto out; 487fd9c40f6SBart Van Assche } 488bd6737f1SJens Axboe blk_mq_insert_requests(hctx, ctx, list); 4896ce3dd6eSMing Lei } 490bd6737f1SJens Axboe 491bd6737f1SJens Axboe blk_mq_run_hw_queue(hctx, run_queue_async); 492e87eb301SMing Lei out: 493e87eb301SMing Lei percpu_ref_put(&q->q_usage_counter); 494bd6737f1SJens Axboe } 495bd6737f1SJens Axboe 496bd166ef1SJens Axboe static void blk_mq_sched_free_tags(struct blk_mq_tag_set *set, 497bd166ef1SJens Axboe struct blk_mq_hw_ctx *hctx, 498bd166ef1SJens Axboe unsigned int hctx_idx) 499bd166ef1SJens Axboe { 50032bc15afSJohn Garry unsigned int flags = set->flags & ~BLK_MQ_F_TAG_HCTX_SHARED; 5011c0706a7SJohn Garry 502bd166ef1SJens Axboe if (hctx->sched_tags) { 503bd166ef1SJens Axboe blk_mq_free_rqs(set, hctx->sched_tags, hctx_idx); 5041c0706a7SJohn Garry blk_mq_free_rq_map(hctx->sched_tags, flags); 505bd166ef1SJens Axboe hctx->sched_tags = NULL; 506bd166ef1SJens Axboe } 507bd166ef1SJens Axboe } 508bd166ef1SJens Axboe 5096917ff0bSOmar Sandoval static int blk_mq_sched_alloc_tags(struct request_queue *q, 5106917ff0bSOmar Sandoval struct blk_mq_hw_ctx *hctx, 5116917ff0bSOmar Sandoval unsigned int hctx_idx) 512bd166ef1SJens Axboe { 513bd166ef1SJens Axboe struct blk_mq_tag_set *set = q->tag_set; 51432bc15afSJohn Garry /* Clear HCTX_SHARED so tags are init'ed */ 51532bc15afSJohn Garry unsigned int flags = set->flags & ~BLK_MQ_F_TAG_HCTX_SHARED; 5166917ff0bSOmar Sandoval int ret; 517bd166ef1SJens Axboe 5186917ff0bSOmar Sandoval hctx->sched_tags = blk_mq_alloc_rq_map(set, hctx_idx, q->nr_requests, 5191c0706a7SJohn Garry set->reserved_tags, flags); 520bd166ef1SJens Axboe if (!hctx->sched_tags) 5216917ff0bSOmar Sandoval return -ENOMEM; 5226917ff0bSOmar Sandoval 5236917ff0bSOmar Sandoval ret = blk_mq_alloc_rqs(set, hctx->sched_tags, hctx_idx, q->nr_requests); 5246917ff0bSOmar Sandoval if (ret) 5256917ff0bSOmar Sandoval blk_mq_sched_free_tags(set, hctx, hctx_idx); 526bd166ef1SJens Axboe 527bd166ef1SJens Axboe return ret; 528bd166ef1SJens Axboe } 529bd166ef1SJens Axboe 530c3e22192SMing Lei /* called in queue's release handler, tagset has gone away */ 53154d5329dSOmar Sandoval static void blk_mq_sched_tags_teardown(struct request_queue *q) 532bd166ef1SJens Axboe { 533bd166ef1SJens Axboe struct blk_mq_hw_ctx *hctx; 534bd166ef1SJens Axboe int i; 535bd166ef1SJens Axboe 536c3e22192SMing Lei queue_for_each_hw_ctx(q, hctx, i) { 53732bc15afSJohn Garry /* Clear HCTX_SHARED so tags are freed */ 53832bc15afSJohn Garry unsigned int flags = hctx->flags & ~BLK_MQ_F_TAG_HCTX_SHARED; 5391c0706a7SJohn Garry 540c3e22192SMing Lei if (hctx->sched_tags) { 5411c0706a7SJohn Garry blk_mq_free_rq_map(hctx->sched_tags, flags); 542c3e22192SMing Lei hctx->sched_tags = NULL; 543c3e22192SMing Lei } 544c3e22192SMing Lei } 545bd166ef1SJens Axboe } 546d3484991SJens Axboe 5476917ff0bSOmar Sandoval int blk_mq_init_sched(struct request_queue *q, struct elevator_type *e) 5486917ff0bSOmar Sandoval { 5496917ff0bSOmar Sandoval struct blk_mq_hw_ctx *hctx; 550ee056f98SOmar Sandoval struct elevator_queue *eq; 5516917ff0bSOmar Sandoval unsigned int i; 5526917ff0bSOmar Sandoval int ret; 5536917ff0bSOmar Sandoval 5546917ff0bSOmar Sandoval if (!e) { 5556917ff0bSOmar Sandoval q->elevator = NULL; 55632a50fabSMing Lei q->nr_requests = q->tag_set->queue_depth; 5576917ff0bSOmar Sandoval return 0; 5586917ff0bSOmar Sandoval } 5596917ff0bSOmar Sandoval 5606917ff0bSOmar Sandoval /* 56132825c45SMing Lei * Default to double of smaller one between hw queue_depth and 128, 56232825c45SMing Lei * since we don't split into sync/async like the old code did. 56332825c45SMing Lei * Additionally, this is a per-hw queue depth. 5646917ff0bSOmar Sandoval */ 56532825c45SMing Lei q->nr_requests = 2 * min_t(unsigned int, q->tag_set->queue_depth, 56632825c45SMing Lei BLKDEV_MAX_RQ); 5676917ff0bSOmar Sandoval 5686917ff0bSOmar Sandoval queue_for_each_hw_ctx(q, hctx, i) { 5696917ff0bSOmar Sandoval ret = blk_mq_sched_alloc_tags(q, hctx, i); 5706917ff0bSOmar Sandoval if (ret) 5716917ff0bSOmar Sandoval goto err; 5726917ff0bSOmar Sandoval } 5736917ff0bSOmar Sandoval 574f9cd4bfeSJens Axboe ret = e->ops.init_sched(q, e); 5756917ff0bSOmar Sandoval if (ret) 5766917ff0bSOmar Sandoval goto err; 5776917ff0bSOmar Sandoval 578d332ce09SOmar Sandoval blk_mq_debugfs_register_sched(q); 579d332ce09SOmar Sandoval 580ee056f98SOmar Sandoval queue_for_each_hw_ctx(q, hctx, i) { 581f9cd4bfeSJens Axboe if (e->ops.init_hctx) { 582f9cd4bfeSJens Axboe ret = e->ops.init_hctx(hctx, i); 583ee056f98SOmar Sandoval if (ret) { 584ee056f98SOmar Sandoval eq = q->elevator; 585c3e22192SMing Lei blk_mq_sched_free_requests(q); 586ee056f98SOmar Sandoval blk_mq_exit_sched(q, eq); 587ee056f98SOmar Sandoval kobject_put(&eq->kobj); 588ee056f98SOmar Sandoval return ret; 589ee056f98SOmar Sandoval } 590ee056f98SOmar Sandoval } 591d332ce09SOmar Sandoval blk_mq_debugfs_register_sched_hctx(q, hctx); 592ee056f98SOmar Sandoval } 593ee056f98SOmar Sandoval 5946917ff0bSOmar Sandoval return 0; 5956917ff0bSOmar Sandoval 5966917ff0bSOmar Sandoval err: 597c3e22192SMing Lei blk_mq_sched_free_requests(q); 59854d5329dSOmar Sandoval blk_mq_sched_tags_teardown(q); 59954d5329dSOmar Sandoval q->elevator = NULL; 6006917ff0bSOmar Sandoval return ret; 6016917ff0bSOmar Sandoval } 6026917ff0bSOmar Sandoval 603c3e22192SMing Lei /* 604c3e22192SMing Lei * called in either blk_queue_cleanup or elevator_switch, tagset 605c3e22192SMing Lei * is required for freeing requests 606c3e22192SMing Lei */ 607c3e22192SMing Lei void blk_mq_sched_free_requests(struct request_queue *q) 608c3e22192SMing Lei { 609c3e22192SMing Lei struct blk_mq_hw_ctx *hctx; 610c3e22192SMing Lei int i; 611c3e22192SMing Lei 612c3e22192SMing Lei queue_for_each_hw_ctx(q, hctx, i) { 613c3e22192SMing Lei if (hctx->sched_tags) 614c3e22192SMing Lei blk_mq_free_rqs(q->tag_set, hctx->sched_tags, i); 615c3e22192SMing Lei } 616c3e22192SMing Lei } 617c3e22192SMing Lei 61854d5329dSOmar Sandoval void blk_mq_exit_sched(struct request_queue *q, struct elevator_queue *e) 61954d5329dSOmar Sandoval { 620ee056f98SOmar Sandoval struct blk_mq_hw_ctx *hctx; 621ee056f98SOmar Sandoval unsigned int i; 622ee056f98SOmar Sandoval 623ee056f98SOmar Sandoval queue_for_each_hw_ctx(q, hctx, i) { 624d332ce09SOmar Sandoval blk_mq_debugfs_unregister_sched_hctx(hctx); 625f9cd4bfeSJens Axboe if (e->type->ops.exit_hctx && hctx->sched_data) { 626f9cd4bfeSJens Axboe e->type->ops.exit_hctx(hctx, i); 627ee056f98SOmar Sandoval hctx->sched_data = NULL; 628ee056f98SOmar Sandoval } 629ee056f98SOmar Sandoval } 630d332ce09SOmar Sandoval blk_mq_debugfs_unregister_sched(q); 631f9cd4bfeSJens Axboe if (e->type->ops.exit_sched) 632f9cd4bfeSJens Axboe e->type->ops.exit_sched(e); 63354d5329dSOmar Sandoval blk_mq_sched_tags_teardown(q); 63454d5329dSOmar Sandoval q->elevator = NULL; 63554d5329dSOmar Sandoval } 636