]>
Commit | Line | Data |
---|---|---|
3dcf60bc | 1 | // SPDX-License-Identifier: GPL-2.0 |
1da177e4 | 2 | /* |
1da177e4 LT |
3 | * Copyright (C) 1991, 1992 Linus Torvalds |
4 | * Copyright (C) 1994, Karl Keyte: Added support for disk statistics | |
5 | * Elevator latency, (C) 2000 Andrea Arcangeli <andrea@suse.de> SuSE | |
6 | * Queue request tables / lock, selectable elevator, Jens Axboe <axboe@suse.de> | |
6728cb0e JA |
7 | * kernel-doc documentation started by NeilBrown <neilb@cse.unsw.edu.au> |
8 | * - July2000 | |
1da177e4 LT |
9 | * bio rewrite, highmem i/o, etc, Jens Axboe <axboe@suse.de> - may 2001 |
10 | */ | |
11 | ||
12 | /* | |
13 | * This handles all read/write requests to block devices | |
14 | */ | |
1da177e4 LT |
15 | #include <linux/kernel.h> |
16 | #include <linux/module.h> | |
17 | #include <linux/backing-dev.h> | |
18 | #include <linux/bio.h> | |
19 | #include <linux/blkdev.h> | |
320ae51f | 20 | #include <linux/blk-mq.h> |
1da177e4 LT |
21 | #include <linux/highmem.h> |
22 | #include <linux/mm.h> | |
cee9a0c4 | 23 | #include <linux/pagemap.h> |
1da177e4 LT |
24 | #include <linux/kernel_stat.h> |
25 | #include <linux/string.h> | |
26 | #include <linux/init.h> | |
1da177e4 LT |
27 | #include <linux/completion.h> |
28 | #include <linux/slab.h> | |
29 | #include <linux/swap.h> | |
30 | #include <linux/writeback.h> | |
faccbd4b | 31 | #include <linux/task_io_accounting_ops.h> |
c17bb495 | 32 | #include <linux/fault-inject.h> |
73c10101 | 33 | #include <linux/list_sort.h> |
e3c78ca5 | 34 | #include <linux/delay.h> |
aaf7c680 | 35 | #include <linux/ratelimit.h> |
6c954667 | 36 | #include <linux/pm_runtime.h> |
eea8f41c | 37 | #include <linux/blk-cgroup.h> |
54d4e6ab | 38 | #include <linux/t10-pi.h> |
18fbda91 | 39 | #include <linux/debugfs.h> |
30abb3a6 | 40 | #include <linux/bpf.h> |
b8e24a93 | 41 | #include <linux/psi.h> |
71ac860a | 42 | #include <linux/sched/sysctl.h> |
a892c8d5 | 43 | #include <linux/blk-crypto.h> |
55782138 LZ |
44 | |
45 | #define CREATE_TRACE_POINTS | |
46 | #include <trace/events/block.h> | |
1da177e4 | 47 | |
8324aa91 | 48 | #include "blk.h" |
43a5e4e2 | 49 | #include "blk-mq.h" |
bd166ef1 | 50 | #include "blk-mq-sched.h" |
bca6b067 | 51 | #include "blk-pm.h" |
c1c80384 | 52 | #include "blk-rq-qos.h" |
8324aa91 | 53 | |
18fbda91 OS |
54 | #ifdef CONFIG_DEBUG_FS |
55 | struct dentry *blk_debugfs_root; | |
56 | #endif | |
57 | ||
d07335e5 | 58 | EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_remap); |
b0da3f0d | 59 | EXPORT_TRACEPOINT_SYMBOL_GPL(block_rq_remap); |
0a82a8d1 | 60 | EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_complete); |
3291fa57 | 61 | EXPORT_TRACEPOINT_SYMBOL_GPL(block_split); |
cbae8d45 | 62 | EXPORT_TRACEPOINT_SYMBOL_GPL(block_unplug); |
0bfc2455 | 63 | |
a73f730d TH |
64 | DEFINE_IDA(blk_queue_ida); |
65 | ||
1da177e4 LT |
66 | /* |
67 | * For queue allocation | |
68 | */ | |
6728cb0e | 69 | struct kmem_cache *blk_requestq_cachep; |
1da177e4 | 70 | |
1da177e4 LT |
71 | /* |
72 | * Controlling structure to kblockd | |
73 | */ | |
ff856bad | 74 | static struct workqueue_struct *kblockd_workqueue; |
1da177e4 | 75 | |
8814ce8a BVA |
76 | /** |
77 | * blk_queue_flag_set - atomically set a queue flag | |
78 | * @flag: flag to be set | |
79 | * @q: request queue | |
80 | */ | |
81 | void blk_queue_flag_set(unsigned int flag, struct request_queue *q) | |
82 | { | |
57d74df9 | 83 | set_bit(flag, &q->queue_flags); |
8814ce8a BVA |
84 | } |
85 | EXPORT_SYMBOL(blk_queue_flag_set); | |
86 | ||
87 | /** | |
88 | * blk_queue_flag_clear - atomically clear a queue flag | |
89 | * @flag: flag to be cleared | |
90 | * @q: request queue | |
91 | */ | |
92 | void blk_queue_flag_clear(unsigned int flag, struct request_queue *q) | |
93 | { | |
57d74df9 | 94 | clear_bit(flag, &q->queue_flags); |
8814ce8a BVA |
95 | } |
96 | EXPORT_SYMBOL(blk_queue_flag_clear); | |
97 | ||
98 | /** | |
99 | * blk_queue_flag_test_and_set - atomically test and set a queue flag | |
100 | * @flag: flag to be set | |
101 | * @q: request queue | |
102 | * | |
103 | * Returns the previous value of @flag - 0 if the flag was not set and 1 if | |
104 | * the flag was already set. | |
105 | */ | |
106 | bool blk_queue_flag_test_and_set(unsigned int flag, struct request_queue *q) | |
107 | { | |
57d74df9 | 108 | return test_and_set_bit(flag, &q->queue_flags); |
8814ce8a BVA |
109 | } |
110 | EXPORT_SYMBOL_GPL(blk_queue_flag_test_and_set); | |
111 | ||
2a4aa30c | 112 | void blk_rq_init(struct request_queue *q, struct request *rq) |
1da177e4 | 113 | { |
1afb20f3 FT |
114 | memset(rq, 0, sizeof(*rq)); |
115 | ||
1da177e4 | 116 | INIT_LIST_HEAD(&rq->queuelist); |
63a71386 | 117 | rq->q = q; |
a2dec7b3 | 118 | rq->__sector = (sector_t) -1; |
2e662b65 JA |
119 | INIT_HLIST_NODE(&rq->hash); |
120 | RB_CLEAR_NODE(&rq->rb_node); | |
63a71386 | 121 | rq->tag = -1; |
bd166ef1 | 122 | rq->internal_tag = -1; |
522a7775 | 123 | rq->start_time_ns = ktime_get_ns(); |
09e099d4 | 124 | rq->part = NULL; |
b554db14 | 125 | refcount_set(&rq->ref, 1); |
a892c8d5 | 126 | blk_crypto_rq_set_defaults(rq); |
1da177e4 | 127 | } |
2a4aa30c | 128 | EXPORT_SYMBOL(blk_rq_init); |
1da177e4 | 129 | |
e47bc4ed CK |
130 | #define REQ_OP_NAME(name) [REQ_OP_##name] = #name |
131 | static const char *const blk_op_name[] = { | |
132 | REQ_OP_NAME(READ), | |
133 | REQ_OP_NAME(WRITE), | |
134 | REQ_OP_NAME(FLUSH), | |
135 | REQ_OP_NAME(DISCARD), | |
136 | REQ_OP_NAME(SECURE_ERASE), | |
137 | REQ_OP_NAME(ZONE_RESET), | |
6e33dbf2 | 138 | REQ_OP_NAME(ZONE_RESET_ALL), |
6c1b1da5 AJ |
139 | REQ_OP_NAME(ZONE_OPEN), |
140 | REQ_OP_NAME(ZONE_CLOSE), | |
141 | REQ_OP_NAME(ZONE_FINISH), | |
0512a75b | 142 | REQ_OP_NAME(ZONE_APPEND), |
e47bc4ed CK |
143 | REQ_OP_NAME(WRITE_SAME), |
144 | REQ_OP_NAME(WRITE_ZEROES), | |
145 | REQ_OP_NAME(SCSI_IN), | |
146 | REQ_OP_NAME(SCSI_OUT), | |
147 | REQ_OP_NAME(DRV_IN), | |
148 | REQ_OP_NAME(DRV_OUT), | |
149 | }; | |
150 | #undef REQ_OP_NAME | |
151 | ||
152 | /** | |
153 | * blk_op_str - Return string XXX in the REQ_OP_XXX. | |
154 | * @op: REQ_OP_XXX. | |
155 | * | |
156 | * Description: Centralize block layer function to convert REQ_OP_XXX into | |
157 | * string format. Useful in the debugging and tracing bio or request. For | |
158 | * invalid REQ_OP_XXX it returns string "UNKNOWN". | |
159 | */ | |
160 | inline const char *blk_op_str(unsigned int op) | |
161 | { | |
162 | const char *op_str = "UNKNOWN"; | |
163 | ||
164 | if (op < ARRAY_SIZE(blk_op_name) && blk_op_name[op]) | |
165 | op_str = blk_op_name[op]; | |
166 | ||
167 | return op_str; | |
168 | } | |
169 | EXPORT_SYMBOL_GPL(blk_op_str); | |
170 | ||
2a842aca CH |
171 | static const struct { |
172 | int errno; | |
173 | const char *name; | |
174 | } blk_errors[] = { | |
175 | [BLK_STS_OK] = { 0, "" }, | |
176 | [BLK_STS_NOTSUPP] = { -EOPNOTSUPP, "operation not supported" }, | |
177 | [BLK_STS_TIMEOUT] = { -ETIMEDOUT, "timeout" }, | |
178 | [BLK_STS_NOSPC] = { -ENOSPC, "critical space allocation" }, | |
179 | [BLK_STS_TRANSPORT] = { -ENOLINK, "recoverable transport" }, | |
180 | [BLK_STS_TARGET] = { -EREMOTEIO, "critical target" }, | |
181 | [BLK_STS_NEXUS] = { -EBADE, "critical nexus" }, | |
182 | [BLK_STS_MEDIUM] = { -ENODATA, "critical medium" }, | |
183 | [BLK_STS_PROTECTION] = { -EILSEQ, "protection" }, | |
184 | [BLK_STS_RESOURCE] = { -ENOMEM, "kernel resource" }, | |
86ff7c2a | 185 | [BLK_STS_DEV_RESOURCE] = { -EBUSY, "device resource" }, |
03a07c92 | 186 | [BLK_STS_AGAIN] = { -EAGAIN, "nonblocking retry" }, |
2a842aca | 187 | |
4e4cbee9 CH |
188 | /* device mapper special case, should not leak out: */ |
189 | [BLK_STS_DM_REQUEUE] = { -EREMCHG, "dm internal retry" }, | |
190 | ||
2a842aca CH |
191 | /* everything else not covered above: */ |
192 | [BLK_STS_IOERR] = { -EIO, "I/O" }, | |
193 | }; | |
194 | ||
195 | blk_status_t errno_to_blk_status(int errno) | |
196 | { | |
197 | int i; | |
198 | ||
199 | for (i = 0; i < ARRAY_SIZE(blk_errors); i++) { | |
200 | if (blk_errors[i].errno == errno) | |
201 | return (__force blk_status_t)i; | |
202 | } | |
203 | ||
204 | return BLK_STS_IOERR; | |
205 | } | |
206 | EXPORT_SYMBOL_GPL(errno_to_blk_status); | |
207 | ||
208 | int blk_status_to_errno(blk_status_t status) | |
209 | { | |
210 | int idx = (__force int)status; | |
211 | ||
34bd9c1c | 212 | if (WARN_ON_ONCE(idx >= ARRAY_SIZE(blk_errors))) |
2a842aca CH |
213 | return -EIO; |
214 | return blk_errors[idx].errno; | |
215 | } | |
216 | EXPORT_SYMBOL_GPL(blk_status_to_errno); | |
217 | ||
178cc590 CH |
218 | static void print_req_error(struct request *req, blk_status_t status, |
219 | const char *caller) | |
2a842aca CH |
220 | { |
221 | int idx = (__force int)status; | |
222 | ||
34bd9c1c | 223 | if (WARN_ON_ONCE(idx >= ARRAY_SIZE(blk_errors))) |
2a842aca CH |
224 | return; |
225 | ||
178cc590 | 226 | printk_ratelimited(KERN_ERR |
b0e5168a CK |
227 | "%s: %s error, dev %s, sector %llu op 0x%x:(%s) flags 0x%x " |
228 | "phys_seg %u prio class %u\n", | |
178cc590 | 229 | caller, blk_errors[idx].name, |
b0e5168a CK |
230 | req->rq_disk ? req->rq_disk->disk_name : "?", |
231 | blk_rq_pos(req), req_op(req), blk_op_str(req_op(req)), | |
232 | req->cmd_flags & ~REQ_OP_MASK, | |
233 | req->nr_phys_segments, | |
234 | IOPRIO_PRIO_CLASS(req->ioprio)); | |
2a842aca CH |
235 | } |
236 | ||
5bb23a68 | 237 | static void req_bio_endio(struct request *rq, struct bio *bio, |
2a842aca | 238 | unsigned int nbytes, blk_status_t error) |
1da177e4 | 239 | { |
78d8e58a | 240 | if (error) |
4e4cbee9 | 241 | bio->bi_status = error; |
797e7dbb | 242 | |
e8064021 | 243 | if (unlikely(rq->rq_flags & RQF_QUIET)) |
b7c44ed9 | 244 | bio_set_flag(bio, BIO_QUIET); |
08bafc03 | 245 | |
f79ea416 | 246 | bio_advance(bio, nbytes); |
7ba1ba12 | 247 | |
0512a75b KB |
248 | if (req_op(rq) == REQ_OP_ZONE_APPEND && error == BLK_STS_OK) { |
249 | /* | |
250 | * Partial zone append completions cannot be supported as the | |
251 | * BIO fragments may end up not being written sequentially. | |
252 | */ | |
253 | if (bio->bi_iter.bi_size) | |
254 | bio->bi_status = BLK_STS_IOERR; | |
255 | else | |
256 | bio->bi_iter.bi_sector = rq->__sector; | |
257 | } | |
258 | ||
143a87f4 | 259 | /* don't actually finish bio if it's part of flush sequence */ |
e8064021 | 260 | if (bio->bi_iter.bi_size == 0 && !(rq->rq_flags & RQF_FLUSH_SEQ)) |
4246a0b6 | 261 | bio_endio(bio); |
1da177e4 | 262 | } |
1da177e4 | 263 | |
1da177e4 LT |
264 | void blk_dump_rq_flags(struct request *rq, char *msg) |
265 | { | |
aebf526b CH |
266 | printk(KERN_INFO "%s: dev %s: flags=%llx\n", msg, |
267 | rq->rq_disk ? rq->rq_disk->disk_name : "?", | |
5953316d | 268 | (unsigned long long) rq->cmd_flags); |
1da177e4 | 269 | |
83096ebf TH |
270 | printk(KERN_INFO " sector %llu, nr/cnr %u/%u\n", |
271 | (unsigned long long)blk_rq_pos(rq), | |
272 | blk_rq_sectors(rq), blk_rq_cur_sectors(rq)); | |
b4f42e28 JA |
273 | printk(KERN_INFO " bio %p, biotail %p, len %u\n", |
274 | rq->bio, rq->biotail, blk_rq_bytes(rq)); | |
1da177e4 | 275 | } |
1da177e4 LT |
276 | EXPORT_SYMBOL(blk_dump_rq_flags); |
277 | ||
1da177e4 LT |
278 | /** |
279 | * blk_sync_queue - cancel any pending callbacks on a queue | |
280 | * @q: the queue | |
281 | * | |
282 | * Description: | |
283 | * The block layer may perform asynchronous callback activity | |
284 | * on a queue, such as calling the unplug function after a timeout. | |
285 | * A block device may call blk_sync_queue to ensure that any | |
286 | * such activity is cancelled, thus allowing it to release resources | |
59c51591 | 287 | * that the callbacks might use. The caller must already have made sure |
1da177e4 LT |
288 | * that its ->make_request_fn will not re-add plugging prior to calling |
289 | * this function. | |
290 | * | |
da527770 | 291 | * This function does not cancel any asynchronous activity arising |
da3dae54 | 292 | * out of elevator or throttling code. That would require elevator_exit() |
5efd6113 | 293 | * and blkcg_exit_queue() to be called with queue lock initialized. |
da527770 | 294 | * |
1da177e4 LT |
295 | */ |
296 | void blk_sync_queue(struct request_queue *q) | |
297 | { | |
70ed28b9 | 298 | del_timer_sync(&q->timeout); |
4e9b6f20 | 299 | cancel_work_sync(&q->timeout_work); |
1da177e4 LT |
300 | } |
301 | EXPORT_SYMBOL(blk_sync_queue); | |
302 | ||
c9254f2d | 303 | /** |
cd84a62e | 304 | * blk_set_pm_only - increment pm_only counter |
c9254f2d | 305 | * @q: request queue pointer |
c9254f2d | 306 | */ |
cd84a62e | 307 | void blk_set_pm_only(struct request_queue *q) |
c9254f2d | 308 | { |
cd84a62e | 309 | atomic_inc(&q->pm_only); |
c9254f2d | 310 | } |
cd84a62e | 311 | EXPORT_SYMBOL_GPL(blk_set_pm_only); |
c9254f2d | 312 | |
cd84a62e | 313 | void blk_clear_pm_only(struct request_queue *q) |
c9254f2d | 314 | { |
cd84a62e BVA |
315 | int pm_only; |
316 | ||
317 | pm_only = atomic_dec_return(&q->pm_only); | |
318 | WARN_ON_ONCE(pm_only < 0); | |
319 | if (pm_only == 0) | |
320 | wake_up_all(&q->mq_freeze_wq); | |
c9254f2d | 321 | } |
cd84a62e | 322 | EXPORT_SYMBOL_GPL(blk_clear_pm_only); |
c9254f2d | 323 | |
b5bd357c LC |
324 | /** |
325 | * blk_put_queue - decrement the request_queue refcount | |
326 | * @q: the request_queue structure to decrement the refcount for | |
327 | * | |
328 | * Decrements the refcount of the request_queue kobject. When this reaches 0 | |
329 | * we'll have blk_release_queue() called. | |
e8c7d14a LC |
330 | * |
331 | * Context: Any context, but the last reference must not be dropped from | |
332 | * atomic context. | |
b5bd357c | 333 | */ |
165125e1 | 334 | void blk_put_queue(struct request_queue *q) |
483f4afc AV |
335 | { |
336 | kobject_put(&q->kobj); | |
337 | } | |
d86e0e83 | 338 | EXPORT_SYMBOL(blk_put_queue); |
483f4afc | 339 | |
aed3ea94 JA |
340 | void blk_set_queue_dying(struct request_queue *q) |
341 | { | |
8814ce8a | 342 | blk_queue_flag_set(QUEUE_FLAG_DYING, q); |
aed3ea94 | 343 | |
d3cfb2a0 ML |
344 | /* |
345 | * When queue DYING flag is set, we need to block new req | |
346 | * entering queue, so we call blk_freeze_queue_start() to | |
347 | * prevent I/O from crossing blk_queue_enter(). | |
348 | */ | |
349 | blk_freeze_queue_start(q); | |
350 | ||
344e9ffc | 351 | if (queue_is_mq(q)) |
aed3ea94 | 352 | blk_mq_wake_waiters(q); |
055f6e18 ML |
353 | |
354 | /* Make blk_queue_enter() reexamine the DYING flag. */ | |
355 | wake_up_all(&q->mq_freeze_wq); | |
aed3ea94 JA |
356 | } |
357 | EXPORT_SYMBOL_GPL(blk_set_queue_dying); | |
358 | ||
c9a929dd TH |
359 | /** |
360 | * blk_cleanup_queue - shutdown a request queue | |
361 | * @q: request queue to shutdown | |
362 | * | |
c246e80d BVA |
363 | * Mark @q DYING, drain all pending requests, mark @q DEAD, destroy and |
364 | * put it. All future requests will be failed immediately with -ENODEV. | |
e8c7d14a LC |
365 | * |
366 | * Context: can sleep | |
c94a96ac | 367 | */ |
6728cb0e | 368 | void blk_cleanup_queue(struct request_queue *q) |
483f4afc | 369 | { |
e8c7d14a LC |
370 | /* cannot be called from atomic context */ |
371 | might_sleep(); | |
372 | ||
bae85c15 BVA |
373 | WARN_ON_ONCE(blk_queue_registered(q)); |
374 | ||
3f3299d5 | 375 | /* mark @q DYING, no new request or merges will be allowed afterwards */ |
aed3ea94 | 376 | blk_set_queue_dying(q); |
6ecf23af | 377 | |
57d74df9 CH |
378 | blk_queue_flag_set(QUEUE_FLAG_NOMERGES, q); |
379 | blk_queue_flag_set(QUEUE_FLAG_NOXMERGES, q); | |
c9a929dd | 380 | |
c246e80d BVA |
381 | /* |
382 | * Drain all requests queued before DYING marking. Set DEAD flag to | |
67ed8b73 BVA |
383 | * prevent that blk_mq_run_hw_queues() accesses the hardware queues |
384 | * after draining finished. | |
c246e80d | 385 | */ |
3ef28e83 | 386 | blk_freeze_queue(q); |
c57cdf7a ML |
387 | |
388 | rq_qos_exit(q); | |
389 | ||
57d74df9 | 390 | blk_queue_flag_set(QUEUE_FLAG_DEAD, q); |
c9a929dd | 391 | |
5a48fc14 DW |
392 | /* for synchronous bio-based driver finish in-flight integrity i/o */ |
393 | blk_flush_integrity(); | |
394 | ||
c9a929dd | 395 | /* @q won't process any more request, flush async actions */ |
dc3b17cc | 396 | del_timer_sync(&q->backing_dev_info->laptop_mode_wb_timer); |
c9a929dd TH |
397 | blk_sync_queue(q); |
398 | ||
344e9ffc | 399 | if (queue_is_mq(q)) |
c7e2d94b | 400 | blk_mq_exit_queue(q); |
a1ce35fa | 401 | |
c3e22192 ML |
402 | /* |
403 | * In theory, request pool of sched_tags belongs to request queue. | |
404 | * However, the current implementation requires tag_set for freeing | |
405 | * requests, so free the pool now. | |
406 | * | |
407 | * Queue has become frozen, there can't be any in-queue requests, so | |
408 | * it is safe to free requests now. | |
409 | */ | |
410 | mutex_lock(&q->sysfs_lock); | |
411 | if (q->elevator) | |
412 | blk_mq_sched_free_requests(q); | |
413 | mutex_unlock(&q->sysfs_lock); | |
414 | ||
3ef28e83 | 415 | percpu_ref_exit(&q->q_usage_counter); |
45a9c9d9 | 416 | |
c9a929dd | 417 | /* @q is and will stay empty, shutdown and put */ |
483f4afc AV |
418 | blk_put_queue(q); |
419 | } | |
1da177e4 LT |
420 | EXPORT_SYMBOL(blk_cleanup_queue); |
421 | ||
3a0a5299 BVA |
422 | /** |
423 | * blk_queue_enter() - try to increase q->q_usage_counter | |
424 | * @q: request queue pointer | |
425 | * @flags: BLK_MQ_REQ_NOWAIT and/or BLK_MQ_REQ_PREEMPT | |
426 | */ | |
9a95e4ef | 427 | int blk_queue_enter(struct request_queue *q, blk_mq_req_flags_t flags) |
3ef28e83 | 428 | { |
cd84a62e | 429 | const bool pm = flags & BLK_MQ_REQ_PREEMPT; |
3a0a5299 | 430 | |
3ef28e83 | 431 | while (true) { |
3a0a5299 | 432 | bool success = false; |
3ef28e83 | 433 | |
818e0fa2 | 434 | rcu_read_lock(); |
3a0a5299 BVA |
435 | if (percpu_ref_tryget_live(&q->q_usage_counter)) { |
436 | /* | |
cd84a62e BVA |
437 | * The code that increments the pm_only counter is |
438 | * responsible for ensuring that that counter is | |
439 | * globally visible before the queue is unfrozen. | |
3a0a5299 | 440 | */ |
cd84a62e | 441 | if (pm || !blk_queue_pm_only(q)) { |
3a0a5299 BVA |
442 | success = true; |
443 | } else { | |
444 | percpu_ref_put(&q->q_usage_counter); | |
445 | } | |
446 | } | |
818e0fa2 | 447 | rcu_read_unlock(); |
3a0a5299 BVA |
448 | |
449 | if (success) | |
3ef28e83 DW |
450 | return 0; |
451 | ||
3a0a5299 | 452 | if (flags & BLK_MQ_REQ_NOWAIT) |
3ef28e83 DW |
453 | return -EBUSY; |
454 | ||
5ed61d3f | 455 | /* |
1671d522 | 456 | * read pair of barrier in blk_freeze_queue_start(), |
5ed61d3f | 457 | * we need to order reading __PERCPU_REF_DEAD flag of |
d3cfb2a0 ML |
458 | * .q_usage_counter and reading .mq_freeze_depth or |
459 | * queue dying flag, otherwise the following wait may | |
460 | * never return if the two reads are reordered. | |
5ed61d3f ML |
461 | */ |
462 | smp_rmb(); | |
463 | ||
1dc3039b | 464 | wait_event(q->mq_freeze_wq, |
7996a8b5 | 465 | (!q->mq_freeze_depth && |
0d25bd07 BVA |
466 | (pm || (blk_pm_request_resume(q), |
467 | !blk_queue_pm_only(q)))) || | |
1dc3039b | 468 | blk_queue_dying(q)); |
3ef28e83 DW |
469 | if (blk_queue_dying(q)) |
470 | return -ENODEV; | |
3ef28e83 DW |
471 | } |
472 | } | |
473 | ||
accea322 CH |
474 | static inline int bio_queue_enter(struct bio *bio) |
475 | { | |
476 | struct request_queue *q = bio->bi_disk->queue; | |
477 | bool nowait = bio->bi_opf & REQ_NOWAIT; | |
478 | int ret; | |
479 | ||
480 | ret = blk_queue_enter(q, nowait ? BLK_MQ_REQ_NOWAIT : 0); | |
481 | if (unlikely(ret)) { | |
482 | if (nowait && !blk_queue_dying(q)) | |
483 | bio_wouldblock_error(bio); | |
484 | else | |
485 | bio_io_error(bio); | |
486 | } | |
487 | ||
488 | return ret; | |
489 | } | |
490 | ||
3ef28e83 DW |
491 | void blk_queue_exit(struct request_queue *q) |
492 | { | |
493 | percpu_ref_put(&q->q_usage_counter); | |
494 | } | |
495 | ||
496 | static void blk_queue_usage_counter_release(struct percpu_ref *ref) | |
497 | { | |
498 | struct request_queue *q = | |
499 | container_of(ref, struct request_queue, q_usage_counter); | |
500 | ||
501 | wake_up_all(&q->mq_freeze_wq); | |
502 | } | |
503 | ||
bca237a5 | 504 | static void blk_rq_timed_out_timer(struct timer_list *t) |
287922eb | 505 | { |
bca237a5 | 506 | struct request_queue *q = from_timer(q, t, timeout); |
287922eb CH |
507 | |
508 | kblockd_schedule_work(&q->timeout_work); | |
509 | } | |
510 | ||
2e3c18d0 TH |
511 | static void blk_timeout_work(struct work_struct *work) |
512 | { | |
513 | } | |
514 | ||
3d745ea5 | 515 | struct request_queue *__blk_alloc_queue(int node_id) |
1946089a | 516 | { |
165125e1 | 517 | struct request_queue *q; |
338aa96d | 518 | int ret; |
1946089a | 519 | |
8324aa91 | 520 | q = kmem_cache_alloc_node(blk_requestq_cachep, |
3d745ea5 | 521 | GFP_KERNEL | __GFP_ZERO, node_id); |
1da177e4 LT |
522 | if (!q) |
523 | return NULL; | |
524 | ||
cbf62af3 | 525 | q->last_merge = NULL; |
cbf62af3 | 526 | |
3d745ea5 | 527 | q->id = ida_simple_get(&blk_queue_ida, 0, 0, GFP_KERNEL); |
a73f730d | 528 | if (q->id < 0) |
3d2936f4 | 529 | goto fail_q; |
a73f730d | 530 | |
338aa96d KO |
531 | ret = bioset_init(&q->bio_split, BIO_POOL_SIZE, 0, BIOSET_NEED_BVECS); |
532 | if (ret) | |
54efd50b KO |
533 | goto fail_id; |
534 | ||
aef33c2f | 535 | q->backing_dev_info = bdi_alloc(node_id); |
d03f6cdc JK |
536 | if (!q->backing_dev_info) |
537 | goto fail_split; | |
538 | ||
a83b576c JA |
539 | q->stats = blk_alloc_queue_stats(); |
540 | if (!q->stats) | |
541 | goto fail_stats; | |
542 | ||
b5420237 | 543 | q->backing_dev_info->ra_pages = VM_READAHEAD_PAGES; |
dc3b17cc | 544 | q->backing_dev_info->capabilities = BDI_CAP_CGROUP_WRITEBACK; |
5151412d | 545 | q->node = node_id; |
0989a025 | 546 | |
bca237a5 KC |
547 | timer_setup(&q->backing_dev_info->laptop_mode_wb_timer, |
548 | laptop_mode_timer_fn, 0); | |
549 | timer_setup(&q->timeout, blk_rq_timed_out_timer, 0); | |
2e3c18d0 | 550 | INIT_WORK(&q->timeout_work, blk_timeout_work); |
a612fddf | 551 | INIT_LIST_HEAD(&q->icq_list); |
4eef3049 | 552 | #ifdef CONFIG_BLK_CGROUP |
e8989fae | 553 | INIT_LIST_HEAD(&q->blkg_list); |
4eef3049 | 554 | #endif |
483f4afc | 555 | |
8324aa91 | 556 | kobject_init(&q->kobj, &blk_queue_ktype); |
1da177e4 | 557 | |
5acb3cc2 WL |
558 | #ifdef CONFIG_BLK_DEV_IO_TRACE |
559 | mutex_init(&q->blk_trace_mutex); | |
560 | #endif | |
483f4afc | 561 | mutex_init(&q->sysfs_lock); |
cecf5d87 | 562 | mutex_init(&q->sysfs_dir_lock); |
0d945c1f | 563 | spin_lock_init(&q->queue_lock); |
c94a96ac | 564 | |
320ae51f | 565 | init_waitqueue_head(&q->mq_freeze_wq); |
7996a8b5 | 566 | mutex_init(&q->mq_freeze_lock); |
320ae51f | 567 | |
3ef28e83 DW |
568 | /* |
569 | * Init percpu_ref in atomic mode so that it's faster to shutdown. | |
570 | * See blk_register_queue() for details. | |
571 | */ | |
572 | if (percpu_ref_init(&q->q_usage_counter, | |
573 | blk_queue_usage_counter_release, | |
574 | PERCPU_REF_INIT_ATOMIC, GFP_KERNEL)) | |
fff4996b | 575 | goto fail_bdi; |
f51b802c | 576 | |
3ef28e83 DW |
577 | if (blkcg_init_queue(q)) |
578 | goto fail_ref; | |
579 | ||
3d745ea5 CH |
580 | blk_queue_dma_alignment(q, 511); |
581 | blk_set_default_limits(&q->limits); | |
582 | ||
1da177e4 | 583 | return q; |
a73f730d | 584 | |
3ef28e83 DW |
585 | fail_ref: |
586 | percpu_ref_exit(&q->q_usage_counter); | |
fff4996b | 587 | fail_bdi: |
a83b576c JA |
588 | blk_free_queue_stats(q->stats); |
589 | fail_stats: | |
d03f6cdc | 590 | bdi_put(q->backing_dev_info); |
54efd50b | 591 | fail_split: |
338aa96d | 592 | bioset_exit(&q->bio_split); |
a73f730d TH |
593 | fail_id: |
594 | ida_simple_remove(&blk_queue_ida, q->id); | |
595 | fail_q: | |
596 | kmem_cache_free(blk_requestq_cachep, q); | |
597 | return NULL; | |
1da177e4 | 598 | } |
3d745ea5 CH |
599 | |
600 | struct request_queue *blk_alloc_queue(make_request_fn make_request, int node_id) | |
601 | { | |
602 | struct request_queue *q; | |
603 | ||
604 | if (WARN_ON_ONCE(!make_request)) | |
654a3667 | 605 | return NULL; |
3d745ea5 CH |
606 | |
607 | q = __blk_alloc_queue(node_id); | |
608 | if (!q) | |
609 | return NULL; | |
610 | q->make_request_fn = make_request; | |
611 | q->nr_requests = BLKDEV_MAX_RQ; | |
612 | return q; | |
613 | } | |
614 | EXPORT_SYMBOL(blk_alloc_queue); | |
1da177e4 | 615 | |
b5bd357c LC |
616 | /** |
617 | * blk_get_queue - increment the request_queue refcount | |
618 | * @q: the request_queue structure to increment the refcount for | |
619 | * | |
620 | * Increment the refcount of the request_queue kobject. | |
763b5892 LC |
621 | * |
622 | * Context: Any context. | |
b5bd357c | 623 | */ |
09ac46c4 | 624 | bool blk_get_queue(struct request_queue *q) |
1da177e4 | 625 | { |
3f3299d5 | 626 | if (likely(!blk_queue_dying(q))) { |
09ac46c4 TH |
627 | __blk_get_queue(q); |
628 | return true; | |
1da177e4 LT |
629 | } |
630 | ||
09ac46c4 | 631 | return false; |
1da177e4 | 632 | } |
d86e0e83 | 633 | EXPORT_SYMBOL(blk_get_queue); |
1da177e4 | 634 | |
a1ce35fa JA |
635 | /** |
636 | * blk_get_request - allocate a request | |
637 | * @q: request queue to allocate a request for | |
638 | * @op: operation (REQ_OP_*) and REQ_* flags, e.g. REQ_SYNC. | |
639 | * @flags: BLK_MQ_REQ_* flags, e.g. BLK_MQ_REQ_NOWAIT. | |
1da177e4 | 640 | */ |
a1ce35fa JA |
641 | struct request *blk_get_request(struct request_queue *q, unsigned int op, |
642 | blk_mq_req_flags_t flags) | |
1da177e4 | 643 | { |
a1ce35fa | 644 | struct request *req; |
1da177e4 | 645 | |
a1ce35fa JA |
646 | WARN_ON_ONCE(op & REQ_NOWAIT); |
647 | WARN_ON_ONCE(flags & ~(BLK_MQ_REQ_NOWAIT | BLK_MQ_REQ_PREEMPT)); | |
1da177e4 | 648 | |
a1ce35fa JA |
649 | req = blk_mq_alloc_request(q, op, flags); |
650 | if (!IS_ERR(req) && q->mq_ops->initialize_rq_fn) | |
651 | q->mq_ops->initialize_rq_fn(req); | |
1da177e4 | 652 | |
a1ce35fa | 653 | return req; |
1da177e4 | 654 | } |
a1ce35fa | 655 | EXPORT_SYMBOL(blk_get_request); |
1da177e4 | 656 | |
1da177e4 LT |
657 | void blk_put_request(struct request *req) |
658 | { | |
a1ce35fa | 659 | blk_mq_free_request(req); |
1da177e4 | 660 | } |
1da177e4 LT |
661 | EXPORT_SYMBOL(blk_put_request); |
662 | ||
b5af37ab KK |
663 | static void blk_account_io_merge_bio(struct request *req) |
664 | { | |
665 | if (!blk_do_io_stat(req)) | |
666 | return; | |
667 | ||
668 | part_stat_lock(); | |
669 | part_stat_inc(req->part, merges[op_stat_group(req_op(req))]); | |
670 | part_stat_unlock(); | |
671 | } | |
672 | ||
14ccb66b CH |
673 | bool bio_attempt_back_merge(struct request *req, struct bio *bio, |
674 | unsigned int nr_segs) | |
73c10101 | 675 | { |
1eff9d32 | 676 | const int ff = bio->bi_opf & REQ_FAILFAST_MASK; |
73c10101 | 677 | |
14ccb66b | 678 | if (!ll_back_merge_fn(req, bio, nr_segs)) |
73c10101 JA |
679 | return false; |
680 | ||
14ccb66b | 681 | trace_block_bio_backmerge(req->q, req, bio); |
d3e65fff | 682 | rq_qos_merge(req->q, req, bio); |
73c10101 JA |
683 | |
684 | if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff) | |
685 | blk_rq_set_mixed_merge(req); | |
686 | ||
687 | req->biotail->bi_next = bio; | |
688 | req->biotail = bio; | |
4f024f37 | 689 | req->__data_len += bio->bi_iter.bi_size; |
73c10101 | 690 | |
a892c8d5 ST |
691 | bio_crypt_free_ctx(bio); |
692 | ||
b5af37ab | 693 | blk_account_io_merge_bio(req); |
73c10101 JA |
694 | return true; |
695 | } | |
696 | ||
14ccb66b CH |
697 | bool bio_attempt_front_merge(struct request *req, struct bio *bio, |
698 | unsigned int nr_segs) | |
73c10101 | 699 | { |
1eff9d32 | 700 | const int ff = bio->bi_opf & REQ_FAILFAST_MASK; |
73c10101 | 701 | |
14ccb66b | 702 | if (!ll_front_merge_fn(req, bio, nr_segs)) |
73c10101 JA |
703 | return false; |
704 | ||
14ccb66b | 705 | trace_block_bio_frontmerge(req->q, req, bio); |
d3e65fff | 706 | rq_qos_merge(req->q, req, bio); |
73c10101 JA |
707 | |
708 | if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff) | |
709 | blk_rq_set_mixed_merge(req); | |
710 | ||
73c10101 JA |
711 | bio->bi_next = req->bio; |
712 | req->bio = bio; | |
713 | ||
4f024f37 KO |
714 | req->__sector = bio->bi_iter.bi_sector; |
715 | req->__data_len += bio->bi_iter.bi_size; | |
73c10101 | 716 | |
a892c8d5 ST |
717 | bio_crypt_do_front_merge(req, bio); |
718 | ||
b5af37ab | 719 | blk_account_io_merge_bio(req); |
73c10101 JA |
720 | return true; |
721 | } | |
722 | ||
1e739730 CH |
723 | bool bio_attempt_discard_merge(struct request_queue *q, struct request *req, |
724 | struct bio *bio) | |
725 | { | |
726 | unsigned short segments = blk_rq_nr_discard_segments(req); | |
727 | ||
728 | if (segments >= queue_max_discard_segments(q)) | |
729 | goto no_merge; | |
730 | if (blk_rq_sectors(req) + bio_sectors(bio) > | |
731 | blk_rq_get_max_sectors(req, blk_rq_pos(req))) | |
732 | goto no_merge; | |
733 | ||
d3e65fff TH |
734 | rq_qos_merge(q, req, bio); |
735 | ||
1e739730 CH |
736 | req->biotail->bi_next = bio; |
737 | req->biotail = bio; | |
738 | req->__data_len += bio->bi_iter.bi_size; | |
1e739730 CH |
739 | req->nr_phys_segments = segments + 1; |
740 | ||
b5af37ab | 741 | blk_account_io_merge_bio(req); |
1e739730 CH |
742 | return true; |
743 | no_merge: | |
744 | req_set_nomerge(q, req); | |
745 | return false; | |
746 | } | |
747 | ||
bd87b589 | 748 | /** |
320ae51f | 749 | * blk_attempt_plug_merge - try to merge with %current's plugged list |
bd87b589 TH |
750 | * @q: request_queue new bio is being queued at |
751 | * @bio: new bio being queued | |
14ccb66b | 752 | * @nr_segs: number of segments in @bio |
ccc2600b RD |
753 | * @same_queue_rq: pointer to &struct request that gets filled in when |
754 | * another request associated with @q is found on the plug list | |
755 | * (optional, may be %NULL) | |
bd87b589 TH |
756 | * |
757 | * Determine whether @bio being queued on @q can be merged with a request | |
758 | * on %current's plugged list. Returns %true if merge was successful, | |
759 | * otherwise %false. | |
760 | * | |
07c2bd37 TH |
761 | * Plugging coalesces IOs from the same issuer for the same purpose without |
762 | * going through @q->queue_lock. As such it's more of an issuing mechanism | |
763 | * than scheduling, and the request, while may have elvpriv data, is not | |
764 | * added on the elevator at this point. In addition, we don't have | |
765 | * reliable access to the elevator outside queue lock. Only check basic | |
766 | * merging parameters without querying the elevator. | |
da41a589 RE |
767 | * |
768 | * Caller must ensure !blk_queue_nomerges(q) beforehand. | |
73c10101 | 769 | */ |
320ae51f | 770 | bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio, |
14ccb66b | 771 | unsigned int nr_segs, struct request **same_queue_rq) |
73c10101 JA |
772 | { |
773 | struct blk_plug *plug; | |
774 | struct request *rq; | |
92f399c7 | 775 | struct list_head *plug_list; |
73c10101 | 776 | |
b49773e7 | 777 | plug = blk_mq_plug(q, bio); |
73c10101 | 778 | if (!plug) |
34fe7c05 | 779 | return false; |
73c10101 | 780 | |
a1ce35fa | 781 | plug_list = &plug->mq_list; |
92f399c7 SL |
782 | |
783 | list_for_each_entry_reverse(rq, plug_list, queuelist) { | |
34fe7c05 | 784 | bool merged = false; |
73c10101 | 785 | |
5f0ed774 | 786 | if (rq->q == q && same_queue_rq) { |
5b3f341f SL |
787 | /* |
788 | * Only blk-mq multiple hardware queues case checks the | |
789 | * rq in the same queue, there should be only one such | |
790 | * rq in a queue | |
791 | **/ | |
5f0ed774 | 792 | *same_queue_rq = rq; |
5b3f341f | 793 | } |
56ebdaf2 | 794 | |
07c2bd37 | 795 | if (rq->q != q || !blk_rq_merge_ok(rq, bio)) |
73c10101 JA |
796 | continue; |
797 | ||
34fe7c05 CH |
798 | switch (blk_try_merge(rq, bio)) { |
799 | case ELEVATOR_BACK_MERGE: | |
14ccb66b | 800 | merged = bio_attempt_back_merge(rq, bio, nr_segs); |
34fe7c05 CH |
801 | break; |
802 | case ELEVATOR_FRONT_MERGE: | |
14ccb66b | 803 | merged = bio_attempt_front_merge(rq, bio, nr_segs); |
34fe7c05 | 804 | break; |
1e739730 CH |
805 | case ELEVATOR_DISCARD_MERGE: |
806 | merged = bio_attempt_discard_merge(q, rq, bio); | |
807 | break; | |
34fe7c05 CH |
808 | default: |
809 | break; | |
73c10101 | 810 | } |
34fe7c05 CH |
811 | |
812 | if (merged) | |
813 | return true; | |
73c10101 | 814 | } |
34fe7c05 CH |
815 | |
816 | return false; | |
73c10101 JA |
817 | } |
818 | ||
52c5e62d | 819 | static void handle_bad_sector(struct bio *bio, sector_t maxsector) |
1da177e4 LT |
820 | { |
821 | char b[BDEVNAME_SIZE]; | |
822 | ||
823 | printk(KERN_INFO "attempt to access beyond end of device\n"); | |
6296b960 | 824 | printk(KERN_INFO "%s: rw=%d, want=%Lu, limit=%Lu\n", |
74d46992 | 825 | bio_devname(bio, b), bio->bi_opf, |
f73a1c7d | 826 | (unsigned long long)bio_end_sector(bio), |
52c5e62d | 827 | (long long)maxsector); |
1da177e4 LT |
828 | } |
829 | ||
c17bb495 AM |
830 | #ifdef CONFIG_FAIL_MAKE_REQUEST |
831 | ||
832 | static DECLARE_FAULT_ATTR(fail_make_request); | |
833 | ||
834 | static int __init setup_fail_make_request(char *str) | |
835 | { | |
836 | return setup_fault_attr(&fail_make_request, str); | |
837 | } | |
838 | __setup("fail_make_request=", setup_fail_make_request); | |
839 | ||
b2c9cd37 | 840 | static bool should_fail_request(struct hd_struct *part, unsigned int bytes) |
c17bb495 | 841 | { |
b2c9cd37 | 842 | return part->make_it_fail && should_fail(&fail_make_request, bytes); |
c17bb495 AM |
843 | } |
844 | ||
845 | static int __init fail_make_request_debugfs(void) | |
846 | { | |
dd48c085 AM |
847 | struct dentry *dir = fault_create_debugfs_attr("fail_make_request", |
848 | NULL, &fail_make_request); | |
849 | ||
21f9fcd8 | 850 | return PTR_ERR_OR_ZERO(dir); |
c17bb495 AM |
851 | } |
852 | ||
853 | late_initcall(fail_make_request_debugfs); | |
854 | ||
855 | #else /* CONFIG_FAIL_MAKE_REQUEST */ | |
856 | ||
b2c9cd37 AM |
857 | static inline bool should_fail_request(struct hd_struct *part, |
858 | unsigned int bytes) | |
c17bb495 | 859 | { |
b2c9cd37 | 860 | return false; |
c17bb495 AM |
861 | } |
862 | ||
863 | #endif /* CONFIG_FAIL_MAKE_REQUEST */ | |
864 | ||
721c7fc7 ID |
865 | static inline bool bio_check_ro(struct bio *bio, struct hd_struct *part) |
866 | { | |
b089cfd9 JA |
867 | const int op = bio_op(bio); |
868 | ||
8b2ded1c | 869 | if (part->policy && op_is_write(op)) { |
721c7fc7 ID |
870 | char b[BDEVNAME_SIZE]; |
871 | ||
8b2ded1c MP |
872 | if (op_is_flush(bio->bi_opf) && !bio_sectors(bio)) |
873 | return false; | |
874 | ||
a32e236e | 875 | WARN_ONCE(1, |
721c7fc7 ID |
876 | "generic_make_request: Trying to write " |
877 | "to read-only block-device %s (partno %d)\n", | |
878 | bio_devname(bio, b), part->partno); | |
a32e236e LT |
879 | /* Older lvm-tools actually trigger this */ |
880 | return false; | |
721c7fc7 ID |
881 | } |
882 | ||
883 | return false; | |
884 | } | |
885 | ||
30abb3a6 HM |
886 | static noinline int should_fail_bio(struct bio *bio) |
887 | { | |
888 | if (should_fail_request(&bio->bi_disk->part0, bio->bi_iter.bi_size)) | |
889 | return -EIO; | |
890 | return 0; | |
891 | } | |
892 | ALLOW_ERROR_INJECTION(should_fail_bio, ERRNO); | |
893 | ||
52c5e62d CH |
894 | /* |
895 | * Check whether this bio extends beyond the end of the device or partition. | |
896 | * This may well happen - the kernel calls bread() without checking the size of | |
897 | * the device, e.g., when mounting a file system. | |
898 | */ | |
899 | static inline int bio_check_eod(struct bio *bio, sector_t maxsector) | |
900 | { | |
901 | unsigned int nr_sectors = bio_sectors(bio); | |
902 | ||
903 | if (nr_sectors && maxsector && | |
904 | (nr_sectors > maxsector || | |
905 | bio->bi_iter.bi_sector > maxsector - nr_sectors)) { | |
906 | handle_bad_sector(bio, maxsector); | |
907 | return -EIO; | |
908 | } | |
909 | return 0; | |
910 | } | |
911 | ||
74d46992 CH |
912 | /* |
913 | * Remap block n of partition p to block n+start(p) of the disk. | |
914 | */ | |
915 | static inline int blk_partition_remap(struct bio *bio) | |
916 | { | |
917 | struct hd_struct *p; | |
52c5e62d | 918 | int ret = -EIO; |
74d46992 | 919 | |
721c7fc7 ID |
920 | rcu_read_lock(); |
921 | p = __disk_get_part(bio->bi_disk, bio->bi_partno); | |
52c5e62d CH |
922 | if (unlikely(!p)) |
923 | goto out; | |
924 | if (unlikely(should_fail_request(p, bio->bi_iter.bi_size))) | |
925 | goto out; | |
926 | if (unlikely(bio_check_ro(bio, p))) | |
721c7fc7 | 927 | goto out; |
721c7fc7 | 928 | |
5eac3eb3 | 929 | if (bio_sectors(bio)) { |
52c5e62d CH |
930 | if (bio_check_eod(bio, part_nr_sects_read(p))) |
931 | goto out; | |
932 | bio->bi_iter.bi_sector += p->start_sect; | |
52c5e62d CH |
933 | trace_block_bio_remap(bio->bi_disk->queue, bio, part_devt(p), |
934 | bio->bi_iter.bi_sector - p->start_sect); | |
935 | } | |
c04fa44b | 936 | bio->bi_partno = 0; |
52c5e62d | 937 | ret = 0; |
721c7fc7 ID |
938 | out: |
939 | rcu_read_unlock(); | |
74d46992 CH |
940 | return ret; |
941 | } | |
942 | ||
0512a75b KB |
943 | /* |
944 | * Check write append to a zoned block device. | |
945 | */ | |
946 | static inline blk_status_t blk_check_zone_append(struct request_queue *q, | |
947 | struct bio *bio) | |
948 | { | |
949 | sector_t pos = bio->bi_iter.bi_sector; | |
950 | int nr_sectors = bio_sectors(bio); | |
951 | ||
952 | /* Only applicable to zoned block devices */ | |
953 | if (!blk_queue_is_zoned(q)) | |
954 | return BLK_STS_NOTSUPP; | |
955 | ||
956 | /* The bio sector must point to the start of a sequential zone */ | |
957 | if (pos & (blk_queue_zone_sectors(q) - 1) || | |
958 | !blk_queue_zone_is_seq(q, pos)) | |
959 | return BLK_STS_IOERR; | |
960 | ||
961 | /* | |
962 | * Not allowed to cross zone boundaries. Otherwise, the BIO will be | |
963 | * split and could result in non-contiguous sectors being written in | |
964 | * different zones. | |
965 | */ | |
966 | if (nr_sectors > q->limits.chunk_sectors) | |
967 | return BLK_STS_IOERR; | |
968 | ||
969 | /* Make sure the BIO is small enough and will not get split */ | |
970 | if (nr_sectors > q->limits.max_zone_append_sectors) | |
971 | return BLK_STS_IOERR; | |
972 | ||
973 | bio->bi_opf |= REQ_NOMERGE; | |
974 | ||
975 | return BLK_STS_OK; | |
976 | } | |
977 | ||
27a84d54 CH |
978 | static noinline_for_stack bool |
979 | generic_make_request_checks(struct bio *bio) | |
1da177e4 | 980 | { |
165125e1 | 981 | struct request_queue *q; |
5a7bbad2 | 982 | int nr_sectors = bio_sectors(bio); |
4e4cbee9 | 983 | blk_status_t status = BLK_STS_IOERR; |
5a7bbad2 | 984 | char b[BDEVNAME_SIZE]; |
1da177e4 LT |
985 | |
986 | might_sleep(); | |
1da177e4 | 987 | |
74d46992 | 988 | q = bio->bi_disk->queue; |
5a7bbad2 CH |
989 | if (unlikely(!q)) { |
990 | printk(KERN_ERR | |
991 | "generic_make_request: Trying to access " | |
992 | "nonexistent block-device %s (%Lu)\n", | |
74d46992 | 993 | bio_devname(bio, b), (long long)bio->bi_iter.bi_sector); |
5a7bbad2 CH |
994 | goto end_io; |
995 | } | |
c17bb495 | 996 | |
03a07c92 | 997 | /* |
b0beb280 JA |
998 | * For a REQ_NOWAIT based request, return -EOPNOTSUPP |
999 | * if queue is not a request based queue. | |
03a07c92 | 1000 | */ |
b0beb280 JA |
1001 | if ((bio->bi_opf & REQ_NOWAIT) && !queue_is_mq(q)) |
1002 | goto not_supported; | |
03a07c92 | 1003 | |
30abb3a6 | 1004 | if (should_fail_bio(bio)) |
5a7bbad2 | 1005 | goto end_io; |
2056a782 | 1006 | |
52c5e62d CH |
1007 | if (bio->bi_partno) { |
1008 | if (unlikely(blk_partition_remap(bio))) | |
721c7fc7 ID |
1009 | goto end_io; |
1010 | } else { | |
52c5e62d CH |
1011 | if (unlikely(bio_check_ro(bio, &bio->bi_disk->part0))) |
1012 | goto end_io; | |
1013 | if (unlikely(bio_check_eod(bio, get_capacity(bio->bi_disk)))) | |
721c7fc7 ID |
1014 | goto end_io; |
1015 | } | |
2056a782 | 1016 | |
5a7bbad2 CH |
1017 | /* |
1018 | * Filter flush bio's early so that make_request based | |
1019 | * drivers without flush support don't have to worry | |
1020 | * about them. | |
1021 | */ | |
f3a8ab7d | 1022 | if (op_is_flush(bio->bi_opf) && |
c888a8f9 | 1023 | !test_bit(QUEUE_FLAG_WC, &q->queue_flags)) { |
1eff9d32 | 1024 | bio->bi_opf &= ~(REQ_PREFLUSH | REQ_FUA); |
5a7bbad2 | 1025 | if (!nr_sectors) { |
4e4cbee9 | 1026 | status = BLK_STS_OK; |
51fd77bd JA |
1027 | goto end_io; |
1028 | } | |
5a7bbad2 | 1029 | } |
5ddfe969 | 1030 | |
d04c406f CH |
1031 | if (!test_bit(QUEUE_FLAG_POLL, &q->queue_flags)) |
1032 | bio->bi_opf &= ~REQ_HIPRI; | |
1033 | ||
288dab8a CH |
1034 | switch (bio_op(bio)) { |
1035 | case REQ_OP_DISCARD: | |
1036 | if (!blk_queue_discard(q)) | |
1037 | goto not_supported; | |
1038 | break; | |
1039 | case REQ_OP_SECURE_ERASE: | |
1040 | if (!blk_queue_secure_erase(q)) | |
1041 | goto not_supported; | |
1042 | break; | |
1043 | case REQ_OP_WRITE_SAME: | |
74d46992 | 1044 | if (!q->limits.max_write_same_sectors) |
288dab8a | 1045 | goto not_supported; |
58886785 | 1046 | break; |
0512a75b KB |
1047 | case REQ_OP_ZONE_APPEND: |
1048 | status = blk_check_zone_append(q, bio); | |
1049 | if (status != BLK_STS_OK) | |
1050 | goto end_io; | |
1051 | break; | |
2d253440 | 1052 | case REQ_OP_ZONE_RESET: |
6c1b1da5 AJ |
1053 | case REQ_OP_ZONE_OPEN: |
1054 | case REQ_OP_ZONE_CLOSE: | |
1055 | case REQ_OP_ZONE_FINISH: | |
74d46992 | 1056 | if (!blk_queue_is_zoned(q)) |
2d253440 | 1057 | goto not_supported; |
288dab8a | 1058 | break; |
6e33dbf2 CK |
1059 | case REQ_OP_ZONE_RESET_ALL: |
1060 | if (!blk_queue_is_zoned(q) || !blk_queue_zone_resetall(q)) | |
1061 | goto not_supported; | |
1062 | break; | |
a6f0788e | 1063 | case REQ_OP_WRITE_ZEROES: |
74d46992 | 1064 | if (!q->limits.max_write_zeroes_sectors) |
a6f0788e CK |
1065 | goto not_supported; |
1066 | break; | |
288dab8a CH |
1067 | default: |
1068 | break; | |
5a7bbad2 | 1069 | } |
01edede4 | 1070 | |
7f4b35d1 | 1071 | /* |
3e82c348 CH |
1072 | * Various block parts want %current->io_context, so allocate it up |
1073 | * front rather than dealing with lots of pain to allocate it only | |
1074 | * where needed. This may fail and the block layer knows how to live | |
1075 | * with it. | |
7f4b35d1 | 1076 | */ |
3e82c348 CH |
1077 | if (unlikely(!current->io_context)) |
1078 | create_task_io_context(current, GFP_ATOMIC, q->node); | |
7f4b35d1 | 1079 | |
ae118896 TH |
1080 | if (!blkcg_bio_issue_check(q, bio)) |
1081 | return false; | |
27a84d54 | 1082 | |
fbbaf700 N |
1083 | if (!bio_flagged(bio, BIO_TRACE_COMPLETION)) { |
1084 | trace_block_bio_queue(q, bio); | |
1085 | /* Now that enqueuing has been traced, we need to trace | |
1086 | * completion as well. | |
1087 | */ | |
1088 | bio_set_flag(bio, BIO_TRACE_COMPLETION); | |
1089 | } | |
27a84d54 | 1090 | return true; |
a7384677 | 1091 | |
288dab8a | 1092 | not_supported: |
4e4cbee9 | 1093 | status = BLK_STS_NOTSUPP; |
a7384677 | 1094 | end_io: |
4e4cbee9 | 1095 | bio->bi_status = status; |
4246a0b6 | 1096 | bio_endio(bio); |
27a84d54 | 1097 | return false; |
1da177e4 LT |
1098 | } |
1099 | ||
ac7c5675 CH |
1100 | static blk_qc_t do_make_request(struct bio *bio) |
1101 | { | |
1102 | struct request_queue *q = bio->bi_disk->queue; | |
1103 | blk_qc_t ret = BLK_QC_T_NONE; | |
1104 | ||
1105 | if (blk_crypto_bio_prep(&bio)) { | |
1106 | if (!q->make_request_fn) | |
1107 | return blk_mq_make_request(q, bio); | |
1108 | ret = q->make_request_fn(q, bio); | |
1109 | } | |
1110 | blk_queue_exit(q); | |
1111 | return ret; | |
1112 | } | |
1113 | ||
27a84d54 | 1114 | /** |
3fdd4086 | 1115 | * generic_make_request - re-submit a bio to the block device layer for I/O |
27a84d54 CH |
1116 | * @bio: The bio describing the location in memory and on the device. |
1117 | * | |
3fdd4086 CH |
1118 | * This is a version of submit_bio() that shall only be used for I/O that is |
1119 | * resubmitted to lower level drivers by stacking block drivers. All file | |
1120 | * systems and other upper level users of the block layer should use | |
1121 | * submit_bio() instead. | |
d89d8796 | 1122 | */ |
dece1635 | 1123 | blk_qc_t generic_make_request(struct bio *bio) |
d89d8796 | 1124 | { |
f5fe1b51 N |
1125 | /* |
1126 | * bio_list_on_stack[0] contains bios submitted by the current | |
1127 | * make_request_fn. | |
1128 | * bio_list_on_stack[1] contains bios that were submitted before | |
1129 | * the current make_request_fn, but that haven't been processed | |
1130 | * yet. | |
1131 | */ | |
1132 | struct bio_list bio_list_on_stack[2]; | |
dece1635 | 1133 | blk_qc_t ret = BLK_QC_T_NONE; |
bddd87c7 | 1134 | |
27a84d54 | 1135 | if (!generic_make_request_checks(bio)) |
dece1635 | 1136 | goto out; |
27a84d54 CH |
1137 | |
1138 | /* | |
1139 | * We only want one ->make_request_fn to be active at a time, else | |
1140 | * stack usage with stacked devices could be a problem. So use | |
1141 | * current->bio_list to keep a list of requests submited by a | |
1142 | * make_request_fn function. current->bio_list is also used as a | |
1143 | * flag to say if generic_make_request is currently active in this | |
1144 | * task or not. If it is NULL, then no make_request is active. If | |
1145 | * it is non-NULL, then a make_request is active, and new requests | |
1146 | * should be added at the tail | |
1147 | */ | |
bddd87c7 | 1148 | if (current->bio_list) { |
f5fe1b51 | 1149 | bio_list_add(¤t->bio_list[0], bio); |
dece1635 | 1150 | goto out; |
d89d8796 | 1151 | } |
27a84d54 | 1152 | |
d89d8796 NB |
1153 | /* following loop may be a bit non-obvious, and so deserves some |
1154 | * explanation. | |
1155 | * Before entering the loop, bio->bi_next is NULL (as all callers | |
1156 | * ensure that) so we have a list with a single bio. | |
1157 | * We pretend that we have just taken it off a longer list, so | |
bddd87c7 AM |
1158 | * we assign bio_list to a pointer to the bio_list_on_stack, |
1159 | * thus initialising the bio_list of new bios to be | |
27a84d54 | 1160 | * added. ->make_request() may indeed add some more bios |
d89d8796 NB |
1161 | * through a recursive call to generic_make_request. If it |
1162 | * did, we find a non-NULL value in bio_list and re-enter the loop | |
1163 | * from the top. In this case we really did just take the bio | |
bddd87c7 | 1164 | * of the top of the list (no pretending) and so remove it from |
27a84d54 | 1165 | * bio_list, and call into ->make_request() again. |
d89d8796 NB |
1166 | */ |
1167 | BUG_ON(bio->bi_next); | |
f5fe1b51 N |
1168 | bio_list_init(&bio_list_on_stack[0]); |
1169 | current->bio_list = bio_list_on_stack; | |
d89d8796 | 1170 | do { |
fe200864 | 1171 | struct request_queue *q = bio->bi_disk->queue; |
27a84d54 | 1172 | |
accea322 | 1173 | if (likely(bio_queue_enter(bio) == 0)) { |
79bd9959 N |
1174 | struct bio_list lower, same; |
1175 | ||
1176 | /* Create a fresh bio_list for all subordinate requests */ | |
f5fe1b51 N |
1177 | bio_list_on_stack[1] = bio_list_on_stack[0]; |
1178 | bio_list_init(&bio_list_on_stack[0]); | |
ac7c5675 | 1179 | ret = do_make_request(bio); |
fe200864 | 1180 | |
79bd9959 N |
1181 | /* sort new bios into those for a lower level |
1182 | * and those for the same level | |
1183 | */ | |
1184 | bio_list_init(&lower); | |
1185 | bio_list_init(&same); | |
f5fe1b51 | 1186 | while ((bio = bio_list_pop(&bio_list_on_stack[0])) != NULL) |
74d46992 | 1187 | if (q == bio->bi_disk->queue) |
79bd9959 N |
1188 | bio_list_add(&same, bio); |
1189 | else | |
1190 | bio_list_add(&lower, bio); | |
1191 | /* now assemble so we handle the lowest level first */ | |
f5fe1b51 N |
1192 | bio_list_merge(&bio_list_on_stack[0], &lower); |
1193 | bio_list_merge(&bio_list_on_stack[0], &same); | |
1194 | bio_list_merge(&bio_list_on_stack[0], &bio_list_on_stack[1]); | |
3ef28e83 | 1195 | } |
f5fe1b51 | 1196 | bio = bio_list_pop(&bio_list_on_stack[0]); |
d89d8796 | 1197 | } while (bio); |
bddd87c7 | 1198 | current->bio_list = NULL; /* deactivate */ |
dece1635 JA |
1199 | |
1200 | out: | |
1201 | return ret; | |
d89d8796 | 1202 | } |
1da177e4 LT |
1203 | EXPORT_SYMBOL(generic_make_request); |
1204 | ||
f421e1d9 CH |
1205 | /** |
1206 | * direct_make_request - hand a buffer directly to its device driver for I/O | |
1207 | * @bio: The bio describing the location in memory and on the device. | |
1208 | * | |
1209 | * This function behaves like generic_make_request(), but does not protect | |
1210 | * against recursion. Must only be used if the called driver is known | |
8cf7961d | 1211 | * to be blk-mq based. |
f421e1d9 CH |
1212 | */ |
1213 | blk_qc_t direct_make_request(struct bio *bio) | |
1214 | { | |
1215 | struct request_queue *q = bio->bi_disk->queue; | |
f421e1d9 | 1216 | |
accea322 CH |
1217 | if (WARN_ON_ONCE(q->make_request_fn)) { |
1218 | bio_io_error(bio); | |
f421e1d9 | 1219 | return BLK_QC_T_NONE; |
f421e1d9 | 1220 | } |
f421e1d9 CH |
1221 | if (!generic_make_request_checks(bio)) |
1222 | return BLK_QC_T_NONE; | |
accea322 CH |
1223 | if (unlikely(bio_queue_enter(bio))) |
1224 | return BLK_QC_T_NONE; | |
ac7c5675 CH |
1225 | if (!blk_crypto_bio_prep(&bio)) { |
1226 | blk_queue_exit(q); | |
f421e1d9 CH |
1227 | return BLK_QC_T_NONE; |
1228 | } | |
ac7c5675 | 1229 | return blk_mq_make_request(q, bio); |
f421e1d9 CH |
1230 | } |
1231 | EXPORT_SYMBOL_GPL(direct_make_request); | |
1232 | ||
1da177e4 | 1233 | /** |
710027a4 | 1234 | * submit_bio - submit a bio to the block device layer for I/O |
1da177e4 LT |
1235 | * @bio: The &struct bio which describes the I/O |
1236 | * | |
3fdd4086 CH |
1237 | * submit_bio() is used to submit I/O requests to block devices. It is passed a |
1238 | * fully set up &struct bio that describes the I/O that needs to be done. The | |
1239 | * bio will be send to the device described by the bi_disk and bi_partno fields. | |
1da177e4 | 1240 | * |
3fdd4086 CH |
1241 | * The success/failure status of the request, along with notification of |
1242 | * completion, is delivered asynchronously through the ->bi_end_io() callback | |
1243 | * in @bio. The bio must NOT be touched by thecaller until ->bi_end_io() has | |
1244 | * been called. | |
1da177e4 | 1245 | */ |
4e49ea4a | 1246 | blk_qc_t submit_bio(struct bio *bio) |
1da177e4 | 1247 | { |
d3f77dfd TH |
1248 | if (blkcg_punt_bio_submit(bio)) |
1249 | return BLK_QC_T_NONE; | |
1250 | ||
bf2de6f5 JA |
1251 | /* |
1252 | * If it's a regular read/write or a barrier with data attached, | |
1253 | * go through the normal accounting stuff before submission. | |
1254 | */ | |
e2a60da7 | 1255 | if (bio_has_data(bio)) { |
4363ac7c MP |
1256 | unsigned int count; |
1257 | ||
95fe6c1a | 1258 | if (unlikely(bio_op(bio) == REQ_OP_WRITE_SAME)) |
7c5a0dcf | 1259 | count = queue_logical_block_size(bio->bi_disk->queue) >> 9; |
4363ac7c MP |
1260 | else |
1261 | count = bio_sectors(bio); | |
1262 | ||
a8ebb056 | 1263 | if (op_is_write(bio_op(bio))) { |
bf2de6f5 JA |
1264 | count_vm_events(PGPGOUT, count); |
1265 | } else { | |
4f024f37 | 1266 | task_io_account_read(bio->bi_iter.bi_size); |
bf2de6f5 JA |
1267 | count_vm_events(PGPGIN, count); |
1268 | } | |
1269 | ||
1270 | if (unlikely(block_dump)) { | |
1271 | char b[BDEVNAME_SIZE]; | |
8dcbdc74 | 1272 | printk(KERN_DEBUG "%s(%d): %s block %Lu on %s (%u sectors)\n", |
ba25f9dc | 1273 | current->comm, task_pid_nr(current), |
a8ebb056 | 1274 | op_is_write(bio_op(bio)) ? "WRITE" : "READ", |
4f024f37 | 1275 | (unsigned long long)bio->bi_iter.bi_sector, |
74d46992 | 1276 | bio_devname(bio, b), count); |
bf2de6f5 | 1277 | } |
1da177e4 LT |
1278 | } |
1279 | ||
b8e24a93 | 1280 | /* |
760f83ea CH |
1281 | * If we're reading data that is part of the userspace workingset, count |
1282 | * submission time as memory stall. When the device is congested, or | |
1283 | * the submitting cgroup IO-throttled, submission can be a significant | |
1284 | * part of overall IO time. | |
b8e24a93 | 1285 | */ |
760f83ea CH |
1286 | if (unlikely(bio_op(bio) == REQ_OP_READ && |
1287 | bio_flagged(bio, BIO_WORKINGSET))) { | |
1288 | unsigned long pflags; | |
1289 | blk_qc_t ret; | |
b8e24a93 | 1290 | |
760f83ea CH |
1291 | psi_memstall_enter(&pflags); |
1292 | ret = generic_make_request(bio); | |
b8e24a93 JW |
1293 | psi_memstall_leave(&pflags); |
1294 | ||
760f83ea CH |
1295 | return ret; |
1296 | } | |
1297 | ||
1298 | return generic_make_request(bio); | |
1da177e4 | 1299 | } |
1da177e4 LT |
1300 | EXPORT_SYMBOL(submit_bio); |
1301 | ||
82124d60 | 1302 | /** |
bf4e6b4e | 1303 | * blk_cloned_rq_check_limits - Helper function to check a cloned request |
0d720318 | 1304 | * for the new queue limits |
82124d60 KU |
1305 | * @q: the queue |
1306 | * @rq: the request being checked | |
1307 | * | |
1308 | * Description: | |
1309 | * @rq may have been made based on weaker limitations of upper-level queues | |
1310 | * in request stacking drivers, and it may violate the limitation of @q. | |
1311 | * Since the block layer and the underlying device driver trust @rq | |
1312 | * after it is inserted to @q, it should be checked against @q before | |
1313 | * the insertion using this generic function. | |
1314 | * | |
82124d60 | 1315 | * Request stacking drivers like request-based dm may change the queue |
bf4e6b4e HR |
1316 | * limits when retrying requests on other queues. Those requests need |
1317 | * to be checked against the new queue limits again during dispatch. | |
82124d60 | 1318 | */ |
bf4e6b4e HR |
1319 | static int blk_cloned_rq_check_limits(struct request_queue *q, |
1320 | struct request *rq) | |
82124d60 | 1321 | { |
8fe0d473 | 1322 | if (blk_rq_sectors(rq) > blk_queue_get_max_sectors(q, req_op(rq))) { |
61939b12 JP |
1323 | printk(KERN_ERR "%s: over max size limit. (%u > %u)\n", |
1324 | __func__, blk_rq_sectors(rq), | |
1325 | blk_queue_get_max_sectors(q, req_op(rq))); | |
82124d60 KU |
1326 | return -EIO; |
1327 | } | |
1328 | ||
1329 | /* | |
1330 | * queue's settings related to segment counting like q->bounce_pfn | |
1331 | * may differ from that of other stacking queues. | |
1332 | * Recalculate it to check the request correctly on this queue's | |
1333 | * limitation. | |
1334 | */ | |
e9cd19c0 | 1335 | rq->nr_phys_segments = blk_recalc_rq_segments(rq); |
8a78362c | 1336 | if (rq->nr_phys_segments > queue_max_segments(q)) { |
61939b12 JP |
1337 | printk(KERN_ERR "%s: over max segments limit. (%hu > %hu)\n", |
1338 | __func__, rq->nr_phys_segments, queue_max_segments(q)); | |
82124d60 KU |
1339 | return -EIO; |
1340 | } | |
1341 | ||
1342 | return 0; | |
1343 | } | |
82124d60 KU |
1344 | |
1345 | /** | |
1346 | * blk_insert_cloned_request - Helper for stacking drivers to submit a request | |
1347 | * @q: the queue to submit the request | |
1348 | * @rq: the request being queued | |
1349 | */ | |
2a842aca | 1350 | blk_status_t blk_insert_cloned_request(struct request_queue *q, struct request *rq) |
82124d60 | 1351 | { |
bf4e6b4e | 1352 | if (blk_cloned_rq_check_limits(q, rq)) |
2a842aca | 1353 | return BLK_STS_IOERR; |
82124d60 | 1354 | |
b2c9cd37 AM |
1355 | if (rq->rq_disk && |
1356 | should_fail_request(&rq->rq_disk->part0, blk_rq_bytes(rq))) | |
2a842aca | 1357 | return BLK_STS_IOERR; |
82124d60 | 1358 | |
a892c8d5 ST |
1359 | if (blk_crypto_insert_cloned_request(rq)) |
1360 | return BLK_STS_IOERR; | |
1361 | ||
a1ce35fa | 1362 | if (blk_queue_io_stat(q)) |
b5af37ab | 1363 | blk_account_io_start(rq); |
82124d60 KU |
1364 | |
1365 | /* | |
a1ce35fa JA |
1366 | * Since we have a scheduler attached on the top device, |
1367 | * bypass a potential scheduler on the bottom device for | |
1368 | * insert. | |
82124d60 | 1369 | */ |
fd9c40f6 | 1370 | return blk_mq_request_issue_directly(rq, true); |
82124d60 KU |
1371 | } |
1372 | EXPORT_SYMBOL_GPL(blk_insert_cloned_request); | |
1373 | ||
80a761fd TH |
1374 | /** |
1375 | * blk_rq_err_bytes - determine number of bytes till the next failure boundary | |
1376 | * @rq: request to examine | |
1377 | * | |
1378 | * Description: | |
1379 | * A request could be merge of IOs which require different failure | |
1380 | * handling. This function determines the number of bytes which | |
1381 | * can be failed from the beginning of the request without | |
1382 | * crossing into area which need to be retried further. | |
1383 | * | |
1384 | * Return: | |
1385 | * The number of bytes to fail. | |
80a761fd TH |
1386 | */ |
1387 | unsigned int blk_rq_err_bytes(const struct request *rq) | |
1388 | { | |
1389 | unsigned int ff = rq->cmd_flags & REQ_FAILFAST_MASK; | |
1390 | unsigned int bytes = 0; | |
1391 | struct bio *bio; | |
1392 | ||
e8064021 | 1393 | if (!(rq->rq_flags & RQF_MIXED_MERGE)) |
80a761fd TH |
1394 | return blk_rq_bytes(rq); |
1395 | ||
1396 | /* | |
1397 | * Currently the only 'mixing' which can happen is between | |
1398 | * different fastfail types. We can safely fail portions | |
1399 | * which have all the failfast bits that the first one has - | |
1400 | * the ones which are at least as eager to fail as the first | |
1401 | * one. | |
1402 | */ | |
1403 | for (bio = rq->bio; bio; bio = bio->bi_next) { | |
1eff9d32 | 1404 | if ((bio->bi_opf & ff) != ff) |
80a761fd | 1405 | break; |
4f024f37 | 1406 | bytes += bio->bi_iter.bi_size; |
80a761fd TH |
1407 | } |
1408 | ||
1409 | /* this could lead to infinite loop */ | |
1410 | BUG_ON(blk_rq_bytes(rq) && !bytes); | |
1411 | return bytes; | |
1412 | } | |
1413 | EXPORT_SYMBOL_GPL(blk_rq_err_bytes); | |
1414 | ||
9123bf6f CH |
1415 | static void update_io_ticks(struct hd_struct *part, unsigned long now, bool end) |
1416 | { | |
1417 | unsigned long stamp; | |
1418 | again: | |
1419 | stamp = READ_ONCE(part->stamp); | |
1420 | if (unlikely(stamp != now)) { | |
1421 | if (likely(cmpxchg(&part->stamp, stamp, now) == stamp)) | |
1422 | __part_stat_add(part, io_ticks, end ? now - stamp : 1); | |
1423 | } | |
1424 | if (part->partno) { | |
1425 | part = &part_to_disk(part)->part0; | |
1426 | goto again; | |
1427 | } | |
1428 | } | |
1429 | ||
f1394b79 | 1430 | static void blk_account_io_completion(struct request *req, unsigned int bytes) |
bc58ba94 | 1431 | { |
ecb6186c | 1432 | if (req->part && blk_do_io_stat(req)) { |
ddcf35d3 | 1433 | const int sgrp = op_stat_group(req_op(req)); |
bc58ba94 | 1434 | struct hd_struct *part; |
bc58ba94 | 1435 | |
112f158f | 1436 | part_stat_lock(); |
09e099d4 | 1437 | part = req->part; |
112f158f | 1438 | part_stat_add(part, sectors[sgrp], bytes >> 9); |
bc58ba94 JA |
1439 | part_stat_unlock(); |
1440 | } | |
1441 | } | |
1442 | ||
522a7775 | 1443 | void blk_account_io_done(struct request *req, u64 now) |
bc58ba94 | 1444 | { |
bc58ba94 | 1445 | /* |
dd4c133f TH |
1446 | * Account IO completion. flush_rq isn't accounted as a |
1447 | * normal IO on queueing nor completion. Accounting the | |
1448 | * containing request is enough. | |
bc58ba94 | 1449 | */ |
ecb6186c LG |
1450 | if (req->part && blk_do_io_stat(req) && |
1451 | !(req->rq_flags & RQF_FLUSH_SEQ)) { | |
ddcf35d3 | 1452 | const int sgrp = op_stat_group(req_op(req)); |
bc58ba94 | 1453 | struct hd_struct *part; |
bc58ba94 | 1454 | |
112f158f | 1455 | part_stat_lock(); |
09e099d4 | 1456 | part = req->part; |
bc58ba94 | 1457 | |
2b8bd423 | 1458 | update_io_ticks(part, jiffies, true); |
112f158f MS |
1459 | part_stat_inc(part, ios[sgrp]); |
1460 | part_stat_add(part, nsecs[sgrp], now - req->start_time_ns); | |
524f9ffd | 1461 | part_stat_unlock(); |
bc58ba94 | 1462 | |
6c23a968 | 1463 | hd_struct_put(part); |
bc58ba94 JA |
1464 | } |
1465 | } | |
1466 | ||
b5af37ab | 1467 | void blk_account_io_start(struct request *rq) |
320ae51f | 1468 | { |
320ae51f JA |
1469 | if (!blk_do_io_stat(rq)) |
1470 | return; | |
1471 | ||
b5af37ab | 1472 | rq->part = disk_map_sector_rcu(rq->rq_disk, blk_rq_pos(rq)); |
524f9ffd | 1473 | |
112f158f | 1474 | part_stat_lock(); |
76268f3a | 1475 | update_io_ticks(rq->part, jiffies, false); |
320ae51f JA |
1476 | part_stat_unlock(); |
1477 | } | |
320ae51f | 1478 | |
956d510e CH |
1479 | unsigned long disk_start_io_acct(struct gendisk *disk, unsigned int sectors, |
1480 | unsigned int op) | |
1481 | { | |
1482 | struct hd_struct *part = &disk->part0; | |
1483 | const int sgrp = op_stat_group(op); | |
1484 | unsigned long now = READ_ONCE(jiffies); | |
1485 | ||
1486 | part_stat_lock(); | |
1487 | update_io_ticks(part, now, false); | |
1488 | part_stat_inc(part, ios[sgrp]); | |
1489 | part_stat_add(part, sectors[sgrp], sectors); | |
1490 | part_stat_local_inc(part, in_flight[op_is_write(op)]); | |
1491 | part_stat_unlock(); | |
320ae51f | 1492 | |
956d510e CH |
1493 | return now; |
1494 | } | |
1495 | EXPORT_SYMBOL(disk_start_io_acct); | |
1496 | ||
1497 | void disk_end_io_acct(struct gendisk *disk, unsigned int op, | |
1498 | unsigned long start_time) | |
1499 | { | |
1500 | struct hd_struct *part = &disk->part0; | |
1501 | const int sgrp = op_stat_group(op); | |
1502 | unsigned long now = READ_ONCE(jiffies); | |
1503 | unsigned long duration = now - start_time; | |
5b18b5a7 | 1504 | |
956d510e CH |
1505 | part_stat_lock(); |
1506 | update_io_ticks(part, now, true); | |
1507 | part_stat_add(part, nsecs[sgrp], jiffies_to_nsecs(duration)); | |
1508 | part_stat_local_dec(part, in_flight[op_is_write(op)]); | |
320ae51f JA |
1509 | part_stat_unlock(); |
1510 | } | |
956d510e | 1511 | EXPORT_SYMBOL(disk_end_io_acct); |
320ae51f | 1512 | |
ef71de8b CH |
1513 | /* |
1514 | * Steal bios from a request and add them to a bio list. | |
1515 | * The request must not have been partially completed before. | |
1516 | */ | |
1517 | void blk_steal_bios(struct bio_list *list, struct request *rq) | |
1518 | { | |
1519 | if (rq->bio) { | |
1520 | if (list->tail) | |
1521 | list->tail->bi_next = rq->bio; | |
1522 | else | |
1523 | list->head = rq->bio; | |
1524 | list->tail = rq->biotail; | |
1525 | ||
1526 | rq->bio = NULL; | |
1527 | rq->biotail = NULL; | |
1528 | } | |
1529 | ||
1530 | rq->__data_len = 0; | |
1531 | } | |
1532 | EXPORT_SYMBOL_GPL(blk_steal_bios); | |
1533 | ||
3bcddeac | 1534 | /** |
2e60e022 | 1535 | * blk_update_request - Special helper function for request stacking drivers |
8ebf9756 | 1536 | * @req: the request being processed |
2a842aca | 1537 | * @error: block status code |
8ebf9756 | 1538 | * @nr_bytes: number of bytes to complete @req |
3bcddeac KU |
1539 | * |
1540 | * Description: | |
8ebf9756 RD |
1541 | * Ends I/O on a number of bytes attached to @req, but doesn't complete |
1542 | * the request structure even if @req doesn't have leftover. | |
1543 | * If @req has leftover, sets it up for the next range of segments. | |
2e60e022 TH |
1544 | * |
1545 | * This special helper function is only for request stacking drivers | |
1546 | * (e.g. request-based dm) so that they can handle partial completion. | |
3a211b71 | 1547 | * Actual device drivers should use blk_mq_end_request instead. |
2e60e022 TH |
1548 | * |
1549 | * Passing the result of blk_rq_bytes() as @nr_bytes guarantees | |
1550 | * %false return from this function. | |
3bcddeac | 1551 | * |
1954e9a9 BVA |
1552 | * Note: |
1553 | * The RQF_SPECIAL_PAYLOAD flag is ignored on purpose in both | |
1554 | * blk_rq_bytes() and in blk_update_request(). | |
1555 | * | |
3bcddeac | 1556 | * Return: |
2e60e022 TH |
1557 | * %false - this request doesn't have any more data |
1558 | * %true - this request has more data | |
3bcddeac | 1559 | **/ |
2a842aca CH |
1560 | bool blk_update_request(struct request *req, blk_status_t error, |
1561 | unsigned int nr_bytes) | |
1da177e4 | 1562 | { |
f79ea416 | 1563 | int total_bytes; |
1da177e4 | 1564 | |
2a842aca | 1565 | trace_block_rq_complete(req, blk_status_to_errno(error), nr_bytes); |
4a0efdc9 | 1566 | |
2e60e022 TH |
1567 | if (!req->bio) |
1568 | return false; | |
1569 | ||
54d4e6ab MG |
1570 | #ifdef CONFIG_BLK_DEV_INTEGRITY |
1571 | if (blk_integrity_rq(req) && req_op(req) == REQ_OP_READ && | |
1572 | error == BLK_STS_OK) | |
1573 | req->q->integrity.profile->complete_fn(req, nr_bytes); | |
1574 | #endif | |
1575 | ||
2a842aca CH |
1576 | if (unlikely(error && !blk_rq_is_passthrough(req) && |
1577 | !(req->rq_flags & RQF_QUIET))) | |
178cc590 | 1578 | print_req_error(req, error, __func__); |
1da177e4 | 1579 | |
bc58ba94 | 1580 | blk_account_io_completion(req, nr_bytes); |
d72d904a | 1581 | |
f79ea416 KO |
1582 | total_bytes = 0; |
1583 | while (req->bio) { | |
1584 | struct bio *bio = req->bio; | |
4f024f37 | 1585 | unsigned bio_bytes = min(bio->bi_iter.bi_size, nr_bytes); |
1da177e4 | 1586 | |
9c24c10a | 1587 | if (bio_bytes == bio->bi_iter.bi_size) |
1da177e4 | 1588 | req->bio = bio->bi_next; |
1da177e4 | 1589 | |
fbbaf700 N |
1590 | /* Completion has already been traced */ |
1591 | bio_clear_flag(bio, BIO_TRACE_COMPLETION); | |
f79ea416 | 1592 | req_bio_endio(req, bio, bio_bytes, error); |
1da177e4 | 1593 | |
f79ea416 KO |
1594 | total_bytes += bio_bytes; |
1595 | nr_bytes -= bio_bytes; | |
1da177e4 | 1596 | |
f79ea416 KO |
1597 | if (!nr_bytes) |
1598 | break; | |
1da177e4 LT |
1599 | } |
1600 | ||
1601 | /* | |
1602 | * completely done | |
1603 | */ | |
2e60e022 TH |
1604 | if (!req->bio) { |
1605 | /* | |
1606 | * Reset counters so that the request stacking driver | |
1607 | * can find how many bytes remain in the request | |
1608 | * later. | |
1609 | */ | |
a2dec7b3 | 1610 | req->__data_len = 0; |
2e60e022 TH |
1611 | return false; |
1612 | } | |
1da177e4 | 1613 | |
a2dec7b3 | 1614 | req->__data_len -= total_bytes; |
2e46e8b2 TH |
1615 | |
1616 | /* update sector only for requests with clear definition of sector */ | |
57292b58 | 1617 | if (!blk_rq_is_passthrough(req)) |
a2dec7b3 | 1618 | req->__sector += total_bytes >> 9; |
2e46e8b2 | 1619 | |
80a761fd | 1620 | /* mixed attributes always follow the first bio */ |
e8064021 | 1621 | if (req->rq_flags & RQF_MIXED_MERGE) { |
80a761fd | 1622 | req->cmd_flags &= ~REQ_FAILFAST_MASK; |
1eff9d32 | 1623 | req->cmd_flags |= req->bio->bi_opf & REQ_FAILFAST_MASK; |
80a761fd TH |
1624 | } |
1625 | ||
ed6565e7 CH |
1626 | if (!(req->rq_flags & RQF_SPECIAL_PAYLOAD)) { |
1627 | /* | |
1628 | * If total number of sectors is less than the first segment | |
1629 | * size, something has gone terribly wrong. | |
1630 | */ | |
1631 | if (blk_rq_bytes(req) < blk_rq_cur_bytes(req)) { | |
1632 | blk_dump_rq_flags(req, "request botched"); | |
1633 | req->__data_len = blk_rq_cur_bytes(req); | |
1634 | } | |
2e46e8b2 | 1635 | |
ed6565e7 | 1636 | /* recalculate the number of segments */ |
e9cd19c0 | 1637 | req->nr_phys_segments = blk_recalc_rq_segments(req); |
ed6565e7 | 1638 | } |
2e46e8b2 | 1639 | |
2e60e022 | 1640 | return true; |
1da177e4 | 1641 | } |
2e60e022 | 1642 | EXPORT_SYMBOL_GPL(blk_update_request); |
1da177e4 | 1643 | |
2d4dc890 IL |
1644 | #if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE |
1645 | /** | |
1646 | * rq_flush_dcache_pages - Helper function to flush all pages in a request | |
1647 | * @rq: the request to be flushed | |
1648 | * | |
1649 | * Description: | |
1650 | * Flush all pages in @rq. | |
1651 | */ | |
1652 | void rq_flush_dcache_pages(struct request *rq) | |
1653 | { | |
1654 | struct req_iterator iter; | |
7988613b | 1655 | struct bio_vec bvec; |
2d4dc890 IL |
1656 | |
1657 | rq_for_each_segment(bvec, rq, iter) | |
7988613b | 1658 | flush_dcache_page(bvec.bv_page); |
2d4dc890 IL |
1659 | } |
1660 | EXPORT_SYMBOL_GPL(rq_flush_dcache_pages); | |
1661 | #endif | |
1662 | ||
ef9e3fac KU |
1663 | /** |
1664 | * blk_lld_busy - Check if underlying low-level drivers of a device are busy | |
1665 | * @q : the queue of the device being checked | |
1666 | * | |
1667 | * Description: | |
1668 | * Check if underlying low-level drivers of a device are busy. | |
1669 | * If the drivers want to export their busy state, they must set own | |
1670 | * exporting function using blk_queue_lld_busy() first. | |
1671 | * | |
1672 | * Basically, this function is used only by request stacking drivers | |
1673 | * to stop dispatching requests to underlying devices when underlying | |
1674 | * devices are busy. This behavior helps more I/O merging on the queue | |
1675 | * of the request stacking driver and prevents I/O throughput regression | |
1676 | * on burst I/O load. | |
1677 | * | |
1678 | * Return: | |
1679 | * 0 - Not busy (The request stacking driver should dispatch request) | |
1680 | * 1 - Busy (The request stacking driver should stop dispatching request) | |
1681 | */ | |
1682 | int blk_lld_busy(struct request_queue *q) | |
1683 | { | |
344e9ffc | 1684 | if (queue_is_mq(q) && q->mq_ops->busy) |
9ba20527 | 1685 | return q->mq_ops->busy(q); |
ef9e3fac KU |
1686 | |
1687 | return 0; | |
1688 | } | |
1689 | EXPORT_SYMBOL_GPL(blk_lld_busy); | |
1690 | ||
78d8e58a MS |
1691 | /** |
1692 | * blk_rq_unprep_clone - Helper function to free all bios in a cloned request | |
1693 | * @rq: the clone request to be cleaned up | |
1694 | * | |
1695 | * Description: | |
1696 | * Free all bios in @rq for a cloned request. | |
1697 | */ | |
1698 | void blk_rq_unprep_clone(struct request *rq) | |
1699 | { | |
1700 | struct bio *bio; | |
1701 | ||
1702 | while ((bio = rq->bio) != NULL) { | |
1703 | rq->bio = bio->bi_next; | |
1704 | ||
1705 | bio_put(bio); | |
1706 | } | |
1707 | } | |
1708 | EXPORT_SYMBOL_GPL(blk_rq_unprep_clone); | |
1709 | ||
78d8e58a MS |
1710 | /** |
1711 | * blk_rq_prep_clone - Helper function to setup clone request | |
1712 | * @rq: the request to be setup | |
1713 | * @rq_src: original request to be cloned | |
1714 | * @bs: bio_set that bios for clone are allocated from | |
1715 | * @gfp_mask: memory allocation mask for bio | |
1716 | * @bio_ctr: setup function to be called for each clone bio. | |
1717 | * Returns %0 for success, non %0 for failure. | |
1718 | * @data: private data to be passed to @bio_ctr | |
1719 | * | |
1720 | * Description: | |
1721 | * Clones bios in @rq_src to @rq, and copies attributes of @rq_src to @rq. | |
78d8e58a MS |
1722 | * Also, pages which the original bios are pointing to are not copied |
1723 | * and the cloned bios just point same pages. | |
1724 | * So cloned bios must be completed before original bios, which means | |
1725 | * the caller must complete @rq before @rq_src. | |
1726 | */ | |
1727 | int blk_rq_prep_clone(struct request *rq, struct request *rq_src, | |
1728 | struct bio_set *bs, gfp_t gfp_mask, | |
1729 | int (*bio_ctr)(struct bio *, struct bio *, void *), | |
1730 | void *data) | |
1731 | { | |
1732 | struct bio *bio, *bio_src; | |
1733 | ||
1734 | if (!bs) | |
f4f8154a | 1735 | bs = &fs_bio_set; |
78d8e58a MS |
1736 | |
1737 | __rq_for_each_bio(bio_src, rq_src) { | |
1738 | bio = bio_clone_fast(bio_src, gfp_mask, bs); | |
1739 | if (!bio) | |
1740 | goto free_and_out; | |
1741 | ||
1742 | if (bio_ctr && bio_ctr(bio, bio_src, data)) | |
1743 | goto free_and_out; | |
1744 | ||
1745 | if (rq->bio) { | |
1746 | rq->biotail->bi_next = bio; | |
1747 | rq->biotail = bio; | |
1748 | } else | |
1749 | rq->bio = rq->biotail = bio; | |
1750 | } | |
1751 | ||
361301a2 GJ |
1752 | /* Copy attributes of the original request to the clone request. */ |
1753 | rq->__sector = blk_rq_pos(rq_src); | |
1754 | rq->__data_len = blk_rq_bytes(rq_src); | |
1755 | if (rq_src->rq_flags & RQF_SPECIAL_PAYLOAD) { | |
1756 | rq->rq_flags |= RQF_SPECIAL_PAYLOAD; | |
1757 | rq->special_vec = rq_src->special_vec; | |
1758 | } | |
1759 | rq->nr_phys_segments = rq_src->nr_phys_segments; | |
1760 | rq->ioprio = rq_src->ioprio; | |
78d8e58a | 1761 | |
a892c8d5 ST |
1762 | if (rq->bio) |
1763 | blk_crypto_rq_bio_prep(rq, rq->bio, gfp_mask); | |
78d8e58a MS |
1764 | |
1765 | return 0; | |
1766 | ||
1767 | free_and_out: | |
1768 | if (bio) | |
1769 | bio_put(bio); | |
1770 | blk_rq_unprep_clone(rq); | |
1771 | ||
1772 | return -ENOMEM; | |
b0fd271d KU |
1773 | } |
1774 | EXPORT_SYMBOL_GPL(blk_rq_prep_clone); | |
1775 | ||
59c3d45e | 1776 | int kblockd_schedule_work(struct work_struct *work) |
1da177e4 LT |
1777 | { |
1778 | return queue_work(kblockd_workqueue, work); | |
1779 | } | |
1da177e4 LT |
1780 | EXPORT_SYMBOL(kblockd_schedule_work); |
1781 | ||
818cd1cb JA |
1782 | int kblockd_mod_delayed_work_on(int cpu, struct delayed_work *dwork, |
1783 | unsigned long delay) | |
1784 | { | |
1785 | return mod_delayed_work_on(cpu, kblockd_workqueue, dwork, delay); | |
1786 | } | |
1787 | EXPORT_SYMBOL(kblockd_mod_delayed_work_on); | |
1788 | ||
75df7136 SJ |
1789 | /** |
1790 | * blk_start_plug - initialize blk_plug and track it inside the task_struct | |
1791 | * @plug: The &struct blk_plug that needs to be initialized | |
1792 | * | |
1793 | * Description: | |
40405851 JM |
1794 | * blk_start_plug() indicates to the block layer an intent by the caller |
1795 | * to submit multiple I/O requests in a batch. The block layer may use | |
1796 | * this hint to defer submitting I/Os from the caller until blk_finish_plug() | |
1797 | * is called. However, the block layer may choose to submit requests | |
1798 | * before a call to blk_finish_plug() if the number of queued I/Os | |
1799 | * exceeds %BLK_MAX_REQUEST_COUNT, or if the size of the I/O is larger than | |
1800 | * %BLK_PLUG_FLUSH_SIZE. The queued I/Os may also be submitted early if | |
1801 | * the task schedules (see below). | |
1802 | * | |
75df7136 SJ |
1803 | * Tracking blk_plug inside the task_struct will help with auto-flushing the |
1804 | * pending I/O should the task end up blocking between blk_start_plug() and | |
1805 | * blk_finish_plug(). This is important from a performance perspective, but | |
1806 | * also ensures that we don't deadlock. For instance, if the task is blocking | |
1807 | * for a memory allocation, memory reclaim could end up wanting to free a | |
1808 | * page belonging to that request that is currently residing in our private | |
1809 | * plug. By flushing the pending I/O when the process goes to sleep, we avoid | |
1810 | * this kind of deadlock. | |
1811 | */ | |
73c10101 JA |
1812 | void blk_start_plug(struct blk_plug *plug) |
1813 | { | |
1814 | struct task_struct *tsk = current; | |
1815 | ||
dd6cf3e1 SL |
1816 | /* |
1817 | * If this is a nested plug, don't actually assign it. | |
1818 | */ | |
1819 | if (tsk->plug) | |
1820 | return; | |
1821 | ||
320ae51f | 1822 | INIT_LIST_HEAD(&plug->mq_list); |
048c9374 | 1823 | INIT_LIST_HEAD(&plug->cb_list); |
5f0ed774 | 1824 | plug->rq_count = 0; |
ce5b009c | 1825 | plug->multiple_queues = false; |
5f0ed774 | 1826 | |
73c10101 | 1827 | /* |
dd6cf3e1 SL |
1828 | * Store ordering should not be needed here, since a potential |
1829 | * preempt will imply a full memory barrier | |
73c10101 | 1830 | */ |
dd6cf3e1 | 1831 | tsk->plug = plug; |
73c10101 JA |
1832 | } |
1833 | EXPORT_SYMBOL(blk_start_plug); | |
1834 | ||
74018dc3 | 1835 | static void flush_plug_callbacks(struct blk_plug *plug, bool from_schedule) |
048c9374 N |
1836 | { |
1837 | LIST_HEAD(callbacks); | |
1838 | ||
2a7d5559 SL |
1839 | while (!list_empty(&plug->cb_list)) { |
1840 | list_splice_init(&plug->cb_list, &callbacks); | |
048c9374 | 1841 | |
2a7d5559 SL |
1842 | while (!list_empty(&callbacks)) { |
1843 | struct blk_plug_cb *cb = list_first_entry(&callbacks, | |
048c9374 N |
1844 | struct blk_plug_cb, |
1845 | list); | |
2a7d5559 | 1846 | list_del(&cb->list); |
74018dc3 | 1847 | cb->callback(cb, from_schedule); |
2a7d5559 | 1848 | } |
048c9374 N |
1849 | } |
1850 | } | |
1851 | ||
9cbb1750 N |
1852 | struct blk_plug_cb *blk_check_plugged(blk_plug_cb_fn unplug, void *data, |
1853 | int size) | |
1854 | { | |
1855 | struct blk_plug *plug = current->plug; | |
1856 | struct blk_plug_cb *cb; | |
1857 | ||
1858 | if (!plug) | |
1859 | return NULL; | |
1860 | ||
1861 | list_for_each_entry(cb, &plug->cb_list, list) | |
1862 | if (cb->callback == unplug && cb->data == data) | |
1863 | return cb; | |
1864 | ||
1865 | /* Not currently on the callback list */ | |
1866 | BUG_ON(size < sizeof(*cb)); | |
1867 | cb = kzalloc(size, GFP_ATOMIC); | |
1868 | if (cb) { | |
1869 | cb->data = data; | |
1870 | cb->callback = unplug; | |
1871 | list_add(&cb->list, &plug->cb_list); | |
1872 | } | |
1873 | return cb; | |
1874 | } | |
1875 | EXPORT_SYMBOL(blk_check_plugged); | |
1876 | ||
49cac01e | 1877 | void blk_flush_plug_list(struct blk_plug *plug, bool from_schedule) |
73c10101 | 1878 | { |
74018dc3 | 1879 | flush_plug_callbacks(plug, from_schedule); |
320ae51f JA |
1880 | |
1881 | if (!list_empty(&plug->mq_list)) | |
1882 | blk_mq_flush_plug_list(plug, from_schedule); | |
73c10101 | 1883 | } |
73c10101 | 1884 | |
40405851 JM |
1885 | /** |
1886 | * blk_finish_plug - mark the end of a batch of submitted I/O | |
1887 | * @plug: The &struct blk_plug passed to blk_start_plug() | |
1888 | * | |
1889 | * Description: | |
1890 | * Indicate that a batch of I/O submissions is complete. This function | |
1891 | * must be paired with an initial call to blk_start_plug(). The intent | |
1892 | * is to allow the block layer to optimize I/O submission. See the | |
1893 | * documentation for blk_start_plug() for more information. | |
1894 | */ | |
73c10101 JA |
1895 | void blk_finish_plug(struct blk_plug *plug) |
1896 | { | |
dd6cf3e1 SL |
1897 | if (plug != current->plug) |
1898 | return; | |
f6603783 | 1899 | blk_flush_plug_list(plug, false); |
73c10101 | 1900 | |
dd6cf3e1 | 1901 | current->plug = NULL; |
73c10101 | 1902 | } |
88b996cd | 1903 | EXPORT_SYMBOL(blk_finish_plug); |
73c10101 | 1904 | |
71ac860a ML |
1905 | void blk_io_schedule(void) |
1906 | { | |
1907 | /* Prevent hang_check timer from firing at us during very long I/O */ | |
1908 | unsigned long timeout = sysctl_hung_task_timeout_secs * HZ / 2; | |
1909 | ||
1910 | if (timeout) | |
1911 | io_schedule_timeout(timeout); | |
1912 | else | |
1913 | io_schedule(); | |
1914 | } | |
1915 | EXPORT_SYMBOL_GPL(blk_io_schedule); | |
1916 | ||
1da177e4 LT |
1917 | int __init blk_dev_init(void) |
1918 | { | |
ef295ecf CH |
1919 | BUILD_BUG_ON(REQ_OP_LAST >= (1 << REQ_OP_BITS)); |
1920 | BUILD_BUG_ON(REQ_OP_BITS + REQ_FLAG_BITS > 8 * | |
c593642c | 1921 | sizeof_field(struct request, cmd_flags)); |
ef295ecf | 1922 | BUILD_BUG_ON(REQ_OP_BITS + REQ_FLAG_BITS > 8 * |
c593642c | 1923 | sizeof_field(struct bio, bi_opf)); |
9eb55b03 | 1924 | |
89b90be2 TH |
1925 | /* used for unplugging and affects IO latency/throughput - HIGHPRI */ |
1926 | kblockd_workqueue = alloc_workqueue("kblockd", | |
28747fcd | 1927 | WQ_MEM_RECLAIM | WQ_HIGHPRI, 0); |
1da177e4 LT |
1928 | if (!kblockd_workqueue) |
1929 | panic("Failed to create kblockd\n"); | |
1930 | ||
c2789bd4 | 1931 | blk_requestq_cachep = kmem_cache_create("request_queue", |
165125e1 | 1932 | sizeof(struct request_queue), 0, SLAB_PANIC, NULL); |
1da177e4 | 1933 | |
18fbda91 OS |
1934 | #ifdef CONFIG_DEBUG_FS |
1935 | blk_debugfs_root = debugfs_create_dir("block", NULL); | |
1936 | #endif | |
1937 | ||
d38ecf93 | 1938 | return 0; |
1da177e4 | 1939 | } |