]>
Commit | Line | Data |
---|---|---|
75bb4625 JA |
1 | /* |
2 | * Block multiqueue core code | |
3 | * | |
4 | * Copyright (C) 2013-2014 Jens Axboe | |
5 | * Copyright (C) 2013-2014 Christoph Hellwig | |
6 | */ | |
320ae51f JA |
7 | #include <linux/kernel.h> |
8 | #include <linux/module.h> | |
9 | #include <linux/backing-dev.h> | |
10 | #include <linux/bio.h> | |
11 | #include <linux/blkdev.h> | |
f75782e4 | 12 | #include <linux/kmemleak.h> |
320ae51f JA |
13 | #include <linux/mm.h> |
14 | #include <linux/init.h> | |
15 | #include <linux/slab.h> | |
16 | #include <linux/workqueue.h> | |
17 | #include <linux/smp.h> | |
18 | #include <linux/llist.h> | |
19 | #include <linux/list_sort.h> | |
20 | #include <linux/cpu.h> | |
21 | #include <linux/cache.h> | |
22 | #include <linux/sched/sysctl.h> | |
23 | #include <linux/delay.h> | |
aedcd72f | 24 | #include <linux/crash_dump.h> |
88c7b2b7 | 25 | #include <linux/prefetch.h> |
320ae51f JA |
26 | |
27 | #include <trace/events/block.h> | |
28 | ||
29 | #include <linux/blk-mq.h> | |
30 | #include "blk.h" | |
31 | #include "blk-mq.h" | |
32 | #include "blk-mq-tag.h" | |
cf43e6be | 33 | #include "blk-stat.h" |
87760e5e | 34 | #include "blk-wbt.h" |
320ae51f JA |
35 | |
36 | static DEFINE_MUTEX(all_q_mutex); | |
37 | static LIST_HEAD(all_q_list); | |
38 | ||
320ae51f JA |
39 | /* |
40 | * Check if any of the ctx's have pending work in this hardware queue | |
41 | */ | |
42 | static bool blk_mq_hctx_has_pending(struct blk_mq_hw_ctx *hctx) | |
43 | { | |
88459642 | 44 | return sbitmap_any_bit_set(&hctx->ctx_map); |
1429d7c9 JA |
45 | } |
46 | ||
320ae51f JA |
47 | /* |
48 | * Mark this ctx as having pending work in this hardware queue | |
49 | */ | |
50 | static void blk_mq_hctx_mark_pending(struct blk_mq_hw_ctx *hctx, | |
51 | struct blk_mq_ctx *ctx) | |
52 | { | |
88459642 OS |
53 | if (!sbitmap_test_bit(&hctx->ctx_map, ctx->index_hw)) |
54 | sbitmap_set_bit(&hctx->ctx_map, ctx->index_hw); | |
1429d7c9 JA |
55 | } |
56 | ||
57 | static void blk_mq_hctx_clear_pending(struct blk_mq_hw_ctx *hctx, | |
58 | struct blk_mq_ctx *ctx) | |
59 | { | |
88459642 | 60 | sbitmap_clear_bit(&hctx->ctx_map, ctx->index_hw); |
320ae51f JA |
61 | } |
62 | ||
b4c6a028 | 63 | void blk_mq_freeze_queue_start(struct request_queue *q) |
43a5e4e2 | 64 | { |
4ecd4fef | 65 | int freeze_depth; |
cddd5d17 | 66 | |
4ecd4fef CH |
67 | freeze_depth = atomic_inc_return(&q->mq_freeze_depth); |
68 | if (freeze_depth == 1) { | |
3ef28e83 | 69 | percpu_ref_kill(&q->q_usage_counter); |
b94ec296 | 70 | blk_mq_run_hw_queues(q, false); |
cddd5d17 | 71 | } |
f3af020b | 72 | } |
b4c6a028 | 73 | EXPORT_SYMBOL_GPL(blk_mq_freeze_queue_start); |
f3af020b TH |
74 | |
75 | static void blk_mq_freeze_queue_wait(struct request_queue *q) | |
76 | { | |
3ef28e83 | 77 | wait_event(q->mq_freeze_wq, percpu_ref_is_zero(&q->q_usage_counter)); |
43a5e4e2 ML |
78 | } |
79 | ||
f3af020b TH |
80 | /* |
81 | * Guarantee no request is in use, so we can change any data structure of | |
82 | * the queue afterward. | |
83 | */ | |
3ef28e83 | 84 | void blk_freeze_queue(struct request_queue *q) |
f3af020b | 85 | { |
3ef28e83 DW |
86 | /* |
87 | * In the !blk_mq case we are only calling this to kill the | |
88 | * q_usage_counter, otherwise this increases the freeze depth | |
89 | * and waits for it to return to zero. For this reason there is | |
90 | * no blk_unfreeze_queue(), and blk_freeze_queue() is not | |
91 | * exported to drivers as the only user for unfreeze is blk_mq. | |
92 | */ | |
f3af020b TH |
93 | blk_mq_freeze_queue_start(q); |
94 | blk_mq_freeze_queue_wait(q); | |
95 | } | |
3ef28e83 DW |
96 | |
97 | void blk_mq_freeze_queue(struct request_queue *q) | |
98 | { | |
99 | /* | |
100 | * ...just an alias to keep freeze and unfreeze actions balanced | |
101 | * in the blk_mq_* namespace | |
102 | */ | |
103 | blk_freeze_queue(q); | |
104 | } | |
c761d96b | 105 | EXPORT_SYMBOL_GPL(blk_mq_freeze_queue); |
f3af020b | 106 | |
b4c6a028 | 107 | void blk_mq_unfreeze_queue(struct request_queue *q) |
320ae51f | 108 | { |
4ecd4fef | 109 | int freeze_depth; |
320ae51f | 110 | |
4ecd4fef CH |
111 | freeze_depth = atomic_dec_return(&q->mq_freeze_depth); |
112 | WARN_ON_ONCE(freeze_depth < 0); | |
113 | if (!freeze_depth) { | |
3ef28e83 | 114 | percpu_ref_reinit(&q->q_usage_counter); |
320ae51f | 115 | wake_up_all(&q->mq_freeze_wq); |
add703fd | 116 | } |
320ae51f | 117 | } |
b4c6a028 | 118 | EXPORT_SYMBOL_GPL(blk_mq_unfreeze_queue); |
320ae51f | 119 | |
6a83e74d BVA |
120 | /** |
121 | * blk_mq_quiesce_queue() - wait until all ongoing queue_rq calls have finished | |
122 | * @q: request queue. | |
123 | * | |
124 | * Note: this function does not prevent that the struct request end_io() | |
125 | * callback function is invoked. Additionally, it is not prevented that | |
126 | * new queue_rq() calls occur unless the queue has been stopped first. | |
127 | */ | |
128 | void blk_mq_quiesce_queue(struct request_queue *q) | |
129 | { | |
130 | struct blk_mq_hw_ctx *hctx; | |
131 | unsigned int i; | |
132 | bool rcu = false; | |
133 | ||
134 | blk_mq_stop_hw_queues(q); | |
135 | ||
136 | queue_for_each_hw_ctx(q, hctx, i) { | |
137 | if (hctx->flags & BLK_MQ_F_BLOCKING) | |
138 | synchronize_srcu(&hctx->queue_rq_srcu); | |
139 | else | |
140 | rcu = true; | |
141 | } | |
142 | if (rcu) | |
143 | synchronize_rcu(); | |
144 | } | |
145 | EXPORT_SYMBOL_GPL(blk_mq_quiesce_queue); | |
146 | ||
aed3ea94 JA |
147 | void blk_mq_wake_waiters(struct request_queue *q) |
148 | { | |
149 | struct blk_mq_hw_ctx *hctx; | |
150 | unsigned int i; | |
151 | ||
152 | queue_for_each_hw_ctx(q, hctx, i) | |
153 | if (blk_mq_hw_queue_mapped(hctx)) | |
154 | blk_mq_tag_wakeup_all(hctx->tags, true); | |
3fd5940c KB |
155 | |
156 | /* | |
157 | * If we are called because the queue has now been marked as | |
158 | * dying, we need to ensure that processes currently waiting on | |
159 | * the queue are notified as well. | |
160 | */ | |
161 | wake_up_all(&q->mq_freeze_wq); | |
aed3ea94 JA |
162 | } |
163 | ||
320ae51f JA |
164 | bool blk_mq_can_queue(struct blk_mq_hw_ctx *hctx) |
165 | { | |
166 | return blk_mq_has_free_tags(hctx->tags); | |
167 | } | |
168 | EXPORT_SYMBOL(blk_mq_can_queue); | |
169 | ||
94eddfbe | 170 | static void blk_mq_rq_ctx_init(struct request_queue *q, struct blk_mq_ctx *ctx, |
ef295ecf | 171 | struct request *rq, unsigned int op) |
320ae51f | 172 | { |
af76e555 CH |
173 | INIT_LIST_HEAD(&rq->queuelist); |
174 | /* csd/requeue_work/fifo_time is initialized before use */ | |
175 | rq->q = q; | |
320ae51f | 176 | rq->mq_ctx = ctx; |
ef295ecf | 177 | rq->cmd_flags = op; |
e8064021 CH |
178 | if (blk_queue_io_stat(q)) |
179 | rq->rq_flags |= RQF_IO_STAT; | |
af76e555 CH |
180 | /* do not touch atomic flags, it needs atomic ops against the timer */ |
181 | rq->cpu = -1; | |
af76e555 CH |
182 | INIT_HLIST_NODE(&rq->hash); |
183 | RB_CLEAR_NODE(&rq->rb_node); | |
af76e555 CH |
184 | rq->rq_disk = NULL; |
185 | rq->part = NULL; | |
3ee32372 | 186 | rq->start_time = jiffies; |
af76e555 CH |
187 | #ifdef CONFIG_BLK_CGROUP |
188 | rq->rl = NULL; | |
0fec08b4 | 189 | set_start_time_ns(rq); |
af76e555 CH |
190 | rq->io_start_time_ns = 0; |
191 | #endif | |
192 | rq->nr_phys_segments = 0; | |
193 | #if defined(CONFIG_BLK_DEV_INTEGRITY) | |
194 | rq->nr_integrity_segments = 0; | |
195 | #endif | |
af76e555 CH |
196 | rq->special = NULL; |
197 | /* tag was already set */ | |
198 | rq->errors = 0; | |
af76e555 | 199 | |
6f4a1626 TB |
200 | rq->cmd = rq->__cmd; |
201 | ||
af76e555 CH |
202 | rq->extra_len = 0; |
203 | rq->sense_len = 0; | |
204 | rq->resid_len = 0; | |
205 | rq->sense = NULL; | |
206 | ||
af76e555 | 207 | INIT_LIST_HEAD(&rq->timeout_list); |
f6be4fb4 JA |
208 | rq->timeout = 0; |
209 | ||
af76e555 CH |
210 | rq->end_io = NULL; |
211 | rq->end_io_data = NULL; | |
212 | rq->next_rq = NULL; | |
213 | ||
ef295ecf | 214 | ctx->rq_dispatched[op_is_sync(op)]++; |
320ae51f JA |
215 | } |
216 | ||
5dee8577 | 217 | static struct request * |
ef295ecf | 218 | __blk_mq_alloc_request(struct blk_mq_alloc_data *data, unsigned int op) |
5dee8577 CH |
219 | { |
220 | struct request *rq; | |
221 | unsigned int tag; | |
222 | ||
cb96a42c | 223 | tag = blk_mq_get_tag(data); |
5dee8577 | 224 | if (tag != BLK_MQ_TAG_FAIL) { |
cb96a42c | 225 | rq = data->hctx->tags->rqs[tag]; |
5dee8577 | 226 | |
cb96a42c | 227 | if (blk_mq_tag_busy(data->hctx)) { |
e8064021 | 228 | rq->rq_flags = RQF_MQ_INFLIGHT; |
cb96a42c | 229 | atomic_inc(&data->hctx->nr_active); |
5dee8577 CH |
230 | } |
231 | ||
232 | rq->tag = tag; | |
ef295ecf | 233 | blk_mq_rq_ctx_init(data->q, data->ctx, rq, op); |
5dee8577 CH |
234 | return rq; |
235 | } | |
236 | ||
237 | return NULL; | |
238 | } | |
239 | ||
6f3b0e8b CH |
240 | struct request *blk_mq_alloc_request(struct request_queue *q, int rw, |
241 | unsigned int flags) | |
320ae51f | 242 | { |
d852564f CH |
243 | struct blk_mq_ctx *ctx; |
244 | struct blk_mq_hw_ctx *hctx; | |
320ae51f | 245 | struct request *rq; |
cb96a42c | 246 | struct blk_mq_alloc_data alloc_data; |
a492f075 | 247 | int ret; |
320ae51f | 248 | |
6f3b0e8b | 249 | ret = blk_queue_enter(q, flags & BLK_MQ_REQ_NOWAIT); |
a492f075 JL |
250 | if (ret) |
251 | return ERR_PTR(ret); | |
320ae51f | 252 | |
d852564f | 253 | ctx = blk_mq_get_ctx(q); |
7d7e0f90 | 254 | hctx = blk_mq_map_queue(q, ctx->cpu); |
6f3b0e8b | 255 | blk_mq_set_alloc_data(&alloc_data, q, flags, ctx, hctx); |
ef295ecf | 256 | rq = __blk_mq_alloc_request(&alloc_data, rw); |
d852564f | 257 | blk_mq_put_ctx(ctx); |
841bac2c | 258 | |
c76541a9 | 259 | if (!rq) { |
3ef28e83 | 260 | blk_queue_exit(q); |
a492f075 | 261 | return ERR_PTR(-EWOULDBLOCK); |
c76541a9 | 262 | } |
0c4de0f3 CH |
263 | |
264 | rq->__data_len = 0; | |
265 | rq->__sector = (sector_t) -1; | |
266 | rq->bio = rq->biotail = NULL; | |
320ae51f JA |
267 | return rq; |
268 | } | |
4bb659b1 | 269 | EXPORT_SYMBOL(blk_mq_alloc_request); |
320ae51f | 270 | |
1f5bd336 ML |
271 | struct request *blk_mq_alloc_request_hctx(struct request_queue *q, int rw, |
272 | unsigned int flags, unsigned int hctx_idx) | |
273 | { | |
274 | struct blk_mq_hw_ctx *hctx; | |
275 | struct blk_mq_ctx *ctx; | |
276 | struct request *rq; | |
277 | struct blk_mq_alloc_data alloc_data; | |
278 | int ret; | |
279 | ||
280 | /* | |
281 | * If the tag allocator sleeps we could get an allocation for a | |
282 | * different hardware context. No need to complicate the low level | |
283 | * allocator for this for the rare use case of a command tied to | |
284 | * a specific queue. | |
285 | */ | |
286 | if (WARN_ON_ONCE(!(flags & BLK_MQ_REQ_NOWAIT))) | |
287 | return ERR_PTR(-EINVAL); | |
288 | ||
289 | if (hctx_idx >= q->nr_hw_queues) | |
290 | return ERR_PTR(-EIO); | |
291 | ||
292 | ret = blk_queue_enter(q, true); | |
293 | if (ret) | |
294 | return ERR_PTR(ret); | |
295 | ||
c8712c6a CH |
296 | /* |
297 | * Check if the hardware context is actually mapped to anything. | |
298 | * If not tell the caller that it should skip this queue. | |
299 | */ | |
1f5bd336 | 300 | hctx = q->queue_hw_ctx[hctx_idx]; |
c8712c6a CH |
301 | if (!blk_mq_hw_queue_mapped(hctx)) { |
302 | ret = -EXDEV; | |
303 | goto out_queue_exit; | |
304 | } | |
1f5bd336 ML |
305 | ctx = __blk_mq_get_ctx(q, cpumask_first(hctx->cpumask)); |
306 | ||
307 | blk_mq_set_alloc_data(&alloc_data, q, flags, ctx, hctx); | |
ef295ecf | 308 | rq = __blk_mq_alloc_request(&alloc_data, rw); |
1f5bd336 | 309 | if (!rq) { |
c8712c6a CH |
310 | ret = -EWOULDBLOCK; |
311 | goto out_queue_exit; | |
1f5bd336 ML |
312 | } |
313 | ||
314 | return rq; | |
c8712c6a CH |
315 | |
316 | out_queue_exit: | |
317 | blk_queue_exit(q); | |
318 | return ERR_PTR(ret); | |
1f5bd336 ML |
319 | } |
320 | EXPORT_SYMBOL_GPL(blk_mq_alloc_request_hctx); | |
321 | ||
320ae51f JA |
322 | static void __blk_mq_free_request(struct blk_mq_hw_ctx *hctx, |
323 | struct blk_mq_ctx *ctx, struct request *rq) | |
324 | { | |
325 | const int tag = rq->tag; | |
326 | struct request_queue *q = rq->q; | |
327 | ||
e8064021 | 328 | if (rq->rq_flags & RQF_MQ_INFLIGHT) |
0d2602ca | 329 | atomic_dec(&hctx->nr_active); |
87760e5e JA |
330 | |
331 | wbt_done(q->rq_wb, &rq->issue_stat); | |
e8064021 | 332 | rq->rq_flags = 0; |
0d2602ca | 333 | |
af76e555 | 334 | clear_bit(REQ_ATOM_STARTED, &rq->atomic_flags); |
06426adf | 335 | clear_bit(REQ_ATOM_POLL_SLEPT, &rq->atomic_flags); |
40aabb67 | 336 | blk_mq_put_tag(hctx, ctx, tag); |
3ef28e83 | 337 | blk_queue_exit(q); |
320ae51f JA |
338 | } |
339 | ||
7c7f2f2b | 340 | void blk_mq_free_hctx_request(struct blk_mq_hw_ctx *hctx, struct request *rq) |
320ae51f JA |
341 | { |
342 | struct blk_mq_ctx *ctx = rq->mq_ctx; | |
320ae51f JA |
343 | |
344 | ctx->rq_completed[rq_is_sync(rq)]++; | |
320ae51f | 345 | __blk_mq_free_request(hctx, ctx, rq); |
7c7f2f2b JA |
346 | |
347 | } | |
348 | EXPORT_SYMBOL_GPL(blk_mq_free_hctx_request); | |
349 | ||
350 | void blk_mq_free_request(struct request *rq) | |
351 | { | |
7d7e0f90 | 352 | blk_mq_free_hctx_request(blk_mq_map_queue(rq->q, rq->mq_ctx->cpu), rq); |
320ae51f | 353 | } |
1a3b595a | 354 | EXPORT_SYMBOL_GPL(blk_mq_free_request); |
320ae51f | 355 | |
c8a446ad | 356 | inline void __blk_mq_end_request(struct request *rq, int error) |
320ae51f | 357 | { |
0d11e6ac ML |
358 | blk_account_io_done(rq); |
359 | ||
91b63639 | 360 | if (rq->end_io) { |
87760e5e | 361 | wbt_done(rq->q->rq_wb, &rq->issue_stat); |
320ae51f | 362 | rq->end_io(rq, error); |
91b63639 CH |
363 | } else { |
364 | if (unlikely(blk_bidi_rq(rq))) | |
365 | blk_mq_free_request(rq->next_rq); | |
320ae51f | 366 | blk_mq_free_request(rq); |
91b63639 | 367 | } |
320ae51f | 368 | } |
c8a446ad | 369 | EXPORT_SYMBOL(__blk_mq_end_request); |
63151a44 | 370 | |
c8a446ad | 371 | void blk_mq_end_request(struct request *rq, int error) |
63151a44 CH |
372 | { |
373 | if (blk_update_request(rq, error, blk_rq_bytes(rq))) | |
374 | BUG(); | |
c8a446ad | 375 | __blk_mq_end_request(rq, error); |
63151a44 | 376 | } |
c8a446ad | 377 | EXPORT_SYMBOL(blk_mq_end_request); |
320ae51f | 378 | |
30a91cb4 | 379 | static void __blk_mq_complete_request_remote(void *data) |
320ae51f | 380 | { |
3d6efbf6 | 381 | struct request *rq = data; |
320ae51f | 382 | |
30a91cb4 | 383 | rq->q->softirq_done_fn(rq); |
320ae51f | 384 | } |
320ae51f | 385 | |
ed851860 | 386 | static void blk_mq_ipi_complete_request(struct request *rq) |
320ae51f JA |
387 | { |
388 | struct blk_mq_ctx *ctx = rq->mq_ctx; | |
38535201 | 389 | bool shared = false; |
320ae51f JA |
390 | int cpu; |
391 | ||
38535201 | 392 | if (!test_bit(QUEUE_FLAG_SAME_COMP, &rq->q->queue_flags)) { |
30a91cb4 CH |
393 | rq->q->softirq_done_fn(rq); |
394 | return; | |
395 | } | |
320ae51f JA |
396 | |
397 | cpu = get_cpu(); | |
38535201 CH |
398 | if (!test_bit(QUEUE_FLAG_SAME_FORCE, &rq->q->queue_flags)) |
399 | shared = cpus_share_cache(cpu, ctx->cpu); | |
400 | ||
401 | if (cpu != ctx->cpu && !shared && cpu_online(ctx->cpu)) { | |
30a91cb4 | 402 | rq->csd.func = __blk_mq_complete_request_remote; |
3d6efbf6 CH |
403 | rq->csd.info = rq; |
404 | rq->csd.flags = 0; | |
c46fff2a | 405 | smp_call_function_single_async(ctx->cpu, &rq->csd); |
3d6efbf6 | 406 | } else { |
30a91cb4 | 407 | rq->q->softirq_done_fn(rq); |
3d6efbf6 | 408 | } |
320ae51f JA |
409 | put_cpu(); |
410 | } | |
30a91cb4 | 411 | |
cf43e6be JA |
412 | static void blk_mq_stat_add(struct request *rq) |
413 | { | |
414 | if (rq->rq_flags & RQF_STATS) { | |
415 | /* | |
416 | * We could rq->mq_ctx here, but there's less of a risk | |
417 | * of races if we have the completion event add the stats | |
418 | * to the local software queue. | |
419 | */ | |
420 | struct blk_mq_ctx *ctx; | |
421 | ||
422 | ctx = __blk_mq_get_ctx(rq->q, raw_smp_processor_id()); | |
423 | blk_stat_add(&ctx->stat[rq_data_dir(rq)], rq); | |
424 | } | |
425 | } | |
426 | ||
1fa8cc52 | 427 | static void __blk_mq_complete_request(struct request *rq) |
ed851860 JA |
428 | { |
429 | struct request_queue *q = rq->q; | |
430 | ||
cf43e6be JA |
431 | blk_mq_stat_add(rq); |
432 | ||
ed851860 | 433 | if (!q->softirq_done_fn) |
c8a446ad | 434 | blk_mq_end_request(rq, rq->errors); |
ed851860 JA |
435 | else |
436 | blk_mq_ipi_complete_request(rq); | |
437 | } | |
438 | ||
30a91cb4 CH |
439 | /** |
440 | * blk_mq_complete_request - end I/O on a request | |
441 | * @rq: the request being processed | |
442 | * | |
443 | * Description: | |
444 | * Ends all I/O on a request. It does not handle partial completions. | |
445 | * The actual completion happens out-of-order, through a IPI handler. | |
446 | **/ | |
f4829a9b | 447 | void blk_mq_complete_request(struct request *rq, int error) |
30a91cb4 | 448 | { |
95f09684 JA |
449 | struct request_queue *q = rq->q; |
450 | ||
451 | if (unlikely(blk_should_fake_timeout(q))) | |
30a91cb4 | 452 | return; |
f4829a9b CH |
453 | if (!blk_mark_rq_complete(rq)) { |
454 | rq->errors = error; | |
ed851860 | 455 | __blk_mq_complete_request(rq); |
f4829a9b | 456 | } |
30a91cb4 CH |
457 | } |
458 | EXPORT_SYMBOL(blk_mq_complete_request); | |
320ae51f | 459 | |
973c0191 KB |
460 | int blk_mq_request_started(struct request *rq) |
461 | { | |
462 | return test_bit(REQ_ATOM_STARTED, &rq->atomic_flags); | |
463 | } | |
464 | EXPORT_SYMBOL_GPL(blk_mq_request_started); | |
465 | ||
e2490073 | 466 | void blk_mq_start_request(struct request *rq) |
320ae51f JA |
467 | { |
468 | struct request_queue *q = rq->q; | |
469 | ||
470 | trace_block_rq_issue(q, rq); | |
471 | ||
742ee69b | 472 | rq->resid_len = blk_rq_bytes(rq); |
91b63639 CH |
473 | if (unlikely(blk_bidi_rq(rq))) |
474 | rq->next_rq->resid_len = blk_rq_bytes(rq->next_rq); | |
742ee69b | 475 | |
cf43e6be JA |
476 | if (test_bit(QUEUE_FLAG_STATS, &q->queue_flags)) { |
477 | blk_stat_set_issue_time(&rq->issue_stat); | |
478 | rq->rq_flags |= RQF_STATS; | |
87760e5e | 479 | wbt_issue(q->rq_wb, &rq->issue_stat); |
cf43e6be JA |
480 | } |
481 | ||
2b8393b4 | 482 | blk_add_timer(rq); |
87ee7b11 | 483 | |
538b7534 JA |
484 | /* |
485 | * Ensure that ->deadline is visible before set the started | |
486 | * flag and clear the completed flag. | |
487 | */ | |
488 | smp_mb__before_atomic(); | |
489 | ||
87ee7b11 JA |
490 | /* |
491 | * Mark us as started and clear complete. Complete might have been | |
492 | * set if requeue raced with timeout, which then marked it as | |
493 | * complete. So be sure to clear complete again when we start | |
494 | * the request, otherwise we'll ignore the completion event. | |
495 | */ | |
4b570521 JA |
496 | if (!test_bit(REQ_ATOM_STARTED, &rq->atomic_flags)) |
497 | set_bit(REQ_ATOM_STARTED, &rq->atomic_flags); | |
498 | if (test_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags)) | |
499 | clear_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags); | |
49f5baa5 CH |
500 | |
501 | if (q->dma_drain_size && blk_rq_bytes(rq)) { | |
502 | /* | |
503 | * Make sure space for the drain appears. We know we can do | |
504 | * this because max_hw_segments has been adjusted to be one | |
505 | * fewer than the device can handle. | |
506 | */ | |
507 | rq->nr_phys_segments++; | |
508 | } | |
320ae51f | 509 | } |
e2490073 | 510 | EXPORT_SYMBOL(blk_mq_start_request); |
320ae51f | 511 | |
ed0791b2 | 512 | static void __blk_mq_requeue_request(struct request *rq) |
320ae51f JA |
513 | { |
514 | struct request_queue *q = rq->q; | |
515 | ||
516 | trace_block_rq_requeue(q, rq); | |
87760e5e | 517 | wbt_requeue(q->rq_wb, &rq->issue_stat); |
49f5baa5 | 518 | |
e2490073 CH |
519 | if (test_and_clear_bit(REQ_ATOM_STARTED, &rq->atomic_flags)) { |
520 | if (q->dma_drain_size && blk_rq_bytes(rq)) | |
521 | rq->nr_phys_segments--; | |
522 | } | |
320ae51f JA |
523 | } |
524 | ||
2b053aca | 525 | void blk_mq_requeue_request(struct request *rq, bool kick_requeue_list) |
ed0791b2 | 526 | { |
ed0791b2 | 527 | __blk_mq_requeue_request(rq); |
ed0791b2 | 528 | |
ed0791b2 | 529 | BUG_ON(blk_queued_rq(rq)); |
2b053aca | 530 | blk_mq_add_to_requeue_list(rq, true, kick_requeue_list); |
ed0791b2 CH |
531 | } |
532 | EXPORT_SYMBOL(blk_mq_requeue_request); | |
533 | ||
6fca6a61 CH |
534 | static void blk_mq_requeue_work(struct work_struct *work) |
535 | { | |
536 | struct request_queue *q = | |
2849450a | 537 | container_of(work, struct request_queue, requeue_work.work); |
6fca6a61 CH |
538 | LIST_HEAD(rq_list); |
539 | struct request *rq, *next; | |
540 | unsigned long flags; | |
541 | ||
542 | spin_lock_irqsave(&q->requeue_lock, flags); | |
543 | list_splice_init(&q->requeue_list, &rq_list); | |
544 | spin_unlock_irqrestore(&q->requeue_lock, flags); | |
545 | ||
546 | list_for_each_entry_safe(rq, next, &rq_list, queuelist) { | |
e8064021 | 547 | if (!(rq->rq_flags & RQF_SOFTBARRIER)) |
6fca6a61 CH |
548 | continue; |
549 | ||
e8064021 | 550 | rq->rq_flags &= ~RQF_SOFTBARRIER; |
6fca6a61 CH |
551 | list_del_init(&rq->queuelist); |
552 | blk_mq_insert_request(rq, true, false, false); | |
553 | } | |
554 | ||
555 | while (!list_empty(&rq_list)) { | |
556 | rq = list_entry(rq_list.next, struct request, queuelist); | |
557 | list_del_init(&rq->queuelist); | |
558 | blk_mq_insert_request(rq, false, false, false); | |
559 | } | |
560 | ||
52d7f1b5 | 561 | blk_mq_run_hw_queues(q, false); |
6fca6a61 CH |
562 | } |
563 | ||
2b053aca BVA |
564 | void blk_mq_add_to_requeue_list(struct request *rq, bool at_head, |
565 | bool kick_requeue_list) | |
6fca6a61 CH |
566 | { |
567 | struct request_queue *q = rq->q; | |
568 | unsigned long flags; | |
569 | ||
570 | /* | |
571 | * We abuse this flag that is otherwise used by the I/O scheduler to | |
572 | * request head insertation from the workqueue. | |
573 | */ | |
e8064021 | 574 | BUG_ON(rq->rq_flags & RQF_SOFTBARRIER); |
6fca6a61 CH |
575 | |
576 | spin_lock_irqsave(&q->requeue_lock, flags); | |
577 | if (at_head) { | |
e8064021 | 578 | rq->rq_flags |= RQF_SOFTBARRIER; |
6fca6a61 CH |
579 | list_add(&rq->queuelist, &q->requeue_list); |
580 | } else { | |
581 | list_add_tail(&rq->queuelist, &q->requeue_list); | |
582 | } | |
583 | spin_unlock_irqrestore(&q->requeue_lock, flags); | |
2b053aca BVA |
584 | |
585 | if (kick_requeue_list) | |
586 | blk_mq_kick_requeue_list(q); | |
6fca6a61 CH |
587 | } |
588 | EXPORT_SYMBOL(blk_mq_add_to_requeue_list); | |
589 | ||
590 | void blk_mq_kick_requeue_list(struct request_queue *q) | |
591 | { | |
2849450a | 592 | kblockd_schedule_delayed_work(&q->requeue_work, 0); |
6fca6a61 CH |
593 | } |
594 | EXPORT_SYMBOL(blk_mq_kick_requeue_list); | |
595 | ||
2849450a MS |
596 | void blk_mq_delay_kick_requeue_list(struct request_queue *q, |
597 | unsigned long msecs) | |
598 | { | |
599 | kblockd_schedule_delayed_work(&q->requeue_work, | |
600 | msecs_to_jiffies(msecs)); | |
601 | } | |
602 | EXPORT_SYMBOL(blk_mq_delay_kick_requeue_list); | |
603 | ||
1885b24d JA |
604 | void blk_mq_abort_requeue_list(struct request_queue *q) |
605 | { | |
606 | unsigned long flags; | |
607 | LIST_HEAD(rq_list); | |
608 | ||
609 | spin_lock_irqsave(&q->requeue_lock, flags); | |
610 | list_splice_init(&q->requeue_list, &rq_list); | |
611 | spin_unlock_irqrestore(&q->requeue_lock, flags); | |
612 | ||
613 | while (!list_empty(&rq_list)) { | |
614 | struct request *rq; | |
615 | ||
616 | rq = list_first_entry(&rq_list, struct request, queuelist); | |
617 | list_del_init(&rq->queuelist); | |
618 | rq->errors = -EIO; | |
619 | blk_mq_end_request(rq, rq->errors); | |
620 | } | |
621 | } | |
622 | EXPORT_SYMBOL(blk_mq_abort_requeue_list); | |
623 | ||
0e62f51f JA |
624 | struct request *blk_mq_tag_to_rq(struct blk_mq_tags *tags, unsigned int tag) |
625 | { | |
88c7b2b7 JA |
626 | if (tag < tags->nr_tags) { |
627 | prefetch(tags->rqs[tag]); | |
4ee86bab | 628 | return tags->rqs[tag]; |
88c7b2b7 | 629 | } |
4ee86bab HR |
630 | |
631 | return NULL; | |
24d2f903 CH |
632 | } |
633 | EXPORT_SYMBOL(blk_mq_tag_to_rq); | |
634 | ||
320ae51f | 635 | struct blk_mq_timeout_data { |
46f92d42 CH |
636 | unsigned long next; |
637 | unsigned int next_set; | |
320ae51f JA |
638 | }; |
639 | ||
90415837 | 640 | void blk_mq_rq_timed_out(struct request *req, bool reserved) |
320ae51f | 641 | { |
46f92d42 CH |
642 | struct blk_mq_ops *ops = req->q->mq_ops; |
643 | enum blk_eh_timer_return ret = BLK_EH_RESET_TIMER; | |
87ee7b11 JA |
644 | |
645 | /* | |
646 | * We know that complete is set at this point. If STARTED isn't set | |
647 | * anymore, then the request isn't active and the "timeout" should | |
648 | * just be ignored. This can happen due to the bitflag ordering. | |
649 | * Timeout first checks if STARTED is set, and if it is, assumes | |
650 | * the request is active. But if we race with completion, then | |
651 | * we both flags will get cleared. So check here again, and ignore | |
652 | * a timeout event with a request that isn't active. | |
653 | */ | |
46f92d42 CH |
654 | if (!test_bit(REQ_ATOM_STARTED, &req->atomic_flags)) |
655 | return; | |
87ee7b11 | 656 | |
46f92d42 | 657 | if (ops->timeout) |
0152fb6b | 658 | ret = ops->timeout(req, reserved); |
46f92d42 CH |
659 | |
660 | switch (ret) { | |
661 | case BLK_EH_HANDLED: | |
662 | __blk_mq_complete_request(req); | |
663 | break; | |
664 | case BLK_EH_RESET_TIMER: | |
665 | blk_add_timer(req); | |
666 | blk_clear_rq_complete(req); | |
667 | break; | |
668 | case BLK_EH_NOT_HANDLED: | |
669 | break; | |
670 | default: | |
671 | printk(KERN_ERR "block: bad eh return: %d\n", ret); | |
672 | break; | |
673 | } | |
87ee7b11 | 674 | } |
5b3f25fc | 675 | |
81481eb4 CH |
676 | static void blk_mq_check_expired(struct blk_mq_hw_ctx *hctx, |
677 | struct request *rq, void *priv, bool reserved) | |
678 | { | |
679 | struct blk_mq_timeout_data *data = priv; | |
87ee7b11 | 680 | |
e67f01e8 | 681 | if (!test_bit(REQ_ATOM_STARTED, &rq->atomic_flags)) |
46f92d42 | 682 | return; |
87ee7b11 | 683 | |
46f92d42 CH |
684 | if (time_after_eq(jiffies, rq->deadline)) { |
685 | if (!blk_mark_rq_complete(rq)) | |
0152fb6b | 686 | blk_mq_rq_timed_out(rq, reserved); |
46f92d42 CH |
687 | } else if (!data->next_set || time_after(data->next, rq->deadline)) { |
688 | data->next = rq->deadline; | |
689 | data->next_set = 1; | |
690 | } | |
87ee7b11 JA |
691 | } |
692 | ||
287922eb | 693 | static void blk_mq_timeout_work(struct work_struct *work) |
320ae51f | 694 | { |
287922eb CH |
695 | struct request_queue *q = |
696 | container_of(work, struct request_queue, timeout_work); | |
81481eb4 CH |
697 | struct blk_mq_timeout_data data = { |
698 | .next = 0, | |
699 | .next_set = 0, | |
700 | }; | |
81481eb4 | 701 | int i; |
320ae51f | 702 | |
71f79fb3 GKB |
703 | /* A deadlock might occur if a request is stuck requiring a |
704 | * timeout at the same time a queue freeze is waiting | |
705 | * completion, since the timeout code would not be able to | |
706 | * acquire the queue reference here. | |
707 | * | |
708 | * That's why we don't use blk_queue_enter here; instead, we use | |
709 | * percpu_ref_tryget directly, because we need to be able to | |
710 | * obtain a reference even in the short window between the queue | |
711 | * starting to freeze, by dropping the first reference in | |
712 | * blk_mq_freeze_queue_start, and the moment the last request is | |
713 | * consumed, marked by the instant q_usage_counter reaches | |
714 | * zero. | |
715 | */ | |
716 | if (!percpu_ref_tryget(&q->q_usage_counter)) | |
287922eb CH |
717 | return; |
718 | ||
0bf6cd5b | 719 | blk_mq_queue_tag_busy_iter(q, blk_mq_check_expired, &data); |
320ae51f | 720 | |
81481eb4 CH |
721 | if (data.next_set) { |
722 | data.next = blk_rq_timeout(round_jiffies_up(data.next)); | |
723 | mod_timer(&q->timeout, data.next); | |
0d2602ca | 724 | } else { |
0bf6cd5b CH |
725 | struct blk_mq_hw_ctx *hctx; |
726 | ||
f054b56c ML |
727 | queue_for_each_hw_ctx(q, hctx, i) { |
728 | /* the hctx may be unmapped, so check it here */ | |
729 | if (blk_mq_hw_queue_mapped(hctx)) | |
730 | blk_mq_tag_idle(hctx); | |
731 | } | |
0d2602ca | 732 | } |
287922eb | 733 | blk_queue_exit(q); |
320ae51f JA |
734 | } |
735 | ||
736 | /* | |
737 | * Reverse check our software queue for entries that we could potentially | |
738 | * merge with. Currently includes a hand-wavy stop count of 8, to not spend | |
739 | * too much time checking for merges. | |
740 | */ | |
741 | static bool blk_mq_attempt_merge(struct request_queue *q, | |
742 | struct blk_mq_ctx *ctx, struct bio *bio) | |
743 | { | |
744 | struct request *rq; | |
745 | int checked = 8; | |
746 | ||
747 | list_for_each_entry_reverse(rq, &ctx->rq_list, queuelist) { | |
748 | int el_ret; | |
749 | ||
750 | if (!checked--) | |
751 | break; | |
752 | ||
753 | if (!blk_rq_merge_ok(rq, bio)) | |
754 | continue; | |
755 | ||
756 | el_ret = blk_try_merge(rq, bio); | |
757 | if (el_ret == ELEVATOR_BACK_MERGE) { | |
758 | if (bio_attempt_back_merge(q, rq, bio)) { | |
759 | ctx->rq_merged++; | |
760 | return true; | |
761 | } | |
762 | break; | |
763 | } else if (el_ret == ELEVATOR_FRONT_MERGE) { | |
764 | if (bio_attempt_front_merge(q, rq, bio)) { | |
765 | ctx->rq_merged++; | |
766 | return true; | |
767 | } | |
768 | break; | |
769 | } | |
770 | } | |
771 | ||
772 | return false; | |
773 | } | |
774 | ||
88459642 OS |
775 | struct flush_busy_ctx_data { |
776 | struct blk_mq_hw_ctx *hctx; | |
777 | struct list_head *list; | |
778 | }; | |
779 | ||
780 | static bool flush_busy_ctx(struct sbitmap *sb, unsigned int bitnr, void *data) | |
781 | { | |
782 | struct flush_busy_ctx_data *flush_data = data; | |
783 | struct blk_mq_hw_ctx *hctx = flush_data->hctx; | |
784 | struct blk_mq_ctx *ctx = hctx->ctxs[bitnr]; | |
785 | ||
786 | sbitmap_clear_bit(sb, bitnr); | |
787 | spin_lock(&ctx->lock); | |
788 | list_splice_tail_init(&ctx->rq_list, flush_data->list); | |
789 | spin_unlock(&ctx->lock); | |
790 | return true; | |
791 | } | |
792 | ||
1429d7c9 JA |
793 | /* |
794 | * Process software queues that have been marked busy, splicing them | |
795 | * to the for-dispatch | |
796 | */ | |
797 | static void flush_busy_ctxs(struct blk_mq_hw_ctx *hctx, struct list_head *list) | |
798 | { | |
88459642 OS |
799 | struct flush_busy_ctx_data data = { |
800 | .hctx = hctx, | |
801 | .list = list, | |
802 | }; | |
1429d7c9 | 803 | |
88459642 | 804 | sbitmap_for_each_set(&hctx->ctx_map, flush_busy_ctx, &data); |
1429d7c9 | 805 | } |
1429d7c9 | 806 | |
703fd1c0 JA |
807 | static inline unsigned int queued_to_index(unsigned int queued) |
808 | { | |
809 | if (!queued) | |
810 | return 0; | |
1429d7c9 | 811 | |
703fd1c0 | 812 | return min(BLK_MQ_MAX_DISPATCH_ORDER - 1, ilog2(queued) + 1); |
1429d7c9 JA |
813 | } |
814 | ||
f04c3df3 | 815 | bool blk_mq_dispatch_rq_list(struct blk_mq_hw_ctx *hctx, struct list_head *list) |
320ae51f JA |
816 | { |
817 | struct request_queue *q = hctx->queue; | |
320ae51f | 818 | struct request *rq; |
74c45052 JA |
819 | LIST_HEAD(driver_list); |
820 | struct list_head *dptr; | |
f04c3df3 | 821 | int queued, ret = BLK_MQ_RQ_QUEUE_OK; |
320ae51f | 822 | |
74c45052 JA |
823 | /* |
824 | * Start off with dptr being NULL, so we start the first request | |
825 | * immediately, even if we have more pending. | |
826 | */ | |
827 | dptr = NULL; | |
828 | ||
320ae51f JA |
829 | /* |
830 | * Now process all the entries, sending them to the driver. | |
831 | */ | |
1429d7c9 | 832 | queued = 0; |
f04c3df3 | 833 | while (!list_empty(list)) { |
74c45052 | 834 | struct blk_mq_queue_data bd; |
320ae51f | 835 | |
f04c3df3 | 836 | rq = list_first_entry(list, struct request, queuelist); |
320ae51f | 837 | list_del_init(&rq->queuelist); |
320ae51f | 838 | |
74c45052 JA |
839 | bd.rq = rq; |
840 | bd.list = dptr; | |
f04c3df3 | 841 | bd.last = list_empty(list); |
74c45052 JA |
842 | |
843 | ret = q->mq_ops->queue_rq(hctx, &bd); | |
320ae51f JA |
844 | switch (ret) { |
845 | case BLK_MQ_RQ_QUEUE_OK: | |
846 | queued++; | |
52b9c330 | 847 | break; |
320ae51f | 848 | case BLK_MQ_RQ_QUEUE_BUSY: |
f04c3df3 | 849 | list_add(&rq->queuelist, list); |
ed0791b2 | 850 | __blk_mq_requeue_request(rq); |
320ae51f JA |
851 | break; |
852 | default: | |
853 | pr_err("blk-mq: bad return on queue: %d\n", ret); | |
320ae51f | 854 | case BLK_MQ_RQ_QUEUE_ERROR: |
1e93b8c2 | 855 | rq->errors = -EIO; |
c8a446ad | 856 | blk_mq_end_request(rq, rq->errors); |
320ae51f JA |
857 | break; |
858 | } | |
859 | ||
860 | if (ret == BLK_MQ_RQ_QUEUE_BUSY) | |
861 | break; | |
74c45052 JA |
862 | |
863 | /* | |
864 | * We've done the first request. If we have more than 1 | |
865 | * left in the list, set dptr to defer issue. | |
866 | */ | |
f04c3df3 | 867 | if (!dptr && list->next != list->prev) |
74c45052 | 868 | dptr = &driver_list; |
320ae51f JA |
869 | } |
870 | ||
703fd1c0 | 871 | hctx->dispatched[queued_to_index(queued)]++; |
320ae51f JA |
872 | |
873 | /* | |
874 | * Any items that need requeuing? Stuff them into hctx->dispatch, | |
875 | * that is where we will continue on next queue run. | |
876 | */ | |
f04c3df3 | 877 | if (!list_empty(list)) { |
320ae51f | 878 | spin_lock(&hctx->lock); |
f04c3df3 | 879 | list_splice(list, &hctx->dispatch); |
320ae51f | 880 | spin_unlock(&hctx->lock); |
f04c3df3 | 881 | |
9ba52e58 SL |
882 | /* |
883 | * the queue is expected stopped with BLK_MQ_RQ_QUEUE_BUSY, but | |
884 | * it's possible the queue is stopped and restarted again | |
885 | * before this. Queue restart will dispatch requests. And since | |
886 | * requests in rq_list aren't added into hctx->dispatch yet, | |
887 | * the requests in rq_list might get lost. | |
888 | * | |
889 | * blk_mq_run_hw_queue() already checks the STOPPED bit | |
890 | **/ | |
891 | blk_mq_run_hw_queue(hctx, true); | |
320ae51f | 892 | } |
f04c3df3 JA |
893 | |
894 | return ret != BLK_MQ_RQ_QUEUE_BUSY; | |
895 | } | |
896 | ||
897 | /* | |
898 | * Run this hardware queue, pulling any software queues mapped to it in. | |
899 | * Note that this function currently has various problems around ordering | |
900 | * of IO. In particular, we'd like FIFO behaviour on handling existing | |
901 | * items on the hctx->dispatch list. Ignore that for now. | |
902 | */ | |
903 | static void blk_mq_process_rq_list(struct blk_mq_hw_ctx *hctx) | |
904 | { | |
905 | LIST_HEAD(rq_list); | |
f04c3df3 JA |
906 | |
907 | if (unlikely(blk_mq_hctx_stopped(hctx))) | |
908 | return; | |
909 | ||
910 | hctx->run++; | |
911 | ||
912 | /* | |
913 | * Touch any software queue that has pending entries. | |
914 | */ | |
915 | flush_busy_ctxs(hctx, &rq_list); | |
916 | ||
917 | /* | |
918 | * If we have previous entries on our dispatch list, grab them | |
919 | * and stuff them at the front for more fair dispatch. | |
920 | */ | |
921 | if (!list_empty_careful(&hctx->dispatch)) { | |
922 | spin_lock(&hctx->lock); | |
923 | if (!list_empty(&hctx->dispatch)) | |
924 | list_splice_init(&hctx->dispatch, &rq_list); | |
925 | spin_unlock(&hctx->lock); | |
926 | } | |
927 | ||
928 | blk_mq_dispatch_rq_list(hctx, &rq_list); | |
320ae51f JA |
929 | } |
930 | ||
6a83e74d BVA |
931 | static void __blk_mq_run_hw_queue(struct blk_mq_hw_ctx *hctx) |
932 | { | |
933 | int srcu_idx; | |
934 | ||
935 | WARN_ON(!cpumask_test_cpu(raw_smp_processor_id(), hctx->cpumask) && | |
936 | cpu_online(hctx->next_cpu)); | |
937 | ||
938 | if (!(hctx->flags & BLK_MQ_F_BLOCKING)) { | |
939 | rcu_read_lock(); | |
940 | blk_mq_process_rq_list(hctx); | |
941 | rcu_read_unlock(); | |
942 | } else { | |
943 | srcu_idx = srcu_read_lock(&hctx->queue_rq_srcu); | |
944 | blk_mq_process_rq_list(hctx); | |
945 | srcu_read_unlock(&hctx->queue_rq_srcu, srcu_idx); | |
946 | } | |
947 | } | |
948 | ||
506e931f JA |
949 | /* |
950 | * It'd be great if the workqueue API had a way to pass | |
951 | * in a mask and had some smarts for more clever placement. | |
952 | * For now we just round-robin here, switching for every | |
953 | * BLK_MQ_CPU_WORK_BATCH queued items. | |
954 | */ | |
955 | static int blk_mq_hctx_next_cpu(struct blk_mq_hw_ctx *hctx) | |
956 | { | |
b657d7e6 CH |
957 | if (hctx->queue->nr_hw_queues == 1) |
958 | return WORK_CPU_UNBOUND; | |
506e931f JA |
959 | |
960 | if (--hctx->next_cpu_batch <= 0) { | |
c02ebfdd | 961 | int next_cpu; |
506e931f JA |
962 | |
963 | next_cpu = cpumask_next(hctx->next_cpu, hctx->cpumask); | |
964 | if (next_cpu >= nr_cpu_ids) | |
965 | next_cpu = cpumask_first(hctx->cpumask); | |
966 | ||
967 | hctx->next_cpu = next_cpu; | |
968 | hctx->next_cpu_batch = BLK_MQ_CPU_WORK_BATCH; | |
969 | } | |
970 | ||
b657d7e6 | 971 | return hctx->next_cpu; |
506e931f JA |
972 | } |
973 | ||
320ae51f JA |
974 | void blk_mq_run_hw_queue(struct blk_mq_hw_ctx *hctx, bool async) |
975 | { | |
5d1b25c1 BVA |
976 | if (unlikely(blk_mq_hctx_stopped(hctx) || |
977 | !blk_mq_hw_queue_mapped(hctx))) | |
320ae51f JA |
978 | return; |
979 | ||
1b792f2f | 980 | if (!async && !(hctx->flags & BLK_MQ_F_BLOCKING)) { |
2a90d4aa PB |
981 | int cpu = get_cpu(); |
982 | if (cpumask_test_cpu(cpu, hctx->cpumask)) { | |
398205b8 | 983 | __blk_mq_run_hw_queue(hctx); |
2a90d4aa | 984 | put_cpu(); |
398205b8 PB |
985 | return; |
986 | } | |
e4043dcf | 987 | |
2a90d4aa | 988 | put_cpu(); |
e4043dcf | 989 | } |
398205b8 | 990 | |
27489a3c | 991 | kblockd_schedule_work_on(blk_mq_hctx_next_cpu(hctx), &hctx->run_work); |
320ae51f JA |
992 | } |
993 | ||
b94ec296 | 994 | void blk_mq_run_hw_queues(struct request_queue *q, bool async) |
320ae51f JA |
995 | { |
996 | struct blk_mq_hw_ctx *hctx; | |
997 | int i; | |
998 | ||
999 | queue_for_each_hw_ctx(q, hctx, i) { | |
1000 | if ((!blk_mq_hctx_has_pending(hctx) && | |
1001 | list_empty_careful(&hctx->dispatch)) || | |
5d1b25c1 | 1002 | blk_mq_hctx_stopped(hctx)) |
320ae51f JA |
1003 | continue; |
1004 | ||
b94ec296 | 1005 | blk_mq_run_hw_queue(hctx, async); |
320ae51f JA |
1006 | } |
1007 | } | |
b94ec296 | 1008 | EXPORT_SYMBOL(blk_mq_run_hw_queues); |
320ae51f | 1009 | |
fd001443 BVA |
1010 | /** |
1011 | * blk_mq_queue_stopped() - check whether one or more hctxs have been stopped | |
1012 | * @q: request queue. | |
1013 | * | |
1014 | * The caller is responsible for serializing this function against | |
1015 | * blk_mq_{start,stop}_hw_queue(). | |
1016 | */ | |
1017 | bool blk_mq_queue_stopped(struct request_queue *q) | |
1018 | { | |
1019 | struct blk_mq_hw_ctx *hctx; | |
1020 | int i; | |
1021 | ||
1022 | queue_for_each_hw_ctx(q, hctx, i) | |
1023 | if (blk_mq_hctx_stopped(hctx)) | |
1024 | return true; | |
1025 | ||
1026 | return false; | |
1027 | } | |
1028 | EXPORT_SYMBOL(blk_mq_queue_stopped); | |
1029 | ||
320ae51f JA |
1030 | void blk_mq_stop_hw_queue(struct blk_mq_hw_ctx *hctx) |
1031 | { | |
27489a3c | 1032 | cancel_work(&hctx->run_work); |
70f4db63 | 1033 | cancel_delayed_work(&hctx->delay_work); |
320ae51f JA |
1034 | set_bit(BLK_MQ_S_STOPPED, &hctx->state); |
1035 | } | |
1036 | EXPORT_SYMBOL(blk_mq_stop_hw_queue); | |
1037 | ||
280d45f6 CH |
1038 | void blk_mq_stop_hw_queues(struct request_queue *q) |
1039 | { | |
1040 | struct blk_mq_hw_ctx *hctx; | |
1041 | int i; | |
1042 | ||
1043 | queue_for_each_hw_ctx(q, hctx, i) | |
1044 | blk_mq_stop_hw_queue(hctx); | |
1045 | } | |
1046 | EXPORT_SYMBOL(blk_mq_stop_hw_queues); | |
1047 | ||
320ae51f JA |
1048 | void blk_mq_start_hw_queue(struct blk_mq_hw_ctx *hctx) |
1049 | { | |
1050 | clear_bit(BLK_MQ_S_STOPPED, &hctx->state); | |
e4043dcf | 1051 | |
0ffbce80 | 1052 | blk_mq_run_hw_queue(hctx, false); |
320ae51f JA |
1053 | } |
1054 | EXPORT_SYMBOL(blk_mq_start_hw_queue); | |
1055 | ||
2f268556 CH |
1056 | void blk_mq_start_hw_queues(struct request_queue *q) |
1057 | { | |
1058 | struct blk_mq_hw_ctx *hctx; | |
1059 | int i; | |
1060 | ||
1061 | queue_for_each_hw_ctx(q, hctx, i) | |
1062 | blk_mq_start_hw_queue(hctx); | |
1063 | } | |
1064 | EXPORT_SYMBOL(blk_mq_start_hw_queues); | |
1065 | ||
ae911c5e JA |
1066 | void blk_mq_start_stopped_hw_queue(struct blk_mq_hw_ctx *hctx, bool async) |
1067 | { | |
1068 | if (!blk_mq_hctx_stopped(hctx)) | |
1069 | return; | |
1070 | ||
1071 | clear_bit(BLK_MQ_S_STOPPED, &hctx->state); | |
1072 | blk_mq_run_hw_queue(hctx, async); | |
1073 | } | |
1074 | EXPORT_SYMBOL_GPL(blk_mq_start_stopped_hw_queue); | |
1075 | ||
1b4a3258 | 1076 | void blk_mq_start_stopped_hw_queues(struct request_queue *q, bool async) |
320ae51f JA |
1077 | { |
1078 | struct blk_mq_hw_ctx *hctx; | |
1079 | int i; | |
1080 | ||
ae911c5e JA |
1081 | queue_for_each_hw_ctx(q, hctx, i) |
1082 | blk_mq_start_stopped_hw_queue(hctx, async); | |
320ae51f JA |
1083 | } |
1084 | EXPORT_SYMBOL(blk_mq_start_stopped_hw_queues); | |
1085 | ||
70f4db63 | 1086 | static void blk_mq_run_work_fn(struct work_struct *work) |
320ae51f JA |
1087 | { |
1088 | struct blk_mq_hw_ctx *hctx; | |
1089 | ||
27489a3c | 1090 | hctx = container_of(work, struct blk_mq_hw_ctx, run_work); |
e4043dcf | 1091 | |
320ae51f JA |
1092 | __blk_mq_run_hw_queue(hctx); |
1093 | } | |
1094 | ||
70f4db63 CH |
1095 | static void blk_mq_delay_work_fn(struct work_struct *work) |
1096 | { | |
1097 | struct blk_mq_hw_ctx *hctx; | |
1098 | ||
1099 | hctx = container_of(work, struct blk_mq_hw_ctx, delay_work.work); | |
1100 | ||
1101 | if (test_and_clear_bit(BLK_MQ_S_STOPPED, &hctx->state)) | |
1102 | __blk_mq_run_hw_queue(hctx); | |
1103 | } | |
1104 | ||
1105 | void blk_mq_delay_queue(struct blk_mq_hw_ctx *hctx, unsigned long msecs) | |
1106 | { | |
19c66e59 ML |
1107 | if (unlikely(!blk_mq_hw_queue_mapped(hctx))) |
1108 | return; | |
70f4db63 | 1109 | |
b657d7e6 CH |
1110 | kblockd_schedule_delayed_work_on(blk_mq_hctx_next_cpu(hctx), |
1111 | &hctx->delay_work, msecs_to_jiffies(msecs)); | |
70f4db63 CH |
1112 | } |
1113 | EXPORT_SYMBOL(blk_mq_delay_queue); | |
1114 | ||
cfd0c552 | 1115 | static inline void __blk_mq_insert_req_list(struct blk_mq_hw_ctx *hctx, |
cfd0c552 ML |
1116 | struct request *rq, |
1117 | bool at_head) | |
320ae51f | 1118 | { |
e57690fe JA |
1119 | struct blk_mq_ctx *ctx = rq->mq_ctx; |
1120 | ||
01b983c9 JA |
1121 | trace_block_rq_insert(hctx->queue, rq); |
1122 | ||
72a0a36e CH |
1123 | if (at_head) |
1124 | list_add(&rq->queuelist, &ctx->rq_list); | |
1125 | else | |
1126 | list_add_tail(&rq->queuelist, &ctx->rq_list); | |
cfd0c552 | 1127 | } |
4bb659b1 | 1128 | |
cfd0c552 ML |
1129 | static void __blk_mq_insert_request(struct blk_mq_hw_ctx *hctx, |
1130 | struct request *rq, bool at_head) | |
1131 | { | |
1132 | struct blk_mq_ctx *ctx = rq->mq_ctx; | |
1133 | ||
e57690fe | 1134 | __blk_mq_insert_req_list(hctx, rq, at_head); |
320ae51f | 1135 | blk_mq_hctx_mark_pending(hctx, ctx); |
320ae51f JA |
1136 | } |
1137 | ||
eeabc850 | 1138 | void blk_mq_insert_request(struct request *rq, bool at_head, bool run_queue, |
e57690fe | 1139 | bool async) |
320ae51f | 1140 | { |
e57690fe | 1141 | struct blk_mq_ctx *ctx = rq->mq_ctx; |
eeabc850 | 1142 | struct request_queue *q = rq->q; |
7d7e0f90 | 1143 | struct blk_mq_hw_ctx *hctx = blk_mq_map_queue(q, ctx->cpu); |
320ae51f | 1144 | |
a57a178a CH |
1145 | spin_lock(&ctx->lock); |
1146 | __blk_mq_insert_request(hctx, rq, at_head); | |
1147 | spin_unlock(&ctx->lock); | |
320ae51f | 1148 | |
320ae51f JA |
1149 | if (run_queue) |
1150 | blk_mq_run_hw_queue(hctx, async); | |
1151 | } | |
1152 | ||
1153 | static void blk_mq_insert_requests(struct request_queue *q, | |
1154 | struct blk_mq_ctx *ctx, | |
1155 | struct list_head *list, | |
1156 | int depth, | |
1157 | bool from_schedule) | |
1158 | ||
1159 | { | |
7d7e0f90 | 1160 | struct blk_mq_hw_ctx *hctx = blk_mq_map_queue(q, ctx->cpu); |
320ae51f JA |
1161 | |
1162 | trace_block_unplug(q, depth, !from_schedule); | |
1163 | ||
320ae51f JA |
1164 | /* |
1165 | * preemption doesn't flush plug list, so it's possible ctx->cpu is | |
1166 | * offline now | |
1167 | */ | |
1168 | spin_lock(&ctx->lock); | |
1169 | while (!list_empty(list)) { | |
1170 | struct request *rq; | |
1171 | ||
1172 | rq = list_first_entry(list, struct request, queuelist); | |
e57690fe | 1173 | BUG_ON(rq->mq_ctx != ctx); |
320ae51f | 1174 | list_del_init(&rq->queuelist); |
e57690fe | 1175 | __blk_mq_insert_req_list(hctx, rq, false); |
320ae51f | 1176 | } |
cfd0c552 | 1177 | blk_mq_hctx_mark_pending(hctx, ctx); |
320ae51f JA |
1178 | spin_unlock(&ctx->lock); |
1179 | ||
320ae51f JA |
1180 | blk_mq_run_hw_queue(hctx, from_schedule); |
1181 | } | |
1182 | ||
1183 | static int plug_ctx_cmp(void *priv, struct list_head *a, struct list_head *b) | |
1184 | { | |
1185 | struct request *rqa = container_of(a, struct request, queuelist); | |
1186 | struct request *rqb = container_of(b, struct request, queuelist); | |
1187 | ||
1188 | return !(rqa->mq_ctx < rqb->mq_ctx || | |
1189 | (rqa->mq_ctx == rqb->mq_ctx && | |
1190 | blk_rq_pos(rqa) < blk_rq_pos(rqb))); | |
1191 | } | |
1192 | ||
1193 | void blk_mq_flush_plug_list(struct blk_plug *plug, bool from_schedule) | |
1194 | { | |
1195 | struct blk_mq_ctx *this_ctx; | |
1196 | struct request_queue *this_q; | |
1197 | struct request *rq; | |
1198 | LIST_HEAD(list); | |
1199 | LIST_HEAD(ctx_list); | |
1200 | unsigned int depth; | |
1201 | ||
1202 | list_splice_init(&plug->mq_list, &list); | |
1203 | ||
1204 | list_sort(NULL, &list, plug_ctx_cmp); | |
1205 | ||
1206 | this_q = NULL; | |
1207 | this_ctx = NULL; | |
1208 | depth = 0; | |
1209 | ||
1210 | while (!list_empty(&list)) { | |
1211 | rq = list_entry_rq(list.next); | |
1212 | list_del_init(&rq->queuelist); | |
1213 | BUG_ON(!rq->q); | |
1214 | if (rq->mq_ctx != this_ctx) { | |
1215 | if (this_ctx) { | |
1216 | blk_mq_insert_requests(this_q, this_ctx, | |
1217 | &ctx_list, depth, | |
1218 | from_schedule); | |
1219 | } | |
1220 | ||
1221 | this_ctx = rq->mq_ctx; | |
1222 | this_q = rq->q; | |
1223 | depth = 0; | |
1224 | } | |
1225 | ||
1226 | depth++; | |
1227 | list_add_tail(&rq->queuelist, &ctx_list); | |
1228 | } | |
1229 | ||
1230 | /* | |
1231 | * If 'this_ctx' is set, we know we have entries to complete | |
1232 | * on 'ctx_list'. Do those. | |
1233 | */ | |
1234 | if (this_ctx) { | |
1235 | blk_mq_insert_requests(this_q, this_ctx, &ctx_list, depth, | |
1236 | from_schedule); | |
1237 | } | |
1238 | } | |
1239 | ||
1240 | static void blk_mq_bio_to_request(struct request *rq, struct bio *bio) | |
1241 | { | |
1242 | init_request_from_bio(rq, bio); | |
4b570521 | 1243 | |
6e85eaf3 | 1244 | blk_account_io_start(rq, true); |
320ae51f JA |
1245 | } |
1246 | ||
274a5843 JA |
1247 | static inline bool hctx_allow_merges(struct blk_mq_hw_ctx *hctx) |
1248 | { | |
1249 | return (hctx->flags & BLK_MQ_F_SHOULD_MERGE) && | |
1250 | !blk_queue_nomerges(hctx->queue); | |
1251 | } | |
1252 | ||
07068d5b JA |
1253 | static inline bool blk_mq_merge_queue_io(struct blk_mq_hw_ctx *hctx, |
1254 | struct blk_mq_ctx *ctx, | |
1255 | struct request *rq, struct bio *bio) | |
320ae51f | 1256 | { |
e18378a6 | 1257 | if (!hctx_allow_merges(hctx) || !bio_mergeable(bio)) { |
07068d5b JA |
1258 | blk_mq_bio_to_request(rq, bio); |
1259 | spin_lock(&ctx->lock); | |
1260 | insert_rq: | |
1261 | __blk_mq_insert_request(hctx, rq, false); | |
1262 | spin_unlock(&ctx->lock); | |
1263 | return false; | |
1264 | } else { | |
274a5843 JA |
1265 | struct request_queue *q = hctx->queue; |
1266 | ||
07068d5b JA |
1267 | spin_lock(&ctx->lock); |
1268 | if (!blk_mq_attempt_merge(q, ctx, bio)) { | |
1269 | blk_mq_bio_to_request(rq, bio); | |
1270 | goto insert_rq; | |
1271 | } | |
320ae51f | 1272 | |
07068d5b JA |
1273 | spin_unlock(&ctx->lock); |
1274 | __blk_mq_free_request(hctx, ctx, rq); | |
1275 | return true; | |
14ec77f3 | 1276 | } |
07068d5b | 1277 | } |
14ec77f3 | 1278 | |
07068d5b JA |
1279 | static struct request *blk_mq_map_request(struct request_queue *q, |
1280 | struct bio *bio, | |
2552e3f8 | 1281 | struct blk_mq_alloc_data *data) |
07068d5b JA |
1282 | { |
1283 | struct blk_mq_hw_ctx *hctx; | |
1284 | struct blk_mq_ctx *ctx; | |
1285 | struct request *rq; | |
320ae51f | 1286 | |
3ef28e83 | 1287 | blk_queue_enter_live(q); |
320ae51f | 1288 | ctx = blk_mq_get_ctx(q); |
7d7e0f90 | 1289 | hctx = blk_mq_map_queue(q, ctx->cpu); |
320ae51f | 1290 | |
ef295ecf | 1291 | trace_block_getrq(q, bio, bio->bi_opf); |
2552e3f8 | 1292 | blk_mq_set_alloc_data(data, q, 0, ctx, hctx); |
ef295ecf | 1293 | rq = __blk_mq_alloc_request(data, bio->bi_opf); |
320ae51f | 1294 | |
7dd2fb68 | 1295 | data->hctx->queued++; |
07068d5b JA |
1296 | return rq; |
1297 | } | |
1298 | ||
066a4a73 | 1299 | static void blk_mq_try_issue_directly(struct request *rq, blk_qc_t *cookie) |
f984df1f SL |
1300 | { |
1301 | int ret; | |
1302 | struct request_queue *q = rq->q; | |
066a4a73 | 1303 | struct blk_mq_hw_ctx *hctx = blk_mq_map_queue(q, rq->mq_ctx->cpu); |
f984df1f SL |
1304 | struct blk_mq_queue_data bd = { |
1305 | .rq = rq, | |
1306 | .list = NULL, | |
1307 | .last = 1 | |
1308 | }; | |
7b371636 | 1309 | blk_qc_t new_cookie = blk_tag_to_qc_t(rq->tag, hctx->queue_num); |
f984df1f | 1310 | |
2253efc8 BVA |
1311 | if (blk_mq_hctx_stopped(hctx)) |
1312 | goto insert; | |
1313 | ||
f984df1f SL |
1314 | /* |
1315 | * For OK queue, we are done. For error, kill it. Any other | |
1316 | * error (busy), just add it to our list as we previously | |
1317 | * would have done | |
1318 | */ | |
1319 | ret = q->mq_ops->queue_rq(hctx, &bd); | |
7b371636 JA |
1320 | if (ret == BLK_MQ_RQ_QUEUE_OK) { |
1321 | *cookie = new_cookie; | |
2253efc8 | 1322 | return; |
7b371636 | 1323 | } |
f984df1f | 1324 | |
7b371636 JA |
1325 | __blk_mq_requeue_request(rq); |
1326 | ||
1327 | if (ret == BLK_MQ_RQ_QUEUE_ERROR) { | |
1328 | *cookie = BLK_QC_T_NONE; | |
1329 | rq->errors = -EIO; | |
1330 | blk_mq_end_request(rq, rq->errors); | |
2253efc8 | 1331 | return; |
f984df1f | 1332 | } |
7b371636 | 1333 | |
2253efc8 BVA |
1334 | insert: |
1335 | blk_mq_insert_request(rq, false, true, true); | |
f984df1f SL |
1336 | } |
1337 | ||
07068d5b JA |
1338 | /* |
1339 | * Multiple hardware queue variant. This will not use per-process plugs, | |
1340 | * but will attempt to bypass the hctx queueing if we can go straight to | |
1341 | * hardware for SYNC IO. | |
1342 | */ | |
dece1635 | 1343 | static blk_qc_t blk_mq_make_request(struct request_queue *q, struct bio *bio) |
07068d5b | 1344 | { |
ef295ecf | 1345 | const int is_sync = op_is_sync(bio->bi_opf); |
1eff9d32 | 1346 | const int is_flush_fua = bio->bi_opf & (REQ_PREFLUSH | REQ_FUA); |
2552e3f8 | 1347 | struct blk_mq_alloc_data data; |
07068d5b | 1348 | struct request *rq; |
6a83e74d | 1349 | unsigned int request_count = 0, srcu_idx; |
f984df1f | 1350 | struct blk_plug *plug; |
5b3f341f | 1351 | struct request *same_queue_rq = NULL; |
7b371636 | 1352 | blk_qc_t cookie; |
87760e5e | 1353 | unsigned int wb_acct; |
07068d5b JA |
1354 | |
1355 | blk_queue_bounce(q, &bio); | |
1356 | ||
28a2c5f5 WX |
1357 | blk_queue_split(q, &bio, q->bio_split); |
1358 | ||
07068d5b | 1359 | if (bio_integrity_enabled(bio) && bio_integrity_prep(bio)) { |
4246a0b6 | 1360 | bio_io_error(bio); |
dece1635 | 1361 | return BLK_QC_T_NONE; |
07068d5b JA |
1362 | } |
1363 | ||
87c279e6 OS |
1364 | if (!is_flush_fua && !blk_queue_nomerges(q) && |
1365 | blk_attempt_plug_merge(q, bio, &request_count, &same_queue_rq)) | |
1366 | return BLK_QC_T_NONE; | |
f984df1f | 1367 | |
87760e5e JA |
1368 | wb_acct = wbt_wait(q->rq_wb, bio, NULL); |
1369 | ||
07068d5b | 1370 | rq = blk_mq_map_request(q, bio, &data); |
87760e5e JA |
1371 | if (unlikely(!rq)) { |
1372 | __wbt_done(q->rq_wb, wb_acct); | |
dece1635 | 1373 | return BLK_QC_T_NONE; |
87760e5e JA |
1374 | } |
1375 | ||
1376 | wbt_track(&rq->issue_stat, wb_acct); | |
07068d5b | 1377 | |
7b371636 | 1378 | cookie = blk_tag_to_qc_t(rq->tag, data.hctx->queue_num); |
07068d5b JA |
1379 | |
1380 | if (unlikely(is_flush_fua)) { | |
1381 | blk_mq_bio_to_request(rq, bio); | |
1382 | blk_insert_flush(rq); | |
1383 | goto run_queue; | |
1384 | } | |
1385 | ||
f984df1f | 1386 | plug = current->plug; |
e167dfb5 JA |
1387 | /* |
1388 | * If the driver supports defer issued based on 'last', then | |
1389 | * queue it up like normal since we can potentially save some | |
1390 | * CPU this way. | |
1391 | */ | |
f984df1f SL |
1392 | if (((plug && !blk_queue_nomerges(q)) || is_sync) && |
1393 | !(data.hctx->flags & BLK_MQ_F_DEFER_ISSUE)) { | |
1394 | struct request *old_rq = NULL; | |
07068d5b JA |
1395 | |
1396 | blk_mq_bio_to_request(rq, bio); | |
07068d5b JA |
1397 | |
1398 | /* | |
6a83e74d | 1399 | * We do limited plugging. If the bio can be merged, do that. |
f984df1f SL |
1400 | * Otherwise the existing request in the plug list will be |
1401 | * issued. So the plug list will have one request at most | |
07068d5b | 1402 | */ |
f984df1f | 1403 | if (plug) { |
5b3f341f SL |
1404 | /* |
1405 | * The plug list might get flushed before this. If that | |
b094f89c JA |
1406 | * happens, same_queue_rq is invalid and plug list is |
1407 | * empty | |
1408 | */ | |
5b3f341f SL |
1409 | if (same_queue_rq && !list_empty(&plug->mq_list)) { |
1410 | old_rq = same_queue_rq; | |
f984df1f | 1411 | list_del_init(&old_rq->queuelist); |
07068d5b | 1412 | } |
f984df1f SL |
1413 | list_add_tail(&rq->queuelist, &plug->mq_list); |
1414 | } else /* is_sync */ | |
1415 | old_rq = rq; | |
1416 | blk_mq_put_ctx(data.ctx); | |
1417 | if (!old_rq) | |
7b371636 | 1418 | goto done; |
6a83e74d BVA |
1419 | |
1420 | if (!(data.hctx->flags & BLK_MQ_F_BLOCKING)) { | |
1421 | rcu_read_lock(); | |
066a4a73 | 1422 | blk_mq_try_issue_directly(old_rq, &cookie); |
6a83e74d BVA |
1423 | rcu_read_unlock(); |
1424 | } else { | |
1425 | srcu_idx = srcu_read_lock(&data.hctx->queue_rq_srcu); | |
066a4a73 | 1426 | blk_mq_try_issue_directly(old_rq, &cookie); |
6a83e74d BVA |
1427 | srcu_read_unlock(&data.hctx->queue_rq_srcu, srcu_idx); |
1428 | } | |
7b371636 | 1429 | goto done; |
07068d5b JA |
1430 | } |
1431 | ||
1432 | if (!blk_mq_merge_queue_io(data.hctx, data.ctx, rq, bio)) { | |
1433 | /* | |
1434 | * For a SYNC request, send it to the hardware immediately. For | |
1435 | * an ASYNC request, just ensure that we run it later on. The | |
1436 | * latter allows for merging opportunities and more efficient | |
1437 | * dispatching. | |
1438 | */ | |
1439 | run_queue: | |
1440 | blk_mq_run_hw_queue(data.hctx, !is_sync || is_flush_fua); | |
1441 | } | |
07068d5b | 1442 | blk_mq_put_ctx(data.ctx); |
7b371636 JA |
1443 | done: |
1444 | return cookie; | |
07068d5b JA |
1445 | } |
1446 | ||
1447 | /* | |
1448 | * Single hardware queue variant. This will attempt to use any per-process | |
1449 | * plug for merging and IO deferral. | |
1450 | */ | |
dece1635 | 1451 | static blk_qc_t blk_sq_make_request(struct request_queue *q, struct bio *bio) |
07068d5b | 1452 | { |
ef295ecf | 1453 | const int is_sync = op_is_sync(bio->bi_opf); |
1eff9d32 | 1454 | const int is_flush_fua = bio->bi_opf & (REQ_PREFLUSH | REQ_FUA); |
e6c4438b JM |
1455 | struct blk_plug *plug; |
1456 | unsigned int request_count = 0; | |
2552e3f8 | 1457 | struct blk_mq_alloc_data data; |
07068d5b | 1458 | struct request *rq; |
7b371636 | 1459 | blk_qc_t cookie; |
87760e5e | 1460 | unsigned int wb_acct; |
07068d5b | 1461 | |
07068d5b JA |
1462 | blk_queue_bounce(q, &bio); |
1463 | ||
1464 | if (bio_integrity_enabled(bio) && bio_integrity_prep(bio)) { | |
4246a0b6 | 1465 | bio_io_error(bio); |
dece1635 | 1466 | return BLK_QC_T_NONE; |
07068d5b JA |
1467 | } |
1468 | ||
54efd50b KO |
1469 | blk_queue_split(q, &bio, q->bio_split); |
1470 | ||
87c279e6 OS |
1471 | if (!is_flush_fua && !blk_queue_nomerges(q)) { |
1472 | if (blk_attempt_plug_merge(q, bio, &request_count, NULL)) | |
1473 | return BLK_QC_T_NONE; | |
1474 | } else | |
1475 | request_count = blk_plug_queued_count(q); | |
07068d5b | 1476 | |
87760e5e JA |
1477 | wb_acct = wbt_wait(q->rq_wb, bio, NULL); |
1478 | ||
07068d5b | 1479 | rq = blk_mq_map_request(q, bio, &data); |
87760e5e JA |
1480 | if (unlikely(!rq)) { |
1481 | __wbt_done(q->rq_wb, wb_acct); | |
dece1635 | 1482 | return BLK_QC_T_NONE; |
87760e5e JA |
1483 | } |
1484 | ||
1485 | wbt_track(&rq->issue_stat, wb_acct); | |
320ae51f | 1486 | |
7b371636 | 1487 | cookie = blk_tag_to_qc_t(rq->tag, data.hctx->queue_num); |
320ae51f JA |
1488 | |
1489 | if (unlikely(is_flush_fua)) { | |
1490 | blk_mq_bio_to_request(rq, bio); | |
320ae51f JA |
1491 | blk_insert_flush(rq); |
1492 | goto run_queue; | |
1493 | } | |
1494 | ||
1495 | /* | |
1496 | * A task plug currently exists. Since this is completely lockless, | |
1497 | * utilize that to temporarily store requests until the task is | |
1498 | * either done or scheduled away. | |
1499 | */ | |
e6c4438b JM |
1500 | plug = current->plug; |
1501 | if (plug) { | |
600271d9 SL |
1502 | struct request *last = NULL; |
1503 | ||
e6c4438b | 1504 | blk_mq_bio_to_request(rq, bio); |
0a6219a9 ML |
1505 | |
1506 | /* | |
1507 | * @request_count may become stale because of schedule | |
1508 | * out, so check the list again. | |
1509 | */ | |
1510 | if (list_empty(&plug->mq_list)) | |
1511 | request_count = 0; | |
676d0607 | 1512 | if (!request_count) |
e6c4438b | 1513 | trace_block_plug(q); |
600271d9 SL |
1514 | else |
1515 | last = list_entry_rq(plug->mq_list.prev); | |
b094f89c JA |
1516 | |
1517 | blk_mq_put_ctx(data.ctx); | |
1518 | ||
600271d9 SL |
1519 | if (request_count >= BLK_MAX_REQUEST_COUNT || (last && |
1520 | blk_rq_bytes(last) >= BLK_PLUG_FLUSH_SIZE)) { | |
e6c4438b JM |
1521 | blk_flush_plug_list(plug, false); |
1522 | trace_block_plug(q); | |
320ae51f | 1523 | } |
b094f89c | 1524 | |
e6c4438b | 1525 | list_add_tail(&rq->queuelist, &plug->mq_list); |
7b371636 | 1526 | return cookie; |
320ae51f JA |
1527 | } |
1528 | ||
07068d5b JA |
1529 | if (!blk_mq_merge_queue_io(data.hctx, data.ctx, rq, bio)) { |
1530 | /* | |
1531 | * For a SYNC request, send it to the hardware immediately. For | |
1532 | * an ASYNC request, just ensure that we run it later on. The | |
1533 | * latter allows for merging opportunities and more efficient | |
1534 | * dispatching. | |
1535 | */ | |
1536 | run_queue: | |
1537 | blk_mq_run_hw_queue(data.hctx, !is_sync || is_flush_fua); | |
320ae51f JA |
1538 | } |
1539 | ||
07068d5b | 1540 | blk_mq_put_ctx(data.ctx); |
7b371636 | 1541 | return cookie; |
320ae51f JA |
1542 | } |
1543 | ||
24d2f903 CH |
1544 | static void blk_mq_free_rq_map(struct blk_mq_tag_set *set, |
1545 | struct blk_mq_tags *tags, unsigned int hctx_idx) | |
95363efd | 1546 | { |
e9b267d9 | 1547 | struct page *page; |
320ae51f | 1548 | |
24d2f903 | 1549 | if (tags->rqs && set->ops->exit_request) { |
e9b267d9 | 1550 | int i; |
320ae51f | 1551 | |
24d2f903 CH |
1552 | for (i = 0; i < tags->nr_tags; i++) { |
1553 | if (!tags->rqs[i]) | |
e9b267d9 | 1554 | continue; |
24d2f903 CH |
1555 | set->ops->exit_request(set->driver_data, tags->rqs[i], |
1556 | hctx_idx, i); | |
a5164405 | 1557 | tags->rqs[i] = NULL; |
e9b267d9 | 1558 | } |
320ae51f | 1559 | } |
320ae51f | 1560 | |
24d2f903 CH |
1561 | while (!list_empty(&tags->page_list)) { |
1562 | page = list_first_entry(&tags->page_list, struct page, lru); | |
6753471c | 1563 | list_del_init(&page->lru); |
f75782e4 CM |
1564 | /* |
1565 | * Remove kmemleak object previously allocated in | |
1566 | * blk_mq_init_rq_map(). | |
1567 | */ | |
1568 | kmemleak_free(page_address(page)); | |
320ae51f JA |
1569 | __free_pages(page, page->private); |
1570 | } | |
1571 | ||
24d2f903 | 1572 | kfree(tags->rqs); |
320ae51f | 1573 | |
24d2f903 | 1574 | blk_mq_free_tags(tags); |
320ae51f JA |
1575 | } |
1576 | ||
1577 | static size_t order_to_size(unsigned int order) | |
1578 | { | |
4ca08500 | 1579 | return (size_t)PAGE_SIZE << order; |
320ae51f JA |
1580 | } |
1581 | ||
24d2f903 CH |
1582 | static struct blk_mq_tags *blk_mq_init_rq_map(struct blk_mq_tag_set *set, |
1583 | unsigned int hctx_idx) | |
320ae51f | 1584 | { |
24d2f903 | 1585 | struct blk_mq_tags *tags; |
320ae51f JA |
1586 | unsigned int i, j, entries_per_page, max_order = 4; |
1587 | size_t rq_size, left; | |
1588 | ||
24d2f903 | 1589 | tags = blk_mq_init_tags(set->queue_depth, set->reserved_tags, |
24391c0d SL |
1590 | set->numa_node, |
1591 | BLK_MQ_FLAG_TO_ALLOC_POLICY(set->flags)); | |
24d2f903 CH |
1592 | if (!tags) |
1593 | return NULL; | |
320ae51f | 1594 | |
24d2f903 CH |
1595 | INIT_LIST_HEAD(&tags->page_list); |
1596 | ||
a5164405 | 1597 | tags->rqs = kzalloc_node(set->queue_depth * sizeof(struct request *), |
36e1f3d1 | 1598 | GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY, |
a5164405 | 1599 | set->numa_node); |
24d2f903 CH |
1600 | if (!tags->rqs) { |
1601 | blk_mq_free_tags(tags); | |
1602 | return NULL; | |
1603 | } | |
320ae51f JA |
1604 | |
1605 | /* | |
1606 | * rq_size is the size of the request plus driver payload, rounded | |
1607 | * to the cacheline size | |
1608 | */ | |
24d2f903 | 1609 | rq_size = round_up(sizeof(struct request) + set->cmd_size, |
320ae51f | 1610 | cache_line_size()); |
24d2f903 | 1611 | left = rq_size * set->queue_depth; |
320ae51f | 1612 | |
24d2f903 | 1613 | for (i = 0; i < set->queue_depth; ) { |
320ae51f JA |
1614 | int this_order = max_order; |
1615 | struct page *page; | |
1616 | int to_do; | |
1617 | void *p; | |
1618 | ||
b3a834b1 | 1619 | while (this_order && left < order_to_size(this_order - 1)) |
320ae51f JA |
1620 | this_order--; |
1621 | ||
1622 | do { | |
a5164405 | 1623 | page = alloc_pages_node(set->numa_node, |
36e1f3d1 | 1624 | GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY | __GFP_ZERO, |
a5164405 | 1625 | this_order); |
320ae51f JA |
1626 | if (page) |
1627 | break; | |
1628 | if (!this_order--) | |
1629 | break; | |
1630 | if (order_to_size(this_order) < rq_size) | |
1631 | break; | |
1632 | } while (1); | |
1633 | ||
1634 | if (!page) | |
24d2f903 | 1635 | goto fail; |
320ae51f JA |
1636 | |
1637 | page->private = this_order; | |
24d2f903 | 1638 | list_add_tail(&page->lru, &tags->page_list); |
320ae51f JA |
1639 | |
1640 | p = page_address(page); | |
f75782e4 CM |
1641 | /* |
1642 | * Allow kmemleak to scan these pages as they contain pointers | |
1643 | * to additional allocations like via ops->init_request(). | |
1644 | */ | |
36e1f3d1 | 1645 | kmemleak_alloc(p, order_to_size(this_order), 1, GFP_NOIO); |
320ae51f | 1646 | entries_per_page = order_to_size(this_order) / rq_size; |
24d2f903 | 1647 | to_do = min(entries_per_page, set->queue_depth - i); |
320ae51f JA |
1648 | left -= to_do * rq_size; |
1649 | for (j = 0; j < to_do; j++) { | |
24d2f903 CH |
1650 | tags->rqs[i] = p; |
1651 | if (set->ops->init_request) { | |
1652 | if (set->ops->init_request(set->driver_data, | |
1653 | tags->rqs[i], hctx_idx, i, | |
a5164405 JA |
1654 | set->numa_node)) { |
1655 | tags->rqs[i] = NULL; | |
24d2f903 | 1656 | goto fail; |
a5164405 | 1657 | } |
e9b267d9 CH |
1658 | } |
1659 | ||
320ae51f JA |
1660 | p += rq_size; |
1661 | i++; | |
1662 | } | |
1663 | } | |
24d2f903 | 1664 | return tags; |
320ae51f | 1665 | |
24d2f903 | 1666 | fail: |
24d2f903 CH |
1667 | blk_mq_free_rq_map(set, tags, hctx_idx); |
1668 | return NULL; | |
320ae51f JA |
1669 | } |
1670 | ||
e57690fe JA |
1671 | /* |
1672 | * 'cpu' is going away. splice any existing rq_list entries from this | |
1673 | * software queue to the hw queue dispatch list, and ensure that it | |
1674 | * gets run. | |
1675 | */ | |
9467f859 | 1676 | static int blk_mq_hctx_notify_dead(unsigned int cpu, struct hlist_node *node) |
484b4061 | 1677 | { |
9467f859 | 1678 | struct blk_mq_hw_ctx *hctx; |
484b4061 JA |
1679 | struct blk_mq_ctx *ctx; |
1680 | LIST_HEAD(tmp); | |
1681 | ||
9467f859 | 1682 | hctx = hlist_entry_safe(node, struct blk_mq_hw_ctx, cpuhp_dead); |
e57690fe | 1683 | ctx = __blk_mq_get_ctx(hctx->queue, cpu); |
484b4061 JA |
1684 | |
1685 | spin_lock(&ctx->lock); | |
1686 | if (!list_empty(&ctx->rq_list)) { | |
1687 | list_splice_init(&ctx->rq_list, &tmp); | |
1688 | blk_mq_hctx_clear_pending(hctx, ctx); | |
1689 | } | |
1690 | spin_unlock(&ctx->lock); | |
1691 | ||
1692 | if (list_empty(&tmp)) | |
9467f859 | 1693 | return 0; |
484b4061 | 1694 | |
e57690fe JA |
1695 | spin_lock(&hctx->lock); |
1696 | list_splice_tail_init(&tmp, &hctx->dispatch); | |
1697 | spin_unlock(&hctx->lock); | |
484b4061 JA |
1698 | |
1699 | blk_mq_run_hw_queue(hctx, true); | |
9467f859 | 1700 | return 0; |
484b4061 JA |
1701 | } |
1702 | ||
9467f859 | 1703 | static void blk_mq_remove_cpuhp(struct blk_mq_hw_ctx *hctx) |
484b4061 | 1704 | { |
9467f859 TG |
1705 | cpuhp_state_remove_instance_nocalls(CPUHP_BLK_MQ_DEAD, |
1706 | &hctx->cpuhp_dead); | |
484b4061 JA |
1707 | } |
1708 | ||
c3b4afca | 1709 | /* hctx->ctxs will be freed in queue's release handler */ |
08e98fc6 ML |
1710 | static void blk_mq_exit_hctx(struct request_queue *q, |
1711 | struct blk_mq_tag_set *set, | |
1712 | struct blk_mq_hw_ctx *hctx, unsigned int hctx_idx) | |
1713 | { | |
f70ced09 ML |
1714 | unsigned flush_start_tag = set->queue_depth; |
1715 | ||
08e98fc6 ML |
1716 | blk_mq_tag_idle(hctx); |
1717 | ||
f70ced09 ML |
1718 | if (set->ops->exit_request) |
1719 | set->ops->exit_request(set->driver_data, | |
1720 | hctx->fq->flush_rq, hctx_idx, | |
1721 | flush_start_tag + hctx_idx); | |
1722 | ||
08e98fc6 ML |
1723 | if (set->ops->exit_hctx) |
1724 | set->ops->exit_hctx(hctx, hctx_idx); | |
1725 | ||
6a83e74d BVA |
1726 | if (hctx->flags & BLK_MQ_F_BLOCKING) |
1727 | cleanup_srcu_struct(&hctx->queue_rq_srcu); | |
1728 | ||
9467f859 | 1729 | blk_mq_remove_cpuhp(hctx); |
f70ced09 | 1730 | blk_free_flush_queue(hctx->fq); |
88459642 | 1731 | sbitmap_free(&hctx->ctx_map); |
08e98fc6 ML |
1732 | } |
1733 | ||
624dbe47 ML |
1734 | static void blk_mq_exit_hw_queues(struct request_queue *q, |
1735 | struct blk_mq_tag_set *set, int nr_queue) | |
1736 | { | |
1737 | struct blk_mq_hw_ctx *hctx; | |
1738 | unsigned int i; | |
1739 | ||
1740 | queue_for_each_hw_ctx(q, hctx, i) { | |
1741 | if (i == nr_queue) | |
1742 | break; | |
08e98fc6 | 1743 | blk_mq_exit_hctx(q, set, hctx, i); |
624dbe47 | 1744 | } |
624dbe47 ML |
1745 | } |
1746 | ||
1747 | static void blk_mq_free_hw_queues(struct request_queue *q, | |
1748 | struct blk_mq_tag_set *set) | |
1749 | { | |
1750 | struct blk_mq_hw_ctx *hctx; | |
1751 | unsigned int i; | |
1752 | ||
e09aae7e | 1753 | queue_for_each_hw_ctx(q, hctx, i) |
624dbe47 | 1754 | free_cpumask_var(hctx->cpumask); |
624dbe47 ML |
1755 | } |
1756 | ||
08e98fc6 ML |
1757 | static int blk_mq_init_hctx(struct request_queue *q, |
1758 | struct blk_mq_tag_set *set, | |
1759 | struct blk_mq_hw_ctx *hctx, unsigned hctx_idx) | |
320ae51f | 1760 | { |
08e98fc6 | 1761 | int node; |
f70ced09 | 1762 | unsigned flush_start_tag = set->queue_depth; |
08e98fc6 ML |
1763 | |
1764 | node = hctx->numa_node; | |
1765 | if (node == NUMA_NO_NODE) | |
1766 | node = hctx->numa_node = set->numa_node; | |
1767 | ||
27489a3c | 1768 | INIT_WORK(&hctx->run_work, blk_mq_run_work_fn); |
08e98fc6 ML |
1769 | INIT_DELAYED_WORK(&hctx->delay_work, blk_mq_delay_work_fn); |
1770 | spin_lock_init(&hctx->lock); | |
1771 | INIT_LIST_HEAD(&hctx->dispatch); | |
1772 | hctx->queue = q; | |
1773 | hctx->queue_num = hctx_idx; | |
2404e607 | 1774 | hctx->flags = set->flags & ~BLK_MQ_F_TAG_SHARED; |
08e98fc6 | 1775 | |
9467f859 | 1776 | cpuhp_state_add_instance_nocalls(CPUHP_BLK_MQ_DEAD, &hctx->cpuhp_dead); |
08e98fc6 ML |
1777 | |
1778 | hctx->tags = set->tags[hctx_idx]; | |
320ae51f JA |
1779 | |
1780 | /* | |
08e98fc6 ML |
1781 | * Allocate space for all possible cpus to avoid allocation at |
1782 | * runtime | |
320ae51f | 1783 | */ |
08e98fc6 ML |
1784 | hctx->ctxs = kmalloc_node(nr_cpu_ids * sizeof(void *), |
1785 | GFP_KERNEL, node); | |
1786 | if (!hctx->ctxs) | |
1787 | goto unregister_cpu_notifier; | |
320ae51f | 1788 | |
88459642 OS |
1789 | if (sbitmap_init_node(&hctx->ctx_map, nr_cpu_ids, ilog2(8), GFP_KERNEL, |
1790 | node)) | |
08e98fc6 | 1791 | goto free_ctxs; |
320ae51f | 1792 | |
08e98fc6 | 1793 | hctx->nr_ctx = 0; |
320ae51f | 1794 | |
08e98fc6 ML |
1795 | if (set->ops->init_hctx && |
1796 | set->ops->init_hctx(hctx, set->driver_data, hctx_idx)) | |
1797 | goto free_bitmap; | |
320ae51f | 1798 | |
f70ced09 ML |
1799 | hctx->fq = blk_alloc_flush_queue(q, hctx->numa_node, set->cmd_size); |
1800 | if (!hctx->fq) | |
1801 | goto exit_hctx; | |
320ae51f | 1802 | |
f70ced09 ML |
1803 | if (set->ops->init_request && |
1804 | set->ops->init_request(set->driver_data, | |
1805 | hctx->fq->flush_rq, hctx_idx, | |
1806 | flush_start_tag + hctx_idx, node)) | |
1807 | goto free_fq; | |
320ae51f | 1808 | |
6a83e74d BVA |
1809 | if (hctx->flags & BLK_MQ_F_BLOCKING) |
1810 | init_srcu_struct(&hctx->queue_rq_srcu); | |
1811 | ||
08e98fc6 | 1812 | return 0; |
320ae51f | 1813 | |
f70ced09 ML |
1814 | free_fq: |
1815 | kfree(hctx->fq); | |
1816 | exit_hctx: | |
1817 | if (set->ops->exit_hctx) | |
1818 | set->ops->exit_hctx(hctx, hctx_idx); | |
08e98fc6 | 1819 | free_bitmap: |
88459642 | 1820 | sbitmap_free(&hctx->ctx_map); |
08e98fc6 ML |
1821 | free_ctxs: |
1822 | kfree(hctx->ctxs); | |
1823 | unregister_cpu_notifier: | |
9467f859 | 1824 | blk_mq_remove_cpuhp(hctx); |
08e98fc6 ML |
1825 | return -1; |
1826 | } | |
320ae51f | 1827 | |
320ae51f JA |
1828 | static void blk_mq_init_cpu_queues(struct request_queue *q, |
1829 | unsigned int nr_hw_queues) | |
1830 | { | |
1831 | unsigned int i; | |
1832 | ||
1833 | for_each_possible_cpu(i) { | |
1834 | struct blk_mq_ctx *__ctx = per_cpu_ptr(q->queue_ctx, i); | |
1835 | struct blk_mq_hw_ctx *hctx; | |
1836 | ||
1837 | memset(__ctx, 0, sizeof(*__ctx)); | |
1838 | __ctx->cpu = i; | |
1839 | spin_lock_init(&__ctx->lock); | |
1840 | INIT_LIST_HEAD(&__ctx->rq_list); | |
1841 | __ctx->queue = q; | |
cf43e6be JA |
1842 | blk_stat_init(&__ctx->stat[BLK_STAT_READ]); |
1843 | blk_stat_init(&__ctx->stat[BLK_STAT_WRITE]); | |
320ae51f JA |
1844 | |
1845 | /* If the cpu isn't online, the cpu is mapped to first hctx */ | |
320ae51f JA |
1846 | if (!cpu_online(i)) |
1847 | continue; | |
1848 | ||
7d7e0f90 | 1849 | hctx = blk_mq_map_queue(q, i); |
e4043dcf | 1850 | |
320ae51f JA |
1851 | /* |
1852 | * Set local node, IFF we have more than one hw queue. If | |
1853 | * not, we remain on the home node of the device | |
1854 | */ | |
1855 | if (nr_hw_queues > 1 && hctx->numa_node == NUMA_NO_NODE) | |
bffed457 | 1856 | hctx->numa_node = local_memory_node(cpu_to_node(i)); |
320ae51f JA |
1857 | } |
1858 | } | |
1859 | ||
5778322e AM |
1860 | static void blk_mq_map_swqueue(struct request_queue *q, |
1861 | const struct cpumask *online_mask) | |
320ae51f | 1862 | { |
d1b1cea1 | 1863 | unsigned int i, hctx_idx; |
320ae51f JA |
1864 | struct blk_mq_hw_ctx *hctx; |
1865 | struct blk_mq_ctx *ctx; | |
2a34c087 | 1866 | struct blk_mq_tag_set *set = q->tag_set; |
320ae51f | 1867 | |
60de074b AM |
1868 | /* |
1869 | * Avoid others reading imcomplete hctx->cpumask through sysfs | |
1870 | */ | |
1871 | mutex_lock(&q->sysfs_lock); | |
1872 | ||
320ae51f | 1873 | queue_for_each_hw_ctx(q, hctx, i) { |
e4043dcf | 1874 | cpumask_clear(hctx->cpumask); |
320ae51f JA |
1875 | hctx->nr_ctx = 0; |
1876 | } | |
1877 | ||
1878 | /* | |
1879 | * Map software to hardware queues | |
1880 | */ | |
897bb0c7 | 1881 | for_each_possible_cpu(i) { |
320ae51f | 1882 | /* If the cpu isn't online, the cpu is mapped to first hctx */ |
5778322e | 1883 | if (!cpumask_test_cpu(i, online_mask)) |
e4043dcf JA |
1884 | continue; |
1885 | ||
d1b1cea1 GKB |
1886 | hctx_idx = q->mq_map[i]; |
1887 | /* unmapped hw queue can be remapped after CPU topo changed */ | |
1888 | if (!set->tags[hctx_idx]) { | |
1889 | set->tags[hctx_idx] = blk_mq_init_rq_map(set, hctx_idx); | |
1890 | ||
1891 | /* | |
1892 | * If tags initialization fail for some hctx, | |
1893 | * that hctx won't be brought online. In this | |
1894 | * case, remap the current ctx to hctx[0] which | |
1895 | * is guaranteed to always have tags allocated | |
1896 | */ | |
1897 | if (!set->tags[hctx_idx]) | |
1898 | q->mq_map[i] = 0; | |
1899 | } | |
1900 | ||
897bb0c7 | 1901 | ctx = per_cpu_ptr(q->queue_ctx, i); |
7d7e0f90 | 1902 | hctx = blk_mq_map_queue(q, i); |
868f2f0b | 1903 | |
e4043dcf | 1904 | cpumask_set_cpu(i, hctx->cpumask); |
320ae51f JA |
1905 | ctx->index_hw = hctx->nr_ctx; |
1906 | hctx->ctxs[hctx->nr_ctx++] = ctx; | |
1907 | } | |
506e931f | 1908 | |
60de074b AM |
1909 | mutex_unlock(&q->sysfs_lock); |
1910 | ||
506e931f | 1911 | queue_for_each_hw_ctx(q, hctx, i) { |
484b4061 | 1912 | /* |
a68aafa5 JA |
1913 | * If no software queues are mapped to this hardware queue, |
1914 | * disable it and free the request entries. | |
484b4061 JA |
1915 | */ |
1916 | if (!hctx->nr_ctx) { | |
d1b1cea1 GKB |
1917 | /* Never unmap queue 0. We need it as a |
1918 | * fallback in case of a new remap fails | |
1919 | * allocation | |
1920 | */ | |
1921 | if (i && set->tags[i]) { | |
484b4061 JA |
1922 | blk_mq_free_rq_map(set, set->tags[i], i); |
1923 | set->tags[i] = NULL; | |
484b4061 | 1924 | } |
2a34c087 | 1925 | hctx->tags = NULL; |
484b4061 JA |
1926 | continue; |
1927 | } | |
1928 | ||
2a34c087 ML |
1929 | hctx->tags = set->tags[i]; |
1930 | WARN_ON(!hctx->tags); | |
1931 | ||
889fa31f CY |
1932 | /* |
1933 | * Set the map size to the number of mapped software queues. | |
1934 | * This is more accurate and more efficient than looping | |
1935 | * over all possibly mapped software queues. | |
1936 | */ | |
88459642 | 1937 | sbitmap_resize(&hctx->ctx_map, hctx->nr_ctx); |
889fa31f | 1938 | |
484b4061 JA |
1939 | /* |
1940 | * Initialize batch roundrobin counts | |
1941 | */ | |
506e931f JA |
1942 | hctx->next_cpu = cpumask_first(hctx->cpumask); |
1943 | hctx->next_cpu_batch = BLK_MQ_CPU_WORK_BATCH; | |
1944 | } | |
320ae51f JA |
1945 | } |
1946 | ||
2404e607 | 1947 | static void queue_set_hctx_shared(struct request_queue *q, bool shared) |
0d2602ca JA |
1948 | { |
1949 | struct blk_mq_hw_ctx *hctx; | |
0d2602ca JA |
1950 | int i; |
1951 | ||
2404e607 JM |
1952 | queue_for_each_hw_ctx(q, hctx, i) { |
1953 | if (shared) | |
1954 | hctx->flags |= BLK_MQ_F_TAG_SHARED; | |
1955 | else | |
1956 | hctx->flags &= ~BLK_MQ_F_TAG_SHARED; | |
1957 | } | |
1958 | } | |
1959 | ||
1960 | static void blk_mq_update_tag_set_depth(struct blk_mq_tag_set *set, bool shared) | |
1961 | { | |
1962 | struct request_queue *q; | |
0d2602ca JA |
1963 | |
1964 | list_for_each_entry(q, &set->tag_list, tag_set_list) { | |
1965 | blk_mq_freeze_queue(q); | |
2404e607 | 1966 | queue_set_hctx_shared(q, shared); |
0d2602ca JA |
1967 | blk_mq_unfreeze_queue(q); |
1968 | } | |
1969 | } | |
1970 | ||
1971 | static void blk_mq_del_queue_tag_set(struct request_queue *q) | |
1972 | { | |
1973 | struct blk_mq_tag_set *set = q->tag_set; | |
1974 | ||
0d2602ca JA |
1975 | mutex_lock(&set->tag_list_lock); |
1976 | list_del_init(&q->tag_set_list); | |
2404e607 JM |
1977 | if (list_is_singular(&set->tag_list)) { |
1978 | /* just transitioned to unshared */ | |
1979 | set->flags &= ~BLK_MQ_F_TAG_SHARED; | |
1980 | /* update existing queue */ | |
1981 | blk_mq_update_tag_set_depth(set, false); | |
1982 | } | |
0d2602ca | 1983 | mutex_unlock(&set->tag_list_lock); |
0d2602ca JA |
1984 | } |
1985 | ||
1986 | static void blk_mq_add_queue_tag_set(struct blk_mq_tag_set *set, | |
1987 | struct request_queue *q) | |
1988 | { | |
1989 | q->tag_set = set; | |
1990 | ||
1991 | mutex_lock(&set->tag_list_lock); | |
2404e607 JM |
1992 | |
1993 | /* Check to see if we're transitioning to shared (from 1 to 2 queues). */ | |
1994 | if (!list_empty(&set->tag_list) && !(set->flags & BLK_MQ_F_TAG_SHARED)) { | |
1995 | set->flags |= BLK_MQ_F_TAG_SHARED; | |
1996 | /* update existing queue */ | |
1997 | blk_mq_update_tag_set_depth(set, true); | |
1998 | } | |
1999 | if (set->flags & BLK_MQ_F_TAG_SHARED) | |
2000 | queue_set_hctx_shared(q, true); | |
0d2602ca | 2001 | list_add_tail(&q->tag_set_list, &set->tag_list); |
2404e607 | 2002 | |
0d2602ca JA |
2003 | mutex_unlock(&set->tag_list_lock); |
2004 | } | |
2005 | ||
e09aae7e ML |
2006 | /* |
2007 | * It is the actual release handler for mq, but we do it from | |
2008 | * request queue's release handler for avoiding use-after-free | |
2009 | * and headache because q->mq_kobj shouldn't have been introduced, | |
2010 | * but we can't group ctx/kctx kobj without it. | |
2011 | */ | |
2012 | void blk_mq_release(struct request_queue *q) | |
2013 | { | |
2014 | struct blk_mq_hw_ctx *hctx; | |
2015 | unsigned int i; | |
2016 | ||
2017 | /* hctx kobj stays in hctx */ | |
c3b4afca ML |
2018 | queue_for_each_hw_ctx(q, hctx, i) { |
2019 | if (!hctx) | |
2020 | continue; | |
2021 | kfree(hctx->ctxs); | |
e09aae7e | 2022 | kfree(hctx); |
c3b4afca | 2023 | } |
e09aae7e | 2024 | |
a723bab3 AM |
2025 | q->mq_map = NULL; |
2026 | ||
e09aae7e ML |
2027 | kfree(q->queue_hw_ctx); |
2028 | ||
2029 | /* ctx kobj stays in queue_ctx */ | |
2030 | free_percpu(q->queue_ctx); | |
2031 | } | |
2032 | ||
24d2f903 | 2033 | struct request_queue *blk_mq_init_queue(struct blk_mq_tag_set *set) |
b62c21b7 MS |
2034 | { |
2035 | struct request_queue *uninit_q, *q; | |
2036 | ||
2037 | uninit_q = blk_alloc_queue_node(GFP_KERNEL, set->numa_node); | |
2038 | if (!uninit_q) | |
2039 | return ERR_PTR(-ENOMEM); | |
2040 | ||
2041 | q = blk_mq_init_allocated_queue(set, uninit_q); | |
2042 | if (IS_ERR(q)) | |
2043 | blk_cleanup_queue(uninit_q); | |
2044 | ||
2045 | return q; | |
2046 | } | |
2047 | EXPORT_SYMBOL(blk_mq_init_queue); | |
2048 | ||
868f2f0b KB |
2049 | static void blk_mq_realloc_hw_ctxs(struct blk_mq_tag_set *set, |
2050 | struct request_queue *q) | |
320ae51f | 2051 | { |
868f2f0b KB |
2052 | int i, j; |
2053 | struct blk_mq_hw_ctx **hctxs = q->queue_hw_ctx; | |
f14bbe77 | 2054 | |
868f2f0b | 2055 | blk_mq_sysfs_unregister(q); |
24d2f903 | 2056 | for (i = 0; i < set->nr_hw_queues; i++) { |
868f2f0b | 2057 | int node; |
f14bbe77 | 2058 | |
868f2f0b KB |
2059 | if (hctxs[i]) |
2060 | continue; | |
2061 | ||
2062 | node = blk_mq_hw_queue_to_node(q->mq_map, i); | |
cdef54dd CH |
2063 | hctxs[i] = kzalloc_node(sizeof(struct blk_mq_hw_ctx), |
2064 | GFP_KERNEL, node); | |
320ae51f | 2065 | if (!hctxs[i]) |
868f2f0b | 2066 | break; |
320ae51f | 2067 | |
a86073e4 | 2068 | if (!zalloc_cpumask_var_node(&hctxs[i]->cpumask, GFP_KERNEL, |
868f2f0b KB |
2069 | node)) { |
2070 | kfree(hctxs[i]); | |
2071 | hctxs[i] = NULL; | |
2072 | break; | |
2073 | } | |
e4043dcf | 2074 | |
0d2602ca | 2075 | atomic_set(&hctxs[i]->nr_active, 0); |
f14bbe77 | 2076 | hctxs[i]->numa_node = node; |
320ae51f | 2077 | hctxs[i]->queue_num = i; |
868f2f0b KB |
2078 | |
2079 | if (blk_mq_init_hctx(q, set, hctxs[i], i)) { | |
2080 | free_cpumask_var(hctxs[i]->cpumask); | |
2081 | kfree(hctxs[i]); | |
2082 | hctxs[i] = NULL; | |
2083 | break; | |
2084 | } | |
2085 | blk_mq_hctx_kobj_init(hctxs[i]); | |
320ae51f | 2086 | } |
868f2f0b KB |
2087 | for (j = i; j < q->nr_hw_queues; j++) { |
2088 | struct blk_mq_hw_ctx *hctx = hctxs[j]; | |
2089 | ||
2090 | if (hctx) { | |
2091 | if (hctx->tags) { | |
2092 | blk_mq_free_rq_map(set, hctx->tags, j); | |
2093 | set->tags[j] = NULL; | |
2094 | } | |
2095 | blk_mq_exit_hctx(q, set, hctx, j); | |
2096 | free_cpumask_var(hctx->cpumask); | |
2097 | kobject_put(&hctx->kobj); | |
2098 | kfree(hctx->ctxs); | |
2099 | kfree(hctx); | |
2100 | hctxs[j] = NULL; | |
2101 | ||
2102 | } | |
2103 | } | |
2104 | q->nr_hw_queues = i; | |
2105 | blk_mq_sysfs_register(q); | |
2106 | } | |
2107 | ||
2108 | struct request_queue *blk_mq_init_allocated_queue(struct blk_mq_tag_set *set, | |
2109 | struct request_queue *q) | |
2110 | { | |
66841672 ML |
2111 | /* mark the queue as mq asap */ |
2112 | q->mq_ops = set->ops; | |
2113 | ||
868f2f0b KB |
2114 | q->queue_ctx = alloc_percpu(struct blk_mq_ctx); |
2115 | if (!q->queue_ctx) | |
c7de5726 | 2116 | goto err_exit; |
868f2f0b KB |
2117 | |
2118 | q->queue_hw_ctx = kzalloc_node(nr_cpu_ids * sizeof(*(q->queue_hw_ctx)), | |
2119 | GFP_KERNEL, set->numa_node); | |
2120 | if (!q->queue_hw_ctx) | |
2121 | goto err_percpu; | |
2122 | ||
bdd17e75 | 2123 | q->mq_map = set->mq_map; |
868f2f0b KB |
2124 | |
2125 | blk_mq_realloc_hw_ctxs(set, q); | |
2126 | if (!q->nr_hw_queues) | |
2127 | goto err_hctxs; | |
320ae51f | 2128 | |
287922eb | 2129 | INIT_WORK(&q->timeout_work, blk_mq_timeout_work); |
e56f698b | 2130 | blk_queue_rq_timeout(q, set->timeout ? set->timeout : 30 * HZ); |
320ae51f JA |
2131 | |
2132 | q->nr_queues = nr_cpu_ids; | |
320ae51f | 2133 | |
94eddfbe | 2134 | q->queue_flags |= QUEUE_FLAG_MQ_DEFAULT; |
320ae51f | 2135 | |
05f1dd53 JA |
2136 | if (!(set->flags & BLK_MQ_F_SG_MERGE)) |
2137 | q->queue_flags |= 1 << QUEUE_FLAG_NO_SG_MERGE; | |
2138 | ||
1be036e9 CH |
2139 | q->sg_reserved_size = INT_MAX; |
2140 | ||
2849450a | 2141 | INIT_DELAYED_WORK(&q->requeue_work, blk_mq_requeue_work); |
6fca6a61 CH |
2142 | INIT_LIST_HEAD(&q->requeue_list); |
2143 | spin_lock_init(&q->requeue_lock); | |
2144 | ||
07068d5b JA |
2145 | if (q->nr_hw_queues > 1) |
2146 | blk_queue_make_request(q, blk_mq_make_request); | |
2147 | else | |
2148 | blk_queue_make_request(q, blk_sq_make_request); | |
2149 | ||
eba71768 JA |
2150 | /* |
2151 | * Do this after blk_queue_make_request() overrides it... | |
2152 | */ | |
2153 | q->nr_requests = set->queue_depth; | |
2154 | ||
64f1c21e JA |
2155 | /* |
2156 | * Default to classic polling | |
2157 | */ | |
2158 | q->poll_nsec = -1; | |
2159 | ||
24d2f903 CH |
2160 | if (set->ops->complete) |
2161 | blk_queue_softirq_done(q, set->ops->complete); | |
30a91cb4 | 2162 | |
24d2f903 | 2163 | blk_mq_init_cpu_queues(q, set->nr_hw_queues); |
320ae51f | 2164 | |
5778322e | 2165 | get_online_cpus(); |
320ae51f | 2166 | mutex_lock(&all_q_mutex); |
320ae51f | 2167 | |
4593fdbe | 2168 | list_add_tail(&q->all_q_node, &all_q_list); |
0d2602ca | 2169 | blk_mq_add_queue_tag_set(set, q); |
5778322e | 2170 | blk_mq_map_swqueue(q, cpu_online_mask); |
484b4061 | 2171 | |
4593fdbe | 2172 | mutex_unlock(&all_q_mutex); |
5778322e | 2173 | put_online_cpus(); |
4593fdbe | 2174 | |
320ae51f | 2175 | return q; |
18741986 | 2176 | |
320ae51f | 2177 | err_hctxs: |
868f2f0b | 2178 | kfree(q->queue_hw_ctx); |
320ae51f | 2179 | err_percpu: |
868f2f0b | 2180 | free_percpu(q->queue_ctx); |
c7de5726 ML |
2181 | err_exit: |
2182 | q->mq_ops = NULL; | |
320ae51f JA |
2183 | return ERR_PTR(-ENOMEM); |
2184 | } | |
b62c21b7 | 2185 | EXPORT_SYMBOL(blk_mq_init_allocated_queue); |
320ae51f JA |
2186 | |
2187 | void blk_mq_free_queue(struct request_queue *q) | |
2188 | { | |
624dbe47 | 2189 | struct blk_mq_tag_set *set = q->tag_set; |
320ae51f | 2190 | |
0e626368 AM |
2191 | mutex_lock(&all_q_mutex); |
2192 | list_del_init(&q->all_q_node); | |
2193 | mutex_unlock(&all_q_mutex); | |
2194 | ||
87760e5e JA |
2195 | wbt_exit(q); |
2196 | ||
0d2602ca JA |
2197 | blk_mq_del_queue_tag_set(q); |
2198 | ||
624dbe47 ML |
2199 | blk_mq_exit_hw_queues(q, set, set->nr_hw_queues); |
2200 | blk_mq_free_hw_queues(q, set); | |
320ae51f | 2201 | } |
320ae51f JA |
2202 | |
2203 | /* Basically redo blk_mq_init_queue with queue frozen */ | |
5778322e AM |
2204 | static void blk_mq_queue_reinit(struct request_queue *q, |
2205 | const struct cpumask *online_mask) | |
320ae51f | 2206 | { |
4ecd4fef | 2207 | WARN_ON_ONCE(!atomic_read(&q->mq_freeze_depth)); |
320ae51f | 2208 | |
67aec14c JA |
2209 | blk_mq_sysfs_unregister(q); |
2210 | ||
320ae51f JA |
2211 | /* |
2212 | * redo blk_mq_init_cpu_queues and blk_mq_init_hw_queues. FIXME: maybe | |
2213 | * we should change hctx numa_node according to new topology (this | |
2214 | * involves free and re-allocate memory, worthy doing?) | |
2215 | */ | |
2216 | ||
5778322e | 2217 | blk_mq_map_swqueue(q, online_mask); |
320ae51f | 2218 | |
67aec14c | 2219 | blk_mq_sysfs_register(q); |
320ae51f JA |
2220 | } |
2221 | ||
65d5291e SAS |
2222 | /* |
2223 | * New online cpumask which is going to be set in this hotplug event. | |
2224 | * Declare this cpumasks as global as cpu-hotplug operation is invoked | |
2225 | * one-by-one and dynamically allocating this could result in a failure. | |
2226 | */ | |
2227 | static struct cpumask cpuhp_online_new; | |
2228 | ||
2229 | static void blk_mq_queue_reinit_work(void) | |
320ae51f JA |
2230 | { |
2231 | struct request_queue *q; | |
320ae51f JA |
2232 | |
2233 | mutex_lock(&all_q_mutex); | |
f3af020b TH |
2234 | /* |
2235 | * We need to freeze and reinit all existing queues. Freezing | |
2236 | * involves synchronous wait for an RCU grace period and doing it | |
2237 | * one by one may take a long time. Start freezing all queues in | |
2238 | * one swoop and then wait for the completions so that freezing can | |
2239 | * take place in parallel. | |
2240 | */ | |
2241 | list_for_each_entry(q, &all_q_list, all_q_node) | |
2242 | blk_mq_freeze_queue_start(q); | |
415d3dab | 2243 | list_for_each_entry(q, &all_q_list, all_q_node) |
f3af020b TH |
2244 | blk_mq_freeze_queue_wait(q); |
2245 | ||
320ae51f | 2246 | list_for_each_entry(q, &all_q_list, all_q_node) |
65d5291e | 2247 | blk_mq_queue_reinit(q, &cpuhp_online_new); |
f3af020b TH |
2248 | |
2249 | list_for_each_entry(q, &all_q_list, all_q_node) | |
2250 | blk_mq_unfreeze_queue(q); | |
2251 | ||
320ae51f | 2252 | mutex_unlock(&all_q_mutex); |
65d5291e SAS |
2253 | } |
2254 | ||
2255 | static int blk_mq_queue_reinit_dead(unsigned int cpu) | |
2256 | { | |
97a32864 | 2257 | cpumask_copy(&cpuhp_online_new, cpu_online_mask); |
65d5291e SAS |
2258 | blk_mq_queue_reinit_work(); |
2259 | return 0; | |
2260 | } | |
2261 | ||
2262 | /* | |
2263 | * Before hotadded cpu starts handling requests, new mappings must be | |
2264 | * established. Otherwise, these requests in hw queue might never be | |
2265 | * dispatched. | |
2266 | * | |
2267 | * For example, there is a single hw queue (hctx) and two CPU queues (ctx0 | |
2268 | * for CPU0, and ctx1 for CPU1). | |
2269 | * | |
2270 | * Now CPU1 is just onlined and a request is inserted into ctx1->rq_list | |
2271 | * and set bit0 in pending bitmap as ctx1->index_hw is still zero. | |
2272 | * | |
2273 | * And then while running hw queue, flush_busy_ctxs() finds bit0 is set in | |
2274 | * pending bitmap and tries to retrieve requests in hctx->ctxs[0]->rq_list. | |
2275 | * But htx->ctxs[0] is a pointer to ctx0, so the request in ctx1->rq_list | |
2276 | * is ignored. | |
2277 | */ | |
2278 | static int blk_mq_queue_reinit_prepare(unsigned int cpu) | |
2279 | { | |
2280 | cpumask_copy(&cpuhp_online_new, cpu_online_mask); | |
2281 | cpumask_set_cpu(cpu, &cpuhp_online_new); | |
2282 | blk_mq_queue_reinit_work(); | |
2283 | return 0; | |
320ae51f JA |
2284 | } |
2285 | ||
a5164405 JA |
2286 | static int __blk_mq_alloc_rq_maps(struct blk_mq_tag_set *set) |
2287 | { | |
2288 | int i; | |
2289 | ||
2290 | for (i = 0; i < set->nr_hw_queues; i++) { | |
2291 | set->tags[i] = blk_mq_init_rq_map(set, i); | |
2292 | if (!set->tags[i]) | |
2293 | goto out_unwind; | |
2294 | } | |
2295 | ||
2296 | return 0; | |
2297 | ||
2298 | out_unwind: | |
2299 | while (--i >= 0) | |
2300 | blk_mq_free_rq_map(set, set->tags[i], i); | |
2301 | ||
a5164405 JA |
2302 | return -ENOMEM; |
2303 | } | |
2304 | ||
2305 | /* | |
2306 | * Allocate the request maps associated with this tag_set. Note that this | |
2307 | * may reduce the depth asked for, if memory is tight. set->queue_depth | |
2308 | * will be updated to reflect the allocated depth. | |
2309 | */ | |
2310 | static int blk_mq_alloc_rq_maps(struct blk_mq_tag_set *set) | |
2311 | { | |
2312 | unsigned int depth; | |
2313 | int err; | |
2314 | ||
2315 | depth = set->queue_depth; | |
2316 | do { | |
2317 | err = __blk_mq_alloc_rq_maps(set); | |
2318 | if (!err) | |
2319 | break; | |
2320 | ||
2321 | set->queue_depth >>= 1; | |
2322 | if (set->queue_depth < set->reserved_tags + BLK_MQ_TAG_MIN) { | |
2323 | err = -ENOMEM; | |
2324 | break; | |
2325 | } | |
2326 | } while (set->queue_depth); | |
2327 | ||
2328 | if (!set->queue_depth || err) { | |
2329 | pr_err("blk-mq: failed to allocate request map\n"); | |
2330 | return -ENOMEM; | |
2331 | } | |
2332 | ||
2333 | if (depth != set->queue_depth) | |
2334 | pr_info("blk-mq: reduced tag depth (%u -> %u)\n", | |
2335 | depth, set->queue_depth); | |
2336 | ||
2337 | return 0; | |
2338 | } | |
2339 | ||
a4391c64 JA |
2340 | /* |
2341 | * Alloc a tag set to be associated with one or more request queues. | |
2342 | * May fail with EINVAL for various error conditions. May adjust the | |
2343 | * requested depth down, if if it too large. In that case, the set | |
2344 | * value will be stored in set->queue_depth. | |
2345 | */ | |
24d2f903 CH |
2346 | int blk_mq_alloc_tag_set(struct blk_mq_tag_set *set) |
2347 | { | |
da695ba2 CH |
2348 | int ret; |
2349 | ||
205fb5f5 BVA |
2350 | BUILD_BUG_ON(BLK_MQ_MAX_DEPTH > 1 << BLK_MQ_UNIQUE_TAG_BITS); |
2351 | ||
24d2f903 CH |
2352 | if (!set->nr_hw_queues) |
2353 | return -EINVAL; | |
a4391c64 | 2354 | if (!set->queue_depth) |
24d2f903 CH |
2355 | return -EINVAL; |
2356 | if (set->queue_depth < set->reserved_tags + BLK_MQ_TAG_MIN) | |
2357 | return -EINVAL; | |
2358 | ||
7d7e0f90 | 2359 | if (!set->ops->queue_rq) |
24d2f903 CH |
2360 | return -EINVAL; |
2361 | ||
a4391c64 JA |
2362 | if (set->queue_depth > BLK_MQ_MAX_DEPTH) { |
2363 | pr_info("blk-mq: reduced tag depth to %u\n", | |
2364 | BLK_MQ_MAX_DEPTH); | |
2365 | set->queue_depth = BLK_MQ_MAX_DEPTH; | |
2366 | } | |
24d2f903 | 2367 | |
6637fadf SL |
2368 | /* |
2369 | * If a crashdump is active, then we are potentially in a very | |
2370 | * memory constrained environment. Limit us to 1 queue and | |
2371 | * 64 tags to prevent using too much memory. | |
2372 | */ | |
2373 | if (is_kdump_kernel()) { | |
2374 | set->nr_hw_queues = 1; | |
2375 | set->queue_depth = min(64U, set->queue_depth); | |
2376 | } | |
868f2f0b KB |
2377 | /* |
2378 | * There is no use for more h/w queues than cpus. | |
2379 | */ | |
2380 | if (set->nr_hw_queues > nr_cpu_ids) | |
2381 | set->nr_hw_queues = nr_cpu_ids; | |
6637fadf | 2382 | |
868f2f0b | 2383 | set->tags = kzalloc_node(nr_cpu_ids * sizeof(struct blk_mq_tags *), |
24d2f903 CH |
2384 | GFP_KERNEL, set->numa_node); |
2385 | if (!set->tags) | |
a5164405 | 2386 | return -ENOMEM; |
24d2f903 | 2387 | |
da695ba2 CH |
2388 | ret = -ENOMEM; |
2389 | set->mq_map = kzalloc_node(sizeof(*set->mq_map) * nr_cpu_ids, | |
2390 | GFP_KERNEL, set->numa_node); | |
bdd17e75 CH |
2391 | if (!set->mq_map) |
2392 | goto out_free_tags; | |
2393 | ||
da695ba2 CH |
2394 | if (set->ops->map_queues) |
2395 | ret = set->ops->map_queues(set); | |
2396 | else | |
2397 | ret = blk_mq_map_queues(set); | |
2398 | if (ret) | |
2399 | goto out_free_mq_map; | |
2400 | ||
2401 | ret = blk_mq_alloc_rq_maps(set); | |
2402 | if (ret) | |
bdd17e75 | 2403 | goto out_free_mq_map; |
24d2f903 | 2404 | |
0d2602ca JA |
2405 | mutex_init(&set->tag_list_lock); |
2406 | INIT_LIST_HEAD(&set->tag_list); | |
2407 | ||
24d2f903 | 2408 | return 0; |
bdd17e75 CH |
2409 | |
2410 | out_free_mq_map: | |
2411 | kfree(set->mq_map); | |
2412 | set->mq_map = NULL; | |
2413 | out_free_tags: | |
5676e7b6 RE |
2414 | kfree(set->tags); |
2415 | set->tags = NULL; | |
da695ba2 | 2416 | return ret; |
24d2f903 CH |
2417 | } |
2418 | EXPORT_SYMBOL(blk_mq_alloc_tag_set); | |
2419 | ||
2420 | void blk_mq_free_tag_set(struct blk_mq_tag_set *set) | |
2421 | { | |
2422 | int i; | |
2423 | ||
868f2f0b | 2424 | for (i = 0; i < nr_cpu_ids; i++) { |
f42d79ab | 2425 | if (set->tags[i]) |
484b4061 JA |
2426 | blk_mq_free_rq_map(set, set->tags[i], i); |
2427 | } | |
2428 | ||
bdd17e75 CH |
2429 | kfree(set->mq_map); |
2430 | set->mq_map = NULL; | |
2431 | ||
981bd189 | 2432 | kfree(set->tags); |
5676e7b6 | 2433 | set->tags = NULL; |
24d2f903 CH |
2434 | } |
2435 | EXPORT_SYMBOL(blk_mq_free_tag_set); | |
2436 | ||
e3a2b3f9 JA |
2437 | int blk_mq_update_nr_requests(struct request_queue *q, unsigned int nr) |
2438 | { | |
2439 | struct blk_mq_tag_set *set = q->tag_set; | |
2440 | struct blk_mq_hw_ctx *hctx; | |
2441 | int i, ret; | |
2442 | ||
2443 | if (!set || nr > set->queue_depth) | |
2444 | return -EINVAL; | |
2445 | ||
2446 | ret = 0; | |
2447 | queue_for_each_hw_ctx(q, hctx, i) { | |
e9137d4b KB |
2448 | if (!hctx->tags) |
2449 | continue; | |
e3a2b3f9 JA |
2450 | ret = blk_mq_tag_update_depth(hctx->tags, nr); |
2451 | if (ret) | |
2452 | break; | |
2453 | } | |
2454 | ||
2455 | if (!ret) | |
2456 | q->nr_requests = nr; | |
2457 | ||
2458 | return ret; | |
2459 | } | |
2460 | ||
868f2f0b KB |
2461 | void blk_mq_update_nr_hw_queues(struct blk_mq_tag_set *set, int nr_hw_queues) |
2462 | { | |
2463 | struct request_queue *q; | |
2464 | ||
2465 | if (nr_hw_queues > nr_cpu_ids) | |
2466 | nr_hw_queues = nr_cpu_ids; | |
2467 | if (nr_hw_queues < 1 || nr_hw_queues == set->nr_hw_queues) | |
2468 | return; | |
2469 | ||
2470 | list_for_each_entry(q, &set->tag_list, tag_set_list) | |
2471 | blk_mq_freeze_queue(q); | |
2472 | ||
2473 | set->nr_hw_queues = nr_hw_queues; | |
2474 | list_for_each_entry(q, &set->tag_list, tag_set_list) { | |
2475 | blk_mq_realloc_hw_ctxs(set, q); | |
2476 | ||
2477 | if (q->nr_hw_queues > 1) | |
2478 | blk_queue_make_request(q, blk_mq_make_request); | |
2479 | else | |
2480 | blk_queue_make_request(q, blk_sq_make_request); | |
2481 | ||
2482 | blk_mq_queue_reinit(q, cpu_online_mask); | |
2483 | } | |
2484 | ||
2485 | list_for_each_entry(q, &set->tag_list, tag_set_list) | |
2486 | blk_mq_unfreeze_queue(q); | |
2487 | } | |
2488 | EXPORT_SYMBOL_GPL(blk_mq_update_nr_hw_queues); | |
2489 | ||
64f1c21e JA |
2490 | static unsigned long blk_mq_poll_nsecs(struct request_queue *q, |
2491 | struct blk_mq_hw_ctx *hctx, | |
2492 | struct request *rq) | |
2493 | { | |
2494 | struct blk_rq_stat stat[2]; | |
2495 | unsigned long ret = 0; | |
2496 | ||
2497 | /* | |
2498 | * If stats collection isn't on, don't sleep but turn it on for | |
2499 | * future users | |
2500 | */ | |
2501 | if (!blk_stat_enable(q)) | |
2502 | return 0; | |
2503 | ||
2504 | /* | |
2505 | * We don't have to do this once per IO, should optimize this | |
2506 | * to just use the current window of stats until it changes | |
2507 | */ | |
2508 | memset(&stat, 0, sizeof(stat)); | |
2509 | blk_hctx_stat_get(hctx, stat); | |
2510 | ||
2511 | /* | |
2512 | * As an optimistic guess, use half of the mean service time | |
2513 | * for this type of request. We can (and should) make this smarter. | |
2514 | * For instance, if the completion latencies are tight, we can | |
2515 | * get closer than just half the mean. This is especially | |
2516 | * important on devices where the completion latencies are longer | |
2517 | * than ~10 usec. | |
2518 | */ | |
2519 | if (req_op(rq) == REQ_OP_READ && stat[BLK_STAT_READ].nr_samples) | |
2520 | ret = (stat[BLK_STAT_READ].mean + 1) / 2; | |
2521 | else if (req_op(rq) == REQ_OP_WRITE && stat[BLK_STAT_WRITE].nr_samples) | |
2522 | ret = (stat[BLK_STAT_WRITE].mean + 1) / 2; | |
2523 | ||
2524 | return ret; | |
2525 | } | |
2526 | ||
06426adf | 2527 | static bool blk_mq_poll_hybrid_sleep(struct request_queue *q, |
64f1c21e | 2528 | struct blk_mq_hw_ctx *hctx, |
06426adf JA |
2529 | struct request *rq) |
2530 | { | |
2531 | struct hrtimer_sleeper hs; | |
2532 | enum hrtimer_mode mode; | |
64f1c21e | 2533 | unsigned int nsecs; |
06426adf JA |
2534 | ktime_t kt; |
2535 | ||
64f1c21e JA |
2536 | if (test_bit(REQ_ATOM_POLL_SLEPT, &rq->atomic_flags)) |
2537 | return false; | |
2538 | ||
2539 | /* | |
2540 | * poll_nsec can be: | |
2541 | * | |
2542 | * -1: don't ever hybrid sleep | |
2543 | * 0: use half of prev avg | |
2544 | * >0: use this specific value | |
2545 | */ | |
2546 | if (q->poll_nsec == -1) | |
2547 | return false; | |
2548 | else if (q->poll_nsec > 0) | |
2549 | nsecs = q->poll_nsec; | |
2550 | else | |
2551 | nsecs = blk_mq_poll_nsecs(q, hctx, rq); | |
2552 | ||
2553 | if (!nsecs) | |
06426adf JA |
2554 | return false; |
2555 | ||
2556 | set_bit(REQ_ATOM_POLL_SLEPT, &rq->atomic_flags); | |
2557 | ||
2558 | /* | |
2559 | * This will be replaced with the stats tracking code, using | |
2560 | * 'avg_completion_time / 2' as the pre-sleep target. | |
2561 | */ | |
8b0e1953 | 2562 | kt = nsecs; |
06426adf JA |
2563 | |
2564 | mode = HRTIMER_MODE_REL; | |
2565 | hrtimer_init_on_stack(&hs.timer, CLOCK_MONOTONIC, mode); | |
2566 | hrtimer_set_expires(&hs.timer, kt); | |
2567 | ||
2568 | hrtimer_init_sleeper(&hs, current); | |
2569 | do { | |
2570 | if (test_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags)) | |
2571 | break; | |
2572 | set_current_state(TASK_UNINTERRUPTIBLE); | |
2573 | hrtimer_start_expires(&hs.timer, mode); | |
2574 | if (hs.task) | |
2575 | io_schedule(); | |
2576 | hrtimer_cancel(&hs.timer); | |
2577 | mode = HRTIMER_MODE_ABS; | |
2578 | } while (hs.task && !signal_pending(current)); | |
2579 | ||
2580 | __set_current_state(TASK_RUNNING); | |
2581 | destroy_hrtimer_on_stack(&hs.timer); | |
2582 | return true; | |
2583 | } | |
2584 | ||
bbd7bb70 JA |
2585 | static bool __blk_mq_poll(struct blk_mq_hw_ctx *hctx, struct request *rq) |
2586 | { | |
2587 | struct request_queue *q = hctx->queue; | |
2588 | long state; | |
2589 | ||
06426adf JA |
2590 | /* |
2591 | * If we sleep, have the caller restart the poll loop to reset | |
2592 | * the state. Like for the other success return cases, the | |
2593 | * caller is responsible for checking if the IO completed. If | |
2594 | * the IO isn't complete, we'll get called again and will go | |
2595 | * straight to the busy poll loop. | |
2596 | */ | |
64f1c21e | 2597 | if (blk_mq_poll_hybrid_sleep(q, hctx, rq)) |
06426adf JA |
2598 | return true; |
2599 | ||
bbd7bb70 JA |
2600 | hctx->poll_considered++; |
2601 | ||
2602 | state = current->state; | |
2603 | while (!need_resched()) { | |
2604 | int ret; | |
2605 | ||
2606 | hctx->poll_invoked++; | |
2607 | ||
2608 | ret = q->mq_ops->poll(hctx, rq->tag); | |
2609 | if (ret > 0) { | |
2610 | hctx->poll_success++; | |
2611 | set_current_state(TASK_RUNNING); | |
2612 | return true; | |
2613 | } | |
2614 | ||
2615 | if (signal_pending_state(state, current)) | |
2616 | set_current_state(TASK_RUNNING); | |
2617 | ||
2618 | if (current->state == TASK_RUNNING) | |
2619 | return true; | |
2620 | if (ret < 0) | |
2621 | break; | |
2622 | cpu_relax(); | |
2623 | } | |
2624 | ||
2625 | return false; | |
2626 | } | |
2627 | ||
2628 | bool blk_mq_poll(struct request_queue *q, blk_qc_t cookie) | |
2629 | { | |
2630 | struct blk_mq_hw_ctx *hctx; | |
2631 | struct blk_plug *plug; | |
2632 | struct request *rq; | |
2633 | ||
2634 | if (!q->mq_ops || !q->mq_ops->poll || !blk_qc_t_valid(cookie) || | |
2635 | !test_bit(QUEUE_FLAG_POLL, &q->queue_flags)) | |
2636 | return false; | |
2637 | ||
2638 | plug = current->plug; | |
2639 | if (plug) | |
2640 | blk_flush_plug_list(plug, false); | |
2641 | ||
2642 | hctx = q->queue_hw_ctx[blk_qc_t_to_queue_num(cookie)]; | |
2643 | rq = blk_mq_tag_to_rq(hctx->tags, blk_qc_t_to_tag(cookie)); | |
2644 | ||
2645 | return __blk_mq_poll(hctx, rq); | |
2646 | } | |
2647 | EXPORT_SYMBOL_GPL(blk_mq_poll); | |
2648 | ||
676141e4 JA |
2649 | void blk_mq_disable_hotplug(void) |
2650 | { | |
2651 | mutex_lock(&all_q_mutex); | |
2652 | } | |
2653 | ||
2654 | void blk_mq_enable_hotplug(void) | |
2655 | { | |
2656 | mutex_unlock(&all_q_mutex); | |
2657 | } | |
2658 | ||
320ae51f JA |
2659 | static int __init blk_mq_init(void) |
2660 | { | |
9467f859 TG |
2661 | cpuhp_setup_state_multi(CPUHP_BLK_MQ_DEAD, "block/mq:dead", NULL, |
2662 | blk_mq_hctx_notify_dead); | |
320ae51f | 2663 | |
65d5291e SAS |
2664 | cpuhp_setup_state_nocalls(CPUHP_BLK_MQ_PREPARE, "block/mq:prepare", |
2665 | blk_mq_queue_reinit_prepare, | |
2666 | blk_mq_queue_reinit_dead); | |
320ae51f JA |
2667 | return 0; |
2668 | } | |
2669 | subsys_initcall(blk_mq_init); |