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>
44 EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_remap
);
45 EXPORT_TRACEPOINT_SYMBOL_GPL(block_rq_remap
);
46 EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_complete
);
47 EXPORT_TRACEPOINT_SYMBOL_GPL(block_split
);
48 EXPORT_TRACEPOINT_SYMBOL_GPL(block_unplug
);
50 DEFINE_IDA(blk_queue_ida
);
53 * For the allocated request tables
55 struct kmem_cache
*request_cachep
;
58 * For queue allocation
60 struct kmem_cache
*blk_requestq_cachep
;
63 * Controlling structure to kblockd
65 static struct workqueue_struct
*kblockd_workqueue
;
67 static void blk_clear_congested(struct request_list
*rl
, int sync
)
69 #ifdef CONFIG_CGROUP_WRITEBACK
70 clear_wb_congested(rl
->blkg
->wb_congested
, sync
);
73 * If !CGROUP_WRITEBACK, all blkg's map to bdi->wb and we shouldn't
74 * flip its congestion state for events on other blkcgs.
76 if (rl
== &rl
->q
->root_rl
)
77 clear_wb_congested(rl
->q
->backing_dev_info
.wb
.congested
, sync
);
81 static void blk_set_congested(struct request_list
*rl
, int sync
)
83 #ifdef CONFIG_CGROUP_WRITEBACK
84 set_wb_congested(rl
->blkg
->wb_congested
, sync
);
86 /* see blk_clear_congested() */
87 if (rl
== &rl
->q
->root_rl
)
88 set_wb_congested(rl
->q
->backing_dev_info
.wb
.congested
, sync
);
92 void blk_queue_congestion_threshold(struct request_queue
*q
)
96 nr
= q
->nr_requests
- (q
->nr_requests
/ 8) + 1;
97 if (nr
> q
->nr_requests
)
99 q
->nr_congestion_on
= nr
;
101 nr
= q
->nr_requests
- (q
->nr_requests
/ 8) - (q
->nr_requests
/ 16) - 1;
104 q
->nr_congestion_off
= nr
;
108 * blk_get_backing_dev_info - get the address of a queue's backing_dev_info
111 * Locates the passed device's request queue and returns the address of its
112 * backing_dev_info. This function can only be called if @bdev is opened
113 * and the return value is never NULL.
115 struct backing_dev_info
*blk_get_backing_dev_info(struct block_device
*bdev
)
117 struct request_queue
*q
= bdev_get_queue(bdev
);
119 return &q
->backing_dev_info
;
121 EXPORT_SYMBOL(blk_get_backing_dev_info
);
123 void blk_rq_init(struct request_queue
*q
, struct request
*rq
)
125 memset(rq
, 0, sizeof(*rq
));
127 INIT_LIST_HEAD(&rq
->queuelist
);
128 INIT_LIST_HEAD(&rq
->timeout_list
);
131 rq
->__sector
= (sector_t
) -1;
132 INIT_HLIST_NODE(&rq
->hash
);
133 RB_CLEAR_NODE(&rq
->rb_node
);
135 rq
->cmd_len
= BLK_MAX_CDB
;
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
)
163 printk(KERN_INFO
"%s: dev %s: type=%x, flags=%llx\n", msg
,
164 rq
->rq_disk
? rq
->rq_disk
->disk_name
: "?", rq
->cmd_type
,
165 (unsigned long long) rq
->cmd_flags
);
167 printk(KERN_INFO
" sector %llu, nr/cnr %u/%u\n",
168 (unsigned long long)blk_rq_pos(rq
),
169 blk_rq_sectors(rq
), blk_rq_cur_sectors(rq
));
170 printk(KERN_INFO
" bio %p, biotail %p, len %u\n",
171 rq
->bio
, rq
->biotail
, blk_rq_bytes(rq
));
173 if (rq
->cmd_type
== REQ_TYPE_BLOCK_PC
) {
174 printk(KERN_INFO
" cdb: ");
175 for (bit
= 0; bit
< BLK_MAX_CDB
; bit
++)
176 printk("%02x ", rq
->cmd
[bit
]);
180 EXPORT_SYMBOL(blk_dump_rq_flags
);
182 static void blk_delay_work(struct work_struct
*work
)
184 struct request_queue
*q
;
186 q
= container_of(work
, struct request_queue
, delay_work
.work
);
187 spin_lock_irq(q
->queue_lock
);
189 spin_unlock_irq(q
->queue_lock
);
193 * blk_delay_queue - restart queueing after defined interval
194 * @q: The &struct request_queue in question
195 * @msecs: Delay in msecs
198 * Sometimes queueing needs to be postponed for a little while, to allow
199 * resources to come back. This function will make sure that queueing is
200 * restarted around the specified time. Queue lock must be held.
202 void blk_delay_queue(struct request_queue
*q
, unsigned long msecs
)
204 if (likely(!blk_queue_dead(q
)))
205 queue_delayed_work(kblockd_workqueue
, &q
->delay_work
,
206 msecs_to_jiffies(msecs
));
208 EXPORT_SYMBOL(blk_delay_queue
);
211 * blk_start_queue_async - asynchronously restart a previously stopped queue
212 * @q: The &struct request_queue in question
215 * blk_start_queue_async() will clear the stop flag on the queue, and
216 * ensure that the request_fn for the queue is run from an async
219 void blk_start_queue_async(struct request_queue
*q
)
221 queue_flag_clear(QUEUE_FLAG_STOPPED
, q
);
222 blk_run_queue_async(q
);
224 EXPORT_SYMBOL(blk_start_queue_async
);
227 * blk_start_queue - restart a previously stopped queue
228 * @q: The &struct request_queue in question
231 * blk_start_queue() will clear the stop flag on the queue, and call
232 * the request_fn for the queue if it was in a stopped state when
233 * entered. Also see blk_stop_queue(). Queue lock must be held.
235 void blk_start_queue(struct request_queue
*q
)
237 WARN_ON(!irqs_disabled());
239 queue_flag_clear(QUEUE_FLAG_STOPPED
, q
);
242 EXPORT_SYMBOL(blk_start_queue
);
245 * blk_stop_queue - stop a queue
246 * @q: The &struct request_queue in question
249 * The Linux block layer assumes that a block driver will consume all
250 * entries on the request queue when the request_fn strategy is called.
251 * Often this will not happen, because of hardware limitations (queue
252 * depth settings). If a device driver gets a 'queue full' response,
253 * or if it simply chooses not to queue more I/O at one point, it can
254 * call this function to prevent the request_fn from being called until
255 * the driver has signalled it's ready to go again. This happens by calling
256 * blk_start_queue() to restart queue operations. Queue lock must be held.
258 void blk_stop_queue(struct request_queue
*q
)
260 cancel_delayed_work(&q
->delay_work
);
261 queue_flag_set(QUEUE_FLAG_STOPPED
, q
);
263 EXPORT_SYMBOL(blk_stop_queue
);
266 * blk_sync_queue - cancel any pending callbacks on a queue
270 * The block layer may perform asynchronous callback activity
271 * on a queue, such as calling the unplug function after a timeout.
272 * A block device may call blk_sync_queue to ensure that any
273 * such activity is cancelled, thus allowing it to release resources
274 * that the callbacks might use. The caller must already have made sure
275 * that its ->make_request_fn will not re-add plugging prior to calling
278 * This function does not cancel any asynchronous activity arising
279 * out of elevator or throttling code. That would require elevator_exit()
280 * and blkcg_exit_queue() to be called with queue lock initialized.
283 void blk_sync_queue(struct request_queue
*q
)
285 del_timer_sync(&q
->timeout
);
288 struct blk_mq_hw_ctx
*hctx
;
291 queue_for_each_hw_ctx(q
, hctx
, i
) {
292 cancel_work_sync(&hctx
->run_work
);
293 cancel_delayed_work_sync(&hctx
->delay_work
);
296 cancel_delayed_work_sync(&q
->delay_work
);
299 EXPORT_SYMBOL(blk_sync_queue
);
302 * __blk_run_queue_uncond - run a queue whether or not it has been stopped
303 * @q: The queue to run
306 * Invoke request handling on a queue if there are any pending requests.
307 * May be used to restart request handling after a request has completed.
308 * This variant runs the queue whether or not the queue has been
309 * stopped. Must be called with the queue lock held and interrupts
310 * disabled. See also @blk_run_queue.
312 inline void __blk_run_queue_uncond(struct request_queue
*q
)
314 if (unlikely(blk_queue_dead(q
)))
318 * Some request_fn implementations, e.g. scsi_request_fn(), unlock
319 * the queue lock internally. As a result multiple threads may be
320 * running such a request function concurrently. Keep track of the
321 * number of active request_fn invocations such that blk_drain_queue()
322 * can wait until all these request_fn calls have finished.
324 q
->request_fn_active
++;
326 q
->request_fn_active
--;
328 EXPORT_SYMBOL_GPL(__blk_run_queue_uncond
);
331 * __blk_run_queue - run a single device queue
332 * @q: The queue to run
335 * See @blk_run_queue. This variant must be called with the queue lock
336 * held and interrupts disabled.
338 void __blk_run_queue(struct request_queue
*q
)
340 if (unlikely(blk_queue_stopped(q
)))
343 __blk_run_queue_uncond(q
);
345 EXPORT_SYMBOL(__blk_run_queue
);
348 * blk_run_queue_async - run a single device queue in workqueue context
349 * @q: The queue to run
352 * Tells kblockd to perform the equivalent of @blk_run_queue on behalf
353 * of us. The caller must hold the queue lock.
355 void blk_run_queue_async(struct request_queue
*q
)
357 if (likely(!blk_queue_stopped(q
) && !blk_queue_dead(q
)))
358 mod_delayed_work(kblockd_workqueue
, &q
->delay_work
, 0);
360 EXPORT_SYMBOL(blk_run_queue_async
);
363 * blk_run_queue - run a single device queue
364 * @q: The queue to run
367 * Invoke request handling on this queue, if it has pending work to do.
368 * May be used to restart queueing when a request has completed.
370 void blk_run_queue(struct request_queue
*q
)
374 spin_lock_irqsave(q
->queue_lock
, flags
);
376 spin_unlock_irqrestore(q
->queue_lock
, flags
);
378 EXPORT_SYMBOL(blk_run_queue
);
380 void blk_put_queue(struct request_queue
*q
)
382 kobject_put(&q
->kobj
);
384 EXPORT_SYMBOL(blk_put_queue
);
387 * __blk_drain_queue - drain requests from request_queue
389 * @drain_all: whether to drain all requests or only the ones w/ ELVPRIV
391 * Drain requests from @q. If @drain_all is set, all requests are drained.
392 * If not, only ELVPRIV requests are drained. The caller is responsible
393 * for ensuring that no new requests which need to be drained are queued.
395 static void __blk_drain_queue(struct request_queue
*q
, bool drain_all
)
396 __releases(q
->queue_lock
)
397 __acquires(q
->queue_lock
)
401 lockdep_assert_held(q
->queue_lock
);
407 * The caller might be trying to drain @q before its
408 * elevator is initialized.
411 elv_drain_elevator(q
);
413 blkcg_drain_queue(q
);
416 * This function might be called on a queue which failed
417 * driver init after queue creation or is not yet fully
418 * active yet. Some drivers (e.g. fd and loop) get unhappy
419 * in such cases. Kick queue iff dispatch queue has
420 * something on it and @q has request_fn set.
422 if (!list_empty(&q
->queue_head
) && q
->request_fn
)
425 drain
|= q
->nr_rqs_elvpriv
;
426 drain
|= q
->request_fn_active
;
429 * Unfortunately, requests are queued at and tracked from
430 * multiple places and there's no single counter which can
431 * be drained. Check all the queues and counters.
434 struct blk_flush_queue
*fq
= blk_get_flush_queue(q
, NULL
);
435 drain
|= !list_empty(&q
->queue_head
);
436 for (i
= 0; i
< 2; i
++) {
437 drain
|= q
->nr_rqs
[i
];
438 drain
|= q
->in_flight
[i
];
440 drain
|= !list_empty(&fq
->flush_queue
[i
]);
447 spin_unlock_irq(q
->queue_lock
);
451 spin_lock_irq(q
->queue_lock
);
455 * With queue marked dead, any woken up waiter will fail the
456 * allocation path, so the wakeup chaining is lost and we're
457 * left with hung waiters. We need to wake up those waiters.
460 struct request_list
*rl
;
462 blk_queue_for_each_rl(rl
, q
)
463 for (i
= 0; i
< ARRAY_SIZE(rl
->wait
); i
++)
464 wake_up_all(&rl
->wait
[i
]);
469 * blk_queue_bypass_start - enter queue bypass mode
470 * @q: queue of interest
472 * In bypass mode, only the dispatch FIFO queue of @q is used. This
473 * function makes @q enter bypass mode and drains all requests which were
474 * throttled or issued before. On return, it's guaranteed that no request
475 * is being throttled or has ELVPRIV set and blk_queue_bypass() %true
476 * inside queue or RCU read lock.
478 void blk_queue_bypass_start(struct request_queue
*q
)
480 spin_lock_irq(q
->queue_lock
);
482 queue_flag_set(QUEUE_FLAG_BYPASS
, q
);
483 spin_unlock_irq(q
->queue_lock
);
486 * Queues start drained. Skip actual draining till init is
487 * complete. This avoids lenghty delays during queue init which
488 * can happen many times during boot.
490 if (blk_queue_init_done(q
)) {
491 spin_lock_irq(q
->queue_lock
);
492 __blk_drain_queue(q
, false);
493 spin_unlock_irq(q
->queue_lock
);
495 /* ensure blk_queue_bypass() is %true inside RCU read lock */
499 EXPORT_SYMBOL_GPL(blk_queue_bypass_start
);
502 * blk_queue_bypass_end - leave queue bypass mode
503 * @q: queue of interest
505 * Leave bypass mode and restore the normal queueing behavior.
507 void blk_queue_bypass_end(struct request_queue
*q
)
509 spin_lock_irq(q
->queue_lock
);
510 if (!--q
->bypass_depth
)
511 queue_flag_clear(QUEUE_FLAG_BYPASS
, q
);
512 WARN_ON_ONCE(q
->bypass_depth
< 0);
513 spin_unlock_irq(q
->queue_lock
);
515 EXPORT_SYMBOL_GPL(blk_queue_bypass_end
);
517 void blk_set_queue_dying(struct request_queue
*q
)
519 spin_lock_irq(q
->queue_lock
);
520 queue_flag_set(QUEUE_FLAG_DYING
, q
);
521 spin_unlock_irq(q
->queue_lock
);
524 blk_mq_wake_waiters(q
);
526 struct request_list
*rl
;
528 blk_queue_for_each_rl(rl
, q
) {
530 wake_up(&rl
->wait
[BLK_RW_SYNC
]);
531 wake_up(&rl
->wait
[BLK_RW_ASYNC
]);
536 EXPORT_SYMBOL_GPL(blk_set_queue_dying
);
539 * blk_cleanup_queue - shutdown a request queue
540 * @q: request queue to shutdown
542 * Mark @q DYING, drain all pending requests, mark @q DEAD, destroy and
543 * put it. All future requests will be failed immediately with -ENODEV.
545 void blk_cleanup_queue(struct request_queue
*q
)
547 spinlock_t
*lock
= q
->queue_lock
;
549 /* mark @q DYING, no new request or merges will be allowed afterwards */
550 mutex_lock(&q
->sysfs_lock
);
551 blk_set_queue_dying(q
);
555 * A dying queue is permanently in bypass mode till released. Note
556 * that, unlike blk_queue_bypass_start(), we aren't performing
557 * synchronize_rcu() after entering bypass mode to avoid the delay
558 * as some drivers create and destroy a lot of queues while
559 * probing. This is still safe because blk_release_queue() will be
560 * called only after the queue refcnt drops to zero and nothing,
561 * RCU or not, would be traversing the queue by then.
564 queue_flag_set(QUEUE_FLAG_BYPASS
, q
);
566 queue_flag_set(QUEUE_FLAG_NOMERGES
, q
);
567 queue_flag_set(QUEUE_FLAG_NOXMERGES
, q
);
568 queue_flag_set(QUEUE_FLAG_DYING
, q
);
569 spin_unlock_irq(lock
);
570 mutex_unlock(&q
->sysfs_lock
);
573 * Drain all requests queued before DYING marking. Set DEAD flag to
574 * prevent that q->request_fn() gets invoked after draining finished.
579 __blk_drain_queue(q
, true);
580 queue_flag_set(QUEUE_FLAG_DEAD
, q
);
581 spin_unlock_irq(lock
);
583 /* for synchronous bio-based driver finish in-flight integrity i/o */
584 blk_flush_integrity();
586 /* @q won't process any more request, flush async actions */
587 del_timer_sync(&q
->backing_dev_info
.laptop_mode_wb_timer
);
591 blk_mq_free_queue(q
);
592 percpu_ref_exit(&q
->q_usage_counter
);
595 if (q
->queue_lock
!= &q
->__queue_lock
)
596 q
->queue_lock
= &q
->__queue_lock
;
597 spin_unlock_irq(lock
);
599 bdi_unregister(&q
->backing_dev_info
);
601 /* @q is and will stay empty, shutdown and put */
604 EXPORT_SYMBOL(blk_cleanup_queue
);
606 /* Allocate memory local to the request queue */
607 static void *alloc_request_struct(gfp_t gfp_mask
, void *data
)
609 int nid
= (int)(long)data
;
610 return kmem_cache_alloc_node(request_cachep
, gfp_mask
, nid
);
613 static void free_request_struct(void *element
, void *unused
)
615 kmem_cache_free(request_cachep
, element
);
618 int blk_init_rl(struct request_list
*rl
, struct request_queue
*q
,
621 if (unlikely(rl
->rq_pool
))
625 rl
->count
[BLK_RW_SYNC
] = rl
->count
[BLK_RW_ASYNC
] = 0;
626 rl
->starved
[BLK_RW_SYNC
] = rl
->starved
[BLK_RW_ASYNC
] = 0;
627 init_waitqueue_head(&rl
->wait
[BLK_RW_SYNC
]);
628 init_waitqueue_head(&rl
->wait
[BLK_RW_ASYNC
]);
630 rl
->rq_pool
= mempool_create_node(BLKDEV_MIN_RQ
, alloc_request_struct
,
632 (void *)(long)q
->node
, gfp_mask
,
640 void blk_exit_rl(struct request_list
*rl
)
643 mempool_destroy(rl
->rq_pool
);
646 struct request_queue
*blk_alloc_queue(gfp_t gfp_mask
)
648 return blk_alloc_queue_node(gfp_mask
, NUMA_NO_NODE
);
650 EXPORT_SYMBOL(blk_alloc_queue
);
652 int blk_queue_enter(struct request_queue
*q
, bool nowait
)
657 if (percpu_ref_tryget_live(&q
->q_usage_counter
))
663 ret
= wait_event_interruptible(q
->mq_freeze_wq
,
664 !atomic_read(&q
->mq_freeze_depth
) ||
666 if (blk_queue_dying(q
))
673 void blk_queue_exit(struct request_queue
*q
)
675 percpu_ref_put(&q
->q_usage_counter
);
678 static void blk_queue_usage_counter_release(struct percpu_ref
*ref
)
680 struct request_queue
*q
=
681 container_of(ref
, struct request_queue
, q_usage_counter
);
683 wake_up_all(&q
->mq_freeze_wq
);
686 static void blk_rq_timed_out_timer(unsigned long data
)
688 struct request_queue
*q
= (struct request_queue
*)data
;
690 kblockd_schedule_work(&q
->timeout_work
);
693 struct request_queue
*blk_alloc_queue_node(gfp_t gfp_mask
, int node_id
)
695 struct request_queue
*q
;
698 q
= kmem_cache_alloc_node(blk_requestq_cachep
,
699 gfp_mask
| __GFP_ZERO
, node_id
);
703 q
->id
= ida_simple_get(&blk_queue_ida
, 0, 0, gfp_mask
);
707 q
->bio_split
= bioset_create(BIO_POOL_SIZE
, 0);
711 q
->backing_dev_info
.ra_pages
=
712 (VM_MAX_READAHEAD
* 1024) / PAGE_SIZE
;
713 q
->backing_dev_info
.capabilities
= BDI_CAP_CGROUP_WRITEBACK
;
714 q
->backing_dev_info
.name
= "block";
717 err
= bdi_init(&q
->backing_dev_info
);
721 setup_timer(&q
->backing_dev_info
.laptop_mode_wb_timer
,
722 laptop_mode_timer_fn
, (unsigned long) q
);
723 setup_timer(&q
->timeout
, blk_rq_timed_out_timer
, (unsigned long) q
);
724 INIT_LIST_HEAD(&q
->queue_head
);
725 INIT_LIST_HEAD(&q
->timeout_list
);
726 INIT_LIST_HEAD(&q
->icq_list
);
727 #ifdef CONFIG_BLK_CGROUP
728 INIT_LIST_HEAD(&q
->blkg_list
);
730 INIT_DELAYED_WORK(&q
->delay_work
, blk_delay_work
);
732 kobject_init(&q
->kobj
, &blk_queue_ktype
);
734 mutex_init(&q
->sysfs_lock
);
735 spin_lock_init(&q
->__queue_lock
);
738 * By default initialize queue_lock to internal lock and driver can
739 * override it later if need be.
741 q
->queue_lock
= &q
->__queue_lock
;
744 * A queue starts its life with bypass turned on to avoid
745 * unnecessary bypass on/off overhead and nasty surprises during
746 * init. The initial bypass will be finished when the queue is
747 * registered by blk_register_queue().
750 __set_bit(QUEUE_FLAG_BYPASS
, &q
->queue_flags
);
752 init_waitqueue_head(&q
->mq_freeze_wq
);
755 * Init percpu_ref in atomic mode so that it's faster to shutdown.
756 * See blk_register_queue() for details.
758 if (percpu_ref_init(&q
->q_usage_counter
,
759 blk_queue_usage_counter_release
,
760 PERCPU_REF_INIT_ATOMIC
, GFP_KERNEL
))
763 if (blkcg_init_queue(q
))
769 percpu_ref_exit(&q
->q_usage_counter
);
771 bdi_destroy(&q
->backing_dev_info
);
773 bioset_free(q
->bio_split
);
775 ida_simple_remove(&blk_queue_ida
, q
->id
);
777 kmem_cache_free(blk_requestq_cachep
, q
);
780 EXPORT_SYMBOL(blk_alloc_queue_node
);
783 * blk_init_queue - prepare a request queue for use with a block device
784 * @rfn: The function to be called to process requests that have been
785 * placed on the queue.
786 * @lock: Request queue spin lock
789 * If a block device wishes to use the standard request handling procedures,
790 * which sorts requests and coalesces adjacent requests, then it must
791 * call blk_init_queue(). The function @rfn will be called when there
792 * are requests on the queue that need to be processed. If the device
793 * supports plugging, then @rfn may not be called immediately when requests
794 * are available on the queue, but may be called at some time later instead.
795 * Plugged queues are generally unplugged when a buffer belonging to one
796 * of the requests on the queue is needed, or due to memory pressure.
798 * @rfn is not required, or even expected, to remove all requests off the
799 * queue, but only as many as it can handle at a time. If it does leave
800 * requests on the queue, it is responsible for arranging that the requests
801 * get dealt with eventually.
803 * The queue spin lock must be held while manipulating the requests on the
804 * request queue; this lock will be taken also from interrupt context, so irq
805 * disabling is needed for it.
807 * Function returns a pointer to the initialized request queue, or %NULL if
811 * blk_init_queue() must be paired with a blk_cleanup_queue() call
812 * when the block device is deactivated (such as at module unload).
815 struct request_queue
*blk_init_queue(request_fn_proc
*rfn
, spinlock_t
*lock
)
817 return blk_init_queue_node(rfn
, lock
, NUMA_NO_NODE
);
819 EXPORT_SYMBOL(blk_init_queue
);
821 struct request_queue
*
822 blk_init_queue_node(request_fn_proc
*rfn
, spinlock_t
*lock
, int node_id
)
824 struct request_queue
*uninit_q
, *q
;
826 uninit_q
= blk_alloc_queue_node(GFP_KERNEL
, node_id
);
830 q
= blk_init_allocated_queue(uninit_q
, rfn
, lock
);
832 blk_cleanup_queue(uninit_q
);
836 EXPORT_SYMBOL(blk_init_queue_node
);
838 static blk_qc_t
blk_queue_bio(struct request_queue
*q
, struct bio
*bio
);
840 struct request_queue
*
841 blk_init_allocated_queue(struct request_queue
*q
, request_fn_proc
*rfn
,
847 q
->fq
= blk_alloc_flush_queue(q
, NUMA_NO_NODE
, 0);
851 if (blk_init_rl(&q
->root_rl
, q
, GFP_KERNEL
))
854 INIT_WORK(&q
->timeout_work
, blk_timeout_work
);
856 q
->prep_rq_fn
= NULL
;
857 q
->unprep_rq_fn
= NULL
;
858 q
->queue_flags
|= QUEUE_FLAG_DEFAULT
;
860 /* Override internal queue lock with supplied lock pointer */
862 q
->queue_lock
= lock
;
865 * This also sets hw/phys segments, boundary and size
867 blk_queue_make_request(q
, blk_queue_bio
);
869 q
->sg_reserved_size
= INT_MAX
;
871 /* Protect q->elevator from elevator_change */
872 mutex_lock(&q
->sysfs_lock
);
875 if (elevator_init(q
, NULL
)) {
876 mutex_unlock(&q
->sysfs_lock
);
880 mutex_unlock(&q
->sysfs_lock
);
885 blk_free_flush_queue(q
->fq
);
889 EXPORT_SYMBOL(blk_init_allocated_queue
);
891 bool blk_get_queue(struct request_queue
*q
)
893 if (likely(!blk_queue_dying(q
))) {
900 EXPORT_SYMBOL(blk_get_queue
);
902 static inline void blk_free_request(struct request_list
*rl
, struct request
*rq
)
904 if (rq
->rq_flags
& RQF_ELVPRIV
) {
905 elv_put_request(rl
->q
, rq
);
907 put_io_context(rq
->elv
.icq
->ioc
);
910 mempool_free(rq
, rl
->rq_pool
);
914 * ioc_batching returns true if the ioc is a valid batching request and
915 * should be given priority access to a request.
917 static inline int ioc_batching(struct request_queue
*q
, struct io_context
*ioc
)
923 * Make sure the process is able to allocate at least 1 request
924 * even if the batch times out, otherwise we could theoretically
927 return ioc
->nr_batch_requests
== q
->nr_batching
||
928 (ioc
->nr_batch_requests
> 0
929 && time_before(jiffies
, ioc
->last_waited
+ BLK_BATCH_TIME
));
933 * ioc_set_batching sets ioc to be a new "batcher" if it is not one. This
934 * will cause the process to be a "batcher" on all queues in the system. This
935 * is the behaviour we want though - once it gets a wakeup it should be given
938 static void ioc_set_batching(struct request_queue
*q
, struct io_context
*ioc
)
940 if (!ioc
|| ioc_batching(q
, ioc
))
943 ioc
->nr_batch_requests
= q
->nr_batching
;
944 ioc
->last_waited
= jiffies
;
947 static void __freed_request(struct request_list
*rl
, int sync
)
949 struct request_queue
*q
= rl
->q
;
951 if (rl
->count
[sync
] < queue_congestion_off_threshold(q
))
952 blk_clear_congested(rl
, sync
);
954 if (rl
->count
[sync
] + 1 <= q
->nr_requests
) {
955 if (waitqueue_active(&rl
->wait
[sync
]))
956 wake_up(&rl
->wait
[sync
]);
958 blk_clear_rl_full(rl
, sync
);
963 * A request has just been released. Account for it, update the full and
964 * congestion status, wake up any waiters. Called under q->queue_lock.
966 static void freed_request(struct request_list
*rl
, bool sync
,
967 req_flags_t rq_flags
)
969 struct request_queue
*q
= rl
->q
;
973 if (rq_flags
& RQF_ELVPRIV
)
976 __freed_request(rl
, sync
);
978 if (unlikely(rl
->starved
[sync
^ 1]))
979 __freed_request(rl
, sync
^ 1);
982 int blk_update_nr_requests(struct request_queue
*q
, unsigned int nr
)
984 struct request_list
*rl
;
985 int on_thresh
, off_thresh
;
987 spin_lock_irq(q
->queue_lock
);
989 blk_queue_congestion_threshold(q
);
990 on_thresh
= queue_congestion_on_threshold(q
);
991 off_thresh
= queue_congestion_off_threshold(q
);
993 blk_queue_for_each_rl(rl
, q
) {
994 if (rl
->count
[BLK_RW_SYNC
] >= on_thresh
)
995 blk_set_congested(rl
, BLK_RW_SYNC
);
996 else if (rl
->count
[BLK_RW_SYNC
] < off_thresh
)
997 blk_clear_congested(rl
, BLK_RW_SYNC
);
999 if (rl
->count
[BLK_RW_ASYNC
] >= on_thresh
)
1000 blk_set_congested(rl
, BLK_RW_ASYNC
);
1001 else if (rl
->count
[BLK_RW_ASYNC
] < off_thresh
)
1002 blk_clear_congested(rl
, BLK_RW_ASYNC
);
1004 if (rl
->count
[BLK_RW_SYNC
] >= q
->nr_requests
) {
1005 blk_set_rl_full(rl
, BLK_RW_SYNC
);
1007 blk_clear_rl_full(rl
, BLK_RW_SYNC
);
1008 wake_up(&rl
->wait
[BLK_RW_SYNC
]);
1011 if (rl
->count
[BLK_RW_ASYNC
] >= q
->nr_requests
) {
1012 blk_set_rl_full(rl
, BLK_RW_ASYNC
);
1014 blk_clear_rl_full(rl
, BLK_RW_ASYNC
);
1015 wake_up(&rl
->wait
[BLK_RW_ASYNC
]);
1019 spin_unlock_irq(q
->queue_lock
);
1024 * Determine if elevator data should be initialized when allocating the
1025 * request associated with @bio.
1027 static bool blk_rq_should_init_elevator(struct bio
*bio
)
1033 * Flush requests do not use the elevator so skip initialization.
1034 * This allows a request to share the flush and elevator data.
1036 if (bio
->bi_opf
& (REQ_PREFLUSH
| REQ_FUA
))
1043 * rq_ioc - determine io_context for request allocation
1044 * @bio: request being allocated is for this bio (can be %NULL)
1046 * Determine io_context to use for request allocation for @bio. May return
1047 * %NULL if %current->io_context doesn't exist.
1049 static struct io_context
*rq_ioc(struct bio
*bio
)
1051 #ifdef CONFIG_BLK_CGROUP
1052 if (bio
&& bio
->bi_ioc
)
1055 return current
->io_context
;
1059 * __get_request - get a free request
1060 * @rl: request list to allocate from
1061 * @op: operation and flags
1062 * @bio: bio to allocate request for (can be %NULL)
1063 * @gfp_mask: allocation mask
1065 * Get a free request from @q. This function may fail under memory
1066 * pressure or if @q is dead.
1068 * Must be called with @q->queue_lock held and,
1069 * Returns ERR_PTR on failure, with @q->queue_lock held.
1070 * Returns request pointer on success, with @q->queue_lock *not held*.
1072 static struct request
*__get_request(struct request_list
*rl
, unsigned int op
,
1073 struct bio
*bio
, gfp_t gfp_mask
)
1075 struct request_queue
*q
= rl
->q
;
1077 struct elevator_type
*et
= q
->elevator
->type
;
1078 struct io_context
*ioc
= rq_ioc(bio
);
1079 struct io_cq
*icq
= NULL
;
1080 const bool is_sync
= op_is_sync(op
);
1082 req_flags_t rq_flags
= RQF_ALLOCED
;
1084 if (unlikely(blk_queue_dying(q
)))
1085 return ERR_PTR(-ENODEV
);
1087 may_queue
= elv_may_queue(q
, op
);
1088 if (may_queue
== ELV_MQUEUE_NO
)
1091 if (rl
->count
[is_sync
]+1 >= queue_congestion_on_threshold(q
)) {
1092 if (rl
->count
[is_sync
]+1 >= q
->nr_requests
) {
1094 * The queue will fill after this allocation, so set
1095 * it as full, and mark this process as "batching".
1096 * This process will be allowed to complete a batch of
1097 * requests, others will be blocked.
1099 if (!blk_rl_full(rl
, is_sync
)) {
1100 ioc_set_batching(q
, ioc
);
1101 blk_set_rl_full(rl
, is_sync
);
1103 if (may_queue
!= ELV_MQUEUE_MUST
1104 && !ioc_batching(q
, ioc
)) {
1106 * The queue is full and the allocating
1107 * process is not a "batcher", and not
1108 * exempted by the IO scheduler
1110 return ERR_PTR(-ENOMEM
);
1114 blk_set_congested(rl
, is_sync
);
1118 * Only allow batching queuers to allocate up to 50% over the defined
1119 * limit of requests, otherwise we could have thousands of requests
1120 * allocated with any setting of ->nr_requests
1122 if (rl
->count
[is_sync
] >= (3 * q
->nr_requests
/ 2))
1123 return ERR_PTR(-ENOMEM
);
1125 q
->nr_rqs
[is_sync
]++;
1126 rl
->count
[is_sync
]++;
1127 rl
->starved
[is_sync
] = 0;
1130 * Decide whether the new request will be managed by elevator. If
1131 * so, mark @rq_flags and increment elvpriv. Non-zero elvpriv will
1132 * prevent the current elevator from being destroyed until the new
1133 * request is freed. This guarantees icq's won't be destroyed and
1134 * makes creating new ones safe.
1136 * Also, lookup icq while holding queue_lock. If it doesn't exist,
1137 * it will be created after releasing queue_lock.
1139 if (blk_rq_should_init_elevator(bio
) && !blk_queue_bypass(q
)) {
1140 rq_flags
|= RQF_ELVPRIV
;
1141 q
->nr_rqs_elvpriv
++;
1142 if (et
->icq_cache
&& ioc
)
1143 icq
= ioc_lookup_icq(ioc
, q
);
1146 if (blk_queue_io_stat(q
))
1147 rq_flags
|= RQF_IO_STAT
;
1148 spin_unlock_irq(q
->queue_lock
);
1150 /* allocate and init request */
1151 rq
= mempool_alloc(rl
->rq_pool
, gfp_mask
);
1156 blk_rq_set_rl(rq
, rl
);
1158 rq
->rq_flags
= rq_flags
;
1161 if (rq_flags
& RQF_ELVPRIV
) {
1162 if (unlikely(et
->icq_cache
&& !icq
)) {
1164 icq
= ioc_create_icq(ioc
, q
, gfp_mask
);
1170 if (unlikely(elv_set_request(q
, rq
, bio
, gfp_mask
)))
1173 /* @rq->elv.icq holds io_context until @rq is freed */
1175 get_io_context(icq
->ioc
);
1179 * ioc may be NULL here, and ioc_batching will be false. That's
1180 * OK, if the queue is under the request limit then requests need
1181 * not count toward the nr_batch_requests limit. There will always
1182 * be some limit enforced by BLK_BATCH_TIME.
1184 if (ioc_batching(q
, ioc
))
1185 ioc
->nr_batch_requests
--;
1187 trace_block_getrq(q
, bio
, op
);
1192 * elvpriv init failed. ioc, icq and elvpriv aren't mempool backed
1193 * and may fail indefinitely under memory pressure and thus
1194 * shouldn't stall IO. Treat this request as !elvpriv. This will
1195 * disturb iosched and blkcg but weird is bettern than dead.
1197 printk_ratelimited(KERN_WARNING
"%s: dev %s: request aux data allocation failed, iosched may be disturbed\n",
1198 __func__
, dev_name(q
->backing_dev_info
.dev
));
1200 rq
->rq_flags
&= ~RQF_ELVPRIV
;
1203 spin_lock_irq(q
->queue_lock
);
1204 q
->nr_rqs_elvpriv
--;
1205 spin_unlock_irq(q
->queue_lock
);
1210 * Allocation failed presumably due to memory. Undo anything we
1211 * might have messed up.
1213 * Allocating task should really be put onto the front of the wait
1214 * queue, but this is pretty rare.
1216 spin_lock_irq(q
->queue_lock
);
1217 freed_request(rl
, is_sync
, rq_flags
);
1220 * in the very unlikely event that allocation failed and no
1221 * requests for this direction was pending, mark us starved so that
1222 * freeing of a request in the other direction will notice
1223 * us. another possible fix would be to split the rq mempool into
1227 if (unlikely(rl
->count
[is_sync
] == 0))
1228 rl
->starved
[is_sync
] = 1;
1229 return ERR_PTR(-ENOMEM
);
1233 * get_request - get a free request
1234 * @q: request_queue to allocate request from
1235 * @op: operation and flags
1236 * @bio: bio to allocate request for (can be %NULL)
1237 * @gfp_mask: allocation mask
1239 * Get a free request from @q. If %__GFP_DIRECT_RECLAIM is set in @gfp_mask,
1240 * this function keeps retrying under memory pressure and fails iff @q is dead.
1242 * Must be called with @q->queue_lock held and,
1243 * Returns ERR_PTR on failure, with @q->queue_lock held.
1244 * Returns request pointer on success, with @q->queue_lock *not held*.
1246 static struct request
*get_request(struct request_queue
*q
, unsigned int op
,
1247 struct bio
*bio
, gfp_t gfp_mask
)
1249 const bool is_sync
= op_is_sync(op
);
1251 struct request_list
*rl
;
1254 rl
= blk_get_rl(q
, bio
); /* transferred to @rq on success */
1256 rq
= __get_request(rl
, op
, bio
, gfp_mask
);
1260 if (!gfpflags_allow_blocking(gfp_mask
) || unlikely(blk_queue_dying(q
))) {
1265 /* wait on @rl and retry */
1266 prepare_to_wait_exclusive(&rl
->wait
[is_sync
], &wait
,
1267 TASK_UNINTERRUPTIBLE
);
1269 trace_block_sleeprq(q
, bio
, op
);
1271 spin_unlock_irq(q
->queue_lock
);
1275 * After sleeping, we become a "batching" process and will be able
1276 * to allocate at least one request, and up to a big batch of them
1277 * for a small period time. See ioc_batching, ioc_set_batching
1279 ioc_set_batching(q
, current
->io_context
);
1281 spin_lock_irq(q
->queue_lock
);
1282 finish_wait(&rl
->wait
[is_sync
], &wait
);
1287 static struct request
*blk_old_get_request(struct request_queue
*q
, int rw
,
1292 BUG_ON(rw
!= READ
&& rw
!= WRITE
);
1294 /* create ioc upfront */
1295 create_io_context(gfp_mask
, q
->node
);
1297 spin_lock_irq(q
->queue_lock
);
1298 rq
= get_request(q
, rw
, NULL
, gfp_mask
);
1300 spin_unlock_irq(q
->queue_lock
);
1304 /* q->queue_lock is unlocked at this point */
1306 rq
->__sector
= (sector_t
) -1;
1307 rq
->bio
= rq
->biotail
= NULL
;
1311 struct request
*blk_get_request(struct request_queue
*q
, int rw
, gfp_t gfp_mask
)
1314 return blk_mq_alloc_request(q
, rw
,
1315 (gfp_mask
& __GFP_DIRECT_RECLAIM
) ?
1316 0 : BLK_MQ_REQ_NOWAIT
);
1318 return blk_old_get_request(q
, rw
, gfp_mask
);
1320 EXPORT_SYMBOL(blk_get_request
);
1323 * blk_rq_set_block_pc - initialize a request to type BLOCK_PC
1324 * @rq: request to be initialized
1327 void blk_rq_set_block_pc(struct request
*rq
)
1329 rq
->cmd_type
= REQ_TYPE_BLOCK_PC
;
1330 memset(rq
->__cmd
, 0, sizeof(rq
->__cmd
));
1332 EXPORT_SYMBOL(blk_rq_set_block_pc
);
1335 * blk_requeue_request - put a request back on queue
1336 * @q: request queue where request should be inserted
1337 * @rq: request to be inserted
1340 * Drivers often keep queueing requests until the hardware cannot accept
1341 * more, when that condition happens we need to put the request back
1342 * on the queue. Must be called with queue lock held.
1344 void blk_requeue_request(struct request_queue
*q
, struct request
*rq
)
1346 blk_delete_timer(rq
);
1347 blk_clear_rq_complete(rq
);
1348 trace_block_rq_requeue(q
, rq
);
1349 wbt_requeue(q
->rq_wb
, &rq
->issue_stat
);
1351 if (rq
->rq_flags
& RQF_QUEUED
)
1352 blk_queue_end_tag(q
, rq
);
1354 BUG_ON(blk_queued_rq(rq
));
1356 elv_requeue_request(q
, rq
);
1358 EXPORT_SYMBOL(blk_requeue_request
);
1360 static void add_acct_request(struct request_queue
*q
, struct request
*rq
,
1363 blk_account_io_start(rq
, true);
1364 __elv_add_request(q
, rq
, where
);
1367 static void part_round_stats_single(int cpu
, struct hd_struct
*part
,
1372 if (now
== part
->stamp
)
1375 inflight
= part_in_flight(part
);
1377 __part_stat_add(cpu
, part
, time_in_queue
,
1378 inflight
* (now
- part
->stamp
));
1379 __part_stat_add(cpu
, part
, io_ticks
, (now
- part
->stamp
));
1385 * part_round_stats() - Round off the performance stats on a struct disk_stats.
1386 * @cpu: cpu number for stats access
1387 * @part: target partition
1389 * The average IO queue length and utilisation statistics are maintained
1390 * by observing the current state of the queue length and the amount of
1391 * time it has been in this state for.
1393 * Normally, that accounting is done on IO completion, but that can result
1394 * in more than a second's worth of IO being accounted for within any one
1395 * second, leading to >100% utilisation. To deal with that, we call this
1396 * function to do a round-off before returning the results when reading
1397 * /proc/diskstats. This accounts immediately for all queue usage up to
1398 * the current jiffies and restarts the counters again.
1400 void part_round_stats(int cpu
, struct hd_struct
*part
)
1402 unsigned long now
= jiffies
;
1405 part_round_stats_single(cpu
, &part_to_disk(part
)->part0
, now
);
1406 part_round_stats_single(cpu
, part
, now
);
1408 EXPORT_SYMBOL_GPL(part_round_stats
);
1411 static void blk_pm_put_request(struct request
*rq
)
1413 if (rq
->q
->dev
&& !(rq
->rq_flags
& RQF_PM
) && !--rq
->q
->nr_pending
)
1414 pm_runtime_mark_last_busy(rq
->q
->dev
);
1417 static inline void blk_pm_put_request(struct request
*rq
) {}
1421 * queue lock must be held
1423 void __blk_put_request(struct request_queue
*q
, struct request
*req
)
1425 req_flags_t rq_flags
= req
->rq_flags
;
1431 blk_mq_free_request(req
);
1435 blk_pm_put_request(req
);
1437 elv_completed_request(q
, req
);
1439 /* this is a bio leak */
1440 WARN_ON(req
->bio
!= NULL
);
1442 wbt_done(q
->rq_wb
, &req
->issue_stat
);
1445 * Request may not have originated from ll_rw_blk. if not,
1446 * it didn't come out of our reserved rq pools
1448 if (rq_flags
& RQF_ALLOCED
) {
1449 struct request_list
*rl
= blk_rq_rl(req
);
1450 bool sync
= op_is_sync(req
->cmd_flags
);
1452 BUG_ON(!list_empty(&req
->queuelist
));
1453 BUG_ON(ELV_ON_HASH(req
));
1455 blk_free_request(rl
, req
);
1456 freed_request(rl
, sync
, rq_flags
);
1460 EXPORT_SYMBOL_GPL(__blk_put_request
);
1462 void blk_put_request(struct request
*req
)
1464 struct request_queue
*q
= req
->q
;
1467 blk_mq_free_request(req
);
1469 unsigned long flags
;
1471 spin_lock_irqsave(q
->queue_lock
, flags
);
1472 __blk_put_request(q
, req
);
1473 spin_unlock_irqrestore(q
->queue_lock
, flags
);
1476 EXPORT_SYMBOL(blk_put_request
);
1478 bool bio_attempt_back_merge(struct request_queue
*q
, struct request
*req
,
1481 const int ff
= bio
->bi_opf
& REQ_FAILFAST_MASK
;
1483 if (!ll_back_merge_fn(q
, req
, bio
))
1486 trace_block_bio_backmerge(q
, req
, bio
);
1488 if ((req
->cmd_flags
& REQ_FAILFAST_MASK
) != ff
)
1489 blk_rq_set_mixed_merge(req
);
1491 req
->biotail
->bi_next
= bio
;
1493 req
->__data_len
+= bio
->bi_iter
.bi_size
;
1494 req
->ioprio
= ioprio_best(req
->ioprio
, bio_prio(bio
));
1496 blk_account_io_start(req
, false);
1500 bool bio_attempt_front_merge(struct request_queue
*q
, struct request
*req
,
1503 const int ff
= bio
->bi_opf
& REQ_FAILFAST_MASK
;
1505 if (!ll_front_merge_fn(q
, req
, bio
))
1508 trace_block_bio_frontmerge(q
, req
, bio
);
1510 if ((req
->cmd_flags
& REQ_FAILFAST_MASK
) != ff
)
1511 blk_rq_set_mixed_merge(req
);
1513 bio
->bi_next
= req
->bio
;
1516 req
->__sector
= bio
->bi_iter
.bi_sector
;
1517 req
->__data_len
+= bio
->bi_iter
.bi_size
;
1518 req
->ioprio
= ioprio_best(req
->ioprio
, bio_prio(bio
));
1520 blk_account_io_start(req
, false);
1525 * blk_attempt_plug_merge - try to merge with %current's plugged list
1526 * @q: request_queue new bio is being queued at
1527 * @bio: new bio being queued
1528 * @request_count: out parameter for number of traversed plugged requests
1529 * @same_queue_rq: pointer to &struct request that gets filled in when
1530 * another request associated with @q is found on the plug list
1531 * (optional, may be %NULL)
1533 * Determine whether @bio being queued on @q can be merged with a request
1534 * on %current's plugged list. Returns %true if merge was successful,
1537 * Plugging coalesces IOs from the same issuer for the same purpose without
1538 * going through @q->queue_lock. As such it's more of an issuing mechanism
1539 * than scheduling, and the request, while may have elvpriv data, is not
1540 * added on the elevator at this point. In addition, we don't have
1541 * reliable access to the elevator outside queue lock. Only check basic
1542 * merging parameters without querying the elevator.
1544 * Caller must ensure !blk_queue_nomerges(q) beforehand.
1546 bool blk_attempt_plug_merge(struct request_queue
*q
, struct bio
*bio
,
1547 unsigned int *request_count
,
1548 struct request
**same_queue_rq
)
1550 struct blk_plug
*plug
;
1553 struct list_head
*plug_list
;
1555 plug
= current
->plug
;
1561 plug_list
= &plug
->mq_list
;
1563 plug_list
= &plug
->list
;
1565 list_for_each_entry_reverse(rq
, plug_list
, queuelist
) {
1571 * Only blk-mq multiple hardware queues case checks the
1572 * rq in the same queue, there should be only one such
1576 *same_queue_rq
= rq
;
1579 if (rq
->q
!= q
|| !blk_rq_merge_ok(rq
, bio
))
1582 el_ret
= blk_try_merge(rq
, bio
);
1583 if (el_ret
== ELEVATOR_BACK_MERGE
) {
1584 ret
= bio_attempt_back_merge(q
, rq
, bio
);
1587 } else if (el_ret
== ELEVATOR_FRONT_MERGE
) {
1588 ret
= bio_attempt_front_merge(q
, rq
, bio
);
1597 unsigned int blk_plug_queued_count(struct request_queue
*q
)
1599 struct blk_plug
*plug
;
1601 struct list_head
*plug_list
;
1602 unsigned int ret
= 0;
1604 plug
= current
->plug
;
1609 plug_list
= &plug
->mq_list
;
1611 plug_list
= &plug
->list
;
1613 list_for_each_entry(rq
, plug_list
, queuelist
) {
1621 void init_request_from_bio(struct request
*req
, struct bio
*bio
)
1623 req
->cmd_type
= REQ_TYPE_FS
;
1624 if (bio
->bi_opf
& REQ_RAHEAD
)
1625 req
->cmd_flags
|= REQ_FAILFAST_MASK
;
1628 req
->__sector
= bio
->bi_iter
.bi_sector
;
1629 req
->ioprio
= bio_prio(bio
);
1630 blk_rq_bio_prep(req
->q
, req
, bio
);
1633 static blk_qc_t
blk_queue_bio(struct request_queue
*q
, struct bio
*bio
)
1635 struct blk_plug
*plug
;
1636 int el_ret
, where
= ELEVATOR_INSERT_SORT
;
1637 struct request
*req
;
1638 unsigned int request_count
= 0;
1639 unsigned int wb_acct
;
1642 * low level driver can indicate that it wants pages above a
1643 * certain limit bounced to low memory (ie for highmem, or even
1644 * ISA dma in theory)
1646 blk_queue_bounce(q
, &bio
);
1648 blk_queue_split(q
, &bio
, q
->bio_split
);
1650 if (bio_integrity_enabled(bio
) && bio_integrity_prep(bio
)) {
1651 bio
->bi_error
= -EIO
;
1653 return BLK_QC_T_NONE
;
1656 if (bio
->bi_opf
& (REQ_PREFLUSH
| REQ_FUA
)) {
1657 spin_lock_irq(q
->queue_lock
);
1658 where
= ELEVATOR_INSERT_FLUSH
;
1663 * Check if we can merge with the plugged list before grabbing
1666 if (!blk_queue_nomerges(q
)) {
1667 if (blk_attempt_plug_merge(q
, bio
, &request_count
, NULL
))
1668 return BLK_QC_T_NONE
;
1670 request_count
= blk_plug_queued_count(q
);
1672 spin_lock_irq(q
->queue_lock
);
1674 el_ret
= elv_merge(q
, &req
, bio
);
1675 if (el_ret
== ELEVATOR_BACK_MERGE
) {
1676 if (bio_attempt_back_merge(q
, req
, bio
)) {
1677 elv_bio_merged(q
, req
, bio
);
1678 if (!attempt_back_merge(q
, req
))
1679 elv_merged_request(q
, req
, el_ret
);
1682 } else if (el_ret
== ELEVATOR_FRONT_MERGE
) {
1683 if (bio_attempt_front_merge(q
, req
, bio
)) {
1684 elv_bio_merged(q
, req
, bio
);
1685 if (!attempt_front_merge(q
, req
))
1686 elv_merged_request(q
, req
, el_ret
);
1692 wb_acct
= wbt_wait(q
->rq_wb
, bio
, q
->queue_lock
);
1695 * Grab a free request. This is might sleep but can not fail.
1696 * Returns with the queue unlocked.
1698 req
= get_request(q
, bio
->bi_opf
, bio
, GFP_NOIO
);
1700 __wbt_done(q
->rq_wb
, wb_acct
);
1701 bio
->bi_error
= PTR_ERR(req
);
1706 wbt_track(&req
->issue_stat
, wb_acct
);
1709 * After dropping the lock and possibly sleeping here, our request
1710 * may now be mergeable after it had proven unmergeable (above).
1711 * We don't worry about that case for efficiency. It won't happen
1712 * often, and the elevators are able to handle it.
1714 init_request_from_bio(req
, bio
);
1716 if (test_bit(QUEUE_FLAG_SAME_COMP
, &q
->queue_flags
))
1717 req
->cpu
= raw_smp_processor_id();
1719 plug
= current
->plug
;
1722 * If this is the first request added after a plug, fire
1725 * @request_count may become stale because of schedule
1726 * out, so check plug list again.
1728 if (!request_count
|| list_empty(&plug
->list
))
1729 trace_block_plug(q
);
1731 struct request
*last
= list_entry_rq(plug
->list
.prev
);
1732 if (request_count
>= BLK_MAX_REQUEST_COUNT
||
1733 blk_rq_bytes(last
) >= BLK_PLUG_FLUSH_SIZE
) {
1734 blk_flush_plug_list(plug
, false);
1735 trace_block_plug(q
);
1738 list_add_tail(&req
->queuelist
, &plug
->list
);
1739 blk_account_io_start(req
, true);
1741 spin_lock_irq(q
->queue_lock
);
1742 add_acct_request(q
, req
, where
);
1745 spin_unlock_irq(q
->queue_lock
);
1748 return BLK_QC_T_NONE
;
1752 * If bio->bi_dev is a partition, remap the location
1754 static inline void blk_partition_remap(struct bio
*bio
)
1756 struct block_device
*bdev
= bio
->bi_bdev
;
1759 * Zone reset does not include bi_size so bio_sectors() is always 0.
1760 * Include a test for the reset op code and perform the remap if needed.
1762 if (bdev
!= bdev
->bd_contains
&&
1763 (bio_sectors(bio
) || bio_op(bio
) == REQ_OP_ZONE_RESET
)) {
1764 struct hd_struct
*p
= bdev
->bd_part
;
1766 bio
->bi_iter
.bi_sector
+= p
->start_sect
;
1767 bio
->bi_bdev
= bdev
->bd_contains
;
1769 trace_block_bio_remap(bdev_get_queue(bio
->bi_bdev
), bio
,
1771 bio
->bi_iter
.bi_sector
- p
->start_sect
);
1775 static void handle_bad_sector(struct bio
*bio
)
1777 char b
[BDEVNAME_SIZE
];
1779 printk(KERN_INFO
"attempt to access beyond end of device\n");
1780 printk(KERN_INFO
"%s: rw=%d, want=%Lu, limit=%Lu\n",
1781 bdevname(bio
->bi_bdev
, b
),
1783 (unsigned long long)bio_end_sector(bio
),
1784 (long long)(i_size_read(bio
->bi_bdev
->bd_inode
) >> 9));
1787 #ifdef CONFIG_FAIL_MAKE_REQUEST
1789 static DECLARE_FAULT_ATTR(fail_make_request
);
1791 static int __init
setup_fail_make_request(char *str
)
1793 return setup_fault_attr(&fail_make_request
, str
);
1795 __setup("fail_make_request=", setup_fail_make_request
);
1797 static bool should_fail_request(struct hd_struct
*part
, unsigned int bytes
)
1799 return part
->make_it_fail
&& should_fail(&fail_make_request
, bytes
);
1802 static int __init
fail_make_request_debugfs(void)
1804 struct dentry
*dir
= fault_create_debugfs_attr("fail_make_request",
1805 NULL
, &fail_make_request
);
1807 return PTR_ERR_OR_ZERO(dir
);
1810 late_initcall(fail_make_request_debugfs
);
1812 #else /* CONFIG_FAIL_MAKE_REQUEST */
1814 static inline bool should_fail_request(struct hd_struct
*part
,
1820 #endif /* CONFIG_FAIL_MAKE_REQUEST */
1823 * Check whether this bio extends beyond the end of the device.
1825 static inline int bio_check_eod(struct bio
*bio
, unsigned int nr_sectors
)
1832 /* Test device or partition size, when known. */
1833 maxsector
= i_size_read(bio
->bi_bdev
->bd_inode
) >> 9;
1835 sector_t sector
= bio
->bi_iter
.bi_sector
;
1837 if (maxsector
< nr_sectors
|| maxsector
- nr_sectors
< sector
) {
1839 * This may well happen - the kernel calls bread()
1840 * without checking the size of the device, e.g., when
1841 * mounting a device.
1843 handle_bad_sector(bio
);
1851 static noinline_for_stack
bool
1852 generic_make_request_checks(struct bio
*bio
)
1854 struct request_queue
*q
;
1855 int nr_sectors
= bio_sectors(bio
);
1857 char b
[BDEVNAME_SIZE
];
1858 struct hd_struct
*part
;
1862 if (bio_check_eod(bio
, nr_sectors
))
1865 q
= bdev_get_queue(bio
->bi_bdev
);
1868 "generic_make_request: Trying to access "
1869 "nonexistent block-device %s (%Lu)\n",
1870 bdevname(bio
->bi_bdev
, b
),
1871 (long long) bio
->bi_iter
.bi_sector
);
1875 part
= bio
->bi_bdev
->bd_part
;
1876 if (should_fail_request(part
, bio
->bi_iter
.bi_size
) ||
1877 should_fail_request(&part_to_disk(part
)->part0
,
1878 bio
->bi_iter
.bi_size
))
1882 * If this device has partitions, remap block n
1883 * of partition p to block n+start(p) of the disk.
1885 blk_partition_remap(bio
);
1887 if (bio_check_eod(bio
, nr_sectors
))
1891 * Filter flush bio's early so that make_request based
1892 * drivers without flush support don't have to worry
1895 if ((bio
->bi_opf
& (REQ_PREFLUSH
| REQ_FUA
)) &&
1896 !test_bit(QUEUE_FLAG_WC
, &q
->queue_flags
)) {
1897 bio
->bi_opf
&= ~(REQ_PREFLUSH
| REQ_FUA
);
1904 switch (bio_op(bio
)) {
1905 case REQ_OP_DISCARD
:
1906 if (!blk_queue_discard(q
))
1909 case REQ_OP_SECURE_ERASE
:
1910 if (!blk_queue_secure_erase(q
))
1913 case REQ_OP_WRITE_SAME
:
1914 if (!bdev_write_same(bio
->bi_bdev
))
1917 case REQ_OP_ZONE_REPORT
:
1918 case REQ_OP_ZONE_RESET
:
1919 if (!bdev_is_zoned(bio
->bi_bdev
))
1922 case REQ_OP_WRITE_ZEROES
:
1923 if (!bdev_write_zeroes_sectors(bio
->bi_bdev
))
1931 * Various block parts want %current->io_context and lazy ioc
1932 * allocation ends up trading a lot of pain for a small amount of
1933 * memory. Just allocate it upfront. This may fail and block
1934 * layer knows how to live with it.
1936 create_io_context(GFP_ATOMIC
, q
->node
);
1938 if (!blkcg_bio_issue_check(q
, bio
))
1941 trace_block_bio_queue(q
, bio
);
1947 bio
->bi_error
= err
;
1953 * generic_make_request - hand a buffer to its device driver for I/O
1954 * @bio: The bio describing the location in memory and on the device.
1956 * generic_make_request() is used to make I/O requests of block
1957 * devices. It is passed a &struct bio, which describes the I/O that needs
1960 * generic_make_request() does not return any status. The
1961 * success/failure status of the request, along with notification of
1962 * completion, is delivered asynchronously through the bio->bi_end_io
1963 * function described (one day) else where.
1965 * The caller of generic_make_request must make sure that bi_io_vec
1966 * are set to describe the memory buffer, and that bi_dev and bi_sector are
1967 * set to describe the device address, and the
1968 * bi_end_io and optionally bi_private are set to describe how
1969 * completion notification should be signaled.
1971 * generic_make_request and the drivers it calls may use bi_next if this
1972 * bio happens to be merged with someone else, and may resubmit the bio to
1973 * a lower device by calling into generic_make_request recursively, which
1974 * means the bio should NOT be touched after the call to ->make_request_fn.
1976 blk_qc_t
generic_make_request(struct bio
*bio
)
1978 struct bio_list bio_list_on_stack
;
1979 blk_qc_t ret
= BLK_QC_T_NONE
;
1981 if (!generic_make_request_checks(bio
))
1985 * We only want one ->make_request_fn to be active at a time, else
1986 * stack usage with stacked devices could be a problem. So use
1987 * current->bio_list to keep a list of requests submited by a
1988 * make_request_fn function. current->bio_list is also used as a
1989 * flag to say if generic_make_request is currently active in this
1990 * task or not. If it is NULL, then no make_request is active. If
1991 * it is non-NULL, then a make_request is active, and new requests
1992 * should be added at the tail
1994 if (current
->bio_list
) {
1995 bio_list_add(current
->bio_list
, bio
);
1999 /* following loop may be a bit non-obvious, and so deserves some
2001 * Before entering the loop, bio->bi_next is NULL (as all callers
2002 * ensure that) so we have a list with a single bio.
2003 * We pretend that we have just taken it off a longer list, so
2004 * we assign bio_list to a pointer to the bio_list_on_stack,
2005 * thus initialising the bio_list of new bios to be
2006 * added. ->make_request() may indeed add some more bios
2007 * through a recursive call to generic_make_request. If it
2008 * did, we find a non-NULL value in bio_list and re-enter the loop
2009 * from the top. In this case we really did just take the bio
2010 * of the top of the list (no pretending) and so remove it from
2011 * bio_list, and call into ->make_request() again.
2013 BUG_ON(bio
->bi_next
);
2014 bio_list_init(&bio_list_on_stack
);
2015 current
->bio_list
= &bio_list_on_stack
;
2017 struct request_queue
*q
= bdev_get_queue(bio
->bi_bdev
);
2019 if (likely(blk_queue_enter(q
, false) == 0)) {
2020 ret
= q
->make_request_fn(q
, bio
);
2024 bio
= bio_list_pop(current
->bio_list
);
2026 struct bio
*bio_next
= bio_list_pop(current
->bio_list
);
2032 current
->bio_list
= NULL
; /* deactivate */
2037 EXPORT_SYMBOL(generic_make_request
);
2040 * submit_bio - submit a bio to the block device layer for I/O
2041 * @bio: The &struct bio which describes the I/O
2043 * submit_bio() is very similar in purpose to generic_make_request(), and
2044 * uses that function to do most of the work. Both are fairly rough
2045 * interfaces; @bio must be presetup and ready for I/O.
2048 blk_qc_t
submit_bio(struct bio
*bio
)
2051 * If it's a regular read/write or a barrier with data attached,
2052 * go through the normal accounting stuff before submission.
2054 if (bio_has_data(bio
)) {
2057 if (unlikely(bio_op(bio
) == REQ_OP_WRITE_SAME
))
2058 count
= bdev_logical_block_size(bio
->bi_bdev
) >> 9;
2060 count
= bio_sectors(bio
);
2062 if (op_is_write(bio_op(bio
))) {
2063 count_vm_events(PGPGOUT
, count
);
2065 task_io_account_read(bio
->bi_iter
.bi_size
);
2066 count_vm_events(PGPGIN
, count
);
2069 if (unlikely(block_dump
)) {
2070 char b
[BDEVNAME_SIZE
];
2071 printk(KERN_DEBUG
"%s(%d): %s block %Lu on %s (%u sectors)\n",
2072 current
->comm
, task_pid_nr(current
),
2073 op_is_write(bio_op(bio
)) ? "WRITE" : "READ",
2074 (unsigned long long)bio
->bi_iter
.bi_sector
,
2075 bdevname(bio
->bi_bdev
, b
),
2080 return generic_make_request(bio
);
2082 EXPORT_SYMBOL(submit_bio
);
2085 * blk_cloned_rq_check_limits - Helper function to check a cloned request
2086 * for new the queue limits
2088 * @rq: the request being checked
2091 * @rq may have been made based on weaker limitations of upper-level queues
2092 * in request stacking drivers, and it may violate the limitation of @q.
2093 * Since the block layer and the underlying device driver trust @rq
2094 * after it is inserted to @q, it should be checked against @q before
2095 * the insertion using this generic function.
2097 * Request stacking drivers like request-based dm may change the queue
2098 * limits when retrying requests on other queues. Those requests need
2099 * to be checked against the new queue limits again during dispatch.
2101 static int blk_cloned_rq_check_limits(struct request_queue
*q
,
2104 if (blk_rq_sectors(rq
) > blk_queue_get_max_sectors(q
, req_op(rq
))) {
2105 printk(KERN_ERR
"%s: over max size limit.\n", __func__
);
2110 * queue's settings related to segment counting like q->bounce_pfn
2111 * may differ from that of other stacking queues.
2112 * Recalculate it to check the request correctly on this queue's
2115 blk_recalc_rq_segments(rq
);
2116 if (rq
->nr_phys_segments
> queue_max_segments(q
)) {
2117 printk(KERN_ERR
"%s: over max segments limit.\n", __func__
);
2125 * blk_insert_cloned_request - Helper for stacking drivers to submit a request
2126 * @q: the queue to submit the request
2127 * @rq: the request being queued
2129 int blk_insert_cloned_request(struct request_queue
*q
, struct request
*rq
)
2131 unsigned long flags
;
2132 int where
= ELEVATOR_INSERT_BACK
;
2134 if (blk_cloned_rq_check_limits(q
, rq
))
2138 should_fail_request(&rq
->rq_disk
->part0
, blk_rq_bytes(rq
)))
2142 if (blk_queue_io_stat(q
))
2143 blk_account_io_start(rq
, true);
2144 blk_mq_insert_request(rq
, false, true, false);
2148 spin_lock_irqsave(q
->queue_lock
, flags
);
2149 if (unlikely(blk_queue_dying(q
))) {
2150 spin_unlock_irqrestore(q
->queue_lock
, flags
);
2155 * Submitting request must be dequeued before calling this function
2156 * because it will be linked to another request_queue
2158 BUG_ON(blk_queued_rq(rq
));
2160 if (rq
->cmd_flags
& (REQ_PREFLUSH
| REQ_FUA
))
2161 where
= ELEVATOR_INSERT_FLUSH
;
2163 add_acct_request(q
, rq
, where
);
2164 if (where
== ELEVATOR_INSERT_FLUSH
)
2166 spin_unlock_irqrestore(q
->queue_lock
, flags
);
2170 EXPORT_SYMBOL_GPL(blk_insert_cloned_request
);
2173 * blk_rq_err_bytes - determine number of bytes till the next failure boundary
2174 * @rq: request to examine
2177 * A request could be merge of IOs which require different failure
2178 * handling. This function determines the number of bytes which
2179 * can be failed from the beginning of the request without
2180 * crossing into area which need to be retried further.
2183 * The number of bytes to fail.
2186 * queue_lock must be held.
2188 unsigned int blk_rq_err_bytes(const struct request
*rq
)
2190 unsigned int ff
= rq
->cmd_flags
& REQ_FAILFAST_MASK
;
2191 unsigned int bytes
= 0;
2194 if (!(rq
->rq_flags
& RQF_MIXED_MERGE
))
2195 return blk_rq_bytes(rq
);
2198 * Currently the only 'mixing' which can happen is between
2199 * different fastfail types. We can safely fail portions
2200 * which have all the failfast bits that the first one has -
2201 * the ones which are at least as eager to fail as the first
2204 for (bio
= rq
->bio
; bio
; bio
= bio
->bi_next
) {
2205 if ((bio
->bi_opf
& ff
) != ff
)
2207 bytes
+= bio
->bi_iter
.bi_size
;
2210 /* this could lead to infinite loop */
2211 BUG_ON(blk_rq_bytes(rq
) && !bytes
);
2214 EXPORT_SYMBOL_GPL(blk_rq_err_bytes
);
2216 void blk_account_io_completion(struct request
*req
, unsigned int bytes
)
2218 if (blk_do_io_stat(req
)) {
2219 const int rw
= rq_data_dir(req
);
2220 struct hd_struct
*part
;
2223 cpu
= part_stat_lock();
2225 part_stat_add(cpu
, part
, sectors
[rw
], bytes
>> 9);
2230 void blk_account_io_done(struct request
*req
)
2233 * Account IO completion. flush_rq isn't accounted as a
2234 * normal IO on queueing nor completion. Accounting the
2235 * containing request is enough.
2237 if (blk_do_io_stat(req
) && !(req
->rq_flags
& RQF_FLUSH_SEQ
)) {
2238 unsigned long duration
= jiffies
- req
->start_time
;
2239 const int rw
= rq_data_dir(req
);
2240 struct hd_struct
*part
;
2243 cpu
= part_stat_lock();
2246 part_stat_inc(cpu
, part
, ios
[rw
]);
2247 part_stat_add(cpu
, part
, ticks
[rw
], duration
);
2248 part_round_stats(cpu
, part
);
2249 part_dec_in_flight(part
, rw
);
2251 hd_struct_put(part
);
2258 * Don't process normal requests when queue is suspended
2259 * or in the process of suspending/resuming
2261 static struct request
*blk_pm_peek_request(struct request_queue
*q
,
2264 if (q
->dev
&& (q
->rpm_status
== RPM_SUSPENDED
||
2265 (q
->rpm_status
!= RPM_ACTIVE
&& !(rq
->rq_flags
& RQF_PM
))))
2271 static inline struct request
*blk_pm_peek_request(struct request_queue
*q
,
2278 void blk_account_io_start(struct request
*rq
, bool new_io
)
2280 struct hd_struct
*part
;
2281 int rw
= rq_data_dir(rq
);
2284 if (!blk_do_io_stat(rq
))
2287 cpu
= part_stat_lock();
2291 part_stat_inc(cpu
, part
, merges
[rw
]);
2293 part
= disk_map_sector_rcu(rq
->rq_disk
, blk_rq_pos(rq
));
2294 if (!hd_struct_try_get(part
)) {
2296 * The partition is already being removed,
2297 * the request will be accounted on the disk only
2299 * We take a reference on disk->part0 although that
2300 * partition will never be deleted, so we can treat
2301 * it as any other partition.
2303 part
= &rq
->rq_disk
->part0
;
2304 hd_struct_get(part
);
2306 part_round_stats(cpu
, part
);
2307 part_inc_in_flight(part
, rw
);
2315 * blk_peek_request - peek at the top of a request queue
2316 * @q: request queue to peek at
2319 * Return the request at the top of @q. The returned request
2320 * should be started using blk_start_request() before LLD starts
2324 * Pointer to the request at the top of @q if available. Null
2328 * queue_lock must be held.
2330 struct request
*blk_peek_request(struct request_queue
*q
)
2335 while ((rq
= __elv_next_request(q
)) != NULL
) {
2337 rq
= blk_pm_peek_request(q
, rq
);
2341 if (!(rq
->rq_flags
& RQF_STARTED
)) {
2343 * This is the first time the device driver
2344 * sees this request (possibly after
2345 * requeueing). Notify IO scheduler.
2347 if (rq
->rq_flags
& RQF_SORTED
)
2348 elv_activate_rq(q
, rq
);
2351 * just mark as started even if we don't start
2352 * it, a request that has been delayed should
2353 * not be passed by new incoming requests
2355 rq
->rq_flags
|= RQF_STARTED
;
2356 trace_block_rq_issue(q
, rq
);
2359 if (!q
->boundary_rq
|| q
->boundary_rq
== rq
) {
2360 q
->end_sector
= rq_end_sector(rq
);
2361 q
->boundary_rq
= NULL
;
2364 if (rq
->rq_flags
& RQF_DONTPREP
)
2367 if (q
->dma_drain_size
&& blk_rq_bytes(rq
)) {
2369 * make sure space for the drain appears we
2370 * know we can do this because max_hw_segments
2371 * has been adjusted to be one fewer than the
2374 rq
->nr_phys_segments
++;
2380 ret
= q
->prep_rq_fn(q
, rq
);
2381 if (ret
== BLKPREP_OK
) {
2383 } else if (ret
== BLKPREP_DEFER
) {
2385 * the request may have been (partially) prepped.
2386 * we need to keep this request in the front to
2387 * avoid resource deadlock. RQF_STARTED will
2388 * prevent other fs requests from passing this one.
2390 if (q
->dma_drain_size
&& blk_rq_bytes(rq
) &&
2391 !(rq
->rq_flags
& RQF_DONTPREP
)) {
2393 * remove the space for the drain we added
2394 * so that we don't add it again
2396 --rq
->nr_phys_segments
;
2401 } else if (ret
== BLKPREP_KILL
|| ret
== BLKPREP_INVALID
) {
2402 int err
= (ret
== BLKPREP_INVALID
) ? -EREMOTEIO
: -EIO
;
2404 rq
->rq_flags
|= RQF_QUIET
;
2406 * Mark this request as started so we don't trigger
2407 * any debug logic in the end I/O path.
2409 blk_start_request(rq
);
2410 __blk_end_request_all(rq
, err
);
2412 printk(KERN_ERR
"%s: bad return=%d\n", __func__
, ret
);
2419 EXPORT_SYMBOL(blk_peek_request
);
2421 void blk_dequeue_request(struct request
*rq
)
2423 struct request_queue
*q
= rq
->q
;
2425 BUG_ON(list_empty(&rq
->queuelist
));
2426 BUG_ON(ELV_ON_HASH(rq
));
2428 list_del_init(&rq
->queuelist
);
2431 * the time frame between a request being removed from the lists
2432 * and to it is freed is accounted as io that is in progress at
2435 if (blk_account_rq(rq
)) {
2436 q
->in_flight
[rq_is_sync(rq
)]++;
2437 set_io_start_time_ns(rq
);
2442 * blk_start_request - start request processing on the driver
2443 * @req: request to dequeue
2446 * Dequeue @req and start timeout timer on it. This hands off the
2447 * request to the driver.
2449 * Block internal functions which don't want to start timer should
2450 * call blk_dequeue_request().
2453 * queue_lock must be held.
2455 void blk_start_request(struct request
*req
)
2457 blk_dequeue_request(req
);
2459 if (test_bit(QUEUE_FLAG_STATS
, &req
->q
->queue_flags
)) {
2460 blk_stat_set_issue_time(&req
->issue_stat
);
2461 req
->rq_flags
|= RQF_STATS
;
2462 wbt_issue(req
->q
->rq_wb
, &req
->issue_stat
);
2466 * We are now handing the request to the hardware, initialize
2467 * resid_len to full count and add the timeout handler.
2469 req
->resid_len
= blk_rq_bytes(req
);
2470 if (unlikely(blk_bidi_rq(req
)))
2471 req
->next_rq
->resid_len
= blk_rq_bytes(req
->next_rq
);
2473 BUG_ON(test_bit(REQ_ATOM_COMPLETE
, &req
->atomic_flags
));
2476 EXPORT_SYMBOL(blk_start_request
);
2479 * blk_fetch_request - fetch a request from a request queue
2480 * @q: request queue to fetch a request from
2483 * Return the request at the top of @q. The request is started on
2484 * return and LLD can start processing it immediately.
2487 * Pointer to the request at the top of @q if available. Null
2491 * queue_lock must be held.
2493 struct request
*blk_fetch_request(struct request_queue
*q
)
2497 rq
= blk_peek_request(q
);
2499 blk_start_request(rq
);
2502 EXPORT_SYMBOL(blk_fetch_request
);
2505 * blk_update_request - Special helper function for request stacking drivers
2506 * @req: the request being processed
2507 * @error: %0 for success, < %0 for error
2508 * @nr_bytes: number of bytes to complete @req
2511 * Ends I/O on a number of bytes attached to @req, but doesn't complete
2512 * the request structure even if @req doesn't have leftover.
2513 * If @req has leftover, sets it up for the next range of segments.
2515 * This special helper function is only for request stacking drivers
2516 * (e.g. request-based dm) so that they can handle partial completion.
2517 * Actual device drivers should use blk_end_request instead.
2519 * Passing the result of blk_rq_bytes() as @nr_bytes guarantees
2520 * %false return from this function.
2523 * %false - this request doesn't have any more data
2524 * %true - this request has more data
2526 bool blk_update_request(struct request
*req
, int error
, unsigned int nr_bytes
)
2530 trace_block_rq_complete(req
->q
, req
, nr_bytes
);
2536 * For fs requests, rq is just carrier of independent bio's
2537 * and each partial completion should be handled separately.
2538 * Reset per-request error on each partial completion.
2540 * TODO: tj: This is too subtle. It would be better to let
2541 * low level drivers do what they see fit.
2543 if (req
->cmd_type
== REQ_TYPE_FS
)
2546 if (error
&& req
->cmd_type
== REQ_TYPE_FS
&&
2547 !(req
->rq_flags
& RQF_QUIET
)) {
2552 error_type
= "recoverable transport";
2555 error_type
= "critical target";
2558 error_type
= "critical nexus";
2561 error_type
= "timeout";
2564 error_type
= "critical space allocation";
2567 error_type
= "critical medium";
2574 printk_ratelimited(KERN_ERR
"%s: %s error, dev %s, sector %llu\n",
2575 __func__
, error_type
, req
->rq_disk
?
2576 req
->rq_disk
->disk_name
: "?",
2577 (unsigned long long)blk_rq_pos(req
));
2581 blk_account_io_completion(req
, nr_bytes
);
2585 struct bio
*bio
= req
->bio
;
2586 unsigned bio_bytes
= min(bio
->bi_iter
.bi_size
, nr_bytes
);
2588 if (bio_bytes
== bio
->bi_iter
.bi_size
)
2589 req
->bio
= bio
->bi_next
;
2591 req_bio_endio(req
, bio
, bio_bytes
, error
);
2593 total_bytes
+= bio_bytes
;
2594 nr_bytes
-= bio_bytes
;
2605 * Reset counters so that the request stacking driver
2606 * can find how many bytes remain in the request
2609 req
->__data_len
= 0;
2613 WARN_ON_ONCE(req
->rq_flags
& RQF_SPECIAL_PAYLOAD
);
2615 req
->__data_len
-= total_bytes
;
2617 /* update sector only for requests with clear definition of sector */
2618 if (req
->cmd_type
== REQ_TYPE_FS
)
2619 req
->__sector
+= total_bytes
>> 9;
2621 /* mixed attributes always follow the first bio */
2622 if (req
->rq_flags
& RQF_MIXED_MERGE
) {
2623 req
->cmd_flags
&= ~REQ_FAILFAST_MASK
;
2624 req
->cmd_flags
|= req
->bio
->bi_opf
& REQ_FAILFAST_MASK
;
2628 * If total number of sectors is less than the first segment
2629 * size, something has gone terribly wrong.
2631 if (blk_rq_bytes(req
) < blk_rq_cur_bytes(req
)) {
2632 blk_dump_rq_flags(req
, "request botched");
2633 req
->__data_len
= blk_rq_cur_bytes(req
);
2636 /* recalculate the number of segments */
2637 blk_recalc_rq_segments(req
);
2641 EXPORT_SYMBOL_GPL(blk_update_request
);
2643 static bool blk_update_bidi_request(struct request
*rq
, int error
,
2644 unsigned int nr_bytes
,
2645 unsigned int bidi_bytes
)
2647 if (blk_update_request(rq
, error
, nr_bytes
))
2650 /* Bidi request must be completed as a whole */
2651 if (unlikely(blk_bidi_rq(rq
)) &&
2652 blk_update_request(rq
->next_rq
, error
, bidi_bytes
))
2655 if (blk_queue_add_random(rq
->q
))
2656 add_disk_randomness(rq
->rq_disk
);
2662 * blk_unprep_request - unprepare a request
2665 * This function makes a request ready for complete resubmission (or
2666 * completion). It happens only after all error handling is complete,
2667 * so represents the appropriate moment to deallocate any resources
2668 * that were allocated to the request in the prep_rq_fn. The queue
2669 * lock is held when calling this.
2671 void blk_unprep_request(struct request
*req
)
2673 struct request_queue
*q
= req
->q
;
2675 req
->rq_flags
&= ~RQF_DONTPREP
;
2676 if (q
->unprep_rq_fn
)
2677 q
->unprep_rq_fn(q
, req
);
2679 EXPORT_SYMBOL_GPL(blk_unprep_request
);
2682 * queue lock must be held
2684 void blk_finish_request(struct request
*req
, int error
)
2686 struct request_queue
*q
= req
->q
;
2688 if (req
->rq_flags
& RQF_STATS
)
2689 blk_stat_add(&q
->rq_stats
[rq_data_dir(req
)], req
);
2691 if (req
->rq_flags
& RQF_QUEUED
)
2692 blk_queue_end_tag(q
, req
);
2694 BUG_ON(blk_queued_rq(req
));
2696 if (unlikely(laptop_mode
) && req
->cmd_type
== REQ_TYPE_FS
)
2697 laptop_io_completion(&req
->q
->backing_dev_info
);
2699 blk_delete_timer(req
);
2701 if (req
->rq_flags
& RQF_DONTPREP
)
2702 blk_unprep_request(req
);
2704 blk_account_io_done(req
);
2707 wbt_done(req
->q
->rq_wb
, &req
->issue_stat
);
2708 req
->end_io(req
, error
);
2710 if (blk_bidi_rq(req
))
2711 __blk_put_request(req
->next_rq
->q
, req
->next_rq
);
2713 __blk_put_request(q
, req
);
2716 EXPORT_SYMBOL(blk_finish_request
);
2719 * blk_end_bidi_request - Complete a bidi request
2720 * @rq: the request to complete
2721 * @error: %0 for success, < %0 for error
2722 * @nr_bytes: number of bytes to complete @rq
2723 * @bidi_bytes: number of bytes to complete @rq->next_rq
2726 * Ends I/O on a number of bytes attached to @rq and @rq->next_rq.
2727 * Drivers that supports bidi can safely call this member for any
2728 * type of request, bidi or uni. In the later case @bidi_bytes is
2732 * %false - we are done with this request
2733 * %true - still buffers pending for this request
2735 static bool blk_end_bidi_request(struct request
*rq
, int error
,
2736 unsigned int nr_bytes
, unsigned int bidi_bytes
)
2738 struct request_queue
*q
= rq
->q
;
2739 unsigned long flags
;
2741 if (blk_update_bidi_request(rq
, error
, nr_bytes
, bidi_bytes
))
2744 spin_lock_irqsave(q
->queue_lock
, flags
);
2745 blk_finish_request(rq
, error
);
2746 spin_unlock_irqrestore(q
->queue_lock
, flags
);
2752 * __blk_end_bidi_request - Complete a bidi request with queue lock held
2753 * @rq: the request to complete
2754 * @error: %0 for success, < %0 for error
2755 * @nr_bytes: number of bytes to complete @rq
2756 * @bidi_bytes: number of bytes to complete @rq->next_rq
2759 * Identical to blk_end_bidi_request() except that queue lock is
2760 * assumed to be locked on entry and remains so on return.
2763 * %false - we are done with this request
2764 * %true - still buffers pending for this request
2766 bool __blk_end_bidi_request(struct request
*rq
, int error
,
2767 unsigned int nr_bytes
, unsigned int bidi_bytes
)
2769 if (blk_update_bidi_request(rq
, error
, nr_bytes
, bidi_bytes
))
2772 blk_finish_request(rq
, error
);
2778 * blk_end_request - Helper function for drivers to complete the request.
2779 * @rq: the request being processed
2780 * @error: %0 for success, < %0 for error
2781 * @nr_bytes: number of bytes to complete
2784 * Ends I/O on a number of bytes attached to @rq.
2785 * If @rq has leftover, sets it up for the next range of segments.
2788 * %false - we are done with this request
2789 * %true - still buffers pending for this request
2791 bool blk_end_request(struct request
*rq
, int error
, unsigned int nr_bytes
)
2793 return blk_end_bidi_request(rq
, error
, nr_bytes
, 0);
2795 EXPORT_SYMBOL(blk_end_request
);
2798 * blk_end_request_all - Helper function for drives to finish the request.
2799 * @rq: the request to finish
2800 * @error: %0 for success, < %0 for error
2803 * Completely finish @rq.
2805 void blk_end_request_all(struct request
*rq
, int error
)
2808 unsigned int bidi_bytes
= 0;
2810 if (unlikely(blk_bidi_rq(rq
)))
2811 bidi_bytes
= blk_rq_bytes(rq
->next_rq
);
2813 pending
= blk_end_bidi_request(rq
, error
, blk_rq_bytes(rq
), bidi_bytes
);
2816 EXPORT_SYMBOL(blk_end_request_all
);
2819 * blk_end_request_cur - Helper function to finish the current request chunk.
2820 * @rq: the request to finish the current chunk for
2821 * @error: %0 for success, < %0 for error
2824 * Complete the current consecutively mapped chunk from @rq.
2827 * %false - we are done with this request
2828 * %true - still buffers pending for this request
2830 bool blk_end_request_cur(struct request
*rq
, int error
)
2832 return blk_end_request(rq
, error
, blk_rq_cur_bytes(rq
));
2834 EXPORT_SYMBOL(blk_end_request_cur
);
2837 * blk_end_request_err - Finish a request till the next failure boundary.
2838 * @rq: the request to finish till the next failure boundary for
2839 * @error: must be negative errno
2842 * Complete @rq till the next failure boundary.
2845 * %false - we are done with this request
2846 * %true - still buffers pending for this request
2848 bool blk_end_request_err(struct request
*rq
, int error
)
2850 WARN_ON(error
>= 0);
2851 return blk_end_request(rq
, error
, blk_rq_err_bytes(rq
));
2853 EXPORT_SYMBOL_GPL(blk_end_request_err
);
2856 * __blk_end_request - Helper function for drivers to complete the request.
2857 * @rq: the request being processed
2858 * @error: %0 for success, < %0 for error
2859 * @nr_bytes: number of bytes to complete
2862 * Must be called with queue lock held unlike blk_end_request().
2865 * %false - we are done with this request
2866 * %true - still buffers pending for this request
2868 bool __blk_end_request(struct request
*rq
, int error
, unsigned int nr_bytes
)
2870 return __blk_end_bidi_request(rq
, error
, nr_bytes
, 0);
2872 EXPORT_SYMBOL(__blk_end_request
);
2875 * __blk_end_request_all - Helper function for drives to finish the request.
2876 * @rq: the request to finish
2877 * @error: %0 for success, < %0 for error
2880 * Completely finish @rq. Must be called with queue lock held.
2882 void __blk_end_request_all(struct request
*rq
, int error
)
2885 unsigned int bidi_bytes
= 0;
2887 if (unlikely(blk_bidi_rq(rq
)))
2888 bidi_bytes
= blk_rq_bytes(rq
->next_rq
);
2890 pending
= __blk_end_bidi_request(rq
, error
, blk_rq_bytes(rq
), bidi_bytes
);
2893 EXPORT_SYMBOL(__blk_end_request_all
);
2896 * __blk_end_request_cur - Helper function to finish the current request chunk.
2897 * @rq: the request to finish the current chunk for
2898 * @error: %0 for success, < %0 for error
2901 * Complete the current consecutively mapped chunk from @rq. Must
2902 * be called with queue lock held.
2905 * %false - we are done with this request
2906 * %true - still buffers pending for this request
2908 bool __blk_end_request_cur(struct request
*rq
, int error
)
2910 return __blk_end_request(rq
, error
, blk_rq_cur_bytes(rq
));
2912 EXPORT_SYMBOL(__blk_end_request_cur
);
2915 * __blk_end_request_err - Finish a request till the next failure boundary.
2916 * @rq: the request to finish till the next failure boundary for
2917 * @error: must be negative errno
2920 * Complete @rq till the next failure boundary. Must be called
2921 * with queue lock held.
2924 * %false - we are done with this request
2925 * %true - still buffers pending for this request
2927 bool __blk_end_request_err(struct request
*rq
, int error
)
2929 WARN_ON(error
>= 0);
2930 return __blk_end_request(rq
, error
, blk_rq_err_bytes(rq
));
2932 EXPORT_SYMBOL_GPL(__blk_end_request_err
);
2934 void blk_rq_bio_prep(struct request_queue
*q
, struct request
*rq
,
2937 if (bio_has_data(bio
))
2938 rq
->nr_phys_segments
= bio_phys_segments(q
, bio
);
2940 rq
->__data_len
= bio
->bi_iter
.bi_size
;
2941 rq
->bio
= rq
->biotail
= bio
;
2944 rq
->rq_disk
= bio
->bi_bdev
->bd_disk
;
2947 #if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
2949 * rq_flush_dcache_pages - Helper function to flush all pages in a request
2950 * @rq: the request to be flushed
2953 * Flush all pages in @rq.
2955 void rq_flush_dcache_pages(struct request
*rq
)
2957 struct req_iterator iter
;
2958 struct bio_vec bvec
;
2960 rq_for_each_segment(bvec
, rq
, iter
)
2961 flush_dcache_page(bvec
.bv_page
);
2963 EXPORT_SYMBOL_GPL(rq_flush_dcache_pages
);
2967 * blk_lld_busy - Check if underlying low-level drivers of a device are busy
2968 * @q : the queue of the device being checked
2971 * Check if underlying low-level drivers of a device are busy.
2972 * If the drivers want to export their busy state, they must set own
2973 * exporting function using blk_queue_lld_busy() first.
2975 * Basically, this function is used only by request stacking drivers
2976 * to stop dispatching requests to underlying devices when underlying
2977 * devices are busy. This behavior helps more I/O merging on the queue
2978 * of the request stacking driver and prevents I/O throughput regression
2979 * on burst I/O load.
2982 * 0 - Not busy (The request stacking driver should dispatch request)
2983 * 1 - Busy (The request stacking driver should stop dispatching request)
2985 int blk_lld_busy(struct request_queue
*q
)
2988 return q
->lld_busy_fn(q
);
2992 EXPORT_SYMBOL_GPL(blk_lld_busy
);
2995 * blk_rq_unprep_clone - Helper function to free all bios in a cloned request
2996 * @rq: the clone request to be cleaned up
2999 * Free all bios in @rq for a cloned request.
3001 void blk_rq_unprep_clone(struct request
*rq
)
3005 while ((bio
= rq
->bio
) != NULL
) {
3006 rq
->bio
= bio
->bi_next
;
3011 EXPORT_SYMBOL_GPL(blk_rq_unprep_clone
);
3014 * Copy attributes of the original request to the clone request.
3015 * The actual data parts (e.g. ->cmd, ->sense) are not copied.
3017 static void __blk_rq_prep_clone(struct request
*dst
, struct request
*src
)
3019 dst
->cpu
= src
->cpu
;
3020 dst
->cmd_flags
= src
->cmd_flags
| REQ_NOMERGE
;
3021 dst
->cmd_type
= src
->cmd_type
;
3022 dst
->__sector
= blk_rq_pos(src
);
3023 dst
->__data_len
= blk_rq_bytes(src
);
3024 dst
->nr_phys_segments
= src
->nr_phys_segments
;
3025 dst
->ioprio
= src
->ioprio
;
3026 dst
->extra_len
= src
->extra_len
;
3030 * blk_rq_prep_clone - Helper function to setup clone request
3031 * @rq: the request to be setup
3032 * @rq_src: original request to be cloned
3033 * @bs: bio_set that bios for clone are allocated from
3034 * @gfp_mask: memory allocation mask for bio
3035 * @bio_ctr: setup function to be called for each clone bio.
3036 * Returns %0 for success, non %0 for failure.
3037 * @data: private data to be passed to @bio_ctr
3040 * Clones bios in @rq_src to @rq, and copies attributes of @rq_src to @rq.
3041 * The actual data parts of @rq_src (e.g. ->cmd, ->sense)
3042 * are not copied, and copying such parts is the caller's responsibility.
3043 * Also, pages which the original bios are pointing to are not copied
3044 * and the cloned bios just point same pages.
3045 * So cloned bios must be completed before original bios, which means
3046 * the caller must complete @rq before @rq_src.
3048 int blk_rq_prep_clone(struct request
*rq
, struct request
*rq_src
,
3049 struct bio_set
*bs
, gfp_t gfp_mask
,
3050 int (*bio_ctr
)(struct bio
*, struct bio
*, void *),
3053 struct bio
*bio
, *bio_src
;
3058 __rq_for_each_bio(bio_src
, rq_src
) {
3059 bio
= bio_clone_fast(bio_src
, gfp_mask
, bs
);
3063 if (bio_ctr
&& bio_ctr(bio
, bio_src
, data
))
3067 rq
->biotail
->bi_next
= bio
;
3070 rq
->bio
= rq
->biotail
= bio
;
3073 __blk_rq_prep_clone(rq
, rq_src
);
3080 blk_rq_unprep_clone(rq
);
3084 EXPORT_SYMBOL_GPL(blk_rq_prep_clone
);
3086 int kblockd_schedule_work(struct work_struct
*work
)
3088 return queue_work(kblockd_workqueue
, work
);
3090 EXPORT_SYMBOL(kblockd_schedule_work
);
3092 int kblockd_schedule_work_on(int cpu
, struct work_struct
*work
)
3094 return queue_work_on(cpu
, kblockd_workqueue
, work
);
3096 EXPORT_SYMBOL(kblockd_schedule_work_on
);
3098 int kblockd_schedule_delayed_work(struct delayed_work
*dwork
,
3099 unsigned long delay
)
3101 return queue_delayed_work(kblockd_workqueue
, dwork
, delay
);
3103 EXPORT_SYMBOL(kblockd_schedule_delayed_work
);
3105 int kblockd_schedule_delayed_work_on(int cpu
, struct delayed_work
*dwork
,
3106 unsigned long delay
)
3108 return queue_delayed_work_on(cpu
, kblockd_workqueue
, dwork
, delay
);
3110 EXPORT_SYMBOL(kblockd_schedule_delayed_work_on
);
3113 * blk_start_plug - initialize blk_plug and track it inside the task_struct
3114 * @plug: The &struct blk_plug that needs to be initialized
3117 * Tracking blk_plug inside the task_struct will help with auto-flushing the
3118 * pending I/O should the task end up blocking between blk_start_plug() and
3119 * blk_finish_plug(). This is important from a performance perspective, but
3120 * also ensures that we don't deadlock. For instance, if the task is blocking
3121 * for a memory allocation, memory reclaim could end up wanting to free a
3122 * page belonging to that request that is currently residing in our private
3123 * plug. By flushing the pending I/O when the process goes to sleep, we avoid
3124 * this kind of deadlock.
3126 void blk_start_plug(struct blk_plug
*plug
)
3128 struct task_struct
*tsk
= current
;
3131 * If this is a nested plug, don't actually assign it.
3136 INIT_LIST_HEAD(&plug
->list
);
3137 INIT_LIST_HEAD(&plug
->mq_list
);
3138 INIT_LIST_HEAD(&plug
->cb_list
);
3140 * Store ordering should not be needed here, since a potential
3141 * preempt will imply a full memory barrier
3145 EXPORT_SYMBOL(blk_start_plug
);
3147 static int plug_rq_cmp(void *priv
, struct list_head
*a
, struct list_head
*b
)
3149 struct request
*rqa
= container_of(a
, struct request
, queuelist
);
3150 struct request
*rqb
= container_of(b
, struct request
, queuelist
);
3152 return !(rqa
->q
< rqb
->q
||
3153 (rqa
->q
== rqb
->q
&& blk_rq_pos(rqa
) < blk_rq_pos(rqb
)));
3157 * If 'from_schedule' is true, then postpone the dispatch of requests
3158 * until a safe kblockd context. We due this to avoid accidental big
3159 * additional stack usage in driver dispatch, in places where the originally
3160 * plugger did not intend it.
3162 static void queue_unplugged(struct request_queue
*q
, unsigned int depth
,
3164 __releases(q
->queue_lock
)
3166 trace_block_unplug(q
, depth
, !from_schedule
);
3169 blk_run_queue_async(q
);
3172 spin_unlock(q
->queue_lock
);
3175 static void flush_plug_callbacks(struct blk_plug
*plug
, bool from_schedule
)
3177 LIST_HEAD(callbacks
);
3179 while (!list_empty(&plug
->cb_list
)) {
3180 list_splice_init(&plug
->cb_list
, &callbacks
);
3182 while (!list_empty(&callbacks
)) {
3183 struct blk_plug_cb
*cb
= list_first_entry(&callbacks
,
3186 list_del(&cb
->list
);
3187 cb
->callback(cb
, from_schedule
);
3192 struct blk_plug_cb
*blk_check_plugged(blk_plug_cb_fn unplug
, void *data
,
3195 struct blk_plug
*plug
= current
->plug
;
3196 struct blk_plug_cb
*cb
;
3201 list_for_each_entry(cb
, &plug
->cb_list
, list
)
3202 if (cb
->callback
== unplug
&& cb
->data
== data
)
3205 /* Not currently on the callback list */
3206 BUG_ON(size
< sizeof(*cb
));
3207 cb
= kzalloc(size
, GFP_ATOMIC
);
3210 cb
->callback
= unplug
;
3211 list_add(&cb
->list
, &plug
->cb_list
);
3215 EXPORT_SYMBOL(blk_check_plugged
);
3217 void blk_flush_plug_list(struct blk_plug
*plug
, bool from_schedule
)
3219 struct request_queue
*q
;
3220 unsigned long flags
;
3225 flush_plug_callbacks(plug
, from_schedule
);
3227 if (!list_empty(&plug
->mq_list
))
3228 blk_mq_flush_plug_list(plug
, from_schedule
);
3230 if (list_empty(&plug
->list
))
3233 list_splice_init(&plug
->list
, &list
);
3235 list_sort(NULL
, &list
, plug_rq_cmp
);
3241 * Save and disable interrupts here, to avoid doing it for every
3242 * queue lock we have to take.
3244 local_irq_save(flags
);
3245 while (!list_empty(&list
)) {
3246 rq
= list_entry_rq(list
.next
);
3247 list_del_init(&rq
->queuelist
);
3251 * This drops the queue lock
3254 queue_unplugged(q
, depth
, from_schedule
);
3257 spin_lock(q
->queue_lock
);
3261 * Short-circuit if @q is dead
3263 if (unlikely(blk_queue_dying(q
))) {
3264 __blk_end_request_all(rq
, -ENODEV
);
3269 * rq is already accounted, so use raw insert
3271 if (rq
->cmd_flags
& (REQ_PREFLUSH
| REQ_FUA
))
3272 __elv_add_request(q
, rq
, ELEVATOR_INSERT_FLUSH
);
3274 __elv_add_request(q
, rq
, ELEVATOR_INSERT_SORT_MERGE
);
3280 * This drops the queue lock
3283 queue_unplugged(q
, depth
, from_schedule
);
3285 local_irq_restore(flags
);
3288 void blk_finish_plug(struct blk_plug
*plug
)
3290 if (plug
!= current
->plug
)
3292 blk_flush_plug_list(plug
, false);
3294 current
->plug
= NULL
;
3296 EXPORT_SYMBOL(blk_finish_plug
);
3300 * blk_pm_runtime_init - Block layer runtime PM initialization routine
3301 * @q: the queue of the device
3302 * @dev: the device the queue belongs to
3305 * Initialize runtime-PM-related fields for @q and start auto suspend for
3306 * @dev. Drivers that want to take advantage of request-based runtime PM
3307 * should call this function after @dev has been initialized, and its
3308 * request queue @q has been allocated, and runtime PM for it can not happen
3309 * yet(either due to disabled/forbidden or its usage_count > 0). In most
3310 * cases, driver should call this function before any I/O has taken place.
3312 * This function takes care of setting up using auto suspend for the device,
3313 * the autosuspend delay is set to -1 to make runtime suspend impossible
3314 * until an updated value is either set by user or by driver. Drivers do
3315 * not need to touch other autosuspend settings.
3317 * The block layer runtime PM is request based, so only works for drivers
3318 * that use request as their IO unit instead of those directly use bio's.
3320 void blk_pm_runtime_init(struct request_queue
*q
, struct device
*dev
)
3323 q
->rpm_status
= RPM_ACTIVE
;
3324 pm_runtime_set_autosuspend_delay(q
->dev
, -1);
3325 pm_runtime_use_autosuspend(q
->dev
);
3327 EXPORT_SYMBOL(blk_pm_runtime_init
);
3330 * blk_pre_runtime_suspend - Pre runtime suspend check
3331 * @q: the queue of the device
3334 * This function will check if runtime suspend is allowed for the device
3335 * by examining if there are any requests pending in the queue. If there
3336 * are requests pending, the device can not be runtime suspended; otherwise,
3337 * the queue's status will be updated to SUSPENDING and the driver can
3338 * proceed to suspend the device.
3340 * For the not allowed case, we mark last busy for the device so that
3341 * runtime PM core will try to autosuspend it some time later.
3343 * This function should be called near the start of the device's
3344 * runtime_suspend callback.
3347 * 0 - OK to runtime suspend the device
3348 * -EBUSY - Device should not be runtime suspended
3350 int blk_pre_runtime_suspend(struct request_queue
*q
)
3357 spin_lock_irq(q
->queue_lock
);
3358 if (q
->nr_pending
) {
3360 pm_runtime_mark_last_busy(q
->dev
);
3362 q
->rpm_status
= RPM_SUSPENDING
;
3364 spin_unlock_irq(q
->queue_lock
);
3367 EXPORT_SYMBOL(blk_pre_runtime_suspend
);
3370 * blk_post_runtime_suspend - Post runtime suspend processing
3371 * @q: the queue of the device
3372 * @err: return value of the device's runtime_suspend function
3375 * Update the queue's runtime status according to the return value of the
3376 * device's runtime suspend function and mark last busy for the device so
3377 * that PM core will try to auto suspend the device at a later time.
3379 * This function should be called near the end of the device's
3380 * runtime_suspend callback.
3382 void blk_post_runtime_suspend(struct request_queue
*q
, int err
)
3387 spin_lock_irq(q
->queue_lock
);
3389 q
->rpm_status
= RPM_SUSPENDED
;
3391 q
->rpm_status
= RPM_ACTIVE
;
3392 pm_runtime_mark_last_busy(q
->dev
);
3394 spin_unlock_irq(q
->queue_lock
);
3396 EXPORT_SYMBOL(blk_post_runtime_suspend
);
3399 * blk_pre_runtime_resume - Pre runtime resume processing
3400 * @q: the queue of the device
3403 * Update the queue's runtime status to RESUMING in preparation for the
3404 * runtime resume of the device.
3406 * This function should be called near the start of the device's
3407 * runtime_resume callback.
3409 void blk_pre_runtime_resume(struct request_queue
*q
)
3414 spin_lock_irq(q
->queue_lock
);
3415 q
->rpm_status
= RPM_RESUMING
;
3416 spin_unlock_irq(q
->queue_lock
);
3418 EXPORT_SYMBOL(blk_pre_runtime_resume
);
3421 * blk_post_runtime_resume - Post runtime resume processing
3422 * @q: the queue of the device
3423 * @err: return value of the device's runtime_resume function
3426 * Update the queue's runtime status according to the return value of the
3427 * device's runtime_resume function. If it is successfully resumed, process
3428 * the requests that are queued into the device's queue when it is resuming
3429 * and then mark last busy and initiate autosuspend for it.
3431 * This function should be called near the end of the device's
3432 * runtime_resume callback.
3434 void blk_post_runtime_resume(struct request_queue
*q
, int err
)
3439 spin_lock_irq(q
->queue_lock
);
3441 q
->rpm_status
= RPM_ACTIVE
;
3443 pm_runtime_mark_last_busy(q
->dev
);
3444 pm_request_autosuspend(q
->dev
);
3446 q
->rpm_status
= RPM_SUSPENDED
;
3448 spin_unlock_irq(q
->queue_lock
);
3450 EXPORT_SYMBOL(blk_post_runtime_resume
);
3453 * blk_set_runtime_active - Force runtime status of the queue to be active
3454 * @q: the queue of the device
3456 * If the device is left runtime suspended during system suspend the resume
3457 * hook typically resumes the device and corrects runtime status
3458 * accordingly. However, that does not affect the queue runtime PM status
3459 * which is still "suspended". This prevents processing requests from the
3462 * This function can be used in driver's resume hook to correct queue
3463 * runtime PM status and re-enable peeking requests from the queue. It
3464 * should be called before first request is added to the queue.
3466 void blk_set_runtime_active(struct request_queue
*q
)
3468 spin_lock_irq(q
->queue_lock
);
3469 q
->rpm_status
= RPM_ACTIVE
;
3470 pm_runtime_mark_last_busy(q
->dev
);
3471 pm_request_autosuspend(q
->dev
);
3472 spin_unlock_irq(q
->queue_lock
);
3474 EXPORT_SYMBOL(blk_set_runtime_active
);
3477 int __init
blk_dev_init(void)
3479 BUILD_BUG_ON(REQ_OP_LAST
>= (1 << REQ_OP_BITS
));
3480 BUILD_BUG_ON(REQ_OP_BITS
+ REQ_FLAG_BITS
> 8 *
3481 FIELD_SIZEOF(struct request
, cmd_flags
));
3482 BUILD_BUG_ON(REQ_OP_BITS
+ REQ_FLAG_BITS
> 8 *
3483 FIELD_SIZEOF(struct bio
, bi_opf
));
3485 /* used for unplugging and affects IO latency/throughput - HIGHPRI */
3486 kblockd_workqueue
= alloc_workqueue("kblockd",
3487 WQ_MEM_RECLAIM
| WQ_HIGHPRI
, 0);
3488 if (!kblockd_workqueue
)
3489 panic("Failed to create kblockd\n");
3491 request_cachep
= kmem_cache_create("blkdev_requests",
3492 sizeof(struct request
), 0, SLAB_PANIC
, NULL
);
3494 blk_requestq_cachep
= kmem_cache_create("request_queue",
3495 sizeof(struct request_queue
), 0, SLAB_PANIC
, NULL
);