blob: 07ab75403e1a5d2f753bcf0c904fda2f3bd760ef [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 Mortonfaccbd42006-12-10 02:19:35 -080028#include <linux/task_io_accounting_ops.h>
Jens Axboe2056a782006-03-23 20:00:26 +010029#include <linux/blktrace_api.h>
Akinobu Mitac17bb492006-12-08 02:39:46 -080030#include <linux/fault-inject.h>
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +010031#include <trace/block.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070032
Jens Axboe8324aa92008-01-29 14:51:59 +010033#include "blk.h"
34
Ingo Molnar0bfc2452008-11-26 11:59:56 +010035DEFINE_TRACE(block_plug);
36DEFINE_TRACE(block_unplug_io);
37DEFINE_TRACE(block_unplug_timer);
38DEFINE_TRACE(block_getrq);
39DEFINE_TRACE(block_sleeprq);
40DEFINE_TRACE(block_rq_requeue);
41DEFINE_TRACE(block_bio_backmerge);
42DEFINE_TRACE(block_bio_frontmerge);
43DEFINE_TRACE(block_bio_queue);
44DEFINE_TRACE(block_rq_complete);
45DEFINE_TRACE(block_remap); /* Also used in drivers/md/dm.c */
46EXPORT_TRACEPOINT_SYMBOL_GPL(block_remap);
47
Jens Axboe165125e2007-07-24 09:28:11 +020048static int __make_request(struct request_queue *q, struct bio *bio);
Linus Torvalds1da177e2005-04-16 15:20:36 -070049
50/*
51 * For the allocated request tables
52 */
Adrian Bunk5ece6c52008-02-18 13:45:51 +010053static struct kmem_cache *request_cachep;
Linus Torvalds1da177e2005-04-16 15:20:36 -070054
55/*
56 * For queue allocation
57 */
Jens Axboe6728cb02008-01-31 13:03:55 +010058struct kmem_cache *blk_requestq_cachep;
Linus Torvalds1da177e2005-04-16 15:20:36 -070059
60/*
Linus Torvalds1da177e2005-04-16 15:20:36 -070061 * Controlling structure to kblockd
62 */
Jens Axboeff856ba2006-01-09 16:02:34 +010063static struct workqueue_struct *kblockd_workqueue;
Linus Torvalds1da177e2005-04-16 15:20:36 -070064
Jens Axboe26b82562008-01-29 13:54:41 +010065static void drive_stat_acct(struct request *rq, int new_io)
66{
Jens Axboe28f13702008-05-07 10:15:46 +020067 struct hd_struct *part;
Jens Axboe26b82562008-01-29 13:54:41 +010068 int rw = rq_data_dir(rq);
Tejun Heoc9959052008-08-25 19:47:21 +090069 int cpu;
Jens Axboe26b82562008-01-29 13:54:41 +010070
Jerome Marchand26308ea2009-03-27 10:31:51 +010071 if (!blk_fs_request(rq) || !blk_do_io_stat(rq))
Jens Axboe26b82562008-01-29 13:54:41 +010072 return;
73
Tejun Heo074a7ac2008-08-25 19:56:14 +090074 cpu = part_stat_lock();
Tejun Heoe71bf0d2008-09-03 09:03:02 +020075 part = disk_map_sector_rcu(rq->rq_disk, rq->sector);
Tejun Heoc9959052008-08-25 19:47:21 +090076
Jens Axboe28f13702008-05-07 10:15:46 +020077 if (!new_io)
Tejun Heo074a7ac2008-08-25 19:56:14 +090078 part_stat_inc(cpu, part, merges[rw]);
Jens Axboe28f13702008-05-07 10:15:46 +020079 else {
Tejun Heo074a7ac2008-08-25 19:56:14 +090080 part_round_stats(cpu, part);
81 part_inc_in_flight(part);
Jens Axboe26b82562008-01-29 13:54:41 +010082 }
Tejun Heoe71bf0d2008-09-03 09:03:02 +020083
Tejun Heo074a7ac2008-08-25 19:56:14 +090084 part_stat_unlock();
Jens Axboe26b82562008-01-29 13:54:41 +010085}
86
Jens Axboe8324aa92008-01-29 14:51:59 +010087void blk_queue_congestion_threshold(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -070088{
89 int nr;
90
91 nr = q->nr_requests - (q->nr_requests / 8) + 1;
92 if (nr > q->nr_requests)
93 nr = q->nr_requests;
94 q->nr_congestion_on = nr;
95
96 nr = q->nr_requests - (q->nr_requests / 8) - (q->nr_requests / 16) - 1;
97 if (nr < 1)
98 nr = 1;
99 q->nr_congestion_off = nr;
100}
101
Linus Torvalds1da177e2005-04-16 15:20:36 -0700102/**
103 * blk_get_backing_dev_info - get the address of a queue's backing_dev_info
104 * @bdev: device
105 *
106 * Locates the passed device's request queue and returns the address of its
107 * backing_dev_info
108 *
109 * Will return NULL if the request queue cannot be located.
110 */
111struct backing_dev_info *blk_get_backing_dev_info(struct block_device *bdev)
112{
113 struct backing_dev_info *ret = NULL;
Jens Axboe165125e2007-07-24 09:28:11 +0200114 struct request_queue *q = bdev_get_queue(bdev);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700115
116 if (q)
117 ret = &q->backing_dev_info;
118 return ret;
119}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700120EXPORT_SYMBOL(blk_get_backing_dev_info);
121
FUJITA Tomonori2a4aa302008-04-29 09:54:36 +0200122void blk_rq_init(struct request_queue *q, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700123{
FUJITA Tomonori1afb20f2008-04-25 12:26:28 +0200124 memset(rq, 0, sizeof(*rq));
125
Linus Torvalds1da177e2005-04-16 15:20:36 -0700126 INIT_LIST_HEAD(&rq->queuelist);
Jens Axboe242f9dc2008-09-14 05:55:09 -0700127 INIT_LIST_HEAD(&rq->timeout_list);
Jens Axboec7c22e42008-09-13 20:26:01 +0200128 rq->cpu = -1;
Jens Axboe63a71382008-02-08 12:41:03 +0100129 rq->q = q;
130 rq->sector = rq->hard_sector = (sector_t) -1;
Jens Axboe2e662b62006-07-13 11:55:04 +0200131 INIT_HLIST_NODE(&rq->hash);
132 RB_CLEAR_NODE(&rq->rb_node);
FUJITA Tomonorid7e3c322008-04-29 09:54:39 +0200133 rq->cmd = rq->__cmd;
Li Zefane2494e12009-04-02 13:43:26 +0800134 rq->cmd_len = BLK_MAX_CDB;
Jens Axboe63a71382008-02-08 12:41:03 +0100135 rq->tag = -1;
Jens Axboe63a71382008-02-08 12:41:03 +0100136 rq->ref_count = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700137}
FUJITA Tomonori2a4aa302008-04-29 09:54:36 +0200138EXPORT_SYMBOL(blk_rq_init);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139
NeilBrown5bb23a62007-09-27 12:46:13 +0200140static void req_bio_endio(struct request *rq, struct bio *bio,
141 unsigned int nbytes, int error)
Tejun Heo797e7db2006-01-06 09:51:03 +0100142{
Jens Axboe165125e2007-07-24 09:28:11 +0200143 struct request_queue *q = rq->q;
Tejun Heo797e7db2006-01-06 09:51:03 +0100144
NeilBrown5bb23a62007-09-27 12:46:13 +0200145 if (&q->bar_rq != rq) {
146 if (error)
147 clear_bit(BIO_UPTODATE, &bio->bi_flags);
148 else if (!test_bit(BIO_UPTODATE, &bio->bi_flags))
149 error = -EIO;
Tejun Heo797e7db2006-01-06 09:51:03 +0100150
NeilBrown5bb23a62007-09-27 12:46:13 +0200151 if (unlikely(nbytes > bio->bi_size)) {
Jens Axboe6728cb02008-01-31 13:03:55 +0100152 printk(KERN_ERR "%s: want %u bytes done, %u left\n",
Harvey Harrison24c03d42008-05-01 04:35:17 -0700153 __func__, nbytes, bio->bi_size);
NeilBrown5bb23a62007-09-27 12:46:13 +0200154 nbytes = bio->bi_size;
155 }
Tejun Heo797e7db2006-01-06 09:51:03 +0100156
Keith Mannthey08bafc02008-11-25 10:24:35 +0100157 if (unlikely(rq->cmd_flags & REQ_QUIET))
158 set_bit(BIO_QUIET, &bio->bi_flags);
159
NeilBrown5bb23a62007-09-27 12:46:13 +0200160 bio->bi_size -= nbytes;
161 bio->bi_sector += (nbytes >> 9);
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200162
163 if (bio_integrity(bio))
164 bio_integrity_advance(bio, nbytes);
165
NeilBrown5bb23a62007-09-27 12:46:13 +0200166 if (bio->bi_size == 0)
NeilBrown6712ecf2007-09-27 12:47:43 +0200167 bio_endio(bio, error);
NeilBrown5bb23a62007-09-27 12:46:13 +0200168 } else {
169
170 /*
171 * Okay, this is the barrier request in progress, just
172 * record the error;
173 */
174 if (error && !q->orderr)
175 q->orderr = error;
176 }
Tejun Heo797e7db2006-01-06 09:51:03 +0100177}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179void blk_dump_rq_flags(struct request *rq, char *msg)
180{
181 int bit;
182
Jens Axboe6728cb02008-01-31 13:03:55 +0100183 printk(KERN_INFO "%s: dev %s: type=%x, flags=%x\n", msg,
Jens Axboe4aff5e22006-08-10 08:44:47 +0200184 rq->rq_disk ? rq->rq_disk->disk_name : "?", rq->cmd_type,
185 rq->cmd_flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700186
Jens Axboe6728cb02008-01-31 13:03:55 +0100187 printk(KERN_INFO " sector %llu, nr/cnr %lu/%u\n",
188 (unsigned long long)rq->sector,
189 rq->nr_sectors,
190 rq->current_nr_sectors);
191 printk(KERN_INFO " bio %p, biotail %p, buffer %p, data %p, len %u\n",
192 rq->bio, rq->biotail,
193 rq->buffer, rq->data,
194 rq->data_len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195
Jens Axboe4aff5e22006-08-10 08:44:47 +0200196 if (blk_pc_request(rq)) {
Jens Axboe6728cb02008-01-31 13:03:55 +0100197 printk(KERN_INFO " cdb: ");
FUJITA Tomonorid34c87e2008-04-29 14:37:52 +0200198 for (bit = 0; bit < BLK_MAX_CDB; bit++)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700199 printk("%02x ", rq->cmd[bit]);
200 printk("\n");
201 }
202}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700203EXPORT_SYMBOL(blk_dump_rq_flags);
204
Linus Torvalds1da177e2005-04-16 15:20:36 -0700205/*
206 * "plug" the device if there are no outstanding requests: this will
207 * force the transfer to start only after we have put all the requests
208 * on the list.
209 *
210 * This is called with interrupts off and no requests on the queue and
211 * with the queue lock held.
212 */
Jens Axboe165125e2007-07-24 09:28:11 +0200213void blk_plug_device(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700214{
215 WARN_ON(!irqs_disabled());
216
217 /*
218 * don't plug a stopped queue, it must be paired with blk_start_queue()
219 * which will restart the queueing
220 */
Coywolf Qi Hunt7daac492006-04-19 10:14:49 +0200221 if (blk_queue_stopped(q))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222 return;
223
Jens Axboee48ec692008-07-03 13:18:54 +0200224 if (!queue_flag_test_and_set(QUEUE_FLAG_PLUGGED, q)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700225 mod_timer(&q->unplug_timer, jiffies + q->unplug_delay);
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +0100226 trace_block_plug(q);
Jens Axboe2056a782006-03-23 20:00:26 +0100227 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700228}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700229EXPORT_SYMBOL(blk_plug_device);
230
Jens Axboe6c5e0c42008-08-01 20:31:32 +0200231/**
232 * blk_plug_device_unlocked - plug a device without queue lock held
233 * @q: The &struct request_queue to plug
234 *
235 * Description:
236 * Like @blk_plug_device(), but grabs the queue lock and disables
237 * interrupts.
238 **/
239void blk_plug_device_unlocked(struct request_queue *q)
240{
241 unsigned long flags;
242
243 spin_lock_irqsave(q->queue_lock, flags);
244 blk_plug_device(q);
245 spin_unlock_irqrestore(q->queue_lock, flags);
246}
247EXPORT_SYMBOL(blk_plug_device_unlocked);
248
Linus Torvalds1da177e2005-04-16 15:20:36 -0700249/*
250 * remove the queue from the plugged list, if present. called with
251 * queue lock held and interrupts disabled.
252 */
Jens Axboe165125e2007-07-24 09:28:11 +0200253int blk_remove_plug(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700254{
255 WARN_ON(!irqs_disabled());
256
Jens Axboee48ec692008-07-03 13:18:54 +0200257 if (!queue_flag_test_and_clear(QUEUE_FLAG_PLUGGED, q))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700258 return 0;
259
260 del_timer(&q->unplug_timer);
261 return 1;
262}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700263EXPORT_SYMBOL(blk_remove_plug);
264
265/*
266 * remove the plug and let it rip..
267 */
Jens Axboe165125e2007-07-24 09:28:11 +0200268void __generic_unplug_device(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700269{
Coywolf Qi Hunt7daac492006-04-19 10:14:49 +0200270 if (unlikely(blk_queue_stopped(q)))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700271 return;
Jens Axboea31a9732008-10-17 13:58:29 +0200272 if (!blk_remove_plug(q) && !blk_queue_nonrot(q))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700273 return;
274
Jens Axboe22e2c502005-06-27 10:55:12 +0200275 q->request_fn(q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700276}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700277
278/**
279 * generic_unplug_device - fire a request queue
Jens Axboe165125e2007-07-24 09:28:11 +0200280 * @q: The &struct request_queue in question
Linus Torvalds1da177e2005-04-16 15:20:36 -0700281 *
282 * Description:
283 * Linux uses plugging to build bigger requests queues before letting
284 * the device have at them. If a queue is plugged, the I/O scheduler
285 * is still adding and merging requests on the queue. Once the queue
286 * gets unplugged, the request_fn defined for the queue is invoked and
287 * transfers started.
288 **/
Jens Axboe165125e2007-07-24 09:28:11 +0200289void generic_unplug_device(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700290{
Jens Axboedbaf2c02008-05-07 09:48:17 +0200291 if (blk_queue_plugged(q)) {
292 spin_lock_irq(q->queue_lock);
293 __generic_unplug_device(q);
294 spin_unlock_irq(q->queue_lock);
295 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700296}
297EXPORT_SYMBOL(generic_unplug_device);
298
299static void blk_backing_dev_unplug(struct backing_dev_info *bdi,
300 struct page *page)
301{
Jens Axboe165125e2007-07-24 09:28:11 +0200302 struct request_queue *q = bdi->unplug_io_data;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700303
Alan D. Brunelle2ad8b1e2007-11-07 14:26:56 -0500304 blk_unplug(q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700305}
306
Jens Axboe86db1e22008-01-29 14:53:40 +0100307void blk_unplug_work(struct work_struct *work)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700308{
Jens Axboe165125e2007-07-24 09:28:11 +0200309 struct request_queue *q =
310 container_of(work, struct request_queue, unplug_work);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700311
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +0100312 trace_block_unplug_io(q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700313 q->unplug_fn(q);
314}
315
Jens Axboe86db1e22008-01-29 14:53:40 +0100316void blk_unplug_timeout(unsigned long data)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700317{
Jens Axboe165125e2007-07-24 09:28:11 +0200318 struct request_queue *q = (struct request_queue *)data;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700319
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +0100320 trace_block_unplug_timer(q);
Jens Axboe18887ad2008-07-28 13:08:45 +0200321 kblockd_schedule_work(q, &q->unplug_work);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700322}
323
Alan D. Brunelle2ad8b1e2007-11-07 14:26:56 -0500324void blk_unplug(struct request_queue *q)
325{
326 /*
327 * devices don't necessarily have an ->unplug_fn defined
328 */
329 if (q->unplug_fn) {
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +0100330 trace_block_unplug_io(q);
Alan D. Brunelle2ad8b1e2007-11-07 14:26:56 -0500331 q->unplug_fn(q);
332 }
333}
334EXPORT_SYMBOL(blk_unplug);
335
Jens Axboec7c22e42008-09-13 20:26:01 +0200336static void blk_invoke_request_fn(struct request_queue *q)
337{
Jens Axboe80a4b582008-10-14 09:51:06 +0200338 if (unlikely(blk_queue_stopped(q)))
339 return;
340
Jens Axboec7c22e42008-09-13 20:26:01 +0200341 /*
342 * one level of recursion is ok and is much faster than kicking
343 * the unplug handling
344 */
345 if (!queue_flag_test_and_set(QUEUE_FLAG_REENTER, q)) {
346 q->request_fn(q);
347 queue_flag_clear(QUEUE_FLAG_REENTER, q);
348 } else {
349 queue_flag_set(QUEUE_FLAG_PLUGGED, q);
350 kblockd_schedule_work(q, &q->unplug_work);
351 }
352}
353
Linus Torvalds1da177e2005-04-16 15:20:36 -0700354/**
355 * blk_start_queue - restart a previously stopped queue
Jens Axboe165125e2007-07-24 09:28:11 +0200356 * @q: The &struct request_queue in question
Linus Torvalds1da177e2005-04-16 15:20:36 -0700357 *
358 * Description:
359 * blk_start_queue() will clear the stop flag on the queue, and call
360 * the request_fn for the queue if it was in a stopped state when
361 * entered. Also see blk_stop_queue(). Queue lock must be held.
362 **/
Jens Axboe165125e2007-07-24 09:28:11 +0200363void blk_start_queue(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700364{
Paolo 'Blaisorblade' Giarrussoa038e252006-06-05 12:09:01 +0200365 WARN_ON(!irqs_disabled());
366
Nick Piggin75ad23b2008-04-29 14:48:33 +0200367 queue_flag_clear(QUEUE_FLAG_STOPPED, q);
Jens Axboec7c22e42008-09-13 20:26:01 +0200368 blk_invoke_request_fn(q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700369}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700370EXPORT_SYMBOL(blk_start_queue);
371
372/**
373 * blk_stop_queue - stop a queue
Jens Axboe165125e2007-07-24 09:28:11 +0200374 * @q: The &struct request_queue in question
Linus Torvalds1da177e2005-04-16 15:20:36 -0700375 *
376 * Description:
377 * The Linux block layer assumes that a block driver will consume all
378 * entries on the request queue when the request_fn strategy is called.
379 * Often this will not happen, because of hardware limitations (queue
380 * depth settings). If a device driver gets a 'queue full' response,
381 * or if it simply chooses not to queue more I/O at one point, it can
382 * call this function to prevent the request_fn from being called until
383 * the driver has signalled it's ready to go again. This happens by calling
384 * blk_start_queue() to restart queue operations. Queue lock must be held.
385 **/
Jens Axboe165125e2007-07-24 09:28:11 +0200386void blk_stop_queue(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700387{
388 blk_remove_plug(q);
Nick Piggin75ad23b2008-04-29 14:48:33 +0200389 queue_flag_set(QUEUE_FLAG_STOPPED, q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390}
391EXPORT_SYMBOL(blk_stop_queue);
392
393/**
394 * blk_sync_queue - cancel any pending callbacks on a queue
395 * @q: the queue
396 *
397 * Description:
398 * The block layer may perform asynchronous callback activity
399 * on a queue, such as calling the unplug function after a timeout.
400 * A block device may call blk_sync_queue to ensure that any
401 * such activity is cancelled, thus allowing it to release resources
Michael Opdenacker59c51592007-05-09 08:57:56 +0200402 * that the callbacks might use. The caller must already have made sure
Linus Torvalds1da177e2005-04-16 15:20:36 -0700403 * that its ->make_request_fn will not re-add plugging prior to calling
404 * this function.
405 *
406 */
407void blk_sync_queue(struct request_queue *q)
408{
409 del_timer_sync(&q->unplug_timer);
Jens Axboe70ed28b2008-11-19 14:38:39 +0100410 del_timer_sync(&q->timeout);
Cheng Renquan64d01dc2008-12-03 12:41:39 +0100411 cancel_work_sync(&q->unplug_work);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700412}
413EXPORT_SYMBOL(blk_sync_queue);
414
415/**
Jens Axboe80a4b582008-10-14 09:51:06 +0200416 * __blk_run_queue - run a single device queue
Linus Torvalds1da177e2005-04-16 15:20:36 -0700417 * @q: The queue to run
Jens Axboe80a4b582008-10-14 09:51:06 +0200418 *
419 * Description:
420 * See @blk_run_queue. This variant must be called with the queue lock
421 * held and interrupts disabled.
422 *
Linus Torvalds1da177e2005-04-16 15:20:36 -0700423 */
Nick Piggin75ad23b2008-04-29 14:48:33 +0200424void __blk_run_queue(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700426 blk_remove_plug(q);
Jens Axboedac07ec2006-05-11 08:20:16 +0200427
428 /*
429 * Only recurse once to avoid overrunning the stack, let the unplug
430 * handling reinvoke the handler shortly if we already got there.
431 */
Jens Axboec7c22e42008-09-13 20:26:01 +0200432 if (!elv_queue_empty(q))
433 blk_invoke_request_fn(q);
Nick Piggin75ad23b2008-04-29 14:48:33 +0200434}
435EXPORT_SYMBOL(__blk_run_queue);
Jens Axboedac07ec2006-05-11 08:20:16 +0200436
Nick Piggin75ad23b2008-04-29 14:48:33 +0200437/**
438 * blk_run_queue - run a single device queue
439 * @q: The queue to run
Jens Axboe80a4b582008-10-14 09:51:06 +0200440 *
441 * Description:
442 * Invoke request handling on this queue, if it has pending work to do.
443 * May be used to restart queueing when a request has completed. Also
444 * See @blk_start_queueing.
445 *
Nick Piggin75ad23b2008-04-29 14:48:33 +0200446 */
447void blk_run_queue(struct request_queue *q)
448{
449 unsigned long flags;
450
451 spin_lock_irqsave(q->queue_lock, flags);
452 __blk_run_queue(q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700453 spin_unlock_irqrestore(q->queue_lock, flags);
454}
455EXPORT_SYMBOL(blk_run_queue);
456
Jens Axboe165125e2007-07-24 09:28:11 +0200457void blk_put_queue(struct request_queue *q)
Al Viro483f4af2006-03-18 18:34:37 -0500458{
459 kobject_put(&q->kobj);
460}
Al Viro483f4af2006-03-18 18:34:37 -0500461
Jens Axboe6728cb02008-01-31 13:03:55 +0100462void blk_cleanup_queue(struct request_queue *q)
Al Viro483f4af2006-03-18 18:34:37 -0500463{
Jens Axboee3335de2008-09-18 09:22:54 -0700464 /*
465 * We know we have process context here, so we can be a little
466 * cautious and ensure that pending block actions on this device
467 * are done before moving on. Going into this function, we should
468 * not have processes doing IO to this device.
469 */
470 blk_sync_queue(q);
471
Al Viro483f4af2006-03-18 18:34:37 -0500472 mutex_lock(&q->sysfs_lock);
Nick Piggin75ad23b2008-04-29 14:48:33 +0200473 queue_flag_set_unlocked(QUEUE_FLAG_DEAD, q);
Al Viro483f4af2006-03-18 18:34:37 -0500474 mutex_unlock(&q->sysfs_lock);
475
476 if (q->elevator)
477 elevator_exit(q->elevator);
478
479 blk_put_queue(q);
480}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700481EXPORT_SYMBOL(blk_cleanup_queue);
482
Jens Axboe165125e2007-07-24 09:28:11 +0200483static int blk_init_free_list(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700484{
485 struct request_list *rl = &q->rq;
486
Jens Axboe1faa16d2009-04-06 14:48:01 +0200487 rl->count[BLK_RW_SYNC] = rl->count[BLK_RW_ASYNC] = 0;
488 rl->starved[BLK_RW_SYNC] = rl->starved[BLK_RW_ASYNC] = 0;
Tejun Heocb98fc82005-10-28 08:29:39 +0200489 rl->elvpriv = 0;
Jens Axboe1faa16d2009-04-06 14:48:01 +0200490 init_waitqueue_head(&rl->wait[BLK_RW_SYNC]);
491 init_waitqueue_head(&rl->wait[BLK_RW_ASYNC]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700492
Christoph Lameter19460892005-06-23 00:08:19 -0700493 rl->rq_pool = mempool_create_node(BLKDEV_MIN_RQ, mempool_alloc_slab,
494 mempool_free_slab, request_cachep, q->node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700495
496 if (!rl->rq_pool)
497 return -ENOMEM;
498
499 return 0;
500}
501
Jens Axboe165125e2007-07-24 09:28:11 +0200502struct request_queue *blk_alloc_queue(gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700503{
Christoph Lameter19460892005-06-23 00:08:19 -0700504 return blk_alloc_queue_node(gfp_mask, -1);
505}
506EXPORT_SYMBOL(blk_alloc_queue);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700507
Jens Axboe165125e2007-07-24 09:28:11 +0200508struct request_queue *blk_alloc_queue_node(gfp_t gfp_mask, int node_id)
Christoph Lameter19460892005-06-23 00:08:19 -0700509{
Jens Axboe165125e2007-07-24 09:28:11 +0200510 struct request_queue *q;
Peter Zijlstrae0bf68d2007-10-16 23:25:46 -0700511 int err;
Christoph Lameter19460892005-06-23 00:08:19 -0700512
Jens Axboe8324aa92008-01-29 14:51:59 +0100513 q = kmem_cache_alloc_node(blk_requestq_cachep,
Christoph Lameter94f60302007-07-17 04:03:29 -0700514 gfp_mask | __GFP_ZERO, node_id);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700515 if (!q)
516 return NULL;
517
Peter Zijlstrae0bf68d2007-10-16 23:25:46 -0700518 q->backing_dev_info.unplug_io_fn = blk_backing_dev_unplug;
519 q->backing_dev_info.unplug_io_data = q;
520 err = bdi_init(&q->backing_dev_info);
521 if (err) {
Jens Axboe8324aa92008-01-29 14:51:59 +0100522 kmem_cache_free(blk_requestq_cachep, q);
Peter Zijlstrae0bf68d2007-10-16 23:25:46 -0700523 return NULL;
524 }
525
Linus Torvalds1da177e2005-04-16 15:20:36 -0700526 init_timer(&q->unplug_timer);
Jens Axboe242f9dc2008-09-14 05:55:09 -0700527 setup_timer(&q->timeout, blk_rq_timed_out_timer, (unsigned long) q);
528 INIT_LIST_HEAD(&q->timeout_list);
Peter Zijlstra713ada92008-10-16 13:44:57 +0200529 INIT_WORK(&q->unplug_work, blk_unplug_work);
Al Viro483f4af2006-03-18 18:34:37 -0500530
Jens Axboe8324aa92008-01-29 14:51:59 +0100531 kobject_init(&q->kobj, &blk_queue_ktype);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700532
Al Viro483f4af2006-03-18 18:34:37 -0500533 mutex_init(&q->sysfs_lock);
Neil Browne7e72bf2008-05-14 16:05:54 -0700534 spin_lock_init(&q->__queue_lock);
Al Viro483f4af2006-03-18 18:34:37 -0500535
Linus Torvalds1da177e2005-04-16 15:20:36 -0700536 return q;
537}
Christoph Lameter19460892005-06-23 00:08:19 -0700538EXPORT_SYMBOL(blk_alloc_queue_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700539
540/**
541 * blk_init_queue - prepare a request queue for use with a block device
542 * @rfn: The function to be called to process requests that have been
543 * placed on the queue.
544 * @lock: Request queue spin lock
545 *
546 * Description:
547 * If a block device wishes to use the standard request handling procedures,
548 * which sorts requests and coalesces adjacent requests, then it must
549 * call blk_init_queue(). The function @rfn will be called when there
550 * are requests on the queue that need to be processed. If the device
551 * supports plugging, then @rfn may not be called immediately when requests
552 * are available on the queue, but may be called at some time later instead.
553 * Plugged queues are generally unplugged when a buffer belonging to one
554 * of the requests on the queue is needed, or due to memory pressure.
555 *
556 * @rfn is not required, or even expected, to remove all requests off the
557 * queue, but only as many as it can handle at a time. If it does leave
558 * requests on the queue, it is responsible for arranging that the requests
559 * get dealt with eventually.
560 *
561 * The queue spin lock must be held while manipulating the requests on the
Paolo 'Blaisorblade' Giarrussoa038e252006-06-05 12:09:01 +0200562 * request queue; this lock will be taken also from interrupt context, so irq
563 * disabling is needed for it.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700564 *
Randy Dunlap710027a2008-08-19 20:13:11 +0200565 * Function returns a pointer to the initialized request queue, or %NULL if
Linus Torvalds1da177e2005-04-16 15:20:36 -0700566 * it didn't succeed.
567 *
568 * Note:
569 * blk_init_queue() must be paired with a blk_cleanup_queue() call
570 * when the block device is deactivated (such as at module unload).
571 **/
Christoph Lameter19460892005-06-23 00:08:19 -0700572
Jens Axboe165125e2007-07-24 09:28:11 +0200573struct request_queue *blk_init_queue(request_fn_proc *rfn, spinlock_t *lock)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700574{
Christoph Lameter19460892005-06-23 00:08:19 -0700575 return blk_init_queue_node(rfn, lock, -1);
576}
577EXPORT_SYMBOL(blk_init_queue);
578
Jens Axboe165125e2007-07-24 09:28:11 +0200579struct request_queue *
Christoph Lameter19460892005-06-23 00:08:19 -0700580blk_init_queue_node(request_fn_proc *rfn, spinlock_t *lock, int node_id)
581{
Jens Axboe165125e2007-07-24 09:28:11 +0200582 struct request_queue *q = blk_alloc_queue_node(GFP_KERNEL, node_id);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700583
584 if (!q)
585 return NULL;
586
Christoph Lameter19460892005-06-23 00:08:19 -0700587 q->node = node_id;
Al Viro8669aaf2006-03-18 13:50:00 -0500588 if (blk_init_free_list(q)) {
Jens Axboe8324aa92008-01-29 14:51:59 +0100589 kmem_cache_free(blk_requestq_cachep, q);
Al Viro8669aaf2006-03-18 13:50:00 -0500590 return NULL;
591 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700592
152587d2005-04-12 16:22:06 -0500593 /*
594 * if caller didn't supply a lock, they get per-queue locking with
595 * our embedded lock
596 */
Neil Browne7e72bf2008-05-14 16:05:54 -0700597 if (!lock)
152587d2005-04-12 16:22:06 -0500598 lock = &q->__queue_lock;
152587d2005-04-12 16:22:06 -0500599
Linus Torvalds1da177e2005-04-16 15:20:36 -0700600 q->request_fn = rfn;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700601 q->prep_rq_fn = NULL;
602 q->unplug_fn = generic_unplug_device;
Jens Axboebc58ba92009-01-23 10:54:44 +0100603 q->queue_flags = QUEUE_FLAG_DEFAULT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700604 q->queue_lock = lock;
605
Jens Axboef3b144a2009-03-06 08:48:33 +0100606 /*
607 * This also sets hw/phys segments, boundary and size
608 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700609 blk_queue_make_request(q, __make_request);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700610
Alan Stern44ec9542007-02-20 11:01:57 -0500611 q->sg_reserved_size = INT_MAX;
612
FUJITA Tomonoriabf54392008-08-16 14:10:05 +0900613 blk_set_cmd_filter_defaults(&q->cmd_filter);
614
Linus Torvalds1da177e2005-04-16 15:20:36 -0700615 /*
616 * all done
617 */
618 if (!elevator_init(q, NULL)) {
619 blk_queue_congestion_threshold(q);
620 return q;
621 }
622
Al Viro8669aaf2006-03-18 13:50:00 -0500623 blk_put_queue(q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700624 return NULL;
625}
Christoph Lameter19460892005-06-23 00:08:19 -0700626EXPORT_SYMBOL(blk_init_queue_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700627
Jens Axboe165125e2007-07-24 09:28:11 +0200628int blk_get_queue(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700629{
Nick Pigginfde6ad22005-06-23 00:08:53 -0700630 if (likely(!test_bit(QUEUE_FLAG_DEAD, &q->queue_flags))) {
Al Viro483f4af2006-03-18 18:34:37 -0500631 kobject_get(&q->kobj);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700632 return 0;
633 }
634
635 return 1;
636}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700637
Jens Axboe165125e2007-07-24 09:28:11 +0200638static inline void blk_free_request(struct request_queue *q, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700639{
Jens Axboe4aff5e22006-08-10 08:44:47 +0200640 if (rq->cmd_flags & REQ_ELVPRIV)
Tejun Heocb98fc82005-10-28 08:29:39 +0200641 elv_put_request(q, rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700642 mempool_free(rq, q->rq.rq_pool);
643}
644
Jens Axboe1ea25ec2006-07-18 22:24:11 +0200645static struct request *
Jens Axboe165125e2007-07-24 09:28:11 +0200646blk_alloc_request(struct request_queue *q, int rw, int priv, gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700647{
648 struct request *rq = mempool_alloc(q->rq.rq_pool, gfp_mask);
649
650 if (!rq)
651 return NULL;
652
FUJITA Tomonori2a4aa302008-04-29 09:54:36 +0200653 blk_rq_init(q, rq);
FUJITA Tomonori1afb20f2008-04-25 12:26:28 +0200654
Jens Axboe49171e52006-08-10 08:59:11 +0200655 rq->cmd_flags = rw | REQ_ALLOCED;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700656
Tejun Heocb98fc82005-10-28 08:29:39 +0200657 if (priv) {
Jens Axboecb78b282006-07-28 09:32:57 +0200658 if (unlikely(elv_set_request(q, rq, gfp_mask))) {
Tejun Heocb98fc82005-10-28 08:29:39 +0200659 mempool_free(rq, q->rq.rq_pool);
660 return NULL;
661 }
Jens Axboe4aff5e22006-08-10 08:44:47 +0200662 rq->cmd_flags |= REQ_ELVPRIV;
Tejun Heocb98fc82005-10-28 08:29:39 +0200663 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700664
Tejun Heocb98fc82005-10-28 08:29:39 +0200665 return rq;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700666}
667
668/*
669 * ioc_batching returns true if the ioc is a valid batching request and
670 * should be given priority access to a request.
671 */
Jens Axboe165125e2007-07-24 09:28:11 +0200672static inline int ioc_batching(struct request_queue *q, struct io_context *ioc)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700673{
674 if (!ioc)
675 return 0;
676
677 /*
678 * Make sure the process is able to allocate at least 1 request
679 * even if the batch times out, otherwise we could theoretically
680 * lose wakeups.
681 */
682 return ioc->nr_batch_requests == q->nr_batching ||
683 (ioc->nr_batch_requests > 0
684 && time_before(jiffies, ioc->last_waited + BLK_BATCH_TIME));
685}
686
687/*
688 * ioc_set_batching sets ioc to be a new "batcher" if it is not one. This
689 * will cause the process to be a "batcher" on all queues in the system. This
690 * is the behaviour we want though - once it gets a wakeup it should be given
691 * a nice run.
692 */
Jens Axboe165125e2007-07-24 09:28:11 +0200693static void ioc_set_batching(struct request_queue *q, struct io_context *ioc)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700694{
695 if (!ioc || ioc_batching(q, ioc))
696 return;
697
698 ioc->nr_batch_requests = q->nr_batching;
699 ioc->last_waited = jiffies;
700}
701
Jens Axboe1faa16d2009-04-06 14:48:01 +0200702static void __freed_request(struct request_queue *q, int sync)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700703{
704 struct request_list *rl = &q->rq;
705
Jens Axboe1faa16d2009-04-06 14:48:01 +0200706 if (rl->count[sync] < queue_congestion_off_threshold(q))
707 blk_clear_queue_congested(q, sync);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700708
Jens Axboe1faa16d2009-04-06 14:48:01 +0200709 if (rl->count[sync] + 1 <= q->nr_requests) {
710 if (waitqueue_active(&rl->wait[sync]))
711 wake_up(&rl->wait[sync]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700712
Jens Axboe1faa16d2009-04-06 14:48:01 +0200713 blk_clear_queue_full(q, sync);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700714 }
715}
716
717/*
718 * A request has just been released. Account for it, update the full and
719 * congestion status, wake up any waiters. Called under q->queue_lock.
720 */
Jens Axboe1faa16d2009-04-06 14:48:01 +0200721static void freed_request(struct request_queue *q, int sync, int priv)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700722{
723 struct request_list *rl = &q->rq;
724
Jens Axboe1faa16d2009-04-06 14:48:01 +0200725 rl->count[sync]--;
Tejun Heocb98fc82005-10-28 08:29:39 +0200726 if (priv)
727 rl->elvpriv--;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700728
Jens Axboe1faa16d2009-04-06 14:48:01 +0200729 __freed_request(q, sync);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700730
Jens Axboe1faa16d2009-04-06 14:48:01 +0200731 if (unlikely(rl->starved[sync ^ 1]))
732 __freed_request(q, sync ^ 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700733}
734
Linus Torvalds1da177e2005-04-16 15:20:36 -0700735/*
Nick Piggind6344532005-06-28 20:45:14 -0700736 * Get a free request, queue_lock must be held.
737 * Returns NULL on failure, with queue_lock held.
738 * Returns !NULL on success, with queue_lock *not held*.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700739 */
Jens Axboe165125e2007-07-24 09:28:11 +0200740static struct request *get_request(struct request_queue *q, int rw_flags,
Jens Axboe7749a8d2006-12-13 13:02:26 +0100741 struct bio *bio, gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700742{
743 struct request *rq = NULL;
744 struct request_list *rl = &q->rq;
Jens Axboe88ee5ef2005-11-12 11:09:12 +0100745 struct io_context *ioc = NULL;
Jens Axboe1faa16d2009-04-06 14:48:01 +0200746 const bool is_sync = rw_is_sync(rw_flags) != 0;
Jens Axboe88ee5ef2005-11-12 11:09:12 +0100747 int may_queue, priv;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700748
Jens Axboe7749a8d2006-12-13 13:02:26 +0100749 may_queue = elv_may_queue(q, rw_flags);
Jens Axboe88ee5ef2005-11-12 11:09:12 +0100750 if (may_queue == ELV_MQUEUE_NO)
751 goto rq_starved;
752
Jens Axboe1faa16d2009-04-06 14:48:01 +0200753 if (rl->count[is_sync]+1 >= queue_congestion_on_threshold(q)) {
754 if (rl->count[is_sync]+1 >= q->nr_requests) {
Jens Axboeb5deef92006-07-19 23:39:40 +0200755 ioc = current_io_context(GFP_ATOMIC, q->node);
Jens Axboe88ee5ef2005-11-12 11:09:12 +0100756 /*
757 * The queue will fill after this allocation, so set
758 * it as full, and mark this process as "batching".
759 * This process will be allowed to complete a batch of
760 * requests, others will be blocked.
761 */
Jens Axboe1faa16d2009-04-06 14:48:01 +0200762 if (!blk_queue_full(q, is_sync)) {
Jens Axboe88ee5ef2005-11-12 11:09:12 +0100763 ioc_set_batching(q, ioc);
Jens Axboe1faa16d2009-04-06 14:48:01 +0200764 blk_set_queue_full(q, is_sync);
Jens Axboe88ee5ef2005-11-12 11:09:12 +0100765 } else {
766 if (may_queue != ELV_MQUEUE_MUST
767 && !ioc_batching(q, ioc)) {
768 /*
769 * The queue is full and the allocating
770 * process is not a "batcher", and not
771 * exempted by the IO scheduler
772 */
773 goto out;
774 }
775 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700776 }
Jens Axboe1faa16d2009-04-06 14:48:01 +0200777 blk_set_queue_congested(q, is_sync);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700778 }
779
Jens Axboe082cf692005-06-28 16:35:11 +0200780 /*
781 * Only allow batching queuers to allocate up to 50% over the defined
782 * limit of requests, otherwise we could have thousands of requests
783 * allocated with any setting of ->nr_requests
784 */
Jens Axboe1faa16d2009-04-06 14:48:01 +0200785 if (rl->count[is_sync] >= (3 * q->nr_requests / 2))
Jens Axboe082cf692005-06-28 16:35:11 +0200786 goto out;
Hugh Dickinsfd782a42005-06-29 15:15:40 +0100787
Jens Axboe1faa16d2009-04-06 14:48:01 +0200788 rl->count[is_sync]++;
789 rl->starved[is_sync] = 0;
Tejun Heocb98fc82005-10-28 08:29:39 +0200790
Jens Axboe64521d12005-10-28 08:30:39 +0200791 priv = !test_bit(QUEUE_FLAG_ELVSWITCH, &q->queue_flags);
Tejun Heocb98fc82005-10-28 08:29:39 +0200792 if (priv)
793 rl->elvpriv++;
794
Linus Torvalds1da177e2005-04-16 15:20:36 -0700795 spin_unlock_irq(q->queue_lock);
796
Jens Axboe7749a8d2006-12-13 13:02:26 +0100797 rq = blk_alloc_request(q, rw_flags, priv, gfp_mask);
Jens Axboe88ee5ef2005-11-12 11:09:12 +0100798 if (unlikely(!rq)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700799 /*
800 * Allocation failed presumably due to memory. Undo anything
801 * we might have messed up.
802 *
803 * Allocating task should really be put onto the front of the
804 * wait queue, but this is pretty rare.
805 */
806 spin_lock_irq(q->queue_lock);
Jens Axboe1faa16d2009-04-06 14:48:01 +0200807 freed_request(q, is_sync, priv);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700808
809 /*
810 * in the very unlikely event that allocation failed and no
811 * requests for this direction was pending, mark us starved
812 * so that freeing of a request in the other direction will
813 * notice us. another possible fix would be to split the
814 * rq mempool into READ and WRITE
815 */
816rq_starved:
Jens Axboe1faa16d2009-04-06 14:48:01 +0200817 if (unlikely(rl->count[is_sync] == 0))
818 rl->starved[is_sync] = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700819
Linus Torvalds1da177e2005-04-16 15:20:36 -0700820 goto out;
821 }
822
Jens Axboe88ee5ef2005-11-12 11:09:12 +0100823 /*
824 * ioc may be NULL here, and ioc_batching will be false. That's
825 * OK, if the queue is under the request limit then requests need
826 * not count toward the nr_batch_requests limit. There will always
827 * be some limit enforced by BLK_BATCH_TIME.
828 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700829 if (ioc_batching(q, ioc))
830 ioc->nr_batch_requests--;
Jens Axboe6728cb02008-01-31 13:03:55 +0100831
Jens Axboe1faa16d2009-04-06 14:48:01 +0200832 trace_block_getrq(q, bio, rw_flags & 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700833out:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700834 return rq;
835}
836
837/*
838 * No available requests for this queue, unplug the device and wait for some
839 * requests to become available.
Nick Piggind6344532005-06-28 20:45:14 -0700840 *
841 * Called with q->queue_lock held, and returns with it unlocked.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700842 */
Jens Axboe165125e2007-07-24 09:28:11 +0200843static struct request *get_request_wait(struct request_queue *q, int rw_flags,
Jens Axboe22e2c502005-06-27 10:55:12 +0200844 struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700845{
Jens Axboe1faa16d2009-04-06 14:48:01 +0200846 const bool is_sync = rw_is_sync(rw_flags) != 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700847 struct request *rq;
848
Jens Axboe7749a8d2006-12-13 13:02:26 +0100849 rq = get_request(q, rw_flags, bio, GFP_NOIO);
Nick Piggin450991b2005-06-28 20:45:13 -0700850 while (!rq) {
851 DEFINE_WAIT(wait);
Zhang, Yanmin05caf8d2008-05-22 15:13:29 +0200852 struct io_context *ioc;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700853 struct request_list *rl = &q->rq;
854
Jens Axboe1faa16d2009-04-06 14:48:01 +0200855 prepare_to_wait_exclusive(&rl->wait[is_sync], &wait,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700856 TASK_UNINTERRUPTIBLE);
857
Jens Axboe1faa16d2009-04-06 14:48:01 +0200858 trace_block_sleeprq(q, bio, rw_flags & 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700859
Zhang, Yanmin05caf8d2008-05-22 15:13:29 +0200860 __generic_unplug_device(q);
861 spin_unlock_irq(q->queue_lock);
862 io_schedule();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700863
Zhang, Yanmin05caf8d2008-05-22 15:13:29 +0200864 /*
865 * After sleeping, we become a "batching" process and
866 * will be able to allocate at least one request, and
867 * up to a big batch of them for a small period time.
868 * See ioc_batching, ioc_set_batching
869 */
870 ioc = current_io_context(GFP_NOIO, q->node);
871 ioc_set_batching(q, ioc);
Jens Axboe2056a782006-03-23 20:00:26 +0100872
Zhang, Yanmin05caf8d2008-05-22 15:13:29 +0200873 spin_lock_irq(q->queue_lock);
Jens Axboe1faa16d2009-04-06 14:48:01 +0200874 finish_wait(&rl->wait[is_sync], &wait);
Zhang, Yanmin05caf8d2008-05-22 15:13:29 +0200875
876 rq = get_request(q, rw_flags, bio, GFP_NOIO);
877 };
Linus Torvalds1da177e2005-04-16 15:20:36 -0700878
879 return rq;
880}
881
Jens Axboe165125e2007-07-24 09:28:11 +0200882struct request *blk_get_request(struct request_queue *q, int rw, gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700883{
884 struct request *rq;
885
886 BUG_ON(rw != READ && rw != WRITE);
887
Nick Piggind6344532005-06-28 20:45:14 -0700888 spin_lock_irq(q->queue_lock);
889 if (gfp_mask & __GFP_WAIT) {
Jens Axboe22e2c502005-06-27 10:55:12 +0200890 rq = get_request_wait(q, rw, NULL);
Nick Piggind6344532005-06-28 20:45:14 -0700891 } else {
Jens Axboe22e2c502005-06-27 10:55:12 +0200892 rq = get_request(q, rw, NULL, gfp_mask);
Nick Piggind6344532005-06-28 20:45:14 -0700893 if (!rq)
894 spin_unlock_irq(q->queue_lock);
895 }
896 /* q->queue_lock is unlocked at this point */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700897
898 return rq;
899}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700900EXPORT_SYMBOL(blk_get_request);
901
902/**
Jens Axboedc72ef42006-07-20 14:54:05 +0200903 * blk_start_queueing - initiate dispatch of requests to device
904 * @q: request queue to kick into gear
905 *
906 * This is basically a helper to remove the need to know whether a queue
907 * is plugged or not if someone just wants to initiate dispatch of requests
Jens Axboe80a4b582008-10-14 09:51:06 +0200908 * for this queue. Should be used to start queueing on a device outside
909 * of ->request_fn() context. Also see @blk_run_queue.
Jens Axboedc72ef42006-07-20 14:54:05 +0200910 *
911 * The queue lock must be held with interrupts disabled.
912 */
Jens Axboe165125e2007-07-24 09:28:11 +0200913void blk_start_queueing(struct request_queue *q)
Jens Axboedc72ef42006-07-20 14:54:05 +0200914{
Elias Oltmanns336c3d82008-10-01 16:02:33 +0200915 if (!blk_queue_plugged(q)) {
916 if (unlikely(blk_queue_stopped(q)))
917 return;
Jens Axboedc72ef42006-07-20 14:54:05 +0200918 q->request_fn(q);
Elias Oltmanns336c3d82008-10-01 16:02:33 +0200919 } else
Jens Axboedc72ef42006-07-20 14:54:05 +0200920 __generic_unplug_device(q);
921}
922EXPORT_SYMBOL(blk_start_queueing);
923
924/**
Linus Torvalds1da177e2005-04-16 15:20:36 -0700925 * blk_requeue_request - put a request back on queue
926 * @q: request queue where request should be inserted
927 * @rq: request to be inserted
928 *
929 * Description:
930 * Drivers often keep queueing requests until the hardware cannot accept
931 * more, when that condition happens we need to put the request back
932 * on the queue. Must be called with queue lock held.
933 */
Jens Axboe165125e2007-07-24 09:28:11 +0200934void blk_requeue_request(struct request_queue *q, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700935{
Jens Axboe242f9dc2008-09-14 05:55:09 -0700936 blk_delete_timer(rq);
937 blk_clear_rq_complete(rq);
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +0100938 trace_block_rq_requeue(q, rq);
Jens Axboe2056a782006-03-23 20:00:26 +0100939
Linus Torvalds1da177e2005-04-16 15:20:36 -0700940 if (blk_rq_tagged(rq))
941 blk_queue_end_tag(q, rq);
942
943 elv_requeue_request(q, rq);
944}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700945EXPORT_SYMBOL(blk_requeue_request);
946
947/**
Randy Dunlap710027a2008-08-19 20:13:11 +0200948 * blk_insert_request - insert a special request into a request queue
Linus Torvalds1da177e2005-04-16 15:20:36 -0700949 * @q: request queue where request should be inserted
950 * @rq: request to be inserted
951 * @at_head: insert request at head or tail of queue
952 * @data: private data
Linus Torvalds1da177e2005-04-16 15:20:36 -0700953 *
954 * Description:
955 * Many block devices need to execute commands asynchronously, so they don't
956 * block the whole kernel from preemption during request execution. This is
957 * accomplished normally by inserting aritficial requests tagged as
Randy Dunlap710027a2008-08-19 20:13:11 +0200958 * REQ_TYPE_SPECIAL in to the corresponding request queue, and letting them
959 * be scheduled for actual execution by the request queue.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700960 *
961 * We have the option of inserting the head or the tail of the queue.
962 * Typically we use the tail for new ioctls and so forth. We use the head
963 * of the queue for things like a QUEUE_FULL message from a device, or a
964 * host that is unable to accept a particular command.
965 */
Jens Axboe165125e2007-07-24 09:28:11 +0200966void blk_insert_request(struct request_queue *q, struct request *rq,
Tejun Heo 867d1192005-04-24 02:06:05 -0500967 int at_head, void *data)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700968{
Tejun Heo 867d1192005-04-24 02:06:05 -0500969 int where = at_head ? ELEVATOR_INSERT_FRONT : ELEVATOR_INSERT_BACK;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700970 unsigned long flags;
971
972 /*
973 * tell I/O scheduler that this isn't a regular read/write (ie it
974 * must not attempt merges on this) and that it acts as a soft
975 * barrier
976 */
Jens Axboe4aff5e22006-08-10 08:44:47 +0200977 rq->cmd_type = REQ_TYPE_SPECIAL;
978 rq->cmd_flags |= REQ_SOFTBARRIER;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700979
980 rq->special = data;
981
982 spin_lock_irqsave(q->queue_lock, flags);
983
984 /*
985 * If command is tagged, release the tag
986 */
Tejun Heo 867d1192005-04-24 02:06:05 -0500987 if (blk_rq_tagged(rq))
988 blk_queue_end_tag(q, rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700989
Jerome Marchandb238b3d2007-10-23 15:05:46 +0200990 drive_stat_acct(rq, 1);
Tejun Heo 867d1192005-04-24 02:06:05 -0500991 __elv_add_request(q, rq, where, 0);
Jens Axboedc72ef42006-07-20 14:54:05 +0200992 blk_start_queueing(q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700993 spin_unlock_irqrestore(q->queue_lock, flags);
994}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700995EXPORT_SYMBOL(blk_insert_request);
996
Linus Torvalds1da177e2005-04-16 15:20:36 -0700997/*
998 * add-request adds a request to the linked list.
999 * queue lock is held and interrupts disabled, as we muck with the
1000 * request queue list.
1001 */
Jens Axboe6728cb02008-01-31 13:03:55 +01001002static inline void add_request(struct request_queue *q, struct request *req)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001003{
Jerome Marchandb238b3d2007-10-23 15:05:46 +02001004 drive_stat_acct(req, 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001005
Linus Torvalds1da177e2005-04-16 15:20:36 -07001006 /*
1007 * elevator indicated where it wants this request to be
1008 * inserted at elevator_merge time
1009 */
1010 __elv_add_request(q, req, ELEVATOR_INSERT_SORT, 0);
1011}
Jens Axboe6728cb02008-01-31 13:03:55 +01001012
Tejun Heo074a7ac2008-08-25 19:56:14 +09001013static void part_round_stats_single(int cpu, struct hd_struct *part,
1014 unsigned long now)
1015{
1016 if (now == part->stamp)
1017 return;
1018
1019 if (part->in_flight) {
1020 __part_stat_add(cpu, part, time_in_queue,
1021 part->in_flight * (now - part->stamp));
1022 __part_stat_add(cpu, part, io_ticks, (now - part->stamp));
1023 }
1024 part->stamp = now;
1025}
1026
1027/**
Randy Dunlap496aa8a2008-10-16 07:46:23 +02001028 * part_round_stats() - Round off the performance stats on a struct disk_stats.
1029 * @cpu: cpu number for stats access
1030 * @part: target partition
Linus Torvalds1da177e2005-04-16 15:20:36 -07001031 *
1032 * The average IO queue length and utilisation statistics are maintained
1033 * by observing the current state of the queue length and the amount of
1034 * time it has been in this state for.
1035 *
1036 * Normally, that accounting is done on IO completion, but that can result
1037 * in more than a second's worth of IO being accounted for within any one
1038 * second, leading to >100% utilisation. To deal with that, we call this
1039 * function to do a round-off before returning the results when reading
1040 * /proc/diskstats. This accounts immediately for all queue usage up to
1041 * the current jiffies and restarts the counters again.
1042 */
Tejun Heoc9959052008-08-25 19:47:21 +09001043void part_round_stats(int cpu, struct hd_struct *part)
Jerome Marchand6f2576a2008-02-08 11:04:35 +01001044{
1045 unsigned long now = jiffies;
1046
Tejun Heo074a7ac2008-08-25 19:56:14 +09001047 if (part->partno)
1048 part_round_stats_single(cpu, &part_to_disk(part)->part0, now);
1049 part_round_stats_single(cpu, part, now);
Jerome Marchand6f2576a2008-02-08 11:04:35 +01001050}
Tejun Heo074a7ac2008-08-25 19:56:14 +09001051EXPORT_SYMBOL_GPL(part_round_stats);
Jerome Marchand6f2576a2008-02-08 11:04:35 +01001052
Linus Torvalds1da177e2005-04-16 15:20:36 -07001053/*
1054 * queue lock must be held
1055 */
Jens Axboe165125e2007-07-24 09:28:11 +02001056void __blk_put_request(struct request_queue *q, struct request *req)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001057{
Linus Torvalds1da177e2005-04-16 15:20:36 -07001058 if (unlikely(!q))
1059 return;
1060 if (unlikely(--req->ref_count))
1061 return;
1062
Tejun Heo8922e162005-10-20 16:23:44 +02001063 elv_completed_request(q, req);
1064
Boaz Harrosh1cd96c22009-03-24 12:35:07 +01001065 /* this is a bio leak */
1066 WARN_ON(req->bio != NULL);
1067
Linus Torvalds1da177e2005-04-16 15:20:36 -07001068 /*
1069 * Request may not have originated from ll_rw_blk. if not,
1070 * it didn't come out of our reserved rq pools
1071 */
Jens Axboe49171e52006-08-10 08:59:11 +02001072 if (req->cmd_flags & REQ_ALLOCED) {
Jens Axboe1faa16d2009-04-06 14:48:01 +02001073 int is_sync = rq_is_sync(req) != 0;
Jens Axboe4aff5e22006-08-10 08:44:47 +02001074 int priv = req->cmd_flags & REQ_ELVPRIV;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001075
Linus Torvalds1da177e2005-04-16 15:20:36 -07001076 BUG_ON(!list_empty(&req->queuelist));
Jens Axboe98170642006-07-28 09:23:08 +02001077 BUG_ON(!hlist_unhashed(&req->hash));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001078
1079 blk_free_request(q, req);
Jens Axboe1faa16d2009-04-06 14:48:01 +02001080 freed_request(q, is_sync, priv);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001081 }
1082}
Mike Christie6e39b692005-11-11 05:30:24 -06001083EXPORT_SYMBOL_GPL(__blk_put_request);
1084
Linus Torvalds1da177e2005-04-16 15:20:36 -07001085void blk_put_request(struct request *req)
1086{
Tejun Heo8922e162005-10-20 16:23:44 +02001087 unsigned long flags;
Jens Axboe165125e2007-07-24 09:28:11 +02001088 struct request_queue *q = req->q;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001089
FUJITA Tomonori52a93ba2008-07-15 21:21:45 +02001090 spin_lock_irqsave(q->queue_lock, flags);
1091 __blk_put_request(q, req);
1092 spin_unlock_irqrestore(q->queue_lock, flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001093}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001094EXPORT_SYMBOL(blk_put_request);
1095
Jens Axboe86db1e22008-01-29 14:53:40 +01001096void init_request_from_bio(struct request *req, struct bio *bio)
Tejun Heo52d9e672006-01-06 09:49:58 +01001097{
Jens Axboec7c22e42008-09-13 20:26:01 +02001098 req->cpu = bio->bi_comp_cpu;
Jens Axboe4aff5e22006-08-10 08:44:47 +02001099 req->cmd_type = REQ_TYPE_FS;
Tejun Heo52d9e672006-01-06 09:49:58 +01001100
1101 /*
1102 * inherit FAILFAST from bio (for read-ahead, and explicit FAILFAST)
1103 */
Mike Christie6000a362008-08-19 18:45:30 -05001104 if (bio_rw_ahead(bio))
1105 req->cmd_flags |= (REQ_FAILFAST_DEV | REQ_FAILFAST_TRANSPORT |
1106 REQ_FAILFAST_DRIVER);
1107 if (bio_failfast_dev(bio))
1108 req->cmd_flags |= REQ_FAILFAST_DEV;
1109 if (bio_failfast_transport(bio))
1110 req->cmd_flags |= REQ_FAILFAST_TRANSPORT;
1111 if (bio_failfast_driver(bio))
1112 req->cmd_flags |= REQ_FAILFAST_DRIVER;
Tejun Heo52d9e672006-01-06 09:49:58 +01001113
1114 /*
1115 * REQ_BARRIER implies no merging, but lets make it explicit
1116 */
David Woodhousefb2dce82008-08-05 18:01:53 +01001117 if (unlikely(bio_discard(bio))) {
David Woodhousee17fc0a2008-08-09 16:42:20 +01001118 req->cmd_flags |= REQ_DISCARD;
1119 if (bio_barrier(bio))
1120 req->cmd_flags |= REQ_SOFTBARRIER;
David Woodhousefb2dce82008-08-05 18:01:53 +01001121 req->q->prepare_discard_fn(req->q, req);
David Woodhousee17fc0a2008-08-09 16:42:20 +01001122 } else if (unlikely(bio_barrier(bio)))
1123 req->cmd_flags |= (REQ_HARDBARRIER | REQ_NOMERGE);
Tejun Heo52d9e672006-01-06 09:49:58 +01001124
Jens Axboeb31dc662006-06-13 08:26:10 +02001125 if (bio_sync(bio))
Jens Axboe4aff5e22006-08-10 08:44:47 +02001126 req->cmd_flags |= REQ_RW_SYNC;
Jens Axboe5404bc72006-08-10 09:01:02 +02001127 if (bio_rw_meta(bio))
1128 req->cmd_flags |= REQ_RW_META;
Jens Axboeaeb6faf2009-04-06 14:48:07 +02001129 if (bio_noidle(bio))
1130 req->cmd_flags |= REQ_NOIDLE;
Jens Axboeb31dc662006-06-13 08:26:10 +02001131
Tejun Heo52d9e672006-01-06 09:49:58 +01001132 req->errors = 0;
1133 req->hard_sector = req->sector = bio->bi_sector;
Tejun Heo52d9e672006-01-06 09:49:58 +01001134 req->ioprio = bio_prio(bio);
Tejun Heo52d9e672006-01-06 09:49:58 +01001135 req->start_time = jiffies;
NeilBrownbc1c56f2007-08-16 13:31:30 +02001136 blk_rq_bio_prep(req->q, req, bio);
Tejun Heo52d9e672006-01-06 09:49:58 +01001137}
1138
Jens Axboe644b2d92009-04-06 14:48:06 +02001139/*
1140 * Only disabling plugging for non-rotational devices if it does tagging
1141 * as well, otherwise we do need the proper merging
1142 */
1143static inline bool queue_should_plug(struct request_queue *q)
1144{
1145 return !(blk_queue_nonrot(q) && blk_queue_tagged(q));
1146}
1147
Jens Axboe165125e2007-07-24 09:28:11 +02001148static int __make_request(struct request_queue *q, struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001149{
Nick Piggin450991b2005-06-28 20:45:13 -07001150 struct request *req;
Tejun Heoa7384672008-11-28 13:32:03 +09001151 int el_ret, nr_sectors;
Jens Axboe51da90f2006-07-18 04:14:45 +02001152 const unsigned short prio = bio_prio(bio);
1153 const int sync = bio_sync(bio);
Jens Axboe213d9412009-01-06 09:16:05 +01001154 const int unplug = bio_unplug(bio);
Jens Axboe7749a8d2006-12-13 13:02:26 +01001155 int rw_flags;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001156
Linus Torvalds1da177e2005-04-16 15:20:36 -07001157 nr_sectors = bio_sectors(bio);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001158
1159 /*
1160 * low level driver can indicate that it wants pages above a
1161 * certain limit bounced to low memory (ie for highmem, or even
1162 * ISA dma in theory)
1163 */
1164 blk_queue_bounce(q, &bio);
1165
Linus Torvalds1da177e2005-04-16 15:20:36 -07001166 spin_lock_irq(q->queue_lock);
1167
Tejun Heoa7384672008-11-28 13:32:03 +09001168 if (unlikely(bio_barrier(bio)) || elv_queue_empty(q))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001169 goto get_rq;
1170
1171 el_ret = elv_merge(q, &req, bio);
1172 switch (el_ret) {
Jens Axboe6728cb02008-01-31 13:03:55 +01001173 case ELEVATOR_BACK_MERGE:
1174 BUG_ON(!rq_mergeable(req));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001175
Jens Axboe6728cb02008-01-31 13:03:55 +01001176 if (!ll_back_merge_fn(q, req, bio))
1177 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001178
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +01001179 trace_block_bio_backmerge(q, bio);
Jens Axboe2056a782006-03-23 20:00:26 +01001180
Jens Axboe6728cb02008-01-31 13:03:55 +01001181 req->biotail->bi_next = bio;
1182 req->biotail = bio;
1183 req->nr_sectors = req->hard_nr_sectors += nr_sectors;
1184 req->ioprio = ioprio_best(req->ioprio, prio);
Jens Axboeab780f12008-08-26 10:25:02 +02001185 if (!blk_rq_cpu_valid(req))
1186 req->cpu = bio->bi_comp_cpu;
Jens Axboe6728cb02008-01-31 13:03:55 +01001187 drive_stat_acct(req, 0);
1188 if (!attempt_back_merge(q, req))
1189 elv_merged_request(q, req, el_ret);
1190 goto out;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001191
Jens Axboe6728cb02008-01-31 13:03:55 +01001192 case ELEVATOR_FRONT_MERGE:
1193 BUG_ON(!rq_mergeable(req));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001194
Jens Axboe6728cb02008-01-31 13:03:55 +01001195 if (!ll_front_merge_fn(q, req, bio))
1196 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001197
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +01001198 trace_block_bio_frontmerge(q, bio);
Jens Axboe2056a782006-03-23 20:00:26 +01001199
Jens Axboe6728cb02008-01-31 13:03:55 +01001200 bio->bi_next = req->bio;
1201 req->bio = bio;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001202
Jens Axboe6728cb02008-01-31 13:03:55 +01001203 /*
1204 * may not be valid. if the low level driver said
1205 * it didn't need a bounce buffer then it better
1206 * not touch req->buffer either...
1207 */
1208 req->buffer = bio_data(bio);
1209 req->current_nr_sectors = bio_cur_sectors(bio);
1210 req->hard_cur_sectors = req->current_nr_sectors;
1211 req->sector = req->hard_sector = bio->bi_sector;
1212 req->nr_sectors = req->hard_nr_sectors += nr_sectors;
1213 req->ioprio = ioprio_best(req->ioprio, prio);
Jens Axboeab780f12008-08-26 10:25:02 +02001214 if (!blk_rq_cpu_valid(req))
1215 req->cpu = bio->bi_comp_cpu;
Jens Axboe6728cb02008-01-31 13:03:55 +01001216 drive_stat_acct(req, 0);
1217 if (!attempt_front_merge(q, req))
1218 elv_merged_request(q, req, el_ret);
1219 goto out;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001220
Jens Axboe6728cb02008-01-31 13:03:55 +01001221 /* ELV_NO_MERGE: elevator says don't/can't merge. */
1222 default:
1223 ;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001224 }
1225
Linus Torvalds1da177e2005-04-16 15:20:36 -07001226get_rq:
Nick Piggin450991b2005-06-28 20:45:13 -07001227 /*
Jens Axboe7749a8d2006-12-13 13:02:26 +01001228 * This sync check and mask will be re-done in init_request_from_bio(),
1229 * but we need to set it earlier to expose the sync flag to the
1230 * rq allocator and io schedulers.
1231 */
1232 rw_flags = bio_data_dir(bio);
1233 if (sync)
1234 rw_flags |= REQ_RW_SYNC;
1235
1236 /*
Nick Piggin450991b2005-06-28 20:45:13 -07001237 * Grab a free request. This is might sleep but can not fail.
Nick Piggind6344532005-06-28 20:45:14 -07001238 * Returns with the queue unlocked.
Nick Piggin450991b2005-06-28 20:45:13 -07001239 */
Jens Axboe7749a8d2006-12-13 13:02:26 +01001240 req = get_request_wait(q, rw_flags, bio);
Nick Piggind6344532005-06-28 20:45:14 -07001241
Nick Piggin450991b2005-06-28 20:45:13 -07001242 /*
1243 * After dropping the lock and possibly sleeping here, our request
1244 * may now be mergeable after it had proven unmergeable (above).
1245 * We don't worry about that case for efficiency. It won't happen
1246 * often, and the elevators are able to handle it.
1247 */
Tejun Heo52d9e672006-01-06 09:49:58 +01001248 init_request_from_bio(req, bio);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001249
Nick Piggin450991b2005-06-28 20:45:13 -07001250 spin_lock_irq(q->queue_lock);
Jens Axboec7c22e42008-09-13 20:26:01 +02001251 if (test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags) ||
1252 bio_flagged(bio, BIO_CPU_AFFINE))
1253 req->cpu = blk_cpu_to_group(smp_processor_id());
Jens Axboe644b2d92009-04-06 14:48:06 +02001254 if (queue_should_plug(q) && elv_queue_empty(q))
Nick Piggin450991b2005-06-28 20:45:13 -07001255 blk_plug_device(q);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001256 add_request(q, req);
1257out:
Jens Axboe644b2d92009-04-06 14:48:06 +02001258 if (unplug || !queue_should_plug(q))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001259 __generic_unplug_device(q);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001260 spin_unlock_irq(q->queue_lock);
1261 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001262}
1263
1264/*
1265 * If bio->bi_dev is a partition, remap the location
1266 */
1267static inline void blk_partition_remap(struct bio *bio)
1268{
1269 struct block_device *bdev = bio->bi_bdev;
1270
Jens Axboebf2de6f2007-09-27 13:01:25 +02001271 if (bio_sectors(bio) && bdev != bdev->bd_contains) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001272 struct hd_struct *p = bdev->bd_part;
Jens Axboea3623572005-11-01 09:26:16 +01001273
Linus Torvalds1da177e2005-04-16 15:20:36 -07001274 bio->bi_sector += p->start_sect;
1275 bio->bi_bdev = bdev->bd_contains;
Alan D. Brunellec7149d62007-08-07 15:30:23 +02001276
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +01001277 trace_block_remap(bdev_get_queue(bio->bi_bdev), bio,
Alan D. Brunellec7149d62007-08-07 15:30:23 +02001278 bdev->bd_dev, bio->bi_sector,
1279 bio->bi_sector - p->start_sect);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001280 }
1281}
1282
Linus Torvalds1da177e2005-04-16 15:20:36 -07001283static void handle_bad_sector(struct bio *bio)
1284{
1285 char b[BDEVNAME_SIZE];
1286
1287 printk(KERN_INFO "attempt to access beyond end of device\n");
1288 printk(KERN_INFO "%s: rw=%ld, want=%Lu, limit=%Lu\n",
1289 bdevname(bio->bi_bdev, b),
1290 bio->bi_rw,
1291 (unsigned long long)bio->bi_sector + bio_sectors(bio),
1292 (long long)(bio->bi_bdev->bd_inode->i_size >> 9));
1293
1294 set_bit(BIO_EOF, &bio->bi_flags);
1295}
1296
Akinobu Mitac17bb492006-12-08 02:39:46 -08001297#ifdef CONFIG_FAIL_MAKE_REQUEST
1298
1299static DECLARE_FAULT_ATTR(fail_make_request);
1300
1301static int __init setup_fail_make_request(char *str)
1302{
1303 return setup_fault_attr(&fail_make_request, str);
1304}
1305__setup("fail_make_request=", setup_fail_make_request);
1306
1307static int should_fail_request(struct bio *bio)
1308{
Tejun Heoeddb2e22008-08-25 19:56:13 +09001309 struct hd_struct *part = bio->bi_bdev->bd_part;
1310
1311 if (part_to_disk(part)->part0.make_it_fail || part->make_it_fail)
Akinobu Mitac17bb492006-12-08 02:39:46 -08001312 return should_fail(&fail_make_request, bio->bi_size);
1313
1314 return 0;
1315}
1316
1317static int __init fail_make_request_debugfs(void)
1318{
1319 return init_fault_attr_dentries(&fail_make_request,
1320 "fail_make_request");
1321}
1322
1323late_initcall(fail_make_request_debugfs);
1324
1325#else /* CONFIG_FAIL_MAKE_REQUEST */
1326
1327static inline int should_fail_request(struct bio *bio)
1328{
1329 return 0;
1330}
1331
1332#endif /* CONFIG_FAIL_MAKE_REQUEST */
1333
Jens Axboec07e2b42007-07-18 13:27:58 +02001334/*
1335 * Check whether this bio extends beyond the end of the device.
1336 */
1337static inline int bio_check_eod(struct bio *bio, unsigned int nr_sectors)
1338{
1339 sector_t maxsector;
1340
1341 if (!nr_sectors)
1342 return 0;
1343
1344 /* Test device or partition size, when known. */
1345 maxsector = bio->bi_bdev->bd_inode->i_size >> 9;
1346 if (maxsector) {
1347 sector_t sector = bio->bi_sector;
1348
1349 if (maxsector < nr_sectors || maxsector - nr_sectors < sector) {
1350 /*
1351 * This may well happen - the kernel calls bread()
1352 * without checking the size of the device, e.g., when
1353 * mounting a device.
1354 */
1355 handle_bad_sector(bio);
1356 return 1;
1357 }
1358 }
1359
1360 return 0;
1361}
1362
Linus Torvalds1da177e2005-04-16 15:20:36 -07001363/**
Randy Dunlap710027a2008-08-19 20:13:11 +02001364 * generic_make_request - hand a buffer to its device driver for I/O
Linus Torvalds1da177e2005-04-16 15:20:36 -07001365 * @bio: The bio describing the location in memory and on the device.
1366 *
1367 * generic_make_request() is used to make I/O requests of block
1368 * devices. It is passed a &struct bio, which describes the I/O that needs
1369 * to be done.
1370 *
1371 * generic_make_request() does not return any status. The
1372 * success/failure status of the request, along with notification of
1373 * completion, is delivered asynchronously through the bio->bi_end_io
1374 * function described (one day) else where.
1375 *
1376 * The caller of generic_make_request must make sure that bi_io_vec
1377 * are set to describe the memory buffer, and that bi_dev and bi_sector are
1378 * set to describe the device address, and the
1379 * bi_end_io and optionally bi_private are set to describe how
1380 * completion notification should be signaled.
1381 *
1382 * generic_make_request and the drivers it calls may use bi_next if this
1383 * bio happens to be merged with someone else, and may change bi_dev and
1384 * bi_sector for remaps as it sees fit. So the values of these fields
1385 * should NOT be depended on after the call to generic_make_request.
1386 */
Neil Brownd89d8792007-05-01 09:53:42 +02001387static inline void __generic_make_request(struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001388{
Jens Axboe165125e2007-07-24 09:28:11 +02001389 struct request_queue *q;
NeilBrown5ddfe962006-10-30 22:07:21 -08001390 sector_t old_sector;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001391 int ret, nr_sectors = bio_sectors(bio);
Jens Axboe2056a782006-03-23 20:00:26 +01001392 dev_t old_dev;
Jens Axboe51fd77b2007-11-02 08:49:08 +01001393 int err = -EIO;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001394
1395 might_sleep();
Linus Torvalds1da177e2005-04-16 15:20:36 -07001396
Jens Axboec07e2b42007-07-18 13:27:58 +02001397 if (bio_check_eod(bio, nr_sectors))
1398 goto end_io;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001399
1400 /*
1401 * Resolve the mapping until finished. (drivers are
1402 * still free to implement/resolve their own stacking
1403 * by explicitly returning 0)
1404 *
1405 * NOTE: we don't repeat the blk_size check for each new device.
1406 * Stacking drivers are expected to know what they are doing.
1407 */
NeilBrown5ddfe962006-10-30 22:07:21 -08001408 old_sector = -1;
Jens Axboe2056a782006-03-23 20:00:26 +01001409 old_dev = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001410 do {
1411 char b[BDEVNAME_SIZE];
1412
1413 q = bdev_get_queue(bio->bi_bdev);
Tejun Heoa7384672008-11-28 13:32:03 +09001414 if (unlikely(!q)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001415 printk(KERN_ERR
1416 "generic_make_request: Trying to access "
1417 "nonexistent block-device %s (%Lu)\n",
1418 bdevname(bio->bi_bdev, b),
1419 (long long) bio->bi_sector);
Tejun Heoa7384672008-11-28 13:32:03 +09001420 goto end_io;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001421 }
1422
Jens Axboe4fa253f2007-07-18 13:13:10 +02001423 if (unlikely(nr_sectors > q->max_hw_sectors)) {
Jens Axboe6728cb02008-01-31 13:03:55 +01001424 printk(KERN_ERR "bio too big device %s (%u > %u)\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -07001425 bdevname(bio->bi_bdev, b),
1426 bio_sectors(bio),
1427 q->max_hw_sectors);
1428 goto end_io;
1429 }
1430
Nick Pigginfde6ad22005-06-23 00:08:53 -07001431 if (unlikely(test_bit(QUEUE_FLAG_DEAD, &q->queue_flags)))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001432 goto end_io;
1433
Akinobu Mitac17bb492006-12-08 02:39:46 -08001434 if (should_fail_request(bio))
1435 goto end_io;
1436
Linus Torvalds1da177e2005-04-16 15:20:36 -07001437 /*
1438 * If this device has partitions, remap block n
1439 * of partition p to block n+start(p) of the disk.
1440 */
1441 blk_partition_remap(bio);
1442
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +02001443 if (bio_integrity_enabled(bio) && bio_integrity_prep(bio))
1444 goto end_io;
1445
NeilBrown5ddfe962006-10-30 22:07:21 -08001446 if (old_sector != -1)
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +01001447 trace_block_remap(q, bio, old_dev, bio->bi_sector,
NeilBrown5ddfe962006-10-30 22:07:21 -08001448 old_sector);
Jens Axboe2056a782006-03-23 20:00:26 +01001449
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +01001450 trace_block_bio_queue(q, bio);
Jens Axboe2056a782006-03-23 20:00:26 +01001451
NeilBrown5ddfe962006-10-30 22:07:21 -08001452 old_sector = bio->bi_sector;
Jens Axboe2056a782006-03-23 20:00:26 +01001453 old_dev = bio->bi_bdev->bd_dev;
1454
Jens Axboec07e2b42007-07-18 13:27:58 +02001455 if (bio_check_eod(bio, nr_sectors))
1456 goto end_io;
Tejun Heoa7384672008-11-28 13:32:03 +09001457
1458 if (bio_discard(bio) && !q->prepare_discard_fn) {
Jens Axboe51fd77b2007-11-02 08:49:08 +01001459 err = -EOPNOTSUPP;
1460 goto end_io;
1461 }
Jens Axboecec07072009-01-13 15:28:32 +01001462 if (bio_barrier(bio) && bio_has_data(bio) &&
1463 (q->next_ordered == QUEUE_ORDERED_NONE)) {
1464 err = -EOPNOTSUPP;
1465 goto end_io;
1466 }
NeilBrown5ddfe962006-10-30 22:07:21 -08001467
Linus Torvalds1da177e2005-04-16 15:20:36 -07001468 ret = q->make_request_fn(q, bio);
1469 } while (ret);
Tejun Heoa7384672008-11-28 13:32:03 +09001470
1471 return;
1472
1473end_io:
1474 bio_endio(bio, err);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001475}
1476
Neil Brownd89d8792007-05-01 09:53:42 +02001477/*
1478 * We only want one ->make_request_fn to be active at a time,
1479 * else stack usage with stacked devices could be a problem.
1480 * So use current->bio_{list,tail} to keep a list of requests
1481 * submited by a make_request_fn function.
1482 * current->bio_tail is also used as a flag to say if
1483 * generic_make_request is currently active in this task or not.
1484 * If it is NULL, then no make_request is active. If it is non-NULL,
1485 * then a make_request is active, and new requests should be added
1486 * at the tail
1487 */
1488void generic_make_request(struct bio *bio)
1489{
1490 if (current->bio_tail) {
1491 /* make_request is active */
1492 *(current->bio_tail) = bio;
1493 bio->bi_next = NULL;
1494 current->bio_tail = &bio->bi_next;
1495 return;
1496 }
1497 /* following loop may be a bit non-obvious, and so deserves some
1498 * explanation.
1499 * Before entering the loop, bio->bi_next is NULL (as all callers
1500 * ensure that) so we have a list with a single bio.
1501 * We pretend that we have just taken it off a longer list, so
1502 * we assign bio_list to the next (which is NULL) and bio_tail
1503 * to &bio_list, thus initialising the bio_list of new bios to be
1504 * added. __generic_make_request may indeed add some more bios
1505 * through a recursive call to generic_make_request. If it
1506 * did, we find a non-NULL value in bio_list and re-enter the loop
1507 * from the top. In this case we really did just take the bio
1508 * of the top of the list (no pretending) and so fixup bio_list and
1509 * bio_tail or bi_next, and call into __generic_make_request again.
1510 *
1511 * The loop was structured like this to make only one call to
1512 * __generic_make_request (which is important as it is large and
1513 * inlined) and to keep the structure simple.
1514 */
1515 BUG_ON(bio->bi_next);
1516 do {
1517 current->bio_list = bio->bi_next;
1518 if (bio->bi_next == NULL)
1519 current->bio_tail = &current->bio_list;
1520 else
1521 bio->bi_next = NULL;
1522 __generic_make_request(bio);
1523 bio = current->bio_list;
1524 } while (bio);
1525 current->bio_tail = NULL; /* deactivate */
1526}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001527EXPORT_SYMBOL(generic_make_request);
1528
1529/**
Randy Dunlap710027a2008-08-19 20:13:11 +02001530 * submit_bio - submit a bio to the block device layer for I/O
Linus Torvalds1da177e2005-04-16 15:20:36 -07001531 * @rw: whether to %READ or %WRITE, or maybe to %READA (read ahead)
1532 * @bio: The &struct bio which describes the I/O
1533 *
1534 * submit_bio() is very similar in purpose to generic_make_request(), and
1535 * uses that function to do most of the work. Both are fairly rough
Randy Dunlap710027a2008-08-19 20:13:11 +02001536 * interfaces; @bio must be presetup and ready for I/O.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001537 *
1538 */
1539void submit_bio(int rw, struct bio *bio)
1540{
1541 int count = bio_sectors(bio);
1542
Jens Axboe22e2c502005-06-27 10:55:12 +02001543 bio->bi_rw |= rw;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001544
Jens Axboebf2de6f2007-09-27 13:01:25 +02001545 /*
1546 * If it's a regular read/write or a barrier with data attached,
1547 * go through the normal accounting stuff before submission.
1548 */
Jens Axboea9c701e2008-08-08 11:04:44 +02001549 if (bio_has_data(bio)) {
Jens Axboebf2de6f2007-09-27 13:01:25 +02001550 if (rw & WRITE) {
1551 count_vm_events(PGPGOUT, count);
1552 } else {
1553 task_io_account_read(bio->bi_size);
1554 count_vm_events(PGPGIN, count);
1555 }
1556
1557 if (unlikely(block_dump)) {
1558 char b[BDEVNAME_SIZE];
1559 printk(KERN_DEBUG "%s(%d): %s block %Lu on %s\n",
Pavel Emelyanovba25f9d2007-10-18 23:40:40 -07001560 current->comm, task_pid_nr(current),
Jens Axboebf2de6f2007-09-27 13:01:25 +02001561 (rw & WRITE) ? "WRITE" : "READ",
1562 (unsigned long long)bio->bi_sector,
Jens Axboe6728cb02008-01-31 13:03:55 +01001563 bdevname(bio->bi_bdev, b));
Jens Axboebf2de6f2007-09-27 13:01:25 +02001564 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001565 }
1566
1567 generic_make_request(bio);
1568}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001569EXPORT_SYMBOL(submit_bio);
1570
Kiyoshi Ueda3bcddea2007-12-11 17:52:28 -05001571/**
Kiyoshi Ueda82124d62008-09-18 10:45:38 -04001572 * blk_rq_check_limits - Helper function to check a request for the queue limit
1573 * @q: the queue
1574 * @rq: the request being checked
1575 *
1576 * Description:
1577 * @rq may have been made based on weaker limitations of upper-level queues
1578 * in request stacking drivers, and it may violate the limitation of @q.
1579 * Since the block layer and the underlying device driver trust @rq
1580 * after it is inserted to @q, it should be checked against @q before
1581 * the insertion using this generic function.
1582 *
1583 * This function should also be useful for request stacking drivers
1584 * in some cases below, so export this fuction.
1585 * Request stacking drivers like request-based dm may change the queue
1586 * limits while requests are in the queue (e.g. dm's table swapping).
1587 * Such request stacking drivers should check those requests agaist
1588 * the new queue limits again when they dispatch those requests,
1589 * although such checkings are also done against the old queue limits
1590 * when submitting requests.
1591 */
1592int blk_rq_check_limits(struct request_queue *q, struct request *rq)
1593{
1594 if (rq->nr_sectors > q->max_sectors ||
1595 rq->data_len > q->max_hw_sectors << 9) {
1596 printk(KERN_ERR "%s: over max size limit.\n", __func__);
1597 return -EIO;
1598 }
1599
1600 /*
1601 * queue's settings related to segment counting like q->bounce_pfn
1602 * may differ from that of other stacking queues.
1603 * Recalculate it to check the request correctly on this queue's
1604 * limitation.
1605 */
1606 blk_recalc_rq_segments(rq);
1607 if (rq->nr_phys_segments > q->max_phys_segments ||
1608 rq->nr_phys_segments > q->max_hw_segments) {
1609 printk(KERN_ERR "%s: over max segments limit.\n", __func__);
1610 return -EIO;
1611 }
1612
1613 return 0;
1614}
1615EXPORT_SYMBOL_GPL(blk_rq_check_limits);
1616
1617/**
1618 * blk_insert_cloned_request - Helper for stacking drivers to submit a request
1619 * @q: the queue to submit the request
1620 * @rq: the request being queued
1621 */
1622int blk_insert_cloned_request(struct request_queue *q, struct request *rq)
1623{
1624 unsigned long flags;
1625
1626 if (blk_rq_check_limits(q, rq))
1627 return -EIO;
1628
1629#ifdef CONFIG_FAIL_MAKE_REQUEST
1630 if (rq->rq_disk && rq->rq_disk->part0.make_it_fail &&
1631 should_fail(&fail_make_request, blk_rq_bytes(rq)))
1632 return -EIO;
1633#endif
1634
1635 spin_lock_irqsave(q->queue_lock, flags);
1636
1637 /*
1638 * Submitting request must be dequeued before calling this function
1639 * because it will be linked to another request_queue
1640 */
1641 BUG_ON(blk_queued_rq(rq));
1642
1643 drive_stat_acct(rq, 1);
1644 __elv_add_request(q, rq, ELEVATOR_INSERT_BACK, 0);
1645
1646 spin_unlock_irqrestore(q->queue_lock, flags);
1647
1648 return 0;
1649}
1650EXPORT_SYMBOL_GPL(blk_insert_cloned_request);
1651
1652/**
Tejun Heo53a08802008-12-03 12:41:26 +01001653 * blkdev_dequeue_request - dequeue request and start timeout timer
1654 * @req: request to dequeue
1655 *
1656 * Dequeue @req and start timeout timer on it. This hands off the
1657 * request to the driver.
1658 *
1659 * Block internal functions which don't want to start timer should
1660 * call elv_dequeue_request().
1661 */
1662void blkdev_dequeue_request(struct request *req)
1663{
1664 elv_dequeue_request(req->q, req);
1665
1666 /*
1667 * We are now handing the request to the hardware, add the
1668 * timeout handler.
1669 */
1670 blk_add_timer(req);
1671}
1672EXPORT_SYMBOL(blkdev_dequeue_request);
1673
Jens Axboebc58ba92009-01-23 10:54:44 +01001674static void blk_account_io_completion(struct request *req, unsigned int bytes)
1675{
Jerome Marchand26308ea2009-03-27 10:31:51 +01001676 if (!blk_do_io_stat(req))
Jens Axboebc58ba92009-01-23 10:54:44 +01001677 return;
1678
1679 if (blk_fs_request(req)) {
1680 const int rw = rq_data_dir(req);
1681 struct hd_struct *part;
1682 int cpu;
1683
1684 cpu = part_stat_lock();
1685 part = disk_map_sector_rcu(req->rq_disk, req->sector);
1686 part_stat_add(cpu, part, sectors[rw], bytes >> 9);
1687 part_stat_unlock();
1688 }
1689}
1690
1691static void blk_account_io_done(struct request *req)
1692{
Jerome Marchand26308ea2009-03-27 10:31:51 +01001693 if (!blk_do_io_stat(req))
Jens Axboebc58ba92009-01-23 10:54:44 +01001694 return;
1695
1696 /*
1697 * Account IO completion. bar_rq isn't accounted as a normal
1698 * IO on queueing nor completion. Accounting the containing
1699 * request is enough.
1700 */
1701 if (blk_fs_request(req) && req != &req->q->bar_rq) {
1702 unsigned long duration = jiffies - req->start_time;
1703 const int rw = rq_data_dir(req);
1704 struct hd_struct *part;
1705 int cpu;
1706
1707 cpu = part_stat_lock();
Jerome Marchand26308ea2009-03-27 10:31:51 +01001708 part = disk_map_sector_rcu(req->rq_disk, req->sector);
Jens Axboebc58ba92009-01-23 10:54:44 +01001709
1710 part_stat_inc(cpu, part, ios[rw]);
1711 part_stat_add(cpu, part, ticks[rw], duration);
1712 part_round_stats(cpu, part);
1713 part_dec_in_flight(part);
1714
1715 part_stat_unlock();
1716 }
1717}
1718
Tejun Heo53a08802008-12-03 12:41:26 +01001719/**
Kiyoshi Ueda3bcddea2007-12-11 17:52:28 -05001720 * __end_that_request_first - end I/O on a request
1721 * @req: the request being processed
Randy Dunlap710027a2008-08-19 20:13:11 +02001722 * @error: %0 for success, < %0 for error
Kiyoshi Ueda3bcddea2007-12-11 17:52:28 -05001723 * @nr_bytes: number of bytes to complete
1724 *
1725 * Description:
1726 * Ends I/O on a number of bytes attached to @req, and sets it up
1727 * for the next range of segments (if any) in the cluster.
1728 *
1729 * Return:
Randy Dunlap710027a2008-08-19 20:13:11 +02001730 * %0 - we are done with this request, call end_that_request_last()
1731 * %1 - still buffers pending for this request
Kiyoshi Ueda3bcddea2007-12-11 17:52:28 -05001732 **/
Kiyoshi Ueda5450d3e2007-12-11 17:53:03 -05001733static int __end_that_request_first(struct request *req, int error,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001734 int nr_bytes)
1735{
Kiyoshi Ueda5450d3e2007-12-11 17:53:03 -05001736 int total_bytes, bio_nbytes, next_idx = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001737 struct bio *bio;
1738
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +01001739 trace_block_rq_complete(req->q, req);
Jens Axboe2056a782006-03-23 20:00:26 +01001740
Linus Torvalds1da177e2005-04-16 15:20:36 -07001741 /*
Randy Dunlap710027a2008-08-19 20:13:11 +02001742 * for a REQ_TYPE_BLOCK_PC request, we want to carry any eventual
Linus Torvalds1da177e2005-04-16 15:20:36 -07001743 * sense key with us all the way through
1744 */
1745 if (!blk_pc_request(req))
1746 req->errors = 0;
1747
Jens Axboe6728cb02008-01-31 13:03:55 +01001748 if (error && (blk_fs_request(req) && !(req->cmd_flags & REQ_QUIET))) {
1749 printk(KERN_ERR "end_request: I/O error, dev %s, sector %llu\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -07001750 req->rq_disk ? req->rq_disk->disk_name : "?",
1751 (unsigned long long)req->sector);
1752 }
1753
Jens Axboebc58ba92009-01-23 10:54:44 +01001754 blk_account_io_completion(req, nr_bytes);
Jens Axboed72d9042005-11-01 08:35:42 +01001755
Linus Torvalds1da177e2005-04-16 15:20:36 -07001756 total_bytes = bio_nbytes = 0;
1757 while ((bio = req->bio) != NULL) {
1758 int nbytes;
1759
1760 if (nr_bytes >= bio->bi_size) {
1761 req->bio = bio->bi_next;
1762 nbytes = bio->bi_size;
NeilBrown5bb23a62007-09-27 12:46:13 +02001763 req_bio_endio(req, bio, nbytes, error);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001764 next_idx = 0;
1765 bio_nbytes = 0;
1766 } else {
1767 int idx = bio->bi_idx + next_idx;
1768
1769 if (unlikely(bio->bi_idx >= bio->bi_vcnt)) {
1770 blk_dump_rq_flags(req, "__end_that");
Jens Axboe6728cb02008-01-31 13:03:55 +01001771 printk(KERN_ERR "%s: bio idx %d >= vcnt %d\n",
Harvey Harrison24c03d42008-05-01 04:35:17 -07001772 __func__, bio->bi_idx, bio->bi_vcnt);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001773 break;
1774 }
1775
1776 nbytes = bio_iovec_idx(bio, idx)->bv_len;
1777 BIO_BUG_ON(nbytes > bio->bi_size);
1778
1779 /*
1780 * not a complete bvec done
1781 */
1782 if (unlikely(nbytes > nr_bytes)) {
1783 bio_nbytes += nr_bytes;
1784 total_bytes += nr_bytes;
1785 break;
1786 }
1787
1788 /*
1789 * advance to the next vector
1790 */
1791 next_idx++;
1792 bio_nbytes += nbytes;
1793 }
1794
1795 total_bytes += nbytes;
1796 nr_bytes -= nbytes;
1797
Jens Axboe6728cb02008-01-31 13:03:55 +01001798 bio = req->bio;
1799 if (bio) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001800 /*
1801 * end more in this run, or just return 'not-done'
1802 */
1803 if (unlikely(nr_bytes <= 0))
1804 break;
1805 }
1806 }
1807
1808 /*
1809 * completely done
1810 */
1811 if (!req->bio)
1812 return 0;
1813
1814 /*
1815 * if the request wasn't completed, update state
1816 */
1817 if (bio_nbytes) {
NeilBrown5bb23a62007-09-27 12:46:13 +02001818 req_bio_endio(req, bio, bio_nbytes, error);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001819 bio->bi_idx += next_idx;
1820 bio_iovec(bio)->bv_offset += nr_bytes;
1821 bio_iovec(bio)->bv_len -= nr_bytes;
1822 }
1823
1824 blk_recalc_rq_sectors(req, total_bytes >> 9);
1825 blk_recalc_rq_segments(req);
1826 return 1;
1827}
1828
Linus Torvalds1da177e2005-04-16 15:20:36 -07001829/*
1830 * queue lock must be held
1831 */
Kiyoshi Ueda5450d3e2007-12-11 17:53:03 -05001832static void end_that_request_last(struct request *req, int error)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001833{
Kiyoshi Uedab8286232007-12-11 17:53:24 -05001834 if (blk_rq_tagged(req))
1835 blk_queue_end_tag(req->q, req);
1836
1837 if (blk_queued_rq(req))
Tejun Heo53a08802008-12-03 12:41:26 +01001838 elv_dequeue_request(req->q, req);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001839
1840 if (unlikely(laptop_mode) && blk_fs_request(req))
1841 laptop_io_completion();
1842
Mike Andersone78042e2008-10-30 02:16:20 -07001843 blk_delete_timer(req);
1844
Jens Axboebc58ba92009-01-23 10:54:44 +01001845 blk_account_io_done(req);
Kiyoshi Uedab8286232007-12-11 17:53:24 -05001846
Linus Torvalds1da177e2005-04-16 15:20:36 -07001847 if (req->end_io)
Tejun Heo8ffdc652006-01-06 09:49:03 +01001848 req->end_io(req, error);
Kiyoshi Uedab8286232007-12-11 17:53:24 -05001849 else {
1850 if (blk_bidi_rq(req))
1851 __blk_put_request(req->next_rq->q, req->next_rq);
1852
Linus Torvalds1da177e2005-04-16 15:20:36 -07001853 __blk_put_request(req->q, req);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001854 }
1855}
1856
Kiyoshi Ueda3b113132007-12-11 17:41:17 -05001857/**
1858 * blk_rq_bytes - Returns bytes left to complete in the entire request
Randy Dunlap5d87a052008-02-20 09:01:22 +01001859 * @rq: the request being processed
Kiyoshi Ueda3b113132007-12-11 17:41:17 -05001860 **/
1861unsigned int blk_rq_bytes(struct request *rq)
Jens Axboea0cd1282007-09-21 10:41:07 +02001862{
1863 if (blk_fs_request(rq))
1864 return rq->hard_nr_sectors << 9;
1865
1866 return rq->data_len;
1867}
Kiyoshi Ueda3b113132007-12-11 17:41:17 -05001868EXPORT_SYMBOL_GPL(blk_rq_bytes);
1869
1870/**
1871 * blk_rq_cur_bytes - Returns bytes left to complete in the current segment
Randy Dunlap5d87a052008-02-20 09:01:22 +01001872 * @rq: the request being processed
Kiyoshi Ueda3b113132007-12-11 17:41:17 -05001873 **/
1874unsigned int blk_rq_cur_bytes(struct request *rq)
1875{
1876 if (blk_fs_request(rq))
1877 return rq->current_nr_sectors << 9;
1878
1879 if (rq->bio)
1880 return rq->bio->bi_size;
1881
1882 return rq->data_len;
1883}
1884EXPORT_SYMBOL_GPL(blk_rq_cur_bytes);
Jens Axboea0cd1282007-09-21 10:41:07 +02001885
1886/**
Jens Axboea0cd1282007-09-21 10:41:07 +02001887 * end_request - end I/O on the current segment of the request
Randy Dunlap8f731f72007-10-18 23:39:28 -07001888 * @req: the request being processed
Randy Dunlap710027a2008-08-19 20:13:11 +02001889 * @uptodate: error value or %0/%1 uptodate flag
Jens Axboea0cd1282007-09-21 10:41:07 +02001890 *
1891 * Description:
1892 * Ends I/O on the current segment of a request. If that is the only
1893 * remaining segment, the request is also completed and freed.
1894 *
Randy Dunlap710027a2008-08-19 20:13:11 +02001895 * This is a remnant of how older block drivers handled I/O completions.
1896 * Modern drivers typically end I/O on the full request in one go, unless
Jens Axboea0cd1282007-09-21 10:41:07 +02001897 * they have a residual value to account for. For that case this function
1898 * isn't really useful, unless the residual just happens to be the
1899 * full current segment. In other words, don't use this function in new
Kiyoshi Uedad00e29f2008-10-01 10:14:46 -04001900 * code. Use blk_end_request() or __blk_end_request() to end a request.
Jens Axboea0cd1282007-09-21 10:41:07 +02001901 **/
1902void end_request(struct request *req, int uptodate)
1903{
Kiyoshi Uedad00e29f2008-10-01 10:14:46 -04001904 int error = 0;
1905
1906 if (uptodate <= 0)
1907 error = uptodate ? uptodate : -EIO;
1908
1909 __blk_end_request(req, error, req->hard_cur_sectors << 9);
Jens Axboea0cd1282007-09-21 10:41:07 +02001910}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001911EXPORT_SYMBOL(end_request);
1912
Kiyoshi Ueda32fab442008-09-18 10:45:09 -04001913static int end_that_request_data(struct request *rq, int error,
1914 unsigned int nr_bytes, unsigned int bidi_bytes)
1915{
1916 if (rq->bio) {
1917 if (__end_that_request_first(rq, error, nr_bytes))
1918 return 1;
1919
1920 /* Bidi request must be completed as a whole */
1921 if (blk_bidi_rq(rq) &&
1922 __end_that_request_first(rq->next_rq, error, bidi_bytes))
1923 return 1;
1924 }
1925
1926 return 0;
1927}
1928
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05001929/**
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05001930 * blk_end_io - Generic end_io function to complete a request.
1931 * @rq: the request being processed
Randy Dunlap710027a2008-08-19 20:13:11 +02001932 * @error: %0 for success, < %0 for error
Kiyoshi Uedae3a04fe2007-12-11 17:51:46 -05001933 * @nr_bytes: number of bytes to complete @rq
1934 * @bidi_bytes: number of bytes to complete @rq->next_rq
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05001935 * @drv_callback: function called between completion of bios in the request
1936 * and completion of the request.
Randy Dunlap710027a2008-08-19 20:13:11 +02001937 * If the callback returns non %0, this helper returns without
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05001938 * completion of the request.
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05001939 *
1940 * Description:
Kiyoshi Uedae3a04fe2007-12-11 17:51:46 -05001941 * Ends I/O on a number of bytes attached to @rq and @rq->next_rq.
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05001942 * If @rq has leftover, sets it up for the next range of segments.
1943 *
1944 * Return:
Randy Dunlap710027a2008-08-19 20:13:11 +02001945 * %0 - we are done with this request
1946 * %1 - this request is not freed yet, it still has pending buffers.
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05001947 **/
Jens Axboe22b13212008-01-31 12:36:19 +01001948static int blk_end_io(struct request *rq, int error, unsigned int nr_bytes,
1949 unsigned int bidi_bytes,
1950 int (drv_callback)(struct request *))
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05001951{
1952 struct request_queue *q = rq->q;
1953 unsigned long flags = 0UL;
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05001954
Kiyoshi Ueda32fab442008-09-18 10:45:09 -04001955 if (end_that_request_data(rq, error, nr_bytes, bidi_bytes))
1956 return 1;
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05001957
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05001958 /* Special feature for tricky drivers */
1959 if (drv_callback && drv_callback(rq))
1960 return 1;
1961
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05001962 add_disk_randomness(rq->rq_disk);
1963
1964 spin_lock_irqsave(q->queue_lock, flags);
Kiyoshi Uedab8286232007-12-11 17:53:24 -05001965 end_that_request_last(rq, error);
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05001966 spin_unlock_irqrestore(q->queue_lock, flags);
1967
1968 return 0;
1969}
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05001970
1971/**
1972 * blk_end_request - Helper function for drivers to complete the request.
1973 * @rq: the request being processed
Randy Dunlap710027a2008-08-19 20:13:11 +02001974 * @error: %0 for success, < %0 for error
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05001975 * @nr_bytes: number of bytes to complete
1976 *
1977 * Description:
1978 * Ends I/O on a number of bytes attached to @rq.
1979 * If @rq has leftover, sets it up for the next range of segments.
1980 *
1981 * Return:
Randy Dunlap710027a2008-08-19 20:13:11 +02001982 * %0 - we are done with this request
1983 * %1 - still buffers pending for this request
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05001984 **/
Jens Axboe22b13212008-01-31 12:36:19 +01001985int blk_end_request(struct request *rq, int error, unsigned int nr_bytes)
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05001986{
Kiyoshi Uedae3a04fe2007-12-11 17:51:46 -05001987 return blk_end_io(rq, error, nr_bytes, 0, NULL);
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05001988}
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05001989EXPORT_SYMBOL_GPL(blk_end_request);
1990
1991/**
1992 * __blk_end_request - Helper function for drivers to complete the request.
1993 * @rq: the request being processed
Randy Dunlap710027a2008-08-19 20:13:11 +02001994 * @error: %0 for success, < %0 for error
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05001995 * @nr_bytes: number of bytes to complete
1996 *
1997 * Description:
1998 * Must be called with queue lock held unlike blk_end_request().
1999 *
2000 * Return:
Randy Dunlap710027a2008-08-19 20:13:11 +02002001 * %0 - we are done with this request
2002 * %1 - still buffers pending for this request
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002003 **/
Jens Axboe22b13212008-01-31 12:36:19 +01002004int __blk_end_request(struct request *rq, int error, unsigned int nr_bytes)
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002005{
Jens Axboe60540162008-08-26 13:34:34 +02002006 if (rq->bio && __end_that_request_first(rq, error, nr_bytes))
Jens Axboe051cc392008-08-08 11:06:45 +02002007 return 1;
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002008
2009 add_disk_randomness(rq->rq_disk);
2010
Kiyoshi Uedab8286232007-12-11 17:53:24 -05002011 end_that_request_last(rq, error);
Kiyoshi Ueda336cdb42007-12-11 17:40:30 -05002012
2013 return 0;
2014}
2015EXPORT_SYMBOL_GPL(__blk_end_request);
2016
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05002017/**
Kiyoshi Uedae3a04fe2007-12-11 17:51:46 -05002018 * blk_end_bidi_request - Helper function for drivers to complete bidi request.
2019 * @rq: the bidi request being processed
Randy Dunlap710027a2008-08-19 20:13:11 +02002020 * @error: %0 for success, < %0 for error
Kiyoshi Uedae3a04fe2007-12-11 17:51:46 -05002021 * @nr_bytes: number of bytes to complete @rq
2022 * @bidi_bytes: number of bytes to complete @rq->next_rq
2023 *
2024 * Description:
2025 * Ends I/O on a number of bytes attached to @rq and @rq->next_rq.
2026 *
2027 * Return:
Randy Dunlap710027a2008-08-19 20:13:11 +02002028 * %0 - we are done with this request
2029 * %1 - still buffers pending for this request
Kiyoshi Uedae3a04fe2007-12-11 17:51:46 -05002030 **/
Jens Axboe22b13212008-01-31 12:36:19 +01002031int blk_end_bidi_request(struct request *rq, int error, unsigned int nr_bytes,
2032 unsigned int bidi_bytes)
Kiyoshi Uedae3a04fe2007-12-11 17:51:46 -05002033{
2034 return blk_end_io(rq, error, nr_bytes, bidi_bytes, NULL);
2035}
2036EXPORT_SYMBOL_GPL(blk_end_bidi_request);
2037
2038/**
Kiyoshi Ueda32fab442008-09-18 10:45:09 -04002039 * blk_update_request - Special helper function for request stacking drivers
2040 * @rq: the request being processed
2041 * @error: %0 for success, < %0 for error
2042 * @nr_bytes: number of bytes to complete @rq
2043 *
2044 * Description:
2045 * Ends I/O on a number of bytes attached to @rq, but doesn't complete
2046 * the request structure even if @rq doesn't have leftover.
2047 * If @rq has leftover, sets it up for the next range of segments.
2048 *
2049 * This special helper function is only for request stacking drivers
2050 * (e.g. request-based dm) so that they can handle partial completion.
2051 * Actual device drivers should use blk_end_request instead.
2052 */
2053void blk_update_request(struct request *rq, int error, unsigned int nr_bytes)
2054{
2055 if (!end_that_request_data(rq, error, nr_bytes, 0)) {
2056 /*
2057 * These members are not updated in end_that_request_data()
2058 * when all bios are completed.
2059 * Update them so that the request stacking driver can find
2060 * how many bytes remain in the request later.
2061 */
2062 rq->nr_sectors = rq->hard_nr_sectors = 0;
2063 rq->current_nr_sectors = rq->hard_cur_sectors = 0;
2064 }
2065}
2066EXPORT_SYMBOL_GPL(blk_update_request);
2067
2068/**
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05002069 * blk_end_request_callback - Special helper function for tricky drivers
2070 * @rq: the request being processed
Randy Dunlap710027a2008-08-19 20:13:11 +02002071 * @error: %0 for success, < %0 for error
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05002072 * @nr_bytes: number of bytes to complete
2073 * @drv_callback: function called between completion of bios in the request
2074 * and completion of the request.
Randy Dunlap710027a2008-08-19 20:13:11 +02002075 * If the callback returns non %0, this helper returns without
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05002076 * completion of the request.
2077 *
2078 * Description:
2079 * Ends I/O on a number of bytes attached to @rq.
2080 * If @rq has leftover, sets it up for the next range of segments.
2081 *
2082 * This special helper function is used only for existing tricky drivers.
2083 * (e.g. cdrom_newpc_intr() of ide-cd)
2084 * This interface will be removed when such drivers are rewritten.
2085 * Don't use this interface in other places anymore.
2086 *
2087 * Return:
Randy Dunlap710027a2008-08-19 20:13:11 +02002088 * %0 - we are done with this request
2089 * %1 - this request is not freed yet.
2090 * this request still has pending buffers or
2091 * the driver doesn't want to finish this request yet.
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05002092 **/
Jens Axboe22b13212008-01-31 12:36:19 +01002093int blk_end_request_callback(struct request *rq, int error,
2094 unsigned int nr_bytes,
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05002095 int (drv_callback)(struct request *))
2096{
Kiyoshi Uedae3a04fe2007-12-11 17:51:46 -05002097 return blk_end_io(rq, error, nr_bytes, 0, drv_callback);
Kiyoshi Uedae19a3ab2007-12-11 17:51:02 -05002098}
2099EXPORT_SYMBOL_GPL(blk_end_request_callback);
2100
Jens Axboe86db1e22008-01-29 14:53:40 +01002101void blk_rq_bio_prep(struct request_queue *q, struct request *rq,
2102 struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002103{
David Woodhoused628eae2008-08-09 16:22:17 +01002104 /* Bit 0 (R/W) is identical in rq->cmd_flags and bio->bi_rw, and
2105 we want BIO_RW_AHEAD (bit 1) to imply REQ_FAILFAST (bit 1). */
Jens Axboe4aff5e22006-08-10 08:44:47 +02002106 rq->cmd_flags |= (bio->bi_rw & 3);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002107
David Woodhousefb2dce82008-08-05 18:01:53 +01002108 if (bio_has_data(bio)) {
2109 rq->nr_phys_segments = bio_phys_segments(q, bio);
David Woodhousefb2dce82008-08-05 18:01:53 +01002110 rq->buffer = bio_data(bio);
2111 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002112 rq->current_nr_sectors = bio_cur_sectors(bio);
2113 rq->hard_cur_sectors = rq->current_nr_sectors;
2114 rq->hard_nr_sectors = rq->nr_sectors = bio_sectors(bio);
Mike Christie0e75f902006-12-01 10:40:55 +01002115 rq->data_len = bio->bi_size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002116
2117 rq->bio = rq->biotail = bio;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002118
NeilBrown66846572007-08-16 13:31:28 +02002119 if (bio->bi_bdev)
2120 rq->rq_disk = bio->bi_bdev->bd_disk;
2121}
Linus Torvalds1da177e2005-04-16 15:20:36 -07002122
Kiyoshi Uedaef9e3fa2008-10-01 16:12:15 +02002123/**
2124 * blk_lld_busy - Check if underlying low-level drivers of a device are busy
2125 * @q : the queue of the device being checked
2126 *
2127 * Description:
2128 * Check if underlying low-level drivers of a device are busy.
2129 * If the drivers want to export their busy state, they must set own
2130 * exporting function using blk_queue_lld_busy() first.
2131 *
2132 * Basically, this function is used only by request stacking drivers
2133 * to stop dispatching requests to underlying devices when underlying
2134 * devices are busy. This behavior helps more I/O merging on the queue
2135 * of the request stacking driver and prevents I/O throughput regression
2136 * on burst I/O load.
2137 *
2138 * Return:
2139 * 0 - Not busy (The request stacking driver should dispatch request)
2140 * 1 - Busy (The request stacking driver should stop dispatching request)
2141 */
2142int blk_lld_busy(struct request_queue *q)
2143{
2144 if (q->lld_busy_fn)
2145 return q->lld_busy_fn(q);
2146
2147 return 0;
2148}
2149EXPORT_SYMBOL_GPL(blk_lld_busy);
2150
Jens Axboe18887ad2008-07-28 13:08:45 +02002151int kblockd_schedule_work(struct request_queue *q, struct work_struct *work)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002152{
2153 return queue_work(kblockd_workqueue, work);
2154}
Linus Torvalds1da177e2005-04-16 15:20:36 -07002155EXPORT_SYMBOL(kblockd_schedule_work);
2156
Linus Torvalds1da177e2005-04-16 15:20:36 -07002157int __init blk_dev_init(void)
2158{
2159 kblockd_workqueue = create_workqueue("kblockd");
2160 if (!kblockd_workqueue)
2161 panic("Failed to create kblockd\n");
2162
2163 request_cachep = kmem_cache_create("blkdev_requests",
Paul Mundt20c2df82007-07-20 10:11:58 +09002164 sizeof(struct request), 0, SLAB_PANIC, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002165
Jens Axboe8324aa92008-01-29 14:51:59 +01002166 blk_requestq_cachep = kmem_cache_create("blkdev_queue",
Jens Axboe165125e2007-07-24 09:28:11 +02002167 sizeof(struct request_queue), 0, SLAB_PANIC, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002168
Linus Torvalds1da177e2005-04-16 15:20:36 -07002169 return 0;
2170}
2171