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