1 // SPDX-License-Identifier: GPL-2.0
3 * Block multiqueue core code
5 * Copyright (C) 2013-2014 Jens Axboe
6 * Copyright (C) 2013-2014 Christoph Hellwig
8 #include <linux/kernel.h>
9 #include <linux/module.h>
10 #include <linux/backing-dev.h>
11 #include <linux/bio.h>
12 #include <linux/blkdev.h>
13 #include <linux/blk-integrity.h>
14 #include <linux/kmemleak.h>
16 #include <linux/init.h>
17 #include <linux/slab.h>
18 #include <linux/workqueue.h>
19 #include <linux/smp.h>
20 #include <linux/interrupt.h>
21 #include <linux/llist.h>
22 #include <linux/cpu.h>
23 #include <linux/cache.h>
24 #include <linux/sched/sysctl.h>
25 #include <linux/sched/topology.h>
26 #include <linux/sched/signal.h>
27 #include <linux/delay.h>
28 #include <linux/crash_dump.h>
29 #include <linux/prefetch.h>
30 #include <linux/blk-crypto.h>
31 #include <linux/part_stat.h>
33 #include <trace/events/block.h>
35 #include <linux/t10-pi.h>
38 #include "blk-mq-debugfs.h"
41 #include "blk-mq-sched.h"
42 #include "blk-rq-qos.h"
43 #include "blk-ioprio.h"
45 static DEFINE_PER_CPU(struct llist_head, blk_cpu_done);
47 static void blk_mq_insert_request(struct request *rq, blk_insert_t flags);
48 static void blk_mq_request_bypass_insert(struct request *rq,
50 static void blk_mq_try_issue_list_directly(struct blk_mq_hw_ctx *hctx,
51 struct list_head *list);
53 static inline struct blk_mq_hw_ctx *blk_qc_to_hctx(struct request_queue *q,
56 return xa_load(&q->hctx_table, qc);
59 static inline blk_qc_t blk_rq_to_qc(struct request *rq)
61 return rq->mq_hctx->queue_num;
65 * Check if any of the ctx, dispatch list or elevator
66 * have pending work in this hardware queue.
68 static bool blk_mq_hctx_has_pending(struct blk_mq_hw_ctx *hctx)
70 return !list_empty_careful(&hctx->dispatch) ||
71 sbitmap_any_bit_set(&hctx->ctx_map) ||
72 blk_mq_sched_has_work(hctx);
76 * Mark this ctx as having pending work in this hardware queue
78 static void blk_mq_hctx_mark_pending(struct blk_mq_hw_ctx *hctx,
79 struct blk_mq_ctx *ctx)
81 const int bit = ctx->index_hw[hctx->type];
83 if (!sbitmap_test_bit(&hctx->ctx_map, bit))
84 sbitmap_set_bit(&hctx->ctx_map, bit);
87 static void blk_mq_hctx_clear_pending(struct blk_mq_hw_ctx *hctx,
88 struct blk_mq_ctx *ctx)
90 const int bit = ctx->index_hw[hctx->type];
92 sbitmap_clear_bit(&hctx->ctx_map, bit);
96 struct block_device *part;
97 unsigned int inflight[2];
100 static bool blk_mq_check_inflight(struct request *rq, void *priv)
102 struct mq_inflight *mi = priv;
104 if (rq->part && blk_do_io_stat(rq) &&
105 (!mi->part->bd_partno || rq->part == mi->part) &&
106 blk_mq_rq_state(rq) == MQ_RQ_IN_FLIGHT)
107 mi->inflight[rq_data_dir(rq)]++;
112 unsigned int blk_mq_in_flight(struct request_queue *q,
113 struct block_device *part)
115 struct mq_inflight mi = { .part = part };
117 blk_mq_queue_tag_busy_iter(q, blk_mq_check_inflight, &mi);
119 return mi.inflight[0] + mi.inflight[1];
122 void blk_mq_in_flight_rw(struct request_queue *q, struct block_device *part,
123 unsigned int inflight[2])
125 struct mq_inflight mi = { .part = part };
127 blk_mq_queue_tag_busy_iter(q, blk_mq_check_inflight, &mi);
128 inflight[0] = mi.inflight[0];
129 inflight[1] = mi.inflight[1];
132 void blk_freeze_queue_start(struct request_queue *q)
134 mutex_lock(&q->mq_freeze_lock);
135 if (++q->mq_freeze_depth == 1) {
136 percpu_ref_kill(&q->q_usage_counter);
137 mutex_unlock(&q->mq_freeze_lock);
139 blk_mq_run_hw_queues(q, false);
141 mutex_unlock(&q->mq_freeze_lock);
144 EXPORT_SYMBOL_GPL(blk_freeze_queue_start);
146 void blk_mq_freeze_queue_wait(struct request_queue *q)
148 wait_event(q->mq_freeze_wq, percpu_ref_is_zero(&q->q_usage_counter));
150 EXPORT_SYMBOL_GPL(blk_mq_freeze_queue_wait);
152 int blk_mq_freeze_queue_wait_timeout(struct request_queue *q,
153 unsigned long timeout)
155 return wait_event_timeout(q->mq_freeze_wq,
156 percpu_ref_is_zero(&q->q_usage_counter),
159 EXPORT_SYMBOL_GPL(blk_mq_freeze_queue_wait_timeout);
162 * Guarantee no request is in use, so we can change any data structure of
163 * the queue afterward.
165 void blk_freeze_queue(struct request_queue *q)
168 * In the !blk_mq case we are only calling this to kill the
169 * q_usage_counter, otherwise this increases the freeze depth
170 * and waits for it to return to zero. For this reason there is
171 * no blk_unfreeze_queue(), and blk_freeze_queue() is not
172 * exported to drivers as the only user for unfreeze is blk_mq.
174 blk_freeze_queue_start(q);
175 blk_mq_freeze_queue_wait(q);
178 void blk_mq_freeze_queue(struct request_queue *q)
181 * ...just an alias to keep freeze and unfreeze actions balanced
182 * in the blk_mq_* namespace
186 EXPORT_SYMBOL_GPL(blk_mq_freeze_queue);
188 void __blk_mq_unfreeze_queue(struct request_queue *q, bool force_atomic)
190 mutex_lock(&q->mq_freeze_lock);
192 q->q_usage_counter.data->force_atomic = true;
193 q->mq_freeze_depth--;
194 WARN_ON_ONCE(q->mq_freeze_depth < 0);
195 if (!q->mq_freeze_depth) {
196 percpu_ref_resurrect(&q->q_usage_counter);
197 wake_up_all(&q->mq_freeze_wq);
199 mutex_unlock(&q->mq_freeze_lock);
202 void blk_mq_unfreeze_queue(struct request_queue *q)
204 __blk_mq_unfreeze_queue(q, false);
206 EXPORT_SYMBOL_GPL(blk_mq_unfreeze_queue);
209 * FIXME: replace the scsi_internal_device_*block_nowait() calls in the
210 * mpt3sas driver such that this function can be removed.
212 void blk_mq_quiesce_queue_nowait(struct request_queue *q)
216 spin_lock_irqsave(&q->queue_lock, flags);
217 if (!q->quiesce_depth++)
218 blk_queue_flag_set(QUEUE_FLAG_QUIESCED, q);
219 spin_unlock_irqrestore(&q->queue_lock, flags);
221 EXPORT_SYMBOL_GPL(blk_mq_quiesce_queue_nowait);
224 * blk_mq_wait_quiesce_done() - wait until in-progress quiesce is done
225 * @set: tag_set to wait on
227 * Note: it is driver's responsibility for making sure that quiesce has
228 * been started on or more of the request_queues of the tag_set. This
229 * function only waits for the quiesce on those request_queues that had
230 * the quiesce flag set using blk_mq_quiesce_queue_nowait.
232 void blk_mq_wait_quiesce_done(struct blk_mq_tag_set *set)
234 if (set->flags & BLK_MQ_F_BLOCKING)
235 synchronize_srcu(set->srcu);
239 EXPORT_SYMBOL_GPL(blk_mq_wait_quiesce_done);
242 * blk_mq_quiesce_queue() - wait until all ongoing dispatches have finished
245 * Note: this function does not prevent that the struct request end_io()
246 * callback function is invoked. Once this function is returned, we make
247 * sure no dispatch can happen until the queue is unquiesced via
248 * blk_mq_unquiesce_queue().
250 void blk_mq_quiesce_queue(struct request_queue *q)
252 blk_mq_quiesce_queue_nowait(q);
253 /* nothing to wait for non-mq queues */
255 blk_mq_wait_quiesce_done(q->tag_set);
257 EXPORT_SYMBOL_GPL(blk_mq_quiesce_queue);
260 * blk_mq_unquiesce_queue() - counterpart of blk_mq_quiesce_queue()
263 * This function recovers queue into the state before quiescing
264 * which is done by blk_mq_quiesce_queue.
266 void blk_mq_unquiesce_queue(struct request_queue *q)
269 bool run_queue = false;
271 spin_lock_irqsave(&q->queue_lock, flags);
272 if (WARN_ON_ONCE(q->quiesce_depth <= 0)) {
274 } else if (!--q->quiesce_depth) {
275 blk_queue_flag_clear(QUEUE_FLAG_QUIESCED, q);
278 spin_unlock_irqrestore(&q->queue_lock, flags);
280 /* dispatch requests which are inserted during quiescing */
282 blk_mq_run_hw_queues(q, true);
284 EXPORT_SYMBOL_GPL(blk_mq_unquiesce_queue);
286 void blk_mq_quiesce_tagset(struct blk_mq_tag_set *set)
288 struct request_queue *q;
290 mutex_lock(&set->tag_list_lock);
291 list_for_each_entry(q, &set->tag_list, tag_set_list) {
292 if (!blk_queue_skip_tagset_quiesce(q))
293 blk_mq_quiesce_queue_nowait(q);
295 blk_mq_wait_quiesce_done(set);
296 mutex_unlock(&set->tag_list_lock);
298 EXPORT_SYMBOL_GPL(blk_mq_quiesce_tagset);
300 void blk_mq_unquiesce_tagset(struct blk_mq_tag_set *set)
302 struct request_queue *q;
304 mutex_lock(&set->tag_list_lock);
305 list_for_each_entry(q, &set->tag_list, tag_set_list) {
306 if (!blk_queue_skip_tagset_quiesce(q))
307 blk_mq_unquiesce_queue(q);
309 mutex_unlock(&set->tag_list_lock);
311 EXPORT_SYMBOL_GPL(blk_mq_unquiesce_tagset);
313 void blk_mq_wake_waiters(struct request_queue *q)
315 struct blk_mq_hw_ctx *hctx;
318 queue_for_each_hw_ctx(q, hctx, i)
319 if (blk_mq_hw_queue_mapped(hctx))
320 blk_mq_tag_wakeup_all(hctx->tags, true);
323 void blk_rq_init(struct request_queue *q, struct request *rq)
325 memset(rq, 0, sizeof(*rq));
327 INIT_LIST_HEAD(&rq->queuelist);
329 rq->__sector = (sector_t) -1;
330 INIT_HLIST_NODE(&rq->hash);
331 RB_CLEAR_NODE(&rq->rb_node);
332 rq->tag = BLK_MQ_NO_TAG;
333 rq->internal_tag = BLK_MQ_NO_TAG;
334 rq->start_time_ns = ktime_get_ns();
336 blk_crypto_rq_set_defaults(rq);
338 EXPORT_SYMBOL(blk_rq_init);
340 static struct request *blk_mq_rq_ctx_init(struct blk_mq_alloc_data *data,
341 struct blk_mq_tags *tags, unsigned int tag, u64 alloc_time_ns)
343 struct blk_mq_ctx *ctx = data->ctx;
344 struct blk_mq_hw_ctx *hctx = data->hctx;
345 struct request_queue *q = data->q;
346 struct request *rq = tags->static_rqs[tag];
351 rq->cmd_flags = data->cmd_flags;
353 if (data->flags & BLK_MQ_REQ_PM)
354 data->rq_flags |= RQF_PM;
355 if (blk_queue_io_stat(q))
356 data->rq_flags |= RQF_IO_STAT;
357 rq->rq_flags = data->rq_flags;
359 if (data->rq_flags & RQF_SCHED_TAGS) {
360 rq->tag = BLK_MQ_NO_TAG;
361 rq->internal_tag = tag;
364 rq->internal_tag = BLK_MQ_NO_TAG;
368 if (blk_mq_need_time_stamp(rq))
369 rq->start_time_ns = ktime_get_ns();
371 rq->start_time_ns = 0;
373 #ifdef CONFIG_BLK_RQ_ALLOC_TIME
374 rq->alloc_time_ns = alloc_time_ns;
376 rq->io_start_time_ns = 0;
377 rq->stats_sectors = 0;
378 rq->nr_phys_segments = 0;
379 #if defined(CONFIG_BLK_DEV_INTEGRITY)
380 rq->nr_integrity_segments = 0;
383 rq->end_io_data = NULL;
385 blk_crypto_rq_set_defaults(rq);
386 INIT_LIST_HEAD(&rq->queuelist);
387 /* tag was already set */
388 WRITE_ONCE(rq->deadline, 0);
391 if (rq->rq_flags & RQF_USE_SCHED) {
392 struct elevator_queue *e = data->q->elevator;
394 INIT_HLIST_NODE(&rq->hash);
395 RB_CLEAR_NODE(&rq->rb_node);
397 if (e->type->ops.prepare_request)
398 e->type->ops.prepare_request(rq);
404 static inline struct request *
405 __blk_mq_alloc_requests_batch(struct blk_mq_alloc_data *data,
408 unsigned int tag, tag_offset;
409 struct blk_mq_tags *tags;
411 unsigned long tag_mask;
414 tag_mask = blk_mq_get_tags(data, data->nr_tags, &tag_offset);
415 if (unlikely(!tag_mask))
418 tags = blk_mq_tags_from_data(data);
419 for (i = 0; tag_mask; i++) {
420 if (!(tag_mask & (1UL << i)))
422 tag = tag_offset + i;
423 prefetch(tags->static_rqs[tag]);
424 tag_mask &= ~(1UL << i);
425 rq = blk_mq_rq_ctx_init(data, tags, tag, alloc_time_ns);
426 rq_list_add(data->cached_rq, rq);
429 /* caller already holds a reference, add for remainder */
430 percpu_ref_get_many(&data->q->q_usage_counter, nr - 1);
433 return rq_list_pop(data->cached_rq);
436 static struct request *__blk_mq_alloc_requests(struct blk_mq_alloc_data *data)
438 struct request_queue *q = data->q;
439 u64 alloc_time_ns = 0;
443 /* alloc_time includes depth and tag waits */
444 if (blk_queue_rq_alloc_time(q))
445 alloc_time_ns = ktime_get_ns();
447 if (data->cmd_flags & REQ_NOWAIT)
448 data->flags |= BLK_MQ_REQ_NOWAIT;
452 * All requests use scheduler tags when an I/O scheduler is
453 * enabled for the queue.
455 data->rq_flags |= RQF_SCHED_TAGS;
458 * Flush/passthrough requests are special and go directly to the
461 if ((data->cmd_flags & REQ_OP_MASK) != REQ_OP_FLUSH &&
462 !blk_op_is_passthrough(data->cmd_flags)) {
463 struct elevator_mq_ops *ops = &q->elevator->type->ops;
465 WARN_ON_ONCE(data->flags & BLK_MQ_REQ_RESERVED);
467 data->rq_flags |= RQF_USE_SCHED;
468 if (ops->limit_depth)
469 ops->limit_depth(data->cmd_flags, data);
474 data->ctx = blk_mq_get_ctx(q);
475 data->hctx = blk_mq_map_queue(q, data->cmd_flags, data->ctx);
476 if (!(data->rq_flags & RQF_SCHED_TAGS))
477 blk_mq_tag_busy(data->hctx);
479 if (data->flags & BLK_MQ_REQ_RESERVED)
480 data->rq_flags |= RQF_RESV;
483 * Try batched alloc if we want more than 1 tag.
485 if (data->nr_tags > 1) {
486 rq = __blk_mq_alloc_requests_batch(data, alloc_time_ns);
493 * Waiting allocations only fail because of an inactive hctx. In that
494 * case just retry the hctx assignment and tag allocation as CPU hotplug
495 * should have migrated us to an online CPU by now.
497 tag = blk_mq_get_tag(data);
498 if (tag == BLK_MQ_NO_TAG) {
499 if (data->flags & BLK_MQ_REQ_NOWAIT)
502 * Give up the CPU and sleep for a random short time to
503 * ensure that thread using a realtime scheduling class
504 * are migrated off the CPU, and thus off the hctx that
511 return blk_mq_rq_ctx_init(data, blk_mq_tags_from_data(data), tag,
515 static struct request *blk_mq_rq_cache_fill(struct request_queue *q,
516 struct blk_plug *plug,
518 blk_mq_req_flags_t flags)
520 struct blk_mq_alloc_data data = {
524 .nr_tags = plug->nr_ios,
525 .cached_rq = &plug->cached_rq,
529 if (blk_queue_enter(q, flags))
534 rq = __blk_mq_alloc_requests(&data);
540 static struct request *blk_mq_alloc_cached_request(struct request_queue *q,
542 blk_mq_req_flags_t flags)
544 struct blk_plug *plug = current->plug;
550 if (rq_list_empty(plug->cached_rq)) {
551 if (plug->nr_ios == 1)
553 rq = blk_mq_rq_cache_fill(q, plug, opf, flags);
557 rq = rq_list_peek(&plug->cached_rq);
558 if (!rq || rq->q != q)
561 if (blk_mq_get_hctx_type(opf) != rq->mq_hctx->type)
563 if (op_is_flush(rq->cmd_flags) != op_is_flush(opf))
566 plug->cached_rq = rq_list_next(rq);
570 INIT_LIST_HEAD(&rq->queuelist);
574 struct request *blk_mq_alloc_request(struct request_queue *q, blk_opf_t opf,
575 blk_mq_req_flags_t flags)
579 rq = blk_mq_alloc_cached_request(q, opf, flags);
581 struct blk_mq_alloc_data data = {
589 ret = blk_queue_enter(q, flags);
593 rq = __blk_mq_alloc_requests(&data);
598 rq->__sector = (sector_t) -1;
599 rq->bio = rq->biotail = NULL;
603 return ERR_PTR(-EWOULDBLOCK);
605 EXPORT_SYMBOL(blk_mq_alloc_request);
607 struct request *blk_mq_alloc_request_hctx(struct request_queue *q,
608 blk_opf_t opf, blk_mq_req_flags_t flags, unsigned int hctx_idx)
610 struct blk_mq_alloc_data data = {
616 u64 alloc_time_ns = 0;
622 /* alloc_time includes depth and tag waits */
623 if (blk_queue_rq_alloc_time(q))
624 alloc_time_ns = ktime_get_ns();
627 * If the tag allocator sleeps we could get an allocation for a
628 * different hardware context. No need to complicate the low level
629 * allocator for this for the rare use case of a command tied to
632 if (WARN_ON_ONCE(!(flags & BLK_MQ_REQ_NOWAIT)) ||
633 WARN_ON_ONCE(!(flags & BLK_MQ_REQ_RESERVED)))
634 return ERR_PTR(-EINVAL);
636 if (hctx_idx >= q->nr_hw_queues)
637 return ERR_PTR(-EIO);
639 ret = blk_queue_enter(q, flags);
644 * Check if the hardware context is actually mapped to anything.
645 * If not tell the caller that it should skip this queue.
648 data.hctx = xa_load(&q->hctx_table, hctx_idx);
649 if (!blk_mq_hw_queue_mapped(data.hctx))
651 cpu = cpumask_first_and(data.hctx->cpumask, cpu_online_mask);
652 if (cpu >= nr_cpu_ids)
654 data.ctx = __blk_mq_get_ctx(q, cpu);
657 data.rq_flags |= RQF_SCHED_TAGS;
659 blk_mq_tag_busy(data.hctx);
661 if (flags & BLK_MQ_REQ_RESERVED)
662 data.rq_flags |= RQF_RESV;
665 tag = blk_mq_get_tag(&data);
666 if (tag == BLK_MQ_NO_TAG)
668 rq = blk_mq_rq_ctx_init(&data, blk_mq_tags_from_data(&data), tag,
671 rq->__sector = (sector_t) -1;
672 rq->bio = rq->biotail = NULL;
679 EXPORT_SYMBOL_GPL(blk_mq_alloc_request_hctx);
681 static void __blk_mq_free_request(struct request *rq)
683 struct request_queue *q = rq->q;
684 struct blk_mq_ctx *ctx = rq->mq_ctx;
685 struct blk_mq_hw_ctx *hctx = rq->mq_hctx;
686 const int sched_tag = rq->internal_tag;
688 blk_crypto_free_request(rq);
689 blk_pm_mark_last_busy(rq);
692 if (rq->rq_flags & RQF_MQ_INFLIGHT)
693 __blk_mq_dec_active_requests(hctx);
695 if (rq->tag != BLK_MQ_NO_TAG)
696 blk_mq_put_tag(hctx->tags, ctx, rq->tag);
697 if (sched_tag != BLK_MQ_NO_TAG)
698 blk_mq_put_tag(hctx->sched_tags, ctx, sched_tag);
699 blk_mq_sched_restart(hctx);
703 void blk_mq_free_request(struct request *rq)
705 struct request_queue *q = rq->q;
707 if ((rq->rq_flags & RQF_USE_SCHED) &&
708 q->elevator->type->ops.finish_request)
709 q->elevator->type->ops.finish_request(rq);
711 if (unlikely(laptop_mode && !blk_rq_is_passthrough(rq)))
712 laptop_io_completion(q->disk->bdi);
716 WRITE_ONCE(rq->state, MQ_RQ_IDLE);
717 if (req_ref_put_and_test(rq))
718 __blk_mq_free_request(rq);
720 EXPORT_SYMBOL_GPL(blk_mq_free_request);
722 void blk_mq_free_plug_rqs(struct blk_plug *plug)
726 while ((rq = rq_list_pop(&plug->cached_rq)) != NULL)
727 blk_mq_free_request(rq);
730 void blk_dump_rq_flags(struct request *rq, char *msg)
732 printk(KERN_INFO "%s: dev %s: flags=%llx\n", msg,
733 rq->q->disk ? rq->q->disk->disk_name : "?",
734 (__force unsigned long long) rq->cmd_flags);
736 printk(KERN_INFO " sector %llu, nr/cnr %u/%u\n",
737 (unsigned long long)blk_rq_pos(rq),
738 blk_rq_sectors(rq), blk_rq_cur_sectors(rq));
739 printk(KERN_INFO " bio %p, biotail %p, len %u\n",
740 rq->bio, rq->biotail, blk_rq_bytes(rq));
742 EXPORT_SYMBOL(blk_dump_rq_flags);
744 static void req_bio_endio(struct request *rq, struct bio *bio,
745 unsigned int nbytes, blk_status_t error)
747 if (unlikely(error)) {
748 bio->bi_status = error;
749 } else if (req_op(rq) == REQ_OP_ZONE_APPEND) {
751 * Partial zone append completions cannot be supported as the
752 * BIO fragments may end up not being written sequentially.
754 if (bio->bi_iter.bi_size != nbytes)
755 bio->bi_status = BLK_STS_IOERR;
757 bio->bi_iter.bi_sector = rq->__sector;
760 bio_advance(bio, nbytes);
762 if (unlikely(rq->rq_flags & RQF_QUIET))
763 bio_set_flag(bio, BIO_QUIET);
764 /* don't actually finish bio if it's part of flush sequence */
765 if (bio->bi_iter.bi_size == 0 && !(rq->rq_flags & RQF_FLUSH_SEQ))
769 static void blk_account_io_completion(struct request *req, unsigned int bytes)
771 if (req->part && blk_do_io_stat(req)) {
772 const int sgrp = op_stat_group(req_op(req));
775 part_stat_add(req->part, sectors[sgrp], bytes >> 9);
780 static void blk_print_req_error(struct request *req, blk_status_t status)
782 printk_ratelimited(KERN_ERR
783 "%s error, dev %s, sector %llu op 0x%x:(%s) flags 0x%x "
784 "phys_seg %u prio class %u\n",
785 blk_status_to_str(status),
786 req->q->disk ? req->q->disk->disk_name : "?",
787 blk_rq_pos(req), (__force u32)req_op(req),
788 blk_op_str(req_op(req)),
789 (__force u32)(req->cmd_flags & ~REQ_OP_MASK),
790 req->nr_phys_segments,
791 IOPRIO_PRIO_CLASS(req->ioprio));
795 * Fully end IO on a request. Does not support partial completions, or
798 static void blk_complete_request(struct request *req)
800 const bool is_flush = (req->rq_flags & RQF_FLUSH_SEQ) != 0;
801 int total_bytes = blk_rq_bytes(req);
802 struct bio *bio = req->bio;
804 trace_block_rq_complete(req, BLK_STS_OK, total_bytes);
809 #ifdef CONFIG_BLK_DEV_INTEGRITY
810 if (blk_integrity_rq(req) && req_op(req) == REQ_OP_READ)
811 req->q->integrity.profile->complete_fn(req, total_bytes);
815 * Upper layers may call blk_crypto_evict_key() anytime after the last
816 * bio_endio(). Therefore, the keyslot must be released before that.
818 blk_crypto_rq_put_keyslot(req);
820 blk_account_io_completion(req, total_bytes);
823 struct bio *next = bio->bi_next;
825 /* Completion has already been traced */
826 bio_clear_flag(bio, BIO_TRACE_COMPLETION);
828 if (req_op(req) == REQ_OP_ZONE_APPEND)
829 bio->bi_iter.bi_sector = req->__sector;
837 * Reset counters so that the request stacking driver
838 * can find how many bytes remain in the request
848 * blk_update_request - Complete multiple bytes without completing the request
849 * @req: the request being processed
850 * @error: block status code
851 * @nr_bytes: number of bytes to complete for @req
854 * Ends I/O on a number of bytes attached to @req, but doesn't complete
855 * the request structure even if @req doesn't have leftover.
856 * If @req has leftover, sets it up for the next range of segments.
858 * Passing the result of blk_rq_bytes() as @nr_bytes guarantees
859 * %false return from this function.
862 * The RQF_SPECIAL_PAYLOAD flag is ignored on purpose in this function
863 * except in the consistency check at the end of this function.
866 * %false - this request doesn't have any more data
867 * %true - this request has more data
869 bool blk_update_request(struct request *req, blk_status_t error,
870 unsigned int nr_bytes)
874 trace_block_rq_complete(req, error, nr_bytes);
879 #ifdef CONFIG_BLK_DEV_INTEGRITY
880 if (blk_integrity_rq(req) && req_op(req) == REQ_OP_READ &&
882 req->q->integrity.profile->complete_fn(req, nr_bytes);
886 * Upper layers may call blk_crypto_evict_key() anytime after the last
887 * bio_endio(). Therefore, the keyslot must be released before that.
889 if (blk_crypto_rq_has_keyslot(req) && nr_bytes >= blk_rq_bytes(req))
890 __blk_crypto_rq_put_keyslot(req);
892 if (unlikely(error && !blk_rq_is_passthrough(req) &&
893 !(req->rq_flags & RQF_QUIET)) &&
894 !test_bit(GD_DEAD, &req->q->disk->state)) {
895 blk_print_req_error(req, error);
896 trace_block_rq_error(req, error, nr_bytes);
899 blk_account_io_completion(req, nr_bytes);
903 struct bio *bio = req->bio;
904 unsigned bio_bytes = min(bio->bi_iter.bi_size, nr_bytes);
906 if (bio_bytes == bio->bi_iter.bi_size)
907 req->bio = bio->bi_next;
909 /* Completion has already been traced */
910 bio_clear_flag(bio, BIO_TRACE_COMPLETION);
911 req_bio_endio(req, bio, bio_bytes, error);
913 total_bytes += bio_bytes;
914 nr_bytes -= bio_bytes;
925 * Reset counters so that the request stacking driver
926 * can find how many bytes remain in the request
933 req->__data_len -= total_bytes;
935 /* update sector only for requests with clear definition of sector */
936 if (!blk_rq_is_passthrough(req))
937 req->__sector += total_bytes >> 9;
939 /* mixed attributes always follow the first bio */
940 if (req->rq_flags & RQF_MIXED_MERGE) {
941 req->cmd_flags &= ~REQ_FAILFAST_MASK;
942 req->cmd_flags |= req->bio->bi_opf & REQ_FAILFAST_MASK;
945 if (!(req->rq_flags & RQF_SPECIAL_PAYLOAD)) {
947 * If total number of sectors is less than the first segment
948 * size, something has gone terribly wrong.
950 if (blk_rq_bytes(req) < blk_rq_cur_bytes(req)) {
951 blk_dump_rq_flags(req, "request botched");
952 req->__data_len = blk_rq_cur_bytes(req);
955 /* recalculate the number of segments */
956 req->nr_phys_segments = blk_recalc_rq_segments(req);
961 EXPORT_SYMBOL_GPL(blk_update_request);
963 static inline void blk_account_io_done(struct request *req, u64 now)
965 trace_block_io_done(req);
968 * Account IO completion. flush_rq isn't accounted as a
969 * normal IO on queueing nor completion. Accounting the
970 * containing request is enough.
972 if (blk_do_io_stat(req) && req->part &&
973 !(req->rq_flags & RQF_FLUSH_SEQ)) {
974 const int sgrp = op_stat_group(req_op(req));
977 update_io_ticks(req->part, jiffies, true);
978 part_stat_inc(req->part, ios[sgrp]);
979 part_stat_add(req->part, nsecs[sgrp], now - req->start_time_ns);
984 static inline void blk_account_io_start(struct request *req)
986 trace_block_io_start(req);
988 if (blk_do_io_stat(req)) {
990 * All non-passthrough requests are created from a bio with one
991 * exception: when a flush command that is part of a flush sequence
992 * generated by the state machine in blk-flush.c is cloned onto the
993 * lower device by dm-multipath we can get here without a bio.
996 req->part = req->bio->bi_bdev;
998 req->part = req->q->disk->part0;
1001 update_io_ticks(req->part, jiffies, false);
1006 static inline void __blk_mq_end_request_acct(struct request *rq, u64 now)
1008 if (rq->rq_flags & RQF_STATS)
1009 blk_stat_add(rq, now);
1011 blk_mq_sched_completed_request(rq, now);
1012 blk_account_io_done(rq, now);
1015 inline void __blk_mq_end_request(struct request *rq, blk_status_t error)
1017 if (blk_mq_need_time_stamp(rq))
1018 __blk_mq_end_request_acct(rq, ktime_get_ns());
1021 rq_qos_done(rq->q, rq);
1022 if (rq->end_io(rq, error) == RQ_END_IO_FREE)
1023 blk_mq_free_request(rq);
1025 blk_mq_free_request(rq);
1028 EXPORT_SYMBOL(__blk_mq_end_request);
1030 void blk_mq_end_request(struct request *rq, blk_status_t error)
1032 if (blk_update_request(rq, error, blk_rq_bytes(rq)))
1034 __blk_mq_end_request(rq, error);
1036 EXPORT_SYMBOL(blk_mq_end_request);
1038 #define TAG_COMP_BATCH 32
1040 static inline void blk_mq_flush_tag_batch(struct blk_mq_hw_ctx *hctx,
1041 int *tag_array, int nr_tags)
1043 struct request_queue *q = hctx->queue;
1046 * All requests should have been marked as RQF_MQ_INFLIGHT, so
1047 * update hctx->nr_active in batch
1049 if (hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED)
1050 __blk_mq_sub_active_requests(hctx, nr_tags);
1052 blk_mq_put_tags(hctx->tags, tag_array, nr_tags);
1053 percpu_ref_put_many(&q->q_usage_counter, nr_tags);
1056 void blk_mq_end_request_batch(struct io_comp_batch *iob)
1058 int tags[TAG_COMP_BATCH], nr_tags = 0;
1059 struct blk_mq_hw_ctx *cur_hctx = NULL;
1064 now = ktime_get_ns();
1066 while ((rq = rq_list_pop(&iob->req_list)) != NULL) {
1068 prefetch(rq->rq_next);
1070 blk_complete_request(rq);
1072 __blk_mq_end_request_acct(rq, now);
1074 rq_qos_done(rq->q, rq);
1077 * If end_io handler returns NONE, then it still has
1078 * ownership of the request.
1080 if (rq->end_io && rq->end_io(rq, 0) == RQ_END_IO_NONE)
1083 WRITE_ONCE(rq->state, MQ_RQ_IDLE);
1084 if (!req_ref_put_and_test(rq))
1087 blk_crypto_free_request(rq);
1088 blk_pm_mark_last_busy(rq);
1090 if (nr_tags == TAG_COMP_BATCH || cur_hctx != rq->mq_hctx) {
1092 blk_mq_flush_tag_batch(cur_hctx, tags, nr_tags);
1094 cur_hctx = rq->mq_hctx;
1096 tags[nr_tags++] = rq->tag;
1100 blk_mq_flush_tag_batch(cur_hctx, tags, nr_tags);
1102 EXPORT_SYMBOL_GPL(blk_mq_end_request_batch);
1104 static void blk_complete_reqs(struct llist_head *list)
1106 struct llist_node *entry = llist_reverse_order(llist_del_all(list));
1107 struct request *rq, *next;
1109 llist_for_each_entry_safe(rq, next, entry, ipi_list)
1110 rq->q->mq_ops->complete(rq);
1113 static __latent_entropy void blk_done_softirq(struct softirq_action *h)
1115 blk_complete_reqs(this_cpu_ptr(&blk_cpu_done));
1118 static int blk_softirq_cpu_dead(unsigned int cpu)
1120 blk_complete_reqs(&per_cpu(blk_cpu_done, cpu));
1124 static void __blk_mq_complete_request_remote(void *data)
1126 __raise_softirq_irqoff(BLOCK_SOFTIRQ);
1129 static inline bool blk_mq_complete_need_ipi(struct request *rq)
1131 int cpu = raw_smp_processor_id();
1133 if (!IS_ENABLED(CONFIG_SMP) ||
1134 !test_bit(QUEUE_FLAG_SAME_COMP, &rq->q->queue_flags))
1137 * With force threaded interrupts enabled, raising softirq from an SMP
1138 * function call will always result in waking the ksoftirqd thread.
1139 * This is probably worse than completing the request on a different
1142 if (force_irqthreads())
1145 /* same CPU or cache domain? Complete locally */
1146 if (cpu == rq->mq_ctx->cpu ||
1147 (!test_bit(QUEUE_FLAG_SAME_FORCE, &rq->q->queue_flags) &&
1148 cpus_share_cache(cpu, rq->mq_ctx->cpu)))
1151 /* don't try to IPI to an offline CPU */
1152 return cpu_online(rq->mq_ctx->cpu);
1155 static void blk_mq_complete_send_ipi(struct request *rq)
1157 struct llist_head *list;
1160 cpu = rq->mq_ctx->cpu;
1161 list = &per_cpu(blk_cpu_done, cpu);
1162 if (llist_add(&rq->ipi_list, list)) {
1163 INIT_CSD(&rq->csd, __blk_mq_complete_request_remote, rq);
1164 smp_call_function_single_async(cpu, &rq->csd);
1168 static void blk_mq_raise_softirq(struct request *rq)
1170 struct llist_head *list;
1173 list = this_cpu_ptr(&blk_cpu_done);
1174 if (llist_add(&rq->ipi_list, list))
1175 raise_softirq(BLOCK_SOFTIRQ);
1179 bool blk_mq_complete_request_remote(struct request *rq)
1181 WRITE_ONCE(rq->state, MQ_RQ_COMPLETE);
1184 * For request which hctx has only one ctx mapping,
1185 * or a polled request, always complete locally,
1186 * it's pointless to redirect the completion.
1188 if ((rq->mq_hctx->nr_ctx == 1 &&
1189 rq->mq_ctx->cpu == raw_smp_processor_id()) ||
1190 rq->cmd_flags & REQ_POLLED)
1193 if (blk_mq_complete_need_ipi(rq)) {
1194 blk_mq_complete_send_ipi(rq);
1198 if (rq->q->nr_hw_queues == 1) {
1199 blk_mq_raise_softirq(rq);
1204 EXPORT_SYMBOL_GPL(blk_mq_complete_request_remote);
1207 * blk_mq_complete_request - end I/O on a request
1208 * @rq: the request being processed
1211 * Complete a request by scheduling the ->complete_rq operation.
1213 void blk_mq_complete_request(struct request *rq)
1215 if (!blk_mq_complete_request_remote(rq))
1216 rq->q->mq_ops->complete(rq);
1218 EXPORT_SYMBOL(blk_mq_complete_request);
1221 * blk_mq_start_request - Start processing a request
1222 * @rq: Pointer to request to be started
1224 * Function used by device drivers to notify the block layer that a request
1225 * is going to be processed now, so blk layer can do proper initializations
1226 * such as starting the timeout timer.
1228 void blk_mq_start_request(struct request *rq)
1230 struct request_queue *q = rq->q;
1232 trace_block_rq_issue(rq);
1234 if (test_bit(QUEUE_FLAG_STATS, &q->queue_flags)) {
1235 rq->io_start_time_ns = ktime_get_ns();
1236 rq->stats_sectors = blk_rq_sectors(rq);
1237 rq->rq_flags |= RQF_STATS;
1238 rq_qos_issue(q, rq);
1241 WARN_ON_ONCE(blk_mq_rq_state(rq) != MQ_RQ_IDLE);
1244 WRITE_ONCE(rq->state, MQ_RQ_IN_FLIGHT);
1246 #ifdef CONFIG_BLK_DEV_INTEGRITY
1247 if (blk_integrity_rq(rq) && req_op(rq) == REQ_OP_WRITE)
1248 q->integrity.profile->prepare_fn(rq);
1250 if (rq->bio && rq->bio->bi_opf & REQ_POLLED)
1251 WRITE_ONCE(rq->bio->bi_cookie, blk_rq_to_qc(rq));
1253 EXPORT_SYMBOL(blk_mq_start_request);
1256 * Allow 2x BLK_MAX_REQUEST_COUNT requests on plug queue for multiple
1257 * queues. This is important for md arrays to benefit from merging
1260 static inline unsigned short blk_plug_max_rq_count(struct blk_plug *plug)
1262 if (plug->multiple_queues)
1263 return BLK_MAX_REQUEST_COUNT * 2;
1264 return BLK_MAX_REQUEST_COUNT;
1267 static void blk_add_rq_to_plug(struct blk_plug *plug, struct request *rq)
1269 struct request *last = rq_list_peek(&plug->mq_list);
1271 if (!plug->rq_count) {
1272 trace_block_plug(rq->q);
1273 } else if (plug->rq_count >= blk_plug_max_rq_count(plug) ||
1274 (!blk_queue_nomerges(rq->q) &&
1275 blk_rq_bytes(last) >= BLK_PLUG_FLUSH_SIZE)) {
1276 blk_mq_flush_plug_list(plug, false);
1278 trace_block_plug(rq->q);
1281 if (!plug->multiple_queues && last && last->q != rq->q)
1282 plug->multiple_queues = true;
1283 if (!plug->has_elevator && (rq->rq_flags & RQF_USE_SCHED))
1284 plug->has_elevator = true;
1286 rq_list_add(&plug->mq_list, rq);
1291 * blk_execute_rq_nowait - insert a request to I/O scheduler for execution
1292 * @rq: request to insert
1293 * @at_head: insert request at head or tail of queue
1296 * Insert a fully prepared request at the back of the I/O scheduler queue
1297 * for execution. Don't wait for completion.
1300 * This function will invoke @done directly if the queue is dead.
1302 void blk_execute_rq_nowait(struct request *rq, bool at_head)
1304 struct blk_mq_hw_ctx *hctx = rq->mq_hctx;
1306 WARN_ON(irqs_disabled());
1307 WARN_ON(!blk_rq_is_passthrough(rq));
1309 blk_account_io_start(rq);
1312 * As plugging can be enabled for passthrough requests on a zoned
1313 * device, directly accessing the plug instead of using blk_mq_plug()
1314 * should not have any consequences.
1316 if (current->plug && !at_head) {
1317 blk_add_rq_to_plug(current->plug, rq);
1321 blk_mq_insert_request(rq, at_head ? BLK_MQ_INSERT_AT_HEAD : 0);
1322 blk_mq_run_hw_queue(hctx, false);
1324 EXPORT_SYMBOL_GPL(blk_execute_rq_nowait);
1326 struct blk_rq_wait {
1327 struct completion done;
1331 static enum rq_end_io_ret blk_end_sync_rq(struct request *rq, blk_status_t ret)
1333 struct blk_rq_wait *wait = rq->end_io_data;
1336 complete(&wait->done);
1337 return RQ_END_IO_NONE;
1340 bool blk_rq_is_poll(struct request *rq)
1344 if (rq->mq_hctx->type != HCTX_TYPE_POLL)
1348 EXPORT_SYMBOL_GPL(blk_rq_is_poll);
1350 static void blk_rq_poll_completion(struct request *rq, struct completion *wait)
1353 blk_mq_poll(rq->q, blk_rq_to_qc(rq), NULL, 0);
1355 } while (!completion_done(wait));
1359 * blk_execute_rq - insert a request into queue for execution
1360 * @rq: request to insert
1361 * @at_head: insert request at head or tail of queue
1364 * Insert a fully prepared request at the back of the I/O scheduler queue
1365 * for execution and wait for completion.
1366 * Return: The blk_status_t result provided to blk_mq_end_request().
1368 blk_status_t blk_execute_rq(struct request *rq, bool at_head)
1370 struct blk_mq_hw_ctx *hctx = rq->mq_hctx;
1371 struct blk_rq_wait wait = {
1372 .done = COMPLETION_INITIALIZER_ONSTACK(wait.done),
1375 WARN_ON(irqs_disabled());
1376 WARN_ON(!blk_rq_is_passthrough(rq));
1378 rq->end_io_data = &wait;
1379 rq->end_io = blk_end_sync_rq;
1381 blk_account_io_start(rq);
1382 blk_mq_insert_request(rq, at_head ? BLK_MQ_INSERT_AT_HEAD : 0);
1383 blk_mq_run_hw_queue(hctx, false);
1385 if (blk_rq_is_poll(rq)) {
1386 blk_rq_poll_completion(rq, &wait.done);
1389 * Prevent hang_check timer from firing at us during very long
1392 unsigned long hang_check = sysctl_hung_task_timeout_secs;
1395 while (!wait_for_completion_io_timeout(&wait.done,
1396 hang_check * (HZ/2)))
1399 wait_for_completion_io(&wait.done);
1404 EXPORT_SYMBOL(blk_execute_rq);
1406 static void __blk_mq_requeue_request(struct request *rq)
1408 struct request_queue *q = rq->q;
1410 blk_mq_put_driver_tag(rq);
1412 trace_block_rq_requeue(rq);
1413 rq_qos_requeue(q, rq);
1415 if (blk_mq_request_started(rq)) {
1416 WRITE_ONCE(rq->state, MQ_RQ_IDLE);
1417 rq->rq_flags &= ~RQF_TIMED_OUT;
1421 void blk_mq_requeue_request(struct request *rq, bool kick_requeue_list)
1423 struct request_queue *q = rq->q;
1424 unsigned long flags;
1426 __blk_mq_requeue_request(rq);
1428 /* this request will be re-inserted to io scheduler queue */
1429 blk_mq_sched_requeue_request(rq);
1431 spin_lock_irqsave(&q->requeue_lock, flags);
1432 list_add_tail(&rq->queuelist, &q->requeue_list);
1433 spin_unlock_irqrestore(&q->requeue_lock, flags);
1435 if (kick_requeue_list)
1436 blk_mq_kick_requeue_list(q);
1438 EXPORT_SYMBOL(blk_mq_requeue_request);
1440 static void blk_mq_requeue_work(struct work_struct *work)
1442 struct request_queue *q =
1443 container_of(work, struct request_queue, requeue_work.work);
1445 LIST_HEAD(flush_list);
1448 spin_lock_irq(&q->requeue_lock);
1449 list_splice_init(&q->requeue_list, &rq_list);
1450 list_splice_init(&q->flush_list, &flush_list);
1451 spin_unlock_irq(&q->requeue_lock);
1453 while (!list_empty(&rq_list)) {
1454 rq = list_entry(rq_list.next, struct request, queuelist);
1456 * If RQF_DONTPREP ist set, the request has been started by the
1457 * driver already and might have driver-specific data allocated
1458 * already. Insert it into the hctx dispatch list to avoid
1459 * block layer merges for the request.
1461 if (rq->rq_flags & RQF_DONTPREP) {
1462 list_del_init(&rq->queuelist);
1463 blk_mq_request_bypass_insert(rq, 0);
1465 list_del_init(&rq->queuelist);
1466 blk_mq_insert_request(rq, BLK_MQ_INSERT_AT_HEAD);
1470 while (!list_empty(&flush_list)) {
1471 rq = list_entry(flush_list.next, struct request, queuelist);
1472 list_del_init(&rq->queuelist);
1473 blk_mq_insert_request(rq, 0);
1476 blk_mq_run_hw_queues(q, false);
1479 void blk_mq_kick_requeue_list(struct request_queue *q)
1481 kblockd_mod_delayed_work_on(WORK_CPU_UNBOUND, &q->requeue_work, 0);
1483 EXPORT_SYMBOL(blk_mq_kick_requeue_list);
1485 void blk_mq_delay_kick_requeue_list(struct request_queue *q,
1486 unsigned long msecs)
1488 kblockd_mod_delayed_work_on(WORK_CPU_UNBOUND, &q->requeue_work,
1489 msecs_to_jiffies(msecs));
1491 EXPORT_SYMBOL(blk_mq_delay_kick_requeue_list);
1493 static bool blk_mq_rq_inflight(struct request *rq, void *priv)
1496 * If we find a request that isn't idle we know the queue is busy
1497 * as it's checked in the iter.
1498 * Return false to stop the iteration.
1500 if (blk_mq_request_started(rq)) {
1510 bool blk_mq_queue_inflight(struct request_queue *q)
1514 blk_mq_queue_tag_busy_iter(q, blk_mq_rq_inflight, &busy);
1517 EXPORT_SYMBOL_GPL(blk_mq_queue_inflight);
1519 static void blk_mq_rq_timed_out(struct request *req)
1521 req->rq_flags |= RQF_TIMED_OUT;
1522 if (req->q->mq_ops->timeout) {
1523 enum blk_eh_timer_return ret;
1525 ret = req->q->mq_ops->timeout(req);
1526 if (ret == BLK_EH_DONE)
1528 WARN_ON_ONCE(ret != BLK_EH_RESET_TIMER);
1534 struct blk_expired_data {
1535 bool has_timedout_rq;
1537 unsigned long timeout_start;
1540 static bool blk_mq_req_expired(struct request *rq, struct blk_expired_data *expired)
1542 unsigned long deadline;
1544 if (blk_mq_rq_state(rq) != MQ_RQ_IN_FLIGHT)
1546 if (rq->rq_flags & RQF_TIMED_OUT)
1549 deadline = READ_ONCE(rq->deadline);
1550 if (time_after_eq(expired->timeout_start, deadline))
1553 if (expired->next == 0)
1554 expired->next = deadline;
1555 else if (time_after(expired->next, deadline))
1556 expired->next = deadline;
1560 void blk_mq_put_rq_ref(struct request *rq)
1562 if (is_flush_rq(rq)) {
1563 if (rq->end_io(rq, 0) == RQ_END_IO_FREE)
1564 blk_mq_free_request(rq);
1565 } else if (req_ref_put_and_test(rq)) {
1566 __blk_mq_free_request(rq);
1570 static bool blk_mq_check_expired(struct request *rq, void *priv)
1572 struct blk_expired_data *expired = priv;
1575 * blk_mq_queue_tag_busy_iter() has locked the request, so it cannot
1576 * be reallocated underneath the timeout handler's processing, then
1577 * the expire check is reliable. If the request is not expired, then
1578 * it was completed and reallocated as a new request after returning
1579 * from blk_mq_check_expired().
1581 if (blk_mq_req_expired(rq, expired)) {
1582 expired->has_timedout_rq = true;
1588 static bool blk_mq_handle_expired(struct request *rq, void *priv)
1590 struct blk_expired_data *expired = priv;
1592 if (blk_mq_req_expired(rq, expired))
1593 blk_mq_rq_timed_out(rq);
1597 static void blk_mq_timeout_work(struct work_struct *work)
1599 struct request_queue *q =
1600 container_of(work, struct request_queue, timeout_work);
1601 struct blk_expired_data expired = {
1602 .timeout_start = jiffies,
1604 struct blk_mq_hw_ctx *hctx;
1607 /* A deadlock might occur if a request is stuck requiring a
1608 * timeout at the same time a queue freeze is waiting
1609 * completion, since the timeout code would not be able to
1610 * acquire the queue reference here.
1612 * That's why we don't use blk_queue_enter here; instead, we use
1613 * percpu_ref_tryget directly, because we need to be able to
1614 * obtain a reference even in the short window between the queue
1615 * starting to freeze, by dropping the first reference in
1616 * blk_freeze_queue_start, and the moment the last request is
1617 * consumed, marked by the instant q_usage_counter reaches
1620 if (!percpu_ref_tryget(&q->q_usage_counter))
1623 /* check if there is any timed-out request */
1624 blk_mq_queue_tag_busy_iter(q, blk_mq_check_expired, &expired);
1625 if (expired.has_timedout_rq) {
1627 * Before walking tags, we must ensure any submit started
1628 * before the current time has finished. Since the submit
1629 * uses srcu or rcu, wait for a synchronization point to
1630 * ensure all running submits have finished
1632 blk_mq_wait_quiesce_done(q->tag_set);
1635 blk_mq_queue_tag_busy_iter(q, blk_mq_handle_expired, &expired);
1638 if (expired.next != 0) {
1639 mod_timer(&q->timeout, expired.next);
1642 * Request timeouts are handled as a forward rolling timer. If
1643 * we end up here it means that no requests are pending and
1644 * also that no request has been pending for a while. Mark
1645 * each hctx as idle.
1647 queue_for_each_hw_ctx(q, hctx, i) {
1648 /* the hctx may be unmapped, so check it here */
1649 if (blk_mq_hw_queue_mapped(hctx))
1650 blk_mq_tag_idle(hctx);
1656 struct flush_busy_ctx_data {
1657 struct blk_mq_hw_ctx *hctx;
1658 struct list_head *list;
1661 static bool flush_busy_ctx(struct sbitmap *sb, unsigned int bitnr, void *data)
1663 struct flush_busy_ctx_data *flush_data = data;
1664 struct blk_mq_hw_ctx *hctx = flush_data->hctx;
1665 struct blk_mq_ctx *ctx = hctx->ctxs[bitnr];
1666 enum hctx_type type = hctx->type;
1668 spin_lock(&ctx->lock);
1669 list_splice_tail_init(&ctx->rq_lists[type], flush_data->list);
1670 sbitmap_clear_bit(sb, bitnr);
1671 spin_unlock(&ctx->lock);
1676 * Process software queues that have been marked busy, splicing them
1677 * to the for-dispatch
1679 void blk_mq_flush_busy_ctxs(struct blk_mq_hw_ctx *hctx, struct list_head *list)
1681 struct flush_busy_ctx_data data = {
1686 sbitmap_for_each_set(&hctx->ctx_map, flush_busy_ctx, &data);
1688 EXPORT_SYMBOL_GPL(blk_mq_flush_busy_ctxs);
1690 struct dispatch_rq_data {
1691 struct blk_mq_hw_ctx *hctx;
1695 static bool dispatch_rq_from_ctx(struct sbitmap *sb, unsigned int bitnr,
1698 struct dispatch_rq_data *dispatch_data = data;
1699 struct blk_mq_hw_ctx *hctx = dispatch_data->hctx;
1700 struct blk_mq_ctx *ctx = hctx->ctxs[bitnr];
1701 enum hctx_type type = hctx->type;
1703 spin_lock(&ctx->lock);
1704 if (!list_empty(&ctx->rq_lists[type])) {
1705 dispatch_data->rq = list_entry_rq(ctx->rq_lists[type].next);
1706 list_del_init(&dispatch_data->rq->queuelist);
1707 if (list_empty(&ctx->rq_lists[type]))
1708 sbitmap_clear_bit(sb, bitnr);
1710 spin_unlock(&ctx->lock);
1712 return !dispatch_data->rq;
1715 struct request *blk_mq_dequeue_from_ctx(struct blk_mq_hw_ctx *hctx,
1716 struct blk_mq_ctx *start)
1718 unsigned off = start ? start->index_hw[hctx->type] : 0;
1719 struct dispatch_rq_data data = {
1724 __sbitmap_for_each_set(&hctx->ctx_map, off,
1725 dispatch_rq_from_ctx, &data);
1730 static bool __blk_mq_alloc_driver_tag(struct request *rq)
1732 struct sbitmap_queue *bt = &rq->mq_hctx->tags->bitmap_tags;
1733 unsigned int tag_offset = rq->mq_hctx->tags->nr_reserved_tags;
1736 blk_mq_tag_busy(rq->mq_hctx);
1738 if (blk_mq_tag_is_reserved(rq->mq_hctx->sched_tags, rq->internal_tag)) {
1739 bt = &rq->mq_hctx->tags->breserved_tags;
1742 if (!hctx_may_queue(rq->mq_hctx, bt))
1746 tag = __sbitmap_queue_get(bt);
1747 if (tag == BLK_MQ_NO_TAG)
1750 rq->tag = tag + tag_offset;
1754 bool __blk_mq_get_driver_tag(struct blk_mq_hw_ctx *hctx, struct request *rq)
1756 if (rq->tag == BLK_MQ_NO_TAG && !__blk_mq_alloc_driver_tag(rq))
1759 if ((hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED) &&
1760 !(rq->rq_flags & RQF_MQ_INFLIGHT)) {
1761 rq->rq_flags |= RQF_MQ_INFLIGHT;
1762 __blk_mq_inc_active_requests(hctx);
1764 hctx->tags->rqs[rq->tag] = rq;
1768 static int blk_mq_dispatch_wake(wait_queue_entry_t *wait, unsigned mode,
1769 int flags, void *key)
1771 struct blk_mq_hw_ctx *hctx;
1773 hctx = container_of(wait, struct blk_mq_hw_ctx, dispatch_wait);
1775 spin_lock(&hctx->dispatch_wait_lock);
1776 if (!list_empty(&wait->entry)) {
1777 struct sbitmap_queue *sbq;
1779 list_del_init(&wait->entry);
1780 sbq = &hctx->tags->bitmap_tags;
1781 atomic_dec(&sbq->ws_active);
1783 spin_unlock(&hctx->dispatch_wait_lock);
1785 blk_mq_run_hw_queue(hctx, true);
1790 * Mark us waiting for a tag. For shared tags, this involves hooking us into
1791 * the tag wakeups. For non-shared tags, we can simply mark us needing a
1792 * restart. For both cases, take care to check the condition again after
1793 * marking us as waiting.
1795 static bool blk_mq_mark_tag_wait(struct blk_mq_hw_ctx *hctx,
1798 struct sbitmap_queue *sbq;
1799 struct wait_queue_head *wq;
1800 wait_queue_entry_t *wait;
1803 if (!(hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED) &&
1804 !(blk_mq_is_shared_tags(hctx->flags))) {
1805 blk_mq_sched_mark_restart_hctx(hctx);
1808 * It's possible that a tag was freed in the window between the
1809 * allocation failure and adding the hardware queue to the wait
1812 * Don't clear RESTART here, someone else could have set it.
1813 * At most this will cost an extra queue run.
1815 return blk_mq_get_driver_tag(rq);
1818 wait = &hctx->dispatch_wait;
1819 if (!list_empty_careful(&wait->entry))
1822 if (blk_mq_tag_is_reserved(rq->mq_hctx->sched_tags, rq->internal_tag))
1823 sbq = &hctx->tags->breserved_tags;
1825 sbq = &hctx->tags->bitmap_tags;
1826 wq = &bt_wait_ptr(sbq, hctx)->wait;
1828 spin_lock_irq(&wq->lock);
1829 spin_lock(&hctx->dispatch_wait_lock);
1830 if (!list_empty(&wait->entry)) {
1831 spin_unlock(&hctx->dispatch_wait_lock);
1832 spin_unlock_irq(&wq->lock);
1836 atomic_inc(&sbq->ws_active);
1837 wait->flags &= ~WQ_FLAG_EXCLUSIVE;
1838 __add_wait_queue(wq, wait);
1841 * It's possible that a tag was freed in the window between the
1842 * allocation failure and adding the hardware queue to the wait
1845 ret = blk_mq_get_driver_tag(rq);
1847 spin_unlock(&hctx->dispatch_wait_lock);
1848 spin_unlock_irq(&wq->lock);
1853 * We got a tag, remove ourselves from the wait queue to ensure
1854 * someone else gets the wakeup.
1856 list_del_init(&wait->entry);
1857 atomic_dec(&sbq->ws_active);
1858 spin_unlock(&hctx->dispatch_wait_lock);
1859 spin_unlock_irq(&wq->lock);
1864 #define BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT 8
1865 #define BLK_MQ_DISPATCH_BUSY_EWMA_FACTOR 4
1867 * Update dispatch busy with the Exponential Weighted Moving Average(EWMA):
1868 * - EWMA is one simple way to compute running average value
1869 * - weight(7/8 and 1/8) is applied so that it can decrease exponentially
1870 * - take 4 as factor for avoiding to get too small(0) result, and this
1871 * factor doesn't matter because EWMA decreases exponentially
1873 static void blk_mq_update_dispatch_busy(struct blk_mq_hw_ctx *hctx, bool busy)
1877 ewma = hctx->dispatch_busy;
1882 ewma *= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT - 1;
1884 ewma += 1 << BLK_MQ_DISPATCH_BUSY_EWMA_FACTOR;
1885 ewma /= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT;
1887 hctx->dispatch_busy = ewma;
1890 #define BLK_MQ_RESOURCE_DELAY 3 /* ms units */
1892 static void blk_mq_handle_dev_resource(struct request *rq,
1893 struct list_head *list)
1895 list_add(&rq->queuelist, list);
1896 __blk_mq_requeue_request(rq);
1899 static void blk_mq_handle_zone_resource(struct request *rq,
1900 struct list_head *zone_list)
1903 * If we end up here it is because we cannot dispatch a request to a
1904 * specific zone due to LLD level zone-write locking or other zone
1905 * related resource not being available. In this case, set the request
1906 * aside in zone_list for retrying it later.
1908 list_add(&rq->queuelist, zone_list);
1909 __blk_mq_requeue_request(rq);
1912 enum prep_dispatch {
1914 PREP_DISPATCH_NO_TAG,
1915 PREP_DISPATCH_NO_BUDGET,
1918 static enum prep_dispatch blk_mq_prep_dispatch_rq(struct request *rq,
1921 struct blk_mq_hw_ctx *hctx = rq->mq_hctx;
1922 int budget_token = -1;
1925 budget_token = blk_mq_get_dispatch_budget(rq->q);
1926 if (budget_token < 0) {
1927 blk_mq_put_driver_tag(rq);
1928 return PREP_DISPATCH_NO_BUDGET;
1930 blk_mq_set_rq_budget_token(rq, budget_token);
1933 if (!blk_mq_get_driver_tag(rq)) {
1935 * The initial allocation attempt failed, so we need to
1936 * rerun the hardware queue when a tag is freed. The
1937 * waitqueue takes care of that. If the queue is run
1938 * before we add this entry back on the dispatch list,
1939 * we'll re-run it below.
1941 if (!blk_mq_mark_tag_wait(hctx, rq)) {
1943 * All budgets not got from this function will be put
1944 * together during handling partial dispatch
1947 blk_mq_put_dispatch_budget(rq->q, budget_token);
1948 return PREP_DISPATCH_NO_TAG;
1952 return PREP_DISPATCH_OK;
1955 /* release all allocated budgets before calling to blk_mq_dispatch_rq_list */
1956 static void blk_mq_release_budgets(struct request_queue *q,
1957 struct list_head *list)
1961 list_for_each_entry(rq, list, queuelist) {
1962 int budget_token = blk_mq_get_rq_budget_token(rq);
1964 if (budget_token >= 0)
1965 blk_mq_put_dispatch_budget(q, budget_token);
1970 * blk_mq_commit_rqs will notify driver using bd->last that there is no
1971 * more requests. (See comment in struct blk_mq_ops for commit_rqs for
1973 * Attention, we should explicitly call this in unusual cases:
1974 * 1) did not queue everything initially scheduled to queue
1975 * 2) the last attempt to queue a request failed
1977 static void blk_mq_commit_rqs(struct blk_mq_hw_ctx *hctx, int queued,
1980 if (hctx->queue->mq_ops->commit_rqs && queued) {
1981 trace_block_unplug(hctx->queue, queued, !from_schedule);
1982 hctx->queue->mq_ops->commit_rqs(hctx);
1987 * Returns true if we did some work AND can potentially do more.
1989 bool blk_mq_dispatch_rq_list(struct blk_mq_hw_ctx *hctx, struct list_head *list,
1990 unsigned int nr_budgets)
1992 enum prep_dispatch prep;
1993 struct request_queue *q = hctx->queue;
1996 blk_status_t ret = BLK_STS_OK;
1997 LIST_HEAD(zone_list);
1998 bool needs_resource = false;
2000 if (list_empty(list))
2004 * Now process all the entries, sending them to the driver.
2008 struct blk_mq_queue_data bd;
2010 rq = list_first_entry(list, struct request, queuelist);
2012 WARN_ON_ONCE(hctx != rq->mq_hctx);
2013 prep = blk_mq_prep_dispatch_rq(rq, !nr_budgets);
2014 if (prep != PREP_DISPATCH_OK)
2017 list_del_init(&rq->queuelist);
2020 bd.last = list_empty(list);
2023 * once the request is queued to lld, no need to cover the
2028 ret = q->mq_ops->queue_rq(hctx, &bd);
2033 case BLK_STS_RESOURCE:
2034 needs_resource = true;
2036 case BLK_STS_DEV_RESOURCE:
2037 blk_mq_handle_dev_resource(rq, list);
2039 case BLK_STS_ZONE_RESOURCE:
2041 * Move the request to zone_list and keep going through
2042 * the dispatch list to find more requests the drive can
2045 blk_mq_handle_zone_resource(rq, &zone_list);
2046 needs_resource = true;
2049 blk_mq_end_request(rq, ret);
2051 } while (!list_empty(list));
2053 if (!list_empty(&zone_list))
2054 list_splice_tail_init(&zone_list, list);
2056 /* If we didn't flush the entire list, we could have told the driver
2057 * there was more coming, but that turned out to be a lie.
2059 if (!list_empty(list) || ret != BLK_STS_OK)
2060 blk_mq_commit_rqs(hctx, queued, false);
2063 * Any items that need requeuing? Stuff them into hctx->dispatch,
2064 * that is where we will continue on next queue run.
2066 if (!list_empty(list)) {
2068 /* For non-shared tags, the RESTART check will suffice */
2069 bool no_tag = prep == PREP_DISPATCH_NO_TAG &&
2070 ((hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED) ||
2071 blk_mq_is_shared_tags(hctx->flags));
2074 blk_mq_release_budgets(q, list);
2076 spin_lock(&hctx->lock);
2077 list_splice_tail_init(list, &hctx->dispatch);
2078 spin_unlock(&hctx->lock);
2081 * Order adding requests to hctx->dispatch and checking
2082 * SCHED_RESTART flag. The pair of this smp_mb() is the one
2083 * in blk_mq_sched_restart(). Avoid restart code path to
2084 * miss the new added requests to hctx->dispatch, meantime
2085 * SCHED_RESTART is observed here.
2090 * If SCHED_RESTART was set by the caller of this function and
2091 * it is no longer set that means that it was cleared by another
2092 * thread and hence that a queue rerun is needed.
2094 * If 'no_tag' is set, that means that we failed getting
2095 * a driver tag with an I/O scheduler attached. If our dispatch
2096 * waitqueue is no longer active, ensure that we run the queue
2097 * AFTER adding our entries back to the list.
2099 * If no I/O scheduler has been configured it is possible that
2100 * the hardware queue got stopped and restarted before requests
2101 * were pushed back onto the dispatch list. Rerun the queue to
2102 * avoid starvation. Notes:
2103 * - blk_mq_run_hw_queue() checks whether or not a queue has
2104 * been stopped before rerunning a queue.
2105 * - Some but not all block drivers stop a queue before
2106 * returning BLK_STS_RESOURCE. Two exceptions are scsi-mq
2109 * If driver returns BLK_STS_RESOURCE and SCHED_RESTART
2110 * bit is set, run queue after a delay to avoid IO stalls
2111 * that could otherwise occur if the queue is idle. We'll do
2112 * similar if we couldn't get budget or couldn't lock a zone
2113 * and SCHED_RESTART is set.
2115 needs_restart = blk_mq_sched_needs_restart(hctx);
2116 if (prep == PREP_DISPATCH_NO_BUDGET)
2117 needs_resource = true;
2118 if (!needs_restart ||
2119 (no_tag && list_empty_careful(&hctx->dispatch_wait.entry)))
2120 blk_mq_run_hw_queue(hctx, true);
2121 else if (needs_resource)
2122 blk_mq_delay_run_hw_queue(hctx, BLK_MQ_RESOURCE_DELAY);
2124 blk_mq_update_dispatch_busy(hctx, true);
2128 blk_mq_update_dispatch_busy(hctx, false);
2132 static inline int blk_mq_first_mapped_cpu(struct blk_mq_hw_ctx *hctx)
2134 int cpu = cpumask_first_and(hctx->cpumask, cpu_online_mask);
2136 if (cpu >= nr_cpu_ids)
2137 cpu = cpumask_first(hctx->cpumask);
2142 * It'd be great if the workqueue API had a way to pass
2143 * in a mask and had some smarts for more clever placement.
2144 * For now we just round-robin here, switching for every
2145 * BLK_MQ_CPU_WORK_BATCH queued items.
2147 static int blk_mq_hctx_next_cpu(struct blk_mq_hw_ctx *hctx)
2150 int next_cpu = hctx->next_cpu;
2152 if (hctx->queue->nr_hw_queues == 1)
2153 return WORK_CPU_UNBOUND;
2155 if (--hctx->next_cpu_batch <= 0) {
2157 next_cpu = cpumask_next_and(next_cpu, hctx->cpumask,
2159 if (next_cpu >= nr_cpu_ids)
2160 next_cpu = blk_mq_first_mapped_cpu(hctx);
2161 hctx->next_cpu_batch = BLK_MQ_CPU_WORK_BATCH;
2165 * Do unbound schedule if we can't find a online CPU for this hctx,
2166 * and it should only happen in the path of handling CPU DEAD.
2168 if (!cpu_online(next_cpu)) {
2175 * Make sure to re-select CPU next time once after CPUs
2176 * in hctx->cpumask become online again.
2178 hctx->next_cpu = next_cpu;
2179 hctx->next_cpu_batch = 1;
2180 return WORK_CPU_UNBOUND;
2183 hctx->next_cpu = next_cpu;
2188 * blk_mq_delay_run_hw_queue - Run a hardware queue asynchronously.
2189 * @hctx: Pointer to the hardware queue to run.
2190 * @msecs: Milliseconds of delay to wait before running the queue.
2192 * Run a hardware queue asynchronously with a delay of @msecs.
2194 void blk_mq_delay_run_hw_queue(struct blk_mq_hw_ctx *hctx, unsigned long msecs)
2196 if (unlikely(blk_mq_hctx_stopped(hctx)))
2198 kblockd_mod_delayed_work_on(blk_mq_hctx_next_cpu(hctx), &hctx->run_work,
2199 msecs_to_jiffies(msecs));
2201 EXPORT_SYMBOL(blk_mq_delay_run_hw_queue);
2204 * blk_mq_run_hw_queue - Start to run a hardware queue.
2205 * @hctx: Pointer to the hardware queue to run.
2206 * @async: If we want to run the queue asynchronously.
2208 * Check if the request queue is not in a quiesced state and if there are
2209 * pending requests to be sent. If this is true, run the queue to send requests
2212 void blk_mq_run_hw_queue(struct blk_mq_hw_ctx *hctx, bool async)
2217 * We can't run the queue inline with interrupts disabled.
2219 WARN_ON_ONCE(!async && in_interrupt());
2222 * When queue is quiesced, we may be switching io scheduler, or
2223 * updating nr_hw_queues, or other things, and we can't run queue
2224 * any more, even __blk_mq_hctx_has_pending() can't be called safely.
2226 * And queue will be rerun in blk_mq_unquiesce_queue() if it is
2229 __blk_mq_run_dispatch_ops(hctx->queue, false,
2230 need_run = !blk_queue_quiesced(hctx->queue) &&
2231 blk_mq_hctx_has_pending(hctx));
2236 if (async || (hctx->flags & BLK_MQ_F_BLOCKING) ||
2237 !cpumask_test_cpu(raw_smp_processor_id(), hctx->cpumask)) {
2238 blk_mq_delay_run_hw_queue(hctx, 0);
2242 blk_mq_run_dispatch_ops(hctx->queue,
2243 blk_mq_sched_dispatch_requests(hctx));
2245 EXPORT_SYMBOL(blk_mq_run_hw_queue);
2248 * Return prefered queue to dispatch from (if any) for non-mq aware IO
2251 static struct blk_mq_hw_ctx *blk_mq_get_sq_hctx(struct request_queue *q)
2253 struct blk_mq_ctx *ctx = blk_mq_get_ctx(q);
2255 * If the IO scheduler does not respect hardware queues when
2256 * dispatching, we just don't bother with multiple HW queues and
2257 * dispatch from hctx for the current CPU since running multiple queues
2258 * just causes lock contention inside the scheduler and pointless cache
2261 struct blk_mq_hw_ctx *hctx = ctx->hctxs[HCTX_TYPE_DEFAULT];
2263 if (!blk_mq_hctx_stopped(hctx))
2269 * blk_mq_run_hw_queues - Run all hardware queues in a request queue.
2270 * @q: Pointer to the request queue to run.
2271 * @async: If we want to run the queue asynchronously.
2273 void blk_mq_run_hw_queues(struct request_queue *q, bool async)
2275 struct blk_mq_hw_ctx *hctx, *sq_hctx;
2279 if (blk_queue_sq_sched(q))
2280 sq_hctx = blk_mq_get_sq_hctx(q);
2281 queue_for_each_hw_ctx(q, hctx, i) {
2282 if (blk_mq_hctx_stopped(hctx))
2285 * Dispatch from this hctx either if there's no hctx preferred
2286 * by IO scheduler or if it has requests that bypass the
2289 if (!sq_hctx || sq_hctx == hctx ||
2290 !list_empty_careful(&hctx->dispatch))
2291 blk_mq_run_hw_queue(hctx, async);
2294 EXPORT_SYMBOL(blk_mq_run_hw_queues);
2297 * blk_mq_delay_run_hw_queues - Run all hardware queues asynchronously.
2298 * @q: Pointer to the request queue to run.
2299 * @msecs: Milliseconds of delay to wait before running the queues.
2301 void blk_mq_delay_run_hw_queues(struct request_queue *q, unsigned long msecs)
2303 struct blk_mq_hw_ctx *hctx, *sq_hctx;
2307 if (blk_queue_sq_sched(q))
2308 sq_hctx = blk_mq_get_sq_hctx(q);
2309 queue_for_each_hw_ctx(q, hctx, i) {
2310 if (blk_mq_hctx_stopped(hctx))
2313 * If there is already a run_work pending, leave the
2314 * pending delay untouched. Otherwise, a hctx can stall
2315 * if another hctx is re-delaying the other's work
2316 * before the work executes.
2318 if (delayed_work_pending(&hctx->run_work))
2321 * Dispatch from this hctx either if there's no hctx preferred
2322 * by IO scheduler or if it has requests that bypass the
2325 if (!sq_hctx || sq_hctx == hctx ||
2326 !list_empty_careful(&hctx->dispatch))
2327 blk_mq_delay_run_hw_queue(hctx, msecs);
2330 EXPORT_SYMBOL(blk_mq_delay_run_hw_queues);
2333 * This function is often used for pausing .queue_rq() by driver when
2334 * there isn't enough resource or some conditions aren't satisfied, and
2335 * BLK_STS_RESOURCE is usually returned.
2337 * We do not guarantee that dispatch can be drained or blocked
2338 * after blk_mq_stop_hw_queue() returns. Please use
2339 * blk_mq_quiesce_queue() for that requirement.
2341 void blk_mq_stop_hw_queue(struct blk_mq_hw_ctx *hctx)
2343 cancel_delayed_work(&hctx->run_work);
2345 set_bit(BLK_MQ_S_STOPPED, &hctx->state);
2347 EXPORT_SYMBOL(blk_mq_stop_hw_queue);
2350 * This function is often used for pausing .queue_rq() by driver when
2351 * there isn't enough resource or some conditions aren't satisfied, and
2352 * BLK_STS_RESOURCE is usually returned.
2354 * We do not guarantee that dispatch can be drained or blocked
2355 * after blk_mq_stop_hw_queues() returns. Please use
2356 * blk_mq_quiesce_queue() for that requirement.
2358 void blk_mq_stop_hw_queues(struct request_queue *q)
2360 struct blk_mq_hw_ctx *hctx;
2363 queue_for_each_hw_ctx(q, hctx, i)
2364 blk_mq_stop_hw_queue(hctx);
2366 EXPORT_SYMBOL(blk_mq_stop_hw_queues);
2368 void blk_mq_start_hw_queue(struct blk_mq_hw_ctx *hctx)
2370 clear_bit(BLK_MQ_S_STOPPED, &hctx->state);
2372 blk_mq_run_hw_queue(hctx, false);
2374 EXPORT_SYMBOL(blk_mq_start_hw_queue);
2376 void blk_mq_start_hw_queues(struct request_queue *q)
2378 struct blk_mq_hw_ctx *hctx;
2381 queue_for_each_hw_ctx(q, hctx, i)
2382 blk_mq_start_hw_queue(hctx);
2384 EXPORT_SYMBOL(blk_mq_start_hw_queues);
2386 void blk_mq_start_stopped_hw_queue(struct blk_mq_hw_ctx *hctx, bool async)
2388 if (!blk_mq_hctx_stopped(hctx))
2391 clear_bit(BLK_MQ_S_STOPPED, &hctx->state);
2392 blk_mq_run_hw_queue(hctx, async);
2394 EXPORT_SYMBOL_GPL(blk_mq_start_stopped_hw_queue);
2396 void blk_mq_start_stopped_hw_queues(struct request_queue *q, bool async)
2398 struct blk_mq_hw_ctx *hctx;
2401 queue_for_each_hw_ctx(q, hctx, i)
2402 blk_mq_start_stopped_hw_queue(hctx, async);
2404 EXPORT_SYMBOL(blk_mq_start_stopped_hw_queues);
2406 static void blk_mq_run_work_fn(struct work_struct *work)
2408 struct blk_mq_hw_ctx *hctx =
2409 container_of(work, struct blk_mq_hw_ctx, run_work.work);
2411 blk_mq_run_dispatch_ops(hctx->queue,
2412 blk_mq_sched_dispatch_requests(hctx));
2416 * blk_mq_request_bypass_insert - Insert a request at dispatch list.
2417 * @rq: Pointer to request to be inserted.
2418 * @flags: BLK_MQ_INSERT_*
2420 * Should only be used carefully, when the caller knows we want to
2421 * bypass a potential IO scheduler on the target device.
2423 static void blk_mq_request_bypass_insert(struct request *rq, blk_insert_t flags)
2425 struct blk_mq_hw_ctx *hctx = rq->mq_hctx;
2427 spin_lock(&hctx->lock);
2428 if (flags & BLK_MQ_INSERT_AT_HEAD)
2429 list_add(&rq->queuelist, &hctx->dispatch);
2431 list_add_tail(&rq->queuelist, &hctx->dispatch);
2432 spin_unlock(&hctx->lock);
2435 static void blk_mq_insert_requests(struct blk_mq_hw_ctx *hctx,
2436 struct blk_mq_ctx *ctx, struct list_head *list,
2437 bool run_queue_async)
2440 enum hctx_type type = hctx->type;
2443 * Try to issue requests directly if the hw queue isn't busy to save an
2444 * extra enqueue & dequeue to the sw queue.
2446 if (!hctx->dispatch_busy && !run_queue_async) {
2447 blk_mq_run_dispatch_ops(hctx->queue,
2448 blk_mq_try_issue_list_directly(hctx, list));
2449 if (list_empty(list))
2454 * preemption doesn't flush plug list, so it's possible ctx->cpu is
2457 list_for_each_entry(rq, list, queuelist) {
2458 BUG_ON(rq->mq_ctx != ctx);
2459 trace_block_rq_insert(rq);
2462 spin_lock(&ctx->lock);
2463 list_splice_tail_init(list, &ctx->rq_lists[type]);
2464 blk_mq_hctx_mark_pending(hctx, ctx);
2465 spin_unlock(&ctx->lock);
2467 blk_mq_run_hw_queue(hctx, run_queue_async);
2470 static void blk_mq_insert_request(struct request *rq, blk_insert_t flags)
2472 struct request_queue *q = rq->q;
2473 struct blk_mq_ctx *ctx = rq->mq_ctx;
2474 struct blk_mq_hw_ctx *hctx = rq->mq_hctx;
2476 if (blk_rq_is_passthrough(rq)) {
2478 * Passthrough request have to be added to hctx->dispatch
2479 * directly. The device may be in a situation where it can't
2480 * handle FS request, and always returns BLK_STS_RESOURCE for
2481 * them, which gets them added to hctx->dispatch.
2483 * If a passthrough request is required to unblock the queues,
2484 * and it is added to the scheduler queue, there is no chance to
2485 * dispatch it given we prioritize requests in hctx->dispatch.
2487 blk_mq_request_bypass_insert(rq, flags);
2488 } else if (req_op(rq) == REQ_OP_FLUSH) {
2490 * Firstly normal IO request is inserted to scheduler queue or
2491 * sw queue, meantime we add flush request to dispatch queue(
2492 * hctx->dispatch) directly and there is at most one in-flight
2493 * flush request for each hw queue, so it doesn't matter to add
2494 * flush request to tail or front of the dispatch queue.
2496 * Secondly in case of NCQ, flush request belongs to non-NCQ
2497 * command, and queueing it will fail when there is any
2498 * in-flight normal IO request(NCQ command). When adding flush
2499 * rq to the front of hctx->dispatch, it is easier to introduce
2500 * extra time to flush rq's latency because of S_SCHED_RESTART
2501 * compared with adding to the tail of dispatch queue, then
2502 * chance of flush merge is increased, and less flush requests
2503 * will be issued to controller. It is observed that ~10% time
2504 * is saved in blktests block/004 on disk attached to AHCI/NCQ
2505 * drive when adding flush rq to the front of hctx->dispatch.
2507 * Simply queue flush rq to the front of hctx->dispatch so that
2508 * intensive flush workloads can benefit in case of NCQ HW.
2510 blk_mq_request_bypass_insert(rq, BLK_MQ_INSERT_AT_HEAD);
2511 } else if (q->elevator) {
2514 WARN_ON_ONCE(rq->tag != BLK_MQ_NO_TAG);
2516 list_add(&rq->queuelist, &list);
2517 q->elevator->type->ops.insert_requests(hctx, &list, flags);
2519 trace_block_rq_insert(rq);
2521 spin_lock(&ctx->lock);
2522 if (flags & BLK_MQ_INSERT_AT_HEAD)
2523 list_add(&rq->queuelist, &ctx->rq_lists[hctx->type]);
2525 list_add_tail(&rq->queuelist,
2526 &ctx->rq_lists[hctx->type]);
2527 blk_mq_hctx_mark_pending(hctx, ctx);
2528 spin_unlock(&ctx->lock);
2532 static void blk_mq_bio_to_request(struct request *rq, struct bio *bio,
2533 unsigned int nr_segs)
2537 if (bio->bi_opf & REQ_RAHEAD)
2538 rq->cmd_flags |= REQ_FAILFAST_MASK;
2540 rq->__sector = bio->bi_iter.bi_sector;
2541 blk_rq_bio_prep(rq, bio, nr_segs);
2543 /* This can't fail, since GFP_NOIO includes __GFP_DIRECT_RECLAIM. */
2544 err = blk_crypto_rq_bio_prep(rq, bio, GFP_NOIO);
2547 blk_account_io_start(rq);
2550 static blk_status_t __blk_mq_issue_directly(struct blk_mq_hw_ctx *hctx,
2551 struct request *rq, bool last)
2553 struct request_queue *q = rq->q;
2554 struct blk_mq_queue_data bd = {
2561 * For OK queue, we are done. For error, caller may kill it.
2562 * Any other error (busy), just add it to our list as we
2563 * previously would have done.
2565 ret = q->mq_ops->queue_rq(hctx, &bd);
2568 blk_mq_update_dispatch_busy(hctx, false);
2570 case BLK_STS_RESOURCE:
2571 case BLK_STS_DEV_RESOURCE:
2572 blk_mq_update_dispatch_busy(hctx, true);
2573 __blk_mq_requeue_request(rq);
2576 blk_mq_update_dispatch_busy(hctx, false);
2583 static bool blk_mq_get_budget_and_tag(struct request *rq)
2587 budget_token = blk_mq_get_dispatch_budget(rq->q);
2588 if (budget_token < 0)
2590 blk_mq_set_rq_budget_token(rq, budget_token);
2591 if (!blk_mq_get_driver_tag(rq)) {
2592 blk_mq_put_dispatch_budget(rq->q, budget_token);
2599 * blk_mq_try_issue_directly - Try to send a request directly to device driver.
2600 * @hctx: Pointer of the associated hardware queue.
2601 * @rq: Pointer to request to be sent.
2603 * If the device has enough resources to accept a new request now, send the
2604 * request directly to device driver. Else, insert at hctx->dispatch queue, so
2605 * we can try send it another time in the future. Requests inserted at this
2606 * queue have higher priority.
2608 static void blk_mq_try_issue_directly(struct blk_mq_hw_ctx *hctx,
2613 if (blk_mq_hctx_stopped(hctx) || blk_queue_quiesced(rq->q)) {
2614 blk_mq_insert_request(rq, 0);
2618 if ((rq->rq_flags & RQF_USE_SCHED) || !blk_mq_get_budget_and_tag(rq)) {
2619 blk_mq_insert_request(rq, 0);
2620 blk_mq_run_hw_queue(hctx, false);
2624 ret = __blk_mq_issue_directly(hctx, rq, true);
2628 case BLK_STS_RESOURCE:
2629 case BLK_STS_DEV_RESOURCE:
2630 blk_mq_request_bypass_insert(rq, 0);
2631 blk_mq_run_hw_queue(hctx, false);
2634 blk_mq_end_request(rq, ret);
2639 static blk_status_t blk_mq_request_issue_directly(struct request *rq, bool last)
2641 struct blk_mq_hw_ctx *hctx = rq->mq_hctx;
2643 if (blk_mq_hctx_stopped(hctx) || blk_queue_quiesced(rq->q)) {
2644 blk_mq_insert_request(rq, 0);
2648 if (!blk_mq_get_budget_and_tag(rq))
2649 return BLK_STS_RESOURCE;
2650 return __blk_mq_issue_directly(hctx, rq, last);
2653 static void blk_mq_plug_issue_direct(struct blk_plug *plug)
2655 struct blk_mq_hw_ctx *hctx = NULL;
2658 blk_status_t ret = BLK_STS_OK;
2660 while ((rq = rq_list_pop(&plug->mq_list))) {
2661 bool last = rq_list_empty(plug->mq_list);
2663 if (hctx != rq->mq_hctx) {
2665 blk_mq_commit_rqs(hctx, queued, false);
2671 ret = blk_mq_request_issue_directly(rq, last);
2676 case BLK_STS_RESOURCE:
2677 case BLK_STS_DEV_RESOURCE:
2678 blk_mq_request_bypass_insert(rq, 0);
2679 blk_mq_run_hw_queue(hctx, false);
2682 blk_mq_end_request(rq, ret);
2688 if (ret != BLK_STS_OK)
2689 blk_mq_commit_rqs(hctx, queued, false);
2692 static void __blk_mq_flush_plug_list(struct request_queue *q,
2693 struct blk_plug *plug)
2695 if (blk_queue_quiesced(q))
2697 q->mq_ops->queue_rqs(&plug->mq_list);
2700 static void blk_mq_dispatch_plug_list(struct blk_plug *plug, bool from_sched)
2702 struct blk_mq_hw_ctx *this_hctx = NULL;
2703 struct blk_mq_ctx *this_ctx = NULL;
2704 struct request *requeue_list = NULL;
2705 struct request **requeue_lastp = &requeue_list;
2706 unsigned int depth = 0;
2707 bool is_passthrough = false;
2711 struct request *rq = rq_list_pop(&plug->mq_list);
2714 this_hctx = rq->mq_hctx;
2715 this_ctx = rq->mq_ctx;
2716 is_passthrough = blk_rq_is_passthrough(rq);
2717 } else if (this_hctx != rq->mq_hctx || this_ctx != rq->mq_ctx ||
2718 is_passthrough != blk_rq_is_passthrough(rq)) {
2719 rq_list_add_tail(&requeue_lastp, rq);
2722 list_add(&rq->queuelist, &list);
2724 } while (!rq_list_empty(plug->mq_list));
2726 plug->mq_list = requeue_list;
2727 trace_block_unplug(this_hctx->queue, depth, !from_sched);
2729 percpu_ref_get(&this_hctx->queue->q_usage_counter);
2730 /* passthrough requests should never be issued to the I/O scheduler */
2731 if (is_passthrough) {
2732 spin_lock(&this_hctx->lock);
2733 list_splice_tail_init(&list, &this_hctx->dispatch);
2734 spin_unlock(&this_hctx->lock);
2735 blk_mq_run_hw_queue(this_hctx, from_sched);
2736 } else if (this_hctx->queue->elevator) {
2737 this_hctx->queue->elevator->type->ops.insert_requests(this_hctx,
2739 blk_mq_run_hw_queue(this_hctx, from_sched);
2741 blk_mq_insert_requests(this_hctx, this_ctx, &list, from_sched);
2743 percpu_ref_put(&this_hctx->queue->q_usage_counter);
2746 void blk_mq_flush_plug_list(struct blk_plug *plug, bool from_schedule)
2750 if (rq_list_empty(plug->mq_list))
2754 if (!plug->multiple_queues && !plug->has_elevator && !from_schedule) {
2755 struct request_queue *q;
2757 rq = rq_list_peek(&plug->mq_list);
2761 * Peek first request and see if we have a ->queue_rqs() hook.
2762 * If we do, we can dispatch the whole plug list in one go. We
2763 * already know at this point that all requests belong to the
2764 * same queue, caller must ensure that's the case.
2766 * Since we pass off the full list to the driver at this point,
2767 * we do not increment the active request count for the queue.
2768 * Bypass shared tags for now because of that.
2770 if (q->mq_ops->queue_rqs &&
2771 !(rq->mq_hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED)) {
2772 blk_mq_run_dispatch_ops(q,
2773 __blk_mq_flush_plug_list(q, plug));
2774 if (rq_list_empty(plug->mq_list))
2778 blk_mq_run_dispatch_ops(q,
2779 blk_mq_plug_issue_direct(plug));
2780 if (rq_list_empty(plug->mq_list))
2785 blk_mq_dispatch_plug_list(plug, from_schedule);
2786 } while (!rq_list_empty(plug->mq_list));
2789 static void blk_mq_try_issue_list_directly(struct blk_mq_hw_ctx *hctx,
2790 struct list_head *list)
2793 blk_status_t ret = BLK_STS_OK;
2795 while (!list_empty(list)) {
2796 struct request *rq = list_first_entry(list, struct request,
2799 list_del_init(&rq->queuelist);
2800 ret = blk_mq_request_issue_directly(rq, list_empty(list));
2805 case BLK_STS_RESOURCE:
2806 case BLK_STS_DEV_RESOURCE:
2807 blk_mq_request_bypass_insert(rq, 0);
2808 if (list_empty(list))
2809 blk_mq_run_hw_queue(hctx, false);
2812 blk_mq_end_request(rq, ret);
2818 if (ret != BLK_STS_OK)
2819 blk_mq_commit_rqs(hctx, queued, false);
2822 static bool blk_mq_attempt_bio_merge(struct request_queue *q,
2823 struct bio *bio, unsigned int nr_segs)
2825 if (!blk_queue_nomerges(q) && bio_mergeable(bio)) {
2826 if (blk_attempt_plug_merge(q, bio, nr_segs))
2828 if (blk_mq_sched_bio_merge(q, bio, nr_segs))
2834 static struct request *blk_mq_get_new_requests(struct request_queue *q,
2835 struct blk_plug *plug,
2839 struct blk_mq_alloc_data data = {
2842 .cmd_flags = bio->bi_opf,
2846 if (unlikely(bio_queue_enter(bio)))
2849 if (blk_mq_attempt_bio_merge(q, bio, nsegs))
2852 rq_qos_throttle(q, bio);
2855 data.nr_tags = plug->nr_ios;
2857 data.cached_rq = &plug->cached_rq;
2860 rq = __blk_mq_alloc_requests(&data);
2863 rq_qos_cleanup(q, bio);
2864 if (bio->bi_opf & REQ_NOWAIT)
2865 bio_wouldblock_error(bio);
2871 static inline struct request *blk_mq_get_cached_request(struct request_queue *q,
2872 struct blk_plug *plug, struct bio **bio, unsigned int nsegs)
2875 enum hctx_type type, hctx_type;
2879 rq = rq_list_peek(&plug->cached_rq);
2880 if (!rq || rq->q != q)
2883 if (blk_mq_attempt_bio_merge(q, *bio, nsegs)) {
2888 type = blk_mq_get_hctx_type((*bio)->bi_opf);
2889 hctx_type = rq->mq_hctx->type;
2890 if (type != hctx_type &&
2891 !(type == HCTX_TYPE_READ && hctx_type == HCTX_TYPE_DEFAULT))
2893 if (op_is_flush(rq->cmd_flags) != op_is_flush((*bio)->bi_opf))
2897 * If any qos ->throttle() end up blocking, we will have flushed the
2898 * plug and hence killed the cached_rq list as well. Pop this entry
2899 * before we throttle.
2901 plug->cached_rq = rq_list_next(rq);
2902 rq_qos_throttle(q, *bio);
2904 rq->cmd_flags = (*bio)->bi_opf;
2905 INIT_LIST_HEAD(&rq->queuelist);
2909 static void bio_set_ioprio(struct bio *bio)
2911 /* Nobody set ioprio so far? Initialize it based on task's nice value */
2912 if (IOPRIO_PRIO_CLASS(bio->bi_ioprio) == IOPRIO_CLASS_NONE)
2913 bio->bi_ioprio = get_current_ioprio();
2914 blkcg_set_ioprio(bio);
2918 * blk_mq_submit_bio - Create and send a request to block device.
2919 * @bio: Bio pointer.
2921 * Builds up a request structure from @q and @bio and send to the device. The
2922 * request may not be queued directly to hardware if:
2923 * * This request can be merged with another one
2924 * * We want to place request at plug queue for possible future merging
2925 * * There is an IO scheduler active at this queue
2927 * It will not queue the request if there is an error with the bio, or at the
2930 void blk_mq_submit_bio(struct bio *bio)
2932 struct request_queue *q = bdev_get_queue(bio->bi_bdev);
2933 struct blk_plug *plug = blk_mq_plug(bio);
2934 const int is_sync = op_is_sync(bio->bi_opf);
2935 struct blk_mq_hw_ctx *hctx;
2937 unsigned int nr_segs = 1;
2940 bio = blk_queue_bounce(bio, q);
2941 if (bio_may_exceed_limits(bio, &q->limits)) {
2942 bio = __bio_split_to_limits(bio, &q->limits, &nr_segs);
2947 if (!bio_integrity_prep(bio))
2950 bio_set_ioprio(bio);
2952 rq = blk_mq_get_cached_request(q, plug, &bio, nr_segs);
2956 rq = blk_mq_get_new_requests(q, plug, bio, nr_segs);
2961 trace_block_getrq(bio);
2963 rq_qos_track(q, rq, bio);
2965 blk_mq_bio_to_request(rq, bio, nr_segs);
2967 ret = blk_crypto_rq_get_keyslot(rq);
2968 if (ret != BLK_STS_OK) {
2969 bio->bi_status = ret;
2971 blk_mq_free_request(rq);
2975 if (op_is_flush(bio->bi_opf) && blk_insert_flush(rq))
2979 blk_add_rq_to_plug(plug, rq);
2984 if ((rq->rq_flags & RQF_USE_SCHED) ||
2985 (hctx->dispatch_busy && (q->nr_hw_queues == 1 || !is_sync))) {
2986 blk_mq_insert_request(rq, 0);
2987 blk_mq_run_hw_queue(hctx, true);
2989 blk_mq_run_dispatch_ops(q, blk_mq_try_issue_directly(hctx, rq));
2993 #ifdef CONFIG_BLK_MQ_STACKING
2995 * blk_insert_cloned_request - Helper for stacking drivers to submit a request
2996 * @rq: the request being queued
2998 blk_status_t blk_insert_cloned_request(struct request *rq)
3000 struct request_queue *q = rq->q;
3001 unsigned int max_sectors = blk_queue_get_max_sectors(q, req_op(rq));
3002 unsigned int max_segments = blk_rq_get_max_segments(rq);
3005 if (blk_rq_sectors(rq) > max_sectors) {
3007 * SCSI device does not have a good way to return if
3008 * Write Same/Zero is actually supported. If a device rejects
3009 * a non-read/write command (discard, write same,etc.) the
3010 * low-level device driver will set the relevant queue limit to
3011 * 0 to prevent blk-lib from issuing more of the offending
3012 * operations. Commands queued prior to the queue limit being
3013 * reset need to be completed with BLK_STS_NOTSUPP to avoid I/O
3014 * errors being propagated to upper layers.
3016 if (max_sectors == 0)
3017 return BLK_STS_NOTSUPP;
3019 printk(KERN_ERR "%s: over max size limit. (%u > %u)\n",
3020 __func__, blk_rq_sectors(rq), max_sectors);
3021 return BLK_STS_IOERR;
3025 * The queue settings related to segment counting may differ from the
3028 rq->nr_phys_segments = blk_recalc_rq_segments(rq);
3029 if (rq->nr_phys_segments > max_segments) {
3030 printk(KERN_ERR "%s: over max segments limit. (%u > %u)\n",
3031 __func__, rq->nr_phys_segments, max_segments);
3032 return BLK_STS_IOERR;
3035 if (q->disk && should_fail_request(q->disk->part0, blk_rq_bytes(rq)))
3036 return BLK_STS_IOERR;
3038 ret = blk_crypto_rq_get_keyslot(rq);
3039 if (ret != BLK_STS_OK)
3042 blk_account_io_start(rq);
3045 * Since we have a scheduler attached on the top device,
3046 * bypass a potential scheduler on the bottom device for
3049 blk_mq_run_dispatch_ops(q,
3050 ret = blk_mq_request_issue_directly(rq, true));
3052 blk_account_io_done(rq, ktime_get_ns());
3055 EXPORT_SYMBOL_GPL(blk_insert_cloned_request);
3058 * blk_rq_unprep_clone - Helper function to free all bios in a cloned request
3059 * @rq: the clone request to be cleaned up
3062 * Free all bios in @rq for a cloned request.
3064 void blk_rq_unprep_clone(struct request *rq)
3068 while ((bio = rq->bio) != NULL) {
3069 rq->bio = bio->bi_next;
3074 EXPORT_SYMBOL_GPL(blk_rq_unprep_clone);
3077 * blk_rq_prep_clone - Helper function to setup clone request
3078 * @rq: the request to be setup
3079 * @rq_src: original request to be cloned
3080 * @bs: bio_set that bios for clone are allocated from
3081 * @gfp_mask: memory allocation mask for bio
3082 * @bio_ctr: setup function to be called for each clone bio.
3083 * Returns %0 for success, non %0 for failure.
3084 * @data: private data to be passed to @bio_ctr
3087 * Clones bios in @rq_src to @rq, and copies attributes of @rq_src to @rq.
3088 * Also, pages which the original bios are pointing to are not copied
3089 * and the cloned bios just point same pages.
3090 * So cloned bios must be completed before original bios, which means
3091 * the caller must complete @rq before @rq_src.
3093 int blk_rq_prep_clone(struct request *rq, struct request *rq_src,
3094 struct bio_set *bs, gfp_t gfp_mask,
3095 int (*bio_ctr)(struct bio *, struct bio *, void *),
3098 struct bio *bio, *bio_src;
3103 __rq_for_each_bio(bio_src, rq_src) {
3104 bio = bio_alloc_clone(rq->q->disk->part0, bio_src, gfp_mask,
3109 if (bio_ctr && bio_ctr(bio, bio_src, data))
3113 rq->biotail->bi_next = bio;
3116 rq->bio = rq->biotail = bio;
3121 /* Copy attributes of the original request to the clone request. */
3122 rq->__sector = blk_rq_pos(rq_src);
3123 rq->__data_len = blk_rq_bytes(rq_src);
3124 if (rq_src->rq_flags & RQF_SPECIAL_PAYLOAD) {
3125 rq->rq_flags |= RQF_SPECIAL_PAYLOAD;
3126 rq->special_vec = rq_src->special_vec;
3128 rq->nr_phys_segments = rq_src->nr_phys_segments;
3129 rq->ioprio = rq_src->ioprio;
3131 if (rq->bio && blk_crypto_rq_bio_prep(rq, rq->bio, gfp_mask) < 0)
3139 blk_rq_unprep_clone(rq);
3143 EXPORT_SYMBOL_GPL(blk_rq_prep_clone);
3144 #endif /* CONFIG_BLK_MQ_STACKING */
3147 * Steal bios from a request and add them to a bio list.
3148 * The request must not have been partially completed before.
3150 void blk_steal_bios(struct bio_list *list, struct request *rq)
3154 list->tail->bi_next = rq->bio;
3156 list->head = rq->bio;
3157 list->tail = rq->biotail;
3165 EXPORT_SYMBOL_GPL(blk_steal_bios);
3167 static size_t order_to_size(unsigned int order)
3169 return (size_t)PAGE_SIZE << order;
3172 /* called before freeing request pool in @tags */
3173 static void blk_mq_clear_rq_mapping(struct blk_mq_tags *drv_tags,
3174 struct blk_mq_tags *tags)
3177 unsigned long flags;
3180 * There is no need to clear mapping if driver tags is not initialized
3181 * or the mapping belongs to the driver tags.
3183 if (!drv_tags || drv_tags == tags)
3186 list_for_each_entry(page, &tags->page_list, lru) {
3187 unsigned long start = (unsigned long)page_address(page);
3188 unsigned long end = start + order_to_size(page->private);
3191 for (i = 0; i < drv_tags->nr_tags; i++) {
3192 struct request *rq = drv_tags->rqs[i];
3193 unsigned long rq_addr = (unsigned long)rq;
3195 if (rq_addr >= start && rq_addr < end) {
3196 WARN_ON_ONCE(req_ref_read(rq) != 0);
3197 cmpxchg(&drv_tags->rqs[i], rq, NULL);
3203 * Wait until all pending iteration is done.
3205 * Request reference is cleared and it is guaranteed to be observed
3206 * after the ->lock is released.
3208 spin_lock_irqsave(&drv_tags->lock, flags);
3209 spin_unlock_irqrestore(&drv_tags->lock, flags);
3212 void blk_mq_free_rqs(struct blk_mq_tag_set *set, struct blk_mq_tags *tags,
3213 unsigned int hctx_idx)
3215 struct blk_mq_tags *drv_tags;
3218 if (list_empty(&tags->page_list))
3221 if (blk_mq_is_shared_tags(set->flags))
3222 drv_tags = set->shared_tags;
3224 drv_tags = set->tags[hctx_idx];
3226 if (tags->static_rqs && set->ops->exit_request) {
3229 for (i = 0; i < tags->nr_tags; i++) {
3230 struct request *rq = tags->static_rqs[i];
3234 set->ops->exit_request(set, rq, hctx_idx);
3235 tags->static_rqs[i] = NULL;
3239 blk_mq_clear_rq_mapping(drv_tags, tags);
3241 while (!list_empty(&tags->page_list)) {
3242 page = list_first_entry(&tags->page_list, struct page, lru);
3243 list_del_init(&page->lru);
3245 * Remove kmemleak object previously allocated in
3246 * blk_mq_alloc_rqs().
3248 kmemleak_free(page_address(page));
3249 __free_pages(page, page->private);
3253 void blk_mq_free_rq_map(struct blk_mq_tags *tags)
3257 kfree(tags->static_rqs);
3258 tags->static_rqs = NULL;
3260 blk_mq_free_tags(tags);
3263 static enum hctx_type hctx_idx_to_type(struct blk_mq_tag_set *set,
3264 unsigned int hctx_idx)
3268 for (i = 0; i < set->nr_maps; i++) {
3269 unsigned int start = set->map[i].queue_offset;
3270 unsigned int end = start + set->map[i].nr_queues;
3272 if (hctx_idx >= start && hctx_idx < end)
3276 if (i >= set->nr_maps)
3277 i = HCTX_TYPE_DEFAULT;
3282 static int blk_mq_get_hctx_node(struct blk_mq_tag_set *set,
3283 unsigned int hctx_idx)
3285 enum hctx_type type = hctx_idx_to_type(set, hctx_idx);
3287 return blk_mq_hw_queue_to_node(&set->map[type], hctx_idx);
3290 static struct blk_mq_tags *blk_mq_alloc_rq_map(struct blk_mq_tag_set *set,
3291 unsigned int hctx_idx,
3292 unsigned int nr_tags,
3293 unsigned int reserved_tags)
3295 int node = blk_mq_get_hctx_node(set, hctx_idx);
3296 struct blk_mq_tags *tags;
3298 if (node == NUMA_NO_NODE)
3299 node = set->numa_node;
3301 tags = blk_mq_init_tags(nr_tags, reserved_tags, node,
3302 BLK_MQ_FLAG_TO_ALLOC_POLICY(set->flags));
3306 tags->rqs = kcalloc_node(nr_tags, sizeof(struct request *),
3307 GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY,
3312 tags->static_rqs = kcalloc_node(nr_tags, sizeof(struct request *),
3313 GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY,
3315 if (!tags->static_rqs)
3323 blk_mq_free_tags(tags);
3327 static int blk_mq_init_request(struct blk_mq_tag_set *set, struct request *rq,
3328 unsigned int hctx_idx, int node)
3332 if (set->ops->init_request) {
3333 ret = set->ops->init_request(set, rq, hctx_idx, node);
3338 WRITE_ONCE(rq->state, MQ_RQ_IDLE);
3342 static int blk_mq_alloc_rqs(struct blk_mq_tag_set *set,
3343 struct blk_mq_tags *tags,
3344 unsigned int hctx_idx, unsigned int depth)
3346 unsigned int i, j, entries_per_page, max_order = 4;
3347 int node = blk_mq_get_hctx_node(set, hctx_idx);
3348 size_t rq_size, left;
3350 if (node == NUMA_NO_NODE)
3351 node = set->numa_node;
3353 INIT_LIST_HEAD(&tags->page_list);
3356 * rq_size is the size of the request plus driver payload, rounded
3357 * to the cacheline size
3359 rq_size = round_up(sizeof(struct request) + set->cmd_size,
3361 left = rq_size * depth;
3363 for (i = 0; i < depth; ) {
3364 int this_order = max_order;
3369 while (this_order && left < order_to_size(this_order - 1))
3373 page = alloc_pages_node(node,
3374 GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY | __GFP_ZERO,
3380 if (order_to_size(this_order) < rq_size)
3387 page->private = this_order;
3388 list_add_tail(&page->lru, &tags->page_list);
3390 p = page_address(page);
3392 * Allow kmemleak to scan these pages as they contain pointers
3393 * to additional allocations like via ops->init_request().
3395 kmemleak_alloc(p, order_to_size(this_order), 1, GFP_NOIO);
3396 entries_per_page = order_to_size(this_order) / rq_size;
3397 to_do = min(entries_per_page, depth - i);
3398 left -= to_do * rq_size;
3399 for (j = 0; j < to_do; j++) {
3400 struct request *rq = p;
3402 tags->static_rqs[i] = rq;
3403 if (blk_mq_init_request(set, rq, hctx_idx, node)) {
3404 tags->static_rqs[i] = NULL;
3415 blk_mq_free_rqs(set, tags, hctx_idx);
3419 struct rq_iter_data {
3420 struct blk_mq_hw_ctx *hctx;
3424 static bool blk_mq_has_request(struct request *rq, void *data)
3426 struct rq_iter_data *iter_data = data;
3428 if (rq->mq_hctx != iter_data->hctx)
3430 iter_data->has_rq = true;
3434 static bool blk_mq_hctx_has_requests(struct blk_mq_hw_ctx *hctx)
3436 struct blk_mq_tags *tags = hctx->sched_tags ?
3437 hctx->sched_tags : hctx->tags;
3438 struct rq_iter_data data = {
3442 blk_mq_all_tag_iter(tags, blk_mq_has_request, &data);
3446 static inline bool blk_mq_last_cpu_in_hctx(unsigned int cpu,
3447 struct blk_mq_hw_ctx *hctx)
3449 if (cpumask_first_and(hctx->cpumask, cpu_online_mask) != cpu)
3451 if (cpumask_next_and(cpu, hctx->cpumask, cpu_online_mask) < nr_cpu_ids)
3456 static int blk_mq_hctx_notify_offline(unsigned int cpu, struct hlist_node *node)
3458 struct blk_mq_hw_ctx *hctx = hlist_entry_safe(node,
3459 struct blk_mq_hw_ctx, cpuhp_online);
3461 if (!cpumask_test_cpu(cpu, hctx->cpumask) ||
3462 !blk_mq_last_cpu_in_hctx(cpu, hctx))
3466 * Prevent new request from being allocated on the current hctx.
3468 * The smp_mb__after_atomic() Pairs with the implied barrier in
3469 * test_and_set_bit_lock in sbitmap_get(). Ensures the inactive flag is
3470 * seen once we return from the tag allocator.
3472 set_bit(BLK_MQ_S_INACTIVE, &hctx->state);
3473 smp_mb__after_atomic();
3476 * Try to grab a reference to the queue and wait for any outstanding
3477 * requests. If we could not grab a reference the queue has been
3478 * frozen and there are no requests.
3480 if (percpu_ref_tryget(&hctx->queue->q_usage_counter)) {
3481 while (blk_mq_hctx_has_requests(hctx))
3483 percpu_ref_put(&hctx->queue->q_usage_counter);
3489 static int blk_mq_hctx_notify_online(unsigned int cpu, struct hlist_node *node)
3491 struct blk_mq_hw_ctx *hctx = hlist_entry_safe(node,
3492 struct blk_mq_hw_ctx, cpuhp_online);
3494 if (cpumask_test_cpu(cpu, hctx->cpumask))
3495 clear_bit(BLK_MQ_S_INACTIVE, &hctx->state);
3500 * 'cpu' is going away. splice any existing rq_list entries from this
3501 * software queue to the hw queue dispatch list, and ensure that it
3504 static int blk_mq_hctx_notify_dead(unsigned int cpu, struct hlist_node *node)
3506 struct blk_mq_hw_ctx *hctx;
3507 struct blk_mq_ctx *ctx;
3509 enum hctx_type type;
3511 hctx = hlist_entry_safe(node, struct blk_mq_hw_ctx, cpuhp_dead);
3512 if (!cpumask_test_cpu(cpu, hctx->cpumask))
3515 ctx = __blk_mq_get_ctx(hctx->queue, cpu);
3518 spin_lock(&ctx->lock);
3519 if (!list_empty(&ctx->rq_lists[type])) {
3520 list_splice_init(&ctx->rq_lists[type], &tmp);
3521 blk_mq_hctx_clear_pending(hctx, ctx);
3523 spin_unlock(&ctx->lock);
3525 if (list_empty(&tmp))
3528 spin_lock(&hctx->lock);
3529 list_splice_tail_init(&tmp, &hctx->dispatch);
3530 spin_unlock(&hctx->lock);
3532 blk_mq_run_hw_queue(hctx, true);
3536 static void blk_mq_remove_cpuhp(struct blk_mq_hw_ctx *hctx)
3538 if (!(hctx->flags & BLK_MQ_F_STACKING))
3539 cpuhp_state_remove_instance_nocalls(CPUHP_AP_BLK_MQ_ONLINE,
3540 &hctx->cpuhp_online);
3541 cpuhp_state_remove_instance_nocalls(CPUHP_BLK_MQ_DEAD,
3546 * Before freeing hw queue, clearing the flush request reference in
3547 * tags->rqs[] for avoiding potential UAF.
3549 static void blk_mq_clear_flush_rq_mapping(struct blk_mq_tags *tags,
3550 unsigned int queue_depth, struct request *flush_rq)
3553 unsigned long flags;
3555 /* The hw queue may not be mapped yet */
3559 WARN_ON_ONCE(req_ref_read(flush_rq) != 0);
3561 for (i = 0; i < queue_depth; i++)
3562 cmpxchg(&tags->rqs[i], flush_rq, NULL);
3565 * Wait until all pending iteration is done.
3567 * Request reference is cleared and it is guaranteed to be observed
3568 * after the ->lock is released.
3570 spin_lock_irqsave(&tags->lock, flags);
3571 spin_unlock_irqrestore(&tags->lock, flags);
3574 /* hctx->ctxs will be freed in queue's release handler */
3575 static void blk_mq_exit_hctx(struct request_queue *q,
3576 struct blk_mq_tag_set *set,
3577 struct blk_mq_hw_ctx *hctx, unsigned int hctx_idx)
3579 struct request *flush_rq = hctx->fq->flush_rq;
3581 if (blk_mq_hw_queue_mapped(hctx))
3582 blk_mq_tag_idle(hctx);
3584 if (blk_queue_init_done(q))
3585 blk_mq_clear_flush_rq_mapping(set->tags[hctx_idx],
3586 set->queue_depth, flush_rq);
3587 if (set->ops->exit_request)
3588 set->ops->exit_request(set, flush_rq, hctx_idx);
3590 if (set->ops->exit_hctx)
3591 set->ops->exit_hctx(hctx, hctx_idx);
3593 blk_mq_remove_cpuhp(hctx);
3595 xa_erase(&q->hctx_table, hctx_idx);
3597 spin_lock(&q->unused_hctx_lock);
3598 list_add(&hctx->hctx_list, &q->unused_hctx_list);
3599 spin_unlock(&q->unused_hctx_lock);
3602 static void blk_mq_exit_hw_queues(struct request_queue *q,
3603 struct blk_mq_tag_set *set, int nr_queue)
3605 struct blk_mq_hw_ctx *hctx;
3608 queue_for_each_hw_ctx(q, hctx, i) {
3611 blk_mq_exit_hctx(q, set, hctx, i);
3615 static int blk_mq_init_hctx(struct request_queue *q,
3616 struct blk_mq_tag_set *set,
3617 struct blk_mq_hw_ctx *hctx, unsigned hctx_idx)
3619 hctx->queue_num = hctx_idx;
3621 if (!(hctx->flags & BLK_MQ_F_STACKING))
3622 cpuhp_state_add_instance_nocalls(CPUHP_AP_BLK_MQ_ONLINE,
3623 &hctx->cpuhp_online);
3624 cpuhp_state_add_instance_nocalls(CPUHP_BLK_MQ_DEAD, &hctx->cpuhp_dead);
3626 hctx->tags = set->tags[hctx_idx];
3628 if (set->ops->init_hctx &&
3629 set->ops->init_hctx(hctx, set->driver_data, hctx_idx))
3630 goto unregister_cpu_notifier;
3632 if (blk_mq_init_request(set, hctx->fq->flush_rq, hctx_idx,
3636 if (xa_insert(&q->hctx_table, hctx_idx, hctx, GFP_KERNEL))
3642 if (set->ops->exit_request)
3643 set->ops->exit_request(set, hctx->fq->flush_rq, hctx_idx);
3645 if (set->ops->exit_hctx)
3646 set->ops->exit_hctx(hctx, hctx_idx);
3647 unregister_cpu_notifier:
3648 blk_mq_remove_cpuhp(hctx);
3652 static struct blk_mq_hw_ctx *
3653 blk_mq_alloc_hctx(struct request_queue *q, struct blk_mq_tag_set *set,
3656 struct blk_mq_hw_ctx *hctx;
3657 gfp_t gfp = GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY;
3659 hctx = kzalloc_node(sizeof(struct blk_mq_hw_ctx), gfp, node);
3661 goto fail_alloc_hctx;
3663 if (!zalloc_cpumask_var_node(&hctx->cpumask, gfp, node))
3666 atomic_set(&hctx->nr_active, 0);
3667 if (node == NUMA_NO_NODE)
3668 node = set->numa_node;
3669 hctx->numa_node = node;
3671 INIT_DELAYED_WORK(&hctx->run_work, blk_mq_run_work_fn);
3672 spin_lock_init(&hctx->lock);
3673 INIT_LIST_HEAD(&hctx->dispatch);
3675 hctx->flags = set->flags & ~BLK_MQ_F_TAG_QUEUE_SHARED;
3677 INIT_LIST_HEAD(&hctx->hctx_list);
3680 * Allocate space for all possible cpus to avoid allocation at
3683 hctx->ctxs = kmalloc_array_node(nr_cpu_ids, sizeof(void *),
3688 if (sbitmap_init_node(&hctx->ctx_map, nr_cpu_ids, ilog2(8),
3689 gfp, node, false, false))
3693 spin_lock_init(&hctx->dispatch_wait_lock);
3694 init_waitqueue_func_entry(&hctx->dispatch_wait, blk_mq_dispatch_wake);
3695 INIT_LIST_HEAD(&hctx->dispatch_wait.entry);
3697 hctx->fq = blk_alloc_flush_queue(hctx->numa_node, set->cmd_size, gfp);
3701 blk_mq_hctx_kobj_init(hctx);
3706 sbitmap_free(&hctx->ctx_map);
3710 free_cpumask_var(hctx->cpumask);
3717 static void blk_mq_init_cpu_queues(struct request_queue *q,
3718 unsigned int nr_hw_queues)
3720 struct blk_mq_tag_set *set = q->tag_set;
3723 for_each_possible_cpu(i) {
3724 struct blk_mq_ctx *__ctx = per_cpu_ptr(q->queue_ctx, i);
3725 struct blk_mq_hw_ctx *hctx;
3729 spin_lock_init(&__ctx->lock);
3730 for (k = HCTX_TYPE_DEFAULT; k < HCTX_MAX_TYPES; k++)
3731 INIT_LIST_HEAD(&__ctx->rq_lists[k]);
3736 * Set local node, IFF we have more than one hw queue. If
3737 * not, we remain on the home node of the device
3739 for (j = 0; j < set->nr_maps; j++) {
3740 hctx = blk_mq_map_queue_type(q, j, i);
3741 if (nr_hw_queues > 1 && hctx->numa_node == NUMA_NO_NODE)
3742 hctx->numa_node = cpu_to_node(i);
3747 struct blk_mq_tags *blk_mq_alloc_map_and_rqs(struct blk_mq_tag_set *set,
3748 unsigned int hctx_idx,
3751 struct blk_mq_tags *tags;
3754 tags = blk_mq_alloc_rq_map(set, hctx_idx, depth, set->reserved_tags);
3758 ret = blk_mq_alloc_rqs(set, tags, hctx_idx, depth);
3760 blk_mq_free_rq_map(tags);
3767 static bool __blk_mq_alloc_map_and_rqs(struct blk_mq_tag_set *set,
3770 if (blk_mq_is_shared_tags(set->flags)) {
3771 set->tags[hctx_idx] = set->shared_tags;
3776 set->tags[hctx_idx] = blk_mq_alloc_map_and_rqs(set, hctx_idx,
3779 return set->tags[hctx_idx];
3782 void blk_mq_free_map_and_rqs(struct blk_mq_tag_set *set,
3783 struct blk_mq_tags *tags,
3784 unsigned int hctx_idx)
3787 blk_mq_free_rqs(set, tags, hctx_idx);
3788 blk_mq_free_rq_map(tags);
3792 static void __blk_mq_free_map_and_rqs(struct blk_mq_tag_set *set,
3793 unsigned int hctx_idx)
3795 if (!blk_mq_is_shared_tags(set->flags))
3796 blk_mq_free_map_and_rqs(set, set->tags[hctx_idx], hctx_idx);
3798 set->tags[hctx_idx] = NULL;
3801 static void blk_mq_map_swqueue(struct request_queue *q)
3803 unsigned int j, hctx_idx;
3805 struct blk_mq_hw_ctx *hctx;
3806 struct blk_mq_ctx *ctx;
3807 struct blk_mq_tag_set *set = q->tag_set;
3809 queue_for_each_hw_ctx(q, hctx, i) {
3810 cpumask_clear(hctx->cpumask);
3812 hctx->dispatch_from = NULL;
3816 * Map software to hardware queues.
3818 * If the cpu isn't present, the cpu is mapped to first hctx.
3820 for_each_possible_cpu(i) {
3822 ctx = per_cpu_ptr(q->queue_ctx, i);
3823 for (j = 0; j < set->nr_maps; j++) {
3824 if (!set->map[j].nr_queues) {
3825 ctx->hctxs[j] = blk_mq_map_queue_type(q,
3826 HCTX_TYPE_DEFAULT, i);
3829 hctx_idx = set->map[j].mq_map[i];
3830 /* unmapped hw queue can be remapped after CPU topo changed */
3831 if (!set->tags[hctx_idx] &&
3832 !__blk_mq_alloc_map_and_rqs(set, hctx_idx)) {
3834 * If tags initialization fail for some hctx,
3835 * that hctx won't be brought online. In this
3836 * case, remap the current ctx to hctx[0] which
3837 * is guaranteed to always have tags allocated
3839 set->map[j].mq_map[i] = 0;
3842 hctx = blk_mq_map_queue_type(q, j, i);
3843 ctx->hctxs[j] = hctx;
3845 * If the CPU is already set in the mask, then we've
3846 * mapped this one already. This can happen if
3847 * devices share queues across queue maps.
3849 if (cpumask_test_cpu(i, hctx->cpumask))
3852 cpumask_set_cpu(i, hctx->cpumask);
3854 ctx->index_hw[hctx->type] = hctx->nr_ctx;
3855 hctx->ctxs[hctx->nr_ctx++] = ctx;
3858 * If the nr_ctx type overflows, we have exceeded the
3859 * amount of sw queues we can support.
3861 BUG_ON(!hctx->nr_ctx);
3864 for (; j < HCTX_MAX_TYPES; j++)
3865 ctx->hctxs[j] = blk_mq_map_queue_type(q,
3866 HCTX_TYPE_DEFAULT, i);
3869 queue_for_each_hw_ctx(q, hctx, i) {
3871 * If no software queues are mapped to this hardware queue,
3872 * disable it and free the request entries.
3874 if (!hctx->nr_ctx) {
3875 /* Never unmap queue 0. We need it as a
3876 * fallback in case of a new remap fails
3880 __blk_mq_free_map_and_rqs(set, i);
3886 hctx->tags = set->tags[i];
3887 WARN_ON(!hctx->tags);
3890 * Set the map size to the number of mapped software queues.
3891 * This is more accurate and more efficient than looping
3892 * over all possibly mapped software queues.
3894 sbitmap_resize(&hctx->ctx_map, hctx->nr_ctx);
3897 * Initialize batch roundrobin counts
3899 hctx->next_cpu = blk_mq_first_mapped_cpu(hctx);
3900 hctx->next_cpu_batch = BLK_MQ_CPU_WORK_BATCH;
3905 * Caller needs to ensure that we're either frozen/quiesced, or that
3906 * the queue isn't live yet.
3908 static void queue_set_hctx_shared(struct request_queue *q, bool shared)
3910 struct blk_mq_hw_ctx *hctx;
3913 queue_for_each_hw_ctx(q, hctx, i) {
3915 hctx->flags |= BLK_MQ_F_TAG_QUEUE_SHARED;
3917 blk_mq_tag_idle(hctx);
3918 hctx->flags &= ~BLK_MQ_F_TAG_QUEUE_SHARED;
3923 static void blk_mq_update_tag_set_shared(struct blk_mq_tag_set *set,
3926 struct request_queue *q;
3928 lockdep_assert_held(&set->tag_list_lock);
3930 list_for_each_entry(q, &set->tag_list, tag_set_list) {
3931 blk_mq_freeze_queue(q);
3932 queue_set_hctx_shared(q, shared);
3933 blk_mq_unfreeze_queue(q);
3937 static void blk_mq_del_queue_tag_set(struct request_queue *q)
3939 struct blk_mq_tag_set *set = q->tag_set;
3941 mutex_lock(&set->tag_list_lock);
3942 list_del(&q->tag_set_list);
3943 if (list_is_singular(&set->tag_list)) {
3944 /* just transitioned to unshared */
3945 set->flags &= ~BLK_MQ_F_TAG_QUEUE_SHARED;
3946 /* update existing queue */
3947 blk_mq_update_tag_set_shared(set, false);
3949 mutex_unlock(&set->tag_list_lock);
3950 INIT_LIST_HEAD(&q->tag_set_list);
3953 static void blk_mq_add_queue_tag_set(struct blk_mq_tag_set *set,
3954 struct request_queue *q)
3956 mutex_lock(&set->tag_list_lock);
3959 * Check to see if we're transitioning to shared (from 1 to 2 queues).
3961 if (!list_empty(&set->tag_list) &&
3962 !(set->flags & BLK_MQ_F_TAG_QUEUE_SHARED)) {
3963 set->flags |= BLK_MQ_F_TAG_QUEUE_SHARED;
3964 /* update existing queue */
3965 blk_mq_update_tag_set_shared(set, true);
3967 if (set->flags & BLK_MQ_F_TAG_QUEUE_SHARED)
3968 queue_set_hctx_shared(q, true);
3969 list_add_tail(&q->tag_set_list, &set->tag_list);
3971 mutex_unlock(&set->tag_list_lock);
3974 /* All allocations will be freed in release handler of q->mq_kobj */
3975 static int blk_mq_alloc_ctxs(struct request_queue *q)
3977 struct blk_mq_ctxs *ctxs;
3980 ctxs = kzalloc(sizeof(*ctxs), GFP_KERNEL);
3984 ctxs->queue_ctx = alloc_percpu(struct blk_mq_ctx);
3985 if (!ctxs->queue_ctx)
3988 for_each_possible_cpu(cpu) {
3989 struct blk_mq_ctx *ctx = per_cpu_ptr(ctxs->queue_ctx, cpu);
3993 q->mq_kobj = &ctxs->kobj;
3994 q->queue_ctx = ctxs->queue_ctx;
4003 * It is the actual release handler for mq, but we do it from
4004 * request queue's release handler for avoiding use-after-free
4005 * and headache because q->mq_kobj shouldn't have been introduced,
4006 * but we can't group ctx/kctx kobj without it.
4008 void blk_mq_release(struct request_queue *q)
4010 struct blk_mq_hw_ctx *hctx, *next;
4013 queue_for_each_hw_ctx(q, hctx, i)
4014 WARN_ON_ONCE(hctx && list_empty(&hctx->hctx_list));
4016 /* all hctx are in .unused_hctx_list now */
4017 list_for_each_entry_safe(hctx, next, &q->unused_hctx_list, hctx_list) {
4018 list_del_init(&hctx->hctx_list);
4019 kobject_put(&hctx->kobj);
4022 xa_destroy(&q->hctx_table);
4025 * release .mq_kobj and sw queue's kobject now because
4026 * both share lifetime with request queue.
4028 blk_mq_sysfs_deinit(q);
4031 static struct request_queue *blk_mq_init_queue_data(struct blk_mq_tag_set *set,
4034 struct request_queue *q;
4037 q = blk_alloc_queue(set->numa_node);
4039 return ERR_PTR(-ENOMEM);
4040 q->queuedata = queuedata;
4041 ret = blk_mq_init_allocated_queue(set, q);
4044 return ERR_PTR(ret);
4049 struct request_queue *blk_mq_init_queue(struct blk_mq_tag_set *set)
4051 return blk_mq_init_queue_data(set, NULL);
4053 EXPORT_SYMBOL(blk_mq_init_queue);
4056 * blk_mq_destroy_queue - shutdown a request queue
4057 * @q: request queue to shutdown
4059 * This shuts down a request queue allocated by blk_mq_init_queue(). All future
4060 * requests will be failed with -ENODEV. The caller is responsible for dropping
4061 * the reference from blk_mq_init_queue() by calling blk_put_queue().
4063 * Context: can sleep
4065 void blk_mq_destroy_queue(struct request_queue *q)
4067 WARN_ON_ONCE(!queue_is_mq(q));
4068 WARN_ON_ONCE(blk_queue_registered(q));
4072 blk_queue_flag_set(QUEUE_FLAG_DYING, q);
4073 blk_queue_start_drain(q);
4074 blk_mq_freeze_queue_wait(q);
4077 blk_mq_cancel_work_sync(q);
4078 blk_mq_exit_queue(q);
4080 EXPORT_SYMBOL(blk_mq_destroy_queue);
4082 struct gendisk *__blk_mq_alloc_disk(struct blk_mq_tag_set *set, void *queuedata,
4083 struct lock_class_key *lkclass)
4085 struct request_queue *q;
4086 struct gendisk *disk;
4088 q = blk_mq_init_queue_data(set, queuedata);
4092 disk = __alloc_disk_node(q, set->numa_node, lkclass);
4094 blk_mq_destroy_queue(q);
4096 return ERR_PTR(-ENOMEM);
4098 set_bit(GD_OWNS_QUEUE, &disk->state);
4101 EXPORT_SYMBOL(__blk_mq_alloc_disk);
4103 struct gendisk *blk_mq_alloc_disk_for_queue(struct request_queue *q,
4104 struct lock_class_key *lkclass)
4106 struct gendisk *disk;
4108 if (!blk_get_queue(q))
4110 disk = __alloc_disk_node(q, NUMA_NO_NODE, lkclass);
4115 EXPORT_SYMBOL(blk_mq_alloc_disk_for_queue);
4117 static struct blk_mq_hw_ctx *blk_mq_alloc_and_init_hctx(
4118 struct blk_mq_tag_set *set, struct request_queue *q,
4119 int hctx_idx, int node)
4121 struct blk_mq_hw_ctx *hctx = NULL, *tmp;
4123 /* reuse dead hctx first */
4124 spin_lock(&q->unused_hctx_lock);
4125 list_for_each_entry(tmp, &q->unused_hctx_list, hctx_list) {
4126 if (tmp->numa_node == node) {
4132 list_del_init(&hctx->hctx_list);
4133 spin_unlock(&q->unused_hctx_lock);
4136 hctx = blk_mq_alloc_hctx(q, set, node);
4140 if (blk_mq_init_hctx(q, set, hctx, hctx_idx))
4146 kobject_put(&hctx->kobj);
4151 static void blk_mq_realloc_hw_ctxs(struct blk_mq_tag_set *set,
4152 struct request_queue *q)
4154 struct blk_mq_hw_ctx *hctx;
4157 /* protect against switching io scheduler */
4158 mutex_lock(&q->sysfs_lock);
4159 for (i = 0; i < set->nr_hw_queues; i++) {
4161 int node = blk_mq_get_hctx_node(set, i);
4162 struct blk_mq_hw_ctx *old_hctx = xa_load(&q->hctx_table, i);
4165 old_node = old_hctx->numa_node;
4166 blk_mq_exit_hctx(q, set, old_hctx, i);
4169 if (!blk_mq_alloc_and_init_hctx(set, q, i, node)) {
4172 pr_warn("Allocate new hctx on node %d fails, fallback to previous one on node %d\n",
4174 hctx = blk_mq_alloc_and_init_hctx(set, q, i, old_node);
4175 WARN_ON_ONCE(!hctx);
4179 * Increasing nr_hw_queues fails. Free the newly allocated
4180 * hctxs and keep the previous q->nr_hw_queues.
4182 if (i != set->nr_hw_queues) {
4183 j = q->nr_hw_queues;
4186 q->nr_hw_queues = set->nr_hw_queues;
4189 xa_for_each_start(&q->hctx_table, j, hctx, j)
4190 blk_mq_exit_hctx(q, set, hctx, j);
4191 mutex_unlock(&q->sysfs_lock);
4194 static void blk_mq_update_poll_flag(struct request_queue *q)
4196 struct blk_mq_tag_set *set = q->tag_set;
4198 if (set->nr_maps > HCTX_TYPE_POLL &&
4199 set->map[HCTX_TYPE_POLL].nr_queues)
4200 blk_queue_flag_set(QUEUE_FLAG_POLL, q);
4202 blk_queue_flag_clear(QUEUE_FLAG_POLL, q);
4205 int blk_mq_init_allocated_queue(struct blk_mq_tag_set *set,
4206 struct request_queue *q)
4208 /* mark the queue as mq asap */
4209 q->mq_ops = set->ops;
4211 if (blk_mq_alloc_ctxs(q))
4214 /* init q->mq_kobj and sw queues' kobjects */
4215 blk_mq_sysfs_init(q);
4217 INIT_LIST_HEAD(&q->unused_hctx_list);
4218 spin_lock_init(&q->unused_hctx_lock);
4220 xa_init(&q->hctx_table);
4222 blk_mq_realloc_hw_ctxs(set, q);
4223 if (!q->nr_hw_queues)
4226 INIT_WORK(&q->timeout_work, blk_mq_timeout_work);
4227 blk_queue_rq_timeout(q, set->timeout ? set->timeout : 30 * HZ);
4231 q->queue_flags |= QUEUE_FLAG_MQ_DEFAULT;
4232 blk_mq_update_poll_flag(q);
4234 INIT_DELAYED_WORK(&q->requeue_work, blk_mq_requeue_work);
4235 INIT_LIST_HEAD(&q->flush_list);
4236 INIT_LIST_HEAD(&q->requeue_list);
4237 spin_lock_init(&q->requeue_lock);
4239 q->nr_requests = set->queue_depth;
4241 blk_mq_init_cpu_queues(q, set->nr_hw_queues);
4242 blk_mq_add_queue_tag_set(set, q);
4243 blk_mq_map_swqueue(q);
4252 EXPORT_SYMBOL(blk_mq_init_allocated_queue);
4254 /* tags can _not_ be used after returning from blk_mq_exit_queue */
4255 void blk_mq_exit_queue(struct request_queue *q)
4257 struct blk_mq_tag_set *set = q->tag_set;
4259 /* Checks hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED. */
4260 blk_mq_exit_hw_queues(q, set, set->nr_hw_queues);
4261 /* May clear BLK_MQ_F_TAG_QUEUE_SHARED in hctx->flags. */
4262 blk_mq_del_queue_tag_set(q);
4265 static int __blk_mq_alloc_rq_maps(struct blk_mq_tag_set *set)
4269 if (blk_mq_is_shared_tags(set->flags)) {
4270 set->shared_tags = blk_mq_alloc_map_and_rqs(set,
4273 if (!set->shared_tags)
4277 for (i = 0; i < set->nr_hw_queues; i++) {
4278 if (!__blk_mq_alloc_map_and_rqs(set, i))
4287 __blk_mq_free_map_and_rqs(set, i);
4289 if (blk_mq_is_shared_tags(set->flags)) {
4290 blk_mq_free_map_and_rqs(set, set->shared_tags,
4291 BLK_MQ_NO_HCTX_IDX);
4298 * Allocate the request maps associated with this tag_set. Note that this
4299 * may reduce the depth asked for, if memory is tight. set->queue_depth
4300 * will be updated to reflect the allocated depth.
4302 static int blk_mq_alloc_set_map_and_rqs(struct blk_mq_tag_set *set)
4307 depth = set->queue_depth;
4309 err = __blk_mq_alloc_rq_maps(set);
4313 set->queue_depth >>= 1;
4314 if (set->queue_depth < set->reserved_tags + BLK_MQ_TAG_MIN) {
4318 } while (set->queue_depth);
4320 if (!set->queue_depth || err) {
4321 pr_err("blk-mq: failed to allocate request map\n");
4325 if (depth != set->queue_depth)
4326 pr_info("blk-mq: reduced tag depth (%u -> %u)\n",
4327 depth, set->queue_depth);
4332 static void blk_mq_update_queue_map(struct blk_mq_tag_set *set)
4335 * blk_mq_map_queues() and multiple .map_queues() implementations
4336 * expect that set->map[HCTX_TYPE_DEFAULT].nr_queues is set to the
4337 * number of hardware queues.
4339 if (set->nr_maps == 1)
4340 set->map[HCTX_TYPE_DEFAULT].nr_queues = set->nr_hw_queues;
4342 if (set->ops->map_queues && !is_kdump_kernel()) {
4346 * transport .map_queues is usually done in the following
4349 * for (queue = 0; queue < set->nr_hw_queues; queue++) {
4350 * mask = get_cpu_mask(queue)
4351 * for_each_cpu(cpu, mask)
4352 * set->map[x].mq_map[cpu] = queue;
4355 * When we need to remap, the table has to be cleared for
4356 * killing stale mapping since one CPU may not be mapped
4359 for (i = 0; i < set->nr_maps; i++)
4360 blk_mq_clear_mq_map(&set->map[i]);
4362 set->ops->map_queues(set);
4364 BUG_ON(set->nr_maps > 1);
4365 blk_mq_map_queues(&set->map[HCTX_TYPE_DEFAULT]);
4369 static int blk_mq_realloc_tag_set_tags(struct blk_mq_tag_set *set,
4370 int new_nr_hw_queues)
4372 struct blk_mq_tags **new_tags;
4374 if (set->nr_hw_queues >= new_nr_hw_queues)
4377 new_tags = kcalloc_node(new_nr_hw_queues, sizeof(struct blk_mq_tags *),
4378 GFP_KERNEL, set->numa_node);
4383 memcpy(new_tags, set->tags, set->nr_hw_queues *
4384 sizeof(*set->tags));
4386 set->tags = new_tags;
4388 set->nr_hw_queues = new_nr_hw_queues;
4393 * Alloc a tag set to be associated with one or more request queues.
4394 * May fail with EINVAL for various error conditions. May adjust the
4395 * requested depth down, if it's too large. In that case, the set
4396 * value will be stored in set->queue_depth.
4398 int blk_mq_alloc_tag_set(struct blk_mq_tag_set *set)
4402 BUILD_BUG_ON(BLK_MQ_MAX_DEPTH > 1 << BLK_MQ_UNIQUE_TAG_BITS);
4404 if (!set->nr_hw_queues)
4406 if (!set->queue_depth)
4408 if (set->queue_depth < set->reserved_tags + BLK_MQ_TAG_MIN)
4411 if (!set->ops->queue_rq)
4414 if (!set->ops->get_budget ^ !set->ops->put_budget)
4417 if (set->queue_depth > BLK_MQ_MAX_DEPTH) {
4418 pr_info("blk-mq: reduced tag depth to %u\n",
4420 set->queue_depth = BLK_MQ_MAX_DEPTH;
4425 else if (set->nr_maps > HCTX_MAX_TYPES)
4429 * If a crashdump is active, then we are potentially in a very
4430 * memory constrained environment. Limit us to 1 queue and
4431 * 64 tags to prevent using too much memory.
4433 if (is_kdump_kernel()) {
4434 set->nr_hw_queues = 1;
4436 set->queue_depth = min(64U, set->queue_depth);
4439 * There is no use for more h/w queues than cpus if we just have
4442 if (set->nr_maps == 1 && set->nr_hw_queues > nr_cpu_ids)
4443 set->nr_hw_queues = nr_cpu_ids;
4445 if (set->flags & BLK_MQ_F_BLOCKING) {
4446 set->srcu = kmalloc(sizeof(*set->srcu), GFP_KERNEL);
4449 ret = init_srcu_struct(set->srcu);
4455 set->tags = kcalloc_node(set->nr_hw_queues,
4456 sizeof(struct blk_mq_tags *), GFP_KERNEL,
4459 goto out_cleanup_srcu;
4461 for (i = 0; i < set->nr_maps; i++) {
4462 set->map[i].mq_map = kcalloc_node(nr_cpu_ids,
4463 sizeof(set->map[i].mq_map[0]),
4464 GFP_KERNEL, set->numa_node);
4465 if (!set->map[i].mq_map)
4466 goto out_free_mq_map;
4467 set->map[i].nr_queues = is_kdump_kernel() ? 1 : set->nr_hw_queues;
4470 blk_mq_update_queue_map(set);
4472 ret = blk_mq_alloc_set_map_and_rqs(set);
4474 goto out_free_mq_map;
4476 mutex_init(&set->tag_list_lock);
4477 INIT_LIST_HEAD(&set->tag_list);
4482 for (i = 0; i < set->nr_maps; i++) {
4483 kfree(set->map[i].mq_map);
4484 set->map[i].mq_map = NULL;
4489 if (set->flags & BLK_MQ_F_BLOCKING)
4490 cleanup_srcu_struct(set->srcu);
4492 if (set->flags & BLK_MQ_F_BLOCKING)
4496 EXPORT_SYMBOL(blk_mq_alloc_tag_set);
4498 /* allocate and initialize a tagset for a simple single-queue device */
4499 int blk_mq_alloc_sq_tag_set(struct blk_mq_tag_set *set,
4500 const struct blk_mq_ops *ops, unsigned int queue_depth,
4501 unsigned int set_flags)
4503 memset(set, 0, sizeof(*set));
4505 set->nr_hw_queues = 1;
4507 set->queue_depth = queue_depth;
4508 set->numa_node = NUMA_NO_NODE;
4509 set->flags = set_flags;
4510 return blk_mq_alloc_tag_set(set);
4512 EXPORT_SYMBOL_GPL(blk_mq_alloc_sq_tag_set);
4514 void blk_mq_free_tag_set(struct blk_mq_tag_set *set)
4518 for (i = 0; i < set->nr_hw_queues; i++)
4519 __blk_mq_free_map_and_rqs(set, i);
4521 if (blk_mq_is_shared_tags(set->flags)) {
4522 blk_mq_free_map_and_rqs(set, set->shared_tags,
4523 BLK_MQ_NO_HCTX_IDX);
4526 for (j = 0; j < set->nr_maps; j++) {
4527 kfree(set->map[j].mq_map);
4528 set->map[j].mq_map = NULL;
4533 if (set->flags & BLK_MQ_F_BLOCKING) {
4534 cleanup_srcu_struct(set->srcu);
4538 EXPORT_SYMBOL(blk_mq_free_tag_set);
4540 int blk_mq_update_nr_requests(struct request_queue *q, unsigned int nr)
4542 struct blk_mq_tag_set *set = q->tag_set;
4543 struct blk_mq_hw_ctx *hctx;
4550 if (q->nr_requests == nr)
4553 blk_mq_freeze_queue(q);
4554 blk_mq_quiesce_queue(q);
4557 queue_for_each_hw_ctx(q, hctx, i) {
4561 * If we're using an MQ scheduler, just update the scheduler
4562 * queue depth. This is similar to what the old code would do.
4564 if (hctx->sched_tags) {
4565 ret = blk_mq_tag_update_depth(hctx, &hctx->sched_tags,
4568 ret = blk_mq_tag_update_depth(hctx, &hctx->tags, nr,
4573 if (q->elevator && q->elevator->type->ops.depth_updated)
4574 q->elevator->type->ops.depth_updated(hctx);
4577 q->nr_requests = nr;
4578 if (blk_mq_is_shared_tags(set->flags)) {
4580 blk_mq_tag_update_sched_shared_tags(q);
4582 blk_mq_tag_resize_shared_tags(set, nr);
4586 blk_mq_unquiesce_queue(q);
4587 blk_mq_unfreeze_queue(q);
4593 * request_queue and elevator_type pair.
4594 * It is just used by __blk_mq_update_nr_hw_queues to cache
4595 * the elevator_type associated with a request_queue.
4597 struct blk_mq_qe_pair {
4598 struct list_head node;
4599 struct request_queue *q;
4600 struct elevator_type *type;
4604 * Cache the elevator_type in qe pair list and switch the
4605 * io scheduler to 'none'
4607 static bool blk_mq_elv_switch_none(struct list_head *head,
4608 struct request_queue *q)
4610 struct blk_mq_qe_pair *qe;
4612 qe = kmalloc(sizeof(*qe), GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY);
4616 /* q->elevator needs protection from ->sysfs_lock */
4617 mutex_lock(&q->sysfs_lock);
4619 /* the check has to be done with holding sysfs_lock */
4625 INIT_LIST_HEAD(&qe->node);
4627 qe->type = q->elevator->type;
4628 /* keep a reference to the elevator module as we'll switch back */
4629 __elevator_get(qe->type);
4630 list_add(&qe->node, head);
4631 elevator_disable(q);
4633 mutex_unlock(&q->sysfs_lock);
4638 static struct blk_mq_qe_pair *blk_lookup_qe_pair(struct list_head *head,
4639 struct request_queue *q)
4641 struct blk_mq_qe_pair *qe;
4643 list_for_each_entry(qe, head, node)
4650 static void blk_mq_elv_switch_back(struct list_head *head,
4651 struct request_queue *q)
4653 struct blk_mq_qe_pair *qe;
4654 struct elevator_type *t;
4656 qe = blk_lookup_qe_pair(head, q);
4660 list_del(&qe->node);
4663 mutex_lock(&q->sysfs_lock);
4664 elevator_switch(q, t);
4665 /* drop the reference acquired in blk_mq_elv_switch_none */
4667 mutex_unlock(&q->sysfs_lock);
4670 static void __blk_mq_update_nr_hw_queues(struct blk_mq_tag_set *set,
4673 struct request_queue *q;
4675 int prev_nr_hw_queues;
4677 lockdep_assert_held(&set->tag_list_lock);
4679 if (set->nr_maps == 1 && nr_hw_queues > nr_cpu_ids)
4680 nr_hw_queues = nr_cpu_ids;
4681 if (nr_hw_queues < 1)
4683 if (set->nr_maps == 1 && nr_hw_queues == set->nr_hw_queues)
4686 list_for_each_entry(q, &set->tag_list, tag_set_list)
4687 blk_mq_freeze_queue(q);
4689 * Switch IO scheduler to 'none', cleaning up the data associated
4690 * with the previous scheduler. We will switch back once we are done
4691 * updating the new sw to hw queue mappings.
4693 list_for_each_entry(q, &set->tag_list, tag_set_list)
4694 if (!blk_mq_elv_switch_none(&head, q))
4697 list_for_each_entry(q, &set->tag_list, tag_set_list) {
4698 blk_mq_debugfs_unregister_hctxs(q);
4699 blk_mq_sysfs_unregister_hctxs(q);
4702 prev_nr_hw_queues = set->nr_hw_queues;
4703 if (blk_mq_realloc_tag_set_tags(set, nr_hw_queues) < 0)
4707 blk_mq_update_queue_map(set);
4708 list_for_each_entry(q, &set->tag_list, tag_set_list) {
4709 blk_mq_realloc_hw_ctxs(set, q);
4710 blk_mq_update_poll_flag(q);
4711 if (q->nr_hw_queues != set->nr_hw_queues) {
4712 int i = prev_nr_hw_queues;
4714 pr_warn("Increasing nr_hw_queues to %d fails, fallback to %d\n",
4715 nr_hw_queues, prev_nr_hw_queues);
4716 for (; i < set->nr_hw_queues; i++)
4717 __blk_mq_free_map_and_rqs(set, i);
4719 set->nr_hw_queues = prev_nr_hw_queues;
4720 blk_mq_map_queues(&set->map[HCTX_TYPE_DEFAULT]);
4723 blk_mq_map_swqueue(q);
4727 list_for_each_entry(q, &set->tag_list, tag_set_list) {
4728 blk_mq_sysfs_register_hctxs(q);
4729 blk_mq_debugfs_register_hctxs(q);
4733 list_for_each_entry(q, &set->tag_list, tag_set_list)
4734 blk_mq_elv_switch_back(&head, q);
4736 list_for_each_entry(q, &set->tag_list, tag_set_list)
4737 blk_mq_unfreeze_queue(q);
4740 void blk_mq_update_nr_hw_queues(struct blk_mq_tag_set *set, int nr_hw_queues)
4742 mutex_lock(&set->tag_list_lock);
4743 __blk_mq_update_nr_hw_queues(set, nr_hw_queues);
4744 mutex_unlock(&set->tag_list_lock);
4746 EXPORT_SYMBOL_GPL(blk_mq_update_nr_hw_queues);
4748 int blk_mq_poll(struct request_queue *q, blk_qc_t cookie, struct io_comp_batch *iob,
4751 struct blk_mq_hw_ctx *hctx = blk_qc_to_hctx(q, cookie);
4752 long state = get_current_state();
4756 ret = q->mq_ops->poll(hctx, iob);
4758 __set_current_state(TASK_RUNNING);
4762 if (signal_pending_state(state, current))
4763 __set_current_state(TASK_RUNNING);
4764 if (task_is_running(current))
4767 if (ret < 0 || (flags & BLK_POLL_ONESHOT))
4770 } while (!need_resched());
4772 __set_current_state(TASK_RUNNING);
4776 unsigned int blk_mq_rq_cpu(struct request *rq)
4778 return rq->mq_ctx->cpu;
4780 EXPORT_SYMBOL(blk_mq_rq_cpu);
4782 void blk_mq_cancel_work_sync(struct request_queue *q)
4784 struct blk_mq_hw_ctx *hctx;
4787 cancel_delayed_work_sync(&q->requeue_work);
4789 queue_for_each_hw_ctx(q, hctx, i)
4790 cancel_delayed_work_sync(&hctx->run_work);
4793 static int __init blk_mq_init(void)
4797 for_each_possible_cpu(i)
4798 init_llist_head(&per_cpu(blk_cpu_done, i));
4799 open_softirq(BLOCK_SOFTIRQ, blk_done_softirq);
4801 cpuhp_setup_state_nocalls(CPUHP_BLOCK_SOFTIRQ_DEAD,
4802 "block/softirq:dead", NULL,
4803 blk_softirq_cpu_dead);
4804 cpuhp_setup_state_multi(CPUHP_BLK_MQ_DEAD, "block/mq:dead", NULL,
4805 blk_mq_hctx_notify_dead);
4806 cpuhp_setup_state_multi(CPUHP_AP_BLK_MQ_ONLINE, "block/mq:online",
4807 blk_mq_hctx_notify_online,
4808 blk_mq_hctx_notify_offline);
4811 subsys_initcall(blk_mq_init);