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