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/highmem.h>
21 #include <linux/kernel_stat.h>
22 #include <linux/string.h>
23 #include <linux/init.h>
24 #include <linux/completion.h>
25 #include <linux/slab.h>
26 #include <linux/swap.h>
27 #include <linux/writeback.h>
28 #include <linux/task_io_accounting_ops.h>
29 #include <linux/fault-inject.h>
30 #include <linux/list_sort.h>
32 #define CREATE_TRACE_POINTS
33 #include <trace/events/block.h>
37 EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_remap);
38 EXPORT_TRACEPOINT_SYMBOL_GPL(block_rq_remap);
39 EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_complete);
41 static int __make_request(struct request_queue *q, struct bio *bio);
44 * For the allocated request tables
46 static struct kmem_cache *request_cachep;
49 * For queue allocation
51 struct kmem_cache *blk_requestq_cachep;
54 * Controlling structure to kblockd
56 static struct workqueue_struct *kblockd_workqueue;
58 static void drive_stat_acct(struct request *rq, int new_io)
60 struct hd_struct *part;
61 int rw = rq_data_dir(rq);
64 if (!blk_do_io_stat(rq))
67 cpu = part_stat_lock();
71 part_stat_inc(cpu, part, merges[rw]);
73 part = disk_map_sector_rcu(rq->rq_disk, blk_rq_pos(rq));
74 if (!hd_struct_try_get(part)) {
76 * The partition is already being removed,
77 * the request will be accounted on the disk only
79 * We take a reference on disk->part0 although that
80 * partition will never be deleted, so we can treat
81 * it as any other partition.
83 part = &rq->rq_disk->part0;
86 part_round_stats(cpu, part);
87 part_inc_in_flight(part, rw);
94 void blk_queue_congestion_threshold(struct request_queue *q)
98 nr = q->nr_requests - (q->nr_requests / 8) + 1;
99 if (nr > q->nr_requests)
101 q->nr_congestion_on = nr;
103 nr = q->nr_requests - (q->nr_requests / 8) - (q->nr_requests / 16) - 1;
106 q->nr_congestion_off = nr;
110 * blk_get_backing_dev_info - get the address of a queue's backing_dev_info
113 * Locates the passed device's request queue and returns the address of its
116 * Will return NULL if the request queue cannot be located.
118 struct backing_dev_info *blk_get_backing_dev_info(struct block_device *bdev)
120 struct backing_dev_info *ret = NULL;
121 struct request_queue *q = bdev_get_queue(bdev);
124 ret = &q->backing_dev_info;
127 EXPORT_SYMBOL(blk_get_backing_dev_info);
129 void blk_rq_init(struct request_queue *q, struct request *rq)
131 memset(rq, 0, sizeof(*rq));
133 INIT_LIST_HEAD(&rq->queuelist);
134 INIT_LIST_HEAD(&rq->timeout_list);
137 rq->__sector = (sector_t) -1;
138 INIT_HLIST_NODE(&rq->hash);
139 RB_CLEAR_NODE(&rq->rb_node);
141 rq->cmd_len = BLK_MAX_CDB;
144 rq->start_time = jiffies;
145 set_start_time_ns(rq);
148 EXPORT_SYMBOL(blk_rq_init);
150 static void req_bio_endio(struct request *rq, struct bio *bio,
151 unsigned int nbytes, int error)
154 clear_bit(BIO_UPTODATE, &bio->bi_flags);
155 else if (!test_bit(BIO_UPTODATE, &bio->bi_flags))
158 if (unlikely(nbytes > bio->bi_size)) {
159 printk(KERN_ERR "%s: want %u bytes done, %u left\n",
160 __func__, nbytes, bio->bi_size);
161 nbytes = bio->bi_size;
164 if (unlikely(rq->cmd_flags & REQ_QUIET))
165 set_bit(BIO_QUIET, &bio->bi_flags);
167 bio->bi_size -= nbytes;
168 bio->bi_sector += (nbytes >> 9);
170 if (bio_integrity(bio))
171 bio_integrity_advance(bio, nbytes);
173 /* don't actually finish bio if it's part of flush sequence */
174 if (bio->bi_size == 0 && !(rq->cmd_flags & REQ_FLUSH_SEQ))
175 bio_endio(bio, error);
178 void blk_dump_rq_flags(struct request *rq, char *msg)
182 printk(KERN_INFO "%s: dev %s: type=%x, flags=%x\n", msg,
183 rq->rq_disk ? rq->rq_disk->disk_name : "?", rq->cmd_type,
186 printk(KERN_INFO " sector %llu, nr/cnr %u/%u\n",
187 (unsigned long long)blk_rq_pos(rq),
188 blk_rq_sectors(rq), blk_rq_cur_sectors(rq));
189 printk(KERN_INFO " bio %p, biotail %p, buffer %p, len %u\n",
190 rq->bio, rq->biotail, rq->buffer, blk_rq_bytes(rq));
192 if (rq->cmd_type == REQ_TYPE_BLOCK_PC) {
193 printk(KERN_INFO " cdb: ");
194 for (bit = 0; bit < BLK_MAX_CDB; bit++)
195 printk("%02x ", rq->cmd[bit]);
199 EXPORT_SYMBOL(blk_dump_rq_flags);
201 static void blk_delay_work(struct work_struct *work)
203 struct request_queue *q;
205 q = container_of(work, struct request_queue, delay_work.work);
206 spin_lock_irq(q->queue_lock);
208 spin_unlock_irq(q->queue_lock);
212 * blk_delay_queue - restart queueing after defined interval
213 * @q: The &struct request_queue in question
214 * @msecs: Delay in msecs
217 * Sometimes queueing needs to be postponed for a little while, to allow
218 * resources to come back. This function will make sure that queueing is
219 * restarted around the specified time.
221 void blk_delay_queue(struct request_queue *q, unsigned long msecs)
223 queue_delayed_work(kblockd_workqueue, &q->delay_work,
224 msecs_to_jiffies(msecs));
226 EXPORT_SYMBOL(blk_delay_queue);
229 * blk_start_queue - restart a previously stopped queue
230 * @q: The &struct request_queue in question
233 * blk_start_queue() will clear the stop flag on the queue, and call
234 * the request_fn for the queue if it was in a stopped state when
235 * entered. Also see blk_stop_queue(). Queue lock must be held.
237 void blk_start_queue(struct request_queue *q)
239 WARN_ON(!irqs_disabled());
241 queue_flag_clear(QUEUE_FLAG_STOPPED, q);
244 EXPORT_SYMBOL(blk_start_queue);
247 * blk_stop_queue - stop a queue
248 * @q: The &struct request_queue in question
251 * The Linux block layer assumes that a block driver will consume all
252 * entries on the request queue when the request_fn strategy is called.
253 * Often this will not happen, because of hardware limitations (queue
254 * depth settings). If a device driver gets a 'queue full' response,
255 * or if it simply chooses not to queue more I/O at one point, it can
256 * call this function to prevent the request_fn from being called until
257 * the driver has signalled it's ready to go again. This happens by calling
258 * blk_start_queue() to restart queue operations. Queue lock must be held.
260 void blk_stop_queue(struct request_queue *q)
262 __cancel_delayed_work(&q->delay_work);
263 queue_flag_set(QUEUE_FLAG_STOPPED, q);
265 EXPORT_SYMBOL(blk_stop_queue);
268 * blk_sync_queue - cancel any pending callbacks on a queue
272 * The block layer may perform asynchronous callback activity
273 * on a queue, such as calling the unplug function after a timeout.
274 * A block device may call blk_sync_queue to ensure that any
275 * such activity is cancelled, thus allowing it to release resources
276 * that the callbacks might use. The caller must already have made sure
277 * that its ->make_request_fn will not re-add plugging prior to calling
280 * This function does not cancel any asynchronous activity arising
281 * out of elevator or throttling code. That would require elevaotor_exit()
282 * and blk_throtl_exit() to be called with queue lock initialized.
285 void blk_sync_queue(struct request_queue *q)
287 del_timer_sync(&q->timeout);
288 cancel_delayed_work_sync(&q->delay_work);
290 EXPORT_SYMBOL(blk_sync_queue);
293 * __blk_run_queue - run a single device queue
294 * @q: The queue to run
295 * @force_kblockd: Don't run @q->request_fn directly. Use kblockd.
298 * See @blk_run_queue. This variant must be called with the queue lock
299 * held and interrupts disabled.
301 void __blk_run_queue(struct request_queue *q)
303 if (unlikely(blk_queue_stopped(q)))
308 EXPORT_SYMBOL(__blk_run_queue);
311 * blk_run_queue_async - run a single device queue in workqueue context
312 * @q: The queue to run
315 * Tells kblockd to perform the equivalent of @blk_run_queue on behalf
318 void blk_run_queue_async(struct request_queue *q)
320 if (likely(!blk_queue_stopped(q)))
321 queue_delayed_work(kblockd_workqueue, &q->delay_work, 0);
323 EXPORT_SYMBOL(blk_run_queue_async);
326 * blk_run_queue - run a single device queue
327 * @q: The queue to run
330 * Invoke request handling on this queue, if it has pending work to do.
331 * May be used to restart queueing when a request has completed.
333 void blk_run_queue(struct request_queue *q)
337 spin_lock_irqsave(q->queue_lock, flags);
339 spin_unlock_irqrestore(q->queue_lock, flags);
341 EXPORT_SYMBOL(blk_run_queue);
343 void blk_put_queue(struct request_queue *q)
345 kobject_put(&q->kobj);
349 * Note: If a driver supplied the queue lock, it should not zap that lock
350 * unexpectedly as some queue cleanup components like elevator_exit() and
351 * blk_throtl_exit() need queue lock.
353 void blk_cleanup_queue(struct request_queue *q)
356 * We know we have process context here, so we can be a little
357 * cautious and ensure that pending block actions on this device
358 * are done before moving on. Going into this function, we should
359 * not have processes doing IO to this device.
363 del_timer_sync(&q->backing_dev_info.laptop_mode_wb_timer);
364 mutex_lock(&q->sysfs_lock);
365 queue_flag_set_unlocked(QUEUE_FLAG_DEAD, q);
366 mutex_unlock(&q->sysfs_lock);
369 elevator_exit(q->elevator);
375 EXPORT_SYMBOL(blk_cleanup_queue);
377 static int blk_init_free_list(struct request_queue *q)
379 struct request_list *rl = &q->rq;
381 if (unlikely(rl->rq_pool))
384 rl->count[BLK_RW_SYNC] = rl->count[BLK_RW_ASYNC] = 0;
385 rl->starved[BLK_RW_SYNC] = rl->starved[BLK_RW_ASYNC] = 0;
387 init_waitqueue_head(&rl->wait[BLK_RW_SYNC]);
388 init_waitqueue_head(&rl->wait[BLK_RW_ASYNC]);
390 rl->rq_pool = mempool_create_node(BLKDEV_MIN_RQ, mempool_alloc_slab,
391 mempool_free_slab, request_cachep, q->node);
399 struct request_queue *blk_alloc_queue(gfp_t gfp_mask)
401 return blk_alloc_queue_node(gfp_mask, -1);
403 EXPORT_SYMBOL(blk_alloc_queue);
405 struct request_queue *blk_alloc_queue_node(gfp_t gfp_mask, int node_id)
407 struct request_queue *q;
410 q = kmem_cache_alloc_node(blk_requestq_cachep,
411 gfp_mask | __GFP_ZERO, node_id);
415 q->backing_dev_info.ra_pages =
416 (VM_MAX_READAHEAD * 1024) / PAGE_CACHE_SIZE;
417 q->backing_dev_info.state = 0;
418 q->backing_dev_info.capabilities = BDI_CAP_MAP_COPY;
419 q->backing_dev_info.name = "block";
421 err = bdi_init(&q->backing_dev_info);
423 kmem_cache_free(blk_requestq_cachep, q);
427 if (blk_throtl_init(q)) {
428 kmem_cache_free(blk_requestq_cachep, q);
432 setup_timer(&q->backing_dev_info.laptop_mode_wb_timer,
433 laptop_mode_timer_fn, (unsigned long) q);
434 setup_timer(&q->timeout, blk_rq_timed_out_timer, (unsigned long) q);
435 INIT_LIST_HEAD(&q->timeout_list);
436 INIT_LIST_HEAD(&q->flush_queue[0]);
437 INIT_LIST_HEAD(&q->flush_queue[1]);
438 INIT_LIST_HEAD(&q->flush_data_in_flight);
439 INIT_DELAYED_WORK(&q->delay_work, blk_delay_work);
441 kobject_init(&q->kobj, &blk_queue_ktype);
443 mutex_init(&q->sysfs_lock);
444 spin_lock_init(&q->__queue_lock);
447 * By default initialize queue_lock to internal lock and driver can
448 * override it later if need be.
450 q->queue_lock = &q->__queue_lock;
454 EXPORT_SYMBOL(blk_alloc_queue_node);
457 * blk_init_queue - prepare a request queue for use with a block device
458 * @rfn: The function to be called to process requests that have been
459 * placed on the queue.
460 * @lock: Request queue spin lock
463 * If a block device wishes to use the standard request handling procedures,
464 * which sorts requests and coalesces adjacent requests, then it must
465 * call blk_init_queue(). The function @rfn will be called when there
466 * are requests on the queue that need to be processed. If the device
467 * supports plugging, then @rfn may not be called immediately when requests
468 * are available on the queue, but may be called at some time later instead.
469 * Plugged queues are generally unplugged when a buffer belonging to one
470 * of the requests on the queue is needed, or due to memory pressure.
472 * @rfn is not required, or even expected, to remove all requests off the
473 * queue, but only as many as it can handle at a time. If it does leave
474 * requests on the queue, it is responsible for arranging that the requests
475 * get dealt with eventually.
477 * The queue spin lock must be held while manipulating the requests on the
478 * request queue; this lock will be taken also from interrupt context, so irq
479 * disabling is needed for it.
481 * Function returns a pointer to the initialized request queue, or %NULL if
485 * blk_init_queue() must be paired with a blk_cleanup_queue() call
486 * when the block device is deactivated (such as at module unload).
489 struct request_queue *blk_init_queue(request_fn_proc *rfn, spinlock_t *lock)
491 return blk_init_queue_node(rfn, lock, -1);
493 EXPORT_SYMBOL(blk_init_queue);
495 struct request_queue *
496 blk_init_queue_node(request_fn_proc *rfn, spinlock_t *lock, int node_id)
498 struct request_queue *uninit_q, *q;
500 uninit_q = blk_alloc_queue_node(GFP_KERNEL, node_id);
504 q = blk_init_allocated_queue_node(uninit_q, rfn, lock, node_id);
506 blk_cleanup_queue(uninit_q);
510 EXPORT_SYMBOL(blk_init_queue_node);
512 struct request_queue *
513 blk_init_allocated_queue(struct request_queue *q, request_fn_proc *rfn,
516 return blk_init_allocated_queue_node(q, rfn, lock, -1);
518 EXPORT_SYMBOL(blk_init_allocated_queue);
520 struct request_queue *
521 blk_init_allocated_queue_node(struct request_queue *q, request_fn_proc *rfn,
522 spinlock_t *lock, int node_id)
528 if (blk_init_free_list(q))
532 q->prep_rq_fn = NULL;
533 q->unprep_rq_fn = NULL;
534 q->queue_flags = QUEUE_FLAG_DEFAULT;
536 /* Override internal queue lock with supplied lock pointer */
538 q->queue_lock = lock;
541 * This also sets hw/phys segments, boundary and size
543 blk_queue_make_request(q, __make_request);
545 q->sg_reserved_size = INT_MAX;
550 if (!elevator_init(q, NULL)) {
551 blk_queue_congestion_threshold(q);
557 EXPORT_SYMBOL(blk_init_allocated_queue_node);
559 int blk_get_queue(struct request_queue *q)
561 if (likely(!test_bit(QUEUE_FLAG_DEAD, &q->queue_flags))) {
562 kobject_get(&q->kobj);
569 static inline void blk_free_request(struct request_queue *q, struct request *rq)
571 BUG_ON(rq->cmd_flags & REQ_ON_PLUG);
573 if (rq->cmd_flags & REQ_ELVPRIV)
574 elv_put_request(q, rq);
575 mempool_free(rq, q->rq.rq_pool);
578 static struct request *
579 blk_alloc_request(struct request_queue *q, int flags, int priv, gfp_t gfp_mask)
581 struct request *rq = mempool_alloc(q->rq.rq_pool, gfp_mask);
588 rq->cmd_flags = flags | REQ_ALLOCED;
591 if (unlikely(elv_set_request(q, rq, gfp_mask))) {
592 mempool_free(rq, q->rq.rq_pool);
595 rq->cmd_flags |= REQ_ELVPRIV;
602 * ioc_batching returns true if the ioc is a valid batching request and
603 * should be given priority access to a request.
605 static inline int ioc_batching(struct request_queue *q, struct io_context *ioc)
611 * Make sure the process is able to allocate at least 1 request
612 * even if the batch times out, otherwise we could theoretically
615 return ioc->nr_batch_requests == q->nr_batching ||
616 (ioc->nr_batch_requests > 0
617 && time_before(jiffies, ioc->last_waited + BLK_BATCH_TIME));
621 * ioc_set_batching sets ioc to be a new "batcher" if it is not one. This
622 * will cause the process to be a "batcher" on all queues in the system. This
623 * is the behaviour we want though - once it gets a wakeup it should be given
626 static void ioc_set_batching(struct request_queue *q, struct io_context *ioc)
628 if (!ioc || ioc_batching(q, ioc))
631 ioc->nr_batch_requests = q->nr_batching;
632 ioc->last_waited = jiffies;
635 static void __freed_request(struct request_queue *q, int sync)
637 struct request_list *rl = &q->rq;
639 if (rl->count[sync] < queue_congestion_off_threshold(q))
640 blk_clear_queue_congested(q, sync);
642 if (rl->count[sync] + 1 <= q->nr_requests) {
643 if (waitqueue_active(&rl->wait[sync]))
644 wake_up(&rl->wait[sync]);
646 blk_clear_queue_full(q, sync);
651 * A request has just been released. Account for it, update the full and
652 * congestion status, wake up any waiters. Called under q->queue_lock.
654 static void freed_request(struct request_queue *q, int sync, int priv)
656 struct request_list *rl = &q->rq;
662 __freed_request(q, sync);
664 if (unlikely(rl->starved[sync ^ 1]))
665 __freed_request(q, sync ^ 1);
669 * Determine if elevator data should be initialized when allocating the
670 * request associated with @bio.
672 static bool blk_rq_should_init_elevator(struct bio *bio)
678 * Flush requests do not use the elevator so skip initialization.
679 * This allows a request to share the flush and elevator data.
681 if (bio->bi_rw & (REQ_FLUSH | REQ_FUA))
688 * Get a free request, queue_lock must be held.
689 * Returns NULL on failure, with queue_lock held.
690 * Returns !NULL on success, with queue_lock *not held*.
692 static struct request *get_request(struct request_queue *q, int rw_flags,
693 struct bio *bio, gfp_t gfp_mask)
695 struct request *rq = NULL;
696 struct request_list *rl = &q->rq;
697 struct io_context *ioc = NULL;
698 const bool is_sync = rw_is_sync(rw_flags) != 0;
699 int may_queue, priv = 0;
701 may_queue = elv_may_queue(q, rw_flags);
702 if (may_queue == ELV_MQUEUE_NO)
705 if (rl->count[is_sync]+1 >= queue_congestion_on_threshold(q)) {
706 if (rl->count[is_sync]+1 >= q->nr_requests) {
707 ioc = current_io_context(GFP_ATOMIC, q->node);
709 * The queue will fill after this allocation, so set
710 * it as full, and mark this process as "batching".
711 * This process will be allowed to complete a batch of
712 * requests, others will be blocked.
714 if (!blk_queue_full(q, is_sync)) {
715 ioc_set_batching(q, ioc);
716 blk_set_queue_full(q, is_sync);
718 if (may_queue != ELV_MQUEUE_MUST
719 && !ioc_batching(q, ioc)) {
721 * The queue is full and the allocating
722 * process is not a "batcher", and not
723 * exempted by the IO scheduler
729 blk_set_queue_congested(q, is_sync);
733 * Only allow batching queuers to allocate up to 50% over the defined
734 * limit of requests, otherwise we could have thousands of requests
735 * allocated with any setting of ->nr_requests
737 if (rl->count[is_sync] >= (3 * q->nr_requests / 2))
740 rl->count[is_sync]++;
741 rl->starved[is_sync] = 0;
743 if (blk_rq_should_init_elevator(bio)) {
744 priv = !test_bit(QUEUE_FLAG_ELVSWITCH, &q->queue_flags);
749 if (blk_queue_io_stat(q))
750 rw_flags |= REQ_IO_STAT;
751 spin_unlock_irq(q->queue_lock);
753 rq = blk_alloc_request(q, rw_flags, priv, gfp_mask);
756 * Allocation failed presumably due to memory. Undo anything
757 * we might have messed up.
759 * Allocating task should really be put onto the front of the
760 * wait queue, but this is pretty rare.
762 spin_lock_irq(q->queue_lock);
763 freed_request(q, is_sync, priv);
766 * in the very unlikely event that allocation failed and no
767 * requests for this direction was pending, mark us starved
768 * so that freeing of a request in the other direction will
769 * notice us. another possible fix would be to split the
770 * rq mempool into READ and WRITE
773 if (unlikely(rl->count[is_sync] == 0))
774 rl->starved[is_sync] = 1;
780 * ioc may be NULL here, and ioc_batching will be false. That's
781 * OK, if the queue is under the request limit then requests need
782 * not count toward the nr_batch_requests limit. There will always
783 * be some limit enforced by BLK_BATCH_TIME.
785 if (ioc_batching(q, ioc))
786 ioc->nr_batch_requests--;
788 trace_block_getrq(q, bio, rw_flags & 1);
794 * No available requests for this queue, wait for some requests to become
797 * Called with q->queue_lock held, and returns with it unlocked.
799 static struct request *get_request_wait(struct request_queue *q, int rw_flags,
802 const bool is_sync = rw_is_sync(rw_flags) != 0;
805 rq = get_request(q, rw_flags, bio, GFP_NOIO);
808 struct io_context *ioc;
809 struct request_list *rl = &q->rq;
811 prepare_to_wait_exclusive(&rl->wait[is_sync], &wait,
812 TASK_UNINTERRUPTIBLE);
814 trace_block_sleeprq(q, bio, rw_flags & 1);
816 spin_unlock_irq(q->queue_lock);
820 * After sleeping, we become a "batching" process and
821 * will be able to allocate at least one request, and
822 * up to a big batch of them for a small period time.
823 * See ioc_batching, ioc_set_batching
825 ioc = current_io_context(GFP_NOIO, q->node);
826 ioc_set_batching(q, ioc);
828 spin_lock_irq(q->queue_lock);
829 finish_wait(&rl->wait[is_sync], &wait);
831 rq = get_request(q, rw_flags, bio, GFP_NOIO);
837 struct request *blk_get_request(struct request_queue *q, int rw, gfp_t gfp_mask)
841 BUG_ON(rw != READ && rw != WRITE);
843 spin_lock_irq(q->queue_lock);
844 if (gfp_mask & __GFP_WAIT) {
845 rq = get_request_wait(q, rw, NULL);
847 rq = get_request(q, rw, NULL, gfp_mask);
849 spin_unlock_irq(q->queue_lock);
851 /* q->queue_lock is unlocked at this point */
855 EXPORT_SYMBOL(blk_get_request);
858 * blk_make_request - given a bio, allocate a corresponding struct request.
859 * @q: target request queue
860 * @bio: The bio describing the memory mappings that will be submitted for IO.
861 * It may be a chained-bio properly constructed by block/bio layer.
862 * @gfp_mask: gfp flags to be used for memory allocation
864 * blk_make_request is the parallel of generic_make_request for BLOCK_PC
865 * type commands. Where the struct request needs to be farther initialized by
866 * the caller. It is passed a &struct bio, which describes the memory info of
869 * The caller of blk_make_request must make sure that bi_io_vec
870 * are set to describe the memory buffers. That bio_data_dir() will return
871 * the needed direction of the request. (And all bio's in the passed bio-chain
872 * are properly set accordingly)
874 * If called under none-sleepable conditions, mapped bio buffers must not
875 * need bouncing, by calling the appropriate masked or flagged allocator,
876 * suitable for the target device. Otherwise the call to blk_queue_bounce will
879 * WARNING: When allocating/cloning a bio-chain, careful consideration should be
880 * given to how you allocate bios. In particular, you cannot use __GFP_WAIT for
881 * anything but the first bio in the chain. Otherwise you risk waiting for IO
882 * completion of a bio that hasn't been submitted yet, thus resulting in a
883 * deadlock. Alternatively bios should be allocated using bio_kmalloc() instead
884 * of bio_alloc(), as that avoids the mempool deadlock.
885 * If possible a big IO should be split into smaller parts when allocation
886 * fails. Partial allocation should not be an error, or you risk a live-lock.
888 struct request *blk_make_request(struct request_queue *q, struct bio *bio,
891 struct request *rq = blk_get_request(q, bio_data_dir(bio), gfp_mask);
894 return ERR_PTR(-ENOMEM);
897 struct bio *bounce_bio = bio;
900 blk_queue_bounce(q, &bounce_bio);
901 ret = blk_rq_append_bio(q, rq, bounce_bio);
910 EXPORT_SYMBOL(blk_make_request);
913 * blk_requeue_request - put a request back on queue
914 * @q: request queue where request should be inserted
915 * @rq: request to be inserted
918 * Drivers often keep queueing requests until the hardware cannot accept
919 * more, when that condition happens we need to put the request back
920 * on the queue. Must be called with queue lock held.
922 void blk_requeue_request(struct request_queue *q, struct request *rq)
924 blk_delete_timer(rq);
925 blk_clear_rq_complete(rq);
926 trace_block_rq_requeue(q, rq);
928 if (blk_rq_tagged(rq))
929 blk_queue_end_tag(q, rq);
931 BUG_ON(blk_queued_rq(rq));
933 elv_requeue_request(q, rq);
935 EXPORT_SYMBOL(blk_requeue_request);
937 static void add_acct_request(struct request_queue *q, struct request *rq,
940 drive_stat_acct(rq, 1);
941 __elv_add_request(q, rq, where);
945 * blk_insert_request - insert a special request into a request queue
946 * @q: request queue where request should be inserted
947 * @rq: request to be inserted
948 * @at_head: insert request at head or tail of queue
949 * @data: private data
952 * Many block devices need to execute commands asynchronously, so they don't
953 * block the whole kernel from preemption during request execution. This is
954 * accomplished normally by inserting aritficial requests tagged as
955 * REQ_TYPE_SPECIAL in to the corresponding request queue, and letting them
956 * be scheduled for actual execution by the request queue.
958 * We have the option of inserting the head or the tail of the queue.
959 * Typically we use the tail for new ioctls and so forth. We use the head
960 * of the queue for things like a QUEUE_FULL message from a device, or a
961 * host that is unable to accept a particular command.
963 void blk_insert_request(struct request_queue *q, struct request *rq,
964 int at_head, void *data)
966 int where = at_head ? ELEVATOR_INSERT_FRONT : ELEVATOR_INSERT_BACK;
970 * tell I/O scheduler that this isn't a regular read/write (ie it
971 * must not attempt merges on this) and that it acts as a soft
974 rq->cmd_type = REQ_TYPE_SPECIAL;
978 spin_lock_irqsave(q->queue_lock, flags);
981 * If command is tagged, release the tag
983 if (blk_rq_tagged(rq))
984 blk_queue_end_tag(q, rq);
986 add_acct_request(q, rq, where);
988 spin_unlock_irqrestore(q->queue_lock, flags);
990 EXPORT_SYMBOL(blk_insert_request);
992 static void part_round_stats_single(int cpu, struct hd_struct *part,
995 if (now == part->stamp)
998 if (part_in_flight(part)) {
999 __part_stat_add(cpu, part, time_in_queue,
1000 part_in_flight(part) * (now - part->stamp));
1001 __part_stat_add(cpu, part, io_ticks, (now - part->stamp));
1007 * part_round_stats() - Round off the performance stats on a struct disk_stats.
1008 * @cpu: cpu number for stats access
1009 * @part: target partition
1011 * The average IO queue length and utilisation statistics are maintained
1012 * by observing the current state of the queue length and the amount of
1013 * time it has been in this state for.
1015 * Normally, that accounting is done on IO completion, but that can result
1016 * in more than a second's worth of IO being accounted for within any one
1017 * second, leading to >100% utilisation. To deal with that, we call this
1018 * function to do a round-off before returning the results when reading
1019 * /proc/diskstats. This accounts immediately for all queue usage up to
1020 * the current jiffies and restarts the counters again.
1022 void part_round_stats(int cpu, struct hd_struct *part)
1024 unsigned long now = jiffies;
1027 part_round_stats_single(cpu, &part_to_disk(part)->part0, now);
1028 part_round_stats_single(cpu, part, now);
1030 EXPORT_SYMBOL_GPL(part_round_stats);
1033 * queue lock must be held
1035 void __blk_put_request(struct request_queue *q, struct request *req)
1039 if (unlikely(--req->ref_count))
1042 elv_completed_request(q, req);
1044 /* this is a bio leak */
1045 WARN_ON(req->bio != NULL);
1048 * Request may not have originated from ll_rw_blk. if not,
1049 * it didn't come out of our reserved rq pools
1051 if (req->cmd_flags & REQ_ALLOCED) {
1052 int is_sync = rq_is_sync(req) != 0;
1053 int priv = req->cmd_flags & REQ_ELVPRIV;
1055 BUG_ON(!list_empty(&req->queuelist));
1056 BUG_ON(!hlist_unhashed(&req->hash));
1058 blk_free_request(q, req);
1059 freed_request(q, is_sync, priv);
1062 EXPORT_SYMBOL_GPL(__blk_put_request);
1064 void blk_put_request(struct request *req)
1066 unsigned long flags;
1067 struct request_queue *q = req->q;
1069 spin_lock_irqsave(q->queue_lock, flags);
1070 __blk_put_request(q, req);
1071 spin_unlock_irqrestore(q->queue_lock, flags);
1073 EXPORT_SYMBOL(blk_put_request);
1076 * blk_add_request_payload - add a payload to a request
1077 * @rq: request to update
1078 * @page: page backing the payload
1079 * @len: length of the payload.
1081 * This allows to later add a payload to an already submitted request by
1082 * a block driver. The driver needs to take care of freeing the payload
1085 * Note that this is a quite horrible hack and nothing but handling of
1086 * discard requests should ever use it.
1088 void blk_add_request_payload(struct request *rq, struct page *page,
1091 struct bio *bio = rq->bio;
1093 bio->bi_io_vec->bv_page = page;
1094 bio->bi_io_vec->bv_offset = 0;
1095 bio->bi_io_vec->bv_len = len;
1099 bio->bi_phys_segments = 1;
1101 rq->__data_len = rq->resid_len = len;
1102 rq->nr_phys_segments = 1;
1103 rq->buffer = bio_data(bio);
1105 EXPORT_SYMBOL_GPL(blk_add_request_payload);
1107 static bool bio_attempt_back_merge(struct request_queue *q, struct request *req,
1110 const int ff = bio->bi_rw & REQ_FAILFAST_MASK;
1113 * Debug stuff, kill later
1115 if (!rq_mergeable(req)) {
1116 blk_dump_rq_flags(req, "back");
1120 if (!ll_back_merge_fn(q, req, bio))
1123 trace_block_bio_backmerge(q, bio);
1125 if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff)
1126 blk_rq_set_mixed_merge(req);
1128 req->biotail->bi_next = bio;
1130 req->__data_len += bio->bi_size;
1131 req->ioprio = ioprio_best(req->ioprio, bio_prio(bio));
1133 drive_stat_acct(req, 0);
1137 static bool bio_attempt_front_merge(struct request_queue *q,
1138 struct request *req, struct bio *bio)
1140 const int ff = bio->bi_rw & REQ_FAILFAST_MASK;
1144 * Debug stuff, kill later
1146 if (!rq_mergeable(req)) {
1147 blk_dump_rq_flags(req, "front");
1151 if (!ll_front_merge_fn(q, req, bio))
1154 trace_block_bio_frontmerge(q, bio);
1156 if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff)
1157 blk_rq_set_mixed_merge(req);
1159 sector = bio->bi_sector;
1161 bio->bi_next = req->bio;
1165 * may not be valid. if the low level driver said
1166 * it didn't need a bounce buffer then it better
1167 * not touch req->buffer either...
1169 req->buffer = bio_data(bio);
1170 req->__sector = bio->bi_sector;
1171 req->__data_len += bio->bi_size;
1172 req->ioprio = ioprio_best(req->ioprio, bio_prio(bio));
1174 drive_stat_acct(req, 0);
1179 * Attempts to merge with the plugged list in the current process. Returns
1180 * true if merge was successful, otherwise false.
1182 static bool attempt_plug_merge(struct task_struct *tsk, struct request_queue *q,
1185 struct blk_plug *plug;
1193 list_for_each_entry_reverse(rq, &plug->list, queuelist) {
1199 el_ret = elv_try_merge(rq, bio);
1200 if (el_ret == ELEVATOR_BACK_MERGE) {
1201 ret = bio_attempt_back_merge(q, rq, bio);
1204 } else if (el_ret == ELEVATOR_FRONT_MERGE) {
1205 ret = bio_attempt_front_merge(q, rq, bio);
1214 void init_request_from_bio(struct request *req, struct bio *bio)
1216 req->cpu = bio->bi_comp_cpu;
1217 req->cmd_type = REQ_TYPE_FS;
1219 req->cmd_flags |= bio->bi_rw & REQ_COMMON_MASK;
1220 if (bio->bi_rw & REQ_RAHEAD)
1221 req->cmd_flags |= REQ_FAILFAST_MASK;
1224 req->__sector = bio->bi_sector;
1225 req->ioprio = bio_prio(bio);
1226 blk_rq_bio_prep(req->q, req, bio);
1229 static int __make_request(struct request_queue *q, struct bio *bio)
1231 const bool sync = !!(bio->bi_rw & REQ_SYNC);
1232 struct blk_plug *plug;
1233 int el_ret, rw_flags, where = ELEVATOR_INSERT_SORT;
1234 struct request *req;
1237 * low level driver can indicate that it wants pages above a
1238 * certain limit bounced to low memory (ie for highmem, or even
1239 * ISA dma in theory)
1241 blk_queue_bounce(q, &bio);
1243 if (bio->bi_rw & (REQ_FLUSH | REQ_FUA)) {
1244 spin_lock_irq(q->queue_lock);
1245 where = ELEVATOR_INSERT_FLUSH;
1250 * Check if we can merge with the plugged list before grabbing
1253 if (attempt_plug_merge(current, q, bio))
1256 spin_lock_irq(q->queue_lock);
1258 el_ret = elv_merge(q, &req, bio);
1259 if (el_ret == ELEVATOR_BACK_MERGE) {
1260 BUG_ON(req->cmd_flags & REQ_ON_PLUG);
1261 if (bio_attempt_back_merge(q, req, bio)) {
1262 if (!attempt_back_merge(q, req))
1263 elv_merged_request(q, req, el_ret);
1266 } else if (el_ret == ELEVATOR_FRONT_MERGE) {
1267 BUG_ON(req->cmd_flags & REQ_ON_PLUG);
1268 if (bio_attempt_front_merge(q, req, bio)) {
1269 if (!attempt_front_merge(q, req))
1270 elv_merged_request(q, req, el_ret);
1277 * This sync check and mask will be re-done in init_request_from_bio(),
1278 * but we need to set it earlier to expose the sync flag to the
1279 * rq allocator and io schedulers.
1281 rw_flags = bio_data_dir(bio);
1283 rw_flags |= REQ_SYNC;
1286 * Grab a free request. This is might sleep but can not fail.
1287 * Returns with the queue unlocked.
1289 req = get_request_wait(q, rw_flags, bio);
1292 * After dropping the lock and possibly sleeping here, our request
1293 * may now be mergeable after it had proven unmergeable (above).
1294 * We don't worry about that case for efficiency. It won't happen
1295 * often, and the elevators are able to handle it.
1297 init_request_from_bio(req, bio);
1299 if (test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags) ||
1300 bio_flagged(bio, BIO_CPU_AFFINE)) {
1301 req->cpu = blk_cpu_to_group(get_cpu());
1305 plug = current->plug;
1308 * If this is the first request added after a plug, fire
1309 * of a plug trace. If others have been added before, check
1310 * if we have multiple devices in this plug. If so, make a
1311 * note to sort the list before dispatch.
1313 if (list_empty(&plug->list))
1314 trace_block_plug(q);
1315 else if (!plug->should_sort) {
1316 struct request *__rq;
1318 __rq = list_entry_rq(plug->list.prev);
1320 plug->should_sort = 1;
1323 * Debug flag, kill later
1325 req->cmd_flags |= REQ_ON_PLUG;
1326 list_add_tail(&req->queuelist, &plug->list);
1327 drive_stat_acct(req, 1);
1329 spin_lock_irq(q->queue_lock);
1330 add_acct_request(q, req, where);
1333 spin_unlock_irq(q->queue_lock);
1340 * If bio->bi_dev is a partition, remap the location
1342 static inline void blk_partition_remap(struct bio *bio)
1344 struct block_device *bdev = bio->bi_bdev;
1346 if (bio_sectors(bio) && bdev != bdev->bd_contains) {
1347 struct hd_struct *p = bdev->bd_part;
1349 bio->bi_sector += p->start_sect;
1350 bio->bi_bdev = bdev->bd_contains;
1352 trace_block_bio_remap(bdev_get_queue(bio->bi_bdev), bio,
1354 bio->bi_sector - p->start_sect);
1358 static void handle_bad_sector(struct bio *bio)
1360 char b[BDEVNAME_SIZE];
1362 printk(KERN_INFO "attempt to access beyond end of device\n");
1363 printk(KERN_INFO "%s: rw=%ld, want=%Lu, limit=%Lu\n",
1364 bdevname(bio->bi_bdev, b),
1366 (unsigned long long)bio->bi_sector + bio_sectors(bio),
1367 (long long)(i_size_read(bio->bi_bdev->bd_inode) >> 9));
1369 set_bit(BIO_EOF, &bio->bi_flags);
1372 #ifdef CONFIG_FAIL_MAKE_REQUEST
1374 static DECLARE_FAULT_ATTR(fail_make_request);
1376 static int __init setup_fail_make_request(char *str)
1378 return setup_fault_attr(&fail_make_request, str);
1380 __setup("fail_make_request=", setup_fail_make_request);
1382 static int should_fail_request(struct bio *bio)
1384 struct hd_struct *part = bio->bi_bdev->bd_part;
1386 if (part_to_disk(part)->part0.make_it_fail || part->make_it_fail)
1387 return should_fail(&fail_make_request, bio->bi_size);
1392 static int __init fail_make_request_debugfs(void)
1394 return init_fault_attr_dentries(&fail_make_request,
1395 "fail_make_request");
1398 late_initcall(fail_make_request_debugfs);
1400 #else /* CONFIG_FAIL_MAKE_REQUEST */
1402 static inline int should_fail_request(struct bio *bio)
1407 #endif /* CONFIG_FAIL_MAKE_REQUEST */
1410 * Check whether this bio extends beyond the end of the device.
1412 static inline int bio_check_eod(struct bio *bio, unsigned int nr_sectors)
1419 /* Test device or partition size, when known. */
1420 maxsector = i_size_read(bio->bi_bdev->bd_inode) >> 9;
1422 sector_t sector = bio->bi_sector;
1424 if (maxsector < nr_sectors || maxsector - nr_sectors < sector) {
1426 * This may well happen - the kernel calls bread()
1427 * without checking the size of the device, e.g., when
1428 * mounting a device.
1430 handle_bad_sector(bio);
1439 * generic_make_request - hand a buffer to its device driver for I/O
1440 * @bio: The bio describing the location in memory and on the device.
1442 * generic_make_request() is used to make I/O requests of block
1443 * devices. It is passed a &struct bio, which describes the I/O that needs
1446 * generic_make_request() does not return any status. The
1447 * success/failure status of the request, along with notification of
1448 * completion, is delivered asynchronously through the bio->bi_end_io
1449 * function described (one day) else where.
1451 * The caller of generic_make_request must make sure that bi_io_vec
1452 * are set to describe the memory buffer, and that bi_dev and bi_sector are
1453 * set to describe the device address, and the
1454 * bi_end_io and optionally bi_private are set to describe how
1455 * completion notification should be signaled.
1457 * generic_make_request and the drivers it calls may use bi_next if this
1458 * bio happens to be merged with someone else, and may change bi_dev and
1459 * bi_sector for remaps as it sees fit. So the values of these fields
1460 * should NOT be depended on after the call to generic_make_request.
1462 static inline void __generic_make_request(struct bio *bio)
1464 struct request_queue *q;
1465 sector_t old_sector;
1466 int ret, nr_sectors = bio_sectors(bio);
1472 if (bio_check_eod(bio, nr_sectors))
1476 * Resolve the mapping until finished. (drivers are
1477 * still free to implement/resolve their own stacking
1478 * by explicitly returning 0)
1480 * NOTE: we don't repeat the blk_size check for each new device.
1481 * Stacking drivers are expected to know what they are doing.
1486 char b[BDEVNAME_SIZE];
1488 q = bdev_get_queue(bio->bi_bdev);
1491 "generic_make_request: Trying to access "
1492 "nonexistent block-device %s (%Lu)\n",
1493 bdevname(bio->bi_bdev, b),
1494 (long long) bio->bi_sector);
1498 if (unlikely(!(bio->bi_rw & REQ_DISCARD) &&
1499 nr_sectors > queue_max_hw_sectors(q))) {
1500 printk(KERN_ERR "bio too big device %s (%u > %u)\n",
1501 bdevname(bio->bi_bdev, b),
1503 queue_max_hw_sectors(q));
1507 if (unlikely(test_bit(QUEUE_FLAG_DEAD, &q->queue_flags)))
1510 if (should_fail_request(bio))
1514 * If this device has partitions, remap block n
1515 * of partition p to block n+start(p) of the disk.
1517 blk_partition_remap(bio);
1519 if (bio_integrity_enabled(bio) && bio_integrity_prep(bio))
1522 if (old_sector != -1)
1523 trace_block_bio_remap(q, bio, old_dev, old_sector);
1525 old_sector = bio->bi_sector;
1526 old_dev = bio->bi_bdev->bd_dev;
1528 if (bio_check_eod(bio, nr_sectors))
1532 * Filter flush bio's early so that make_request based
1533 * drivers without flush support don't have to worry
1536 if ((bio->bi_rw & (REQ_FLUSH | REQ_FUA)) && !q->flush_flags) {
1537 bio->bi_rw &= ~(REQ_FLUSH | REQ_FUA);
1544 if ((bio->bi_rw & REQ_DISCARD) &&
1545 (!blk_queue_discard(q) ||
1546 ((bio->bi_rw & REQ_SECURE) &&
1547 !blk_queue_secdiscard(q)))) {
1552 blk_throtl_bio(q, &bio);
1555 * If bio = NULL, bio has been throttled and will be submitted
1561 trace_block_bio_queue(q, bio);
1563 ret = q->make_request_fn(q, bio);
1569 bio_endio(bio, err);
1573 * We only want one ->make_request_fn to be active at a time,
1574 * else stack usage with stacked devices could be a problem.
1575 * So use current->bio_list to keep a list of requests
1576 * submited by a make_request_fn function.
1577 * current->bio_list is also used as a flag to say if
1578 * generic_make_request is currently active in this task or not.
1579 * If it is NULL, then no make_request is active. If it is non-NULL,
1580 * then a make_request is active, and new requests should be added
1583 void generic_make_request(struct bio *bio)
1585 struct bio_list bio_list_on_stack;
1587 if (current->bio_list) {
1588 /* make_request is active */
1589 bio_list_add(current->bio_list, bio);
1592 /* following loop may be a bit non-obvious, and so deserves some
1594 * Before entering the loop, bio->bi_next is NULL (as all callers
1595 * ensure that) so we have a list with a single bio.
1596 * We pretend that we have just taken it off a longer list, so
1597 * we assign bio_list to a pointer to the bio_list_on_stack,
1598 * thus initialising the bio_list of new bios to be
1599 * added. __generic_make_request may indeed add some more bios
1600 * through a recursive call to generic_make_request. If it
1601 * did, we find a non-NULL value in bio_list and re-enter the loop
1602 * from the top. In this case we really did just take the bio
1603 * of the top of the list (no pretending) and so remove it from
1604 * bio_list, and call into __generic_make_request again.
1606 * The loop was structured like this to make only one call to
1607 * __generic_make_request (which is important as it is large and
1608 * inlined) and to keep the structure simple.
1610 BUG_ON(bio->bi_next);
1611 bio_list_init(&bio_list_on_stack);
1612 current->bio_list = &bio_list_on_stack;
1614 __generic_make_request(bio);
1615 bio = bio_list_pop(current->bio_list);
1617 current->bio_list = NULL; /* deactivate */
1619 EXPORT_SYMBOL(generic_make_request);
1622 * submit_bio - submit a bio to the block device layer for I/O
1623 * @rw: whether to %READ or %WRITE, or maybe to %READA (read ahead)
1624 * @bio: The &struct bio which describes the I/O
1626 * submit_bio() is very similar in purpose to generic_make_request(), and
1627 * uses that function to do most of the work. Both are fairly rough
1628 * interfaces; @bio must be presetup and ready for I/O.
1631 void submit_bio(int rw, struct bio *bio)
1633 int count = bio_sectors(bio);
1638 * If it's a regular read/write or a barrier with data attached,
1639 * go through the normal accounting stuff before submission.
1641 if (bio_has_data(bio) && !(rw & REQ_DISCARD)) {
1643 count_vm_events(PGPGOUT, count);
1645 task_io_account_read(bio->bi_size);
1646 count_vm_events(PGPGIN, count);
1649 if (unlikely(block_dump)) {
1650 char b[BDEVNAME_SIZE];
1651 printk(KERN_DEBUG "%s(%d): %s block %Lu on %s (%u sectors)\n",
1652 current->comm, task_pid_nr(current),
1653 (rw & WRITE) ? "WRITE" : "READ",
1654 (unsigned long long)bio->bi_sector,
1655 bdevname(bio->bi_bdev, b),
1660 generic_make_request(bio);
1662 EXPORT_SYMBOL(submit_bio);
1665 * blk_rq_check_limits - Helper function to check a request for the queue limit
1667 * @rq: the request being checked
1670 * @rq may have been made based on weaker limitations of upper-level queues
1671 * in request stacking drivers, and it may violate the limitation of @q.
1672 * Since the block layer and the underlying device driver trust @rq
1673 * after it is inserted to @q, it should be checked against @q before
1674 * the insertion using this generic function.
1676 * This function should also be useful for request stacking drivers
1677 * in some cases below, so export this function.
1678 * Request stacking drivers like request-based dm may change the queue
1679 * limits while requests are in the queue (e.g. dm's table swapping).
1680 * Such request stacking drivers should check those requests agaist
1681 * the new queue limits again when they dispatch those requests,
1682 * although such checkings are also done against the old queue limits
1683 * when submitting requests.
1685 int blk_rq_check_limits(struct request_queue *q, struct request *rq)
1687 if (rq->cmd_flags & REQ_DISCARD)
1690 if (blk_rq_sectors(rq) > queue_max_sectors(q) ||
1691 blk_rq_bytes(rq) > queue_max_hw_sectors(q) << 9) {
1692 printk(KERN_ERR "%s: over max size limit.\n", __func__);
1697 * queue's settings related to segment counting like q->bounce_pfn
1698 * may differ from that of other stacking queues.
1699 * Recalculate it to check the request correctly on this queue's
1702 blk_recalc_rq_segments(rq);
1703 if (rq->nr_phys_segments > queue_max_segments(q)) {
1704 printk(KERN_ERR "%s: over max segments limit.\n", __func__);
1710 EXPORT_SYMBOL_GPL(blk_rq_check_limits);
1713 * blk_insert_cloned_request - Helper for stacking drivers to submit a request
1714 * @q: the queue to submit the request
1715 * @rq: the request being queued
1717 int blk_insert_cloned_request(struct request_queue *q, struct request *rq)
1719 unsigned long flags;
1721 if (blk_rq_check_limits(q, rq))
1724 #ifdef CONFIG_FAIL_MAKE_REQUEST
1725 if (rq->rq_disk && rq->rq_disk->part0.make_it_fail &&
1726 should_fail(&fail_make_request, blk_rq_bytes(rq)))
1730 spin_lock_irqsave(q->queue_lock, flags);
1733 * Submitting request must be dequeued before calling this function
1734 * because it will be linked to another request_queue
1736 BUG_ON(blk_queued_rq(rq));
1738 add_acct_request(q, rq, ELEVATOR_INSERT_BACK);
1739 spin_unlock_irqrestore(q->queue_lock, flags);
1743 EXPORT_SYMBOL_GPL(blk_insert_cloned_request);
1746 * blk_rq_err_bytes - determine number of bytes till the next failure boundary
1747 * @rq: request to examine
1750 * A request could be merge of IOs which require different failure
1751 * handling. This function determines the number of bytes which
1752 * can be failed from the beginning of the request without
1753 * crossing into area which need to be retried further.
1756 * The number of bytes to fail.
1759 * queue_lock must be held.
1761 unsigned int blk_rq_err_bytes(const struct request *rq)
1763 unsigned int ff = rq->cmd_flags & REQ_FAILFAST_MASK;
1764 unsigned int bytes = 0;
1767 if (!(rq->cmd_flags & REQ_MIXED_MERGE))
1768 return blk_rq_bytes(rq);
1771 * Currently the only 'mixing' which can happen is between
1772 * different fastfail types. We can safely fail portions
1773 * which have all the failfast bits that the first one has -
1774 * the ones which are at least as eager to fail as the first
1777 for (bio = rq->bio; bio; bio = bio->bi_next) {
1778 if ((bio->bi_rw & ff) != ff)
1780 bytes += bio->bi_size;
1783 /* this could lead to infinite loop */
1784 BUG_ON(blk_rq_bytes(rq) && !bytes);
1787 EXPORT_SYMBOL_GPL(blk_rq_err_bytes);
1789 static void blk_account_io_completion(struct request *req, unsigned int bytes)
1791 if (blk_do_io_stat(req)) {
1792 const int rw = rq_data_dir(req);
1793 struct hd_struct *part;
1796 cpu = part_stat_lock();
1798 part_stat_add(cpu, part, sectors[rw], bytes >> 9);
1803 static void blk_account_io_done(struct request *req)
1806 * Account IO completion. flush_rq isn't accounted as a
1807 * normal IO on queueing nor completion. Accounting the
1808 * containing request is enough.
1810 if (blk_do_io_stat(req) && !(req->cmd_flags & REQ_FLUSH_SEQ)) {
1811 unsigned long duration = jiffies - req->start_time;
1812 const int rw = rq_data_dir(req);
1813 struct hd_struct *part;
1816 cpu = part_stat_lock();
1819 part_stat_inc(cpu, part, ios[rw]);
1820 part_stat_add(cpu, part, ticks[rw], duration);
1821 part_round_stats(cpu, part);
1822 part_dec_in_flight(part, rw);
1824 hd_struct_put(part);
1830 * blk_peek_request - peek at the top of a request queue
1831 * @q: request queue to peek at
1834 * Return the request at the top of @q. The returned request
1835 * should be started using blk_start_request() before LLD starts
1839 * Pointer to the request at the top of @q if available. Null
1843 * queue_lock must be held.
1845 struct request *blk_peek_request(struct request_queue *q)
1850 while ((rq = __elv_next_request(q)) != NULL) {
1851 if (!(rq->cmd_flags & REQ_STARTED)) {
1853 * This is the first time the device driver
1854 * sees this request (possibly after
1855 * requeueing). Notify IO scheduler.
1857 if (rq->cmd_flags & REQ_SORTED)
1858 elv_activate_rq(q, rq);
1861 * just mark as started even if we don't start
1862 * it, a request that has been delayed should
1863 * not be passed by new incoming requests
1865 rq->cmd_flags |= REQ_STARTED;
1866 trace_block_rq_issue(q, rq);
1869 if (!q->boundary_rq || q->boundary_rq == rq) {
1870 q->end_sector = rq_end_sector(rq);
1871 q->boundary_rq = NULL;
1874 if (rq->cmd_flags & REQ_DONTPREP)
1877 if (q->dma_drain_size && blk_rq_bytes(rq)) {
1879 * make sure space for the drain appears we
1880 * know we can do this because max_hw_segments
1881 * has been adjusted to be one fewer than the
1884 rq->nr_phys_segments++;
1890 ret = q->prep_rq_fn(q, rq);
1891 if (ret == BLKPREP_OK) {
1893 } else if (ret == BLKPREP_DEFER) {
1895 * the request may have been (partially) prepped.
1896 * we need to keep this request in the front to
1897 * avoid resource deadlock. REQ_STARTED will
1898 * prevent other fs requests from passing this one.
1900 if (q->dma_drain_size && blk_rq_bytes(rq) &&
1901 !(rq->cmd_flags & REQ_DONTPREP)) {
1903 * remove the space for the drain we added
1904 * so that we don't add it again
1906 --rq->nr_phys_segments;
1911 } else if (ret == BLKPREP_KILL) {
1912 rq->cmd_flags |= REQ_QUIET;
1914 * Mark this request as started so we don't trigger
1915 * any debug logic in the end I/O path.
1917 blk_start_request(rq);
1918 __blk_end_request_all(rq, -EIO);
1920 printk(KERN_ERR "%s: bad return=%d\n", __func__, ret);
1927 EXPORT_SYMBOL(blk_peek_request);
1929 void blk_dequeue_request(struct request *rq)
1931 struct request_queue *q = rq->q;
1933 BUG_ON(list_empty(&rq->queuelist));
1934 BUG_ON(ELV_ON_HASH(rq));
1936 list_del_init(&rq->queuelist);
1939 * the time frame between a request being removed from the lists
1940 * and to it is freed is accounted as io that is in progress at
1943 if (blk_account_rq(rq)) {
1944 q->in_flight[rq_is_sync(rq)]++;
1945 set_io_start_time_ns(rq);
1950 * blk_start_request - start request processing on the driver
1951 * @req: request to dequeue
1954 * Dequeue @req and start timeout timer on it. This hands off the
1955 * request to the driver.
1957 * Block internal functions which don't want to start timer should
1958 * call blk_dequeue_request().
1961 * queue_lock must be held.
1963 void blk_start_request(struct request *req)
1965 blk_dequeue_request(req);
1968 * We are now handing the request to the hardware, initialize
1969 * resid_len to full count and add the timeout handler.
1971 req->resid_len = blk_rq_bytes(req);
1972 if (unlikely(blk_bidi_rq(req)))
1973 req->next_rq->resid_len = blk_rq_bytes(req->next_rq);
1977 EXPORT_SYMBOL(blk_start_request);
1980 * blk_fetch_request - fetch a request from a request queue
1981 * @q: request queue to fetch a request from
1984 * Return the request at the top of @q. The request is started on
1985 * return and LLD can start processing it immediately.
1988 * Pointer to the request at the top of @q if available. Null
1992 * queue_lock must be held.
1994 struct request *blk_fetch_request(struct request_queue *q)
1998 rq = blk_peek_request(q);
2000 blk_start_request(rq);
2003 EXPORT_SYMBOL(blk_fetch_request);
2006 * blk_update_request - Special helper function for request stacking drivers
2007 * @req: the request being processed
2008 * @error: %0 for success, < %0 for error
2009 * @nr_bytes: number of bytes to complete @req
2012 * Ends I/O on a number of bytes attached to @req, but doesn't complete
2013 * the request structure even if @req doesn't have leftover.
2014 * If @req has leftover, sets it up for the next range of segments.
2016 * This special helper function is only for request stacking drivers
2017 * (e.g. request-based dm) so that they can handle partial completion.
2018 * Actual device drivers should use blk_end_request instead.
2020 * Passing the result of blk_rq_bytes() as @nr_bytes guarantees
2021 * %false return from this function.
2024 * %false - this request doesn't have any more data
2025 * %true - this request has more data
2027 bool blk_update_request(struct request *req, int error, unsigned int nr_bytes)
2029 int total_bytes, bio_nbytes, next_idx = 0;
2035 trace_block_rq_complete(req->q, req);
2038 * For fs requests, rq is just carrier of independent bio's
2039 * and each partial completion should be handled separately.
2040 * Reset per-request error on each partial completion.
2042 * TODO: tj: This is too subtle. It would be better to let
2043 * low level drivers do what they see fit.
2045 if (req->cmd_type == REQ_TYPE_FS)
2048 if (error && req->cmd_type == REQ_TYPE_FS &&
2049 !(req->cmd_flags & REQ_QUIET)) {
2054 error_type = "recoverable transport";
2057 error_type = "critical target";
2060 error_type = "critical nexus";
2067 printk(KERN_ERR "end_request: %s error, dev %s, sector %llu\n",
2068 error_type, req->rq_disk ? req->rq_disk->disk_name : "?",
2069 (unsigned long long)blk_rq_pos(req));
2072 blk_account_io_completion(req, nr_bytes);
2074 total_bytes = bio_nbytes = 0;
2075 while ((bio = req->bio) != NULL) {
2078 if (nr_bytes >= bio->bi_size) {
2079 req->bio = bio->bi_next;
2080 nbytes = bio->bi_size;
2081 req_bio_endio(req, bio, nbytes, error);
2085 int idx = bio->bi_idx + next_idx;
2087 if (unlikely(idx >= bio->bi_vcnt)) {
2088 blk_dump_rq_flags(req, "__end_that");
2089 printk(KERN_ERR "%s: bio idx %d >= vcnt %d\n",
2090 __func__, idx, bio->bi_vcnt);
2094 nbytes = bio_iovec_idx(bio, idx)->bv_len;
2095 BIO_BUG_ON(nbytes > bio->bi_size);
2098 * not a complete bvec done
2100 if (unlikely(nbytes > nr_bytes)) {
2101 bio_nbytes += nr_bytes;
2102 total_bytes += nr_bytes;
2107 * advance to the next vector
2110 bio_nbytes += nbytes;
2113 total_bytes += nbytes;
2119 * end more in this run, or just return 'not-done'
2121 if (unlikely(nr_bytes <= 0))
2131 * Reset counters so that the request stacking driver
2132 * can find how many bytes remain in the request
2135 req->__data_len = 0;
2140 * if the request wasn't completed, update state
2143 req_bio_endio(req, bio, bio_nbytes, error);
2144 bio->bi_idx += next_idx;
2145 bio_iovec(bio)->bv_offset += nr_bytes;
2146 bio_iovec(bio)->bv_len -= nr_bytes;
2149 req->__data_len -= total_bytes;
2150 req->buffer = bio_data(req->bio);
2152 /* update sector only for requests with clear definition of sector */
2153 if (req->cmd_type == REQ_TYPE_FS || (req->cmd_flags & REQ_DISCARD))
2154 req->__sector += total_bytes >> 9;
2156 /* mixed attributes always follow the first bio */
2157 if (req->cmd_flags & REQ_MIXED_MERGE) {
2158 req->cmd_flags &= ~REQ_FAILFAST_MASK;
2159 req->cmd_flags |= req->bio->bi_rw & REQ_FAILFAST_MASK;
2163 * If total number of sectors is less than the first segment
2164 * size, something has gone terribly wrong.
2166 if (blk_rq_bytes(req) < blk_rq_cur_bytes(req)) {
2167 blk_dump_rq_flags(req, "request botched");
2168 req->__data_len = blk_rq_cur_bytes(req);
2171 /* recalculate the number of segments */
2172 blk_recalc_rq_segments(req);
2176 EXPORT_SYMBOL_GPL(blk_update_request);
2178 static bool blk_update_bidi_request(struct request *rq, int error,
2179 unsigned int nr_bytes,
2180 unsigned int bidi_bytes)
2182 if (blk_update_request(rq, error, nr_bytes))
2185 /* Bidi request must be completed as a whole */
2186 if (unlikely(blk_bidi_rq(rq)) &&
2187 blk_update_request(rq->next_rq, error, bidi_bytes))
2190 if (blk_queue_add_random(rq->q))
2191 add_disk_randomness(rq->rq_disk);
2197 * blk_unprep_request - unprepare a request
2200 * This function makes a request ready for complete resubmission (or
2201 * completion). It happens only after all error handling is complete,
2202 * so represents the appropriate moment to deallocate any resources
2203 * that were allocated to the request in the prep_rq_fn. The queue
2204 * lock is held when calling this.
2206 void blk_unprep_request(struct request *req)
2208 struct request_queue *q = req->q;
2210 req->cmd_flags &= ~REQ_DONTPREP;
2211 if (q->unprep_rq_fn)
2212 q->unprep_rq_fn(q, req);
2214 EXPORT_SYMBOL_GPL(blk_unprep_request);
2217 * queue lock must be held
2219 static void blk_finish_request(struct request *req, int error)
2221 if (blk_rq_tagged(req))
2222 blk_queue_end_tag(req->q, req);
2224 BUG_ON(blk_queued_rq(req));
2226 if (unlikely(laptop_mode) && req->cmd_type == REQ_TYPE_FS)
2227 laptop_io_completion(&req->q->backing_dev_info);
2229 blk_delete_timer(req);
2231 if (req->cmd_flags & REQ_DONTPREP)
2232 blk_unprep_request(req);
2235 blk_account_io_done(req);
2238 req->end_io(req, error);
2240 if (blk_bidi_rq(req))
2241 __blk_put_request(req->next_rq->q, req->next_rq);
2243 __blk_put_request(req->q, req);
2248 * blk_end_bidi_request - Complete a bidi request
2249 * @rq: the request to complete
2250 * @error: %0 for success, < %0 for error
2251 * @nr_bytes: number of bytes to complete @rq
2252 * @bidi_bytes: number of bytes to complete @rq->next_rq
2255 * Ends I/O on a number of bytes attached to @rq and @rq->next_rq.
2256 * Drivers that supports bidi can safely call this member for any
2257 * type of request, bidi or uni. In the later case @bidi_bytes is
2261 * %false - we are done with this request
2262 * %true - still buffers pending for this request
2264 static bool blk_end_bidi_request(struct request *rq, int error,
2265 unsigned int nr_bytes, unsigned int bidi_bytes)
2267 struct request_queue *q = rq->q;
2268 unsigned long flags;
2270 if (blk_update_bidi_request(rq, error, nr_bytes, bidi_bytes))
2273 spin_lock_irqsave(q->queue_lock, flags);
2274 blk_finish_request(rq, error);
2275 spin_unlock_irqrestore(q->queue_lock, flags);
2281 * __blk_end_bidi_request - Complete a bidi request with queue lock held
2282 * @rq: the request to complete
2283 * @error: %0 for success, < %0 for error
2284 * @nr_bytes: number of bytes to complete @rq
2285 * @bidi_bytes: number of bytes to complete @rq->next_rq
2288 * Identical to blk_end_bidi_request() except that queue lock is
2289 * assumed to be locked on entry and remains so on return.
2292 * %false - we are done with this request
2293 * %true - still buffers pending for this request
2295 static bool __blk_end_bidi_request(struct request *rq, int error,
2296 unsigned int nr_bytes, unsigned int bidi_bytes)
2298 if (blk_update_bidi_request(rq, error, nr_bytes, bidi_bytes))
2301 blk_finish_request(rq, error);
2307 * blk_end_request - Helper function for drivers to complete the request.
2308 * @rq: the request being processed
2309 * @error: %0 for success, < %0 for error
2310 * @nr_bytes: number of bytes to complete
2313 * Ends I/O on a number of bytes attached to @rq.
2314 * If @rq has leftover, sets it up for the next range of segments.
2317 * %false - we are done with this request
2318 * %true - still buffers pending for this request
2320 bool blk_end_request(struct request *rq, int error, unsigned int nr_bytes)
2322 return blk_end_bidi_request(rq, error, nr_bytes, 0);
2324 EXPORT_SYMBOL(blk_end_request);
2327 * blk_end_request_all - Helper function for drives to finish the request.
2328 * @rq: the request to finish
2329 * @error: %0 for success, < %0 for error
2332 * Completely finish @rq.
2334 void blk_end_request_all(struct request *rq, int error)
2337 unsigned int bidi_bytes = 0;
2339 if (unlikely(blk_bidi_rq(rq)))
2340 bidi_bytes = blk_rq_bytes(rq->next_rq);
2342 pending = blk_end_bidi_request(rq, error, blk_rq_bytes(rq), bidi_bytes);
2345 EXPORT_SYMBOL(blk_end_request_all);
2348 * blk_end_request_cur - Helper function to finish the current request chunk.
2349 * @rq: the request to finish the current chunk for
2350 * @error: %0 for success, < %0 for error
2353 * Complete the current consecutively mapped chunk from @rq.
2356 * %false - we are done with this request
2357 * %true - still buffers pending for this request
2359 bool blk_end_request_cur(struct request *rq, int error)
2361 return blk_end_request(rq, error, blk_rq_cur_bytes(rq));
2363 EXPORT_SYMBOL(blk_end_request_cur);
2366 * blk_end_request_err - Finish a request till the next failure boundary.
2367 * @rq: the request to finish till the next failure boundary for
2368 * @error: must be negative errno
2371 * Complete @rq till the next failure boundary.
2374 * %false - we are done with this request
2375 * %true - still buffers pending for this request
2377 bool blk_end_request_err(struct request *rq, int error)
2379 WARN_ON(error >= 0);
2380 return blk_end_request(rq, error, blk_rq_err_bytes(rq));
2382 EXPORT_SYMBOL_GPL(blk_end_request_err);
2385 * __blk_end_request - Helper function for drivers to complete the request.
2386 * @rq: the request being processed
2387 * @error: %0 for success, < %0 for error
2388 * @nr_bytes: number of bytes to complete
2391 * Must be called with queue lock held unlike blk_end_request().
2394 * %false - we are done with this request
2395 * %true - still buffers pending for this request
2397 bool __blk_end_request(struct request *rq, int error, unsigned int nr_bytes)
2399 return __blk_end_bidi_request(rq, error, nr_bytes, 0);
2401 EXPORT_SYMBOL(__blk_end_request);
2404 * __blk_end_request_all - Helper function for drives to finish the request.
2405 * @rq: the request to finish
2406 * @error: %0 for success, < %0 for error
2409 * Completely finish @rq. Must be called with queue lock held.
2411 void __blk_end_request_all(struct request *rq, int error)
2414 unsigned int bidi_bytes = 0;
2416 if (unlikely(blk_bidi_rq(rq)))
2417 bidi_bytes = blk_rq_bytes(rq->next_rq);
2419 pending = __blk_end_bidi_request(rq, error, blk_rq_bytes(rq), bidi_bytes);
2422 EXPORT_SYMBOL(__blk_end_request_all);
2425 * __blk_end_request_cur - Helper function to finish the current request chunk.
2426 * @rq: the request to finish the current chunk for
2427 * @error: %0 for success, < %0 for error
2430 * Complete the current consecutively mapped chunk from @rq. Must
2431 * be called with queue lock held.
2434 * %false - we are done with this request
2435 * %true - still buffers pending for this request
2437 bool __blk_end_request_cur(struct request *rq, int error)
2439 return __blk_end_request(rq, error, blk_rq_cur_bytes(rq));
2441 EXPORT_SYMBOL(__blk_end_request_cur);
2444 * __blk_end_request_err - Finish a request till the next failure boundary.
2445 * @rq: the request to finish till the next failure boundary for
2446 * @error: must be negative errno
2449 * Complete @rq till the next failure boundary. Must be called
2450 * with queue lock held.
2453 * %false - we are done with this request
2454 * %true - still buffers pending for this request
2456 bool __blk_end_request_err(struct request *rq, int error)
2458 WARN_ON(error >= 0);
2459 return __blk_end_request(rq, error, blk_rq_err_bytes(rq));
2461 EXPORT_SYMBOL_GPL(__blk_end_request_err);
2463 void blk_rq_bio_prep(struct request_queue *q, struct request *rq,
2466 /* Bit 0 (R/W) is identical in rq->cmd_flags and bio->bi_rw */
2467 rq->cmd_flags |= bio->bi_rw & REQ_WRITE;
2469 if (bio_has_data(bio)) {
2470 rq->nr_phys_segments = bio_phys_segments(q, bio);
2471 rq->buffer = bio_data(bio);
2473 rq->__data_len = bio->bi_size;
2474 rq->bio = rq->biotail = bio;
2477 rq->rq_disk = bio->bi_bdev->bd_disk;
2480 #if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
2482 * rq_flush_dcache_pages - Helper function to flush all pages in a request
2483 * @rq: the request to be flushed
2486 * Flush all pages in @rq.
2488 void rq_flush_dcache_pages(struct request *rq)
2490 struct req_iterator iter;
2491 struct bio_vec *bvec;
2493 rq_for_each_segment(bvec, rq, iter)
2494 flush_dcache_page(bvec->bv_page);
2496 EXPORT_SYMBOL_GPL(rq_flush_dcache_pages);
2500 * blk_lld_busy - Check if underlying low-level drivers of a device are busy
2501 * @q : the queue of the device being checked
2504 * Check if underlying low-level drivers of a device are busy.
2505 * If the drivers want to export their busy state, they must set own
2506 * exporting function using blk_queue_lld_busy() first.
2508 * Basically, this function is used only by request stacking drivers
2509 * to stop dispatching requests to underlying devices when underlying
2510 * devices are busy. This behavior helps more I/O merging on the queue
2511 * of the request stacking driver and prevents I/O throughput regression
2512 * on burst I/O load.
2515 * 0 - Not busy (The request stacking driver should dispatch request)
2516 * 1 - Busy (The request stacking driver should stop dispatching request)
2518 int blk_lld_busy(struct request_queue *q)
2521 return q->lld_busy_fn(q);
2525 EXPORT_SYMBOL_GPL(blk_lld_busy);
2528 * blk_rq_unprep_clone - Helper function to free all bios in a cloned request
2529 * @rq: the clone request to be cleaned up
2532 * Free all bios in @rq for a cloned request.
2534 void blk_rq_unprep_clone(struct request *rq)
2538 while ((bio = rq->bio) != NULL) {
2539 rq->bio = bio->bi_next;
2544 EXPORT_SYMBOL_GPL(blk_rq_unprep_clone);
2547 * Copy attributes of the original request to the clone request.
2548 * The actual data parts (e.g. ->cmd, ->buffer, ->sense) are not copied.
2550 static void __blk_rq_prep_clone(struct request *dst, struct request *src)
2552 dst->cpu = src->cpu;
2553 dst->cmd_flags = (src->cmd_flags & REQ_CLONE_MASK) | REQ_NOMERGE;
2554 dst->cmd_type = src->cmd_type;
2555 dst->__sector = blk_rq_pos(src);
2556 dst->__data_len = blk_rq_bytes(src);
2557 dst->nr_phys_segments = src->nr_phys_segments;
2558 dst->ioprio = src->ioprio;
2559 dst->extra_len = src->extra_len;
2563 * blk_rq_prep_clone - Helper function to setup clone request
2564 * @rq: the request to be setup
2565 * @rq_src: original request to be cloned
2566 * @bs: bio_set that bios for clone are allocated from
2567 * @gfp_mask: memory allocation mask for bio
2568 * @bio_ctr: setup function to be called for each clone bio.
2569 * Returns %0 for success, non %0 for failure.
2570 * @data: private data to be passed to @bio_ctr
2573 * Clones bios in @rq_src to @rq, and copies attributes of @rq_src to @rq.
2574 * The actual data parts of @rq_src (e.g. ->cmd, ->buffer, ->sense)
2575 * are not copied, and copying such parts is the caller's responsibility.
2576 * Also, pages which the original bios are pointing to are not copied
2577 * and the cloned bios just point same pages.
2578 * So cloned bios must be completed before original bios, which means
2579 * the caller must complete @rq before @rq_src.
2581 int blk_rq_prep_clone(struct request *rq, struct request *rq_src,
2582 struct bio_set *bs, gfp_t gfp_mask,
2583 int (*bio_ctr)(struct bio *, struct bio *, void *),
2586 struct bio *bio, *bio_src;
2591 blk_rq_init(NULL, rq);
2593 __rq_for_each_bio(bio_src, rq_src) {
2594 bio = bio_alloc_bioset(gfp_mask, bio_src->bi_max_vecs, bs);
2598 __bio_clone(bio, bio_src);
2600 if (bio_integrity(bio_src) &&
2601 bio_integrity_clone(bio, bio_src, gfp_mask, bs))
2604 if (bio_ctr && bio_ctr(bio, bio_src, data))
2608 rq->biotail->bi_next = bio;
2611 rq->bio = rq->biotail = bio;
2614 __blk_rq_prep_clone(rq, rq_src);
2621 blk_rq_unprep_clone(rq);
2625 EXPORT_SYMBOL_GPL(blk_rq_prep_clone);
2627 int kblockd_schedule_work(struct request_queue *q, struct work_struct *work)
2629 return queue_work(kblockd_workqueue, work);
2631 EXPORT_SYMBOL(kblockd_schedule_work);
2633 int kblockd_schedule_delayed_work(struct request_queue *q,
2634 struct delayed_work *dwork, unsigned long delay)
2636 return queue_delayed_work(kblockd_workqueue, dwork, delay);
2638 EXPORT_SYMBOL(kblockd_schedule_delayed_work);
2640 #define PLUG_MAGIC 0x91827364
2642 void blk_start_plug(struct blk_plug *plug)
2644 struct task_struct *tsk = current;
2646 plug->magic = PLUG_MAGIC;
2647 INIT_LIST_HEAD(&plug->list);
2648 INIT_LIST_HEAD(&plug->cb_list);
2649 plug->should_sort = 0;
2652 * If this is a nested plug, don't actually assign it. It will be
2653 * flushed on its own.
2657 * Store ordering should not be needed here, since a potential
2658 * preempt will imply a full memory barrier
2663 EXPORT_SYMBOL(blk_start_plug);
2665 static int plug_rq_cmp(void *priv, struct list_head *a, struct list_head *b)
2667 struct request *rqa = container_of(a, struct request, queuelist);
2668 struct request *rqb = container_of(b, struct request, queuelist);
2670 return !(rqa->q <= rqb->q);
2674 * If 'from_schedule' is true, then postpone the dispatch of requests
2675 * until a safe kblockd context. We due this to avoid accidental big
2676 * additional stack usage in driver dispatch, in places where the originally
2677 * plugger did not intend it.
2679 static void queue_unplugged(struct request_queue *q, unsigned int depth,
2681 __releases(q->queue_lock)
2683 trace_block_unplug(q, depth, !from_schedule);
2686 * If we are punting this to kblockd, then we can safely drop
2687 * the queue_lock before waking kblockd (which needs to take
2690 if (from_schedule) {
2691 spin_unlock(q->queue_lock);
2692 blk_run_queue_async(q);
2695 spin_unlock(q->queue_lock);
2700 static void flush_plug_callbacks(struct blk_plug *plug)
2702 LIST_HEAD(callbacks);
2704 if (list_empty(&plug->cb_list))
2707 list_splice_init(&plug->cb_list, &callbacks);
2709 while (!list_empty(&callbacks)) {
2710 struct blk_plug_cb *cb = list_first_entry(&callbacks,
2713 list_del(&cb->list);
2718 void blk_flush_plug_list(struct blk_plug *plug, bool from_schedule)
2720 struct request_queue *q;
2721 unsigned long flags;
2726 BUG_ON(plug->magic != PLUG_MAGIC);
2728 flush_plug_callbacks(plug);
2729 if (list_empty(&plug->list))
2732 list_splice_init(&plug->list, &list);
2734 if (plug->should_sort) {
2735 list_sort(NULL, &list, plug_rq_cmp);
2736 plug->should_sort = 0;
2743 * Save and disable interrupts here, to avoid doing it for every
2744 * queue lock we have to take.
2746 local_irq_save(flags);
2747 while (!list_empty(&list)) {
2748 rq = list_entry_rq(list.next);
2749 list_del_init(&rq->queuelist);
2750 BUG_ON(!(rq->cmd_flags & REQ_ON_PLUG));
2754 * This drops the queue lock
2757 queue_unplugged(q, depth, from_schedule);
2760 spin_lock(q->queue_lock);
2762 rq->cmd_flags &= ~REQ_ON_PLUG;
2765 * rq is already accounted, so use raw insert
2767 if (rq->cmd_flags & (REQ_FLUSH | REQ_FUA))
2768 __elv_add_request(q, rq, ELEVATOR_INSERT_FLUSH);
2770 __elv_add_request(q, rq, ELEVATOR_INSERT_SORT_MERGE);
2776 * This drops the queue lock
2779 queue_unplugged(q, depth, from_schedule);
2781 local_irq_restore(flags);
2784 void blk_finish_plug(struct blk_plug *plug)
2786 blk_flush_plug_list(plug, false);
2788 if (plug == current->plug)
2789 current->plug = NULL;
2791 EXPORT_SYMBOL(blk_finish_plug);
2793 int __init blk_dev_init(void)
2795 BUILD_BUG_ON(__REQ_NR_BITS > 8 *
2796 sizeof(((struct request *)0)->cmd_flags));
2798 /* used for unplugging and affects IO latency/throughput - HIGHPRI */
2799 kblockd_workqueue = alloc_workqueue("kblockd",
2800 WQ_MEM_RECLAIM | WQ_HIGHPRI, 0);
2801 if (!kblockd_workqueue)
2802 panic("Failed to create kblockd\n");
2804 request_cachep = kmem_cache_create("blkdev_requests",
2805 sizeof(struct request), 0, SLAB_PANIC, NULL);
2807 blk_requestq_cachep = kmem_cache_create("blkdev_queue",
2808 sizeof(struct request_queue), 0, SLAB_PANIC, NULL);