Blame view
block/blk-core.c
89.3 KB
1da177e4c
|
1 |
/* |
1da177e4c
|
2 3 4 5 |
* Copyright (C) 1991, 1992 Linus Torvalds * Copyright (C) 1994, Karl Keyte: Added support for disk statistics * Elevator latency, (C) 2000 Andrea Arcangeli <andrea@suse.de> SuSE * Queue request tables / lock, selectable elevator, Jens Axboe <axboe@suse.de> |
6728cb0e6
|
6 7 |
* kernel-doc documentation started by NeilBrown <neilb@cse.unsw.edu.au> * - July2000 |
1da177e4c
|
8 9 10 11 12 13 |
* bio rewrite, highmem i/o, etc, Jens Axboe <axboe@suse.de> - may 2001 */ /* * This handles all read/write requests to block devices */ |
1da177e4c
|
14 15 16 17 18 |
#include <linux/kernel.h> #include <linux/module.h> #include <linux/backing-dev.h> #include <linux/bio.h> #include <linux/blkdev.h> |
320ae51fe
|
19 |
#include <linux/blk-mq.h> |
1da177e4c
|
20 21 22 23 24 |
#include <linux/highmem.h> #include <linux/mm.h> #include <linux/kernel_stat.h> #include <linux/string.h> #include <linux/init.h> |
1da177e4c
|
25 26 27 28 |
#include <linux/completion.h> #include <linux/slab.h> #include <linux/swap.h> #include <linux/writeback.h> |
faccbd4b2
|
29 |
#include <linux/task_io_accounting_ops.h> |
c17bb4951
|
30 |
#include <linux/fault-inject.h> |
73c101011
|
31 |
#include <linux/list_sort.h> |
e3c78ca52
|
32 |
#include <linux/delay.h> |
aaf7c6806
|
33 |
#include <linux/ratelimit.h> |
6c9546675
|
34 |
#include <linux/pm_runtime.h> |
55782138e
|
35 36 37 |
#define CREATE_TRACE_POINTS #include <trace/events/block.h> |
1da177e4c
|
38 |
|
8324aa91d
|
39 |
#include "blk.h" |
5efd61135
|
40 |
#include "blk-cgroup.h" |
43a5e4e21
|
41 |
#include "blk-mq.h" |
8324aa91d
|
42 |
|
d07335e51
|
43 |
EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_remap); |
b0da3f0da
|
44 |
EXPORT_TRACEPOINT_SYMBOL_GPL(block_rq_remap); |
0a82a8d13
|
45 |
EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_complete); |
3291fa57c
|
46 |
EXPORT_TRACEPOINT_SYMBOL_GPL(block_split); |
cbae8d45d
|
47 |
EXPORT_TRACEPOINT_SYMBOL_GPL(block_unplug); |
0bfc24559
|
48 |
|
a73f730d0
|
49 |
DEFINE_IDA(blk_queue_ida); |
1da177e4c
|
50 51 52 |
/* * For the allocated request tables */ |
320ae51fe
|
53 |
struct kmem_cache *request_cachep = NULL; |
1da177e4c
|
54 55 56 57 |
/* * For queue allocation */ |
6728cb0e6
|
58 |
struct kmem_cache *blk_requestq_cachep; |
1da177e4c
|
59 60 |
/* |
1da177e4c
|
61 62 |
* Controlling structure to kblockd */ |
ff856bad6
|
63 |
static struct workqueue_struct *kblockd_workqueue; |
1da177e4c
|
64 |
|
8324aa91d
|
65 |
void blk_queue_congestion_threshold(struct request_queue *q) |
1da177e4c
|
66 67 68 69 70 71 72 73 74 75 76 77 78 |
{ int nr; nr = q->nr_requests - (q->nr_requests / 8) + 1; if (nr > q->nr_requests) nr = q->nr_requests; q->nr_congestion_on = nr; nr = q->nr_requests - (q->nr_requests / 8) - (q->nr_requests / 16) - 1; if (nr < 1) nr = 1; q->nr_congestion_off = nr; } |
1da177e4c
|
79 80 81 82 83 |
/** * blk_get_backing_dev_info - get the address of a queue's backing_dev_info * @bdev: device * * Locates the passed device's request queue and returns the address of its |
ff9ea3238
|
84 85 |
* backing_dev_info. This function can only be called if @bdev is opened * and the return value is never NULL. |
1da177e4c
|
86 87 88 |
*/ struct backing_dev_info *blk_get_backing_dev_info(struct block_device *bdev) { |
165125e1e
|
89 |
struct request_queue *q = bdev_get_queue(bdev); |
1da177e4c
|
90 |
|
ff9ea3238
|
91 |
return &q->backing_dev_info; |
1da177e4c
|
92 |
} |
1da177e4c
|
93 |
EXPORT_SYMBOL(blk_get_backing_dev_info); |
2a4aa30c5
|
94 |
void blk_rq_init(struct request_queue *q, struct request *rq) |
1da177e4c
|
95 |
{ |
1afb20f30
|
96 |
memset(rq, 0, sizeof(*rq)); |
1da177e4c
|
97 |
INIT_LIST_HEAD(&rq->queuelist); |
242f9dcb8
|
98 |
INIT_LIST_HEAD(&rq->timeout_list); |
c7c22e4d5
|
99 |
rq->cpu = -1; |
63a713867
|
100 |
rq->q = q; |
a2dec7b36
|
101 |
rq->__sector = (sector_t) -1; |
2e662b65f
|
102 103 |
INIT_HLIST_NODE(&rq->hash); RB_CLEAR_NODE(&rq->rb_node); |
d7e3c3249
|
104 |
rq->cmd = rq->__cmd; |
e2494e1b4
|
105 |
rq->cmd_len = BLK_MAX_CDB; |
63a713867
|
106 |
rq->tag = -1; |
b243ddcbe
|
107 |
rq->start_time = jiffies; |
9195291e5
|
108 |
set_start_time_ns(rq); |
09e099d4b
|
109 |
rq->part = NULL; |
1da177e4c
|
110 |
} |
2a4aa30c5
|
111 |
EXPORT_SYMBOL(blk_rq_init); |
1da177e4c
|
112 |
|
5bb23a688
|
113 114 |
static void req_bio_endio(struct request *rq, struct bio *bio, unsigned int nbytes, int error) |
1da177e4c
|
115 |
{ |
143a87f4c
|
116 117 118 119 |
if (error) clear_bit(BIO_UPTODATE, &bio->bi_flags); else if (!test_bit(BIO_UPTODATE, &bio->bi_flags)) error = -EIO; |
797e7dbbe
|
120 |
|
143a87f4c
|
121 122 |
if (unlikely(rq->cmd_flags & REQ_QUIET)) set_bit(BIO_QUIET, &bio->bi_flags); |
08bafc034
|
123 |
|
f79ea4161
|
124 |
bio_advance(bio, nbytes); |
7ba1ba12e
|
125 |
|
143a87f4c
|
126 |
/* don't actually finish bio if it's part of flush sequence */ |
4f024f379
|
127 |
if (bio->bi_iter.bi_size == 0 && !(rq->cmd_flags & REQ_FLUSH_SEQ)) |
143a87f4c
|
128 |
bio_endio(bio, error); |
1da177e4c
|
129 |
} |
1da177e4c
|
130 |
|
1da177e4c
|
131 132 133 |
void blk_dump_rq_flags(struct request *rq, char *msg) { int bit; |
5953316db
|
134 135 |
printk(KERN_INFO "%s: dev %s: type=%x, flags=%llx ", msg, |
4aff5e233
|
136 |
rq->rq_disk ? rq->rq_disk->disk_name : "?", rq->cmd_type, |
5953316db
|
137 |
(unsigned long long) rq->cmd_flags); |
1da177e4c
|
138 |
|
83096ebf1
|
139 140 141 142 |
printk(KERN_INFO " sector %llu, nr/cnr %u/%u ", (unsigned long long)blk_rq_pos(rq), blk_rq_sectors(rq), blk_rq_cur_sectors(rq)); |
b4f42e283
|
143 144 145 |
printk(KERN_INFO " bio %p, biotail %p, len %u ", rq->bio, rq->biotail, blk_rq_bytes(rq)); |
1da177e4c
|
146 |
|
33659ebba
|
147 |
if (rq->cmd_type == REQ_TYPE_BLOCK_PC) { |
6728cb0e6
|
148 |
printk(KERN_INFO " cdb: "); |
d34c87e4b
|
149 |
for (bit = 0; bit < BLK_MAX_CDB; bit++) |
1da177e4c
|
150 151 152 153 154 |
printk("%02x ", rq->cmd[bit]); printk(" "); } } |
1da177e4c
|
155 |
EXPORT_SYMBOL(blk_dump_rq_flags); |
3cca6dc1c
|
156 |
static void blk_delay_work(struct work_struct *work) |
1da177e4c
|
157 |
{ |
3cca6dc1c
|
158 |
struct request_queue *q; |
1da177e4c
|
159 |
|
3cca6dc1c
|
160 161 |
q = container_of(work, struct request_queue, delay_work.work); spin_lock_irq(q->queue_lock); |
24ecfbe27
|
162 |
__blk_run_queue(q); |
3cca6dc1c
|
163 |
spin_unlock_irq(q->queue_lock); |
1da177e4c
|
164 |
} |
1da177e4c
|
165 166 |
/** |
3cca6dc1c
|
167 168 169 |
* blk_delay_queue - restart queueing after defined interval * @q: The &struct request_queue in question * @msecs: Delay in msecs |
1da177e4c
|
170 171 |
* * Description: |
3cca6dc1c
|
172 173 |
* Sometimes queueing needs to be postponed for a little while, to allow * resources to come back. This function will make sure that queueing is |
704605711
|
174 |
* restarted around the specified time. Queue lock must be held. |
3cca6dc1c
|
175 176 |
*/ void blk_delay_queue(struct request_queue *q, unsigned long msecs) |
2ad8b1ef1
|
177 |
{ |
704605711
|
178 179 180 |
if (likely(!blk_queue_dead(q))) queue_delayed_work(kblockd_workqueue, &q->delay_work, msecs_to_jiffies(msecs)); |
2ad8b1ef1
|
181 |
} |
3cca6dc1c
|
182 |
EXPORT_SYMBOL(blk_delay_queue); |
2ad8b1ef1
|
183 |
|
1da177e4c
|
184 185 |
/** * blk_start_queue - restart a previously stopped queue |
165125e1e
|
186 |
* @q: The &struct request_queue in question |
1da177e4c
|
187 188 189 190 191 192 |
* * Description: * blk_start_queue() will clear the stop flag on the queue, and call * the request_fn for the queue if it was in a stopped state when * entered. Also see blk_stop_queue(). Queue lock must be held. **/ |
165125e1e
|
193 |
void blk_start_queue(struct request_queue *q) |
1da177e4c
|
194 |
{ |
a038e2536
|
195 |
WARN_ON(!irqs_disabled()); |
75ad23bc0
|
196 |
queue_flag_clear(QUEUE_FLAG_STOPPED, q); |
24ecfbe27
|
197 |
__blk_run_queue(q); |
1da177e4c
|
198 |
} |
1da177e4c
|
199 200 201 202 |
EXPORT_SYMBOL(blk_start_queue); /** * blk_stop_queue - stop a queue |
165125e1e
|
203 |
* @q: The &struct request_queue in question |
1da177e4c
|
204 205 206 207 208 209 210 211 212 213 214 |
* * Description: * The Linux block layer assumes that a block driver will consume all * entries on the request queue when the request_fn strategy is called. * Often this will not happen, because of hardware limitations (queue * depth settings). If a device driver gets a 'queue full' response, * or if it simply chooses not to queue more I/O at one point, it can * call this function to prevent the request_fn from being called until * the driver has signalled it's ready to go again. This happens by calling * blk_start_queue() to restart queue operations. Queue lock must be held. **/ |
165125e1e
|
215 |
void blk_stop_queue(struct request_queue *q) |
1da177e4c
|
216 |
{ |
136b5721d
|
217 |
cancel_delayed_work(&q->delay_work); |
75ad23bc0
|
218 |
queue_flag_set(QUEUE_FLAG_STOPPED, q); |
1da177e4c
|
219 220 221 222 223 224 225 226 227 228 229 230 |
} EXPORT_SYMBOL(blk_stop_queue); /** * blk_sync_queue - cancel any pending callbacks on a queue * @q: the queue * * Description: * The block layer may perform asynchronous callback activity * on a queue, such as calling the unplug function after a timeout. * A block device may call blk_sync_queue to ensure that any * such activity is cancelled, thus allowing it to release resources |
59c51591a
|
231 |
* that the callbacks might use. The caller must already have made sure |
1da177e4c
|
232 233 234 |
* that its ->make_request_fn will not re-add plugging prior to calling * this function. * |
da5277700
|
235 |
* This function does not cancel any asynchronous activity arising |
da3dae54e
|
236 |
* out of elevator or throttling code. That would require elevator_exit() |
5efd61135
|
237 |
* and blkcg_exit_queue() to be called with queue lock initialized. |
da5277700
|
238 |
* |
1da177e4c
|
239 240 241 |
*/ void blk_sync_queue(struct request_queue *q) { |
70ed28b92
|
242 |
del_timer_sync(&q->timeout); |
f04c1fe76
|
243 244 245 246 |
if (q->mq_ops) { struct blk_mq_hw_ctx *hctx; int i; |
70f4db639
|
247 248 249 250 |
queue_for_each_hw_ctx(q, hctx, i) { cancel_delayed_work_sync(&hctx->run_work); cancel_delayed_work_sync(&hctx->delay_work); } |
f04c1fe76
|
251 252 253 |
} else { cancel_delayed_work_sync(&q->delay_work); } |
1da177e4c
|
254 255 256 257 |
} EXPORT_SYMBOL(blk_sync_queue); /** |
c246e80d8
|
258 259 260 261 262 263 264 265 266 267 268 269 270 271 |
* __blk_run_queue_uncond - run a queue whether or not it has been stopped * @q: The queue to run * * Description: * Invoke request handling on a queue if there are any pending requests. * May be used to restart request handling after a request has completed. * This variant runs the queue whether or not the queue has been * stopped. Must be called with the queue lock held and interrupts * disabled. See also @blk_run_queue. */ inline void __blk_run_queue_uncond(struct request_queue *q) { if (unlikely(blk_queue_dead(q))) return; |
24faf6f60
|
272 273 274 275 276 277 278 279 |
/* * Some request_fn implementations, e.g. scsi_request_fn(), unlock * the queue lock internally. As a result multiple threads may be * running such a request function concurrently. Keep track of the * number of active request_fn invocations such that blk_drain_queue() * can wait until all these request_fn calls have finished. */ q->request_fn_active++; |
c246e80d8
|
280 |
q->request_fn(q); |
24faf6f60
|
281 |
q->request_fn_active--; |
c246e80d8
|
282 283 284 |
} /** |
80a4b58e3
|
285 |
* __blk_run_queue - run a single device queue |
1da177e4c
|
286 |
* @q: The queue to run |
80a4b58e3
|
287 288 289 |
* * Description: * See @blk_run_queue. This variant must be called with the queue lock |
24ecfbe27
|
290 |
* held and interrupts disabled. |
1da177e4c
|
291 |
*/ |
24ecfbe27
|
292 |
void __blk_run_queue(struct request_queue *q) |
1da177e4c
|
293 |
{ |
a538cd03b
|
294 295 |
if (unlikely(blk_queue_stopped(q))) return; |
c246e80d8
|
296 |
__blk_run_queue_uncond(q); |
75ad23bc0
|
297 298 |
} EXPORT_SYMBOL(__blk_run_queue); |
dac07ec12
|
299 |
|
75ad23bc0
|
300 |
/** |
24ecfbe27
|
301 302 303 304 305 |
* blk_run_queue_async - run a single device queue in workqueue context * @q: The queue to run * * Description: * Tells kblockd to perform the equivalent of @blk_run_queue on behalf |
704605711
|
306 |
* of us. The caller must hold the queue lock. |
24ecfbe27
|
307 308 309 |
*/ void blk_run_queue_async(struct request_queue *q) { |
704605711
|
310 |
if (likely(!blk_queue_stopped(q) && !blk_queue_dead(q))) |
e7c2f9674
|
311 |
mod_delayed_work(kblockd_workqueue, &q->delay_work, 0); |
24ecfbe27
|
312 |
} |
c21e6beba
|
313 |
EXPORT_SYMBOL(blk_run_queue_async); |
24ecfbe27
|
314 315 |
/** |
75ad23bc0
|
316 317 |
* blk_run_queue - run a single device queue * @q: The queue to run |
80a4b58e3
|
318 319 320 |
* * Description: * Invoke request handling on this queue, if it has pending work to do. |
a7f557923
|
321 |
* May be used to restart queueing when a request has completed. |
75ad23bc0
|
322 323 324 325 326 327 |
*/ void blk_run_queue(struct request_queue *q) { unsigned long flags; spin_lock_irqsave(q->queue_lock, flags); |
24ecfbe27
|
328 |
__blk_run_queue(q); |
1da177e4c
|
329 330 331 |
spin_unlock_irqrestore(q->queue_lock, flags); } EXPORT_SYMBOL(blk_run_queue); |
165125e1e
|
332 |
void blk_put_queue(struct request_queue *q) |
483f4afc4
|
333 334 335 |
{ kobject_put(&q->kobj); } |
d86e0e83b
|
336 |
EXPORT_SYMBOL(blk_put_queue); |
483f4afc4
|
337 |
|
e3c78ca52
|
338 |
/** |
807592a4f
|
339 |
* __blk_drain_queue - drain requests from request_queue |
e3c78ca52
|
340 |
* @q: queue to drain |
c9a929dde
|
341 |
* @drain_all: whether to drain all requests or only the ones w/ ELVPRIV |
e3c78ca52
|
342 |
* |
c9a929dde
|
343 344 345 |
* Drain requests from @q. If @drain_all is set, all requests are drained. * If not, only ELVPRIV requests are drained. The caller is responsible * for ensuring that no new requests which need to be drained are queued. |
e3c78ca52
|
346 |
*/ |
807592a4f
|
347 348 349 |
static void __blk_drain_queue(struct request_queue *q, bool drain_all) __releases(q->queue_lock) __acquires(q->queue_lock) |
e3c78ca52
|
350 |
{ |
458f27a98
|
351 |
int i; |
807592a4f
|
352 |
lockdep_assert_held(q->queue_lock); |
e3c78ca52
|
353 |
while (true) { |
481a7d647
|
354 |
bool drain = false; |
e3c78ca52
|
355 |
|
b855b04a0
|
356 357 358 359 360 361 |
/* * The caller might be trying to drain @q before its * elevator is initialized. */ if (q->elevator) elv_drain_elevator(q); |
5efd61135
|
362 |
blkcg_drain_queue(q); |
e3c78ca52
|
363 |
|
4eabc9412
|
364 365 |
/* * This function might be called on a queue which failed |
b855b04a0
|
366 367 368 369 |
* driver init after queue creation or is not yet fully * active yet. Some drivers (e.g. fd and loop) get unhappy * in such cases. Kick queue iff dispatch queue has * something on it and @q has request_fn set. |
4eabc9412
|
370 |
*/ |
b855b04a0
|
371 |
if (!list_empty(&q->queue_head) && q->request_fn) |
4eabc9412
|
372 |
__blk_run_queue(q); |
c9a929dde
|
373 |
|
8a5ecdd42
|
374 |
drain |= q->nr_rqs_elvpriv; |
24faf6f60
|
375 |
drain |= q->request_fn_active; |
481a7d647
|
376 377 378 379 380 381 382 |
/* * Unfortunately, requests are queued at and tracked from * multiple places and there's no single counter which can * be drained. Check all the queues and counters. */ if (drain_all) { |
e97c293cd
|
383 |
struct blk_flush_queue *fq = blk_get_flush_queue(q, NULL); |
481a7d647
|
384 385 |
drain |= !list_empty(&q->queue_head); for (i = 0; i < 2; i++) { |
8a5ecdd42
|
386 |
drain |= q->nr_rqs[i]; |
481a7d647
|
387 |
drain |= q->in_flight[i]; |
7c94e1c15
|
388 389 |
if (fq) drain |= !list_empty(&fq->flush_queue[i]); |
481a7d647
|
390 391 |
} } |
e3c78ca52
|
392 |
|
481a7d647
|
393 |
if (!drain) |
e3c78ca52
|
394 |
break; |
807592a4f
|
395 396 |
spin_unlock_irq(q->queue_lock); |
e3c78ca52
|
397 |
msleep(10); |
807592a4f
|
398 399 |
spin_lock_irq(q->queue_lock); |
e3c78ca52
|
400 |
} |
458f27a98
|
401 402 403 404 405 406 407 |
/* * With queue marked dead, any woken up waiter will fail the * allocation path, so the wakeup chaining is lost and we're * left with hung waiters. We need to wake up those waiters. */ if (q->request_fn) { |
a051661ca
|
408 |
struct request_list *rl; |
a051661ca
|
409 410 411 |
blk_queue_for_each_rl(rl, q) for (i = 0; i < ARRAY_SIZE(rl->wait); i++) wake_up_all(&rl->wait[i]); |
458f27a98
|
412 |
} |
e3c78ca52
|
413 |
} |
c9a929dde
|
414 |
/** |
d732580b4
|
415 416 417 418 419 |
* blk_queue_bypass_start - enter queue bypass mode * @q: queue of interest * * In bypass mode, only the dispatch FIFO queue of @q is used. This * function makes @q enter bypass mode and drains all requests which were |
6ecf23afa
|
420 |
* throttled or issued before. On return, it's guaranteed that no request |
80fd99792
|
421 422 |
* is being throttled or has ELVPRIV set and blk_queue_bypass() %true * inside queue or RCU read lock. |
d732580b4
|
423 424 425 426 |
*/ void blk_queue_bypass_start(struct request_queue *q) { spin_lock_irq(q->queue_lock); |
776687bce
|
427 |
q->bypass_depth++; |
d732580b4
|
428 429 |
queue_flag_set(QUEUE_FLAG_BYPASS, q); spin_unlock_irq(q->queue_lock); |
776687bce
|
430 431 432 433 434 435 |
/* * Queues start drained. Skip actual draining till init is * complete. This avoids lenghty delays during queue init which * can happen many times during boot. */ if (blk_queue_init_done(q)) { |
807592a4f
|
436 437 438 |
spin_lock_irq(q->queue_lock); __blk_drain_queue(q, false); spin_unlock_irq(q->queue_lock); |
b82d4b197
|
439 440 441 |
/* ensure blk_queue_bypass() is %true inside RCU read lock */ synchronize_rcu(); } |
d732580b4
|
442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 |
} EXPORT_SYMBOL_GPL(blk_queue_bypass_start); /** * blk_queue_bypass_end - leave queue bypass mode * @q: queue of interest * * Leave bypass mode and restore the normal queueing behavior. */ void blk_queue_bypass_end(struct request_queue *q) { spin_lock_irq(q->queue_lock); if (!--q->bypass_depth) queue_flag_clear(QUEUE_FLAG_BYPASS, q); WARN_ON_ONCE(q->bypass_depth < 0); spin_unlock_irq(q->queue_lock); } EXPORT_SYMBOL_GPL(blk_queue_bypass_end); /** |
c9a929dde
|
462 463 464 |
* blk_cleanup_queue - shutdown a request queue * @q: request queue to shutdown * |
c246e80d8
|
465 466 |
* Mark @q DYING, drain all pending requests, mark @q DEAD, destroy and * put it. All future requests will be failed immediately with -ENODEV. |
c94a96ac9
|
467 |
*/ |
6728cb0e6
|
468 |
void blk_cleanup_queue(struct request_queue *q) |
483f4afc4
|
469 |
{ |
c9a929dde
|
470 |
spinlock_t *lock = q->queue_lock; |
e3335de94
|
471 |
|
3f3299d5c
|
472 |
/* mark @q DYING, no new request or merges will be allowed afterwards */ |
483f4afc4
|
473 |
mutex_lock(&q->sysfs_lock); |
3f3299d5c
|
474 |
queue_flag_set_unlocked(QUEUE_FLAG_DYING, q); |
c9a929dde
|
475 |
spin_lock_irq(lock); |
6ecf23afa
|
476 |
|
80fd99792
|
477 |
/* |
3f3299d5c
|
478 |
* A dying queue is permanently in bypass mode till released. Note |
80fd99792
|
479 480 481 482 483 484 485 |
* that, unlike blk_queue_bypass_start(), we aren't performing * synchronize_rcu() after entering bypass mode to avoid the delay * as some drivers create and destroy a lot of queues while * probing. This is still safe because blk_release_queue() will be * called only after the queue refcnt drops to zero and nothing, * RCU or not, would be traversing the queue by then. */ |
6ecf23afa
|
486 487 |
q->bypass_depth++; queue_flag_set(QUEUE_FLAG_BYPASS, q); |
c9a929dde
|
488 489 |
queue_flag_set(QUEUE_FLAG_NOMERGES, q); queue_flag_set(QUEUE_FLAG_NOXMERGES, q); |
3f3299d5c
|
490 |
queue_flag_set(QUEUE_FLAG_DYING, q); |
c9a929dde
|
491 492 |
spin_unlock_irq(lock); mutex_unlock(&q->sysfs_lock); |
c246e80d8
|
493 494 495 496 |
/* * Drain all requests queued before DYING marking. Set DEAD flag to * prevent that q->request_fn() gets invoked after draining finished. */ |
43a5e4e21
|
497 |
if (q->mq_ops) { |
780db2071
|
498 |
blk_mq_freeze_queue(q); |
43a5e4e21
|
499 500 501 502 503 |
spin_lock_irq(lock); } else { spin_lock_irq(lock); __blk_drain_queue(q, true); } |
c246e80d8
|
504 |
queue_flag_set(QUEUE_FLAG_DEAD, q); |
807592a4f
|
505 |
spin_unlock_irq(lock); |
c9a929dde
|
506 507 508 509 |
/* @q won't process any more request, flush async actions */ del_timer_sync(&q->backing_dev_info.laptop_mode_wb_timer); blk_sync_queue(q); |
45a9c9d90
|
510 511 |
if (q->mq_ops) blk_mq_free_queue(q); |
5e5cfac0c
|
512 513 514 515 |
spin_lock_irq(lock); if (q->queue_lock != &q->__queue_lock) q->queue_lock = &q->__queue_lock; spin_unlock_irq(lock); |
c9a929dde
|
516 |
/* @q is and will stay empty, shutdown and put */ |
483f4afc4
|
517 518 |
blk_put_queue(q); } |
1da177e4c
|
519 |
EXPORT_SYMBOL(blk_cleanup_queue); |
5b788ce3e
|
520 521 |
int blk_init_rl(struct request_list *rl, struct request_queue *q, gfp_t gfp_mask) |
1da177e4c
|
522 |
{ |
1abec4fdb
|
523 524 |
if (unlikely(rl->rq_pool)) return 0; |
5b788ce3e
|
525 |
rl->q = q; |
1faa16d22
|
526 527 |
rl->count[BLK_RW_SYNC] = rl->count[BLK_RW_ASYNC] = 0; rl->starved[BLK_RW_SYNC] = rl->starved[BLK_RW_ASYNC] = 0; |
1faa16d22
|
528 529 |
init_waitqueue_head(&rl->wait[BLK_RW_SYNC]); init_waitqueue_head(&rl->wait[BLK_RW_ASYNC]); |
1da177e4c
|
530 |
|
1946089a1
|
531 |
rl->rq_pool = mempool_create_node(BLKDEV_MIN_RQ, mempool_alloc_slab, |
a91a5ac68
|
532 |
mempool_free_slab, request_cachep, |
5b788ce3e
|
533 |
gfp_mask, q->node); |
1da177e4c
|
534 535 536 537 538 |
if (!rl->rq_pool) return -ENOMEM; return 0; } |
5b788ce3e
|
539 540 541 542 543 |
void blk_exit_rl(struct request_list *rl) { if (rl->rq_pool) mempool_destroy(rl->rq_pool); } |
165125e1e
|
544 |
struct request_queue *blk_alloc_queue(gfp_t gfp_mask) |
1da177e4c
|
545 |
{ |
c304a51bf
|
546 |
return blk_alloc_queue_node(gfp_mask, NUMA_NO_NODE); |
1946089a1
|
547 548 |
} EXPORT_SYMBOL(blk_alloc_queue); |
1da177e4c
|
549 |
|
165125e1e
|
550 |
struct request_queue *blk_alloc_queue_node(gfp_t gfp_mask, int node_id) |
1946089a1
|
551 |
{ |
165125e1e
|
552 |
struct request_queue *q; |
e0bf68dde
|
553 |
int err; |
1946089a1
|
554 |
|
8324aa91d
|
555 |
q = kmem_cache_alloc_node(blk_requestq_cachep, |
94f6030ca
|
556 |
gfp_mask | __GFP_ZERO, node_id); |
1da177e4c
|
557 558 |
if (!q) return NULL; |
00380a404
|
559 |
q->id = ida_simple_get(&blk_queue_ida, 0, 0, gfp_mask); |
a73f730d0
|
560 |
if (q->id < 0) |
3d2936f45
|
561 |
goto fail_q; |
a73f730d0
|
562 |
|
0989a025d
|
563 564 565 566 |
q->backing_dev_info.ra_pages = (VM_MAX_READAHEAD * 1024) / PAGE_CACHE_SIZE; q->backing_dev_info.state = 0; q->backing_dev_info.capabilities = BDI_CAP_MAP_COPY; |
d993831fa
|
567 |
q->backing_dev_info.name = "block"; |
5151412dd
|
568 |
q->node = node_id; |
0989a025d
|
569 |
|
e0bf68dde
|
570 |
err = bdi_init(&q->backing_dev_info); |
a73f730d0
|
571 572 |
if (err) goto fail_id; |
e0bf68dde
|
573 |
|
31373d09d
|
574 575 |
setup_timer(&q->backing_dev_info.laptop_mode_wb_timer, laptop_mode_timer_fn, (unsigned long) q); |
242f9dcb8
|
576 |
setup_timer(&q->timeout, blk_rq_timed_out_timer, (unsigned long) q); |
b855b04a0
|
577 |
INIT_LIST_HEAD(&q->queue_head); |
242f9dcb8
|
578 |
INIT_LIST_HEAD(&q->timeout_list); |
a612fddf0
|
579 |
INIT_LIST_HEAD(&q->icq_list); |
4eef30499
|
580 |
#ifdef CONFIG_BLK_CGROUP |
e8989fae3
|
581 |
INIT_LIST_HEAD(&q->blkg_list); |
4eef30499
|
582 |
#endif |
3cca6dc1c
|
583 |
INIT_DELAYED_WORK(&q->delay_work, blk_delay_work); |
483f4afc4
|
584 |
|
8324aa91d
|
585 |
kobject_init(&q->kobj, &blk_queue_ktype); |
1da177e4c
|
586 |
|
483f4afc4
|
587 |
mutex_init(&q->sysfs_lock); |
e7e72bf64
|
588 |
spin_lock_init(&q->__queue_lock); |
483f4afc4
|
589 |
|
c94a96ac9
|
590 591 592 593 594 |
/* * By default initialize queue_lock to internal lock and driver can * override it later if need be. */ q->queue_lock = &q->__queue_lock; |
b82d4b197
|
595 596 597 |
/* * A queue starts its life with bypass turned on to avoid * unnecessary bypass on/off overhead and nasty surprises during |
749fefe67
|
598 599 |
* init. The initial bypass will be finished when the queue is * registered by blk_register_queue(). |
b82d4b197
|
600 601 602 |
*/ q->bypass_depth = 1; __set_bit(QUEUE_FLAG_BYPASS, &q->queue_flags); |
320ae51fe
|
603 |
init_waitqueue_head(&q->mq_freeze_wq); |
5efd61135
|
604 |
if (blkcg_init_queue(q)) |
fff4996b7
|
605 |
goto fail_bdi; |
f51b802c1
|
606 |
|
1da177e4c
|
607 |
return q; |
a73f730d0
|
608 |
|
fff4996b7
|
609 610 |
fail_bdi: bdi_destroy(&q->backing_dev_info); |
a73f730d0
|
611 612 613 614 615 |
fail_id: ida_simple_remove(&blk_queue_ida, q->id); fail_q: kmem_cache_free(blk_requestq_cachep, q); return NULL; |
1da177e4c
|
616 |
} |
1946089a1
|
617 |
EXPORT_SYMBOL(blk_alloc_queue_node); |
1da177e4c
|
618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 |
/** * blk_init_queue - prepare a request queue for use with a block device * @rfn: The function to be called to process requests that have been * placed on the queue. * @lock: Request queue spin lock * * Description: * If a block device wishes to use the standard request handling procedures, * which sorts requests and coalesces adjacent requests, then it must * call blk_init_queue(). The function @rfn will be called when there * are requests on the queue that need to be processed. If the device * supports plugging, then @rfn may not be called immediately when requests * are available on the queue, but may be called at some time later instead. * Plugged queues are generally unplugged when a buffer belonging to one * of the requests on the queue is needed, or due to memory pressure. * * @rfn is not required, or even expected, to remove all requests off the * queue, but only as many as it can handle at a time. If it does leave * requests on the queue, it is responsible for arranging that the requests * get dealt with eventually. * * The queue spin lock must be held while manipulating the requests on the |
a038e2536
|
641 642 |
* request queue; this lock will be taken also from interrupt context, so irq * disabling is needed for it. |
1da177e4c
|
643 |
* |
710027a48
|
644 |
* Function returns a pointer to the initialized request queue, or %NULL if |
1da177e4c
|
645 646 647 648 649 650 |
* it didn't succeed. * * Note: * blk_init_queue() must be paired with a blk_cleanup_queue() call * when the block device is deactivated (such as at module unload). **/ |
1946089a1
|
651 |
|
165125e1e
|
652 |
struct request_queue *blk_init_queue(request_fn_proc *rfn, spinlock_t *lock) |
1da177e4c
|
653 |
{ |
c304a51bf
|
654 |
return blk_init_queue_node(rfn, lock, NUMA_NO_NODE); |
1946089a1
|
655 656 |
} EXPORT_SYMBOL(blk_init_queue); |
165125e1e
|
657 |
struct request_queue * |
1946089a1
|
658 659 |
blk_init_queue_node(request_fn_proc *rfn, spinlock_t *lock, int node_id) { |
c86d1b8ae
|
660 |
struct request_queue *uninit_q, *q; |
1da177e4c
|
661 |
|
c86d1b8ae
|
662 663 664 |
uninit_q = blk_alloc_queue_node(GFP_KERNEL, node_id); if (!uninit_q) return NULL; |
5151412dd
|
665 |
q = blk_init_allocated_queue(uninit_q, rfn, lock); |
c86d1b8ae
|
666 |
if (!q) |
7982e90c3
|
667 |
blk_cleanup_queue(uninit_q); |
18741986a
|
668 |
|
7982e90c3
|
669 |
return q; |
01effb0dc
|
670 671 672 673 674 675 676 |
} EXPORT_SYMBOL(blk_init_queue_node); struct request_queue * blk_init_allocated_queue(struct request_queue *q, request_fn_proc *rfn, spinlock_t *lock) { |
1da177e4c
|
677 678 |
if (!q) return NULL; |
f70ced091
|
679 |
q->fq = blk_alloc_flush_queue(q, NUMA_NO_NODE, 0); |
ba483388e
|
680 |
if (!q->fq) |
7982e90c3
|
681 |
return NULL; |
a051661ca
|
682 |
if (blk_init_rl(&q->root_rl, q, GFP_KERNEL)) |
708f04d2a
|
683 |
goto fail; |
1da177e4c
|
684 685 |
q->request_fn = rfn; |
1da177e4c
|
686 |
q->prep_rq_fn = NULL; |
28018c242
|
687 |
q->unprep_rq_fn = NULL; |
60ea8226c
|
688 |
q->queue_flags |= QUEUE_FLAG_DEFAULT; |
c94a96ac9
|
689 690 691 692 |
/* Override internal queue lock with supplied lock pointer */ if (lock) q->queue_lock = lock; |
1da177e4c
|
693 |
|
f3b144aa7
|
694 695 696 |
/* * This also sets hw/phys segments, boundary and size */ |
c20e8de27
|
697 |
blk_queue_make_request(q, blk_queue_bio); |
1da177e4c
|
698 |
|
44ec95425
|
699 |
q->sg_reserved_size = INT_MAX; |
eb1c160b2
|
700 701 |
/* Protect q->elevator from elevator_change */ mutex_lock(&q->sysfs_lock); |
b82d4b197
|
702 |
/* init elevator */ |
eb1c160b2
|
703 704 |
if (elevator_init(q, NULL)) { mutex_unlock(&q->sysfs_lock); |
708f04d2a
|
705 |
goto fail; |
eb1c160b2
|
706 707 708 |
} mutex_unlock(&q->sysfs_lock); |
b82d4b197
|
709 |
return q; |
708f04d2a
|
710 711 |
fail: |
ba483388e
|
712 |
blk_free_flush_queue(q->fq); |
708f04d2a
|
713 |
return NULL; |
1da177e4c
|
714 |
} |
5151412dd
|
715 |
EXPORT_SYMBOL(blk_init_allocated_queue); |
1da177e4c
|
716 |
|
09ac46c42
|
717 |
bool blk_get_queue(struct request_queue *q) |
1da177e4c
|
718 |
{ |
3f3299d5c
|
719 |
if (likely(!blk_queue_dying(q))) { |
09ac46c42
|
720 721 |
__blk_get_queue(q); return true; |
1da177e4c
|
722 |
} |
09ac46c42
|
723 |
return false; |
1da177e4c
|
724 |
} |
d86e0e83b
|
725 |
EXPORT_SYMBOL(blk_get_queue); |
1da177e4c
|
726 |
|
5b788ce3e
|
727 |
static inline void blk_free_request(struct request_list *rl, struct request *rq) |
1da177e4c
|
728 |
{ |
f1f8cc946
|
729 |
if (rq->cmd_flags & REQ_ELVPRIV) { |
5b788ce3e
|
730 |
elv_put_request(rl->q, rq); |
f1f8cc946
|
731 |
if (rq->elv.icq) |
11a3122f6
|
732 |
put_io_context(rq->elv.icq->ioc); |
f1f8cc946
|
733 |
} |
5b788ce3e
|
734 |
mempool_free(rq, rl->rq_pool); |
1da177e4c
|
735 |
} |
1da177e4c
|
736 737 738 739 |
/* * ioc_batching returns true if the ioc is a valid batching request and * should be given priority access to a request. */ |
165125e1e
|
740 |
static inline int ioc_batching(struct request_queue *q, struct io_context *ioc) |
1da177e4c
|
741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 |
{ if (!ioc) return 0; /* * Make sure the process is able to allocate at least 1 request * even if the batch times out, otherwise we could theoretically * lose wakeups. */ return ioc->nr_batch_requests == q->nr_batching || (ioc->nr_batch_requests > 0 && time_before(jiffies, ioc->last_waited + BLK_BATCH_TIME)); } /* * ioc_set_batching sets ioc to be a new "batcher" if it is not one. This * will cause the process to be a "batcher" on all queues in the system. This * is the behaviour we want though - once it gets a wakeup it should be given * a nice run. */ |
165125e1e
|
761 |
static void ioc_set_batching(struct request_queue *q, struct io_context *ioc) |
1da177e4c
|
762 763 764 765 766 767 768 |
{ if (!ioc || ioc_batching(q, ioc)) return; ioc->nr_batch_requests = q->nr_batching; ioc->last_waited = jiffies; } |
5b788ce3e
|
769 |
static void __freed_request(struct request_list *rl, int sync) |
1da177e4c
|
770 |
{ |
5b788ce3e
|
771 |
struct request_queue *q = rl->q; |
1da177e4c
|
772 |
|
a051661ca
|
773 774 775 776 777 778 |
/* * bdi isn't aware of blkcg yet. As all async IOs end up root * blkcg anyway, just use root blkcg state. */ if (rl == &q->root_rl && rl->count[sync] < queue_congestion_off_threshold(q)) |
1faa16d22
|
779 |
blk_clear_queue_congested(q, sync); |
1da177e4c
|
780 |
|
1faa16d22
|
781 782 783 |
if (rl->count[sync] + 1 <= q->nr_requests) { if (waitqueue_active(&rl->wait[sync])) wake_up(&rl->wait[sync]); |
1da177e4c
|
784 |
|
5b788ce3e
|
785 |
blk_clear_rl_full(rl, sync); |
1da177e4c
|
786 787 788 789 790 791 792 |
} } /* * A request has just been released. Account for it, update the full and * congestion status, wake up any waiters. Called under q->queue_lock. */ |
5b788ce3e
|
793 |
static void freed_request(struct request_list *rl, unsigned int flags) |
1da177e4c
|
794 |
{ |
5b788ce3e
|
795 |
struct request_queue *q = rl->q; |
75eb6c372
|
796 |
int sync = rw_is_sync(flags); |
1da177e4c
|
797 |
|
8a5ecdd42
|
798 |
q->nr_rqs[sync]--; |
1faa16d22
|
799 |
rl->count[sync]--; |
75eb6c372
|
800 |
if (flags & REQ_ELVPRIV) |
8a5ecdd42
|
801 |
q->nr_rqs_elvpriv--; |
1da177e4c
|
802 |
|
5b788ce3e
|
803 |
__freed_request(rl, sync); |
1da177e4c
|
804 |
|
1faa16d22
|
805 |
if (unlikely(rl->starved[sync ^ 1])) |
5b788ce3e
|
806 |
__freed_request(rl, sync ^ 1); |
1da177e4c
|
807 |
} |
e3a2b3f93
|
808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 |
int blk_update_nr_requests(struct request_queue *q, unsigned int nr) { struct request_list *rl; spin_lock_irq(q->queue_lock); q->nr_requests = nr; blk_queue_congestion_threshold(q); /* congestion isn't cgroup aware and follows root blkcg for now */ rl = &q->root_rl; if (rl->count[BLK_RW_SYNC] >= queue_congestion_on_threshold(q)) blk_set_queue_congested(q, BLK_RW_SYNC); else if (rl->count[BLK_RW_SYNC] < queue_congestion_off_threshold(q)) blk_clear_queue_congested(q, BLK_RW_SYNC); if (rl->count[BLK_RW_ASYNC] >= queue_congestion_on_threshold(q)) blk_set_queue_congested(q, BLK_RW_ASYNC); else if (rl->count[BLK_RW_ASYNC] < queue_congestion_off_threshold(q)) blk_clear_queue_congested(q, BLK_RW_ASYNC); blk_queue_for_each_rl(rl, q) { if (rl->count[BLK_RW_SYNC] >= q->nr_requests) { blk_set_rl_full(rl, BLK_RW_SYNC); } else { blk_clear_rl_full(rl, BLK_RW_SYNC); wake_up(&rl->wait[BLK_RW_SYNC]); } if (rl->count[BLK_RW_ASYNC] >= q->nr_requests) { blk_set_rl_full(rl, BLK_RW_ASYNC); } else { blk_clear_rl_full(rl, BLK_RW_ASYNC); wake_up(&rl->wait[BLK_RW_ASYNC]); } } spin_unlock_irq(q->queue_lock); return 0; } |
1da177e4c
|
848 |
/* |
9d5a4e946
|
849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 |
* Determine if elevator data should be initialized when allocating the * request associated with @bio. */ static bool blk_rq_should_init_elevator(struct bio *bio) { if (!bio) return true; /* * Flush requests do not use the elevator so skip initialization. * This allows a request to share the flush and elevator data. */ if (bio->bi_rw & (REQ_FLUSH | REQ_FUA)) return false; return true; } |
da8303c63
|
866 |
/** |
852c788f8
|
867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 |
* rq_ioc - determine io_context for request allocation * @bio: request being allocated is for this bio (can be %NULL) * * Determine io_context to use for request allocation for @bio. May return * %NULL if %current->io_context doesn't exist. */ static struct io_context *rq_ioc(struct bio *bio) { #ifdef CONFIG_BLK_CGROUP if (bio && bio->bi_ioc) return bio->bi_ioc; #endif return current->io_context; } /** |
a06e05e6a
|
883 |
* __get_request - get a free request |
5b788ce3e
|
884 |
* @rl: request list to allocate from |
da8303c63
|
885 886 887 888 889 890 891 |
* @rw_flags: RW and SYNC flags * @bio: bio to allocate request for (can be %NULL) * @gfp_mask: allocation mask * * Get a free request from @q. This function may fail under memory * pressure or if @q is dead. * |
da3dae54e
|
892 |
* Must be called with @q->queue_lock held and, |
a492f0754
|
893 894 |
* Returns ERR_PTR on failure, with @q->queue_lock held. * Returns request pointer on success, with @q->queue_lock *not held*. |
1da177e4c
|
895 |
*/ |
5b788ce3e
|
896 |
static struct request *__get_request(struct request_list *rl, int rw_flags, |
a06e05e6a
|
897 |
struct bio *bio, gfp_t gfp_mask) |
1da177e4c
|
898 |
{ |
5b788ce3e
|
899 |
struct request_queue *q = rl->q; |
b679281a6
|
900 |
struct request *rq; |
7f4b35d15
|
901 902 |
struct elevator_type *et = q->elevator->type; struct io_context *ioc = rq_ioc(bio); |
f1f8cc946
|
903 |
struct io_cq *icq = NULL; |
1faa16d22
|
904 |
const bool is_sync = rw_is_sync(rw_flags) != 0; |
75eb6c372
|
905 |
int may_queue; |
88ee5ef15
|
906 |
|
3f3299d5c
|
907 |
if (unlikely(blk_queue_dying(q))) |
a492f0754
|
908 |
return ERR_PTR(-ENODEV); |
da8303c63
|
909 |
|
7749a8d42
|
910 |
may_queue = elv_may_queue(q, rw_flags); |
88ee5ef15
|
911 912 |
if (may_queue == ELV_MQUEUE_NO) goto rq_starved; |
1faa16d22
|
913 914 |
if (rl->count[is_sync]+1 >= queue_congestion_on_threshold(q)) { if (rl->count[is_sync]+1 >= q->nr_requests) { |
f2dbd76a0
|
915 |
/* |
88ee5ef15
|
916 917 918 919 920 |
* The queue will fill after this allocation, so set * it as full, and mark this process as "batching". * This process will be allowed to complete a batch of * requests, others will be blocked. */ |
5b788ce3e
|
921 |
if (!blk_rl_full(rl, is_sync)) { |
88ee5ef15
|
922 |
ioc_set_batching(q, ioc); |
5b788ce3e
|
923 |
blk_set_rl_full(rl, is_sync); |
88ee5ef15
|
924 925 926 927 928 929 930 931 |
} else { if (may_queue != ELV_MQUEUE_MUST && !ioc_batching(q, ioc)) { /* * The queue is full and the allocating * process is not a "batcher", and not * exempted by the IO scheduler */ |
a492f0754
|
932 |
return ERR_PTR(-ENOMEM); |
88ee5ef15
|
933 934 |
} } |
1da177e4c
|
935 |
} |
a051661ca
|
936 937 938 939 940 941 |
/* * bdi isn't aware of blkcg yet. As all async IOs end up * root blkcg anyway, just use root blkcg state. */ if (rl == &q->root_rl) blk_set_queue_congested(q, is_sync); |
1da177e4c
|
942 |
} |
082cf69eb
|
943 944 945 946 947 |
/* * Only allow batching queuers to allocate up to 50% over the defined * limit of requests, otherwise we could have thousands of requests * allocated with any setting of ->nr_requests */ |
1faa16d22
|
948 |
if (rl->count[is_sync] >= (3 * q->nr_requests / 2)) |
a492f0754
|
949 |
return ERR_PTR(-ENOMEM); |
fd782a4a9
|
950 |
|
8a5ecdd42
|
951 |
q->nr_rqs[is_sync]++; |
1faa16d22
|
952 953 |
rl->count[is_sync]++; rl->starved[is_sync] = 0; |
cb98fc8bb
|
954 |
|
f1f8cc946
|
955 956 957 958 959 960 961 962 963 964 |
/* * Decide whether the new request will be managed by elevator. If * so, mark @rw_flags and increment elvpriv. Non-zero elvpriv will * prevent the current elevator from being destroyed until the new * request is freed. This guarantees icq's won't be destroyed and * makes creating new ones safe. * * Also, lookup icq while holding queue_lock. If it doesn't exist, * it will be created after releasing queue_lock. */ |
d732580b4
|
965 |
if (blk_rq_should_init_elevator(bio) && !blk_queue_bypass(q)) { |
75eb6c372
|
966 |
rw_flags |= REQ_ELVPRIV; |
8a5ecdd42
|
967 |
q->nr_rqs_elvpriv++; |
f1f8cc946
|
968 969 |
if (et->icq_cache && ioc) icq = ioc_lookup_icq(ioc, q); |
9d5a4e946
|
970 |
} |
cb98fc8bb
|
971 |
|
f253b86b4
|
972 973 |
if (blk_queue_io_stat(q)) rw_flags |= REQ_IO_STAT; |
1da177e4c
|
974 |
spin_unlock_irq(q->queue_lock); |
29e2b09ab
|
975 |
/* allocate and init request */ |
5b788ce3e
|
976 |
rq = mempool_alloc(rl->rq_pool, gfp_mask); |
29e2b09ab
|
977 |
if (!rq) |
b679281a6
|
978 |
goto fail_alloc; |
1da177e4c
|
979 |
|
29e2b09ab
|
980 |
blk_rq_init(q, rq); |
a051661ca
|
981 |
blk_rq_set_rl(rq, rl); |
29e2b09ab
|
982 |
rq->cmd_flags = rw_flags | REQ_ALLOCED; |
aaf7c6806
|
983 |
/* init elvpriv */ |
29e2b09ab
|
984 |
if (rw_flags & REQ_ELVPRIV) { |
aaf7c6806
|
985 |
if (unlikely(et->icq_cache && !icq)) { |
7f4b35d15
|
986 987 |
if (ioc) icq = ioc_create_icq(ioc, q, gfp_mask); |
aaf7c6806
|
988 989 |
if (!icq) goto fail_elvpriv; |
29e2b09ab
|
990 |
} |
aaf7c6806
|
991 992 993 994 995 996 |
rq->elv.icq = icq; if (unlikely(elv_set_request(q, rq, bio, gfp_mask))) goto fail_elvpriv; /* @rq->elv.icq holds io_context until @rq is freed */ |
29e2b09ab
|
997 998 999 |
if (icq) get_io_context(icq->ioc); } |
aaf7c6806
|
1000 |
out: |
88ee5ef15
|
1001 1002 1003 1004 1005 1006 |
/* * ioc may be NULL here, and ioc_batching will be false. That's * OK, if the queue is under the request limit then requests need * not count toward the nr_batch_requests limit. There will always * be some limit enforced by BLK_BATCH_TIME. */ |
1da177e4c
|
1007 1008 |
if (ioc_batching(q, ioc)) ioc->nr_batch_requests--; |
6728cb0e6
|
1009 |
|
1faa16d22
|
1010 |
trace_block_getrq(q, bio, rw_flags & 1); |
1da177e4c
|
1011 |
return rq; |
b679281a6
|
1012 |
|
aaf7c6806
|
1013 1014 1015 1016 1017 1018 1019 |
fail_elvpriv: /* * elvpriv init failed. ioc, icq and elvpriv aren't mempool backed * and may fail indefinitely under memory pressure and thus * shouldn't stall IO. Treat this request as !elvpriv. This will * disturb iosched and blkcg but weird is bettern than dead. */ |
7b2b10e0e
|
1020 1021 1022 |
printk_ratelimited(KERN_WARNING "%s: dev %s: request aux data allocation failed, iosched may be disturbed ", __func__, dev_name(q->backing_dev_info.dev)); |
aaf7c6806
|
1023 1024 1025 1026 1027 |
rq->cmd_flags &= ~REQ_ELVPRIV; rq->elv.icq = NULL; spin_lock_irq(q->queue_lock); |
8a5ecdd42
|
1028 |
q->nr_rqs_elvpriv--; |
aaf7c6806
|
1029 1030 |
spin_unlock_irq(q->queue_lock); goto out; |
b679281a6
|
1031 1032 1033 1034 1035 1036 1037 1038 1039 |
fail_alloc: /* * Allocation failed presumably due to memory. Undo anything we * might have messed up. * * Allocating task should really be put onto the front of the wait * queue, but this is pretty rare. */ spin_lock_irq(q->queue_lock); |
5b788ce3e
|
1040 |
freed_request(rl, rw_flags); |
b679281a6
|
1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 |
/* * in the very unlikely event that allocation failed and no * requests for this direction was pending, mark us starved so that * freeing of a request in the other direction will notice * us. another possible fix would be to split the rq mempool into * READ and WRITE */ rq_starved: if (unlikely(rl->count[is_sync] == 0)) rl->starved[is_sync] = 1; |
a492f0754
|
1052 |
return ERR_PTR(-ENOMEM); |
1da177e4c
|
1053 |
} |
da8303c63
|
1054 |
/** |
a06e05e6a
|
1055 |
* get_request - get a free request |
da8303c63
|
1056 1057 1058 |
* @q: request_queue to allocate request from * @rw_flags: RW and SYNC flags * @bio: bio to allocate request for (can be %NULL) |
a06e05e6a
|
1059 |
* @gfp_mask: allocation mask |
da8303c63
|
1060 |
* |
a06e05e6a
|
1061 1062 |
* Get a free request from @q. If %__GFP_WAIT is set in @gfp_mask, this * function keeps retrying under memory pressure and fails iff @q is dead. |
d6344532a
|
1063 |
* |
da3dae54e
|
1064 |
* Must be called with @q->queue_lock held and, |
a492f0754
|
1065 1066 |
* Returns ERR_PTR on failure, with @q->queue_lock held. * Returns request pointer on success, with @q->queue_lock *not held*. |
1da177e4c
|
1067 |
*/ |
a06e05e6a
|
1068 1069 |
static struct request *get_request(struct request_queue *q, int rw_flags, struct bio *bio, gfp_t gfp_mask) |
1da177e4c
|
1070 |
{ |
1faa16d22
|
1071 |
const bool is_sync = rw_is_sync(rw_flags) != 0; |
a06e05e6a
|
1072 |
DEFINE_WAIT(wait); |
a051661ca
|
1073 |
struct request_list *rl; |
1da177e4c
|
1074 |
struct request *rq; |
a051661ca
|
1075 1076 |
rl = blk_get_rl(q, bio); /* transferred to @rq on success */ |
a06e05e6a
|
1077 |
retry: |
a051661ca
|
1078 |
rq = __get_request(rl, rw_flags, bio, gfp_mask); |
a492f0754
|
1079 |
if (!IS_ERR(rq)) |
a06e05e6a
|
1080 |
return rq; |
1da177e4c
|
1081 |
|
3f3299d5c
|
1082 |
if (!(gfp_mask & __GFP_WAIT) || unlikely(blk_queue_dying(q))) { |
a051661ca
|
1083 |
blk_put_rl(rl); |
a492f0754
|
1084 |
return rq; |
a051661ca
|
1085 |
} |
1da177e4c
|
1086 |
|
a06e05e6a
|
1087 1088 1089 |
/* wait on @rl and retry */ prepare_to_wait_exclusive(&rl->wait[is_sync], &wait, TASK_UNINTERRUPTIBLE); |
1da177e4c
|
1090 |
|
a06e05e6a
|
1091 |
trace_block_sleeprq(q, bio, rw_flags & 1); |
1da177e4c
|
1092 |
|
a06e05e6a
|
1093 1094 |
spin_unlock_irq(q->queue_lock); io_schedule(); |
d6344532a
|
1095 |
|
a06e05e6a
|
1096 1097 1098 1099 1100 |
/* * After sleeping, we become a "batching" process and will be able * to allocate at least one request, and up to a big batch of them * for a small period time. See ioc_batching, ioc_set_batching */ |
a06e05e6a
|
1101 |
ioc_set_batching(q, current->io_context); |
05caf8dbc
|
1102 |
|
a06e05e6a
|
1103 1104 |
spin_lock_irq(q->queue_lock); finish_wait(&rl->wait[is_sync], &wait); |
1da177e4c
|
1105 |
|
a06e05e6a
|
1106 |
goto retry; |
1da177e4c
|
1107 |
} |
320ae51fe
|
1108 1109 |
static struct request *blk_old_get_request(struct request_queue *q, int rw, gfp_t gfp_mask) |
1da177e4c
|
1110 1111 1112 1113 |
{ struct request *rq; BUG_ON(rw != READ && rw != WRITE); |
7f4b35d15
|
1114 1115 |
/* create ioc upfront */ create_io_context(gfp_mask, q->node); |
d6344532a
|
1116 |
spin_lock_irq(q->queue_lock); |
a06e05e6a
|
1117 |
rq = get_request(q, rw, NULL, gfp_mask); |
a492f0754
|
1118 |
if (IS_ERR(rq)) |
da8303c63
|
1119 |
spin_unlock_irq(q->queue_lock); |
d6344532a
|
1120 |
/* q->queue_lock is unlocked at this point */ |
1da177e4c
|
1121 1122 1123 |
return rq; } |
320ae51fe
|
1124 1125 1126 1127 |
struct request *blk_get_request(struct request_queue *q, int rw, gfp_t gfp_mask) { if (q->mq_ops) |
4ce01dd1a
|
1128 |
return blk_mq_alloc_request(q, rw, gfp_mask, false); |
320ae51fe
|
1129 1130 1131 |
else return blk_old_get_request(q, rw, gfp_mask); } |
1da177e4c
|
1132 1133 1134 |
EXPORT_SYMBOL(blk_get_request); /** |
79eb63e9e
|
1135 |
* blk_make_request - given a bio, allocate a corresponding struct request. |
8ebf97560
|
1136 |
* @q: target request queue |
79eb63e9e
|
1137 1138 |
* @bio: The bio describing the memory mappings that will be submitted for IO. * It may be a chained-bio properly constructed by block/bio layer. |
8ebf97560
|
1139 |
* @gfp_mask: gfp flags to be used for memory allocation |
dc72ef4ae
|
1140 |
* |
79eb63e9e
|
1141 1142 1143 1144 |
* blk_make_request is the parallel of generic_make_request for BLOCK_PC * type commands. Where the struct request needs to be farther initialized by * the caller. It is passed a &struct bio, which describes the memory info of * the I/O transfer. |
dc72ef4ae
|
1145 |
* |
79eb63e9e
|
1146 1147 1148 1149 1150 1151 1152 1153 1154 |
* The caller of blk_make_request must make sure that bi_io_vec * are set to describe the memory buffers. That bio_data_dir() will return * the needed direction of the request. (And all bio's in the passed bio-chain * are properly set accordingly) * * If called under none-sleepable conditions, mapped bio buffers must not * need bouncing, by calling the appropriate masked or flagged allocator, * suitable for the target device. Otherwise the call to blk_queue_bounce will * BUG. |
53674ac5a
|
1155 1156 1157 1158 1159 1160 1161 1162 1163 |
* * WARNING: When allocating/cloning a bio-chain, careful consideration should be * given to how you allocate bios. In particular, you cannot use __GFP_WAIT for * anything but the first bio in the chain. Otherwise you risk waiting for IO * completion of a bio that hasn't been submitted yet, thus resulting in a * deadlock. Alternatively bios should be allocated using bio_kmalloc() instead * of bio_alloc(), as that avoids the mempool deadlock. * If possible a big IO should be split into smaller parts when allocation * fails. Partial allocation should not be an error, or you risk a live-lock. |
dc72ef4ae
|
1164 |
*/ |
79eb63e9e
|
1165 1166 |
struct request *blk_make_request(struct request_queue *q, struct bio *bio, gfp_t gfp_mask) |
dc72ef4ae
|
1167 |
{ |
79eb63e9e
|
1168 |
struct request *rq = blk_get_request(q, bio_data_dir(bio), gfp_mask); |
a492f0754
|
1169 1170 |
if (IS_ERR(rq)) return rq; |
79eb63e9e
|
1171 |
|
f27b087b8
|
1172 |
blk_rq_set_block_pc(rq); |
79eb63e9e
|
1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 |
for_each_bio(bio) { struct bio *bounce_bio = bio; int ret; blk_queue_bounce(q, &bounce_bio); ret = blk_rq_append_bio(q, rq, bounce_bio); if (unlikely(ret)) { blk_put_request(rq); return ERR_PTR(ret); } } return rq; |
dc72ef4ae
|
1186 |
} |
79eb63e9e
|
1187 |
EXPORT_SYMBOL(blk_make_request); |
dc72ef4ae
|
1188 1189 |
/** |
da3dae54e
|
1190 |
* blk_rq_set_block_pc - initialize a request to type BLOCK_PC |
f27b087b8
|
1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 |
* @rq: request to be initialized * */ void blk_rq_set_block_pc(struct request *rq) { rq->cmd_type = REQ_TYPE_BLOCK_PC; rq->__data_len = 0; rq->__sector = (sector_t) -1; rq->bio = rq->biotail = NULL; memset(rq->__cmd, 0, sizeof(rq->__cmd)); |
f27b087b8
|
1201 1202 1203 1204 |
} EXPORT_SYMBOL(blk_rq_set_block_pc); /** |
1da177e4c
|
1205 1206 1207 1208 1209 1210 1211 1212 1213 |
* blk_requeue_request - put a request back on queue * @q: request queue where request should be inserted * @rq: request to be inserted * * Description: * Drivers often keep queueing requests until the hardware cannot accept * more, when that condition happens we need to put the request back * on the queue. Must be called with queue lock held. */ |
165125e1e
|
1214 |
void blk_requeue_request(struct request_queue *q, struct request *rq) |
1da177e4c
|
1215 |
{ |
242f9dcb8
|
1216 1217 |
blk_delete_timer(rq); blk_clear_rq_complete(rq); |
5f3ea37c7
|
1218 |
trace_block_rq_requeue(q, rq); |
2056a782f
|
1219 |
|
125c99bc8
|
1220 |
if (rq->cmd_flags & REQ_QUEUED) |
1da177e4c
|
1221 |
blk_queue_end_tag(q, rq); |
ba396a6c1
|
1222 |
BUG_ON(blk_queued_rq(rq)); |
1da177e4c
|
1223 1224 |
elv_requeue_request(q, rq); } |
1da177e4c
|
1225 |
EXPORT_SYMBOL(blk_requeue_request); |
73c101011
|
1226 1227 1228 |
static void add_acct_request(struct request_queue *q, struct request *rq, int where) { |
320ae51fe
|
1229 |
blk_account_io_start(rq, true); |
7eaceacca
|
1230 |
__elv_add_request(q, rq, where); |
73c101011
|
1231 |
} |
074a7aca7
|
1232 1233 1234 |
static void part_round_stats_single(int cpu, struct hd_struct *part, unsigned long now) { |
7276d02e2
|
1235 |
int inflight; |
074a7aca7
|
1236 1237 |
if (now == part->stamp) return; |
7276d02e2
|
1238 1239 |
inflight = part_in_flight(part); if (inflight) { |
074a7aca7
|
1240 |
__part_stat_add(cpu, part, time_in_queue, |
7276d02e2
|
1241 |
inflight * (now - part->stamp)); |
074a7aca7
|
1242 1243 1244 1245 1246 1247 |
__part_stat_add(cpu, part, io_ticks, (now - part->stamp)); } part->stamp = now; } /** |
496aa8a98
|
1248 1249 1250 |
* part_round_stats() - Round off the performance stats on a struct disk_stats. * @cpu: cpu number for stats access * @part: target partition |
1da177e4c
|
1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 |
* * The average IO queue length and utilisation statistics are maintained * by observing the current state of the queue length and the amount of * time it has been in this state for. * * Normally, that accounting is done on IO completion, but that can result * in more than a second's worth of IO being accounted for within any one * second, leading to >100% utilisation. To deal with that, we call this * function to do a round-off before returning the results when reading * /proc/diskstats. This accounts immediately for all queue usage up to * the current jiffies and restarts the counters again. */ |
c99590591
|
1263 |
void part_round_stats(int cpu, struct hd_struct *part) |
6f2576af5
|
1264 1265 |
{ unsigned long now = jiffies; |
074a7aca7
|
1266 1267 1268 |
if (part->partno) part_round_stats_single(cpu, &part_to_disk(part)->part0, now); part_round_stats_single(cpu, part, now); |
6f2576af5
|
1269 |
} |
074a7aca7
|
1270 |
EXPORT_SYMBOL_GPL(part_round_stats); |
6f2576af5
|
1271 |
|
47fafbc70
|
1272 |
#ifdef CONFIG_PM |
c8158819d
|
1273 1274 1275 1276 1277 1278 1279 1280 |
static void blk_pm_put_request(struct request *rq) { if (rq->q->dev && !(rq->cmd_flags & REQ_PM) && !--rq->q->nr_pending) pm_runtime_mark_last_busy(rq->q->dev); } #else static inline void blk_pm_put_request(struct request *rq) {} #endif |
1da177e4c
|
1281 1282 1283 |
/* * queue lock must be held */ |
165125e1e
|
1284 |
void __blk_put_request(struct request_queue *q, struct request *req) |
1da177e4c
|
1285 |
{ |
1da177e4c
|
1286 1287 |
if (unlikely(!q)) return; |
1da177e4c
|
1288 |
|
6f5ba581c
|
1289 1290 1291 1292 |
if (q->mq_ops) { blk_mq_free_request(req); return; } |
c8158819d
|
1293 |
blk_pm_put_request(req); |
8922e16cf
|
1294 |
elv_completed_request(q, req); |
1cd96c242
|
1295 1296 |
/* this is a bio leak */ WARN_ON(req->bio != NULL); |
1da177e4c
|
1297 1298 1299 1300 |
/* * Request may not have originated from ll_rw_blk. if not, * it didn't come out of our reserved rq pools */ |
49171e5c6
|
1301 |
if (req->cmd_flags & REQ_ALLOCED) { |
75eb6c372
|
1302 |
unsigned int flags = req->cmd_flags; |
a051661ca
|
1303 |
struct request_list *rl = blk_rq_rl(req); |
1da177e4c
|
1304 |
|
1da177e4c
|
1305 |
BUG_ON(!list_empty(&req->queuelist)); |
360f92c24
|
1306 |
BUG_ON(ELV_ON_HASH(req)); |
1da177e4c
|
1307 |
|
a051661ca
|
1308 1309 1310 |
blk_free_request(rl, req); freed_request(rl, flags); blk_put_rl(rl); |
1da177e4c
|
1311 1312 |
} } |
6e39b69e7
|
1313 |
EXPORT_SYMBOL_GPL(__blk_put_request); |
1da177e4c
|
1314 1315 |
void blk_put_request(struct request *req) { |
165125e1e
|
1316 |
struct request_queue *q = req->q; |
8922e16cf
|
1317 |
|
320ae51fe
|
1318 1319 1320 1321 1322 1323 1324 1325 1326 |
if (q->mq_ops) blk_mq_free_request(req); else { unsigned long flags; spin_lock_irqsave(q->queue_lock, flags); __blk_put_request(q, req); spin_unlock_irqrestore(q->queue_lock, flags); } |
1da177e4c
|
1327 |
} |
1da177e4c
|
1328 |
EXPORT_SYMBOL(blk_put_request); |
66ac02801
|
1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 |
/** * blk_add_request_payload - add a payload to a request * @rq: request to update * @page: page backing the payload * @len: length of the payload. * * This allows to later add a payload to an already submitted request by * a block driver. The driver needs to take care of freeing the payload * itself. * * Note that this is a quite horrible hack and nothing but handling of * discard requests should ever use it. */ void blk_add_request_payload(struct request *rq, struct page *page, unsigned int len) { struct bio *bio = rq->bio; bio->bi_io_vec->bv_page = page; bio->bi_io_vec->bv_offset = 0; bio->bi_io_vec->bv_len = len; |
4f024f379
|
1350 |
bio->bi_iter.bi_size = len; |
66ac02801
|
1351 1352 1353 1354 1355 |
bio->bi_vcnt = 1; bio->bi_phys_segments = 1; rq->__data_len = rq->resid_len = len; rq->nr_phys_segments = 1; |
66ac02801
|
1356 1357 |
} EXPORT_SYMBOL_GPL(blk_add_request_payload); |
320ae51fe
|
1358 1359 |
bool bio_attempt_back_merge(struct request_queue *q, struct request *req, struct bio *bio) |
73c101011
|
1360 1361 |
{ const int ff = bio->bi_rw & REQ_FAILFAST_MASK; |
73c101011
|
1362 1363 |
if (!ll_back_merge_fn(q, req, bio)) return false; |
8c1cf6bb0
|
1364 |
trace_block_bio_backmerge(q, req, bio); |
73c101011
|
1365 1366 1367 1368 1369 1370 |
if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff) blk_rq_set_mixed_merge(req); req->biotail->bi_next = bio; req->biotail = bio; |
4f024f379
|
1371 |
req->__data_len += bio->bi_iter.bi_size; |
73c101011
|
1372 |
req->ioprio = ioprio_best(req->ioprio, bio_prio(bio)); |
320ae51fe
|
1373 |
blk_account_io_start(req, false); |
73c101011
|
1374 1375 |
return true; } |
320ae51fe
|
1376 1377 |
bool bio_attempt_front_merge(struct request_queue *q, struct request *req, struct bio *bio) |
73c101011
|
1378 1379 |
{ const int ff = bio->bi_rw & REQ_FAILFAST_MASK; |
73c101011
|
1380 |
|
73c101011
|
1381 1382 |
if (!ll_front_merge_fn(q, req, bio)) return false; |
8c1cf6bb0
|
1383 |
trace_block_bio_frontmerge(q, req, bio); |
73c101011
|
1384 1385 1386 |
if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff) blk_rq_set_mixed_merge(req); |
73c101011
|
1387 1388 |
bio->bi_next = req->bio; req->bio = bio; |
4f024f379
|
1389 1390 |
req->__sector = bio->bi_iter.bi_sector; req->__data_len += bio->bi_iter.bi_size; |
73c101011
|
1391 |
req->ioprio = ioprio_best(req->ioprio, bio_prio(bio)); |
320ae51fe
|
1392 |
blk_account_io_start(req, false); |
73c101011
|
1393 1394 |
return true; } |
bd87b5898
|
1395 |
/** |
320ae51fe
|
1396 |
* blk_attempt_plug_merge - try to merge with %current's plugged list |
bd87b5898
|
1397 1398 1399 1400 1401 1402 1403 1404 |
* @q: request_queue new bio is being queued at * @bio: new bio being queued * @request_count: out parameter for number of traversed plugged requests * * Determine whether @bio being queued on @q can be merged with a request * on %current's plugged list. Returns %true if merge was successful, * otherwise %false. * |
07c2bd373
|
1405 1406 1407 1408 1409 1410 |
* Plugging coalesces IOs from the same issuer for the same purpose without * going through @q->queue_lock. As such it's more of an issuing mechanism * than scheduling, and the request, while may have elvpriv data, is not * added on the elevator at this point. In addition, we don't have * reliable access to the elevator outside queue lock. Only check basic * merging parameters without querying the elevator. |
da41a589f
|
1411 1412 |
* * Caller must ensure !blk_queue_nomerges(q) beforehand. |
73c101011
|
1413 |
*/ |
320ae51fe
|
1414 1415 |
bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio, unsigned int *request_count) |
73c101011
|
1416 1417 1418 1419 |
{ struct blk_plug *plug; struct request *rq; bool ret = false; |
92f399c72
|
1420 |
struct list_head *plug_list; |
73c101011
|
1421 |
|
bd87b5898
|
1422 |
plug = current->plug; |
73c101011
|
1423 1424 |
if (!plug) goto out; |
56ebdaf2f
|
1425 |
*request_count = 0; |
73c101011
|
1426 |
|
92f399c72
|
1427 1428 1429 1430 1431 1432 |
if (q->mq_ops) plug_list = &plug->mq_list; else plug_list = &plug->list; list_for_each_entry_reverse(rq, plug_list, queuelist) { |
73c101011
|
1433 |
int el_ret; |
1b2e19f17
|
1434 1435 |
if (rq->q == q) (*request_count)++; |
56ebdaf2f
|
1436 |
|
07c2bd373
|
1437 |
if (rq->q != q || !blk_rq_merge_ok(rq, bio)) |
73c101011
|
1438 |
continue; |
050c8ea80
|
1439 |
el_ret = blk_try_merge(rq, bio); |
73c101011
|
1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 |
if (el_ret == ELEVATOR_BACK_MERGE) { ret = bio_attempt_back_merge(q, rq, bio); if (ret) break; } else if (el_ret == ELEVATOR_FRONT_MERGE) { ret = bio_attempt_front_merge(q, rq, bio); if (ret) break; } } out: return ret; } |
86db1e297
|
1453 |
void init_request_from_bio(struct request *req, struct bio *bio) |
52d9e6753
|
1454 |
{ |
4aff5e233
|
1455 |
req->cmd_type = REQ_TYPE_FS; |
52d9e6753
|
1456 |
|
7b6d91dae
|
1457 1458 |
req->cmd_flags |= bio->bi_rw & REQ_COMMON_MASK; if (bio->bi_rw & REQ_RAHEAD) |
a82afdfcb
|
1459 |
req->cmd_flags |= REQ_FAILFAST_MASK; |
b31dc66a5
|
1460 |
|
52d9e6753
|
1461 |
req->errors = 0; |
4f024f379
|
1462 |
req->__sector = bio->bi_iter.bi_sector; |
52d9e6753
|
1463 |
req->ioprio = bio_prio(bio); |
bc1c56fde
|
1464 |
blk_rq_bio_prep(req->q, req, bio); |
52d9e6753
|
1465 |
} |
5a7bbad27
|
1466 |
void blk_queue_bio(struct request_queue *q, struct bio *bio) |
1da177e4c
|
1467 |
{ |
5e00d1b5b
|
1468 |
const bool sync = !!(bio->bi_rw & REQ_SYNC); |
73c101011
|
1469 1470 1471 |
struct blk_plug *plug; int el_ret, rw_flags, where = ELEVATOR_INSERT_SORT; struct request *req; |
56ebdaf2f
|
1472 |
unsigned int request_count = 0; |
1da177e4c
|
1473 |
|
1da177e4c
|
1474 1475 1476 1477 1478 1479 |
/* * low level driver can indicate that it wants pages above a * certain limit bounced to low memory (ie for highmem, or even * ISA dma in theory) */ blk_queue_bounce(q, &bio); |
ffecfd1a7
|
1480 1481 1482 1483 |
if (bio_integrity_enabled(bio) && bio_integrity_prep(bio)) { bio_endio(bio, -EIO); return; } |
4fed947cb
|
1484 |
if (bio->bi_rw & (REQ_FLUSH | REQ_FUA)) { |
73c101011
|
1485 |
spin_lock_irq(q->queue_lock); |
ae1b15396
|
1486 |
where = ELEVATOR_INSERT_FLUSH; |
28e7d1845
|
1487 1488 |
goto get_rq; } |
73c101011
|
1489 1490 1491 1492 |
/* * Check if we can merge with the plugged list before grabbing * any locks. */ |
da41a589f
|
1493 1494 |
if (!blk_queue_nomerges(q) && blk_attempt_plug_merge(q, bio, &request_count)) |
5a7bbad27
|
1495 |
return; |
1da177e4c
|
1496 |
|
73c101011
|
1497 |
spin_lock_irq(q->queue_lock); |
2056a782f
|
1498 |
|
73c101011
|
1499 1500 |
el_ret = elv_merge(q, &req, bio); if (el_ret == ELEVATOR_BACK_MERGE) { |
73c101011
|
1501 |
if (bio_attempt_back_merge(q, req, bio)) { |
07c2bd373
|
1502 |
elv_bio_merged(q, req, bio); |
73c101011
|
1503 1504 1505 1506 1507 |
if (!attempt_back_merge(q, req)) elv_merged_request(q, req, el_ret); goto out_unlock; } } else if (el_ret == ELEVATOR_FRONT_MERGE) { |
73c101011
|
1508 |
if (bio_attempt_front_merge(q, req, bio)) { |
07c2bd373
|
1509 |
elv_bio_merged(q, req, bio); |
73c101011
|
1510 1511 1512 |
if (!attempt_front_merge(q, req)) elv_merged_request(q, req, el_ret); goto out_unlock; |
80a761fd3
|
1513 |
} |
1da177e4c
|
1514 |
} |
450991bc1
|
1515 |
get_rq: |
1da177e4c
|
1516 |
/* |
7749a8d42
|
1517 1518 1519 1520 1521 1522 |
* This sync check and mask will be re-done in init_request_from_bio(), * but we need to set it earlier to expose the sync flag to the * rq allocator and io schedulers. */ rw_flags = bio_data_dir(bio); if (sync) |
7b6d91dae
|
1523 |
rw_flags |= REQ_SYNC; |
7749a8d42
|
1524 1525 |
/* |
450991bc1
|
1526 |
* Grab a free request. This is might sleep but can not fail. |
d6344532a
|
1527 |
* Returns with the queue unlocked. |
450991bc1
|
1528 |
*/ |
a06e05e6a
|
1529 |
req = get_request(q, rw_flags, bio, GFP_NOIO); |
a492f0754
|
1530 1531 |
if (IS_ERR(req)) { bio_endio(bio, PTR_ERR(req)); /* @q is dead */ |
da8303c63
|
1532 1533 |
goto out_unlock; } |
d6344532a
|
1534 |
|
450991bc1
|
1535 1536 1537 1538 1539 |
/* * After dropping the lock and possibly sleeping here, our request * may now be mergeable after it had proven unmergeable (above). * We don't worry about that case for efficiency. It won't happen * often, and the elevators are able to handle it. |
1da177e4c
|
1540 |
*/ |
52d9e6753
|
1541 |
init_request_from_bio(req, bio); |
1da177e4c
|
1542 |
|
9562ad9ab
|
1543 |
if (test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags)) |
11ccf116d
|
1544 |
req->cpu = raw_smp_processor_id(); |
73c101011
|
1545 1546 |
plug = current->plug; |
721a9602e
|
1547 |
if (plug) { |
dc6d36c97
|
1548 1549 |
/* * If this is the first request added after a plug, fire |
7aef2e780
|
1550 |
* of a plug trace. |
dc6d36c97
|
1551 |
*/ |
7aef2e780
|
1552 |
if (!request_count) |
dc6d36c97
|
1553 |
trace_block_plug(q); |
3540d5e89
|
1554 |
else { |
019ceb7d5
|
1555 |
if (request_count >= BLK_MAX_REQUEST_COUNT) { |
3540d5e89
|
1556 |
blk_flush_plug_list(plug, false); |
019ceb7d5
|
1557 1558 |
trace_block_plug(q); } |
73c101011
|
1559 |
} |
73c101011
|
1560 |
list_add_tail(&req->queuelist, &plug->list); |
320ae51fe
|
1561 |
blk_account_io_start(req, true); |
73c101011
|
1562 1563 1564 |
} else { spin_lock_irq(q->queue_lock); add_acct_request(q, req, where); |
24ecfbe27
|
1565 |
__blk_run_queue(q); |
73c101011
|
1566 1567 1568 |
out_unlock: spin_unlock_irq(q->queue_lock); } |
1da177e4c
|
1569 |
} |
c20e8de27
|
1570 |
EXPORT_SYMBOL_GPL(blk_queue_bio); /* for device mapper only */ |
1da177e4c
|
1571 1572 1573 1574 1575 1576 1577 |
/* * If bio->bi_dev is a partition, remap the location */ static inline void blk_partition_remap(struct bio *bio) { struct block_device *bdev = bio->bi_bdev; |
bf2de6f5a
|
1578 |
if (bio_sectors(bio) && bdev != bdev->bd_contains) { |
1da177e4c
|
1579 |
struct hd_struct *p = bdev->bd_part; |
4f024f379
|
1580 |
bio->bi_iter.bi_sector += p->start_sect; |
1da177e4c
|
1581 |
bio->bi_bdev = bdev->bd_contains; |
c7149d6bc
|
1582 |
|
d07335e51
|
1583 1584 |
trace_block_bio_remap(bdev_get_queue(bio->bi_bdev), bio, bdev->bd_dev, |
4f024f379
|
1585 |
bio->bi_iter.bi_sector - p->start_sect); |
1da177e4c
|
1586 1587 |
} } |
1da177e4c
|
1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 |
static void handle_bad_sector(struct bio *bio) { char b[BDEVNAME_SIZE]; printk(KERN_INFO "attempt to access beyond end of device "); printk(KERN_INFO "%s: rw=%ld, want=%Lu, limit=%Lu ", bdevname(bio->bi_bdev, b), bio->bi_rw, |
f73a1c7d1
|
1598 |
(unsigned long long)bio_end_sector(bio), |
77304d2ab
|
1599 |
(long long)(i_size_read(bio->bi_bdev->bd_inode) >> 9)); |
1da177e4c
|
1600 1601 1602 |
set_bit(BIO_EOF, &bio->bi_flags); } |
c17bb4951
|
1603 1604 1605 1606 1607 1608 1609 1610 1611 |
#ifdef CONFIG_FAIL_MAKE_REQUEST static DECLARE_FAULT_ATTR(fail_make_request); static int __init setup_fail_make_request(char *str) { return setup_fault_attr(&fail_make_request, str); } __setup("fail_make_request=", setup_fail_make_request); |
b2c9cd379
|
1612 |
static bool should_fail_request(struct hd_struct *part, unsigned int bytes) |
c17bb4951
|
1613 |
{ |
b2c9cd379
|
1614 |
return part->make_it_fail && should_fail(&fail_make_request, bytes); |
c17bb4951
|
1615 1616 1617 1618 |
} static int __init fail_make_request_debugfs(void) { |
dd48c085c
|
1619 1620 |
struct dentry *dir = fault_create_debugfs_attr("fail_make_request", NULL, &fail_make_request); |
21f9fcd81
|
1621 |
return PTR_ERR_OR_ZERO(dir); |
c17bb4951
|
1622 1623 1624 1625 1626 |
} late_initcall(fail_make_request_debugfs); #else /* CONFIG_FAIL_MAKE_REQUEST */ |
b2c9cd379
|
1627 1628 |
static inline bool should_fail_request(struct hd_struct *part, unsigned int bytes) |
c17bb4951
|
1629 |
{ |
b2c9cd379
|
1630 |
return false; |
c17bb4951
|
1631 1632 1633 |
} #endif /* CONFIG_FAIL_MAKE_REQUEST */ |
c07e2b412
|
1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 |
/* * Check whether this bio extends beyond the end of the device. */ static inline int bio_check_eod(struct bio *bio, unsigned int nr_sectors) { sector_t maxsector; if (!nr_sectors) return 0; /* Test device or partition size, when known. */ |
77304d2ab
|
1645 |
maxsector = i_size_read(bio->bi_bdev->bd_inode) >> 9; |
c07e2b412
|
1646 |
if (maxsector) { |
4f024f379
|
1647 |
sector_t sector = bio->bi_iter.bi_sector; |
c07e2b412
|
1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 |
if (maxsector < nr_sectors || maxsector - nr_sectors < sector) { /* * This may well happen - the kernel calls bread() * without checking the size of the device, e.g., when * mounting a device. */ handle_bad_sector(bio); return 1; } } return 0; } |
27a84d54c
|
1662 1663 |
static noinline_for_stack bool generic_make_request_checks(struct bio *bio) |
1da177e4c
|
1664 |
{ |
165125e1e
|
1665 |
struct request_queue *q; |
5a7bbad27
|
1666 |
int nr_sectors = bio_sectors(bio); |
51fd77bd9
|
1667 |
int err = -EIO; |
5a7bbad27
|
1668 1669 |
char b[BDEVNAME_SIZE]; struct hd_struct *part; |
1da177e4c
|
1670 1671 |
might_sleep(); |
1da177e4c
|
1672 |
|
c07e2b412
|
1673 1674 |
if (bio_check_eod(bio, nr_sectors)) goto end_io; |
1da177e4c
|
1675 |
|
5a7bbad27
|
1676 1677 1678 1679 1680 1681 1682 |
q = bdev_get_queue(bio->bi_bdev); if (unlikely(!q)) { printk(KERN_ERR "generic_make_request: Trying to access " "nonexistent block-device %s (%Lu) ", bdevname(bio->bi_bdev, b), |
4f024f379
|
1683 |
(long long) bio->bi_iter.bi_sector); |
5a7bbad27
|
1684 1685 |
goto end_io; } |
c17bb4951
|
1686 |
|
e2a60da74
|
1687 1688 |
if (likely(bio_is_rw(bio) && nr_sectors > queue_max_hw_sectors(q))) { |
5a7bbad27
|
1689 1690 1691 1692 1693 1694 1695 |
printk(KERN_ERR "bio too big device %s (%u > %u) ", bdevname(bio->bi_bdev, b), bio_sectors(bio), queue_max_hw_sectors(q)); goto end_io; } |
1da177e4c
|
1696 |
|
5a7bbad27
|
1697 |
part = bio->bi_bdev->bd_part; |
4f024f379
|
1698 |
if (should_fail_request(part, bio->bi_iter.bi_size) || |
5a7bbad27
|
1699 |
should_fail_request(&part_to_disk(part)->part0, |
4f024f379
|
1700 |
bio->bi_iter.bi_size)) |
5a7bbad27
|
1701 |
goto end_io; |
2056a782f
|
1702 |
|
5a7bbad27
|
1703 1704 1705 1706 1707 |
/* * If this device has partitions, remap block n * of partition p to block n+start(p) of the disk. */ blk_partition_remap(bio); |
2056a782f
|
1708 |
|
5a7bbad27
|
1709 1710 |
if (bio_check_eod(bio, nr_sectors)) goto end_io; |
1e87901e1
|
1711 |
|
5a7bbad27
|
1712 1713 1714 1715 1716 1717 1718 1719 1720 |
/* * Filter flush bio's early so that make_request based * drivers without flush support don't have to worry * about them. */ if ((bio->bi_rw & (REQ_FLUSH | REQ_FUA)) && !q->flush_flags) { bio->bi_rw &= ~(REQ_FLUSH | REQ_FUA); if (!nr_sectors) { err = 0; |
51fd77bd9
|
1721 1722 |
goto end_io; } |
5a7bbad27
|
1723 |
} |
5ddfe9691
|
1724 |
|
5a7bbad27
|
1725 1726 |
if ((bio->bi_rw & REQ_DISCARD) && (!blk_queue_discard(q) || |
e2a60da74
|
1727 |
((bio->bi_rw & REQ_SECURE) && !blk_queue_secdiscard(q)))) { |
5a7bbad27
|
1728 1729 1730 |
err = -EOPNOTSUPP; goto end_io; } |
01edede41
|
1731 |
|
4363ac7c1
|
1732 |
if (bio->bi_rw & REQ_WRITE_SAME && !bdev_write_same(bio->bi_bdev)) { |
5a7bbad27
|
1733 1734 1735 |
err = -EOPNOTSUPP; goto end_io; } |
01edede41
|
1736 |
|
7f4b35d15
|
1737 1738 1739 1740 1741 1742 1743 |
/* * Various block parts want %current->io_context and lazy ioc * allocation ends up trading a lot of pain for a small amount of * memory. Just allocate it upfront. This may fail and block * layer knows how to live with it. */ create_io_context(GFP_ATOMIC, q->node); |
bc16a4f93
|
1744 1745 |
if (blk_throtl_bio(q, bio)) return false; /* throttled, will be resubmitted later */ |
27a84d54c
|
1746 |
|
5a7bbad27
|
1747 |
trace_block_bio_queue(q, bio); |
27a84d54c
|
1748 |
return true; |
a7384677b
|
1749 1750 1751 |
end_io: bio_endio(bio, err); |
27a84d54c
|
1752 |
return false; |
1da177e4c
|
1753 |
} |
27a84d54c
|
1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 |
/** * generic_make_request - hand a buffer to its device driver for I/O * @bio: The bio describing the location in memory and on the device. * * generic_make_request() is used to make I/O requests of block * devices. It is passed a &struct bio, which describes the I/O that needs * to be done. * * generic_make_request() does not return any status. The * success/failure status of the request, along with notification of * completion, is delivered asynchronously through the bio->bi_end_io * function described (one day) else where. * * The caller of generic_make_request must make sure that bi_io_vec * are set to describe the memory buffer, and that bi_dev and bi_sector are * set to describe the device address, and the * bi_end_io and optionally bi_private are set to describe how * completion notification should be signaled. * * generic_make_request and the drivers it calls may use bi_next if this * bio happens to be merged with someone else, and may resubmit the bio to * a lower device by calling into generic_make_request recursively, which * means the bio should NOT be touched after the call to ->make_request_fn. |
d89d87965
|
1777 1778 1779 |
*/ void generic_make_request(struct bio *bio) { |
bddd87c7e
|
1780 |
struct bio_list bio_list_on_stack; |
27a84d54c
|
1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 |
if (!generic_make_request_checks(bio)) return; /* * We only want one ->make_request_fn to be active at a time, else * stack usage with stacked devices could be a problem. So use * current->bio_list to keep a list of requests submited by a * make_request_fn function. current->bio_list is also used as a * flag to say if generic_make_request is currently active in this * task or not. If it is NULL, then no make_request is active. If * it is non-NULL, then a make_request is active, and new requests * should be added at the tail */ |
bddd87c7e
|
1794 |
if (current->bio_list) { |
bddd87c7e
|
1795 |
bio_list_add(current->bio_list, bio); |
d89d87965
|
1796 1797 |
return; } |
27a84d54c
|
1798 |
|
d89d87965
|
1799 1800 1801 1802 1803 |
/* following loop may be a bit non-obvious, and so deserves some * explanation. * Before entering the loop, bio->bi_next is NULL (as all callers * ensure that) so we have a list with a single bio. * We pretend that we have just taken it off a longer list, so |
bddd87c7e
|
1804 1805 |
* we assign bio_list to a pointer to the bio_list_on_stack, * thus initialising the bio_list of new bios to be |
27a84d54c
|
1806 |
* added. ->make_request() may indeed add some more bios |
d89d87965
|
1807 1808 1809 |
* through a recursive call to generic_make_request. If it * did, we find a non-NULL value in bio_list and re-enter the loop * from the top. In this case we really did just take the bio |
bddd87c7e
|
1810 |
* of the top of the list (no pretending) and so remove it from |
27a84d54c
|
1811 |
* bio_list, and call into ->make_request() again. |
d89d87965
|
1812 1813 |
*/ BUG_ON(bio->bi_next); |
bddd87c7e
|
1814 1815 |
bio_list_init(&bio_list_on_stack); current->bio_list = &bio_list_on_stack; |
d89d87965
|
1816 |
do { |
27a84d54c
|
1817 1818 1819 |
struct request_queue *q = bdev_get_queue(bio->bi_bdev); q->make_request_fn(q, bio); |
bddd87c7e
|
1820 |
bio = bio_list_pop(current->bio_list); |
d89d87965
|
1821 |
} while (bio); |
bddd87c7e
|
1822 |
current->bio_list = NULL; /* deactivate */ |
d89d87965
|
1823 |
} |
1da177e4c
|
1824 1825 1826 |
EXPORT_SYMBOL(generic_make_request); /** |
710027a48
|
1827 |
* submit_bio - submit a bio to the block device layer for I/O |
1da177e4c
|
1828 1829 1830 1831 1832 |
* @rw: whether to %READ or %WRITE, or maybe to %READA (read ahead) * @bio: The &struct bio which describes the I/O * * submit_bio() is very similar in purpose to generic_make_request(), and * uses that function to do most of the work. Both are fairly rough |
710027a48
|
1833 |
* interfaces; @bio must be presetup and ready for I/O. |
1da177e4c
|
1834 1835 1836 1837 |
* */ void submit_bio(int rw, struct bio *bio) { |
22e2c507c
|
1838 |
bio->bi_rw |= rw; |
1da177e4c
|
1839 |
|
bf2de6f5a
|
1840 1841 1842 1843 |
/* * If it's a regular read/write or a barrier with data attached, * go through the normal accounting stuff before submission. */ |
e2a60da74
|
1844 |
if (bio_has_data(bio)) { |
4363ac7c1
|
1845 1846 1847 1848 1849 1850 |
unsigned int count; if (unlikely(rw & REQ_WRITE_SAME)) count = bdev_logical_block_size(bio->bi_bdev) >> 9; else count = bio_sectors(bio); |
bf2de6f5a
|
1851 1852 1853 |
if (rw & WRITE) { count_vm_events(PGPGOUT, count); } else { |
4f024f379
|
1854 |
task_io_account_read(bio->bi_iter.bi_size); |
bf2de6f5a
|
1855 1856 1857 1858 1859 |
count_vm_events(PGPGIN, count); } if (unlikely(block_dump)) { char b[BDEVNAME_SIZE]; |
8dcbdc742
|
1860 1861 |
printk(KERN_DEBUG "%s(%d): %s block %Lu on %s (%u sectors) ", |
ba25f9dcc
|
1862 |
current->comm, task_pid_nr(current), |
bf2de6f5a
|
1863 |
(rw & WRITE) ? "WRITE" : "READ", |
4f024f379
|
1864 |
(unsigned long long)bio->bi_iter.bi_sector, |
8dcbdc742
|
1865 1866 |
bdevname(bio->bi_bdev, b), count); |
bf2de6f5a
|
1867 |
} |
1da177e4c
|
1868 1869 1870 1871 |
} generic_make_request(bio); } |
1da177e4c
|
1872 |
EXPORT_SYMBOL(submit_bio); |
3bcddeac1
|
1873 |
/** |
82124d603
|
1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 |
* blk_rq_check_limits - Helper function to check a request for the queue limit * @q: the queue * @rq: the request being checked * * Description: * @rq may have been made based on weaker limitations of upper-level queues * in request stacking drivers, and it may violate the limitation of @q. * Since the block layer and the underlying device driver trust @rq * after it is inserted to @q, it should be checked against @q before * the insertion using this generic function. * * This function should also be useful for request stacking drivers |
eef35c2d4
|
1886 |
* in some cases below, so export this function. |
82124d603
|
1887 1888 |
* Request stacking drivers like request-based dm may change the queue * limits while requests are in the queue (e.g. dm's table swapping). |
e227867f1
|
1889 |
* Such request stacking drivers should check those requests against |
82124d603
|
1890 1891 1892 1893 1894 1895 |
* the new queue limits again when they dispatch those requests, * although such checkings are also done against the old queue limits * when submitting requests. */ int blk_rq_check_limits(struct request_queue *q, struct request *rq) { |
e2a60da74
|
1896 |
if (!rq_mergeable(rq)) |
3383977fa
|
1897 |
return 0; |
f31dc1cd4
|
1898 |
if (blk_rq_sectors(rq) > blk_queue_get_max_sectors(q, rq->cmd_flags)) { |
82124d603
|
1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 |
printk(KERN_ERR "%s: over max size limit. ", __func__); return -EIO; } /* * queue's settings related to segment counting like q->bounce_pfn * may differ from that of other stacking queues. * Recalculate it to check the request correctly on this queue's * limitation. */ blk_recalc_rq_segments(rq); |
8a78362c4
|
1911 |
if (rq->nr_phys_segments > queue_max_segments(q)) { |
82124d603
|
1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 |
printk(KERN_ERR "%s: over max segments limit. ", __func__); return -EIO; } return 0; } EXPORT_SYMBOL_GPL(blk_rq_check_limits); /** * blk_insert_cloned_request - Helper for stacking drivers to submit a request * @q: the queue to submit the request * @rq: the request being queued */ int blk_insert_cloned_request(struct request_queue *q, struct request *rq) { unsigned long flags; |
4853abaae
|
1929 |
int where = ELEVATOR_INSERT_BACK; |
82124d603
|
1930 1931 1932 |
if (blk_rq_check_limits(q, rq)) return -EIO; |
b2c9cd379
|
1933 1934 |
if (rq->rq_disk && should_fail_request(&rq->rq_disk->part0, blk_rq_bytes(rq))) |
82124d603
|
1935 |
return -EIO; |
82124d603
|
1936 1937 |
spin_lock_irqsave(q->queue_lock, flags); |
3f3299d5c
|
1938 |
if (unlikely(blk_queue_dying(q))) { |
8ba61435d
|
1939 1940 1941 |
spin_unlock_irqrestore(q->queue_lock, flags); return -ENODEV; } |
82124d603
|
1942 1943 1944 1945 1946 1947 |
/* * Submitting request must be dequeued before calling this function * because it will be linked to another request_queue */ BUG_ON(blk_queued_rq(rq)); |
4853abaae
|
1948 1949 1950 1951 |
if (rq->cmd_flags & (REQ_FLUSH|REQ_FUA)) where = ELEVATOR_INSERT_FLUSH; add_acct_request(q, rq, where); |
e67b77c79
|
1952 1953 |
if (where == ELEVATOR_INSERT_FLUSH) __blk_run_queue(q); |
82124d603
|
1954 1955 1956 1957 1958 |
spin_unlock_irqrestore(q->queue_lock, flags); return 0; } EXPORT_SYMBOL_GPL(blk_insert_cloned_request); |
80a761fd3
|
1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 |
/** * blk_rq_err_bytes - determine number of bytes till the next failure boundary * @rq: request to examine * * Description: * A request could be merge of IOs which require different failure * handling. This function determines the number of bytes which * can be failed from the beginning of the request without * crossing into area which need to be retried further. * * Return: * The number of bytes to fail. * * Context: * queue_lock must be held. */ unsigned int blk_rq_err_bytes(const struct request *rq) { unsigned int ff = rq->cmd_flags & REQ_FAILFAST_MASK; unsigned int bytes = 0; struct bio *bio; if (!(rq->cmd_flags & REQ_MIXED_MERGE)) return blk_rq_bytes(rq); /* * Currently the only 'mixing' which can happen is between * different fastfail types. We can safely fail portions * which have all the failfast bits that the first one has - * the ones which are at least as eager to fail as the first * one. */ for (bio = rq->bio; bio; bio = bio->bi_next) { if ((bio->bi_rw & ff) != ff) break; |
4f024f379
|
1994 |
bytes += bio->bi_iter.bi_size; |
80a761fd3
|
1995 1996 1997 1998 1999 2000 2001 |
} /* this could lead to infinite loop */ BUG_ON(blk_rq_bytes(rq) && !bytes); return bytes; } EXPORT_SYMBOL_GPL(blk_rq_err_bytes); |
320ae51fe
|
2002 |
void blk_account_io_completion(struct request *req, unsigned int bytes) |
bc58ba946
|
2003 |
{ |
c2553b584
|
2004 |
if (blk_do_io_stat(req)) { |
bc58ba946
|
2005 2006 2007 2008 2009 |
const int rw = rq_data_dir(req); struct hd_struct *part; int cpu; cpu = part_stat_lock(); |
09e099d4b
|
2010 |
part = req->part; |
bc58ba946
|
2011 2012 2013 2014 |
part_stat_add(cpu, part, sectors[rw], bytes >> 9); part_stat_unlock(); } } |
320ae51fe
|
2015 |
void blk_account_io_done(struct request *req) |
bc58ba946
|
2016 |
{ |
bc58ba946
|
2017 |
/* |
dd4c133f3
|
2018 2019 2020 |
* Account IO completion. flush_rq isn't accounted as a * normal IO on queueing nor completion. Accounting the * containing request is enough. |
bc58ba946
|
2021 |
*/ |
414b4ff5e
|
2022 |
if (blk_do_io_stat(req) && !(req->cmd_flags & REQ_FLUSH_SEQ)) { |
bc58ba946
|
2023 2024 2025 2026 2027 2028 |
unsigned long duration = jiffies - req->start_time; const int rw = rq_data_dir(req); struct hd_struct *part; int cpu; cpu = part_stat_lock(); |
09e099d4b
|
2029 |
part = req->part; |
bc58ba946
|
2030 2031 2032 2033 |
part_stat_inc(cpu, part, ios[rw]); part_stat_add(cpu, part, ticks[rw], duration); part_round_stats(cpu, part); |
316d315bf
|
2034 |
part_dec_in_flight(part, rw); |
bc58ba946
|
2035 |
|
6c23a9681
|
2036 |
hd_struct_put(part); |
bc58ba946
|
2037 2038 2039 |
part_stat_unlock(); } } |
47fafbc70
|
2040 |
#ifdef CONFIG_PM |
c8158819d
|
2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 |
/* * Don't process normal requests when queue is suspended * or in the process of suspending/resuming */ static struct request *blk_pm_peek_request(struct request_queue *q, struct request *rq) { if (q->dev && (q->rpm_status == RPM_SUSPENDED || (q->rpm_status != RPM_ACTIVE && !(rq->cmd_flags & REQ_PM)))) return NULL; else return rq; } #else static inline struct request *blk_pm_peek_request(struct request_queue *q, struct request *rq) { return rq; } #endif |
320ae51fe
|
2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 |
void blk_account_io_start(struct request *rq, bool new_io) { struct hd_struct *part; int rw = rq_data_dir(rq); int cpu; if (!blk_do_io_stat(rq)) return; cpu = part_stat_lock(); if (!new_io) { part = rq->part; part_stat_inc(cpu, part, merges[rw]); } else { part = disk_map_sector_rcu(rq->rq_disk, blk_rq_pos(rq)); if (!hd_struct_try_get(part)) { /* * The partition is already being removed, * the request will be accounted on the disk only * * We take a reference on disk->part0 although that * partition will never be deleted, so we can treat * it as any other partition. */ part = &rq->rq_disk->part0; hd_struct_get(part); } part_round_stats(cpu, part); part_inc_in_flight(part, rw); rq->part = part; } part_stat_unlock(); } |
53a08807c
|
2096 |
/** |
9934c8c04
|
2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 |
* blk_peek_request - peek at the top of a request queue * @q: request queue to peek at * * Description: * Return the request at the top of @q. The returned request * should be started using blk_start_request() before LLD starts * processing it. * * Return: * Pointer to the request at the top of @q if available. Null * otherwise. * * Context: * queue_lock must be held. */ struct request *blk_peek_request(struct request_queue *q) |
158dbda00
|
2113 2114 2115 2116 2117 |
{ struct request *rq; int ret; while ((rq = __elv_next_request(q)) != NULL) { |
c8158819d
|
2118 2119 2120 2121 |
rq = blk_pm_peek_request(q, rq); if (!rq) break; |
158dbda00
|
2122 2123 2124 2125 2126 2127 |
if (!(rq->cmd_flags & REQ_STARTED)) { /* * This is the first time the device driver * sees this request (possibly after * requeueing). Notify IO scheduler. */ |
33659ebba
|
2128 |
if (rq->cmd_flags & REQ_SORTED) |
158dbda00
|
2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 |
elv_activate_rq(q, rq); /* * just mark as started even if we don't start * it, a request that has been delayed should * not be passed by new incoming requests */ rq->cmd_flags |= REQ_STARTED; trace_block_rq_issue(q, rq); } if (!q->boundary_rq || q->boundary_rq == rq) { q->end_sector = rq_end_sector(rq); q->boundary_rq = NULL; } if (rq->cmd_flags & REQ_DONTPREP) break; |
2e46e8b27
|
2147 |
if (q->dma_drain_size && blk_rq_bytes(rq)) { |
158dbda00
|
2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 |
/* * make sure space for the drain appears we * know we can do this because max_hw_segments * has been adjusted to be one fewer than the * device can handle */ rq->nr_phys_segments++; } if (!q->prep_rq_fn) break; ret = q->prep_rq_fn(q, rq); if (ret == BLKPREP_OK) { break; } else if (ret == BLKPREP_DEFER) { /* * the request may have been (partially) prepped. * we need to keep this request in the front to * avoid resource deadlock. REQ_STARTED will * prevent other fs requests from passing this one. */ |
2e46e8b27
|
2170 |
if (q->dma_drain_size && blk_rq_bytes(rq) && |
158dbda00
|
2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 |
!(rq->cmd_flags & REQ_DONTPREP)) { /* * remove the space for the drain we added * so that we don't add it again */ --rq->nr_phys_segments; } rq = NULL; break; } else if (ret == BLKPREP_KILL) { rq->cmd_flags |= REQ_QUIET; |
c143dc903
|
2183 2184 2185 2186 2187 |
/* * Mark this request as started so we don't trigger * any debug logic in the end I/O path. */ blk_start_request(rq); |
40cbbb781
|
2188 |
__blk_end_request_all(rq, -EIO); |
158dbda00
|
2189 2190 2191 2192 2193 2194 2195 2196 2197 |
} else { printk(KERN_ERR "%s: bad return=%d ", __func__, ret); break; } } return rq; } |
9934c8c04
|
2198 |
EXPORT_SYMBOL(blk_peek_request); |
158dbda00
|
2199 |
|
9934c8c04
|
2200 |
void blk_dequeue_request(struct request *rq) |
158dbda00
|
2201 |
{ |
9934c8c04
|
2202 |
struct request_queue *q = rq->q; |
158dbda00
|
2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 |
BUG_ON(list_empty(&rq->queuelist)); BUG_ON(ELV_ON_HASH(rq)); list_del_init(&rq->queuelist); /* * the time frame between a request being removed from the lists * and to it is freed is accounted as io that is in progress at * the driver side. */ |
9195291e5
|
2213 |
if (blk_account_rq(rq)) { |
0a7ae2ff0
|
2214 |
q->in_flight[rq_is_sync(rq)]++; |
9195291e5
|
2215 2216 |
set_io_start_time_ns(rq); } |
158dbda00
|
2217 |
} |
5efccd17c
|
2218 |
/** |
9934c8c04
|
2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 |
* blk_start_request - start request processing on the driver * @req: request to dequeue * * Description: * Dequeue @req and start timeout timer on it. This hands off the * request to the driver. * * Block internal functions which don't want to start timer should * call blk_dequeue_request(). * * Context: * queue_lock must be held. */ void blk_start_request(struct request *req) { blk_dequeue_request(req); /* |
5f49f6317
|
2237 2238 |
* We are now handing the request to the hardware, initialize * resid_len to full count and add the timeout handler. |
9934c8c04
|
2239 |
*/ |
5f49f6317
|
2240 |
req->resid_len = blk_rq_bytes(req); |
dbb66c4be
|
2241 2242 |
if (unlikely(blk_bidi_rq(req))) req->next_rq->resid_len = blk_rq_bytes(req->next_rq); |
4912aa6c1
|
2243 |
BUG_ON(test_bit(REQ_ATOM_COMPLETE, &req->atomic_flags)); |
9934c8c04
|
2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 |
blk_add_timer(req); } EXPORT_SYMBOL(blk_start_request); /** * blk_fetch_request - fetch a request from a request queue * @q: request queue to fetch a request from * * Description: * Return the request at the top of @q. The request is started on * return and LLD can start processing it immediately. * * Return: * Pointer to the request at the top of @q if available. Null * otherwise. * * Context: * queue_lock must be held. */ struct request *blk_fetch_request(struct request_queue *q) { struct request *rq; rq = blk_peek_request(q); if (rq) blk_start_request(rq); return rq; } EXPORT_SYMBOL(blk_fetch_request); /** |
2e60e0229
|
2275 |
* blk_update_request - Special helper function for request stacking drivers |
8ebf97560
|
2276 |
* @req: the request being processed |
710027a48
|
2277 |
* @error: %0 for success, < %0 for error |
8ebf97560
|
2278 |
* @nr_bytes: number of bytes to complete @req |
3bcddeac1
|
2279 2280 |
* * Description: |
8ebf97560
|
2281 2282 2283 |
* Ends I/O on a number of bytes attached to @req, but doesn't complete * the request structure even if @req doesn't have leftover. * If @req has leftover, sets it up for the next range of segments. |
2e60e0229
|
2284 2285 2286 2287 2288 2289 2290 |
* * This special helper function is only for request stacking drivers * (e.g. request-based dm) so that they can handle partial completion. * Actual device drivers should use blk_end_request instead. * * Passing the result of blk_rq_bytes() as @nr_bytes guarantees * %false return from this function. |
3bcddeac1
|
2291 2292 |
* * Return: |
2e60e0229
|
2293 2294 |
* %false - this request doesn't have any more data * %true - this request has more data |
3bcddeac1
|
2295 |
**/ |
2e60e0229
|
2296 |
bool blk_update_request(struct request *req, int error, unsigned int nr_bytes) |
1da177e4c
|
2297 |
{ |
f79ea4161
|
2298 |
int total_bytes; |
1da177e4c
|
2299 |
|
4a0efdc93
|
2300 |
trace_block_rq_complete(req->q, req, nr_bytes); |
2e60e0229
|
2301 2302 |
if (!req->bio) return false; |
1da177e4c
|
2303 |
/* |
6f41469c6
|
2304 2305 2306 2307 2308 2309 |
* For fs requests, rq is just carrier of independent bio's * and each partial completion should be handled separately. * Reset per-request error on each partial completion. * * TODO: tj: This is too subtle. It would be better to let * low level drivers do what they see fit. |
1da177e4c
|
2310 |
*/ |
33659ebba
|
2311 |
if (req->cmd_type == REQ_TYPE_FS) |
1da177e4c
|
2312 |
req->errors = 0; |
33659ebba
|
2313 2314 |
if (error && req->cmd_type == REQ_TYPE_FS && !(req->cmd_flags & REQ_QUIET)) { |
79775567e
|
2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 |
char *error_type; switch (error) { case -ENOLINK: error_type = "recoverable transport"; break; case -EREMOTEIO: error_type = "critical target"; break; case -EBADE: error_type = "critical nexus"; break; |
d1ffc1f86
|
2327 2328 2329 |
case -ETIMEDOUT: error_type = "timeout"; break; |
a9d6ceb83
|
2330 2331 2332 |
case -ENOSPC: error_type = "critical space allocation"; break; |
7e782af57
|
2333 2334 2335 |
case -ENODATA: error_type = "critical medium"; break; |
79775567e
|
2336 2337 2338 2339 2340 |
case -EIO: default: error_type = "I/O"; break; } |
ef3ecb66b
|
2341 2342 2343 |
printk_ratelimited(KERN_ERR "%s: %s error, dev %s, sector %llu ", __func__, error_type, req->rq_disk ? |
37d7b34f0
|
2344 2345 |
req->rq_disk->disk_name : "?", (unsigned long long)blk_rq_pos(req)); |
1da177e4c
|
2346 |
} |
bc58ba946
|
2347 |
blk_account_io_completion(req, nr_bytes); |
d72d904a5
|
2348 |
|
f79ea4161
|
2349 2350 2351 |
total_bytes = 0; while (req->bio) { struct bio *bio = req->bio; |
4f024f379
|
2352 |
unsigned bio_bytes = min(bio->bi_iter.bi_size, nr_bytes); |
1da177e4c
|
2353 |
|
4f024f379
|
2354 |
if (bio_bytes == bio->bi_iter.bi_size) |
1da177e4c
|
2355 |
req->bio = bio->bi_next; |
1da177e4c
|
2356 |
|
f79ea4161
|
2357 |
req_bio_endio(req, bio, bio_bytes, error); |
1da177e4c
|
2358 |
|
f79ea4161
|
2359 2360 |
total_bytes += bio_bytes; nr_bytes -= bio_bytes; |
1da177e4c
|
2361 |
|
f79ea4161
|
2362 2363 |
if (!nr_bytes) break; |
1da177e4c
|
2364 2365 2366 2367 2368 |
} /* * completely done */ |
2e60e0229
|
2369 2370 2371 2372 2373 2374 |
if (!req->bio) { /* * Reset counters so that the request stacking driver * can find how many bytes remain in the request * later. */ |
a2dec7b36
|
2375 |
req->__data_len = 0; |
2e60e0229
|
2376 2377 |
return false; } |
1da177e4c
|
2378 |
|
a2dec7b36
|
2379 |
req->__data_len -= total_bytes; |
2e46e8b27
|
2380 2381 |
/* update sector only for requests with clear definition of sector */ |
e2a60da74
|
2382 |
if (req->cmd_type == REQ_TYPE_FS) |
a2dec7b36
|
2383 |
req->__sector += total_bytes >> 9; |
2e46e8b27
|
2384 |
|
80a761fd3
|
2385 2386 2387 2388 2389 |
/* mixed attributes always follow the first bio */ if (req->cmd_flags & REQ_MIXED_MERGE) { req->cmd_flags &= ~REQ_FAILFAST_MASK; req->cmd_flags |= req->bio->bi_rw & REQ_FAILFAST_MASK; } |
2e46e8b27
|
2390 2391 2392 2393 2394 |
/* * If total number of sectors is less than the first segment * size, something has gone terribly wrong. */ if (blk_rq_bytes(req) < blk_rq_cur_bytes(req)) { |
8182924bc
|
2395 |
blk_dump_rq_flags(req, "request botched"); |
a2dec7b36
|
2396 |
req->__data_len = blk_rq_cur_bytes(req); |
2e46e8b27
|
2397 2398 2399 |
} /* recalculate the number of segments */ |
1da177e4c
|
2400 |
blk_recalc_rq_segments(req); |
2e46e8b27
|
2401 |
|
2e60e0229
|
2402 |
return true; |
1da177e4c
|
2403 |
} |
2e60e0229
|
2404 |
EXPORT_SYMBOL_GPL(blk_update_request); |
1da177e4c
|
2405 |
|
2e60e0229
|
2406 2407 2408 |
static bool blk_update_bidi_request(struct request *rq, int error, unsigned int nr_bytes, unsigned int bidi_bytes) |
5efccd17c
|
2409 |
{ |
2e60e0229
|
2410 2411 |
if (blk_update_request(rq, error, nr_bytes)) return true; |
5efccd17c
|
2412 |
|
2e60e0229
|
2413 2414 2415 2416 |
/* Bidi request must be completed as a whole */ if (unlikely(blk_bidi_rq(rq)) && blk_update_request(rq->next_rq, error, bidi_bytes)) return true; |
5efccd17c
|
2417 |
|
e2e1a148b
|
2418 2419 |
if (blk_queue_add_random(rq->q)) add_disk_randomness(rq->rq_disk); |
2e60e0229
|
2420 2421 |
return false; |
1da177e4c
|
2422 |
} |
28018c242
|
2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 |
/** * blk_unprep_request - unprepare a request * @req: the request * * This function makes a request ready for complete resubmission (or * completion). It happens only after all error handling is complete, * so represents the appropriate moment to deallocate any resources * that were allocated to the request in the prep_rq_fn. The queue * lock is held when calling this. */ void blk_unprep_request(struct request *req) { struct request_queue *q = req->q; req->cmd_flags &= ~REQ_DONTPREP; if (q->unprep_rq_fn) q->unprep_rq_fn(q, req); } EXPORT_SYMBOL_GPL(blk_unprep_request); |
1da177e4c
|
2442 2443 2444 |
/* * queue lock must be held */ |
12120077b
|
2445 |
void blk_finish_request(struct request *req, int error) |
1da177e4c
|
2446 |
{ |
125c99bc8
|
2447 |
if (req->cmd_flags & REQ_QUEUED) |
b8286239d
|
2448 |
blk_queue_end_tag(req->q, req); |
ba396a6c1
|
2449 |
BUG_ON(blk_queued_rq(req)); |
1da177e4c
|
2450 |
|
33659ebba
|
2451 |
if (unlikely(laptop_mode) && req->cmd_type == REQ_TYPE_FS) |
31373d09d
|
2452 |
laptop_io_completion(&req->q->backing_dev_info); |
1da177e4c
|
2453 |
|
e78042e5b
|
2454 |
blk_delete_timer(req); |
28018c242
|
2455 2456 |
if (req->cmd_flags & REQ_DONTPREP) blk_unprep_request(req); |
bc58ba946
|
2457 |
blk_account_io_done(req); |
b8286239d
|
2458 |
|
1da177e4c
|
2459 |
if (req->end_io) |
8ffdc6550
|
2460 |
req->end_io(req, error); |
b8286239d
|
2461 2462 2463 |
else { if (blk_bidi_rq(req)) __blk_put_request(req->next_rq->q, req->next_rq); |
1da177e4c
|
2464 |
__blk_put_request(req->q, req); |
b8286239d
|
2465 |
} |
1da177e4c
|
2466 |
} |
12120077b
|
2467 |
EXPORT_SYMBOL(blk_finish_request); |
1da177e4c
|
2468 |
|
3b11313a6
|
2469 |
/** |
2e60e0229
|
2470 2471 2472 2473 2474 |
* blk_end_bidi_request - Complete a bidi request * @rq: the request to complete * @error: %0 for success, < %0 for error * @nr_bytes: number of bytes to complete @rq * @bidi_bytes: number of bytes to complete @rq->next_rq |
a0cd12854
|
2475 2476 |
* * Description: |
e3a04fe34
|
2477 |
* Ends I/O on a number of bytes attached to @rq and @rq->next_rq. |
2e60e0229
|
2478 2479 2480 |
* Drivers that supports bidi can safely call this member for any * type of request, bidi or uni. In the later case @bidi_bytes is * just ignored. |
336cdb400
|
2481 2482 |
* * Return: |
2e60e0229
|
2483 2484 |
* %false - we are done with this request * %true - still buffers pending for this request |
a0cd12854
|
2485 |
**/ |
b1f744937
|
2486 |
static bool blk_end_bidi_request(struct request *rq, int error, |
32fab448e
|
2487 2488 |
unsigned int nr_bytes, unsigned int bidi_bytes) { |
336cdb400
|
2489 |
struct request_queue *q = rq->q; |
2e60e0229
|
2490 |
unsigned long flags; |
32fab448e
|
2491 |
|
2e60e0229
|
2492 2493 |
if (blk_update_bidi_request(rq, error, nr_bytes, bidi_bytes)) return true; |
32fab448e
|
2494 |
|
336cdb400
|
2495 |
spin_lock_irqsave(q->queue_lock, flags); |
2e60e0229
|
2496 |
blk_finish_request(rq, error); |
336cdb400
|
2497 |
spin_unlock_irqrestore(q->queue_lock, flags); |
2e60e0229
|
2498 |
return false; |
32fab448e
|
2499 |
} |
336cdb400
|
2500 |
/** |
2e60e0229
|
2501 2502 |
* __blk_end_bidi_request - Complete a bidi request with queue lock held * @rq: the request to complete |
710027a48
|
2503 |
* @error: %0 for success, < %0 for error |
e3a04fe34
|
2504 2505 |
* @nr_bytes: number of bytes to complete @rq * @bidi_bytes: number of bytes to complete @rq->next_rq |
336cdb400
|
2506 2507 |
* * Description: |
2e60e0229
|
2508 2509 |
* Identical to blk_end_bidi_request() except that queue lock is * assumed to be locked on entry and remains so on return. |
336cdb400
|
2510 2511 |
* * Return: |
2e60e0229
|
2512 2513 |
* %false - we are done with this request * %true - still buffers pending for this request |
336cdb400
|
2514 |
**/ |
4853abaae
|
2515 |
bool __blk_end_bidi_request(struct request *rq, int error, |
b1f744937
|
2516 |
unsigned int nr_bytes, unsigned int bidi_bytes) |
336cdb400
|
2517 |
{ |
2e60e0229
|
2518 2519 |
if (blk_update_bidi_request(rq, error, nr_bytes, bidi_bytes)) return true; |
336cdb400
|
2520 |
|
2e60e0229
|
2521 |
blk_finish_request(rq, error); |
336cdb400
|
2522 |
|
2e60e0229
|
2523 |
return false; |
336cdb400
|
2524 |
} |
e19a3ab05
|
2525 2526 2527 2528 |
/** * blk_end_request - Helper function for drivers to complete the request. * @rq: the request being processed |
710027a48
|
2529 |
* @error: %0 for success, < %0 for error |
e19a3ab05
|
2530 2531 2532 2533 2534 2535 2536 |
* @nr_bytes: number of bytes to complete * * Description: * Ends I/O on a number of bytes attached to @rq. * If @rq has leftover, sets it up for the next range of segments. * * Return: |
b1f744937
|
2537 2538 |
* %false - we are done with this request * %true - still buffers pending for this request |
e19a3ab05
|
2539 |
**/ |
b1f744937
|
2540 |
bool blk_end_request(struct request *rq, int error, unsigned int nr_bytes) |
e19a3ab05
|
2541 |
{ |
b1f744937
|
2542 |
return blk_end_bidi_request(rq, error, nr_bytes, 0); |
e19a3ab05
|
2543 |
} |
56ad1740d
|
2544 |
EXPORT_SYMBOL(blk_end_request); |
336cdb400
|
2545 2546 |
/** |
b1f744937
|
2547 2548 |
* blk_end_request_all - Helper function for drives to finish the request. * @rq: the request to finish |
8ebf97560
|
2549 |
* @error: %0 for success, < %0 for error |
336cdb400
|
2550 2551 |
* * Description: |
b1f744937
|
2552 2553 2554 |
* Completely finish @rq. */ void blk_end_request_all(struct request *rq, int error) |
336cdb400
|
2555 |
{ |
b1f744937
|
2556 2557 |
bool pending; unsigned int bidi_bytes = 0; |
336cdb400
|
2558 |
|
b1f744937
|
2559 2560 |
if (unlikely(blk_bidi_rq(rq))) bidi_bytes = blk_rq_bytes(rq->next_rq); |
336cdb400
|
2561 |
|
b1f744937
|
2562 2563 2564 |
pending = blk_end_bidi_request(rq, error, blk_rq_bytes(rq), bidi_bytes); BUG_ON(pending); } |
56ad1740d
|
2565 |
EXPORT_SYMBOL(blk_end_request_all); |
336cdb400
|
2566 |
|
b1f744937
|
2567 2568 2569 |
/** * blk_end_request_cur - Helper function to finish the current request chunk. * @rq: the request to finish the current chunk for |
8ebf97560
|
2570 |
* @error: %0 for success, < %0 for error |
b1f744937
|
2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 |
* * Description: * Complete the current consecutively mapped chunk from @rq. * * Return: * %false - we are done with this request * %true - still buffers pending for this request */ bool blk_end_request_cur(struct request *rq, int error) { return blk_end_request(rq, error, blk_rq_cur_bytes(rq)); |
336cdb400
|
2582 |
} |
56ad1740d
|
2583 |
EXPORT_SYMBOL(blk_end_request_cur); |
336cdb400
|
2584 |
|
e19a3ab05
|
2585 |
/** |
80a761fd3
|
2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 |
* blk_end_request_err - Finish a request till the next failure boundary. * @rq: the request to finish till the next failure boundary for * @error: must be negative errno * * Description: * Complete @rq till the next failure boundary. * * Return: * %false - we are done with this request * %true - still buffers pending for this request */ bool blk_end_request_err(struct request *rq, int error) { WARN_ON(error >= 0); return blk_end_request(rq, error, blk_rq_err_bytes(rq)); } EXPORT_SYMBOL_GPL(blk_end_request_err); /** |
b1f744937
|
2605 2606 2607 2608 |
* __blk_end_request - Helper function for drivers to complete the request. * @rq: the request being processed * @error: %0 for success, < %0 for error * @nr_bytes: number of bytes to complete |
e3a04fe34
|
2609 2610 |
* * Description: |
b1f744937
|
2611 |
* Must be called with queue lock held unlike blk_end_request(). |
e3a04fe34
|
2612 2613 |
* * Return: |
b1f744937
|
2614 2615 |
* %false - we are done with this request * %true - still buffers pending for this request |
e3a04fe34
|
2616 |
**/ |
b1f744937
|
2617 |
bool __blk_end_request(struct request *rq, int error, unsigned int nr_bytes) |
e3a04fe34
|
2618 |
{ |
b1f744937
|
2619 |
return __blk_end_bidi_request(rq, error, nr_bytes, 0); |
e3a04fe34
|
2620 |
} |
56ad1740d
|
2621 |
EXPORT_SYMBOL(__blk_end_request); |
e3a04fe34
|
2622 2623 |
/** |
b1f744937
|
2624 2625 |
* __blk_end_request_all - Helper function for drives to finish the request. * @rq: the request to finish |
8ebf97560
|
2626 |
* @error: %0 for success, < %0 for error |
32fab448e
|
2627 2628 |
* * Description: |
b1f744937
|
2629 |
* Completely finish @rq. Must be called with queue lock held. |
32fab448e
|
2630 |
*/ |
b1f744937
|
2631 |
void __blk_end_request_all(struct request *rq, int error) |
32fab448e
|
2632 |
{ |
b1f744937
|
2633 2634 2635 2636 2637 2638 2639 2640 |
bool pending; unsigned int bidi_bytes = 0; if (unlikely(blk_bidi_rq(rq))) bidi_bytes = blk_rq_bytes(rq->next_rq); pending = __blk_end_bidi_request(rq, error, blk_rq_bytes(rq), bidi_bytes); BUG_ON(pending); |
32fab448e
|
2641 |
} |
56ad1740d
|
2642 |
EXPORT_SYMBOL(__blk_end_request_all); |
32fab448e
|
2643 2644 |
/** |
b1f744937
|
2645 2646 |
* __blk_end_request_cur - Helper function to finish the current request chunk. * @rq: the request to finish the current chunk for |
8ebf97560
|
2647 |
* @error: %0 for success, < %0 for error |
e19a3ab05
|
2648 2649 |
* * Description: |
b1f744937
|
2650 2651 |
* Complete the current consecutively mapped chunk from @rq. Must * be called with queue lock held. |
e19a3ab05
|
2652 2653 |
* * Return: |
b1f744937
|
2654 2655 2656 2657 |
* %false - we are done with this request * %true - still buffers pending for this request */ bool __blk_end_request_cur(struct request *rq, int error) |
e19a3ab05
|
2658 |
{ |
b1f744937
|
2659 |
return __blk_end_request(rq, error, blk_rq_cur_bytes(rq)); |
e19a3ab05
|
2660 |
} |
56ad1740d
|
2661 |
EXPORT_SYMBOL(__blk_end_request_cur); |
e19a3ab05
|
2662 |
|
80a761fd3
|
2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 |
/** * __blk_end_request_err - Finish a request till the next failure boundary. * @rq: the request to finish till the next failure boundary for * @error: must be negative errno * * Description: * Complete @rq till the next failure boundary. Must be called * with queue lock held. * * Return: * %false - we are done with this request * %true - still buffers pending for this request */ bool __blk_end_request_err(struct request *rq, int error) { WARN_ON(error >= 0); return __blk_end_request(rq, error, blk_rq_err_bytes(rq)); } EXPORT_SYMBOL_GPL(__blk_end_request_err); |
86db1e297
|
2682 2683 |
void blk_rq_bio_prep(struct request_queue *q, struct request *rq, struct bio *bio) |
1da177e4c
|
2684 |
{ |
a82afdfcb
|
2685 |
/* Bit 0 (R/W) is identical in rq->cmd_flags and bio->bi_rw */ |
7b6d91dae
|
2686 |
rq->cmd_flags |= bio->bi_rw & REQ_WRITE; |
1da177e4c
|
2687 |
|
b4f42e283
|
2688 |
if (bio_has_data(bio)) |
fb2dce862
|
2689 |
rq->nr_phys_segments = bio_phys_segments(q, bio); |
b4f42e283
|
2690 |
|
4f024f379
|
2691 |
rq->__data_len = bio->bi_iter.bi_size; |
1da177e4c
|
2692 |
rq->bio = rq->biotail = bio; |
1da177e4c
|
2693 |
|
66846572b
|
2694 2695 2696 |
if (bio->bi_bdev) rq->rq_disk = bio->bi_bdev->bd_disk; } |
1da177e4c
|
2697 |
|
2d4dc890b
|
2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 |
#if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE /** * rq_flush_dcache_pages - Helper function to flush all pages in a request * @rq: the request to be flushed * * Description: * Flush all pages in @rq. */ void rq_flush_dcache_pages(struct request *rq) { struct req_iterator iter; |
7988613b0
|
2709 |
struct bio_vec bvec; |
2d4dc890b
|
2710 2711 |
rq_for_each_segment(bvec, rq, iter) |
7988613b0
|
2712 |
flush_dcache_page(bvec.bv_page); |
2d4dc890b
|
2713 2714 2715 |
} EXPORT_SYMBOL_GPL(rq_flush_dcache_pages); #endif |
ef9e3facd
|
2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 |
/** * blk_lld_busy - Check if underlying low-level drivers of a device are busy * @q : the queue of the device being checked * * Description: * Check if underlying low-level drivers of a device are busy. * If the drivers want to export their busy state, they must set own * exporting function using blk_queue_lld_busy() first. * * Basically, this function is used only by request stacking drivers * to stop dispatching requests to underlying devices when underlying * devices are busy. This behavior helps more I/O merging on the queue * of the request stacking driver and prevents I/O throughput regression * on burst I/O load. * * Return: * 0 - Not busy (The request stacking driver should dispatch request) * 1 - Busy (The request stacking driver should stop dispatching request) */ int blk_lld_busy(struct request_queue *q) { if (q->lld_busy_fn) return q->lld_busy_fn(q); return 0; } EXPORT_SYMBOL_GPL(blk_lld_busy); |
b0fd271d5
|
2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 |
/** * blk_rq_unprep_clone - Helper function to free all bios in a cloned request * @rq: the clone request to be cleaned up * * Description: * Free all bios in @rq for a cloned request. */ void blk_rq_unprep_clone(struct request *rq) { struct bio *bio; while ((bio = rq->bio) != NULL) { rq->bio = bio->bi_next; bio_put(bio); } } EXPORT_SYMBOL_GPL(blk_rq_unprep_clone); /* * Copy attributes of the original request to the clone request. |
b4f42e283
|
2764 |
* The actual data parts (e.g. ->cmd, ->sense) are not copied. |
b0fd271d5
|
2765 2766 2767 2768 |
*/ static void __blk_rq_prep_clone(struct request *dst, struct request *src) { dst->cpu = src->cpu; |
3a2edd0d6
|
2769 |
dst->cmd_flags = (src->cmd_flags & REQ_CLONE_MASK) | REQ_NOMERGE; |
b0fd271d5
|
2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 |
dst->cmd_type = src->cmd_type; dst->__sector = blk_rq_pos(src); dst->__data_len = blk_rq_bytes(src); dst->nr_phys_segments = src->nr_phys_segments; dst->ioprio = src->ioprio; dst->extra_len = src->extra_len; } /** * blk_rq_prep_clone - Helper function to setup clone request * @rq: the request to be setup * @rq_src: original request to be cloned * @bs: bio_set that bios for clone are allocated from * @gfp_mask: memory allocation mask for bio * @bio_ctr: setup function to be called for each clone bio. * Returns %0 for success, non %0 for failure. * @data: private data to be passed to @bio_ctr * * Description: * Clones bios in @rq_src to @rq, and copies attributes of @rq_src to @rq. |
b4f42e283
|
2790 |
* The actual data parts of @rq_src (e.g. ->cmd, ->sense) |
b0fd271d5
|
2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 |
* are not copied, and copying such parts is the caller's responsibility. * Also, pages which the original bios are pointing to are not copied * and the cloned bios just point same pages. * So cloned bios must be completed before original bios, which means * the caller must complete @rq before @rq_src. */ int blk_rq_prep_clone(struct request *rq, struct request *rq_src, struct bio_set *bs, gfp_t gfp_mask, int (*bio_ctr)(struct bio *, struct bio *, void *), void *data) { struct bio *bio, *bio_src; if (!bs) bs = fs_bio_set; blk_rq_init(NULL, rq); __rq_for_each_bio(bio_src, rq_src) { |
11dfce509
|
2810 |
bio = bio_clone_fast(bio_src, gfp_mask, bs); |
b0fd271d5
|
2811 2812 |
if (!bio) goto free_and_out; |
b0fd271d5
|
2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 |
if (bio_ctr && bio_ctr(bio, bio_src, data)) goto free_and_out; if (rq->bio) { rq->biotail->bi_next = bio; rq->biotail = bio; } else rq->bio = rq->biotail = bio; } __blk_rq_prep_clone(rq, rq_src); return 0; free_and_out: if (bio) |
4254bba17
|
2829 |
bio_put(bio); |
b0fd271d5
|
2830 2831 2832 2833 2834 |
blk_rq_unprep_clone(rq); return -ENOMEM; } EXPORT_SYMBOL_GPL(blk_rq_prep_clone); |
59c3d45e4
|
2835 |
int kblockd_schedule_work(struct work_struct *work) |
1da177e4c
|
2836 2837 2838 |
{ return queue_work(kblockd_workqueue, work); } |
1da177e4c
|
2839 |
EXPORT_SYMBOL(kblockd_schedule_work); |
59c3d45e4
|
2840 2841 |
int kblockd_schedule_delayed_work(struct delayed_work *dwork, unsigned long delay) |
e43473b7f
|
2842 2843 2844 2845 |
{ return queue_delayed_work(kblockd_workqueue, dwork, delay); } EXPORT_SYMBOL(kblockd_schedule_delayed_work); |
8ab14595b
|
2846 2847 2848 2849 2850 2851 |
int kblockd_schedule_delayed_work_on(int cpu, struct delayed_work *dwork, unsigned long delay) { return queue_delayed_work_on(cpu, kblockd_workqueue, dwork, delay); } EXPORT_SYMBOL(kblockd_schedule_delayed_work_on); |
75df71362
|
2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 |
/** * blk_start_plug - initialize blk_plug and track it inside the task_struct * @plug: The &struct blk_plug that needs to be initialized * * Description: * Tracking blk_plug inside the task_struct will help with auto-flushing the * pending I/O should the task end up blocking between blk_start_plug() and * blk_finish_plug(). This is important from a performance perspective, but * also ensures that we don't deadlock. For instance, if the task is blocking * for a memory allocation, memory reclaim could end up wanting to free a * page belonging to that request that is currently residing in our private * plug. By flushing the pending I/O when the process goes to sleep, we avoid * this kind of deadlock. */ |
73c101011
|
2866 2867 2868 |
void blk_start_plug(struct blk_plug *plug) { struct task_struct *tsk = current; |
73c101011
|
2869 |
INIT_LIST_HEAD(&plug->list); |
320ae51fe
|
2870 |
INIT_LIST_HEAD(&plug->mq_list); |
048c9374a
|
2871 |
INIT_LIST_HEAD(&plug->cb_list); |
73c101011
|
2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 |
/* * If this is a nested plug, don't actually assign it. It will be * flushed on its own. */ if (!tsk->plug) { /* * Store ordering should not be needed here, since a potential * preempt will imply a full memory barrier */ tsk->plug = plug; } } EXPORT_SYMBOL(blk_start_plug); static int plug_rq_cmp(void *priv, struct list_head *a, struct list_head *b) { struct request *rqa = container_of(a, struct request, queuelist); struct request *rqb = container_of(b, struct request, queuelist); |
975927b94
|
2891 2892 |
return !(rqa->q < rqb->q || (rqa->q == rqb->q && blk_rq_pos(rqa) < blk_rq_pos(rqb))); |
73c101011
|
2893 |
} |
49cac01e1
|
2894 2895 2896 2897 2898 2899 |
/* * If 'from_schedule' is true, then postpone the dispatch of requests * until a safe kblockd context. We due this to avoid accidental big * additional stack usage in driver dispatch, in places where the originally * plugger did not intend it. */ |
f6603783f
|
2900 |
static void queue_unplugged(struct request_queue *q, unsigned int depth, |
49cac01e1
|
2901 |
bool from_schedule) |
99e22598e
|
2902 |
__releases(q->queue_lock) |
94b5eb28b
|
2903 |
{ |
49cac01e1
|
2904 |
trace_block_unplug(q, depth, !from_schedule); |
99e22598e
|
2905 |
|
704605711
|
2906 |
if (from_schedule) |
24ecfbe27
|
2907 |
blk_run_queue_async(q); |
704605711
|
2908 |
else |
24ecfbe27
|
2909 |
__blk_run_queue(q); |
704605711
|
2910 |
spin_unlock(q->queue_lock); |
94b5eb28b
|
2911 |
} |
74018dc30
|
2912 |
static void flush_plug_callbacks(struct blk_plug *plug, bool from_schedule) |
048c9374a
|
2913 2914 |
{ LIST_HEAD(callbacks); |
2a7d5559b
|
2915 2916 |
while (!list_empty(&plug->cb_list)) { list_splice_init(&plug->cb_list, &callbacks); |
048c9374a
|
2917 |
|
2a7d5559b
|
2918 2919 |
while (!list_empty(&callbacks)) { struct blk_plug_cb *cb = list_first_entry(&callbacks, |
048c9374a
|
2920 2921 |
struct blk_plug_cb, list); |
2a7d5559b
|
2922 |
list_del(&cb->list); |
74018dc30
|
2923 |
cb->callback(cb, from_schedule); |
2a7d5559b
|
2924 |
} |
048c9374a
|
2925 2926 |
} } |
9cbb17508
|
2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 |
struct blk_plug_cb *blk_check_plugged(blk_plug_cb_fn unplug, void *data, int size) { struct blk_plug *plug = current->plug; struct blk_plug_cb *cb; if (!plug) return NULL; list_for_each_entry(cb, &plug->cb_list, list) if (cb->callback == unplug && cb->data == data) return cb; /* Not currently on the callback list */ BUG_ON(size < sizeof(*cb)); cb = kzalloc(size, GFP_ATOMIC); if (cb) { cb->data = data; cb->callback = unplug; list_add(&cb->list, &plug->cb_list); } return cb; } EXPORT_SYMBOL(blk_check_plugged); |
49cac01e1
|
2951 |
void blk_flush_plug_list(struct blk_plug *plug, bool from_schedule) |
73c101011
|
2952 2953 2954 2955 |
{ struct request_queue *q; unsigned long flags; struct request *rq; |
109b81296
|
2956 |
LIST_HEAD(list); |
94b5eb28b
|
2957 |
unsigned int depth; |
73c101011
|
2958 |
|
74018dc30
|
2959 |
flush_plug_callbacks(plug, from_schedule); |
320ae51fe
|
2960 2961 2962 |
if (!list_empty(&plug->mq_list)) blk_mq_flush_plug_list(plug, from_schedule); |
73c101011
|
2963 2964 |
if (list_empty(&plug->list)) return; |
109b81296
|
2965 |
list_splice_init(&plug->list, &list); |
422765c26
|
2966 |
list_sort(NULL, &list, plug_rq_cmp); |
73c101011
|
2967 2968 |
q = NULL; |
94b5eb28b
|
2969 |
depth = 0; |
188112722
|
2970 2971 2972 2973 2974 |
/* * Save and disable interrupts here, to avoid doing it for every * queue lock we have to take. */ |
73c101011
|
2975 |
local_irq_save(flags); |
109b81296
|
2976 2977 |
while (!list_empty(&list)) { rq = list_entry_rq(list.next); |
73c101011
|
2978 |
list_del_init(&rq->queuelist); |
73c101011
|
2979 2980 |
BUG_ON(!rq->q); if (rq->q != q) { |
99e22598e
|
2981 2982 2983 2984 |
/* * This drops the queue lock */ if (q) |
49cac01e1
|
2985 |
queue_unplugged(q, depth, from_schedule); |
73c101011
|
2986 |
q = rq->q; |
94b5eb28b
|
2987 |
depth = 0; |
73c101011
|
2988 2989 |
spin_lock(q->queue_lock); } |
8ba61435d
|
2990 2991 2992 2993 |
/* * Short-circuit if @q is dead */ |
3f3299d5c
|
2994 |
if (unlikely(blk_queue_dying(q))) { |
8ba61435d
|
2995 2996 2997 |
__blk_end_request_all(rq, -ENODEV); continue; } |
73c101011
|
2998 2999 3000 |
/* * rq is already accounted, so use raw insert */ |
401a18e92
|
3001 3002 3003 3004 |
if (rq->cmd_flags & (REQ_FLUSH | REQ_FUA)) __elv_add_request(q, rq, ELEVATOR_INSERT_FLUSH); else __elv_add_request(q, rq, ELEVATOR_INSERT_SORT_MERGE); |
94b5eb28b
|
3005 3006 |
depth++; |
73c101011
|
3007 |
} |
99e22598e
|
3008 3009 3010 3011 |
/* * This drops the queue lock */ if (q) |
49cac01e1
|
3012 |
queue_unplugged(q, depth, from_schedule); |
73c101011
|
3013 |
|
73c101011
|
3014 3015 |
local_irq_restore(flags); } |
73c101011
|
3016 3017 3018 |
void blk_finish_plug(struct blk_plug *plug) { |
f6603783f
|
3019 |
blk_flush_plug_list(plug, false); |
73c101011
|
3020 |
|
88b996cd0
|
3021 3022 |
if (plug == current->plug) current->plug = NULL; |
73c101011
|
3023 |
} |
88b996cd0
|
3024 |
EXPORT_SYMBOL(blk_finish_plug); |
73c101011
|
3025 |
|
47fafbc70
|
3026 |
#ifdef CONFIG_PM |
6c9546675
|
3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 |
/** * blk_pm_runtime_init - Block layer runtime PM initialization routine * @q: the queue of the device * @dev: the device the queue belongs to * * Description: * Initialize runtime-PM-related fields for @q and start auto suspend for * @dev. Drivers that want to take advantage of request-based runtime PM * should call this function after @dev has been initialized, and its * request queue @q has been allocated, and runtime PM for it can not happen * yet(either due to disabled/forbidden or its usage_count > 0). In most * cases, driver should call this function before any I/O has taken place. * * This function takes care of setting up using auto suspend for the device, * the autosuspend delay is set to -1 to make runtime suspend impossible * until an updated value is either set by user or by driver. Drivers do * not need to touch other autosuspend settings. * * The block layer runtime PM is request based, so only works for drivers * that use request as their IO unit instead of those directly use bio's. */ void blk_pm_runtime_init(struct request_queue *q, struct device *dev) { q->dev = dev; q->rpm_status = RPM_ACTIVE; pm_runtime_set_autosuspend_delay(q->dev, -1); pm_runtime_use_autosuspend(q->dev); } EXPORT_SYMBOL(blk_pm_runtime_init); /** * blk_pre_runtime_suspend - Pre runtime suspend check * @q: the queue of the device * * Description: * This function will check if runtime suspend is allowed for the device * by examining if there are any requests pending in the queue. If there * are requests pending, the device can not be runtime suspended; otherwise, * the queue's status will be updated to SUSPENDING and the driver can * proceed to suspend the device. * * For the not allowed case, we mark last busy for the device so that * runtime PM core will try to autosuspend it some time later. * * This function should be called near the start of the device's * runtime_suspend callback. * * Return: * 0 - OK to runtime suspend the device * -EBUSY - Device should not be runtime suspended */ int blk_pre_runtime_suspend(struct request_queue *q) { int ret = 0; spin_lock_irq(q->queue_lock); if (q->nr_pending) { ret = -EBUSY; pm_runtime_mark_last_busy(q->dev); } else { q->rpm_status = RPM_SUSPENDING; } spin_unlock_irq(q->queue_lock); return ret; } EXPORT_SYMBOL(blk_pre_runtime_suspend); /** * blk_post_runtime_suspend - Post runtime suspend processing * @q: the queue of the device * @err: return value of the device's runtime_suspend function * * Description: * Update the queue's runtime status according to the return value of the * device's runtime suspend function and mark last busy for the device so * that PM core will try to auto suspend the device at a later time. * * This function should be called near the end of the device's * runtime_suspend callback. */ void blk_post_runtime_suspend(struct request_queue *q, int err) { spin_lock_irq(q->queue_lock); if (!err) { q->rpm_status = RPM_SUSPENDED; } else { q->rpm_status = RPM_ACTIVE; pm_runtime_mark_last_busy(q->dev); } spin_unlock_irq(q->queue_lock); } EXPORT_SYMBOL(blk_post_runtime_suspend); /** * blk_pre_runtime_resume - Pre runtime resume processing * @q: the queue of the device * * Description: * Update the queue's runtime status to RESUMING in preparation for the * runtime resume of the device. * * This function should be called near the start of the device's * runtime_resume callback. */ void blk_pre_runtime_resume(struct request_queue *q) { spin_lock_irq(q->queue_lock); q->rpm_status = RPM_RESUMING; spin_unlock_irq(q->queue_lock); } EXPORT_SYMBOL(blk_pre_runtime_resume); /** * blk_post_runtime_resume - Post runtime resume processing * @q: the queue of the device * @err: return value of the device's runtime_resume function * * Description: * Update the queue's runtime status according to the return value of the * device's runtime_resume function. If it is successfully resumed, process * the requests that are queued into the device's queue when it is resuming * and then mark last busy and initiate autosuspend for it. * * This function should be called near the end of the device's * runtime_resume callback. */ void blk_post_runtime_resume(struct request_queue *q, int err) { spin_lock_irq(q->queue_lock); if (!err) { q->rpm_status = RPM_ACTIVE; __blk_run_queue(q); pm_runtime_mark_last_busy(q->dev); |
c60855cdb
|
3160 |
pm_request_autosuspend(q->dev); |
6c9546675
|
3161 3162 3163 3164 3165 3166 3167 |
} else { q->rpm_status = RPM_SUSPENDED; } spin_unlock_irq(q->queue_lock); } EXPORT_SYMBOL(blk_post_runtime_resume); #endif |
1da177e4c
|
3168 3169 |
int __init blk_dev_init(void) { |
9eb55b030
|
3170 3171 |
BUILD_BUG_ON(__REQ_NR_BITS > 8 * sizeof(((struct request *)0)->cmd_flags)); |
89b90be2d
|
3172 3173 |
/* used for unplugging and affects IO latency/throughput - HIGHPRI */ kblockd_workqueue = alloc_workqueue("kblockd", |
28747fcd2
|
3174 |
WQ_MEM_RECLAIM | WQ_HIGHPRI, 0); |
1da177e4c
|
3175 3176 3177 3178 3179 |
if (!kblockd_workqueue) panic("Failed to create kblockd "); request_cachep = kmem_cache_create("blkdev_requests", |
20c2df83d
|
3180 |
sizeof(struct request), 0, SLAB_PANIC, NULL); |
1da177e4c
|
3181 |
|
8324aa91d
|
3182 |
blk_requestq_cachep = kmem_cache_create("blkdev_queue", |
165125e1e
|
3183 |
sizeof(struct request_queue), 0, SLAB_PANIC, NULL); |
1da177e4c
|
3184 |
|
d38ecf935
|
3185 |
return 0; |
1da177e4c
|
3186 |
} |