Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | /* |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2 | * Copyright (C) 1991, 1992 Linus Torvalds |
| 3 | * Copyright (C) 1994, Karl Keyte: Added support for disk statistics |
| 4 | * Elevator latency, (C) 2000 Andrea Arcangeli <andrea@suse.de> SuSE |
| 5 | * Queue request tables / lock, selectable elevator, Jens Axboe <axboe@suse.de> |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 6 | * kernel-doc documentation started by NeilBrown <neilb@cse.unsw.edu.au> |
| 7 | * - July2000 |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 8 | * 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 Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 14 | #include <linux/kernel.h> |
| 15 | #include <linux/module.h> |
| 16 | #include <linux/backing-dev.h> |
| 17 | #include <linux/bio.h> |
| 18 | #include <linux/blkdev.h> |
| 19 | #include <linux/highmem.h> |
| 20 | #include <linux/mm.h> |
| 21 | #include <linux/kernel_stat.h> |
| 22 | #include <linux/string.h> |
| 23 | #include <linux/init.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 24 | #include <linux/completion.h> |
| 25 | #include <linux/slab.h> |
| 26 | #include <linux/swap.h> |
| 27 | #include <linux/writeback.h> |
Andrew Morton | faccbd4 | 2006-12-10 02:19:35 -0800 | [diff] [blame] | 28 | #include <linux/task_io_accounting_ops.h> |
Akinobu Mita | c17bb49 | 2006-12-08 02:39:46 -0800 | [diff] [blame] | 29 | #include <linux/fault-inject.h> |
Li Zefan | 5578213 | 2009-06-09 13:43:05 +0800 | [diff] [blame] | 30 | |
| 31 | #define CREATE_TRACE_POINTS |
| 32 | #include <trace/events/block.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 33 | |
Jens Axboe | 8324aa9 | 2008-01-29 14:51:59 +0100 | [diff] [blame] | 34 | #include "blk.h" |
| 35 | |
Ingo Molnar | 0bfc245 | 2008-11-26 11:59:56 +0100 | [diff] [blame] | 36 | EXPORT_TRACEPOINT_SYMBOL_GPL(block_remap); |
Jun'ichi Nomura | b0da3f0 | 2009-10-01 21:16:13 +0200 | [diff] [blame] | 37 | EXPORT_TRACEPOINT_SYMBOL_GPL(block_rq_remap); |
Li Zefan | 5578213 | 2009-06-09 13:43:05 +0800 | [diff] [blame] | 38 | EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_complete); |
Ingo Molnar | 0bfc245 | 2008-11-26 11:59:56 +0100 | [diff] [blame] | 39 | |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 40 | static int __make_request(struct request_queue *q, struct bio *bio); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 41 | |
| 42 | /* |
| 43 | * For the allocated request tables |
| 44 | */ |
Adrian Bunk | 5ece6c5 | 2008-02-18 13:45:51 +0100 | [diff] [blame] | 45 | static struct kmem_cache *request_cachep; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 46 | |
| 47 | /* |
| 48 | * For queue allocation |
| 49 | */ |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 50 | struct kmem_cache *blk_requestq_cachep; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 51 | |
| 52 | /* |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 53 | * Controlling structure to kblockd |
| 54 | */ |
Jens Axboe | ff856ba | 2006-01-09 16:02:34 +0100 | [diff] [blame] | 55 | static struct workqueue_struct *kblockd_workqueue; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 56 | |
Jens Axboe | 26b8256 | 2008-01-29 13:54:41 +0100 | [diff] [blame] | 57 | static void drive_stat_acct(struct request *rq, int new_io) |
| 58 | { |
Jens Axboe | 28f1370 | 2008-05-07 10:15:46 +0200 | [diff] [blame] | 59 | struct hd_struct *part; |
Jens Axboe | 26b8256 | 2008-01-29 13:54:41 +0100 | [diff] [blame] | 60 | int rw = rq_data_dir(rq); |
Tejun Heo | c995905 | 2008-08-25 19:47:21 +0900 | [diff] [blame] | 61 | int cpu; |
Jens Axboe | 26b8256 | 2008-01-29 13:54:41 +0100 | [diff] [blame] | 62 | |
Jens Axboe | c2553b5 | 2009-04-24 08:10:11 +0200 | [diff] [blame] | 63 | if (!blk_do_io_stat(rq)) |
Jens Axboe | 26b8256 | 2008-01-29 13:54:41 +0100 | [diff] [blame] | 64 | return; |
| 65 | |
Tejun Heo | 074a7ac | 2008-08-25 19:56:14 +0900 | [diff] [blame] | 66 | cpu = part_stat_lock(); |
Tejun Heo | 83096eb | 2009-05-07 22:24:39 +0900 | [diff] [blame] | 67 | part = disk_map_sector_rcu(rq->rq_disk, blk_rq_pos(rq)); |
Tejun Heo | c995905 | 2008-08-25 19:47:21 +0900 | [diff] [blame] | 68 | |
Jens Axboe | 28f1370 | 2008-05-07 10:15:46 +0200 | [diff] [blame] | 69 | if (!new_io) |
Tejun Heo | 074a7ac | 2008-08-25 19:56:14 +0900 | [diff] [blame] | 70 | part_stat_inc(cpu, part, merges[rw]); |
Jens Axboe | 28f1370 | 2008-05-07 10:15:46 +0200 | [diff] [blame] | 71 | else { |
Tejun Heo | 074a7ac | 2008-08-25 19:56:14 +0900 | [diff] [blame] | 72 | part_round_stats(cpu, part); |
Nikanth Karthikesan | 316d315 | 2009-10-06 20:16:55 +0200 | [diff] [blame] | 73 | part_inc_in_flight(part, rw); |
Jens Axboe | 26b8256 | 2008-01-29 13:54:41 +0100 | [diff] [blame] | 74 | } |
Tejun Heo | e71bf0d | 2008-09-03 09:03:02 +0200 | [diff] [blame] | 75 | |
Tejun Heo | 074a7ac | 2008-08-25 19:56:14 +0900 | [diff] [blame] | 76 | part_stat_unlock(); |
Jens Axboe | 26b8256 | 2008-01-29 13:54:41 +0100 | [diff] [blame] | 77 | } |
| 78 | |
Jens Axboe | 8324aa9 | 2008-01-29 14:51:59 +0100 | [diff] [blame] | 79 | void blk_queue_congestion_threshold(struct request_queue *q) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 80 | { |
| 81 | int nr; |
| 82 | |
| 83 | nr = q->nr_requests - (q->nr_requests / 8) + 1; |
| 84 | if (nr > q->nr_requests) |
| 85 | nr = q->nr_requests; |
| 86 | q->nr_congestion_on = nr; |
| 87 | |
| 88 | nr = q->nr_requests - (q->nr_requests / 8) - (q->nr_requests / 16) - 1; |
| 89 | if (nr < 1) |
| 90 | nr = 1; |
| 91 | q->nr_congestion_off = nr; |
| 92 | } |
| 93 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 94 | /** |
| 95 | * blk_get_backing_dev_info - get the address of a queue's backing_dev_info |
| 96 | * @bdev: device |
| 97 | * |
| 98 | * Locates the passed device's request queue and returns the address of its |
| 99 | * backing_dev_info |
| 100 | * |
| 101 | * Will return NULL if the request queue cannot be located. |
| 102 | */ |
| 103 | struct backing_dev_info *blk_get_backing_dev_info(struct block_device *bdev) |
| 104 | { |
| 105 | struct backing_dev_info *ret = NULL; |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 106 | struct request_queue *q = bdev_get_queue(bdev); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 107 | |
| 108 | if (q) |
| 109 | ret = &q->backing_dev_info; |
| 110 | return ret; |
| 111 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 112 | EXPORT_SYMBOL(blk_get_backing_dev_info); |
| 113 | |
FUJITA Tomonori | 2a4aa30 | 2008-04-29 09:54:36 +0200 | [diff] [blame] | 114 | void blk_rq_init(struct request_queue *q, struct request *rq) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 115 | { |
FUJITA Tomonori | 1afb20f | 2008-04-25 12:26:28 +0200 | [diff] [blame] | 116 | memset(rq, 0, sizeof(*rq)); |
| 117 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 118 | INIT_LIST_HEAD(&rq->queuelist); |
Jens Axboe | 242f9dc | 2008-09-14 05:55:09 -0700 | [diff] [blame] | 119 | INIT_LIST_HEAD(&rq->timeout_list); |
Jens Axboe | c7c22e4 | 2008-09-13 20:26:01 +0200 | [diff] [blame] | 120 | rq->cpu = -1; |
Jens Axboe | 63a7138 | 2008-02-08 12:41:03 +0100 | [diff] [blame] | 121 | rq->q = q; |
Tejun Heo | a2dec7b | 2009-05-07 22:24:44 +0900 | [diff] [blame] | 122 | rq->__sector = (sector_t) -1; |
Jens Axboe | 2e662b6 | 2006-07-13 11:55:04 +0200 | [diff] [blame] | 123 | INIT_HLIST_NODE(&rq->hash); |
| 124 | RB_CLEAR_NODE(&rq->rb_node); |
FUJITA Tomonori | d7e3c32 | 2008-04-29 09:54:39 +0200 | [diff] [blame] | 125 | rq->cmd = rq->__cmd; |
Li Zefan | e2494e1 | 2009-04-02 13:43:26 +0800 | [diff] [blame] | 126 | rq->cmd_len = BLK_MAX_CDB; |
Jens Axboe | 63a7138 | 2008-02-08 12:41:03 +0100 | [diff] [blame] | 127 | rq->tag = -1; |
Jens Axboe | 63a7138 | 2008-02-08 12:41:03 +0100 | [diff] [blame] | 128 | rq->ref_count = 1; |
Tejun Heo | b243ddc | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 129 | rq->start_time = jiffies; |
Divyesh Shah | 9195291 | 2010-04-01 15:01:41 -0700 | [diff] [blame] | 130 | set_start_time_ns(rq); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 131 | } |
FUJITA Tomonori | 2a4aa30 | 2008-04-29 09:54:36 +0200 | [diff] [blame] | 132 | EXPORT_SYMBOL(blk_rq_init); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 133 | |
NeilBrown | 5bb23a6 | 2007-09-27 12:46:13 +0200 | [diff] [blame] | 134 | static void req_bio_endio(struct request *rq, struct bio *bio, |
| 135 | unsigned int nbytes, int error) |
Tejun Heo | 797e7db | 2006-01-06 09:51:03 +0100 | [diff] [blame] | 136 | { |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 137 | struct request_queue *q = rq->q; |
Tejun Heo | 797e7db | 2006-01-06 09:51:03 +0100 | [diff] [blame] | 138 | |
NeilBrown | 5bb23a6 | 2007-09-27 12:46:13 +0200 | [diff] [blame] | 139 | if (&q->bar_rq != rq) { |
| 140 | if (error) |
| 141 | clear_bit(BIO_UPTODATE, &bio->bi_flags); |
| 142 | else if (!test_bit(BIO_UPTODATE, &bio->bi_flags)) |
| 143 | error = -EIO; |
Tejun Heo | 797e7db | 2006-01-06 09:51:03 +0100 | [diff] [blame] | 144 | |
NeilBrown | 5bb23a6 | 2007-09-27 12:46:13 +0200 | [diff] [blame] | 145 | if (unlikely(nbytes > bio->bi_size)) { |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 146 | printk(KERN_ERR "%s: want %u bytes done, %u left\n", |
Harvey Harrison | 24c03d4 | 2008-05-01 04:35:17 -0700 | [diff] [blame] | 147 | __func__, nbytes, bio->bi_size); |
NeilBrown | 5bb23a6 | 2007-09-27 12:46:13 +0200 | [diff] [blame] | 148 | nbytes = bio->bi_size; |
| 149 | } |
Tejun Heo | 797e7db | 2006-01-06 09:51:03 +0100 | [diff] [blame] | 150 | |
Keith Mannthey | 08bafc0 | 2008-11-25 10:24:35 +0100 | [diff] [blame] | 151 | if (unlikely(rq->cmd_flags & REQ_QUIET)) |
| 152 | set_bit(BIO_QUIET, &bio->bi_flags); |
| 153 | |
NeilBrown | 5bb23a6 | 2007-09-27 12:46:13 +0200 | [diff] [blame] | 154 | bio->bi_size -= nbytes; |
| 155 | bio->bi_sector += (nbytes >> 9); |
Martin K. Petersen | 7ba1ba1 | 2008-06-30 20:04:41 +0200 | [diff] [blame] | 156 | |
| 157 | if (bio_integrity(bio)) |
| 158 | bio_integrity_advance(bio, nbytes); |
| 159 | |
NeilBrown | 5bb23a6 | 2007-09-27 12:46:13 +0200 | [diff] [blame] | 160 | if (bio->bi_size == 0) |
NeilBrown | 6712ecf | 2007-09-27 12:47:43 +0200 | [diff] [blame] | 161 | bio_endio(bio, error); |
NeilBrown | 5bb23a6 | 2007-09-27 12:46:13 +0200 | [diff] [blame] | 162 | } else { |
| 163 | |
| 164 | /* |
| 165 | * Okay, this is the barrier request in progress, just |
| 166 | * record the error; |
| 167 | */ |
| 168 | if (error && !q->orderr) |
| 169 | q->orderr = error; |
| 170 | } |
Tejun Heo | 797e7db | 2006-01-06 09:51:03 +0100 | [diff] [blame] | 171 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 172 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 173 | void blk_dump_rq_flags(struct request *rq, char *msg) |
| 174 | { |
| 175 | int bit; |
| 176 | |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 177 | printk(KERN_INFO "%s: dev %s: type=%x, flags=%x\n", msg, |
Jens Axboe | 4aff5e2 | 2006-08-10 08:44:47 +0200 | [diff] [blame] | 178 | rq->rq_disk ? rq->rq_disk->disk_name : "?", rq->cmd_type, |
| 179 | rq->cmd_flags); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 180 | |
Tejun Heo | 83096eb | 2009-05-07 22:24:39 +0900 | [diff] [blame] | 181 | printk(KERN_INFO " sector %llu, nr/cnr %u/%u\n", |
| 182 | (unsigned long long)blk_rq_pos(rq), |
| 183 | blk_rq_sectors(rq), blk_rq_cur_sectors(rq)); |
Tejun Heo | 731ec49 | 2009-04-23 11:05:20 +0900 | [diff] [blame] | 184 | printk(KERN_INFO " bio %p, biotail %p, buffer %p, len %u\n", |
Tejun Heo | 2e46e8b | 2009-05-07 22:24:41 +0900 | [diff] [blame] | 185 | rq->bio, rq->biotail, rq->buffer, blk_rq_bytes(rq)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 186 | |
Christoph Hellwig | 33659eb | 2010-08-07 18:17:56 +0200 | [diff] [blame] | 187 | if (rq->cmd_type == REQ_TYPE_BLOCK_PC) { |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 188 | printk(KERN_INFO " cdb: "); |
FUJITA Tomonori | d34c87e | 2008-04-29 14:37:52 +0200 | [diff] [blame] | 189 | for (bit = 0; bit < BLK_MAX_CDB; bit++) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 190 | printk("%02x ", rq->cmd[bit]); |
| 191 | printk("\n"); |
| 192 | } |
| 193 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 194 | EXPORT_SYMBOL(blk_dump_rq_flags); |
| 195 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 196 | /* |
| 197 | * "plug" the device if there are no outstanding requests: this will |
| 198 | * force the transfer to start only after we have put all the requests |
| 199 | * on the list. |
| 200 | * |
| 201 | * This is called with interrupts off and no requests on the queue and |
| 202 | * with the queue lock held. |
| 203 | */ |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 204 | void blk_plug_device(struct request_queue *q) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 205 | { |
| 206 | WARN_ON(!irqs_disabled()); |
| 207 | |
| 208 | /* |
| 209 | * don't plug a stopped queue, it must be paired with blk_start_queue() |
| 210 | * which will restart the queueing |
| 211 | */ |
Coywolf Qi Hunt | 7daac49 | 2006-04-19 10:14:49 +0200 | [diff] [blame] | 212 | if (blk_queue_stopped(q)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 213 | return; |
| 214 | |
Jens Axboe | e48ec69 | 2008-07-03 13:18:54 +0200 | [diff] [blame] | 215 | if (!queue_flag_test_and_set(QUEUE_FLAG_PLUGGED, q)) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 216 | mod_timer(&q->unplug_timer, jiffies + q->unplug_delay); |
Arnaldo Carvalho de Melo | 5f3ea37 | 2008-10-30 08:34:33 +0100 | [diff] [blame] | 217 | trace_block_plug(q); |
Jens Axboe | 2056a78 | 2006-03-23 20:00:26 +0100 | [diff] [blame] | 218 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 219 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 220 | EXPORT_SYMBOL(blk_plug_device); |
| 221 | |
Jens Axboe | 6c5e0c4 | 2008-08-01 20:31:32 +0200 | [diff] [blame] | 222 | /** |
| 223 | * blk_plug_device_unlocked - plug a device without queue lock held |
| 224 | * @q: The &struct request_queue to plug |
| 225 | * |
| 226 | * Description: |
| 227 | * Like @blk_plug_device(), but grabs the queue lock and disables |
| 228 | * interrupts. |
| 229 | **/ |
| 230 | void blk_plug_device_unlocked(struct request_queue *q) |
| 231 | { |
| 232 | unsigned long flags; |
| 233 | |
| 234 | spin_lock_irqsave(q->queue_lock, flags); |
| 235 | blk_plug_device(q); |
| 236 | spin_unlock_irqrestore(q->queue_lock, flags); |
| 237 | } |
| 238 | EXPORT_SYMBOL(blk_plug_device_unlocked); |
| 239 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 240 | /* |
| 241 | * remove the queue from the plugged list, if present. called with |
| 242 | * queue lock held and interrupts disabled. |
| 243 | */ |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 244 | int blk_remove_plug(struct request_queue *q) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 245 | { |
| 246 | WARN_ON(!irqs_disabled()); |
| 247 | |
Jens Axboe | e48ec69 | 2008-07-03 13:18:54 +0200 | [diff] [blame] | 248 | if (!queue_flag_test_and_clear(QUEUE_FLAG_PLUGGED, q)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 249 | return 0; |
| 250 | |
| 251 | del_timer(&q->unplug_timer); |
| 252 | return 1; |
| 253 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 254 | EXPORT_SYMBOL(blk_remove_plug); |
| 255 | |
| 256 | /* |
| 257 | * remove the plug and let it rip.. |
| 258 | */ |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 259 | void __generic_unplug_device(struct request_queue *q) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 260 | { |
Coywolf Qi Hunt | 7daac49 | 2006-04-19 10:14:49 +0200 | [diff] [blame] | 261 | if (unlikely(blk_queue_stopped(q))) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 262 | return; |
Jens Axboe | a31a973 | 2008-10-17 13:58:29 +0200 | [diff] [blame] | 263 | if (!blk_remove_plug(q) && !blk_queue_nonrot(q)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 264 | return; |
| 265 | |
Jens Axboe | 22e2c50 | 2005-06-27 10:55:12 +0200 | [diff] [blame] | 266 | q->request_fn(q); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 267 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 268 | |
| 269 | /** |
| 270 | * generic_unplug_device - fire a request queue |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 271 | * @q: The &struct request_queue in question |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 272 | * |
| 273 | * Description: |
| 274 | * Linux uses plugging to build bigger requests queues before letting |
| 275 | * the device have at them. If a queue is plugged, the I/O scheduler |
| 276 | * is still adding and merging requests on the queue. Once the queue |
| 277 | * gets unplugged, the request_fn defined for the queue is invoked and |
| 278 | * transfers started. |
| 279 | **/ |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 280 | void generic_unplug_device(struct request_queue *q) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 281 | { |
Jens Axboe | dbaf2c0 | 2008-05-07 09:48:17 +0200 | [diff] [blame] | 282 | if (blk_queue_plugged(q)) { |
| 283 | spin_lock_irq(q->queue_lock); |
| 284 | __generic_unplug_device(q); |
| 285 | spin_unlock_irq(q->queue_lock); |
| 286 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 287 | } |
| 288 | EXPORT_SYMBOL(generic_unplug_device); |
| 289 | |
| 290 | static void blk_backing_dev_unplug(struct backing_dev_info *bdi, |
| 291 | struct page *page) |
| 292 | { |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 293 | struct request_queue *q = bdi->unplug_io_data; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 294 | |
Alan D. Brunelle | 2ad8b1e | 2007-11-07 14:26:56 -0500 | [diff] [blame] | 295 | blk_unplug(q); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 296 | } |
| 297 | |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 298 | void blk_unplug_work(struct work_struct *work) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 299 | { |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 300 | struct request_queue *q = |
| 301 | container_of(work, struct request_queue, unplug_work); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 302 | |
Arnaldo Carvalho de Melo | 5f3ea37 | 2008-10-30 08:34:33 +0100 | [diff] [blame] | 303 | trace_block_unplug_io(q); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 304 | q->unplug_fn(q); |
| 305 | } |
| 306 | |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 307 | void blk_unplug_timeout(unsigned long data) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 308 | { |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 309 | struct request_queue *q = (struct request_queue *)data; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 310 | |
Arnaldo Carvalho de Melo | 5f3ea37 | 2008-10-30 08:34:33 +0100 | [diff] [blame] | 311 | trace_block_unplug_timer(q); |
Jens Axboe | 18887ad | 2008-07-28 13:08:45 +0200 | [diff] [blame] | 312 | kblockd_schedule_work(q, &q->unplug_work); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 313 | } |
| 314 | |
Alan D. Brunelle | 2ad8b1e | 2007-11-07 14:26:56 -0500 | [diff] [blame] | 315 | void blk_unplug(struct request_queue *q) |
| 316 | { |
| 317 | /* |
| 318 | * devices don't necessarily have an ->unplug_fn defined |
| 319 | */ |
| 320 | if (q->unplug_fn) { |
Arnaldo Carvalho de Melo | 5f3ea37 | 2008-10-30 08:34:33 +0100 | [diff] [blame] | 321 | trace_block_unplug_io(q); |
Alan D. Brunelle | 2ad8b1e | 2007-11-07 14:26:56 -0500 | [diff] [blame] | 322 | q->unplug_fn(q); |
| 323 | } |
| 324 | } |
| 325 | EXPORT_SYMBOL(blk_unplug); |
| 326 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 327 | /** |
| 328 | * blk_start_queue - restart a previously stopped queue |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 329 | * @q: The &struct request_queue in question |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 330 | * |
| 331 | * Description: |
| 332 | * blk_start_queue() will clear the stop flag on the queue, and call |
| 333 | * the request_fn for the queue if it was in a stopped state when |
| 334 | * entered. Also see blk_stop_queue(). Queue lock must be held. |
| 335 | **/ |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 336 | void blk_start_queue(struct request_queue *q) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 337 | { |
Paolo 'Blaisorblade' Giarrusso | a038e25 | 2006-06-05 12:09:01 +0200 | [diff] [blame] | 338 | WARN_ON(!irqs_disabled()); |
| 339 | |
Nick Piggin | 75ad23b | 2008-04-29 14:48:33 +0200 | [diff] [blame] | 340 | queue_flag_clear(QUEUE_FLAG_STOPPED, q); |
Tejun Heo | a538cd0 | 2009-04-23 11:05:17 +0900 | [diff] [blame] | 341 | __blk_run_queue(q); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 342 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 343 | EXPORT_SYMBOL(blk_start_queue); |
| 344 | |
| 345 | /** |
| 346 | * blk_stop_queue - stop a queue |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 347 | * @q: The &struct request_queue in question |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 348 | * |
| 349 | * Description: |
| 350 | * The Linux block layer assumes that a block driver will consume all |
| 351 | * entries on the request queue when the request_fn strategy is called. |
| 352 | * Often this will not happen, because of hardware limitations (queue |
| 353 | * depth settings). If a device driver gets a 'queue full' response, |
| 354 | * or if it simply chooses not to queue more I/O at one point, it can |
| 355 | * call this function to prevent the request_fn from being called until |
| 356 | * the driver has signalled it's ready to go again. This happens by calling |
| 357 | * blk_start_queue() to restart queue operations. Queue lock must be held. |
| 358 | **/ |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 359 | void blk_stop_queue(struct request_queue *q) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 360 | { |
| 361 | blk_remove_plug(q); |
Nick Piggin | 75ad23b | 2008-04-29 14:48:33 +0200 | [diff] [blame] | 362 | queue_flag_set(QUEUE_FLAG_STOPPED, q); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 363 | } |
| 364 | EXPORT_SYMBOL(blk_stop_queue); |
| 365 | |
| 366 | /** |
| 367 | * blk_sync_queue - cancel any pending callbacks on a queue |
| 368 | * @q: the queue |
| 369 | * |
| 370 | * Description: |
| 371 | * The block layer may perform asynchronous callback activity |
| 372 | * on a queue, such as calling the unplug function after a timeout. |
| 373 | * A block device may call blk_sync_queue to ensure that any |
| 374 | * such activity is cancelled, thus allowing it to release resources |
Michael Opdenacker | 59c5159 | 2007-05-09 08:57:56 +0200 | [diff] [blame] | 375 | * that the callbacks might use. The caller must already have made sure |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 376 | * that its ->make_request_fn will not re-add plugging prior to calling |
| 377 | * this function. |
| 378 | * |
| 379 | */ |
| 380 | void blk_sync_queue(struct request_queue *q) |
| 381 | { |
| 382 | del_timer_sync(&q->unplug_timer); |
Jens Axboe | 70ed28b | 2008-11-19 14:38:39 +0100 | [diff] [blame] | 383 | del_timer_sync(&q->timeout); |
Cheng Renquan | 64d01dc | 2008-12-03 12:41:39 +0100 | [diff] [blame] | 384 | cancel_work_sync(&q->unplug_work); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 385 | } |
| 386 | EXPORT_SYMBOL(blk_sync_queue); |
| 387 | |
| 388 | /** |
Jens Axboe | 80a4b58 | 2008-10-14 09:51:06 +0200 | [diff] [blame] | 389 | * __blk_run_queue - run a single device queue |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 390 | * @q: The queue to run |
Jens Axboe | 80a4b58 | 2008-10-14 09:51:06 +0200 | [diff] [blame] | 391 | * |
| 392 | * Description: |
| 393 | * See @blk_run_queue. This variant must be called with the queue lock |
| 394 | * held and interrupts disabled. |
| 395 | * |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 396 | */ |
Nick Piggin | 75ad23b | 2008-04-29 14:48:33 +0200 | [diff] [blame] | 397 | void __blk_run_queue(struct request_queue *q) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 398 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 399 | blk_remove_plug(q); |
Jens Axboe | dac07ec | 2006-05-11 08:20:16 +0200 | [diff] [blame] | 400 | |
Tejun Heo | a538cd0 | 2009-04-23 11:05:17 +0900 | [diff] [blame] | 401 | if (unlikely(blk_queue_stopped(q))) |
| 402 | return; |
| 403 | |
| 404 | if (elv_queue_empty(q)) |
| 405 | return; |
| 406 | |
Jens Axboe | dac07ec | 2006-05-11 08:20:16 +0200 | [diff] [blame] | 407 | /* |
| 408 | * Only recurse once to avoid overrunning the stack, let the unplug |
| 409 | * handling reinvoke the handler shortly if we already got there. |
| 410 | */ |
Tejun Heo | a538cd0 | 2009-04-23 11:05:17 +0900 | [diff] [blame] | 411 | if (!queue_flag_test_and_set(QUEUE_FLAG_REENTER, q)) { |
| 412 | q->request_fn(q); |
| 413 | queue_flag_clear(QUEUE_FLAG_REENTER, q); |
| 414 | } else { |
| 415 | queue_flag_set(QUEUE_FLAG_PLUGGED, q); |
| 416 | kblockd_schedule_work(q, &q->unplug_work); |
| 417 | } |
Nick Piggin | 75ad23b | 2008-04-29 14:48:33 +0200 | [diff] [blame] | 418 | } |
| 419 | EXPORT_SYMBOL(__blk_run_queue); |
Jens Axboe | dac07ec | 2006-05-11 08:20:16 +0200 | [diff] [blame] | 420 | |
Nick Piggin | 75ad23b | 2008-04-29 14:48:33 +0200 | [diff] [blame] | 421 | /** |
| 422 | * blk_run_queue - run a single device queue |
| 423 | * @q: The queue to run |
Jens Axboe | 80a4b58 | 2008-10-14 09:51:06 +0200 | [diff] [blame] | 424 | * |
| 425 | * Description: |
| 426 | * Invoke request handling on this queue, if it has pending work to do. |
Tejun Heo | a7f5579 | 2009-04-23 11:05:17 +0900 | [diff] [blame] | 427 | * May be used to restart queueing when a request has completed. |
Nick Piggin | 75ad23b | 2008-04-29 14:48:33 +0200 | [diff] [blame] | 428 | */ |
| 429 | void blk_run_queue(struct request_queue *q) |
| 430 | { |
| 431 | unsigned long flags; |
| 432 | |
| 433 | spin_lock_irqsave(q->queue_lock, flags); |
| 434 | __blk_run_queue(q); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 435 | spin_unlock_irqrestore(q->queue_lock, flags); |
| 436 | } |
| 437 | EXPORT_SYMBOL(blk_run_queue); |
| 438 | |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 439 | void blk_put_queue(struct request_queue *q) |
Al Viro | 483f4af | 2006-03-18 18:34:37 -0500 | [diff] [blame] | 440 | { |
| 441 | kobject_put(&q->kobj); |
| 442 | } |
Al Viro | 483f4af | 2006-03-18 18:34:37 -0500 | [diff] [blame] | 443 | |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 444 | void blk_cleanup_queue(struct request_queue *q) |
Al Viro | 483f4af | 2006-03-18 18:34:37 -0500 | [diff] [blame] | 445 | { |
Jens Axboe | e3335de | 2008-09-18 09:22:54 -0700 | [diff] [blame] | 446 | /* |
| 447 | * We know we have process context here, so we can be a little |
| 448 | * cautious and ensure that pending block actions on this device |
| 449 | * are done before moving on. Going into this function, we should |
| 450 | * not have processes doing IO to this device. |
| 451 | */ |
| 452 | blk_sync_queue(q); |
| 453 | |
Matthew Garrett | 31373d0 | 2010-04-06 14:25:14 +0200 | [diff] [blame] | 454 | del_timer_sync(&q->backing_dev_info.laptop_mode_wb_timer); |
Al Viro | 483f4af | 2006-03-18 18:34:37 -0500 | [diff] [blame] | 455 | mutex_lock(&q->sysfs_lock); |
Nick Piggin | 75ad23b | 2008-04-29 14:48:33 +0200 | [diff] [blame] | 456 | queue_flag_set_unlocked(QUEUE_FLAG_DEAD, q); |
Al Viro | 483f4af | 2006-03-18 18:34:37 -0500 | [diff] [blame] | 457 | mutex_unlock(&q->sysfs_lock); |
| 458 | |
| 459 | if (q->elevator) |
| 460 | elevator_exit(q->elevator); |
| 461 | |
| 462 | blk_put_queue(q); |
| 463 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 464 | EXPORT_SYMBOL(blk_cleanup_queue); |
| 465 | |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 466 | static int blk_init_free_list(struct request_queue *q) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 467 | { |
| 468 | struct request_list *rl = &q->rq; |
| 469 | |
Mike Snitzer | 1abec4f | 2010-05-25 13:15:15 -0400 | [diff] [blame] | 470 | if (unlikely(rl->rq_pool)) |
| 471 | return 0; |
| 472 | |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 473 | rl->count[BLK_RW_SYNC] = rl->count[BLK_RW_ASYNC] = 0; |
| 474 | rl->starved[BLK_RW_SYNC] = rl->starved[BLK_RW_ASYNC] = 0; |
Tejun Heo | cb98fc8 | 2005-10-28 08:29:39 +0200 | [diff] [blame] | 475 | rl->elvpriv = 0; |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 476 | init_waitqueue_head(&rl->wait[BLK_RW_SYNC]); |
| 477 | init_waitqueue_head(&rl->wait[BLK_RW_ASYNC]); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 478 | |
Christoph Lameter | 1946089 | 2005-06-23 00:08:19 -0700 | [diff] [blame] | 479 | rl->rq_pool = mempool_create_node(BLKDEV_MIN_RQ, mempool_alloc_slab, |
| 480 | mempool_free_slab, request_cachep, q->node); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 481 | |
| 482 | if (!rl->rq_pool) |
| 483 | return -ENOMEM; |
| 484 | |
| 485 | return 0; |
| 486 | } |
| 487 | |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 488 | struct request_queue *blk_alloc_queue(gfp_t gfp_mask) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 489 | { |
Christoph Lameter | 1946089 | 2005-06-23 00:08:19 -0700 | [diff] [blame] | 490 | return blk_alloc_queue_node(gfp_mask, -1); |
| 491 | } |
| 492 | EXPORT_SYMBOL(blk_alloc_queue); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 493 | |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 494 | struct request_queue *blk_alloc_queue_node(gfp_t gfp_mask, int node_id) |
Christoph Lameter | 1946089 | 2005-06-23 00:08:19 -0700 | [diff] [blame] | 495 | { |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 496 | struct request_queue *q; |
Peter Zijlstra | e0bf68d | 2007-10-16 23:25:46 -0700 | [diff] [blame] | 497 | int err; |
Christoph Lameter | 1946089 | 2005-06-23 00:08:19 -0700 | [diff] [blame] | 498 | |
Jens Axboe | 8324aa9 | 2008-01-29 14:51:59 +0100 | [diff] [blame] | 499 | q = kmem_cache_alloc_node(blk_requestq_cachep, |
Christoph Lameter | 94f6030 | 2007-07-17 04:03:29 -0700 | [diff] [blame] | 500 | gfp_mask | __GFP_ZERO, node_id); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 501 | if (!q) |
| 502 | return NULL; |
| 503 | |
Peter Zijlstra | e0bf68d | 2007-10-16 23:25:46 -0700 | [diff] [blame] | 504 | q->backing_dev_info.unplug_io_fn = blk_backing_dev_unplug; |
| 505 | q->backing_dev_info.unplug_io_data = q; |
Jens Axboe | 0989a02 | 2009-06-12 14:42:56 +0200 | [diff] [blame] | 506 | q->backing_dev_info.ra_pages = |
| 507 | (VM_MAX_READAHEAD * 1024) / PAGE_CACHE_SIZE; |
| 508 | q->backing_dev_info.state = 0; |
| 509 | q->backing_dev_info.capabilities = BDI_CAP_MAP_COPY; |
Jens Axboe | d993831 | 2009-06-12 14:45:52 +0200 | [diff] [blame] | 510 | q->backing_dev_info.name = "block"; |
Jens Axboe | 0989a02 | 2009-06-12 14:42:56 +0200 | [diff] [blame] | 511 | |
Peter Zijlstra | e0bf68d | 2007-10-16 23:25:46 -0700 | [diff] [blame] | 512 | err = bdi_init(&q->backing_dev_info); |
| 513 | if (err) { |
Jens Axboe | 8324aa9 | 2008-01-29 14:51:59 +0100 | [diff] [blame] | 514 | kmem_cache_free(blk_requestq_cachep, q); |
Peter Zijlstra | e0bf68d | 2007-10-16 23:25:46 -0700 | [diff] [blame] | 515 | return NULL; |
| 516 | } |
| 517 | |
Matthew Garrett | 31373d0 | 2010-04-06 14:25:14 +0200 | [diff] [blame] | 518 | setup_timer(&q->backing_dev_info.laptop_mode_wb_timer, |
| 519 | laptop_mode_timer_fn, (unsigned long) q); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 520 | init_timer(&q->unplug_timer); |
Jens Axboe | 242f9dc | 2008-09-14 05:55:09 -0700 | [diff] [blame] | 521 | setup_timer(&q->timeout, blk_rq_timed_out_timer, (unsigned long) q); |
| 522 | INIT_LIST_HEAD(&q->timeout_list); |
Peter Zijlstra | 713ada9 | 2008-10-16 13:44:57 +0200 | [diff] [blame] | 523 | INIT_WORK(&q->unplug_work, blk_unplug_work); |
Al Viro | 483f4af | 2006-03-18 18:34:37 -0500 | [diff] [blame] | 524 | |
Jens Axboe | 8324aa9 | 2008-01-29 14:51:59 +0100 | [diff] [blame] | 525 | kobject_init(&q->kobj, &blk_queue_ktype); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 526 | |
Al Viro | 483f4af | 2006-03-18 18:34:37 -0500 | [diff] [blame] | 527 | mutex_init(&q->sysfs_lock); |
Neil Brown | e7e72bf | 2008-05-14 16:05:54 -0700 | [diff] [blame] | 528 | spin_lock_init(&q->__queue_lock); |
Al Viro | 483f4af | 2006-03-18 18:34:37 -0500 | [diff] [blame] | 529 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 530 | return q; |
| 531 | } |
Christoph Lameter | 1946089 | 2005-06-23 00:08:19 -0700 | [diff] [blame] | 532 | EXPORT_SYMBOL(blk_alloc_queue_node); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 533 | |
| 534 | /** |
| 535 | * blk_init_queue - prepare a request queue for use with a block device |
| 536 | * @rfn: The function to be called to process requests that have been |
| 537 | * placed on the queue. |
| 538 | * @lock: Request queue spin lock |
| 539 | * |
| 540 | * Description: |
| 541 | * If a block device wishes to use the standard request handling procedures, |
| 542 | * which sorts requests and coalesces adjacent requests, then it must |
| 543 | * call blk_init_queue(). The function @rfn will be called when there |
| 544 | * are requests on the queue that need to be processed. If the device |
| 545 | * supports plugging, then @rfn may not be called immediately when requests |
| 546 | * are available on the queue, but may be called at some time later instead. |
| 547 | * Plugged queues are generally unplugged when a buffer belonging to one |
| 548 | * of the requests on the queue is needed, or due to memory pressure. |
| 549 | * |
| 550 | * @rfn is not required, or even expected, to remove all requests off the |
| 551 | * queue, but only as many as it can handle at a time. If it does leave |
| 552 | * requests on the queue, it is responsible for arranging that the requests |
| 553 | * get dealt with eventually. |
| 554 | * |
| 555 | * The queue spin lock must be held while manipulating the requests on the |
Paolo 'Blaisorblade' Giarrusso | a038e25 | 2006-06-05 12:09:01 +0200 | [diff] [blame] | 556 | * request queue; this lock will be taken also from interrupt context, so irq |
| 557 | * disabling is needed for it. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 558 | * |
Randy Dunlap | 710027a | 2008-08-19 20:13:11 +0200 | [diff] [blame] | 559 | * Function returns a pointer to the initialized request queue, or %NULL if |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 560 | * it didn't succeed. |
| 561 | * |
| 562 | * Note: |
| 563 | * blk_init_queue() must be paired with a blk_cleanup_queue() call |
| 564 | * when the block device is deactivated (such as at module unload). |
| 565 | **/ |
Christoph Lameter | 1946089 | 2005-06-23 00:08:19 -0700 | [diff] [blame] | 566 | |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 567 | struct request_queue *blk_init_queue(request_fn_proc *rfn, spinlock_t *lock) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 568 | { |
Christoph Lameter | 1946089 | 2005-06-23 00:08:19 -0700 | [diff] [blame] | 569 | return blk_init_queue_node(rfn, lock, -1); |
| 570 | } |
| 571 | EXPORT_SYMBOL(blk_init_queue); |
| 572 | |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 573 | struct request_queue * |
Christoph Lameter | 1946089 | 2005-06-23 00:08:19 -0700 | [diff] [blame] | 574 | blk_init_queue_node(request_fn_proc *rfn, spinlock_t *lock, int node_id) |
| 575 | { |
Mike Snitzer | c86d1b8 | 2010-06-03 11:34:52 -0600 | [diff] [blame] | 576 | struct request_queue *uninit_q, *q; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 577 | |
Mike Snitzer | c86d1b8 | 2010-06-03 11:34:52 -0600 | [diff] [blame] | 578 | uninit_q = blk_alloc_queue_node(GFP_KERNEL, node_id); |
| 579 | if (!uninit_q) |
| 580 | return NULL; |
| 581 | |
| 582 | q = blk_init_allocated_queue_node(uninit_q, rfn, lock, node_id); |
| 583 | if (!q) |
| 584 | blk_cleanup_queue(uninit_q); |
| 585 | |
| 586 | return q; |
Mike Snitzer | 01effb0 | 2010-05-11 08:57:42 +0200 | [diff] [blame] | 587 | } |
| 588 | EXPORT_SYMBOL(blk_init_queue_node); |
| 589 | |
| 590 | struct request_queue * |
| 591 | blk_init_allocated_queue(struct request_queue *q, request_fn_proc *rfn, |
| 592 | spinlock_t *lock) |
| 593 | { |
| 594 | return blk_init_allocated_queue_node(q, rfn, lock, -1); |
| 595 | } |
| 596 | EXPORT_SYMBOL(blk_init_allocated_queue); |
| 597 | |
| 598 | struct request_queue * |
| 599 | blk_init_allocated_queue_node(struct request_queue *q, request_fn_proc *rfn, |
| 600 | spinlock_t *lock, int node_id) |
| 601 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 602 | if (!q) |
| 603 | return NULL; |
| 604 | |
Christoph Lameter | 1946089 | 2005-06-23 00:08:19 -0700 | [diff] [blame] | 605 | q->node = node_id; |
Mike Snitzer | c86d1b8 | 2010-06-03 11:34:52 -0600 | [diff] [blame] | 606 | if (blk_init_free_list(q)) |
Al Viro | 8669aaf | 2006-03-18 13:50:00 -0500 | [diff] [blame] | 607 | return NULL; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 608 | |
| 609 | q->request_fn = rfn; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 610 | q->prep_rq_fn = NULL; |
| 611 | q->unplug_fn = generic_unplug_device; |
Jens Axboe | bc58ba9 | 2009-01-23 10:54:44 +0100 | [diff] [blame] | 612 | q->queue_flags = QUEUE_FLAG_DEFAULT; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 613 | q->queue_lock = lock; |
| 614 | |
Jens Axboe | f3b144a | 2009-03-06 08:48:33 +0100 | [diff] [blame] | 615 | /* |
| 616 | * This also sets hw/phys segments, boundary and size |
| 617 | */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 618 | blk_queue_make_request(q, __make_request); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 619 | |
Alan Stern | 44ec954 | 2007-02-20 11:01:57 -0500 | [diff] [blame] | 620 | q->sg_reserved_size = INT_MAX; |
| 621 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 622 | /* |
| 623 | * all done |
| 624 | */ |
| 625 | if (!elevator_init(q, NULL)) { |
| 626 | blk_queue_congestion_threshold(q); |
| 627 | return q; |
| 628 | } |
| 629 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 630 | return NULL; |
| 631 | } |
Mike Snitzer | 01effb0 | 2010-05-11 08:57:42 +0200 | [diff] [blame] | 632 | EXPORT_SYMBOL(blk_init_allocated_queue_node); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 633 | |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 634 | int blk_get_queue(struct request_queue *q) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 635 | { |
Nick Piggin | fde6ad2 | 2005-06-23 00:08:53 -0700 | [diff] [blame] | 636 | if (likely(!test_bit(QUEUE_FLAG_DEAD, &q->queue_flags))) { |
Al Viro | 483f4af | 2006-03-18 18:34:37 -0500 | [diff] [blame] | 637 | kobject_get(&q->kobj); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 638 | return 0; |
| 639 | } |
| 640 | |
| 641 | return 1; |
| 642 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 643 | |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 644 | static inline void blk_free_request(struct request_queue *q, struct request *rq) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 645 | { |
Jens Axboe | 4aff5e2 | 2006-08-10 08:44:47 +0200 | [diff] [blame] | 646 | if (rq->cmd_flags & REQ_ELVPRIV) |
Tejun Heo | cb98fc8 | 2005-10-28 08:29:39 +0200 | [diff] [blame] | 647 | elv_put_request(q, rq); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 648 | mempool_free(rq, q->rq.rq_pool); |
| 649 | } |
| 650 | |
Jens Axboe | 1ea25ec | 2006-07-18 22:24:11 +0200 | [diff] [blame] | 651 | static struct request * |
Jerome Marchand | 42dad76 | 2009-04-22 14:01:49 +0200 | [diff] [blame] | 652 | blk_alloc_request(struct request_queue *q, int flags, int priv, gfp_t gfp_mask) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 653 | { |
| 654 | struct request *rq = mempool_alloc(q->rq.rq_pool, gfp_mask); |
| 655 | |
| 656 | if (!rq) |
| 657 | return NULL; |
| 658 | |
FUJITA Tomonori | 2a4aa30 | 2008-04-29 09:54:36 +0200 | [diff] [blame] | 659 | blk_rq_init(q, rq); |
FUJITA Tomonori | 1afb20f | 2008-04-25 12:26:28 +0200 | [diff] [blame] | 660 | |
Jerome Marchand | 42dad76 | 2009-04-22 14:01:49 +0200 | [diff] [blame] | 661 | rq->cmd_flags = flags | REQ_ALLOCED; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 662 | |
Tejun Heo | cb98fc8 | 2005-10-28 08:29:39 +0200 | [diff] [blame] | 663 | if (priv) { |
Jens Axboe | cb78b28 | 2006-07-28 09:32:57 +0200 | [diff] [blame] | 664 | if (unlikely(elv_set_request(q, rq, gfp_mask))) { |
Tejun Heo | cb98fc8 | 2005-10-28 08:29:39 +0200 | [diff] [blame] | 665 | mempool_free(rq, q->rq.rq_pool); |
| 666 | return NULL; |
| 667 | } |
Jens Axboe | 4aff5e2 | 2006-08-10 08:44:47 +0200 | [diff] [blame] | 668 | rq->cmd_flags |= REQ_ELVPRIV; |
Tejun Heo | cb98fc8 | 2005-10-28 08:29:39 +0200 | [diff] [blame] | 669 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 670 | |
Tejun Heo | cb98fc8 | 2005-10-28 08:29:39 +0200 | [diff] [blame] | 671 | return rq; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 672 | } |
| 673 | |
| 674 | /* |
| 675 | * ioc_batching returns true if the ioc is a valid batching request and |
| 676 | * should be given priority access to a request. |
| 677 | */ |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 678 | static inline int ioc_batching(struct request_queue *q, struct io_context *ioc) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 679 | { |
| 680 | if (!ioc) |
| 681 | return 0; |
| 682 | |
| 683 | /* |
| 684 | * Make sure the process is able to allocate at least 1 request |
| 685 | * even if the batch times out, otherwise we could theoretically |
| 686 | * lose wakeups. |
| 687 | */ |
| 688 | return ioc->nr_batch_requests == q->nr_batching || |
| 689 | (ioc->nr_batch_requests > 0 |
| 690 | && time_before(jiffies, ioc->last_waited + BLK_BATCH_TIME)); |
| 691 | } |
| 692 | |
| 693 | /* |
| 694 | * ioc_set_batching sets ioc to be a new "batcher" if it is not one. This |
| 695 | * will cause the process to be a "batcher" on all queues in the system. This |
| 696 | * is the behaviour we want though - once it gets a wakeup it should be given |
| 697 | * a nice run. |
| 698 | */ |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 699 | static void ioc_set_batching(struct request_queue *q, struct io_context *ioc) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 700 | { |
| 701 | if (!ioc || ioc_batching(q, ioc)) |
| 702 | return; |
| 703 | |
| 704 | ioc->nr_batch_requests = q->nr_batching; |
| 705 | ioc->last_waited = jiffies; |
| 706 | } |
| 707 | |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 708 | static void __freed_request(struct request_queue *q, int sync) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 709 | { |
| 710 | struct request_list *rl = &q->rq; |
| 711 | |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 712 | if (rl->count[sync] < queue_congestion_off_threshold(q)) |
| 713 | blk_clear_queue_congested(q, sync); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 714 | |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 715 | if (rl->count[sync] + 1 <= q->nr_requests) { |
| 716 | if (waitqueue_active(&rl->wait[sync])) |
| 717 | wake_up(&rl->wait[sync]); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 718 | |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 719 | blk_clear_queue_full(q, sync); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 720 | } |
| 721 | } |
| 722 | |
| 723 | /* |
| 724 | * A request has just been released. Account for it, update the full and |
| 725 | * congestion status, wake up any waiters. Called under q->queue_lock. |
| 726 | */ |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 727 | static void freed_request(struct request_queue *q, int sync, int priv) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 728 | { |
| 729 | struct request_list *rl = &q->rq; |
| 730 | |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 731 | rl->count[sync]--; |
Tejun Heo | cb98fc8 | 2005-10-28 08:29:39 +0200 | [diff] [blame] | 732 | if (priv) |
| 733 | rl->elvpriv--; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 734 | |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 735 | __freed_request(q, sync); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 736 | |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 737 | if (unlikely(rl->starved[sync ^ 1])) |
| 738 | __freed_request(q, sync ^ 1); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 739 | } |
| 740 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 741 | /* |
Nick Piggin | d634453 | 2005-06-28 20:45:14 -0700 | [diff] [blame] | 742 | * Get a free request, queue_lock must be held. |
| 743 | * Returns NULL on failure, with queue_lock held. |
| 744 | * Returns !NULL on success, with queue_lock *not held*. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 745 | */ |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 746 | static struct request *get_request(struct request_queue *q, int rw_flags, |
Jens Axboe | 7749a8d | 2006-12-13 13:02:26 +0100 | [diff] [blame] | 747 | struct bio *bio, gfp_t gfp_mask) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 748 | { |
| 749 | struct request *rq = NULL; |
| 750 | struct request_list *rl = &q->rq; |
Jens Axboe | 88ee5ef | 2005-11-12 11:09:12 +0100 | [diff] [blame] | 751 | struct io_context *ioc = NULL; |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 752 | const bool is_sync = rw_is_sync(rw_flags) != 0; |
Jens Axboe | 88ee5ef | 2005-11-12 11:09:12 +0100 | [diff] [blame] | 753 | int may_queue, priv; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 754 | |
Jens Axboe | 7749a8d | 2006-12-13 13:02:26 +0100 | [diff] [blame] | 755 | may_queue = elv_may_queue(q, rw_flags); |
Jens Axboe | 88ee5ef | 2005-11-12 11:09:12 +0100 | [diff] [blame] | 756 | if (may_queue == ELV_MQUEUE_NO) |
| 757 | goto rq_starved; |
| 758 | |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 759 | if (rl->count[is_sync]+1 >= queue_congestion_on_threshold(q)) { |
| 760 | if (rl->count[is_sync]+1 >= q->nr_requests) { |
Jens Axboe | b5deef9 | 2006-07-19 23:39:40 +0200 | [diff] [blame] | 761 | ioc = current_io_context(GFP_ATOMIC, q->node); |
Jens Axboe | 88ee5ef | 2005-11-12 11:09:12 +0100 | [diff] [blame] | 762 | /* |
| 763 | * The queue will fill after this allocation, so set |
| 764 | * it as full, and mark this process as "batching". |
| 765 | * This process will be allowed to complete a batch of |
| 766 | * requests, others will be blocked. |
| 767 | */ |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 768 | if (!blk_queue_full(q, is_sync)) { |
Jens Axboe | 88ee5ef | 2005-11-12 11:09:12 +0100 | [diff] [blame] | 769 | ioc_set_batching(q, ioc); |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 770 | blk_set_queue_full(q, is_sync); |
Jens Axboe | 88ee5ef | 2005-11-12 11:09:12 +0100 | [diff] [blame] | 771 | } else { |
| 772 | if (may_queue != ELV_MQUEUE_MUST |
| 773 | && !ioc_batching(q, ioc)) { |
| 774 | /* |
| 775 | * The queue is full and the allocating |
| 776 | * process is not a "batcher", and not |
| 777 | * exempted by the IO scheduler |
| 778 | */ |
| 779 | goto out; |
| 780 | } |
| 781 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 782 | } |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 783 | blk_set_queue_congested(q, is_sync); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 784 | } |
| 785 | |
Jens Axboe | 082cf69 | 2005-06-28 16:35:11 +0200 | [diff] [blame] | 786 | /* |
| 787 | * Only allow batching queuers to allocate up to 50% over the defined |
| 788 | * limit of requests, otherwise we could have thousands of requests |
| 789 | * allocated with any setting of ->nr_requests |
| 790 | */ |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 791 | if (rl->count[is_sync] >= (3 * q->nr_requests / 2)) |
Jens Axboe | 082cf69 | 2005-06-28 16:35:11 +0200 | [diff] [blame] | 792 | goto out; |
Hugh Dickins | fd782a4 | 2005-06-29 15:15:40 +0100 | [diff] [blame] | 793 | |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 794 | rl->count[is_sync]++; |
| 795 | rl->starved[is_sync] = 0; |
Tejun Heo | cb98fc8 | 2005-10-28 08:29:39 +0200 | [diff] [blame] | 796 | |
Jens Axboe | 64521d1 | 2005-10-28 08:30:39 +0200 | [diff] [blame] | 797 | priv = !test_bit(QUEUE_FLAG_ELVSWITCH, &q->queue_flags); |
Tejun Heo | cb98fc8 | 2005-10-28 08:29:39 +0200 | [diff] [blame] | 798 | if (priv) |
| 799 | rl->elvpriv++; |
| 800 | |
Jerome Marchand | 42dad76 | 2009-04-22 14:01:49 +0200 | [diff] [blame] | 801 | if (blk_queue_io_stat(q)) |
| 802 | rw_flags |= REQ_IO_STAT; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 803 | spin_unlock_irq(q->queue_lock); |
| 804 | |
Jens Axboe | 7749a8d | 2006-12-13 13:02:26 +0100 | [diff] [blame] | 805 | rq = blk_alloc_request(q, rw_flags, priv, gfp_mask); |
Jens Axboe | 88ee5ef | 2005-11-12 11:09:12 +0100 | [diff] [blame] | 806 | if (unlikely(!rq)) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 807 | /* |
| 808 | * Allocation failed presumably due to memory. Undo anything |
| 809 | * we might have messed up. |
| 810 | * |
| 811 | * Allocating task should really be put onto the front of the |
| 812 | * wait queue, but this is pretty rare. |
| 813 | */ |
| 814 | spin_lock_irq(q->queue_lock); |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 815 | freed_request(q, is_sync, priv); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 816 | |
| 817 | /* |
| 818 | * in the very unlikely event that allocation failed and no |
| 819 | * requests for this direction was pending, mark us starved |
| 820 | * so that freeing of a request in the other direction will |
| 821 | * notice us. another possible fix would be to split the |
| 822 | * rq mempool into READ and WRITE |
| 823 | */ |
| 824 | rq_starved: |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 825 | if (unlikely(rl->count[is_sync] == 0)) |
| 826 | rl->starved[is_sync] = 1; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 827 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 828 | goto out; |
| 829 | } |
| 830 | |
Jens Axboe | 88ee5ef | 2005-11-12 11:09:12 +0100 | [diff] [blame] | 831 | /* |
| 832 | * ioc may be NULL here, and ioc_batching will be false. That's |
| 833 | * OK, if the queue is under the request limit then requests need |
| 834 | * not count toward the nr_batch_requests limit. There will always |
| 835 | * be some limit enforced by BLK_BATCH_TIME. |
| 836 | */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 837 | if (ioc_batching(q, ioc)) |
| 838 | ioc->nr_batch_requests--; |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 839 | |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 840 | trace_block_getrq(q, bio, rw_flags & 1); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 841 | out: |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 842 | return rq; |
| 843 | } |
| 844 | |
| 845 | /* |
| 846 | * No available requests for this queue, unplug the device and wait for some |
| 847 | * requests to become available. |
Nick Piggin | d634453 | 2005-06-28 20:45:14 -0700 | [diff] [blame] | 848 | * |
| 849 | * Called with q->queue_lock held, and returns with it unlocked. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 850 | */ |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 851 | static struct request *get_request_wait(struct request_queue *q, int rw_flags, |
Jens Axboe | 22e2c50 | 2005-06-27 10:55:12 +0200 | [diff] [blame] | 852 | struct bio *bio) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 853 | { |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 854 | const bool is_sync = rw_is_sync(rw_flags) != 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 855 | struct request *rq; |
| 856 | |
Jens Axboe | 7749a8d | 2006-12-13 13:02:26 +0100 | [diff] [blame] | 857 | rq = get_request(q, rw_flags, bio, GFP_NOIO); |
Nick Piggin | 450991b | 2005-06-28 20:45:13 -0700 | [diff] [blame] | 858 | while (!rq) { |
| 859 | DEFINE_WAIT(wait); |
Zhang, Yanmin | 05caf8d | 2008-05-22 15:13:29 +0200 | [diff] [blame] | 860 | struct io_context *ioc; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 861 | struct request_list *rl = &q->rq; |
| 862 | |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 863 | prepare_to_wait_exclusive(&rl->wait[is_sync], &wait, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 864 | TASK_UNINTERRUPTIBLE); |
| 865 | |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 866 | trace_block_sleeprq(q, bio, rw_flags & 1); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 867 | |
Zhang, Yanmin | 05caf8d | 2008-05-22 15:13:29 +0200 | [diff] [blame] | 868 | __generic_unplug_device(q); |
| 869 | spin_unlock_irq(q->queue_lock); |
| 870 | io_schedule(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 871 | |
Zhang, Yanmin | 05caf8d | 2008-05-22 15:13:29 +0200 | [diff] [blame] | 872 | /* |
| 873 | * After sleeping, we become a "batching" process and |
| 874 | * will be able to allocate at least one request, and |
| 875 | * up to a big batch of them for a small period time. |
| 876 | * See ioc_batching, ioc_set_batching |
| 877 | */ |
| 878 | ioc = current_io_context(GFP_NOIO, q->node); |
| 879 | ioc_set_batching(q, ioc); |
Jens Axboe | 2056a78 | 2006-03-23 20:00:26 +0100 | [diff] [blame] | 880 | |
Zhang, Yanmin | 05caf8d | 2008-05-22 15:13:29 +0200 | [diff] [blame] | 881 | spin_lock_irq(q->queue_lock); |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 882 | finish_wait(&rl->wait[is_sync], &wait); |
Zhang, Yanmin | 05caf8d | 2008-05-22 15:13:29 +0200 | [diff] [blame] | 883 | |
| 884 | rq = get_request(q, rw_flags, bio, GFP_NOIO); |
| 885 | }; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 886 | |
| 887 | return rq; |
| 888 | } |
| 889 | |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 890 | struct request *blk_get_request(struct request_queue *q, int rw, gfp_t gfp_mask) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 891 | { |
| 892 | struct request *rq; |
| 893 | |
| 894 | BUG_ON(rw != READ && rw != WRITE); |
| 895 | |
Nick Piggin | d634453 | 2005-06-28 20:45:14 -0700 | [diff] [blame] | 896 | spin_lock_irq(q->queue_lock); |
| 897 | if (gfp_mask & __GFP_WAIT) { |
Jens Axboe | 22e2c50 | 2005-06-27 10:55:12 +0200 | [diff] [blame] | 898 | rq = get_request_wait(q, rw, NULL); |
Nick Piggin | d634453 | 2005-06-28 20:45:14 -0700 | [diff] [blame] | 899 | } else { |
Jens Axboe | 22e2c50 | 2005-06-27 10:55:12 +0200 | [diff] [blame] | 900 | rq = get_request(q, rw, NULL, gfp_mask); |
Nick Piggin | d634453 | 2005-06-28 20:45:14 -0700 | [diff] [blame] | 901 | if (!rq) |
| 902 | spin_unlock_irq(q->queue_lock); |
| 903 | } |
| 904 | /* q->queue_lock is unlocked at this point */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 905 | |
| 906 | return rq; |
| 907 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 908 | EXPORT_SYMBOL(blk_get_request); |
| 909 | |
| 910 | /** |
Boaz Harrosh | 79eb63e | 2009-05-17 18:57:15 +0300 | [diff] [blame] | 911 | * blk_make_request - given a bio, allocate a corresponding struct request. |
Randy Dunlap | 8ebf975 | 2009-06-11 20:00:41 -0700 | [diff] [blame] | 912 | * @q: target request queue |
Boaz Harrosh | 79eb63e | 2009-05-17 18:57:15 +0300 | [diff] [blame] | 913 | * @bio: The bio describing the memory mappings that will be submitted for IO. |
| 914 | * It may be a chained-bio properly constructed by block/bio layer. |
Randy Dunlap | 8ebf975 | 2009-06-11 20:00:41 -0700 | [diff] [blame] | 915 | * @gfp_mask: gfp flags to be used for memory allocation |
Jens Axboe | dc72ef4 | 2006-07-20 14:54:05 +0200 | [diff] [blame] | 916 | * |
Boaz Harrosh | 79eb63e | 2009-05-17 18:57:15 +0300 | [diff] [blame] | 917 | * blk_make_request is the parallel of generic_make_request for BLOCK_PC |
| 918 | * type commands. Where the struct request needs to be farther initialized by |
| 919 | * the caller. It is passed a &struct bio, which describes the memory info of |
| 920 | * the I/O transfer. |
| 921 | * |
| 922 | * The caller of blk_make_request must make sure that bi_io_vec |
| 923 | * are set to describe the memory buffers. That bio_data_dir() will return |
| 924 | * the needed direction of the request. (And all bio's in the passed bio-chain |
| 925 | * are properly set accordingly) |
| 926 | * |
| 927 | * If called under none-sleepable conditions, mapped bio buffers must not |
| 928 | * need bouncing, by calling the appropriate masked or flagged allocator, |
| 929 | * suitable for the target device. Otherwise the call to blk_queue_bounce will |
| 930 | * BUG. |
Jens Axboe | 53674ac | 2009-05-19 19:52:35 +0200 | [diff] [blame] | 931 | * |
| 932 | * WARNING: When allocating/cloning a bio-chain, careful consideration should be |
| 933 | * given to how you allocate bios. In particular, you cannot use __GFP_WAIT for |
| 934 | * anything but the first bio in the chain. Otherwise you risk waiting for IO |
| 935 | * completion of a bio that hasn't been submitted yet, thus resulting in a |
| 936 | * deadlock. Alternatively bios should be allocated using bio_kmalloc() instead |
| 937 | * of bio_alloc(), as that avoids the mempool deadlock. |
| 938 | * If possible a big IO should be split into smaller parts when allocation |
| 939 | * fails. Partial allocation should not be an error, or you risk a live-lock. |
Jens Axboe | dc72ef4 | 2006-07-20 14:54:05 +0200 | [diff] [blame] | 940 | */ |
Boaz Harrosh | 79eb63e | 2009-05-17 18:57:15 +0300 | [diff] [blame] | 941 | struct request *blk_make_request(struct request_queue *q, struct bio *bio, |
| 942 | gfp_t gfp_mask) |
Jens Axboe | dc72ef4 | 2006-07-20 14:54:05 +0200 | [diff] [blame] | 943 | { |
Boaz Harrosh | 79eb63e | 2009-05-17 18:57:15 +0300 | [diff] [blame] | 944 | struct request *rq = blk_get_request(q, bio_data_dir(bio), gfp_mask); |
| 945 | |
| 946 | if (unlikely(!rq)) |
| 947 | return ERR_PTR(-ENOMEM); |
| 948 | |
| 949 | for_each_bio(bio) { |
| 950 | struct bio *bounce_bio = bio; |
| 951 | int ret; |
| 952 | |
| 953 | blk_queue_bounce(q, &bounce_bio); |
| 954 | ret = blk_rq_append_bio(q, rq, bounce_bio); |
| 955 | if (unlikely(ret)) { |
| 956 | blk_put_request(rq); |
| 957 | return ERR_PTR(ret); |
| 958 | } |
| 959 | } |
| 960 | |
| 961 | return rq; |
Jens Axboe | dc72ef4 | 2006-07-20 14:54:05 +0200 | [diff] [blame] | 962 | } |
Boaz Harrosh | 79eb63e | 2009-05-17 18:57:15 +0300 | [diff] [blame] | 963 | EXPORT_SYMBOL(blk_make_request); |
Jens Axboe | dc72ef4 | 2006-07-20 14:54:05 +0200 | [diff] [blame] | 964 | |
| 965 | /** |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 966 | * blk_requeue_request - put a request back on queue |
| 967 | * @q: request queue where request should be inserted |
| 968 | * @rq: request to be inserted |
| 969 | * |
| 970 | * Description: |
| 971 | * Drivers often keep queueing requests until the hardware cannot accept |
| 972 | * more, when that condition happens we need to put the request back |
| 973 | * on the queue. Must be called with queue lock held. |
| 974 | */ |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 975 | void blk_requeue_request(struct request_queue *q, struct request *rq) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 976 | { |
Jens Axboe | 242f9dc | 2008-09-14 05:55:09 -0700 | [diff] [blame] | 977 | blk_delete_timer(rq); |
| 978 | blk_clear_rq_complete(rq); |
Arnaldo Carvalho de Melo | 5f3ea37 | 2008-10-30 08:34:33 +0100 | [diff] [blame] | 979 | trace_block_rq_requeue(q, rq); |
Jens Axboe | 2056a78 | 2006-03-23 20:00:26 +0100 | [diff] [blame] | 980 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 981 | if (blk_rq_tagged(rq)) |
| 982 | blk_queue_end_tag(q, rq); |
| 983 | |
James Bottomley | ba396a6 | 2009-05-27 14:17:08 +0200 | [diff] [blame] | 984 | BUG_ON(blk_queued_rq(rq)); |
| 985 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 986 | elv_requeue_request(q, rq); |
| 987 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 988 | EXPORT_SYMBOL(blk_requeue_request); |
| 989 | |
| 990 | /** |
Randy Dunlap | 710027a | 2008-08-19 20:13:11 +0200 | [diff] [blame] | 991 | * blk_insert_request - insert a special request into a request queue |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 992 | * @q: request queue where request should be inserted |
| 993 | * @rq: request to be inserted |
| 994 | * @at_head: insert request at head or tail of queue |
| 995 | * @data: private data |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 996 | * |
| 997 | * Description: |
| 998 | * Many block devices need to execute commands asynchronously, so they don't |
| 999 | * block the whole kernel from preemption during request execution. This is |
| 1000 | * accomplished normally by inserting aritficial requests tagged as |
Randy Dunlap | 710027a | 2008-08-19 20:13:11 +0200 | [diff] [blame] | 1001 | * REQ_TYPE_SPECIAL in to the corresponding request queue, and letting them |
| 1002 | * be scheduled for actual execution by the request queue. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1003 | * |
| 1004 | * We have the option of inserting the head or the tail of the queue. |
| 1005 | * Typically we use the tail for new ioctls and so forth. We use the head |
| 1006 | * of the queue for things like a QUEUE_FULL message from a device, or a |
| 1007 | * host that is unable to accept a particular command. |
| 1008 | */ |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 1009 | void blk_insert_request(struct request_queue *q, struct request *rq, |
Tejun Heo | 867d119 | 2005-04-24 02:06:05 -0500 | [diff] [blame] | 1010 | int at_head, void *data) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1011 | { |
Tejun Heo | 867d119 | 2005-04-24 02:06:05 -0500 | [diff] [blame] | 1012 | int where = at_head ? ELEVATOR_INSERT_FRONT : ELEVATOR_INSERT_BACK; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1013 | unsigned long flags; |
| 1014 | |
| 1015 | /* |
| 1016 | * tell I/O scheduler that this isn't a regular read/write (ie it |
| 1017 | * must not attempt merges on this) and that it acts as a soft |
| 1018 | * barrier |
| 1019 | */ |
Jens Axboe | 4aff5e2 | 2006-08-10 08:44:47 +0200 | [diff] [blame] | 1020 | rq->cmd_type = REQ_TYPE_SPECIAL; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1021 | |
| 1022 | rq->special = data; |
| 1023 | |
| 1024 | spin_lock_irqsave(q->queue_lock, flags); |
| 1025 | |
| 1026 | /* |
| 1027 | * If command is tagged, release the tag |
| 1028 | */ |
Tejun Heo | 867d119 | 2005-04-24 02:06:05 -0500 | [diff] [blame] | 1029 | if (blk_rq_tagged(rq)) |
| 1030 | blk_queue_end_tag(q, rq); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1031 | |
Jerome Marchand | b238b3d | 2007-10-23 15:05:46 +0200 | [diff] [blame] | 1032 | drive_stat_acct(rq, 1); |
Tejun Heo | 867d119 | 2005-04-24 02:06:05 -0500 | [diff] [blame] | 1033 | __elv_add_request(q, rq, where, 0); |
Tejun Heo | a7f5579 | 2009-04-23 11:05:17 +0900 | [diff] [blame] | 1034 | __blk_run_queue(q); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1035 | spin_unlock_irqrestore(q->queue_lock, flags); |
| 1036 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1037 | EXPORT_SYMBOL(blk_insert_request); |
| 1038 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1039 | /* |
| 1040 | * add-request adds a request to the linked list. |
| 1041 | * queue lock is held and interrupts disabled, as we muck with the |
| 1042 | * request queue list. |
| 1043 | */ |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1044 | static inline void add_request(struct request_queue *q, struct request *req) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1045 | { |
Jerome Marchand | b238b3d | 2007-10-23 15:05:46 +0200 | [diff] [blame] | 1046 | drive_stat_acct(req, 1); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1047 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1048 | /* |
| 1049 | * elevator indicated where it wants this request to be |
| 1050 | * inserted at elevator_merge time |
| 1051 | */ |
| 1052 | __elv_add_request(q, req, ELEVATOR_INSERT_SORT, 0); |
| 1053 | } |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1054 | |
Tejun Heo | 074a7ac | 2008-08-25 19:56:14 +0900 | [diff] [blame] | 1055 | static void part_round_stats_single(int cpu, struct hd_struct *part, |
| 1056 | unsigned long now) |
| 1057 | { |
| 1058 | if (now == part->stamp) |
| 1059 | return; |
| 1060 | |
Nikanth Karthikesan | 316d315 | 2009-10-06 20:16:55 +0200 | [diff] [blame] | 1061 | if (part_in_flight(part)) { |
Tejun Heo | 074a7ac | 2008-08-25 19:56:14 +0900 | [diff] [blame] | 1062 | __part_stat_add(cpu, part, time_in_queue, |
Nikanth Karthikesan | 316d315 | 2009-10-06 20:16:55 +0200 | [diff] [blame] | 1063 | part_in_flight(part) * (now - part->stamp)); |
Tejun Heo | 074a7ac | 2008-08-25 19:56:14 +0900 | [diff] [blame] | 1064 | __part_stat_add(cpu, part, io_ticks, (now - part->stamp)); |
| 1065 | } |
| 1066 | part->stamp = now; |
| 1067 | } |
| 1068 | |
| 1069 | /** |
Randy Dunlap | 496aa8a | 2008-10-16 07:46:23 +0200 | [diff] [blame] | 1070 | * part_round_stats() - Round off the performance stats on a struct disk_stats. |
| 1071 | * @cpu: cpu number for stats access |
| 1072 | * @part: target partition |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1073 | * |
| 1074 | * The average IO queue length and utilisation statistics are maintained |
| 1075 | * by observing the current state of the queue length and the amount of |
| 1076 | * time it has been in this state for. |
| 1077 | * |
| 1078 | * Normally, that accounting is done on IO completion, but that can result |
| 1079 | * in more than a second's worth of IO being accounted for within any one |
| 1080 | * second, leading to >100% utilisation. To deal with that, we call this |
| 1081 | * function to do a round-off before returning the results when reading |
| 1082 | * /proc/diskstats. This accounts immediately for all queue usage up to |
| 1083 | * the current jiffies and restarts the counters again. |
| 1084 | */ |
Tejun Heo | c995905 | 2008-08-25 19:47:21 +0900 | [diff] [blame] | 1085 | void part_round_stats(int cpu, struct hd_struct *part) |
Jerome Marchand | 6f2576a | 2008-02-08 11:04:35 +0100 | [diff] [blame] | 1086 | { |
| 1087 | unsigned long now = jiffies; |
| 1088 | |
Tejun Heo | 074a7ac | 2008-08-25 19:56:14 +0900 | [diff] [blame] | 1089 | if (part->partno) |
| 1090 | part_round_stats_single(cpu, &part_to_disk(part)->part0, now); |
| 1091 | part_round_stats_single(cpu, part, now); |
Jerome Marchand | 6f2576a | 2008-02-08 11:04:35 +0100 | [diff] [blame] | 1092 | } |
Tejun Heo | 074a7ac | 2008-08-25 19:56:14 +0900 | [diff] [blame] | 1093 | EXPORT_SYMBOL_GPL(part_round_stats); |
Jerome Marchand | 6f2576a | 2008-02-08 11:04:35 +0100 | [diff] [blame] | 1094 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1095 | /* |
| 1096 | * queue lock must be held |
| 1097 | */ |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 1098 | void __blk_put_request(struct request_queue *q, struct request *req) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1099 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1100 | if (unlikely(!q)) |
| 1101 | return; |
| 1102 | if (unlikely(--req->ref_count)) |
| 1103 | return; |
| 1104 | |
Tejun Heo | 8922e16 | 2005-10-20 16:23:44 +0200 | [diff] [blame] | 1105 | elv_completed_request(q, req); |
| 1106 | |
Boaz Harrosh | 1cd96c2 | 2009-03-24 12:35:07 +0100 | [diff] [blame] | 1107 | /* this is a bio leak */ |
| 1108 | WARN_ON(req->bio != NULL); |
| 1109 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1110 | /* |
| 1111 | * Request may not have originated from ll_rw_blk. if not, |
| 1112 | * it didn't come out of our reserved rq pools |
| 1113 | */ |
Jens Axboe | 49171e5 | 2006-08-10 08:59:11 +0200 | [diff] [blame] | 1114 | if (req->cmd_flags & REQ_ALLOCED) { |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 1115 | int is_sync = rq_is_sync(req) != 0; |
Jens Axboe | 4aff5e2 | 2006-08-10 08:44:47 +0200 | [diff] [blame] | 1116 | int priv = req->cmd_flags & REQ_ELVPRIV; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1117 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1118 | BUG_ON(!list_empty(&req->queuelist)); |
Jens Axboe | 9817064 | 2006-07-28 09:23:08 +0200 | [diff] [blame] | 1119 | BUG_ON(!hlist_unhashed(&req->hash)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1120 | |
| 1121 | blk_free_request(q, req); |
Jens Axboe | 1faa16d | 2009-04-06 14:48:01 +0200 | [diff] [blame] | 1122 | freed_request(q, is_sync, priv); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1123 | } |
| 1124 | } |
Mike Christie | 6e39b69 | 2005-11-11 05:30:24 -0600 | [diff] [blame] | 1125 | EXPORT_SYMBOL_GPL(__blk_put_request); |
| 1126 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1127 | void blk_put_request(struct request *req) |
| 1128 | { |
Tejun Heo | 8922e16 | 2005-10-20 16:23:44 +0200 | [diff] [blame] | 1129 | unsigned long flags; |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 1130 | struct request_queue *q = req->q; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1131 | |
FUJITA Tomonori | 52a93ba | 2008-07-15 21:21:45 +0200 | [diff] [blame] | 1132 | spin_lock_irqsave(q->queue_lock, flags); |
| 1133 | __blk_put_request(q, req); |
| 1134 | spin_unlock_irqrestore(q->queue_lock, flags); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1135 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1136 | EXPORT_SYMBOL(blk_put_request); |
| 1137 | |
Christoph Hellwig | 66ac028 | 2010-06-18 16:59:42 +0200 | [diff] [blame] | 1138 | /** |
| 1139 | * blk_add_request_payload - add a payload to a request |
| 1140 | * @rq: request to update |
| 1141 | * @page: page backing the payload |
| 1142 | * @len: length of the payload. |
| 1143 | * |
| 1144 | * This allows to later add a payload to an already submitted request by |
| 1145 | * a block driver. The driver needs to take care of freeing the payload |
| 1146 | * itself. |
| 1147 | * |
| 1148 | * Note that this is a quite horrible hack and nothing but handling of |
| 1149 | * discard requests should ever use it. |
| 1150 | */ |
| 1151 | void blk_add_request_payload(struct request *rq, struct page *page, |
| 1152 | unsigned int len) |
| 1153 | { |
| 1154 | struct bio *bio = rq->bio; |
| 1155 | |
| 1156 | bio->bi_io_vec->bv_page = page; |
| 1157 | bio->bi_io_vec->bv_offset = 0; |
| 1158 | bio->bi_io_vec->bv_len = len; |
| 1159 | |
| 1160 | bio->bi_size = len; |
| 1161 | bio->bi_vcnt = 1; |
| 1162 | bio->bi_phys_segments = 1; |
| 1163 | |
| 1164 | rq->__data_len = rq->resid_len = len; |
| 1165 | rq->nr_phys_segments = 1; |
| 1166 | rq->buffer = bio_data(bio); |
| 1167 | } |
| 1168 | EXPORT_SYMBOL_GPL(blk_add_request_payload); |
| 1169 | |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 1170 | void init_request_from_bio(struct request *req, struct bio *bio) |
Tejun Heo | 52d9e67 | 2006-01-06 09:49:58 +0100 | [diff] [blame] | 1171 | { |
Jens Axboe | c7c22e4 | 2008-09-13 20:26:01 +0200 | [diff] [blame] | 1172 | req->cpu = bio->bi_comp_cpu; |
Jens Axboe | 4aff5e2 | 2006-08-10 08:44:47 +0200 | [diff] [blame] | 1173 | req->cmd_type = REQ_TYPE_FS; |
Tejun Heo | 52d9e67 | 2006-01-06 09:49:58 +0100 | [diff] [blame] | 1174 | |
Christoph Hellwig | 7b6d91d | 2010-08-07 18:20:39 +0200 | [diff] [blame] | 1175 | req->cmd_flags |= bio->bi_rw & REQ_COMMON_MASK; |
| 1176 | if (bio->bi_rw & REQ_RAHEAD) |
Tejun Heo | a82afdf | 2009-07-03 17:48:16 +0900 | [diff] [blame] | 1177 | req->cmd_flags |= REQ_FAILFAST_MASK; |
Jens Axboe | b31dc66 | 2006-06-13 08:26:10 +0200 | [diff] [blame] | 1178 | |
Tejun Heo | 52d9e67 | 2006-01-06 09:49:58 +0100 | [diff] [blame] | 1179 | req->errors = 0; |
Tejun Heo | a2dec7b | 2009-05-07 22:24:44 +0900 | [diff] [blame] | 1180 | req->__sector = bio->bi_sector; |
Tejun Heo | 52d9e67 | 2006-01-06 09:49:58 +0100 | [diff] [blame] | 1181 | req->ioprio = bio_prio(bio); |
NeilBrown | bc1c56f | 2007-08-16 13:31:30 +0200 | [diff] [blame] | 1182 | blk_rq_bio_prep(req->q, req, bio); |
Tejun Heo | 52d9e67 | 2006-01-06 09:49:58 +0100 | [diff] [blame] | 1183 | } |
| 1184 | |
Jens Axboe | 644b2d9 | 2009-04-06 14:48:06 +0200 | [diff] [blame] | 1185 | /* |
| 1186 | * Only disabling plugging for non-rotational devices if it does tagging |
| 1187 | * as well, otherwise we do need the proper merging |
| 1188 | */ |
| 1189 | static inline bool queue_should_plug(struct request_queue *q) |
| 1190 | { |
Jens Axboe | 79da064 | 2010-02-23 08:40:43 +0100 | [diff] [blame] | 1191 | return !(blk_queue_nonrot(q) && blk_queue_tagged(q)); |
Jens Axboe | 644b2d9 | 2009-04-06 14:48:06 +0200 | [diff] [blame] | 1192 | } |
| 1193 | |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 1194 | static int __make_request(struct request_queue *q, struct bio *bio) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1195 | { |
Nick Piggin | 450991b | 2005-06-28 20:45:13 -0700 | [diff] [blame] | 1196 | struct request *req; |
Tejun Heo | 2e46e8b | 2009-05-07 22:24:41 +0900 | [diff] [blame] | 1197 | int el_ret; |
| 1198 | unsigned int bytes = bio->bi_size; |
Jens Axboe | 51da90f | 2006-07-18 04:14:45 +0200 | [diff] [blame] | 1199 | const unsigned short prio = bio_prio(bio); |
Christoph Hellwig | 7b6d91d | 2010-08-07 18:20:39 +0200 | [diff] [blame] | 1200 | const bool sync = (bio->bi_rw & REQ_SYNC); |
| 1201 | const bool unplug = (bio->bi_rw & REQ_UNPLUG); |
Tejun Heo | 80a761f | 2009-07-03 17:48:17 +0900 | [diff] [blame] | 1202 | const unsigned int ff = bio->bi_rw & REQ_FAILFAST_MASK; |
Jens Axboe | 7749a8d | 2006-12-13 13:02:26 +0100 | [diff] [blame] | 1203 | int rw_flags; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1204 | |
Christoph Hellwig | 7b6d91d | 2010-08-07 18:20:39 +0200 | [diff] [blame] | 1205 | if ((bio->bi_rw & REQ_HARDBARRIER) && |
NeilBrown | db64f68 | 2009-06-30 09:35:44 +0200 | [diff] [blame] | 1206 | (q->next_ordered == QUEUE_ORDERED_NONE)) { |
| 1207 | bio_endio(bio, -EOPNOTSUPP); |
| 1208 | return 0; |
| 1209 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1210 | /* |
| 1211 | * low level driver can indicate that it wants pages above a |
| 1212 | * certain limit bounced to low memory (ie for highmem, or even |
| 1213 | * ISA dma in theory) |
| 1214 | */ |
| 1215 | blk_queue_bounce(q, &bio); |
| 1216 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1217 | spin_lock_irq(q->queue_lock); |
| 1218 | |
Christoph Hellwig | 7b6d91d | 2010-08-07 18:20:39 +0200 | [diff] [blame] | 1219 | if (unlikely((bio->bi_rw & REQ_HARDBARRIER)) || elv_queue_empty(q)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1220 | goto get_rq; |
| 1221 | |
| 1222 | el_ret = elv_merge(q, &req, bio); |
| 1223 | switch (el_ret) { |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1224 | case ELEVATOR_BACK_MERGE: |
| 1225 | BUG_ON(!rq_mergeable(req)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1226 | |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1227 | if (!ll_back_merge_fn(q, req, bio)) |
| 1228 | break; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1229 | |
Arnaldo Carvalho de Melo | 5f3ea37 | 2008-10-30 08:34:33 +0100 | [diff] [blame] | 1230 | trace_block_bio_backmerge(q, bio); |
Jens Axboe | 2056a78 | 2006-03-23 20:00:26 +0100 | [diff] [blame] | 1231 | |
Tejun Heo | 80a761f | 2009-07-03 17:48:17 +0900 | [diff] [blame] | 1232 | if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff) |
| 1233 | blk_rq_set_mixed_merge(req); |
| 1234 | |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1235 | req->biotail->bi_next = bio; |
| 1236 | req->biotail = bio; |
Tejun Heo | a2dec7b | 2009-05-07 22:24:44 +0900 | [diff] [blame] | 1237 | req->__data_len += bytes; |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1238 | req->ioprio = ioprio_best(req->ioprio, prio); |
Jens Axboe | ab780f1 | 2008-08-26 10:25:02 +0200 | [diff] [blame] | 1239 | if (!blk_rq_cpu_valid(req)) |
| 1240 | req->cpu = bio->bi_comp_cpu; |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1241 | drive_stat_acct(req, 0); |
Divyesh Shah | 812d402 | 2010-04-08 21:14:23 -0700 | [diff] [blame] | 1242 | elv_bio_merged(q, req, bio); |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1243 | if (!attempt_back_merge(q, req)) |
| 1244 | elv_merged_request(q, req, el_ret); |
| 1245 | goto out; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1246 | |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1247 | case ELEVATOR_FRONT_MERGE: |
| 1248 | BUG_ON(!rq_mergeable(req)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1249 | |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1250 | if (!ll_front_merge_fn(q, req, bio)) |
| 1251 | break; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1252 | |
Arnaldo Carvalho de Melo | 5f3ea37 | 2008-10-30 08:34:33 +0100 | [diff] [blame] | 1253 | trace_block_bio_frontmerge(q, bio); |
Jens Axboe | 2056a78 | 2006-03-23 20:00:26 +0100 | [diff] [blame] | 1254 | |
Tejun Heo | 80a761f | 2009-07-03 17:48:17 +0900 | [diff] [blame] | 1255 | if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff) { |
| 1256 | blk_rq_set_mixed_merge(req); |
| 1257 | req->cmd_flags &= ~REQ_FAILFAST_MASK; |
| 1258 | req->cmd_flags |= ff; |
| 1259 | } |
| 1260 | |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1261 | bio->bi_next = req->bio; |
| 1262 | req->bio = bio; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1263 | |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1264 | /* |
| 1265 | * may not be valid. if the low level driver said |
| 1266 | * it didn't need a bounce buffer then it better |
| 1267 | * not touch req->buffer either... |
| 1268 | */ |
| 1269 | req->buffer = bio_data(bio); |
Tejun Heo | a2dec7b | 2009-05-07 22:24:44 +0900 | [diff] [blame] | 1270 | req->__sector = bio->bi_sector; |
| 1271 | req->__data_len += bytes; |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1272 | req->ioprio = ioprio_best(req->ioprio, prio); |
Jens Axboe | ab780f1 | 2008-08-26 10:25:02 +0200 | [diff] [blame] | 1273 | if (!blk_rq_cpu_valid(req)) |
| 1274 | req->cpu = bio->bi_comp_cpu; |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1275 | drive_stat_acct(req, 0); |
Divyesh Shah | 812d402 | 2010-04-08 21:14:23 -0700 | [diff] [blame] | 1276 | elv_bio_merged(q, req, bio); |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1277 | if (!attempt_front_merge(q, req)) |
| 1278 | elv_merged_request(q, req, el_ret); |
| 1279 | goto out; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1280 | |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1281 | /* ELV_NO_MERGE: elevator says don't/can't merge. */ |
| 1282 | default: |
| 1283 | ; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1284 | } |
| 1285 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1286 | get_rq: |
Nick Piggin | 450991b | 2005-06-28 20:45:13 -0700 | [diff] [blame] | 1287 | /* |
Jens Axboe | 7749a8d | 2006-12-13 13:02:26 +0100 | [diff] [blame] | 1288 | * This sync check and mask will be re-done in init_request_from_bio(), |
| 1289 | * but we need to set it earlier to expose the sync flag to the |
| 1290 | * rq allocator and io schedulers. |
| 1291 | */ |
| 1292 | rw_flags = bio_data_dir(bio); |
| 1293 | if (sync) |
Christoph Hellwig | 7b6d91d | 2010-08-07 18:20:39 +0200 | [diff] [blame] | 1294 | rw_flags |= REQ_SYNC; |
Jens Axboe | 7749a8d | 2006-12-13 13:02:26 +0100 | [diff] [blame] | 1295 | |
| 1296 | /* |
Nick Piggin | 450991b | 2005-06-28 20:45:13 -0700 | [diff] [blame] | 1297 | * Grab a free request. This is might sleep but can not fail. |
Nick Piggin | d634453 | 2005-06-28 20:45:14 -0700 | [diff] [blame] | 1298 | * Returns with the queue unlocked. |
Nick Piggin | 450991b | 2005-06-28 20:45:13 -0700 | [diff] [blame] | 1299 | */ |
Jens Axboe | 7749a8d | 2006-12-13 13:02:26 +0100 | [diff] [blame] | 1300 | req = get_request_wait(q, rw_flags, bio); |
Nick Piggin | d634453 | 2005-06-28 20:45:14 -0700 | [diff] [blame] | 1301 | |
Nick Piggin | 450991b | 2005-06-28 20:45:13 -0700 | [diff] [blame] | 1302 | /* |
| 1303 | * After dropping the lock and possibly sleeping here, our request |
| 1304 | * may now be mergeable after it had proven unmergeable (above). |
| 1305 | * We don't worry about that case for efficiency. It won't happen |
| 1306 | * often, and the elevators are able to handle it. |
| 1307 | */ |
Tejun Heo | 52d9e67 | 2006-01-06 09:49:58 +0100 | [diff] [blame] | 1308 | init_request_from_bio(req, bio); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1309 | |
Nick Piggin | 450991b | 2005-06-28 20:45:13 -0700 | [diff] [blame] | 1310 | spin_lock_irq(q->queue_lock); |
Jens Axboe | c7c22e4 | 2008-09-13 20:26:01 +0200 | [diff] [blame] | 1311 | if (test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags) || |
| 1312 | bio_flagged(bio, BIO_CPU_AFFINE)) |
| 1313 | req->cpu = blk_cpu_to_group(smp_processor_id()); |
Jens Axboe | 644b2d9 | 2009-04-06 14:48:06 +0200 | [diff] [blame] | 1314 | if (queue_should_plug(q) && elv_queue_empty(q)) |
Nick Piggin | 450991b | 2005-06-28 20:45:13 -0700 | [diff] [blame] | 1315 | blk_plug_device(q); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1316 | add_request(q, req); |
| 1317 | out: |
Jens Axboe | 644b2d9 | 2009-04-06 14:48:06 +0200 | [diff] [blame] | 1318 | if (unplug || !queue_should_plug(q)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1319 | __generic_unplug_device(q); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1320 | spin_unlock_irq(q->queue_lock); |
| 1321 | return 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1322 | } |
| 1323 | |
| 1324 | /* |
| 1325 | * If bio->bi_dev is a partition, remap the location |
| 1326 | */ |
| 1327 | static inline void blk_partition_remap(struct bio *bio) |
| 1328 | { |
| 1329 | struct block_device *bdev = bio->bi_bdev; |
| 1330 | |
Jens Axboe | bf2de6f | 2007-09-27 13:01:25 +0200 | [diff] [blame] | 1331 | if (bio_sectors(bio) && bdev != bdev->bd_contains) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1332 | struct hd_struct *p = bdev->bd_part; |
Jens Axboe | a362357 | 2005-11-01 09:26:16 +0100 | [diff] [blame] | 1333 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1334 | bio->bi_sector += p->start_sect; |
| 1335 | bio->bi_bdev = bdev->bd_contains; |
Alan D. Brunelle | c7149d6 | 2007-08-07 15:30:23 +0200 | [diff] [blame] | 1336 | |
Arnaldo Carvalho de Melo | 5f3ea37 | 2008-10-30 08:34:33 +0100 | [diff] [blame] | 1337 | trace_block_remap(bdev_get_queue(bio->bi_bdev), bio, |
Alan D. Brunelle | 22a7c31 | 2009-05-04 16:35:08 -0400 | [diff] [blame] | 1338 | bdev->bd_dev, |
Alan D. Brunelle | c7149d6 | 2007-08-07 15:30:23 +0200 | [diff] [blame] | 1339 | bio->bi_sector - p->start_sect); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1340 | } |
| 1341 | } |
| 1342 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1343 | static void handle_bad_sector(struct bio *bio) |
| 1344 | { |
| 1345 | char b[BDEVNAME_SIZE]; |
| 1346 | |
| 1347 | printk(KERN_INFO "attempt to access beyond end of device\n"); |
| 1348 | printk(KERN_INFO "%s: rw=%ld, want=%Lu, limit=%Lu\n", |
| 1349 | bdevname(bio->bi_bdev, b), |
| 1350 | bio->bi_rw, |
| 1351 | (unsigned long long)bio->bi_sector + bio_sectors(bio), |
| 1352 | (long long)(bio->bi_bdev->bd_inode->i_size >> 9)); |
| 1353 | |
| 1354 | set_bit(BIO_EOF, &bio->bi_flags); |
| 1355 | } |
| 1356 | |
Akinobu Mita | c17bb49 | 2006-12-08 02:39:46 -0800 | [diff] [blame] | 1357 | #ifdef CONFIG_FAIL_MAKE_REQUEST |
| 1358 | |
| 1359 | static DECLARE_FAULT_ATTR(fail_make_request); |
| 1360 | |
| 1361 | static int __init setup_fail_make_request(char *str) |
| 1362 | { |
| 1363 | return setup_fault_attr(&fail_make_request, str); |
| 1364 | } |
| 1365 | __setup("fail_make_request=", setup_fail_make_request); |
| 1366 | |
| 1367 | static int should_fail_request(struct bio *bio) |
| 1368 | { |
Tejun Heo | eddb2e2 | 2008-08-25 19:56:13 +0900 | [diff] [blame] | 1369 | struct hd_struct *part = bio->bi_bdev->bd_part; |
| 1370 | |
| 1371 | if (part_to_disk(part)->part0.make_it_fail || part->make_it_fail) |
Akinobu Mita | c17bb49 | 2006-12-08 02:39:46 -0800 | [diff] [blame] | 1372 | return should_fail(&fail_make_request, bio->bi_size); |
| 1373 | |
| 1374 | return 0; |
| 1375 | } |
| 1376 | |
| 1377 | static int __init fail_make_request_debugfs(void) |
| 1378 | { |
| 1379 | return init_fault_attr_dentries(&fail_make_request, |
| 1380 | "fail_make_request"); |
| 1381 | } |
| 1382 | |
| 1383 | late_initcall(fail_make_request_debugfs); |
| 1384 | |
| 1385 | #else /* CONFIG_FAIL_MAKE_REQUEST */ |
| 1386 | |
| 1387 | static inline int should_fail_request(struct bio *bio) |
| 1388 | { |
| 1389 | return 0; |
| 1390 | } |
| 1391 | |
| 1392 | #endif /* CONFIG_FAIL_MAKE_REQUEST */ |
| 1393 | |
Jens Axboe | c07e2b4 | 2007-07-18 13:27:58 +0200 | [diff] [blame] | 1394 | /* |
| 1395 | * Check whether this bio extends beyond the end of the device. |
| 1396 | */ |
| 1397 | static inline int bio_check_eod(struct bio *bio, unsigned int nr_sectors) |
| 1398 | { |
| 1399 | sector_t maxsector; |
| 1400 | |
| 1401 | if (!nr_sectors) |
| 1402 | return 0; |
| 1403 | |
| 1404 | /* Test device or partition size, when known. */ |
| 1405 | maxsector = bio->bi_bdev->bd_inode->i_size >> 9; |
| 1406 | if (maxsector) { |
| 1407 | sector_t sector = bio->bi_sector; |
| 1408 | |
| 1409 | if (maxsector < nr_sectors || maxsector - nr_sectors < sector) { |
| 1410 | /* |
| 1411 | * This may well happen - the kernel calls bread() |
| 1412 | * without checking the size of the device, e.g., when |
| 1413 | * mounting a device. |
| 1414 | */ |
| 1415 | handle_bad_sector(bio); |
| 1416 | return 1; |
| 1417 | } |
| 1418 | } |
| 1419 | |
| 1420 | return 0; |
| 1421 | } |
| 1422 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1423 | /** |
Randy Dunlap | 710027a | 2008-08-19 20:13:11 +0200 | [diff] [blame] | 1424 | * generic_make_request - hand a buffer to its device driver for I/O |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1425 | * @bio: The bio describing the location in memory and on the device. |
| 1426 | * |
| 1427 | * generic_make_request() is used to make I/O requests of block |
| 1428 | * devices. It is passed a &struct bio, which describes the I/O that needs |
| 1429 | * to be done. |
| 1430 | * |
| 1431 | * generic_make_request() does not return any status. The |
| 1432 | * success/failure status of the request, along with notification of |
| 1433 | * completion, is delivered asynchronously through the bio->bi_end_io |
| 1434 | * function described (one day) else where. |
| 1435 | * |
| 1436 | * The caller of generic_make_request must make sure that bi_io_vec |
| 1437 | * are set to describe the memory buffer, and that bi_dev and bi_sector are |
| 1438 | * set to describe the device address, and the |
| 1439 | * bi_end_io and optionally bi_private are set to describe how |
| 1440 | * completion notification should be signaled. |
| 1441 | * |
| 1442 | * generic_make_request and the drivers it calls may use bi_next if this |
| 1443 | * bio happens to be merged with someone else, and may change bi_dev and |
| 1444 | * bi_sector for remaps as it sees fit. So the values of these fields |
| 1445 | * should NOT be depended on after the call to generic_make_request. |
| 1446 | */ |
Neil Brown | d89d879 | 2007-05-01 09:53:42 +0200 | [diff] [blame] | 1447 | static inline void __generic_make_request(struct bio *bio) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1448 | { |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 1449 | struct request_queue *q; |
NeilBrown | 5ddfe96 | 2006-10-30 22:07:21 -0800 | [diff] [blame] | 1450 | sector_t old_sector; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1451 | int ret, nr_sectors = bio_sectors(bio); |
Jens Axboe | 2056a78 | 2006-03-23 20:00:26 +0100 | [diff] [blame] | 1452 | dev_t old_dev; |
Jens Axboe | 51fd77b | 2007-11-02 08:49:08 +0100 | [diff] [blame] | 1453 | int err = -EIO; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1454 | |
| 1455 | might_sleep(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1456 | |
Jens Axboe | c07e2b4 | 2007-07-18 13:27:58 +0200 | [diff] [blame] | 1457 | if (bio_check_eod(bio, nr_sectors)) |
| 1458 | goto end_io; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1459 | |
| 1460 | /* |
| 1461 | * Resolve the mapping until finished. (drivers are |
| 1462 | * still free to implement/resolve their own stacking |
| 1463 | * by explicitly returning 0) |
| 1464 | * |
| 1465 | * NOTE: we don't repeat the blk_size check for each new device. |
| 1466 | * Stacking drivers are expected to know what they are doing. |
| 1467 | */ |
NeilBrown | 5ddfe96 | 2006-10-30 22:07:21 -0800 | [diff] [blame] | 1468 | old_sector = -1; |
Jens Axboe | 2056a78 | 2006-03-23 20:00:26 +0100 | [diff] [blame] | 1469 | old_dev = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1470 | do { |
| 1471 | char b[BDEVNAME_SIZE]; |
| 1472 | |
| 1473 | q = bdev_get_queue(bio->bi_bdev); |
Tejun Heo | a738467 | 2008-11-28 13:32:03 +0900 | [diff] [blame] | 1474 | if (unlikely(!q)) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1475 | printk(KERN_ERR |
| 1476 | "generic_make_request: Trying to access " |
| 1477 | "nonexistent block-device %s (%Lu)\n", |
| 1478 | bdevname(bio->bi_bdev, b), |
| 1479 | (long long) bio->bi_sector); |
Tejun Heo | a738467 | 2008-11-28 13:32:03 +0900 | [diff] [blame] | 1480 | goto end_io; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1481 | } |
| 1482 | |
Christoph Hellwig | 7b6d91d | 2010-08-07 18:20:39 +0200 | [diff] [blame] | 1483 | if (unlikely(!(bio->bi_rw & REQ_DISCARD) && |
Christoph Hellwig | 67efc92 | 2009-09-30 13:54:20 +0200 | [diff] [blame] | 1484 | nr_sectors > queue_max_hw_sectors(q))) { |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1485 | printk(KERN_ERR "bio too big device %s (%u > %u)\n", |
Martin K. Petersen | ae03bf6 | 2009-05-22 17:17:50 -0400 | [diff] [blame] | 1486 | bdevname(bio->bi_bdev, b), |
| 1487 | bio_sectors(bio), |
| 1488 | queue_max_hw_sectors(q)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1489 | goto end_io; |
| 1490 | } |
| 1491 | |
Nick Piggin | fde6ad2 | 2005-06-23 00:08:53 -0700 | [diff] [blame] | 1492 | if (unlikely(test_bit(QUEUE_FLAG_DEAD, &q->queue_flags))) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1493 | goto end_io; |
| 1494 | |
Akinobu Mita | c17bb49 | 2006-12-08 02:39:46 -0800 | [diff] [blame] | 1495 | if (should_fail_request(bio)) |
| 1496 | goto end_io; |
| 1497 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1498 | /* |
| 1499 | * If this device has partitions, remap block n |
| 1500 | * of partition p to block n+start(p) of the disk. |
| 1501 | */ |
| 1502 | blk_partition_remap(bio); |
| 1503 | |
Martin K. Petersen | 7ba1ba1 | 2008-06-30 20:04:41 +0200 | [diff] [blame] | 1504 | if (bio_integrity_enabled(bio) && bio_integrity_prep(bio)) |
| 1505 | goto end_io; |
| 1506 | |
NeilBrown | 5ddfe96 | 2006-10-30 22:07:21 -0800 | [diff] [blame] | 1507 | if (old_sector != -1) |
Alan D. Brunelle | 22a7c31 | 2009-05-04 16:35:08 -0400 | [diff] [blame] | 1508 | trace_block_remap(q, bio, old_dev, old_sector); |
Jens Axboe | 2056a78 | 2006-03-23 20:00:26 +0100 | [diff] [blame] | 1509 | |
NeilBrown | 5ddfe96 | 2006-10-30 22:07:21 -0800 | [diff] [blame] | 1510 | old_sector = bio->bi_sector; |
Jens Axboe | 2056a78 | 2006-03-23 20:00:26 +0100 | [diff] [blame] | 1511 | old_dev = bio->bi_bdev->bd_dev; |
| 1512 | |
Jens Axboe | c07e2b4 | 2007-07-18 13:27:58 +0200 | [diff] [blame] | 1513 | if (bio_check_eod(bio, nr_sectors)) |
| 1514 | goto end_io; |
Tejun Heo | a738467 | 2008-11-28 13:32:03 +0900 | [diff] [blame] | 1515 | |
Christoph Hellwig | 7b6d91d | 2010-08-07 18:20:39 +0200 | [diff] [blame] | 1516 | if ((bio->bi_rw & REQ_DISCARD) && !blk_queue_discard(q)) { |
Jens Axboe | 51fd77b | 2007-11-02 08:49:08 +0100 | [diff] [blame] | 1517 | err = -EOPNOTSUPP; |
| 1518 | goto end_io; |
| 1519 | } |
NeilBrown | 5ddfe96 | 2006-10-30 22:07:21 -0800 | [diff] [blame] | 1520 | |
Minchan Kim | 01edede | 2009-09-08 21:56:38 +0200 | [diff] [blame] | 1521 | trace_block_bio_queue(q, bio); |
| 1522 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1523 | ret = q->make_request_fn(q, bio); |
| 1524 | } while (ret); |
Tejun Heo | a738467 | 2008-11-28 13:32:03 +0900 | [diff] [blame] | 1525 | |
| 1526 | return; |
| 1527 | |
| 1528 | end_io: |
| 1529 | bio_endio(bio, err); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1530 | } |
| 1531 | |
Neil Brown | d89d879 | 2007-05-01 09:53:42 +0200 | [diff] [blame] | 1532 | /* |
| 1533 | * We only want one ->make_request_fn to be active at a time, |
| 1534 | * else stack usage with stacked devices could be a problem. |
Akinobu Mita | bddd87c | 2010-02-23 08:55:42 +0100 | [diff] [blame] | 1535 | * So use current->bio_list to keep a list of requests |
Neil Brown | d89d879 | 2007-05-01 09:53:42 +0200 | [diff] [blame] | 1536 | * submited by a make_request_fn function. |
Akinobu Mita | bddd87c | 2010-02-23 08:55:42 +0100 | [diff] [blame] | 1537 | * current->bio_list is also used as a flag to say if |
Neil Brown | d89d879 | 2007-05-01 09:53:42 +0200 | [diff] [blame] | 1538 | * generic_make_request is currently active in this task or not. |
| 1539 | * If it is NULL, then no make_request is active. If it is non-NULL, |
| 1540 | * then a make_request is active, and new requests should be added |
| 1541 | * at the tail |
| 1542 | */ |
| 1543 | void generic_make_request(struct bio *bio) |
| 1544 | { |
Akinobu Mita | bddd87c | 2010-02-23 08:55:42 +0100 | [diff] [blame] | 1545 | struct bio_list bio_list_on_stack; |
| 1546 | |
| 1547 | if (current->bio_list) { |
Neil Brown | d89d879 | 2007-05-01 09:53:42 +0200 | [diff] [blame] | 1548 | /* make_request is active */ |
Akinobu Mita | bddd87c | 2010-02-23 08:55:42 +0100 | [diff] [blame] | 1549 | bio_list_add(current->bio_list, bio); |
Neil Brown | d89d879 | 2007-05-01 09:53:42 +0200 | [diff] [blame] | 1550 | return; |
| 1551 | } |
| 1552 | /* following loop may be a bit non-obvious, and so deserves some |
| 1553 | * explanation. |
| 1554 | * Before entering the loop, bio->bi_next is NULL (as all callers |
| 1555 | * ensure that) so we have a list with a single bio. |
| 1556 | * We pretend that we have just taken it off a longer list, so |
Akinobu Mita | bddd87c | 2010-02-23 08:55:42 +0100 | [diff] [blame] | 1557 | * we assign bio_list to a pointer to the bio_list_on_stack, |
| 1558 | * thus initialising the bio_list of new bios to be |
Neil Brown | d89d879 | 2007-05-01 09:53:42 +0200 | [diff] [blame] | 1559 | * added. __generic_make_request may indeed add some more bios |
| 1560 | * through a recursive call to generic_make_request. If it |
| 1561 | * did, we find a non-NULL value in bio_list and re-enter the loop |
| 1562 | * from the top. In this case we really did just take the bio |
Akinobu Mita | bddd87c | 2010-02-23 08:55:42 +0100 | [diff] [blame] | 1563 | * of the top of the list (no pretending) and so remove it from |
| 1564 | * bio_list, and call into __generic_make_request again. |
Neil Brown | d89d879 | 2007-05-01 09:53:42 +0200 | [diff] [blame] | 1565 | * |
| 1566 | * The loop was structured like this to make only one call to |
| 1567 | * __generic_make_request (which is important as it is large and |
| 1568 | * inlined) and to keep the structure simple. |
| 1569 | */ |
| 1570 | BUG_ON(bio->bi_next); |
Akinobu Mita | bddd87c | 2010-02-23 08:55:42 +0100 | [diff] [blame] | 1571 | bio_list_init(&bio_list_on_stack); |
| 1572 | current->bio_list = &bio_list_on_stack; |
Neil Brown | d89d879 | 2007-05-01 09:53:42 +0200 | [diff] [blame] | 1573 | do { |
Neil Brown | d89d879 | 2007-05-01 09:53:42 +0200 | [diff] [blame] | 1574 | __generic_make_request(bio); |
Akinobu Mita | bddd87c | 2010-02-23 08:55:42 +0100 | [diff] [blame] | 1575 | bio = bio_list_pop(current->bio_list); |
Neil Brown | d89d879 | 2007-05-01 09:53:42 +0200 | [diff] [blame] | 1576 | } while (bio); |
Akinobu Mita | bddd87c | 2010-02-23 08:55:42 +0100 | [diff] [blame] | 1577 | current->bio_list = NULL; /* deactivate */ |
Neil Brown | d89d879 | 2007-05-01 09:53:42 +0200 | [diff] [blame] | 1578 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1579 | EXPORT_SYMBOL(generic_make_request); |
| 1580 | |
| 1581 | /** |
Randy Dunlap | 710027a | 2008-08-19 20:13:11 +0200 | [diff] [blame] | 1582 | * submit_bio - submit a bio to the block device layer for I/O |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1583 | * @rw: whether to %READ or %WRITE, or maybe to %READA (read ahead) |
| 1584 | * @bio: The &struct bio which describes the I/O |
| 1585 | * |
| 1586 | * submit_bio() is very similar in purpose to generic_make_request(), and |
| 1587 | * uses that function to do most of the work. Both are fairly rough |
Randy Dunlap | 710027a | 2008-08-19 20:13:11 +0200 | [diff] [blame] | 1588 | * interfaces; @bio must be presetup and ready for I/O. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1589 | * |
| 1590 | */ |
| 1591 | void submit_bio(int rw, struct bio *bio) |
| 1592 | { |
| 1593 | int count = bio_sectors(bio); |
| 1594 | |
Jens Axboe | 22e2c50 | 2005-06-27 10:55:12 +0200 | [diff] [blame] | 1595 | bio->bi_rw |= rw; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1596 | |
Jens Axboe | bf2de6f | 2007-09-27 13:01:25 +0200 | [diff] [blame] | 1597 | /* |
| 1598 | * If it's a regular read/write or a barrier with data attached, |
| 1599 | * go through the normal accounting stuff before submission. |
| 1600 | */ |
Jens Axboe | 3ffb52e | 2010-06-29 13:33:38 +0200 | [diff] [blame] | 1601 | if (bio_has_data(bio) && !(rw & REQ_DISCARD)) { |
Jens Axboe | bf2de6f | 2007-09-27 13:01:25 +0200 | [diff] [blame] | 1602 | if (rw & WRITE) { |
| 1603 | count_vm_events(PGPGOUT, count); |
| 1604 | } else { |
| 1605 | task_io_account_read(bio->bi_size); |
| 1606 | count_vm_events(PGPGIN, count); |
| 1607 | } |
| 1608 | |
| 1609 | if (unlikely(block_dump)) { |
| 1610 | char b[BDEVNAME_SIZE]; |
| 1611 | printk(KERN_DEBUG "%s(%d): %s block %Lu on %s\n", |
Pavel Emelyanov | ba25f9d | 2007-10-18 23:40:40 -0700 | [diff] [blame] | 1612 | current->comm, task_pid_nr(current), |
Jens Axboe | bf2de6f | 2007-09-27 13:01:25 +0200 | [diff] [blame] | 1613 | (rw & WRITE) ? "WRITE" : "READ", |
| 1614 | (unsigned long long)bio->bi_sector, |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 1615 | bdevname(bio->bi_bdev, b)); |
Jens Axboe | bf2de6f | 2007-09-27 13:01:25 +0200 | [diff] [blame] | 1616 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1617 | } |
| 1618 | |
| 1619 | generic_make_request(bio); |
| 1620 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1621 | EXPORT_SYMBOL(submit_bio); |
| 1622 | |
Kiyoshi Ueda | 3bcddea | 2007-12-11 17:52:28 -0500 | [diff] [blame] | 1623 | /** |
Kiyoshi Ueda | 82124d6 | 2008-09-18 10:45:38 -0400 | [diff] [blame] | 1624 | * blk_rq_check_limits - Helper function to check a request for the queue limit |
| 1625 | * @q: the queue |
| 1626 | * @rq: the request being checked |
| 1627 | * |
| 1628 | * Description: |
| 1629 | * @rq may have been made based on weaker limitations of upper-level queues |
| 1630 | * in request stacking drivers, and it may violate the limitation of @q. |
| 1631 | * Since the block layer and the underlying device driver trust @rq |
| 1632 | * after it is inserted to @q, it should be checked against @q before |
| 1633 | * the insertion using this generic function. |
| 1634 | * |
| 1635 | * This function should also be useful for request stacking drivers |
| 1636 | * in some cases below, so export this fuction. |
| 1637 | * Request stacking drivers like request-based dm may change the queue |
| 1638 | * limits while requests are in the queue (e.g. dm's table swapping). |
| 1639 | * Such request stacking drivers should check those requests agaist |
| 1640 | * the new queue limits again when they dispatch those requests, |
| 1641 | * although such checkings are also done against the old queue limits |
| 1642 | * when submitting requests. |
| 1643 | */ |
| 1644 | int blk_rq_check_limits(struct request_queue *q, struct request *rq) |
| 1645 | { |
Martin K. Petersen | ae03bf6 | 2009-05-22 17:17:50 -0400 | [diff] [blame] | 1646 | if (blk_rq_sectors(rq) > queue_max_sectors(q) || |
| 1647 | blk_rq_bytes(rq) > queue_max_hw_sectors(q) << 9) { |
Kiyoshi Ueda | 82124d6 | 2008-09-18 10:45:38 -0400 | [diff] [blame] | 1648 | printk(KERN_ERR "%s: over max size limit.\n", __func__); |
| 1649 | return -EIO; |
| 1650 | } |
| 1651 | |
| 1652 | /* |
| 1653 | * queue's settings related to segment counting like q->bounce_pfn |
| 1654 | * may differ from that of other stacking queues. |
| 1655 | * Recalculate it to check the request correctly on this queue's |
| 1656 | * limitation. |
| 1657 | */ |
| 1658 | blk_recalc_rq_segments(rq); |
Martin K. Petersen | 8a78362 | 2010-02-26 00:20:39 -0500 | [diff] [blame] | 1659 | if (rq->nr_phys_segments > queue_max_segments(q)) { |
Kiyoshi Ueda | 82124d6 | 2008-09-18 10:45:38 -0400 | [diff] [blame] | 1660 | printk(KERN_ERR "%s: over max segments limit.\n", __func__); |
| 1661 | return -EIO; |
| 1662 | } |
| 1663 | |
| 1664 | return 0; |
| 1665 | } |
| 1666 | EXPORT_SYMBOL_GPL(blk_rq_check_limits); |
| 1667 | |
| 1668 | /** |
| 1669 | * blk_insert_cloned_request - Helper for stacking drivers to submit a request |
| 1670 | * @q: the queue to submit the request |
| 1671 | * @rq: the request being queued |
| 1672 | */ |
| 1673 | int blk_insert_cloned_request(struct request_queue *q, struct request *rq) |
| 1674 | { |
| 1675 | unsigned long flags; |
| 1676 | |
| 1677 | if (blk_rq_check_limits(q, rq)) |
| 1678 | return -EIO; |
| 1679 | |
| 1680 | #ifdef CONFIG_FAIL_MAKE_REQUEST |
| 1681 | if (rq->rq_disk && rq->rq_disk->part0.make_it_fail && |
| 1682 | should_fail(&fail_make_request, blk_rq_bytes(rq))) |
| 1683 | return -EIO; |
| 1684 | #endif |
| 1685 | |
| 1686 | spin_lock_irqsave(q->queue_lock, flags); |
| 1687 | |
| 1688 | /* |
| 1689 | * Submitting request must be dequeued before calling this function |
| 1690 | * because it will be linked to another request_queue |
| 1691 | */ |
| 1692 | BUG_ON(blk_queued_rq(rq)); |
| 1693 | |
| 1694 | drive_stat_acct(rq, 1); |
| 1695 | __elv_add_request(q, rq, ELEVATOR_INSERT_BACK, 0); |
| 1696 | |
| 1697 | spin_unlock_irqrestore(q->queue_lock, flags); |
| 1698 | |
| 1699 | return 0; |
| 1700 | } |
| 1701 | EXPORT_SYMBOL_GPL(blk_insert_cloned_request); |
| 1702 | |
Tejun Heo | 80a761f | 2009-07-03 17:48:17 +0900 | [diff] [blame] | 1703 | /** |
| 1704 | * blk_rq_err_bytes - determine number of bytes till the next failure boundary |
| 1705 | * @rq: request to examine |
| 1706 | * |
| 1707 | * Description: |
| 1708 | * A request could be merge of IOs which require different failure |
| 1709 | * handling. This function determines the number of bytes which |
| 1710 | * can be failed from the beginning of the request without |
| 1711 | * crossing into area which need to be retried further. |
| 1712 | * |
| 1713 | * Return: |
| 1714 | * The number of bytes to fail. |
| 1715 | * |
| 1716 | * Context: |
| 1717 | * queue_lock must be held. |
| 1718 | */ |
| 1719 | unsigned int blk_rq_err_bytes(const struct request *rq) |
| 1720 | { |
| 1721 | unsigned int ff = rq->cmd_flags & REQ_FAILFAST_MASK; |
| 1722 | unsigned int bytes = 0; |
| 1723 | struct bio *bio; |
| 1724 | |
| 1725 | if (!(rq->cmd_flags & REQ_MIXED_MERGE)) |
| 1726 | return blk_rq_bytes(rq); |
| 1727 | |
| 1728 | /* |
| 1729 | * Currently the only 'mixing' which can happen is between |
| 1730 | * different fastfail types. We can safely fail portions |
| 1731 | * which have all the failfast bits that the first one has - |
| 1732 | * the ones which are at least as eager to fail as the first |
| 1733 | * one. |
| 1734 | */ |
| 1735 | for (bio = rq->bio; bio; bio = bio->bi_next) { |
| 1736 | if ((bio->bi_rw & ff) != ff) |
| 1737 | break; |
| 1738 | bytes += bio->bi_size; |
| 1739 | } |
| 1740 | |
| 1741 | /* this could lead to infinite loop */ |
| 1742 | BUG_ON(blk_rq_bytes(rq) && !bytes); |
| 1743 | return bytes; |
| 1744 | } |
| 1745 | EXPORT_SYMBOL_GPL(blk_rq_err_bytes); |
| 1746 | |
Jens Axboe | bc58ba9 | 2009-01-23 10:54:44 +0100 | [diff] [blame] | 1747 | static void blk_account_io_completion(struct request *req, unsigned int bytes) |
| 1748 | { |
Jens Axboe | c2553b5 | 2009-04-24 08:10:11 +0200 | [diff] [blame] | 1749 | if (blk_do_io_stat(req)) { |
Jens Axboe | bc58ba9 | 2009-01-23 10:54:44 +0100 | [diff] [blame] | 1750 | const int rw = rq_data_dir(req); |
| 1751 | struct hd_struct *part; |
| 1752 | int cpu; |
| 1753 | |
| 1754 | cpu = part_stat_lock(); |
Tejun Heo | 83096eb | 2009-05-07 22:24:39 +0900 | [diff] [blame] | 1755 | part = disk_map_sector_rcu(req->rq_disk, blk_rq_pos(req)); |
Jens Axboe | bc58ba9 | 2009-01-23 10:54:44 +0100 | [diff] [blame] | 1756 | part_stat_add(cpu, part, sectors[rw], bytes >> 9); |
| 1757 | part_stat_unlock(); |
| 1758 | } |
| 1759 | } |
| 1760 | |
| 1761 | static void blk_account_io_done(struct request *req) |
| 1762 | { |
Jens Axboe | bc58ba9 | 2009-01-23 10:54:44 +0100 | [diff] [blame] | 1763 | /* |
| 1764 | * Account IO completion. bar_rq isn't accounted as a normal |
| 1765 | * IO on queueing nor completion. Accounting the containing |
| 1766 | * request is enough. |
| 1767 | */ |
Jens Axboe | c2553b5 | 2009-04-24 08:10:11 +0200 | [diff] [blame] | 1768 | if (blk_do_io_stat(req) && req != &req->q->bar_rq) { |
Jens Axboe | bc58ba9 | 2009-01-23 10:54:44 +0100 | [diff] [blame] | 1769 | unsigned long duration = jiffies - req->start_time; |
| 1770 | const int rw = rq_data_dir(req); |
| 1771 | struct hd_struct *part; |
| 1772 | int cpu; |
| 1773 | |
| 1774 | cpu = part_stat_lock(); |
Tejun Heo | 83096eb | 2009-05-07 22:24:39 +0900 | [diff] [blame] | 1775 | part = disk_map_sector_rcu(req->rq_disk, blk_rq_pos(req)); |
Jens Axboe | bc58ba9 | 2009-01-23 10:54:44 +0100 | [diff] [blame] | 1776 | |
| 1777 | part_stat_inc(cpu, part, ios[rw]); |
| 1778 | part_stat_add(cpu, part, ticks[rw], duration); |
| 1779 | part_round_stats(cpu, part); |
Nikanth Karthikesan | 316d315 | 2009-10-06 20:16:55 +0200 | [diff] [blame] | 1780 | part_dec_in_flight(part, rw); |
Jens Axboe | bc58ba9 | 2009-01-23 10:54:44 +0100 | [diff] [blame] | 1781 | |
| 1782 | part_stat_unlock(); |
| 1783 | } |
| 1784 | } |
| 1785 | |
Tejun Heo | 53a0880 | 2008-12-03 12:41:26 +0100 | [diff] [blame] | 1786 | /** |
Tejun Heo | 9934c8c | 2009-05-08 11:54:16 +0900 | [diff] [blame] | 1787 | * blk_peek_request - peek at the top of a request queue |
| 1788 | * @q: request queue to peek at |
Kiyoshi Ueda | 3bcddea | 2007-12-11 17:52:28 -0500 | [diff] [blame] | 1789 | * |
| 1790 | * Description: |
Tejun Heo | 9934c8c | 2009-05-08 11:54:16 +0900 | [diff] [blame] | 1791 | * Return the request at the top of @q. The returned request |
| 1792 | * should be started using blk_start_request() before LLD starts |
| 1793 | * processing it. |
Kiyoshi Ueda | 3bcddea | 2007-12-11 17:52:28 -0500 | [diff] [blame] | 1794 | * |
| 1795 | * Return: |
Tejun Heo | 9934c8c | 2009-05-08 11:54:16 +0900 | [diff] [blame] | 1796 | * Pointer to the request at the top of @q if available. Null |
| 1797 | * otherwise. |
| 1798 | * |
| 1799 | * Context: |
| 1800 | * queue_lock must be held. |
| 1801 | */ |
| 1802 | struct request *blk_peek_request(struct request_queue *q) |
Tejun Heo | 158dbda | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 1803 | { |
| 1804 | struct request *rq; |
| 1805 | int ret; |
| 1806 | |
| 1807 | while ((rq = __elv_next_request(q)) != NULL) { |
| 1808 | if (!(rq->cmd_flags & REQ_STARTED)) { |
| 1809 | /* |
| 1810 | * This is the first time the device driver |
| 1811 | * sees this request (possibly after |
| 1812 | * requeueing). Notify IO scheduler. |
| 1813 | */ |
Christoph Hellwig | 33659eb | 2010-08-07 18:17:56 +0200 | [diff] [blame] | 1814 | if (rq->cmd_flags & REQ_SORTED) |
Tejun Heo | 158dbda | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 1815 | elv_activate_rq(q, rq); |
| 1816 | |
| 1817 | /* |
| 1818 | * just mark as started even if we don't start |
| 1819 | * it, a request that has been delayed should |
| 1820 | * not be passed by new incoming requests |
| 1821 | */ |
| 1822 | rq->cmd_flags |= REQ_STARTED; |
| 1823 | trace_block_rq_issue(q, rq); |
| 1824 | } |
| 1825 | |
| 1826 | if (!q->boundary_rq || q->boundary_rq == rq) { |
| 1827 | q->end_sector = rq_end_sector(rq); |
| 1828 | q->boundary_rq = NULL; |
| 1829 | } |
| 1830 | |
| 1831 | if (rq->cmd_flags & REQ_DONTPREP) |
| 1832 | break; |
| 1833 | |
Tejun Heo | 2e46e8b | 2009-05-07 22:24:41 +0900 | [diff] [blame] | 1834 | if (q->dma_drain_size && blk_rq_bytes(rq)) { |
Tejun Heo | 158dbda | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 1835 | /* |
| 1836 | * make sure space for the drain appears we |
| 1837 | * know we can do this because max_hw_segments |
| 1838 | * has been adjusted to be one fewer than the |
| 1839 | * device can handle |
| 1840 | */ |
| 1841 | rq->nr_phys_segments++; |
| 1842 | } |
| 1843 | |
| 1844 | if (!q->prep_rq_fn) |
| 1845 | break; |
| 1846 | |
| 1847 | ret = q->prep_rq_fn(q, rq); |
| 1848 | if (ret == BLKPREP_OK) { |
| 1849 | break; |
| 1850 | } else if (ret == BLKPREP_DEFER) { |
| 1851 | /* |
| 1852 | * the request may have been (partially) prepped. |
| 1853 | * we need to keep this request in the front to |
| 1854 | * avoid resource deadlock. REQ_STARTED will |
| 1855 | * prevent other fs requests from passing this one. |
| 1856 | */ |
Tejun Heo | 2e46e8b | 2009-05-07 22:24:41 +0900 | [diff] [blame] | 1857 | if (q->dma_drain_size && blk_rq_bytes(rq) && |
Tejun Heo | 158dbda | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 1858 | !(rq->cmd_flags & REQ_DONTPREP)) { |
| 1859 | /* |
| 1860 | * remove the space for the drain we added |
| 1861 | * so that we don't add it again |
| 1862 | */ |
| 1863 | --rq->nr_phys_segments; |
| 1864 | } |
| 1865 | |
| 1866 | rq = NULL; |
| 1867 | break; |
| 1868 | } else if (ret == BLKPREP_KILL) { |
| 1869 | rq->cmd_flags |= REQ_QUIET; |
James Bottomley | c143dc9 | 2009-05-30 06:43:49 +0200 | [diff] [blame] | 1870 | /* |
| 1871 | * Mark this request as started so we don't trigger |
| 1872 | * any debug logic in the end I/O path. |
| 1873 | */ |
| 1874 | blk_start_request(rq); |
Tejun Heo | 40cbbb7 | 2009-04-23 11:05:19 +0900 | [diff] [blame] | 1875 | __blk_end_request_all(rq, -EIO); |
Tejun Heo | 158dbda | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 1876 | } else { |
| 1877 | printk(KERN_ERR "%s: bad return=%d\n", __func__, ret); |
| 1878 | break; |
| 1879 | } |
| 1880 | } |
| 1881 | |
| 1882 | return rq; |
| 1883 | } |
Tejun Heo | 9934c8c | 2009-05-08 11:54:16 +0900 | [diff] [blame] | 1884 | EXPORT_SYMBOL(blk_peek_request); |
Tejun Heo | 158dbda | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 1885 | |
Tejun Heo | 9934c8c | 2009-05-08 11:54:16 +0900 | [diff] [blame] | 1886 | void blk_dequeue_request(struct request *rq) |
Tejun Heo | 158dbda | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 1887 | { |
Tejun Heo | 9934c8c | 2009-05-08 11:54:16 +0900 | [diff] [blame] | 1888 | struct request_queue *q = rq->q; |
| 1889 | |
Tejun Heo | 158dbda | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 1890 | BUG_ON(list_empty(&rq->queuelist)); |
| 1891 | BUG_ON(ELV_ON_HASH(rq)); |
| 1892 | |
| 1893 | list_del_init(&rq->queuelist); |
| 1894 | |
| 1895 | /* |
| 1896 | * the time frame between a request being removed from the lists |
| 1897 | * and to it is freed is accounted as io that is in progress at |
| 1898 | * the driver side. |
| 1899 | */ |
Divyesh Shah | 9195291 | 2010-04-01 15:01:41 -0700 | [diff] [blame] | 1900 | if (blk_account_rq(rq)) { |
Jens Axboe | 0a7ae2f | 2009-05-20 08:54:31 +0200 | [diff] [blame] | 1901 | q->in_flight[rq_is_sync(rq)]++; |
Divyesh Shah | 9195291 | 2010-04-01 15:01:41 -0700 | [diff] [blame] | 1902 | set_io_start_time_ns(rq); |
| 1903 | } |
Tejun Heo | 158dbda | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 1904 | } |
| 1905 | |
Tejun Heo | 5efccd1 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 1906 | /** |
Tejun Heo | 9934c8c | 2009-05-08 11:54:16 +0900 | [diff] [blame] | 1907 | * blk_start_request - start request processing on the driver |
| 1908 | * @req: request to dequeue |
| 1909 | * |
| 1910 | * Description: |
| 1911 | * Dequeue @req and start timeout timer on it. This hands off the |
| 1912 | * request to the driver. |
| 1913 | * |
| 1914 | * Block internal functions which don't want to start timer should |
| 1915 | * call blk_dequeue_request(). |
| 1916 | * |
| 1917 | * Context: |
| 1918 | * queue_lock must be held. |
| 1919 | */ |
| 1920 | void blk_start_request(struct request *req) |
| 1921 | { |
| 1922 | blk_dequeue_request(req); |
| 1923 | |
| 1924 | /* |
Tejun Heo | 5f49f63 | 2009-05-19 18:33:05 +0900 | [diff] [blame] | 1925 | * We are now handing the request to the hardware, initialize |
| 1926 | * resid_len to full count and add the timeout handler. |
Tejun Heo | 9934c8c | 2009-05-08 11:54:16 +0900 | [diff] [blame] | 1927 | */ |
Tejun Heo | 5f49f63 | 2009-05-19 18:33:05 +0900 | [diff] [blame] | 1928 | req->resid_len = blk_rq_bytes(req); |
FUJITA Tomonori | dbb66c4 | 2009-06-09 05:47:10 +0200 | [diff] [blame] | 1929 | if (unlikely(blk_bidi_rq(req))) |
| 1930 | req->next_rq->resid_len = blk_rq_bytes(req->next_rq); |
| 1931 | |
Tejun Heo | 9934c8c | 2009-05-08 11:54:16 +0900 | [diff] [blame] | 1932 | blk_add_timer(req); |
| 1933 | } |
| 1934 | EXPORT_SYMBOL(blk_start_request); |
| 1935 | |
| 1936 | /** |
| 1937 | * blk_fetch_request - fetch a request from a request queue |
| 1938 | * @q: request queue to fetch a request from |
| 1939 | * |
| 1940 | * Description: |
| 1941 | * Return the request at the top of @q. The request is started on |
| 1942 | * return and LLD can start processing it immediately. |
| 1943 | * |
| 1944 | * Return: |
| 1945 | * Pointer to the request at the top of @q if available. Null |
| 1946 | * otherwise. |
| 1947 | * |
| 1948 | * Context: |
| 1949 | * queue_lock must be held. |
| 1950 | */ |
| 1951 | struct request *blk_fetch_request(struct request_queue *q) |
| 1952 | { |
| 1953 | struct request *rq; |
| 1954 | |
| 1955 | rq = blk_peek_request(q); |
| 1956 | if (rq) |
| 1957 | blk_start_request(rq); |
| 1958 | return rq; |
| 1959 | } |
| 1960 | EXPORT_SYMBOL(blk_fetch_request); |
| 1961 | |
| 1962 | /** |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 1963 | * blk_update_request - Special helper function for request stacking drivers |
Randy Dunlap | 8ebf975 | 2009-06-11 20:00:41 -0700 | [diff] [blame] | 1964 | * @req: the request being processed |
Kiyoshi Ueda | 3bcddea | 2007-12-11 17:52:28 -0500 | [diff] [blame] | 1965 | * @error: %0 for success, < %0 for error |
Randy Dunlap | 8ebf975 | 2009-06-11 20:00:41 -0700 | [diff] [blame] | 1966 | * @nr_bytes: number of bytes to complete @req |
Kiyoshi Ueda | 3bcddea | 2007-12-11 17:52:28 -0500 | [diff] [blame] | 1967 | * |
| 1968 | * Description: |
Randy Dunlap | 8ebf975 | 2009-06-11 20:00:41 -0700 | [diff] [blame] | 1969 | * Ends I/O on a number of bytes attached to @req, but doesn't complete |
| 1970 | * the request structure even if @req doesn't have leftover. |
| 1971 | * If @req has leftover, sets it up for the next range of segments. |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 1972 | * |
| 1973 | * This special helper function is only for request stacking drivers |
| 1974 | * (e.g. request-based dm) so that they can handle partial completion. |
| 1975 | * Actual device drivers should use blk_end_request instead. |
| 1976 | * |
| 1977 | * Passing the result of blk_rq_bytes() as @nr_bytes guarantees |
| 1978 | * %false return from this function. |
Kiyoshi Ueda | 3bcddea | 2007-12-11 17:52:28 -0500 | [diff] [blame] | 1979 | * |
| 1980 | * Return: |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 1981 | * %false - this request doesn't have any more data |
| 1982 | * %true - this request has more data |
Kiyoshi Ueda | 3bcddea | 2007-12-11 17:52:28 -0500 | [diff] [blame] | 1983 | **/ |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 1984 | bool blk_update_request(struct request *req, int error, unsigned int nr_bytes) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1985 | { |
Kiyoshi Ueda | 5450d3e | 2007-12-11 17:53:03 -0500 | [diff] [blame] | 1986 | int total_bytes, bio_nbytes, next_idx = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1987 | struct bio *bio; |
| 1988 | |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 1989 | if (!req->bio) |
| 1990 | return false; |
| 1991 | |
Arnaldo Carvalho de Melo | 5f3ea37 | 2008-10-30 08:34:33 +0100 | [diff] [blame] | 1992 | trace_block_rq_complete(req->q, req); |
Jens Axboe | 2056a78 | 2006-03-23 20:00:26 +0100 | [diff] [blame] | 1993 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1994 | /* |
Tejun Heo | 6f41469 | 2009-04-19 07:00:41 +0900 | [diff] [blame] | 1995 | * For fs requests, rq is just carrier of independent bio's |
| 1996 | * and each partial completion should be handled separately. |
| 1997 | * Reset per-request error on each partial completion. |
| 1998 | * |
| 1999 | * TODO: tj: This is too subtle. It would be better to let |
| 2000 | * low level drivers do what they see fit. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2001 | */ |
Christoph Hellwig | 33659eb | 2010-08-07 18:17:56 +0200 | [diff] [blame] | 2002 | if (req->cmd_type == REQ_TYPE_FS) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2003 | req->errors = 0; |
| 2004 | |
Christoph Hellwig | 33659eb | 2010-08-07 18:17:56 +0200 | [diff] [blame] | 2005 | if (error && req->cmd_type == REQ_TYPE_FS && |
| 2006 | !(req->cmd_flags & REQ_QUIET)) { |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 2007 | printk(KERN_ERR "end_request: I/O error, dev %s, sector %llu\n", |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2008 | req->rq_disk ? req->rq_disk->disk_name : "?", |
Tejun Heo | 83096eb | 2009-05-07 22:24:39 +0900 | [diff] [blame] | 2009 | (unsigned long long)blk_rq_pos(req)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2010 | } |
| 2011 | |
Jens Axboe | bc58ba9 | 2009-01-23 10:54:44 +0100 | [diff] [blame] | 2012 | blk_account_io_completion(req, nr_bytes); |
Jens Axboe | d72d904 | 2005-11-01 08:35:42 +0100 | [diff] [blame] | 2013 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2014 | total_bytes = bio_nbytes = 0; |
| 2015 | while ((bio = req->bio) != NULL) { |
| 2016 | int nbytes; |
| 2017 | |
| 2018 | if (nr_bytes >= bio->bi_size) { |
| 2019 | req->bio = bio->bi_next; |
| 2020 | nbytes = bio->bi_size; |
NeilBrown | 5bb23a6 | 2007-09-27 12:46:13 +0200 | [diff] [blame] | 2021 | req_bio_endio(req, bio, nbytes, error); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2022 | next_idx = 0; |
| 2023 | bio_nbytes = 0; |
| 2024 | } else { |
| 2025 | int idx = bio->bi_idx + next_idx; |
| 2026 | |
Kazuhisa Ichikawa | af498d7 | 2009-05-12 13:27:45 +0200 | [diff] [blame] | 2027 | if (unlikely(idx >= bio->bi_vcnt)) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2028 | blk_dump_rq_flags(req, "__end_that"); |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 2029 | printk(KERN_ERR "%s: bio idx %d >= vcnt %d\n", |
Kazuhisa Ichikawa | af498d7 | 2009-05-12 13:27:45 +0200 | [diff] [blame] | 2030 | __func__, idx, bio->bi_vcnt); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2031 | break; |
| 2032 | } |
| 2033 | |
| 2034 | nbytes = bio_iovec_idx(bio, idx)->bv_len; |
| 2035 | BIO_BUG_ON(nbytes > bio->bi_size); |
| 2036 | |
| 2037 | /* |
| 2038 | * not a complete bvec done |
| 2039 | */ |
| 2040 | if (unlikely(nbytes > nr_bytes)) { |
| 2041 | bio_nbytes += nr_bytes; |
| 2042 | total_bytes += nr_bytes; |
| 2043 | break; |
| 2044 | } |
| 2045 | |
| 2046 | /* |
| 2047 | * advance to the next vector |
| 2048 | */ |
| 2049 | next_idx++; |
| 2050 | bio_nbytes += nbytes; |
| 2051 | } |
| 2052 | |
| 2053 | total_bytes += nbytes; |
| 2054 | nr_bytes -= nbytes; |
| 2055 | |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 2056 | bio = req->bio; |
| 2057 | if (bio) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2058 | /* |
| 2059 | * end more in this run, or just return 'not-done' |
| 2060 | */ |
| 2061 | if (unlikely(nr_bytes <= 0)) |
| 2062 | break; |
| 2063 | } |
| 2064 | } |
| 2065 | |
| 2066 | /* |
| 2067 | * completely done |
| 2068 | */ |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2069 | if (!req->bio) { |
| 2070 | /* |
| 2071 | * Reset counters so that the request stacking driver |
| 2072 | * can find how many bytes remain in the request |
| 2073 | * later. |
| 2074 | */ |
Tejun Heo | a2dec7b | 2009-05-07 22:24:44 +0900 | [diff] [blame] | 2075 | req->__data_len = 0; |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2076 | return false; |
| 2077 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2078 | |
| 2079 | /* |
| 2080 | * if the request wasn't completed, update state |
| 2081 | */ |
| 2082 | if (bio_nbytes) { |
NeilBrown | 5bb23a6 | 2007-09-27 12:46:13 +0200 | [diff] [blame] | 2083 | req_bio_endio(req, bio, bio_nbytes, error); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2084 | bio->bi_idx += next_idx; |
| 2085 | bio_iovec(bio)->bv_offset += nr_bytes; |
| 2086 | bio_iovec(bio)->bv_len -= nr_bytes; |
| 2087 | } |
| 2088 | |
Tejun Heo | a2dec7b | 2009-05-07 22:24:44 +0900 | [diff] [blame] | 2089 | req->__data_len -= total_bytes; |
Tejun Heo | 2e46e8b | 2009-05-07 22:24:41 +0900 | [diff] [blame] | 2090 | req->buffer = bio_data(req->bio); |
| 2091 | |
| 2092 | /* update sector only for requests with clear definition of sector */ |
Christoph Hellwig | 33659eb | 2010-08-07 18:17:56 +0200 | [diff] [blame] | 2093 | if (req->cmd_type == REQ_TYPE_FS || (req->cmd_flags & REQ_DISCARD)) |
Tejun Heo | a2dec7b | 2009-05-07 22:24:44 +0900 | [diff] [blame] | 2094 | req->__sector += total_bytes >> 9; |
Tejun Heo | 2e46e8b | 2009-05-07 22:24:41 +0900 | [diff] [blame] | 2095 | |
Tejun Heo | 80a761f | 2009-07-03 17:48:17 +0900 | [diff] [blame] | 2096 | /* mixed attributes always follow the first bio */ |
| 2097 | if (req->cmd_flags & REQ_MIXED_MERGE) { |
| 2098 | req->cmd_flags &= ~REQ_FAILFAST_MASK; |
| 2099 | req->cmd_flags |= req->bio->bi_rw & REQ_FAILFAST_MASK; |
| 2100 | } |
| 2101 | |
Tejun Heo | 2e46e8b | 2009-05-07 22:24:41 +0900 | [diff] [blame] | 2102 | /* |
| 2103 | * If total number of sectors is less than the first segment |
| 2104 | * size, something has gone terribly wrong. |
| 2105 | */ |
| 2106 | if (blk_rq_bytes(req) < blk_rq_cur_bytes(req)) { |
| 2107 | printk(KERN_ERR "blk: request botched\n"); |
Tejun Heo | a2dec7b | 2009-05-07 22:24:44 +0900 | [diff] [blame] | 2108 | req->__data_len = blk_rq_cur_bytes(req); |
Tejun Heo | 2e46e8b | 2009-05-07 22:24:41 +0900 | [diff] [blame] | 2109 | } |
| 2110 | |
| 2111 | /* recalculate the number of segments */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2112 | blk_recalc_rq_segments(req); |
Tejun Heo | 2e46e8b | 2009-05-07 22:24:41 +0900 | [diff] [blame] | 2113 | |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2114 | return true; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2115 | } |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2116 | EXPORT_SYMBOL_GPL(blk_update_request); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2117 | |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2118 | static bool blk_update_bidi_request(struct request *rq, int error, |
| 2119 | unsigned int nr_bytes, |
| 2120 | unsigned int bidi_bytes) |
Tejun Heo | 5efccd1 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2121 | { |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2122 | if (blk_update_request(rq, error, nr_bytes)) |
| 2123 | return true; |
Tejun Heo | 5efccd1 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2124 | |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2125 | /* Bidi request must be completed as a whole */ |
| 2126 | if (unlikely(blk_bidi_rq(rq)) && |
| 2127 | blk_update_request(rq->next_rq, error, bidi_bytes)) |
| 2128 | return true; |
Tejun Heo | 5efccd1 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2129 | |
Jens Axboe | e2e1a14 | 2010-06-09 10:42:09 +0200 | [diff] [blame] | 2130 | if (blk_queue_add_random(rq->q)) |
| 2131 | add_disk_randomness(rq->rq_disk); |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2132 | |
| 2133 | return false; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2134 | } |
| 2135 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2136 | /* |
| 2137 | * queue lock must be held |
| 2138 | */ |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2139 | static void blk_finish_request(struct request *req, int error) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2140 | { |
Kiyoshi Ueda | b828623 | 2007-12-11 17:53:24 -0500 | [diff] [blame] | 2141 | if (blk_rq_tagged(req)) |
| 2142 | blk_queue_end_tag(req->q, req); |
| 2143 | |
James Bottomley | ba396a6 | 2009-05-27 14:17:08 +0200 | [diff] [blame] | 2144 | BUG_ON(blk_queued_rq(req)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2145 | |
Christoph Hellwig | 33659eb | 2010-08-07 18:17:56 +0200 | [diff] [blame] | 2146 | if (unlikely(laptop_mode) && req->cmd_type == REQ_TYPE_FS) |
Matthew Garrett | 31373d0 | 2010-04-06 14:25:14 +0200 | [diff] [blame] | 2147 | laptop_io_completion(&req->q->backing_dev_info); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2148 | |
Mike Anderson | e78042e | 2008-10-30 02:16:20 -0700 | [diff] [blame] | 2149 | blk_delete_timer(req); |
| 2150 | |
Jens Axboe | bc58ba9 | 2009-01-23 10:54:44 +0100 | [diff] [blame] | 2151 | blk_account_io_done(req); |
Kiyoshi Ueda | b828623 | 2007-12-11 17:53:24 -0500 | [diff] [blame] | 2152 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2153 | if (req->end_io) |
Tejun Heo | 8ffdc65 | 2006-01-06 09:49:03 +0100 | [diff] [blame] | 2154 | req->end_io(req, error); |
Kiyoshi Ueda | b828623 | 2007-12-11 17:53:24 -0500 | [diff] [blame] | 2155 | else { |
| 2156 | if (blk_bidi_rq(req)) |
| 2157 | __blk_put_request(req->next_rq->q, req->next_rq); |
| 2158 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2159 | __blk_put_request(req->q, req); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2160 | } |
| 2161 | } |
| 2162 | |
Kiyoshi Ueda | 3b11313 | 2007-12-11 17:41:17 -0500 | [diff] [blame] | 2163 | /** |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2164 | * blk_end_bidi_request - Complete a bidi request |
| 2165 | * @rq: the request to complete |
Randy Dunlap | 710027a | 2008-08-19 20:13:11 +0200 | [diff] [blame] | 2166 | * @error: %0 for success, < %0 for error |
Kiyoshi Ueda | e3a04fe | 2007-12-11 17:51:46 -0500 | [diff] [blame] | 2167 | * @nr_bytes: number of bytes to complete @rq |
| 2168 | * @bidi_bytes: number of bytes to complete @rq->next_rq |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2169 | * |
| 2170 | * Description: |
| 2171 | * Ends I/O on a number of bytes attached to @rq and @rq->next_rq. |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2172 | * Drivers that supports bidi can safely call this member for any |
| 2173 | * type of request, bidi or uni. In the later case @bidi_bytes is |
| 2174 | * just ignored. |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2175 | * |
| 2176 | * Return: |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2177 | * %false - we are done with this request |
| 2178 | * %true - still buffers pending for this request |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2179 | **/ |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2180 | static bool blk_end_bidi_request(struct request *rq, int error, |
| 2181 | unsigned int nr_bytes, unsigned int bidi_bytes) |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2182 | { |
| 2183 | struct request_queue *q = rq->q; |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2184 | unsigned long flags; |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2185 | |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2186 | if (blk_update_bidi_request(rq, error, nr_bytes, bidi_bytes)) |
| 2187 | return true; |
Kiyoshi Ueda | e19a3ab | 2007-12-11 17:51:02 -0500 | [diff] [blame] | 2188 | |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2189 | spin_lock_irqsave(q->queue_lock, flags); |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2190 | blk_finish_request(rq, error); |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2191 | spin_unlock_irqrestore(q->queue_lock, flags); |
| 2192 | |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2193 | return false; |
Kiyoshi Ueda | e3a04fe | 2007-12-11 17:51:46 -0500 | [diff] [blame] | 2194 | } |
Kiyoshi Ueda | e3a04fe | 2007-12-11 17:51:46 -0500 | [diff] [blame] | 2195 | |
| 2196 | /** |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2197 | * __blk_end_bidi_request - Complete a bidi request with queue lock held |
| 2198 | * @rq: the request to complete |
| 2199 | * @error: %0 for success, < %0 for error |
| 2200 | * @nr_bytes: number of bytes to complete @rq |
| 2201 | * @bidi_bytes: number of bytes to complete @rq->next_rq |
Tejun Heo | 5efccd1 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2202 | * |
| 2203 | * Description: |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2204 | * Identical to blk_end_bidi_request() except that queue lock is |
| 2205 | * assumed to be locked on entry and remains so on return. |
Tejun Heo | 5efccd1 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2206 | * |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2207 | * Return: |
| 2208 | * %false - we are done with this request |
| 2209 | * %true - still buffers pending for this request |
Tejun Heo | 5efccd1 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2210 | **/ |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2211 | static bool __blk_end_bidi_request(struct request *rq, int error, |
| 2212 | unsigned int nr_bytes, unsigned int bidi_bytes) |
Tejun Heo | 5efccd1 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2213 | { |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2214 | if (blk_update_bidi_request(rq, error, nr_bytes, bidi_bytes)) |
| 2215 | return true; |
Tejun Heo | 5efccd1 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2216 | |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2217 | blk_finish_request(rq, error); |
Tejun Heo | 5efccd1 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2218 | |
Tejun Heo | 2e60e02 | 2009-04-23 11:05:18 +0900 | [diff] [blame] | 2219 | return false; |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2220 | } |
| 2221 | |
| 2222 | /** |
| 2223 | * blk_end_request - Helper function for drivers to complete the request. |
| 2224 | * @rq: the request being processed |
| 2225 | * @error: %0 for success, < %0 for error |
| 2226 | * @nr_bytes: number of bytes to complete |
| 2227 | * |
| 2228 | * Description: |
| 2229 | * Ends I/O on a number of bytes attached to @rq. |
| 2230 | * If @rq has leftover, sets it up for the next range of segments. |
| 2231 | * |
| 2232 | * Return: |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2233 | * %false - we are done with this request |
| 2234 | * %true - still buffers pending for this request |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2235 | **/ |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2236 | bool blk_end_request(struct request *rq, int error, unsigned int nr_bytes) |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2237 | { |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2238 | return blk_end_bidi_request(rq, error, nr_bytes, 0); |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2239 | } |
Jens Axboe | 56ad174 | 2009-07-28 22:11:24 +0200 | [diff] [blame] | 2240 | EXPORT_SYMBOL(blk_end_request); |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2241 | |
| 2242 | /** |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2243 | * blk_end_request_all - Helper function for drives to finish the request. |
| 2244 | * @rq: the request to finish |
Randy Dunlap | 8ebf975 | 2009-06-11 20:00:41 -0700 | [diff] [blame] | 2245 | * @error: %0 for success, < %0 for error |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2246 | * |
| 2247 | * Description: |
| 2248 | * Completely finish @rq. |
| 2249 | */ |
| 2250 | void blk_end_request_all(struct request *rq, int error) |
| 2251 | { |
| 2252 | bool pending; |
| 2253 | unsigned int bidi_bytes = 0; |
| 2254 | |
| 2255 | if (unlikely(blk_bidi_rq(rq))) |
| 2256 | bidi_bytes = blk_rq_bytes(rq->next_rq); |
| 2257 | |
| 2258 | pending = blk_end_bidi_request(rq, error, blk_rq_bytes(rq), bidi_bytes); |
| 2259 | BUG_ON(pending); |
| 2260 | } |
Jens Axboe | 56ad174 | 2009-07-28 22:11:24 +0200 | [diff] [blame] | 2261 | EXPORT_SYMBOL(blk_end_request_all); |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2262 | |
| 2263 | /** |
| 2264 | * blk_end_request_cur - Helper function to finish the current request chunk. |
| 2265 | * @rq: the request to finish the current chunk for |
Randy Dunlap | 8ebf975 | 2009-06-11 20:00:41 -0700 | [diff] [blame] | 2266 | * @error: %0 for success, < %0 for error |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2267 | * |
| 2268 | * Description: |
| 2269 | * Complete the current consecutively mapped chunk from @rq. |
| 2270 | * |
| 2271 | * Return: |
| 2272 | * %false - we are done with this request |
| 2273 | * %true - still buffers pending for this request |
| 2274 | */ |
| 2275 | bool blk_end_request_cur(struct request *rq, int error) |
| 2276 | { |
| 2277 | return blk_end_request(rq, error, blk_rq_cur_bytes(rq)); |
| 2278 | } |
Jens Axboe | 56ad174 | 2009-07-28 22:11:24 +0200 | [diff] [blame] | 2279 | EXPORT_SYMBOL(blk_end_request_cur); |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2280 | |
| 2281 | /** |
Tejun Heo | 80a761f | 2009-07-03 17:48:17 +0900 | [diff] [blame] | 2282 | * blk_end_request_err - Finish a request till the next failure boundary. |
| 2283 | * @rq: the request to finish till the next failure boundary for |
| 2284 | * @error: must be negative errno |
| 2285 | * |
| 2286 | * Description: |
| 2287 | * Complete @rq till the next failure boundary. |
| 2288 | * |
| 2289 | * Return: |
| 2290 | * %false - we are done with this request |
| 2291 | * %true - still buffers pending for this request |
| 2292 | */ |
| 2293 | bool blk_end_request_err(struct request *rq, int error) |
| 2294 | { |
| 2295 | WARN_ON(error >= 0); |
| 2296 | return blk_end_request(rq, error, blk_rq_err_bytes(rq)); |
| 2297 | } |
| 2298 | EXPORT_SYMBOL_GPL(blk_end_request_err); |
| 2299 | |
| 2300 | /** |
Kiyoshi Ueda | e19a3ab | 2007-12-11 17:51:02 -0500 | [diff] [blame] | 2301 | * __blk_end_request - Helper function for drivers to complete the request. |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2302 | * @rq: the request being processed |
Kiyoshi Ueda | e19a3ab | 2007-12-11 17:51:02 -0500 | [diff] [blame] | 2303 | * @error: %0 for success, < %0 for error |
| 2304 | * @nr_bytes: number of bytes to complete |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2305 | * |
| 2306 | * Description: |
| 2307 | * Must be called with queue lock held unlike blk_end_request(). |
| 2308 | * |
| 2309 | * Return: |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2310 | * %false - we are done with this request |
| 2311 | * %true - still buffers pending for this request |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2312 | **/ |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2313 | bool __blk_end_request(struct request *rq, int error, unsigned int nr_bytes) |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2314 | { |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2315 | return __blk_end_bidi_request(rq, error, nr_bytes, 0); |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2316 | } |
Jens Axboe | 56ad174 | 2009-07-28 22:11:24 +0200 | [diff] [blame] | 2317 | EXPORT_SYMBOL(__blk_end_request); |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2318 | |
| 2319 | /** |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2320 | * __blk_end_request_all - Helper function for drives to finish the request. |
| 2321 | * @rq: the request to finish |
Randy Dunlap | 8ebf975 | 2009-06-11 20:00:41 -0700 | [diff] [blame] | 2322 | * @error: %0 for success, < %0 for error |
Kiyoshi Ueda | 336cdb4 | 2007-12-11 17:40:30 -0500 | [diff] [blame] | 2323 | * |
| 2324 | * Description: |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2325 | * Completely finish @rq. Must be called with queue lock held. |
Kiyoshi Ueda | 32fab44 | 2008-09-18 10:45:09 -0400 | [diff] [blame] | 2326 | */ |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2327 | void __blk_end_request_all(struct request *rq, int error) |
Kiyoshi Ueda | 32fab44 | 2008-09-18 10:45:09 -0400 | [diff] [blame] | 2328 | { |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2329 | bool pending; |
| 2330 | unsigned int bidi_bytes = 0; |
| 2331 | |
| 2332 | if (unlikely(blk_bidi_rq(rq))) |
| 2333 | bidi_bytes = blk_rq_bytes(rq->next_rq); |
| 2334 | |
| 2335 | pending = __blk_end_bidi_request(rq, error, blk_rq_bytes(rq), bidi_bytes); |
| 2336 | BUG_ON(pending); |
Kiyoshi Ueda | 32fab44 | 2008-09-18 10:45:09 -0400 | [diff] [blame] | 2337 | } |
Jens Axboe | 56ad174 | 2009-07-28 22:11:24 +0200 | [diff] [blame] | 2338 | EXPORT_SYMBOL(__blk_end_request_all); |
Kiyoshi Ueda | 32fab44 | 2008-09-18 10:45:09 -0400 | [diff] [blame] | 2339 | |
| 2340 | /** |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2341 | * __blk_end_request_cur - Helper function to finish the current request chunk. |
| 2342 | * @rq: the request to finish the current chunk for |
Randy Dunlap | 8ebf975 | 2009-06-11 20:00:41 -0700 | [diff] [blame] | 2343 | * @error: %0 for success, < %0 for error |
Kiyoshi Ueda | e19a3ab | 2007-12-11 17:51:02 -0500 | [diff] [blame] | 2344 | * |
| 2345 | * Description: |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2346 | * Complete the current consecutively mapped chunk from @rq. Must |
| 2347 | * be called with queue lock held. |
Kiyoshi Ueda | e19a3ab | 2007-12-11 17:51:02 -0500 | [diff] [blame] | 2348 | * |
| 2349 | * Return: |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2350 | * %false - we are done with this request |
| 2351 | * %true - still buffers pending for this request |
| 2352 | */ |
| 2353 | bool __blk_end_request_cur(struct request *rq, int error) |
Kiyoshi Ueda | e19a3ab | 2007-12-11 17:51:02 -0500 | [diff] [blame] | 2354 | { |
FUJITA Tomonori | b1f7449 | 2009-05-11 17:56:09 +0900 | [diff] [blame] | 2355 | return __blk_end_request(rq, error, blk_rq_cur_bytes(rq)); |
Kiyoshi Ueda | e19a3ab | 2007-12-11 17:51:02 -0500 | [diff] [blame] | 2356 | } |
Jens Axboe | 56ad174 | 2009-07-28 22:11:24 +0200 | [diff] [blame] | 2357 | EXPORT_SYMBOL(__blk_end_request_cur); |
Kiyoshi Ueda | e19a3ab | 2007-12-11 17:51:02 -0500 | [diff] [blame] | 2358 | |
Tejun Heo | 80a761f | 2009-07-03 17:48:17 +0900 | [diff] [blame] | 2359 | /** |
| 2360 | * __blk_end_request_err - Finish a request till the next failure boundary. |
| 2361 | * @rq: the request to finish till the next failure boundary for |
| 2362 | * @error: must be negative errno |
| 2363 | * |
| 2364 | * Description: |
| 2365 | * Complete @rq till the next failure boundary. Must be called |
| 2366 | * with queue lock held. |
| 2367 | * |
| 2368 | * Return: |
| 2369 | * %false - we are done with this request |
| 2370 | * %true - still buffers pending for this request |
| 2371 | */ |
| 2372 | bool __blk_end_request_err(struct request *rq, int error) |
| 2373 | { |
| 2374 | WARN_ON(error >= 0); |
| 2375 | return __blk_end_request(rq, error, blk_rq_err_bytes(rq)); |
| 2376 | } |
| 2377 | EXPORT_SYMBOL_GPL(__blk_end_request_err); |
| 2378 | |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 2379 | void blk_rq_bio_prep(struct request_queue *q, struct request *rq, |
| 2380 | struct bio *bio) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2381 | { |
Tejun Heo | a82afdf | 2009-07-03 17:48:16 +0900 | [diff] [blame] | 2382 | /* Bit 0 (R/W) is identical in rq->cmd_flags and bio->bi_rw */ |
Christoph Hellwig | 7b6d91d | 2010-08-07 18:20:39 +0200 | [diff] [blame] | 2383 | rq->cmd_flags |= bio->bi_rw & REQ_WRITE; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2384 | |
David Woodhouse | fb2dce8 | 2008-08-05 18:01:53 +0100 | [diff] [blame] | 2385 | if (bio_has_data(bio)) { |
| 2386 | rq->nr_phys_segments = bio_phys_segments(q, bio); |
David Woodhouse | fb2dce8 | 2008-08-05 18:01:53 +0100 | [diff] [blame] | 2387 | rq->buffer = bio_data(bio); |
| 2388 | } |
Tejun Heo | a2dec7b | 2009-05-07 22:24:44 +0900 | [diff] [blame] | 2389 | rq->__data_len = bio->bi_size; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2390 | rq->bio = rq->biotail = bio; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2391 | |
NeilBrown | 6684657 | 2007-08-16 13:31:28 +0200 | [diff] [blame] | 2392 | if (bio->bi_bdev) |
| 2393 | rq->rq_disk = bio->bi_bdev->bd_disk; |
| 2394 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2395 | |
Ilya Loginov | 2d4dc89 | 2009-11-26 09:16:19 +0100 | [diff] [blame] | 2396 | #if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE |
| 2397 | /** |
| 2398 | * rq_flush_dcache_pages - Helper function to flush all pages in a request |
| 2399 | * @rq: the request to be flushed |
| 2400 | * |
| 2401 | * Description: |
| 2402 | * Flush all pages in @rq. |
| 2403 | */ |
| 2404 | void rq_flush_dcache_pages(struct request *rq) |
| 2405 | { |
| 2406 | struct req_iterator iter; |
| 2407 | struct bio_vec *bvec; |
| 2408 | |
| 2409 | rq_for_each_segment(bvec, rq, iter) |
| 2410 | flush_dcache_page(bvec->bv_page); |
| 2411 | } |
| 2412 | EXPORT_SYMBOL_GPL(rq_flush_dcache_pages); |
| 2413 | #endif |
| 2414 | |
Kiyoshi Ueda | ef9e3fa | 2008-10-01 16:12:15 +0200 | [diff] [blame] | 2415 | /** |
| 2416 | * blk_lld_busy - Check if underlying low-level drivers of a device are busy |
| 2417 | * @q : the queue of the device being checked |
| 2418 | * |
| 2419 | * Description: |
| 2420 | * Check if underlying low-level drivers of a device are busy. |
| 2421 | * If the drivers want to export their busy state, they must set own |
| 2422 | * exporting function using blk_queue_lld_busy() first. |
| 2423 | * |
| 2424 | * Basically, this function is used only by request stacking drivers |
| 2425 | * to stop dispatching requests to underlying devices when underlying |
| 2426 | * devices are busy. This behavior helps more I/O merging on the queue |
| 2427 | * of the request stacking driver and prevents I/O throughput regression |
| 2428 | * on burst I/O load. |
| 2429 | * |
| 2430 | * Return: |
| 2431 | * 0 - Not busy (The request stacking driver should dispatch request) |
| 2432 | * 1 - Busy (The request stacking driver should stop dispatching request) |
| 2433 | */ |
| 2434 | int blk_lld_busy(struct request_queue *q) |
| 2435 | { |
| 2436 | if (q->lld_busy_fn) |
| 2437 | return q->lld_busy_fn(q); |
| 2438 | |
| 2439 | return 0; |
| 2440 | } |
| 2441 | EXPORT_SYMBOL_GPL(blk_lld_busy); |
| 2442 | |
Kiyoshi Ueda | b0fd271 | 2009-06-11 13:10:16 +0200 | [diff] [blame] | 2443 | /** |
| 2444 | * blk_rq_unprep_clone - Helper function to free all bios in a cloned request |
| 2445 | * @rq: the clone request to be cleaned up |
| 2446 | * |
| 2447 | * Description: |
| 2448 | * Free all bios in @rq for a cloned request. |
| 2449 | */ |
| 2450 | void blk_rq_unprep_clone(struct request *rq) |
| 2451 | { |
| 2452 | struct bio *bio; |
| 2453 | |
| 2454 | while ((bio = rq->bio) != NULL) { |
| 2455 | rq->bio = bio->bi_next; |
| 2456 | |
| 2457 | bio_put(bio); |
| 2458 | } |
| 2459 | } |
| 2460 | EXPORT_SYMBOL_GPL(blk_rq_unprep_clone); |
| 2461 | |
| 2462 | /* |
| 2463 | * Copy attributes of the original request to the clone request. |
| 2464 | * The actual data parts (e.g. ->cmd, ->buffer, ->sense) are not copied. |
| 2465 | */ |
| 2466 | static void __blk_rq_prep_clone(struct request *dst, struct request *src) |
| 2467 | { |
| 2468 | dst->cpu = src->cpu; |
| 2469 | dst->cmd_flags = (rq_data_dir(src) | REQ_NOMERGE); |
| 2470 | dst->cmd_type = src->cmd_type; |
| 2471 | dst->__sector = blk_rq_pos(src); |
| 2472 | dst->__data_len = blk_rq_bytes(src); |
| 2473 | dst->nr_phys_segments = src->nr_phys_segments; |
| 2474 | dst->ioprio = src->ioprio; |
| 2475 | dst->extra_len = src->extra_len; |
| 2476 | } |
| 2477 | |
| 2478 | /** |
| 2479 | * blk_rq_prep_clone - Helper function to setup clone request |
| 2480 | * @rq: the request to be setup |
| 2481 | * @rq_src: original request to be cloned |
| 2482 | * @bs: bio_set that bios for clone are allocated from |
| 2483 | * @gfp_mask: memory allocation mask for bio |
| 2484 | * @bio_ctr: setup function to be called for each clone bio. |
| 2485 | * Returns %0 for success, non %0 for failure. |
| 2486 | * @data: private data to be passed to @bio_ctr |
| 2487 | * |
| 2488 | * Description: |
| 2489 | * Clones bios in @rq_src to @rq, and copies attributes of @rq_src to @rq. |
| 2490 | * The actual data parts of @rq_src (e.g. ->cmd, ->buffer, ->sense) |
| 2491 | * are not copied, and copying such parts is the caller's responsibility. |
| 2492 | * Also, pages which the original bios are pointing to are not copied |
| 2493 | * and the cloned bios just point same pages. |
| 2494 | * So cloned bios must be completed before original bios, which means |
| 2495 | * the caller must complete @rq before @rq_src. |
| 2496 | */ |
| 2497 | int blk_rq_prep_clone(struct request *rq, struct request *rq_src, |
| 2498 | struct bio_set *bs, gfp_t gfp_mask, |
| 2499 | int (*bio_ctr)(struct bio *, struct bio *, void *), |
| 2500 | void *data) |
| 2501 | { |
| 2502 | struct bio *bio, *bio_src; |
| 2503 | |
| 2504 | if (!bs) |
| 2505 | bs = fs_bio_set; |
| 2506 | |
| 2507 | blk_rq_init(NULL, rq); |
| 2508 | |
| 2509 | __rq_for_each_bio(bio_src, rq_src) { |
| 2510 | bio = bio_alloc_bioset(gfp_mask, bio_src->bi_max_vecs, bs); |
| 2511 | if (!bio) |
| 2512 | goto free_and_out; |
| 2513 | |
| 2514 | __bio_clone(bio, bio_src); |
| 2515 | |
| 2516 | if (bio_integrity(bio_src) && |
Martin K. Petersen | 7878cba | 2009-06-26 15:37:49 +0200 | [diff] [blame] | 2517 | bio_integrity_clone(bio, bio_src, gfp_mask, bs)) |
Kiyoshi Ueda | b0fd271 | 2009-06-11 13:10:16 +0200 | [diff] [blame] | 2518 | goto free_and_out; |
| 2519 | |
| 2520 | if (bio_ctr && bio_ctr(bio, bio_src, data)) |
| 2521 | goto free_and_out; |
| 2522 | |
| 2523 | if (rq->bio) { |
| 2524 | rq->biotail->bi_next = bio; |
| 2525 | rq->biotail = bio; |
| 2526 | } else |
| 2527 | rq->bio = rq->biotail = bio; |
| 2528 | } |
| 2529 | |
| 2530 | __blk_rq_prep_clone(rq, rq_src); |
| 2531 | |
| 2532 | return 0; |
| 2533 | |
| 2534 | free_and_out: |
| 2535 | if (bio) |
| 2536 | bio_free(bio, bs); |
| 2537 | blk_rq_unprep_clone(rq); |
| 2538 | |
| 2539 | return -ENOMEM; |
| 2540 | } |
| 2541 | EXPORT_SYMBOL_GPL(blk_rq_prep_clone); |
| 2542 | |
Jens Axboe | 18887ad | 2008-07-28 13:08:45 +0200 | [diff] [blame] | 2543 | int kblockd_schedule_work(struct request_queue *q, struct work_struct *work) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2544 | { |
| 2545 | return queue_work(kblockd_workqueue, work); |
| 2546 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2547 | EXPORT_SYMBOL(kblockd_schedule_work); |
| 2548 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2549 | int __init blk_dev_init(void) |
| 2550 | { |
Nikanth Karthikesan | 9eb55b0 | 2009-04-27 14:53:54 +0200 | [diff] [blame] | 2551 | BUILD_BUG_ON(__REQ_NR_BITS > 8 * |
| 2552 | sizeof(((struct request *)0)->cmd_flags)); |
| 2553 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2554 | kblockd_workqueue = create_workqueue("kblockd"); |
| 2555 | if (!kblockd_workqueue) |
| 2556 | panic("Failed to create kblockd\n"); |
| 2557 | |
| 2558 | request_cachep = kmem_cache_create("blkdev_requests", |
Paul Mundt | 20c2df8 | 2007-07-20 10:11:58 +0900 | [diff] [blame] | 2559 | sizeof(struct request), 0, SLAB_PANIC, NULL); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2560 | |
Jens Axboe | 8324aa9 | 2008-01-29 14:51:59 +0100 | [diff] [blame] | 2561 | blk_requestq_cachep = kmem_cache_create("blkdev_queue", |
Jens Axboe | 165125e | 2007-07-24 09:28:11 +0200 | [diff] [blame] | 2562 | sizeof(struct request_queue), 0, SLAB_PANIC, NULL); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2563 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2564 | return 0; |
| 2565 | } |