2 * Block multiqueue core code
4 * Copyright (C) 2013-2014 Jens Axboe
5 * Copyright (C) 2013-2014 Christoph Hellwig
7 #include <linux/kernel.h>
8 #include <linux/module.h>
9 #include <linux/backing-dev.h>
10 #include <linux/bio.h>
11 #include <linux/blkdev.h>
12 #include <linux/kmemleak.h>
14 #include <linux/init.h>
15 #include <linux/slab.h>
16 #include <linux/workqueue.h>
17 #include <linux/smp.h>
18 #include <linux/llist.h>
19 #include <linux/list_sort.h>
20 #include <linux/cpu.h>
21 #include <linux/cache.h>
22 #include <linux/sched/sysctl.h>
23 #include <linux/sched/topology.h>
24 #include <linux/sched/signal.h>
25 #include <linux/delay.h>
26 #include <linux/crash_dump.h>
27 #include <linux/prefetch.h>
29 #include <trace/events/block.h>
31 #include <linux/blk-mq.h>
34 #include "blk-mq-debugfs.h"
35 #include "blk-mq-tag.h"
38 #include "blk-mq-sched.h"
40 static bool blk_mq_poll(struct request_queue
*q
, blk_qc_t cookie
);
41 static void blk_mq_poll_stats_start(struct request_queue
*q
);
42 static void blk_mq_poll_stats_fn(struct blk_stat_callback
*cb
);
44 static int blk_mq_poll_stats_bkt(const struct request
*rq
)
46 int ddir
, bytes
, bucket
;
48 ddir
= rq_data_dir(rq
);
49 bytes
= blk_rq_bytes(rq
);
51 bucket
= ddir
+ 2*(ilog2(bytes
) - 9);
55 else if (bucket
>= BLK_MQ_POLL_STATS_BKTS
)
56 return ddir
+ BLK_MQ_POLL_STATS_BKTS
- 2;
62 * Check if any of the ctx's have pending work in this hardware queue
64 bool blk_mq_hctx_has_pending(struct blk_mq_hw_ctx
*hctx
)
66 return sbitmap_any_bit_set(&hctx
->ctx_map
) ||
67 !list_empty_careful(&hctx
->dispatch
) ||
68 blk_mq_sched_has_work(hctx
);
72 * Mark this ctx as having pending work in this hardware queue
74 static void blk_mq_hctx_mark_pending(struct blk_mq_hw_ctx
*hctx
,
75 struct blk_mq_ctx
*ctx
)
77 if (!sbitmap_test_bit(&hctx
->ctx_map
, ctx
->index_hw
))
78 sbitmap_set_bit(&hctx
->ctx_map
, ctx
->index_hw
);
81 static void blk_mq_hctx_clear_pending(struct blk_mq_hw_ctx
*hctx
,
82 struct blk_mq_ctx
*ctx
)
84 sbitmap_clear_bit(&hctx
->ctx_map
, ctx
->index_hw
);
88 struct hd_struct
*part
;
89 unsigned int *inflight
;
92 static void blk_mq_check_inflight(struct blk_mq_hw_ctx
*hctx
,
93 struct request
*rq
, void *priv
,
96 struct mq_inflight
*mi
= priv
;
98 if (test_bit(REQ_ATOM_STARTED
, &rq
->atomic_flags
) &&
99 !test_bit(REQ_ATOM_COMPLETE
, &rq
->atomic_flags
)) {
101 * index[0] counts the specific partition that was asked
102 * for. index[1] counts the ones that are active on the
103 * whole device, so increment that if mi->part is indeed
104 * a partition, and not a whole device.
106 if (rq
->part
== mi
->part
)
108 if (mi
->part
->partno
)
113 void blk_mq_in_flight(struct request_queue
*q
, struct hd_struct
*part
,
114 unsigned int inflight
[2])
116 struct mq_inflight mi
= { .part
= part
, .inflight
= inflight
, };
118 inflight
[0] = inflight
[1] = 0;
119 blk_mq_queue_tag_busy_iter(q
, blk_mq_check_inflight
, &mi
);
122 void blk_freeze_queue_start(struct request_queue
*q
)
126 freeze_depth
= atomic_inc_return(&q
->mq_freeze_depth
);
127 if (freeze_depth
== 1) {
128 percpu_ref_kill(&q
->q_usage_counter
);
129 blk_mq_run_hw_queues(q
, false);
132 EXPORT_SYMBOL_GPL(blk_freeze_queue_start
);
134 void blk_mq_freeze_queue_wait(struct request_queue
*q
)
136 wait_event(q
->mq_freeze_wq
, percpu_ref_is_zero(&q
->q_usage_counter
));
138 EXPORT_SYMBOL_GPL(blk_mq_freeze_queue_wait
);
140 int blk_mq_freeze_queue_wait_timeout(struct request_queue
*q
,
141 unsigned long timeout
)
143 return wait_event_timeout(q
->mq_freeze_wq
,
144 percpu_ref_is_zero(&q
->q_usage_counter
),
147 EXPORT_SYMBOL_GPL(blk_mq_freeze_queue_wait_timeout
);
150 * Guarantee no request is in use, so we can change any data structure of
151 * the queue afterward.
153 void blk_freeze_queue(struct request_queue
*q
)
156 * In the !blk_mq case we are only calling this to kill the
157 * q_usage_counter, otherwise this increases the freeze depth
158 * and waits for it to return to zero. For this reason there is
159 * no blk_unfreeze_queue(), and blk_freeze_queue() is not
160 * exported to drivers as the only user for unfreeze is blk_mq.
162 blk_freeze_queue_start(q
);
163 blk_mq_freeze_queue_wait(q
);
166 void blk_mq_freeze_queue(struct request_queue
*q
)
169 * ...just an alias to keep freeze and unfreeze actions balanced
170 * in the blk_mq_* namespace
174 EXPORT_SYMBOL_GPL(blk_mq_freeze_queue
);
176 void blk_mq_unfreeze_queue(struct request_queue
*q
)
180 freeze_depth
= atomic_dec_return(&q
->mq_freeze_depth
);
181 WARN_ON_ONCE(freeze_depth
< 0);
183 percpu_ref_reinit(&q
->q_usage_counter
);
184 wake_up_all(&q
->mq_freeze_wq
);
187 EXPORT_SYMBOL_GPL(blk_mq_unfreeze_queue
);
190 * FIXME: replace the scsi_internal_device_*block_nowait() calls in the
191 * mpt3sas driver such that this function can be removed.
193 void blk_mq_quiesce_queue_nowait(struct request_queue
*q
)
197 spin_lock_irqsave(q
->queue_lock
, flags
);
198 queue_flag_set(QUEUE_FLAG_QUIESCED
, q
);
199 spin_unlock_irqrestore(q
->queue_lock
, flags
);
201 EXPORT_SYMBOL_GPL(blk_mq_quiesce_queue_nowait
);
204 * blk_mq_quiesce_queue() - wait until all ongoing dispatches have finished
207 * Note: this function does not prevent that the struct request end_io()
208 * callback function is invoked. Once this function is returned, we make
209 * sure no dispatch can happen until the queue is unquiesced via
210 * blk_mq_unquiesce_queue().
212 void blk_mq_quiesce_queue(struct request_queue
*q
)
214 struct blk_mq_hw_ctx
*hctx
;
218 blk_mq_quiesce_queue_nowait(q
);
220 queue_for_each_hw_ctx(q
, hctx
, i
) {
221 if (hctx
->flags
& BLK_MQ_F_BLOCKING
)
222 synchronize_srcu(hctx
->queue_rq_srcu
);
229 EXPORT_SYMBOL_GPL(blk_mq_quiesce_queue
);
232 * blk_mq_unquiesce_queue() - counterpart of blk_mq_quiesce_queue()
235 * This function recovers queue into the state before quiescing
236 * which is done by blk_mq_quiesce_queue.
238 void blk_mq_unquiesce_queue(struct request_queue
*q
)
242 spin_lock_irqsave(q
->queue_lock
, flags
);
243 queue_flag_clear(QUEUE_FLAG_QUIESCED
, q
);
244 spin_unlock_irqrestore(q
->queue_lock
, flags
);
246 /* dispatch requests which are inserted during quiescing */
247 blk_mq_run_hw_queues(q
, true);
249 EXPORT_SYMBOL_GPL(blk_mq_unquiesce_queue
);
251 void blk_mq_wake_waiters(struct request_queue
*q
)
253 struct blk_mq_hw_ctx
*hctx
;
256 queue_for_each_hw_ctx(q
, hctx
, i
)
257 if (blk_mq_hw_queue_mapped(hctx
))
258 blk_mq_tag_wakeup_all(hctx
->tags
, true);
261 * If we are called because the queue has now been marked as
262 * dying, we need to ensure that processes currently waiting on
263 * the queue are notified as well.
265 wake_up_all(&q
->mq_freeze_wq
);
268 bool blk_mq_can_queue(struct blk_mq_hw_ctx
*hctx
)
270 return blk_mq_has_free_tags(hctx
->tags
);
272 EXPORT_SYMBOL(blk_mq_can_queue
);
274 static struct request
*blk_mq_rq_ctx_init(struct blk_mq_alloc_data
*data
,
275 unsigned int tag
, unsigned int op
)
277 struct blk_mq_tags
*tags
= blk_mq_tags_from_data(data
);
278 struct request
*rq
= tags
->static_rqs
[tag
];
282 if (data
->flags
& BLK_MQ_REQ_INTERNAL
) {
284 rq
->internal_tag
= tag
;
286 if (blk_mq_tag_busy(data
->hctx
)) {
287 rq
->rq_flags
= RQF_MQ_INFLIGHT
;
288 atomic_inc(&data
->hctx
->nr_active
);
291 rq
->internal_tag
= -1;
292 data
->hctx
->tags
->rqs
[rq
->tag
] = rq
;
295 INIT_LIST_HEAD(&rq
->queuelist
);
296 /* csd/requeue_work/fifo_time is initialized before use */
298 rq
->mq_ctx
= data
->ctx
;
300 if (blk_queue_io_stat(data
->q
))
301 rq
->rq_flags
|= RQF_IO_STAT
;
302 /* do not touch atomic flags, it needs atomic ops against the timer */
304 INIT_HLIST_NODE(&rq
->hash
);
305 RB_CLEAR_NODE(&rq
->rb_node
);
308 rq
->start_time
= jiffies
;
309 #ifdef CONFIG_BLK_CGROUP
311 set_start_time_ns(rq
);
312 rq
->io_start_time_ns
= 0;
314 rq
->nr_phys_segments
= 0;
315 #if defined(CONFIG_BLK_DEV_INTEGRITY)
316 rq
->nr_integrity_segments
= 0;
319 /* tag was already set */
322 INIT_LIST_HEAD(&rq
->timeout_list
);
326 rq
->end_io_data
= NULL
;
329 data
->ctx
->rq_dispatched
[op_is_sync(op
)]++;
333 static struct request
*blk_mq_get_request(struct request_queue
*q
,
334 struct bio
*bio
, unsigned int op
,
335 struct blk_mq_alloc_data
*data
)
337 struct elevator_queue
*e
= q
->elevator
;
340 bool put_ctx_on_error
= false;
342 blk_queue_enter_live(q
);
344 if (likely(!data
->ctx
)) {
345 data
->ctx
= blk_mq_get_ctx(q
);
346 put_ctx_on_error
= true;
348 if (likely(!data
->hctx
))
349 data
->hctx
= blk_mq_map_queue(q
, data
->ctx
->cpu
);
351 data
->flags
|= BLK_MQ_REQ_NOWAIT
;
354 data
->flags
|= BLK_MQ_REQ_INTERNAL
;
357 * Flush requests are special and go directly to the
360 if (!op_is_flush(op
) && e
->type
->ops
.mq
.limit_depth
)
361 e
->type
->ops
.mq
.limit_depth(op
, data
);
364 tag
= blk_mq_get_tag(data
);
365 if (tag
== BLK_MQ_TAG_FAIL
) {
366 if (put_ctx_on_error
) {
367 blk_mq_put_ctx(data
->ctx
);
374 rq
= blk_mq_rq_ctx_init(data
, tag
, op
);
375 if (!op_is_flush(op
)) {
377 if (e
&& e
->type
->ops
.mq
.prepare_request
) {
378 if (e
->type
->icq_cache
&& rq_ioc(bio
))
379 blk_mq_sched_assign_ioc(rq
, bio
);
381 e
->type
->ops
.mq
.prepare_request(rq
, bio
);
382 rq
->rq_flags
|= RQF_ELVPRIV
;
385 data
->hctx
->queued
++;
389 struct request
*blk_mq_alloc_request(struct request_queue
*q
, unsigned int op
,
392 struct blk_mq_alloc_data alloc_data
= { .flags
= flags
};
396 ret
= blk_queue_enter(q
, flags
& BLK_MQ_REQ_NOWAIT
);
400 rq
= blk_mq_get_request(q
, NULL
, op
, &alloc_data
);
404 return ERR_PTR(-EWOULDBLOCK
);
406 blk_mq_put_ctx(alloc_data
.ctx
);
409 rq
->__sector
= (sector_t
) -1;
410 rq
->bio
= rq
->biotail
= NULL
;
413 EXPORT_SYMBOL(blk_mq_alloc_request
);
415 struct request
*blk_mq_alloc_request_hctx(struct request_queue
*q
,
416 unsigned int op
, unsigned int flags
, unsigned int hctx_idx
)
418 struct blk_mq_alloc_data alloc_data
= { .flags
= flags
};
424 * If the tag allocator sleeps we could get an allocation for a
425 * different hardware context. No need to complicate the low level
426 * allocator for this for the rare use case of a command tied to
429 if (WARN_ON_ONCE(!(flags
& BLK_MQ_REQ_NOWAIT
)))
430 return ERR_PTR(-EINVAL
);
432 if (hctx_idx
>= q
->nr_hw_queues
)
433 return ERR_PTR(-EIO
);
435 ret
= blk_queue_enter(q
, true);
440 * Check if the hardware context is actually mapped to anything.
441 * If not tell the caller that it should skip this queue.
443 alloc_data
.hctx
= q
->queue_hw_ctx
[hctx_idx
];
444 if (!blk_mq_hw_queue_mapped(alloc_data
.hctx
)) {
446 return ERR_PTR(-EXDEV
);
448 cpu
= cpumask_first(alloc_data
.hctx
->cpumask
);
449 alloc_data
.ctx
= __blk_mq_get_ctx(q
, cpu
);
451 rq
= blk_mq_get_request(q
, NULL
, op
, &alloc_data
);
455 return ERR_PTR(-EWOULDBLOCK
);
459 EXPORT_SYMBOL_GPL(blk_mq_alloc_request_hctx
);
461 void blk_mq_free_request(struct request
*rq
)
463 struct request_queue
*q
= rq
->q
;
464 struct elevator_queue
*e
= q
->elevator
;
465 struct blk_mq_ctx
*ctx
= rq
->mq_ctx
;
466 struct blk_mq_hw_ctx
*hctx
= blk_mq_map_queue(q
, ctx
->cpu
);
467 const int sched_tag
= rq
->internal_tag
;
469 if (rq
->rq_flags
& RQF_ELVPRIV
) {
470 if (e
&& e
->type
->ops
.mq
.finish_request
)
471 e
->type
->ops
.mq
.finish_request(rq
);
473 put_io_context(rq
->elv
.icq
->ioc
);
478 ctx
->rq_completed
[rq_is_sync(rq
)]++;
479 if (rq
->rq_flags
& RQF_MQ_INFLIGHT
)
480 atomic_dec(&hctx
->nr_active
);
482 if (unlikely(laptop_mode
&& !blk_rq_is_passthrough(rq
)))
483 laptop_io_completion(q
->backing_dev_info
);
485 wbt_done(q
->rq_wb
, &rq
->issue_stat
);
488 blk_put_rl(blk_rq_rl(rq
));
490 clear_bit(REQ_ATOM_STARTED
, &rq
->atomic_flags
);
491 clear_bit(REQ_ATOM_POLL_SLEPT
, &rq
->atomic_flags
);
493 blk_mq_put_tag(hctx
, hctx
->tags
, ctx
, rq
->tag
);
495 blk_mq_put_tag(hctx
, hctx
->sched_tags
, ctx
, sched_tag
);
496 blk_mq_sched_restart(hctx
);
499 EXPORT_SYMBOL_GPL(blk_mq_free_request
);
501 inline void __blk_mq_end_request(struct request
*rq
, blk_status_t error
)
503 blk_account_io_done(rq
);
506 wbt_done(rq
->q
->rq_wb
, &rq
->issue_stat
);
507 rq
->end_io(rq
, error
);
509 if (unlikely(blk_bidi_rq(rq
)))
510 blk_mq_free_request(rq
->next_rq
);
511 blk_mq_free_request(rq
);
514 EXPORT_SYMBOL(__blk_mq_end_request
);
516 void blk_mq_end_request(struct request
*rq
, blk_status_t error
)
518 if (blk_update_request(rq
, error
, blk_rq_bytes(rq
)))
520 __blk_mq_end_request(rq
, error
);
522 EXPORT_SYMBOL(blk_mq_end_request
);
524 static void __blk_mq_complete_request_remote(void *data
)
526 struct request
*rq
= data
;
528 rq
->q
->softirq_done_fn(rq
);
531 static void __blk_mq_complete_request(struct request
*rq
)
533 struct blk_mq_ctx
*ctx
= rq
->mq_ctx
;
537 if (rq
->internal_tag
!= -1)
538 blk_mq_sched_completed_request(rq
);
539 if (rq
->rq_flags
& RQF_STATS
) {
540 blk_mq_poll_stats_start(rq
->q
);
544 if (!test_bit(QUEUE_FLAG_SAME_COMP
, &rq
->q
->queue_flags
)) {
545 rq
->q
->softirq_done_fn(rq
);
550 if (!test_bit(QUEUE_FLAG_SAME_FORCE
, &rq
->q
->queue_flags
))
551 shared
= cpus_share_cache(cpu
, ctx
->cpu
);
553 if (cpu
!= ctx
->cpu
&& !shared
&& cpu_online(ctx
->cpu
)) {
554 rq
->csd
.func
= __blk_mq_complete_request_remote
;
557 smp_call_function_single_async(ctx
->cpu
, &rq
->csd
);
559 rq
->q
->softirq_done_fn(rq
);
565 * blk_mq_complete_request - end I/O on a request
566 * @rq: the request being processed
569 * Ends all I/O on a request. It does not handle partial completions.
570 * The actual completion happens out-of-order, through a IPI handler.
572 void blk_mq_complete_request(struct request
*rq
)
574 struct request_queue
*q
= rq
->q
;
576 if (unlikely(blk_should_fake_timeout(q
)))
578 if (!blk_mark_rq_complete(rq
))
579 __blk_mq_complete_request(rq
);
581 EXPORT_SYMBOL(blk_mq_complete_request
);
583 int blk_mq_request_started(struct request
*rq
)
585 return test_bit(REQ_ATOM_STARTED
, &rq
->atomic_flags
);
587 EXPORT_SYMBOL_GPL(blk_mq_request_started
);
589 void blk_mq_start_request(struct request
*rq
)
591 struct request_queue
*q
= rq
->q
;
593 blk_mq_sched_started_request(rq
);
595 trace_block_rq_issue(q
, rq
);
597 if (test_bit(QUEUE_FLAG_STATS
, &q
->queue_flags
)) {
598 blk_stat_set_issue(&rq
->issue_stat
, blk_rq_sectors(rq
));
599 rq
->rq_flags
|= RQF_STATS
;
600 wbt_issue(q
->rq_wb
, &rq
->issue_stat
);
605 WARN_ON_ONCE(test_bit(REQ_ATOM_STARTED
, &rq
->atomic_flags
));
608 * Mark us as started and clear complete. Complete might have been
609 * set if requeue raced with timeout, which then marked it as
610 * complete. So be sure to clear complete again when we start
611 * the request, otherwise we'll ignore the completion event.
613 * Ensure that ->deadline is visible before we set STARTED, such that
614 * blk_mq_check_expired() is guaranteed to observe our ->deadline when
615 * it observes STARTED.
618 set_bit(REQ_ATOM_STARTED
, &rq
->atomic_flags
);
619 if (test_bit(REQ_ATOM_COMPLETE
, &rq
->atomic_flags
)) {
621 * Coherence order guarantees these consecutive stores to a
622 * single variable propagate in the specified order. Thus the
623 * clear_bit() is ordered _after_ the set bit. See
624 * blk_mq_check_expired().
626 * (the bits must be part of the same byte for this to be
629 clear_bit(REQ_ATOM_COMPLETE
, &rq
->atomic_flags
);
632 if (q
->dma_drain_size
&& blk_rq_bytes(rq
)) {
634 * Make sure space for the drain appears. We know we can do
635 * this because max_hw_segments has been adjusted to be one
636 * fewer than the device can handle.
638 rq
->nr_phys_segments
++;
641 EXPORT_SYMBOL(blk_mq_start_request
);
644 * When we reach here because queue is busy, REQ_ATOM_COMPLETE
645 * flag isn't set yet, so there may be race with timeout handler,
646 * but given rq->deadline is just set in .queue_rq() under
647 * this situation, the race won't be possible in reality because
648 * rq->timeout should be set as big enough to cover the window
649 * between blk_mq_start_request() called from .queue_rq() and
650 * clearing REQ_ATOM_STARTED here.
652 static void __blk_mq_requeue_request(struct request
*rq
)
654 struct request_queue
*q
= rq
->q
;
656 blk_mq_put_driver_tag(rq
);
658 trace_block_rq_requeue(q
, rq
);
659 wbt_requeue(q
->rq_wb
, &rq
->issue_stat
);
660 blk_mq_sched_requeue_request(rq
);
662 if (test_and_clear_bit(REQ_ATOM_STARTED
, &rq
->atomic_flags
)) {
663 if (q
->dma_drain_size
&& blk_rq_bytes(rq
))
664 rq
->nr_phys_segments
--;
668 void blk_mq_requeue_request(struct request
*rq
, bool kick_requeue_list
)
670 __blk_mq_requeue_request(rq
);
672 BUG_ON(blk_queued_rq(rq
));
673 blk_mq_add_to_requeue_list(rq
, true, kick_requeue_list
);
675 EXPORT_SYMBOL(blk_mq_requeue_request
);
677 static void blk_mq_requeue_work(struct work_struct
*work
)
679 struct request_queue
*q
=
680 container_of(work
, struct request_queue
, requeue_work
.work
);
682 struct request
*rq
, *next
;
684 spin_lock_irq(&q
->requeue_lock
);
685 list_splice_init(&q
->requeue_list
, &rq_list
);
686 spin_unlock_irq(&q
->requeue_lock
);
688 list_for_each_entry_safe(rq
, next
, &rq_list
, queuelist
) {
689 if (!(rq
->rq_flags
& RQF_SOFTBARRIER
))
692 rq
->rq_flags
&= ~RQF_SOFTBARRIER
;
693 list_del_init(&rq
->queuelist
);
694 blk_mq_sched_insert_request(rq
, true, false, false, true);
697 while (!list_empty(&rq_list
)) {
698 rq
= list_entry(rq_list
.next
, struct request
, queuelist
);
699 list_del_init(&rq
->queuelist
);
700 blk_mq_sched_insert_request(rq
, false, false, false, true);
703 blk_mq_run_hw_queues(q
, false);
706 void blk_mq_add_to_requeue_list(struct request
*rq
, bool at_head
,
707 bool kick_requeue_list
)
709 struct request_queue
*q
= rq
->q
;
713 * We abuse this flag that is otherwise used by the I/O scheduler to
714 * request head insertation from the workqueue.
716 BUG_ON(rq
->rq_flags
& RQF_SOFTBARRIER
);
718 spin_lock_irqsave(&q
->requeue_lock
, flags
);
720 rq
->rq_flags
|= RQF_SOFTBARRIER
;
721 list_add(&rq
->queuelist
, &q
->requeue_list
);
723 list_add_tail(&rq
->queuelist
, &q
->requeue_list
);
725 spin_unlock_irqrestore(&q
->requeue_lock
, flags
);
727 if (kick_requeue_list
)
728 blk_mq_kick_requeue_list(q
);
730 EXPORT_SYMBOL(blk_mq_add_to_requeue_list
);
732 void blk_mq_kick_requeue_list(struct request_queue
*q
)
734 kblockd_schedule_delayed_work(&q
->requeue_work
, 0);
736 EXPORT_SYMBOL(blk_mq_kick_requeue_list
);
738 void blk_mq_delay_kick_requeue_list(struct request_queue
*q
,
741 kblockd_mod_delayed_work_on(WORK_CPU_UNBOUND
, &q
->requeue_work
,
742 msecs_to_jiffies(msecs
));
744 EXPORT_SYMBOL(blk_mq_delay_kick_requeue_list
);
746 struct request
*blk_mq_tag_to_rq(struct blk_mq_tags
*tags
, unsigned int tag
)
748 if (tag
< tags
->nr_tags
) {
749 prefetch(tags
->rqs
[tag
]);
750 return tags
->rqs
[tag
];
755 EXPORT_SYMBOL(blk_mq_tag_to_rq
);
757 struct blk_mq_timeout_data
{
759 unsigned int next_set
;
762 void blk_mq_rq_timed_out(struct request
*req
, bool reserved
)
764 const struct blk_mq_ops
*ops
= req
->q
->mq_ops
;
765 enum blk_eh_timer_return ret
= BLK_EH_RESET_TIMER
;
768 * We know that complete is set at this point. If STARTED isn't set
769 * anymore, then the request isn't active and the "timeout" should
770 * just be ignored. This can happen due to the bitflag ordering.
771 * Timeout first checks if STARTED is set, and if it is, assumes
772 * the request is active. But if we race with completion, then
773 * both flags will get cleared. So check here again, and ignore
774 * a timeout event with a request that isn't active.
776 if (!test_bit(REQ_ATOM_STARTED
, &req
->atomic_flags
))
780 ret
= ops
->timeout(req
, reserved
);
784 __blk_mq_complete_request(req
);
786 case BLK_EH_RESET_TIMER
:
788 blk_clear_rq_complete(req
);
790 case BLK_EH_NOT_HANDLED
:
793 printk(KERN_ERR
"block: bad eh return: %d\n", ret
);
798 static void blk_mq_check_expired(struct blk_mq_hw_ctx
*hctx
,
799 struct request
*rq
, void *priv
, bool reserved
)
801 struct blk_mq_timeout_data
*data
= priv
;
802 unsigned long deadline
;
804 if (!test_bit(REQ_ATOM_STARTED
, &rq
->atomic_flags
))
808 * Ensures that if we see STARTED we must also see our
809 * up-to-date deadline, see blk_mq_start_request().
813 deadline
= READ_ONCE(rq
->deadline
);
816 * The rq being checked may have been freed and reallocated
817 * out already here, we avoid this race by checking rq->deadline
818 * and REQ_ATOM_COMPLETE flag together:
820 * - if rq->deadline is observed as new value because of
821 * reusing, the rq won't be timed out because of timing.
822 * - if rq->deadline is observed as previous value,
823 * REQ_ATOM_COMPLETE flag won't be cleared in reuse path
824 * because we put a barrier between setting rq->deadline
825 * and clearing the flag in blk_mq_start_request(), so
826 * this rq won't be timed out too.
828 if (time_after_eq(jiffies
, deadline
)) {
829 if (!blk_mark_rq_complete(rq
)) {
831 * Again coherence order ensures that consecutive reads
832 * from the same variable must be in that order. This
833 * ensures that if we see COMPLETE clear, we must then
834 * see STARTED set and we'll ignore this timeout.
836 * (There's also the MB implied by the test_and_clear())
838 blk_mq_rq_timed_out(rq
, reserved
);
840 } else if (!data
->next_set
|| time_after(data
->next
, deadline
)) {
841 data
->next
= deadline
;
846 static void blk_mq_timeout_work(struct work_struct
*work
)
848 struct request_queue
*q
=
849 container_of(work
, struct request_queue
, timeout_work
);
850 struct blk_mq_timeout_data data
= {
856 /* A deadlock might occur if a request is stuck requiring a
857 * timeout at the same time a queue freeze is waiting
858 * completion, since the timeout code would not be able to
859 * acquire the queue reference here.
861 * That's why we don't use blk_queue_enter here; instead, we use
862 * percpu_ref_tryget directly, because we need to be able to
863 * obtain a reference even in the short window between the queue
864 * starting to freeze, by dropping the first reference in
865 * blk_freeze_queue_start, and the moment the last request is
866 * consumed, marked by the instant q_usage_counter reaches
869 if (!percpu_ref_tryget(&q
->q_usage_counter
))
872 blk_mq_queue_tag_busy_iter(q
, blk_mq_check_expired
, &data
);
875 data
.next
= blk_rq_timeout(round_jiffies_up(data
.next
));
876 mod_timer(&q
->timeout
, data
.next
);
878 struct blk_mq_hw_ctx
*hctx
;
880 queue_for_each_hw_ctx(q
, hctx
, i
) {
881 /* the hctx may be unmapped, so check it here */
882 if (blk_mq_hw_queue_mapped(hctx
))
883 blk_mq_tag_idle(hctx
);
889 struct flush_busy_ctx_data
{
890 struct blk_mq_hw_ctx
*hctx
;
891 struct list_head
*list
;
894 static bool flush_busy_ctx(struct sbitmap
*sb
, unsigned int bitnr
, void *data
)
896 struct flush_busy_ctx_data
*flush_data
= data
;
897 struct blk_mq_hw_ctx
*hctx
= flush_data
->hctx
;
898 struct blk_mq_ctx
*ctx
= hctx
->ctxs
[bitnr
];
900 sbitmap_clear_bit(sb
, bitnr
);
901 spin_lock(&ctx
->lock
);
902 list_splice_tail_init(&ctx
->rq_list
, flush_data
->list
);
903 spin_unlock(&ctx
->lock
);
908 * Process software queues that have been marked busy, splicing them
909 * to the for-dispatch
911 void blk_mq_flush_busy_ctxs(struct blk_mq_hw_ctx
*hctx
, struct list_head
*list
)
913 struct flush_busy_ctx_data data
= {
918 sbitmap_for_each_set(&hctx
->ctx_map
, flush_busy_ctx
, &data
);
920 EXPORT_SYMBOL_GPL(blk_mq_flush_busy_ctxs
);
922 struct dispatch_rq_data
{
923 struct blk_mq_hw_ctx
*hctx
;
927 static bool dispatch_rq_from_ctx(struct sbitmap
*sb
, unsigned int bitnr
,
930 struct dispatch_rq_data
*dispatch_data
= data
;
931 struct blk_mq_hw_ctx
*hctx
= dispatch_data
->hctx
;
932 struct blk_mq_ctx
*ctx
= hctx
->ctxs
[bitnr
];
934 spin_lock(&ctx
->lock
);
935 if (unlikely(!list_empty(&ctx
->rq_list
))) {
936 dispatch_data
->rq
= list_entry_rq(ctx
->rq_list
.next
);
937 list_del_init(&dispatch_data
->rq
->queuelist
);
938 if (list_empty(&ctx
->rq_list
))
939 sbitmap_clear_bit(sb
, bitnr
);
941 spin_unlock(&ctx
->lock
);
943 return !dispatch_data
->rq
;
946 struct request
*blk_mq_dequeue_from_ctx(struct blk_mq_hw_ctx
*hctx
,
947 struct blk_mq_ctx
*start
)
949 unsigned off
= start
? start
->index_hw
: 0;
950 struct dispatch_rq_data data
= {
955 __sbitmap_for_each_set(&hctx
->ctx_map
, off
,
956 dispatch_rq_from_ctx
, &data
);
961 static inline unsigned int queued_to_index(unsigned int queued
)
966 return min(BLK_MQ_MAX_DISPATCH_ORDER
- 1, ilog2(queued
) + 1);
969 bool blk_mq_get_driver_tag(struct request
*rq
, struct blk_mq_hw_ctx
**hctx
,
972 struct blk_mq_alloc_data data
= {
974 .hctx
= blk_mq_map_queue(rq
->q
, rq
->mq_ctx
->cpu
),
975 .flags
= wait
? 0 : BLK_MQ_REQ_NOWAIT
,
978 might_sleep_if(wait
);
983 if (blk_mq_tag_is_reserved(data
.hctx
->sched_tags
, rq
->internal_tag
))
984 data
.flags
|= BLK_MQ_REQ_RESERVED
;
986 rq
->tag
= blk_mq_get_tag(&data
);
988 if (blk_mq_tag_busy(data
.hctx
)) {
989 rq
->rq_flags
|= RQF_MQ_INFLIGHT
;
990 atomic_inc(&data
.hctx
->nr_active
);
992 data
.hctx
->tags
->rqs
[rq
->tag
] = rq
;
998 return rq
->tag
!= -1;
1001 static int blk_mq_dispatch_wake(wait_queue_entry_t
*wait
, unsigned mode
, int flags
,
1004 struct blk_mq_hw_ctx
*hctx
;
1006 hctx
= container_of(wait
, struct blk_mq_hw_ctx
, dispatch_wait
);
1008 list_del(&wait
->entry
);
1009 clear_bit_unlock(BLK_MQ_S_TAG_WAITING
, &hctx
->state
);
1010 blk_mq_run_hw_queue(hctx
, true);
1014 static bool blk_mq_dispatch_wait_add(struct blk_mq_hw_ctx
*hctx
)
1016 struct sbq_wait_state
*ws
;
1019 * The TAG_WAITING bit serves as a lock protecting hctx->dispatch_wait.
1020 * The thread which wins the race to grab this bit adds the hardware
1021 * queue to the wait queue.
1023 if (test_bit(BLK_MQ_S_TAG_WAITING
, &hctx
->state
) ||
1024 test_and_set_bit_lock(BLK_MQ_S_TAG_WAITING
, &hctx
->state
))
1027 init_waitqueue_func_entry(&hctx
->dispatch_wait
, blk_mq_dispatch_wake
);
1028 ws
= bt_wait_ptr(&hctx
->tags
->bitmap_tags
, hctx
);
1031 * As soon as this returns, it's no longer safe to fiddle with
1032 * hctx->dispatch_wait, since a completion can wake up the wait queue
1033 * and unlock the bit.
1035 add_wait_queue(&ws
->wait
, &hctx
->dispatch_wait
);
1039 bool blk_mq_dispatch_rq_list(struct request_queue
*q
, struct list_head
*list
,
1042 struct blk_mq_hw_ctx
*hctx
;
1043 struct request
*rq
, *nxt
;
1046 if (list_empty(list
))
1049 WARN_ON(!list_is_singular(list
) && got_budget
);
1052 * Now process all the entries, sending them to the driver.
1054 errors
= queued
= 0;
1056 struct blk_mq_queue_data bd
;
1059 rq
= list_first_entry(list
, struct request
, queuelist
);
1060 if (!blk_mq_get_driver_tag(rq
, &hctx
, false)) {
1062 * The initial allocation attempt failed, so we need to
1063 * rerun the hardware queue when a tag is freed.
1065 if (!blk_mq_dispatch_wait_add(hctx
)) {
1067 blk_mq_put_dispatch_budget(hctx
);
1072 * It's possible that a tag was freed in the window
1073 * between the allocation failure and adding the
1074 * hardware queue to the wait queue.
1076 if (!blk_mq_get_driver_tag(rq
, &hctx
, false)) {
1078 blk_mq_put_dispatch_budget(hctx
);
1083 if (!got_budget
&& !blk_mq_get_dispatch_budget(hctx
))
1086 list_del_init(&rq
->queuelist
);
1091 * Flag last if we have no more requests, or if we have more
1092 * but can't assign a driver tag to it.
1094 if (list_empty(list
))
1097 nxt
= list_first_entry(list
, struct request
, queuelist
);
1098 bd
.last
= !blk_mq_get_driver_tag(nxt
, NULL
, false);
1101 ret
= q
->mq_ops
->queue_rq(hctx
, &bd
);
1102 if (ret
== BLK_STS_RESOURCE
) {
1104 * If an I/O scheduler has been configured and we got a
1105 * driver tag for the next request already, free it again.
1107 if (!list_empty(list
)) {
1108 nxt
= list_first_entry(list
, struct request
, queuelist
);
1109 blk_mq_put_driver_tag(nxt
);
1111 list_add(&rq
->queuelist
, list
);
1112 __blk_mq_requeue_request(rq
);
1116 if (unlikely(ret
!= BLK_STS_OK
)) {
1118 blk_mq_end_request(rq
, BLK_STS_IOERR
);
1123 } while (!list_empty(list
));
1125 hctx
->dispatched
[queued_to_index(queued
)]++;
1128 * Any items that need requeuing? Stuff them into hctx->dispatch,
1129 * that is where we will continue on next queue run.
1131 if (!list_empty(list
)) {
1132 spin_lock(&hctx
->lock
);
1133 list_splice_init(list
, &hctx
->dispatch
);
1134 spin_unlock(&hctx
->lock
);
1137 * If SCHED_RESTART was set by the caller of this function and
1138 * it is no longer set that means that it was cleared by another
1139 * thread and hence that a queue rerun is needed.
1141 * If TAG_WAITING is set that means that an I/O scheduler has
1142 * been configured and another thread is waiting for a driver
1143 * tag. To guarantee fairness, do not rerun this hardware queue
1144 * but let the other thread grab the driver tag.
1146 * If no I/O scheduler has been configured it is possible that
1147 * the hardware queue got stopped and restarted before requests
1148 * were pushed back onto the dispatch list. Rerun the queue to
1149 * avoid starvation. Notes:
1150 * - blk_mq_run_hw_queue() checks whether or not a queue has
1151 * been stopped before rerunning a queue.
1152 * - Some but not all block drivers stop a queue before
1153 * returning BLK_STS_RESOURCE. Two exceptions are scsi-mq
1156 if (!blk_mq_sched_needs_restart(hctx
) &&
1157 !test_bit(BLK_MQ_S_TAG_WAITING
, &hctx
->state
))
1158 blk_mq_run_hw_queue(hctx
, true);
1161 return (queued
+ errors
) != 0;
1164 static void __blk_mq_run_hw_queue(struct blk_mq_hw_ctx
*hctx
)
1169 * We should be running this queue from one of the CPUs that
1172 WARN_ON(!cpumask_test_cpu(raw_smp_processor_id(), hctx
->cpumask
) &&
1173 cpu_online(hctx
->next_cpu
));
1176 * We can't run the queue inline with ints disabled. Ensure that
1177 * we catch bad users of this early.
1179 WARN_ON_ONCE(in_interrupt());
1181 if (!(hctx
->flags
& BLK_MQ_F_BLOCKING
)) {
1183 blk_mq_sched_dispatch_requests(hctx
);
1188 srcu_idx
= srcu_read_lock(hctx
->queue_rq_srcu
);
1189 blk_mq_sched_dispatch_requests(hctx
);
1190 srcu_read_unlock(hctx
->queue_rq_srcu
, srcu_idx
);
1195 * It'd be great if the workqueue API had a way to pass
1196 * in a mask and had some smarts for more clever placement.
1197 * For now we just round-robin here, switching for every
1198 * BLK_MQ_CPU_WORK_BATCH queued items.
1200 static int blk_mq_hctx_next_cpu(struct blk_mq_hw_ctx
*hctx
)
1202 if (hctx
->queue
->nr_hw_queues
== 1)
1203 return WORK_CPU_UNBOUND
;
1205 if (--hctx
->next_cpu_batch
<= 0) {
1208 next_cpu
= cpumask_next(hctx
->next_cpu
, hctx
->cpumask
);
1209 if (next_cpu
>= nr_cpu_ids
)
1210 next_cpu
= cpumask_first(hctx
->cpumask
);
1212 hctx
->next_cpu
= next_cpu
;
1213 hctx
->next_cpu_batch
= BLK_MQ_CPU_WORK_BATCH
;
1216 return hctx
->next_cpu
;
1219 static void __blk_mq_delay_run_hw_queue(struct blk_mq_hw_ctx
*hctx
, bool async
,
1220 unsigned long msecs
)
1222 if (WARN_ON_ONCE(!blk_mq_hw_queue_mapped(hctx
)))
1225 if (unlikely(blk_mq_hctx_stopped(hctx
)))
1228 if (!async
&& !(hctx
->flags
& BLK_MQ_F_BLOCKING
)) {
1229 int cpu
= get_cpu();
1230 if (cpumask_test_cpu(cpu
, hctx
->cpumask
)) {
1231 __blk_mq_run_hw_queue(hctx
);
1239 kblockd_schedule_delayed_work_on(blk_mq_hctx_next_cpu(hctx
),
1241 msecs_to_jiffies(msecs
));
1244 void blk_mq_delay_run_hw_queue(struct blk_mq_hw_ctx
*hctx
, unsigned long msecs
)
1246 __blk_mq_delay_run_hw_queue(hctx
, true, msecs
);
1248 EXPORT_SYMBOL(blk_mq_delay_run_hw_queue
);
1250 void blk_mq_run_hw_queue(struct blk_mq_hw_ctx
*hctx
, bool async
)
1252 __blk_mq_delay_run_hw_queue(hctx
, async
, 0);
1254 EXPORT_SYMBOL(blk_mq_run_hw_queue
);
1256 void blk_mq_run_hw_queues(struct request_queue
*q
, bool async
)
1258 struct blk_mq_hw_ctx
*hctx
;
1261 queue_for_each_hw_ctx(q
, hctx
, i
) {
1262 if (!blk_mq_hctx_has_pending(hctx
) ||
1263 blk_mq_hctx_stopped(hctx
))
1266 blk_mq_run_hw_queue(hctx
, async
);
1269 EXPORT_SYMBOL(blk_mq_run_hw_queues
);
1272 * blk_mq_queue_stopped() - check whether one or more hctxs have been stopped
1273 * @q: request queue.
1275 * The caller is responsible for serializing this function against
1276 * blk_mq_{start,stop}_hw_queue().
1278 bool blk_mq_queue_stopped(struct request_queue
*q
)
1280 struct blk_mq_hw_ctx
*hctx
;
1283 queue_for_each_hw_ctx(q
, hctx
, i
)
1284 if (blk_mq_hctx_stopped(hctx
))
1289 EXPORT_SYMBOL(blk_mq_queue_stopped
);
1292 * This function is often used for pausing .queue_rq() by driver when
1293 * there isn't enough resource or some conditions aren't satisfied, and
1294 * BLK_STS_RESOURCE is usually returned.
1296 * We do not guarantee that dispatch can be drained or blocked
1297 * after blk_mq_stop_hw_queue() returns. Please use
1298 * blk_mq_quiesce_queue() for that requirement.
1300 void blk_mq_stop_hw_queue(struct blk_mq_hw_ctx
*hctx
)
1302 cancel_delayed_work(&hctx
->run_work
);
1304 set_bit(BLK_MQ_S_STOPPED
, &hctx
->state
);
1306 EXPORT_SYMBOL(blk_mq_stop_hw_queue
);
1309 * This function is often used for pausing .queue_rq() by driver when
1310 * there isn't enough resource or some conditions aren't satisfied, and
1311 * BLK_STS_RESOURCE is usually returned.
1313 * We do not guarantee that dispatch can be drained or blocked
1314 * after blk_mq_stop_hw_queues() returns. Please use
1315 * blk_mq_quiesce_queue() for that requirement.
1317 void blk_mq_stop_hw_queues(struct request_queue
*q
)
1319 struct blk_mq_hw_ctx
*hctx
;
1322 queue_for_each_hw_ctx(q
, hctx
, i
)
1323 blk_mq_stop_hw_queue(hctx
);
1325 EXPORT_SYMBOL(blk_mq_stop_hw_queues
);
1327 void blk_mq_start_hw_queue(struct blk_mq_hw_ctx
*hctx
)
1329 clear_bit(BLK_MQ_S_STOPPED
, &hctx
->state
);
1331 blk_mq_run_hw_queue(hctx
, false);
1333 EXPORT_SYMBOL(blk_mq_start_hw_queue
);
1335 void blk_mq_start_hw_queues(struct request_queue
*q
)
1337 struct blk_mq_hw_ctx
*hctx
;
1340 queue_for_each_hw_ctx(q
, hctx
, i
)
1341 blk_mq_start_hw_queue(hctx
);
1343 EXPORT_SYMBOL(blk_mq_start_hw_queues
);
1345 void blk_mq_start_stopped_hw_queue(struct blk_mq_hw_ctx
*hctx
, bool async
)
1347 if (!blk_mq_hctx_stopped(hctx
))
1350 clear_bit(BLK_MQ_S_STOPPED
, &hctx
->state
);
1351 blk_mq_run_hw_queue(hctx
, async
);
1353 EXPORT_SYMBOL_GPL(blk_mq_start_stopped_hw_queue
);
1355 void blk_mq_start_stopped_hw_queues(struct request_queue
*q
, bool async
)
1357 struct blk_mq_hw_ctx
*hctx
;
1360 queue_for_each_hw_ctx(q
, hctx
, i
)
1361 blk_mq_start_stopped_hw_queue(hctx
, async
);
1363 EXPORT_SYMBOL(blk_mq_start_stopped_hw_queues
);
1365 static void blk_mq_run_work_fn(struct work_struct
*work
)
1367 struct blk_mq_hw_ctx
*hctx
;
1369 hctx
= container_of(work
, struct blk_mq_hw_ctx
, run_work
.work
);
1372 * If we are stopped, don't run the queue. The exception is if
1373 * BLK_MQ_S_START_ON_RUN is set. For that case, we auto-clear
1374 * the STOPPED bit and run it.
1376 if (test_bit(BLK_MQ_S_STOPPED
, &hctx
->state
)) {
1377 if (!test_bit(BLK_MQ_S_START_ON_RUN
, &hctx
->state
))
1380 clear_bit(BLK_MQ_S_START_ON_RUN
, &hctx
->state
);
1381 clear_bit(BLK_MQ_S_STOPPED
, &hctx
->state
);
1384 __blk_mq_run_hw_queue(hctx
);
1388 void blk_mq_delay_queue(struct blk_mq_hw_ctx
*hctx
, unsigned long msecs
)
1390 if (WARN_ON_ONCE(!blk_mq_hw_queue_mapped(hctx
)))
1394 * Stop the hw queue, then modify currently delayed work.
1395 * This should prevent us from running the queue prematurely.
1396 * Mark the queue as auto-clearing STOPPED when it runs.
1398 blk_mq_stop_hw_queue(hctx
);
1399 set_bit(BLK_MQ_S_START_ON_RUN
, &hctx
->state
);
1400 kblockd_mod_delayed_work_on(blk_mq_hctx_next_cpu(hctx
),
1402 msecs_to_jiffies(msecs
));
1404 EXPORT_SYMBOL(blk_mq_delay_queue
);
1406 static inline void __blk_mq_insert_req_list(struct blk_mq_hw_ctx
*hctx
,
1410 struct blk_mq_ctx
*ctx
= rq
->mq_ctx
;
1412 lockdep_assert_held(&ctx
->lock
);
1414 trace_block_rq_insert(hctx
->queue
, rq
);
1417 list_add(&rq
->queuelist
, &ctx
->rq_list
);
1419 list_add_tail(&rq
->queuelist
, &ctx
->rq_list
);
1422 void __blk_mq_insert_request(struct blk_mq_hw_ctx
*hctx
, struct request
*rq
,
1425 struct blk_mq_ctx
*ctx
= rq
->mq_ctx
;
1427 lockdep_assert_held(&ctx
->lock
);
1429 __blk_mq_insert_req_list(hctx
, rq
, at_head
);
1430 blk_mq_hctx_mark_pending(hctx
, ctx
);
1434 * Should only be used carefully, when the caller knows we want to
1435 * bypass a potential IO scheduler on the target device.
1437 void blk_mq_request_bypass_insert(struct request
*rq
, bool run_queue
)
1439 struct blk_mq_ctx
*ctx
= rq
->mq_ctx
;
1440 struct blk_mq_hw_ctx
*hctx
= blk_mq_map_queue(rq
->q
, ctx
->cpu
);
1442 spin_lock(&hctx
->lock
);
1443 list_add_tail(&rq
->queuelist
, &hctx
->dispatch
);
1444 spin_unlock(&hctx
->lock
);
1447 blk_mq_run_hw_queue(hctx
, false);
1450 void blk_mq_insert_requests(struct blk_mq_hw_ctx
*hctx
, struct blk_mq_ctx
*ctx
,
1451 struct list_head
*list
)
1455 * preemption doesn't flush plug list, so it's possible ctx->cpu is
1458 spin_lock(&ctx
->lock
);
1459 while (!list_empty(list
)) {
1462 rq
= list_first_entry(list
, struct request
, queuelist
);
1463 BUG_ON(rq
->mq_ctx
!= ctx
);
1464 list_del_init(&rq
->queuelist
);
1465 __blk_mq_insert_req_list(hctx
, rq
, false);
1467 blk_mq_hctx_mark_pending(hctx
, ctx
);
1468 spin_unlock(&ctx
->lock
);
1471 static int plug_ctx_cmp(void *priv
, struct list_head
*a
, struct list_head
*b
)
1473 struct request
*rqa
= container_of(a
, struct request
, queuelist
);
1474 struct request
*rqb
= container_of(b
, struct request
, queuelist
);
1476 return !(rqa
->mq_ctx
< rqb
->mq_ctx
||
1477 (rqa
->mq_ctx
== rqb
->mq_ctx
&&
1478 blk_rq_pos(rqa
) < blk_rq_pos(rqb
)));
1481 void blk_mq_flush_plug_list(struct blk_plug
*plug
, bool from_schedule
)
1483 struct blk_mq_ctx
*this_ctx
;
1484 struct request_queue
*this_q
;
1487 LIST_HEAD(ctx_list
);
1490 list_splice_init(&plug
->mq_list
, &list
);
1492 list_sort(NULL
, &list
, plug_ctx_cmp
);
1498 while (!list_empty(&list
)) {
1499 rq
= list_entry_rq(list
.next
);
1500 list_del_init(&rq
->queuelist
);
1502 if (rq
->mq_ctx
!= this_ctx
) {
1504 trace_block_unplug(this_q
, depth
, from_schedule
);
1505 blk_mq_sched_insert_requests(this_q
, this_ctx
,
1510 this_ctx
= rq
->mq_ctx
;
1516 list_add_tail(&rq
->queuelist
, &ctx_list
);
1520 * If 'this_ctx' is set, we know we have entries to complete
1521 * on 'ctx_list'. Do those.
1524 trace_block_unplug(this_q
, depth
, from_schedule
);
1525 blk_mq_sched_insert_requests(this_q
, this_ctx
, &ctx_list
,
1530 static void blk_mq_bio_to_request(struct request
*rq
, struct bio
*bio
)
1532 blk_init_request_from_bio(rq
, bio
);
1534 blk_rq_set_rl(rq
, blk_get_rl(rq
->q
, bio
));
1536 blk_account_io_start(rq
, true);
1539 static inline void blk_mq_queue_io(struct blk_mq_hw_ctx
*hctx
,
1540 struct blk_mq_ctx
*ctx
,
1543 spin_lock(&ctx
->lock
);
1544 __blk_mq_insert_request(hctx
, rq
, false);
1545 spin_unlock(&ctx
->lock
);
1548 static blk_qc_t
request_to_qc_t(struct blk_mq_hw_ctx
*hctx
, struct request
*rq
)
1551 return blk_tag_to_qc_t(rq
->tag
, hctx
->queue_num
, false);
1553 return blk_tag_to_qc_t(rq
->internal_tag
, hctx
->queue_num
, true);
1556 static void __blk_mq_try_issue_directly(struct blk_mq_hw_ctx
*hctx
,
1558 blk_qc_t
*cookie
, bool may_sleep
)
1560 struct request_queue
*q
= rq
->q
;
1561 struct blk_mq_queue_data bd
= {
1565 blk_qc_t new_cookie
;
1567 bool run_queue
= true;
1569 /* RCU or SRCU read lock is needed before checking quiesced flag */
1570 if (blk_mq_hctx_stopped(hctx
) || blk_queue_quiesced(q
)) {
1578 if (!blk_mq_get_driver_tag(rq
, NULL
, false))
1581 if (!blk_mq_get_dispatch_budget(hctx
)) {
1582 blk_mq_put_driver_tag(rq
);
1586 new_cookie
= request_to_qc_t(hctx
, rq
);
1589 * For OK queue, we are done. For error, kill it. Any other
1590 * error (busy), just add it to our list as we previously
1593 ret
= q
->mq_ops
->queue_rq(hctx
, &bd
);
1596 *cookie
= new_cookie
;
1598 case BLK_STS_RESOURCE
:
1599 __blk_mq_requeue_request(rq
);
1602 *cookie
= BLK_QC_T_NONE
;
1603 blk_mq_end_request(rq
, ret
);
1608 blk_mq_sched_insert_request(rq
, false, run_queue
, false, may_sleep
);
1611 static void blk_mq_try_issue_directly(struct blk_mq_hw_ctx
*hctx
,
1612 struct request
*rq
, blk_qc_t
*cookie
)
1614 if (!(hctx
->flags
& BLK_MQ_F_BLOCKING
)) {
1616 __blk_mq_try_issue_directly(hctx
, rq
, cookie
, false);
1619 unsigned int srcu_idx
;
1623 srcu_idx
= srcu_read_lock(hctx
->queue_rq_srcu
);
1624 __blk_mq_try_issue_directly(hctx
, rq
, cookie
, true);
1625 srcu_read_unlock(hctx
->queue_rq_srcu
, srcu_idx
);
1629 static blk_qc_t
blk_mq_make_request(struct request_queue
*q
, struct bio
*bio
)
1631 const int is_sync
= op_is_sync(bio
->bi_opf
);
1632 const int is_flush_fua
= op_is_flush(bio
->bi_opf
);
1633 struct blk_mq_alloc_data data
= { .flags
= 0 };
1635 unsigned int request_count
= 0;
1636 struct blk_plug
*plug
;
1637 struct request
*same_queue_rq
= NULL
;
1639 unsigned int wb_acct
;
1641 blk_queue_bounce(q
, &bio
);
1643 blk_queue_split(q
, &bio
);
1645 if (!bio_integrity_prep(bio
))
1646 return BLK_QC_T_NONE
;
1648 if (!is_flush_fua
&& !blk_queue_nomerges(q
) &&
1649 blk_attempt_plug_merge(q
, bio
, &request_count
, &same_queue_rq
))
1650 return BLK_QC_T_NONE
;
1652 if (blk_mq_sched_bio_merge(q
, bio
))
1653 return BLK_QC_T_NONE
;
1655 wb_acct
= wbt_wait(q
->rq_wb
, bio
, NULL
);
1657 trace_block_getrq(q
, bio
, bio
->bi_opf
);
1659 rq
= blk_mq_get_request(q
, bio
, bio
->bi_opf
, &data
);
1660 if (unlikely(!rq
)) {
1661 __wbt_done(q
->rq_wb
, wb_acct
);
1662 if (bio
->bi_opf
& REQ_NOWAIT
)
1663 bio_wouldblock_error(bio
);
1664 return BLK_QC_T_NONE
;
1667 wbt_track(&rq
->issue_stat
, wb_acct
);
1669 cookie
= request_to_qc_t(data
.hctx
, rq
);
1671 plug
= current
->plug
;
1672 if (unlikely(is_flush_fua
)) {
1673 blk_mq_put_ctx(data
.ctx
);
1674 blk_mq_bio_to_request(rq
, bio
);
1676 /* bypass scheduler for flush rq */
1677 blk_insert_flush(rq
);
1678 blk_mq_run_hw_queue(data
.hctx
, true);
1679 } else if (plug
&& q
->nr_hw_queues
== 1) {
1680 struct request
*last
= NULL
;
1682 blk_mq_put_ctx(data
.ctx
);
1683 blk_mq_bio_to_request(rq
, bio
);
1686 * @request_count may become stale because of schedule
1687 * out, so check the list again.
1689 if (list_empty(&plug
->mq_list
))
1691 else if (blk_queue_nomerges(q
))
1692 request_count
= blk_plug_queued_count(q
);
1695 trace_block_plug(q
);
1697 last
= list_entry_rq(plug
->mq_list
.prev
);
1699 if (request_count
>= BLK_MAX_REQUEST_COUNT
|| (last
&&
1700 blk_rq_bytes(last
) >= BLK_PLUG_FLUSH_SIZE
)) {
1701 blk_flush_plug_list(plug
, false);
1702 trace_block_plug(q
);
1705 list_add_tail(&rq
->queuelist
, &plug
->mq_list
);
1706 } else if (plug
&& !blk_queue_nomerges(q
)) {
1707 blk_mq_bio_to_request(rq
, bio
);
1710 * We do limited plugging. If the bio can be merged, do that.
1711 * Otherwise the existing request in the plug list will be
1712 * issued. So the plug list will have one request at most
1713 * The plug list might get flushed before this. If that happens,
1714 * the plug list is empty, and same_queue_rq is invalid.
1716 if (list_empty(&plug
->mq_list
))
1717 same_queue_rq
= NULL
;
1719 list_del_init(&same_queue_rq
->queuelist
);
1720 list_add_tail(&rq
->queuelist
, &plug
->mq_list
);
1722 blk_mq_put_ctx(data
.ctx
);
1724 if (same_queue_rq
) {
1725 data
.hctx
= blk_mq_map_queue(q
,
1726 same_queue_rq
->mq_ctx
->cpu
);
1727 blk_mq_try_issue_directly(data
.hctx
, same_queue_rq
,
1730 } else if (q
->nr_hw_queues
> 1 && is_sync
) {
1731 blk_mq_put_ctx(data
.ctx
);
1732 blk_mq_bio_to_request(rq
, bio
);
1733 blk_mq_try_issue_directly(data
.hctx
, rq
, &cookie
);
1734 } else if (q
->elevator
) {
1735 blk_mq_put_ctx(data
.ctx
);
1736 blk_mq_bio_to_request(rq
, bio
);
1737 blk_mq_sched_insert_request(rq
, false, true, true, true);
1739 blk_mq_put_ctx(data
.ctx
);
1740 blk_mq_bio_to_request(rq
, bio
);
1741 blk_mq_queue_io(data
.hctx
, data
.ctx
, rq
);
1742 blk_mq_run_hw_queue(data
.hctx
, true);
1748 void blk_mq_free_rqs(struct blk_mq_tag_set
*set
, struct blk_mq_tags
*tags
,
1749 unsigned int hctx_idx
)
1753 if (tags
->rqs
&& set
->ops
->exit_request
) {
1756 for (i
= 0; i
< tags
->nr_tags
; i
++) {
1757 struct request
*rq
= tags
->static_rqs
[i
];
1761 set
->ops
->exit_request(set
, rq
, hctx_idx
);
1762 tags
->static_rqs
[i
] = NULL
;
1766 while (!list_empty(&tags
->page_list
)) {
1767 page
= list_first_entry(&tags
->page_list
, struct page
, lru
);
1768 list_del_init(&page
->lru
);
1770 * Remove kmemleak object previously allocated in
1771 * blk_mq_init_rq_map().
1773 kmemleak_free(page_address(page
));
1774 __free_pages(page
, page
->private);
1778 void blk_mq_free_rq_map(struct blk_mq_tags
*tags
)
1782 kfree(tags
->static_rqs
);
1783 tags
->static_rqs
= NULL
;
1785 blk_mq_free_tags(tags
);
1788 struct blk_mq_tags
*blk_mq_alloc_rq_map(struct blk_mq_tag_set
*set
,
1789 unsigned int hctx_idx
,
1790 unsigned int nr_tags
,
1791 unsigned int reserved_tags
)
1793 struct blk_mq_tags
*tags
;
1796 node
= blk_mq_hw_queue_to_node(set
->mq_map
, hctx_idx
);
1797 if (node
== NUMA_NO_NODE
)
1798 node
= set
->numa_node
;
1800 tags
= blk_mq_init_tags(nr_tags
, reserved_tags
, node
,
1801 BLK_MQ_FLAG_TO_ALLOC_POLICY(set
->flags
));
1805 tags
->rqs
= kzalloc_node(nr_tags
* sizeof(struct request
*),
1806 GFP_NOIO
| __GFP_NOWARN
| __GFP_NORETRY
,
1809 blk_mq_free_tags(tags
);
1813 tags
->static_rqs
= kzalloc_node(nr_tags
* sizeof(struct request
*),
1814 GFP_NOIO
| __GFP_NOWARN
| __GFP_NORETRY
,
1816 if (!tags
->static_rqs
) {
1818 blk_mq_free_tags(tags
);
1825 static size_t order_to_size(unsigned int order
)
1827 return (size_t)PAGE_SIZE
<< order
;
1830 int blk_mq_alloc_rqs(struct blk_mq_tag_set
*set
, struct blk_mq_tags
*tags
,
1831 unsigned int hctx_idx
, unsigned int depth
)
1833 unsigned int i
, j
, entries_per_page
, max_order
= 4;
1834 size_t rq_size
, left
;
1837 node
= blk_mq_hw_queue_to_node(set
->mq_map
, hctx_idx
);
1838 if (node
== NUMA_NO_NODE
)
1839 node
= set
->numa_node
;
1841 INIT_LIST_HEAD(&tags
->page_list
);
1844 * rq_size is the size of the request plus driver payload, rounded
1845 * to the cacheline size
1847 rq_size
= round_up(sizeof(struct request
) + set
->cmd_size
,
1849 left
= rq_size
* depth
;
1851 for (i
= 0; i
< depth
; ) {
1852 int this_order
= max_order
;
1857 while (this_order
&& left
< order_to_size(this_order
- 1))
1861 page
= alloc_pages_node(node
,
1862 GFP_NOIO
| __GFP_NOWARN
| __GFP_NORETRY
| __GFP_ZERO
,
1868 if (order_to_size(this_order
) < rq_size
)
1875 page
->private = this_order
;
1876 list_add_tail(&page
->lru
, &tags
->page_list
);
1878 p
= page_address(page
);
1880 * Allow kmemleak to scan these pages as they contain pointers
1881 * to additional allocations like via ops->init_request().
1883 kmemleak_alloc(p
, order_to_size(this_order
), 1, GFP_NOIO
);
1884 entries_per_page
= order_to_size(this_order
) / rq_size
;
1885 to_do
= min(entries_per_page
, depth
- i
);
1886 left
-= to_do
* rq_size
;
1887 for (j
= 0; j
< to_do
; j
++) {
1888 struct request
*rq
= p
;
1890 tags
->static_rqs
[i
] = rq
;
1891 if (set
->ops
->init_request
) {
1892 if (set
->ops
->init_request(set
, rq
, hctx_idx
,
1894 tags
->static_rqs
[i
] = NULL
;
1906 blk_mq_free_rqs(set
, tags
, hctx_idx
);
1911 * 'cpu' is going away. splice any existing rq_list entries from this
1912 * software queue to the hw queue dispatch list, and ensure that it
1915 static int blk_mq_hctx_notify_dead(unsigned int cpu
, struct hlist_node
*node
)
1917 struct blk_mq_hw_ctx
*hctx
;
1918 struct blk_mq_ctx
*ctx
;
1921 hctx
= hlist_entry_safe(node
, struct blk_mq_hw_ctx
, cpuhp_dead
);
1922 ctx
= __blk_mq_get_ctx(hctx
->queue
, cpu
);
1924 spin_lock(&ctx
->lock
);
1925 if (!list_empty(&ctx
->rq_list
)) {
1926 list_splice_init(&ctx
->rq_list
, &tmp
);
1927 blk_mq_hctx_clear_pending(hctx
, ctx
);
1929 spin_unlock(&ctx
->lock
);
1931 if (list_empty(&tmp
))
1934 spin_lock(&hctx
->lock
);
1935 list_splice_tail_init(&tmp
, &hctx
->dispatch
);
1936 spin_unlock(&hctx
->lock
);
1938 blk_mq_run_hw_queue(hctx
, true);
1942 static void blk_mq_remove_cpuhp(struct blk_mq_hw_ctx
*hctx
)
1944 cpuhp_state_remove_instance_nocalls(CPUHP_BLK_MQ_DEAD
,
1948 /* hctx->ctxs will be freed in queue's release handler */
1949 static void blk_mq_exit_hctx(struct request_queue
*q
,
1950 struct blk_mq_tag_set
*set
,
1951 struct blk_mq_hw_ctx
*hctx
, unsigned int hctx_idx
)
1953 blk_mq_debugfs_unregister_hctx(hctx
);
1955 blk_mq_tag_idle(hctx
);
1957 if (set
->ops
->exit_request
)
1958 set
->ops
->exit_request(set
, hctx
->fq
->flush_rq
, hctx_idx
);
1960 blk_mq_sched_exit_hctx(q
, hctx
, hctx_idx
);
1962 if (set
->ops
->exit_hctx
)
1963 set
->ops
->exit_hctx(hctx
, hctx_idx
);
1965 if (hctx
->flags
& BLK_MQ_F_BLOCKING
)
1966 cleanup_srcu_struct(hctx
->queue_rq_srcu
);
1968 blk_mq_remove_cpuhp(hctx
);
1969 blk_free_flush_queue(hctx
->fq
);
1970 sbitmap_free(&hctx
->ctx_map
);
1973 static void blk_mq_exit_hw_queues(struct request_queue
*q
,
1974 struct blk_mq_tag_set
*set
, int nr_queue
)
1976 struct blk_mq_hw_ctx
*hctx
;
1979 queue_for_each_hw_ctx(q
, hctx
, i
) {
1982 blk_mq_exit_hctx(q
, set
, hctx
, i
);
1986 static int blk_mq_init_hctx(struct request_queue
*q
,
1987 struct blk_mq_tag_set
*set
,
1988 struct blk_mq_hw_ctx
*hctx
, unsigned hctx_idx
)
1992 node
= hctx
->numa_node
;
1993 if (node
== NUMA_NO_NODE
)
1994 node
= hctx
->numa_node
= set
->numa_node
;
1996 INIT_DELAYED_WORK(&hctx
->run_work
, blk_mq_run_work_fn
);
1997 spin_lock_init(&hctx
->lock
);
1998 INIT_LIST_HEAD(&hctx
->dispatch
);
2000 hctx
->flags
= set
->flags
& ~BLK_MQ_F_TAG_SHARED
;
2002 cpuhp_state_add_instance_nocalls(CPUHP_BLK_MQ_DEAD
, &hctx
->cpuhp_dead
);
2004 hctx
->tags
= set
->tags
[hctx_idx
];
2007 * Allocate space for all possible cpus to avoid allocation at
2010 hctx
->ctxs
= kmalloc_node(nr_cpu_ids
* sizeof(void *),
2013 goto unregister_cpu_notifier
;
2015 if (sbitmap_init_node(&hctx
->ctx_map
, nr_cpu_ids
, ilog2(8), GFP_KERNEL
,
2021 if (set
->ops
->init_hctx
&&
2022 set
->ops
->init_hctx(hctx
, set
->driver_data
, hctx_idx
))
2025 if (blk_mq_sched_init_hctx(q
, hctx
, hctx_idx
))
2028 hctx
->fq
= blk_alloc_flush_queue(q
, hctx
->numa_node
, set
->cmd_size
);
2030 goto sched_exit_hctx
;
2032 if (set
->ops
->init_request
&&
2033 set
->ops
->init_request(set
, hctx
->fq
->flush_rq
, hctx_idx
,
2037 if (hctx
->flags
& BLK_MQ_F_BLOCKING
)
2038 init_srcu_struct(hctx
->queue_rq_srcu
);
2040 blk_mq_debugfs_register_hctx(q
, hctx
);
2047 blk_mq_sched_exit_hctx(q
, hctx
, hctx_idx
);
2049 if (set
->ops
->exit_hctx
)
2050 set
->ops
->exit_hctx(hctx
, hctx_idx
);
2052 sbitmap_free(&hctx
->ctx_map
);
2055 unregister_cpu_notifier
:
2056 blk_mq_remove_cpuhp(hctx
);
2060 static void blk_mq_init_cpu_queues(struct request_queue
*q
,
2061 unsigned int nr_hw_queues
)
2065 for_each_possible_cpu(i
) {
2066 struct blk_mq_ctx
*__ctx
= per_cpu_ptr(q
->queue_ctx
, i
);
2067 struct blk_mq_hw_ctx
*hctx
;
2070 spin_lock_init(&__ctx
->lock
);
2071 INIT_LIST_HEAD(&__ctx
->rq_list
);
2074 /* If the cpu isn't present, the cpu is mapped to first hctx */
2075 if (!cpu_present(i
))
2078 hctx
= blk_mq_map_queue(q
, i
);
2081 * Set local node, IFF we have more than one hw queue. If
2082 * not, we remain on the home node of the device
2084 if (nr_hw_queues
> 1 && hctx
->numa_node
== NUMA_NO_NODE
)
2085 hctx
->numa_node
= local_memory_node(cpu_to_node(i
));
2089 static bool __blk_mq_alloc_rq_map(struct blk_mq_tag_set
*set
, int hctx_idx
)
2093 set
->tags
[hctx_idx
] = blk_mq_alloc_rq_map(set
, hctx_idx
,
2094 set
->queue_depth
, set
->reserved_tags
);
2095 if (!set
->tags
[hctx_idx
])
2098 ret
= blk_mq_alloc_rqs(set
, set
->tags
[hctx_idx
], hctx_idx
,
2103 blk_mq_free_rq_map(set
->tags
[hctx_idx
]);
2104 set
->tags
[hctx_idx
] = NULL
;
2108 static void blk_mq_free_map_and_requests(struct blk_mq_tag_set
*set
,
2109 unsigned int hctx_idx
)
2111 if (set
->tags
[hctx_idx
]) {
2112 blk_mq_free_rqs(set
, set
->tags
[hctx_idx
], hctx_idx
);
2113 blk_mq_free_rq_map(set
->tags
[hctx_idx
]);
2114 set
->tags
[hctx_idx
] = NULL
;
2118 static void blk_mq_map_swqueue(struct request_queue
*q
)
2120 unsigned int i
, hctx_idx
;
2121 struct blk_mq_hw_ctx
*hctx
;
2122 struct blk_mq_ctx
*ctx
;
2123 struct blk_mq_tag_set
*set
= q
->tag_set
;
2126 * Avoid others reading imcomplete hctx->cpumask through sysfs
2128 mutex_lock(&q
->sysfs_lock
);
2130 queue_for_each_hw_ctx(q
, hctx
, i
) {
2131 cpumask_clear(hctx
->cpumask
);
2136 * Map software to hardware queues.
2138 * If the cpu isn't present, the cpu is mapped to first hctx.
2140 for_each_present_cpu(i
) {
2141 hctx_idx
= q
->mq_map
[i
];
2142 /* unmapped hw queue can be remapped after CPU topo changed */
2143 if (!set
->tags
[hctx_idx
] &&
2144 !__blk_mq_alloc_rq_map(set
, hctx_idx
)) {
2146 * If tags initialization fail for some hctx,
2147 * that hctx won't be brought online. In this
2148 * case, remap the current ctx to hctx[0] which
2149 * is guaranteed to always have tags allocated
2154 ctx
= per_cpu_ptr(q
->queue_ctx
, i
);
2155 hctx
= blk_mq_map_queue(q
, i
);
2157 cpumask_set_cpu(i
, hctx
->cpumask
);
2158 ctx
->index_hw
= hctx
->nr_ctx
;
2159 hctx
->ctxs
[hctx
->nr_ctx
++] = ctx
;
2162 mutex_unlock(&q
->sysfs_lock
);
2164 queue_for_each_hw_ctx(q
, hctx
, i
) {
2166 * If no software queues are mapped to this hardware queue,
2167 * disable it and free the request entries.
2169 if (!hctx
->nr_ctx
) {
2170 /* Never unmap queue 0. We need it as a
2171 * fallback in case of a new remap fails
2174 if (i
&& set
->tags
[i
])
2175 blk_mq_free_map_and_requests(set
, i
);
2181 hctx
->tags
= set
->tags
[i
];
2182 WARN_ON(!hctx
->tags
);
2185 * Set the map size to the number of mapped software queues.
2186 * This is more accurate and more efficient than looping
2187 * over all possibly mapped software queues.
2189 sbitmap_resize(&hctx
->ctx_map
, hctx
->nr_ctx
);
2192 * Initialize batch roundrobin counts
2194 hctx
->next_cpu
= cpumask_first(hctx
->cpumask
);
2195 hctx
->next_cpu_batch
= BLK_MQ_CPU_WORK_BATCH
;
2200 * Caller needs to ensure that we're either frozen/quiesced, or that
2201 * the queue isn't live yet.
2203 static void queue_set_hctx_shared(struct request_queue
*q
, bool shared
)
2205 struct blk_mq_hw_ctx
*hctx
;
2208 queue_for_each_hw_ctx(q
, hctx
, i
) {
2210 if (test_bit(BLK_MQ_S_SCHED_RESTART
, &hctx
->state
))
2211 atomic_inc(&q
->shared_hctx_restart
);
2212 hctx
->flags
|= BLK_MQ_F_TAG_SHARED
;
2214 if (test_bit(BLK_MQ_S_SCHED_RESTART
, &hctx
->state
))
2215 atomic_dec(&q
->shared_hctx_restart
);
2216 hctx
->flags
&= ~BLK_MQ_F_TAG_SHARED
;
2221 static void blk_mq_update_tag_set_depth(struct blk_mq_tag_set
*set
,
2224 struct request_queue
*q
;
2226 lockdep_assert_held(&set
->tag_list_lock
);
2228 list_for_each_entry(q
, &set
->tag_list
, tag_set_list
) {
2229 blk_mq_freeze_queue(q
);
2230 queue_set_hctx_shared(q
, shared
);
2231 blk_mq_unfreeze_queue(q
);
2235 static void blk_mq_del_queue_tag_set(struct request_queue
*q
)
2237 struct blk_mq_tag_set
*set
= q
->tag_set
;
2239 mutex_lock(&set
->tag_list_lock
);
2240 list_del_rcu(&q
->tag_set_list
);
2241 INIT_LIST_HEAD(&q
->tag_set_list
);
2242 if (list_is_singular(&set
->tag_list
)) {
2243 /* just transitioned to unshared */
2244 set
->flags
&= ~BLK_MQ_F_TAG_SHARED
;
2245 /* update existing queue */
2246 blk_mq_update_tag_set_depth(set
, false);
2248 mutex_unlock(&set
->tag_list_lock
);
2253 static void blk_mq_add_queue_tag_set(struct blk_mq_tag_set
*set
,
2254 struct request_queue
*q
)
2258 mutex_lock(&set
->tag_list_lock
);
2260 /* Check to see if we're transitioning to shared (from 1 to 2 queues). */
2261 if (!list_empty(&set
->tag_list
) && !(set
->flags
& BLK_MQ_F_TAG_SHARED
)) {
2262 set
->flags
|= BLK_MQ_F_TAG_SHARED
;
2263 /* update existing queue */
2264 blk_mq_update_tag_set_depth(set
, true);
2266 if (set
->flags
& BLK_MQ_F_TAG_SHARED
)
2267 queue_set_hctx_shared(q
, true);
2268 list_add_tail_rcu(&q
->tag_set_list
, &set
->tag_list
);
2270 mutex_unlock(&set
->tag_list_lock
);
2274 * It is the actual release handler for mq, but we do it from
2275 * request queue's release handler for avoiding use-after-free
2276 * and headache because q->mq_kobj shouldn't have been introduced,
2277 * but we can't group ctx/kctx kobj without it.
2279 void blk_mq_release(struct request_queue
*q
)
2281 struct blk_mq_hw_ctx
*hctx
;
2284 /* hctx kobj stays in hctx */
2285 queue_for_each_hw_ctx(q
, hctx
, i
) {
2288 kobject_put(&hctx
->kobj
);
2293 kfree(q
->queue_hw_ctx
);
2296 * release .mq_kobj and sw queue's kobject now because
2297 * both share lifetime with request queue.
2299 blk_mq_sysfs_deinit(q
);
2301 free_percpu(q
->queue_ctx
);
2304 struct request_queue
*blk_mq_init_queue(struct blk_mq_tag_set
*set
)
2306 struct request_queue
*uninit_q
, *q
;
2308 uninit_q
= blk_alloc_queue_node(GFP_KERNEL
, set
->numa_node
);
2310 return ERR_PTR(-ENOMEM
);
2312 q
= blk_mq_init_allocated_queue(set
, uninit_q
);
2314 blk_cleanup_queue(uninit_q
);
2318 EXPORT_SYMBOL(blk_mq_init_queue
);
2320 static int blk_mq_hw_ctx_size(struct blk_mq_tag_set
*tag_set
)
2322 int hw_ctx_size
= sizeof(struct blk_mq_hw_ctx
);
2324 BUILD_BUG_ON(ALIGN(offsetof(struct blk_mq_hw_ctx
, queue_rq_srcu
),
2325 __alignof__(struct blk_mq_hw_ctx
)) !=
2326 sizeof(struct blk_mq_hw_ctx
));
2328 if (tag_set
->flags
& BLK_MQ_F_BLOCKING
)
2329 hw_ctx_size
+= sizeof(struct srcu_struct
);
2334 static void blk_mq_realloc_hw_ctxs(struct blk_mq_tag_set
*set
,
2335 struct request_queue
*q
)
2338 struct blk_mq_hw_ctx
**hctxs
= q
->queue_hw_ctx
;
2340 blk_mq_sysfs_unregister(q
);
2341 for (i
= 0; i
< set
->nr_hw_queues
; i
++) {
2347 node
= blk_mq_hw_queue_to_node(q
->mq_map
, i
);
2348 hctxs
[i
] = kzalloc_node(blk_mq_hw_ctx_size(set
),
2353 if (!zalloc_cpumask_var_node(&hctxs
[i
]->cpumask
, GFP_KERNEL
,
2360 atomic_set(&hctxs
[i
]->nr_active
, 0);
2361 hctxs
[i
]->numa_node
= node
;
2362 hctxs
[i
]->queue_num
= i
;
2364 if (blk_mq_init_hctx(q
, set
, hctxs
[i
], i
)) {
2365 free_cpumask_var(hctxs
[i
]->cpumask
);
2370 blk_mq_hctx_kobj_init(hctxs
[i
]);
2372 for (j
= i
; j
< q
->nr_hw_queues
; j
++) {
2373 struct blk_mq_hw_ctx
*hctx
= hctxs
[j
];
2377 blk_mq_free_map_and_requests(set
, j
);
2378 blk_mq_exit_hctx(q
, set
, hctx
, j
);
2379 kobject_put(&hctx
->kobj
);
2384 q
->nr_hw_queues
= i
;
2385 blk_mq_sysfs_register(q
);
2388 struct request_queue
*blk_mq_init_allocated_queue(struct blk_mq_tag_set
*set
,
2389 struct request_queue
*q
)
2391 /* mark the queue as mq asap */
2392 q
->mq_ops
= set
->ops
;
2394 q
->poll_cb
= blk_stat_alloc_callback(blk_mq_poll_stats_fn
,
2395 blk_mq_poll_stats_bkt
,
2396 BLK_MQ_POLL_STATS_BKTS
, q
);
2400 q
->queue_ctx
= alloc_percpu(struct blk_mq_ctx
);
2404 /* init q->mq_kobj and sw queues' kobjects */
2405 blk_mq_sysfs_init(q
);
2407 q
->queue_hw_ctx
= kzalloc_node(nr_cpu_ids
* sizeof(*(q
->queue_hw_ctx
)),
2408 GFP_KERNEL
, set
->numa_node
);
2409 if (!q
->queue_hw_ctx
)
2412 q
->mq_map
= set
->mq_map
;
2414 blk_mq_realloc_hw_ctxs(set
, q
);
2415 if (!q
->nr_hw_queues
)
2418 INIT_WORK(&q
->timeout_work
, blk_mq_timeout_work
);
2419 blk_queue_rq_timeout(q
, set
->timeout
? set
->timeout
: 30 * HZ
);
2421 q
->nr_queues
= nr_cpu_ids
;
2423 q
->queue_flags
|= QUEUE_FLAG_MQ_DEFAULT
;
2425 if (!(set
->flags
& BLK_MQ_F_SG_MERGE
))
2426 q
->queue_flags
|= 1 << QUEUE_FLAG_NO_SG_MERGE
;
2428 q
->sg_reserved_size
= INT_MAX
;
2430 INIT_DELAYED_WORK(&q
->requeue_work
, blk_mq_requeue_work
);
2431 INIT_LIST_HEAD(&q
->requeue_list
);
2432 spin_lock_init(&q
->requeue_lock
);
2434 blk_queue_make_request(q
, blk_mq_make_request
);
2435 if (q
->mq_ops
->poll
)
2436 q
->poll_fn
= blk_mq_poll
;
2439 * Do this after blk_queue_make_request() overrides it...
2441 q
->nr_requests
= set
->queue_depth
;
2444 * Default to classic polling
2448 if (set
->ops
->complete
)
2449 blk_queue_softirq_done(q
, set
->ops
->complete
);
2451 blk_mq_init_cpu_queues(q
, set
->nr_hw_queues
);
2452 blk_mq_add_queue_tag_set(set
, q
);
2453 blk_mq_map_swqueue(q
);
2455 if (!(set
->flags
& BLK_MQ_F_NO_SCHED
)) {
2458 ret
= blk_mq_sched_init(q
);
2460 return ERR_PTR(ret
);
2466 kfree(q
->queue_hw_ctx
);
2468 free_percpu(q
->queue_ctx
);
2471 return ERR_PTR(-ENOMEM
);
2473 EXPORT_SYMBOL(blk_mq_init_allocated_queue
);
2475 void blk_mq_free_queue(struct request_queue
*q
)
2477 struct blk_mq_tag_set
*set
= q
->tag_set
;
2479 blk_mq_del_queue_tag_set(q
);
2480 blk_mq_exit_hw_queues(q
, set
, set
->nr_hw_queues
);
2483 /* Basically redo blk_mq_init_queue with queue frozen */
2484 static void blk_mq_queue_reinit(struct request_queue
*q
)
2486 WARN_ON_ONCE(!atomic_read(&q
->mq_freeze_depth
));
2488 blk_mq_debugfs_unregister_hctxs(q
);
2489 blk_mq_sysfs_unregister(q
);
2492 * redo blk_mq_init_cpu_queues and blk_mq_init_hw_queues. FIXME: maybe
2493 * we should change hctx numa_node according to new topology (this
2494 * involves free and re-allocate memory, worthy doing?)
2497 blk_mq_map_swqueue(q
);
2499 blk_mq_sysfs_register(q
);
2500 blk_mq_debugfs_register_hctxs(q
);
2503 static int __blk_mq_alloc_rq_maps(struct blk_mq_tag_set
*set
)
2507 for (i
= 0; i
< set
->nr_hw_queues
; i
++)
2508 if (!__blk_mq_alloc_rq_map(set
, i
))
2515 blk_mq_free_rq_map(set
->tags
[i
]);
2521 * Allocate the request maps associated with this tag_set. Note that this
2522 * may reduce the depth asked for, if memory is tight. set->queue_depth
2523 * will be updated to reflect the allocated depth.
2525 static int blk_mq_alloc_rq_maps(struct blk_mq_tag_set
*set
)
2530 depth
= set
->queue_depth
;
2532 err
= __blk_mq_alloc_rq_maps(set
);
2536 set
->queue_depth
>>= 1;
2537 if (set
->queue_depth
< set
->reserved_tags
+ BLK_MQ_TAG_MIN
) {
2541 } while (set
->queue_depth
);
2543 if (!set
->queue_depth
|| err
) {
2544 pr_err("blk-mq: failed to allocate request map\n");
2548 if (depth
!= set
->queue_depth
)
2549 pr_info("blk-mq: reduced tag depth (%u -> %u)\n",
2550 depth
, set
->queue_depth
);
2555 static int blk_mq_update_queue_map(struct blk_mq_tag_set
*set
)
2557 if (set
->ops
->map_queues
)
2558 return set
->ops
->map_queues(set
);
2560 return blk_mq_map_queues(set
);
2564 * Alloc a tag set to be associated with one or more request queues.
2565 * May fail with EINVAL for various error conditions. May adjust the
2566 * requested depth down, if if it too large. In that case, the set
2567 * value will be stored in set->queue_depth.
2569 int blk_mq_alloc_tag_set(struct blk_mq_tag_set
*set
)
2573 BUILD_BUG_ON(BLK_MQ_MAX_DEPTH
> 1 << BLK_MQ_UNIQUE_TAG_BITS
);
2575 if (!set
->nr_hw_queues
)
2577 if (!set
->queue_depth
)
2579 if (set
->queue_depth
< set
->reserved_tags
+ BLK_MQ_TAG_MIN
)
2582 if (!set
->ops
->queue_rq
)
2585 if (!set
->ops
->get_budget
^ !set
->ops
->put_budget
)
2588 if (set
->queue_depth
> BLK_MQ_MAX_DEPTH
) {
2589 pr_info("blk-mq: reduced tag depth to %u\n",
2591 set
->queue_depth
= BLK_MQ_MAX_DEPTH
;
2595 * If a crashdump is active, then we are potentially in a very
2596 * memory constrained environment. Limit us to 1 queue and
2597 * 64 tags to prevent using too much memory.
2599 if (is_kdump_kernel()) {
2600 set
->nr_hw_queues
= 1;
2601 set
->queue_depth
= min(64U, set
->queue_depth
);
2604 * There is no use for more h/w queues than cpus.
2606 if (set
->nr_hw_queues
> nr_cpu_ids
)
2607 set
->nr_hw_queues
= nr_cpu_ids
;
2609 set
->tags
= kzalloc_node(nr_cpu_ids
* sizeof(struct blk_mq_tags
*),
2610 GFP_KERNEL
, set
->numa_node
);
2615 set
->mq_map
= kzalloc_node(sizeof(*set
->mq_map
) * nr_cpu_ids
,
2616 GFP_KERNEL
, set
->numa_node
);
2620 ret
= blk_mq_update_queue_map(set
);
2622 goto out_free_mq_map
;
2624 ret
= blk_mq_alloc_rq_maps(set
);
2626 goto out_free_mq_map
;
2628 mutex_init(&set
->tag_list_lock
);
2629 INIT_LIST_HEAD(&set
->tag_list
);
2641 EXPORT_SYMBOL(blk_mq_alloc_tag_set
);
2643 void blk_mq_free_tag_set(struct blk_mq_tag_set
*set
)
2647 for (i
= 0; i
< nr_cpu_ids
; i
++)
2648 blk_mq_free_map_and_requests(set
, i
);
2656 EXPORT_SYMBOL(blk_mq_free_tag_set
);
2658 int blk_mq_update_nr_requests(struct request_queue
*q
, unsigned int nr
)
2660 struct blk_mq_tag_set
*set
= q
->tag_set
;
2661 struct blk_mq_hw_ctx
*hctx
;
2667 blk_mq_freeze_queue(q
);
2670 queue_for_each_hw_ctx(q
, hctx
, i
) {
2674 * If we're using an MQ scheduler, just update the scheduler
2675 * queue depth. This is similar to what the old code would do.
2677 if (!hctx
->sched_tags
) {
2678 ret
= blk_mq_tag_update_depth(hctx
, &hctx
->tags
, nr
,
2681 ret
= blk_mq_tag_update_depth(hctx
, &hctx
->sched_tags
,
2689 q
->nr_requests
= nr
;
2691 blk_mq_unfreeze_queue(q
);
2696 static void __blk_mq_update_nr_hw_queues(struct blk_mq_tag_set
*set
,
2699 struct request_queue
*q
;
2701 lockdep_assert_held(&set
->tag_list_lock
);
2703 if (nr_hw_queues
> nr_cpu_ids
)
2704 nr_hw_queues
= nr_cpu_ids
;
2705 if (nr_hw_queues
< 1 || nr_hw_queues
== set
->nr_hw_queues
)
2708 list_for_each_entry(q
, &set
->tag_list
, tag_set_list
)
2709 blk_mq_freeze_queue(q
);
2711 set
->nr_hw_queues
= nr_hw_queues
;
2712 blk_mq_update_queue_map(set
);
2713 list_for_each_entry(q
, &set
->tag_list
, tag_set_list
) {
2714 blk_mq_realloc_hw_ctxs(set
, q
);
2715 blk_mq_queue_reinit(q
);
2718 list_for_each_entry(q
, &set
->tag_list
, tag_set_list
)
2719 blk_mq_unfreeze_queue(q
);
2722 void blk_mq_update_nr_hw_queues(struct blk_mq_tag_set
*set
, int nr_hw_queues
)
2724 mutex_lock(&set
->tag_list_lock
);
2725 __blk_mq_update_nr_hw_queues(set
, nr_hw_queues
);
2726 mutex_unlock(&set
->tag_list_lock
);
2728 EXPORT_SYMBOL_GPL(blk_mq_update_nr_hw_queues
);
2730 /* Enable polling stats and return whether they were already enabled. */
2731 static bool blk_poll_stats_enable(struct request_queue
*q
)
2733 if (test_bit(QUEUE_FLAG_POLL_STATS
, &q
->queue_flags
) ||
2734 test_and_set_bit(QUEUE_FLAG_POLL_STATS
, &q
->queue_flags
))
2736 blk_stat_add_callback(q
, q
->poll_cb
);
2740 static void blk_mq_poll_stats_start(struct request_queue
*q
)
2743 * We don't arm the callback if polling stats are not enabled or the
2744 * callback is already active.
2746 if (!test_bit(QUEUE_FLAG_POLL_STATS
, &q
->queue_flags
) ||
2747 blk_stat_is_active(q
->poll_cb
))
2750 blk_stat_activate_msecs(q
->poll_cb
, 100);
2753 static void blk_mq_poll_stats_fn(struct blk_stat_callback
*cb
)
2755 struct request_queue
*q
= cb
->data
;
2758 for (bucket
= 0; bucket
< BLK_MQ_POLL_STATS_BKTS
; bucket
++) {
2759 if (cb
->stat
[bucket
].nr_samples
)
2760 q
->poll_stat
[bucket
] = cb
->stat
[bucket
];
2764 static unsigned long blk_mq_poll_nsecs(struct request_queue
*q
,
2765 struct blk_mq_hw_ctx
*hctx
,
2768 unsigned long ret
= 0;
2772 * If stats collection isn't on, don't sleep but turn it on for
2775 if (!blk_poll_stats_enable(q
))
2779 * As an optimistic guess, use half of the mean service time
2780 * for this type of request. We can (and should) make this smarter.
2781 * For instance, if the completion latencies are tight, we can
2782 * get closer than just half the mean. This is especially
2783 * important on devices where the completion latencies are longer
2784 * than ~10 usec. We do use the stats for the relevant IO size
2785 * if available which does lead to better estimates.
2787 bucket
= blk_mq_poll_stats_bkt(rq
);
2791 if (q
->poll_stat
[bucket
].nr_samples
)
2792 ret
= (q
->poll_stat
[bucket
].mean
+ 1) / 2;
2797 static bool blk_mq_poll_hybrid_sleep(struct request_queue
*q
,
2798 struct blk_mq_hw_ctx
*hctx
,
2801 struct hrtimer_sleeper hs
;
2802 enum hrtimer_mode mode
;
2806 if (test_bit(REQ_ATOM_POLL_SLEPT
, &rq
->atomic_flags
))
2812 * -1: don't ever hybrid sleep
2813 * 0: use half of prev avg
2814 * >0: use this specific value
2816 if (q
->poll_nsec
== -1)
2818 else if (q
->poll_nsec
> 0)
2819 nsecs
= q
->poll_nsec
;
2821 nsecs
= blk_mq_poll_nsecs(q
, hctx
, rq
);
2826 set_bit(REQ_ATOM_POLL_SLEPT
, &rq
->atomic_flags
);
2829 * This will be replaced with the stats tracking code, using
2830 * 'avg_completion_time / 2' as the pre-sleep target.
2834 mode
= HRTIMER_MODE_REL
;
2835 hrtimer_init_on_stack(&hs
.timer
, CLOCK_MONOTONIC
, mode
);
2836 hrtimer_set_expires(&hs
.timer
, kt
);
2838 hrtimer_init_sleeper(&hs
, current
);
2840 if (test_bit(REQ_ATOM_COMPLETE
, &rq
->atomic_flags
))
2842 set_current_state(TASK_UNINTERRUPTIBLE
);
2843 hrtimer_start_expires(&hs
.timer
, mode
);
2846 hrtimer_cancel(&hs
.timer
);
2847 mode
= HRTIMER_MODE_ABS
;
2848 } while (hs
.task
&& !signal_pending(current
));
2850 __set_current_state(TASK_RUNNING
);
2851 destroy_hrtimer_on_stack(&hs
.timer
);
2855 static bool __blk_mq_poll(struct blk_mq_hw_ctx
*hctx
, struct request
*rq
)
2857 struct request_queue
*q
= hctx
->queue
;
2861 * If we sleep, have the caller restart the poll loop to reset
2862 * the state. Like for the other success return cases, the
2863 * caller is responsible for checking if the IO completed. If
2864 * the IO isn't complete, we'll get called again and will go
2865 * straight to the busy poll loop.
2867 if (blk_mq_poll_hybrid_sleep(q
, hctx
, rq
))
2870 hctx
->poll_considered
++;
2872 state
= current
->state
;
2873 while (!need_resched()) {
2876 hctx
->poll_invoked
++;
2878 ret
= q
->mq_ops
->poll(hctx
, rq
->tag
);
2880 hctx
->poll_success
++;
2881 set_current_state(TASK_RUNNING
);
2885 if (signal_pending_state(state
, current
))
2886 set_current_state(TASK_RUNNING
);
2888 if (current
->state
== TASK_RUNNING
)
2898 static bool blk_mq_poll(struct request_queue
*q
, blk_qc_t cookie
)
2900 struct blk_mq_hw_ctx
*hctx
;
2903 if (!test_bit(QUEUE_FLAG_POLL
, &q
->queue_flags
))
2906 hctx
= q
->queue_hw_ctx
[blk_qc_t_to_queue_num(cookie
)];
2907 if (!blk_qc_t_is_internal(cookie
))
2908 rq
= blk_mq_tag_to_rq(hctx
->tags
, blk_qc_t_to_tag(cookie
));
2910 rq
= blk_mq_tag_to_rq(hctx
->sched_tags
, blk_qc_t_to_tag(cookie
));
2912 * With scheduling, if the request has completed, we'll
2913 * get a NULL return here, as we clear the sched tag when
2914 * that happens. The request still remains valid, like always,
2915 * so we should be safe with just the NULL check.
2921 return __blk_mq_poll(hctx
, rq
);
2924 static int __init
blk_mq_init(void)
2927 * See comment in block/blk.h rq_atomic_flags enum
2929 BUILD_BUG_ON((REQ_ATOM_STARTED
/ BITS_PER_BYTE
) !=
2930 (REQ_ATOM_COMPLETE
/ BITS_PER_BYTE
));
2932 cpuhp_setup_state_multi(CPUHP_BLK_MQ_DEAD
, "block/mq:dead", NULL
,
2933 blk_mq_hctx_notify_dead
);
2936 subsys_initcall(blk_mq_init
);