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>
36 #include <linux/debugfs.h>
38 #define CREATE_TRACE_POINTS
39 #include <trace/events/block.h>
43 #include "blk-mq-sched.h"
46 #ifdef CONFIG_DEBUG_FS
47 struct dentry
*blk_debugfs_root
;
50 EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_remap
);
51 EXPORT_TRACEPOINT_SYMBOL_GPL(block_rq_remap
);
52 EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_complete
);
53 EXPORT_TRACEPOINT_SYMBOL_GPL(block_split
);
54 EXPORT_TRACEPOINT_SYMBOL_GPL(block_unplug
);
56 DEFINE_IDA(blk_queue_ida
);
59 * For the allocated request tables
61 struct kmem_cache
*request_cachep
;
64 * For queue allocation
66 struct kmem_cache
*blk_requestq_cachep
;
69 * Controlling structure to kblockd
71 static struct workqueue_struct
*kblockd_workqueue
;
73 static void blk_clear_congested(struct request_list
*rl
, int sync
)
75 #ifdef CONFIG_CGROUP_WRITEBACK
76 clear_wb_congested(rl
->blkg
->wb_congested
, sync
);
79 * If !CGROUP_WRITEBACK, all blkg's map to bdi->wb and we shouldn't
80 * flip its congestion state for events on other blkcgs.
82 if (rl
== &rl
->q
->root_rl
)
83 clear_wb_congested(rl
->q
->backing_dev_info
->wb
.congested
, sync
);
87 static void blk_set_congested(struct request_list
*rl
, int sync
)
89 #ifdef CONFIG_CGROUP_WRITEBACK
90 set_wb_congested(rl
->blkg
->wb_congested
, sync
);
92 /* see blk_clear_congested() */
93 if (rl
== &rl
->q
->root_rl
)
94 set_wb_congested(rl
->q
->backing_dev_info
->wb
.congested
, sync
);
98 void blk_queue_congestion_threshold(struct request_queue
*q
)
102 nr
= q
->nr_requests
- (q
->nr_requests
/ 8) + 1;
103 if (nr
> q
->nr_requests
)
105 q
->nr_congestion_on
= nr
;
107 nr
= q
->nr_requests
- (q
->nr_requests
/ 8) - (q
->nr_requests
/ 16) - 1;
110 q
->nr_congestion_off
= nr
;
113 void blk_rq_init(struct request_queue
*q
, struct request
*rq
)
115 memset(rq
, 0, sizeof(*rq
));
117 INIT_LIST_HEAD(&rq
->queuelist
);
118 INIT_LIST_HEAD(&rq
->timeout_list
);
121 rq
->__sector
= (sector_t
) -1;
122 INIT_HLIST_NODE(&rq
->hash
);
123 RB_CLEAR_NODE(&rq
->rb_node
);
125 rq
->internal_tag
= -1;
126 rq
->start_time
= jiffies
;
127 set_start_time_ns(rq
);
130 EXPORT_SYMBOL(blk_rq_init
);
132 static const struct {
136 [BLK_STS_OK
] = { 0, "" },
137 [BLK_STS_NOTSUPP
] = { -EOPNOTSUPP
, "operation not supported" },
138 [BLK_STS_TIMEOUT
] = { -ETIMEDOUT
, "timeout" },
139 [BLK_STS_NOSPC
] = { -ENOSPC
, "critical space allocation" },
140 [BLK_STS_TRANSPORT
] = { -ENOLINK
, "recoverable transport" },
141 [BLK_STS_TARGET
] = { -EREMOTEIO
, "critical target" },
142 [BLK_STS_NEXUS
] = { -EBADE
, "critical nexus" },
143 [BLK_STS_MEDIUM
] = { -ENODATA
, "critical medium" },
144 [BLK_STS_PROTECTION
] = { -EILSEQ
, "protection" },
145 [BLK_STS_RESOURCE
] = { -ENOMEM
, "kernel resource" },
146 [BLK_STS_AGAIN
] = { -EAGAIN
, "nonblocking retry" },
148 /* device mapper special case, should not leak out: */
149 [BLK_STS_DM_REQUEUE
] = { -EREMCHG
, "dm internal retry" },
151 /* everything else not covered above: */
152 [BLK_STS_IOERR
] = { -EIO
, "I/O" },
155 blk_status_t
errno_to_blk_status(int errno
)
159 for (i
= 0; i
< ARRAY_SIZE(blk_errors
); i
++) {
160 if (blk_errors
[i
].errno
== errno
)
161 return (__force blk_status_t
)i
;
164 return BLK_STS_IOERR
;
166 EXPORT_SYMBOL_GPL(errno_to_blk_status
);
168 int blk_status_to_errno(blk_status_t status
)
170 int idx
= (__force
int)status
;
172 if (WARN_ON_ONCE(idx
>= ARRAY_SIZE(blk_errors
)))
174 return blk_errors
[idx
].errno
;
176 EXPORT_SYMBOL_GPL(blk_status_to_errno
);
178 static void print_req_error(struct request
*req
, blk_status_t status
)
180 int idx
= (__force
int)status
;
182 if (WARN_ON_ONCE(idx
>= ARRAY_SIZE(blk_errors
)))
185 printk_ratelimited(KERN_ERR
"%s: %s error, dev %s, sector %llu\n",
186 __func__
, blk_errors
[idx
].name
, req
->rq_disk
?
187 req
->rq_disk
->disk_name
: "?",
188 (unsigned long long)blk_rq_pos(req
));
191 static void req_bio_endio(struct request
*rq
, struct bio
*bio
,
192 unsigned int nbytes
, blk_status_t error
)
195 bio
->bi_status
= error
;
197 if (unlikely(rq
->rq_flags
& RQF_QUIET
))
198 bio_set_flag(bio
, BIO_QUIET
);
200 bio_advance(bio
, nbytes
);
202 /* don't actually finish bio if it's part of flush sequence */
203 if (bio
->bi_iter
.bi_size
== 0 && !(rq
->rq_flags
& RQF_FLUSH_SEQ
))
207 void blk_dump_rq_flags(struct request
*rq
, char *msg
)
209 printk(KERN_INFO
"%s: dev %s: flags=%llx\n", msg
,
210 rq
->rq_disk
? rq
->rq_disk
->disk_name
: "?",
211 (unsigned long long) rq
->cmd_flags
);
213 printk(KERN_INFO
" sector %llu, nr/cnr %u/%u\n",
214 (unsigned long long)blk_rq_pos(rq
),
215 blk_rq_sectors(rq
), blk_rq_cur_sectors(rq
));
216 printk(KERN_INFO
" bio %p, biotail %p, len %u\n",
217 rq
->bio
, rq
->biotail
, blk_rq_bytes(rq
));
219 EXPORT_SYMBOL(blk_dump_rq_flags
);
221 static void blk_delay_work(struct work_struct
*work
)
223 struct request_queue
*q
;
225 q
= container_of(work
, struct request_queue
, delay_work
.work
);
226 spin_lock_irq(q
->queue_lock
);
228 spin_unlock_irq(q
->queue_lock
);
232 * blk_delay_queue - restart queueing after defined interval
233 * @q: The &struct request_queue in question
234 * @msecs: Delay in msecs
237 * Sometimes queueing needs to be postponed for a little while, to allow
238 * resources to come back. This function will make sure that queueing is
239 * restarted around the specified time.
241 void blk_delay_queue(struct request_queue
*q
, unsigned long msecs
)
243 lockdep_assert_held(q
->queue_lock
);
244 WARN_ON_ONCE(q
->mq_ops
);
246 if (likely(!blk_queue_dead(q
)))
247 queue_delayed_work(kblockd_workqueue
, &q
->delay_work
,
248 msecs_to_jiffies(msecs
));
250 EXPORT_SYMBOL(blk_delay_queue
);
253 * blk_start_queue_async - asynchronously restart a previously stopped queue
254 * @q: The &struct request_queue in question
257 * blk_start_queue_async() will clear the stop flag on the queue, and
258 * ensure that the request_fn for the queue is run from an async
261 void blk_start_queue_async(struct request_queue
*q
)
263 lockdep_assert_held(q
->queue_lock
);
264 WARN_ON_ONCE(q
->mq_ops
);
266 queue_flag_clear(QUEUE_FLAG_STOPPED
, q
);
267 blk_run_queue_async(q
);
269 EXPORT_SYMBOL(blk_start_queue_async
);
272 * blk_start_queue - restart a previously stopped queue
273 * @q: The &struct request_queue in question
276 * blk_start_queue() will clear the stop flag on the queue, and call
277 * the request_fn for the queue if it was in a stopped state when
278 * entered. Also see blk_stop_queue().
280 void blk_start_queue(struct request_queue
*q
)
282 lockdep_assert_held(q
->queue_lock
);
283 WARN_ON(!in_interrupt() && !irqs_disabled());
284 WARN_ON_ONCE(q
->mq_ops
);
286 queue_flag_clear(QUEUE_FLAG_STOPPED
, q
);
289 EXPORT_SYMBOL(blk_start_queue
);
292 * blk_stop_queue - stop a queue
293 * @q: The &struct request_queue in question
296 * The Linux block layer assumes that a block driver will consume all
297 * entries on the request queue when the request_fn strategy is called.
298 * Often this will not happen, because of hardware limitations (queue
299 * depth settings). If a device driver gets a 'queue full' response,
300 * or if it simply chooses not to queue more I/O at one point, it can
301 * call this function to prevent the request_fn from being called until
302 * the driver has signalled it's ready to go again. This happens by calling
303 * blk_start_queue() to restart queue operations.
305 void blk_stop_queue(struct request_queue
*q
)
307 lockdep_assert_held(q
->queue_lock
);
308 WARN_ON_ONCE(q
->mq_ops
);
310 cancel_delayed_work(&q
->delay_work
);
311 queue_flag_set(QUEUE_FLAG_STOPPED
, q
);
313 EXPORT_SYMBOL(blk_stop_queue
);
316 * blk_sync_queue - cancel any pending callbacks on a queue
320 * The block layer may perform asynchronous callback activity
321 * on a queue, such as calling the unplug function after a timeout.
322 * A block device may call blk_sync_queue to ensure that any
323 * such activity is cancelled, thus allowing it to release resources
324 * that the callbacks might use. The caller must already have made sure
325 * that its ->make_request_fn will not re-add plugging prior to calling
328 * This function does not cancel any asynchronous activity arising
329 * out of elevator or throttling code. That would require elevator_exit()
330 * and blkcg_exit_queue() to be called with queue lock initialized.
333 void blk_sync_queue(struct request_queue
*q
)
335 del_timer_sync(&q
->timeout
);
336 cancel_work_sync(&q
->timeout_work
);
339 struct blk_mq_hw_ctx
*hctx
;
342 queue_for_each_hw_ctx(q
, hctx
, i
)
343 cancel_delayed_work_sync(&hctx
->run_work
);
345 cancel_delayed_work_sync(&q
->delay_work
);
348 EXPORT_SYMBOL(blk_sync_queue
);
351 * blk_set_preempt_only - set QUEUE_FLAG_PREEMPT_ONLY
352 * @q: request queue pointer
354 * Returns the previous value of the PREEMPT_ONLY flag - 0 if the flag was not
355 * set and 1 if the flag was already set.
357 int blk_set_preempt_only(struct request_queue
*q
)
362 spin_lock_irqsave(q
->queue_lock
, flags
);
363 res
= queue_flag_test_and_set(QUEUE_FLAG_PREEMPT_ONLY
, q
);
364 spin_unlock_irqrestore(q
->queue_lock
, flags
);
368 EXPORT_SYMBOL_GPL(blk_set_preempt_only
);
370 void blk_clear_preempt_only(struct request_queue
*q
)
374 spin_lock_irqsave(q
->queue_lock
, flags
);
375 queue_flag_clear(QUEUE_FLAG_PREEMPT_ONLY
, q
);
376 wake_up_all(&q
->mq_freeze_wq
);
377 spin_unlock_irqrestore(q
->queue_lock
, flags
);
379 EXPORT_SYMBOL_GPL(blk_clear_preempt_only
);
382 * __blk_run_queue_uncond - run a queue whether or not it has been stopped
383 * @q: The queue to run
386 * Invoke request handling on a queue if there are any pending requests.
387 * May be used to restart request handling after a request has completed.
388 * This variant runs the queue whether or not the queue has been
389 * stopped. Must be called with the queue lock held and interrupts
390 * disabled. See also @blk_run_queue.
392 inline void __blk_run_queue_uncond(struct request_queue
*q
)
394 lockdep_assert_held(q
->queue_lock
);
395 WARN_ON_ONCE(q
->mq_ops
);
397 if (unlikely(blk_queue_dead(q
)))
401 * Some request_fn implementations, e.g. scsi_request_fn(), unlock
402 * the queue lock internally. As a result multiple threads may be
403 * running such a request function concurrently. Keep track of the
404 * number of active request_fn invocations such that blk_drain_queue()
405 * can wait until all these request_fn calls have finished.
407 q
->request_fn_active
++;
409 q
->request_fn_active
--;
411 EXPORT_SYMBOL_GPL(__blk_run_queue_uncond
);
414 * __blk_run_queue - run a single device queue
415 * @q: The queue to run
418 * See @blk_run_queue.
420 void __blk_run_queue(struct request_queue
*q
)
422 lockdep_assert_held(q
->queue_lock
);
423 WARN_ON_ONCE(q
->mq_ops
);
425 if (unlikely(blk_queue_stopped(q
)))
428 __blk_run_queue_uncond(q
);
430 EXPORT_SYMBOL(__blk_run_queue
);
433 * blk_run_queue_async - run a single device queue in workqueue context
434 * @q: The queue to run
437 * Tells kblockd to perform the equivalent of @blk_run_queue on behalf
441 * Since it is not allowed to run q->delay_work after blk_cleanup_queue()
442 * has canceled q->delay_work, callers must hold the queue lock to avoid
443 * race conditions between blk_cleanup_queue() and blk_run_queue_async().
445 void blk_run_queue_async(struct request_queue
*q
)
447 lockdep_assert_held(q
->queue_lock
);
448 WARN_ON_ONCE(q
->mq_ops
);
450 if (likely(!blk_queue_stopped(q
) && !blk_queue_dead(q
)))
451 mod_delayed_work(kblockd_workqueue
, &q
->delay_work
, 0);
453 EXPORT_SYMBOL(blk_run_queue_async
);
456 * blk_run_queue - run a single device queue
457 * @q: The queue to run
460 * Invoke request handling on this queue, if it has pending work to do.
461 * May be used to restart queueing when a request has completed.
463 void blk_run_queue(struct request_queue
*q
)
467 WARN_ON_ONCE(q
->mq_ops
);
469 spin_lock_irqsave(q
->queue_lock
, flags
);
471 spin_unlock_irqrestore(q
->queue_lock
, flags
);
473 EXPORT_SYMBOL(blk_run_queue
);
475 void blk_put_queue(struct request_queue
*q
)
477 kobject_put(&q
->kobj
);
479 EXPORT_SYMBOL(blk_put_queue
);
482 * __blk_drain_queue - drain requests from request_queue
484 * @drain_all: whether to drain all requests or only the ones w/ ELVPRIV
486 * Drain requests from @q. If @drain_all is set, all requests are drained.
487 * If not, only ELVPRIV requests are drained. The caller is responsible
488 * for ensuring that no new requests which need to be drained are queued.
490 static void __blk_drain_queue(struct request_queue
*q
, bool drain_all
)
491 __releases(q
->queue_lock
)
492 __acquires(q
->queue_lock
)
496 lockdep_assert_held(q
->queue_lock
);
497 WARN_ON_ONCE(q
->mq_ops
);
503 * The caller might be trying to drain @q before its
504 * elevator is initialized.
507 elv_drain_elevator(q
);
509 blkcg_drain_queue(q
);
512 * This function might be called on a queue which failed
513 * driver init after queue creation or is not yet fully
514 * active yet. Some drivers (e.g. fd and loop) get unhappy
515 * in such cases. Kick queue iff dispatch queue has
516 * something on it and @q has request_fn set.
518 if (!list_empty(&q
->queue_head
) && q
->request_fn
)
521 drain
|= q
->nr_rqs_elvpriv
;
522 drain
|= q
->request_fn_active
;
525 * Unfortunately, requests are queued at and tracked from
526 * multiple places and there's no single counter which can
527 * be drained. Check all the queues and counters.
530 struct blk_flush_queue
*fq
= blk_get_flush_queue(q
, NULL
);
531 drain
|= !list_empty(&q
->queue_head
);
532 for (i
= 0; i
< 2; i
++) {
533 drain
|= q
->nr_rqs
[i
];
534 drain
|= q
->in_flight
[i
];
536 drain
|= !list_empty(&fq
->flush_queue
[i
]);
543 spin_unlock_irq(q
->queue_lock
);
547 spin_lock_irq(q
->queue_lock
);
551 * With queue marked dead, any woken up waiter will fail the
552 * allocation path, so the wakeup chaining is lost and we're
553 * left with hung waiters. We need to wake up those waiters.
556 struct request_list
*rl
;
558 blk_queue_for_each_rl(rl
, q
)
559 for (i
= 0; i
< ARRAY_SIZE(rl
->wait
); i
++)
560 wake_up_all(&rl
->wait
[i
]);
564 void blk_drain_queue(struct request_queue
*q
)
566 spin_lock_irq(q
->queue_lock
);
567 __blk_drain_queue(q
, true);
568 spin_unlock_irq(q
->queue_lock
);
572 * blk_queue_bypass_start - enter queue bypass mode
573 * @q: queue of interest
575 * In bypass mode, only the dispatch FIFO queue of @q is used. This
576 * function makes @q enter bypass mode and drains all requests which were
577 * throttled or issued before. On return, it's guaranteed that no request
578 * is being throttled or has ELVPRIV set and blk_queue_bypass() %true
579 * inside queue or RCU read lock.
581 void blk_queue_bypass_start(struct request_queue
*q
)
583 WARN_ON_ONCE(q
->mq_ops
);
585 spin_lock_irq(q
->queue_lock
);
587 queue_flag_set(QUEUE_FLAG_BYPASS
, q
);
588 spin_unlock_irq(q
->queue_lock
);
591 * Queues start drained. Skip actual draining till init is
592 * complete. This avoids lenghty delays during queue init which
593 * can happen many times during boot.
595 if (blk_queue_init_done(q
)) {
596 spin_lock_irq(q
->queue_lock
);
597 __blk_drain_queue(q
, false);
598 spin_unlock_irq(q
->queue_lock
);
600 /* ensure blk_queue_bypass() is %true inside RCU read lock */
604 EXPORT_SYMBOL_GPL(blk_queue_bypass_start
);
607 * blk_queue_bypass_end - leave queue bypass mode
608 * @q: queue of interest
610 * Leave bypass mode and restore the normal queueing behavior.
612 * Note: although blk_queue_bypass_start() is only called for blk-sq queues,
613 * this function is called for both blk-sq and blk-mq queues.
615 void blk_queue_bypass_end(struct request_queue
*q
)
617 spin_lock_irq(q
->queue_lock
);
618 if (!--q
->bypass_depth
)
619 queue_flag_clear(QUEUE_FLAG_BYPASS
, q
);
620 WARN_ON_ONCE(q
->bypass_depth
< 0);
621 spin_unlock_irq(q
->queue_lock
);
623 EXPORT_SYMBOL_GPL(blk_queue_bypass_end
);
625 void blk_set_queue_dying(struct request_queue
*q
)
627 spin_lock_irq(q
->queue_lock
);
628 queue_flag_set(QUEUE_FLAG_DYING
, q
);
629 spin_unlock_irq(q
->queue_lock
);
632 * When queue DYING flag is set, we need to block new req
633 * entering queue, so we call blk_freeze_queue_start() to
634 * prevent I/O from crossing blk_queue_enter().
636 blk_freeze_queue_start(q
);
639 blk_mq_wake_waiters(q
);
641 struct request_list
*rl
;
643 spin_lock_irq(q
->queue_lock
);
644 blk_queue_for_each_rl(rl
, q
) {
646 wake_up_all(&rl
->wait
[BLK_RW_SYNC
]);
647 wake_up_all(&rl
->wait
[BLK_RW_ASYNC
]);
650 spin_unlock_irq(q
->queue_lock
);
653 /* Make blk_queue_enter() reexamine the DYING flag. */
654 wake_up_all(&q
->mq_freeze_wq
);
656 EXPORT_SYMBOL_GPL(blk_set_queue_dying
);
659 * blk_cleanup_queue - shutdown a request queue
660 * @q: request queue to shutdown
662 * Mark @q DYING, drain all pending requests, mark @q DEAD, destroy and
663 * put it. All future requests will be failed immediately with -ENODEV.
665 void blk_cleanup_queue(struct request_queue
*q
)
667 spinlock_t
*lock
= q
->queue_lock
;
669 /* mark @q DYING, no new request or merges will be allowed afterwards */
670 mutex_lock(&q
->sysfs_lock
);
671 blk_set_queue_dying(q
);
675 * A dying queue is permanently in bypass mode till released. Note
676 * that, unlike blk_queue_bypass_start(), we aren't performing
677 * synchronize_rcu() after entering bypass mode to avoid the delay
678 * as some drivers create and destroy a lot of queues while
679 * probing. This is still safe because blk_release_queue() will be
680 * called only after the queue refcnt drops to zero and nothing,
681 * RCU or not, would be traversing the queue by then.
684 queue_flag_set(QUEUE_FLAG_BYPASS
, q
);
686 queue_flag_set(QUEUE_FLAG_NOMERGES
, q
);
687 queue_flag_set(QUEUE_FLAG_NOXMERGES
, q
);
688 queue_flag_set(QUEUE_FLAG_DYING
, q
);
689 spin_unlock_irq(lock
);
690 mutex_unlock(&q
->sysfs_lock
);
693 * Drain all requests queued before DYING marking. Set DEAD flag to
694 * prevent that q->request_fn() gets invoked after draining finished.
698 queue_flag_set(QUEUE_FLAG_DEAD
, q
);
699 spin_unlock_irq(lock
);
702 * make sure all in-progress dispatch are completed because
703 * blk_freeze_queue() can only complete all requests, and
704 * dispatch may still be in-progress since we dispatch requests
705 * from more than one contexts.
707 * We rely on driver to deal with the race in case that queue
708 * initialization isn't done.
710 if (q
->mq_ops
&& blk_queue_init_done(q
))
711 blk_mq_quiesce_queue(q
);
713 /* for synchronous bio-based driver finish in-flight integrity i/o */
714 blk_flush_integrity();
716 /* @q won't process any more request, flush async actions */
717 del_timer_sync(&q
->backing_dev_info
->laptop_mode_wb_timer
);
721 blk_mq_free_queue(q
);
722 percpu_ref_exit(&q
->q_usage_counter
);
725 if (q
->queue_lock
!= &q
->__queue_lock
)
726 q
->queue_lock
= &q
->__queue_lock
;
727 spin_unlock_irq(lock
);
729 /* @q is and will stay empty, shutdown and put */
732 EXPORT_SYMBOL(blk_cleanup_queue
);
734 /* Allocate memory local to the request queue */
735 static void *alloc_request_simple(gfp_t gfp_mask
, void *data
)
737 struct request_queue
*q
= data
;
739 return kmem_cache_alloc_node(request_cachep
, gfp_mask
, q
->node
);
742 static void free_request_simple(void *element
, void *data
)
744 kmem_cache_free(request_cachep
, element
);
747 static void *alloc_request_size(gfp_t gfp_mask
, void *data
)
749 struct request_queue
*q
= data
;
752 rq
= kmalloc_node(sizeof(struct request
) + q
->cmd_size
, gfp_mask
,
754 if (rq
&& q
->init_rq_fn
&& q
->init_rq_fn(q
, rq
, gfp_mask
) < 0) {
761 static void free_request_size(void *element
, void *data
)
763 struct request_queue
*q
= data
;
766 q
->exit_rq_fn(q
, element
);
770 int blk_init_rl(struct request_list
*rl
, struct request_queue
*q
,
773 if (unlikely(rl
->rq_pool
) || q
->mq_ops
)
777 rl
->count
[BLK_RW_SYNC
] = rl
->count
[BLK_RW_ASYNC
] = 0;
778 rl
->starved
[BLK_RW_SYNC
] = rl
->starved
[BLK_RW_ASYNC
] = 0;
779 init_waitqueue_head(&rl
->wait
[BLK_RW_SYNC
]);
780 init_waitqueue_head(&rl
->wait
[BLK_RW_ASYNC
]);
783 rl
->rq_pool
= mempool_create_node(BLKDEV_MIN_RQ
,
784 alloc_request_size
, free_request_size
,
785 q
, gfp_mask
, q
->node
);
787 rl
->rq_pool
= mempool_create_node(BLKDEV_MIN_RQ
,
788 alloc_request_simple
, free_request_simple
,
789 q
, gfp_mask
, q
->node
);
794 if (rl
!= &q
->root_rl
)
795 WARN_ON_ONCE(!blk_get_queue(q
));
800 void blk_exit_rl(struct request_queue
*q
, struct request_list
*rl
)
803 mempool_destroy(rl
->rq_pool
);
804 if (rl
!= &q
->root_rl
)
809 struct request_queue
*blk_alloc_queue(gfp_t gfp_mask
)
811 return blk_alloc_queue_node(gfp_mask
, NUMA_NO_NODE
);
813 EXPORT_SYMBOL(blk_alloc_queue
);
816 * blk_queue_enter() - try to increase q->q_usage_counter
817 * @q: request queue pointer
818 * @flags: BLK_MQ_REQ_NOWAIT and/or BLK_MQ_REQ_PREEMPT
820 int blk_queue_enter(struct request_queue
*q
, blk_mq_req_flags_t flags
)
822 const bool preempt
= flags
& BLK_MQ_REQ_PREEMPT
;
825 bool success
= false;
828 if (percpu_ref_tryget_live(&q
->q_usage_counter
)) {
830 * The code that sets the PREEMPT_ONLY flag is
831 * responsible for ensuring that that flag is globally
832 * visible before the queue is unfrozen.
834 if (preempt
|| !blk_queue_preempt_only(q
)) {
837 percpu_ref_put(&q
->q_usage_counter
);
845 if (flags
& BLK_MQ_REQ_NOWAIT
)
849 * read pair of barrier in blk_freeze_queue_start(),
850 * we need to order reading __PERCPU_REF_DEAD flag of
851 * .q_usage_counter and reading .mq_freeze_depth or
852 * queue dying flag, otherwise the following wait may
853 * never return if the two reads are reordered.
857 wait_event(q
->mq_freeze_wq
,
858 (atomic_read(&q
->mq_freeze_depth
) == 0 &&
859 (preempt
|| !blk_queue_preempt_only(q
))) ||
861 if (blk_queue_dying(q
))
866 void blk_queue_exit(struct request_queue
*q
)
868 percpu_ref_put(&q
->q_usage_counter
);
871 static void blk_queue_usage_counter_release(struct percpu_ref
*ref
)
873 struct request_queue
*q
=
874 container_of(ref
, struct request_queue
, q_usage_counter
);
876 wake_up_all(&q
->mq_freeze_wq
);
879 static void blk_rq_timed_out_timer(struct timer_list
*t
)
881 struct request_queue
*q
= from_timer(q
, t
, timeout
);
883 kblockd_schedule_work(&q
->timeout_work
);
886 static void blk_timeout_work_dummy(struct work_struct
*work
)
890 struct request_queue
*blk_alloc_queue_node(gfp_t gfp_mask
, int node_id
)
892 struct request_queue
*q
;
894 q
= kmem_cache_alloc_node(blk_requestq_cachep
,
895 gfp_mask
| __GFP_ZERO
, node_id
);
899 q
->id
= ida_simple_get(&blk_queue_ida
, 0, 0, gfp_mask
);
903 q
->bio_split
= bioset_create(BIO_POOL_SIZE
, 0, BIOSET_NEED_BVECS
);
907 q
->backing_dev_info
= bdi_alloc_node(gfp_mask
, node_id
);
908 if (!q
->backing_dev_info
)
911 q
->stats
= blk_alloc_queue_stats();
915 q
->backing_dev_info
->ra_pages
=
916 (VM_MAX_READAHEAD
* 1024) / PAGE_SIZE
;
917 q
->backing_dev_info
->capabilities
= BDI_CAP_CGROUP_WRITEBACK
;
918 q
->backing_dev_info
->name
= "block";
921 timer_setup(&q
->backing_dev_info
->laptop_mode_wb_timer
,
922 laptop_mode_timer_fn
, 0);
923 timer_setup(&q
->timeout
, blk_rq_timed_out_timer
, 0);
924 INIT_WORK(&q
->timeout_work
, blk_timeout_work_dummy
);
925 INIT_LIST_HEAD(&q
->queue_head
);
926 INIT_LIST_HEAD(&q
->timeout_list
);
927 INIT_LIST_HEAD(&q
->icq_list
);
928 #ifdef CONFIG_BLK_CGROUP
929 INIT_LIST_HEAD(&q
->blkg_list
);
931 INIT_DELAYED_WORK(&q
->delay_work
, blk_delay_work
);
933 kobject_init(&q
->kobj
, &blk_queue_ktype
);
935 #ifdef CONFIG_BLK_DEV_IO_TRACE
936 mutex_init(&q
->blk_trace_mutex
);
938 mutex_init(&q
->sysfs_lock
);
939 spin_lock_init(&q
->__queue_lock
);
942 * By default initialize queue_lock to internal lock and driver can
943 * override it later if need be.
945 q
->queue_lock
= &q
->__queue_lock
;
948 * A queue starts its life with bypass turned on to avoid
949 * unnecessary bypass on/off overhead and nasty surprises during
950 * init. The initial bypass will be finished when the queue is
951 * registered by blk_register_queue().
954 __set_bit(QUEUE_FLAG_BYPASS
, &q
->queue_flags
);
956 init_waitqueue_head(&q
->mq_freeze_wq
);
959 * Init percpu_ref in atomic mode so that it's faster to shutdown.
960 * See blk_register_queue() for details.
962 if (percpu_ref_init(&q
->q_usage_counter
,
963 blk_queue_usage_counter_release
,
964 PERCPU_REF_INIT_ATOMIC
, GFP_KERNEL
))
967 if (blkcg_init_queue(q
))
973 percpu_ref_exit(&q
->q_usage_counter
);
975 blk_free_queue_stats(q
->stats
);
977 bdi_put(q
->backing_dev_info
);
979 bioset_free(q
->bio_split
);
981 ida_simple_remove(&blk_queue_ida
, q
->id
);
983 kmem_cache_free(blk_requestq_cachep
, q
);
986 EXPORT_SYMBOL(blk_alloc_queue_node
);
989 * blk_init_queue - prepare a request queue for use with a block device
990 * @rfn: The function to be called to process requests that have been
991 * placed on the queue.
992 * @lock: Request queue spin lock
995 * If a block device wishes to use the standard request handling procedures,
996 * which sorts requests and coalesces adjacent requests, then it must
997 * call blk_init_queue(). The function @rfn will be called when there
998 * are requests on the queue that need to be processed. If the device
999 * supports plugging, then @rfn may not be called immediately when requests
1000 * are available on the queue, but may be called at some time later instead.
1001 * Plugged queues are generally unplugged when a buffer belonging to one
1002 * of the requests on the queue is needed, or due to memory pressure.
1004 * @rfn is not required, or even expected, to remove all requests off the
1005 * queue, but only as many as it can handle at a time. If it does leave
1006 * requests on the queue, it is responsible for arranging that the requests
1007 * get dealt with eventually.
1009 * The queue spin lock must be held while manipulating the requests on the
1010 * request queue; this lock will be taken also from interrupt context, so irq
1011 * disabling is needed for it.
1013 * Function returns a pointer to the initialized request queue, or %NULL if
1014 * it didn't succeed.
1017 * blk_init_queue() must be paired with a blk_cleanup_queue() call
1018 * when the block device is deactivated (such as at module unload).
1021 struct request_queue
*blk_init_queue(request_fn_proc
*rfn
, spinlock_t
*lock
)
1023 return blk_init_queue_node(rfn
, lock
, NUMA_NO_NODE
);
1025 EXPORT_SYMBOL(blk_init_queue
);
1027 struct request_queue
*
1028 blk_init_queue_node(request_fn_proc
*rfn
, spinlock_t
*lock
, int node_id
)
1030 struct request_queue
*q
;
1032 q
= blk_alloc_queue_node(GFP_KERNEL
, node_id
);
1036 q
->request_fn
= rfn
;
1038 q
->queue_lock
= lock
;
1039 if (blk_init_allocated_queue(q
) < 0) {
1040 blk_cleanup_queue(q
);
1046 EXPORT_SYMBOL(blk_init_queue_node
);
1048 static blk_qc_t
blk_queue_bio(struct request_queue
*q
, struct bio
*bio
);
1051 int blk_init_allocated_queue(struct request_queue
*q
)
1053 WARN_ON_ONCE(q
->mq_ops
);
1055 q
->fq
= blk_alloc_flush_queue(q
, NUMA_NO_NODE
, q
->cmd_size
);
1059 if (q
->init_rq_fn
&& q
->init_rq_fn(q
, q
->fq
->flush_rq
, GFP_KERNEL
))
1060 goto out_free_flush_queue
;
1062 if (blk_init_rl(&q
->root_rl
, q
, GFP_KERNEL
))
1063 goto out_exit_flush_rq
;
1065 INIT_WORK(&q
->timeout_work
, blk_timeout_work
);
1066 q
->queue_flags
|= QUEUE_FLAG_DEFAULT
;
1069 * This also sets hw/phys segments, boundary and size
1071 blk_queue_make_request(q
, blk_queue_bio
);
1073 q
->sg_reserved_size
= INT_MAX
;
1075 /* Protect q->elevator from elevator_change */
1076 mutex_lock(&q
->sysfs_lock
);
1079 if (elevator_init(q
, NULL
)) {
1080 mutex_unlock(&q
->sysfs_lock
);
1081 goto out_exit_flush_rq
;
1084 mutex_unlock(&q
->sysfs_lock
);
1089 q
->exit_rq_fn(q
, q
->fq
->flush_rq
);
1090 out_free_flush_queue
:
1091 blk_free_flush_queue(q
->fq
);
1095 EXPORT_SYMBOL(blk_init_allocated_queue
);
1097 bool blk_get_queue(struct request_queue
*q
)
1099 if (likely(!blk_queue_dying(q
))) {
1106 EXPORT_SYMBOL(blk_get_queue
);
1108 static inline void blk_free_request(struct request_list
*rl
, struct request
*rq
)
1110 if (rq
->rq_flags
& RQF_ELVPRIV
) {
1111 elv_put_request(rl
->q
, rq
);
1113 put_io_context(rq
->elv
.icq
->ioc
);
1116 mempool_free(rq
, rl
->rq_pool
);
1120 * ioc_batching returns true if the ioc is a valid batching request and
1121 * should be given priority access to a request.
1123 static inline int ioc_batching(struct request_queue
*q
, struct io_context
*ioc
)
1129 * Make sure the process is able to allocate at least 1 request
1130 * even if the batch times out, otherwise we could theoretically
1133 return ioc
->nr_batch_requests
== q
->nr_batching
||
1134 (ioc
->nr_batch_requests
> 0
1135 && time_before(jiffies
, ioc
->last_waited
+ BLK_BATCH_TIME
));
1139 * ioc_set_batching sets ioc to be a new "batcher" if it is not one. This
1140 * will cause the process to be a "batcher" on all queues in the system. This
1141 * is the behaviour we want though - once it gets a wakeup it should be given
1144 static void ioc_set_batching(struct request_queue
*q
, struct io_context
*ioc
)
1146 if (!ioc
|| ioc_batching(q
, ioc
))
1149 ioc
->nr_batch_requests
= q
->nr_batching
;
1150 ioc
->last_waited
= jiffies
;
1153 static void __freed_request(struct request_list
*rl
, int sync
)
1155 struct request_queue
*q
= rl
->q
;
1157 if (rl
->count
[sync
] < queue_congestion_off_threshold(q
))
1158 blk_clear_congested(rl
, sync
);
1160 if (rl
->count
[sync
] + 1 <= q
->nr_requests
) {
1161 if (waitqueue_active(&rl
->wait
[sync
]))
1162 wake_up(&rl
->wait
[sync
]);
1164 blk_clear_rl_full(rl
, sync
);
1169 * A request has just been released. Account for it, update the full and
1170 * congestion status, wake up any waiters. Called under q->queue_lock.
1172 static void freed_request(struct request_list
*rl
, bool sync
,
1173 req_flags_t rq_flags
)
1175 struct request_queue
*q
= rl
->q
;
1179 if (rq_flags
& RQF_ELVPRIV
)
1180 q
->nr_rqs_elvpriv
--;
1182 __freed_request(rl
, sync
);
1184 if (unlikely(rl
->starved
[sync
^ 1]))
1185 __freed_request(rl
, sync
^ 1);
1188 int blk_update_nr_requests(struct request_queue
*q
, unsigned int nr
)
1190 struct request_list
*rl
;
1191 int on_thresh
, off_thresh
;
1193 WARN_ON_ONCE(q
->mq_ops
);
1195 spin_lock_irq(q
->queue_lock
);
1196 q
->nr_requests
= nr
;
1197 blk_queue_congestion_threshold(q
);
1198 on_thresh
= queue_congestion_on_threshold(q
);
1199 off_thresh
= queue_congestion_off_threshold(q
);
1201 blk_queue_for_each_rl(rl
, q
) {
1202 if (rl
->count
[BLK_RW_SYNC
] >= on_thresh
)
1203 blk_set_congested(rl
, BLK_RW_SYNC
);
1204 else if (rl
->count
[BLK_RW_SYNC
] < off_thresh
)
1205 blk_clear_congested(rl
, BLK_RW_SYNC
);
1207 if (rl
->count
[BLK_RW_ASYNC
] >= on_thresh
)
1208 blk_set_congested(rl
, BLK_RW_ASYNC
);
1209 else if (rl
->count
[BLK_RW_ASYNC
] < off_thresh
)
1210 blk_clear_congested(rl
, BLK_RW_ASYNC
);
1212 if (rl
->count
[BLK_RW_SYNC
] >= q
->nr_requests
) {
1213 blk_set_rl_full(rl
, BLK_RW_SYNC
);
1215 blk_clear_rl_full(rl
, BLK_RW_SYNC
);
1216 wake_up(&rl
->wait
[BLK_RW_SYNC
]);
1219 if (rl
->count
[BLK_RW_ASYNC
] >= q
->nr_requests
) {
1220 blk_set_rl_full(rl
, BLK_RW_ASYNC
);
1222 blk_clear_rl_full(rl
, BLK_RW_ASYNC
);
1223 wake_up(&rl
->wait
[BLK_RW_ASYNC
]);
1227 spin_unlock_irq(q
->queue_lock
);
1232 * __get_request - get a free request
1233 * @rl: request list to allocate from
1234 * @op: operation and flags
1235 * @bio: bio to allocate request for (can be %NULL)
1236 * @flags: BLQ_MQ_REQ_* flags
1238 * Get a free request from @q. This function may fail under memory
1239 * pressure or if @q is dead.
1241 * Must be called with @q->queue_lock held and,
1242 * Returns ERR_PTR on failure, with @q->queue_lock held.
1243 * Returns request pointer on success, with @q->queue_lock *not held*.
1245 static struct request
*__get_request(struct request_list
*rl
, unsigned int op
,
1246 struct bio
*bio
, blk_mq_req_flags_t flags
)
1248 struct request_queue
*q
= rl
->q
;
1250 struct elevator_type
*et
= q
->elevator
->type
;
1251 struct io_context
*ioc
= rq_ioc(bio
);
1252 struct io_cq
*icq
= NULL
;
1253 const bool is_sync
= op_is_sync(op
);
1255 gfp_t gfp_mask
= flags
& BLK_MQ_REQ_NOWAIT
? GFP_ATOMIC
:
1256 __GFP_DIRECT_RECLAIM
;
1257 req_flags_t rq_flags
= RQF_ALLOCED
;
1259 lockdep_assert_held(q
->queue_lock
);
1261 if (unlikely(blk_queue_dying(q
)))
1262 return ERR_PTR(-ENODEV
);
1264 may_queue
= elv_may_queue(q
, op
);
1265 if (may_queue
== ELV_MQUEUE_NO
)
1268 if (rl
->count
[is_sync
]+1 >= queue_congestion_on_threshold(q
)) {
1269 if (rl
->count
[is_sync
]+1 >= q
->nr_requests
) {
1271 * The queue will fill after this allocation, so set
1272 * it as full, and mark this process as "batching".
1273 * This process will be allowed to complete a batch of
1274 * requests, others will be blocked.
1276 if (!blk_rl_full(rl
, is_sync
)) {
1277 ioc_set_batching(q
, ioc
);
1278 blk_set_rl_full(rl
, is_sync
);
1280 if (may_queue
!= ELV_MQUEUE_MUST
1281 && !ioc_batching(q
, ioc
)) {
1283 * The queue is full and the allocating
1284 * process is not a "batcher", and not
1285 * exempted by the IO scheduler
1287 return ERR_PTR(-ENOMEM
);
1291 blk_set_congested(rl
, is_sync
);
1295 * Only allow batching queuers to allocate up to 50% over the defined
1296 * limit of requests, otherwise we could have thousands of requests
1297 * allocated with any setting of ->nr_requests
1299 if (rl
->count
[is_sync
] >= (3 * q
->nr_requests
/ 2))
1300 return ERR_PTR(-ENOMEM
);
1302 q
->nr_rqs
[is_sync
]++;
1303 rl
->count
[is_sync
]++;
1304 rl
->starved
[is_sync
] = 0;
1307 * Decide whether the new request will be managed by elevator. If
1308 * so, mark @rq_flags and increment elvpriv. Non-zero elvpriv will
1309 * prevent the current elevator from being destroyed until the new
1310 * request is freed. This guarantees icq's won't be destroyed and
1311 * makes creating new ones safe.
1313 * Flush requests do not use the elevator so skip initialization.
1314 * This allows a request to share the flush and elevator data.
1316 * Also, lookup icq while holding queue_lock. If it doesn't exist,
1317 * it will be created after releasing queue_lock.
1319 if (!op_is_flush(op
) && !blk_queue_bypass(q
)) {
1320 rq_flags
|= RQF_ELVPRIV
;
1321 q
->nr_rqs_elvpriv
++;
1322 if (et
->icq_cache
&& ioc
)
1323 icq
= ioc_lookup_icq(ioc
, q
);
1326 if (blk_queue_io_stat(q
))
1327 rq_flags
|= RQF_IO_STAT
;
1328 spin_unlock_irq(q
->queue_lock
);
1330 /* allocate and init request */
1331 rq
= mempool_alloc(rl
->rq_pool
, gfp_mask
);
1336 blk_rq_set_rl(rq
, rl
);
1338 rq
->rq_flags
= rq_flags
;
1339 if (flags
& BLK_MQ_REQ_PREEMPT
)
1340 rq
->rq_flags
|= RQF_PREEMPT
;
1343 if (rq_flags
& RQF_ELVPRIV
) {
1344 if (unlikely(et
->icq_cache
&& !icq
)) {
1346 icq
= ioc_create_icq(ioc
, q
, gfp_mask
);
1352 if (unlikely(elv_set_request(q
, rq
, bio
, gfp_mask
)))
1355 /* @rq->elv.icq holds io_context until @rq is freed */
1357 get_io_context(icq
->ioc
);
1361 * ioc may be NULL here, and ioc_batching will be false. That's
1362 * OK, if the queue is under the request limit then requests need
1363 * not count toward the nr_batch_requests limit. There will always
1364 * be some limit enforced by BLK_BATCH_TIME.
1366 if (ioc_batching(q
, ioc
))
1367 ioc
->nr_batch_requests
--;
1369 trace_block_getrq(q
, bio
, op
);
1374 * elvpriv init failed. ioc, icq and elvpriv aren't mempool backed
1375 * and may fail indefinitely under memory pressure and thus
1376 * shouldn't stall IO. Treat this request as !elvpriv. This will
1377 * disturb iosched and blkcg but weird is bettern than dead.
1379 printk_ratelimited(KERN_WARNING
"%s: dev %s: request aux data allocation failed, iosched may be disturbed\n",
1380 __func__
, dev_name(q
->backing_dev_info
->dev
));
1382 rq
->rq_flags
&= ~RQF_ELVPRIV
;
1385 spin_lock_irq(q
->queue_lock
);
1386 q
->nr_rqs_elvpriv
--;
1387 spin_unlock_irq(q
->queue_lock
);
1392 * Allocation failed presumably due to memory. Undo anything we
1393 * might have messed up.
1395 * Allocating task should really be put onto the front of the wait
1396 * queue, but this is pretty rare.
1398 spin_lock_irq(q
->queue_lock
);
1399 freed_request(rl
, is_sync
, rq_flags
);
1402 * in the very unlikely event that allocation failed and no
1403 * requests for this direction was pending, mark us starved so that
1404 * freeing of a request in the other direction will notice
1405 * us. another possible fix would be to split the rq mempool into
1409 if (unlikely(rl
->count
[is_sync
] == 0))
1410 rl
->starved
[is_sync
] = 1;
1411 return ERR_PTR(-ENOMEM
);
1415 * get_request - get a free request
1416 * @q: request_queue to allocate request from
1417 * @op: operation and flags
1418 * @bio: bio to allocate request for (can be %NULL)
1419 * @flags: BLK_MQ_REQ_* flags.
1421 * Get a free request from @q. If %__GFP_DIRECT_RECLAIM is set in @gfp_mask,
1422 * this function keeps retrying under memory pressure and fails iff @q is dead.
1424 * Must be called with @q->queue_lock held and,
1425 * Returns ERR_PTR on failure, with @q->queue_lock held.
1426 * Returns request pointer on success, with @q->queue_lock *not held*.
1428 static struct request
*get_request(struct request_queue
*q
, unsigned int op
,
1429 struct bio
*bio
, blk_mq_req_flags_t flags
)
1431 const bool is_sync
= op_is_sync(op
);
1433 struct request_list
*rl
;
1436 lockdep_assert_held(q
->queue_lock
);
1437 WARN_ON_ONCE(q
->mq_ops
);
1439 rl
= blk_get_rl(q
, bio
); /* transferred to @rq on success */
1441 rq
= __get_request(rl
, op
, bio
, flags
);
1445 if (op
& REQ_NOWAIT
) {
1447 return ERR_PTR(-EAGAIN
);
1450 if ((flags
& BLK_MQ_REQ_NOWAIT
) || unlikely(blk_queue_dying(q
))) {
1455 /* wait on @rl and retry */
1456 prepare_to_wait_exclusive(&rl
->wait
[is_sync
], &wait
,
1457 TASK_UNINTERRUPTIBLE
);
1459 trace_block_sleeprq(q
, bio
, op
);
1461 spin_unlock_irq(q
->queue_lock
);
1465 * After sleeping, we become a "batching" process and will be able
1466 * to allocate at least one request, and up to a big batch of them
1467 * for a small period time. See ioc_batching, ioc_set_batching
1469 ioc_set_batching(q
, current
->io_context
);
1471 spin_lock_irq(q
->queue_lock
);
1472 finish_wait(&rl
->wait
[is_sync
], &wait
);
1477 /* flags: BLK_MQ_REQ_PREEMPT and/or BLK_MQ_REQ_NOWAIT. */
1478 static struct request
*blk_old_get_request(struct request_queue
*q
,
1479 unsigned int op
, blk_mq_req_flags_t flags
)
1482 gfp_t gfp_mask
= flags
& BLK_MQ_REQ_NOWAIT
? GFP_ATOMIC
:
1483 __GFP_DIRECT_RECLAIM
;
1486 WARN_ON_ONCE(q
->mq_ops
);
1488 /* create ioc upfront */
1489 create_io_context(gfp_mask
, q
->node
);
1491 ret
= blk_queue_enter(q
, flags
);
1493 return ERR_PTR(ret
);
1494 spin_lock_irq(q
->queue_lock
);
1495 rq
= get_request(q
, op
, NULL
, flags
);
1497 spin_unlock_irq(q
->queue_lock
);
1502 /* q->queue_lock is unlocked at this point */
1504 rq
->__sector
= (sector_t
) -1;
1505 rq
->bio
= rq
->biotail
= NULL
;
1510 * blk_get_request_flags - allocate a request
1511 * @q: request queue to allocate a request for
1512 * @op: operation (REQ_OP_*) and REQ_* flags, e.g. REQ_SYNC.
1513 * @flags: BLK_MQ_REQ_* flags, e.g. BLK_MQ_REQ_NOWAIT.
1515 struct request
*blk_get_request_flags(struct request_queue
*q
, unsigned int op
,
1516 blk_mq_req_flags_t flags
)
1518 struct request
*req
;
1520 WARN_ON_ONCE(op
& REQ_NOWAIT
);
1521 WARN_ON_ONCE(flags
& ~(BLK_MQ_REQ_NOWAIT
| BLK_MQ_REQ_PREEMPT
));
1524 req
= blk_mq_alloc_request(q
, op
, flags
);
1525 if (!IS_ERR(req
) && q
->mq_ops
->initialize_rq_fn
)
1526 q
->mq_ops
->initialize_rq_fn(req
);
1528 req
= blk_old_get_request(q
, op
, flags
);
1529 if (!IS_ERR(req
) && q
->initialize_rq_fn
)
1530 q
->initialize_rq_fn(req
);
1535 EXPORT_SYMBOL(blk_get_request_flags
);
1537 struct request
*blk_get_request(struct request_queue
*q
, unsigned int op
,
1540 return blk_get_request_flags(q
, op
, gfp_mask
& __GFP_DIRECT_RECLAIM
?
1541 0 : BLK_MQ_REQ_NOWAIT
);
1543 EXPORT_SYMBOL(blk_get_request
);
1546 * blk_requeue_request - put a request back on queue
1547 * @q: request queue where request should be inserted
1548 * @rq: request to be inserted
1551 * Drivers often keep queueing requests until the hardware cannot accept
1552 * more, when that condition happens we need to put the request back
1553 * on the queue. Must be called with queue lock held.
1555 void blk_requeue_request(struct request_queue
*q
, struct request
*rq
)
1557 lockdep_assert_held(q
->queue_lock
);
1558 WARN_ON_ONCE(q
->mq_ops
);
1560 blk_delete_timer(rq
);
1561 blk_clear_rq_complete(rq
);
1562 trace_block_rq_requeue(q
, rq
);
1563 wbt_requeue(q
->rq_wb
, &rq
->issue_stat
);
1565 if (rq
->rq_flags
& RQF_QUEUED
)
1566 blk_queue_end_tag(q
, rq
);
1568 BUG_ON(blk_queued_rq(rq
));
1570 elv_requeue_request(q
, rq
);
1572 EXPORT_SYMBOL(blk_requeue_request
);
1574 static void add_acct_request(struct request_queue
*q
, struct request
*rq
,
1577 blk_account_io_start(rq
, true);
1578 __elv_add_request(q
, rq
, where
);
1581 static void part_round_stats_single(struct request_queue
*q
, int cpu
,
1582 struct hd_struct
*part
, unsigned long now
,
1583 unsigned int inflight
)
1586 __part_stat_add(cpu
, part
, time_in_queue
,
1587 inflight
* (now
- part
->stamp
));
1588 __part_stat_add(cpu
, part
, io_ticks
, (now
- part
->stamp
));
1594 * part_round_stats() - Round off the performance stats on a struct disk_stats.
1595 * @q: target block queue
1596 * @cpu: cpu number for stats access
1597 * @part: target partition
1599 * The average IO queue length and utilisation statistics are maintained
1600 * by observing the current state of the queue length and the amount of
1601 * time it has been in this state for.
1603 * Normally, that accounting is done on IO completion, but that can result
1604 * in more than a second's worth of IO being accounted for within any one
1605 * second, leading to >100% utilisation. To deal with that, we call this
1606 * function to do a round-off before returning the results when reading
1607 * /proc/diskstats. This accounts immediately for all queue usage up to
1608 * the current jiffies and restarts the counters again.
1610 void part_round_stats(struct request_queue
*q
, int cpu
, struct hd_struct
*part
)
1612 struct hd_struct
*part2
= NULL
;
1613 unsigned long now
= jiffies
;
1614 unsigned int inflight
[2];
1617 if (part
->stamp
!= now
)
1621 part2
= &part_to_disk(part
)->part0
;
1622 if (part2
->stamp
!= now
)
1629 part_in_flight(q
, part
, inflight
);
1632 part_round_stats_single(q
, cpu
, part2
, now
, inflight
[1]);
1634 part_round_stats_single(q
, cpu
, part
, now
, inflight
[0]);
1636 EXPORT_SYMBOL_GPL(part_round_stats
);
1639 static void blk_pm_put_request(struct request
*rq
)
1641 if (rq
->q
->dev
&& !(rq
->rq_flags
& RQF_PM
) && !--rq
->q
->nr_pending
)
1642 pm_runtime_mark_last_busy(rq
->q
->dev
);
1645 static inline void blk_pm_put_request(struct request
*rq
) {}
1648 void __blk_put_request(struct request_queue
*q
, struct request
*req
)
1650 req_flags_t rq_flags
= req
->rq_flags
;
1656 blk_mq_free_request(req
);
1660 lockdep_assert_held(q
->queue_lock
);
1662 blk_pm_put_request(req
);
1664 elv_completed_request(q
, req
);
1666 /* this is a bio leak */
1667 WARN_ON(req
->bio
!= NULL
);
1669 wbt_done(q
->rq_wb
, &req
->issue_stat
);
1672 * Request may not have originated from ll_rw_blk. if not,
1673 * it didn't come out of our reserved rq pools
1675 if (rq_flags
& RQF_ALLOCED
) {
1676 struct request_list
*rl
= blk_rq_rl(req
);
1677 bool sync
= op_is_sync(req
->cmd_flags
);
1679 BUG_ON(!list_empty(&req
->queuelist
));
1680 BUG_ON(ELV_ON_HASH(req
));
1682 blk_free_request(rl
, req
);
1683 freed_request(rl
, sync
, rq_flags
);
1688 EXPORT_SYMBOL_GPL(__blk_put_request
);
1690 void blk_put_request(struct request
*req
)
1692 struct request_queue
*q
= req
->q
;
1695 blk_mq_free_request(req
);
1697 unsigned long flags
;
1699 spin_lock_irqsave(q
->queue_lock
, flags
);
1700 __blk_put_request(q
, req
);
1701 spin_unlock_irqrestore(q
->queue_lock
, flags
);
1704 EXPORT_SYMBOL(blk_put_request
);
1706 bool bio_attempt_back_merge(struct request_queue
*q
, struct request
*req
,
1709 const int ff
= bio
->bi_opf
& REQ_FAILFAST_MASK
;
1711 if (!ll_back_merge_fn(q
, req
, bio
))
1714 trace_block_bio_backmerge(q
, req
, bio
);
1716 if ((req
->cmd_flags
& REQ_FAILFAST_MASK
) != ff
)
1717 blk_rq_set_mixed_merge(req
);
1719 req
->biotail
->bi_next
= bio
;
1721 req
->__data_len
+= bio
->bi_iter
.bi_size
;
1722 req
->ioprio
= ioprio_best(req
->ioprio
, bio_prio(bio
));
1724 blk_account_io_start(req
, false);
1728 bool bio_attempt_front_merge(struct request_queue
*q
, struct request
*req
,
1731 const int ff
= bio
->bi_opf
& REQ_FAILFAST_MASK
;
1733 if (!ll_front_merge_fn(q
, req
, bio
))
1736 trace_block_bio_frontmerge(q
, req
, bio
);
1738 if ((req
->cmd_flags
& REQ_FAILFAST_MASK
) != ff
)
1739 blk_rq_set_mixed_merge(req
);
1741 bio
->bi_next
= req
->bio
;
1744 req
->__sector
= bio
->bi_iter
.bi_sector
;
1745 req
->__data_len
+= bio
->bi_iter
.bi_size
;
1746 req
->ioprio
= ioprio_best(req
->ioprio
, bio_prio(bio
));
1748 blk_account_io_start(req
, false);
1752 bool bio_attempt_discard_merge(struct request_queue
*q
, struct request
*req
,
1755 unsigned short segments
= blk_rq_nr_discard_segments(req
);
1757 if (segments
>= queue_max_discard_segments(q
))
1759 if (blk_rq_sectors(req
) + bio_sectors(bio
) >
1760 blk_rq_get_max_sectors(req
, blk_rq_pos(req
)))
1763 req
->biotail
->bi_next
= bio
;
1765 req
->__data_len
+= bio
->bi_iter
.bi_size
;
1766 req
->ioprio
= ioprio_best(req
->ioprio
, bio_prio(bio
));
1767 req
->nr_phys_segments
= segments
+ 1;
1769 blk_account_io_start(req
, false);
1772 req_set_nomerge(q
, req
);
1777 * blk_attempt_plug_merge - try to merge with %current's plugged list
1778 * @q: request_queue new bio is being queued at
1779 * @bio: new bio being queued
1780 * @request_count: out parameter for number of traversed plugged requests
1781 * @same_queue_rq: pointer to &struct request that gets filled in when
1782 * another request associated with @q is found on the plug list
1783 * (optional, may be %NULL)
1785 * Determine whether @bio being queued on @q can be merged with a request
1786 * on %current's plugged list. Returns %true if merge was successful,
1789 * Plugging coalesces IOs from the same issuer for the same purpose without
1790 * going through @q->queue_lock. As such it's more of an issuing mechanism
1791 * than scheduling, and the request, while may have elvpriv data, is not
1792 * added on the elevator at this point. In addition, we don't have
1793 * reliable access to the elevator outside queue lock. Only check basic
1794 * merging parameters without querying the elevator.
1796 * Caller must ensure !blk_queue_nomerges(q) beforehand.
1798 bool blk_attempt_plug_merge(struct request_queue
*q
, struct bio
*bio
,
1799 unsigned int *request_count
,
1800 struct request
**same_queue_rq
)
1802 struct blk_plug
*plug
;
1804 struct list_head
*plug_list
;
1806 plug
= current
->plug
;
1812 plug_list
= &plug
->mq_list
;
1814 plug_list
= &plug
->list
;
1816 list_for_each_entry_reverse(rq
, plug_list
, queuelist
) {
1817 bool merged
= false;
1822 * Only blk-mq multiple hardware queues case checks the
1823 * rq in the same queue, there should be only one such
1827 *same_queue_rq
= rq
;
1830 if (rq
->q
!= q
|| !blk_rq_merge_ok(rq
, bio
))
1833 switch (blk_try_merge(rq
, bio
)) {
1834 case ELEVATOR_BACK_MERGE
:
1835 merged
= bio_attempt_back_merge(q
, rq
, bio
);
1837 case ELEVATOR_FRONT_MERGE
:
1838 merged
= bio_attempt_front_merge(q
, rq
, bio
);
1840 case ELEVATOR_DISCARD_MERGE
:
1841 merged
= bio_attempt_discard_merge(q
, rq
, bio
);
1854 unsigned int blk_plug_queued_count(struct request_queue
*q
)
1856 struct blk_plug
*plug
;
1858 struct list_head
*plug_list
;
1859 unsigned int ret
= 0;
1861 plug
= current
->plug
;
1866 plug_list
= &plug
->mq_list
;
1868 plug_list
= &plug
->list
;
1870 list_for_each_entry(rq
, plug_list
, queuelist
) {
1878 void blk_init_request_from_bio(struct request
*req
, struct bio
*bio
)
1880 struct io_context
*ioc
= rq_ioc(bio
);
1882 if (bio
->bi_opf
& REQ_RAHEAD
)
1883 req
->cmd_flags
|= REQ_FAILFAST_MASK
;
1885 req
->__sector
= bio
->bi_iter
.bi_sector
;
1886 if (ioprio_valid(bio_prio(bio
)))
1887 req
->ioprio
= bio_prio(bio
);
1889 req
->ioprio
= ioc
->ioprio
;
1891 req
->ioprio
= IOPRIO_PRIO_VALUE(IOPRIO_CLASS_NONE
, 0);
1892 req
->write_hint
= bio
->bi_write_hint
;
1893 blk_rq_bio_prep(req
->q
, req
, bio
);
1895 EXPORT_SYMBOL_GPL(blk_init_request_from_bio
);
1897 static blk_qc_t
blk_queue_bio(struct request_queue
*q
, struct bio
*bio
)
1899 struct blk_plug
*plug
;
1900 int where
= ELEVATOR_INSERT_SORT
;
1901 struct request
*req
, *free
;
1902 unsigned int request_count
= 0;
1903 unsigned int wb_acct
;
1906 * low level driver can indicate that it wants pages above a
1907 * certain limit bounced to low memory (ie for highmem, or even
1908 * ISA dma in theory)
1910 blk_queue_bounce(q
, &bio
);
1912 blk_queue_split(q
, &bio
);
1914 if (!bio_integrity_prep(bio
))
1915 return BLK_QC_T_NONE
;
1917 if (op_is_flush(bio
->bi_opf
)) {
1918 spin_lock_irq(q
->queue_lock
);
1919 where
= ELEVATOR_INSERT_FLUSH
;
1924 * Check if we can merge with the plugged list before grabbing
1927 if (!blk_queue_nomerges(q
)) {
1928 if (blk_attempt_plug_merge(q
, bio
, &request_count
, NULL
))
1929 return BLK_QC_T_NONE
;
1931 request_count
= blk_plug_queued_count(q
);
1933 spin_lock_irq(q
->queue_lock
);
1935 switch (elv_merge(q
, &req
, bio
)) {
1936 case ELEVATOR_BACK_MERGE
:
1937 if (!bio_attempt_back_merge(q
, req
, bio
))
1939 elv_bio_merged(q
, req
, bio
);
1940 free
= attempt_back_merge(q
, req
);
1942 __blk_put_request(q
, free
);
1944 elv_merged_request(q
, req
, ELEVATOR_BACK_MERGE
);
1946 case ELEVATOR_FRONT_MERGE
:
1947 if (!bio_attempt_front_merge(q
, req
, bio
))
1949 elv_bio_merged(q
, req
, bio
);
1950 free
= attempt_front_merge(q
, req
);
1952 __blk_put_request(q
, free
);
1954 elv_merged_request(q
, req
, ELEVATOR_FRONT_MERGE
);
1961 wb_acct
= wbt_wait(q
->rq_wb
, bio
, q
->queue_lock
);
1964 * Grab a free request. This is might sleep but can not fail.
1965 * Returns with the queue unlocked.
1967 blk_queue_enter_live(q
);
1968 req
= get_request(q
, bio
->bi_opf
, bio
, 0);
1971 __wbt_done(q
->rq_wb
, wb_acct
);
1972 if (PTR_ERR(req
) == -ENOMEM
)
1973 bio
->bi_status
= BLK_STS_RESOURCE
;
1975 bio
->bi_status
= BLK_STS_IOERR
;
1980 wbt_track(&req
->issue_stat
, wb_acct
);
1983 * After dropping the lock and possibly sleeping here, our request
1984 * may now be mergeable after it had proven unmergeable (above).
1985 * We don't worry about that case for efficiency. It won't happen
1986 * often, and the elevators are able to handle it.
1988 blk_init_request_from_bio(req
, bio
);
1990 if (test_bit(QUEUE_FLAG_SAME_COMP
, &q
->queue_flags
))
1991 req
->cpu
= raw_smp_processor_id();
1993 plug
= current
->plug
;
1996 * If this is the first request added after a plug, fire
1999 * @request_count may become stale because of schedule
2000 * out, so check plug list again.
2002 if (!request_count
|| list_empty(&plug
->list
))
2003 trace_block_plug(q
);
2005 struct request
*last
= list_entry_rq(plug
->list
.prev
);
2006 if (request_count
>= BLK_MAX_REQUEST_COUNT
||
2007 blk_rq_bytes(last
) >= BLK_PLUG_FLUSH_SIZE
) {
2008 blk_flush_plug_list(plug
, false);
2009 trace_block_plug(q
);
2012 list_add_tail(&req
->queuelist
, &plug
->list
);
2013 blk_account_io_start(req
, true);
2015 spin_lock_irq(q
->queue_lock
);
2016 add_acct_request(q
, req
, where
);
2019 spin_unlock_irq(q
->queue_lock
);
2022 return BLK_QC_T_NONE
;
2025 static void handle_bad_sector(struct bio
*bio
)
2027 char b
[BDEVNAME_SIZE
];
2029 printk(KERN_INFO
"attempt to access beyond end of device\n");
2030 printk(KERN_INFO
"%s: rw=%d, want=%Lu, limit=%Lu\n",
2031 bio_devname(bio
, b
), bio
->bi_opf
,
2032 (unsigned long long)bio_end_sector(bio
),
2033 (long long)get_capacity(bio
->bi_disk
));
2036 #ifdef CONFIG_FAIL_MAKE_REQUEST
2038 static DECLARE_FAULT_ATTR(fail_make_request
);
2040 static int __init
setup_fail_make_request(char *str
)
2042 return setup_fault_attr(&fail_make_request
, str
);
2044 __setup("fail_make_request=", setup_fail_make_request
);
2046 static bool should_fail_request(struct hd_struct
*part
, unsigned int bytes
)
2048 return part
->make_it_fail
&& should_fail(&fail_make_request
, bytes
);
2051 static int __init
fail_make_request_debugfs(void)
2053 struct dentry
*dir
= fault_create_debugfs_attr("fail_make_request",
2054 NULL
, &fail_make_request
);
2056 return PTR_ERR_OR_ZERO(dir
);
2059 late_initcall(fail_make_request_debugfs
);
2061 #else /* CONFIG_FAIL_MAKE_REQUEST */
2063 static inline bool should_fail_request(struct hd_struct
*part
,
2069 #endif /* CONFIG_FAIL_MAKE_REQUEST */
2072 * Remap block n of partition p to block n+start(p) of the disk.
2074 static inline int blk_partition_remap(struct bio
*bio
)
2076 struct hd_struct
*p
;
2080 * Zone reset does not include bi_size so bio_sectors() is always 0.
2081 * Include a test for the reset op code and perform the remap if needed.
2083 if (!bio
->bi_partno
||
2084 (!bio_sectors(bio
) && bio_op(bio
) != REQ_OP_ZONE_RESET
))
2088 p
= __disk_get_part(bio
->bi_disk
, bio
->bi_partno
);
2089 if (likely(p
&& !should_fail_request(p
, bio
->bi_iter
.bi_size
))) {
2090 bio
->bi_iter
.bi_sector
+= p
->start_sect
;
2092 trace_block_bio_remap(bio
->bi_disk
->queue
, bio
, part_devt(p
),
2093 bio
->bi_iter
.bi_sector
- p
->start_sect
);
2095 printk("%s: fail for partition %d\n", __func__
, bio
->bi_partno
);
2104 * Check whether this bio extends beyond the end of the device.
2106 static inline int bio_check_eod(struct bio
*bio
, unsigned int nr_sectors
)
2113 /* Test device or partition size, when known. */
2114 maxsector
= get_capacity(bio
->bi_disk
);
2116 sector_t sector
= bio
->bi_iter
.bi_sector
;
2118 if (maxsector
< nr_sectors
|| maxsector
- nr_sectors
< sector
) {
2120 * This may well happen - the kernel calls bread()
2121 * without checking the size of the device, e.g., when
2122 * mounting a device.
2124 handle_bad_sector(bio
);
2132 static noinline_for_stack
bool
2133 generic_make_request_checks(struct bio
*bio
)
2135 struct request_queue
*q
;
2136 int nr_sectors
= bio_sectors(bio
);
2137 blk_status_t status
= BLK_STS_IOERR
;
2138 char b
[BDEVNAME_SIZE
];
2142 if (bio_check_eod(bio
, nr_sectors
))
2145 q
= bio
->bi_disk
->queue
;
2148 "generic_make_request: Trying to access "
2149 "nonexistent block-device %s (%Lu)\n",
2150 bio_devname(bio
, b
), (long long)bio
->bi_iter
.bi_sector
);
2155 * For a REQ_NOWAIT based request, return -EOPNOTSUPP
2156 * if queue is not a request based queue.
2159 if ((bio
->bi_opf
& REQ_NOWAIT
) && !queue_is_rq_based(q
))
2162 if (should_fail_request(&bio
->bi_disk
->part0
, bio
->bi_iter
.bi_size
))
2165 if (blk_partition_remap(bio
))
2168 if (bio_check_eod(bio
, nr_sectors
))
2172 * Filter flush bio's early so that make_request based
2173 * drivers without flush support don't have to worry
2176 if (op_is_flush(bio
->bi_opf
) &&
2177 !test_bit(QUEUE_FLAG_WC
, &q
->queue_flags
)) {
2178 bio
->bi_opf
&= ~(REQ_PREFLUSH
| REQ_FUA
);
2180 status
= BLK_STS_OK
;
2185 switch (bio_op(bio
)) {
2186 case REQ_OP_DISCARD
:
2187 if (!blk_queue_discard(q
))
2190 case REQ_OP_SECURE_ERASE
:
2191 if (!blk_queue_secure_erase(q
))
2194 case REQ_OP_WRITE_SAME
:
2195 if (!q
->limits
.max_write_same_sectors
)
2198 case REQ_OP_ZONE_REPORT
:
2199 case REQ_OP_ZONE_RESET
:
2200 if (!blk_queue_is_zoned(q
))
2203 case REQ_OP_WRITE_ZEROES
:
2204 if (!q
->limits
.max_write_zeroes_sectors
)
2212 * Various block parts want %current->io_context and lazy ioc
2213 * allocation ends up trading a lot of pain for a small amount of
2214 * memory. Just allocate it upfront. This may fail and block
2215 * layer knows how to live with it.
2217 create_io_context(GFP_ATOMIC
, q
->node
);
2219 if (!blkcg_bio_issue_check(q
, bio
))
2222 if (!bio_flagged(bio
, BIO_TRACE_COMPLETION
)) {
2223 trace_block_bio_queue(q
, bio
);
2224 /* Now that enqueuing has been traced, we need to trace
2225 * completion as well.
2227 bio_set_flag(bio
, BIO_TRACE_COMPLETION
);
2232 status
= BLK_STS_NOTSUPP
;
2234 bio
->bi_status
= status
;
2240 * generic_make_request - hand a buffer to its device driver for I/O
2241 * @bio: The bio describing the location in memory and on the device.
2243 * generic_make_request() is used to make I/O requests of block
2244 * devices. It is passed a &struct bio, which describes the I/O that needs
2247 * generic_make_request() does not return any status. The
2248 * success/failure status of the request, along with notification of
2249 * completion, is delivered asynchronously through the bio->bi_end_io
2250 * function described (one day) else where.
2252 * The caller of generic_make_request must make sure that bi_io_vec
2253 * are set to describe the memory buffer, and that bi_dev and bi_sector are
2254 * set to describe the device address, and the
2255 * bi_end_io and optionally bi_private are set to describe how
2256 * completion notification should be signaled.
2258 * generic_make_request and the drivers it calls may use bi_next if this
2259 * bio happens to be merged with someone else, and may resubmit the bio to
2260 * a lower device by calling into generic_make_request recursively, which
2261 * means the bio should NOT be touched after the call to ->make_request_fn.
2263 blk_qc_t
generic_make_request(struct bio
*bio
)
2266 * bio_list_on_stack[0] contains bios submitted by the current
2268 * bio_list_on_stack[1] contains bios that were submitted before
2269 * the current make_request_fn, but that haven't been processed
2272 struct bio_list bio_list_on_stack
[2];
2273 blk_qc_t ret
= BLK_QC_T_NONE
;
2275 if (!generic_make_request_checks(bio
))
2279 * We only want one ->make_request_fn to be active at a time, else
2280 * stack usage with stacked devices could be a problem. So use
2281 * current->bio_list to keep a list of requests submited by a
2282 * make_request_fn function. current->bio_list is also used as a
2283 * flag to say if generic_make_request is currently active in this
2284 * task or not. If it is NULL, then no make_request is active. If
2285 * it is non-NULL, then a make_request is active, and new requests
2286 * should be added at the tail
2288 if (current
->bio_list
) {
2289 bio_list_add(¤t
->bio_list
[0], bio
);
2293 /* following loop may be a bit non-obvious, and so deserves some
2295 * Before entering the loop, bio->bi_next is NULL (as all callers
2296 * ensure that) so we have a list with a single bio.
2297 * We pretend that we have just taken it off a longer list, so
2298 * we assign bio_list to a pointer to the bio_list_on_stack,
2299 * thus initialising the bio_list of new bios to be
2300 * added. ->make_request() may indeed add some more bios
2301 * through a recursive call to generic_make_request. If it
2302 * did, we find a non-NULL value in bio_list and re-enter the loop
2303 * from the top. In this case we really did just take the bio
2304 * of the top of the list (no pretending) and so remove it from
2305 * bio_list, and call into ->make_request() again.
2307 BUG_ON(bio
->bi_next
);
2308 bio_list_init(&bio_list_on_stack
[0]);
2309 current
->bio_list
= bio_list_on_stack
;
2311 struct request_queue
*q
= bio
->bi_disk
->queue
;
2312 blk_mq_req_flags_t flags
= bio
->bi_opf
& REQ_NOWAIT
?
2313 BLK_MQ_REQ_NOWAIT
: 0;
2315 if (likely(blk_queue_enter(q
, flags
) == 0)) {
2316 struct bio_list lower
, same
;
2318 /* Create a fresh bio_list for all subordinate requests */
2319 bio_list_on_stack
[1] = bio_list_on_stack
[0];
2320 bio_list_init(&bio_list_on_stack
[0]);
2321 ret
= q
->make_request_fn(q
, bio
);
2325 /* sort new bios into those for a lower level
2326 * and those for the same level
2328 bio_list_init(&lower
);
2329 bio_list_init(&same
);
2330 while ((bio
= bio_list_pop(&bio_list_on_stack
[0])) != NULL
)
2331 if (q
== bio
->bi_disk
->queue
)
2332 bio_list_add(&same
, bio
);
2334 bio_list_add(&lower
, bio
);
2335 /* now assemble so we handle the lowest level first */
2336 bio_list_merge(&bio_list_on_stack
[0], &lower
);
2337 bio_list_merge(&bio_list_on_stack
[0], &same
);
2338 bio_list_merge(&bio_list_on_stack
[0], &bio_list_on_stack
[1]);
2340 if (unlikely(!blk_queue_dying(q
) &&
2341 (bio
->bi_opf
& REQ_NOWAIT
)))
2342 bio_wouldblock_error(bio
);
2346 bio
= bio_list_pop(&bio_list_on_stack
[0]);
2348 current
->bio_list
= NULL
; /* deactivate */
2353 EXPORT_SYMBOL(generic_make_request
);
2356 * direct_make_request - hand a buffer directly to its device driver for I/O
2357 * @bio: The bio describing the location in memory and on the device.
2359 * This function behaves like generic_make_request(), but does not protect
2360 * against recursion. Must only be used if the called driver is known
2361 * to not call generic_make_request (or direct_make_request) again from
2362 * its make_request function. (Calling direct_make_request again from
2363 * a workqueue is perfectly fine as that doesn't recurse).
2365 blk_qc_t
direct_make_request(struct bio
*bio
)
2367 struct request_queue
*q
= bio
->bi_disk
->queue
;
2368 bool nowait
= bio
->bi_opf
& REQ_NOWAIT
;
2371 if (!generic_make_request_checks(bio
))
2372 return BLK_QC_T_NONE
;
2374 if (unlikely(blk_queue_enter(q
, nowait
? BLK_MQ_REQ_NOWAIT
: 0))) {
2375 if (nowait
&& !blk_queue_dying(q
))
2376 bio
->bi_status
= BLK_STS_AGAIN
;
2378 bio
->bi_status
= BLK_STS_IOERR
;
2380 return BLK_QC_T_NONE
;
2383 ret
= q
->make_request_fn(q
, bio
);
2387 EXPORT_SYMBOL_GPL(direct_make_request
);
2390 * submit_bio - submit a bio to the block device layer for I/O
2391 * @bio: The &struct bio which describes the I/O
2393 * submit_bio() is very similar in purpose to generic_make_request(), and
2394 * uses that function to do most of the work. Both are fairly rough
2395 * interfaces; @bio must be presetup and ready for I/O.
2398 blk_qc_t
submit_bio(struct bio
*bio
)
2401 * If it's a regular read/write or a barrier with data attached,
2402 * go through the normal accounting stuff before submission.
2404 if (bio_has_data(bio
)) {
2407 if (unlikely(bio_op(bio
) == REQ_OP_WRITE_SAME
))
2408 count
= queue_logical_block_size(bio
->bi_disk
->queue
) >> 9;
2410 count
= bio_sectors(bio
);
2412 if (op_is_write(bio_op(bio
))) {
2413 count_vm_events(PGPGOUT
, count
);
2415 task_io_account_read(bio
->bi_iter
.bi_size
);
2416 count_vm_events(PGPGIN
, count
);
2419 if (unlikely(block_dump
)) {
2420 char b
[BDEVNAME_SIZE
];
2421 printk(KERN_DEBUG
"%s(%d): %s block %Lu on %s (%u sectors)\n",
2422 current
->comm
, task_pid_nr(current
),
2423 op_is_write(bio_op(bio
)) ? "WRITE" : "READ",
2424 (unsigned long long)bio
->bi_iter
.bi_sector
,
2425 bio_devname(bio
, b
), count
);
2429 return generic_make_request(bio
);
2431 EXPORT_SYMBOL(submit_bio
);
2433 bool blk_poll(struct request_queue
*q
, blk_qc_t cookie
)
2435 if (!q
->poll_fn
|| !blk_qc_t_valid(cookie
))
2439 blk_flush_plug_list(current
->plug
, false);
2440 return q
->poll_fn(q
, cookie
);
2442 EXPORT_SYMBOL_GPL(blk_poll
);
2445 * blk_cloned_rq_check_limits - Helper function to check a cloned request
2446 * for new the queue limits
2448 * @rq: the request being checked
2451 * @rq may have been made based on weaker limitations of upper-level queues
2452 * in request stacking drivers, and it may violate the limitation of @q.
2453 * Since the block layer and the underlying device driver trust @rq
2454 * after it is inserted to @q, it should be checked against @q before
2455 * the insertion using this generic function.
2457 * Request stacking drivers like request-based dm may change the queue
2458 * limits when retrying requests on other queues. Those requests need
2459 * to be checked against the new queue limits again during dispatch.
2461 static int blk_cloned_rq_check_limits(struct request_queue
*q
,
2464 if (blk_rq_sectors(rq
) > blk_queue_get_max_sectors(q
, req_op(rq
))) {
2465 printk(KERN_ERR
"%s: over max size limit.\n", __func__
);
2470 * queue's settings related to segment counting like q->bounce_pfn
2471 * may differ from that of other stacking queues.
2472 * Recalculate it to check the request correctly on this queue's
2475 blk_recalc_rq_segments(rq
);
2476 if (rq
->nr_phys_segments
> queue_max_segments(q
)) {
2477 printk(KERN_ERR
"%s: over max segments limit.\n", __func__
);
2485 * blk_insert_cloned_request - Helper for stacking drivers to submit a request
2486 * @q: the queue to submit the request
2487 * @rq: the request being queued
2489 blk_status_t
blk_insert_cloned_request(struct request_queue
*q
, struct request
*rq
)
2491 unsigned long flags
;
2492 int where
= ELEVATOR_INSERT_BACK
;
2494 if (blk_cloned_rq_check_limits(q
, rq
))
2495 return BLK_STS_IOERR
;
2498 should_fail_request(&rq
->rq_disk
->part0
, blk_rq_bytes(rq
)))
2499 return BLK_STS_IOERR
;
2502 if (blk_queue_io_stat(q
))
2503 blk_account_io_start(rq
, true);
2505 * Since we have a scheduler attached on the top device,
2506 * bypass a potential scheduler on the bottom device for
2509 blk_mq_request_bypass_insert(rq
, true);
2513 spin_lock_irqsave(q
->queue_lock
, flags
);
2514 if (unlikely(blk_queue_dying(q
))) {
2515 spin_unlock_irqrestore(q
->queue_lock
, flags
);
2516 return BLK_STS_IOERR
;
2520 * Submitting request must be dequeued before calling this function
2521 * because it will be linked to another request_queue
2523 BUG_ON(blk_queued_rq(rq
));
2525 if (op_is_flush(rq
->cmd_flags
))
2526 where
= ELEVATOR_INSERT_FLUSH
;
2528 add_acct_request(q
, rq
, where
);
2529 if (where
== ELEVATOR_INSERT_FLUSH
)
2531 spin_unlock_irqrestore(q
->queue_lock
, flags
);
2535 EXPORT_SYMBOL_GPL(blk_insert_cloned_request
);
2538 * blk_rq_err_bytes - determine number of bytes till the next failure boundary
2539 * @rq: request to examine
2542 * A request could be merge of IOs which require different failure
2543 * handling. This function determines the number of bytes which
2544 * can be failed from the beginning of the request without
2545 * crossing into area which need to be retried further.
2548 * The number of bytes to fail.
2550 unsigned int blk_rq_err_bytes(const struct request
*rq
)
2552 unsigned int ff
= rq
->cmd_flags
& REQ_FAILFAST_MASK
;
2553 unsigned int bytes
= 0;
2556 if (!(rq
->rq_flags
& RQF_MIXED_MERGE
))
2557 return blk_rq_bytes(rq
);
2560 * Currently the only 'mixing' which can happen is between
2561 * different fastfail types. We can safely fail portions
2562 * which have all the failfast bits that the first one has -
2563 * the ones which are at least as eager to fail as the first
2566 for (bio
= rq
->bio
; bio
; bio
= bio
->bi_next
) {
2567 if ((bio
->bi_opf
& ff
) != ff
)
2569 bytes
+= bio
->bi_iter
.bi_size
;
2572 /* this could lead to infinite loop */
2573 BUG_ON(blk_rq_bytes(rq
) && !bytes
);
2576 EXPORT_SYMBOL_GPL(blk_rq_err_bytes
);
2578 void blk_account_io_completion(struct request
*req
, unsigned int bytes
)
2580 if (blk_do_io_stat(req
)) {
2581 const int rw
= rq_data_dir(req
);
2582 struct hd_struct
*part
;
2585 cpu
= part_stat_lock();
2587 part_stat_add(cpu
, part
, sectors
[rw
], bytes
>> 9);
2592 void blk_account_io_done(struct request
*req
)
2595 * Account IO completion. flush_rq isn't accounted as a
2596 * normal IO on queueing nor completion. Accounting the
2597 * containing request is enough.
2599 if (blk_do_io_stat(req
) && !(req
->rq_flags
& RQF_FLUSH_SEQ
)) {
2600 unsigned long duration
= jiffies
- req
->start_time
;
2601 const int rw
= rq_data_dir(req
);
2602 struct hd_struct
*part
;
2605 cpu
= part_stat_lock();
2608 part_stat_inc(cpu
, part
, ios
[rw
]);
2609 part_stat_add(cpu
, part
, ticks
[rw
], duration
);
2610 part_round_stats(req
->q
, cpu
, part
);
2611 part_dec_in_flight(req
->q
, part
, rw
);
2613 hd_struct_put(part
);
2620 * Don't process normal requests when queue is suspended
2621 * or in the process of suspending/resuming
2623 static bool blk_pm_allow_request(struct request
*rq
)
2625 switch (rq
->q
->rpm_status
) {
2627 case RPM_SUSPENDING
:
2628 return rq
->rq_flags
& RQF_PM
;
2636 static bool blk_pm_allow_request(struct request
*rq
)
2642 void blk_account_io_start(struct request
*rq
, bool new_io
)
2644 struct hd_struct
*part
;
2645 int rw
= rq_data_dir(rq
);
2648 if (!blk_do_io_stat(rq
))
2651 cpu
= part_stat_lock();
2655 part_stat_inc(cpu
, part
, merges
[rw
]);
2657 part
= disk_map_sector_rcu(rq
->rq_disk
, blk_rq_pos(rq
));
2658 if (!hd_struct_try_get(part
)) {
2660 * The partition is already being removed,
2661 * the request will be accounted on the disk only
2663 * We take a reference on disk->part0 although that
2664 * partition will never be deleted, so we can treat
2665 * it as any other partition.
2667 part
= &rq
->rq_disk
->part0
;
2668 hd_struct_get(part
);
2670 part_round_stats(rq
->q
, cpu
, part
);
2671 part_inc_in_flight(rq
->q
, part
, rw
);
2678 static struct request
*elv_next_request(struct request_queue
*q
)
2681 struct blk_flush_queue
*fq
= blk_get_flush_queue(q
, NULL
);
2683 WARN_ON_ONCE(q
->mq_ops
);
2686 list_for_each_entry(rq
, &q
->queue_head
, queuelist
) {
2687 if (blk_pm_allow_request(rq
))
2690 if (rq
->rq_flags
& RQF_SOFTBARRIER
)
2695 * Flush request is running and flush request isn't queueable
2696 * in the drive, we can hold the queue till flush request is
2697 * finished. Even we don't do this, driver can't dispatch next
2698 * requests and will requeue them. And this can improve
2699 * throughput too. For example, we have request flush1, write1,
2700 * flush 2. flush1 is dispatched, then queue is hold, write1
2701 * isn't inserted to queue. After flush1 is finished, flush2
2702 * will be dispatched. Since disk cache is already clean,
2703 * flush2 will be finished very soon, so looks like flush2 is
2705 * Since the queue is hold, a flag is set to indicate the queue
2706 * should be restarted later. Please see flush_end_io() for
2709 if (fq
->flush_pending_idx
!= fq
->flush_running_idx
&&
2710 !queue_flush_queueable(q
)) {
2711 fq
->flush_queue_delayed
= 1;
2714 if (unlikely(blk_queue_bypass(q
)) ||
2715 !q
->elevator
->type
->ops
.sq
.elevator_dispatch_fn(q
, 0))
2721 * blk_peek_request - peek at the top of a request queue
2722 * @q: request queue to peek at
2725 * Return the request at the top of @q. The returned request
2726 * should be started using blk_start_request() before LLD starts
2730 * Pointer to the request at the top of @q if available. Null
2733 struct request
*blk_peek_request(struct request_queue
*q
)
2738 lockdep_assert_held(q
->queue_lock
);
2739 WARN_ON_ONCE(q
->mq_ops
);
2741 while ((rq
= elv_next_request(q
)) != NULL
) {
2742 if (!(rq
->rq_flags
& RQF_STARTED
)) {
2744 * This is the first time the device driver
2745 * sees this request (possibly after
2746 * requeueing). Notify IO scheduler.
2748 if (rq
->rq_flags
& RQF_SORTED
)
2749 elv_activate_rq(q
, rq
);
2752 * just mark as started even if we don't start
2753 * it, a request that has been delayed should
2754 * not be passed by new incoming requests
2756 rq
->rq_flags
|= RQF_STARTED
;
2757 trace_block_rq_issue(q
, rq
);
2760 if (!q
->boundary_rq
|| q
->boundary_rq
== rq
) {
2761 q
->end_sector
= rq_end_sector(rq
);
2762 q
->boundary_rq
= NULL
;
2765 if (rq
->rq_flags
& RQF_DONTPREP
)
2768 if (q
->dma_drain_size
&& blk_rq_bytes(rq
)) {
2770 * make sure space for the drain appears we
2771 * know we can do this because max_hw_segments
2772 * has been adjusted to be one fewer than the
2775 rq
->nr_phys_segments
++;
2781 ret
= q
->prep_rq_fn(q
, rq
);
2782 if (ret
== BLKPREP_OK
) {
2784 } else if (ret
== BLKPREP_DEFER
) {
2786 * the request may have been (partially) prepped.
2787 * we need to keep this request in the front to
2788 * avoid resource deadlock. RQF_STARTED will
2789 * prevent other fs requests from passing this one.
2791 if (q
->dma_drain_size
&& blk_rq_bytes(rq
) &&
2792 !(rq
->rq_flags
& RQF_DONTPREP
)) {
2794 * remove the space for the drain we added
2795 * so that we don't add it again
2797 --rq
->nr_phys_segments
;
2802 } else if (ret
== BLKPREP_KILL
|| ret
== BLKPREP_INVALID
) {
2803 rq
->rq_flags
|= RQF_QUIET
;
2805 * Mark this request as started so we don't trigger
2806 * any debug logic in the end I/O path.
2808 blk_start_request(rq
);
2809 __blk_end_request_all(rq
, ret
== BLKPREP_INVALID
?
2810 BLK_STS_TARGET
: BLK_STS_IOERR
);
2812 printk(KERN_ERR
"%s: bad return=%d\n", __func__
, ret
);
2819 EXPORT_SYMBOL(blk_peek_request
);
2821 static void blk_dequeue_request(struct request
*rq
)
2823 struct request_queue
*q
= rq
->q
;
2825 BUG_ON(list_empty(&rq
->queuelist
));
2826 BUG_ON(ELV_ON_HASH(rq
));
2828 list_del_init(&rq
->queuelist
);
2831 * the time frame between a request being removed from the lists
2832 * and to it is freed is accounted as io that is in progress at
2835 if (blk_account_rq(rq
)) {
2836 q
->in_flight
[rq_is_sync(rq
)]++;
2837 set_io_start_time_ns(rq
);
2842 * blk_start_request - start request processing on the driver
2843 * @req: request to dequeue
2846 * Dequeue @req and start timeout timer on it. This hands off the
2847 * request to the driver.
2849 void blk_start_request(struct request
*req
)
2851 lockdep_assert_held(req
->q
->queue_lock
);
2852 WARN_ON_ONCE(req
->q
->mq_ops
);
2854 blk_dequeue_request(req
);
2856 if (test_bit(QUEUE_FLAG_STATS
, &req
->q
->queue_flags
)) {
2857 blk_stat_set_issue(&req
->issue_stat
, blk_rq_sectors(req
));
2858 req
->rq_flags
|= RQF_STATS
;
2859 wbt_issue(req
->q
->rq_wb
, &req
->issue_stat
);
2862 BUG_ON(test_bit(REQ_ATOM_COMPLETE
, &req
->atomic_flags
));
2865 EXPORT_SYMBOL(blk_start_request
);
2868 * blk_fetch_request - fetch a request from a request queue
2869 * @q: request queue to fetch a request from
2872 * Return the request at the top of @q. The request is started on
2873 * return and LLD can start processing it immediately.
2876 * Pointer to the request at the top of @q if available. Null
2879 struct request
*blk_fetch_request(struct request_queue
*q
)
2883 lockdep_assert_held(q
->queue_lock
);
2884 WARN_ON_ONCE(q
->mq_ops
);
2886 rq
= blk_peek_request(q
);
2888 blk_start_request(rq
);
2891 EXPORT_SYMBOL(blk_fetch_request
);
2894 * Steal bios from a request and add them to a bio list.
2895 * The request must not have been partially completed before.
2897 void blk_steal_bios(struct bio_list
*list
, struct request
*rq
)
2901 list
->tail
->bi_next
= rq
->bio
;
2903 list
->head
= rq
->bio
;
2904 list
->tail
= rq
->biotail
;
2912 EXPORT_SYMBOL_GPL(blk_steal_bios
);
2915 * blk_update_request - Special helper function for request stacking drivers
2916 * @req: the request being processed
2917 * @error: block status code
2918 * @nr_bytes: number of bytes to complete @req
2921 * Ends I/O on a number of bytes attached to @req, but doesn't complete
2922 * the request structure even if @req doesn't have leftover.
2923 * If @req has leftover, sets it up for the next range of segments.
2925 * This special helper function is only for request stacking drivers
2926 * (e.g. request-based dm) so that they can handle partial completion.
2927 * Actual device drivers should use blk_end_request instead.
2929 * Passing the result of blk_rq_bytes() as @nr_bytes guarantees
2930 * %false return from this function.
2933 * %false - this request doesn't have any more data
2934 * %true - this request has more data
2936 bool blk_update_request(struct request
*req
, blk_status_t error
,
2937 unsigned int nr_bytes
)
2941 trace_block_rq_complete(req
, blk_status_to_errno(error
), nr_bytes
);
2946 if (unlikely(error
&& !blk_rq_is_passthrough(req
) &&
2947 !(req
->rq_flags
& RQF_QUIET
)))
2948 print_req_error(req
, error
);
2950 blk_account_io_completion(req
, nr_bytes
);
2954 struct bio
*bio
= req
->bio
;
2955 unsigned bio_bytes
= min(bio
->bi_iter
.bi_size
, nr_bytes
);
2957 if (bio_bytes
== bio
->bi_iter
.bi_size
)
2958 req
->bio
= bio
->bi_next
;
2960 /* Completion has already been traced */
2961 bio_clear_flag(bio
, BIO_TRACE_COMPLETION
);
2962 req_bio_endio(req
, bio
, bio_bytes
, error
);
2964 total_bytes
+= bio_bytes
;
2965 nr_bytes
-= bio_bytes
;
2976 * Reset counters so that the request stacking driver
2977 * can find how many bytes remain in the request
2980 req
->__data_len
= 0;
2984 req
->__data_len
-= total_bytes
;
2986 /* update sector only for requests with clear definition of sector */
2987 if (!blk_rq_is_passthrough(req
))
2988 req
->__sector
+= total_bytes
>> 9;
2990 /* mixed attributes always follow the first bio */
2991 if (req
->rq_flags
& RQF_MIXED_MERGE
) {
2992 req
->cmd_flags
&= ~REQ_FAILFAST_MASK
;
2993 req
->cmd_flags
|= req
->bio
->bi_opf
& REQ_FAILFAST_MASK
;
2996 if (!(req
->rq_flags
& RQF_SPECIAL_PAYLOAD
)) {
2998 * If total number of sectors is less than the first segment
2999 * size, something has gone terribly wrong.
3001 if (blk_rq_bytes(req
) < blk_rq_cur_bytes(req
)) {
3002 blk_dump_rq_flags(req
, "request botched");
3003 req
->__data_len
= blk_rq_cur_bytes(req
);
3006 /* recalculate the number of segments */
3007 blk_recalc_rq_segments(req
);
3012 EXPORT_SYMBOL_GPL(blk_update_request
);
3014 static bool blk_update_bidi_request(struct request
*rq
, blk_status_t error
,
3015 unsigned int nr_bytes
,
3016 unsigned int bidi_bytes
)
3018 if (blk_update_request(rq
, error
, nr_bytes
))
3021 /* Bidi request must be completed as a whole */
3022 if (unlikely(blk_bidi_rq(rq
)) &&
3023 blk_update_request(rq
->next_rq
, error
, bidi_bytes
))
3026 if (blk_queue_add_random(rq
->q
))
3027 add_disk_randomness(rq
->rq_disk
);
3033 * blk_unprep_request - unprepare a request
3036 * This function makes a request ready for complete resubmission (or
3037 * completion). It happens only after all error handling is complete,
3038 * so represents the appropriate moment to deallocate any resources
3039 * that were allocated to the request in the prep_rq_fn. The queue
3040 * lock is held when calling this.
3042 void blk_unprep_request(struct request
*req
)
3044 struct request_queue
*q
= req
->q
;
3046 req
->rq_flags
&= ~RQF_DONTPREP
;
3047 if (q
->unprep_rq_fn
)
3048 q
->unprep_rq_fn(q
, req
);
3050 EXPORT_SYMBOL_GPL(blk_unprep_request
);
3052 void blk_finish_request(struct request
*req
, blk_status_t error
)
3054 struct request_queue
*q
= req
->q
;
3056 lockdep_assert_held(req
->q
->queue_lock
);
3057 WARN_ON_ONCE(q
->mq_ops
);
3059 if (req
->rq_flags
& RQF_STATS
)
3062 if (req
->rq_flags
& RQF_QUEUED
)
3063 blk_queue_end_tag(q
, req
);
3065 BUG_ON(blk_queued_rq(req
));
3067 if (unlikely(laptop_mode
) && !blk_rq_is_passthrough(req
))
3068 laptop_io_completion(req
->q
->backing_dev_info
);
3070 blk_delete_timer(req
);
3072 if (req
->rq_flags
& RQF_DONTPREP
)
3073 blk_unprep_request(req
);
3075 blk_account_io_done(req
);
3078 wbt_done(req
->q
->rq_wb
, &req
->issue_stat
);
3079 req
->end_io(req
, error
);
3081 if (blk_bidi_rq(req
))
3082 __blk_put_request(req
->next_rq
->q
, req
->next_rq
);
3084 __blk_put_request(q
, req
);
3087 EXPORT_SYMBOL(blk_finish_request
);
3090 * blk_end_bidi_request - Complete a bidi request
3091 * @rq: the request to complete
3092 * @error: block status code
3093 * @nr_bytes: number of bytes to complete @rq
3094 * @bidi_bytes: number of bytes to complete @rq->next_rq
3097 * Ends I/O on a number of bytes attached to @rq and @rq->next_rq.
3098 * Drivers that supports bidi can safely call this member for any
3099 * type of request, bidi or uni. In the later case @bidi_bytes is
3103 * %false - we are done with this request
3104 * %true - still buffers pending for this request
3106 static bool blk_end_bidi_request(struct request
*rq
, blk_status_t error
,
3107 unsigned int nr_bytes
, unsigned int bidi_bytes
)
3109 struct request_queue
*q
= rq
->q
;
3110 unsigned long flags
;
3112 WARN_ON_ONCE(q
->mq_ops
);
3114 if (blk_update_bidi_request(rq
, error
, nr_bytes
, bidi_bytes
))
3117 spin_lock_irqsave(q
->queue_lock
, flags
);
3118 blk_finish_request(rq
, error
);
3119 spin_unlock_irqrestore(q
->queue_lock
, flags
);
3125 * __blk_end_bidi_request - Complete a bidi request with queue lock held
3126 * @rq: the request to complete
3127 * @error: block status code
3128 * @nr_bytes: number of bytes to complete @rq
3129 * @bidi_bytes: number of bytes to complete @rq->next_rq
3132 * Identical to blk_end_bidi_request() except that queue lock is
3133 * assumed to be locked on entry and remains so on return.
3136 * %false - we are done with this request
3137 * %true - still buffers pending for this request
3139 static bool __blk_end_bidi_request(struct request
*rq
, blk_status_t error
,
3140 unsigned int nr_bytes
, unsigned int bidi_bytes
)
3142 lockdep_assert_held(rq
->q
->queue_lock
);
3143 WARN_ON_ONCE(rq
->q
->mq_ops
);
3145 if (blk_update_bidi_request(rq
, error
, nr_bytes
, bidi_bytes
))
3148 blk_finish_request(rq
, error
);
3154 * blk_end_request - Helper function for drivers to complete the request.
3155 * @rq: the request being processed
3156 * @error: block status code
3157 * @nr_bytes: number of bytes to complete
3160 * Ends I/O on a number of bytes attached to @rq.
3161 * If @rq has leftover, sets it up for the next range of segments.
3164 * %false - we are done with this request
3165 * %true - still buffers pending for this request
3167 bool blk_end_request(struct request
*rq
, blk_status_t error
,
3168 unsigned int nr_bytes
)
3170 WARN_ON_ONCE(rq
->q
->mq_ops
);
3171 return blk_end_bidi_request(rq
, error
, nr_bytes
, 0);
3173 EXPORT_SYMBOL(blk_end_request
);
3176 * blk_end_request_all - Helper function for drives to finish the request.
3177 * @rq: the request to finish
3178 * @error: block status code
3181 * Completely finish @rq.
3183 void blk_end_request_all(struct request
*rq
, blk_status_t error
)
3186 unsigned int bidi_bytes
= 0;
3188 if (unlikely(blk_bidi_rq(rq
)))
3189 bidi_bytes
= blk_rq_bytes(rq
->next_rq
);
3191 pending
= blk_end_bidi_request(rq
, error
, blk_rq_bytes(rq
), bidi_bytes
);
3194 EXPORT_SYMBOL(blk_end_request_all
);
3197 * __blk_end_request - Helper function for drivers to complete the request.
3198 * @rq: the request being processed
3199 * @error: block status code
3200 * @nr_bytes: number of bytes to complete
3203 * Must be called with queue lock held unlike blk_end_request().
3206 * %false - we are done with this request
3207 * %true - still buffers pending for this request
3209 bool __blk_end_request(struct request
*rq
, blk_status_t error
,
3210 unsigned int nr_bytes
)
3212 lockdep_assert_held(rq
->q
->queue_lock
);
3213 WARN_ON_ONCE(rq
->q
->mq_ops
);
3215 return __blk_end_bidi_request(rq
, error
, nr_bytes
, 0);
3217 EXPORT_SYMBOL(__blk_end_request
);
3220 * __blk_end_request_all - Helper function for drives to finish the request.
3221 * @rq: the request to finish
3222 * @error: block status code
3225 * Completely finish @rq. Must be called with queue lock held.
3227 void __blk_end_request_all(struct request
*rq
, blk_status_t error
)
3230 unsigned int bidi_bytes
= 0;
3232 lockdep_assert_held(rq
->q
->queue_lock
);
3233 WARN_ON_ONCE(rq
->q
->mq_ops
);
3235 if (unlikely(blk_bidi_rq(rq
)))
3236 bidi_bytes
= blk_rq_bytes(rq
->next_rq
);
3238 pending
= __blk_end_bidi_request(rq
, error
, blk_rq_bytes(rq
), bidi_bytes
);
3241 EXPORT_SYMBOL(__blk_end_request_all
);
3244 * __blk_end_request_cur - Helper function to finish the current request chunk.
3245 * @rq: the request to finish the current chunk for
3246 * @error: block status code
3249 * Complete the current consecutively mapped chunk from @rq. Must
3250 * be called with queue lock held.
3253 * %false - we are done with this request
3254 * %true - still buffers pending for this request
3256 bool __blk_end_request_cur(struct request
*rq
, blk_status_t error
)
3258 return __blk_end_request(rq
, error
, blk_rq_cur_bytes(rq
));
3260 EXPORT_SYMBOL(__blk_end_request_cur
);
3262 void blk_rq_bio_prep(struct request_queue
*q
, struct request
*rq
,
3265 if (bio_has_data(bio
))
3266 rq
->nr_phys_segments
= bio_phys_segments(q
, bio
);
3267 else if (bio_op(bio
) == REQ_OP_DISCARD
)
3268 rq
->nr_phys_segments
= 1;
3270 rq
->__data_len
= bio
->bi_iter
.bi_size
;
3271 rq
->bio
= rq
->biotail
= bio
;
3274 rq
->rq_disk
= bio
->bi_disk
;
3277 #if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
3279 * rq_flush_dcache_pages - Helper function to flush all pages in a request
3280 * @rq: the request to be flushed
3283 * Flush all pages in @rq.
3285 void rq_flush_dcache_pages(struct request
*rq
)
3287 struct req_iterator iter
;
3288 struct bio_vec bvec
;
3290 rq_for_each_segment(bvec
, rq
, iter
)
3291 flush_dcache_page(bvec
.bv_page
);
3293 EXPORT_SYMBOL_GPL(rq_flush_dcache_pages
);
3297 * blk_lld_busy - Check if underlying low-level drivers of a device are busy
3298 * @q : the queue of the device being checked
3301 * Check if underlying low-level drivers of a device are busy.
3302 * If the drivers want to export their busy state, they must set own
3303 * exporting function using blk_queue_lld_busy() first.
3305 * Basically, this function is used only by request stacking drivers
3306 * to stop dispatching requests to underlying devices when underlying
3307 * devices are busy. This behavior helps more I/O merging on the queue
3308 * of the request stacking driver and prevents I/O throughput regression
3309 * on burst I/O load.
3312 * 0 - Not busy (The request stacking driver should dispatch request)
3313 * 1 - Busy (The request stacking driver should stop dispatching request)
3315 int blk_lld_busy(struct request_queue
*q
)
3318 return q
->lld_busy_fn(q
);
3322 EXPORT_SYMBOL_GPL(blk_lld_busy
);
3325 * blk_rq_unprep_clone - Helper function to free all bios in a cloned request
3326 * @rq: the clone request to be cleaned up
3329 * Free all bios in @rq for a cloned request.
3331 void blk_rq_unprep_clone(struct request
*rq
)
3335 while ((bio
= rq
->bio
) != NULL
) {
3336 rq
->bio
= bio
->bi_next
;
3341 EXPORT_SYMBOL_GPL(blk_rq_unprep_clone
);
3344 * Copy attributes of the original request to the clone request.
3345 * The actual data parts (e.g. ->cmd, ->sense) are not copied.
3347 static void __blk_rq_prep_clone(struct request
*dst
, struct request
*src
)
3349 dst
->cpu
= src
->cpu
;
3350 dst
->__sector
= blk_rq_pos(src
);
3351 dst
->__data_len
= blk_rq_bytes(src
);
3352 if (src
->rq_flags
& RQF_SPECIAL_PAYLOAD
) {
3353 dst
->rq_flags
|= RQF_SPECIAL_PAYLOAD
;
3354 dst
->special_vec
= src
->special_vec
;
3356 dst
->nr_phys_segments
= src
->nr_phys_segments
;
3357 dst
->ioprio
= src
->ioprio
;
3358 dst
->extra_len
= src
->extra_len
;
3362 * blk_rq_prep_clone - Helper function to setup clone request
3363 * @rq: the request to be setup
3364 * @rq_src: original request to be cloned
3365 * @bs: bio_set that bios for clone are allocated from
3366 * @gfp_mask: memory allocation mask for bio
3367 * @bio_ctr: setup function to be called for each clone bio.
3368 * Returns %0 for success, non %0 for failure.
3369 * @data: private data to be passed to @bio_ctr
3372 * Clones bios in @rq_src to @rq, and copies attributes of @rq_src to @rq.
3373 * The actual data parts of @rq_src (e.g. ->cmd, ->sense)
3374 * are not copied, and copying such parts is the caller's responsibility.
3375 * Also, pages which the original bios are pointing to are not copied
3376 * and the cloned bios just point same pages.
3377 * So cloned bios must be completed before original bios, which means
3378 * the caller must complete @rq before @rq_src.
3380 int blk_rq_prep_clone(struct request
*rq
, struct request
*rq_src
,
3381 struct bio_set
*bs
, gfp_t gfp_mask
,
3382 int (*bio_ctr
)(struct bio
*, struct bio
*, void *),
3385 struct bio
*bio
, *bio_src
;
3390 __rq_for_each_bio(bio_src
, rq_src
) {
3391 bio
= bio_clone_fast(bio_src
, gfp_mask
, bs
);
3395 if (bio_ctr
&& bio_ctr(bio
, bio_src
, data
))
3399 rq
->biotail
->bi_next
= bio
;
3402 rq
->bio
= rq
->biotail
= bio
;
3405 __blk_rq_prep_clone(rq
, rq_src
);
3412 blk_rq_unprep_clone(rq
);
3416 EXPORT_SYMBOL_GPL(blk_rq_prep_clone
);
3418 int kblockd_schedule_work(struct work_struct
*work
)
3420 return queue_work(kblockd_workqueue
, work
);
3422 EXPORT_SYMBOL(kblockd_schedule_work
);
3424 int kblockd_schedule_work_on(int cpu
, struct work_struct
*work
)
3426 return queue_work_on(cpu
, kblockd_workqueue
, work
);
3428 EXPORT_SYMBOL(kblockd_schedule_work_on
);
3430 int kblockd_mod_delayed_work_on(int cpu
, struct delayed_work
*dwork
,
3431 unsigned long delay
)
3433 return mod_delayed_work_on(cpu
, kblockd_workqueue
, dwork
, delay
);
3435 EXPORT_SYMBOL(kblockd_mod_delayed_work_on
);
3437 int kblockd_schedule_delayed_work(struct delayed_work
*dwork
,
3438 unsigned long delay
)
3440 return queue_delayed_work(kblockd_workqueue
, dwork
, delay
);
3442 EXPORT_SYMBOL(kblockd_schedule_delayed_work
);
3444 int kblockd_schedule_delayed_work_on(int cpu
, struct delayed_work
*dwork
,
3445 unsigned long delay
)
3447 return queue_delayed_work_on(cpu
, kblockd_workqueue
, dwork
, delay
);
3449 EXPORT_SYMBOL(kblockd_schedule_delayed_work_on
);
3452 * blk_start_plug - initialize blk_plug and track it inside the task_struct
3453 * @plug: The &struct blk_plug that needs to be initialized
3456 * Tracking blk_plug inside the task_struct will help with auto-flushing the
3457 * pending I/O should the task end up blocking between blk_start_plug() and
3458 * blk_finish_plug(). This is important from a performance perspective, but
3459 * also ensures that we don't deadlock. For instance, if the task is blocking
3460 * for a memory allocation, memory reclaim could end up wanting to free a
3461 * page belonging to that request that is currently residing in our private
3462 * plug. By flushing the pending I/O when the process goes to sleep, we avoid
3463 * this kind of deadlock.
3465 void blk_start_plug(struct blk_plug
*plug
)
3467 struct task_struct
*tsk
= current
;
3470 * If this is a nested plug, don't actually assign it.
3475 INIT_LIST_HEAD(&plug
->list
);
3476 INIT_LIST_HEAD(&plug
->mq_list
);
3477 INIT_LIST_HEAD(&plug
->cb_list
);
3479 * Store ordering should not be needed here, since a potential
3480 * preempt will imply a full memory barrier
3484 EXPORT_SYMBOL(blk_start_plug
);
3486 static int plug_rq_cmp(void *priv
, struct list_head
*a
, struct list_head
*b
)
3488 struct request
*rqa
= container_of(a
, struct request
, queuelist
);
3489 struct request
*rqb
= container_of(b
, struct request
, queuelist
);
3491 return !(rqa
->q
< rqb
->q
||
3492 (rqa
->q
== rqb
->q
&& blk_rq_pos(rqa
) < blk_rq_pos(rqb
)));
3496 * If 'from_schedule' is true, then postpone the dispatch of requests
3497 * until a safe kblockd context. We due this to avoid accidental big
3498 * additional stack usage in driver dispatch, in places where the originally
3499 * plugger did not intend it.
3501 static void queue_unplugged(struct request_queue
*q
, unsigned int depth
,
3503 __releases(q
->queue_lock
)
3505 lockdep_assert_held(q
->queue_lock
);
3507 trace_block_unplug(q
, depth
, !from_schedule
);
3510 blk_run_queue_async(q
);
3513 spin_unlock(q
->queue_lock
);
3516 static void flush_plug_callbacks(struct blk_plug
*plug
, bool from_schedule
)
3518 LIST_HEAD(callbacks
);
3520 while (!list_empty(&plug
->cb_list
)) {
3521 list_splice_init(&plug
->cb_list
, &callbacks
);
3523 while (!list_empty(&callbacks
)) {
3524 struct blk_plug_cb
*cb
= list_first_entry(&callbacks
,
3527 list_del(&cb
->list
);
3528 cb
->callback(cb
, from_schedule
);
3533 struct blk_plug_cb
*blk_check_plugged(blk_plug_cb_fn unplug
, void *data
,
3536 struct blk_plug
*plug
= current
->plug
;
3537 struct blk_plug_cb
*cb
;
3542 list_for_each_entry(cb
, &plug
->cb_list
, list
)
3543 if (cb
->callback
== unplug
&& cb
->data
== data
)
3546 /* Not currently on the callback list */
3547 BUG_ON(size
< sizeof(*cb
));
3548 cb
= kzalloc(size
, GFP_ATOMIC
);
3551 cb
->callback
= unplug
;
3552 list_add(&cb
->list
, &plug
->cb_list
);
3556 EXPORT_SYMBOL(blk_check_plugged
);
3558 void blk_flush_plug_list(struct blk_plug
*plug
, bool from_schedule
)
3560 struct request_queue
*q
;
3561 unsigned long flags
;
3566 flush_plug_callbacks(plug
, from_schedule
);
3568 if (!list_empty(&plug
->mq_list
))
3569 blk_mq_flush_plug_list(plug
, from_schedule
);
3571 if (list_empty(&plug
->list
))
3574 list_splice_init(&plug
->list
, &list
);
3576 list_sort(NULL
, &list
, plug_rq_cmp
);
3582 * Save and disable interrupts here, to avoid doing it for every
3583 * queue lock we have to take.
3585 local_irq_save(flags
);
3586 while (!list_empty(&list
)) {
3587 rq
= list_entry_rq(list
.next
);
3588 list_del_init(&rq
->queuelist
);
3592 * This drops the queue lock
3595 queue_unplugged(q
, depth
, from_schedule
);
3598 spin_lock(q
->queue_lock
);
3602 * Short-circuit if @q is dead
3604 if (unlikely(blk_queue_dying(q
))) {
3605 __blk_end_request_all(rq
, BLK_STS_IOERR
);
3610 * rq is already accounted, so use raw insert
3612 if (op_is_flush(rq
->cmd_flags
))
3613 __elv_add_request(q
, rq
, ELEVATOR_INSERT_FLUSH
);
3615 __elv_add_request(q
, rq
, ELEVATOR_INSERT_SORT_MERGE
);
3621 * This drops the queue lock
3624 queue_unplugged(q
, depth
, from_schedule
);
3626 local_irq_restore(flags
);
3629 void blk_finish_plug(struct blk_plug
*plug
)
3631 if (plug
!= current
->plug
)
3633 blk_flush_plug_list(plug
, false);
3635 current
->plug
= NULL
;
3637 EXPORT_SYMBOL(blk_finish_plug
);
3641 * blk_pm_runtime_init - Block layer runtime PM initialization routine
3642 * @q: the queue of the device
3643 * @dev: the device the queue belongs to
3646 * Initialize runtime-PM-related fields for @q and start auto suspend for
3647 * @dev. Drivers that want to take advantage of request-based runtime PM
3648 * should call this function after @dev has been initialized, and its
3649 * request queue @q has been allocated, and runtime PM for it can not happen
3650 * yet(either due to disabled/forbidden or its usage_count > 0). In most
3651 * cases, driver should call this function before any I/O has taken place.
3653 * This function takes care of setting up using auto suspend for the device,
3654 * the autosuspend delay is set to -1 to make runtime suspend impossible
3655 * until an updated value is either set by user or by driver. Drivers do
3656 * not need to touch other autosuspend settings.
3658 * The block layer runtime PM is request based, so only works for drivers
3659 * that use request as their IO unit instead of those directly use bio's.
3661 void blk_pm_runtime_init(struct request_queue
*q
, struct device
*dev
)
3663 /* Don't enable runtime PM for blk-mq until it is ready */
3665 pm_runtime_disable(dev
);
3670 q
->rpm_status
= RPM_ACTIVE
;
3671 pm_runtime_set_autosuspend_delay(q
->dev
, -1);
3672 pm_runtime_use_autosuspend(q
->dev
);
3674 EXPORT_SYMBOL(blk_pm_runtime_init
);
3677 * blk_pre_runtime_suspend - Pre runtime suspend check
3678 * @q: the queue of the device
3681 * This function will check if runtime suspend is allowed for the device
3682 * by examining if there are any requests pending in the queue. If there
3683 * are requests pending, the device can not be runtime suspended; otherwise,
3684 * the queue's status will be updated to SUSPENDING and the driver can
3685 * proceed to suspend the device.
3687 * For the not allowed case, we mark last busy for the device so that
3688 * runtime PM core will try to autosuspend it some time later.
3690 * This function should be called near the start of the device's
3691 * runtime_suspend callback.
3694 * 0 - OK to runtime suspend the device
3695 * -EBUSY - Device should not be runtime suspended
3697 int blk_pre_runtime_suspend(struct request_queue
*q
)
3704 spin_lock_irq(q
->queue_lock
);
3705 if (q
->nr_pending
) {
3707 pm_runtime_mark_last_busy(q
->dev
);
3709 q
->rpm_status
= RPM_SUSPENDING
;
3711 spin_unlock_irq(q
->queue_lock
);
3714 EXPORT_SYMBOL(blk_pre_runtime_suspend
);
3717 * blk_post_runtime_suspend - Post runtime suspend processing
3718 * @q: the queue of the device
3719 * @err: return value of the device's runtime_suspend function
3722 * Update the queue's runtime status according to the return value of the
3723 * device's runtime suspend function and mark last busy for the device so
3724 * that PM core will try to auto suspend the device at a later time.
3726 * This function should be called near the end of the device's
3727 * runtime_suspend callback.
3729 void blk_post_runtime_suspend(struct request_queue
*q
, int err
)
3734 spin_lock_irq(q
->queue_lock
);
3736 q
->rpm_status
= RPM_SUSPENDED
;
3738 q
->rpm_status
= RPM_ACTIVE
;
3739 pm_runtime_mark_last_busy(q
->dev
);
3741 spin_unlock_irq(q
->queue_lock
);
3743 EXPORT_SYMBOL(blk_post_runtime_suspend
);
3746 * blk_pre_runtime_resume - Pre runtime resume processing
3747 * @q: the queue of the device
3750 * Update the queue's runtime status to RESUMING in preparation for the
3751 * runtime resume of the device.
3753 * This function should be called near the start of the device's
3754 * runtime_resume callback.
3756 void blk_pre_runtime_resume(struct request_queue
*q
)
3761 spin_lock_irq(q
->queue_lock
);
3762 q
->rpm_status
= RPM_RESUMING
;
3763 spin_unlock_irq(q
->queue_lock
);
3765 EXPORT_SYMBOL(blk_pre_runtime_resume
);
3768 * blk_post_runtime_resume - Post runtime resume processing
3769 * @q: the queue of the device
3770 * @err: return value of the device's runtime_resume function
3773 * Update the queue's runtime status according to the return value of the
3774 * device's runtime_resume function. If it is successfully resumed, process
3775 * the requests that are queued into the device's queue when it is resuming
3776 * and then mark last busy and initiate autosuspend for it.
3778 * This function should be called near the end of the device's
3779 * runtime_resume callback.
3781 void blk_post_runtime_resume(struct request_queue
*q
, int err
)
3786 spin_lock_irq(q
->queue_lock
);
3788 q
->rpm_status
= RPM_ACTIVE
;
3790 pm_runtime_mark_last_busy(q
->dev
);
3791 pm_request_autosuspend(q
->dev
);
3793 q
->rpm_status
= RPM_SUSPENDED
;
3795 spin_unlock_irq(q
->queue_lock
);
3797 EXPORT_SYMBOL(blk_post_runtime_resume
);
3800 * blk_set_runtime_active - Force runtime status of the queue to be active
3801 * @q: the queue of the device
3803 * If the device is left runtime suspended during system suspend the resume
3804 * hook typically resumes the device and corrects runtime status
3805 * accordingly. However, that does not affect the queue runtime PM status
3806 * which is still "suspended". This prevents processing requests from the
3809 * This function can be used in driver's resume hook to correct queue
3810 * runtime PM status and re-enable peeking requests from the queue. It
3811 * should be called before first request is added to the queue.
3813 void blk_set_runtime_active(struct request_queue
*q
)
3815 spin_lock_irq(q
->queue_lock
);
3816 q
->rpm_status
= RPM_ACTIVE
;
3817 pm_runtime_mark_last_busy(q
->dev
);
3818 pm_request_autosuspend(q
->dev
);
3819 spin_unlock_irq(q
->queue_lock
);
3821 EXPORT_SYMBOL(blk_set_runtime_active
);
3824 int __init
blk_dev_init(void)
3826 BUILD_BUG_ON(REQ_OP_LAST
>= (1 << REQ_OP_BITS
));
3827 BUILD_BUG_ON(REQ_OP_BITS
+ REQ_FLAG_BITS
> 8 *
3828 FIELD_SIZEOF(struct request
, cmd_flags
));
3829 BUILD_BUG_ON(REQ_OP_BITS
+ REQ_FLAG_BITS
> 8 *
3830 FIELD_SIZEOF(struct bio
, bi_opf
));
3832 /* used for unplugging and affects IO latency/throughput - HIGHPRI */
3833 kblockd_workqueue
= alloc_workqueue("kblockd",
3834 WQ_MEM_RECLAIM
| WQ_HIGHPRI
, 0);
3835 if (!kblockd_workqueue
)
3836 panic("Failed to create kblockd\n");
3838 request_cachep
= kmem_cache_create("blkdev_requests",
3839 sizeof(struct request
), 0, SLAB_PANIC
, NULL
);
3841 blk_requestq_cachep
= kmem_cache_create("request_queue",
3842 sizeof(struct request_queue
), 0, SLAB_PANIC
, NULL
);
3844 #ifdef CONFIG_DEBUG_FS
3845 blk_debugfs_root
= debugfs_create_dir("block", NULL
);