1 #include <linux/kernel.h>
2 #include <linux/module.h>
3 #include <linux/backing-dev.h>
5 #include <linux/blkdev.h>
7 #include <linux/init.h>
8 #include <linux/slab.h>
9 #include <linux/workqueue.h>
10 #include <linux/smp.h>
11 #include <linux/llist.h>
12 #include <linux/list_sort.h>
13 #include <linux/cpu.h>
14 #include <linux/cache.h>
15 #include <linux/sched/sysctl.h>
16 #include <linux/delay.h>
18 #include <trace/events/block.h>
20 #include <linux/blk-mq.h>
23 #include "blk-mq-tag.h"
25 static DEFINE_MUTEX(all_q_mutex
);
26 static LIST_HEAD(all_q_list
);
28 static void __blk_mq_run_hw_queue(struct blk_mq_hw_ctx
*hctx
);
30 static struct blk_mq_ctx
*__blk_mq_get_ctx(struct request_queue
*q
,
33 return per_cpu_ptr(q
->queue_ctx
, cpu
);
37 * This assumes per-cpu software queueing queues. They could be per-node
38 * as well, for instance. For now this is hardcoded as-is. Note that we don't
39 * care about preemption, since we know the ctx's are persistent. This does
40 * mean that we can't rely on ctx always matching the currently running CPU.
42 static struct blk_mq_ctx
*blk_mq_get_ctx(struct request_queue
*q
)
44 return __blk_mq_get_ctx(q
, get_cpu());
47 static void blk_mq_put_ctx(struct blk_mq_ctx
*ctx
)
53 * Check if any of the ctx's have pending work in this hardware queue
55 static bool blk_mq_hctx_has_pending(struct blk_mq_hw_ctx
*hctx
)
59 for (i
= 0; i
< hctx
->nr_ctx_map
; i
++)
67 * Mark this ctx as having pending work in this hardware queue
69 static void blk_mq_hctx_mark_pending(struct blk_mq_hw_ctx
*hctx
,
70 struct blk_mq_ctx
*ctx
)
72 if (!test_bit(ctx
->index_hw
, hctx
->ctx_map
))
73 set_bit(ctx
->index_hw
, hctx
->ctx_map
);
76 static struct request
*blk_mq_alloc_rq(struct blk_mq_hw_ctx
*hctx
, gfp_t gfp
,
82 tag
= blk_mq_get_tag(hctx
->tags
, gfp
, reserved
);
83 if (tag
!= BLK_MQ_TAG_FAIL
) {
93 static int blk_mq_queue_enter(struct request_queue
*q
)
97 __percpu_counter_add(&q
->mq_usage_counter
, 1, 1000000);
99 /* we have problems to freeze the queue if it's initializing */
100 if (!blk_queue_bypass(q
) || !blk_queue_init_done(q
))
103 __percpu_counter_add(&q
->mq_usage_counter
, -1, 1000000);
105 spin_lock_irq(q
->queue_lock
);
106 ret
= wait_event_interruptible_lock_irq(q
->mq_freeze_wq
,
107 !blk_queue_bypass(q
) || blk_queue_dying(q
),
109 /* inc usage with lock hold to avoid freeze_queue runs here */
110 if (!ret
&& !blk_queue_dying(q
))
111 __percpu_counter_add(&q
->mq_usage_counter
, 1, 1000000);
112 else if (blk_queue_dying(q
))
114 spin_unlock_irq(q
->queue_lock
);
119 static void blk_mq_queue_exit(struct request_queue
*q
)
121 __percpu_counter_add(&q
->mq_usage_counter
, -1, 1000000);
124 static void __blk_mq_drain_queue(struct request_queue
*q
)
129 spin_lock_irq(q
->queue_lock
);
130 count
= percpu_counter_sum(&q
->mq_usage_counter
);
131 spin_unlock_irq(q
->queue_lock
);
135 blk_mq_run_queues(q
, false);
141 * Guarantee no request is in use, so we can change any data structure of
142 * the queue afterward.
144 static void blk_mq_freeze_queue(struct request_queue
*q
)
148 spin_lock_irq(q
->queue_lock
);
149 drain
= !q
->bypass_depth
++;
150 queue_flag_set(QUEUE_FLAG_BYPASS
, q
);
151 spin_unlock_irq(q
->queue_lock
);
154 __blk_mq_drain_queue(q
);
157 void blk_mq_drain_queue(struct request_queue
*q
)
159 __blk_mq_drain_queue(q
);
162 static void blk_mq_unfreeze_queue(struct request_queue
*q
)
166 spin_lock_irq(q
->queue_lock
);
167 if (!--q
->bypass_depth
) {
168 queue_flag_clear(QUEUE_FLAG_BYPASS
, q
);
171 WARN_ON_ONCE(q
->bypass_depth
< 0);
172 spin_unlock_irq(q
->queue_lock
);
174 wake_up_all(&q
->mq_freeze_wq
);
177 bool blk_mq_can_queue(struct blk_mq_hw_ctx
*hctx
)
179 return blk_mq_has_free_tags(hctx
->tags
);
181 EXPORT_SYMBOL(blk_mq_can_queue
);
183 static void blk_mq_rq_ctx_init(struct request_queue
*q
, struct blk_mq_ctx
*ctx
,
184 struct request
*rq
, unsigned int rw_flags
)
186 if (blk_queue_io_stat(q
))
187 rw_flags
|= REQ_IO_STAT
;
190 rq
->cmd_flags
= rw_flags
;
191 rq
->start_time
= jiffies
;
192 set_start_time_ns(rq
);
193 ctx
->rq_dispatched
[rw_is_sync(rw_flags
)]++;
196 static struct request
*__blk_mq_alloc_request(struct blk_mq_hw_ctx
*hctx
,
197 gfp_t gfp
, bool reserved
,
201 bool is_flush
= false;
203 * flush need allocate a request, leave at least one request for
204 * non-flush IO to avoid deadlock
206 if ((rw
& REQ_FLUSH
) && !(rw
& REQ_FLUSH_SEQ
)) {
207 if (atomic_inc_return(&hctx
->pending_flush
) >=
208 hctx
->queue_depth
- hctx
->reserved_tags
- 1) {
209 atomic_dec(&hctx
->pending_flush
);
214 req
= blk_mq_alloc_rq(hctx
, gfp
, reserved
);
215 if (!req
&& is_flush
)
216 atomic_dec(&hctx
->pending_flush
);
220 static struct request
*blk_mq_alloc_request_pinned(struct request_queue
*q
,
227 struct blk_mq_ctx
*ctx
= blk_mq_get_ctx(q
);
228 struct blk_mq_hw_ctx
*hctx
= q
->mq_ops
->map_queue(q
, ctx
->cpu
);
230 rq
= __blk_mq_alloc_request(hctx
, gfp
& ~__GFP_WAIT
, reserved
, rw
);
232 blk_mq_rq_ctx_init(q
, ctx
, rq
, rw
);
237 if (!(gfp
& __GFP_WAIT
))
240 __blk_mq_run_hw_queue(hctx
);
241 blk_mq_wait_for_tags(hctx
->tags
);
247 struct request
*blk_mq_alloc_request(struct request_queue
*q
, int rw
,
248 gfp_t gfp
, bool reserved
)
252 if (blk_mq_queue_enter(q
))
255 rq
= blk_mq_alloc_request_pinned(q
, rw
, gfp
, reserved
);
257 blk_mq_put_ctx(rq
->mq_ctx
);
261 struct request
*blk_mq_alloc_reserved_request(struct request_queue
*q
, int rw
,
266 if (blk_mq_queue_enter(q
))
269 rq
= blk_mq_alloc_request_pinned(q
, rw
, gfp
, true);
271 blk_mq_put_ctx(rq
->mq_ctx
);
274 EXPORT_SYMBOL(blk_mq_alloc_reserved_request
);
277 * Re-init and set pdu, if we have it
279 static void blk_mq_rq_init(struct blk_mq_hw_ctx
*hctx
, struct request
*rq
)
281 blk_rq_init(hctx
->queue
, rq
);
284 rq
->special
= blk_mq_rq_to_pdu(rq
);
287 static void __blk_mq_free_request(struct blk_mq_hw_ctx
*hctx
,
288 struct blk_mq_ctx
*ctx
, struct request
*rq
)
290 const int tag
= rq
->tag
;
291 struct request_queue
*q
= rq
->q
;
293 if ((rq
->cmd_flags
& REQ_FLUSH
) && !(rq
->cmd_flags
& REQ_FLUSH_SEQ
))
294 atomic_dec(&hctx
->pending_flush
);
296 blk_mq_rq_init(hctx
, rq
);
297 blk_mq_put_tag(hctx
->tags
, tag
);
299 blk_mq_queue_exit(q
);
302 void blk_mq_free_request(struct request
*rq
)
304 struct blk_mq_ctx
*ctx
= rq
->mq_ctx
;
305 struct blk_mq_hw_ctx
*hctx
;
306 struct request_queue
*q
= rq
->q
;
308 ctx
->rq_completed
[rq_is_sync(rq
)]++;
310 hctx
= q
->mq_ops
->map_queue(q
, ctx
->cpu
);
311 __blk_mq_free_request(hctx
, ctx
, rq
);
314 static void blk_mq_bio_endio(struct request
*rq
, struct bio
*bio
, int error
)
317 clear_bit(BIO_UPTODATE
, &bio
->bi_flags
);
318 else if (!test_bit(BIO_UPTODATE
, &bio
->bi_flags
))
321 if (unlikely(rq
->cmd_flags
& REQ_QUIET
))
322 set_bit(BIO_QUIET
, &bio
->bi_flags
);
324 /* don't actually finish bio if it's part of flush sequence */
325 if (!(rq
->cmd_flags
& REQ_FLUSH_SEQ
))
326 bio_endio(bio
, error
);
329 void blk_mq_end_io(struct request
*rq
, int error
)
331 struct bio
*bio
= rq
->bio
;
332 unsigned int bytes
= 0;
334 trace_block_rq_complete(rq
->q
, rq
);
337 struct bio
*next
= bio
->bi_next
;
340 bytes
+= bio
->bi_iter
.bi_size
;
341 blk_mq_bio_endio(rq
, bio
, error
);
345 blk_account_io_completion(rq
, bytes
);
347 blk_account_io_done(rq
);
350 rq
->end_io(rq
, error
);
352 blk_mq_free_request(rq
);
354 EXPORT_SYMBOL(blk_mq_end_io
);
356 static void __blk_mq_complete_request_remote(void *data
)
358 struct request
*rq
= data
;
360 rq
->q
->softirq_done_fn(rq
);
363 void __blk_mq_complete_request(struct request
*rq
)
365 struct blk_mq_ctx
*ctx
= rq
->mq_ctx
;
368 if (!ctx
->ipi_redirect
) {
369 rq
->q
->softirq_done_fn(rq
);
374 if (cpu
!= ctx
->cpu
&& cpu_online(ctx
->cpu
)) {
375 rq
->csd
.func
= __blk_mq_complete_request_remote
;
378 __smp_call_function_single(ctx
->cpu
, &rq
->csd
, 0);
380 rq
->q
->softirq_done_fn(rq
);
386 * blk_mq_complete_request - end I/O on a request
387 * @rq: the request being processed
390 * Ends all I/O on a request. It does not handle partial completions.
391 * The actual completion happens out-of-order, through a IPI handler.
393 void blk_mq_complete_request(struct request
*rq
)
395 if (unlikely(blk_should_fake_timeout(rq
->q
)))
397 if (!blk_mark_rq_complete(rq
))
398 __blk_mq_complete_request(rq
);
400 EXPORT_SYMBOL(blk_mq_complete_request
);
402 static void blk_mq_start_request(struct request
*rq
)
404 struct request_queue
*q
= rq
->q
;
406 trace_block_rq_issue(q
, rq
);
409 * Just mark start time and set the started bit. Due to memory
410 * ordering, we know we'll see the correct deadline as long as
411 * REQ_ATOMIC_STARTED is seen.
413 rq
->deadline
= jiffies
+ q
->rq_timeout
;
414 set_bit(REQ_ATOM_STARTED
, &rq
->atomic_flags
);
417 static void blk_mq_requeue_request(struct request
*rq
)
419 struct request_queue
*q
= rq
->q
;
421 trace_block_rq_requeue(q
, rq
);
422 clear_bit(REQ_ATOM_STARTED
, &rq
->atomic_flags
);
425 struct blk_mq_timeout_data
{
426 struct blk_mq_hw_ctx
*hctx
;
428 unsigned int *next_set
;
431 static void blk_mq_timeout_check(void *__data
, unsigned long *free_tags
)
433 struct blk_mq_timeout_data
*data
= __data
;
434 struct blk_mq_hw_ctx
*hctx
= data
->hctx
;
437 /* It may not be in flight yet (this is where
438 * the REQ_ATOMIC_STARTED flag comes in). The requests are
439 * statically allocated, so we know it's always safe to access the
440 * memory associated with a bit offset into ->rqs[].
446 tag
= find_next_zero_bit(free_tags
, hctx
->queue_depth
, tag
);
447 if (tag
>= hctx
->queue_depth
)
450 rq
= hctx
->rqs
[tag
++];
452 if (!test_bit(REQ_ATOM_STARTED
, &rq
->atomic_flags
))
455 blk_rq_check_expired(rq
, data
->next
, data
->next_set
);
459 static void blk_mq_hw_ctx_check_timeout(struct blk_mq_hw_ctx
*hctx
,
461 unsigned int *next_set
)
463 struct blk_mq_timeout_data data
= {
466 .next_set
= next_set
,
470 * Ask the tagging code to iterate busy requests, so we can
471 * check them for timeout.
473 blk_mq_tag_busy_iter(hctx
->tags
, blk_mq_timeout_check
, &data
);
476 static void blk_mq_rq_timer(unsigned long data
)
478 struct request_queue
*q
= (struct request_queue
*) data
;
479 struct blk_mq_hw_ctx
*hctx
;
480 unsigned long next
= 0;
483 queue_for_each_hw_ctx(q
, hctx
, i
)
484 blk_mq_hw_ctx_check_timeout(hctx
, &next
, &next_set
);
487 mod_timer(&q
->timeout
, round_jiffies_up(next
));
491 * Reverse check our software queue for entries that we could potentially
492 * merge with. Currently includes a hand-wavy stop count of 8, to not spend
493 * too much time checking for merges.
495 static bool blk_mq_attempt_merge(struct request_queue
*q
,
496 struct blk_mq_ctx
*ctx
, struct bio
*bio
)
501 list_for_each_entry_reverse(rq
, &ctx
->rq_list
, queuelist
) {
507 if (!blk_rq_merge_ok(rq
, bio
))
510 el_ret
= blk_try_merge(rq
, bio
);
511 if (el_ret
== ELEVATOR_BACK_MERGE
) {
512 if (bio_attempt_back_merge(q
, rq
, bio
)) {
517 } else if (el_ret
== ELEVATOR_FRONT_MERGE
) {
518 if (bio_attempt_front_merge(q
, rq
, bio
)) {
529 void blk_mq_add_timer(struct request
*rq
)
531 __blk_add_timer(rq
, NULL
);
535 * Run this hardware queue, pulling any software queues mapped to it in.
536 * Note that this function currently has various problems around ordering
537 * of IO. In particular, we'd like FIFO behaviour on handling existing
538 * items on the hctx->dispatch list. Ignore that for now.
540 static void __blk_mq_run_hw_queue(struct blk_mq_hw_ctx
*hctx
)
542 struct request_queue
*q
= hctx
->queue
;
543 struct blk_mq_ctx
*ctx
;
548 if (unlikely(test_bit(BLK_MQ_S_STOPPED
, &hctx
->flags
)))
554 * Touch any software queue that has pending entries.
556 for_each_set_bit(bit
, hctx
->ctx_map
, hctx
->nr_ctx
) {
557 clear_bit(bit
, hctx
->ctx_map
);
558 ctx
= hctx
->ctxs
[bit
];
559 BUG_ON(bit
!= ctx
->index_hw
);
561 spin_lock(&ctx
->lock
);
562 list_splice_tail_init(&ctx
->rq_list
, &rq_list
);
563 spin_unlock(&ctx
->lock
);
567 * If we have previous entries on our dispatch list, grab them
568 * and stuff them at the front for more fair dispatch.
570 if (!list_empty_careful(&hctx
->dispatch
)) {
571 spin_lock(&hctx
->lock
);
572 if (!list_empty(&hctx
->dispatch
))
573 list_splice_init(&hctx
->dispatch
, &rq_list
);
574 spin_unlock(&hctx
->lock
);
578 * Delete and return all entries from our dispatch list
583 * Now process all the entries, sending them to the driver.
585 while (!list_empty(&rq_list
)) {
588 rq
= list_first_entry(&rq_list
, struct request
, queuelist
);
589 list_del_init(&rq
->queuelist
);
590 blk_mq_start_request(rq
);
592 if (q
->dma_drain_size
&& blk_rq_bytes(rq
)) {
594 * make sure space for the drain appears we
595 * know we can do this because max_hw_segments
596 * has been adjusted to be one fewer than the
599 rq
->nr_phys_segments
++;
603 * Last request in the series. Flag it as such, this
604 * enables drivers to know when IO should be kicked off,
605 * if they don't do it on a per-request basis.
607 * Note: the flag isn't the only condition drivers
608 * should do kick off. If drive is busy, the last
609 * request might not have the bit set.
611 if (list_empty(&rq_list
))
612 rq
->cmd_flags
|= REQ_END
;
614 ret
= q
->mq_ops
->queue_rq(hctx
, rq
);
616 case BLK_MQ_RQ_QUEUE_OK
:
619 case BLK_MQ_RQ_QUEUE_BUSY
:
621 * FIXME: we should have a mechanism to stop the queue
622 * like blk_stop_queue, otherwise we will waste cpu
625 list_add(&rq
->queuelist
, &rq_list
);
626 blk_mq_requeue_request(rq
);
629 pr_err("blk-mq: bad return on queue: %d\n", ret
);
631 case BLK_MQ_RQ_QUEUE_ERROR
:
632 blk_mq_end_io(rq
, rq
->errors
);
636 if (ret
== BLK_MQ_RQ_QUEUE_BUSY
)
641 hctx
->dispatched
[0]++;
642 else if (queued
< (1 << (BLK_MQ_MAX_DISPATCH_ORDER
- 1)))
643 hctx
->dispatched
[ilog2(queued
) + 1]++;
646 * Any items that need requeuing? Stuff them into hctx->dispatch,
647 * that is where we will continue on next queue run.
649 if (!list_empty(&rq_list
)) {
650 spin_lock(&hctx
->lock
);
651 list_splice(&rq_list
, &hctx
->dispatch
);
652 spin_unlock(&hctx
->lock
);
656 void blk_mq_run_hw_queue(struct blk_mq_hw_ctx
*hctx
, bool async
)
658 if (unlikely(test_bit(BLK_MQ_S_STOPPED
, &hctx
->flags
)))
662 __blk_mq_run_hw_queue(hctx
);
664 struct request_queue
*q
= hctx
->queue
;
666 kblockd_schedule_delayed_work(q
, &hctx
->delayed_work
, 0);
670 void blk_mq_run_queues(struct request_queue
*q
, bool async
)
672 struct blk_mq_hw_ctx
*hctx
;
675 queue_for_each_hw_ctx(q
, hctx
, i
) {
676 if ((!blk_mq_hctx_has_pending(hctx
) &&
677 list_empty_careful(&hctx
->dispatch
)) ||
678 test_bit(BLK_MQ_S_STOPPED
, &hctx
->flags
))
681 blk_mq_run_hw_queue(hctx
, async
);
684 EXPORT_SYMBOL(blk_mq_run_queues
);
686 void blk_mq_stop_hw_queue(struct blk_mq_hw_ctx
*hctx
)
688 cancel_delayed_work(&hctx
->delayed_work
);
689 set_bit(BLK_MQ_S_STOPPED
, &hctx
->state
);
691 EXPORT_SYMBOL(blk_mq_stop_hw_queue
);
693 void blk_mq_stop_hw_queues(struct request_queue
*q
)
695 struct blk_mq_hw_ctx
*hctx
;
698 queue_for_each_hw_ctx(q
, hctx
, i
)
699 blk_mq_stop_hw_queue(hctx
);
701 EXPORT_SYMBOL(blk_mq_stop_hw_queues
);
703 void blk_mq_start_hw_queue(struct blk_mq_hw_ctx
*hctx
)
705 clear_bit(BLK_MQ_S_STOPPED
, &hctx
->state
);
706 __blk_mq_run_hw_queue(hctx
);
708 EXPORT_SYMBOL(blk_mq_start_hw_queue
);
710 void blk_mq_start_stopped_hw_queues(struct request_queue
*q
)
712 struct blk_mq_hw_ctx
*hctx
;
715 queue_for_each_hw_ctx(q
, hctx
, i
) {
716 if (!test_bit(BLK_MQ_S_STOPPED
, &hctx
->state
))
719 clear_bit(BLK_MQ_S_STOPPED
, &hctx
->state
);
720 blk_mq_run_hw_queue(hctx
, true);
723 EXPORT_SYMBOL(blk_mq_start_stopped_hw_queues
);
725 static void blk_mq_work_fn(struct work_struct
*work
)
727 struct blk_mq_hw_ctx
*hctx
;
729 hctx
= container_of(work
, struct blk_mq_hw_ctx
, delayed_work
.work
);
730 __blk_mq_run_hw_queue(hctx
);
733 static void __blk_mq_insert_request(struct blk_mq_hw_ctx
*hctx
,
734 struct request
*rq
, bool at_head
)
736 struct blk_mq_ctx
*ctx
= rq
->mq_ctx
;
738 trace_block_rq_insert(hctx
->queue
, rq
);
741 list_add(&rq
->queuelist
, &ctx
->rq_list
);
743 list_add_tail(&rq
->queuelist
, &ctx
->rq_list
);
744 blk_mq_hctx_mark_pending(hctx
, ctx
);
747 * We do this early, to ensure we are on the right CPU.
749 blk_mq_add_timer(rq
);
752 void blk_mq_insert_request(struct request_queue
*q
, struct request
*rq
,
753 bool at_head
, bool run_queue
)
755 struct blk_mq_hw_ctx
*hctx
;
756 struct blk_mq_ctx
*ctx
, *current_ctx
;
759 hctx
= q
->mq_ops
->map_queue(q
, ctx
->cpu
);
761 if (rq
->cmd_flags
& (REQ_FLUSH
| REQ_FUA
)) {
762 blk_insert_flush(rq
);
764 current_ctx
= blk_mq_get_ctx(q
);
766 if (!cpu_online(ctx
->cpu
)) {
768 hctx
= q
->mq_ops
->map_queue(q
, ctx
->cpu
);
771 spin_lock(&ctx
->lock
);
772 __blk_mq_insert_request(hctx
, rq
, at_head
);
773 spin_unlock(&ctx
->lock
);
775 blk_mq_put_ctx(current_ctx
);
779 __blk_mq_run_hw_queue(hctx
);
781 EXPORT_SYMBOL(blk_mq_insert_request
);
784 * This is a special version of blk_mq_insert_request to bypass FLUSH request
785 * check. Should only be used internally.
787 void blk_mq_run_request(struct request
*rq
, bool run_queue
, bool async
)
789 struct request_queue
*q
= rq
->q
;
790 struct blk_mq_hw_ctx
*hctx
;
791 struct blk_mq_ctx
*ctx
, *current_ctx
;
793 current_ctx
= blk_mq_get_ctx(q
);
796 if (!cpu_online(ctx
->cpu
)) {
800 hctx
= q
->mq_ops
->map_queue(q
, ctx
->cpu
);
802 /* ctx->cpu might be offline */
803 spin_lock(&ctx
->lock
);
804 __blk_mq_insert_request(hctx
, rq
, false);
805 spin_unlock(&ctx
->lock
);
807 blk_mq_put_ctx(current_ctx
);
810 blk_mq_run_hw_queue(hctx
, async
);
813 static void blk_mq_insert_requests(struct request_queue
*q
,
814 struct blk_mq_ctx
*ctx
,
815 struct list_head
*list
,
820 struct blk_mq_hw_ctx
*hctx
;
821 struct blk_mq_ctx
*current_ctx
;
823 trace_block_unplug(q
, depth
, !from_schedule
);
825 current_ctx
= blk_mq_get_ctx(q
);
827 if (!cpu_online(ctx
->cpu
))
829 hctx
= q
->mq_ops
->map_queue(q
, ctx
->cpu
);
832 * preemption doesn't flush plug list, so it's possible ctx->cpu is
835 spin_lock(&ctx
->lock
);
836 while (!list_empty(list
)) {
839 rq
= list_first_entry(list
, struct request
, queuelist
);
840 list_del_init(&rq
->queuelist
);
842 __blk_mq_insert_request(hctx
, rq
, false);
844 spin_unlock(&ctx
->lock
);
846 blk_mq_put_ctx(current_ctx
);
848 blk_mq_run_hw_queue(hctx
, from_schedule
);
851 static int plug_ctx_cmp(void *priv
, struct list_head
*a
, struct list_head
*b
)
853 struct request
*rqa
= container_of(a
, struct request
, queuelist
);
854 struct request
*rqb
= container_of(b
, struct request
, queuelist
);
856 return !(rqa
->mq_ctx
< rqb
->mq_ctx
||
857 (rqa
->mq_ctx
== rqb
->mq_ctx
&&
858 blk_rq_pos(rqa
) < blk_rq_pos(rqb
)));
861 void blk_mq_flush_plug_list(struct blk_plug
*plug
, bool from_schedule
)
863 struct blk_mq_ctx
*this_ctx
;
864 struct request_queue
*this_q
;
870 list_splice_init(&plug
->mq_list
, &list
);
872 list_sort(NULL
, &list
, plug_ctx_cmp
);
878 while (!list_empty(&list
)) {
879 rq
= list_entry_rq(list
.next
);
880 list_del_init(&rq
->queuelist
);
882 if (rq
->mq_ctx
!= this_ctx
) {
884 blk_mq_insert_requests(this_q
, this_ctx
,
889 this_ctx
= rq
->mq_ctx
;
895 list_add_tail(&rq
->queuelist
, &ctx_list
);
899 * If 'this_ctx' is set, we know we have entries to complete
900 * on 'ctx_list'. Do those.
903 blk_mq_insert_requests(this_q
, this_ctx
, &ctx_list
, depth
,
908 static void blk_mq_bio_to_request(struct request
*rq
, struct bio
*bio
)
910 init_request_from_bio(rq
, bio
);
911 blk_account_io_start(rq
, 1);
914 static void blk_mq_make_request(struct request_queue
*q
, struct bio
*bio
)
916 struct blk_mq_hw_ctx
*hctx
;
917 struct blk_mq_ctx
*ctx
;
918 const int is_sync
= rw_is_sync(bio
->bi_rw
);
919 const int is_flush_fua
= bio
->bi_rw
& (REQ_FLUSH
| REQ_FUA
);
920 int rw
= bio_data_dir(bio
);
922 unsigned int use_plug
, request_count
= 0;
925 * If we have multiple hardware queues, just go directly to
926 * one of those for sync IO.
928 use_plug
= !is_flush_fua
&& ((q
->nr_hw_queues
== 1) || !is_sync
);
930 blk_queue_bounce(q
, &bio
);
932 if (bio_integrity_enabled(bio
) && bio_integrity_prep(bio
)) {
933 bio_endio(bio
, -EIO
);
937 if (use_plug
&& blk_attempt_plug_merge(q
, bio
, &request_count
))
940 if (blk_mq_queue_enter(q
)) {
941 bio_endio(bio
, -EIO
);
945 ctx
= blk_mq_get_ctx(q
);
946 hctx
= q
->mq_ops
->map_queue(q
, ctx
->cpu
);
948 trace_block_getrq(q
, bio
, rw
);
949 rq
= __blk_mq_alloc_request(hctx
, GFP_ATOMIC
, false, bio
->bi_rw
);
951 blk_mq_rq_ctx_init(q
, ctx
, rq
, bio
->bi_rw
);
954 trace_block_sleeprq(q
, bio
, rw
);
955 rq
= blk_mq_alloc_request_pinned(q
, bio
->bi_rw
,
956 __GFP_WAIT
|GFP_ATOMIC
, false);
958 hctx
= q
->mq_ops
->map_queue(q
, ctx
->cpu
);
963 if (unlikely(is_flush_fua
)) {
964 blk_mq_bio_to_request(rq
, bio
);
966 blk_insert_flush(rq
);
971 * A task plug currently exists. Since this is completely lockless,
972 * utilize that to temporarily store requests until the task is
973 * either done or scheduled away.
976 struct blk_plug
*plug
= current
->plug
;
979 blk_mq_bio_to_request(rq
, bio
);
980 if (list_empty(&plug
->mq_list
))
982 else if (request_count
>= BLK_MAX_REQUEST_COUNT
) {
983 blk_flush_plug_list(plug
, false);
986 list_add_tail(&rq
->queuelist
, &plug
->mq_list
);
992 spin_lock(&ctx
->lock
);
994 if ((hctx
->flags
& BLK_MQ_F_SHOULD_MERGE
) &&
995 blk_mq_attempt_merge(q
, ctx
, bio
))
996 __blk_mq_free_request(hctx
, ctx
, rq
);
998 blk_mq_bio_to_request(rq
, bio
);
999 __blk_mq_insert_request(hctx
, rq
, false);
1002 spin_unlock(&ctx
->lock
);
1003 blk_mq_put_ctx(ctx
);
1006 * For a SYNC request, send it to the hardware immediately. For an
1007 * ASYNC request, just ensure that we run it later on. The latter
1008 * allows for merging opportunities and more efficient dispatching.
1011 blk_mq_run_hw_queue(hctx
, !is_sync
|| is_flush_fua
);
1015 * Default mapping to a software queue, since we use one per CPU.
1017 struct blk_mq_hw_ctx
*blk_mq_map_queue(struct request_queue
*q
, const int cpu
)
1019 return q
->queue_hw_ctx
[q
->mq_map
[cpu
]];
1021 EXPORT_SYMBOL(blk_mq_map_queue
);
1023 struct blk_mq_hw_ctx
*blk_mq_alloc_single_hw_queue(struct blk_mq_reg
*reg
,
1024 unsigned int hctx_index
)
1026 return kmalloc_node(sizeof(struct blk_mq_hw_ctx
),
1027 GFP_KERNEL
| __GFP_ZERO
, reg
->numa_node
);
1029 EXPORT_SYMBOL(blk_mq_alloc_single_hw_queue
);
1031 void blk_mq_free_single_hw_queue(struct blk_mq_hw_ctx
*hctx
,
1032 unsigned int hctx_index
)
1036 EXPORT_SYMBOL(blk_mq_free_single_hw_queue
);
1038 static void blk_mq_hctx_notify(void *data
, unsigned long action
,
1041 struct blk_mq_hw_ctx
*hctx
= data
;
1042 struct blk_mq_ctx
*ctx
;
1045 if (action
!= CPU_DEAD
&& action
!= CPU_DEAD_FROZEN
)
1049 * Move ctx entries to new CPU, if this one is going away.
1051 ctx
= __blk_mq_get_ctx(hctx
->queue
, cpu
);
1053 spin_lock(&ctx
->lock
);
1054 if (!list_empty(&ctx
->rq_list
)) {
1055 list_splice_init(&ctx
->rq_list
, &tmp
);
1056 clear_bit(ctx
->index_hw
, hctx
->ctx_map
);
1058 spin_unlock(&ctx
->lock
);
1060 if (list_empty(&tmp
))
1063 ctx
= blk_mq_get_ctx(hctx
->queue
);
1064 spin_lock(&ctx
->lock
);
1066 while (!list_empty(&tmp
)) {
1069 rq
= list_first_entry(&tmp
, struct request
, queuelist
);
1071 list_move_tail(&rq
->queuelist
, &ctx
->rq_list
);
1074 blk_mq_hctx_mark_pending(hctx
, ctx
);
1076 spin_unlock(&ctx
->lock
);
1077 blk_mq_put_ctx(ctx
);
1080 static void blk_mq_init_hw_commands(struct blk_mq_hw_ctx
*hctx
,
1081 void (*init
)(void *, struct blk_mq_hw_ctx
*,
1082 struct request
*, unsigned int),
1087 for (i
= 0; i
< hctx
->queue_depth
; i
++) {
1088 struct request
*rq
= hctx
->rqs
[i
];
1090 init(data
, hctx
, rq
, i
);
1094 void blk_mq_init_commands(struct request_queue
*q
,
1095 void (*init
)(void *, struct blk_mq_hw_ctx
*,
1096 struct request
*, unsigned int),
1099 struct blk_mq_hw_ctx
*hctx
;
1102 queue_for_each_hw_ctx(q
, hctx
, i
)
1103 blk_mq_init_hw_commands(hctx
, init
, data
);
1105 EXPORT_SYMBOL(blk_mq_init_commands
);
1107 static void blk_mq_free_rq_map(struct blk_mq_hw_ctx
*hctx
)
1111 while (!list_empty(&hctx
->page_list
)) {
1112 page
= list_first_entry(&hctx
->page_list
, struct page
, lru
);
1113 list_del_init(&page
->lru
);
1114 __free_pages(page
, page
->private);
1120 blk_mq_free_tags(hctx
->tags
);
1123 static size_t order_to_size(unsigned int order
)
1125 size_t ret
= PAGE_SIZE
;
1133 static int blk_mq_init_rq_map(struct blk_mq_hw_ctx
*hctx
,
1134 unsigned int reserved_tags
, int node
)
1136 unsigned int i
, j
, entries_per_page
, max_order
= 4;
1137 size_t rq_size
, left
;
1139 INIT_LIST_HEAD(&hctx
->page_list
);
1141 hctx
->rqs
= kmalloc_node(hctx
->queue_depth
* sizeof(struct request
*),
1147 * rq_size is the size of the request plus driver payload, rounded
1148 * to the cacheline size
1150 rq_size
= round_up(sizeof(struct request
) + hctx
->cmd_size
,
1152 left
= rq_size
* hctx
->queue_depth
;
1154 for (i
= 0; i
< hctx
->queue_depth
;) {
1155 int this_order
= max_order
;
1160 while (left
< order_to_size(this_order
- 1) && this_order
)
1164 page
= alloc_pages_node(node
, GFP_KERNEL
, this_order
);
1169 if (order_to_size(this_order
) < rq_size
)
1176 page
->private = this_order
;
1177 list_add_tail(&page
->lru
, &hctx
->page_list
);
1179 p
= page_address(page
);
1180 entries_per_page
= order_to_size(this_order
) / rq_size
;
1181 to_do
= min(entries_per_page
, hctx
->queue_depth
- i
);
1182 left
-= to_do
* rq_size
;
1183 for (j
= 0; j
< to_do
; j
++) {
1185 blk_mq_rq_init(hctx
, hctx
->rqs
[i
]);
1191 if (i
< (reserved_tags
+ BLK_MQ_TAG_MIN
))
1193 else if (i
!= hctx
->queue_depth
) {
1194 hctx
->queue_depth
= i
;
1195 pr_warn("%s: queue depth set to %u because of low memory\n",
1199 hctx
->tags
= blk_mq_init_tags(hctx
->queue_depth
, reserved_tags
, node
);
1202 blk_mq_free_rq_map(hctx
);
1209 static int blk_mq_init_hw_queues(struct request_queue
*q
,
1210 struct blk_mq_reg
*reg
, void *driver_data
)
1212 struct blk_mq_hw_ctx
*hctx
;
1216 * Initialize hardware queues
1218 queue_for_each_hw_ctx(q
, hctx
, i
) {
1219 unsigned int num_maps
;
1222 node
= hctx
->numa_node
;
1223 if (node
== NUMA_NO_NODE
)
1224 node
= hctx
->numa_node
= reg
->numa_node
;
1226 INIT_DELAYED_WORK(&hctx
->delayed_work
, blk_mq_work_fn
);
1227 spin_lock_init(&hctx
->lock
);
1228 INIT_LIST_HEAD(&hctx
->dispatch
);
1230 hctx
->queue_num
= i
;
1231 hctx
->flags
= reg
->flags
;
1232 hctx
->queue_depth
= reg
->queue_depth
;
1233 hctx
->reserved_tags
= reg
->reserved_tags
;
1234 hctx
->cmd_size
= reg
->cmd_size
;
1235 atomic_set(&hctx
->pending_flush
, 0);
1237 blk_mq_init_cpu_notifier(&hctx
->cpu_notifier
,
1238 blk_mq_hctx_notify
, hctx
);
1239 blk_mq_register_cpu_notifier(&hctx
->cpu_notifier
);
1241 if (blk_mq_init_rq_map(hctx
, reg
->reserved_tags
, node
))
1245 * Allocate space for all possible cpus to avoid allocation in
1248 hctx
->ctxs
= kmalloc_node(nr_cpu_ids
* sizeof(void *),
1253 num_maps
= ALIGN(nr_cpu_ids
, BITS_PER_LONG
) / BITS_PER_LONG
;
1254 hctx
->ctx_map
= kzalloc_node(num_maps
* sizeof(unsigned long),
1259 hctx
->nr_ctx_map
= num_maps
;
1262 if (reg
->ops
->init_hctx
&&
1263 reg
->ops
->init_hctx(hctx
, driver_data
, i
))
1267 if (i
== q
->nr_hw_queues
)
1273 queue_for_each_hw_ctx(q
, hctx
, j
) {
1277 if (reg
->ops
->exit_hctx
)
1278 reg
->ops
->exit_hctx(hctx
, j
);
1280 blk_mq_unregister_cpu_notifier(&hctx
->cpu_notifier
);
1281 blk_mq_free_rq_map(hctx
);
1288 static void blk_mq_init_cpu_queues(struct request_queue
*q
,
1289 unsigned int nr_hw_queues
)
1293 for_each_possible_cpu(i
) {
1294 struct blk_mq_ctx
*__ctx
= per_cpu_ptr(q
->queue_ctx
, i
);
1295 struct blk_mq_hw_ctx
*hctx
;
1297 memset(__ctx
, 0, sizeof(*__ctx
));
1299 spin_lock_init(&__ctx
->lock
);
1300 INIT_LIST_HEAD(&__ctx
->rq_list
);
1303 /* If the cpu isn't online, the cpu is mapped to first hctx */
1304 hctx
= q
->mq_ops
->map_queue(q
, i
);
1311 * Set local node, IFF we have more than one hw queue. If
1312 * not, we remain on the home node of the device
1314 if (nr_hw_queues
> 1 && hctx
->numa_node
== NUMA_NO_NODE
)
1315 hctx
->numa_node
= cpu_to_node(i
);
1319 static void blk_mq_map_swqueue(struct request_queue
*q
)
1322 struct blk_mq_hw_ctx
*hctx
;
1323 struct blk_mq_ctx
*ctx
;
1325 queue_for_each_hw_ctx(q
, hctx
, i
) {
1330 * Map software to hardware queues
1332 queue_for_each_ctx(q
, ctx
, i
) {
1333 /* If the cpu isn't online, the cpu is mapped to first hctx */
1334 hctx
= q
->mq_ops
->map_queue(q
, i
);
1335 ctx
->index_hw
= hctx
->nr_ctx
;
1336 hctx
->ctxs
[hctx
->nr_ctx
++] = ctx
;
1340 struct request_queue
*blk_mq_init_queue(struct blk_mq_reg
*reg
,
1343 struct blk_mq_hw_ctx
**hctxs
;
1344 struct blk_mq_ctx
*ctx
;
1345 struct request_queue
*q
;
1348 if (!reg
->nr_hw_queues
||
1349 !reg
->ops
->queue_rq
|| !reg
->ops
->map_queue
||
1350 !reg
->ops
->alloc_hctx
|| !reg
->ops
->free_hctx
)
1351 return ERR_PTR(-EINVAL
);
1353 if (!reg
->queue_depth
)
1354 reg
->queue_depth
= BLK_MQ_MAX_DEPTH
;
1355 else if (reg
->queue_depth
> BLK_MQ_MAX_DEPTH
) {
1356 pr_err("blk-mq: queuedepth too large (%u)\n", reg
->queue_depth
);
1357 reg
->queue_depth
= BLK_MQ_MAX_DEPTH
;
1360 if (reg
->queue_depth
< (reg
->reserved_tags
+ BLK_MQ_TAG_MIN
))
1361 return ERR_PTR(-EINVAL
);
1363 ctx
= alloc_percpu(struct blk_mq_ctx
);
1365 return ERR_PTR(-ENOMEM
);
1367 hctxs
= kmalloc_node(reg
->nr_hw_queues
* sizeof(*hctxs
), GFP_KERNEL
,
1373 for (i
= 0; i
< reg
->nr_hw_queues
; i
++) {
1374 hctxs
[i
] = reg
->ops
->alloc_hctx(reg
, i
);
1378 hctxs
[i
]->numa_node
= NUMA_NO_NODE
;
1379 hctxs
[i
]->queue_num
= i
;
1382 q
= blk_alloc_queue_node(GFP_KERNEL
, reg
->numa_node
);
1386 q
->mq_map
= blk_mq_make_queue_map(reg
);
1390 setup_timer(&q
->timeout
, blk_mq_rq_timer
, (unsigned long) q
);
1391 blk_queue_rq_timeout(q
, 30000);
1393 q
->nr_queues
= nr_cpu_ids
;
1394 q
->nr_hw_queues
= reg
->nr_hw_queues
;
1397 q
->queue_hw_ctx
= hctxs
;
1399 q
->mq_ops
= reg
->ops
;
1400 q
->queue_flags
|= QUEUE_FLAG_MQ_DEFAULT
;
1402 q
->sg_reserved_size
= INT_MAX
;
1404 blk_queue_make_request(q
, blk_mq_make_request
);
1405 blk_queue_rq_timed_out(q
, reg
->ops
->timeout
);
1407 blk_queue_rq_timeout(q
, reg
->timeout
);
1409 if (reg
->ops
->complete
)
1410 blk_queue_softirq_done(q
, reg
->ops
->complete
);
1412 blk_mq_init_flush(q
);
1413 blk_mq_init_cpu_queues(q
, reg
->nr_hw_queues
);
1415 if (blk_mq_init_hw_queues(q
, reg
, driver_data
))
1418 blk_mq_map_swqueue(q
);
1420 mutex_lock(&all_q_mutex
);
1421 list_add_tail(&q
->all_q_node
, &all_q_list
);
1422 mutex_unlock(&all_q_mutex
);
1428 blk_cleanup_queue(q
);
1430 for (i
= 0; i
< reg
->nr_hw_queues
; i
++) {
1433 reg
->ops
->free_hctx(hctxs
[i
], i
);
1438 return ERR_PTR(-ENOMEM
);
1440 EXPORT_SYMBOL(blk_mq_init_queue
);
1442 void blk_mq_free_queue(struct request_queue
*q
)
1444 struct blk_mq_hw_ctx
*hctx
;
1447 queue_for_each_hw_ctx(q
, hctx
, i
) {
1448 kfree(hctx
->ctx_map
);
1450 blk_mq_free_rq_map(hctx
);
1451 blk_mq_unregister_cpu_notifier(&hctx
->cpu_notifier
);
1452 if (q
->mq_ops
->exit_hctx
)
1453 q
->mq_ops
->exit_hctx(hctx
, i
);
1454 q
->mq_ops
->free_hctx(hctx
, i
);
1457 free_percpu(q
->queue_ctx
);
1458 kfree(q
->queue_hw_ctx
);
1461 q
->queue_ctx
= NULL
;
1462 q
->queue_hw_ctx
= NULL
;
1465 mutex_lock(&all_q_mutex
);
1466 list_del_init(&q
->all_q_node
);
1467 mutex_unlock(&all_q_mutex
);
1470 /* Basically redo blk_mq_init_queue with queue frozen */
1471 static void blk_mq_queue_reinit(struct request_queue
*q
)
1473 blk_mq_freeze_queue(q
);
1475 blk_mq_update_queue_map(q
->mq_map
, q
->nr_hw_queues
);
1478 * redo blk_mq_init_cpu_queues and blk_mq_init_hw_queues. FIXME: maybe
1479 * we should change hctx numa_node according to new topology (this
1480 * involves free and re-allocate memory, worthy doing?)
1483 blk_mq_map_swqueue(q
);
1485 blk_mq_unfreeze_queue(q
);
1488 static int blk_mq_queue_reinit_notify(struct notifier_block
*nb
,
1489 unsigned long action
, void *hcpu
)
1491 struct request_queue
*q
;
1494 * Before new mapping is established, hotadded cpu might already start
1495 * handling requests. This doesn't break anything as we map offline
1496 * CPUs to first hardware queue. We will re-init queue below to get
1499 if (action
!= CPU_DEAD
&& action
!= CPU_DEAD_FROZEN
&&
1500 action
!= CPU_ONLINE
&& action
!= CPU_ONLINE_FROZEN
)
1503 mutex_lock(&all_q_mutex
);
1504 list_for_each_entry(q
, &all_q_list
, all_q_node
)
1505 blk_mq_queue_reinit(q
);
1506 mutex_unlock(&all_q_mutex
);
1510 static int __init
blk_mq_init(void)
1514 /* Must be called after percpu_counter_hotcpu_callback() */
1515 hotcpu_notifier(blk_mq_queue_reinit_notify
, -10);
1519 subsys_initcall(blk_mq_init
);