blob: 33eded00c5b1c9c80f44e62da2709750d4703c1b [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07002 * 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>
Jens Axboe6728cb02008-01-31 13:03:55 +01006 * kernel-doc documentation started by NeilBrown <neilb@cse.unsw.edu.au>
7 * - July2000
Linus Torvalds1da177e2005-04-16 15:20:36 -07008 * bio rewrite, highmem i/o, etc, Jens Axboe <axboe@suse.de> - may 2001
9 */
10
11/*
12 * This handles all read/write requests to block devices
13 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070014#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>
20#include <linux/mm.h>
21#include <linux/kernel_stat.h>
22#include <linux/string.h>
23#include <linux/init.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070024#include <linux/completion.h>
25#include <linux/slab.h>
26#include <linux/swap.h>
27#include <linux/writeback.h>
Andrew Mortonfaccbd4b2006-12-10 02:19:35 -080028#include <linux/task_io_accounting_ops.h>
Akinobu Mitac17bb492006-12-08 02:39:46 -080029#include <linux/fault-inject.h>
Jens Axboe73c10102011-03-08 13:19:51 +010030#include <linux/list_sort.h>
Tejun Heoe3c78ca2011-10-19 14:32:38 +020031#include <linux/delay.h>
Tejun Heoaaf7c682012-04-19 16:29:22 -070032#include <linux/ratelimit.h>
Li Zefan55782132009-06-09 13:43:05 +080033
34#define CREATE_TRACE_POINTS
35#include <trace/events/block.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070036
Jens Axboe8324aa92008-01-29 14:51:59 +010037#include "blk.h"
Tejun Heo5efd6112012-03-05 13:15:12 -080038#include "blk-cgroup.h"
Jens Axboe8324aa92008-01-29 14:51:59 +010039
Mike Snitzerd07335e2010-11-16 12:52:38 +010040EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_remap);
Jun'ichi Nomurab0da3f02009-10-01 21:16:13 +020041EXPORT_TRACEPOINT_SYMBOL_GPL(block_rq_remap);
Li Zefan55782132009-06-09 13:43:05 +080042EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_complete);
Ingo Molnar0bfc2452008-11-26 11:59:56 +010043
Tejun Heoa73f7302011-12-14 00:33:37 +010044DEFINE_IDA(blk_queue_ida);
45
Linus Torvalds1da177e2005-04-16 15:20:36 -070046/*
47 * For the allocated request tables
48 */
Adrian Bunk5ece6c52008-02-18 13:45:51 +010049static struct kmem_cache *request_cachep;
Linus Torvalds1da177e2005-04-16 15:20:36 -070050
51/*
52 * For queue allocation
53 */
Jens Axboe6728cb02008-01-31 13:03:55 +010054struct kmem_cache *blk_requestq_cachep;
Linus Torvalds1da177e2005-04-16 15:20:36 -070055
56/*
Linus Torvalds1da177e2005-04-16 15:20:36 -070057 * Controlling structure to kblockd
58 */
Jens Axboeff856ba2006-01-09 16:02:34 +010059static struct workqueue_struct *kblockd_workqueue;
Linus Torvalds1da177e2005-04-16 15:20:36 -070060
Jens Axboe26b82562008-01-29 13:54:41 +010061static void drive_stat_acct(struct request *rq, int new_io)
62{
Jens Axboe28f13702008-05-07 10:15:46 +020063 struct hd_struct *part;
Jens Axboe26b82562008-01-29 13:54:41 +010064 int rw = rq_data_dir(rq);
Tejun Heoc9959052008-08-25 19:47:21 +090065 int cpu;
Jens Axboe26b82562008-01-29 13:54:41 +010066
Jens Axboec2553b52009-04-24 08:10:11 +020067 if (!blk_do_io_stat(rq))
Jens Axboe26b82562008-01-29 13:54:41 +010068 return;
69
Tejun Heo074a7ac2008-08-25 19:56:14 +090070 cpu = part_stat_lock();
Tejun Heoc9959052008-08-25 19:47:21 +090071
Jerome Marchand09e099d2011-01-05 16:57:38 +010072 if (!new_io) {
73 part = rq->part;
Tejun Heo074a7ac2008-08-25 19:56:14 +090074 part_stat_inc(cpu, part, merges[rw]);
Jerome Marchand09e099d2011-01-05 16:57:38 +010075 } else {
76 part = disk_map_sector_rcu(rq->rq_disk, blk_rq_pos(rq));
Jens Axboe6c23a962011-01-07 08:43:37 +010077 if (!hd_struct_try_get(part)) {
Jerome Marchand09e099d2011-01-05 16:57:38 +010078 /*
79 * The partition is already being removed,
80 * the request will be accounted on the disk only
81 *
82 * We take a reference on disk->part0 although that
83 * partition will never be deleted, so we can treat
84 * it as any other partition.
85 */
86 part = &rq->rq_disk->part0;
Jens Axboe6c23a962011-01-07 08:43:37 +010087 hd_struct_get(part);
Jerome Marchand09e099d2011-01-05 16:57:38 +010088 }
Tejun Heo074a7ac2008-08-25 19:56:14 +090089 part_round_stats(cpu, part);
Nikanth Karthikesan316d3152009-10-06 20:16:55 +020090 part_inc_in_flight(part, rw);
Jerome Marchand09e099d2011-01-05 16:57:38 +010091 rq->part = part;
Jens Axboe26b82562008-01-29 13:54:41 +010092 }
Tejun Heoe71bf0d2008-09-03 09:03:02 +020093
Tejun Heo074a7ac2008-08-25 19:56:14 +090094 part_stat_unlock();
Jens Axboe26b82562008-01-29 13:54:41 +010095}
96
Jens Axboe8324aa92008-01-29 14:51:59 +010097void blk_queue_congestion_threshold(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -070098{
99 int nr;
100
101 nr = q->nr_requests - (q->nr_requests / 8) + 1;
102 if (nr > q->nr_requests)
103 nr = q->nr_requests;
104 q->nr_congestion_on = nr;
105
106 nr = q->nr_requests - (q->nr_requests / 8) - (q->nr_requests / 16) - 1;
107 if (nr < 1)
108 nr = 1;
109 q->nr_congestion_off = nr;
110}
111
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112/**
113 * blk_get_backing_dev_info - get the address of a queue's backing_dev_info
114 * @bdev: device
115 *
116 * Locates the passed device's request queue and returns the address of its
117 * backing_dev_info
118 *
119 * Will return NULL if the request queue cannot be located.
120 */
121struct backing_dev_info *blk_get_backing_dev_info(struct block_device *bdev)
122{
123 struct backing_dev_info *ret = NULL;
Jens Axboe165125e2007-07-24 09:28:11 +0200124 struct request_queue *q = bdev_get_queue(bdev);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125
126 if (q)
127 ret = &q->backing_dev_info;
128 return ret;
129}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700130EXPORT_SYMBOL(blk_get_backing_dev_info);
131
FUJITA Tomonori2a4aa302008-04-29 09:54:36 +0200132void blk_rq_init(struct request_queue *q, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133{
FUJITA Tomonori1afb20f2008-04-25 12:26:28 +0200134 memset(rq, 0, sizeof(*rq));
135
Linus Torvalds1da177e2005-04-16 15:20:36 -0700136 INIT_LIST_HEAD(&rq->queuelist);
Jens Axboe242f9dc2008-09-14 05:55:09 -0700137 INIT_LIST_HEAD(&rq->timeout_list);
Jens Axboec7c22e42008-09-13 20:26:01 +0200138 rq->cpu = -1;
Jens Axboe63a71382008-02-08 12:41:03 +0100139 rq->q = q;
Tejun Heoa2dec7b2009-05-07 22:24:44 +0900140 rq->__sector = (sector_t) -1;
Jens Axboe2e662b62006-07-13 11:55:04 +0200141 INIT_HLIST_NODE(&rq->hash);
142 RB_CLEAR_NODE(&rq->rb_node);
FUJITA Tomonorid7e3c322008-04-29 09:54:39 +0200143 rq->cmd = rq->__cmd;
Li Zefane2494e12009-04-02 13:43:26 +0800144 rq->cmd_len = BLK_MAX_CDB;
Jens Axboe63a71382008-02-08 12:41:03 +0100145 rq->tag = -1;
Jens Axboe63a71382008-02-08 12:41:03 +0100146 rq->ref_count = 1;
Tejun Heob243ddc2009-04-23 11:05:18 +0900147 rq->start_time = jiffies;
Divyesh Shah91952912010-04-01 15:01:41 -0700148 set_start_time_ns(rq);
Jerome Marchand09e099d2011-01-05 16:57:38 +0100149 rq->part = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700150}
FUJITA Tomonori2a4aa302008-04-29 09:54:36 +0200151EXPORT_SYMBOL(blk_rq_init);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152
NeilBrown5bb23a62007-09-27 12:46:13 +0200153static void req_bio_endio(struct request *rq, struct bio *bio,
154 unsigned int nbytes, int error)
Tejun Heo797e7db2006-01-06 09:51:03 +0100155{
Tejun Heo143a87f2011-01-25 12:43:52 +0100156 if (error)
157 clear_bit(BIO_UPTODATE, &bio->bi_flags);
158 else if (!test_bit(BIO_UPTODATE, &bio->bi_flags))
159 error = -EIO;
Tejun Heo797e7db2006-01-06 09:51:03 +0100160
Tejun Heo143a87f2011-01-25 12:43:52 +0100161 if (unlikely(nbytes > bio->bi_size)) {
162 printk(KERN_ERR "%s: want %u bytes done, %u left\n",
163 __func__, nbytes, bio->bi_size);
164 nbytes = bio->bi_size;
NeilBrown5bb23a62007-09-27 12:46:13 +0200165 }
Tejun Heo143a87f2011-01-25 12:43:52 +0100166
167 if (unlikely(rq->cmd_flags & REQ_QUIET))
168 set_bit(BIO_QUIET, &bio->bi_flags);
169
170 bio->bi_size -= nbytes;
171 bio->bi_sector += (nbytes >> 9);
172
173 if (bio_integrity(bio))
174 bio_integrity_advance(bio, nbytes);
175
176 /* don't actually finish bio if it's part of flush sequence */
177 if (bio->bi_size == 0 && !(rq->cmd_flags & REQ_FLUSH_SEQ))
178 bio_endio(bio, error);
Tejun Heo797e7db2006-01-06 09:51:03 +0100179}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700180
Linus Torvalds1da177e2005-04-16 15:20:36 -0700181void blk_dump_rq_flags(struct request *rq, char *msg)
182{
183 int bit;
184
Jens Axboe6728cb02008-01-31 13:03:55 +0100185 printk(KERN_INFO "%s: dev %s: type=%x, flags=%x\n", msg,
Jens Axboe4aff5e22006-08-10 08:44:47 +0200186 rq->rq_disk ? rq->rq_disk->disk_name : "?", rq->cmd_type,
187 rq->cmd_flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188
Tejun Heo83096eb2009-05-07 22:24:39 +0900189 printk(KERN_INFO " sector %llu, nr/cnr %u/%u\n",
190 (unsigned long long)blk_rq_pos(rq),
191 blk_rq_sectors(rq), blk_rq_cur_sectors(rq));
Tejun Heo731ec492009-04-23 11:05:20 +0900192 printk(KERN_INFO " bio %p, biotail %p, buffer %p, len %u\n",
Tejun Heo2e46e8b2009-05-07 22:24:41 +0900193 rq->bio, rq->biotail, rq->buffer, blk_rq_bytes(rq));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700194
Christoph Hellwig33659eb2010-08-07 18:17:56 +0200195 if (rq->cmd_type == REQ_TYPE_BLOCK_PC) {
Jens Axboe6728cb02008-01-31 13:03:55 +0100196 printk(KERN_INFO " cdb: ");
FUJITA Tomonorid34c87e2008-04-29 14:37:52 +0200197 for (bit = 0; bit < BLK_MAX_CDB; bit++)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700198 printk("%02x ", rq->cmd[bit]);
199 printk("\n");
200 }
201}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202EXPORT_SYMBOL(blk_dump_rq_flags);
203
Jens Axboe3cca6dc2011-03-02 11:08:00 -0500204static void blk_delay_work(struct work_struct *work)
Jens Axboe6c5e0c42008-08-01 20:31:32 +0200205{
Jens Axboe3cca6dc2011-03-02 11:08:00 -0500206 struct request_queue *q;
Jens Axboe6c5e0c42008-08-01 20:31:32 +0200207
Jens Axboe3cca6dc2011-03-02 11:08:00 -0500208 q = container_of(work, struct request_queue, delay_work.work);
209 spin_lock_irq(q->queue_lock);
Christoph Hellwig24ecfbe2011-04-18 11:41:33 +0200210 __blk_run_queue(q);
Jens Axboe3cca6dc2011-03-02 11:08:00 -0500211 spin_unlock_irq(q->queue_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700212}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213
214/**
Jens Axboe3cca6dc2011-03-02 11:08:00 -0500215 * blk_delay_queue - restart queueing after defined interval
216 * @q: The &struct request_queue in question
217 * @msecs: Delay in msecs
Linus Torvalds1da177e2005-04-16 15:20:36 -0700218 *
219 * Description:
Jens Axboe3cca6dc2011-03-02 11:08:00 -0500220 * Sometimes queueing needs to be postponed for a little while, to allow
221 * resources to come back. This function will make sure that queueing is
222 * restarted around the specified time.
223 */
224void blk_delay_queue(struct request_queue *q, unsigned long msecs)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700225{
Jens Axboe4521cc42011-04-18 11:36:39 +0200226 queue_delayed_work(kblockd_workqueue, &q->delay_work,
227 msecs_to_jiffies(msecs));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700228}
Jens Axboe3cca6dc2011-03-02 11:08:00 -0500229EXPORT_SYMBOL(blk_delay_queue);
Alan D. Brunelle2ad8b1e2007-11-07 14:26:56 -0500230
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231/**
232 * blk_start_queue - restart a previously stopped queue
Jens Axboe165125e2007-07-24 09:28:11 +0200233 * @q: The &struct request_queue in question
Linus Torvalds1da177e2005-04-16 15:20:36 -0700234 *
235 * Description:
236 * blk_start_queue() will clear the stop flag on the queue, and call
237 * the request_fn for the queue if it was in a stopped state when
238 * entered. Also see blk_stop_queue(). Queue lock must be held.
239 **/
Jens Axboe165125e2007-07-24 09:28:11 +0200240void blk_start_queue(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241{
Paolo 'Blaisorblade' Giarrussoa038e252006-06-05 12:09:01 +0200242 WARN_ON(!irqs_disabled());
243
Nick Piggin75ad23b2008-04-29 14:48:33 +0200244 queue_flag_clear(QUEUE_FLAG_STOPPED, q);
Christoph Hellwig24ecfbe2011-04-18 11:41:33 +0200245 __blk_run_queue(q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247EXPORT_SYMBOL(blk_start_queue);
248
249/**
250 * blk_stop_queue - stop a queue
Jens Axboe165125e2007-07-24 09:28:11 +0200251 * @q: The &struct request_queue in question
Linus Torvalds1da177e2005-04-16 15:20:36 -0700252 *
253 * Description:
254 * The Linux block layer assumes that a block driver will consume all
255 * entries on the request queue when the request_fn strategy is called.
256 * Often this will not happen, because of hardware limitations (queue
257 * depth settings). If a device driver gets a 'queue full' response,
258 * or if it simply chooses not to queue more I/O at one point, it can
259 * call this function to prevent the request_fn from being called until
260 * the driver has signalled it's ready to go again. This happens by calling
261 * blk_start_queue() to restart queue operations. Queue lock must be held.
262 **/
Jens Axboe165125e2007-07-24 09:28:11 +0200263void blk_stop_queue(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264{
Jens Axboead3d9d72011-03-25 16:58:59 +0100265 __cancel_delayed_work(&q->delay_work);
Nick Piggin75ad23b2008-04-29 14:48:33 +0200266 queue_flag_set(QUEUE_FLAG_STOPPED, q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700267}
268EXPORT_SYMBOL(blk_stop_queue);
269
270/**
271 * blk_sync_queue - cancel any pending callbacks on a queue
272 * @q: the queue
273 *
274 * Description:
275 * The block layer may perform asynchronous callback activity
276 * on a queue, such as calling the unplug function after a timeout.
277 * A block device may call blk_sync_queue to ensure that any
278 * such activity is cancelled, thus allowing it to release resources
Michael Opdenacker59c51592007-05-09 08:57:56 +0200279 * that the callbacks might use. The caller must already have made sure
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280 * that its ->make_request_fn will not re-add plugging prior to calling
281 * this function.
282 *
Vivek Goyalda527772011-03-02 19:05:33 -0500283 * This function does not cancel any asynchronous activity arising
284 * out of elevator or throttling code. That would require elevaotor_exit()
Tejun Heo5efd6112012-03-05 13:15:12 -0800285 * and blkcg_exit_queue() to be called with queue lock initialized.
Vivek Goyalda527772011-03-02 19:05:33 -0500286 *
Linus Torvalds1da177e2005-04-16 15:20:36 -0700287 */
288void blk_sync_queue(struct request_queue *q)
289{
Jens Axboe70ed28b2008-11-19 14:38:39 +0100290 del_timer_sync(&q->timeout);
Jens Axboe3cca6dc2011-03-02 11:08:00 -0500291 cancel_delayed_work_sync(&q->delay_work);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700292}
293EXPORT_SYMBOL(blk_sync_queue);
294
295/**
Jens Axboe80a4b582008-10-14 09:51:06 +0200296 * __blk_run_queue - run a single device queue
Linus Torvalds1da177e2005-04-16 15:20:36 -0700297 * @q: The queue to run
Jens Axboe80a4b582008-10-14 09:51:06 +0200298 *
299 * Description:
300 * See @blk_run_queue. This variant must be called with the queue lock
Christoph Hellwig24ecfbe2011-04-18 11:41:33 +0200301 * held and interrupts disabled.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700302 */
Christoph Hellwig24ecfbe2011-04-18 11:41:33 +0200303void __blk_run_queue(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700304{
Tejun Heoa538cd02009-04-23 11:05:17 +0900305 if (unlikely(blk_queue_stopped(q)))
306 return;
307
Jens Axboec21e6be2011-04-19 13:32:46 +0200308 q->request_fn(q);
Nick Piggin75ad23b2008-04-29 14:48:33 +0200309}
310EXPORT_SYMBOL(__blk_run_queue);
Jens Axboedac07ec2006-05-11 08:20:16 +0200311
Nick Piggin75ad23b2008-04-29 14:48:33 +0200312/**
Christoph Hellwig24ecfbe2011-04-18 11:41:33 +0200313 * blk_run_queue_async - run a single device queue in workqueue context
314 * @q: The queue to run
315 *
316 * Description:
317 * Tells kblockd to perform the equivalent of @blk_run_queue on behalf
318 * of us.
319 */
320void blk_run_queue_async(struct request_queue *q)
321{
Shaohua Li3ec717b2011-05-18 11:22:43 +0200322 if (likely(!blk_queue_stopped(q))) {
323 __cancel_delayed_work(&q->delay_work);
Christoph Hellwig24ecfbe2011-04-18 11:41:33 +0200324 queue_delayed_work(kblockd_workqueue, &q->delay_work, 0);
Shaohua Li3ec717b2011-05-18 11:22:43 +0200325 }
Christoph Hellwig24ecfbe2011-04-18 11:41:33 +0200326}
Jens Axboec21e6be2011-04-19 13:32:46 +0200327EXPORT_SYMBOL(blk_run_queue_async);
Christoph Hellwig24ecfbe2011-04-18 11:41:33 +0200328
329/**
Nick Piggin75ad23b2008-04-29 14:48:33 +0200330 * blk_run_queue - run a single device queue
331 * @q: The queue to run
Jens Axboe80a4b582008-10-14 09:51:06 +0200332 *
333 * Description:
334 * Invoke request handling on this queue, if it has pending work to do.
Tejun Heoa7f55792009-04-23 11:05:17 +0900335 * May be used to restart queueing when a request has completed.
Nick Piggin75ad23b2008-04-29 14:48:33 +0200336 */
337void blk_run_queue(struct request_queue *q)
338{
339 unsigned long flags;
340
341 spin_lock_irqsave(q->queue_lock, flags);
Christoph Hellwig24ecfbe2011-04-18 11:41:33 +0200342 __blk_run_queue(q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700343 spin_unlock_irqrestore(q->queue_lock, flags);
344}
345EXPORT_SYMBOL(blk_run_queue);
346
Jens Axboe165125e2007-07-24 09:28:11 +0200347void blk_put_queue(struct request_queue *q)
Al Viro483f4af2006-03-18 18:34:37 -0500348{
349 kobject_put(&q->kobj);
350}
Jens Axboed86e0e82011-05-27 07:44:43 +0200351EXPORT_SYMBOL(blk_put_queue);
Al Viro483f4af2006-03-18 18:34:37 -0500352
Tejun Heoe3c78ca2011-10-19 14:32:38 +0200353/**
354 * blk_drain_queue - drain requests from request_queue
355 * @q: queue to drain
Tejun Heoc9a929d2011-10-19 14:42:16 +0200356 * @drain_all: whether to drain all requests or only the ones w/ ELVPRIV
Tejun Heoe3c78ca2011-10-19 14:32:38 +0200357 *
Tejun Heoc9a929d2011-10-19 14:42:16 +0200358 * Drain requests from @q. If @drain_all is set, all requests are drained.
359 * If not, only ELVPRIV requests are drained. The caller is responsible
360 * for ensuring that no new requests which need to be drained are queued.
Tejun Heoe3c78ca2011-10-19 14:32:38 +0200361 */
Tejun Heoc9a929d2011-10-19 14:42:16 +0200362void blk_drain_queue(struct request_queue *q, bool drain_all)
Tejun Heoe3c78ca2011-10-19 14:32:38 +0200363{
Asias He458f27a2012-06-15 08:45:25 +0200364 int i;
365
Tejun Heoe3c78ca2011-10-19 14:32:38 +0200366 while (true) {
Tejun Heo481a7d62011-12-14 00:33:37 +0100367 bool drain = false;
Tejun Heoe3c78ca2011-10-19 14:32:38 +0200368
369 spin_lock_irq(q->queue_lock);
370
Tejun Heob855b042012-03-06 21:24:55 +0100371 /*
372 * The caller might be trying to drain @q before its
373 * elevator is initialized.
374 */
375 if (q->elevator)
376 elv_drain_elevator(q);
377
Tejun Heo5efd6112012-03-05 13:15:12 -0800378 blkcg_drain_queue(q);
Tejun Heoe3c78ca2011-10-19 14:32:38 +0200379
Tejun Heo4eabc942011-12-15 20:03:04 +0100380 /*
381 * This function might be called on a queue which failed
Tejun Heob855b042012-03-06 21:24:55 +0100382 * driver init after queue creation or is not yet fully
383 * active yet. Some drivers (e.g. fd and loop) get unhappy
384 * in such cases. Kick queue iff dispatch queue has
385 * something on it and @q has request_fn set.
Tejun Heo4eabc942011-12-15 20:03:04 +0100386 */
Tejun Heob855b042012-03-06 21:24:55 +0100387 if (!list_empty(&q->queue_head) && q->request_fn)
Tejun Heo4eabc942011-12-15 20:03:04 +0100388 __blk_run_queue(q);
Tejun Heoc9a929d2011-10-19 14:42:16 +0200389
Tejun Heo8a5ecdd2012-06-04 20:40:58 -0700390 drain |= q->nr_rqs_elvpriv;
Tejun Heo481a7d62011-12-14 00:33:37 +0100391
392 /*
393 * Unfortunately, requests are queued at and tracked from
394 * multiple places and there's no single counter which can
395 * be drained. Check all the queues and counters.
396 */
397 if (drain_all) {
398 drain |= !list_empty(&q->queue_head);
399 for (i = 0; i < 2; i++) {
Tejun Heo8a5ecdd2012-06-04 20:40:58 -0700400 drain |= q->nr_rqs[i];
Tejun Heo481a7d62011-12-14 00:33:37 +0100401 drain |= q->in_flight[i];
402 drain |= !list_empty(&q->flush_queue[i]);
403 }
404 }
Tejun Heoe3c78ca2011-10-19 14:32:38 +0200405
406 spin_unlock_irq(q->queue_lock);
407
Tejun Heo481a7d62011-12-14 00:33:37 +0100408 if (!drain)
Tejun Heoe3c78ca2011-10-19 14:32:38 +0200409 break;
410 msleep(10);
411 }
Asias He458f27a2012-06-15 08:45:25 +0200412
413 /*
414 * With queue marked dead, any woken up waiter will fail the
415 * allocation path, so the wakeup chaining is lost and we're
416 * left with hung waiters. We need to wake up those waiters.
417 */
418 if (q->request_fn) {
Tejun Heoa0516612012-06-26 15:05:44 -0700419 struct request_list *rl;
420
Asias He458f27a2012-06-15 08:45:25 +0200421 spin_lock_irq(q->queue_lock);
Tejun Heoa0516612012-06-26 15:05:44 -0700422
423 blk_queue_for_each_rl(rl, q)
424 for (i = 0; i < ARRAY_SIZE(rl->wait); i++)
425 wake_up_all(&rl->wait[i]);
426
Asias He458f27a2012-06-15 08:45:25 +0200427 spin_unlock_irq(q->queue_lock);
428 }
Tejun Heoe3c78ca2011-10-19 14:32:38 +0200429}
430
Tejun Heoc9a929d2011-10-19 14:42:16 +0200431/**
Tejun Heod7325802012-03-05 13:14:58 -0800432 * blk_queue_bypass_start - enter queue bypass mode
433 * @q: queue of interest
434 *
435 * In bypass mode, only the dispatch FIFO queue of @q is used. This
436 * function makes @q enter bypass mode and drains all requests which were
Tejun Heo6ecf23a2012-03-05 13:14:59 -0800437 * throttled or issued before. On return, it's guaranteed that no request
Tejun Heo80fd9972012-04-13 14:50:53 -0700438 * is being throttled or has ELVPRIV set and blk_queue_bypass() %true
439 * inside queue or RCU read lock.
Tejun Heod7325802012-03-05 13:14:58 -0800440 */
441void blk_queue_bypass_start(struct request_queue *q)
442{
Tejun Heob82d4b12012-04-13 13:11:31 -0700443 bool drain;
444
Tejun Heod7325802012-03-05 13:14:58 -0800445 spin_lock_irq(q->queue_lock);
Tejun Heob82d4b12012-04-13 13:11:31 -0700446 drain = !q->bypass_depth++;
Tejun Heod7325802012-03-05 13:14:58 -0800447 queue_flag_set(QUEUE_FLAG_BYPASS, q);
448 spin_unlock_irq(q->queue_lock);
449
Tejun Heob82d4b12012-04-13 13:11:31 -0700450 if (drain) {
451 blk_drain_queue(q, false);
452 /* ensure blk_queue_bypass() is %true inside RCU read lock */
453 synchronize_rcu();
454 }
Tejun Heod7325802012-03-05 13:14:58 -0800455}
456EXPORT_SYMBOL_GPL(blk_queue_bypass_start);
457
458/**
459 * blk_queue_bypass_end - leave queue bypass mode
460 * @q: queue of interest
461 *
462 * Leave bypass mode and restore the normal queueing behavior.
463 */
464void blk_queue_bypass_end(struct request_queue *q)
465{
466 spin_lock_irq(q->queue_lock);
467 if (!--q->bypass_depth)
468 queue_flag_clear(QUEUE_FLAG_BYPASS, q);
469 WARN_ON_ONCE(q->bypass_depth < 0);
470 spin_unlock_irq(q->queue_lock);
471}
472EXPORT_SYMBOL_GPL(blk_queue_bypass_end);
473
474/**
Tejun Heoc9a929d2011-10-19 14:42:16 +0200475 * blk_cleanup_queue - shutdown a request queue
476 * @q: request queue to shutdown
477 *
478 * Mark @q DEAD, drain all pending requests, destroy and put it. All
479 * future requests will be failed immediately with -ENODEV.
Vivek Goyalc94a96a2011-03-02 19:04:42 -0500480 */
Jens Axboe6728cb02008-01-31 13:03:55 +0100481void blk_cleanup_queue(struct request_queue *q)
Al Viro483f4af2006-03-18 18:34:37 -0500482{
Tejun Heoc9a929d2011-10-19 14:42:16 +0200483 spinlock_t *lock = q->queue_lock;
Jens Axboee3335de92008-09-18 09:22:54 -0700484
Tejun Heoc9a929d2011-10-19 14:42:16 +0200485 /* mark @q DEAD, no new request or merges will be allowed afterwards */
Al Viro483f4af2006-03-18 18:34:37 -0500486 mutex_lock(&q->sysfs_lock);
Nick Piggin75ad23b2008-04-29 14:48:33 +0200487 queue_flag_set_unlocked(QUEUE_FLAG_DEAD, q);
Tejun Heoc9a929d2011-10-19 14:42:16 +0200488 spin_lock_irq(lock);
Tejun Heo6ecf23a2012-03-05 13:14:59 -0800489
Tejun Heo80fd9972012-04-13 14:50:53 -0700490 /*
491 * Dead queue is permanently in bypass mode till released. Note
492 * that, unlike blk_queue_bypass_start(), we aren't performing
493 * synchronize_rcu() after entering bypass mode to avoid the delay
494 * as some drivers create and destroy a lot of queues while
495 * probing. This is still safe because blk_release_queue() will be
496 * called only after the queue refcnt drops to zero and nothing,
497 * RCU or not, would be traversing the queue by then.
498 */
Tejun Heo6ecf23a2012-03-05 13:14:59 -0800499 q->bypass_depth++;
500 queue_flag_set(QUEUE_FLAG_BYPASS, q);
501
Tejun Heoc9a929d2011-10-19 14:42:16 +0200502 queue_flag_set(QUEUE_FLAG_NOMERGES, q);
503 queue_flag_set(QUEUE_FLAG_NOXMERGES, q);
504 queue_flag_set(QUEUE_FLAG_DEAD, q);
Tejun Heoc9a929d2011-10-19 14:42:16 +0200505 spin_unlock_irq(lock);
506 mutex_unlock(&q->sysfs_lock);
507
Tejun Heob855b042012-03-06 21:24:55 +0100508 /* drain all requests queued before DEAD marking */
509 blk_drain_queue(q, true);
Tejun Heoc9a929d2011-10-19 14:42:16 +0200510
511 /* @q won't process any more request, flush async actions */
512 del_timer_sync(&q->backing_dev_info.laptop_mode_wb_timer);
513 blk_sync_queue(q);
514
Asias He5e5cfac2012-05-24 23:28:52 +0800515 spin_lock_irq(lock);
516 if (q->queue_lock != &q->__queue_lock)
517 q->queue_lock = &q->__queue_lock;
518 spin_unlock_irq(lock);
519
Tejun Heoc9a929d2011-10-19 14:42:16 +0200520 /* @q is and will stay empty, shutdown and put */
Al Viro483f4af2006-03-18 18:34:37 -0500521 blk_put_queue(q);
522}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700523EXPORT_SYMBOL(blk_cleanup_queue);
524
Tejun Heo5b788ce2012-06-04 20:40:59 -0700525int blk_init_rl(struct request_list *rl, struct request_queue *q,
526 gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700527{
Mike Snitzer1abec4f2010-05-25 13:15:15 -0400528 if (unlikely(rl->rq_pool))
529 return 0;
530
Tejun Heo5b788ce2012-06-04 20:40:59 -0700531 rl->q = q;
Jens Axboe1faa16d2009-04-06 14:48:01 +0200532 rl->count[BLK_RW_SYNC] = rl->count[BLK_RW_ASYNC] = 0;
533 rl->starved[BLK_RW_SYNC] = rl->starved[BLK_RW_ASYNC] = 0;
Jens Axboe1faa16d2009-04-06 14:48:01 +0200534 init_waitqueue_head(&rl->wait[BLK_RW_SYNC]);
535 init_waitqueue_head(&rl->wait[BLK_RW_ASYNC]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700536
Christoph Lameter19460892005-06-23 00:08:19 -0700537 rl->rq_pool = mempool_create_node(BLKDEV_MIN_RQ, mempool_alloc_slab,
Tejun Heoa91a5ac2012-06-04 20:40:53 -0700538 mempool_free_slab, request_cachep,
Tejun Heo5b788ce2012-06-04 20:40:59 -0700539 gfp_mask, q->node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700540 if (!rl->rq_pool)
541 return -ENOMEM;
542
543 return 0;
544}
545
Tejun Heo5b788ce2012-06-04 20:40:59 -0700546void blk_exit_rl(struct request_list *rl)
547{
548 if (rl->rq_pool)
549 mempool_destroy(rl->rq_pool);
550}
551
Jens Axboe165125e2007-07-24 09:28:11 +0200552struct request_queue *blk_alloc_queue(gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700553{
Christoph Lameter19460892005-06-23 00:08:19 -0700554 return blk_alloc_queue_node(gfp_mask, -1);
555}
556EXPORT_SYMBOL(blk_alloc_queue);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700557
Jens Axboe165125e2007-07-24 09:28:11 +0200558struct request_queue *blk_alloc_queue_node(gfp_t gfp_mask, int node_id)
Christoph Lameter19460892005-06-23 00:08:19 -0700559{
Jens Axboe165125e2007-07-24 09:28:11 +0200560 struct request_queue *q;
Peter Zijlstrae0bf68d2007-10-16 23:25:46 -0700561 int err;
Christoph Lameter19460892005-06-23 00:08:19 -0700562
Jens Axboe8324aa92008-01-29 14:51:59 +0100563 q = kmem_cache_alloc_node(blk_requestq_cachep,
Christoph Lameter94f60302007-07-17 04:03:29 -0700564 gfp_mask | __GFP_ZERO, node_id);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700565 if (!q)
566 return NULL;
567
Dan Carpenter00380a42012-03-23 09:58:54 +0100568 q->id = ida_simple_get(&blk_queue_ida, 0, 0, gfp_mask);
Tejun Heoa73f7302011-12-14 00:33:37 +0100569 if (q->id < 0)
570 goto fail_q;
571
Jens Axboe0989a022009-06-12 14:42:56 +0200572 q->backing_dev_info.ra_pages =
573 (VM_MAX_READAHEAD * 1024) / PAGE_CACHE_SIZE;
574 q->backing_dev_info.state = 0;
575 q->backing_dev_info.capabilities = BDI_CAP_MAP_COPY;
Jens Axboed9938312009-06-12 14:45:52 +0200576 q->backing_dev_info.name = "block";
Mike Snitzer51514122011-11-23 10:59:13 +0100577 q->node = node_id;
Jens Axboe0989a022009-06-12 14:42:56 +0200578
Peter Zijlstrae0bf68d2007-10-16 23:25:46 -0700579 err = bdi_init(&q->backing_dev_info);
Tejun Heoa73f7302011-12-14 00:33:37 +0100580 if (err)
581 goto fail_id;
Peter Zijlstrae0bf68d2007-10-16 23:25:46 -0700582
Matthew Garrett31373d02010-04-06 14:25:14 +0200583 setup_timer(&q->backing_dev_info.laptop_mode_wb_timer,
584 laptop_mode_timer_fn, (unsigned long) q);
Jens Axboe242f9dc2008-09-14 05:55:09 -0700585 setup_timer(&q->timeout, blk_rq_timed_out_timer, (unsigned long) q);
Tejun Heob855b042012-03-06 21:24:55 +0100586 INIT_LIST_HEAD(&q->queue_head);
Jens Axboe242f9dc2008-09-14 05:55:09 -0700587 INIT_LIST_HEAD(&q->timeout_list);
Tejun Heoa612fdd2011-12-14 00:33:41 +0100588 INIT_LIST_HEAD(&q->icq_list);
Tejun Heo4eef3042012-03-05 13:15:18 -0800589#ifdef CONFIG_BLK_CGROUP
Tejun Heoe8989fa2012-03-05 13:15:20 -0800590 INIT_LIST_HEAD(&q->blkg_list);
Tejun Heo4eef3042012-03-05 13:15:18 -0800591#endif
Tejun Heoae1b1532011-01-25 12:43:54 +0100592 INIT_LIST_HEAD(&q->flush_queue[0]);
593 INIT_LIST_HEAD(&q->flush_queue[1]);
594 INIT_LIST_HEAD(&q->flush_data_in_flight);
Jens Axboe3cca6dc2011-03-02 11:08:00 -0500595 INIT_DELAYED_WORK(&q->delay_work, blk_delay_work);
Al Viro483f4af2006-03-18 18:34:37 -0500596
Jens Axboe8324aa92008-01-29 14:51:59 +0100597 kobject_init(&q->kobj, &blk_queue_ktype);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700598
Al Viro483f4af2006-03-18 18:34:37 -0500599 mutex_init(&q->sysfs_lock);
Neil Browne7e72bf2008-05-14 16:05:54 -0700600 spin_lock_init(&q->__queue_lock);
Al Viro483f4af2006-03-18 18:34:37 -0500601
Vivek Goyalc94a96a2011-03-02 19:04:42 -0500602 /*
603 * By default initialize queue_lock to internal lock and driver can
604 * override it later if need be.
605 */
606 q->queue_lock = &q->__queue_lock;
607
Tejun Heob82d4b12012-04-13 13:11:31 -0700608 /*
609 * A queue starts its life with bypass turned on to avoid
610 * unnecessary bypass on/off overhead and nasty surprises during
611 * init. The initial bypass will be finished at the end of
612 * blk_init_allocated_queue().
613 */
614 q->bypass_depth = 1;
615 __set_bit(QUEUE_FLAG_BYPASS, &q->queue_flags);
616
Tejun Heo5efd6112012-03-05 13:15:12 -0800617 if (blkcg_init_queue(q))
Tejun Heof51b8022012-03-05 13:15:05 -0800618 goto fail_id;
619
Linus Torvalds1da177e2005-04-16 15:20:36 -0700620 return q;
Tejun Heoa73f7302011-12-14 00:33:37 +0100621
622fail_id:
623 ida_simple_remove(&blk_queue_ida, q->id);
624fail_q:
625 kmem_cache_free(blk_requestq_cachep, q);
626 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700627}
Christoph Lameter19460892005-06-23 00:08:19 -0700628EXPORT_SYMBOL(blk_alloc_queue_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700629
630/**
631 * blk_init_queue - prepare a request queue for use with a block device
632 * @rfn: The function to be called to process requests that have been
633 * placed on the queue.
634 * @lock: Request queue spin lock
635 *
636 * Description:
637 * If a block device wishes to use the standard request handling procedures,
638 * which sorts requests and coalesces adjacent requests, then it must
639 * call blk_init_queue(). The function @rfn will be called when there
640 * are requests on the queue that need to be processed. If the device
641 * supports plugging, then @rfn may not be called immediately when requests
642 * are available on the queue, but may be called at some time later instead.
643 * Plugged queues are generally unplugged when a buffer belonging to one
644 * of the requests on the queue is needed, or due to memory pressure.
645 *
646 * @rfn is not required, or even expected, to remove all requests off the
647 * queue, but only as many as it can handle at a time. If it does leave
648 * requests on the queue, it is responsible for arranging that the requests
649 * get dealt with eventually.
650 *
651 * The queue spin lock must be held while manipulating the requests on the
Paolo 'Blaisorblade' Giarrussoa038e252006-06-05 12:09:01 +0200652 * request queue; this lock will be taken also from interrupt context, so irq
653 * disabling is needed for it.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700654 *
Randy Dunlap710027a2008-08-19 20:13:11 +0200655 * Function returns a pointer to the initialized request queue, or %NULL if
Linus Torvalds1da177e2005-04-16 15:20:36 -0700656 * it didn't succeed.
657 *
658 * Note:
659 * blk_init_queue() must be paired with a blk_cleanup_queue() call
660 * when the block device is deactivated (such as at module unload).
661 **/
Christoph Lameter19460892005-06-23 00:08:19 -0700662
Jens Axboe165125e2007-07-24 09:28:11 +0200663struct request_queue *blk_init_queue(request_fn_proc *rfn, spinlock_t *lock)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700664{
Christoph Lameter19460892005-06-23 00:08:19 -0700665 return blk_init_queue_node(rfn, lock, -1);
666}
667EXPORT_SYMBOL(blk_init_queue);
668
Jens Axboe165125e2007-07-24 09:28:11 +0200669struct request_queue *
Christoph Lameter19460892005-06-23 00:08:19 -0700670blk_init_queue_node(request_fn_proc *rfn, spinlock_t *lock, int node_id)
671{
Mike Snitzerc86d1b82010-06-03 11:34:52 -0600672 struct request_queue *uninit_q, *q;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700673
Mike Snitzerc86d1b82010-06-03 11:34:52 -0600674 uninit_q = blk_alloc_queue_node(GFP_KERNEL, node_id);
675 if (!uninit_q)
676 return NULL;
677
Mike Snitzer51514122011-11-23 10:59:13 +0100678 q = blk_init_allocated_queue(uninit_q, rfn, lock);
Mike Snitzerc86d1b82010-06-03 11:34:52 -0600679 if (!q)
680 blk_cleanup_queue(uninit_q);
681
682 return q;
Mike Snitzer01effb02010-05-11 08:57:42 +0200683}
684EXPORT_SYMBOL(blk_init_queue_node);
685
686struct request_queue *
687blk_init_allocated_queue(struct request_queue *q, request_fn_proc *rfn,
688 spinlock_t *lock)
689{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700690 if (!q)
691 return NULL;
692
Tejun Heoa0516612012-06-26 15:05:44 -0700693 if (blk_init_rl(&q->root_rl, q, GFP_KERNEL))
Al Viro8669aaf2006-03-18 13:50:00 -0500694 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700695
696 q->request_fn = rfn;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700697 q->prep_rq_fn = NULL;
James Bottomley28018c22010-07-01 19:49:17 +0900698 q->unprep_rq_fn = NULL;
Jens Axboebc58ba92009-01-23 10:54:44 +0100699 q->queue_flags = QUEUE_FLAG_DEFAULT;
Vivek Goyalc94a96a2011-03-02 19:04:42 -0500700
701 /* Override internal queue lock with supplied lock pointer */
702 if (lock)
703 q->queue_lock = lock;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700704
Jens Axboef3b144a2009-03-06 08:48:33 +0100705 /*
706 * This also sets hw/phys segments, boundary and size
707 */
Jens Axboec20e8de2011-09-12 12:03:37 +0200708 blk_queue_make_request(q, blk_queue_bio);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700709
Alan Stern44ec9542007-02-20 11:01:57 -0500710 q->sg_reserved_size = INT_MAX;
711
Tejun Heob82d4b12012-04-13 13:11:31 -0700712 /* init elevator */
713 if (elevator_init(q, NULL))
714 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700715
Tejun Heob82d4b12012-04-13 13:11:31 -0700716 /* all done, end the initial bypass */
717 blk_queue_bypass_end(q);
718 return q;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700719}
Mike Snitzer51514122011-11-23 10:59:13 +0100720EXPORT_SYMBOL(blk_init_allocated_queue);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700721
Tejun Heo09ac46c2011-12-14 00:33:38 +0100722bool blk_get_queue(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700723{
Tejun Heo34f60552011-12-14 00:33:37 +0100724 if (likely(!blk_queue_dead(q))) {
Tejun Heo09ac46c2011-12-14 00:33:38 +0100725 __blk_get_queue(q);
726 return true;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700727 }
728
Tejun Heo09ac46c2011-12-14 00:33:38 +0100729 return false;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700730}
Jens Axboed86e0e82011-05-27 07:44:43 +0200731EXPORT_SYMBOL(blk_get_queue);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700732
Tejun Heo5b788ce2012-06-04 20:40:59 -0700733static inline void blk_free_request(struct request_list *rl, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700734{
Tejun Heof1f8cc92011-12-14 00:33:42 +0100735 if (rq->cmd_flags & REQ_ELVPRIV) {
Tejun Heo5b788ce2012-06-04 20:40:59 -0700736 elv_put_request(rl->q, rq);
Tejun Heof1f8cc92011-12-14 00:33:42 +0100737 if (rq->elv.icq)
Tejun Heo11a31222012-02-07 07:51:30 +0100738 put_io_context(rq->elv.icq->ioc);
Tejun Heof1f8cc92011-12-14 00:33:42 +0100739 }
740
Tejun Heo5b788ce2012-06-04 20:40:59 -0700741 mempool_free(rq, rl->rq_pool);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700742}
743
Linus Torvalds1da177e2005-04-16 15:20:36 -0700744/*
745 * ioc_batching returns true if the ioc is a valid batching request and
746 * should be given priority access to a request.
747 */
Jens Axboe165125e2007-07-24 09:28:11 +0200748static inline int ioc_batching(struct request_queue *q, struct io_context *ioc)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700749{
750 if (!ioc)
751 return 0;
752
753 /*
754 * Make sure the process is able to allocate at least 1 request
755 * even if the batch times out, otherwise we could theoretically
756 * lose wakeups.
757 */
758 return ioc->nr_batch_requests == q->nr_batching ||
759 (ioc->nr_batch_requests > 0
760 && time_before(jiffies, ioc->last_waited + BLK_BATCH_TIME));
761}
762
763/*
764 * ioc_set_batching sets ioc to be a new "batcher" if it is not one. This
765 * will cause the process to be a "batcher" on all queues in the system. This
766 * is the behaviour we want though - once it gets a wakeup it should be given
767 * a nice run.
768 */
Jens Axboe165125e2007-07-24 09:28:11 +0200769static void ioc_set_batching(struct request_queue *q, struct io_context *ioc)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700770{
771 if (!ioc || ioc_batching(q, ioc))
772 return;
773
774 ioc->nr_batch_requests = q->nr_batching;
775 ioc->last_waited = jiffies;
776}
777
Tejun Heo5b788ce2012-06-04 20:40:59 -0700778static void __freed_request(struct request_list *rl, int sync)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700779{
Tejun Heo5b788ce2012-06-04 20:40:59 -0700780 struct request_queue *q = rl->q;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700781
Tejun Heoa0516612012-06-26 15:05:44 -0700782 /*
783 * bdi isn't aware of blkcg yet. As all async IOs end up root
784 * blkcg anyway, just use root blkcg state.
785 */
786 if (rl == &q->root_rl &&
787 rl->count[sync] < queue_congestion_off_threshold(q))
Jens Axboe1faa16d2009-04-06 14:48:01 +0200788 blk_clear_queue_congested(q, sync);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700789
Jens Axboe1faa16d2009-04-06 14:48:01 +0200790 if (rl->count[sync] + 1 <= q->nr_requests) {
791 if (waitqueue_active(&rl->wait[sync]))
792 wake_up(&rl->wait[sync]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700793
Tejun Heo5b788ce2012-06-04 20:40:59 -0700794 blk_clear_rl_full(rl, sync);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700795 }
796}
797
798/*
799 * A request has just been released. Account for it, update the full and
800 * congestion status, wake up any waiters. Called under q->queue_lock.
801 */
Tejun Heo5b788ce2012-06-04 20:40:59 -0700802static void freed_request(struct request_list *rl, unsigned int flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700803{
Tejun Heo5b788ce2012-06-04 20:40:59 -0700804 struct request_queue *q = rl->q;
Tejun Heo75eb6c32011-10-19 14:31:22 +0200805 int sync = rw_is_sync(flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700806
Tejun Heo8a5ecdd2012-06-04 20:40:58 -0700807 q->nr_rqs[sync]--;
Jens Axboe1faa16d2009-04-06 14:48:01 +0200808 rl->count[sync]--;
Tejun Heo75eb6c32011-10-19 14:31:22 +0200809 if (flags & REQ_ELVPRIV)
Tejun Heo8a5ecdd2012-06-04 20:40:58 -0700810 q->nr_rqs_elvpriv--;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700811
Tejun Heo5b788ce2012-06-04 20:40:59 -0700812 __freed_request(rl, sync);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700813
Jens Axboe1faa16d2009-04-06 14:48:01 +0200814 if (unlikely(rl->starved[sync ^ 1]))
Tejun Heo5b788ce2012-06-04 20:40:59 -0700815 __freed_request(rl, sync ^ 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700816}
817
Linus Torvalds1da177e2005-04-16 15:20:36 -0700818/*
Mike Snitzer9d5a4e92011-02-11 11:05:46 +0100819 * Determine if elevator data should be initialized when allocating the
820 * request associated with @bio.
821 */
822static bool blk_rq_should_init_elevator(struct bio *bio)
823{
824 if (!bio)
825 return true;
826
827 /*
828 * Flush requests do not use the elevator so skip initialization.
829 * This allows a request to share the flush and elevator data.
830 */
831 if (bio->bi_rw & (REQ_FLUSH | REQ_FUA))
832 return false;
833
834 return true;
835}
836
Tejun Heoda8303c2011-10-19 14:33:05 +0200837/**
Tejun Heo852c7882012-03-05 13:15:27 -0800838 * rq_ioc - determine io_context for request allocation
839 * @bio: request being allocated is for this bio (can be %NULL)
840 *
841 * Determine io_context to use for request allocation for @bio. May return
842 * %NULL if %current->io_context doesn't exist.
843 */
844static struct io_context *rq_ioc(struct bio *bio)
845{
846#ifdef CONFIG_BLK_CGROUP
847 if (bio && bio->bi_ioc)
848 return bio->bi_ioc;
849#endif
850 return current->io_context;
851}
852
853/**
Tejun Heoa06e05e2012-06-04 20:40:55 -0700854 * __get_request - get a free request
Tejun Heo5b788ce2012-06-04 20:40:59 -0700855 * @rl: request list to allocate from
Tejun Heoda8303c2011-10-19 14:33:05 +0200856 * @rw_flags: RW and SYNC flags
857 * @bio: bio to allocate request for (can be %NULL)
858 * @gfp_mask: allocation mask
859 *
860 * Get a free request from @q. This function may fail under memory
861 * pressure or if @q is dead.
862 *
863 * Must be callled with @q->queue_lock held and,
864 * Returns %NULL on failure, with @q->queue_lock held.
865 * Returns !%NULL on success, with @q->queue_lock *not held*.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700866 */
Tejun Heo5b788ce2012-06-04 20:40:59 -0700867static struct request *__get_request(struct request_list *rl, int rw_flags,
Tejun Heoa06e05e2012-06-04 20:40:55 -0700868 struct bio *bio, gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700869{
Tejun Heo5b788ce2012-06-04 20:40:59 -0700870 struct request_queue *q = rl->q;
Tejun Heob6792812012-03-05 13:15:23 -0800871 struct request *rq;
Tejun Heo7f4b35d2012-06-04 20:40:56 -0700872 struct elevator_type *et = q->elevator->type;
873 struct io_context *ioc = rq_ioc(bio);
Tejun Heof1f8cc92011-12-14 00:33:42 +0100874 struct io_cq *icq = NULL;
Jens Axboe1faa16d2009-04-06 14:48:01 +0200875 const bool is_sync = rw_is_sync(rw_flags) != 0;
Tejun Heo75eb6c32011-10-19 14:31:22 +0200876 int may_queue;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700877
Tejun Heo34f60552011-12-14 00:33:37 +0100878 if (unlikely(blk_queue_dead(q)))
Tejun Heoda8303c2011-10-19 14:33:05 +0200879 return NULL;
880
Jens Axboe7749a8d2006-12-13 13:02:26 +0100881 may_queue = elv_may_queue(q, rw_flags);
Jens Axboe88ee5ef2005-11-12 11:09:12 +0100882 if (may_queue == ELV_MQUEUE_NO)
883 goto rq_starved;
884
Jens Axboe1faa16d2009-04-06 14:48:01 +0200885 if (rl->count[is_sync]+1 >= queue_congestion_on_threshold(q)) {
886 if (rl->count[is_sync]+1 >= q->nr_requests) {
Tejun Heof2dbd762011-12-14 00:33:40 +0100887 /*
Jens Axboe88ee5ef2005-11-12 11:09:12 +0100888 * The queue will fill after this allocation, so set
889 * it as full, and mark this process as "batching".
890 * This process will be allowed to complete a batch of
891 * requests, others will be blocked.
892 */
Tejun Heo5b788ce2012-06-04 20:40:59 -0700893 if (!blk_rl_full(rl, is_sync)) {
Jens Axboe88ee5ef2005-11-12 11:09:12 +0100894 ioc_set_batching(q, ioc);
Tejun Heo5b788ce2012-06-04 20:40:59 -0700895 blk_set_rl_full(rl, is_sync);
Jens Axboe88ee5ef2005-11-12 11:09:12 +0100896 } else {
897 if (may_queue != ELV_MQUEUE_MUST
898 && !ioc_batching(q, ioc)) {
899 /*
900 * The queue is full and the allocating
901 * process is not a "batcher", and not
902 * exempted by the IO scheduler
903 */
Tejun Heob6792812012-03-05 13:15:23 -0800904 return NULL;
Jens Axboe88ee5ef2005-11-12 11:09:12 +0100905 }
906 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700907 }
Tejun Heoa0516612012-06-26 15:05:44 -0700908 /*
909 * bdi isn't aware of blkcg yet. As all async IOs end up
910 * root blkcg anyway, just use root blkcg state.
911 */
912 if (rl == &q->root_rl)
913 blk_set_queue_congested(q, is_sync);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700914 }
915
Jens Axboe082cf692005-06-28 16:35:11 +0200916 /*
917 * Only allow batching queuers to allocate up to 50% over the defined
918 * limit of requests, otherwise we could have thousands of requests
919 * allocated with any setting of ->nr_requests
920 */
Jens Axboe1faa16d2009-04-06 14:48:01 +0200921 if (rl->count[is_sync] >= (3 * q->nr_requests / 2))
Tejun Heob6792812012-03-05 13:15:23 -0800922 return NULL;
Hugh Dickinsfd782a42005-06-29 15:15:40 +0100923
Tejun Heo8a5ecdd2012-06-04 20:40:58 -0700924 q->nr_rqs[is_sync]++;
Jens Axboe1faa16d2009-04-06 14:48:01 +0200925 rl->count[is_sync]++;
926 rl->starved[is_sync] = 0;
Tejun Heocb98fc82005-10-28 08:29:39 +0200927
Tejun Heof1f8cc92011-12-14 00:33:42 +0100928 /*
929 * Decide whether the new request will be managed by elevator. If
930 * so, mark @rw_flags and increment elvpriv. Non-zero elvpriv will
931 * prevent the current elevator from being destroyed until the new
932 * request is freed. This guarantees icq's won't be destroyed and
933 * makes creating new ones safe.
934 *
935 * Also, lookup icq while holding queue_lock. If it doesn't exist,
936 * it will be created after releasing queue_lock.
937 */
Tejun Heod7325802012-03-05 13:14:58 -0800938 if (blk_rq_should_init_elevator(bio) && !blk_queue_bypass(q)) {
Tejun Heo75eb6c32011-10-19 14:31:22 +0200939 rw_flags |= REQ_ELVPRIV;
Tejun Heo8a5ecdd2012-06-04 20:40:58 -0700940 q->nr_rqs_elvpriv++;
Tejun Heof1f8cc92011-12-14 00:33:42 +0100941 if (et->icq_cache && ioc)
942 icq = ioc_lookup_icq(ioc, q);
Mike Snitzer9d5a4e92011-02-11 11:05:46 +0100943 }
Tejun Heocb98fc82005-10-28 08:29:39 +0200944
Jens Axboef253b862010-10-24 22:06:02 +0200945 if (blk_queue_io_stat(q))
946 rw_flags |= REQ_IO_STAT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700947 spin_unlock_irq(q->queue_lock);
948
Tejun Heo29e2b092012-04-19 16:29:21 -0700949 /* allocate and init request */
Tejun Heo5b788ce2012-06-04 20:40:59 -0700950 rq = mempool_alloc(rl->rq_pool, gfp_mask);
Tejun Heo29e2b092012-04-19 16:29:21 -0700951 if (!rq)
Tejun Heob6792812012-03-05 13:15:23 -0800952 goto fail_alloc;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700953
Tejun Heo29e2b092012-04-19 16:29:21 -0700954 blk_rq_init(q, rq);
Tejun Heoa0516612012-06-26 15:05:44 -0700955 blk_rq_set_rl(rq, rl);
Tejun Heo29e2b092012-04-19 16:29:21 -0700956 rq->cmd_flags = rw_flags | REQ_ALLOCED;
957
Tejun Heoaaf7c682012-04-19 16:29:22 -0700958 /* init elvpriv */
Tejun Heo29e2b092012-04-19 16:29:21 -0700959 if (rw_flags & REQ_ELVPRIV) {
Tejun Heoaaf7c682012-04-19 16:29:22 -0700960 if (unlikely(et->icq_cache && !icq)) {
Tejun Heo7f4b35d2012-06-04 20:40:56 -0700961 if (ioc)
962 icq = ioc_create_icq(ioc, q, gfp_mask);
Tejun Heoaaf7c682012-04-19 16:29:22 -0700963 if (!icq)
964 goto fail_elvpriv;
Tejun Heo29e2b092012-04-19 16:29:21 -0700965 }
Tejun Heoaaf7c682012-04-19 16:29:22 -0700966
967 rq->elv.icq = icq;
968 if (unlikely(elv_set_request(q, rq, bio, gfp_mask)))
969 goto fail_elvpriv;
970
971 /* @rq->elv.icq holds io_context until @rq is freed */
Tejun Heo29e2b092012-04-19 16:29:21 -0700972 if (icq)
973 get_io_context(icq->ioc);
974 }
Tejun Heoaaf7c682012-04-19 16:29:22 -0700975out:
Jens Axboe88ee5ef2005-11-12 11:09:12 +0100976 /*
977 * ioc may be NULL here, and ioc_batching will be false. That's
978 * OK, if the queue is under the request limit then requests need
979 * not count toward the nr_batch_requests limit. There will always
980 * be some limit enforced by BLK_BATCH_TIME.
981 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700982 if (ioc_batching(q, ioc))
983 ioc->nr_batch_requests--;
Jens Axboe6728cb02008-01-31 13:03:55 +0100984
Jens Axboe1faa16d2009-04-06 14:48:01 +0200985 trace_block_getrq(q, bio, rw_flags & 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700986 return rq;
Tejun Heob6792812012-03-05 13:15:23 -0800987
Tejun Heoaaf7c682012-04-19 16:29:22 -0700988fail_elvpriv:
989 /*
990 * elvpriv init failed. ioc, icq and elvpriv aren't mempool backed
991 * and may fail indefinitely under memory pressure and thus
992 * shouldn't stall IO. Treat this request as !elvpriv. This will
993 * disturb iosched and blkcg but weird is bettern than dead.
994 */
995 printk_ratelimited(KERN_WARNING "%s: request aux data allocation failed, iosched may be disturbed\n",
996 dev_name(q->backing_dev_info.dev));
997
998 rq->cmd_flags &= ~REQ_ELVPRIV;
999 rq->elv.icq = NULL;
1000
1001 spin_lock_irq(q->queue_lock);
Tejun Heo8a5ecdd2012-06-04 20:40:58 -07001002 q->nr_rqs_elvpriv--;
Tejun Heoaaf7c682012-04-19 16:29:22 -07001003 spin_unlock_irq(q->queue_lock);
1004 goto out;
1005
Tejun Heob6792812012-03-05 13:15:23 -08001006fail_alloc:
1007 /*
1008 * Allocation failed presumably due to memory. Undo anything we
1009 * might have messed up.
1010 *
1011 * Allocating task should really be put onto the front of the wait
1012 * queue, but this is pretty rare.
1013 */
1014 spin_lock_irq(q->queue_lock);
Tejun Heo5b788ce2012-06-04 20:40:59 -07001015 freed_request(rl, rw_flags);
Tejun Heob6792812012-03-05 13:15:23 -08001016
1017 /*
1018 * in the very unlikely event that allocation failed and no
1019 * requests for this direction was pending, mark us starved so that
1020 * freeing of a request in the other direction will notice
1021 * us. another possible fix would be to split the rq mempool into
1022 * READ and WRITE
1023 */
1024rq_starved:
1025 if (unlikely(rl->count[is_sync] == 0))
1026 rl->starved[is_sync] = 1;
1027 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001028}
1029
Tejun Heoda8303c2011-10-19 14:33:05 +02001030/**
Tejun Heoa06e05e2012-06-04 20:40:55 -07001031 * get_request - get a free request
Tejun Heoda8303c2011-10-19 14:33:05 +02001032 * @q: request_queue to allocate request from
1033 * @rw_flags: RW and SYNC flags
1034 * @bio: bio to allocate request for (can be %NULL)
Tejun Heoa06e05e2012-06-04 20:40:55 -07001035 * @gfp_mask: allocation mask
Nick Piggind6344532005-06-28 20:45:14 -07001036 *
Tejun Heoa06e05e2012-06-04 20:40:55 -07001037 * Get a free request from @q. If %__GFP_WAIT is set in @gfp_mask, this
1038 * function keeps retrying under memory pressure and fails iff @q is dead.
Tejun Heoda8303c2011-10-19 14:33:05 +02001039 *
1040 * Must be callled with @q->queue_lock held and,
1041 * Returns %NULL on failure, with @q->queue_lock held.
1042 * Returns !%NULL on success, with @q->queue_lock *not held*.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001043 */
Tejun Heoa06e05e2012-06-04 20:40:55 -07001044static struct request *get_request(struct request_queue *q, int rw_flags,
1045 struct bio *bio, gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001046{
Jens Axboe1faa16d2009-04-06 14:48:01 +02001047 const bool is_sync = rw_is_sync(rw_flags) != 0;
Tejun Heoa06e05e2012-06-04 20:40:55 -07001048 DEFINE_WAIT(wait);
Tejun Heoa0516612012-06-26 15:05:44 -07001049 struct request_list *rl;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001050 struct request *rq;
Tejun Heoa0516612012-06-26 15:05:44 -07001051
1052 rl = blk_get_rl(q, bio); /* transferred to @rq on success */
Tejun Heoa06e05e2012-06-04 20:40:55 -07001053retry:
Tejun Heoa0516612012-06-26 15:05:44 -07001054 rq = __get_request(rl, rw_flags, bio, gfp_mask);
Tejun Heoa06e05e2012-06-04 20:40:55 -07001055 if (rq)
1056 return rq;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001057
Tejun Heoa0516612012-06-26 15:05:44 -07001058 if (!(gfp_mask & __GFP_WAIT) || unlikely(blk_queue_dead(q))) {
1059 blk_put_rl(rl);
Tejun Heoa06e05e2012-06-04 20:40:55 -07001060 return NULL;
Tejun Heoa0516612012-06-26 15:05:44 -07001061 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001062
Tejun Heoa06e05e2012-06-04 20:40:55 -07001063 /* wait on @rl and retry */
1064 prepare_to_wait_exclusive(&rl->wait[is_sync], &wait,
1065 TASK_UNINTERRUPTIBLE);
Tejun Heoda8303c2011-10-19 14:33:05 +02001066
Tejun Heoa06e05e2012-06-04 20:40:55 -07001067 trace_block_sleeprq(q, bio, rw_flags & 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001068
Tejun Heoa06e05e2012-06-04 20:40:55 -07001069 spin_unlock_irq(q->queue_lock);
1070 io_schedule();
Linus Torvalds1da177e2005-04-16 15:20:36 -07001071
Tejun Heoa06e05e2012-06-04 20:40:55 -07001072 /*
1073 * After sleeping, we become a "batching" process and will be able
1074 * to allocate at least one request, and up to a big batch of them
1075 * for a small period time. See ioc_batching, ioc_set_batching
1076 */
Tejun Heoa06e05e2012-06-04 20:40:55 -07001077 ioc_set_batching(q, current->io_context);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001078
Tejun Heoa06e05e2012-06-04 20:40:55 -07001079 spin_lock_irq(q->queue_lock);
1080 finish_wait(&rl->wait[is_sync], &wait);
Jens Axboe2056a782006-03-23 20:00:26 +01001081
Tejun Heoa06e05e2012-06-04 20:40:55 -07001082 goto retry;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001083}
1084
Jens Axboe165125e2007-07-24 09:28:11 +02001085struct request *blk_get_request(struct request_queue *q, int rw, gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001086{
1087 struct request *rq;
1088
1089 BUG_ON(rw != READ && rw != WRITE);
1090
Tejun Heo7f4b35d2012-06-04 20:40:56 -07001091 /* create ioc upfront */
1092 create_io_context(gfp_mask, q->node);
1093
Nick Piggind6344532005-06-28 20:45:14 -07001094 spin_lock_irq(q->queue_lock);
Tejun Heoa06e05e2012-06-04 20:40:55 -07001095 rq = get_request(q, rw, NULL, gfp_mask);
Tejun Heoda8303c2011-10-19 14:33:05 +02001096 if (!rq)
1097 spin_unlock_irq(q->queue_lock);
Nick Piggind6344532005-06-28 20:45:14 -07001098 /* q->queue_lock is unlocked at this point */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001099
1100 return rq;
1101}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001102EXPORT_SYMBOL(blk_get_request);
1103
1104/**
Boaz Harrosh79eb63e2009-05-17 18:57:15 +03001105 * blk_make_request - given a bio, allocate a corresponding struct request.
Randy Dunlap8ebf9752009-06-11 20:00:41 -07001106 * @q: target request queue
Boaz Harrosh79eb63e2009-05-17 18:57:15 +03001107 * @bio: The bio describing the memory mappings that will be submitted for IO.
1108 * It may be a chained-bio properly constructed by block/bio layer.
Randy Dunlap8ebf9752009-06-11 20:00:41 -07001109 * @gfp_mask: gfp flags to be used for memory allocation
Jens Axboedc72ef42006-07-20 14:54:05 +02001110 *
Boaz Harrosh79eb63e2009-05-17 18:57:15 +03001111 * blk_make_request is the parallel of generic_make_request for BLOCK_PC
1112 * type commands. Where the struct request needs to be farther initialized by
1113 * the caller. It is passed a &struct bio, which describes the memory info of
1114 * the I/O transfer.
1115 *
1116 * The caller of blk_make_request must make sure that bi_io_vec
1117 * are set to describe the memory buffers. That bio_data_dir() will return
1118 * the needed direction of the request. (And all bio's in the passed bio-chain
1119 * are properly set accordingly)
1120 *
1121 * If called under none-sleepable conditions, mapped bio buffers must not
1122 * need bouncing, by calling the appropriate masked or flagged allocator,
1123 * suitable for the target device. Otherwise the call to blk_queue_bounce will
1124 * BUG.
Jens Axboe53674ac2009-05-19 19:52:35 +02001125 *
1126 * WARNING: When allocating/cloning a bio-chain, careful consideration should be
1127 * given to how you allocate bios. In particular, you cannot use __GFP_WAIT for
1128 * anything but the first bio in the chain. Otherwise you risk waiting for IO
1129 * completion of a bio that hasn't been submitted yet, thus resulting in a
1130 * deadlock. Alternatively bios should be allocated using bio_kmalloc() instead
1131 * of bio_alloc(), as that avoids the mempool deadlock.
1132 * If possible a big IO should be split into smaller parts when allocation
1133 * fails. Partial allocation should not be an error, or you risk a live-lock.
Jens Axboedc72ef42006-07-20 14:54:05 +02001134 */
Boaz Harrosh79eb63e2009-05-17 18:57:15 +03001135struct request *blk_make_request(struct request_queue *q, struct bio *bio,
1136 gfp_t gfp_mask)
Jens Axboedc72ef42006-07-20 14:54:05 +02001137{
Boaz Harrosh79eb63e2009-05-17 18:57:15 +03001138 struct request *rq = blk_get_request(q, bio_data_dir(bio), gfp_mask);
1139
1140 if (unlikely(!rq))
1141 return ERR_PTR(-ENOMEM);
1142
1143 for_each_bio(bio) {
1144 struct bio *bounce_bio = bio;
1145 int ret;
1146
1147 blk_queue_bounce(q, &bounce_bio);
1148 ret = blk_rq_append_bio(q, rq, bounce_bio);
1149 if (unlikely(ret)) {
1150 blk_put_request(rq);
1151 return ERR_PTR(ret);
1152 }
1153 }
1154
1155 return rq;
Jens Axboedc72ef42006-07-20 14:54:05 +02001156}
Boaz Harrosh79eb63e2009-05-17 18:57:15 +03001157EXPORT_SYMBOL(blk_make_request);
Jens Axboedc72ef42006-07-20 14:54:05 +02001158
1159/**
Linus Torvalds1da177e2005-04-16 15:20:36 -07001160 * blk_requeue_request - put a request back on queue
1161 * @q: request queue where request should be inserted
1162 * @rq: request to be inserted
1163 *
1164 * Description:
1165 * Drivers often keep queueing requests until the hardware cannot accept
1166 * more, when that condition happens we need to put the request back
1167 * on the queue. Must be called with queue lock held.
1168 */
Jens Axboe165125e2007-07-24 09:28:11 +02001169void blk_requeue_request(struct request_queue *q, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001170{
Jens Axboe242f9dc2008-09-14 05:55:09 -07001171 blk_delete_timer(rq);
1172 blk_clear_rq_complete(rq);
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +01001173 trace_block_rq_requeue(q, rq);
Jens Axboe2056a782006-03-23 20:00:26 +01001174
Linus Torvalds1da177e2005-04-16 15:20:36 -07001175 if (blk_rq_tagged(rq))
1176 blk_queue_end_tag(q, rq);
1177
James Bottomleyba396a62009-05-27 14:17:08 +02001178 BUG_ON(blk_queued_rq(rq));
1179
Linus Torvalds1da177e2005-04-16 15:20:36 -07001180 elv_requeue_request(q, rq);
1181}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001182EXPORT_SYMBOL(blk_requeue_request);
1183
Jens Axboe73c10102011-03-08 13:19:51 +01001184static void add_acct_request(struct request_queue *q, struct request *rq,
1185 int where)
1186{
1187 drive_stat_acct(rq, 1);
Jens Axboe7eaceac2011-03-10 08:52:07 +01001188 __elv_add_request(q, rq, where);
Jens Axboe73c10102011-03-08 13:19:51 +01001189}
1190
Tejun Heo074a7ac2008-08-25 19:56:14 +09001191static void part_round_stats_single(int cpu, struct hd_struct *part,
1192 unsigned long now)
1193{
1194 if (now == part->stamp)
1195 return;
1196
Nikanth Karthikesan316d3152009-10-06 20:16:55 +02001197 if (part_in_flight(part)) {
Tejun Heo074a7ac2008-08-25 19:56:14 +09001198 __part_stat_add(cpu, part, time_in_queue,
Nikanth Karthikesan316d3152009-10-06 20:16:55 +02001199 part_in_flight(part) * (now - part->stamp));
Tejun Heo074a7ac2008-08-25 19:56:14 +09001200 __part_stat_add(cpu, part, io_ticks, (now - part->stamp));
1201 }
1202 part->stamp = now;
1203}
1204
1205/**
Randy Dunlap496aa8a2008-10-16 07:46:23 +02001206 * part_round_stats() - Round off the performance stats on a struct disk_stats.
1207 * @cpu: cpu number for stats access
1208 * @part: target partition
Linus Torvalds1da177e2005-04-16 15:20:36 -07001209 *
1210 * The average IO queue length and utilisation statistics are maintained
1211 * by observing the current state of the queue length and the amount of
1212 * time it has been in this state for.
1213 *
1214 * Normally, that accounting is done on IO completion, but that can result
1215 * in more than a second's worth of IO being accounted for within any one
1216 * second, leading to >100% utilisation. To deal with that, we call this
1217 * function to do a round-off before returning the results when reading
1218 * /proc/diskstats. This accounts immediately for all queue usage up to
1219 * the current jiffies and restarts the counters again.
1220 */
Tejun Heoc9959052008-08-25 19:47:21 +09001221void part_round_stats(int cpu, struct hd_struct *part)
Jerome Marchand6f2576a2008-02-08 11:04:35 +01001222{
1223 unsigned long now = jiffies;
1224
Tejun Heo074a7ac2008-08-25 19:56:14 +09001225 if (part->partno)
1226 part_round_stats_single(cpu, &part_to_disk(part)->part0, now);
1227 part_round_stats_single(cpu, part, now);
Jerome Marchand6f2576a2008-02-08 11:04:35 +01001228}
Tejun Heo074a7ac2008-08-25 19:56:14 +09001229EXPORT_SYMBOL_GPL(part_round_stats);
Jerome Marchand6f2576a2008-02-08 11:04:35 +01001230
Linus Torvalds1da177e2005-04-16 15:20:36 -07001231/*
1232 * queue lock must be held
1233 */
Jens Axboe165125e2007-07-24 09:28:11 +02001234void __blk_put_request(struct request_queue *q, struct request *req)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001235{
Linus Torvalds1da177e2005-04-16 15:20:36 -07001236 if (unlikely(!q))
1237 return;
1238 if (unlikely(--req->ref_count))
1239 return;
1240
Tejun Heo8922e162005-10-20 16:23:44 +02001241 elv_completed_request(q, req);
1242
Boaz Harrosh1cd96c22009-03-24 12:35:07 +01001243 /* this is a bio leak */
1244 WARN_ON(req->bio != NULL);
1245
Linus Torvalds1da177e2005-04-16 15:20:36 -07001246 /*
1247 * Request may not have originated from ll_rw_blk. if not,
1248 * it didn't come out of our reserved rq pools
1249 */
Jens Axboe49171e52006-08-10 08:59:11 +02001250 if (req->cmd_flags & REQ_ALLOCED) {
Tejun Heo75eb6c32011-10-19 14:31:22 +02001251 unsigned int flags = req->cmd_flags;
Tejun Heoa0516612012-06-26 15:05:44 -07001252 struct request_list *rl = blk_rq_rl(req);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001253
Linus Torvalds1da177e2005-04-16 15:20:36 -07001254 BUG_ON(!list_empty(&req->queuelist));
Jens Axboe98170642006-07-28 09:23:08 +02001255 BUG_ON(!hlist_unhashed(&req->hash));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001256
Tejun Heoa0516612012-06-26 15:05:44 -07001257 blk_free_request(rl, req);
1258 freed_request(rl, flags);
1259 blk_put_rl(rl);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001260 }
1261}
Mike Christie6e39b69e2005-11-11 05:30:24 -06001262EXPORT_SYMBOL_GPL(__blk_put_request);
1263
Linus Torvalds1da177e2005-04-16 15:20:36 -07001264void blk_put_request(struct request *req)
1265{
Tejun Heo8922e162005-10-20 16:23:44 +02001266 unsigned long flags;
Jens Axboe165125e2007-07-24 09:28:11 +02001267 struct request_queue *q = req->q;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001268
FUJITA Tomonori52a93ba2008-07-15 21:21:45 +02001269 spin_lock_irqsave(q->queue_lock, flags);
1270 __blk_put_request(q, req);
1271 spin_unlock_irqrestore(q->queue_lock, flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001272}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001273EXPORT_SYMBOL(blk_put_request);
1274
Christoph Hellwig66ac0282010-06-18 16:59:42 +02001275/**
1276 * blk_add_request_payload - add a payload to a request
1277 * @rq: request to update
1278 * @page: page backing the payload
1279 * @len: length of the payload.
1280 *
1281 * This allows to later add a payload to an already submitted request by
1282 * a block driver. The driver needs to take care of freeing the payload
1283 * itself.
1284 *
1285 * Note that this is a quite horrible hack and nothing but handling of
1286 * discard requests should ever use it.
1287 */
1288void blk_add_request_payload(struct request *rq, struct page *page,
1289 unsigned int len)
1290{
1291 struct bio *bio = rq->bio;
1292
1293 bio->bi_io_vec->bv_page = page;
1294 bio->bi_io_vec->bv_offset = 0;
1295 bio->bi_io_vec->bv_len = len;
1296
1297 bio->bi_size = len;
1298 bio->bi_vcnt = 1;
1299 bio->bi_phys_segments = 1;
1300
1301 rq->__data_len = rq->resid_len = len;
1302 rq->nr_phys_segments = 1;
1303 rq->buffer = bio_data(bio);
1304}
1305EXPORT_SYMBOL_GPL(blk_add_request_payload);
1306
Jens Axboe73c10102011-03-08 13:19:51 +01001307static bool bio_attempt_back_merge(struct request_queue *q, struct request *req,
1308 struct bio *bio)
1309{
1310 const int ff = bio->bi_rw & REQ_FAILFAST_MASK;
1311
Jens Axboe73c10102011-03-08 13:19:51 +01001312 if (!ll_back_merge_fn(q, req, bio))
1313 return false;
1314
1315 trace_block_bio_backmerge(q, bio);
1316
1317 if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff)
1318 blk_rq_set_mixed_merge(req);
1319
1320 req->biotail->bi_next = bio;
1321 req->biotail = bio;
1322 req->__data_len += bio->bi_size;
1323 req->ioprio = ioprio_best(req->ioprio, bio_prio(bio));
1324
1325 drive_stat_acct(req, 0);
1326 return true;
1327}
1328
1329static bool bio_attempt_front_merge(struct request_queue *q,
1330 struct request *req, struct bio *bio)
1331{
1332 const int ff = bio->bi_rw & REQ_FAILFAST_MASK;
Jens Axboe73c10102011-03-08 13:19:51 +01001333
Jens Axboe73c10102011-03-08 13:19:51 +01001334 if (!ll_front_merge_fn(q, req, bio))
1335 return false;
1336
1337 trace_block_bio_frontmerge(q, bio);
1338
1339 if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff)
1340 blk_rq_set_mixed_merge(req);
1341
Jens Axboe73c10102011-03-08 13:19:51 +01001342 bio->bi_next = req->bio;
1343 req->bio = bio;
1344
1345 /*
1346 * may not be valid. if the low level driver said
1347 * it didn't need a bounce buffer then it better
1348 * not touch req->buffer either...
1349 */
1350 req->buffer = bio_data(bio);
1351 req->__sector = bio->bi_sector;
1352 req->__data_len += bio->bi_size;
1353 req->ioprio = ioprio_best(req->ioprio, bio_prio(bio));
1354
1355 drive_stat_acct(req, 0);
1356 return true;
1357}
1358
Tejun Heobd87b582011-10-19 14:33:08 +02001359/**
1360 * attempt_plug_merge - try to merge with %current's plugged list
1361 * @q: request_queue new bio is being queued at
1362 * @bio: new bio being queued
1363 * @request_count: out parameter for number of traversed plugged requests
1364 *
1365 * Determine whether @bio being queued on @q can be merged with a request
1366 * on %current's plugged list. Returns %true if merge was successful,
1367 * otherwise %false.
1368 *
Tejun Heo07c2bd32012-02-08 09:19:42 +01001369 * Plugging coalesces IOs from the same issuer for the same purpose without
1370 * going through @q->queue_lock. As such it's more of an issuing mechanism
1371 * than scheduling, and the request, while may have elvpriv data, is not
1372 * added on the elevator at this point. In addition, we don't have
1373 * reliable access to the elevator outside queue lock. Only check basic
1374 * merging parameters without querying the elevator.
Jens Axboe73c10102011-03-08 13:19:51 +01001375 */
Tejun Heobd87b582011-10-19 14:33:08 +02001376static bool attempt_plug_merge(struct request_queue *q, struct bio *bio,
1377 unsigned int *request_count)
Jens Axboe73c10102011-03-08 13:19:51 +01001378{
1379 struct blk_plug *plug;
1380 struct request *rq;
1381 bool ret = false;
1382
Tejun Heobd87b582011-10-19 14:33:08 +02001383 plug = current->plug;
Jens Axboe73c10102011-03-08 13:19:51 +01001384 if (!plug)
1385 goto out;
Shaohua Li56ebdaf2011-08-24 16:04:34 +02001386 *request_count = 0;
Jens Axboe73c10102011-03-08 13:19:51 +01001387
1388 list_for_each_entry_reverse(rq, &plug->list, queuelist) {
1389 int el_ret;
1390
Shaohua Li1b2e19f2012-04-06 11:37:47 -06001391 if (rq->q == q)
1392 (*request_count)++;
Shaohua Li56ebdaf2011-08-24 16:04:34 +02001393
Tejun Heo07c2bd32012-02-08 09:19:42 +01001394 if (rq->q != q || !blk_rq_merge_ok(rq, bio))
Jens Axboe73c10102011-03-08 13:19:51 +01001395 continue;
1396
Tejun Heo050c8ea2012-02-08 09:19:38 +01001397 el_ret = blk_try_merge(rq, bio);
Jens Axboe73c10102011-03-08 13:19:51 +01001398 if (el_ret == ELEVATOR_BACK_MERGE) {
1399 ret = bio_attempt_back_merge(q, rq, bio);
1400 if (ret)
1401 break;
1402 } else if (el_ret == ELEVATOR_FRONT_MERGE) {
1403 ret = bio_attempt_front_merge(q, rq, bio);
1404 if (ret)
1405 break;
1406 }
1407 }
1408out:
1409 return ret;
1410}
1411
Jens Axboe86db1e22008-01-29 14:53:40 +01001412void init_request_from_bio(struct request *req, struct bio *bio)
Tejun Heo52d9e672006-01-06 09:49:58 +01001413{
Jens Axboe4aff5e22006-08-10 08:44:47 +02001414 req->cmd_type = REQ_TYPE_FS;
Tejun Heo52d9e672006-01-06 09:49:58 +01001415
Christoph Hellwig7b6d91d2010-08-07 18:20:39 +02001416 req->cmd_flags |= bio->bi_rw & REQ_COMMON_MASK;
1417 if (bio->bi_rw & REQ_RAHEAD)
Tejun Heoa82afdf2009-07-03 17:48:16 +09001418 req->cmd_flags |= REQ_FAILFAST_MASK;
Jens Axboeb31dc662006-06-13 08:26:10 +02001419
Tejun Heo52d9e672006-01-06 09:49:58 +01001420 req->errors = 0;
Tejun Heoa2dec7b2009-05-07 22:24:44 +09001421 req->__sector = bio->bi_sector;
Tejun Heo52d9e672006-01-06 09:49:58 +01001422 req->ioprio = bio_prio(bio);
NeilBrownbc1c56f2007-08-16 13:31:30 +02001423 blk_rq_bio_prep(req->q, req, bio);
Tejun Heo52d9e672006-01-06 09:49:58 +01001424}
1425
Christoph Hellwig5a7bbad2011-09-12 12:12:01 +02001426void blk_queue_bio(struct request_queue *q, struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001427{
Jiri Slaby5e00d1b2010-08-12 14:31:06 +02001428 const bool sync = !!(bio->bi_rw & REQ_SYNC);
Jens Axboe73c10102011-03-08 13:19:51 +01001429 struct blk_plug *plug;
1430 int el_ret, rw_flags, where = ELEVATOR_INSERT_SORT;
1431 struct request *req;
Shaohua Li56ebdaf2011-08-24 16:04:34 +02001432 unsigned int request_count = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001433
Linus Torvalds1da177e2005-04-16 15:20:36 -07001434 /*
1435 * low level driver can indicate that it wants pages above a
1436 * certain limit bounced to low memory (ie for highmem, or even
1437 * ISA dma in theory)
1438 */
1439 blk_queue_bounce(q, &bio);
1440
Tejun Heo4fed9472010-09-03 11:56:17 +02001441 if (bio->bi_rw & (REQ_FLUSH | REQ_FUA)) {
Jens Axboe73c10102011-03-08 13:19:51 +01001442 spin_lock_irq(q->queue_lock);
Tejun Heoae1b1532011-01-25 12:43:54 +01001443 where = ELEVATOR_INSERT_FLUSH;
Tejun Heo28e7d182010-09-03 11:56:16 +02001444 goto get_rq;
1445 }
1446
Jens Axboe73c10102011-03-08 13:19:51 +01001447 /*
1448 * Check if we can merge with the plugged list before grabbing
1449 * any locks.
1450 */
Tejun Heobd87b582011-10-19 14:33:08 +02001451 if (attempt_plug_merge(q, bio, &request_count))
Christoph Hellwig5a7bbad2011-09-12 12:12:01 +02001452 return;
Jens Axboe73c10102011-03-08 13:19:51 +01001453
1454 spin_lock_irq(q->queue_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001455
1456 el_ret = elv_merge(q, &req, bio);
Jens Axboe73c10102011-03-08 13:19:51 +01001457 if (el_ret == ELEVATOR_BACK_MERGE) {
Jens Axboe73c10102011-03-08 13:19:51 +01001458 if (bio_attempt_back_merge(q, req, bio)) {
Tejun Heo07c2bd32012-02-08 09:19:42 +01001459 elv_bio_merged(q, req, bio);
Jens Axboe73c10102011-03-08 13:19:51 +01001460 if (!attempt_back_merge(q, req))
1461 elv_merged_request(q, req, el_ret);
1462 goto out_unlock;
Tejun Heo80a761f2009-07-03 17:48:17 +09001463 }
Jens Axboe73c10102011-03-08 13:19:51 +01001464 } else if (el_ret == ELEVATOR_FRONT_MERGE) {
Jens Axboe73c10102011-03-08 13:19:51 +01001465 if (bio_attempt_front_merge(q, req, bio)) {
Tejun Heo07c2bd32012-02-08 09:19:42 +01001466 elv_bio_merged(q, req, bio);
Jens Axboe73c10102011-03-08 13:19:51 +01001467 if (!attempt_front_merge(q, req))
1468 elv_merged_request(q, req, el_ret);
1469 goto out_unlock;
1470 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001471 }
1472
Linus Torvalds1da177e2005-04-16 15:20:36 -07001473get_rq:
Nick Piggin450991b2005-06-28 20:45:13 -07001474 /*
Jens Axboe7749a8d2006-12-13 13:02:26 +01001475 * This sync check and mask will be re-done in init_request_from_bio(),
1476 * but we need to set it earlier to expose the sync flag to the
1477 * rq allocator and io schedulers.
1478 */
1479 rw_flags = bio_data_dir(bio);
1480 if (sync)
Christoph Hellwig7b6d91d2010-08-07 18:20:39 +02001481 rw_flags |= REQ_SYNC;
Jens Axboe7749a8d2006-12-13 13:02:26 +01001482
1483 /*
Nick Piggin450991b2005-06-28 20:45:13 -07001484 * Grab a free request. This is might sleep but can not fail.
Nick Piggind6344532005-06-28 20:45:14 -07001485 * Returns with the queue unlocked.
Nick Piggin450991b2005-06-28 20:45:13 -07001486 */
Tejun Heoa06e05e2012-06-04 20:40:55 -07001487 req = get_request(q, rw_flags, bio, GFP_NOIO);
Tejun Heoda8303c2011-10-19 14:33:05 +02001488 if (unlikely(!req)) {
1489 bio_endio(bio, -ENODEV); /* @q is dead */
1490 goto out_unlock;
1491 }
Nick Piggind6344532005-06-28 20:45:14 -07001492
Nick Piggin450991b2005-06-28 20:45:13 -07001493 /*
1494 * After dropping the lock and possibly sleeping here, our request
1495 * may now be mergeable after it had proven unmergeable (above).
1496 * We don't worry about that case for efficiency. It won't happen
1497 * often, and the elevators are able to handle it.
1498 */
Tejun Heo52d9e672006-01-06 09:49:58 +01001499 init_request_from_bio(req, bio);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001500
Tao Ma9562ad92011-10-24 16:11:30 +02001501 if (test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags))
Jens Axboe11ccf112011-07-26 15:01:15 +02001502 req->cpu = raw_smp_processor_id();
Tejun Heodd831002010-09-03 11:56:16 +02001503
Jens Axboe73c10102011-03-08 13:19:51 +01001504 plug = current->plug;
Jens Axboe721a9602011-03-09 11:56:30 +01001505 if (plug) {
Jens Axboedc6d36c2011-04-12 10:28:28 +02001506 /*
1507 * If this is the first request added after a plug, fire
1508 * of a plug trace. If others have been added before, check
1509 * if we have multiple devices in this plug. If so, make a
1510 * note to sort the list before dispatch.
1511 */
1512 if (list_empty(&plug->list))
1513 trace_block_plug(q);
Shaohua Li3540d5e2011-11-16 09:21:50 +01001514 else {
1515 if (!plug->should_sort) {
1516 struct request *__rq;
Jens Axboe73c10102011-03-08 13:19:51 +01001517
Shaohua Li3540d5e2011-11-16 09:21:50 +01001518 __rq = list_entry_rq(plug->list.prev);
1519 if (__rq->q != q)
1520 plug->should_sort = 1;
1521 }
Shaohua Li019ceb72011-11-16 09:21:50 +01001522 if (request_count >= BLK_MAX_REQUEST_COUNT) {
Shaohua Li3540d5e2011-11-16 09:21:50 +01001523 blk_flush_plug_list(plug, false);
Shaohua Li019ceb72011-11-16 09:21:50 +01001524 trace_block_plug(q);
1525 }
Jens Axboe73c10102011-03-08 13:19:51 +01001526 }
Shaohua Lia6327162011-08-24 16:04:32 +02001527 list_add_tail(&req->queuelist, &plug->list);
1528 drive_stat_acct(req, 1);
Jens Axboe73c10102011-03-08 13:19:51 +01001529 } else {
1530 spin_lock_irq(q->queue_lock);
1531 add_acct_request(q, req, where);
Christoph Hellwig24ecfbe2011-04-18 11:41:33 +02001532 __blk_run_queue(q);
Jens Axboe73c10102011-03-08 13:19:51 +01001533out_unlock:
1534 spin_unlock_irq(q->queue_lock);
1535 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001536}
Jens Axboec20e8de2011-09-12 12:03:37 +02001537EXPORT_SYMBOL_GPL(blk_queue_bio); /* for device mapper only */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001538
1539/*
1540 * If bio->bi_dev is a partition, remap the location
1541 */
1542static inline void blk_partition_remap(struct bio *bio)
1543{
1544 struct block_device *bdev = bio->bi_bdev;
1545
Jens Axboebf2de6f2007-09-27 13:01:25 +02001546 if (bio_sectors(bio) && bdev != bdev->bd_contains) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001547 struct hd_struct *p = bdev->bd_part;
Jens Axboea3623572005-11-01 09:26:16 +01001548
Linus Torvalds1da177e2005-04-16 15:20:36 -07001549 bio->bi_sector += p->start_sect;
1550 bio->bi_bdev = bdev->bd_contains;
Alan D. Brunellec7149d62007-08-07 15:30:23 +02001551
Mike Snitzerd07335e2010-11-16 12:52:38 +01001552 trace_block_bio_remap(bdev_get_queue(bio->bi_bdev), bio,
1553 bdev->bd_dev,
1554 bio->bi_sector - p->start_sect);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001555 }
1556}
1557
Linus Torvalds1da177e2005-04-16 15:20:36 -07001558static void handle_bad_sector(struct bio *bio)
1559{
1560 char b[BDEVNAME_SIZE];
1561
1562 printk(KERN_INFO "attempt to access beyond end of device\n");
1563 printk(KERN_INFO "%s: rw=%ld, want=%Lu, limit=%Lu\n",
1564 bdevname(bio->bi_bdev, b),
1565 bio->bi_rw,
1566 (unsigned long long)bio->bi_sector + bio_sectors(bio),
Mike Snitzer77304d22010-11-08 14:39:12 +01001567 (long long)(i_size_read(bio->bi_bdev->bd_inode) >> 9));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001568
1569 set_bit(BIO_EOF, &bio->bi_flags);
1570}
1571
Akinobu Mitac17bb492006-12-08 02:39:46 -08001572#ifdef CONFIG_FAIL_MAKE_REQUEST
1573
1574static DECLARE_FAULT_ATTR(fail_make_request);
1575
1576static int __init setup_fail_make_request(char *str)
1577{
1578 return setup_fault_attr(&fail_make_request, str);
1579}
1580__setup("fail_make_request=", setup_fail_make_request);
1581
Akinobu Mitab2c9cd32011-07-26 16:09:03 -07001582static bool should_fail_request(struct hd_struct *part, unsigned int bytes)
Akinobu Mitac17bb492006-12-08 02:39:46 -08001583{
Akinobu Mitab2c9cd32011-07-26 16:09:03 -07001584 return part->make_it_fail && should_fail(&fail_make_request, bytes);
Akinobu Mitac17bb492006-12-08 02:39:46 -08001585}
1586
1587static int __init fail_make_request_debugfs(void)
1588{
Akinobu Mitadd48c082011-08-03 16:21:01 -07001589 struct dentry *dir = fault_create_debugfs_attr("fail_make_request",
1590 NULL, &fail_make_request);
1591
1592 return IS_ERR(dir) ? PTR_ERR(dir) : 0;
Akinobu Mitac17bb492006-12-08 02:39:46 -08001593}
1594
1595late_initcall(fail_make_request_debugfs);
1596
1597#else /* CONFIG_FAIL_MAKE_REQUEST */
1598
Akinobu Mitab2c9cd32011-07-26 16:09:03 -07001599static inline bool should_fail_request(struct hd_struct *part,
1600 unsigned int bytes)
Akinobu Mitac17bb492006-12-08 02:39:46 -08001601{
Akinobu Mitab2c9cd32011-07-26 16:09:03 -07001602 return false;
Akinobu Mitac17bb492006-12-08 02:39:46 -08001603}
1604
1605#endif /* CONFIG_FAIL_MAKE_REQUEST */
1606
Jens Axboec07e2b42007-07-18 13:27:58 +02001607/*
1608 * Check whether this bio extends beyond the end of the device.
1609 */
1610static inline int bio_check_eod(struct bio *bio, unsigned int nr_sectors)
1611{
1612 sector_t maxsector;
1613
1614 if (!nr_sectors)
1615 return 0;
1616
1617 /* Test device or partition size, when known. */
Mike Snitzer77304d22010-11-08 14:39:12 +01001618 maxsector = i_size_read(bio->bi_bdev->bd_inode) >> 9;
Jens Axboec07e2b42007-07-18 13:27:58 +02001619 if (maxsector) {
1620 sector_t sector = bio->bi_sector;
1621
1622 if (maxsector < nr_sectors || maxsector - nr_sectors < sector) {
1623 /*
1624 * This may well happen - the kernel calls bread()
1625 * without checking the size of the device, e.g., when
1626 * mounting a device.
1627 */
1628 handle_bad_sector(bio);
1629 return 1;
1630 }
1631 }
1632
1633 return 0;
1634}
1635
Christoph Hellwig27a84d52011-09-15 14:01:40 +02001636static noinline_for_stack bool
1637generic_make_request_checks(struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001638{
Jens Axboe165125e2007-07-24 09:28:11 +02001639 struct request_queue *q;
Christoph Hellwig5a7bbad2011-09-12 12:12:01 +02001640 int nr_sectors = bio_sectors(bio);
Jens Axboe51fd77b2007-11-02 08:49:08 +01001641 int err = -EIO;
Christoph Hellwig5a7bbad2011-09-12 12:12:01 +02001642 char b[BDEVNAME_SIZE];
1643 struct hd_struct *part;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001644
1645 might_sleep();
Linus Torvalds1da177e2005-04-16 15:20:36 -07001646
Jens Axboec07e2b42007-07-18 13:27:58 +02001647 if (bio_check_eod(bio, nr_sectors))
1648 goto end_io;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001649
Christoph Hellwig5a7bbad2011-09-12 12:12:01 +02001650 q = bdev_get_queue(bio->bi_bdev);
1651 if (unlikely(!q)) {
1652 printk(KERN_ERR
1653 "generic_make_request: Trying to access "
1654 "nonexistent block-device %s (%Lu)\n",
1655 bdevname(bio->bi_bdev, b),
1656 (long long) bio->bi_sector);
1657 goto end_io;
1658 }
1659
Martin K. Petersene2a60da2012-09-18 12:19:25 -04001660 if (likely(bio_is_rw(bio) &&
1661 nr_sectors > queue_max_hw_sectors(q))) {
Christoph Hellwig5a7bbad2011-09-12 12:12:01 +02001662 printk(KERN_ERR "bio too big device %s (%u > %u)\n",
1663 bdevname(bio->bi_bdev, b),
1664 bio_sectors(bio),
1665 queue_max_hw_sectors(q));
1666 goto end_io;
1667 }
1668
Christoph Hellwig5a7bbad2011-09-12 12:12:01 +02001669 part = bio->bi_bdev->bd_part;
1670 if (should_fail_request(part, bio->bi_size) ||
1671 should_fail_request(&part_to_disk(part)->part0,
1672 bio->bi_size))
1673 goto end_io;
1674
Linus Torvalds1da177e2005-04-16 15:20:36 -07001675 /*
Christoph Hellwig5a7bbad2011-09-12 12:12:01 +02001676 * If this device has partitions, remap block n
1677 * of partition p to block n+start(p) of the disk.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001678 */
Christoph Hellwig5a7bbad2011-09-12 12:12:01 +02001679 blk_partition_remap(bio);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001680
Christoph Hellwig5a7bbad2011-09-12 12:12:01 +02001681 if (bio_integrity_enabled(bio) && bio_integrity_prep(bio))
1682 goto end_io;
1683
1684 if (bio_check_eod(bio, nr_sectors))
1685 goto end_io;
1686
1687 /*
1688 * Filter flush bio's early so that make_request based
1689 * drivers without flush support don't have to worry
1690 * about them.
1691 */
1692 if ((bio->bi_rw & (REQ_FLUSH | REQ_FUA)) && !q->flush_flags) {
1693 bio->bi_rw &= ~(REQ_FLUSH | REQ_FUA);
1694 if (!nr_sectors) {
1695 err = 0;
Tejun Heoa7384672008-11-28 13:32:03 +09001696 goto end_io;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001697 }
Christoph Hellwig5a7bbad2011-09-12 12:12:01 +02001698 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001699
Christoph Hellwig5a7bbad2011-09-12 12:12:01 +02001700 if ((bio->bi_rw & REQ_DISCARD) &&
1701 (!blk_queue_discard(q) ||
Martin K. Petersene2a60da2012-09-18 12:19:25 -04001702 ((bio->bi_rw & REQ_SECURE) && !blk_queue_secdiscard(q)))) {
Christoph Hellwig5a7bbad2011-09-12 12:12:01 +02001703 err = -EOPNOTSUPP;
1704 goto end_io;
1705 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001706
Tejun Heo7f4b35d2012-06-04 20:40:56 -07001707 /*
1708 * Various block parts want %current->io_context and lazy ioc
1709 * allocation ends up trading a lot of pain for a small amount of
1710 * memory. Just allocate it upfront. This may fail and block
1711 * layer knows how to live with it.
1712 */
1713 create_io_context(GFP_ATOMIC, q->node);
1714
Tejun Heobc16a4f2011-10-19 14:33:01 +02001715 if (blk_throtl_bio(q, bio))
1716 return false; /* throttled, will be resubmitted later */
Christoph Hellwig27a84d52011-09-15 14:01:40 +02001717
Christoph Hellwig5a7bbad2011-09-12 12:12:01 +02001718 trace_block_bio_queue(q, bio);
Christoph Hellwig27a84d52011-09-15 14:01:40 +02001719 return true;
Tejun Heoa7384672008-11-28 13:32:03 +09001720
1721end_io:
1722 bio_endio(bio, err);
Christoph Hellwig27a84d52011-09-15 14:01:40 +02001723 return false;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001724}
1725
Christoph Hellwig27a84d52011-09-15 14:01:40 +02001726/**
1727 * generic_make_request - hand a buffer to its device driver for I/O
1728 * @bio: The bio describing the location in memory and on the device.
1729 *
1730 * generic_make_request() is used to make I/O requests of block
1731 * devices. It is passed a &struct bio, which describes the I/O that needs
1732 * to be done.
1733 *
1734 * generic_make_request() does not return any status. The
1735 * success/failure status of the request, along with notification of
1736 * completion, is delivered asynchronously through the bio->bi_end_io
1737 * function described (one day) else where.
1738 *
1739 * The caller of generic_make_request must make sure that bi_io_vec
1740 * are set to describe the memory buffer, and that bi_dev and bi_sector are
1741 * set to describe the device address, and the
1742 * bi_end_io and optionally bi_private are set to describe how
1743 * completion notification should be signaled.
1744 *
1745 * generic_make_request and the drivers it calls may use bi_next if this
1746 * bio happens to be merged with someone else, and may resubmit the bio to
1747 * a lower device by calling into generic_make_request recursively, which
1748 * means the bio should NOT be touched after the call to ->make_request_fn.
Neil Brownd89d8792007-05-01 09:53:42 +02001749 */
1750void generic_make_request(struct bio *bio)
1751{
Akinobu Mitabddd87c2010-02-23 08:55:42 +01001752 struct bio_list bio_list_on_stack;
1753
Christoph Hellwig27a84d52011-09-15 14:01:40 +02001754 if (!generic_make_request_checks(bio))
1755 return;
1756
1757 /*
1758 * We only want one ->make_request_fn to be active at a time, else
1759 * stack usage with stacked devices could be a problem. So use
1760 * current->bio_list to keep a list of requests submited by a
1761 * make_request_fn function. current->bio_list is also used as a
1762 * flag to say if generic_make_request is currently active in this
1763 * task or not. If it is NULL, then no make_request is active. If
1764 * it is non-NULL, then a make_request is active, and new requests
1765 * should be added at the tail
1766 */
Akinobu Mitabddd87c2010-02-23 08:55:42 +01001767 if (current->bio_list) {
Akinobu Mitabddd87c2010-02-23 08:55:42 +01001768 bio_list_add(current->bio_list, bio);
Neil Brownd89d8792007-05-01 09:53:42 +02001769 return;
1770 }
Christoph Hellwig27a84d52011-09-15 14:01:40 +02001771
Neil Brownd89d8792007-05-01 09:53:42 +02001772 /* following loop may be a bit non-obvious, and so deserves some
1773 * explanation.
1774 * Before entering the loop, bio->bi_next is NULL (as all callers
1775 * ensure that) so we have a list with a single bio.
1776 * We pretend that we have just taken it off a longer list, so
Akinobu Mitabddd87c2010-02-23 08:55:42 +01001777 * we assign bio_list to a pointer to the bio_list_on_stack,
1778 * thus initialising the bio_list of new bios to be
Christoph Hellwig27a84d52011-09-15 14:01:40 +02001779 * added. ->make_request() may indeed add some more bios
Neil Brownd89d8792007-05-01 09:53:42 +02001780 * through a recursive call to generic_make_request. If it
1781 * did, we find a non-NULL value in bio_list and re-enter the loop
1782 * from the top. In this case we really did just take the bio
Akinobu Mitabddd87c2010-02-23 08:55:42 +01001783 * of the top of the list (no pretending) and so remove it from
Christoph Hellwig27a84d52011-09-15 14:01:40 +02001784 * bio_list, and call into ->make_request() again.
Neil Brownd89d8792007-05-01 09:53:42 +02001785 */
1786 BUG_ON(bio->bi_next);
Akinobu Mitabddd87c2010-02-23 08:55:42 +01001787 bio_list_init(&bio_list_on_stack);
1788 current->bio_list = &bio_list_on_stack;
Neil Brownd89d8792007-05-01 09:53:42 +02001789 do {
Christoph Hellwig27a84d52011-09-15 14:01:40 +02001790 struct request_queue *q = bdev_get_queue(bio->bi_bdev);
1791
1792 q->make_request_fn(q, bio);
1793
Akinobu Mitabddd87c2010-02-23 08:55:42 +01001794 bio = bio_list_pop(current->bio_list);
Neil Brownd89d8792007-05-01 09:53:42 +02001795 } while (bio);
Akinobu Mitabddd87c2010-02-23 08:55:42 +01001796 current->bio_list = NULL; /* deactivate */
Neil Brownd89d8792007-05-01 09:53:42 +02001797}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001798EXPORT_SYMBOL(generic_make_request);
1799
1800/**
Randy Dunlap710027a2008-08-19 20:13:11 +02001801 * submit_bio - submit a bio to the block device layer for I/O
Linus Torvalds1da177e2005-04-16 15:20:36 -07001802 * @rw: whether to %READ or %WRITE, or maybe to %READA (read ahead)
1803 * @bio: The &struct bio which describes the I/O
1804 *
1805 * submit_bio() is very similar in purpose to generic_make_request(), and
1806 * uses that function to do most of the work. Both are fairly rough
Randy Dunlap710027a2008-08-19 20:13:11 +02001807 * interfaces; @bio must be presetup and ready for I/O.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001808 *
1809 */
1810void submit_bio(int rw, struct bio *bio)
1811{
1812 int count = bio_sectors(bio);
1813
Jens Axboe22e2c502005-06-27 10:55:12 +02001814 bio->bi_rw |= rw;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001815
Jens Axboebf2de6f2007-09-27 13:01:25 +02001816 /*
1817 * If it's a regular read/write or a barrier with data attached,
1818 * go through the normal accounting stuff before submission.
1819 */
Martin K. Petersene2a60da2012-09-18 12:19:25 -04001820 if (bio_has_data(bio)) {
Jens Axboebf2de6f2007-09-27 13:01:25 +02001821 if (rw & WRITE) {
1822 count_vm_events(PGPGOUT, count);
1823 } else {
1824 task_io_account_read(bio->bi_size);
1825 count_vm_events(PGPGIN, count);
1826 }
1827
1828 if (unlikely(block_dump)) {
1829 char b[BDEVNAME_SIZE];
San Mehat8dcbdc72010-09-14 08:48:01 +02001830 printk(KERN_DEBUG "%s(%d): %s block %Lu on %s (%u sectors)\n",
Pavel Emelyanovba25f9d2007-10-18 23:40:40 -07001831 current->comm, task_pid_nr(current),
Jens Axboebf2de6f2007-09-27 13:01:25 +02001832 (rw & WRITE) ? "WRITE" : "READ",
1833 (unsigned long long)bio->bi_sector,
San Mehat8dcbdc72010-09-14 08:48:01 +02001834 bdevname(bio->bi_bdev, b),
1835 count);
Jens Axboebf2de6f2007-09-27 13:01:25 +02001836 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001837 }
1838
1839 generic_make_request(bio);
1840}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001841EXPORT_SYMBOL(submit_bio);
1842
Kiyoshi Ueda3bcddea2007-12-11 17:52:28 -05001843/**
Kiyoshi Ueda82124d62008-09-18 10:45:38 -04001844 * blk_rq_check_limits - Helper function to check a request for the queue limit
1845 * @q: the queue
1846 * @rq: the request being checked
1847 *
1848 * Description:
1849 * @rq may have been made based on weaker limitations of upper-level queues
1850 * in request stacking drivers, and it may violate the limitation of @q.
1851 * Since the block layer and the underlying device driver trust @rq
1852 * after it is inserted to @q, it should be checked against @q before
1853 * the insertion using this generic function.
1854 *
1855 * This function should also be useful for request stacking drivers
Stefan Weileef35c22010-08-06 21:11:15 +02001856 * in some cases below, so export this function.
Kiyoshi Ueda82124d62008-09-18 10:45:38 -04001857 * Request stacking drivers like request-based dm may change the queue
1858 * limits while requests are in the queue (e.g. dm's table swapping).
1859 * Such request stacking drivers should check those requests agaist
1860 * the new queue limits again when they dispatch those requests,
1861 * although such checkings are also done against the old queue limits
1862 * when submitting requests.
1863 */
1864int blk_rq_check_limits(struct request_queue *q, struct request *rq)
1865{
Martin K. Petersene2a60da2012-09-18 12:19:25 -04001866 if (!rq_mergeable(rq))
ike Snitzer33839772010-08-08 12:11:33 -04001867 return 0;
1868
Martin K. Petersenf31dc1c2012-09-18 12:19:26 -04001869 if (blk_rq_sectors(rq) > blk_queue_get_max_sectors(q, rq->cmd_flags)) {
Kiyoshi Ueda82124d62008-09-18 10:45:38 -04001870 printk(KERN_ERR "%s: over max size limit.\n", __func__);
1871 return -EIO;
1872 }
1873
1874 /*
1875 * queue's settings related to segment counting like q->bounce_pfn
1876 * may differ from that of other stacking queues.
1877 * Recalculate it to check the request correctly on this queue's
1878 * limitation.
1879 */
1880 blk_recalc_rq_segments(rq);
Martin K. Petersen8a783622010-02-26 00:20:39 -05001881 if (rq->nr_phys_segments > queue_max_segments(q)) {
Kiyoshi Ueda82124d62008-09-18 10:45:38 -04001882 printk(KERN_ERR "%s: over max segments limit.\n", __func__);
1883 return -EIO;
1884 }
1885
1886 return 0;
1887}
1888EXPORT_SYMBOL_GPL(blk_rq_check_limits);
1889
1890/**
1891 * blk_insert_cloned_request - Helper for stacking drivers to submit a request
1892 * @q: the queue to submit the request
1893 * @rq: the request being queued
1894 */
1895int blk_insert_cloned_request(struct request_queue *q, struct request *rq)
1896{
1897 unsigned long flags;
Jeff Moyer4853aba2011-08-15 21:37:25 +02001898 int where = ELEVATOR_INSERT_BACK;
Kiyoshi Ueda82124d62008-09-18 10:45:38 -04001899
1900 if (blk_rq_check_limits(q, rq))
1901 return -EIO;
1902
Akinobu Mitab2c9cd32011-07-26 16:09:03 -07001903 if (rq->rq_disk &&
1904 should_fail_request(&rq->rq_disk->part0, blk_rq_bytes(rq)))
Kiyoshi Ueda82124d62008-09-18 10:45:38 -04001905 return -EIO;
Kiyoshi Ueda82124d62008-09-18 10:45:38 -04001906
1907 spin_lock_irqsave(q->queue_lock, flags);
Tejun Heo8ba61432011-12-14 00:33:37 +01001908 if (unlikely(blk_queue_dead(q))) {
1909 spin_unlock_irqrestore(q->queue_lock, flags);
1910 return -ENODEV;
1911 }
Kiyoshi Ueda82124d62008-09-18 10:45:38 -04001912
1913 /*
1914 * Submitting request must be dequeued before calling this function
1915 * because it will be linked to another request_queue
1916 */
1917 BUG_ON(blk_queued_rq(rq));
1918
Jeff Moyer4853aba2011-08-15 21:37:25 +02001919 if (rq->cmd_flags & (REQ_FLUSH|REQ_FUA))
1920 where = ELEVATOR_INSERT_FLUSH;
1921
1922 add_acct_request(q, rq, where);
Jeff Moyere67b77c2011-10-17 12:57:23 +02001923 if (where == ELEVATOR_INSERT_FLUSH)
1924 __blk_run_queue(q);
Kiyoshi Ueda82124d62008-09-18 10:45:38 -04001925 spin_unlock_irqrestore(q->queue_lock, flags);
1926
1927 return 0;
1928}
1929EXPORT_SYMBOL_GPL(blk_insert_cloned_request);
1930
Tejun Heo80a761f2009-07-03 17:48:17 +09001931/**
1932 * blk_rq_err_bytes - determine number of bytes till the next failure boundary
1933 * @rq: request to examine
1934 *
1935 * Description:
1936 * A request could be merge of IOs which require different failure
1937 * handling. This function determines the number of bytes which
1938 * can be failed from the beginning of the request without
1939 * crossing into area which need to be retried further.
1940 *
1941 * Return:
1942 * The number of bytes to fail.
1943 *
1944 * Context:
1945 * queue_lock must be held.
1946 */
1947unsigned int blk_rq_err_bytes(const struct request *rq)
1948{
1949 unsigned int ff = rq->cmd_flags & REQ_FAILFAST_MASK;
1950 unsigned int bytes = 0;
1951 struct bio *bio;
1952
1953 if (!(rq->cmd_flags & REQ_MIXED_MERGE))
1954 return blk_rq_bytes(rq);
1955
1956 /*
1957 * Currently the only 'mixing' which can happen is between
1958 * different fastfail types. We can safely fail portions
1959 * which have all the failfast bits that the first one has -
1960 * the ones which are at least as eager to fail as the first
1961 * one.
1962 */
1963 for (bio = rq->bio; bio; bio = bio->bi_next) {
1964 if ((bio->bi_rw & ff) != ff)
1965 break;
1966 bytes += bio->bi_size;
1967 }
1968
1969 /* this could lead to infinite loop */
1970 BUG_ON(blk_rq_bytes(rq) && !bytes);
1971 return bytes;
1972}
1973EXPORT_SYMBOL_GPL(blk_rq_err_bytes);
1974
Jens Axboebc58ba92009-01-23 10:54:44 +01001975static void blk_account_io_completion(struct request *req, unsigned int bytes)
1976{
Jens Axboec2553b52009-04-24 08:10:11 +02001977 if (blk_do_io_stat(req)) {
Jens Axboebc58ba92009-01-23 10:54:44 +01001978 const int rw = rq_data_dir(req);
1979 struct hd_struct *part;
1980 int cpu;
1981
1982 cpu = part_stat_lock();
Jerome Marchand09e099d2011-01-05 16:57:38 +01001983 part = req->part;
Jens Axboebc58ba92009-01-23 10:54:44 +01001984 part_stat_add(cpu, part, sectors[rw], bytes >> 9);
1985 part_stat_unlock();
1986 }
1987}
1988
1989static void blk_account_io_done(struct request *req)
1990{
Jens Axboebc58ba92009-01-23 10:54:44 +01001991 /*
Tejun Heodd4c1332010-09-03 11:56:16 +02001992 * Account IO completion. flush_rq isn't accounted as a
1993 * normal IO on queueing nor completion. Accounting the
1994 * containing request is enough.
Jens Axboebc58ba92009-01-23 10:54:44 +01001995 */
Tejun Heo414b4ff2011-01-25 12:43:49 +01001996 if (blk_do_io_stat(req) && !(req->cmd_flags & REQ_FLUSH_SEQ)) {
Jens Axboebc58ba92009-01-23 10:54:44 +01001997 unsigned long duration = jiffies - req->start_time;
1998 const int rw = rq_data_dir(req);
1999 struct hd_struct *part;
2000 int cpu;
2001
2002 cpu = part_stat_lock();
Jerome Marchand09e099d2011-01-05 16:57:38 +01002003 part = req->part;
Jens Axboebc58ba92009-01-23 10:54:44 +01002004
2005 part_stat_inc(cpu, part, ios[rw]);
2006 part_stat_add(cpu, part, ticks[rw], duration);
2007 part_round_stats(cpu, part);
Nikanth Karthikesan316d3152009-10-06 20:16:55 +02002008 part_dec_in_flight(part, rw);
Jens Axboebc58ba92009-01-23 10:54:44 +01002009
Jens Axboe6c23a962011-01-07 08:43:37 +01002010 hd_struct_put(part);
Jens Axboebc58ba92009-01-23 10:54:44 +01002011 part_stat_unlock();
2012 }
2013}
2014
Tejun Heo53a08802008-12-03 12:41:26 +01002015/**
Tejun Heo9934c8c2009-05-08 11:54:16 +09002016 * blk_peek_request - peek at the top of a request queue
2017 * @q: request queue to peek at
Kiyoshi Ueda3bcddea2007-12-11 17:52:28 -05002018 *
2019 * Description:
Tejun Heo9934c8c2009-05-08 11:54:16 +09002020 * Return the request at the top of @q. The returned request
2021 * should be started using blk_start_request() before LLD starts
2022 * processing it.
Kiyoshi Ueda3bcddea2007-12-11 17:52:28 -05002023 *
2024 * Return:
Tejun Heo9934c8c2009-05-08 11:54:16 +09002025 * Pointer to the request at the top of @q if available. Null
2026 * otherwise.
2027 *
2028 * Context:
2029 * queue_lock must be held.
2030 */
2031struct request *blk_peek_request(struct request_queue *q)
Tejun Heo158dbda2009-04-23 11:05:18 +09002032{
2033 struct request *rq;
2034 int ret;
2035
2036 while ((rq = __elv_next_request(q)) != NULL) {
2037 if (!(rq->cmd_flags & REQ_STARTED)) {
2038 /*
2039 * This is the first time the device driver
2040 * sees this request (possibly after
2041 * requeueing). Notify IO scheduler.
2042 */
Christoph Hellwig33659eb2010-08-07 18:17:56 +02002043 if (rq->cmd_flags & REQ_SORTED)
Tejun Heo158dbda2009-04-23 11:05:18 +09002044 elv_activate_rq(q, rq);
2045
2046 /*
2047 * just mark as started even if we don't start
2048 * it, a request that has been delayed should
2049 * not be passed by new incoming requests
2050 */
2051 rq->cmd_flags |= REQ_STARTED;
2052 trace_block_rq_issue(q, rq);
2053 }
2054
2055 if (!q->boundary_rq || q->boundary_rq == rq) {
2056 q->end_sector = rq_end_sector(rq);
2057 q->boundary_rq = NULL;
2058 }
2059
2060 if (rq->cmd_flags & REQ_DONTPREP)
2061 break;
2062
Tejun Heo2e46e8b2009-05-07 22:24:41 +09002063 if (q->dma_drain_size && blk_rq_bytes(rq)) {
Tejun Heo158dbda2009-04-23 11:05:18 +09002064 /*
2065 * make sure space for the drain appears we
2066 * know we can do this because max_hw_segments
2067 * has been adjusted to be one fewer than the
2068 * device can handle
2069 */
2070 rq->nr_phys_segments++;
2071 }
2072
2073 if (!q->prep_rq_fn)
2074 break;
2075
2076 ret = q->prep_rq_fn(q, rq);
2077 if (ret == BLKPREP_OK) {
2078 break;
2079 } else if (ret == BLKPREP_DEFER) {
2080 /*
2081 * the request may have been (partially) prepped.
2082 * we need to keep this request in the front to
2083 * avoid resource deadlock. REQ_STARTED will
2084 * prevent other fs requests from passing this one.
2085 */
Tejun Heo2e46e8b2009-05-07 22:24:41 +09002086 if (q->dma_drain_size && blk_rq_bytes(rq) &&
Tejun Heo158dbda2009-04-23 11:05:18 +09002087 !(rq->cmd_flags & REQ_DONTPREP)) {
2088 /*
2089 * remove the space for the drain we added
2090 * so that we don't add it again
2091 */
2092 --rq->nr_phys_segments;
2093 }
2094
2095 rq = NULL;
2096 break;
2097 } else if (ret == BLKPREP_KILL) {
2098 rq->cmd_flags |= REQ_QUIET;
James Bottomleyc143dc92009-05-30 06:43:49 +02002099 /*
2100 * Mark this request as started so we don't trigger
2101 * any debug logic in the end I/O path.
2102 */
2103 blk_start_request(rq);
Tejun Heo40cbbb72009-04-23 11:05:19 +09002104 __blk_end_request_all(rq, -EIO);
Tejun Heo158dbda2009-04-23 11:05:18 +09002105 } else {
2106 printk(KERN_ERR "%s: bad return=%d\n", __func__, ret);
2107 break;
2108 }
2109 }
2110
2111 return rq;
2112}
Tejun Heo9934c8c2009-05-08 11:54:16 +09002113EXPORT_SYMBOL(blk_peek_request);
Tejun Heo158dbda2009-04-23 11:05:18 +09002114
Tejun Heo9934c8c2009-05-08 11:54:16 +09002115void blk_dequeue_request(struct request *rq)
Tejun Heo158dbda2009-04-23 11:05:18 +09002116{
Tejun Heo9934c8c2009-05-08 11:54:16 +09002117 struct request_queue *q = rq->q;
2118
Tejun Heo158dbda2009-04-23 11:05:18 +09002119 BUG_ON(list_empty(&rq->queuelist));
2120 BUG_ON(ELV_ON_HASH(rq));
2121
2122 list_del_init(&rq->queuelist);
2123
2124 /*
2125 * the time frame between a request being removed from the lists
2126 * and to it is freed is accounted as io that is in progress at
2127 * the driver side.
2128 */
Divyesh Shah91952912010-04-01 15:01:41 -07002129 if (blk_account_rq(rq)) {
Jens Axboe0a7ae2f2009-05-20 08:54:31 +02002130 q->in_flight[rq_is_sync(rq)]++;
Divyesh Shah91952912010-04-01 15:01:41 -07002131 set_io_start_time_ns(rq);
2132 }
Tejun Heo158dbda2009-04-23 11:05:18 +09002133}
2134
Tejun Heo5efccd12009-04-23 11:05:18 +09002135/**
Tejun Heo9934c8c2009-05-08 11:54:16 +09002136 * blk_start_request - start request processing on the driver
2137 * @req: request to dequeue
2138 *
2139 * Description:
2140 * Dequeue @req and start timeout timer on it. This hands off the
2141 * request to the driver.
2142 *
2143 * Block internal functions which don't want to start timer should
2144 * call blk_dequeue_request().
2145 *
2146 * Context:
2147 * queue_lock must be held.
2148 */
2149void blk_start_request(struct request *req)
2150{
2151 blk_dequeue_request(req);
2152
2153 /*
Tejun Heo5f49f632009-05-19 18:33:05 +09002154 * We are now handing the request to the hardware, initialize
2155 * resid_len to full count and add the timeout handler.
Tejun Heo9934c8c2009-05-08 11:54:16 +09002156 */
Tejun Heo5f49f632009-05-19 18:33:05 +09002157 req->resid_len = blk_rq_bytes(req);
FUJITA Tomonoridbb66c42009-06-09 05:47:10 +02002158 if (unlikely(blk_bidi_rq(req)))
2159 req->next_rq->resid_len = blk_rq_bytes(req->next_rq);
2160
Tejun Heo9934c8c2009-05-08 11:54:16 +09002161 blk_add_timer(req);
2162}
2163EXPORT_SYMBOL(blk_start_request);
2164
2165/**
2166 * blk_fetch_request - fetch a request from a request queue
2167 * @q: request queue to fetch a request from
2168 *
2169 * Description:
2170 * Return the request at the top of @q. The request is started on
2171 * return and LLD can start processing it immediately.
2172 *
2173 * Return:
2174 * Pointer to the request at the top of @q if available. Null
2175 * otherwise.
2176 *
2177 * Context:
2178 * queue_lock must be held.
2179 */
2180struct request *blk_fetch_request(struct request_queue *q)
2181{
2182 struct request *rq;
2183
2184 rq = blk_peek_request(q);
2185 if (rq)
2186 blk_start_request(rq);
2187 return rq;
2188}
2189EXPORT_SYMBOL(blk_fetch_request);
2190
2191/**
Tejun Heo2e60e022009-04-23 11:05:18 +09002192 * blk_update_request - Special helper function for request stacking drivers
Randy Dunlap8ebf9752009-06-11 20:00:41 -07002193 * @req: the request being processed
Kiyoshi Ueda3bcddea2007-12-11 17:52:28 -05002194 * @error: %0 for success, < %0 for error
Randy Dunlap8ebf9752009-06-11 20:00:41 -07002195 * @nr_bytes: number of bytes to complete @req
Kiyoshi Ueda3bcddea2007-12-11 17:52:28 -05002196 *
2197 * Description:
Randy Dunlap8ebf9752009-06-11 20:00:41 -07002198 * Ends I/O on a number of bytes attached to @req, but doesn't complete
2199 * the request structure even if @req doesn't have leftover.
2200 * If @req has leftover, sets it up for the next range of segments.
Tejun Heo2e60e022009-04-23 11:05:18 +09002201 *
2202 * This special helper function is only for request stacking drivers
2203 * (e.g. request-based dm) so that they can handle partial completion.
2204 * Actual device drivers should use blk_end_request instead.
2205 *
2206 * Passing the result of blk_rq_bytes() as @nr_bytes guarantees
2207 * %false return from this function.
Kiyoshi Ueda3bcddea2007-12-11 17:52:28 -05002208 *
2209 * Return:
Tejun Heo2e60e022009-04-23 11:05:18 +09002210 * %false - this request doesn't have any more data
2211 * %true - this request has more data
Kiyoshi Ueda3bcddea2007-12-11 17:52:28 -05002212 **/
Tejun Heo2e60e022009-04-23 11:05:18 +09002213bool blk_update_request(struct request *req, int error, unsigned int nr_bytes)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002214{
Kiyoshi Ueda5450d3e2007-12-11 17:53:03 -05002215 int total_bytes, bio_nbytes, next_idx = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002216 struct bio *bio;
2217
Tejun Heo2e60e022009-04-23 11:05:18 +09002218 if (!req->bio)
2219 return false;
2220
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +01002221 trace_block_rq_complete(req->q, req);
Jens Axboe2056a782006-03-23 20:00:26 +01002222
Linus Torvalds1da177e2005-04-16 15:20:36 -07002223 /*
Tejun Heo6f414692009-04-19 07:00:41 +09002224 * For fs requests, rq is just carrier of independent bio's
2225 * and each partial completion should be handled separately.
2226 * Reset per-request error on each partial completion.
2227 *
2228 * TODO: tj: This is too subtle. It would be better to let
2229 * low level drivers do what they see fit.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002230 */
Christoph Hellwig33659eb2010-08-07 18:17:56 +02002231 if (req->cmd_type == REQ_TYPE_FS)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002232 req->errors = 0;
2233
Christoph Hellwig33659eb2010-08-07 18:17:56 +02002234 if (error && req->cmd_type == REQ_TYPE_FS &&
2235 !(req->cmd_flags & REQ_QUIET)) {
Hannes Reinecke79775562011-01-18 10:13:13 +01002236 char *error_type;
2237
2238 switch (error) {
2239 case -ENOLINK:
2240 error_type = "recoverable transport";
2241 break;
2242 case -EREMOTEIO:
2243 error_type = "critical target";
2244 break;
2245 case -EBADE:
2246 error_type = "critical nexus";
2247 break;
2248 case -EIO:
2249 default:
2250 error_type = "I/O";
2251 break;
2252 }
2253 printk(KERN_ERR "end_request: %s error, dev %s, sector %llu\n",
2254 error_type, req->rq_disk ? req->rq_disk->disk_name : "?",
2255 (unsigned long long)blk_rq_pos(req));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002256 }
2257
Jens Axboebc58ba92009-01-23 10:54:44 +01002258 blk_account_io_completion(req, nr_bytes);
Jens Axboed72d9042005-11-01 08:35:42 +01002259
Linus Torvalds1da177e2005-04-16 15:20:36 -07002260 total_bytes = bio_nbytes = 0;
2261 while ((bio = req->bio) != NULL) {
2262 int nbytes;
2263
2264 if (nr_bytes >= bio->bi_size) {
2265 req->bio = bio->bi_next;
2266 nbytes = bio->bi_size;
NeilBrown5bb23a62007-09-27 12:46:13 +02002267 req_bio_endio(req, bio, nbytes, error);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002268 next_idx = 0;
2269 bio_nbytes = 0;
2270 } else {
2271 int idx = bio->bi_idx + next_idx;
2272
Kazuhisa Ichikawaaf498d72009-05-12 13:27:45 +02002273 if (unlikely(idx >= bio->bi_vcnt)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002274 blk_dump_rq_flags(req, "__end_that");
Jens Axboe6728cb02008-01-31 13:03:55 +01002275 printk(KERN_ERR "%s: bio idx %d >= vcnt %d\n",
Kazuhisa Ichikawaaf498d72009-05-12 13:27:45 +02002276 __func__, idx, bio->bi_vcnt);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002277 break;
2278 }
2279
2280 nbytes = bio_iovec_idx(bio, idx)->bv_len;
2281 BIO_BUG_ON(nbytes > bio->bi_size);
2282
2283 /*
2284 * not a complete bvec done
2285 */
2286 if (unlikely(nbytes > nr_bytes)) {
2287 bio_nbytes += nr_bytes;
2288 total_bytes += nr_bytes;
2289 break;
2290 }
2291
2292 /*
2293 * advance to the next vector
2294 */
2295 next_idx++;
2296 bio_nbytes += nbytes;
2297 }
2298
2299 total_bytes += nbytes;
2300 nr_bytes -= nbytes;
2301
Jens Axboe6728cb02008-01-31 13:03:55 +01002302 bio = req->bio;
2303 if (bio) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002304 /*
2305 * end more in this run, or just return 'not-done'
2306 */
2307 if (unlikely(nr_bytes <= 0))
2308 break;
2309 }
2310 }
2311
2312 /*
2313 * completely done
2314 */
Tejun Heo2e60e022009-04-23 11:05:18 +09002315 if (!req->bio) {
2316 /*
2317 * Reset counters so that the request stacking driver
2318 * can find how many bytes remain in the request
2319 * later.
2320 */
Tejun Heoa2dec7b2009-05-07 22:24:44 +09002321 req->__data_len = 0;
Tejun Heo2e60e022009-04-23 11:05:18 +09002322 return false;
2323 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002324
2325 /*
2326 * if the request wasn't completed, update state
2327 */
2328 if (bio_nbytes) {
NeilBrown5bb23a62007-09-27 12:46:13 +02002329 req_bio_endio(req, bio, bio_nbytes, error);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002330 bio->bi_idx += next_idx;
2331 bio_iovec(bio)->bv_offset += nr_bytes;
2332 bio_iovec(bio)->bv_len -= nr_bytes;
2333 }
2334
Tejun Heoa2dec7b2009-05-07 22:24:44 +09002335 req->__data_len -= total_bytes;
Tejun Heo2e46e8b2009-05-07 22:24:41 +09002336 req->buffer = bio_data(req->bio);
2337
2338 /* update sector only for requests with clear definition of sector */
Martin K. Petersene2a60da2012-09-18 12:19:25 -04002339 if (req->cmd_type == REQ_TYPE_FS)
Tejun Heoa2dec7b2009-05-07 22:24:44 +09002340 req->__sector += total_bytes >> 9;
Tejun Heo2e46e8b2009-05-07 22:24:41 +09002341
Tejun Heo80a761f2009-07-03 17:48:17 +09002342 /* mixed attributes always follow the first bio */
2343 if (req->cmd_flags & REQ_MIXED_MERGE) {
2344 req->cmd_flags &= ~REQ_FAILFAST_MASK;
2345 req->cmd_flags |= req->bio->bi_rw & REQ_FAILFAST_MASK;
2346 }
2347
Tejun Heo2e46e8b2009-05-07 22:24:41 +09002348 /*
2349 * If total number of sectors is less than the first segment
2350 * size, something has gone terribly wrong.
2351 */
2352 if (blk_rq_bytes(req) < blk_rq_cur_bytes(req)) {
Jens Axboe81829242011-03-30 09:51:33 +02002353 blk_dump_rq_flags(req, "request botched");
Tejun Heoa2dec7b2009-05-07 22:24:44 +09002354 req->__data_len = blk_rq_cur_bytes(req);
Tejun Heo2e46e8b2009-05-07 22:24:41 +09002355 }
2356
2357 /* recalculate the number of segments */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002358 blk_recalc_rq_segments(req);
Tejun Heo2e46e8b2009-05-07 22:24:41 +09002359
Tejun Heo2e60e022009-04-23 11:05:18 +09002360 return true;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002361}
Tejun Heo2e60e022009-04-23 11:05:18 +09002362EXPORT_SYMBOL_GPL(blk_update_request);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002363
Tejun Heo2e60e022009-04-23 11:05:18 +09002364static bool blk_update_bidi_request(struct request *rq, int error,
2365 unsigned int nr_bytes,
2366 unsigned int bidi_bytes)
Tejun Heo5efccd12009-04-23 11:05:18 +09002367{
Tejun Heo2e60e022009-04-23 11:05:18 +09002368 if (blk_update_request(rq, error, nr_bytes))
2369 return true;
Tejun Heo5efccd12009-04-23 11:05:18 +09002370
Tejun Heo2e60e022009-04-23 11:05:18 +09002371 /* Bidi request must be completed as a whole */
2372 if (unlikely(blk_bidi_rq(rq)) &&
2373 blk_update_request(rq->next_rq, error, bidi_bytes))
2374 return true;
Tejun Heo5efccd12009-04-23 11:05:18 +09002375
Jens Axboee2e1a142010-06-09 10:42:09 +02002376 if (blk_queue_add_random(rq->q))
2377 add_disk_randomness(rq->rq_disk);
Tejun Heo2e60e022009-04-23 11:05:18 +09002378
2379 return false;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002380}
2381
James Bottomley28018c22010-07-01 19:49:17 +09002382/**
2383 * blk_unprep_request - unprepare a request
2384 * @req: the request
2385 *
2386 * This function makes a request ready for complete resubmission (or
2387 * completion). It happens only after all error handling is complete,
2388 * so represents the appropriate moment to deallocate any resources
2389 * that were allocated to the request in the prep_rq_fn. The queue
2390 * lock is held when calling this.
2391 */
2392void blk_unprep_request(struct request *req)
2393{
2394 struct request_queue *q = req->q;
2395
2396 req->cmd_flags &= ~REQ_DONTPREP;
2397 if (q->unprep_rq_fn)
2398 q->unprep_rq_fn(q, req);
2399}
2400EXPORT_SYMBOL_GPL(blk_unprep_request);
2401
Linus Torvalds1da177e2005-04-16 15:20:36 -07002402/*
2403 * queue lock must be held
2404 */
Tejun Heo2e60e022009-04-23 11:05:18 +09002405static void blk_finish_request(struct request *req, int error)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002406{
Kiyoshi Uedab8286232007-12-11 17:53:24 -05002407 if (blk_rq_tagged(req))
2408 blk_queue_end_tag(req->q, req);
2409
James Bottomleyba396a62009-05-27 14:17:08 +02002410 BUG_ON(blk_queued_rq(req));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002411
Christoph Hellwig33659eb2010-08-07 18:17:56 +02002412 if (unlikely(laptop_mode) && req->cmd_type == REQ_TYPE_FS)
Matthew Garrett31373d02010-04-06 14:25:14 +02002413 laptop_io_completion(&req->q->backing_dev_info);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002414
Mike Andersone78042e2008-10-30 02:16:20 -07002415 blk_delete_timer(req);
2416
James Bottomley28018c22010-07-01 19:49:17 +09002417 if (req->cmd_flags & REQ_DONTPREP)
2418 blk_unprep_request(req);
2419
2420
Jens Axboebc58ba92009-01-23 10:54:44 +01002421 blk_account_io_done(req);
Kiyoshi Uedab8286232007-12-11 17:53:24 -05002422
Linus Torvalds1da177e2005-04-16 15:20:36 -07002423 if (req->end_io)
Tejun Heo8ffdc652006-01-06 09:49:03 +01002424 req->end_io(req, error);
Kiyoshi Uedab8286232007-12-11 17:53:24 -05002425 else {
2426 if (blk_bidi_rq(req))
2427 __blk_put_request(req->next_rq->q, req->next_rq);
2428
Linus Torvalds1da177e2005-04-16 15:20:36 -07002429 __blk_put_request(req->q, req);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002430 }
2431}
2432
Kiyoshi Ueda3b113132007-12-11 17:41:17 -05002433/**
Tejun Heo2e60e022009-04-23 11:05:18 +09002434 * blk_end_bidi_request - Complete a bidi request
2435 * @rq: the request to complete
Randy Dunlap710027a2008-08-19 20:13:11 +02002436 * @error: %0 for success, < %0 for error
Kiyoshi Uedae3a04fe2007-12-11 17:51:46 -05002437 * @nr_bytes: number of bytes to complete @rq
2438 * @bidi_bytes: number of bytes to complete @rq->next_rq
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002439 *
2440 * Description:
2441 * Ends I/O on a number of bytes attached to @rq and @rq->next_rq.
Tejun Heo2e60e022009-04-23 11:05:18 +09002442 * Drivers that supports bidi can safely call this member for any
2443 * type of request, bidi or uni. In the later case @bidi_bytes is
2444 * just ignored.
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002445 *
2446 * Return:
Tejun Heo2e60e022009-04-23 11:05:18 +09002447 * %false - we are done with this request
2448 * %true - still buffers pending for this request
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002449 **/
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002450static bool blk_end_bidi_request(struct request *rq, int error,
2451 unsigned int nr_bytes, unsigned int bidi_bytes)
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002452{
2453 struct request_queue *q = rq->q;
Tejun Heo2e60e022009-04-23 11:05:18 +09002454 unsigned long flags;
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002455
Tejun Heo2e60e022009-04-23 11:05:18 +09002456 if (blk_update_bidi_request(rq, error, nr_bytes, bidi_bytes))
2457 return true;
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05002458
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002459 spin_lock_irqsave(q->queue_lock, flags);
Tejun Heo2e60e022009-04-23 11:05:18 +09002460 blk_finish_request(rq, error);
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002461 spin_unlock_irqrestore(q->queue_lock, flags);
2462
Tejun Heo2e60e022009-04-23 11:05:18 +09002463 return false;
Kiyoshi Uedae3a04fe2007-12-11 17:51:46 -05002464}
Kiyoshi Uedae3a04fe2007-12-11 17:51:46 -05002465
2466/**
Tejun Heo2e60e022009-04-23 11:05:18 +09002467 * __blk_end_bidi_request - Complete a bidi request with queue lock held
2468 * @rq: the request to complete
2469 * @error: %0 for success, < %0 for error
2470 * @nr_bytes: number of bytes to complete @rq
2471 * @bidi_bytes: number of bytes to complete @rq->next_rq
Tejun Heo5efccd12009-04-23 11:05:18 +09002472 *
2473 * Description:
Tejun Heo2e60e022009-04-23 11:05:18 +09002474 * Identical to blk_end_bidi_request() except that queue lock is
2475 * assumed to be locked on entry and remains so on return.
Tejun Heo5efccd12009-04-23 11:05:18 +09002476 *
Tejun Heo2e60e022009-04-23 11:05:18 +09002477 * Return:
2478 * %false - we are done with this request
2479 * %true - still buffers pending for this request
Tejun Heo5efccd12009-04-23 11:05:18 +09002480 **/
Jeff Moyer4853aba2011-08-15 21:37:25 +02002481bool __blk_end_bidi_request(struct request *rq, int error,
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002482 unsigned int nr_bytes, unsigned int bidi_bytes)
Tejun Heo5efccd12009-04-23 11:05:18 +09002483{
Tejun Heo2e60e022009-04-23 11:05:18 +09002484 if (blk_update_bidi_request(rq, error, nr_bytes, bidi_bytes))
2485 return true;
Tejun Heo5efccd12009-04-23 11:05:18 +09002486
Tejun Heo2e60e022009-04-23 11:05:18 +09002487 blk_finish_request(rq, error);
Tejun Heo5efccd12009-04-23 11:05:18 +09002488
Tejun Heo2e60e022009-04-23 11:05:18 +09002489 return false;
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002490}
2491
2492/**
2493 * blk_end_request - Helper function for drivers to complete the request.
2494 * @rq: the request being processed
2495 * @error: %0 for success, < %0 for error
2496 * @nr_bytes: number of bytes to complete
2497 *
2498 * Description:
2499 * Ends I/O on a number of bytes attached to @rq.
2500 * If @rq has leftover, sets it up for the next range of segments.
2501 *
2502 * Return:
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002503 * %false - we are done with this request
2504 * %true - still buffers pending for this request
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002505 **/
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002506bool blk_end_request(struct request *rq, int error, unsigned int nr_bytes)
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002507{
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002508 return blk_end_bidi_request(rq, error, nr_bytes, 0);
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002509}
Jens Axboe56ad1742009-07-28 22:11:24 +02002510EXPORT_SYMBOL(blk_end_request);
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002511
2512/**
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002513 * blk_end_request_all - Helper function for drives to finish the request.
2514 * @rq: the request to finish
Randy Dunlap8ebf9752009-06-11 20:00:41 -07002515 * @error: %0 for success, < %0 for error
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002516 *
2517 * Description:
2518 * Completely finish @rq.
2519 */
2520void blk_end_request_all(struct request *rq, int error)
2521{
2522 bool pending;
2523 unsigned int bidi_bytes = 0;
2524
2525 if (unlikely(blk_bidi_rq(rq)))
2526 bidi_bytes = blk_rq_bytes(rq->next_rq);
2527
2528 pending = blk_end_bidi_request(rq, error, blk_rq_bytes(rq), bidi_bytes);
2529 BUG_ON(pending);
2530}
Jens Axboe56ad1742009-07-28 22:11:24 +02002531EXPORT_SYMBOL(blk_end_request_all);
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002532
2533/**
2534 * blk_end_request_cur - Helper function to finish the current request chunk.
2535 * @rq: the request to finish the current chunk for
Randy Dunlap8ebf9752009-06-11 20:00:41 -07002536 * @error: %0 for success, < %0 for error
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002537 *
2538 * Description:
2539 * Complete the current consecutively mapped chunk from @rq.
2540 *
2541 * Return:
2542 * %false - we are done with this request
2543 * %true - still buffers pending for this request
2544 */
2545bool blk_end_request_cur(struct request *rq, int error)
2546{
2547 return blk_end_request(rq, error, blk_rq_cur_bytes(rq));
2548}
Jens Axboe56ad1742009-07-28 22:11:24 +02002549EXPORT_SYMBOL(blk_end_request_cur);
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002550
2551/**
Tejun Heo80a761f2009-07-03 17:48:17 +09002552 * blk_end_request_err - Finish a request till the next failure boundary.
2553 * @rq: the request to finish till the next failure boundary for
2554 * @error: must be negative errno
2555 *
2556 * Description:
2557 * Complete @rq till the next failure boundary.
2558 *
2559 * Return:
2560 * %false - we are done with this request
2561 * %true - still buffers pending for this request
2562 */
2563bool blk_end_request_err(struct request *rq, int error)
2564{
2565 WARN_ON(error >= 0);
2566 return blk_end_request(rq, error, blk_rq_err_bytes(rq));
2567}
2568EXPORT_SYMBOL_GPL(blk_end_request_err);
2569
2570/**
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05002571 * __blk_end_request - Helper function for drivers to complete the request.
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002572 * @rq: the request being processed
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05002573 * @error: %0 for success, < %0 for error
2574 * @nr_bytes: number of bytes to complete
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002575 *
2576 * Description:
2577 * Must be called with queue lock held unlike blk_end_request().
2578 *
2579 * Return:
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002580 * %false - we are done with this request
2581 * %true - still buffers pending for this request
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002582 **/
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002583bool __blk_end_request(struct request *rq, int error, unsigned int nr_bytes)
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002584{
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002585 return __blk_end_bidi_request(rq, error, nr_bytes, 0);
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002586}
Jens Axboe56ad1742009-07-28 22:11:24 +02002587EXPORT_SYMBOL(__blk_end_request);
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002588
2589/**
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002590 * __blk_end_request_all - Helper function for drives to finish the request.
2591 * @rq: the request to finish
Randy Dunlap8ebf9752009-06-11 20:00:41 -07002592 * @error: %0 for success, < %0 for error
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002593 *
2594 * Description:
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002595 * Completely finish @rq. Must be called with queue lock held.
Kiyoshi Ueda32fab442008-09-18 10:45:09 -04002596 */
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002597void __blk_end_request_all(struct request *rq, int error)
Kiyoshi Ueda32fab442008-09-18 10:45:09 -04002598{
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002599 bool pending;
2600 unsigned int bidi_bytes = 0;
2601
2602 if (unlikely(blk_bidi_rq(rq)))
2603 bidi_bytes = blk_rq_bytes(rq->next_rq);
2604
2605 pending = __blk_end_bidi_request(rq, error, blk_rq_bytes(rq), bidi_bytes);
2606 BUG_ON(pending);
Kiyoshi Ueda32fab442008-09-18 10:45:09 -04002607}
Jens Axboe56ad1742009-07-28 22:11:24 +02002608EXPORT_SYMBOL(__blk_end_request_all);
Kiyoshi Ueda32fab442008-09-18 10:45:09 -04002609
2610/**
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002611 * __blk_end_request_cur - Helper function to finish the current request chunk.
2612 * @rq: the request to finish the current chunk for
Randy Dunlap8ebf9752009-06-11 20:00:41 -07002613 * @error: %0 for success, < %0 for error
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05002614 *
2615 * Description:
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002616 * Complete the current consecutively mapped chunk from @rq. Must
2617 * be called with queue lock held.
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05002618 *
2619 * Return:
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002620 * %false - we are done with this request
2621 * %true - still buffers pending for this request
2622 */
2623bool __blk_end_request_cur(struct request *rq, int error)
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05002624{
FUJITA Tomonorib1f74492009-05-11 17:56:09 +09002625 return __blk_end_request(rq, error, blk_rq_cur_bytes(rq));
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05002626}
Jens Axboe56ad1742009-07-28 22:11:24 +02002627EXPORT_SYMBOL(__blk_end_request_cur);
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05002628
Tejun Heo80a761f2009-07-03 17:48:17 +09002629/**
2630 * __blk_end_request_err - Finish a request till the next failure boundary.
2631 * @rq: the request to finish till the next failure boundary for
2632 * @error: must be negative errno
2633 *
2634 * Description:
2635 * Complete @rq till the next failure boundary. Must be called
2636 * with queue lock held.
2637 *
2638 * Return:
2639 * %false - we are done with this request
2640 * %true - still buffers pending for this request
2641 */
2642bool __blk_end_request_err(struct request *rq, int error)
2643{
2644 WARN_ON(error >= 0);
2645 return __blk_end_request(rq, error, blk_rq_err_bytes(rq));
2646}
2647EXPORT_SYMBOL_GPL(__blk_end_request_err);
2648
Jens Axboe86db1e22008-01-29 14:53:40 +01002649void blk_rq_bio_prep(struct request_queue *q, struct request *rq,
2650 struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002651{
Tejun Heoa82afdf2009-07-03 17:48:16 +09002652 /* Bit 0 (R/W) is identical in rq->cmd_flags and bio->bi_rw */
Christoph Hellwig7b6d91d2010-08-07 18:20:39 +02002653 rq->cmd_flags |= bio->bi_rw & REQ_WRITE;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002654
David Woodhousefb2dce82008-08-05 18:01:53 +01002655 if (bio_has_data(bio)) {
2656 rq->nr_phys_segments = bio_phys_segments(q, bio);
David Woodhousefb2dce82008-08-05 18:01:53 +01002657 rq->buffer = bio_data(bio);
2658 }
Tejun Heoa2dec7b2009-05-07 22:24:44 +09002659 rq->__data_len = bio->bi_size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002660 rq->bio = rq->biotail = bio;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002661
NeilBrown66846572007-08-16 13:31:28 +02002662 if (bio->bi_bdev)
2663 rq->rq_disk = bio->bi_bdev->bd_disk;
2664}
Linus Torvalds1da177e2005-04-16 15:20:36 -07002665
Ilya Loginov2d4dc892009-11-26 09:16:19 +01002666#if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
2667/**
2668 * rq_flush_dcache_pages - Helper function to flush all pages in a request
2669 * @rq: the request to be flushed
2670 *
2671 * Description:
2672 * Flush all pages in @rq.
2673 */
2674void rq_flush_dcache_pages(struct request *rq)
2675{
2676 struct req_iterator iter;
2677 struct bio_vec *bvec;
2678
2679 rq_for_each_segment(bvec, rq, iter)
2680 flush_dcache_page(bvec->bv_page);
2681}
2682EXPORT_SYMBOL_GPL(rq_flush_dcache_pages);
2683#endif
2684
Kiyoshi Uedaef9e3fa2008-10-01 16:12:15 +02002685/**
2686 * blk_lld_busy - Check if underlying low-level drivers of a device are busy
2687 * @q : the queue of the device being checked
2688 *
2689 * Description:
2690 * Check if underlying low-level drivers of a device are busy.
2691 * If the drivers want to export their busy state, they must set own
2692 * exporting function using blk_queue_lld_busy() first.
2693 *
2694 * Basically, this function is used only by request stacking drivers
2695 * to stop dispatching requests to underlying devices when underlying
2696 * devices are busy. This behavior helps more I/O merging on the queue
2697 * of the request stacking driver and prevents I/O throughput regression
2698 * on burst I/O load.
2699 *
2700 * Return:
2701 * 0 - Not busy (The request stacking driver should dispatch request)
2702 * 1 - Busy (The request stacking driver should stop dispatching request)
2703 */
2704int blk_lld_busy(struct request_queue *q)
2705{
2706 if (q->lld_busy_fn)
2707 return q->lld_busy_fn(q);
2708
2709 return 0;
2710}
2711EXPORT_SYMBOL_GPL(blk_lld_busy);
2712
Kiyoshi Uedab0fd2712009-06-11 13:10:16 +02002713/**
2714 * blk_rq_unprep_clone - Helper function to free all bios in a cloned request
2715 * @rq: the clone request to be cleaned up
2716 *
2717 * Description:
2718 * Free all bios in @rq for a cloned request.
2719 */
2720void blk_rq_unprep_clone(struct request *rq)
2721{
2722 struct bio *bio;
2723
2724 while ((bio = rq->bio) != NULL) {
2725 rq->bio = bio->bi_next;
2726
2727 bio_put(bio);
2728 }
2729}
2730EXPORT_SYMBOL_GPL(blk_rq_unprep_clone);
2731
2732/*
2733 * Copy attributes of the original request to the clone request.
2734 * The actual data parts (e.g. ->cmd, ->buffer, ->sense) are not copied.
2735 */
2736static void __blk_rq_prep_clone(struct request *dst, struct request *src)
2737{
2738 dst->cpu = src->cpu;
Tejun Heo3a2edd02010-09-03 11:56:18 +02002739 dst->cmd_flags = (src->cmd_flags & REQ_CLONE_MASK) | REQ_NOMERGE;
Kiyoshi Uedab0fd2712009-06-11 13:10:16 +02002740 dst->cmd_type = src->cmd_type;
2741 dst->__sector = blk_rq_pos(src);
2742 dst->__data_len = blk_rq_bytes(src);
2743 dst->nr_phys_segments = src->nr_phys_segments;
2744 dst->ioprio = src->ioprio;
2745 dst->extra_len = src->extra_len;
2746}
2747
2748/**
2749 * blk_rq_prep_clone - Helper function to setup clone request
2750 * @rq: the request to be setup
2751 * @rq_src: original request to be cloned
2752 * @bs: bio_set that bios for clone are allocated from
2753 * @gfp_mask: memory allocation mask for bio
2754 * @bio_ctr: setup function to be called for each clone bio.
2755 * Returns %0 for success, non %0 for failure.
2756 * @data: private data to be passed to @bio_ctr
2757 *
2758 * Description:
2759 * Clones bios in @rq_src to @rq, and copies attributes of @rq_src to @rq.
2760 * The actual data parts of @rq_src (e.g. ->cmd, ->buffer, ->sense)
2761 * are not copied, and copying such parts is the caller's responsibility.
2762 * Also, pages which the original bios are pointing to are not copied
2763 * and the cloned bios just point same pages.
2764 * So cloned bios must be completed before original bios, which means
2765 * the caller must complete @rq before @rq_src.
2766 */
2767int blk_rq_prep_clone(struct request *rq, struct request *rq_src,
2768 struct bio_set *bs, gfp_t gfp_mask,
2769 int (*bio_ctr)(struct bio *, struct bio *, void *),
2770 void *data)
2771{
2772 struct bio *bio, *bio_src;
2773
2774 if (!bs)
2775 bs = fs_bio_set;
2776
2777 blk_rq_init(NULL, rq);
2778
2779 __rq_for_each_bio(bio_src, rq_src) {
Kent Overstreetbf800ef2012-09-06 15:35:02 -07002780 bio = bio_clone_bioset(bio_src, gfp_mask, bs);
Kiyoshi Uedab0fd2712009-06-11 13:10:16 +02002781 if (!bio)
2782 goto free_and_out;
2783
Kiyoshi Uedab0fd2712009-06-11 13:10:16 +02002784 if (bio_ctr && bio_ctr(bio, bio_src, data))
2785 goto free_and_out;
2786
2787 if (rq->bio) {
2788 rq->biotail->bi_next = bio;
2789 rq->biotail = bio;
2790 } else
2791 rq->bio = rq->biotail = bio;
2792 }
2793
2794 __blk_rq_prep_clone(rq, rq_src);
2795
2796 return 0;
2797
2798free_and_out:
2799 if (bio)
Kent Overstreet4254bba2012-09-06 15:35:00 -07002800 bio_put(bio);
Kiyoshi Uedab0fd2712009-06-11 13:10:16 +02002801 blk_rq_unprep_clone(rq);
2802
2803 return -ENOMEM;
2804}
2805EXPORT_SYMBOL_GPL(blk_rq_prep_clone);
2806
Jens Axboe18887ad2008-07-28 13:08:45 +02002807int kblockd_schedule_work(struct request_queue *q, struct work_struct *work)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002808{
2809 return queue_work(kblockd_workqueue, work);
2810}
Linus Torvalds1da177e2005-04-16 15:20:36 -07002811EXPORT_SYMBOL(kblockd_schedule_work);
2812
Vivek Goyale43473b2010-09-15 17:06:35 -04002813int kblockd_schedule_delayed_work(struct request_queue *q,
2814 struct delayed_work *dwork, unsigned long delay)
2815{
2816 return queue_delayed_work(kblockd_workqueue, dwork, delay);
2817}
2818EXPORT_SYMBOL(kblockd_schedule_delayed_work);
2819
Jens Axboe73c10102011-03-08 13:19:51 +01002820#define PLUG_MAGIC 0x91827364
2821
Suresh Jayaraman75df7132011-09-21 10:00:16 +02002822/**
2823 * blk_start_plug - initialize blk_plug and track it inside the task_struct
2824 * @plug: The &struct blk_plug that needs to be initialized
2825 *
2826 * Description:
2827 * Tracking blk_plug inside the task_struct will help with auto-flushing the
2828 * pending I/O should the task end up blocking between blk_start_plug() and
2829 * blk_finish_plug(). This is important from a performance perspective, but
2830 * also ensures that we don't deadlock. For instance, if the task is blocking
2831 * for a memory allocation, memory reclaim could end up wanting to free a
2832 * page belonging to that request that is currently residing in our private
2833 * plug. By flushing the pending I/O when the process goes to sleep, we avoid
2834 * this kind of deadlock.
2835 */
Jens Axboe73c10102011-03-08 13:19:51 +01002836void blk_start_plug(struct blk_plug *plug)
2837{
2838 struct task_struct *tsk = current;
2839
2840 plug->magic = PLUG_MAGIC;
2841 INIT_LIST_HEAD(&plug->list);
NeilBrown048c9372011-04-18 09:52:22 +02002842 INIT_LIST_HEAD(&plug->cb_list);
Jens Axboe73c10102011-03-08 13:19:51 +01002843 plug->should_sort = 0;
2844
2845 /*
2846 * If this is a nested plug, don't actually assign it. It will be
2847 * flushed on its own.
2848 */
2849 if (!tsk->plug) {
2850 /*
2851 * Store ordering should not be needed here, since a potential
2852 * preempt will imply a full memory barrier
2853 */
2854 tsk->plug = plug;
2855 }
2856}
2857EXPORT_SYMBOL(blk_start_plug);
2858
2859static int plug_rq_cmp(void *priv, struct list_head *a, struct list_head *b)
2860{
2861 struct request *rqa = container_of(a, struct request, queuelist);
2862 struct request *rqb = container_of(b, struct request, queuelist);
2863
Konstantin Khlebnikovf83e8262011-04-04 00:15:02 +02002864 return !(rqa->q <= rqb->q);
Jens Axboe73c10102011-03-08 13:19:51 +01002865}
2866
Jens Axboe49cac012011-04-16 13:51:05 +02002867/*
2868 * If 'from_schedule' is true, then postpone the dispatch of requests
2869 * until a safe kblockd context. We due this to avoid accidental big
2870 * additional stack usage in driver dispatch, in places where the originally
2871 * plugger did not intend it.
2872 */
Jens Axboef6603782011-04-15 15:49:07 +02002873static void queue_unplugged(struct request_queue *q, unsigned int depth,
Jens Axboe49cac012011-04-16 13:51:05 +02002874 bool from_schedule)
Jens Axboe99e22592011-04-18 09:59:55 +02002875 __releases(q->queue_lock)
Jens Axboe94b5eb22011-04-12 10:12:19 +02002876{
Jens Axboe49cac012011-04-16 13:51:05 +02002877 trace_block_unplug(q, depth, !from_schedule);
Jens Axboe99e22592011-04-18 09:59:55 +02002878
2879 /*
Tejun Heo8ba61432011-12-14 00:33:37 +01002880 * Don't mess with dead queue.
2881 */
2882 if (unlikely(blk_queue_dead(q))) {
2883 spin_unlock(q->queue_lock);
2884 return;
2885 }
2886
2887 /*
Jens Axboe99e22592011-04-18 09:59:55 +02002888 * If we are punting this to kblockd, then we can safely drop
2889 * the queue_lock before waking kblockd (which needs to take
2890 * this lock).
2891 */
2892 if (from_schedule) {
2893 spin_unlock(q->queue_lock);
Christoph Hellwig24ecfbe2011-04-18 11:41:33 +02002894 blk_run_queue_async(q);
Jens Axboe99e22592011-04-18 09:59:55 +02002895 } else {
Christoph Hellwig24ecfbe2011-04-18 11:41:33 +02002896 __blk_run_queue(q);
Jens Axboe99e22592011-04-18 09:59:55 +02002897 spin_unlock(q->queue_lock);
2898 }
2899
Jens Axboe94b5eb22011-04-12 10:12:19 +02002900}
2901
NeilBrown74018dc2012-07-31 09:08:15 +02002902static void flush_plug_callbacks(struct blk_plug *plug, bool from_schedule)
NeilBrown048c9372011-04-18 09:52:22 +02002903{
2904 LIST_HEAD(callbacks);
2905
Shaohua Li2a7d5552012-07-31 09:08:15 +02002906 while (!list_empty(&plug->cb_list)) {
2907 list_splice_init(&plug->cb_list, &callbacks);
NeilBrown048c9372011-04-18 09:52:22 +02002908
Shaohua Li2a7d5552012-07-31 09:08:15 +02002909 while (!list_empty(&callbacks)) {
2910 struct blk_plug_cb *cb = list_first_entry(&callbacks,
NeilBrown048c9372011-04-18 09:52:22 +02002911 struct blk_plug_cb,
2912 list);
Shaohua Li2a7d5552012-07-31 09:08:15 +02002913 list_del(&cb->list);
NeilBrown74018dc2012-07-31 09:08:15 +02002914 cb->callback(cb, from_schedule);
Shaohua Li2a7d5552012-07-31 09:08:15 +02002915 }
NeilBrown048c9372011-04-18 09:52:22 +02002916 }
2917}
2918
NeilBrown9cbb1752012-07-31 09:08:14 +02002919struct blk_plug_cb *blk_check_plugged(blk_plug_cb_fn unplug, void *data,
2920 int size)
2921{
2922 struct blk_plug *plug = current->plug;
2923 struct blk_plug_cb *cb;
2924
2925 if (!plug)
2926 return NULL;
2927
2928 list_for_each_entry(cb, &plug->cb_list, list)
2929 if (cb->callback == unplug && cb->data == data)
2930 return cb;
2931
2932 /* Not currently on the callback list */
2933 BUG_ON(size < sizeof(*cb));
2934 cb = kzalloc(size, GFP_ATOMIC);
2935 if (cb) {
2936 cb->data = data;
2937 cb->callback = unplug;
2938 list_add(&cb->list, &plug->cb_list);
2939 }
2940 return cb;
2941}
2942EXPORT_SYMBOL(blk_check_plugged);
2943
Jens Axboe49cac012011-04-16 13:51:05 +02002944void blk_flush_plug_list(struct blk_plug *plug, bool from_schedule)
Jens Axboe73c10102011-03-08 13:19:51 +01002945{
2946 struct request_queue *q;
2947 unsigned long flags;
2948 struct request *rq;
NeilBrown109b8122011-04-11 14:13:10 +02002949 LIST_HEAD(list);
Jens Axboe94b5eb22011-04-12 10:12:19 +02002950 unsigned int depth;
Jens Axboe73c10102011-03-08 13:19:51 +01002951
2952 BUG_ON(plug->magic != PLUG_MAGIC);
2953
NeilBrown74018dc2012-07-31 09:08:15 +02002954 flush_plug_callbacks(plug, from_schedule);
Jens Axboe73c10102011-03-08 13:19:51 +01002955 if (list_empty(&plug->list))
2956 return;
2957
NeilBrown109b8122011-04-11 14:13:10 +02002958 list_splice_init(&plug->list, &list);
2959
2960 if (plug->should_sort) {
2961 list_sort(NULL, &list, plug_rq_cmp);
2962 plug->should_sort = 0;
2963 }
Jens Axboe73c10102011-03-08 13:19:51 +01002964
2965 q = NULL;
Jens Axboe94b5eb22011-04-12 10:12:19 +02002966 depth = 0;
Jens Axboe18811272011-04-12 10:11:24 +02002967
2968 /*
2969 * Save and disable interrupts here, to avoid doing it for every
2970 * queue lock we have to take.
2971 */
Jens Axboe73c10102011-03-08 13:19:51 +01002972 local_irq_save(flags);
NeilBrown109b8122011-04-11 14:13:10 +02002973 while (!list_empty(&list)) {
2974 rq = list_entry_rq(list.next);
Jens Axboe73c10102011-03-08 13:19:51 +01002975 list_del_init(&rq->queuelist);
Jens Axboe73c10102011-03-08 13:19:51 +01002976 BUG_ON(!rq->q);
2977 if (rq->q != q) {
Jens Axboe99e22592011-04-18 09:59:55 +02002978 /*
2979 * This drops the queue lock
2980 */
2981 if (q)
Jens Axboe49cac012011-04-16 13:51:05 +02002982 queue_unplugged(q, depth, from_schedule);
Jens Axboe73c10102011-03-08 13:19:51 +01002983 q = rq->q;
Jens Axboe94b5eb22011-04-12 10:12:19 +02002984 depth = 0;
Jens Axboe73c10102011-03-08 13:19:51 +01002985 spin_lock(q->queue_lock);
2986 }
Tejun Heo8ba61432011-12-14 00:33:37 +01002987
2988 /*
2989 * Short-circuit if @q is dead
2990 */
2991 if (unlikely(blk_queue_dead(q))) {
2992 __blk_end_request_all(rq, -ENODEV);
2993 continue;
2994 }
2995
Jens Axboe73c10102011-03-08 13:19:51 +01002996 /*
2997 * rq is already accounted, so use raw insert
2998 */
Jens Axboe401a18e2011-03-25 16:57:52 +01002999 if (rq->cmd_flags & (REQ_FLUSH | REQ_FUA))
3000 __elv_add_request(q, rq, ELEVATOR_INSERT_FLUSH);
3001 else
3002 __elv_add_request(q, rq, ELEVATOR_INSERT_SORT_MERGE);
Jens Axboe94b5eb22011-04-12 10:12:19 +02003003
3004 depth++;
Jens Axboe73c10102011-03-08 13:19:51 +01003005 }
3006
Jens Axboe99e22592011-04-18 09:59:55 +02003007 /*
3008 * This drops the queue lock
3009 */
3010 if (q)
Jens Axboe49cac012011-04-16 13:51:05 +02003011 queue_unplugged(q, depth, from_schedule);
Jens Axboe73c10102011-03-08 13:19:51 +01003012
Jens Axboe73c10102011-03-08 13:19:51 +01003013 local_irq_restore(flags);
3014}
Jens Axboe73c10102011-03-08 13:19:51 +01003015
3016void blk_finish_plug(struct blk_plug *plug)
3017{
Jens Axboef6603782011-04-15 15:49:07 +02003018 blk_flush_plug_list(plug, false);
Christoph Hellwig88b996c2011-04-15 15:20:10 +02003019
3020 if (plug == current->plug)
3021 current->plug = NULL;
Jens Axboe73c10102011-03-08 13:19:51 +01003022}
3023EXPORT_SYMBOL(blk_finish_plug);
3024
Linus Torvalds1da177e2005-04-16 15:20:36 -07003025int __init blk_dev_init(void)
3026{
Nikanth Karthikesan9eb55b02009-04-27 14:53:54 +02003027 BUILD_BUG_ON(__REQ_NR_BITS > 8 *
3028 sizeof(((struct request *)0)->cmd_flags));
3029
Tejun Heo89b90be2011-01-03 15:01:47 +01003030 /* used for unplugging and affects IO latency/throughput - HIGHPRI */
3031 kblockd_workqueue = alloc_workqueue("kblockd",
3032 WQ_MEM_RECLAIM | WQ_HIGHPRI, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003033 if (!kblockd_workqueue)
3034 panic("Failed to create kblockd\n");
3035
3036 request_cachep = kmem_cache_create("blkdev_requests",
Paul Mundt20c2df82007-07-20 10:11:58 +09003037 sizeof(struct request), 0, SLAB_PANIC, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003038
Jens Axboe8324aa92008-01-29 14:51:59 +01003039 blk_requestq_cachep = kmem_cache_create("blkdev_queue",
Jens Axboe165125e2007-07-24 09:28:11 +02003040 sizeof(struct request_queue), 0, SLAB_PANIC, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003041
Linus Torvalds1da177e2005-04-16 15:20:36 -07003042 return 0;
3043}