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>
42 #include "blk-mq-sched.h"
45 EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_remap
);
46 EXPORT_TRACEPOINT_SYMBOL_GPL(block_rq_remap
);
47 EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_complete
);
48 EXPORT_TRACEPOINT_SYMBOL_GPL(block_split
);
49 EXPORT_TRACEPOINT_SYMBOL_GPL(block_unplug
);
51 DEFINE_IDA(blk_queue_ida
);
54 * For the allocated request tables
56 struct kmem_cache
*request_cachep
;
59 * For queue allocation
61 struct kmem_cache
*blk_requestq_cachep
;
64 * Controlling structure to kblockd
66 static struct workqueue_struct
*kblockd_workqueue
;
68 static void blk_clear_congested(struct request_list
*rl
, int sync
)
70 #ifdef CONFIG_CGROUP_WRITEBACK
71 clear_wb_congested(rl
->blkg
->wb_congested
, sync
);
74 * If !CGROUP_WRITEBACK, all blkg's map to bdi->wb and we shouldn't
75 * flip its congestion state for events on other blkcgs.
77 if (rl
== &rl
->q
->root_rl
)
78 clear_wb_congested(rl
->q
->backing_dev_info
->wb
.congested
, sync
);
82 static void blk_set_congested(struct request_list
*rl
, int sync
)
84 #ifdef CONFIG_CGROUP_WRITEBACK
85 set_wb_congested(rl
->blkg
->wb_congested
, sync
);
87 /* see blk_clear_congested() */
88 if (rl
== &rl
->q
->root_rl
)
89 set_wb_congested(rl
->q
->backing_dev_info
->wb
.congested
, sync
);
93 void blk_queue_congestion_threshold(struct request_queue
*q
)
97 nr
= q
->nr_requests
- (q
->nr_requests
/ 8) + 1;
98 if (nr
> q
->nr_requests
)
100 q
->nr_congestion_on
= nr
;
102 nr
= q
->nr_requests
- (q
->nr_requests
/ 8) - (q
->nr_requests
/ 16) - 1;
105 q
->nr_congestion_off
= nr
;
109 * blk_get_backing_dev_info - get the address of a queue's backing_dev_info
112 * Locates the passed device's request queue and returns the address of its
113 * backing_dev_info. This function can only be called if @bdev is opened
114 * and the return value is never NULL.
116 struct backing_dev_info
*blk_get_backing_dev_info(struct block_device
*bdev
)
118 struct request_queue
*q
= bdev_get_queue(bdev
);
120 return q
->backing_dev_info
;
122 EXPORT_SYMBOL(blk_get_backing_dev_info
);
124 void blk_rq_init(struct request_queue
*q
, struct request
*rq
)
126 memset(rq
, 0, sizeof(*rq
));
128 INIT_LIST_HEAD(&rq
->queuelist
);
129 INIT_LIST_HEAD(&rq
->timeout_list
);
132 rq
->__sector
= (sector_t
) -1;
133 INIT_HLIST_NODE(&rq
->hash
);
134 RB_CLEAR_NODE(&rq
->rb_node
);
136 rq
->internal_tag
= -1;
137 rq
->start_time
= jiffies
;
138 set_start_time_ns(rq
);
141 EXPORT_SYMBOL(blk_rq_init
);
143 static void req_bio_endio(struct request
*rq
, struct bio
*bio
,
144 unsigned int nbytes
, int error
)
147 bio
->bi_error
= error
;
149 if (unlikely(rq
->rq_flags
& RQF_QUIET
))
150 bio_set_flag(bio
, BIO_QUIET
);
152 bio_advance(bio
, nbytes
);
154 /* don't actually finish bio if it's part of flush sequence */
155 if (bio
->bi_iter
.bi_size
== 0 && !(rq
->rq_flags
& RQF_FLUSH_SEQ
))
159 void blk_dump_rq_flags(struct request
*rq
, char *msg
)
161 printk(KERN_INFO
"%s: dev %s: flags=%llx\n", msg
,
162 rq
->rq_disk
? rq
->rq_disk
->disk_name
: "?",
163 (unsigned long long) rq
->cmd_flags
);
165 printk(KERN_INFO
" sector %llu, nr/cnr %u/%u\n",
166 (unsigned long long)blk_rq_pos(rq
),
167 blk_rq_sectors(rq
), blk_rq_cur_sectors(rq
));
168 printk(KERN_INFO
" bio %p, biotail %p, len %u\n",
169 rq
->bio
, rq
->biotail
, blk_rq_bytes(rq
));
171 EXPORT_SYMBOL(blk_dump_rq_flags
);
173 static void blk_delay_work(struct work_struct
*work
)
175 struct request_queue
*q
;
177 q
= container_of(work
, struct request_queue
, delay_work
.work
);
178 spin_lock_irq(q
->queue_lock
);
180 spin_unlock_irq(q
->queue_lock
);
184 * blk_delay_queue - restart queueing after defined interval
185 * @q: The &struct request_queue in question
186 * @msecs: Delay in msecs
189 * Sometimes queueing needs to be postponed for a little while, to allow
190 * resources to come back. This function will make sure that queueing is
191 * restarted around the specified time. Queue lock must be held.
193 void blk_delay_queue(struct request_queue
*q
, unsigned long msecs
)
195 if (likely(!blk_queue_dead(q
)))
196 queue_delayed_work(kblockd_workqueue
, &q
->delay_work
,
197 msecs_to_jiffies(msecs
));
199 EXPORT_SYMBOL(blk_delay_queue
);
202 * blk_start_queue_async - asynchronously restart a previously stopped queue
203 * @q: The &struct request_queue in question
206 * blk_start_queue_async() will clear the stop flag on the queue, and
207 * ensure that the request_fn for the queue is run from an async
210 void blk_start_queue_async(struct request_queue
*q
)
212 queue_flag_clear(QUEUE_FLAG_STOPPED
, q
);
213 blk_run_queue_async(q
);
215 EXPORT_SYMBOL(blk_start_queue_async
);
218 * blk_start_queue - restart a previously stopped queue
219 * @q: The &struct request_queue in question
222 * blk_start_queue() will clear the stop flag on the queue, and call
223 * the request_fn for the queue if it was in a stopped state when
224 * entered. Also see blk_stop_queue(). Queue lock must be held.
226 void blk_start_queue(struct request_queue
*q
)
228 WARN_ON(!irqs_disabled());
230 queue_flag_clear(QUEUE_FLAG_STOPPED
, q
);
233 EXPORT_SYMBOL(blk_start_queue
);
236 * blk_stop_queue - stop a queue
237 * @q: The &struct request_queue in question
240 * The Linux block layer assumes that a block driver will consume all
241 * entries on the request queue when the request_fn strategy is called.
242 * Often this will not happen, because of hardware limitations (queue
243 * depth settings). If a device driver gets a 'queue full' response,
244 * or if it simply chooses not to queue more I/O at one point, it can
245 * call this function to prevent the request_fn from being called until
246 * the driver has signalled it's ready to go again. This happens by calling
247 * blk_start_queue() to restart queue operations. Queue lock must be held.
249 void blk_stop_queue(struct request_queue
*q
)
251 cancel_delayed_work(&q
->delay_work
);
252 queue_flag_set(QUEUE_FLAG_STOPPED
, q
);
254 EXPORT_SYMBOL(blk_stop_queue
);
257 * blk_sync_queue - cancel any pending callbacks on a queue
261 * The block layer may perform asynchronous callback activity
262 * on a queue, such as calling the unplug function after a timeout.
263 * A block device may call blk_sync_queue to ensure that any
264 * such activity is cancelled, thus allowing it to release resources
265 * that the callbacks might use. The caller must already have made sure
266 * that its ->make_request_fn will not re-add plugging prior to calling
269 * This function does not cancel any asynchronous activity arising
270 * out of elevator or throttling code. That would require elevator_exit()
271 * and blkcg_exit_queue() to be called with queue lock initialized.
274 void blk_sync_queue(struct request_queue
*q
)
276 del_timer_sync(&q
->timeout
);
279 struct blk_mq_hw_ctx
*hctx
;
282 queue_for_each_hw_ctx(q
, hctx
, i
) {
283 cancel_work_sync(&hctx
->run_work
);
284 cancel_delayed_work_sync(&hctx
->delay_work
);
287 cancel_delayed_work_sync(&q
->delay_work
);
290 EXPORT_SYMBOL(blk_sync_queue
);
293 * __blk_run_queue_uncond - run a queue whether or not it has been stopped
294 * @q: The queue to run
297 * Invoke request handling on a queue if there are any pending requests.
298 * May be used to restart request handling after a request has completed.
299 * This variant runs the queue whether or not the queue has been
300 * stopped. Must be called with the queue lock held and interrupts
301 * disabled. See also @blk_run_queue.
303 inline void __blk_run_queue_uncond(struct request_queue
*q
)
305 if (unlikely(blk_queue_dead(q
)))
309 * Some request_fn implementations, e.g. scsi_request_fn(), unlock
310 * the queue lock internally. As a result multiple threads may be
311 * running such a request function concurrently. Keep track of the
312 * number of active request_fn invocations such that blk_drain_queue()
313 * can wait until all these request_fn calls have finished.
315 q
->request_fn_active
++;
317 q
->request_fn_active
--;
319 EXPORT_SYMBOL_GPL(__blk_run_queue_uncond
);
322 * __blk_run_queue - run a single device queue
323 * @q: The queue to run
326 * See @blk_run_queue. This variant must be called with the queue lock
327 * held and interrupts disabled.
329 void __blk_run_queue(struct request_queue
*q
)
331 if (unlikely(blk_queue_stopped(q
)))
334 __blk_run_queue_uncond(q
);
336 EXPORT_SYMBOL(__blk_run_queue
);
339 * blk_run_queue_async - run a single device queue in workqueue context
340 * @q: The queue to run
343 * Tells kblockd to perform the equivalent of @blk_run_queue on behalf
344 * of us. The caller must hold the queue lock.
346 void blk_run_queue_async(struct request_queue
*q
)
348 if (likely(!blk_queue_stopped(q
) && !blk_queue_dead(q
)))
349 mod_delayed_work(kblockd_workqueue
, &q
->delay_work
, 0);
351 EXPORT_SYMBOL(blk_run_queue_async
);
354 * blk_run_queue - run a single device queue
355 * @q: The queue to run
358 * Invoke request handling on this queue, if it has pending work to do.
359 * May be used to restart queueing when a request has completed.
361 void blk_run_queue(struct request_queue
*q
)
365 spin_lock_irqsave(q
->queue_lock
, flags
);
367 spin_unlock_irqrestore(q
->queue_lock
, flags
);
369 EXPORT_SYMBOL(blk_run_queue
);
371 void blk_put_queue(struct request_queue
*q
)
373 kobject_put(&q
->kobj
);
375 EXPORT_SYMBOL(blk_put_queue
);
378 * __blk_drain_queue - drain requests from request_queue
380 * @drain_all: whether to drain all requests or only the ones w/ ELVPRIV
382 * Drain requests from @q. If @drain_all is set, all requests are drained.
383 * If not, only ELVPRIV requests are drained. The caller is responsible
384 * for ensuring that no new requests which need to be drained are queued.
386 static void __blk_drain_queue(struct request_queue
*q
, bool drain_all
)
387 __releases(q
->queue_lock
)
388 __acquires(q
->queue_lock
)
392 lockdep_assert_held(q
->queue_lock
);
398 * The caller might be trying to drain @q before its
399 * elevator is initialized.
402 elv_drain_elevator(q
);
404 blkcg_drain_queue(q
);
407 * This function might be called on a queue which failed
408 * driver init after queue creation or is not yet fully
409 * active yet. Some drivers (e.g. fd and loop) get unhappy
410 * in such cases. Kick queue iff dispatch queue has
411 * something on it and @q has request_fn set.
413 if (!list_empty(&q
->queue_head
) && q
->request_fn
)
416 drain
|= q
->nr_rqs_elvpriv
;
417 drain
|= q
->request_fn_active
;
420 * Unfortunately, requests are queued at and tracked from
421 * multiple places and there's no single counter which can
422 * be drained. Check all the queues and counters.
425 struct blk_flush_queue
*fq
= blk_get_flush_queue(q
, NULL
);
426 drain
|= !list_empty(&q
->queue_head
);
427 for (i
= 0; i
< 2; i
++) {
428 drain
|= q
->nr_rqs
[i
];
429 drain
|= q
->in_flight
[i
];
431 drain
|= !list_empty(&fq
->flush_queue
[i
]);
438 spin_unlock_irq(q
->queue_lock
);
442 spin_lock_irq(q
->queue_lock
);
446 * With queue marked dead, any woken up waiter will fail the
447 * allocation path, so the wakeup chaining is lost and we're
448 * left with hung waiters. We need to wake up those waiters.
451 struct request_list
*rl
;
453 blk_queue_for_each_rl(rl
, q
)
454 for (i
= 0; i
< ARRAY_SIZE(rl
->wait
); i
++)
455 wake_up_all(&rl
->wait
[i
]);
460 * blk_queue_bypass_start - enter queue bypass mode
461 * @q: queue of interest
463 * In bypass mode, only the dispatch FIFO queue of @q is used. This
464 * function makes @q enter bypass mode and drains all requests which were
465 * throttled or issued before. On return, it's guaranteed that no request
466 * is being throttled or has ELVPRIV set and blk_queue_bypass() %true
467 * inside queue or RCU read lock.
469 void blk_queue_bypass_start(struct request_queue
*q
)
471 spin_lock_irq(q
->queue_lock
);
473 queue_flag_set(QUEUE_FLAG_BYPASS
, q
);
474 spin_unlock_irq(q
->queue_lock
);
477 * Queues start drained. Skip actual draining till init is
478 * complete. This avoids lenghty delays during queue init which
479 * can happen many times during boot.
481 if (blk_queue_init_done(q
)) {
482 spin_lock_irq(q
->queue_lock
);
483 __blk_drain_queue(q
, false);
484 spin_unlock_irq(q
->queue_lock
);
486 /* ensure blk_queue_bypass() is %true inside RCU read lock */
490 EXPORT_SYMBOL_GPL(blk_queue_bypass_start
);
493 * blk_queue_bypass_end - leave queue bypass mode
494 * @q: queue of interest
496 * Leave bypass mode and restore the normal queueing behavior.
498 void blk_queue_bypass_end(struct request_queue
*q
)
500 spin_lock_irq(q
->queue_lock
);
501 if (!--q
->bypass_depth
)
502 queue_flag_clear(QUEUE_FLAG_BYPASS
, q
);
503 WARN_ON_ONCE(q
->bypass_depth
< 0);
504 spin_unlock_irq(q
->queue_lock
);
506 EXPORT_SYMBOL_GPL(blk_queue_bypass_end
);
508 void blk_set_queue_dying(struct request_queue
*q
)
510 spin_lock_irq(q
->queue_lock
);
511 queue_flag_set(QUEUE_FLAG_DYING
, q
);
512 spin_unlock_irq(q
->queue_lock
);
515 blk_mq_wake_waiters(q
);
517 struct request_list
*rl
;
519 blk_queue_for_each_rl(rl
, q
) {
521 wake_up(&rl
->wait
[BLK_RW_SYNC
]);
522 wake_up(&rl
->wait
[BLK_RW_ASYNC
]);
527 EXPORT_SYMBOL_GPL(blk_set_queue_dying
);
530 * blk_cleanup_queue - shutdown a request queue
531 * @q: request queue to shutdown
533 * Mark @q DYING, drain all pending requests, mark @q DEAD, destroy and
534 * put it. All future requests will be failed immediately with -ENODEV.
536 void blk_cleanup_queue(struct request_queue
*q
)
538 spinlock_t
*lock
= q
->queue_lock
;
540 /* mark @q DYING, no new request or merges will be allowed afterwards */
541 mutex_lock(&q
->sysfs_lock
);
542 blk_set_queue_dying(q
);
546 * A dying queue is permanently in bypass mode till released. Note
547 * that, unlike blk_queue_bypass_start(), we aren't performing
548 * synchronize_rcu() after entering bypass mode to avoid the delay
549 * as some drivers create and destroy a lot of queues while
550 * probing. This is still safe because blk_release_queue() will be
551 * called only after the queue refcnt drops to zero and nothing,
552 * RCU or not, would be traversing the queue by then.
555 queue_flag_set(QUEUE_FLAG_BYPASS
, q
);
557 queue_flag_set(QUEUE_FLAG_NOMERGES
, q
);
558 queue_flag_set(QUEUE_FLAG_NOXMERGES
, q
);
559 queue_flag_set(QUEUE_FLAG_DYING
, q
);
560 spin_unlock_irq(lock
);
561 mutex_unlock(&q
->sysfs_lock
);
564 * Drain all requests queued before DYING marking. Set DEAD flag to
565 * prevent that q->request_fn() gets invoked after draining finished.
570 __blk_drain_queue(q
, true);
571 queue_flag_set(QUEUE_FLAG_DEAD
, q
);
572 spin_unlock_irq(lock
);
574 /* for synchronous bio-based driver finish in-flight integrity i/o */
575 blk_flush_integrity();
577 /* @q won't process any more request, flush async actions */
578 del_timer_sync(&q
->backing_dev_info
->laptop_mode_wb_timer
);
582 blk_mq_free_queue(q
);
583 percpu_ref_exit(&q
->q_usage_counter
);
586 if (q
->queue_lock
!= &q
->__queue_lock
)
587 q
->queue_lock
= &q
->__queue_lock
;
588 spin_unlock_irq(lock
);
590 bdi_unregister(q
->backing_dev_info
);
592 /* @q is and will stay empty, shutdown and put */
595 EXPORT_SYMBOL(blk_cleanup_queue
);
597 /* Allocate memory local to the request queue */
598 static void *alloc_request_simple(gfp_t gfp_mask
, void *data
)
600 struct request_queue
*q
= data
;
602 return kmem_cache_alloc_node(request_cachep
, gfp_mask
, q
->node
);
605 static void free_request_simple(void *element
, void *data
)
607 kmem_cache_free(request_cachep
, element
);
610 static void *alloc_request_size(gfp_t gfp_mask
, void *data
)
612 struct request_queue
*q
= data
;
615 rq
= kmalloc_node(sizeof(struct request
) + q
->cmd_size
, gfp_mask
,
617 if (rq
&& q
->init_rq_fn
&& q
->init_rq_fn(q
, rq
, gfp_mask
) < 0) {
624 static void free_request_size(void *element
, void *data
)
626 struct request_queue
*q
= data
;
629 q
->exit_rq_fn(q
, element
);
633 int blk_init_rl(struct request_list
*rl
, struct request_queue
*q
,
636 if (unlikely(rl
->rq_pool
))
640 rl
->count
[BLK_RW_SYNC
] = rl
->count
[BLK_RW_ASYNC
] = 0;
641 rl
->starved
[BLK_RW_SYNC
] = rl
->starved
[BLK_RW_ASYNC
] = 0;
642 init_waitqueue_head(&rl
->wait
[BLK_RW_SYNC
]);
643 init_waitqueue_head(&rl
->wait
[BLK_RW_ASYNC
]);
646 rl
->rq_pool
= mempool_create_node(BLKDEV_MIN_RQ
,
647 alloc_request_size
, free_request_size
,
648 q
, gfp_mask
, q
->node
);
650 rl
->rq_pool
= mempool_create_node(BLKDEV_MIN_RQ
,
651 alloc_request_simple
, free_request_simple
,
652 q
, gfp_mask
, q
->node
);
660 void blk_exit_rl(struct request_list
*rl
)
663 mempool_destroy(rl
->rq_pool
);
666 struct request_queue
*blk_alloc_queue(gfp_t gfp_mask
)
668 return blk_alloc_queue_node(gfp_mask
, NUMA_NO_NODE
);
670 EXPORT_SYMBOL(blk_alloc_queue
);
672 int blk_queue_enter(struct request_queue
*q
, bool nowait
)
677 if (percpu_ref_tryget_live(&q
->q_usage_counter
))
683 ret
= wait_event_interruptible(q
->mq_freeze_wq
,
684 !atomic_read(&q
->mq_freeze_depth
) ||
686 if (blk_queue_dying(q
))
693 void blk_queue_exit(struct request_queue
*q
)
695 percpu_ref_put(&q
->q_usage_counter
);
698 static void blk_queue_usage_counter_release(struct percpu_ref
*ref
)
700 struct request_queue
*q
=
701 container_of(ref
, struct request_queue
, q_usage_counter
);
703 wake_up_all(&q
->mq_freeze_wq
);
706 static void blk_rq_timed_out_timer(unsigned long data
)
708 struct request_queue
*q
= (struct request_queue
*)data
;
710 kblockd_schedule_work(&q
->timeout_work
);
713 struct request_queue
*blk_alloc_queue_node(gfp_t gfp_mask
, int node_id
)
715 struct request_queue
*q
;
718 q
= kmem_cache_alloc_node(blk_requestq_cachep
,
719 gfp_mask
| __GFP_ZERO
, node_id
);
723 q
->id
= ida_simple_get(&blk_queue_ida
, 0, 0, gfp_mask
);
727 q
->bio_split
= bioset_create(BIO_POOL_SIZE
, 0);
731 q
->backing_dev_info
= &q
->_backing_dev_info
;
732 q
->backing_dev_info
->ra_pages
=
733 (VM_MAX_READAHEAD
* 1024) / PAGE_SIZE
;
734 q
->backing_dev_info
->capabilities
= BDI_CAP_CGROUP_WRITEBACK
;
735 q
->backing_dev_info
->name
= "block";
738 err
= bdi_init(q
->backing_dev_info
);
742 setup_timer(&q
->backing_dev_info
->laptop_mode_wb_timer
,
743 laptop_mode_timer_fn
, (unsigned long) q
);
744 setup_timer(&q
->timeout
, blk_rq_timed_out_timer
, (unsigned long) q
);
745 INIT_LIST_HEAD(&q
->queue_head
);
746 INIT_LIST_HEAD(&q
->timeout_list
);
747 INIT_LIST_HEAD(&q
->icq_list
);
748 #ifdef CONFIG_BLK_CGROUP
749 INIT_LIST_HEAD(&q
->blkg_list
);
751 INIT_DELAYED_WORK(&q
->delay_work
, blk_delay_work
);
753 kobject_init(&q
->kobj
, &blk_queue_ktype
);
755 mutex_init(&q
->sysfs_lock
);
756 spin_lock_init(&q
->__queue_lock
);
759 * By default initialize queue_lock to internal lock and driver can
760 * override it later if need be.
762 q
->queue_lock
= &q
->__queue_lock
;
765 * A queue starts its life with bypass turned on to avoid
766 * unnecessary bypass on/off overhead and nasty surprises during
767 * init. The initial bypass will be finished when the queue is
768 * registered by blk_register_queue().
771 __set_bit(QUEUE_FLAG_BYPASS
, &q
->queue_flags
);
773 init_waitqueue_head(&q
->mq_freeze_wq
);
776 * Init percpu_ref in atomic mode so that it's faster to shutdown.
777 * See blk_register_queue() for details.
779 if (percpu_ref_init(&q
->q_usage_counter
,
780 blk_queue_usage_counter_release
,
781 PERCPU_REF_INIT_ATOMIC
, GFP_KERNEL
))
784 if (blkcg_init_queue(q
))
790 percpu_ref_exit(&q
->q_usage_counter
);
792 bdi_destroy(q
->backing_dev_info
);
794 bioset_free(q
->bio_split
);
796 ida_simple_remove(&blk_queue_ida
, q
->id
);
798 kmem_cache_free(blk_requestq_cachep
, q
);
801 EXPORT_SYMBOL(blk_alloc_queue_node
);
804 * blk_init_queue - prepare a request queue for use with a block device
805 * @rfn: The function to be called to process requests that have been
806 * placed on the queue.
807 * @lock: Request queue spin lock
810 * If a block device wishes to use the standard request handling procedures,
811 * which sorts requests and coalesces adjacent requests, then it must
812 * call blk_init_queue(). The function @rfn will be called when there
813 * are requests on the queue that need to be processed. If the device
814 * supports plugging, then @rfn may not be called immediately when requests
815 * are available on the queue, but may be called at some time later instead.
816 * Plugged queues are generally unplugged when a buffer belonging to one
817 * of the requests on the queue is needed, or due to memory pressure.
819 * @rfn is not required, or even expected, to remove all requests off the
820 * queue, but only as many as it can handle at a time. If it does leave
821 * requests on the queue, it is responsible for arranging that the requests
822 * get dealt with eventually.
824 * The queue spin lock must be held while manipulating the requests on the
825 * request queue; this lock will be taken also from interrupt context, so irq
826 * disabling is needed for it.
828 * Function returns a pointer to the initialized request queue, or %NULL if
832 * blk_init_queue() must be paired with a blk_cleanup_queue() call
833 * when the block device is deactivated (such as at module unload).
836 struct request_queue
*blk_init_queue(request_fn_proc
*rfn
, spinlock_t
*lock
)
838 return blk_init_queue_node(rfn
, lock
, NUMA_NO_NODE
);
840 EXPORT_SYMBOL(blk_init_queue
);
842 struct request_queue
*
843 blk_init_queue_node(request_fn_proc
*rfn
, spinlock_t
*lock
, int node_id
)
845 struct request_queue
*q
;
847 q
= blk_alloc_queue_node(GFP_KERNEL
, node_id
);
853 q
->queue_lock
= lock
;
854 if (blk_init_allocated_queue(q
) < 0) {
855 blk_cleanup_queue(q
);
861 EXPORT_SYMBOL(blk_init_queue_node
);
863 static blk_qc_t
blk_queue_bio(struct request_queue
*q
, struct bio
*bio
);
866 int blk_init_allocated_queue(struct request_queue
*q
)
868 q
->fq
= blk_alloc_flush_queue(q
, NUMA_NO_NODE
, q
->cmd_size
);
872 if (q
->init_rq_fn
&& q
->init_rq_fn(q
, q
->fq
->flush_rq
, GFP_KERNEL
))
873 goto out_free_flush_queue
;
875 if (blk_init_rl(&q
->root_rl
, q
, GFP_KERNEL
))
876 goto out_exit_flush_rq
;
878 INIT_WORK(&q
->timeout_work
, blk_timeout_work
);
879 q
->queue_flags
|= QUEUE_FLAG_DEFAULT
;
882 * This also sets hw/phys segments, boundary and size
884 blk_queue_make_request(q
, blk_queue_bio
);
886 q
->sg_reserved_size
= INT_MAX
;
888 /* Protect q->elevator from elevator_change */
889 mutex_lock(&q
->sysfs_lock
);
892 if (elevator_init(q
, NULL
)) {
893 mutex_unlock(&q
->sysfs_lock
);
894 goto out_exit_flush_rq
;
897 mutex_unlock(&q
->sysfs_lock
);
902 q
->exit_rq_fn(q
, q
->fq
->flush_rq
);
903 out_free_flush_queue
:
904 blk_free_flush_queue(q
->fq
);
908 EXPORT_SYMBOL(blk_init_allocated_queue
);
910 bool blk_get_queue(struct request_queue
*q
)
912 if (likely(!blk_queue_dying(q
))) {
919 EXPORT_SYMBOL(blk_get_queue
);
921 static inline void blk_free_request(struct request_list
*rl
, struct request
*rq
)
923 if (rq
->rq_flags
& RQF_ELVPRIV
) {
924 elv_put_request(rl
->q
, rq
);
926 put_io_context(rq
->elv
.icq
->ioc
);
929 mempool_free(rq
, rl
->rq_pool
);
933 * ioc_batching returns true if the ioc is a valid batching request and
934 * should be given priority access to a request.
936 static inline int ioc_batching(struct request_queue
*q
, struct io_context
*ioc
)
942 * Make sure the process is able to allocate at least 1 request
943 * even if the batch times out, otherwise we could theoretically
946 return ioc
->nr_batch_requests
== q
->nr_batching
||
947 (ioc
->nr_batch_requests
> 0
948 && time_before(jiffies
, ioc
->last_waited
+ BLK_BATCH_TIME
));
952 * ioc_set_batching sets ioc to be a new "batcher" if it is not one. This
953 * will cause the process to be a "batcher" on all queues in the system. This
954 * is the behaviour we want though - once it gets a wakeup it should be given
957 static void ioc_set_batching(struct request_queue
*q
, struct io_context
*ioc
)
959 if (!ioc
|| ioc_batching(q
, ioc
))
962 ioc
->nr_batch_requests
= q
->nr_batching
;
963 ioc
->last_waited
= jiffies
;
966 static void __freed_request(struct request_list
*rl
, int sync
)
968 struct request_queue
*q
= rl
->q
;
970 if (rl
->count
[sync
] < queue_congestion_off_threshold(q
))
971 blk_clear_congested(rl
, sync
);
973 if (rl
->count
[sync
] + 1 <= q
->nr_requests
) {
974 if (waitqueue_active(&rl
->wait
[sync
]))
975 wake_up(&rl
->wait
[sync
]);
977 blk_clear_rl_full(rl
, sync
);
982 * A request has just been released. Account for it, update the full and
983 * congestion status, wake up any waiters. Called under q->queue_lock.
985 static void freed_request(struct request_list
*rl
, bool sync
,
986 req_flags_t rq_flags
)
988 struct request_queue
*q
= rl
->q
;
992 if (rq_flags
& RQF_ELVPRIV
)
995 __freed_request(rl
, sync
);
997 if (unlikely(rl
->starved
[sync
^ 1]))
998 __freed_request(rl
, sync
^ 1);
1001 int blk_update_nr_requests(struct request_queue
*q
, unsigned int nr
)
1003 struct request_list
*rl
;
1004 int on_thresh
, off_thresh
;
1006 spin_lock_irq(q
->queue_lock
);
1007 q
->nr_requests
= nr
;
1008 blk_queue_congestion_threshold(q
);
1009 on_thresh
= queue_congestion_on_threshold(q
);
1010 off_thresh
= queue_congestion_off_threshold(q
);
1012 blk_queue_for_each_rl(rl
, q
) {
1013 if (rl
->count
[BLK_RW_SYNC
] >= on_thresh
)
1014 blk_set_congested(rl
, BLK_RW_SYNC
);
1015 else if (rl
->count
[BLK_RW_SYNC
] < off_thresh
)
1016 blk_clear_congested(rl
, BLK_RW_SYNC
);
1018 if (rl
->count
[BLK_RW_ASYNC
] >= on_thresh
)
1019 blk_set_congested(rl
, BLK_RW_ASYNC
);
1020 else if (rl
->count
[BLK_RW_ASYNC
] < off_thresh
)
1021 blk_clear_congested(rl
, BLK_RW_ASYNC
);
1023 if (rl
->count
[BLK_RW_SYNC
] >= q
->nr_requests
) {
1024 blk_set_rl_full(rl
, BLK_RW_SYNC
);
1026 blk_clear_rl_full(rl
, BLK_RW_SYNC
);
1027 wake_up(&rl
->wait
[BLK_RW_SYNC
]);
1030 if (rl
->count
[BLK_RW_ASYNC
] >= q
->nr_requests
) {
1031 blk_set_rl_full(rl
, BLK_RW_ASYNC
);
1033 blk_clear_rl_full(rl
, BLK_RW_ASYNC
);
1034 wake_up(&rl
->wait
[BLK_RW_ASYNC
]);
1038 spin_unlock_irq(q
->queue_lock
);
1043 * __get_request - get a free request
1044 * @rl: request list to allocate from
1045 * @op: operation and flags
1046 * @bio: bio to allocate request for (can be %NULL)
1047 * @gfp_mask: allocation mask
1049 * Get a free request from @q. This function may fail under memory
1050 * pressure or if @q is dead.
1052 * Must be called with @q->queue_lock held and,
1053 * Returns ERR_PTR on failure, with @q->queue_lock held.
1054 * Returns request pointer on success, with @q->queue_lock *not held*.
1056 static struct request
*__get_request(struct request_list
*rl
, unsigned int op
,
1057 struct bio
*bio
, gfp_t gfp_mask
)
1059 struct request_queue
*q
= rl
->q
;
1061 struct elevator_type
*et
= q
->elevator
->type
;
1062 struct io_context
*ioc
= rq_ioc(bio
);
1063 struct io_cq
*icq
= NULL
;
1064 const bool is_sync
= op_is_sync(op
);
1066 req_flags_t rq_flags
= RQF_ALLOCED
;
1068 if (unlikely(blk_queue_dying(q
)))
1069 return ERR_PTR(-ENODEV
);
1071 may_queue
= elv_may_queue(q
, op
);
1072 if (may_queue
== ELV_MQUEUE_NO
)
1075 if (rl
->count
[is_sync
]+1 >= queue_congestion_on_threshold(q
)) {
1076 if (rl
->count
[is_sync
]+1 >= q
->nr_requests
) {
1078 * The queue will fill after this allocation, so set
1079 * it as full, and mark this process as "batching".
1080 * This process will be allowed to complete a batch of
1081 * requests, others will be blocked.
1083 if (!blk_rl_full(rl
, is_sync
)) {
1084 ioc_set_batching(q
, ioc
);
1085 blk_set_rl_full(rl
, is_sync
);
1087 if (may_queue
!= ELV_MQUEUE_MUST
1088 && !ioc_batching(q
, ioc
)) {
1090 * The queue is full and the allocating
1091 * process is not a "batcher", and not
1092 * exempted by the IO scheduler
1094 return ERR_PTR(-ENOMEM
);
1098 blk_set_congested(rl
, is_sync
);
1102 * Only allow batching queuers to allocate up to 50% over the defined
1103 * limit of requests, otherwise we could have thousands of requests
1104 * allocated with any setting of ->nr_requests
1106 if (rl
->count
[is_sync
] >= (3 * q
->nr_requests
/ 2))
1107 return ERR_PTR(-ENOMEM
);
1109 q
->nr_rqs
[is_sync
]++;
1110 rl
->count
[is_sync
]++;
1111 rl
->starved
[is_sync
] = 0;
1114 * Decide whether the new request will be managed by elevator. If
1115 * so, mark @rq_flags and increment elvpriv. Non-zero elvpriv will
1116 * prevent the current elevator from being destroyed until the new
1117 * request is freed. This guarantees icq's won't be destroyed and
1118 * makes creating new ones safe.
1120 * Flush requests do not use the elevator so skip initialization.
1121 * This allows a request to share the flush and elevator data.
1123 * Also, lookup icq while holding queue_lock. If it doesn't exist,
1124 * it will be created after releasing queue_lock.
1126 if (!op_is_flush(op
) && !blk_queue_bypass(q
)) {
1127 rq_flags
|= RQF_ELVPRIV
;
1128 q
->nr_rqs_elvpriv
++;
1129 if (et
->icq_cache
&& ioc
)
1130 icq
= ioc_lookup_icq(ioc
, q
);
1133 if (blk_queue_io_stat(q
))
1134 rq_flags
|= RQF_IO_STAT
;
1135 spin_unlock_irq(q
->queue_lock
);
1137 /* allocate and init request */
1138 rq
= mempool_alloc(rl
->rq_pool
, gfp_mask
);
1143 blk_rq_set_rl(rq
, rl
);
1144 blk_rq_set_prio(rq
, ioc
);
1146 rq
->rq_flags
= rq_flags
;
1149 if (rq_flags
& RQF_ELVPRIV
) {
1150 if (unlikely(et
->icq_cache
&& !icq
)) {
1152 icq
= ioc_create_icq(ioc
, q
, gfp_mask
);
1158 if (unlikely(elv_set_request(q
, rq
, bio
, gfp_mask
)))
1161 /* @rq->elv.icq holds io_context until @rq is freed */
1163 get_io_context(icq
->ioc
);
1167 * ioc may be NULL here, and ioc_batching will be false. That's
1168 * OK, if the queue is under the request limit then requests need
1169 * not count toward the nr_batch_requests limit. There will always
1170 * be some limit enforced by BLK_BATCH_TIME.
1172 if (ioc_batching(q
, ioc
))
1173 ioc
->nr_batch_requests
--;
1175 trace_block_getrq(q
, bio
, op
);
1180 * elvpriv init failed. ioc, icq and elvpriv aren't mempool backed
1181 * and may fail indefinitely under memory pressure and thus
1182 * shouldn't stall IO. Treat this request as !elvpriv. This will
1183 * disturb iosched and blkcg but weird is bettern than dead.
1185 printk_ratelimited(KERN_WARNING
"%s: dev %s: request aux data allocation failed, iosched may be disturbed\n",
1186 __func__
, dev_name(q
->backing_dev_info
->dev
));
1188 rq
->rq_flags
&= ~RQF_ELVPRIV
;
1191 spin_lock_irq(q
->queue_lock
);
1192 q
->nr_rqs_elvpriv
--;
1193 spin_unlock_irq(q
->queue_lock
);
1198 * Allocation failed presumably due to memory. Undo anything we
1199 * might have messed up.
1201 * Allocating task should really be put onto the front of the wait
1202 * queue, but this is pretty rare.
1204 spin_lock_irq(q
->queue_lock
);
1205 freed_request(rl
, is_sync
, rq_flags
);
1208 * in the very unlikely event that allocation failed and no
1209 * requests for this direction was pending, mark us starved so that
1210 * freeing of a request in the other direction will notice
1211 * us. another possible fix would be to split the rq mempool into
1215 if (unlikely(rl
->count
[is_sync
] == 0))
1216 rl
->starved
[is_sync
] = 1;
1217 return ERR_PTR(-ENOMEM
);
1221 * get_request - get a free request
1222 * @q: request_queue to allocate request from
1223 * @op: operation and flags
1224 * @bio: bio to allocate request for (can be %NULL)
1225 * @gfp_mask: allocation mask
1227 * Get a free request from @q. If %__GFP_DIRECT_RECLAIM is set in @gfp_mask,
1228 * this function keeps retrying under memory pressure and fails iff @q is dead.
1230 * Must be called with @q->queue_lock held and,
1231 * Returns ERR_PTR on failure, with @q->queue_lock held.
1232 * Returns request pointer on success, with @q->queue_lock *not held*.
1234 static struct request
*get_request(struct request_queue
*q
, unsigned int op
,
1235 struct bio
*bio
, gfp_t gfp_mask
)
1237 const bool is_sync
= op_is_sync(op
);
1239 struct request_list
*rl
;
1242 rl
= blk_get_rl(q
, bio
); /* transferred to @rq on success */
1244 rq
= __get_request(rl
, op
, bio
, gfp_mask
);
1248 if (!gfpflags_allow_blocking(gfp_mask
) || unlikely(blk_queue_dying(q
))) {
1253 /* wait on @rl and retry */
1254 prepare_to_wait_exclusive(&rl
->wait
[is_sync
], &wait
,
1255 TASK_UNINTERRUPTIBLE
);
1257 trace_block_sleeprq(q
, bio
, op
);
1259 spin_unlock_irq(q
->queue_lock
);
1263 * After sleeping, we become a "batching" process and will be able
1264 * to allocate at least one request, and up to a big batch of them
1265 * for a small period time. See ioc_batching, ioc_set_batching
1267 ioc_set_batching(q
, current
->io_context
);
1269 spin_lock_irq(q
->queue_lock
);
1270 finish_wait(&rl
->wait
[is_sync
], &wait
);
1275 static struct request
*blk_old_get_request(struct request_queue
*q
, int rw
,
1280 /* create ioc upfront */
1281 create_io_context(gfp_mask
, q
->node
);
1283 spin_lock_irq(q
->queue_lock
);
1284 rq
= get_request(q
, rw
, NULL
, gfp_mask
);
1286 spin_unlock_irq(q
->queue_lock
);
1290 /* q->queue_lock is unlocked at this point */
1292 rq
->__sector
= (sector_t
) -1;
1293 rq
->bio
= rq
->biotail
= NULL
;
1297 struct request
*blk_get_request(struct request_queue
*q
, int rw
, gfp_t gfp_mask
)
1300 return blk_mq_alloc_request(q
, rw
,
1301 (gfp_mask
& __GFP_DIRECT_RECLAIM
) ?
1302 0 : BLK_MQ_REQ_NOWAIT
);
1304 return blk_old_get_request(q
, rw
, gfp_mask
);
1306 EXPORT_SYMBOL(blk_get_request
);
1309 * blk_requeue_request - put a request back on queue
1310 * @q: request queue where request should be inserted
1311 * @rq: request to be inserted
1314 * Drivers often keep queueing requests until the hardware cannot accept
1315 * more, when that condition happens we need to put the request back
1316 * on the queue. Must be called with queue lock held.
1318 void blk_requeue_request(struct request_queue
*q
, struct request
*rq
)
1320 blk_delete_timer(rq
);
1321 blk_clear_rq_complete(rq
);
1322 trace_block_rq_requeue(q
, rq
);
1323 wbt_requeue(q
->rq_wb
, &rq
->issue_stat
);
1325 if (rq
->rq_flags
& RQF_QUEUED
)
1326 blk_queue_end_tag(q
, rq
);
1328 BUG_ON(blk_queued_rq(rq
));
1330 elv_requeue_request(q
, rq
);
1332 EXPORT_SYMBOL(blk_requeue_request
);
1334 static void add_acct_request(struct request_queue
*q
, struct request
*rq
,
1337 blk_account_io_start(rq
, true);
1338 __elv_add_request(q
, rq
, where
);
1341 static void part_round_stats_single(int cpu
, struct hd_struct
*part
,
1346 if (now
== part
->stamp
)
1349 inflight
= part_in_flight(part
);
1351 __part_stat_add(cpu
, part
, time_in_queue
,
1352 inflight
* (now
- part
->stamp
));
1353 __part_stat_add(cpu
, part
, io_ticks
, (now
- part
->stamp
));
1359 * part_round_stats() - Round off the performance stats on a struct disk_stats.
1360 * @cpu: cpu number for stats access
1361 * @part: target partition
1363 * The average IO queue length and utilisation statistics are maintained
1364 * by observing the current state of the queue length and the amount of
1365 * time it has been in this state for.
1367 * Normally, that accounting is done on IO completion, but that can result
1368 * in more than a second's worth of IO being accounted for within any one
1369 * second, leading to >100% utilisation. To deal with that, we call this
1370 * function to do a round-off before returning the results when reading
1371 * /proc/diskstats. This accounts immediately for all queue usage up to
1372 * the current jiffies and restarts the counters again.
1374 void part_round_stats(int cpu
, struct hd_struct
*part
)
1376 unsigned long now
= jiffies
;
1379 part_round_stats_single(cpu
, &part_to_disk(part
)->part0
, now
);
1380 part_round_stats_single(cpu
, part
, now
);
1382 EXPORT_SYMBOL_GPL(part_round_stats
);
1385 static void blk_pm_put_request(struct request
*rq
)
1387 if (rq
->q
->dev
&& !(rq
->rq_flags
& RQF_PM
) && !--rq
->q
->nr_pending
)
1388 pm_runtime_mark_last_busy(rq
->q
->dev
);
1391 static inline void blk_pm_put_request(struct request
*rq
) {}
1395 * queue lock must be held
1397 void __blk_put_request(struct request_queue
*q
, struct request
*req
)
1399 req_flags_t rq_flags
= req
->rq_flags
;
1405 blk_mq_free_request(req
);
1409 blk_pm_put_request(req
);
1411 elv_completed_request(q
, req
);
1413 /* this is a bio leak */
1414 WARN_ON(req
->bio
!= NULL
);
1416 wbt_done(q
->rq_wb
, &req
->issue_stat
);
1419 * Request may not have originated from ll_rw_blk. if not,
1420 * it didn't come out of our reserved rq pools
1422 if (rq_flags
& RQF_ALLOCED
) {
1423 struct request_list
*rl
= blk_rq_rl(req
);
1424 bool sync
= op_is_sync(req
->cmd_flags
);
1426 BUG_ON(!list_empty(&req
->queuelist
));
1427 BUG_ON(ELV_ON_HASH(req
));
1429 blk_free_request(rl
, req
);
1430 freed_request(rl
, sync
, rq_flags
);
1434 EXPORT_SYMBOL_GPL(__blk_put_request
);
1436 void blk_put_request(struct request
*req
)
1438 struct request_queue
*q
= req
->q
;
1441 blk_mq_free_request(req
);
1443 unsigned long flags
;
1445 spin_lock_irqsave(q
->queue_lock
, flags
);
1446 __blk_put_request(q
, req
);
1447 spin_unlock_irqrestore(q
->queue_lock
, flags
);
1450 EXPORT_SYMBOL(blk_put_request
);
1452 bool bio_attempt_back_merge(struct request_queue
*q
, struct request
*req
,
1455 const int ff
= bio
->bi_opf
& REQ_FAILFAST_MASK
;
1457 if (!ll_back_merge_fn(q
, req
, bio
))
1460 trace_block_bio_backmerge(q
, req
, bio
);
1462 if ((req
->cmd_flags
& REQ_FAILFAST_MASK
) != ff
)
1463 blk_rq_set_mixed_merge(req
);
1465 req
->biotail
->bi_next
= bio
;
1467 req
->__data_len
+= bio
->bi_iter
.bi_size
;
1468 req
->ioprio
= ioprio_best(req
->ioprio
, bio_prio(bio
));
1470 blk_account_io_start(req
, false);
1474 bool bio_attempt_front_merge(struct request_queue
*q
, struct request
*req
,
1477 const int ff
= bio
->bi_opf
& REQ_FAILFAST_MASK
;
1479 if (!ll_front_merge_fn(q
, req
, bio
))
1482 trace_block_bio_frontmerge(q
, req
, bio
);
1484 if ((req
->cmd_flags
& REQ_FAILFAST_MASK
) != ff
)
1485 blk_rq_set_mixed_merge(req
);
1487 bio
->bi_next
= req
->bio
;
1490 req
->__sector
= bio
->bi_iter
.bi_sector
;
1491 req
->__data_len
+= bio
->bi_iter
.bi_size
;
1492 req
->ioprio
= ioprio_best(req
->ioprio
, bio_prio(bio
));
1494 blk_account_io_start(req
, false);
1499 * blk_attempt_plug_merge - try to merge with %current's plugged list
1500 * @q: request_queue new bio is being queued at
1501 * @bio: new bio being queued
1502 * @request_count: out parameter for number of traversed plugged requests
1503 * @same_queue_rq: pointer to &struct request that gets filled in when
1504 * another request associated with @q is found on the plug list
1505 * (optional, may be %NULL)
1507 * Determine whether @bio being queued on @q can be merged with a request
1508 * on %current's plugged list. Returns %true if merge was successful,
1511 * Plugging coalesces IOs from the same issuer for the same purpose without
1512 * going through @q->queue_lock. As such it's more of an issuing mechanism
1513 * than scheduling, and the request, while may have elvpriv data, is not
1514 * added on the elevator at this point. In addition, we don't have
1515 * reliable access to the elevator outside queue lock. Only check basic
1516 * merging parameters without querying the elevator.
1518 * Caller must ensure !blk_queue_nomerges(q) beforehand.
1520 bool blk_attempt_plug_merge(struct request_queue
*q
, struct bio
*bio
,
1521 unsigned int *request_count
,
1522 struct request
**same_queue_rq
)
1524 struct blk_plug
*plug
;
1527 struct list_head
*plug_list
;
1529 plug
= current
->plug
;
1535 plug_list
= &plug
->mq_list
;
1537 plug_list
= &plug
->list
;
1539 list_for_each_entry_reverse(rq
, plug_list
, queuelist
) {
1545 * Only blk-mq multiple hardware queues case checks the
1546 * rq in the same queue, there should be only one such
1550 *same_queue_rq
= rq
;
1553 if (rq
->q
!= q
|| !blk_rq_merge_ok(rq
, bio
))
1556 el_ret
= blk_try_merge(rq
, bio
);
1557 if (el_ret
== ELEVATOR_BACK_MERGE
) {
1558 ret
= bio_attempt_back_merge(q
, rq
, bio
);
1561 } else if (el_ret
== ELEVATOR_FRONT_MERGE
) {
1562 ret
= bio_attempt_front_merge(q
, rq
, bio
);
1571 unsigned int blk_plug_queued_count(struct request_queue
*q
)
1573 struct blk_plug
*plug
;
1575 struct list_head
*plug_list
;
1576 unsigned int ret
= 0;
1578 plug
= current
->plug
;
1583 plug_list
= &plug
->mq_list
;
1585 plug_list
= &plug
->list
;
1587 list_for_each_entry(rq
, plug_list
, queuelist
) {
1595 void init_request_from_bio(struct request
*req
, struct bio
*bio
)
1597 if (bio
->bi_opf
& REQ_RAHEAD
)
1598 req
->cmd_flags
|= REQ_FAILFAST_MASK
;
1601 req
->__sector
= bio
->bi_iter
.bi_sector
;
1602 if (ioprio_valid(bio_prio(bio
)))
1603 req
->ioprio
= bio_prio(bio
);
1604 blk_rq_bio_prep(req
->q
, req
, bio
);
1607 static blk_qc_t
blk_queue_bio(struct request_queue
*q
, struct bio
*bio
)
1609 struct blk_plug
*plug
;
1610 int el_ret
, where
= ELEVATOR_INSERT_SORT
;
1611 struct request
*req
;
1612 unsigned int request_count
= 0;
1613 unsigned int wb_acct
;
1616 * low level driver can indicate that it wants pages above a
1617 * certain limit bounced to low memory (ie for highmem, or even
1618 * ISA dma in theory)
1620 blk_queue_bounce(q
, &bio
);
1622 blk_queue_split(q
, &bio
, q
->bio_split
);
1624 if (bio_integrity_enabled(bio
) && bio_integrity_prep(bio
)) {
1625 bio
->bi_error
= -EIO
;
1627 return BLK_QC_T_NONE
;
1630 if (op_is_flush(bio
->bi_opf
)) {
1631 spin_lock_irq(q
->queue_lock
);
1632 where
= ELEVATOR_INSERT_FLUSH
;
1637 * Check if we can merge with the plugged list before grabbing
1640 if (!blk_queue_nomerges(q
)) {
1641 if (blk_attempt_plug_merge(q
, bio
, &request_count
, NULL
))
1642 return BLK_QC_T_NONE
;
1644 request_count
= blk_plug_queued_count(q
);
1646 spin_lock_irq(q
->queue_lock
);
1648 el_ret
= elv_merge(q
, &req
, bio
);
1649 if (el_ret
== ELEVATOR_BACK_MERGE
) {
1650 if (bio_attempt_back_merge(q
, req
, bio
)) {
1651 elv_bio_merged(q
, req
, bio
);
1652 if (!attempt_back_merge(q
, req
))
1653 elv_merged_request(q
, req
, el_ret
);
1656 } else if (el_ret
== ELEVATOR_FRONT_MERGE
) {
1657 if (bio_attempt_front_merge(q
, req
, bio
)) {
1658 elv_bio_merged(q
, req
, bio
);
1659 if (!attempt_front_merge(q
, req
))
1660 elv_merged_request(q
, req
, el_ret
);
1666 wb_acct
= wbt_wait(q
->rq_wb
, bio
, q
->queue_lock
);
1669 * Grab a free request. This is might sleep but can not fail.
1670 * Returns with the queue unlocked.
1672 req
= get_request(q
, bio
->bi_opf
, bio
, GFP_NOIO
);
1674 __wbt_done(q
->rq_wb
, wb_acct
);
1675 bio
->bi_error
= PTR_ERR(req
);
1680 wbt_track(&req
->issue_stat
, wb_acct
);
1683 * After dropping the lock and possibly sleeping here, our request
1684 * may now be mergeable after it had proven unmergeable (above).
1685 * We don't worry about that case for efficiency. It won't happen
1686 * often, and the elevators are able to handle it.
1688 init_request_from_bio(req
, bio
);
1690 if (test_bit(QUEUE_FLAG_SAME_COMP
, &q
->queue_flags
))
1691 req
->cpu
= raw_smp_processor_id();
1693 plug
= current
->plug
;
1696 * If this is the first request added after a plug, fire
1699 * @request_count may become stale because of schedule
1700 * out, so check plug list again.
1702 if (!request_count
|| list_empty(&plug
->list
))
1703 trace_block_plug(q
);
1705 struct request
*last
= list_entry_rq(plug
->list
.prev
);
1706 if (request_count
>= BLK_MAX_REQUEST_COUNT
||
1707 blk_rq_bytes(last
) >= BLK_PLUG_FLUSH_SIZE
) {
1708 blk_flush_plug_list(plug
, false);
1709 trace_block_plug(q
);
1712 list_add_tail(&req
->queuelist
, &plug
->list
);
1713 blk_account_io_start(req
, true);
1715 spin_lock_irq(q
->queue_lock
);
1716 add_acct_request(q
, req
, where
);
1719 spin_unlock_irq(q
->queue_lock
);
1722 return BLK_QC_T_NONE
;
1726 * If bio->bi_dev is a partition, remap the location
1728 static inline void blk_partition_remap(struct bio
*bio
)
1730 struct block_device
*bdev
= bio
->bi_bdev
;
1733 * Zone reset does not include bi_size so bio_sectors() is always 0.
1734 * Include a test for the reset op code and perform the remap if needed.
1736 if (bdev
!= bdev
->bd_contains
&&
1737 (bio_sectors(bio
) || bio_op(bio
) == REQ_OP_ZONE_RESET
)) {
1738 struct hd_struct
*p
= bdev
->bd_part
;
1740 bio
->bi_iter
.bi_sector
+= p
->start_sect
;
1741 bio
->bi_bdev
= bdev
->bd_contains
;
1743 trace_block_bio_remap(bdev_get_queue(bio
->bi_bdev
), bio
,
1745 bio
->bi_iter
.bi_sector
- p
->start_sect
);
1749 static void handle_bad_sector(struct bio
*bio
)
1751 char b
[BDEVNAME_SIZE
];
1753 printk(KERN_INFO
"attempt to access beyond end of device\n");
1754 printk(KERN_INFO
"%s: rw=%d, want=%Lu, limit=%Lu\n",
1755 bdevname(bio
->bi_bdev
, b
),
1757 (unsigned long long)bio_end_sector(bio
),
1758 (long long)(i_size_read(bio
->bi_bdev
->bd_inode
) >> 9));
1761 #ifdef CONFIG_FAIL_MAKE_REQUEST
1763 static DECLARE_FAULT_ATTR(fail_make_request
);
1765 static int __init
setup_fail_make_request(char *str
)
1767 return setup_fault_attr(&fail_make_request
, str
);
1769 __setup("fail_make_request=", setup_fail_make_request
);
1771 static bool should_fail_request(struct hd_struct
*part
, unsigned int bytes
)
1773 return part
->make_it_fail
&& should_fail(&fail_make_request
, bytes
);
1776 static int __init
fail_make_request_debugfs(void)
1778 struct dentry
*dir
= fault_create_debugfs_attr("fail_make_request",
1779 NULL
, &fail_make_request
);
1781 return PTR_ERR_OR_ZERO(dir
);
1784 late_initcall(fail_make_request_debugfs
);
1786 #else /* CONFIG_FAIL_MAKE_REQUEST */
1788 static inline bool should_fail_request(struct hd_struct
*part
,
1794 #endif /* CONFIG_FAIL_MAKE_REQUEST */
1797 * Check whether this bio extends beyond the end of the device.
1799 static inline int bio_check_eod(struct bio
*bio
, unsigned int nr_sectors
)
1806 /* Test device or partition size, when known. */
1807 maxsector
= i_size_read(bio
->bi_bdev
->bd_inode
) >> 9;
1809 sector_t sector
= bio
->bi_iter
.bi_sector
;
1811 if (maxsector
< nr_sectors
|| maxsector
- nr_sectors
< sector
) {
1813 * This may well happen - the kernel calls bread()
1814 * without checking the size of the device, e.g., when
1815 * mounting a device.
1817 handle_bad_sector(bio
);
1825 static noinline_for_stack
bool
1826 generic_make_request_checks(struct bio
*bio
)
1828 struct request_queue
*q
;
1829 int nr_sectors
= bio_sectors(bio
);
1831 char b
[BDEVNAME_SIZE
];
1832 struct hd_struct
*part
;
1836 if (bio_check_eod(bio
, nr_sectors
))
1839 q
= bdev_get_queue(bio
->bi_bdev
);
1842 "generic_make_request: Trying to access "
1843 "nonexistent block-device %s (%Lu)\n",
1844 bdevname(bio
->bi_bdev
, b
),
1845 (long long) bio
->bi_iter
.bi_sector
);
1849 part
= bio
->bi_bdev
->bd_part
;
1850 if (should_fail_request(part
, bio
->bi_iter
.bi_size
) ||
1851 should_fail_request(&part_to_disk(part
)->part0
,
1852 bio
->bi_iter
.bi_size
))
1856 * If this device has partitions, remap block n
1857 * of partition p to block n+start(p) of the disk.
1859 blk_partition_remap(bio
);
1861 if (bio_check_eod(bio
, nr_sectors
))
1865 * Filter flush bio's early so that make_request based
1866 * drivers without flush support don't have to worry
1869 if (op_is_flush(bio
->bi_opf
) &&
1870 !test_bit(QUEUE_FLAG_WC
, &q
->queue_flags
)) {
1871 bio
->bi_opf
&= ~(REQ_PREFLUSH
| REQ_FUA
);
1878 switch (bio_op(bio
)) {
1879 case REQ_OP_DISCARD
:
1880 if (!blk_queue_discard(q
))
1883 case REQ_OP_SECURE_ERASE
:
1884 if (!blk_queue_secure_erase(q
))
1887 case REQ_OP_WRITE_SAME
:
1888 if (!bdev_write_same(bio
->bi_bdev
))
1891 case REQ_OP_ZONE_REPORT
:
1892 case REQ_OP_ZONE_RESET
:
1893 if (!bdev_is_zoned(bio
->bi_bdev
))
1896 case REQ_OP_WRITE_ZEROES
:
1897 if (!bdev_write_zeroes_sectors(bio
->bi_bdev
))
1905 * Various block parts want %current->io_context and lazy ioc
1906 * allocation ends up trading a lot of pain for a small amount of
1907 * memory. Just allocate it upfront. This may fail and block
1908 * layer knows how to live with it.
1910 create_io_context(GFP_ATOMIC
, q
->node
);
1912 if (!blkcg_bio_issue_check(q
, bio
))
1915 trace_block_bio_queue(q
, bio
);
1921 bio
->bi_error
= err
;
1927 * generic_make_request - hand a buffer to its device driver for I/O
1928 * @bio: The bio describing the location in memory and on the device.
1930 * generic_make_request() is used to make I/O requests of block
1931 * devices. It is passed a &struct bio, which describes the I/O that needs
1934 * generic_make_request() does not return any status. The
1935 * success/failure status of the request, along with notification of
1936 * completion, is delivered asynchronously through the bio->bi_end_io
1937 * function described (one day) else where.
1939 * The caller of generic_make_request must make sure that bi_io_vec
1940 * are set to describe the memory buffer, and that bi_dev and bi_sector are
1941 * set to describe the device address, and the
1942 * bi_end_io and optionally bi_private are set to describe how
1943 * completion notification should be signaled.
1945 * generic_make_request and the drivers it calls may use bi_next if this
1946 * bio happens to be merged with someone else, and may resubmit the bio to
1947 * a lower device by calling into generic_make_request recursively, which
1948 * means the bio should NOT be touched after the call to ->make_request_fn.
1950 blk_qc_t
generic_make_request(struct bio
*bio
)
1952 struct bio_list bio_list_on_stack
;
1953 blk_qc_t ret
= BLK_QC_T_NONE
;
1955 if (!generic_make_request_checks(bio
))
1959 * We only want one ->make_request_fn to be active at a time, else
1960 * stack usage with stacked devices could be a problem. So use
1961 * current->bio_list to keep a list of requests submited by a
1962 * make_request_fn function. current->bio_list is also used as a
1963 * flag to say if generic_make_request is currently active in this
1964 * task or not. If it is NULL, then no make_request is active. If
1965 * it is non-NULL, then a make_request is active, and new requests
1966 * should be added at the tail
1968 if (current
->bio_list
) {
1969 bio_list_add(current
->bio_list
, bio
);
1973 /* following loop may be a bit non-obvious, and so deserves some
1975 * Before entering the loop, bio->bi_next is NULL (as all callers
1976 * ensure that) so we have a list with a single bio.
1977 * We pretend that we have just taken it off a longer list, so
1978 * we assign bio_list to a pointer to the bio_list_on_stack,
1979 * thus initialising the bio_list of new bios to be
1980 * added. ->make_request() may indeed add some more bios
1981 * through a recursive call to generic_make_request. If it
1982 * did, we find a non-NULL value in bio_list and re-enter the loop
1983 * from the top. In this case we really did just take the bio
1984 * of the top of the list (no pretending) and so remove it from
1985 * bio_list, and call into ->make_request() again.
1987 BUG_ON(bio
->bi_next
);
1988 bio_list_init(&bio_list_on_stack
);
1989 current
->bio_list
= &bio_list_on_stack
;
1991 struct request_queue
*q
= bdev_get_queue(bio
->bi_bdev
);
1993 if (likely(blk_queue_enter(q
, false) == 0)) {
1994 ret
= q
->make_request_fn(q
, bio
);
1998 bio
= bio_list_pop(current
->bio_list
);
2000 struct bio
*bio_next
= bio_list_pop(current
->bio_list
);
2006 current
->bio_list
= NULL
; /* deactivate */
2011 EXPORT_SYMBOL(generic_make_request
);
2014 * submit_bio - submit a bio to the block device layer for I/O
2015 * @bio: The &struct bio which describes the I/O
2017 * submit_bio() is very similar in purpose to generic_make_request(), and
2018 * uses that function to do most of the work. Both are fairly rough
2019 * interfaces; @bio must be presetup and ready for I/O.
2022 blk_qc_t
submit_bio(struct bio
*bio
)
2025 * If it's a regular read/write or a barrier with data attached,
2026 * go through the normal accounting stuff before submission.
2028 if (bio_has_data(bio
)) {
2031 if (unlikely(bio_op(bio
) == REQ_OP_WRITE_SAME
))
2032 count
= bdev_logical_block_size(bio
->bi_bdev
) >> 9;
2034 count
= bio_sectors(bio
);
2036 if (op_is_write(bio_op(bio
))) {
2037 count_vm_events(PGPGOUT
, count
);
2039 task_io_account_read(bio
->bi_iter
.bi_size
);
2040 count_vm_events(PGPGIN
, count
);
2043 if (unlikely(block_dump
)) {
2044 char b
[BDEVNAME_SIZE
];
2045 printk(KERN_DEBUG
"%s(%d): %s block %Lu on %s (%u sectors)\n",
2046 current
->comm
, task_pid_nr(current
),
2047 op_is_write(bio_op(bio
)) ? "WRITE" : "READ",
2048 (unsigned long long)bio
->bi_iter
.bi_sector
,
2049 bdevname(bio
->bi_bdev
, b
),
2054 return generic_make_request(bio
);
2056 EXPORT_SYMBOL(submit_bio
);
2059 * blk_cloned_rq_check_limits - Helper function to check a cloned request
2060 * for new the queue limits
2062 * @rq: the request being checked
2065 * @rq may have been made based on weaker limitations of upper-level queues
2066 * in request stacking drivers, and it may violate the limitation of @q.
2067 * Since the block layer and the underlying device driver trust @rq
2068 * after it is inserted to @q, it should be checked against @q before
2069 * the insertion using this generic function.
2071 * Request stacking drivers like request-based dm may change the queue
2072 * limits when retrying requests on other queues. Those requests need
2073 * to be checked against the new queue limits again during dispatch.
2075 static int blk_cloned_rq_check_limits(struct request_queue
*q
,
2078 if (blk_rq_sectors(rq
) > blk_queue_get_max_sectors(q
, req_op(rq
))) {
2079 printk(KERN_ERR
"%s: over max size limit.\n", __func__
);
2084 * queue's settings related to segment counting like q->bounce_pfn
2085 * may differ from that of other stacking queues.
2086 * Recalculate it to check the request correctly on this queue's
2089 blk_recalc_rq_segments(rq
);
2090 if (rq
->nr_phys_segments
> queue_max_segments(q
)) {
2091 printk(KERN_ERR
"%s: over max segments limit.\n", __func__
);
2099 * blk_insert_cloned_request - Helper for stacking drivers to submit a request
2100 * @q: the queue to submit the request
2101 * @rq: the request being queued
2103 int blk_insert_cloned_request(struct request_queue
*q
, struct request
*rq
)
2105 unsigned long flags
;
2106 int where
= ELEVATOR_INSERT_BACK
;
2108 if (blk_cloned_rq_check_limits(q
, rq
))
2112 should_fail_request(&rq
->rq_disk
->part0
, blk_rq_bytes(rq
)))
2116 if (blk_queue_io_stat(q
))
2117 blk_account_io_start(rq
, true);
2118 blk_mq_sched_insert_request(rq
, false, true, false, false);
2122 spin_lock_irqsave(q
->queue_lock
, flags
);
2123 if (unlikely(blk_queue_dying(q
))) {
2124 spin_unlock_irqrestore(q
->queue_lock
, flags
);
2129 * Submitting request must be dequeued before calling this function
2130 * because it will be linked to another request_queue
2132 BUG_ON(blk_queued_rq(rq
));
2134 if (op_is_flush(rq
->cmd_flags
))
2135 where
= ELEVATOR_INSERT_FLUSH
;
2137 add_acct_request(q
, rq
, where
);
2138 if (where
== ELEVATOR_INSERT_FLUSH
)
2140 spin_unlock_irqrestore(q
->queue_lock
, flags
);
2144 EXPORT_SYMBOL_GPL(blk_insert_cloned_request
);
2147 * blk_rq_err_bytes - determine number of bytes till the next failure boundary
2148 * @rq: request to examine
2151 * A request could be merge of IOs which require different failure
2152 * handling. This function determines the number of bytes which
2153 * can be failed from the beginning of the request without
2154 * crossing into area which need to be retried further.
2157 * The number of bytes to fail.
2160 * queue_lock must be held.
2162 unsigned int blk_rq_err_bytes(const struct request
*rq
)
2164 unsigned int ff
= rq
->cmd_flags
& REQ_FAILFAST_MASK
;
2165 unsigned int bytes
= 0;
2168 if (!(rq
->rq_flags
& RQF_MIXED_MERGE
))
2169 return blk_rq_bytes(rq
);
2172 * Currently the only 'mixing' which can happen is between
2173 * different fastfail types. We can safely fail portions
2174 * which have all the failfast bits that the first one has -
2175 * the ones which are at least as eager to fail as the first
2178 for (bio
= rq
->bio
; bio
; bio
= bio
->bi_next
) {
2179 if ((bio
->bi_opf
& ff
) != ff
)
2181 bytes
+= bio
->bi_iter
.bi_size
;
2184 /* this could lead to infinite loop */
2185 BUG_ON(blk_rq_bytes(rq
) && !bytes
);
2188 EXPORT_SYMBOL_GPL(blk_rq_err_bytes
);
2190 void blk_account_io_completion(struct request
*req
, unsigned int bytes
)
2192 if (blk_do_io_stat(req
)) {
2193 const int rw
= rq_data_dir(req
);
2194 struct hd_struct
*part
;
2197 cpu
= part_stat_lock();
2199 part_stat_add(cpu
, part
, sectors
[rw
], bytes
>> 9);
2204 void blk_account_io_done(struct request
*req
)
2207 * Account IO completion. flush_rq isn't accounted as a
2208 * normal IO on queueing nor completion. Accounting the
2209 * containing request is enough.
2211 if (blk_do_io_stat(req
) && !(req
->rq_flags
& RQF_FLUSH_SEQ
)) {
2212 unsigned long duration
= jiffies
- req
->start_time
;
2213 const int rw
= rq_data_dir(req
);
2214 struct hd_struct
*part
;
2217 cpu
= part_stat_lock();
2220 part_stat_inc(cpu
, part
, ios
[rw
]);
2221 part_stat_add(cpu
, part
, ticks
[rw
], duration
);
2222 part_round_stats(cpu
, part
);
2223 part_dec_in_flight(part
, rw
);
2225 hd_struct_put(part
);
2232 * Don't process normal requests when queue is suspended
2233 * or in the process of suspending/resuming
2235 static struct request
*blk_pm_peek_request(struct request_queue
*q
,
2238 if (q
->dev
&& (q
->rpm_status
== RPM_SUSPENDED
||
2239 (q
->rpm_status
!= RPM_ACTIVE
&& !(rq
->rq_flags
& RQF_PM
))))
2245 static inline struct request
*blk_pm_peek_request(struct request_queue
*q
,
2252 void blk_account_io_start(struct request
*rq
, bool new_io
)
2254 struct hd_struct
*part
;
2255 int rw
= rq_data_dir(rq
);
2258 if (!blk_do_io_stat(rq
))
2261 cpu
= part_stat_lock();
2265 part_stat_inc(cpu
, part
, merges
[rw
]);
2267 part
= disk_map_sector_rcu(rq
->rq_disk
, blk_rq_pos(rq
));
2268 if (!hd_struct_try_get(part
)) {
2270 * The partition is already being removed,
2271 * the request will be accounted on the disk only
2273 * We take a reference on disk->part0 although that
2274 * partition will never be deleted, so we can treat
2275 * it as any other partition.
2277 part
= &rq
->rq_disk
->part0
;
2278 hd_struct_get(part
);
2280 part_round_stats(cpu
, part
);
2281 part_inc_in_flight(part
, rw
);
2289 * blk_peek_request - peek at the top of a request queue
2290 * @q: request queue to peek at
2293 * Return the request at the top of @q. The returned request
2294 * should be started using blk_start_request() before LLD starts
2298 * Pointer to the request at the top of @q if available. Null
2302 * queue_lock must be held.
2304 struct request
*blk_peek_request(struct request_queue
*q
)
2309 while ((rq
= __elv_next_request(q
)) != NULL
) {
2311 rq
= blk_pm_peek_request(q
, rq
);
2315 if (!(rq
->rq_flags
& RQF_STARTED
)) {
2317 * This is the first time the device driver
2318 * sees this request (possibly after
2319 * requeueing). Notify IO scheduler.
2321 if (rq
->rq_flags
& RQF_SORTED
)
2322 elv_activate_rq(q
, rq
);
2325 * just mark as started even if we don't start
2326 * it, a request that has been delayed should
2327 * not be passed by new incoming requests
2329 rq
->rq_flags
|= RQF_STARTED
;
2330 trace_block_rq_issue(q
, rq
);
2333 if (!q
->boundary_rq
|| q
->boundary_rq
== rq
) {
2334 q
->end_sector
= rq_end_sector(rq
);
2335 q
->boundary_rq
= NULL
;
2338 if (rq
->rq_flags
& RQF_DONTPREP
)
2341 if (q
->dma_drain_size
&& blk_rq_bytes(rq
)) {
2343 * make sure space for the drain appears we
2344 * know we can do this because max_hw_segments
2345 * has been adjusted to be one fewer than the
2348 rq
->nr_phys_segments
++;
2354 ret
= q
->prep_rq_fn(q
, rq
);
2355 if (ret
== BLKPREP_OK
) {
2357 } else if (ret
== BLKPREP_DEFER
) {
2359 * the request may have been (partially) prepped.
2360 * we need to keep this request in the front to
2361 * avoid resource deadlock. RQF_STARTED will
2362 * prevent other fs requests from passing this one.
2364 if (q
->dma_drain_size
&& blk_rq_bytes(rq
) &&
2365 !(rq
->rq_flags
& RQF_DONTPREP
)) {
2367 * remove the space for the drain we added
2368 * so that we don't add it again
2370 --rq
->nr_phys_segments
;
2375 } else if (ret
== BLKPREP_KILL
|| ret
== BLKPREP_INVALID
) {
2376 int err
= (ret
== BLKPREP_INVALID
) ? -EREMOTEIO
: -EIO
;
2378 rq
->rq_flags
|= RQF_QUIET
;
2380 * Mark this request as started so we don't trigger
2381 * any debug logic in the end I/O path.
2383 blk_start_request(rq
);
2384 __blk_end_request_all(rq
, err
);
2386 printk(KERN_ERR
"%s: bad return=%d\n", __func__
, ret
);
2393 EXPORT_SYMBOL(blk_peek_request
);
2395 void blk_dequeue_request(struct request
*rq
)
2397 struct request_queue
*q
= rq
->q
;
2399 BUG_ON(list_empty(&rq
->queuelist
));
2400 BUG_ON(ELV_ON_HASH(rq
));
2402 list_del_init(&rq
->queuelist
);
2405 * the time frame between a request being removed from the lists
2406 * and to it is freed is accounted as io that is in progress at
2409 if (blk_account_rq(rq
)) {
2410 q
->in_flight
[rq_is_sync(rq
)]++;
2411 set_io_start_time_ns(rq
);
2416 * blk_start_request - start request processing on the driver
2417 * @req: request to dequeue
2420 * Dequeue @req and start timeout timer on it. This hands off the
2421 * request to the driver.
2423 * Block internal functions which don't want to start timer should
2424 * call blk_dequeue_request().
2427 * queue_lock must be held.
2429 void blk_start_request(struct request
*req
)
2431 blk_dequeue_request(req
);
2433 if (test_bit(QUEUE_FLAG_STATS
, &req
->q
->queue_flags
)) {
2434 blk_stat_set_issue_time(&req
->issue_stat
);
2435 req
->rq_flags
|= RQF_STATS
;
2436 wbt_issue(req
->q
->rq_wb
, &req
->issue_stat
);
2439 BUG_ON(test_bit(REQ_ATOM_COMPLETE
, &req
->atomic_flags
));
2442 EXPORT_SYMBOL(blk_start_request
);
2445 * blk_fetch_request - fetch a request from a request queue
2446 * @q: request queue to fetch a request from
2449 * Return the request at the top of @q. The request is started on
2450 * return and LLD can start processing it immediately.
2453 * Pointer to the request at the top of @q if available. Null
2457 * queue_lock must be held.
2459 struct request
*blk_fetch_request(struct request_queue
*q
)
2463 rq
= blk_peek_request(q
);
2465 blk_start_request(rq
);
2468 EXPORT_SYMBOL(blk_fetch_request
);
2471 * blk_update_request - Special helper function for request stacking drivers
2472 * @req: the request being processed
2473 * @error: %0 for success, < %0 for error
2474 * @nr_bytes: number of bytes to complete @req
2477 * Ends I/O on a number of bytes attached to @req, but doesn't complete
2478 * the request structure even if @req doesn't have leftover.
2479 * If @req has leftover, sets it up for the next range of segments.
2481 * This special helper function is only for request stacking drivers
2482 * (e.g. request-based dm) so that they can handle partial completion.
2483 * Actual device drivers should use blk_end_request instead.
2485 * Passing the result of blk_rq_bytes() as @nr_bytes guarantees
2486 * %false return from this function.
2489 * %false - this request doesn't have any more data
2490 * %true - this request has more data
2492 bool blk_update_request(struct request
*req
, int error
, unsigned int nr_bytes
)
2496 trace_block_rq_complete(req
->q
, req
, nr_bytes
);
2502 * For fs requests, rq is just carrier of independent bio's
2503 * and each partial completion should be handled separately.
2504 * Reset per-request error on each partial completion.
2506 * TODO: tj: This is too subtle. It would be better to let
2507 * low level drivers do what they see fit.
2509 if (!blk_rq_is_passthrough(req
))
2512 if (error
&& !blk_rq_is_passthrough(req
) &&
2513 !(req
->rq_flags
& RQF_QUIET
)) {
2518 error_type
= "recoverable transport";
2521 error_type
= "critical target";
2524 error_type
= "critical nexus";
2527 error_type
= "timeout";
2530 error_type
= "critical space allocation";
2533 error_type
= "critical medium";
2540 printk_ratelimited(KERN_ERR
"%s: %s error, dev %s, sector %llu\n",
2541 __func__
, error_type
, req
->rq_disk
?
2542 req
->rq_disk
->disk_name
: "?",
2543 (unsigned long long)blk_rq_pos(req
));
2547 blk_account_io_completion(req
, nr_bytes
);
2551 struct bio
*bio
= req
->bio
;
2552 unsigned bio_bytes
= min(bio
->bi_iter
.bi_size
, nr_bytes
);
2554 if (bio_bytes
== bio
->bi_iter
.bi_size
)
2555 req
->bio
= bio
->bi_next
;
2557 req_bio_endio(req
, bio
, bio_bytes
, error
);
2559 total_bytes
+= bio_bytes
;
2560 nr_bytes
-= bio_bytes
;
2571 * Reset counters so that the request stacking driver
2572 * can find how many bytes remain in the request
2575 req
->__data_len
= 0;
2579 WARN_ON_ONCE(req
->rq_flags
& RQF_SPECIAL_PAYLOAD
);
2581 req
->__data_len
-= total_bytes
;
2583 /* update sector only for requests with clear definition of sector */
2584 if (!blk_rq_is_passthrough(req
))
2585 req
->__sector
+= total_bytes
>> 9;
2587 /* mixed attributes always follow the first bio */
2588 if (req
->rq_flags
& RQF_MIXED_MERGE
) {
2589 req
->cmd_flags
&= ~REQ_FAILFAST_MASK
;
2590 req
->cmd_flags
|= req
->bio
->bi_opf
& REQ_FAILFAST_MASK
;
2594 * If total number of sectors is less than the first segment
2595 * size, something has gone terribly wrong.
2597 if (blk_rq_bytes(req
) < blk_rq_cur_bytes(req
)) {
2598 blk_dump_rq_flags(req
, "request botched");
2599 req
->__data_len
= blk_rq_cur_bytes(req
);
2602 /* recalculate the number of segments */
2603 blk_recalc_rq_segments(req
);
2607 EXPORT_SYMBOL_GPL(blk_update_request
);
2609 static bool blk_update_bidi_request(struct request
*rq
, int error
,
2610 unsigned int nr_bytes
,
2611 unsigned int bidi_bytes
)
2613 if (blk_update_request(rq
, error
, nr_bytes
))
2616 /* Bidi request must be completed as a whole */
2617 if (unlikely(blk_bidi_rq(rq
)) &&
2618 blk_update_request(rq
->next_rq
, error
, bidi_bytes
))
2621 if (blk_queue_add_random(rq
->q
))
2622 add_disk_randomness(rq
->rq_disk
);
2628 * blk_unprep_request - unprepare a request
2631 * This function makes a request ready for complete resubmission (or
2632 * completion). It happens only after all error handling is complete,
2633 * so represents the appropriate moment to deallocate any resources
2634 * that were allocated to the request in the prep_rq_fn. The queue
2635 * lock is held when calling this.
2637 void blk_unprep_request(struct request
*req
)
2639 struct request_queue
*q
= req
->q
;
2641 req
->rq_flags
&= ~RQF_DONTPREP
;
2642 if (q
->unprep_rq_fn
)
2643 q
->unprep_rq_fn(q
, req
);
2645 EXPORT_SYMBOL_GPL(blk_unprep_request
);
2648 * queue lock must be held
2650 void blk_finish_request(struct request
*req
, int error
)
2652 struct request_queue
*q
= req
->q
;
2654 if (req
->rq_flags
& RQF_STATS
)
2655 blk_stat_add(&q
->rq_stats
[rq_data_dir(req
)], req
);
2657 if (req
->rq_flags
& RQF_QUEUED
)
2658 blk_queue_end_tag(q
, req
);
2660 BUG_ON(blk_queued_rq(req
));
2662 if (unlikely(laptop_mode
) && !blk_rq_is_passthrough(req
))
2663 laptop_io_completion(req
->q
->backing_dev_info
);
2665 blk_delete_timer(req
);
2667 if (req
->rq_flags
& RQF_DONTPREP
)
2668 blk_unprep_request(req
);
2670 blk_account_io_done(req
);
2673 wbt_done(req
->q
->rq_wb
, &req
->issue_stat
);
2674 req
->end_io(req
, error
);
2676 if (blk_bidi_rq(req
))
2677 __blk_put_request(req
->next_rq
->q
, req
->next_rq
);
2679 __blk_put_request(q
, req
);
2682 EXPORT_SYMBOL(blk_finish_request
);
2685 * blk_end_bidi_request - Complete a bidi request
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 * Ends I/O on a number of bytes attached to @rq and @rq->next_rq.
2693 * Drivers that supports bidi can safely call this member for any
2694 * type of request, bidi or uni. In the later case @bidi_bytes is
2698 * %false - we are done with this request
2699 * %true - still buffers pending for this request
2701 static bool blk_end_bidi_request(struct request
*rq
, int error
,
2702 unsigned int nr_bytes
, unsigned int bidi_bytes
)
2704 struct request_queue
*q
= rq
->q
;
2705 unsigned long flags
;
2707 if (blk_update_bidi_request(rq
, error
, nr_bytes
, bidi_bytes
))
2710 spin_lock_irqsave(q
->queue_lock
, flags
);
2711 blk_finish_request(rq
, error
);
2712 spin_unlock_irqrestore(q
->queue_lock
, flags
);
2718 * __blk_end_bidi_request - Complete a bidi request with queue lock held
2719 * @rq: the request to complete
2720 * @error: %0 for success, < %0 for error
2721 * @nr_bytes: number of bytes to complete @rq
2722 * @bidi_bytes: number of bytes to complete @rq->next_rq
2725 * Identical to blk_end_bidi_request() except that queue lock is
2726 * assumed to be locked on entry and remains so on return.
2729 * %false - we are done with this request
2730 * %true - still buffers pending for this request
2732 bool __blk_end_bidi_request(struct request
*rq
, int error
,
2733 unsigned int nr_bytes
, unsigned int bidi_bytes
)
2735 if (blk_update_bidi_request(rq
, error
, nr_bytes
, bidi_bytes
))
2738 blk_finish_request(rq
, error
);
2744 * blk_end_request - Helper function for drivers to complete the request.
2745 * @rq: the request being processed
2746 * @error: %0 for success, < %0 for error
2747 * @nr_bytes: number of bytes to complete
2750 * Ends I/O on a number of bytes attached to @rq.
2751 * If @rq has leftover, sets it up for the next range of segments.
2754 * %false - we are done with this request
2755 * %true - still buffers pending for this request
2757 bool blk_end_request(struct request
*rq
, int error
, unsigned int nr_bytes
)
2759 return blk_end_bidi_request(rq
, error
, nr_bytes
, 0);
2761 EXPORT_SYMBOL(blk_end_request
);
2764 * blk_end_request_all - Helper function for drives to finish the request.
2765 * @rq: the request to finish
2766 * @error: %0 for success, < %0 for error
2769 * Completely finish @rq.
2771 void blk_end_request_all(struct request
*rq
, int error
)
2774 unsigned int bidi_bytes
= 0;
2776 if (unlikely(blk_bidi_rq(rq
)))
2777 bidi_bytes
= blk_rq_bytes(rq
->next_rq
);
2779 pending
= blk_end_bidi_request(rq
, error
, blk_rq_bytes(rq
), bidi_bytes
);
2782 EXPORT_SYMBOL(blk_end_request_all
);
2785 * blk_end_request_cur - Helper function to finish the current request chunk.
2786 * @rq: the request to finish the current chunk for
2787 * @error: %0 for success, < %0 for error
2790 * Complete the current consecutively mapped chunk from @rq.
2793 * %false - we are done with this request
2794 * %true - still buffers pending for this request
2796 bool blk_end_request_cur(struct request
*rq
, int error
)
2798 return blk_end_request(rq
, error
, blk_rq_cur_bytes(rq
));
2800 EXPORT_SYMBOL(blk_end_request_cur
);
2803 * blk_end_request_err - Finish a request till the next failure boundary.
2804 * @rq: the request to finish till the next failure boundary for
2805 * @error: must be negative errno
2808 * Complete @rq till the next failure boundary.
2811 * %false - we are done with this request
2812 * %true - still buffers pending for this request
2814 bool blk_end_request_err(struct request
*rq
, int error
)
2816 WARN_ON(error
>= 0);
2817 return blk_end_request(rq
, error
, blk_rq_err_bytes(rq
));
2819 EXPORT_SYMBOL_GPL(blk_end_request_err
);
2822 * __blk_end_request - Helper function for drivers to complete the request.
2823 * @rq: the request being processed
2824 * @error: %0 for success, < %0 for error
2825 * @nr_bytes: number of bytes to complete
2828 * Must be called with queue lock held unlike blk_end_request().
2831 * %false - we are done with this request
2832 * %true - still buffers pending for this request
2834 bool __blk_end_request(struct request
*rq
, int error
, unsigned int nr_bytes
)
2836 return __blk_end_bidi_request(rq
, error
, nr_bytes
, 0);
2838 EXPORT_SYMBOL(__blk_end_request
);
2841 * __blk_end_request_all - Helper function for drives to finish the request.
2842 * @rq: the request to finish
2843 * @error: %0 for success, < %0 for error
2846 * Completely finish @rq. Must be called with queue lock held.
2848 void __blk_end_request_all(struct request
*rq
, int error
)
2851 unsigned int bidi_bytes
= 0;
2853 if (unlikely(blk_bidi_rq(rq
)))
2854 bidi_bytes
= blk_rq_bytes(rq
->next_rq
);
2856 pending
= __blk_end_bidi_request(rq
, error
, blk_rq_bytes(rq
), bidi_bytes
);
2859 EXPORT_SYMBOL(__blk_end_request_all
);
2862 * __blk_end_request_cur - Helper function to finish the current request chunk.
2863 * @rq: the request to finish the current chunk for
2864 * @error: %0 for success, < %0 for error
2867 * Complete the current consecutively mapped chunk from @rq. Must
2868 * be called with queue lock held.
2871 * %false - we are done with this request
2872 * %true - still buffers pending for this request
2874 bool __blk_end_request_cur(struct request
*rq
, int error
)
2876 return __blk_end_request(rq
, error
, blk_rq_cur_bytes(rq
));
2878 EXPORT_SYMBOL(__blk_end_request_cur
);
2881 * __blk_end_request_err - Finish a request till the next failure boundary.
2882 * @rq: the request to finish till the next failure boundary for
2883 * @error: must be negative errno
2886 * Complete @rq till the next failure boundary. Must be called
2887 * with queue lock held.
2890 * %false - we are done with this request
2891 * %true - still buffers pending for this request
2893 bool __blk_end_request_err(struct request
*rq
, int error
)
2895 WARN_ON(error
>= 0);
2896 return __blk_end_request(rq
, error
, blk_rq_err_bytes(rq
));
2898 EXPORT_SYMBOL_GPL(__blk_end_request_err
);
2900 void blk_rq_bio_prep(struct request_queue
*q
, struct request
*rq
,
2903 if (bio_has_data(bio
))
2904 rq
->nr_phys_segments
= bio_phys_segments(q
, bio
);
2906 rq
->__data_len
= bio
->bi_iter
.bi_size
;
2907 rq
->bio
= rq
->biotail
= bio
;
2910 rq
->rq_disk
= bio
->bi_bdev
->bd_disk
;
2913 #if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
2915 * rq_flush_dcache_pages - Helper function to flush all pages in a request
2916 * @rq: the request to be flushed
2919 * Flush all pages in @rq.
2921 void rq_flush_dcache_pages(struct request
*rq
)
2923 struct req_iterator iter
;
2924 struct bio_vec bvec
;
2926 rq_for_each_segment(bvec
, rq
, iter
)
2927 flush_dcache_page(bvec
.bv_page
);
2929 EXPORT_SYMBOL_GPL(rq_flush_dcache_pages
);
2933 * blk_lld_busy - Check if underlying low-level drivers of a device are busy
2934 * @q : the queue of the device being checked
2937 * Check if underlying low-level drivers of a device are busy.
2938 * If the drivers want to export their busy state, they must set own
2939 * exporting function using blk_queue_lld_busy() first.
2941 * Basically, this function is used only by request stacking drivers
2942 * to stop dispatching requests to underlying devices when underlying
2943 * devices are busy. This behavior helps more I/O merging on the queue
2944 * of the request stacking driver and prevents I/O throughput regression
2945 * on burst I/O load.
2948 * 0 - Not busy (The request stacking driver should dispatch request)
2949 * 1 - Busy (The request stacking driver should stop dispatching request)
2951 int blk_lld_busy(struct request_queue
*q
)
2954 return q
->lld_busy_fn(q
);
2958 EXPORT_SYMBOL_GPL(blk_lld_busy
);
2961 * blk_rq_unprep_clone - Helper function to free all bios in a cloned request
2962 * @rq: the clone request to be cleaned up
2965 * Free all bios in @rq for a cloned request.
2967 void blk_rq_unprep_clone(struct request
*rq
)
2971 while ((bio
= rq
->bio
) != NULL
) {
2972 rq
->bio
= bio
->bi_next
;
2977 EXPORT_SYMBOL_GPL(blk_rq_unprep_clone
);
2980 * Copy attributes of the original request to the clone request.
2981 * The actual data parts (e.g. ->cmd, ->sense) are not copied.
2983 static void __blk_rq_prep_clone(struct request
*dst
, struct request
*src
)
2985 dst
->cpu
= src
->cpu
;
2986 dst
->__sector
= blk_rq_pos(src
);
2987 dst
->__data_len
= blk_rq_bytes(src
);
2988 dst
->nr_phys_segments
= src
->nr_phys_segments
;
2989 dst
->ioprio
= src
->ioprio
;
2990 dst
->extra_len
= src
->extra_len
;
2994 * blk_rq_prep_clone - Helper function to setup clone request
2995 * @rq: the request to be setup
2996 * @rq_src: original request to be cloned
2997 * @bs: bio_set that bios for clone are allocated from
2998 * @gfp_mask: memory allocation mask for bio
2999 * @bio_ctr: setup function to be called for each clone bio.
3000 * Returns %0 for success, non %0 for failure.
3001 * @data: private data to be passed to @bio_ctr
3004 * Clones bios in @rq_src to @rq, and copies attributes of @rq_src to @rq.
3005 * The actual data parts of @rq_src (e.g. ->cmd, ->sense)
3006 * are not copied, and copying such parts is the caller's responsibility.
3007 * Also, pages which the original bios are pointing to are not copied
3008 * and the cloned bios just point same pages.
3009 * So cloned bios must be completed before original bios, which means
3010 * the caller must complete @rq before @rq_src.
3012 int blk_rq_prep_clone(struct request
*rq
, struct request
*rq_src
,
3013 struct bio_set
*bs
, gfp_t gfp_mask
,
3014 int (*bio_ctr
)(struct bio
*, struct bio
*, void *),
3017 struct bio
*bio
, *bio_src
;
3022 __rq_for_each_bio(bio_src
, rq_src
) {
3023 bio
= bio_clone_fast(bio_src
, gfp_mask
, bs
);
3027 if (bio_ctr
&& bio_ctr(bio
, bio_src
, data
))
3031 rq
->biotail
->bi_next
= bio
;
3034 rq
->bio
= rq
->biotail
= bio
;
3037 __blk_rq_prep_clone(rq
, rq_src
);
3044 blk_rq_unprep_clone(rq
);
3048 EXPORT_SYMBOL_GPL(blk_rq_prep_clone
);
3050 int kblockd_schedule_work(struct work_struct
*work
)
3052 return queue_work(kblockd_workqueue
, work
);
3054 EXPORT_SYMBOL(kblockd_schedule_work
);
3056 int kblockd_schedule_work_on(int cpu
, struct work_struct
*work
)
3058 return queue_work_on(cpu
, kblockd_workqueue
, work
);
3060 EXPORT_SYMBOL(kblockd_schedule_work_on
);
3062 int kblockd_schedule_delayed_work(struct delayed_work
*dwork
,
3063 unsigned long delay
)
3065 return queue_delayed_work(kblockd_workqueue
, dwork
, delay
);
3067 EXPORT_SYMBOL(kblockd_schedule_delayed_work
);
3069 int kblockd_schedule_delayed_work_on(int cpu
, struct delayed_work
*dwork
,
3070 unsigned long delay
)
3072 return queue_delayed_work_on(cpu
, kblockd_workqueue
, dwork
, delay
);
3074 EXPORT_SYMBOL(kblockd_schedule_delayed_work_on
);
3077 * blk_start_plug - initialize blk_plug and track it inside the task_struct
3078 * @plug: The &struct blk_plug that needs to be initialized
3081 * Tracking blk_plug inside the task_struct will help with auto-flushing the
3082 * pending I/O should the task end up blocking between blk_start_plug() and
3083 * blk_finish_plug(). This is important from a performance perspective, but
3084 * also ensures that we don't deadlock. For instance, if the task is blocking
3085 * for a memory allocation, memory reclaim could end up wanting to free a
3086 * page belonging to that request that is currently residing in our private
3087 * plug. By flushing the pending I/O when the process goes to sleep, we avoid
3088 * this kind of deadlock.
3090 void blk_start_plug(struct blk_plug
*plug
)
3092 struct task_struct
*tsk
= current
;
3095 * If this is a nested plug, don't actually assign it.
3100 INIT_LIST_HEAD(&plug
->list
);
3101 INIT_LIST_HEAD(&plug
->mq_list
);
3102 INIT_LIST_HEAD(&plug
->cb_list
);
3104 * Store ordering should not be needed here, since a potential
3105 * preempt will imply a full memory barrier
3109 EXPORT_SYMBOL(blk_start_plug
);
3111 static int plug_rq_cmp(void *priv
, struct list_head
*a
, struct list_head
*b
)
3113 struct request
*rqa
= container_of(a
, struct request
, queuelist
);
3114 struct request
*rqb
= container_of(b
, struct request
, queuelist
);
3116 return !(rqa
->q
< rqb
->q
||
3117 (rqa
->q
== rqb
->q
&& blk_rq_pos(rqa
) < blk_rq_pos(rqb
)));
3121 * If 'from_schedule' is true, then postpone the dispatch of requests
3122 * until a safe kblockd context. We due this to avoid accidental big
3123 * additional stack usage in driver dispatch, in places where the originally
3124 * plugger did not intend it.
3126 static void queue_unplugged(struct request_queue
*q
, unsigned int depth
,
3128 __releases(q
->queue_lock
)
3130 trace_block_unplug(q
, depth
, !from_schedule
);
3133 blk_run_queue_async(q
);
3136 spin_unlock(q
->queue_lock
);
3139 static void flush_plug_callbacks(struct blk_plug
*plug
, bool from_schedule
)
3141 LIST_HEAD(callbacks
);
3143 while (!list_empty(&plug
->cb_list
)) {
3144 list_splice_init(&plug
->cb_list
, &callbacks
);
3146 while (!list_empty(&callbacks
)) {
3147 struct blk_plug_cb
*cb
= list_first_entry(&callbacks
,
3150 list_del(&cb
->list
);
3151 cb
->callback(cb
, from_schedule
);
3156 struct blk_plug_cb
*blk_check_plugged(blk_plug_cb_fn unplug
, void *data
,
3159 struct blk_plug
*plug
= current
->plug
;
3160 struct blk_plug_cb
*cb
;
3165 list_for_each_entry(cb
, &plug
->cb_list
, list
)
3166 if (cb
->callback
== unplug
&& cb
->data
== data
)
3169 /* Not currently on the callback list */
3170 BUG_ON(size
< sizeof(*cb
));
3171 cb
= kzalloc(size
, GFP_ATOMIC
);
3174 cb
->callback
= unplug
;
3175 list_add(&cb
->list
, &plug
->cb_list
);
3179 EXPORT_SYMBOL(blk_check_plugged
);
3181 void blk_flush_plug_list(struct blk_plug
*plug
, bool from_schedule
)
3183 struct request_queue
*q
;
3184 unsigned long flags
;
3189 flush_plug_callbacks(plug
, from_schedule
);
3191 if (!list_empty(&plug
->mq_list
))
3192 blk_mq_flush_plug_list(plug
, from_schedule
);
3194 if (list_empty(&plug
->list
))
3197 list_splice_init(&plug
->list
, &list
);
3199 list_sort(NULL
, &list
, plug_rq_cmp
);
3205 * Save and disable interrupts here, to avoid doing it for every
3206 * queue lock we have to take.
3208 local_irq_save(flags
);
3209 while (!list_empty(&list
)) {
3210 rq
= list_entry_rq(list
.next
);
3211 list_del_init(&rq
->queuelist
);
3215 * This drops the queue lock
3218 queue_unplugged(q
, depth
, from_schedule
);
3221 spin_lock(q
->queue_lock
);
3225 * Short-circuit if @q is dead
3227 if (unlikely(blk_queue_dying(q
))) {
3228 __blk_end_request_all(rq
, -ENODEV
);
3233 * rq is already accounted, so use raw insert
3235 if (op_is_flush(rq
->cmd_flags
))
3236 __elv_add_request(q
, rq
, ELEVATOR_INSERT_FLUSH
);
3238 __elv_add_request(q
, rq
, ELEVATOR_INSERT_SORT_MERGE
);
3244 * This drops the queue lock
3247 queue_unplugged(q
, depth
, from_schedule
);
3249 local_irq_restore(flags
);
3252 void blk_finish_plug(struct blk_plug
*plug
)
3254 if (plug
!= current
->plug
)
3256 blk_flush_plug_list(plug
, false);
3258 current
->plug
= NULL
;
3260 EXPORT_SYMBOL(blk_finish_plug
);
3264 * blk_pm_runtime_init - Block layer runtime PM initialization routine
3265 * @q: the queue of the device
3266 * @dev: the device the queue belongs to
3269 * Initialize runtime-PM-related fields for @q and start auto suspend for
3270 * @dev. Drivers that want to take advantage of request-based runtime PM
3271 * should call this function after @dev has been initialized, and its
3272 * request queue @q has been allocated, and runtime PM for it can not happen
3273 * yet(either due to disabled/forbidden or its usage_count > 0). In most
3274 * cases, driver should call this function before any I/O has taken place.
3276 * This function takes care of setting up using auto suspend for the device,
3277 * the autosuspend delay is set to -1 to make runtime suspend impossible
3278 * until an updated value is either set by user or by driver. Drivers do
3279 * not need to touch other autosuspend settings.
3281 * The block layer runtime PM is request based, so only works for drivers
3282 * that use request as their IO unit instead of those directly use bio's.
3284 void blk_pm_runtime_init(struct request_queue
*q
, struct device
*dev
)
3287 q
->rpm_status
= RPM_ACTIVE
;
3288 pm_runtime_set_autosuspend_delay(q
->dev
, -1);
3289 pm_runtime_use_autosuspend(q
->dev
);
3291 EXPORT_SYMBOL(blk_pm_runtime_init
);
3294 * blk_pre_runtime_suspend - Pre runtime suspend check
3295 * @q: the queue of the device
3298 * This function will check if runtime suspend is allowed for the device
3299 * by examining if there are any requests pending in the queue. If there
3300 * are requests pending, the device can not be runtime suspended; otherwise,
3301 * the queue's status will be updated to SUSPENDING and the driver can
3302 * proceed to suspend the device.
3304 * For the not allowed case, we mark last busy for the device so that
3305 * runtime PM core will try to autosuspend it some time later.
3307 * This function should be called near the start of the device's
3308 * runtime_suspend callback.
3311 * 0 - OK to runtime suspend the device
3312 * -EBUSY - Device should not be runtime suspended
3314 int blk_pre_runtime_suspend(struct request_queue
*q
)
3321 spin_lock_irq(q
->queue_lock
);
3322 if (q
->nr_pending
) {
3324 pm_runtime_mark_last_busy(q
->dev
);
3326 q
->rpm_status
= RPM_SUSPENDING
;
3328 spin_unlock_irq(q
->queue_lock
);
3331 EXPORT_SYMBOL(blk_pre_runtime_suspend
);
3334 * blk_post_runtime_suspend - Post runtime suspend processing
3335 * @q: the queue of the device
3336 * @err: return value of the device's runtime_suspend function
3339 * Update the queue's runtime status according to the return value of the
3340 * device's runtime suspend function and mark last busy for the device so
3341 * that PM core will try to auto suspend the device at a later time.
3343 * This function should be called near the end of the device's
3344 * runtime_suspend callback.
3346 void blk_post_runtime_suspend(struct request_queue
*q
, int err
)
3351 spin_lock_irq(q
->queue_lock
);
3353 q
->rpm_status
= RPM_SUSPENDED
;
3355 q
->rpm_status
= RPM_ACTIVE
;
3356 pm_runtime_mark_last_busy(q
->dev
);
3358 spin_unlock_irq(q
->queue_lock
);
3360 EXPORT_SYMBOL(blk_post_runtime_suspend
);
3363 * blk_pre_runtime_resume - Pre runtime resume processing
3364 * @q: the queue of the device
3367 * Update the queue's runtime status to RESUMING in preparation for the
3368 * runtime resume of the device.
3370 * This function should be called near the start of the device's
3371 * runtime_resume callback.
3373 void blk_pre_runtime_resume(struct request_queue
*q
)
3378 spin_lock_irq(q
->queue_lock
);
3379 q
->rpm_status
= RPM_RESUMING
;
3380 spin_unlock_irq(q
->queue_lock
);
3382 EXPORT_SYMBOL(blk_pre_runtime_resume
);
3385 * blk_post_runtime_resume - Post runtime resume processing
3386 * @q: the queue of the device
3387 * @err: return value of the device's runtime_resume function
3390 * Update the queue's runtime status according to the return value of the
3391 * device's runtime_resume function. If it is successfully resumed, process
3392 * the requests that are queued into the device's queue when it is resuming
3393 * and then mark last busy and initiate autosuspend for it.
3395 * This function should be called near the end of the device's
3396 * runtime_resume callback.
3398 void blk_post_runtime_resume(struct request_queue
*q
, int err
)
3403 spin_lock_irq(q
->queue_lock
);
3405 q
->rpm_status
= RPM_ACTIVE
;
3407 pm_runtime_mark_last_busy(q
->dev
);
3408 pm_request_autosuspend(q
->dev
);
3410 q
->rpm_status
= RPM_SUSPENDED
;
3412 spin_unlock_irq(q
->queue_lock
);
3414 EXPORT_SYMBOL(blk_post_runtime_resume
);
3417 * blk_set_runtime_active - Force runtime status of the queue to be active
3418 * @q: the queue of the device
3420 * If the device is left runtime suspended during system suspend the resume
3421 * hook typically resumes the device and corrects runtime status
3422 * accordingly. However, that does not affect the queue runtime PM status
3423 * which is still "suspended". This prevents processing requests from the
3426 * This function can be used in driver's resume hook to correct queue
3427 * runtime PM status and re-enable peeking requests from the queue. It
3428 * should be called before first request is added to the queue.
3430 void blk_set_runtime_active(struct request_queue
*q
)
3432 spin_lock_irq(q
->queue_lock
);
3433 q
->rpm_status
= RPM_ACTIVE
;
3434 pm_runtime_mark_last_busy(q
->dev
);
3435 pm_request_autosuspend(q
->dev
);
3436 spin_unlock_irq(q
->queue_lock
);
3438 EXPORT_SYMBOL(blk_set_runtime_active
);
3441 int __init
blk_dev_init(void)
3443 BUILD_BUG_ON(REQ_OP_LAST
>= (1 << REQ_OP_BITS
));
3444 BUILD_BUG_ON(REQ_OP_BITS
+ REQ_FLAG_BITS
> 8 *
3445 FIELD_SIZEOF(struct request
, cmd_flags
));
3446 BUILD_BUG_ON(REQ_OP_BITS
+ REQ_FLAG_BITS
> 8 *
3447 FIELD_SIZEOF(struct bio
, bi_opf
));
3449 /* used for unplugging and affects IO latency/throughput - HIGHPRI */
3450 kblockd_workqueue
= alloc_workqueue("kblockd",
3451 WQ_MEM_RECLAIM
| WQ_HIGHPRI
, 0);
3452 if (!kblockd_workqueue
)
3453 panic("Failed to create kblockd\n");
3455 request_cachep
= kmem_cache_create("blkdev_requests",
3456 sizeof(struct request
), 0, SLAB_PANIC
, NULL
);
3458 blk_requestq_cachep
= kmem_cache_create("request_queue",
3459 sizeof(struct request_queue
), 0, SLAB_PANIC
, NULL
);