2 * Copyright (C) 1991, 1992 Linus Torvalds
3 * Copyright (C) 1994, Karl Keyte: Added support for disk statistics
4 * Elevator latency, (C) 2000 Andrea Arcangeli <andrea@suse.de> SuSE
5 * Queue request tables / lock, selectable elevator, Jens Axboe <axboe@suse.de>
6 * kernel-doc documentation started by NeilBrown <neilb@cse.unsw.edu.au>
8 * bio rewrite, highmem i/o, etc, Jens Axboe <axboe@suse.de> - may 2001
12 * This handles all read/write requests to block devices
14 #include <linux/kernel.h>
15 #include <linux/module.h>
16 #include <linux/backing-dev.h>
17 #include <linux/bio.h>
18 #include <linux/blkdev.h>
19 #include <linux/blk-mq.h>
20 #include <linux/highmem.h>
22 #include <linux/kernel_stat.h>
23 #include <linux/string.h>
24 #include <linux/init.h>
25 #include <linux/completion.h>
26 #include <linux/slab.h>
27 #include <linux/swap.h>
28 #include <linux/writeback.h>
29 #include <linux/task_io_accounting_ops.h>
30 #include <linux/fault-inject.h>
31 #include <linux/list_sort.h>
32 #include <linux/delay.h>
33 #include <linux/ratelimit.h>
34 #include <linux/pm_runtime.h>
35 #include <linux/blk-cgroup.h>
37 #define CREATE_TRACE_POINTS
38 #include <trace/events/block.h>
43 EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_remap
);
44 EXPORT_TRACEPOINT_SYMBOL_GPL(block_rq_remap
);
45 EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_complete
);
46 EXPORT_TRACEPOINT_SYMBOL_GPL(block_split
);
47 EXPORT_TRACEPOINT_SYMBOL_GPL(block_unplug
);
49 DEFINE_IDA(blk_queue_ida
);
52 * For the allocated request tables
54 struct kmem_cache
*request_cachep
= NULL
;
57 * For queue allocation
59 struct kmem_cache
*blk_requestq_cachep
;
62 * Controlling structure to kblockd
64 static struct workqueue_struct
*kblockd_workqueue
;
66 static void blk_clear_congested(struct request_list
*rl
, int sync
)
68 #ifdef CONFIG_CGROUP_WRITEBACK
69 clear_wb_congested(rl
->blkg
->wb_congested
, sync
);
72 * If !CGROUP_WRITEBACK, all blkg's map to bdi->wb and we shouldn't
73 * flip its congestion state for events on other blkcgs.
75 if (rl
== &rl
->q
->root_rl
)
76 clear_wb_congested(rl
->q
->backing_dev_info
.wb
.congested
, sync
);
80 static void blk_set_congested(struct request_list
*rl
, int sync
)
82 #ifdef CONFIG_CGROUP_WRITEBACK
83 set_wb_congested(rl
->blkg
->wb_congested
, sync
);
85 /* see blk_clear_congested() */
86 if (rl
== &rl
->q
->root_rl
)
87 set_wb_congested(rl
->q
->backing_dev_info
.wb
.congested
, sync
);
91 void blk_queue_congestion_threshold(struct request_queue
*q
)
95 nr
= q
->nr_requests
- (q
->nr_requests
/ 8) + 1;
96 if (nr
> q
->nr_requests
)
98 q
->nr_congestion_on
= nr
;
100 nr
= q
->nr_requests
- (q
->nr_requests
/ 8) - (q
->nr_requests
/ 16) - 1;
103 q
->nr_congestion_off
= nr
;
107 * blk_get_backing_dev_info - get the address of a queue's backing_dev_info
110 * Locates the passed device's request queue and returns the address of its
111 * backing_dev_info. This function can only be called if @bdev is opened
112 * and the return value is never NULL.
114 struct backing_dev_info
*blk_get_backing_dev_info(struct block_device
*bdev
)
116 struct request_queue
*q
= bdev_get_queue(bdev
);
118 return &q
->backing_dev_info
;
120 EXPORT_SYMBOL(blk_get_backing_dev_info
);
122 void blk_rq_init(struct request_queue
*q
, struct request
*rq
)
124 memset(rq
, 0, sizeof(*rq
));
126 INIT_LIST_HEAD(&rq
->queuelist
);
127 INIT_LIST_HEAD(&rq
->timeout_list
);
130 rq
->__sector
= (sector_t
) -1;
131 INIT_HLIST_NODE(&rq
->hash
);
132 RB_CLEAR_NODE(&rq
->rb_node
);
134 rq
->cmd_len
= BLK_MAX_CDB
;
136 rq
->start_time
= jiffies
;
137 set_start_time_ns(rq
);
140 EXPORT_SYMBOL(blk_rq_init
);
142 static void req_bio_endio(struct request
*rq
, struct bio
*bio
,
143 unsigned int nbytes
, int error
)
146 bio
->bi_error
= error
;
148 if (unlikely(rq
->cmd_flags
& REQ_QUIET
))
149 set_bit(BIO_QUIET
, &bio
->bi_flags
);
151 bio_advance(bio
, nbytes
);
153 /* don't actually finish bio if it's part of flush sequence */
154 if (bio
->bi_iter
.bi_size
== 0 && !(rq
->cmd_flags
& REQ_FLUSH_SEQ
))
158 void blk_dump_rq_flags(struct request
*rq
, char *msg
)
162 printk(KERN_INFO
"%s: dev %s: type=%x, flags=%llx\n", msg
,
163 rq
->rq_disk
? rq
->rq_disk
->disk_name
: "?", rq
->cmd_type
,
164 (unsigned long long) rq
->cmd_flags
);
166 printk(KERN_INFO
" sector %llu, nr/cnr %u/%u\n",
167 (unsigned long long)blk_rq_pos(rq
),
168 blk_rq_sectors(rq
), blk_rq_cur_sectors(rq
));
169 printk(KERN_INFO
" bio %p, biotail %p, len %u\n",
170 rq
->bio
, rq
->biotail
, blk_rq_bytes(rq
));
172 if (rq
->cmd_type
== REQ_TYPE_BLOCK_PC
) {
173 printk(KERN_INFO
" cdb: ");
174 for (bit
= 0; bit
< BLK_MAX_CDB
; bit
++)
175 printk("%02x ", rq
->cmd
[bit
]);
179 EXPORT_SYMBOL(blk_dump_rq_flags
);
181 static void blk_delay_work(struct work_struct
*work
)
183 struct request_queue
*q
;
185 q
= container_of(work
, struct request_queue
, delay_work
.work
);
186 spin_lock_irq(q
->queue_lock
);
188 spin_unlock_irq(q
->queue_lock
);
192 * blk_delay_queue - restart queueing after defined interval
193 * @q: The &struct request_queue in question
194 * @msecs: Delay in msecs
197 * Sometimes queueing needs to be postponed for a little while, to allow
198 * resources to come back. This function will make sure that queueing is
199 * restarted around the specified time. Queue lock must be held.
201 void blk_delay_queue(struct request_queue
*q
, unsigned long msecs
)
203 if (likely(!blk_queue_dead(q
)))
204 queue_delayed_work(kblockd_workqueue
, &q
->delay_work
,
205 msecs_to_jiffies(msecs
));
207 EXPORT_SYMBOL(blk_delay_queue
);
210 * blk_start_queue - restart a previously stopped queue
211 * @q: The &struct request_queue in question
214 * blk_start_queue() will clear the stop flag on the queue, and call
215 * the request_fn for the queue if it was in a stopped state when
216 * entered. Also see blk_stop_queue(). Queue lock must be held.
218 void blk_start_queue(struct request_queue
*q
)
220 WARN_ON(!irqs_disabled());
222 queue_flag_clear(QUEUE_FLAG_STOPPED
, q
);
225 EXPORT_SYMBOL(blk_start_queue
);
228 * blk_stop_queue - stop a queue
229 * @q: The &struct request_queue in question
232 * The Linux block layer assumes that a block driver will consume all
233 * entries on the request queue when the request_fn strategy is called.
234 * Often this will not happen, because of hardware limitations (queue
235 * depth settings). If a device driver gets a 'queue full' response,
236 * or if it simply chooses not to queue more I/O at one point, it can
237 * call this function to prevent the request_fn from being called until
238 * the driver has signalled it's ready to go again. This happens by calling
239 * blk_start_queue() to restart queue operations. Queue lock must be held.
241 void blk_stop_queue(struct request_queue
*q
)
243 cancel_delayed_work(&q
->delay_work
);
244 queue_flag_set(QUEUE_FLAG_STOPPED
, q
);
246 EXPORT_SYMBOL(blk_stop_queue
);
249 * blk_sync_queue - cancel any pending callbacks on a queue
253 * The block layer may perform asynchronous callback activity
254 * on a queue, such as calling the unplug function after a timeout.
255 * A block device may call blk_sync_queue to ensure that any
256 * such activity is cancelled, thus allowing it to release resources
257 * that the callbacks might use. The caller must already have made sure
258 * that its ->make_request_fn will not re-add plugging prior to calling
261 * This function does not cancel any asynchronous activity arising
262 * out of elevator or throttling code. That would require elevator_exit()
263 * and blkcg_exit_queue() to be called with queue lock initialized.
266 void blk_sync_queue(struct request_queue
*q
)
268 del_timer_sync(&q
->timeout
);
271 struct blk_mq_hw_ctx
*hctx
;
274 queue_for_each_hw_ctx(q
, hctx
, i
) {
275 cancel_delayed_work_sync(&hctx
->run_work
);
276 cancel_delayed_work_sync(&hctx
->delay_work
);
279 cancel_delayed_work_sync(&q
->delay_work
);
282 EXPORT_SYMBOL(blk_sync_queue
);
285 * __blk_run_queue_uncond - run a queue whether or not it has been stopped
286 * @q: The queue to run
289 * Invoke request handling on a queue if there are any pending requests.
290 * May be used to restart request handling after a request has completed.
291 * This variant runs the queue whether or not the queue has been
292 * stopped. Must be called with the queue lock held and interrupts
293 * disabled. See also @blk_run_queue.
295 inline void __blk_run_queue_uncond(struct request_queue
*q
)
297 if (unlikely(blk_queue_dead(q
)))
301 * Some request_fn implementations, e.g. scsi_request_fn(), unlock
302 * the queue lock internally. As a result multiple threads may be
303 * running such a request function concurrently. Keep track of the
304 * number of active request_fn invocations such that blk_drain_queue()
305 * can wait until all these request_fn calls have finished.
307 q
->request_fn_active
++;
309 q
->request_fn_active
--;
311 EXPORT_SYMBOL_GPL(__blk_run_queue_uncond
);
314 * __blk_run_queue - run a single device queue
315 * @q: The queue to run
318 * See @blk_run_queue. This variant must be called with the queue lock
319 * held and interrupts disabled.
321 void __blk_run_queue(struct request_queue
*q
)
323 if (unlikely(blk_queue_stopped(q
)))
326 __blk_run_queue_uncond(q
);
328 EXPORT_SYMBOL(__blk_run_queue
);
331 * blk_run_queue_async - run a single device queue in workqueue context
332 * @q: The queue to run
335 * Tells kblockd to perform the equivalent of @blk_run_queue on behalf
336 * of us. The caller must hold the queue lock.
338 void blk_run_queue_async(struct request_queue
*q
)
340 if (likely(!blk_queue_stopped(q
) && !blk_queue_dead(q
)))
341 mod_delayed_work(kblockd_workqueue
, &q
->delay_work
, 0);
343 EXPORT_SYMBOL(blk_run_queue_async
);
346 * blk_run_queue - run a single device queue
347 * @q: The queue to run
350 * Invoke request handling on this queue, if it has pending work to do.
351 * May be used to restart queueing when a request has completed.
353 void blk_run_queue(struct request_queue
*q
)
357 spin_lock_irqsave(q
->queue_lock
, flags
);
359 spin_unlock_irqrestore(q
->queue_lock
, flags
);
361 EXPORT_SYMBOL(blk_run_queue
);
363 void blk_put_queue(struct request_queue
*q
)
365 kobject_put(&q
->kobj
);
367 EXPORT_SYMBOL(blk_put_queue
);
370 * __blk_drain_queue - drain requests from request_queue
372 * @drain_all: whether to drain all requests or only the ones w/ ELVPRIV
374 * Drain requests from @q. If @drain_all is set, all requests are drained.
375 * If not, only ELVPRIV requests are drained. The caller is responsible
376 * for ensuring that no new requests which need to be drained are queued.
378 static void __blk_drain_queue(struct request_queue
*q
, bool drain_all
)
379 __releases(q
->queue_lock
)
380 __acquires(q
->queue_lock
)
384 lockdep_assert_held(q
->queue_lock
);
390 * The caller might be trying to drain @q before its
391 * elevator is initialized.
394 elv_drain_elevator(q
);
396 blkcg_drain_queue(q
);
399 * This function might be called on a queue which failed
400 * driver init after queue creation or is not yet fully
401 * active yet. Some drivers (e.g. fd and loop) get unhappy
402 * in such cases. Kick queue iff dispatch queue has
403 * something on it and @q has request_fn set.
405 if (!list_empty(&q
->queue_head
) && q
->request_fn
)
408 drain
|= q
->nr_rqs_elvpriv
;
409 drain
|= q
->request_fn_active
;
412 * Unfortunately, requests are queued at and tracked from
413 * multiple places and there's no single counter which can
414 * be drained. Check all the queues and counters.
417 struct blk_flush_queue
*fq
= blk_get_flush_queue(q
, NULL
);
418 drain
|= !list_empty(&q
->queue_head
);
419 for (i
= 0; i
< 2; i
++) {
420 drain
|= q
->nr_rqs
[i
];
421 drain
|= q
->in_flight
[i
];
423 drain
|= !list_empty(&fq
->flush_queue
[i
]);
430 spin_unlock_irq(q
->queue_lock
);
434 spin_lock_irq(q
->queue_lock
);
438 * With queue marked dead, any woken up waiter will fail the
439 * allocation path, so the wakeup chaining is lost and we're
440 * left with hung waiters. We need to wake up those waiters.
443 struct request_list
*rl
;
445 blk_queue_for_each_rl(rl
, q
)
446 for (i
= 0; i
< ARRAY_SIZE(rl
->wait
); i
++)
447 wake_up_all(&rl
->wait
[i
]);
452 * blk_queue_bypass_start - enter queue bypass mode
453 * @q: queue of interest
455 * In bypass mode, only the dispatch FIFO queue of @q is used. This
456 * function makes @q enter bypass mode and drains all requests which were
457 * throttled or issued before. On return, it's guaranteed that no request
458 * is being throttled or has ELVPRIV set and blk_queue_bypass() %true
459 * inside queue or RCU read lock.
461 void blk_queue_bypass_start(struct request_queue
*q
)
463 spin_lock_irq(q
->queue_lock
);
465 queue_flag_set(QUEUE_FLAG_BYPASS
, q
);
466 spin_unlock_irq(q
->queue_lock
);
469 * Queues start drained. Skip actual draining till init is
470 * complete. This avoids lenghty delays during queue init which
471 * can happen many times during boot.
473 if (blk_queue_init_done(q
)) {
474 spin_lock_irq(q
->queue_lock
);
475 __blk_drain_queue(q
, false);
476 spin_unlock_irq(q
->queue_lock
);
478 /* ensure blk_queue_bypass() is %true inside RCU read lock */
482 EXPORT_SYMBOL_GPL(blk_queue_bypass_start
);
485 * blk_queue_bypass_end - leave queue bypass mode
486 * @q: queue of interest
488 * Leave bypass mode and restore the normal queueing behavior.
490 void blk_queue_bypass_end(struct request_queue
*q
)
492 spin_lock_irq(q
->queue_lock
);
493 if (!--q
->bypass_depth
)
494 queue_flag_clear(QUEUE_FLAG_BYPASS
, q
);
495 WARN_ON_ONCE(q
->bypass_depth
< 0);
496 spin_unlock_irq(q
->queue_lock
);
498 EXPORT_SYMBOL_GPL(blk_queue_bypass_end
);
500 void blk_set_queue_dying(struct request_queue
*q
)
502 queue_flag_set_unlocked(QUEUE_FLAG_DYING
, q
);
505 blk_mq_wake_waiters(q
);
507 struct request_list
*rl
;
509 blk_queue_for_each_rl(rl
, q
) {
511 wake_up(&rl
->wait
[BLK_RW_SYNC
]);
512 wake_up(&rl
->wait
[BLK_RW_ASYNC
]);
517 EXPORT_SYMBOL_GPL(blk_set_queue_dying
);
520 * blk_cleanup_queue - shutdown a request queue
521 * @q: request queue to shutdown
523 * Mark @q DYING, drain all pending requests, mark @q DEAD, destroy and
524 * put it. All future requests will be failed immediately with -ENODEV.
526 void blk_cleanup_queue(struct request_queue
*q
)
528 spinlock_t
*lock
= q
->queue_lock
;
530 /* mark @q DYING, no new request or merges will be allowed afterwards */
531 mutex_lock(&q
->sysfs_lock
);
532 blk_set_queue_dying(q
);
536 * A dying queue is permanently in bypass mode till released. Note
537 * that, unlike blk_queue_bypass_start(), we aren't performing
538 * synchronize_rcu() after entering bypass mode to avoid the delay
539 * as some drivers create and destroy a lot of queues while
540 * probing. This is still safe because blk_release_queue() will be
541 * called only after the queue refcnt drops to zero and nothing,
542 * RCU or not, would be traversing the queue by then.
545 queue_flag_set(QUEUE_FLAG_BYPASS
, q
);
547 queue_flag_set(QUEUE_FLAG_NOMERGES
, q
);
548 queue_flag_set(QUEUE_FLAG_NOXMERGES
, q
);
549 queue_flag_set(QUEUE_FLAG_DYING
, q
);
550 spin_unlock_irq(lock
);
551 mutex_unlock(&q
->sysfs_lock
);
554 * Drain all requests queued before DYING marking. Set DEAD flag to
555 * prevent that q->request_fn() gets invoked after draining finished.
558 blk_mq_freeze_queue(q
);
562 __blk_drain_queue(q
, true);
564 queue_flag_set(QUEUE_FLAG_DEAD
, q
);
565 spin_unlock_irq(lock
);
567 /* @q won't process any more request, flush async actions */
568 del_timer_sync(&q
->backing_dev_info
.laptop_mode_wb_timer
);
572 blk_mq_free_queue(q
);
575 if (q
->queue_lock
!= &q
->__queue_lock
)
576 q
->queue_lock
= &q
->__queue_lock
;
577 spin_unlock_irq(lock
);
579 bdi_destroy(&q
->backing_dev_info
);
581 /* @q is and will stay empty, shutdown and put */
584 EXPORT_SYMBOL(blk_cleanup_queue
);
586 /* Allocate memory local to the request queue */
587 static void *alloc_request_struct(gfp_t gfp_mask
, void *data
)
589 int nid
= (int)(long)data
;
590 return kmem_cache_alloc_node(request_cachep
, gfp_mask
, nid
);
593 static void free_request_struct(void *element
, void *unused
)
595 kmem_cache_free(request_cachep
, element
);
598 int blk_init_rl(struct request_list
*rl
, struct request_queue
*q
,
601 if (unlikely(rl
->rq_pool
))
605 rl
->count
[BLK_RW_SYNC
] = rl
->count
[BLK_RW_ASYNC
] = 0;
606 rl
->starved
[BLK_RW_SYNC
] = rl
->starved
[BLK_RW_ASYNC
] = 0;
607 init_waitqueue_head(&rl
->wait
[BLK_RW_SYNC
]);
608 init_waitqueue_head(&rl
->wait
[BLK_RW_ASYNC
]);
610 rl
->rq_pool
= mempool_create_node(BLKDEV_MIN_RQ
, alloc_request_struct
,
612 (void *)(long)q
->node
, gfp_mask
,
620 void blk_exit_rl(struct request_list
*rl
)
623 mempool_destroy(rl
->rq_pool
);
626 struct request_queue
*blk_alloc_queue(gfp_t gfp_mask
)
628 return blk_alloc_queue_node(gfp_mask
, NUMA_NO_NODE
);
630 EXPORT_SYMBOL(blk_alloc_queue
);
632 struct request_queue
*blk_alloc_queue_node(gfp_t gfp_mask
, int node_id
)
634 struct request_queue
*q
;
637 q
= kmem_cache_alloc_node(blk_requestq_cachep
,
638 gfp_mask
| __GFP_ZERO
, node_id
);
642 q
->id
= ida_simple_get(&blk_queue_ida
, 0, 0, gfp_mask
);
646 q
->backing_dev_info
.ra_pages
=
647 (VM_MAX_READAHEAD
* 1024) / PAGE_CACHE_SIZE
;
648 q
->backing_dev_info
.capabilities
= BDI_CAP_CGROUP_WRITEBACK
;
649 q
->backing_dev_info
.name
= "block";
652 err
= bdi_init(&q
->backing_dev_info
);
656 setup_timer(&q
->backing_dev_info
.laptop_mode_wb_timer
,
657 laptop_mode_timer_fn
, (unsigned long) q
);
658 setup_timer(&q
->timeout
, blk_rq_timed_out_timer
, (unsigned long) q
);
659 INIT_LIST_HEAD(&q
->queue_head
);
660 INIT_LIST_HEAD(&q
->timeout_list
);
661 INIT_LIST_HEAD(&q
->icq_list
);
662 #ifdef CONFIG_BLK_CGROUP
663 INIT_LIST_HEAD(&q
->blkg_list
);
665 INIT_DELAYED_WORK(&q
->delay_work
, blk_delay_work
);
667 kobject_init(&q
->kobj
, &blk_queue_ktype
);
669 mutex_init(&q
->sysfs_lock
);
670 spin_lock_init(&q
->__queue_lock
);
673 * By default initialize queue_lock to internal lock and driver can
674 * override it later if need be.
676 q
->queue_lock
= &q
->__queue_lock
;
679 * A queue starts its life with bypass turned on to avoid
680 * unnecessary bypass on/off overhead and nasty surprises during
681 * init. The initial bypass will be finished when the queue is
682 * registered by blk_register_queue().
685 __set_bit(QUEUE_FLAG_BYPASS
, &q
->queue_flags
);
687 init_waitqueue_head(&q
->mq_freeze_wq
);
689 if (blkcg_init_queue(q
))
695 bdi_destroy(&q
->backing_dev_info
);
697 ida_simple_remove(&blk_queue_ida
, q
->id
);
699 kmem_cache_free(blk_requestq_cachep
, q
);
702 EXPORT_SYMBOL(blk_alloc_queue_node
);
705 * blk_init_queue - prepare a request queue for use with a block device
706 * @rfn: The function to be called to process requests that have been
707 * placed on the queue.
708 * @lock: Request queue spin lock
711 * If a block device wishes to use the standard request handling procedures,
712 * which sorts requests and coalesces adjacent requests, then it must
713 * call blk_init_queue(). The function @rfn will be called when there
714 * are requests on the queue that need to be processed. If the device
715 * supports plugging, then @rfn may not be called immediately when requests
716 * are available on the queue, but may be called at some time later instead.
717 * Plugged queues are generally unplugged when a buffer belonging to one
718 * of the requests on the queue is needed, or due to memory pressure.
720 * @rfn is not required, or even expected, to remove all requests off the
721 * queue, but only as many as it can handle at a time. If it does leave
722 * requests on the queue, it is responsible for arranging that the requests
723 * get dealt with eventually.
725 * The queue spin lock must be held while manipulating the requests on the
726 * request queue; this lock will be taken also from interrupt context, so irq
727 * disabling is needed for it.
729 * Function returns a pointer to the initialized request queue, or %NULL if
733 * blk_init_queue() must be paired with a blk_cleanup_queue() call
734 * when the block device is deactivated (such as at module unload).
737 struct request_queue
*blk_init_queue(request_fn_proc
*rfn
, spinlock_t
*lock
)
739 return blk_init_queue_node(rfn
, lock
, NUMA_NO_NODE
);
741 EXPORT_SYMBOL(blk_init_queue
);
743 struct request_queue
*
744 blk_init_queue_node(request_fn_proc
*rfn
, spinlock_t
*lock
, int node_id
)
746 struct request_queue
*uninit_q
, *q
;
748 uninit_q
= blk_alloc_queue_node(GFP_KERNEL
, node_id
);
752 q
= blk_init_allocated_queue(uninit_q
, rfn
, lock
);
754 blk_cleanup_queue(uninit_q
);
758 EXPORT_SYMBOL(blk_init_queue_node
);
760 static void blk_queue_bio(struct request_queue
*q
, struct bio
*bio
);
762 struct request_queue
*
763 blk_init_allocated_queue(struct request_queue
*q
, request_fn_proc
*rfn
,
769 q
->fq
= blk_alloc_flush_queue(q
, NUMA_NO_NODE
, 0);
773 if (blk_init_rl(&q
->root_rl
, q
, GFP_KERNEL
))
777 q
->prep_rq_fn
= NULL
;
778 q
->unprep_rq_fn
= NULL
;
779 q
->queue_flags
|= QUEUE_FLAG_DEFAULT
;
781 /* Override internal queue lock with supplied lock pointer */
783 q
->queue_lock
= lock
;
786 * This also sets hw/phys segments, boundary and size
788 blk_queue_make_request(q
, blk_queue_bio
);
790 q
->sg_reserved_size
= INT_MAX
;
792 /* Protect q->elevator from elevator_change */
793 mutex_lock(&q
->sysfs_lock
);
796 if (elevator_init(q
, NULL
)) {
797 mutex_unlock(&q
->sysfs_lock
);
801 mutex_unlock(&q
->sysfs_lock
);
806 blk_free_flush_queue(q
->fq
);
809 EXPORT_SYMBOL(blk_init_allocated_queue
);
811 bool blk_get_queue(struct request_queue
*q
)
813 if (likely(!blk_queue_dying(q
))) {
820 EXPORT_SYMBOL(blk_get_queue
);
822 static inline void blk_free_request(struct request_list
*rl
, struct request
*rq
)
824 if (rq
->cmd_flags
& REQ_ELVPRIV
) {
825 elv_put_request(rl
->q
, rq
);
827 put_io_context(rq
->elv
.icq
->ioc
);
830 mempool_free(rq
, rl
->rq_pool
);
834 * ioc_batching returns true if the ioc is a valid batching request and
835 * should be given priority access to a request.
837 static inline int ioc_batching(struct request_queue
*q
, struct io_context
*ioc
)
843 * Make sure the process is able to allocate at least 1 request
844 * even if the batch times out, otherwise we could theoretically
847 return ioc
->nr_batch_requests
== q
->nr_batching
||
848 (ioc
->nr_batch_requests
> 0
849 && time_before(jiffies
, ioc
->last_waited
+ BLK_BATCH_TIME
));
853 * ioc_set_batching sets ioc to be a new "batcher" if it is not one. This
854 * will cause the process to be a "batcher" on all queues in the system. This
855 * is the behaviour we want though - once it gets a wakeup it should be given
858 static void ioc_set_batching(struct request_queue
*q
, struct io_context
*ioc
)
860 if (!ioc
|| ioc_batching(q
, ioc
))
863 ioc
->nr_batch_requests
= q
->nr_batching
;
864 ioc
->last_waited
= jiffies
;
867 static void __freed_request(struct request_list
*rl
, int sync
)
869 struct request_queue
*q
= rl
->q
;
871 if (rl
->count
[sync
] < queue_congestion_off_threshold(q
))
872 blk_clear_congested(rl
, sync
);
874 if (rl
->count
[sync
] + 1 <= q
->nr_requests
) {
875 if (waitqueue_active(&rl
->wait
[sync
]))
876 wake_up(&rl
->wait
[sync
]);
878 blk_clear_rl_full(rl
, sync
);
883 * A request has just been released. Account for it, update the full and
884 * congestion status, wake up any waiters. Called under q->queue_lock.
886 static void freed_request(struct request_list
*rl
, unsigned int flags
)
888 struct request_queue
*q
= rl
->q
;
889 int sync
= rw_is_sync(flags
);
893 if (flags
& REQ_ELVPRIV
)
896 __freed_request(rl
, sync
);
898 if (unlikely(rl
->starved
[sync
^ 1]))
899 __freed_request(rl
, sync
^ 1);
902 int blk_update_nr_requests(struct request_queue
*q
, unsigned int nr
)
904 struct request_list
*rl
;
905 int on_thresh
, off_thresh
;
907 spin_lock_irq(q
->queue_lock
);
909 blk_queue_congestion_threshold(q
);
910 on_thresh
= queue_congestion_on_threshold(q
);
911 off_thresh
= queue_congestion_off_threshold(q
);
913 blk_queue_for_each_rl(rl
, q
) {
914 if (rl
->count
[BLK_RW_SYNC
] >= on_thresh
)
915 blk_set_congested(rl
, BLK_RW_SYNC
);
916 else if (rl
->count
[BLK_RW_SYNC
] < off_thresh
)
917 blk_clear_congested(rl
, BLK_RW_SYNC
);
919 if (rl
->count
[BLK_RW_ASYNC
] >= on_thresh
)
920 blk_set_congested(rl
, BLK_RW_ASYNC
);
921 else if (rl
->count
[BLK_RW_ASYNC
] < off_thresh
)
922 blk_clear_congested(rl
, BLK_RW_ASYNC
);
924 if (rl
->count
[BLK_RW_SYNC
] >= q
->nr_requests
) {
925 blk_set_rl_full(rl
, BLK_RW_SYNC
);
927 blk_clear_rl_full(rl
, BLK_RW_SYNC
);
928 wake_up(&rl
->wait
[BLK_RW_SYNC
]);
931 if (rl
->count
[BLK_RW_ASYNC
] >= q
->nr_requests
) {
932 blk_set_rl_full(rl
, BLK_RW_ASYNC
);
934 blk_clear_rl_full(rl
, BLK_RW_ASYNC
);
935 wake_up(&rl
->wait
[BLK_RW_ASYNC
]);
939 spin_unlock_irq(q
->queue_lock
);
944 * Determine if elevator data should be initialized when allocating the
945 * request associated with @bio.
947 static bool blk_rq_should_init_elevator(struct bio
*bio
)
953 * Flush requests do not use the elevator so skip initialization.
954 * This allows a request to share the flush and elevator data.
956 if (bio
->bi_rw
& (REQ_FLUSH
| REQ_FUA
))
963 * rq_ioc - determine io_context for request allocation
964 * @bio: request being allocated is for this bio (can be %NULL)
966 * Determine io_context to use for request allocation for @bio. May return
967 * %NULL if %current->io_context doesn't exist.
969 static struct io_context
*rq_ioc(struct bio
*bio
)
971 #ifdef CONFIG_BLK_CGROUP
972 if (bio
&& bio
->bi_ioc
)
975 return current
->io_context
;
979 * __get_request - get a free request
980 * @rl: request list to allocate from
981 * @rw_flags: RW and SYNC flags
982 * @bio: bio to allocate request for (can be %NULL)
983 * @gfp_mask: allocation mask
985 * Get a free request from @q. This function may fail under memory
986 * pressure or if @q is dead.
988 * Must be called with @q->queue_lock held and,
989 * Returns ERR_PTR on failure, with @q->queue_lock held.
990 * Returns request pointer on success, with @q->queue_lock *not held*.
992 static struct request
*__get_request(struct request_list
*rl
, int rw_flags
,
993 struct bio
*bio
, gfp_t gfp_mask
)
995 struct request_queue
*q
= rl
->q
;
997 struct elevator_type
*et
= q
->elevator
->type
;
998 struct io_context
*ioc
= rq_ioc(bio
);
999 struct io_cq
*icq
= NULL
;
1000 const bool is_sync
= rw_is_sync(rw_flags
) != 0;
1003 if (unlikely(blk_queue_dying(q
)))
1004 return ERR_PTR(-ENODEV
);
1006 may_queue
= elv_may_queue(q
, rw_flags
);
1007 if (may_queue
== ELV_MQUEUE_NO
)
1010 if (rl
->count
[is_sync
]+1 >= queue_congestion_on_threshold(q
)) {
1011 if (rl
->count
[is_sync
]+1 >= q
->nr_requests
) {
1013 * The queue will fill after this allocation, so set
1014 * it as full, and mark this process as "batching".
1015 * This process will be allowed to complete a batch of
1016 * requests, others will be blocked.
1018 if (!blk_rl_full(rl
, is_sync
)) {
1019 ioc_set_batching(q
, ioc
);
1020 blk_set_rl_full(rl
, is_sync
);
1022 if (may_queue
!= ELV_MQUEUE_MUST
1023 && !ioc_batching(q
, ioc
)) {
1025 * The queue is full and the allocating
1026 * process is not a "batcher", and not
1027 * exempted by the IO scheduler
1029 return ERR_PTR(-ENOMEM
);
1033 blk_set_congested(rl
, is_sync
);
1037 * Only allow batching queuers to allocate up to 50% over the defined
1038 * limit of requests, otherwise we could have thousands of requests
1039 * allocated with any setting of ->nr_requests
1041 if (rl
->count
[is_sync
] >= (3 * q
->nr_requests
/ 2))
1042 return ERR_PTR(-ENOMEM
);
1044 q
->nr_rqs
[is_sync
]++;
1045 rl
->count
[is_sync
]++;
1046 rl
->starved
[is_sync
] = 0;
1049 * Decide whether the new request will be managed by elevator. If
1050 * so, mark @rw_flags and increment elvpriv. Non-zero elvpriv will
1051 * prevent the current elevator from being destroyed until the new
1052 * request is freed. This guarantees icq's won't be destroyed and
1053 * makes creating new ones safe.
1055 * Also, lookup icq while holding queue_lock. If it doesn't exist,
1056 * it will be created after releasing queue_lock.
1058 if (blk_rq_should_init_elevator(bio
) && !blk_queue_bypass(q
)) {
1059 rw_flags
|= REQ_ELVPRIV
;
1060 q
->nr_rqs_elvpriv
++;
1061 if (et
->icq_cache
&& ioc
)
1062 icq
= ioc_lookup_icq(ioc
, q
);
1065 if (blk_queue_io_stat(q
))
1066 rw_flags
|= REQ_IO_STAT
;
1067 spin_unlock_irq(q
->queue_lock
);
1069 /* allocate and init request */
1070 rq
= mempool_alloc(rl
->rq_pool
, gfp_mask
);
1075 blk_rq_set_rl(rq
, rl
);
1076 rq
->cmd_flags
= rw_flags
| REQ_ALLOCED
;
1079 if (rw_flags
& REQ_ELVPRIV
) {
1080 if (unlikely(et
->icq_cache
&& !icq
)) {
1082 icq
= ioc_create_icq(ioc
, q
, gfp_mask
);
1088 if (unlikely(elv_set_request(q
, rq
, bio
, gfp_mask
)))
1091 /* @rq->elv.icq holds io_context until @rq is freed */
1093 get_io_context(icq
->ioc
);
1097 * ioc may be NULL here, and ioc_batching will be false. That's
1098 * OK, if the queue is under the request limit then requests need
1099 * not count toward the nr_batch_requests limit. There will always
1100 * be some limit enforced by BLK_BATCH_TIME.
1102 if (ioc_batching(q
, ioc
))
1103 ioc
->nr_batch_requests
--;
1105 trace_block_getrq(q
, bio
, rw_flags
& 1);
1110 * elvpriv init failed. ioc, icq and elvpriv aren't mempool backed
1111 * and may fail indefinitely under memory pressure and thus
1112 * shouldn't stall IO. Treat this request as !elvpriv. This will
1113 * disturb iosched and blkcg but weird is bettern than dead.
1115 printk_ratelimited(KERN_WARNING
"%s: dev %s: request aux data allocation failed, iosched may be disturbed\n",
1116 __func__
, dev_name(q
->backing_dev_info
.dev
));
1118 rq
->cmd_flags
&= ~REQ_ELVPRIV
;
1121 spin_lock_irq(q
->queue_lock
);
1122 q
->nr_rqs_elvpriv
--;
1123 spin_unlock_irq(q
->queue_lock
);
1128 * Allocation failed presumably due to memory. Undo anything we
1129 * might have messed up.
1131 * Allocating task should really be put onto the front of the wait
1132 * queue, but this is pretty rare.
1134 spin_lock_irq(q
->queue_lock
);
1135 freed_request(rl
, rw_flags
);
1138 * in the very unlikely event that allocation failed and no
1139 * requests for this direction was pending, mark us starved so that
1140 * freeing of a request in the other direction will notice
1141 * us. another possible fix would be to split the rq mempool into
1145 if (unlikely(rl
->count
[is_sync
] == 0))
1146 rl
->starved
[is_sync
] = 1;
1147 return ERR_PTR(-ENOMEM
);
1151 * get_request - get a free request
1152 * @q: request_queue to allocate request from
1153 * @rw_flags: RW and SYNC flags
1154 * @bio: bio to allocate request for (can be %NULL)
1155 * @gfp_mask: allocation mask
1157 * Get a free request from @q. If %__GFP_WAIT is set in @gfp_mask, this
1158 * function keeps retrying under memory pressure and fails iff @q is dead.
1160 * Must be called with @q->queue_lock held and,
1161 * Returns ERR_PTR on failure, with @q->queue_lock held.
1162 * Returns request pointer on success, with @q->queue_lock *not held*.
1164 static struct request
*get_request(struct request_queue
*q
, int rw_flags
,
1165 struct bio
*bio
, gfp_t gfp_mask
)
1167 const bool is_sync
= rw_is_sync(rw_flags
) != 0;
1169 struct request_list
*rl
;
1172 rl
= blk_get_rl(q
, bio
); /* transferred to @rq on success */
1174 rq
= __get_request(rl
, rw_flags
, bio
, gfp_mask
);
1178 if (!(gfp_mask
& __GFP_WAIT
) || unlikely(blk_queue_dying(q
))) {
1183 /* wait on @rl and retry */
1184 prepare_to_wait_exclusive(&rl
->wait
[is_sync
], &wait
,
1185 TASK_UNINTERRUPTIBLE
);
1187 trace_block_sleeprq(q
, bio
, rw_flags
& 1);
1189 spin_unlock_irq(q
->queue_lock
);
1193 * After sleeping, we become a "batching" process and will be able
1194 * to allocate at least one request, and up to a big batch of them
1195 * for a small period time. See ioc_batching, ioc_set_batching
1197 ioc_set_batching(q
, current
->io_context
);
1199 spin_lock_irq(q
->queue_lock
);
1200 finish_wait(&rl
->wait
[is_sync
], &wait
);
1205 static struct request
*blk_old_get_request(struct request_queue
*q
, int rw
,
1210 BUG_ON(rw
!= READ
&& rw
!= WRITE
);
1212 /* create ioc upfront */
1213 create_io_context(gfp_mask
, q
->node
);
1215 spin_lock_irq(q
->queue_lock
);
1216 rq
= get_request(q
, rw
, NULL
, gfp_mask
);
1218 spin_unlock_irq(q
->queue_lock
);
1219 /* q->queue_lock is unlocked at this point */
1224 struct request
*blk_get_request(struct request_queue
*q
, int rw
, gfp_t gfp_mask
)
1227 return blk_mq_alloc_request(q
, rw
, gfp_mask
, false);
1229 return blk_old_get_request(q
, rw
, gfp_mask
);
1231 EXPORT_SYMBOL(blk_get_request
);
1234 * blk_make_request - given a bio, allocate a corresponding struct request.
1235 * @q: target request queue
1236 * @bio: The bio describing the memory mappings that will be submitted for IO.
1237 * It may be a chained-bio properly constructed by block/bio layer.
1238 * @gfp_mask: gfp flags to be used for memory allocation
1240 * blk_make_request is the parallel of generic_make_request for BLOCK_PC
1241 * type commands. Where the struct request needs to be farther initialized by
1242 * the caller. It is passed a &struct bio, which describes the memory info of
1245 * The caller of blk_make_request must make sure that bi_io_vec
1246 * are set to describe the memory buffers. That bio_data_dir() will return
1247 * the needed direction of the request. (And all bio's in the passed bio-chain
1248 * are properly set accordingly)
1250 * If called under none-sleepable conditions, mapped bio buffers must not
1251 * need bouncing, by calling the appropriate masked or flagged allocator,
1252 * suitable for the target device. Otherwise the call to blk_queue_bounce will
1255 * WARNING: When allocating/cloning a bio-chain, careful consideration should be
1256 * given to how you allocate bios. In particular, you cannot use __GFP_WAIT for
1257 * anything but the first bio in the chain. Otherwise you risk waiting for IO
1258 * completion of a bio that hasn't been submitted yet, thus resulting in a
1259 * deadlock. Alternatively bios should be allocated using bio_kmalloc() instead
1260 * of bio_alloc(), as that avoids the mempool deadlock.
1261 * If possible a big IO should be split into smaller parts when allocation
1262 * fails. Partial allocation should not be an error, or you risk a live-lock.
1264 struct request
*blk_make_request(struct request_queue
*q
, struct bio
*bio
,
1267 struct request
*rq
= blk_get_request(q
, bio_data_dir(bio
), gfp_mask
);
1272 blk_rq_set_block_pc(rq
);
1275 struct bio
*bounce_bio
= bio
;
1278 blk_queue_bounce(q
, &bounce_bio
);
1279 ret
= blk_rq_append_bio(q
, rq
, bounce_bio
);
1280 if (unlikely(ret
)) {
1281 blk_put_request(rq
);
1282 return ERR_PTR(ret
);
1288 EXPORT_SYMBOL(blk_make_request
);
1291 * blk_rq_set_block_pc - initialize a request to type BLOCK_PC
1292 * @rq: request to be initialized
1295 void blk_rq_set_block_pc(struct request
*rq
)
1297 rq
->cmd_type
= REQ_TYPE_BLOCK_PC
;
1299 rq
->__sector
= (sector_t
) -1;
1300 rq
->bio
= rq
->biotail
= NULL
;
1301 memset(rq
->__cmd
, 0, sizeof(rq
->__cmd
));
1303 EXPORT_SYMBOL(blk_rq_set_block_pc
);
1306 * blk_requeue_request - put a request back on queue
1307 * @q: request queue where request should be inserted
1308 * @rq: request to be inserted
1311 * Drivers often keep queueing requests until the hardware cannot accept
1312 * more, when that condition happens we need to put the request back
1313 * on the queue. Must be called with queue lock held.
1315 void blk_requeue_request(struct request_queue
*q
, struct request
*rq
)
1317 blk_delete_timer(rq
);
1318 blk_clear_rq_complete(rq
);
1319 trace_block_rq_requeue(q
, rq
);
1321 if (rq
->cmd_flags
& REQ_QUEUED
)
1322 blk_queue_end_tag(q
, rq
);
1324 BUG_ON(blk_queued_rq(rq
));
1326 elv_requeue_request(q
, rq
);
1328 EXPORT_SYMBOL(blk_requeue_request
);
1330 static void add_acct_request(struct request_queue
*q
, struct request
*rq
,
1333 blk_account_io_start(rq
, true);
1334 __elv_add_request(q
, rq
, where
);
1337 static void part_round_stats_single(int cpu
, struct hd_struct
*part
,
1342 if (now
== part
->stamp
)
1345 inflight
= part_in_flight(part
);
1347 __part_stat_add(cpu
, part
, time_in_queue
,
1348 inflight
* (now
- part
->stamp
));
1349 __part_stat_add(cpu
, part
, io_ticks
, (now
- part
->stamp
));
1355 * part_round_stats() - Round off the performance stats on a struct disk_stats.
1356 * @cpu: cpu number for stats access
1357 * @part: target partition
1359 * The average IO queue length and utilisation statistics are maintained
1360 * by observing the current state of the queue length and the amount of
1361 * time it has been in this state for.
1363 * Normally, that accounting is done on IO completion, but that can result
1364 * in more than a second's worth of IO being accounted for within any one
1365 * second, leading to >100% utilisation. To deal with that, we call this
1366 * function to do a round-off before returning the results when reading
1367 * /proc/diskstats. This accounts immediately for all queue usage up to
1368 * the current jiffies and restarts the counters again.
1370 void part_round_stats(int cpu
, struct hd_struct
*part
)
1372 unsigned long now
= jiffies
;
1375 part_round_stats_single(cpu
, &part_to_disk(part
)->part0
, now
);
1376 part_round_stats_single(cpu
, part
, now
);
1378 EXPORT_SYMBOL_GPL(part_round_stats
);
1381 static void blk_pm_put_request(struct request
*rq
)
1383 if (rq
->q
->dev
&& !(rq
->cmd_flags
& REQ_PM
) && !--rq
->q
->nr_pending
)
1384 pm_runtime_mark_last_busy(rq
->q
->dev
);
1387 static inline void blk_pm_put_request(struct request
*rq
) {}
1391 * queue lock must be held
1393 void __blk_put_request(struct request_queue
*q
, struct request
*req
)
1399 blk_mq_free_request(req
);
1403 blk_pm_put_request(req
);
1405 elv_completed_request(q
, req
);
1407 /* this is a bio leak */
1408 WARN_ON(req
->bio
!= NULL
);
1411 * Request may not have originated from ll_rw_blk. if not,
1412 * it didn't come out of our reserved rq pools
1414 if (req
->cmd_flags
& REQ_ALLOCED
) {
1415 unsigned int flags
= req
->cmd_flags
;
1416 struct request_list
*rl
= blk_rq_rl(req
);
1418 BUG_ON(!list_empty(&req
->queuelist
));
1419 BUG_ON(ELV_ON_HASH(req
));
1421 blk_free_request(rl
, req
);
1422 freed_request(rl
, flags
);
1426 EXPORT_SYMBOL_GPL(__blk_put_request
);
1428 void blk_put_request(struct request
*req
)
1430 struct request_queue
*q
= req
->q
;
1433 blk_mq_free_request(req
);
1435 unsigned long flags
;
1437 spin_lock_irqsave(q
->queue_lock
, flags
);
1438 __blk_put_request(q
, req
);
1439 spin_unlock_irqrestore(q
->queue_lock
, flags
);
1442 EXPORT_SYMBOL(blk_put_request
);
1445 * blk_add_request_payload - add a payload to a request
1446 * @rq: request to update
1447 * @page: page backing the payload
1448 * @len: length of the payload.
1450 * This allows to later add a payload to an already submitted request by
1451 * a block driver. The driver needs to take care of freeing the payload
1454 * Note that this is a quite horrible hack and nothing but handling of
1455 * discard requests should ever use it.
1457 void blk_add_request_payload(struct request
*rq
, struct page
*page
,
1460 struct bio
*bio
= rq
->bio
;
1462 bio
->bi_io_vec
->bv_page
= page
;
1463 bio
->bi_io_vec
->bv_offset
= 0;
1464 bio
->bi_io_vec
->bv_len
= len
;
1466 bio
->bi_iter
.bi_size
= len
;
1468 bio
->bi_phys_segments
= 1;
1470 rq
->__data_len
= rq
->resid_len
= len
;
1471 rq
->nr_phys_segments
= 1;
1473 EXPORT_SYMBOL_GPL(blk_add_request_payload
);
1475 bool bio_attempt_back_merge(struct request_queue
*q
, struct request
*req
,
1478 const int ff
= bio
->bi_rw
& REQ_FAILFAST_MASK
;
1480 if (!ll_back_merge_fn(q
, req
, bio
))
1483 trace_block_bio_backmerge(q
, req
, bio
);
1485 if ((req
->cmd_flags
& REQ_FAILFAST_MASK
) != ff
)
1486 blk_rq_set_mixed_merge(req
);
1488 req
->biotail
->bi_next
= bio
;
1490 req
->__data_len
+= bio
->bi_iter
.bi_size
;
1491 req
->ioprio
= ioprio_best(req
->ioprio
, bio_prio(bio
));
1493 blk_account_io_start(req
, false);
1497 bool bio_attempt_front_merge(struct request_queue
*q
, struct request
*req
,
1500 const int ff
= bio
->bi_rw
& REQ_FAILFAST_MASK
;
1502 if (!ll_front_merge_fn(q
, req
, bio
))
1505 trace_block_bio_frontmerge(q
, req
, bio
);
1507 if ((req
->cmd_flags
& REQ_FAILFAST_MASK
) != ff
)
1508 blk_rq_set_mixed_merge(req
);
1510 bio
->bi_next
= req
->bio
;
1513 req
->__sector
= bio
->bi_iter
.bi_sector
;
1514 req
->__data_len
+= bio
->bi_iter
.bi_size
;
1515 req
->ioprio
= ioprio_best(req
->ioprio
, bio_prio(bio
));
1517 blk_account_io_start(req
, false);
1522 * blk_attempt_plug_merge - try to merge with %current's plugged list
1523 * @q: request_queue new bio is being queued at
1524 * @bio: new bio being queued
1525 * @request_count: out parameter for number of traversed plugged requests
1527 * Determine whether @bio being queued on @q can be merged with a request
1528 * on %current's plugged list. Returns %true if merge was successful,
1531 * Plugging coalesces IOs from the same issuer for the same purpose without
1532 * going through @q->queue_lock. As such it's more of an issuing mechanism
1533 * than scheduling, and the request, while may have elvpriv data, is not
1534 * added on the elevator at this point. In addition, we don't have
1535 * reliable access to the elevator outside queue lock. Only check basic
1536 * merging parameters without querying the elevator.
1538 * Caller must ensure !blk_queue_nomerges(q) beforehand.
1540 bool blk_attempt_plug_merge(struct request_queue
*q
, struct bio
*bio
,
1541 unsigned int *request_count
,
1542 struct request
**same_queue_rq
)
1544 struct blk_plug
*plug
;
1547 struct list_head
*plug_list
;
1549 plug
= current
->plug
;
1555 plug_list
= &plug
->mq_list
;
1557 plug_list
= &plug
->list
;
1559 list_for_each_entry_reverse(rq
, plug_list
, queuelist
) {
1565 * Only blk-mq multiple hardware queues case checks the
1566 * rq in the same queue, there should be only one such
1570 *same_queue_rq
= rq
;
1573 if (rq
->q
!= q
|| !blk_rq_merge_ok(rq
, bio
))
1576 el_ret
= blk_try_merge(rq
, bio
);
1577 if (el_ret
== ELEVATOR_BACK_MERGE
) {
1578 ret
= bio_attempt_back_merge(q
, rq
, bio
);
1581 } else if (el_ret
== ELEVATOR_FRONT_MERGE
) {
1582 ret
= bio_attempt_front_merge(q
, rq
, bio
);
1591 void init_request_from_bio(struct request
*req
, struct bio
*bio
)
1593 req
->cmd_type
= REQ_TYPE_FS
;
1595 req
->cmd_flags
|= bio
->bi_rw
& REQ_COMMON_MASK
;
1596 if (bio
->bi_rw
& REQ_RAHEAD
)
1597 req
->cmd_flags
|= REQ_FAILFAST_MASK
;
1600 req
->__sector
= bio
->bi_iter
.bi_sector
;
1601 req
->ioprio
= bio_prio(bio
);
1602 blk_rq_bio_prep(req
->q
, req
, bio
);
1605 static void blk_queue_bio(struct request_queue
*q
, struct bio
*bio
)
1607 const bool sync
= !!(bio
->bi_rw
& REQ_SYNC
);
1608 struct blk_plug
*plug
;
1609 int el_ret
, rw_flags
, where
= ELEVATOR_INSERT_SORT
;
1610 struct request
*req
;
1611 unsigned int request_count
= 0;
1614 * low level driver can indicate that it wants pages above a
1615 * certain limit bounced to low memory (ie for highmem, or even
1616 * ISA dma in theory)
1618 blk_queue_bounce(q
, &bio
);
1620 if (bio_integrity_enabled(bio
) && bio_integrity_prep(bio
)) {
1621 bio
->bi_error
= -EIO
;
1626 if (bio
->bi_rw
& (REQ_FLUSH
| REQ_FUA
)) {
1627 spin_lock_irq(q
->queue_lock
);
1628 where
= ELEVATOR_INSERT_FLUSH
;
1633 * Check if we can merge with the plugged list before grabbing
1636 if (!blk_queue_nomerges(q
) &&
1637 blk_attempt_plug_merge(q
, bio
, &request_count
, NULL
))
1640 spin_lock_irq(q
->queue_lock
);
1642 el_ret
= elv_merge(q
, &req
, bio
);
1643 if (el_ret
== ELEVATOR_BACK_MERGE
) {
1644 if (bio_attempt_back_merge(q
, req
, bio
)) {
1645 elv_bio_merged(q
, req
, bio
);
1646 if (!attempt_back_merge(q
, req
))
1647 elv_merged_request(q
, req
, el_ret
);
1650 } else if (el_ret
== ELEVATOR_FRONT_MERGE
) {
1651 if (bio_attempt_front_merge(q
, req
, bio
)) {
1652 elv_bio_merged(q
, req
, bio
);
1653 if (!attempt_front_merge(q
, req
))
1654 elv_merged_request(q
, req
, el_ret
);
1661 * This sync check and mask will be re-done in init_request_from_bio(),
1662 * but we need to set it earlier to expose the sync flag to the
1663 * rq allocator and io schedulers.
1665 rw_flags
= bio_data_dir(bio
);
1667 rw_flags
|= REQ_SYNC
;
1670 * Grab a free request. This is might sleep but can not fail.
1671 * Returns with the queue unlocked.
1673 req
= get_request(q
, rw_flags
, bio
, GFP_NOIO
);
1675 bio
->bi_error
= PTR_ERR(req
);
1681 * After dropping the lock and possibly sleeping here, our request
1682 * may now be mergeable after it had proven unmergeable (above).
1683 * We don't worry about that case for efficiency. It won't happen
1684 * often, and the elevators are able to handle it.
1686 init_request_from_bio(req
, bio
);
1688 if (test_bit(QUEUE_FLAG_SAME_COMP
, &q
->queue_flags
))
1689 req
->cpu
= raw_smp_processor_id();
1691 plug
= current
->plug
;
1694 * If this is the first request added after a plug, fire
1698 trace_block_plug(q
);
1700 if (request_count
>= BLK_MAX_REQUEST_COUNT
) {
1701 blk_flush_plug_list(plug
, false);
1702 trace_block_plug(q
);
1705 list_add_tail(&req
->queuelist
, &plug
->list
);
1706 blk_account_io_start(req
, true);
1708 spin_lock_irq(q
->queue_lock
);
1709 add_acct_request(q
, req
, where
);
1712 spin_unlock_irq(q
->queue_lock
);
1717 * If bio->bi_dev is a partition, remap the location
1719 static inline void blk_partition_remap(struct bio
*bio
)
1721 struct block_device
*bdev
= bio
->bi_bdev
;
1723 if (bio_sectors(bio
) && bdev
!= bdev
->bd_contains
) {
1724 struct hd_struct
*p
= bdev
->bd_part
;
1726 bio
->bi_iter
.bi_sector
+= p
->start_sect
;
1727 bio
->bi_bdev
= bdev
->bd_contains
;
1729 trace_block_bio_remap(bdev_get_queue(bio
->bi_bdev
), bio
,
1731 bio
->bi_iter
.bi_sector
- p
->start_sect
);
1735 static void handle_bad_sector(struct bio
*bio
)
1737 char b
[BDEVNAME_SIZE
];
1739 printk(KERN_INFO
"attempt to access beyond end of device\n");
1740 printk(KERN_INFO
"%s: rw=%ld, want=%Lu, limit=%Lu\n",
1741 bdevname(bio
->bi_bdev
, b
),
1743 (unsigned long long)bio_end_sector(bio
),
1744 (long long)(i_size_read(bio
->bi_bdev
->bd_inode
) >> 9));
1747 #ifdef CONFIG_FAIL_MAKE_REQUEST
1749 static DECLARE_FAULT_ATTR(fail_make_request
);
1751 static int __init
setup_fail_make_request(char *str
)
1753 return setup_fault_attr(&fail_make_request
, str
);
1755 __setup("fail_make_request=", setup_fail_make_request
);
1757 static bool should_fail_request(struct hd_struct
*part
, unsigned int bytes
)
1759 return part
->make_it_fail
&& should_fail(&fail_make_request
, bytes
);
1762 static int __init
fail_make_request_debugfs(void)
1764 struct dentry
*dir
= fault_create_debugfs_attr("fail_make_request",
1765 NULL
, &fail_make_request
);
1767 return PTR_ERR_OR_ZERO(dir
);
1770 late_initcall(fail_make_request_debugfs
);
1772 #else /* CONFIG_FAIL_MAKE_REQUEST */
1774 static inline bool should_fail_request(struct hd_struct
*part
,
1780 #endif /* CONFIG_FAIL_MAKE_REQUEST */
1783 * Check whether this bio extends beyond the end of the device.
1785 static inline int bio_check_eod(struct bio
*bio
, unsigned int nr_sectors
)
1792 /* Test device or partition size, when known. */
1793 maxsector
= i_size_read(bio
->bi_bdev
->bd_inode
) >> 9;
1795 sector_t sector
= bio
->bi_iter
.bi_sector
;
1797 if (maxsector
< nr_sectors
|| maxsector
- nr_sectors
< sector
) {
1799 * This may well happen - the kernel calls bread()
1800 * without checking the size of the device, e.g., when
1801 * mounting a device.
1803 handle_bad_sector(bio
);
1811 static noinline_for_stack
bool
1812 generic_make_request_checks(struct bio
*bio
)
1814 struct request_queue
*q
;
1815 int nr_sectors
= bio_sectors(bio
);
1817 char b
[BDEVNAME_SIZE
];
1818 struct hd_struct
*part
;
1822 if (bio_check_eod(bio
, nr_sectors
))
1825 q
= bdev_get_queue(bio
->bi_bdev
);
1828 "generic_make_request: Trying to access "
1829 "nonexistent block-device %s (%Lu)\n",
1830 bdevname(bio
->bi_bdev
, b
),
1831 (long long) bio
->bi_iter
.bi_sector
);
1835 if (likely(bio_is_rw(bio
) &&
1836 nr_sectors
> queue_max_hw_sectors(q
))) {
1837 printk(KERN_ERR
"bio too big device %s (%u > %u)\n",
1838 bdevname(bio
->bi_bdev
, b
),
1840 queue_max_hw_sectors(q
));
1844 part
= bio
->bi_bdev
->bd_part
;
1845 if (should_fail_request(part
, bio
->bi_iter
.bi_size
) ||
1846 should_fail_request(&part_to_disk(part
)->part0
,
1847 bio
->bi_iter
.bi_size
))
1851 * If this device has partitions, remap block n
1852 * of partition p to block n+start(p) of the disk.
1854 blk_partition_remap(bio
);
1856 if (bio_check_eod(bio
, nr_sectors
))
1860 * Filter flush bio's early so that make_request based
1861 * drivers without flush support don't have to worry
1864 if ((bio
->bi_rw
& (REQ_FLUSH
| REQ_FUA
)) && !q
->flush_flags
) {
1865 bio
->bi_rw
&= ~(REQ_FLUSH
| REQ_FUA
);
1872 if ((bio
->bi_rw
& REQ_DISCARD
) &&
1873 (!blk_queue_discard(q
) ||
1874 ((bio
->bi_rw
& REQ_SECURE
) && !blk_queue_secdiscard(q
)))) {
1879 if (bio
->bi_rw
& REQ_WRITE_SAME
&& !bdev_write_same(bio
->bi_bdev
)) {
1885 * Various block parts want %current->io_context and lazy ioc
1886 * allocation ends up trading a lot of pain for a small amount of
1887 * memory. Just allocate it upfront. This may fail and block
1888 * layer knows how to live with it.
1890 create_io_context(GFP_ATOMIC
, q
->node
);
1892 if (blk_throtl_bio(q
, bio
))
1893 return false; /* throttled, will be resubmitted later */
1895 trace_block_bio_queue(q
, bio
);
1899 bio
->bi_error
= err
;
1905 * generic_make_request - hand a buffer to its device driver for I/O
1906 * @bio: The bio describing the location in memory and on the device.
1908 * generic_make_request() is used to make I/O requests of block
1909 * devices. It is passed a &struct bio, which describes the I/O that needs
1912 * generic_make_request() does not return any status. The
1913 * success/failure status of the request, along with notification of
1914 * completion, is delivered asynchronously through the bio->bi_end_io
1915 * function described (one day) else where.
1917 * The caller of generic_make_request must make sure that bi_io_vec
1918 * are set to describe the memory buffer, and that bi_dev and bi_sector are
1919 * set to describe the device address, and the
1920 * bi_end_io and optionally bi_private are set to describe how
1921 * completion notification should be signaled.
1923 * generic_make_request and the drivers it calls may use bi_next if this
1924 * bio happens to be merged with someone else, and may resubmit the bio to
1925 * a lower device by calling into generic_make_request recursively, which
1926 * means the bio should NOT be touched after the call to ->make_request_fn.
1928 void generic_make_request(struct bio
*bio
)
1930 struct bio_list bio_list_on_stack
;
1932 if (!generic_make_request_checks(bio
))
1936 * We only want one ->make_request_fn to be active at a time, else
1937 * stack usage with stacked devices could be a problem. So use
1938 * current->bio_list to keep a list of requests submited by a
1939 * make_request_fn function. current->bio_list is also used as a
1940 * flag to say if generic_make_request is currently active in this
1941 * task or not. If it is NULL, then no make_request is active. If
1942 * it is non-NULL, then a make_request is active, and new requests
1943 * should be added at the tail
1945 if (current
->bio_list
) {
1946 bio_list_add(current
->bio_list
, bio
);
1950 /* following loop may be a bit non-obvious, and so deserves some
1952 * Before entering the loop, bio->bi_next is NULL (as all callers
1953 * ensure that) so we have a list with a single bio.
1954 * We pretend that we have just taken it off a longer list, so
1955 * we assign bio_list to a pointer to the bio_list_on_stack,
1956 * thus initialising the bio_list of new bios to be
1957 * added. ->make_request() may indeed add some more bios
1958 * through a recursive call to generic_make_request. If it
1959 * did, we find a non-NULL value in bio_list and re-enter the loop
1960 * from the top. In this case we really did just take the bio
1961 * of the top of the list (no pretending) and so remove it from
1962 * bio_list, and call into ->make_request() again.
1964 BUG_ON(bio
->bi_next
);
1965 bio_list_init(&bio_list_on_stack
);
1966 current
->bio_list
= &bio_list_on_stack
;
1968 struct request_queue
*q
= bdev_get_queue(bio
->bi_bdev
);
1970 q
->make_request_fn(q
, bio
);
1972 bio
= bio_list_pop(current
->bio_list
);
1974 current
->bio_list
= NULL
; /* deactivate */
1976 EXPORT_SYMBOL(generic_make_request
);
1979 * submit_bio - submit a bio to the block device layer for I/O
1980 * @rw: whether to %READ or %WRITE, or maybe to %READA (read ahead)
1981 * @bio: The &struct bio which describes the I/O
1983 * submit_bio() is very similar in purpose to generic_make_request(), and
1984 * uses that function to do most of the work. Both are fairly rough
1985 * interfaces; @bio must be presetup and ready for I/O.
1988 void submit_bio(int rw
, struct bio
*bio
)
1993 * If it's a regular read/write or a barrier with data attached,
1994 * go through the normal accounting stuff before submission.
1996 if (bio_has_data(bio
)) {
1999 if (unlikely(rw
& REQ_WRITE_SAME
))
2000 count
= bdev_logical_block_size(bio
->bi_bdev
) >> 9;
2002 count
= bio_sectors(bio
);
2005 count_vm_events(PGPGOUT
, count
);
2007 task_io_account_read(bio
->bi_iter
.bi_size
);
2008 count_vm_events(PGPGIN
, count
);
2011 if (unlikely(block_dump
)) {
2012 char b
[BDEVNAME_SIZE
];
2013 printk(KERN_DEBUG
"%s(%d): %s block %Lu on %s (%u sectors)\n",
2014 current
->comm
, task_pid_nr(current
),
2015 (rw
& WRITE
) ? "WRITE" : "READ",
2016 (unsigned long long)bio
->bi_iter
.bi_sector
,
2017 bdevname(bio
->bi_bdev
, b
),
2022 generic_make_request(bio
);
2024 EXPORT_SYMBOL(submit_bio
);
2027 * blk_rq_check_limits - Helper function to check a request for the queue limit
2029 * @rq: the request being checked
2032 * @rq may have been made based on weaker limitations of upper-level queues
2033 * in request stacking drivers, and it may violate the limitation of @q.
2034 * Since the block layer and the underlying device driver trust @rq
2035 * after it is inserted to @q, it should be checked against @q before
2036 * the insertion using this generic function.
2038 * This function should also be useful for request stacking drivers
2039 * in some cases below, so export this function.
2040 * Request stacking drivers like request-based dm may change the queue
2041 * limits while requests are in the queue (e.g. dm's table swapping).
2042 * Such request stacking drivers should check those requests against
2043 * the new queue limits again when they dispatch those requests,
2044 * although such checkings are also done against the old queue limits
2045 * when submitting requests.
2047 int blk_rq_check_limits(struct request_queue
*q
, struct request
*rq
)
2049 if (!rq_mergeable(rq
))
2052 if (blk_rq_sectors(rq
) > blk_queue_get_max_sectors(q
, rq
->cmd_flags
)) {
2053 printk(KERN_ERR
"%s: over max size limit.\n", __func__
);
2058 * queue's settings related to segment counting like q->bounce_pfn
2059 * may differ from that of other stacking queues.
2060 * Recalculate it to check the request correctly on this queue's
2063 blk_recalc_rq_segments(rq
);
2064 if (rq
->nr_phys_segments
> queue_max_segments(q
)) {
2065 printk(KERN_ERR
"%s: over max segments limit.\n", __func__
);
2071 EXPORT_SYMBOL_GPL(blk_rq_check_limits
);
2074 * blk_insert_cloned_request - Helper for stacking drivers to submit a request
2075 * @q: the queue to submit the request
2076 * @rq: the request being queued
2078 int blk_insert_cloned_request(struct request_queue
*q
, struct request
*rq
)
2080 unsigned long flags
;
2081 int where
= ELEVATOR_INSERT_BACK
;
2083 if (blk_rq_check_limits(q
, rq
))
2087 should_fail_request(&rq
->rq_disk
->part0
, blk_rq_bytes(rq
)))
2091 if (blk_queue_io_stat(q
))
2092 blk_account_io_start(rq
, true);
2093 blk_mq_insert_request(rq
, false, true, true);
2097 spin_lock_irqsave(q
->queue_lock
, flags
);
2098 if (unlikely(blk_queue_dying(q
))) {
2099 spin_unlock_irqrestore(q
->queue_lock
, flags
);
2104 * Submitting request must be dequeued before calling this function
2105 * because it will be linked to another request_queue
2107 BUG_ON(blk_queued_rq(rq
));
2109 if (rq
->cmd_flags
& (REQ_FLUSH
|REQ_FUA
))
2110 where
= ELEVATOR_INSERT_FLUSH
;
2112 add_acct_request(q
, rq
, where
);
2113 if (where
== ELEVATOR_INSERT_FLUSH
)
2115 spin_unlock_irqrestore(q
->queue_lock
, flags
);
2119 EXPORT_SYMBOL_GPL(blk_insert_cloned_request
);
2122 * blk_rq_err_bytes - determine number of bytes till the next failure boundary
2123 * @rq: request to examine
2126 * A request could be merge of IOs which require different failure
2127 * handling. This function determines the number of bytes which
2128 * can be failed from the beginning of the request without
2129 * crossing into area which need to be retried further.
2132 * The number of bytes to fail.
2135 * queue_lock must be held.
2137 unsigned int blk_rq_err_bytes(const struct request
*rq
)
2139 unsigned int ff
= rq
->cmd_flags
& REQ_FAILFAST_MASK
;
2140 unsigned int bytes
= 0;
2143 if (!(rq
->cmd_flags
& REQ_MIXED_MERGE
))
2144 return blk_rq_bytes(rq
);
2147 * Currently the only 'mixing' which can happen is between
2148 * different fastfail types. We can safely fail portions
2149 * which have all the failfast bits that the first one has -
2150 * the ones which are at least as eager to fail as the first
2153 for (bio
= rq
->bio
; bio
; bio
= bio
->bi_next
) {
2154 if ((bio
->bi_rw
& ff
) != ff
)
2156 bytes
+= bio
->bi_iter
.bi_size
;
2159 /* this could lead to infinite loop */
2160 BUG_ON(blk_rq_bytes(rq
) && !bytes
);
2163 EXPORT_SYMBOL_GPL(blk_rq_err_bytes
);
2165 void blk_account_io_completion(struct request
*req
, unsigned int bytes
)
2167 if (blk_do_io_stat(req
)) {
2168 const int rw
= rq_data_dir(req
);
2169 struct hd_struct
*part
;
2172 cpu
= part_stat_lock();
2174 part_stat_add(cpu
, part
, sectors
[rw
], bytes
>> 9);
2179 void blk_account_io_done(struct request
*req
)
2182 * Account IO completion. flush_rq isn't accounted as a
2183 * normal IO on queueing nor completion. Accounting the
2184 * containing request is enough.
2186 if (blk_do_io_stat(req
) && !(req
->cmd_flags
& REQ_FLUSH_SEQ
)) {
2187 unsigned long duration
= jiffies
- req
->start_time
;
2188 const int rw
= rq_data_dir(req
);
2189 struct hd_struct
*part
;
2192 cpu
= part_stat_lock();
2195 part_stat_inc(cpu
, part
, ios
[rw
]);
2196 part_stat_add(cpu
, part
, ticks
[rw
], duration
);
2197 part_round_stats(cpu
, part
);
2198 part_dec_in_flight(part
, rw
);
2200 hd_struct_put(part
);
2207 * Don't process normal requests when queue is suspended
2208 * or in the process of suspending/resuming
2210 static struct request
*blk_pm_peek_request(struct request_queue
*q
,
2213 if (q
->dev
&& (q
->rpm_status
== RPM_SUSPENDED
||
2214 (q
->rpm_status
!= RPM_ACTIVE
&& !(rq
->cmd_flags
& REQ_PM
))))
2220 static inline struct request
*blk_pm_peek_request(struct request_queue
*q
,
2227 void blk_account_io_start(struct request
*rq
, bool new_io
)
2229 struct hd_struct
*part
;
2230 int rw
= rq_data_dir(rq
);
2233 if (!blk_do_io_stat(rq
))
2236 cpu
= part_stat_lock();
2240 part_stat_inc(cpu
, part
, merges
[rw
]);
2242 part
= disk_map_sector_rcu(rq
->rq_disk
, blk_rq_pos(rq
));
2243 if (!hd_struct_try_get(part
)) {
2245 * The partition is already being removed,
2246 * the request will be accounted on the disk only
2248 * We take a reference on disk->part0 although that
2249 * partition will never be deleted, so we can treat
2250 * it as any other partition.
2252 part
= &rq
->rq_disk
->part0
;
2253 hd_struct_get(part
);
2255 part_round_stats(cpu
, part
);
2256 part_inc_in_flight(part
, rw
);
2264 * blk_peek_request - peek at the top of a request queue
2265 * @q: request queue to peek at
2268 * Return the request at the top of @q. The returned request
2269 * should be started using blk_start_request() before LLD starts
2273 * Pointer to the request at the top of @q if available. Null
2277 * queue_lock must be held.
2279 struct request
*blk_peek_request(struct request_queue
*q
)
2284 while ((rq
= __elv_next_request(q
)) != NULL
) {
2286 rq
= blk_pm_peek_request(q
, rq
);
2290 if (!(rq
->cmd_flags
& REQ_STARTED
)) {
2292 * This is the first time the device driver
2293 * sees this request (possibly after
2294 * requeueing). Notify IO scheduler.
2296 if (rq
->cmd_flags
& REQ_SORTED
)
2297 elv_activate_rq(q
, rq
);
2300 * just mark as started even if we don't start
2301 * it, a request that has been delayed should
2302 * not be passed by new incoming requests
2304 rq
->cmd_flags
|= REQ_STARTED
;
2305 trace_block_rq_issue(q
, rq
);
2308 if (!q
->boundary_rq
|| q
->boundary_rq
== rq
) {
2309 q
->end_sector
= rq_end_sector(rq
);
2310 q
->boundary_rq
= NULL
;
2313 if (rq
->cmd_flags
& REQ_DONTPREP
)
2316 if (q
->dma_drain_size
&& blk_rq_bytes(rq
)) {
2318 * make sure space for the drain appears we
2319 * know we can do this because max_hw_segments
2320 * has been adjusted to be one fewer than the
2323 rq
->nr_phys_segments
++;
2329 ret
= q
->prep_rq_fn(q
, rq
);
2330 if (ret
== BLKPREP_OK
) {
2332 } else if (ret
== BLKPREP_DEFER
) {
2334 * the request may have been (partially) prepped.
2335 * we need to keep this request in the front to
2336 * avoid resource deadlock. REQ_STARTED will
2337 * prevent other fs requests from passing this one.
2339 if (q
->dma_drain_size
&& blk_rq_bytes(rq
) &&
2340 !(rq
->cmd_flags
& REQ_DONTPREP
)) {
2342 * remove the space for the drain we added
2343 * so that we don't add it again
2345 --rq
->nr_phys_segments
;
2350 } else if (ret
== BLKPREP_KILL
) {
2351 rq
->cmd_flags
|= REQ_QUIET
;
2353 * Mark this request as started so we don't trigger
2354 * any debug logic in the end I/O path.
2356 blk_start_request(rq
);
2357 __blk_end_request_all(rq
, -EIO
);
2359 printk(KERN_ERR
"%s: bad return=%d\n", __func__
, ret
);
2366 EXPORT_SYMBOL(blk_peek_request
);
2368 void blk_dequeue_request(struct request
*rq
)
2370 struct request_queue
*q
= rq
->q
;
2372 BUG_ON(list_empty(&rq
->queuelist
));
2373 BUG_ON(ELV_ON_HASH(rq
));
2375 list_del_init(&rq
->queuelist
);
2378 * the time frame between a request being removed from the lists
2379 * and to it is freed is accounted as io that is in progress at
2382 if (blk_account_rq(rq
)) {
2383 q
->in_flight
[rq_is_sync(rq
)]++;
2384 set_io_start_time_ns(rq
);
2389 * blk_start_request - start request processing on the driver
2390 * @req: request to dequeue
2393 * Dequeue @req and start timeout timer on it. This hands off the
2394 * request to the driver.
2396 * Block internal functions which don't want to start timer should
2397 * call blk_dequeue_request().
2400 * queue_lock must be held.
2402 void blk_start_request(struct request
*req
)
2404 blk_dequeue_request(req
);
2407 * We are now handing the request to the hardware, initialize
2408 * resid_len to full count and add the timeout handler.
2410 req
->resid_len
= blk_rq_bytes(req
);
2411 if (unlikely(blk_bidi_rq(req
)))
2412 req
->next_rq
->resid_len
= blk_rq_bytes(req
->next_rq
);
2414 BUG_ON(test_bit(REQ_ATOM_COMPLETE
, &req
->atomic_flags
));
2417 EXPORT_SYMBOL(blk_start_request
);
2420 * blk_fetch_request - fetch a request from a request queue
2421 * @q: request queue to fetch a request from
2424 * Return the request at the top of @q. The request is started on
2425 * return and LLD can start processing it immediately.
2428 * Pointer to the request at the top of @q if available. Null
2432 * queue_lock must be held.
2434 struct request
*blk_fetch_request(struct request_queue
*q
)
2438 rq
= blk_peek_request(q
);
2440 blk_start_request(rq
);
2443 EXPORT_SYMBOL(blk_fetch_request
);
2446 * blk_update_request - Special helper function for request stacking drivers
2447 * @req: the request being processed
2448 * @error: %0 for success, < %0 for error
2449 * @nr_bytes: number of bytes to complete @req
2452 * Ends I/O on a number of bytes attached to @req, but doesn't complete
2453 * the request structure even if @req doesn't have leftover.
2454 * If @req has leftover, sets it up for the next range of segments.
2456 * This special helper function is only for request stacking drivers
2457 * (e.g. request-based dm) so that they can handle partial completion.
2458 * Actual device drivers should use blk_end_request instead.
2460 * Passing the result of blk_rq_bytes() as @nr_bytes guarantees
2461 * %false return from this function.
2464 * %false - this request doesn't have any more data
2465 * %true - this request has more data
2467 bool blk_update_request(struct request
*req
, int error
, unsigned int nr_bytes
)
2471 trace_block_rq_complete(req
->q
, req
, nr_bytes
);
2477 * For fs requests, rq is just carrier of independent bio's
2478 * and each partial completion should be handled separately.
2479 * Reset per-request error on each partial completion.
2481 * TODO: tj: This is too subtle. It would be better to let
2482 * low level drivers do what they see fit.
2484 if (req
->cmd_type
== REQ_TYPE_FS
)
2487 if (error
&& req
->cmd_type
== REQ_TYPE_FS
&&
2488 !(req
->cmd_flags
& REQ_QUIET
)) {
2493 error_type
= "recoverable transport";
2496 error_type
= "critical target";
2499 error_type
= "critical nexus";
2502 error_type
= "timeout";
2505 error_type
= "critical space allocation";
2508 error_type
= "critical medium";
2515 printk_ratelimited(KERN_ERR
"%s: %s error, dev %s, sector %llu\n",
2516 __func__
, error_type
, req
->rq_disk
?
2517 req
->rq_disk
->disk_name
: "?",
2518 (unsigned long long)blk_rq_pos(req
));
2522 blk_account_io_completion(req
, nr_bytes
);
2526 struct bio
*bio
= req
->bio
;
2527 unsigned bio_bytes
= min(bio
->bi_iter
.bi_size
, nr_bytes
);
2529 if (bio_bytes
== bio
->bi_iter
.bi_size
)
2530 req
->bio
= bio
->bi_next
;
2532 req_bio_endio(req
, bio
, bio_bytes
, error
);
2534 total_bytes
+= bio_bytes
;
2535 nr_bytes
-= bio_bytes
;
2546 * Reset counters so that the request stacking driver
2547 * can find how many bytes remain in the request
2550 req
->__data_len
= 0;
2554 req
->__data_len
-= total_bytes
;
2556 /* update sector only for requests with clear definition of sector */
2557 if (req
->cmd_type
== REQ_TYPE_FS
)
2558 req
->__sector
+= total_bytes
>> 9;
2560 /* mixed attributes always follow the first bio */
2561 if (req
->cmd_flags
& REQ_MIXED_MERGE
) {
2562 req
->cmd_flags
&= ~REQ_FAILFAST_MASK
;
2563 req
->cmd_flags
|= req
->bio
->bi_rw
& REQ_FAILFAST_MASK
;
2567 * If total number of sectors is less than the first segment
2568 * size, something has gone terribly wrong.
2570 if (blk_rq_bytes(req
) < blk_rq_cur_bytes(req
)) {
2571 blk_dump_rq_flags(req
, "request botched");
2572 req
->__data_len
= blk_rq_cur_bytes(req
);
2575 /* recalculate the number of segments */
2576 blk_recalc_rq_segments(req
);
2580 EXPORT_SYMBOL_GPL(blk_update_request
);
2582 static bool blk_update_bidi_request(struct request
*rq
, int error
,
2583 unsigned int nr_bytes
,
2584 unsigned int bidi_bytes
)
2586 if (blk_update_request(rq
, error
, nr_bytes
))
2589 /* Bidi request must be completed as a whole */
2590 if (unlikely(blk_bidi_rq(rq
)) &&
2591 blk_update_request(rq
->next_rq
, error
, bidi_bytes
))
2594 if (blk_queue_add_random(rq
->q
))
2595 add_disk_randomness(rq
->rq_disk
);
2601 * blk_unprep_request - unprepare a request
2604 * This function makes a request ready for complete resubmission (or
2605 * completion). It happens only after all error handling is complete,
2606 * so represents the appropriate moment to deallocate any resources
2607 * that were allocated to the request in the prep_rq_fn. The queue
2608 * lock is held when calling this.
2610 void blk_unprep_request(struct request
*req
)
2612 struct request_queue
*q
= req
->q
;
2614 req
->cmd_flags
&= ~REQ_DONTPREP
;
2615 if (q
->unprep_rq_fn
)
2616 q
->unprep_rq_fn(q
, req
);
2618 EXPORT_SYMBOL_GPL(blk_unprep_request
);
2621 * queue lock must be held
2623 void blk_finish_request(struct request
*req
, int error
)
2625 if (req
->cmd_flags
& REQ_QUEUED
)
2626 blk_queue_end_tag(req
->q
, req
);
2628 BUG_ON(blk_queued_rq(req
));
2630 if (unlikely(laptop_mode
) && req
->cmd_type
== REQ_TYPE_FS
)
2631 laptop_io_completion(&req
->q
->backing_dev_info
);
2633 blk_delete_timer(req
);
2635 if (req
->cmd_flags
& REQ_DONTPREP
)
2636 blk_unprep_request(req
);
2638 blk_account_io_done(req
);
2641 req
->end_io(req
, error
);
2643 if (blk_bidi_rq(req
))
2644 __blk_put_request(req
->next_rq
->q
, req
->next_rq
);
2646 __blk_put_request(req
->q
, req
);
2649 EXPORT_SYMBOL(blk_finish_request
);
2652 * blk_end_bidi_request - Complete a bidi request
2653 * @rq: the request to complete
2654 * @error: %0 for success, < %0 for error
2655 * @nr_bytes: number of bytes to complete @rq
2656 * @bidi_bytes: number of bytes to complete @rq->next_rq
2659 * Ends I/O on a number of bytes attached to @rq and @rq->next_rq.
2660 * Drivers that supports bidi can safely call this member for any
2661 * type of request, bidi or uni. In the later case @bidi_bytes is
2665 * %false - we are done with this request
2666 * %true - still buffers pending for this request
2668 static bool blk_end_bidi_request(struct request
*rq
, int error
,
2669 unsigned int nr_bytes
, unsigned int bidi_bytes
)
2671 struct request_queue
*q
= rq
->q
;
2672 unsigned long flags
;
2674 if (blk_update_bidi_request(rq
, error
, nr_bytes
, bidi_bytes
))
2677 spin_lock_irqsave(q
->queue_lock
, flags
);
2678 blk_finish_request(rq
, error
);
2679 spin_unlock_irqrestore(q
->queue_lock
, flags
);
2685 * __blk_end_bidi_request - Complete a bidi request with queue lock held
2686 * @rq: the request to complete
2687 * @error: %0 for success, < %0 for error
2688 * @nr_bytes: number of bytes to complete @rq
2689 * @bidi_bytes: number of bytes to complete @rq->next_rq
2692 * Identical to blk_end_bidi_request() except that queue lock is
2693 * assumed to be locked on entry and remains so on return.
2696 * %false - we are done with this request
2697 * %true - still buffers pending for this request
2699 bool __blk_end_bidi_request(struct request
*rq
, int error
,
2700 unsigned int nr_bytes
, unsigned int bidi_bytes
)
2702 if (blk_update_bidi_request(rq
, error
, nr_bytes
, bidi_bytes
))
2705 blk_finish_request(rq
, error
);
2711 * blk_end_request - Helper function for drivers to complete the request.
2712 * @rq: the request being processed
2713 * @error: %0 for success, < %0 for error
2714 * @nr_bytes: number of bytes to complete
2717 * Ends I/O on a number of bytes attached to @rq.
2718 * If @rq has leftover, sets it up for the next range of segments.
2721 * %false - we are done with this request
2722 * %true - still buffers pending for this request
2724 bool blk_end_request(struct request
*rq
, int error
, unsigned int nr_bytes
)
2726 return blk_end_bidi_request(rq
, error
, nr_bytes
, 0);
2728 EXPORT_SYMBOL(blk_end_request
);
2731 * blk_end_request_all - Helper function for drives to finish the request.
2732 * @rq: the request to finish
2733 * @error: %0 for success, < %0 for error
2736 * Completely finish @rq.
2738 void blk_end_request_all(struct request
*rq
, int error
)
2741 unsigned int bidi_bytes
= 0;
2743 if (unlikely(blk_bidi_rq(rq
)))
2744 bidi_bytes
= blk_rq_bytes(rq
->next_rq
);
2746 pending
= blk_end_bidi_request(rq
, error
, blk_rq_bytes(rq
), bidi_bytes
);
2749 EXPORT_SYMBOL(blk_end_request_all
);
2752 * blk_end_request_cur - Helper function to finish the current request chunk.
2753 * @rq: the request to finish the current chunk for
2754 * @error: %0 for success, < %0 for error
2757 * Complete the current consecutively mapped chunk from @rq.
2760 * %false - we are done with this request
2761 * %true - still buffers pending for this request
2763 bool blk_end_request_cur(struct request
*rq
, int error
)
2765 return blk_end_request(rq
, error
, blk_rq_cur_bytes(rq
));
2767 EXPORT_SYMBOL(blk_end_request_cur
);
2770 * blk_end_request_err - Finish a request till the next failure boundary.
2771 * @rq: the request to finish till the next failure boundary for
2772 * @error: must be negative errno
2775 * Complete @rq till the next failure boundary.
2778 * %false - we are done with this request
2779 * %true - still buffers pending for this request
2781 bool blk_end_request_err(struct request
*rq
, int error
)
2783 WARN_ON(error
>= 0);
2784 return blk_end_request(rq
, error
, blk_rq_err_bytes(rq
));
2786 EXPORT_SYMBOL_GPL(blk_end_request_err
);
2789 * __blk_end_request - Helper function for drivers to complete the request.
2790 * @rq: the request being processed
2791 * @error: %0 for success, < %0 for error
2792 * @nr_bytes: number of bytes to complete
2795 * Must be called with queue lock held unlike blk_end_request().
2798 * %false - we are done with this request
2799 * %true - still buffers pending for this request
2801 bool __blk_end_request(struct request
*rq
, int error
, unsigned int nr_bytes
)
2803 return __blk_end_bidi_request(rq
, error
, nr_bytes
, 0);
2805 EXPORT_SYMBOL(__blk_end_request
);
2808 * __blk_end_request_all - Helper function for drives to finish the request.
2809 * @rq: the request to finish
2810 * @error: %0 for success, < %0 for error
2813 * Completely finish @rq. Must be called with queue lock held.
2815 void __blk_end_request_all(struct request
*rq
, int error
)
2818 unsigned int bidi_bytes
= 0;
2820 if (unlikely(blk_bidi_rq(rq
)))
2821 bidi_bytes
= blk_rq_bytes(rq
->next_rq
);
2823 pending
= __blk_end_bidi_request(rq
, error
, blk_rq_bytes(rq
), bidi_bytes
);
2826 EXPORT_SYMBOL(__blk_end_request_all
);
2829 * __blk_end_request_cur - Helper function to finish the current request chunk.
2830 * @rq: the request to finish the current chunk for
2831 * @error: %0 for success, < %0 for error
2834 * Complete the current consecutively mapped chunk from @rq. Must
2835 * be called with queue lock held.
2838 * %false - we are done with this request
2839 * %true - still buffers pending for this request
2841 bool __blk_end_request_cur(struct request
*rq
, int error
)
2843 return __blk_end_request(rq
, error
, blk_rq_cur_bytes(rq
));
2845 EXPORT_SYMBOL(__blk_end_request_cur
);
2848 * __blk_end_request_err - Finish a request till the next failure boundary.
2849 * @rq: the request to finish till the next failure boundary for
2850 * @error: must be negative errno
2853 * Complete @rq till the next failure boundary. Must be called
2854 * with queue lock held.
2857 * %false - we are done with this request
2858 * %true - still buffers pending for this request
2860 bool __blk_end_request_err(struct request
*rq
, int error
)
2862 WARN_ON(error
>= 0);
2863 return __blk_end_request(rq
, error
, blk_rq_err_bytes(rq
));
2865 EXPORT_SYMBOL_GPL(__blk_end_request_err
);
2867 void blk_rq_bio_prep(struct request_queue
*q
, struct request
*rq
,
2870 /* Bit 0 (R/W) is identical in rq->cmd_flags and bio->bi_rw */
2871 rq
->cmd_flags
|= bio
->bi_rw
& REQ_WRITE
;
2873 if (bio_has_data(bio
))
2874 rq
->nr_phys_segments
= bio_phys_segments(q
, bio
);
2876 rq
->__data_len
= bio
->bi_iter
.bi_size
;
2877 rq
->bio
= rq
->biotail
= bio
;
2880 rq
->rq_disk
= bio
->bi_bdev
->bd_disk
;
2883 #if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
2885 * rq_flush_dcache_pages - Helper function to flush all pages in a request
2886 * @rq: the request to be flushed
2889 * Flush all pages in @rq.
2891 void rq_flush_dcache_pages(struct request
*rq
)
2893 struct req_iterator iter
;
2894 struct bio_vec bvec
;
2896 rq_for_each_segment(bvec
, rq
, iter
)
2897 flush_dcache_page(bvec
.bv_page
);
2899 EXPORT_SYMBOL_GPL(rq_flush_dcache_pages
);
2903 * blk_lld_busy - Check if underlying low-level drivers of a device are busy
2904 * @q : the queue of the device being checked
2907 * Check if underlying low-level drivers of a device are busy.
2908 * If the drivers want to export their busy state, they must set own
2909 * exporting function using blk_queue_lld_busy() first.
2911 * Basically, this function is used only by request stacking drivers
2912 * to stop dispatching requests to underlying devices when underlying
2913 * devices are busy. This behavior helps more I/O merging on the queue
2914 * of the request stacking driver and prevents I/O throughput regression
2915 * on burst I/O load.
2918 * 0 - Not busy (The request stacking driver should dispatch request)
2919 * 1 - Busy (The request stacking driver should stop dispatching request)
2921 int blk_lld_busy(struct request_queue
*q
)
2924 return q
->lld_busy_fn(q
);
2928 EXPORT_SYMBOL_GPL(blk_lld_busy
);
2931 * blk_rq_unprep_clone - Helper function to free all bios in a cloned request
2932 * @rq: the clone request to be cleaned up
2935 * Free all bios in @rq for a cloned request.
2937 void blk_rq_unprep_clone(struct request
*rq
)
2941 while ((bio
= rq
->bio
) != NULL
) {
2942 rq
->bio
= bio
->bi_next
;
2947 EXPORT_SYMBOL_GPL(blk_rq_unprep_clone
);
2950 * Copy attributes of the original request to the clone request.
2951 * The actual data parts (e.g. ->cmd, ->sense) are not copied.
2953 static void __blk_rq_prep_clone(struct request
*dst
, struct request
*src
)
2955 dst
->cpu
= src
->cpu
;
2956 dst
->cmd_flags
|= (src
->cmd_flags
& REQ_CLONE_MASK
) | REQ_NOMERGE
;
2957 dst
->cmd_type
= src
->cmd_type
;
2958 dst
->__sector
= blk_rq_pos(src
);
2959 dst
->__data_len
= blk_rq_bytes(src
);
2960 dst
->nr_phys_segments
= src
->nr_phys_segments
;
2961 dst
->ioprio
= src
->ioprio
;
2962 dst
->extra_len
= src
->extra_len
;
2966 * blk_rq_prep_clone - Helper function to setup clone request
2967 * @rq: the request to be setup
2968 * @rq_src: original request to be cloned
2969 * @bs: bio_set that bios for clone are allocated from
2970 * @gfp_mask: memory allocation mask for bio
2971 * @bio_ctr: setup function to be called for each clone bio.
2972 * Returns %0 for success, non %0 for failure.
2973 * @data: private data to be passed to @bio_ctr
2976 * Clones bios in @rq_src to @rq, and copies attributes of @rq_src to @rq.
2977 * The actual data parts of @rq_src (e.g. ->cmd, ->sense)
2978 * are not copied, and copying such parts is the caller's responsibility.
2979 * Also, pages which the original bios are pointing to are not copied
2980 * and the cloned bios just point same pages.
2981 * So cloned bios must be completed before original bios, which means
2982 * the caller must complete @rq before @rq_src.
2984 int blk_rq_prep_clone(struct request
*rq
, struct request
*rq_src
,
2985 struct bio_set
*bs
, gfp_t gfp_mask
,
2986 int (*bio_ctr
)(struct bio
*, struct bio
*, void *),
2989 struct bio
*bio
, *bio_src
;
2994 __rq_for_each_bio(bio_src
, rq_src
) {
2995 bio
= bio_clone_fast(bio_src
, gfp_mask
, bs
);
2999 if (bio_ctr
&& bio_ctr(bio
, bio_src
, data
))
3003 rq
->biotail
->bi_next
= bio
;
3006 rq
->bio
= rq
->biotail
= bio
;
3009 __blk_rq_prep_clone(rq
, rq_src
);
3016 blk_rq_unprep_clone(rq
);
3020 EXPORT_SYMBOL_GPL(blk_rq_prep_clone
);
3022 int kblockd_schedule_work(struct work_struct
*work
)
3024 return queue_work(kblockd_workqueue
, work
);
3026 EXPORT_SYMBOL(kblockd_schedule_work
);
3028 int kblockd_schedule_delayed_work(struct delayed_work
*dwork
,
3029 unsigned long delay
)
3031 return queue_delayed_work(kblockd_workqueue
, dwork
, delay
);
3033 EXPORT_SYMBOL(kblockd_schedule_delayed_work
);
3035 int kblockd_schedule_delayed_work_on(int cpu
, struct delayed_work
*dwork
,
3036 unsigned long delay
)
3038 return queue_delayed_work_on(cpu
, kblockd_workqueue
, dwork
, delay
);
3040 EXPORT_SYMBOL(kblockd_schedule_delayed_work_on
);
3043 * blk_start_plug - initialize blk_plug and track it inside the task_struct
3044 * @plug: The &struct blk_plug that needs to be initialized
3047 * Tracking blk_plug inside the task_struct will help with auto-flushing the
3048 * pending I/O should the task end up blocking between blk_start_plug() and
3049 * blk_finish_plug(). This is important from a performance perspective, but
3050 * also ensures that we don't deadlock. For instance, if the task is blocking
3051 * for a memory allocation, memory reclaim could end up wanting to free a
3052 * page belonging to that request that is currently residing in our private
3053 * plug. By flushing the pending I/O when the process goes to sleep, we avoid
3054 * this kind of deadlock.
3056 void blk_start_plug(struct blk_plug
*plug
)
3058 struct task_struct
*tsk
= current
;
3061 * If this is a nested plug, don't actually assign it.
3066 INIT_LIST_HEAD(&plug
->list
);
3067 INIT_LIST_HEAD(&plug
->mq_list
);
3068 INIT_LIST_HEAD(&plug
->cb_list
);
3070 * Store ordering should not be needed here, since a potential
3071 * preempt will imply a full memory barrier
3075 EXPORT_SYMBOL(blk_start_plug
);
3077 static int plug_rq_cmp(void *priv
, struct list_head
*a
, struct list_head
*b
)
3079 struct request
*rqa
= container_of(a
, struct request
, queuelist
);
3080 struct request
*rqb
= container_of(b
, struct request
, queuelist
);
3082 return !(rqa
->q
< rqb
->q
||
3083 (rqa
->q
== rqb
->q
&& blk_rq_pos(rqa
) < blk_rq_pos(rqb
)));
3087 * If 'from_schedule' is true, then postpone the dispatch of requests
3088 * until a safe kblockd context. We due this to avoid accidental big
3089 * additional stack usage in driver dispatch, in places where the originally
3090 * plugger did not intend it.
3092 static void queue_unplugged(struct request_queue
*q
, unsigned int depth
,
3094 __releases(q
->queue_lock
)
3096 trace_block_unplug(q
, depth
, !from_schedule
);
3099 blk_run_queue_async(q
);
3102 spin_unlock(q
->queue_lock
);
3105 static void flush_plug_callbacks(struct blk_plug
*plug
, bool from_schedule
)
3107 LIST_HEAD(callbacks
);
3109 while (!list_empty(&plug
->cb_list
)) {
3110 list_splice_init(&plug
->cb_list
, &callbacks
);
3112 while (!list_empty(&callbacks
)) {
3113 struct blk_plug_cb
*cb
= list_first_entry(&callbacks
,
3116 list_del(&cb
->list
);
3117 cb
->callback(cb
, from_schedule
);
3122 struct blk_plug_cb
*blk_check_plugged(blk_plug_cb_fn unplug
, void *data
,
3125 struct blk_plug
*plug
= current
->plug
;
3126 struct blk_plug_cb
*cb
;
3131 list_for_each_entry(cb
, &plug
->cb_list
, list
)
3132 if (cb
->callback
== unplug
&& cb
->data
== data
)
3135 /* Not currently on the callback list */
3136 BUG_ON(size
< sizeof(*cb
));
3137 cb
= kzalloc(size
, GFP_ATOMIC
);
3140 cb
->callback
= unplug
;
3141 list_add(&cb
->list
, &plug
->cb_list
);
3145 EXPORT_SYMBOL(blk_check_plugged
);
3147 void blk_flush_plug_list(struct blk_plug
*plug
, bool from_schedule
)
3149 struct request_queue
*q
;
3150 unsigned long flags
;
3155 flush_plug_callbacks(plug
, from_schedule
);
3157 if (!list_empty(&plug
->mq_list
))
3158 blk_mq_flush_plug_list(plug
, from_schedule
);
3160 if (list_empty(&plug
->list
))
3163 list_splice_init(&plug
->list
, &list
);
3165 list_sort(NULL
, &list
, plug_rq_cmp
);
3171 * Save and disable interrupts here, to avoid doing it for every
3172 * queue lock we have to take.
3174 local_irq_save(flags
);
3175 while (!list_empty(&list
)) {
3176 rq
= list_entry_rq(list
.next
);
3177 list_del_init(&rq
->queuelist
);
3181 * This drops the queue lock
3184 queue_unplugged(q
, depth
, from_schedule
);
3187 spin_lock(q
->queue_lock
);
3191 * Short-circuit if @q is dead
3193 if (unlikely(blk_queue_dying(q
))) {
3194 __blk_end_request_all(rq
, -ENODEV
);
3199 * rq is already accounted, so use raw insert
3201 if (rq
->cmd_flags
& (REQ_FLUSH
| REQ_FUA
))
3202 __elv_add_request(q
, rq
, ELEVATOR_INSERT_FLUSH
);
3204 __elv_add_request(q
, rq
, ELEVATOR_INSERT_SORT_MERGE
);
3210 * This drops the queue lock
3213 queue_unplugged(q
, depth
, from_schedule
);
3215 local_irq_restore(flags
);
3218 void blk_finish_plug(struct blk_plug
*plug
)
3220 if (plug
!= current
->plug
)
3222 blk_flush_plug_list(plug
, false);
3224 current
->plug
= NULL
;
3226 EXPORT_SYMBOL(blk_finish_plug
);
3230 * blk_pm_runtime_init - Block layer runtime PM initialization routine
3231 * @q: the queue of the device
3232 * @dev: the device the queue belongs to
3235 * Initialize runtime-PM-related fields for @q and start auto suspend for
3236 * @dev. Drivers that want to take advantage of request-based runtime PM
3237 * should call this function after @dev has been initialized, and its
3238 * request queue @q has been allocated, and runtime PM for it can not happen
3239 * yet(either due to disabled/forbidden or its usage_count > 0). In most
3240 * cases, driver should call this function before any I/O has taken place.
3242 * This function takes care of setting up using auto suspend for the device,
3243 * the autosuspend delay is set to -1 to make runtime suspend impossible
3244 * until an updated value is either set by user or by driver. Drivers do
3245 * not need to touch other autosuspend settings.
3247 * The block layer runtime PM is request based, so only works for drivers
3248 * that use request as their IO unit instead of those directly use bio's.
3250 void blk_pm_runtime_init(struct request_queue
*q
, struct device
*dev
)
3253 q
->rpm_status
= RPM_ACTIVE
;
3254 pm_runtime_set_autosuspend_delay(q
->dev
, -1);
3255 pm_runtime_use_autosuspend(q
->dev
);
3257 EXPORT_SYMBOL(blk_pm_runtime_init
);
3260 * blk_pre_runtime_suspend - Pre runtime suspend check
3261 * @q: the queue of the device
3264 * This function will check if runtime suspend is allowed for the device
3265 * by examining if there are any requests pending in the queue. If there
3266 * are requests pending, the device can not be runtime suspended; otherwise,
3267 * the queue's status will be updated to SUSPENDING and the driver can
3268 * proceed to suspend the device.
3270 * For the not allowed case, we mark last busy for the device so that
3271 * runtime PM core will try to autosuspend it some time later.
3273 * This function should be called near the start of the device's
3274 * runtime_suspend callback.
3277 * 0 - OK to runtime suspend the device
3278 * -EBUSY - Device should not be runtime suspended
3280 int blk_pre_runtime_suspend(struct request_queue
*q
)
3284 spin_lock_irq(q
->queue_lock
);
3285 if (q
->nr_pending
) {
3287 pm_runtime_mark_last_busy(q
->dev
);
3289 q
->rpm_status
= RPM_SUSPENDING
;
3291 spin_unlock_irq(q
->queue_lock
);
3294 EXPORT_SYMBOL(blk_pre_runtime_suspend
);
3297 * blk_post_runtime_suspend - Post runtime suspend processing
3298 * @q: the queue of the device
3299 * @err: return value of the device's runtime_suspend function
3302 * Update the queue's runtime status according to the return value of the
3303 * device's runtime suspend function and mark last busy for the device so
3304 * that PM core will try to auto suspend the device at a later time.
3306 * This function should be called near the end of the device's
3307 * runtime_suspend callback.
3309 void blk_post_runtime_suspend(struct request_queue
*q
, int err
)
3311 spin_lock_irq(q
->queue_lock
);
3313 q
->rpm_status
= RPM_SUSPENDED
;
3315 q
->rpm_status
= RPM_ACTIVE
;
3316 pm_runtime_mark_last_busy(q
->dev
);
3318 spin_unlock_irq(q
->queue_lock
);
3320 EXPORT_SYMBOL(blk_post_runtime_suspend
);
3323 * blk_pre_runtime_resume - Pre runtime resume processing
3324 * @q: the queue of the device
3327 * Update the queue's runtime status to RESUMING in preparation for the
3328 * runtime resume of the device.
3330 * This function should be called near the start of the device's
3331 * runtime_resume callback.
3333 void blk_pre_runtime_resume(struct request_queue
*q
)
3335 spin_lock_irq(q
->queue_lock
);
3336 q
->rpm_status
= RPM_RESUMING
;
3337 spin_unlock_irq(q
->queue_lock
);
3339 EXPORT_SYMBOL(blk_pre_runtime_resume
);
3342 * blk_post_runtime_resume - Post runtime resume processing
3343 * @q: the queue of the device
3344 * @err: return value of the device's runtime_resume function
3347 * Update the queue's runtime status according to the return value of the
3348 * device's runtime_resume function. If it is successfully resumed, process
3349 * the requests that are queued into the device's queue when it is resuming
3350 * and then mark last busy and initiate autosuspend for it.
3352 * This function should be called near the end of the device's
3353 * runtime_resume callback.
3355 void blk_post_runtime_resume(struct request_queue
*q
, int err
)
3357 spin_lock_irq(q
->queue_lock
);
3359 q
->rpm_status
= RPM_ACTIVE
;
3361 pm_runtime_mark_last_busy(q
->dev
);
3362 pm_request_autosuspend(q
->dev
);
3364 q
->rpm_status
= RPM_SUSPENDED
;
3366 spin_unlock_irq(q
->queue_lock
);
3368 EXPORT_SYMBOL(blk_post_runtime_resume
);
3371 int __init
blk_dev_init(void)
3373 BUILD_BUG_ON(__REQ_NR_BITS
> 8 *
3374 FIELD_SIZEOF(struct request
, cmd_flags
));
3376 /* used for unplugging and affects IO latency/throughput - HIGHPRI */
3377 kblockd_workqueue
= alloc_workqueue("kblockd",
3378 WQ_MEM_RECLAIM
| WQ_HIGHPRI
, 0);
3379 if (!kblockd_workqueue
)
3380 panic("Failed to create kblockd\n");
3382 request_cachep
= kmem_cache_create("blkdev_requests",
3383 sizeof(struct request
), 0, SLAB_PANIC
, NULL
);
3385 blk_requestq_cachep
= kmem_cache_create("blkdev_queue",
3386 sizeof(struct request_queue
), 0, SLAB_PANIC
, NULL
);