Commit | Line | Data |
---|---|---|
3dcf60bc | 1 | // SPDX-License-Identifier: GPL-2.0 |
75bb4625 JA |
2 | /* |
3 | * Block multiqueue core code | |
4 | * | |
5 | * Copyright (C) 2013-2014 Jens Axboe | |
6 | * Copyright (C) 2013-2014 Christoph Hellwig | |
7 | */ | |
320ae51f JA |
8 | #include <linux/kernel.h> |
9 | #include <linux/module.h> | |
10 | #include <linux/backing-dev.h> | |
11 | #include <linux/bio.h> | |
12 | #include <linux/blkdev.h> | |
fe45e630 | 13 | #include <linux/blk-integrity.h> |
f75782e4 | 14 | #include <linux/kmemleak.h> |
320ae51f JA |
15 | #include <linux/mm.h> |
16 | #include <linux/init.h> | |
17 | #include <linux/slab.h> | |
18 | #include <linux/workqueue.h> | |
19 | #include <linux/smp.h> | |
e41d12f5 | 20 | #include <linux/interrupt.h> |
320ae51f | 21 | #include <linux/llist.h> |
320ae51f JA |
22 | #include <linux/cpu.h> |
23 | #include <linux/cache.h> | |
24 | #include <linux/sched/sysctl.h> | |
105ab3d8 | 25 | #include <linux/sched/topology.h> |
174cd4b1 | 26 | #include <linux/sched/signal.h> |
320ae51f | 27 | #include <linux/delay.h> |
aedcd72f | 28 | #include <linux/crash_dump.h> |
88c7b2b7 | 29 | #include <linux/prefetch.h> |
a892c8d5 | 30 | #include <linux/blk-crypto.h> |
82d981d4 | 31 | #include <linux/part_stat.h> |
320ae51f JA |
32 | |
33 | #include <trace/events/block.h> | |
34 | ||
54d4e6ab | 35 | #include <linux/t10-pi.h> |
320ae51f JA |
36 | #include "blk.h" |
37 | #include "blk-mq.h" | |
9c1051aa | 38 | #include "blk-mq-debugfs.h" |
986d413b | 39 | #include "blk-pm.h" |
cf43e6be | 40 | #include "blk-stat.h" |
bd166ef1 | 41 | #include "blk-mq-sched.h" |
c1c80384 | 42 | #include "blk-rq-qos.h" |
82b74cac | 43 | #include "blk-ioprio.h" |
320ae51f | 44 | |
f9ab4918 | 45 | static DEFINE_PER_CPU(struct llist_head, blk_cpu_done); |
c3077b5d | 46 | |
710fa378 | 47 | static void blk_mq_insert_request(struct request *rq, blk_insert_t flags); |
94aa228c CH |
48 | static void blk_mq_try_issue_list_directly(struct blk_mq_hw_ctx *hctx, |
49 | struct list_head *list); | |
3e08773c | 50 | |
f70299f0 CH |
51 | static inline struct blk_mq_hw_ctx *blk_qc_to_hctx(struct request_queue *q, |
52 | blk_qc_t qc) | |
53 | { | |
54bdd67d | 54 | return xa_load(&q->hctx_table, qc); |
c6699d6f CH |
55 | } |
56 | ||
3e08773c CH |
57 | static inline blk_qc_t blk_rq_to_qc(struct request *rq) |
58 | { | |
54bdd67d | 59 | return rq->mq_hctx->queue_num; |
3e08773c CH |
60 | } |
61 | ||
320ae51f | 62 | /* |
85fae294 YY |
63 | * Check if any of the ctx, dispatch list or elevator |
64 | * have pending work in this hardware queue. | |
320ae51f | 65 | */ |
79f720a7 | 66 | static bool blk_mq_hctx_has_pending(struct blk_mq_hw_ctx *hctx) |
320ae51f | 67 | { |
79f720a7 JA |
68 | return !list_empty_careful(&hctx->dispatch) || |
69 | sbitmap_any_bit_set(&hctx->ctx_map) || | |
bd166ef1 | 70 | blk_mq_sched_has_work(hctx); |
1429d7c9 JA |
71 | } |
72 | ||
320ae51f JA |
73 | /* |
74 | * Mark this ctx as having pending work in this hardware queue | |
75 | */ | |
76 | static void blk_mq_hctx_mark_pending(struct blk_mq_hw_ctx *hctx, | |
77 | struct blk_mq_ctx *ctx) | |
78 | { | |
f31967f0 JA |
79 | const int bit = ctx->index_hw[hctx->type]; |
80 | ||
81 | if (!sbitmap_test_bit(&hctx->ctx_map, bit)) | |
82 | sbitmap_set_bit(&hctx->ctx_map, bit); | |
1429d7c9 JA |
83 | } |
84 | ||
85 | static void blk_mq_hctx_clear_pending(struct blk_mq_hw_ctx *hctx, | |
86 | struct blk_mq_ctx *ctx) | |
87 | { | |
f31967f0 JA |
88 | const int bit = ctx->index_hw[hctx->type]; |
89 | ||
90 | sbitmap_clear_bit(&hctx->ctx_map, bit); | |
320ae51f JA |
91 | } |
92 | ||
f299b7c7 | 93 | struct mq_inflight { |
8446fe92 | 94 | struct block_device *part; |
a2e80f6f | 95 | unsigned int inflight[2]; |
f299b7c7 JA |
96 | }; |
97 | ||
2dd6532e | 98 | static bool blk_mq_check_inflight(struct request *rq, void *priv) |
f299b7c7 JA |
99 | { |
100 | struct mq_inflight *mi = priv; | |
101 | ||
b81c14ca HW |
102 | if (rq->part && blk_do_io_stat(rq) && |
103 | (!mi->part->bd_partno || rq->part == mi->part) && | |
b0d97557 | 104 | blk_mq_rq_state(rq) == MQ_RQ_IN_FLIGHT) |
bb4e6b14 | 105 | mi->inflight[rq_data_dir(rq)]++; |
7baa8572 JA |
106 | |
107 | return true; | |
f299b7c7 JA |
108 | } |
109 | ||
8446fe92 CH |
110 | unsigned int blk_mq_in_flight(struct request_queue *q, |
111 | struct block_device *part) | |
f299b7c7 | 112 | { |
a2e80f6f | 113 | struct mq_inflight mi = { .part = part }; |
f299b7c7 | 114 | |
f299b7c7 | 115 | blk_mq_queue_tag_busy_iter(q, blk_mq_check_inflight, &mi); |
e016b782 | 116 | |
a2e80f6f | 117 | return mi.inflight[0] + mi.inflight[1]; |
bf0ddaba OS |
118 | } |
119 | ||
8446fe92 CH |
120 | void blk_mq_in_flight_rw(struct request_queue *q, struct block_device *part, |
121 | unsigned int inflight[2]) | |
bf0ddaba | 122 | { |
a2e80f6f | 123 | struct mq_inflight mi = { .part = part }; |
bf0ddaba | 124 | |
bb4e6b14 | 125 | blk_mq_queue_tag_busy_iter(q, blk_mq_check_inflight, &mi); |
a2e80f6f PB |
126 | inflight[0] = mi.inflight[0]; |
127 | inflight[1] = mi.inflight[1]; | |
bf0ddaba OS |
128 | } |
129 | ||
1671d522 | 130 | void blk_freeze_queue_start(struct request_queue *q) |
43a5e4e2 | 131 | { |
7996a8b5 BL |
132 | mutex_lock(&q->mq_freeze_lock); |
133 | if (++q->mq_freeze_depth == 1) { | |
3ef28e83 | 134 | percpu_ref_kill(&q->q_usage_counter); |
7996a8b5 | 135 | mutex_unlock(&q->mq_freeze_lock); |
344e9ffc | 136 | if (queue_is_mq(q)) |
055f6e18 | 137 | blk_mq_run_hw_queues(q, false); |
7996a8b5 BL |
138 | } else { |
139 | mutex_unlock(&q->mq_freeze_lock); | |
cddd5d17 | 140 | } |
f3af020b | 141 | } |
1671d522 | 142 | EXPORT_SYMBOL_GPL(blk_freeze_queue_start); |
f3af020b | 143 | |
6bae363e | 144 | void blk_mq_freeze_queue_wait(struct request_queue *q) |
f3af020b | 145 | { |
3ef28e83 | 146 | wait_event(q->mq_freeze_wq, percpu_ref_is_zero(&q->q_usage_counter)); |
43a5e4e2 | 147 | } |
6bae363e | 148 | EXPORT_SYMBOL_GPL(blk_mq_freeze_queue_wait); |
43a5e4e2 | 149 | |
f91328c4 KB |
150 | int blk_mq_freeze_queue_wait_timeout(struct request_queue *q, |
151 | unsigned long timeout) | |
152 | { | |
153 | return wait_event_timeout(q->mq_freeze_wq, | |
154 | percpu_ref_is_zero(&q->q_usage_counter), | |
155 | timeout); | |
156 | } | |
157 | EXPORT_SYMBOL_GPL(blk_mq_freeze_queue_wait_timeout); | |
43a5e4e2 | 158 | |
f3af020b TH |
159 | /* |
160 | * Guarantee no request is in use, so we can change any data structure of | |
161 | * the queue afterward. | |
162 | */ | |
3ef28e83 | 163 | void blk_freeze_queue(struct request_queue *q) |
f3af020b | 164 | { |
3ef28e83 DW |
165 | /* |
166 | * In the !blk_mq case we are only calling this to kill the | |
167 | * q_usage_counter, otherwise this increases the freeze depth | |
168 | * and waits for it to return to zero. For this reason there is | |
169 | * no blk_unfreeze_queue(), and blk_freeze_queue() is not | |
170 | * exported to drivers as the only user for unfreeze is blk_mq. | |
171 | */ | |
1671d522 | 172 | blk_freeze_queue_start(q); |
f3af020b TH |
173 | blk_mq_freeze_queue_wait(q); |
174 | } | |
3ef28e83 DW |
175 | |
176 | void blk_mq_freeze_queue(struct request_queue *q) | |
177 | { | |
178 | /* | |
179 | * ...just an alias to keep freeze and unfreeze actions balanced | |
180 | * in the blk_mq_* namespace | |
181 | */ | |
182 | blk_freeze_queue(q); | |
183 | } | |
c761d96b | 184 | EXPORT_SYMBOL_GPL(blk_mq_freeze_queue); |
f3af020b | 185 | |
aec89dc5 | 186 | void __blk_mq_unfreeze_queue(struct request_queue *q, bool force_atomic) |
320ae51f | 187 | { |
7996a8b5 | 188 | mutex_lock(&q->mq_freeze_lock); |
aec89dc5 CH |
189 | if (force_atomic) |
190 | q->q_usage_counter.data->force_atomic = true; | |
7996a8b5 BL |
191 | q->mq_freeze_depth--; |
192 | WARN_ON_ONCE(q->mq_freeze_depth < 0); | |
193 | if (!q->mq_freeze_depth) { | |
bdd63160 | 194 | percpu_ref_resurrect(&q->q_usage_counter); |
320ae51f | 195 | wake_up_all(&q->mq_freeze_wq); |
add703fd | 196 | } |
7996a8b5 | 197 | mutex_unlock(&q->mq_freeze_lock); |
320ae51f | 198 | } |
aec89dc5 CH |
199 | |
200 | void blk_mq_unfreeze_queue(struct request_queue *q) | |
201 | { | |
202 | __blk_mq_unfreeze_queue(q, false); | |
203 | } | |
b4c6a028 | 204 | EXPORT_SYMBOL_GPL(blk_mq_unfreeze_queue); |
320ae51f | 205 | |
852ec809 BVA |
206 | /* |
207 | * FIXME: replace the scsi_internal_device_*block_nowait() calls in the | |
208 | * mpt3sas driver such that this function can be removed. | |
209 | */ | |
210 | void blk_mq_quiesce_queue_nowait(struct request_queue *q) | |
211 | { | |
e70feb8b ML |
212 | unsigned long flags; |
213 | ||
214 | spin_lock_irqsave(&q->queue_lock, flags); | |
215 | if (!q->quiesce_depth++) | |
216 | blk_queue_flag_set(QUEUE_FLAG_QUIESCED, q); | |
217 | spin_unlock_irqrestore(&q->queue_lock, flags); | |
852ec809 BVA |
218 | } |
219 | EXPORT_SYMBOL_GPL(blk_mq_quiesce_queue_nowait); | |
220 | ||
6a83e74d | 221 | /** |
9ef4d020 | 222 | * blk_mq_wait_quiesce_done() - wait until in-progress quiesce is done |
483239c7 | 223 | * @set: tag_set to wait on |
6a83e74d | 224 | * |
9ef4d020 | 225 | * Note: it is driver's responsibility for making sure that quiesce has |
483239c7 CH |
226 | * been started on or more of the request_queues of the tag_set. This |
227 | * function only waits for the quiesce on those request_queues that had | |
228 | * the quiesce flag set using blk_mq_quiesce_queue_nowait. | |
6a83e74d | 229 | */ |
483239c7 | 230 | void blk_mq_wait_quiesce_done(struct blk_mq_tag_set *set) |
6a83e74d | 231 | { |
483239c7 CH |
232 | if (set->flags & BLK_MQ_F_BLOCKING) |
233 | synchronize_srcu(set->srcu); | |
704b914f | 234 | else |
6a83e74d BVA |
235 | synchronize_rcu(); |
236 | } | |
9ef4d020 ML |
237 | EXPORT_SYMBOL_GPL(blk_mq_wait_quiesce_done); |
238 | ||
239 | /** | |
240 | * blk_mq_quiesce_queue() - wait until all ongoing dispatches have finished | |
241 | * @q: request queue. | |
242 | * | |
243 | * Note: this function does not prevent that the struct request end_io() | |
244 | * callback function is invoked. Once this function is returned, we make | |
245 | * sure no dispatch can happen until the queue is unquiesced via | |
246 | * blk_mq_unquiesce_queue(). | |
247 | */ | |
248 | void blk_mq_quiesce_queue(struct request_queue *q) | |
249 | { | |
250 | blk_mq_quiesce_queue_nowait(q); | |
8537380b CH |
251 | /* nothing to wait for non-mq queues */ |
252 | if (queue_is_mq(q)) | |
483239c7 | 253 | blk_mq_wait_quiesce_done(q->tag_set); |
9ef4d020 | 254 | } |
6a83e74d BVA |
255 | EXPORT_SYMBOL_GPL(blk_mq_quiesce_queue); |
256 | ||
e4e73913 ML |
257 | /* |
258 | * blk_mq_unquiesce_queue() - counterpart of blk_mq_quiesce_queue() | |
259 | * @q: request queue. | |
260 | * | |
261 | * This function recovers queue into the state before quiescing | |
262 | * which is done by blk_mq_quiesce_queue. | |
263 | */ | |
264 | void blk_mq_unquiesce_queue(struct request_queue *q) | |
265 | { | |
e70feb8b ML |
266 | unsigned long flags; |
267 | bool run_queue = false; | |
268 | ||
269 | spin_lock_irqsave(&q->queue_lock, flags); | |
270 | if (WARN_ON_ONCE(q->quiesce_depth <= 0)) { | |
271 | ; | |
272 | } else if (!--q->quiesce_depth) { | |
273 | blk_queue_flag_clear(QUEUE_FLAG_QUIESCED, q); | |
274 | run_queue = true; | |
275 | } | |
276 | spin_unlock_irqrestore(&q->queue_lock, flags); | |
f4560ffe | 277 | |
1d9e9bc6 | 278 | /* dispatch requests which are inserted during quiescing */ |
e70feb8b ML |
279 | if (run_queue) |
280 | blk_mq_run_hw_queues(q, true); | |
e4e73913 ML |
281 | } |
282 | EXPORT_SYMBOL_GPL(blk_mq_unquiesce_queue); | |
283 | ||
414dd48e CL |
284 | void blk_mq_quiesce_tagset(struct blk_mq_tag_set *set) |
285 | { | |
286 | struct request_queue *q; | |
287 | ||
288 | mutex_lock(&set->tag_list_lock); | |
289 | list_for_each_entry(q, &set->tag_list, tag_set_list) { | |
290 | if (!blk_queue_skip_tagset_quiesce(q)) | |
291 | blk_mq_quiesce_queue_nowait(q); | |
292 | } | |
293 | blk_mq_wait_quiesce_done(set); | |
294 | mutex_unlock(&set->tag_list_lock); | |
295 | } | |
296 | EXPORT_SYMBOL_GPL(blk_mq_quiesce_tagset); | |
297 | ||
298 | void blk_mq_unquiesce_tagset(struct blk_mq_tag_set *set) | |
299 | { | |
300 | struct request_queue *q; | |
301 | ||
302 | mutex_lock(&set->tag_list_lock); | |
303 | list_for_each_entry(q, &set->tag_list, tag_set_list) { | |
304 | if (!blk_queue_skip_tagset_quiesce(q)) | |
305 | blk_mq_unquiesce_queue(q); | |
306 | } | |
307 | mutex_unlock(&set->tag_list_lock); | |
308 | } | |
309 | EXPORT_SYMBOL_GPL(blk_mq_unquiesce_tagset); | |
310 | ||
aed3ea94 JA |
311 | void blk_mq_wake_waiters(struct request_queue *q) |
312 | { | |
313 | struct blk_mq_hw_ctx *hctx; | |
4f481208 | 314 | unsigned long i; |
aed3ea94 JA |
315 | |
316 | queue_for_each_hw_ctx(q, hctx, i) | |
317 | if (blk_mq_hw_queue_mapped(hctx)) | |
318 | blk_mq_tag_wakeup_all(hctx->tags, true); | |
319 | } | |
320 | ||
52fdbbcc CH |
321 | void blk_rq_init(struct request_queue *q, struct request *rq) |
322 | { | |
323 | memset(rq, 0, sizeof(*rq)); | |
324 | ||
325 | INIT_LIST_HEAD(&rq->queuelist); | |
326 | rq->q = q; | |
327 | rq->__sector = (sector_t) -1; | |
328 | INIT_HLIST_NODE(&rq->hash); | |
329 | RB_CLEAR_NODE(&rq->rb_node); | |
330 | rq->tag = BLK_MQ_NO_TAG; | |
331 | rq->internal_tag = BLK_MQ_NO_TAG; | |
332 | rq->start_time_ns = ktime_get_ns(); | |
333 | rq->part = NULL; | |
334 | blk_crypto_rq_set_defaults(rq); | |
335 | } | |
336 | EXPORT_SYMBOL(blk_rq_init); | |
337 | ||
e4cdf1a1 | 338 | static struct request *blk_mq_rq_ctx_init(struct blk_mq_alloc_data *data, |
fe6134f6 | 339 | struct blk_mq_tags *tags, unsigned int tag, u64 alloc_time_ns) |
320ae51f | 340 | { |
605f784e PB |
341 | struct blk_mq_ctx *ctx = data->ctx; |
342 | struct blk_mq_hw_ctx *hctx = data->hctx; | |
343 | struct request_queue *q = data->q; | |
e4cdf1a1 | 344 | struct request *rq = tags->static_rqs[tag]; |
c3a148d2 | 345 | |
c7b84d42 JA |
346 | rq->q = q; |
347 | rq->mq_ctx = ctx; | |
348 | rq->mq_hctx = hctx; | |
349 | rq->cmd_flags = data->cmd_flags; | |
350 | ||
351 | if (data->flags & BLK_MQ_REQ_PM) | |
352 | data->rq_flags |= RQF_PM; | |
353 | if (blk_queue_io_stat(q)) | |
354 | data->rq_flags |= RQF_IO_STAT; | |
355 | rq->rq_flags = data->rq_flags; | |
356 | ||
56f8da64 | 357 | if (!(data->rq_flags & RQF_ELV)) { |
e4cdf1a1 | 358 | rq->tag = tag; |
76647368 | 359 | rq->internal_tag = BLK_MQ_NO_TAG; |
56f8da64 JA |
360 | } else { |
361 | rq->tag = BLK_MQ_NO_TAG; | |
362 | rq->internal_tag = tag; | |
e4cdf1a1 | 363 | } |
c7b84d42 | 364 | rq->timeout = 0; |
e4cdf1a1 | 365 | |
4f266f2b PB |
366 | if (blk_mq_need_time_stamp(rq)) |
367 | rq->start_time_ns = ktime_get_ns(); | |
368 | else | |
369 | rq->start_time_ns = 0; | |
af76e555 | 370 | rq->part = NULL; |
6f816b4b TH |
371 | #ifdef CONFIG_BLK_RQ_ALLOC_TIME |
372 | rq->alloc_time_ns = alloc_time_ns; | |
373 | #endif | |
544ccc8d | 374 | rq->io_start_time_ns = 0; |
3d244306 | 375 | rq->stats_sectors = 0; |
af76e555 CH |
376 | rq->nr_phys_segments = 0; |
377 | #if defined(CONFIG_BLK_DEV_INTEGRITY) | |
378 | rq->nr_integrity_segments = 0; | |
379 | #endif | |
af76e555 CH |
380 | rq->end_io = NULL; |
381 | rq->end_io_data = NULL; | |
af76e555 | 382 | |
4f266f2b PB |
383 | blk_crypto_rq_set_defaults(rq); |
384 | INIT_LIST_HEAD(&rq->queuelist); | |
385 | /* tag was already set */ | |
386 | WRITE_ONCE(rq->deadline, 0); | |
0a467d0f | 387 | req_ref_set(rq, 1); |
7ea4d8a4 | 388 | |
4f266f2b | 389 | if (rq->rq_flags & RQF_ELV) { |
7ea4d8a4 CH |
390 | struct elevator_queue *e = data->q->elevator; |
391 | ||
4f266f2b PB |
392 | INIT_HLIST_NODE(&rq->hash); |
393 | RB_CLEAR_NODE(&rq->rb_node); | |
394 | ||
395 | if (!op_is_flush(data->cmd_flags) && | |
396 | e->type->ops.prepare_request) { | |
7ea4d8a4 CH |
397 | e->type->ops.prepare_request(rq); |
398 | rq->rq_flags |= RQF_ELVPRIV; | |
399 | } | |
400 | } | |
401 | ||
e4cdf1a1 | 402 | return rq; |
5dee8577 CH |
403 | } |
404 | ||
349302da JA |
405 | static inline struct request * |
406 | __blk_mq_alloc_requests_batch(struct blk_mq_alloc_data *data, | |
407 | u64 alloc_time_ns) | |
408 | { | |
409 | unsigned int tag, tag_offset; | |
fe6134f6 | 410 | struct blk_mq_tags *tags; |
349302da | 411 | struct request *rq; |
fe6134f6 | 412 | unsigned long tag_mask; |
349302da JA |
413 | int i, nr = 0; |
414 | ||
fe6134f6 JA |
415 | tag_mask = blk_mq_get_tags(data, data->nr_tags, &tag_offset); |
416 | if (unlikely(!tag_mask)) | |
349302da JA |
417 | return NULL; |
418 | ||
fe6134f6 JA |
419 | tags = blk_mq_tags_from_data(data); |
420 | for (i = 0; tag_mask; i++) { | |
421 | if (!(tag_mask & (1UL << i))) | |
349302da JA |
422 | continue; |
423 | tag = tag_offset + i; | |
a22c00be | 424 | prefetch(tags->static_rqs[tag]); |
fe6134f6 JA |
425 | tag_mask &= ~(1UL << i); |
426 | rq = blk_mq_rq_ctx_init(data, tags, tag, alloc_time_ns); | |
013a7f95 | 427 | rq_list_add(data->cached_rq, rq); |
c5fc7b93 | 428 | nr++; |
349302da | 429 | } |
c5fc7b93 JA |
430 | /* caller already holds a reference, add for remainder */ |
431 | percpu_ref_get_many(&data->q->q_usage_counter, nr - 1); | |
349302da JA |
432 | data->nr_tags -= nr; |
433 | ||
013a7f95 | 434 | return rq_list_pop(data->cached_rq); |
349302da JA |
435 | } |
436 | ||
b90cfaed | 437 | static struct request *__blk_mq_alloc_requests(struct blk_mq_alloc_data *data) |
d2c0d383 | 438 | { |
e6e7abff | 439 | struct request_queue *q = data->q; |
6f816b4b | 440 | u64 alloc_time_ns = 0; |
47c122e3 | 441 | struct request *rq; |
600c3b0c | 442 | unsigned int tag; |
d2c0d383 | 443 | |
6f816b4b TH |
444 | /* alloc_time includes depth and tag waits */ |
445 | if (blk_queue_rq_alloc_time(q)) | |
446 | alloc_time_ns = ktime_get_ns(); | |
447 | ||
f9afca4d | 448 | if (data->cmd_flags & REQ_NOWAIT) |
03a07c92 | 449 | data->flags |= BLK_MQ_REQ_NOWAIT; |
d2c0d383 | 450 | |
781dd830 JA |
451 | if (q->elevator) { |
452 | struct elevator_queue *e = q->elevator; | |
453 | ||
454 | data->rq_flags |= RQF_ELV; | |
455 | ||
d2c0d383 | 456 | /* |
8d663f34 | 457 | * Flush/passthrough requests are special and go directly to the |
17a51199 JA |
458 | * dispatch list. Don't include reserved tags in the |
459 | * limiting, as it isn't useful. | |
d2c0d383 | 460 | */ |
f9afca4d | 461 | if (!op_is_flush(data->cmd_flags) && |
8d663f34 | 462 | !blk_op_is_passthrough(data->cmd_flags) && |
f9afca4d | 463 | e->type->ops.limit_depth && |
17a51199 | 464 | !(data->flags & BLK_MQ_REQ_RESERVED)) |
f9afca4d | 465 | e->type->ops.limit_depth(data->cmd_flags, data); |
d2c0d383 CH |
466 | } |
467 | ||
bf0beec0 | 468 | retry: |
600c3b0c CH |
469 | data->ctx = blk_mq_get_ctx(q); |
470 | data->hctx = blk_mq_map_queue(q, data->cmd_flags, data->ctx); | |
781dd830 | 471 | if (!(data->rq_flags & RQF_ELV)) |
600c3b0c CH |
472 | blk_mq_tag_busy(data->hctx); |
473 | ||
99e48cd6 JG |
474 | if (data->flags & BLK_MQ_REQ_RESERVED) |
475 | data->rq_flags |= RQF_RESV; | |
476 | ||
349302da JA |
477 | /* |
478 | * Try batched alloc if we want more than 1 tag. | |
479 | */ | |
480 | if (data->nr_tags > 1) { | |
481 | rq = __blk_mq_alloc_requests_batch(data, alloc_time_ns); | |
482 | if (rq) | |
483 | return rq; | |
484 | data->nr_tags = 1; | |
485 | } | |
486 | ||
bf0beec0 ML |
487 | /* |
488 | * Waiting allocations only fail because of an inactive hctx. In that | |
489 | * case just retry the hctx assignment and tag allocation as CPU hotplug | |
490 | * should have migrated us to an online CPU by now. | |
491 | */ | |
e4cdf1a1 | 492 | tag = blk_mq_get_tag(data); |
bf0beec0 ML |
493 | if (tag == BLK_MQ_NO_TAG) { |
494 | if (data->flags & BLK_MQ_REQ_NOWAIT) | |
495 | return NULL; | |
bf0beec0 | 496 | /* |
349302da JA |
497 | * Give up the CPU and sleep for a random short time to |
498 | * ensure that thread using a realtime scheduling class | |
499 | * are migrated off the CPU, and thus off the hctx that | |
500 | * is going away. | |
bf0beec0 ML |
501 | */ |
502 | msleep(3); | |
503 | goto retry; | |
504 | } | |
47c122e3 | 505 | |
fe6134f6 JA |
506 | return blk_mq_rq_ctx_init(data, blk_mq_tags_from_data(data), tag, |
507 | alloc_time_ns); | |
d2c0d383 CH |
508 | } |
509 | ||
4b6a5d9c JA |
510 | static struct request *blk_mq_rq_cache_fill(struct request_queue *q, |
511 | struct blk_plug *plug, | |
512 | blk_opf_t opf, | |
513 | blk_mq_req_flags_t flags) | |
320ae51f | 514 | { |
e6e7abff CH |
515 | struct blk_mq_alloc_data data = { |
516 | .q = q, | |
517 | .flags = flags, | |
16458cf3 | 518 | .cmd_flags = opf, |
4b6a5d9c JA |
519 | .nr_tags = plug->nr_ios, |
520 | .cached_rq = &plug->cached_rq, | |
e6e7abff | 521 | }; |
bd166ef1 | 522 | struct request *rq; |
320ae51f | 523 | |
4b6a5d9c JA |
524 | if (blk_queue_enter(q, flags)) |
525 | return NULL; | |
526 | ||
527 | plug->nr_ios = 1; | |
320ae51f | 528 | |
b90cfaed | 529 | rq = __blk_mq_alloc_requests(&data); |
4b6a5d9c JA |
530 | if (unlikely(!rq)) |
531 | blk_queue_exit(q); | |
532 | return rq; | |
533 | } | |
534 | ||
535 | static struct request *blk_mq_alloc_cached_request(struct request_queue *q, | |
536 | blk_opf_t opf, | |
537 | blk_mq_req_flags_t flags) | |
538 | { | |
539 | struct blk_plug *plug = current->plug; | |
540 | struct request *rq; | |
541 | ||
542 | if (!plug) | |
543 | return NULL; | |
40467282 | 544 | |
4b6a5d9c JA |
545 | if (rq_list_empty(plug->cached_rq)) { |
546 | if (plug->nr_ios == 1) | |
547 | return NULL; | |
548 | rq = blk_mq_rq_cache_fill(q, plug, opf, flags); | |
40467282 JC |
549 | if (!rq) |
550 | return NULL; | |
551 | } else { | |
552 | rq = rq_list_peek(&plug->cached_rq); | |
553 | if (!rq || rq->q != q) | |
554 | return NULL; | |
4b6a5d9c | 555 | |
40467282 JC |
556 | if (blk_mq_get_hctx_type(opf) != rq->mq_hctx->type) |
557 | return NULL; | |
558 | if (op_is_flush(rq->cmd_flags) != op_is_flush(opf)) | |
559 | return NULL; | |
560 | ||
561 | plug->cached_rq = rq_list_next(rq); | |
562 | } | |
4b6a5d9c | 563 | |
4b6a5d9c JA |
564 | rq->cmd_flags = opf; |
565 | INIT_LIST_HEAD(&rq->queuelist); | |
566 | return rq; | |
567 | } | |
568 | ||
569 | struct request *blk_mq_alloc_request(struct request_queue *q, blk_opf_t opf, | |
570 | blk_mq_req_flags_t flags) | |
571 | { | |
572 | struct request *rq; | |
573 | ||
574 | rq = blk_mq_alloc_cached_request(q, opf, flags); | |
575 | if (!rq) { | |
576 | struct blk_mq_alloc_data data = { | |
577 | .q = q, | |
578 | .flags = flags, | |
579 | .cmd_flags = opf, | |
580 | .nr_tags = 1, | |
581 | }; | |
582 | int ret; | |
583 | ||
584 | ret = blk_queue_enter(q, flags); | |
585 | if (ret) | |
586 | return ERR_PTR(ret); | |
587 | ||
588 | rq = __blk_mq_alloc_requests(&data); | |
589 | if (!rq) | |
590 | goto out_queue_exit; | |
591 | } | |
0c4de0f3 CH |
592 | rq->__data_len = 0; |
593 | rq->__sector = (sector_t) -1; | |
594 | rq->bio = rq->biotail = NULL; | |
320ae51f | 595 | return rq; |
a5ea5811 CH |
596 | out_queue_exit: |
597 | blk_queue_exit(q); | |
598 | return ERR_PTR(-EWOULDBLOCK); | |
320ae51f | 599 | } |
4bb659b1 | 600 | EXPORT_SYMBOL(blk_mq_alloc_request); |
320ae51f | 601 | |
cd6ce148 | 602 | struct request *blk_mq_alloc_request_hctx(struct request_queue *q, |
16458cf3 | 603 | blk_opf_t opf, blk_mq_req_flags_t flags, unsigned int hctx_idx) |
1f5bd336 | 604 | { |
e6e7abff CH |
605 | struct blk_mq_alloc_data data = { |
606 | .q = q, | |
607 | .flags = flags, | |
16458cf3 | 608 | .cmd_flags = opf, |
47c122e3 | 609 | .nr_tags = 1, |
e6e7abff | 610 | }; |
600c3b0c | 611 | u64 alloc_time_ns = 0; |
e3c5a78c | 612 | struct request *rq; |
6d2809d5 | 613 | unsigned int cpu; |
600c3b0c | 614 | unsigned int tag; |
1f5bd336 ML |
615 | int ret; |
616 | ||
600c3b0c CH |
617 | /* alloc_time includes depth and tag waits */ |
618 | if (blk_queue_rq_alloc_time(q)) | |
619 | alloc_time_ns = ktime_get_ns(); | |
620 | ||
1f5bd336 ML |
621 | /* |
622 | * If the tag allocator sleeps we could get an allocation for a | |
623 | * different hardware context. No need to complicate the low level | |
624 | * allocator for this for the rare use case of a command tied to | |
625 | * a specific queue. | |
626 | */ | |
6ee858a3 KS |
627 | if (WARN_ON_ONCE(!(flags & BLK_MQ_REQ_NOWAIT)) || |
628 | WARN_ON_ONCE(!(flags & BLK_MQ_REQ_RESERVED))) | |
1f5bd336 ML |
629 | return ERR_PTR(-EINVAL); |
630 | ||
631 | if (hctx_idx >= q->nr_hw_queues) | |
632 | return ERR_PTR(-EIO); | |
633 | ||
3a0a5299 | 634 | ret = blk_queue_enter(q, flags); |
1f5bd336 ML |
635 | if (ret) |
636 | return ERR_PTR(ret); | |
637 | ||
c8712c6a CH |
638 | /* |
639 | * Check if the hardware context is actually mapped to anything. | |
640 | * If not tell the caller that it should skip this queue. | |
641 | */ | |
a5ea5811 | 642 | ret = -EXDEV; |
4e5cc99e | 643 | data.hctx = xa_load(&q->hctx_table, hctx_idx); |
e6e7abff | 644 | if (!blk_mq_hw_queue_mapped(data.hctx)) |
a5ea5811 | 645 | goto out_queue_exit; |
e6e7abff | 646 | cpu = cpumask_first_and(data.hctx->cpumask, cpu_online_mask); |
14dc7a18 BVA |
647 | if (cpu >= nr_cpu_ids) |
648 | goto out_queue_exit; | |
e6e7abff | 649 | data.ctx = __blk_mq_get_ctx(q, cpu); |
1f5bd336 | 650 | |
42fdc5e4 | 651 | if (!q->elevator) |
600c3b0c | 652 | blk_mq_tag_busy(data.hctx); |
781dd830 JA |
653 | else |
654 | data.rq_flags |= RQF_ELV; | |
600c3b0c | 655 | |
99e48cd6 JG |
656 | if (flags & BLK_MQ_REQ_RESERVED) |
657 | data.rq_flags |= RQF_RESV; | |
658 | ||
a5ea5811 | 659 | ret = -EWOULDBLOCK; |
600c3b0c CH |
660 | tag = blk_mq_get_tag(&data); |
661 | if (tag == BLK_MQ_NO_TAG) | |
a5ea5811 | 662 | goto out_queue_exit; |
e3c5a78c | 663 | rq = blk_mq_rq_ctx_init(&data, blk_mq_tags_from_data(&data), tag, |
fe6134f6 | 664 | alloc_time_ns); |
e3c5a78c JG |
665 | rq->__data_len = 0; |
666 | rq->__sector = (sector_t) -1; | |
667 | rq->bio = rq->biotail = NULL; | |
668 | return rq; | |
600c3b0c | 669 | |
a5ea5811 CH |
670 | out_queue_exit: |
671 | blk_queue_exit(q); | |
672 | return ERR_PTR(ret); | |
1f5bd336 ML |
673 | } |
674 | EXPORT_SYMBOL_GPL(blk_mq_alloc_request_hctx); | |
675 | ||
12f5b931 KB |
676 | static void __blk_mq_free_request(struct request *rq) |
677 | { | |
678 | struct request_queue *q = rq->q; | |
679 | struct blk_mq_ctx *ctx = rq->mq_ctx; | |
ea4f995e | 680 | struct blk_mq_hw_ctx *hctx = rq->mq_hctx; |
12f5b931 KB |
681 | const int sched_tag = rq->internal_tag; |
682 | ||
a892c8d5 | 683 | blk_crypto_free_request(rq); |
986d413b | 684 | blk_pm_mark_last_busy(rq); |
ea4f995e | 685 | rq->mq_hctx = NULL; |
76647368 | 686 | if (rq->tag != BLK_MQ_NO_TAG) |
cae740a0 | 687 | blk_mq_put_tag(hctx->tags, ctx, rq->tag); |
76647368 | 688 | if (sched_tag != BLK_MQ_NO_TAG) |
cae740a0 | 689 | blk_mq_put_tag(hctx->sched_tags, ctx, sched_tag); |
12f5b931 KB |
690 | blk_mq_sched_restart(hctx); |
691 | blk_queue_exit(q); | |
692 | } | |
693 | ||
6af54051 | 694 | void blk_mq_free_request(struct request *rq) |
320ae51f | 695 | { |
320ae51f | 696 | struct request_queue *q = rq->q; |
ea4f995e | 697 | struct blk_mq_hw_ctx *hctx = rq->mq_hctx; |
6af54051 | 698 | |
222ee581 CH |
699 | if ((rq->rq_flags & RQF_ELVPRIV) && |
700 | q->elevator->type->ops.finish_request) | |
701 | q->elevator->type->ops.finish_request(rq); | |
320ae51f | 702 | |
e8064021 | 703 | if (rq->rq_flags & RQF_MQ_INFLIGHT) |
bccf5e26 | 704 | __blk_mq_dec_active_requests(hctx); |
87760e5e | 705 | |
7beb2f84 | 706 | if (unlikely(laptop_mode && !blk_rq_is_passthrough(rq))) |
d152c682 | 707 | laptop_io_completion(q->disk->bdi); |
7beb2f84 | 708 | |
a7905043 | 709 | rq_qos_done(q, rq); |
0d2602ca | 710 | |
12f5b931 | 711 | WRITE_ONCE(rq->state, MQ_RQ_IDLE); |
0a467d0f | 712 | if (req_ref_put_and_test(rq)) |
12f5b931 | 713 | __blk_mq_free_request(rq); |
320ae51f | 714 | } |
1a3b595a | 715 | EXPORT_SYMBOL_GPL(blk_mq_free_request); |
320ae51f | 716 | |
47c122e3 | 717 | void blk_mq_free_plug_rqs(struct blk_plug *plug) |
320ae51f | 718 | { |
013a7f95 | 719 | struct request *rq; |
fe1f4526 | 720 | |
c5fc7b93 | 721 | while ((rq = rq_list_pop(&plug->cached_rq)) != NULL) |
47c122e3 | 722 | blk_mq_free_request(rq); |
47c122e3 | 723 | } |
522a7775 | 724 | |
22350ad7 CH |
725 | void blk_dump_rq_flags(struct request *rq, char *msg) |
726 | { | |
727 | printk(KERN_INFO "%s: dev %s: flags=%llx\n", msg, | |
f3fa33ac | 728 | rq->q->disk ? rq->q->disk->disk_name : "?", |
16458cf3 | 729 | (__force unsigned long long) rq->cmd_flags); |
22350ad7 CH |
730 | |
731 | printk(KERN_INFO " sector %llu, nr/cnr %u/%u\n", | |
732 | (unsigned long long)blk_rq_pos(rq), | |
733 | blk_rq_sectors(rq), blk_rq_cur_sectors(rq)); | |
734 | printk(KERN_INFO " bio %p, biotail %p, len %u\n", | |
735 | rq->bio, rq->biotail, blk_rq_bytes(rq)); | |
736 | } | |
737 | EXPORT_SYMBOL(blk_dump_rq_flags); | |
738 | ||
9be3e06f JA |
739 | static void req_bio_endio(struct request *rq, struct bio *bio, |
740 | unsigned int nbytes, blk_status_t error) | |
741 | { | |
478eb72b | 742 | if (unlikely(error)) { |
9be3e06f | 743 | bio->bi_status = error; |
478eb72b | 744 | } else if (req_op(rq) == REQ_OP_ZONE_APPEND) { |
9be3e06f JA |
745 | /* |
746 | * Partial zone append completions cannot be supported as the | |
747 | * BIO fragments may end up not being written sequentially. | |
748 | */ | |
297db731 | 749 | if (bio->bi_iter.bi_size != nbytes) |
9be3e06f JA |
750 | bio->bi_status = BLK_STS_IOERR; |
751 | else | |
752 | bio->bi_iter.bi_sector = rq->__sector; | |
753 | } | |
754 | ||
478eb72b PB |
755 | bio_advance(bio, nbytes); |
756 | ||
757 | if (unlikely(rq->rq_flags & RQF_QUIET)) | |
758 | bio_set_flag(bio, BIO_QUIET); | |
9be3e06f JA |
759 | /* don't actually finish bio if it's part of flush sequence */ |
760 | if (bio->bi_iter.bi_size == 0 && !(rq->rq_flags & RQF_FLUSH_SEQ)) | |
761 | bio_endio(bio); | |
762 | } | |
763 | ||
764 | static void blk_account_io_completion(struct request *req, unsigned int bytes) | |
765 | { | |
766 | if (req->part && blk_do_io_stat(req)) { | |
767 | const int sgrp = op_stat_group(req_op(req)); | |
768 | ||
769 | part_stat_lock(); | |
770 | part_stat_add(req->part, sectors[sgrp], bytes >> 9); | |
771 | part_stat_unlock(); | |
772 | } | |
773 | } | |
774 | ||
0d7a29a2 CH |
775 | static void blk_print_req_error(struct request *req, blk_status_t status) |
776 | { | |
777 | printk_ratelimited(KERN_ERR | |
778 | "%s error, dev %s, sector %llu op 0x%x:(%s) flags 0x%x " | |
779 | "phys_seg %u prio class %u\n", | |
780 | blk_status_to_str(status), | |
f3fa33ac | 781 | req->q->disk ? req->q->disk->disk_name : "?", |
16458cf3 BVA |
782 | blk_rq_pos(req), (__force u32)req_op(req), |
783 | blk_op_str(req_op(req)), | |
784 | (__force u32)(req->cmd_flags & ~REQ_OP_MASK), | |
0d7a29a2 CH |
785 | req->nr_phys_segments, |
786 | IOPRIO_PRIO_CLASS(req->ioprio)); | |
787 | } | |
788 | ||
5581a5dd JA |
789 | /* |
790 | * Fully end IO on a request. Does not support partial completions, or | |
791 | * errors. | |
792 | */ | |
793 | static void blk_complete_request(struct request *req) | |
794 | { | |
795 | const bool is_flush = (req->rq_flags & RQF_FLUSH_SEQ) != 0; | |
796 | int total_bytes = blk_rq_bytes(req); | |
797 | struct bio *bio = req->bio; | |
798 | ||
799 | trace_block_rq_complete(req, BLK_STS_OK, total_bytes); | |
800 | ||
801 | if (!bio) | |
802 | return; | |
803 | ||
804 | #ifdef CONFIG_BLK_DEV_INTEGRITY | |
805 | if (blk_integrity_rq(req) && req_op(req) == REQ_OP_READ) | |
806 | req->q->integrity.profile->complete_fn(req, total_bytes); | |
807 | #endif | |
808 | ||
9cd1e566 EB |
809 | /* |
810 | * Upper layers may call blk_crypto_evict_key() anytime after the last | |
811 | * bio_endio(). Therefore, the keyslot must be released before that. | |
812 | */ | |
813 | blk_crypto_rq_put_keyslot(req); | |
814 | ||
5581a5dd JA |
815 | blk_account_io_completion(req, total_bytes); |
816 | ||
817 | do { | |
818 | struct bio *next = bio->bi_next; | |
819 | ||
820 | /* Completion has already been traced */ | |
821 | bio_clear_flag(bio, BIO_TRACE_COMPLETION); | |
a12821d5 PR |
822 | |
823 | if (req_op(req) == REQ_OP_ZONE_APPEND) | |
824 | bio->bi_iter.bi_sector = req->__sector; | |
825 | ||
5581a5dd JA |
826 | if (!is_flush) |
827 | bio_endio(bio); | |
828 | bio = next; | |
829 | } while (bio); | |
830 | ||
831 | /* | |
832 | * Reset counters so that the request stacking driver | |
833 | * can find how many bytes remain in the request | |
834 | * later. | |
835 | */ | |
ab3e1d3b JA |
836 | if (!req->end_io) { |
837 | req->bio = NULL; | |
838 | req->__data_len = 0; | |
839 | } | |
5581a5dd JA |
840 | } |
841 | ||
9be3e06f JA |
842 | /** |
843 | * blk_update_request - Complete multiple bytes without completing the request | |
844 | * @req: the request being processed | |
845 | * @error: block status code | |
846 | * @nr_bytes: number of bytes to complete for @req | |
847 | * | |
848 | * Description: | |
849 | * Ends I/O on a number of bytes attached to @req, but doesn't complete | |
850 | * the request structure even if @req doesn't have leftover. | |
851 | * If @req has leftover, sets it up for the next range of segments. | |
852 | * | |
853 | * Passing the result of blk_rq_bytes() as @nr_bytes guarantees | |
854 | * %false return from this function. | |
855 | * | |
856 | * Note: | |
857 | * The RQF_SPECIAL_PAYLOAD flag is ignored on purpose in this function | |
858 | * except in the consistency check at the end of this function. | |
859 | * | |
860 | * Return: | |
861 | * %false - this request doesn't have any more data | |
862 | * %true - this request has more data | |
863 | **/ | |
864 | bool blk_update_request(struct request *req, blk_status_t error, | |
865 | unsigned int nr_bytes) | |
866 | { | |
867 | int total_bytes; | |
868 | ||
8a7d267b | 869 | trace_block_rq_complete(req, error, nr_bytes); |
9be3e06f JA |
870 | |
871 | if (!req->bio) | |
872 | return false; | |
873 | ||
874 | #ifdef CONFIG_BLK_DEV_INTEGRITY | |
875 | if (blk_integrity_rq(req) && req_op(req) == REQ_OP_READ && | |
876 | error == BLK_STS_OK) | |
877 | req->q->integrity.profile->complete_fn(req, nr_bytes); | |
878 | #endif | |
879 | ||
9cd1e566 EB |
880 | /* |
881 | * Upper layers may call blk_crypto_evict_key() anytime after the last | |
882 | * bio_endio(). Therefore, the keyslot must be released before that. | |
883 | */ | |
884 | if (blk_crypto_rq_has_keyslot(req) && nr_bytes >= blk_rq_bytes(req)) | |
885 | __blk_crypto_rq_put_keyslot(req); | |
886 | ||
9be3e06f | 887 | if (unlikely(error && !blk_rq_is_passthrough(req) && |
3d973a76 CH |
888 | !(req->rq_flags & RQF_QUIET)) && |
889 | !test_bit(GD_DEAD, &req->q->disk->state)) { | |
9be3e06f | 890 | blk_print_req_error(req, error); |
d5869fdc YS |
891 | trace_block_rq_error(req, error, nr_bytes); |
892 | } | |
9be3e06f JA |
893 | |
894 | blk_account_io_completion(req, nr_bytes); | |
895 | ||
896 | total_bytes = 0; | |
897 | while (req->bio) { | |
898 | struct bio *bio = req->bio; | |
899 | unsigned bio_bytes = min(bio->bi_iter.bi_size, nr_bytes); | |
900 | ||
901 | if (bio_bytes == bio->bi_iter.bi_size) | |
902 | req->bio = bio->bi_next; | |
903 | ||
904 | /* Completion has already been traced */ | |
905 | bio_clear_flag(bio, BIO_TRACE_COMPLETION); | |
906 | req_bio_endio(req, bio, bio_bytes, error); | |
907 | ||
908 | total_bytes += bio_bytes; | |
909 | nr_bytes -= bio_bytes; | |
910 | ||
911 | if (!nr_bytes) | |
912 | break; | |
913 | } | |
914 | ||
915 | /* | |
916 | * completely done | |
917 | */ | |
918 | if (!req->bio) { | |
919 | /* | |
920 | * Reset counters so that the request stacking driver | |
921 | * can find how many bytes remain in the request | |
922 | * later. | |
923 | */ | |
924 | req->__data_len = 0; | |
925 | return false; | |
926 | } | |
927 | ||
928 | req->__data_len -= total_bytes; | |
929 | ||
930 | /* update sector only for requests with clear definition of sector */ | |
931 | if (!blk_rq_is_passthrough(req)) | |
932 | req->__sector += total_bytes >> 9; | |
933 | ||
934 | /* mixed attributes always follow the first bio */ | |
935 | if (req->rq_flags & RQF_MIXED_MERGE) { | |
936 | req->cmd_flags &= ~REQ_FAILFAST_MASK; | |
937 | req->cmd_flags |= req->bio->bi_opf & REQ_FAILFAST_MASK; | |
938 | } | |
939 | ||
940 | if (!(req->rq_flags & RQF_SPECIAL_PAYLOAD)) { | |
941 | /* | |
942 | * If total number of sectors is less than the first segment | |
943 | * size, something has gone terribly wrong. | |
944 | */ | |
945 | if (blk_rq_bytes(req) < blk_rq_cur_bytes(req)) { | |
946 | blk_dump_rq_flags(req, "request botched"); | |
947 | req->__data_len = blk_rq_cur_bytes(req); | |
948 | } | |
949 | ||
950 | /* recalculate the number of segments */ | |
951 | req->nr_phys_segments = blk_recalc_rq_segments(req); | |
952 | } | |
953 | ||
954 | return true; | |
955 | } | |
956 | EXPORT_SYMBOL_GPL(blk_update_request); | |
957 | ||
450b7879 CH |
958 | static inline void blk_account_io_done(struct request *req, u64 now) |
959 | { | |
960 | /* | |
961 | * Account IO completion. flush_rq isn't accounted as a | |
962 | * normal IO on queueing nor completion. Accounting the | |
963 | * containing request is enough. | |
964 | */ | |
965 | if (blk_do_io_stat(req) && req->part && | |
06965037 CK |
966 | !(req->rq_flags & RQF_FLUSH_SEQ)) { |
967 | const int sgrp = op_stat_group(req_op(req)); | |
450b7879 | 968 | |
06965037 CK |
969 | part_stat_lock(); |
970 | update_io_ticks(req->part, jiffies, true); | |
971 | part_stat_inc(req->part, ios[sgrp]); | |
972 | part_stat_add(req->part, nsecs[sgrp], now - req->start_time_ns); | |
973 | part_stat_unlock(); | |
974 | } | |
450b7879 CH |
975 | } |
976 | ||
977 | static inline void blk_account_io_start(struct request *req) | |
978 | { | |
e165fb4d CK |
979 | if (blk_do_io_stat(req)) { |
980 | /* | |
981 | * All non-passthrough requests are created from a bio with one | |
982 | * exception: when a flush command that is part of a flush sequence | |
983 | * generated by the state machine in blk-flush.c is cloned onto the | |
984 | * lower device by dm-multipath we can get here without a bio. | |
985 | */ | |
986 | if (req->bio) | |
987 | req->part = req->bio->bi_bdev; | |
988 | else | |
989 | req->part = req->q->disk->part0; | |
990 | ||
991 | part_stat_lock(); | |
992 | update_io_ticks(req->part, jiffies, false); | |
993 | part_stat_unlock(); | |
994 | } | |
450b7879 CH |
995 | } |
996 | ||
f794f335 | 997 | static inline void __blk_mq_end_request_acct(struct request *rq, u64 now) |
320ae51f | 998 | { |
54bdd67d | 999 | if (rq->rq_flags & RQF_STATS) |
522a7775 | 1000 | blk_stat_add(rq, now); |
4bc6339a | 1001 | |
87890092 | 1002 | blk_mq_sched_completed_request(rq, now); |
522a7775 | 1003 | blk_account_io_done(rq, now); |
f794f335 | 1004 | } |
522a7775 | 1005 | |
f794f335 JA |
1006 | inline void __blk_mq_end_request(struct request *rq, blk_status_t error) |
1007 | { | |
1008 | if (blk_mq_need_time_stamp(rq)) | |
1009 | __blk_mq_end_request_acct(rq, ktime_get_ns()); | |
0d11e6ac | 1010 | |
91b63639 | 1011 | if (rq->end_io) { |
a7905043 | 1012 | rq_qos_done(rq->q, rq); |
de671d61 JA |
1013 | if (rq->end_io(rq, error) == RQ_END_IO_FREE) |
1014 | blk_mq_free_request(rq); | |
91b63639 | 1015 | } else { |
320ae51f | 1016 | blk_mq_free_request(rq); |
91b63639 | 1017 | } |
320ae51f | 1018 | } |
c8a446ad | 1019 | EXPORT_SYMBOL(__blk_mq_end_request); |
63151a44 | 1020 | |
2a842aca | 1021 | void blk_mq_end_request(struct request *rq, blk_status_t error) |
63151a44 CH |
1022 | { |
1023 | if (blk_update_request(rq, error, blk_rq_bytes(rq))) | |
1024 | BUG(); | |
c8a446ad | 1025 | __blk_mq_end_request(rq, error); |
63151a44 | 1026 | } |
c8a446ad | 1027 | EXPORT_SYMBOL(blk_mq_end_request); |
320ae51f | 1028 | |
f794f335 JA |
1029 | #define TAG_COMP_BATCH 32 |
1030 | ||
1031 | static inline void blk_mq_flush_tag_batch(struct blk_mq_hw_ctx *hctx, | |
1032 | int *tag_array, int nr_tags) | |
1033 | { | |
1034 | struct request_queue *q = hctx->queue; | |
1035 | ||
3b87c6ea ML |
1036 | /* |
1037 | * All requests should have been marked as RQF_MQ_INFLIGHT, so | |
1038 | * update hctx->nr_active in batch | |
1039 | */ | |
1040 | if (hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED) | |
1041 | __blk_mq_sub_active_requests(hctx, nr_tags); | |
1042 | ||
f794f335 JA |
1043 | blk_mq_put_tags(hctx->tags, tag_array, nr_tags); |
1044 | percpu_ref_put_many(&q->q_usage_counter, nr_tags); | |
1045 | } | |
1046 | ||
1047 | void blk_mq_end_request_batch(struct io_comp_batch *iob) | |
1048 | { | |
1049 | int tags[TAG_COMP_BATCH], nr_tags = 0; | |
02f7eab0 | 1050 | struct blk_mq_hw_ctx *cur_hctx = NULL; |
f794f335 JA |
1051 | struct request *rq; |
1052 | u64 now = 0; | |
1053 | ||
1054 | if (iob->need_ts) | |
1055 | now = ktime_get_ns(); | |
1056 | ||
1057 | while ((rq = rq_list_pop(&iob->req_list)) != NULL) { | |
1058 | prefetch(rq->bio); | |
1059 | prefetch(rq->rq_next); | |
1060 | ||
5581a5dd | 1061 | blk_complete_request(rq); |
f794f335 JA |
1062 | if (iob->need_ts) |
1063 | __blk_mq_end_request_acct(rq, now); | |
1064 | ||
98b26a0e JA |
1065 | rq_qos_done(rq->q, rq); |
1066 | ||
ab3e1d3b JA |
1067 | /* |
1068 | * If end_io handler returns NONE, then it still has | |
1069 | * ownership of the request. | |
1070 | */ | |
1071 | if (rq->end_io && rq->end_io(rq, 0) == RQ_END_IO_NONE) | |
1072 | continue; | |
1073 | ||
f794f335 | 1074 | WRITE_ONCE(rq->state, MQ_RQ_IDLE); |
0a467d0f | 1075 | if (!req_ref_put_and_test(rq)) |
f794f335 JA |
1076 | continue; |
1077 | ||
1078 | blk_crypto_free_request(rq); | |
1079 | blk_pm_mark_last_busy(rq); | |
f794f335 | 1080 | |
02f7eab0 JA |
1081 | if (nr_tags == TAG_COMP_BATCH || cur_hctx != rq->mq_hctx) { |
1082 | if (cur_hctx) | |
1083 | blk_mq_flush_tag_batch(cur_hctx, tags, nr_tags); | |
f794f335 | 1084 | nr_tags = 0; |
02f7eab0 | 1085 | cur_hctx = rq->mq_hctx; |
f794f335 JA |
1086 | } |
1087 | tags[nr_tags++] = rq->tag; | |
f794f335 JA |
1088 | } |
1089 | ||
1090 | if (nr_tags) | |
02f7eab0 | 1091 | blk_mq_flush_tag_batch(cur_hctx, tags, nr_tags); |
f794f335 JA |
1092 | } |
1093 | EXPORT_SYMBOL_GPL(blk_mq_end_request_batch); | |
1094 | ||
f9ab4918 | 1095 | static void blk_complete_reqs(struct llist_head *list) |
320ae51f | 1096 | { |
f9ab4918 SAS |
1097 | struct llist_node *entry = llist_reverse_order(llist_del_all(list)); |
1098 | struct request *rq, *next; | |
c3077b5d | 1099 | |
f9ab4918 | 1100 | llist_for_each_entry_safe(rq, next, entry, ipi_list) |
c3077b5d | 1101 | rq->q->mq_ops->complete(rq); |
320ae51f | 1102 | } |
320ae51f | 1103 | |
f9ab4918 | 1104 | static __latent_entropy void blk_done_softirq(struct softirq_action *h) |
320ae51f | 1105 | { |
f9ab4918 | 1106 | blk_complete_reqs(this_cpu_ptr(&blk_cpu_done)); |
115243f5 CH |
1107 | } |
1108 | ||
c3077b5d CH |
1109 | static int blk_softirq_cpu_dead(unsigned int cpu) |
1110 | { | |
f9ab4918 | 1111 | blk_complete_reqs(&per_cpu(blk_cpu_done, cpu)); |
c3077b5d CH |
1112 | return 0; |
1113 | } | |
1114 | ||
40d09b53 | 1115 | static void __blk_mq_complete_request_remote(void *data) |
c3077b5d | 1116 | { |
f9ab4918 | 1117 | __raise_softirq_irqoff(BLOCK_SOFTIRQ); |
c3077b5d CH |
1118 | } |
1119 | ||
96339526 CH |
1120 | static inline bool blk_mq_complete_need_ipi(struct request *rq) |
1121 | { | |
1122 | int cpu = raw_smp_processor_id(); | |
1123 | ||
1124 | if (!IS_ENABLED(CONFIG_SMP) || | |
1125 | !test_bit(QUEUE_FLAG_SAME_COMP, &rq->q->queue_flags)) | |
1126 | return false; | |
71425189 SAS |
1127 | /* |
1128 | * With force threaded interrupts enabled, raising softirq from an SMP | |
1129 | * function call will always result in waking the ksoftirqd thread. | |
1130 | * This is probably worse than completing the request on a different | |
1131 | * cache domain. | |
1132 | */ | |
91cc470e | 1133 | if (force_irqthreads()) |
71425189 | 1134 | return false; |
96339526 CH |
1135 | |
1136 | /* same CPU or cache domain? Complete locally */ | |
1137 | if (cpu == rq->mq_ctx->cpu || | |
1138 | (!test_bit(QUEUE_FLAG_SAME_FORCE, &rq->q->queue_flags) && | |
1139 | cpus_share_cache(cpu, rq->mq_ctx->cpu))) | |
1140 | return false; | |
1141 | ||
1142 | /* don't try to IPI to an offline CPU */ | |
1143 | return cpu_online(rq->mq_ctx->cpu); | |
1144 | } | |
1145 | ||
f9ab4918 SAS |
1146 | static void blk_mq_complete_send_ipi(struct request *rq) |
1147 | { | |
1148 | struct llist_head *list; | |
1149 | unsigned int cpu; | |
1150 | ||
1151 | cpu = rq->mq_ctx->cpu; | |
1152 | list = &per_cpu(blk_cpu_done, cpu); | |
1153 | if (llist_add(&rq->ipi_list, list)) { | |
1154 | INIT_CSD(&rq->csd, __blk_mq_complete_request_remote, rq); | |
1155 | smp_call_function_single_async(cpu, &rq->csd); | |
1156 | } | |
1157 | } | |
1158 | ||
1159 | static void blk_mq_raise_softirq(struct request *rq) | |
1160 | { | |
1161 | struct llist_head *list; | |
1162 | ||
1163 | preempt_disable(); | |
1164 | list = this_cpu_ptr(&blk_cpu_done); | |
1165 | if (llist_add(&rq->ipi_list, list)) | |
1166 | raise_softirq(BLOCK_SOFTIRQ); | |
1167 | preempt_enable(); | |
1168 | } | |
1169 | ||
40d09b53 | 1170 | bool blk_mq_complete_request_remote(struct request *rq) |
320ae51f | 1171 | { |
af78ff7c | 1172 | WRITE_ONCE(rq->state, MQ_RQ_COMPLETE); |
36e76539 | 1173 | |
4ab32bf3 | 1174 | /* |
f168420c LS |
1175 | * For request which hctx has only one ctx mapping, |
1176 | * or a polled request, always complete locally, | |
1177 | * it's pointless to redirect the completion. | |
4ab32bf3 | 1178 | */ |
f168420c LS |
1179 | if (rq->mq_hctx->nr_ctx == 1 || |
1180 | rq->cmd_flags & REQ_POLLED) | |
40d09b53 | 1181 | return false; |
38535201 | 1182 | |
96339526 | 1183 | if (blk_mq_complete_need_ipi(rq)) { |
f9ab4918 SAS |
1184 | blk_mq_complete_send_ipi(rq); |
1185 | return true; | |
3d6efbf6 | 1186 | } |
40d09b53 | 1187 | |
f9ab4918 SAS |
1188 | if (rq->q->nr_hw_queues == 1) { |
1189 | blk_mq_raise_softirq(rq); | |
1190 | return true; | |
1191 | } | |
1192 | return false; | |
40d09b53 CH |
1193 | } |
1194 | EXPORT_SYMBOL_GPL(blk_mq_complete_request_remote); | |
1195 | ||
1196 | /** | |
1197 | * blk_mq_complete_request - end I/O on a request | |
1198 | * @rq: the request being processed | |
1199 | * | |
1200 | * Description: | |
1201 | * Complete a request by scheduling the ->complete_rq operation. | |
1202 | **/ | |
1203 | void blk_mq_complete_request(struct request *rq) | |
1204 | { | |
1205 | if (!blk_mq_complete_request_remote(rq)) | |
1206 | rq->q->mq_ops->complete(rq); | |
320ae51f | 1207 | } |
15f73f5b | 1208 | EXPORT_SYMBOL(blk_mq_complete_request); |
30a91cb4 | 1209 | |
105663f7 AA |
1210 | /** |
1211 | * blk_mq_start_request - Start processing a request | |
1212 | * @rq: Pointer to request to be started | |
1213 | * | |
1214 | * Function used by device drivers to notify the block layer that a request | |
1215 | * is going to be processed now, so blk layer can do proper initializations | |
1216 | * such as starting the timeout timer. | |
1217 | */ | |
e2490073 | 1218 | void blk_mq_start_request(struct request *rq) |
320ae51f JA |
1219 | { |
1220 | struct request_queue *q = rq->q; | |
1221 | ||
a54895fa | 1222 | trace_block_rq_issue(rq); |
320ae51f | 1223 | |
cf43e6be | 1224 | if (test_bit(QUEUE_FLAG_STATS, &q->queue_flags)) { |
4cddeaca | 1225 | rq->io_start_time_ns = ktime_get_ns(); |
3d244306 | 1226 | rq->stats_sectors = blk_rq_sectors(rq); |
cf43e6be | 1227 | rq->rq_flags |= RQF_STATS; |
a7905043 | 1228 | rq_qos_issue(q, rq); |
cf43e6be JA |
1229 | } |
1230 | ||
1d9bd516 | 1231 | WARN_ON_ONCE(blk_mq_rq_state(rq) != MQ_RQ_IDLE); |
538b7534 | 1232 | |
1d9bd516 | 1233 | blk_add_timer(rq); |
12f5b931 | 1234 | WRITE_ONCE(rq->state, MQ_RQ_IN_FLIGHT); |
49f5baa5 | 1235 | |
54d4e6ab MG |
1236 | #ifdef CONFIG_BLK_DEV_INTEGRITY |
1237 | if (blk_integrity_rq(rq) && req_op(rq) == REQ_OP_WRITE) | |
1238 | q->integrity.profile->prepare_fn(rq); | |
1239 | #endif | |
3e08773c CH |
1240 | if (rq->bio && rq->bio->bi_opf & REQ_POLLED) |
1241 | WRITE_ONCE(rq->bio->bi_cookie, blk_rq_to_qc(rq)); | |
320ae51f | 1242 | } |
e2490073 | 1243 | EXPORT_SYMBOL(blk_mq_start_request); |
320ae51f | 1244 | |
a327c341 ML |
1245 | /* |
1246 | * Allow 2x BLK_MAX_REQUEST_COUNT requests on plug queue for multiple | |
1247 | * queues. This is important for md arrays to benefit from merging | |
1248 | * requests. | |
1249 | */ | |
1250 | static inline unsigned short blk_plug_max_rq_count(struct blk_plug *plug) | |
1251 | { | |
1252 | if (plug->multiple_queues) | |
1253 | return BLK_MAX_REQUEST_COUNT * 2; | |
1254 | return BLK_MAX_REQUEST_COUNT; | |
1255 | } | |
1256 | ||
1257 | static void blk_add_rq_to_plug(struct blk_plug *plug, struct request *rq) | |
1258 | { | |
1259 | struct request *last = rq_list_peek(&plug->mq_list); | |
1260 | ||
1261 | if (!plug->rq_count) { | |
1262 | trace_block_plug(rq->q); | |
1263 | } else if (plug->rq_count >= blk_plug_max_rq_count(plug) || | |
1264 | (!blk_queue_nomerges(rq->q) && | |
1265 | blk_rq_bytes(last) >= BLK_PLUG_FLUSH_SIZE)) { | |
1266 | blk_mq_flush_plug_list(plug, false); | |
878eb6e4 | 1267 | last = NULL; |
a327c341 ML |
1268 | trace_block_plug(rq->q); |
1269 | } | |
1270 | ||
1271 | if (!plug->multiple_queues && last && last->q != rq->q) | |
1272 | plug->multiple_queues = true; | |
1273 | if (!plug->has_elevator && (rq->rq_flags & RQF_ELV)) | |
1274 | plug->has_elevator = true; | |
1275 | rq->rq_next = NULL; | |
1276 | rq_list_add(&plug->mq_list, rq); | |
1277 | plug->rq_count++; | |
1278 | } | |
1279 | ||
4054cff9 CH |
1280 | /** |
1281 | * blk_execute_rq_nowait - insert a request to I/O scheduler for execution | |
4054cff9 CH |
1282 | * @rq: request to insert |
1283 | * @at_head: insert request at head or tail of queue | |
4054cff9 CH |
1284 | * |
1285 | * Description: | |
1286 | * Insert a fully prepared request at the back of the I/O scheduler queue | |
1287 | * for execution. Don't wait for completion. | |
1288 | * | |
1289 | * Note: | |
1290 | * This function will invoke @done directly if the queue is dead. | |
1291 | */ | |
e2e53086 | 1292 | void blk_execute_rq_nowait(struct request *rq, bool at_head) |
4054cff9 | 1293 | { |
f0dbe6e8 CH |
1294 | struct blk_mq_hw_ctx *hctx = rq->mq_hctx; |
1295 | ||
ae948fd6 CH |
1296 | WARN_ON(irqs_disabled()); |
1297 | WARN_ON(!blk_rq_is_passthrough(rq)); | |
4054cff9 | 1298 | |
ae948fd6 | 1299 | blk_account_io_start(rq); |
110fdb44 PR |
1300 | |
1301 | /* | |
1302 | * As plugging can be enabled for passthrough requests on a zoned | |
1303 | * device, directly accessing the plug instead of using blk_mq_plug() | |
1304 | * should not have any consequences. | |
1305 | */ | |
f0dbe6e8 | 1306 | if (current->plug && !at_head) { |
ae948fd6 | 1307 | blk_add_rq_to_plug(current->plug, rq); |
f0dbe6e8 CH |
1308 | return; |
1309 | } | |
1310 | ||
710fa378 | 1311 | blk_mq_insert_request(rq, at_head ? BLK_MQ_INSERT_AT_HEAD : 0); |
f0dbe6e8 | 1312 | blk_mq_run_hw_queue(hctx, false); |
4054cff9 CH |
1313 | } |
1314 | EXPORT_SYMBOL_GPL(blk_execute_rq_nowait); | |
1315 | ||
32ac5a9b CH |
1316 | struct blk_rq_wait { |
1317 | struct completion done; | |
1318 | blk_status_t ret; | |
1319 | }; | |
1320 | ||
de671d61 | 1321 | static enum rq_end_io_ret blk_end_sync_rq(struct request *rq, blk_status_t ret) |
32ac5a9b CH |
1322 | { |
1323 | struct blk_rq_wait *wait = rq->end_io_data; | |
1324 | ||
1325 | wait->ret = ret; | |
1326 | complete(&wait->done); | |
de671d61 | 1327 | return RQ_END_IO_NONE; |
32ac5a9b CH |
1328 | } |
1329 | ||
c6e99ea4 | 1330 | bool blk_rq_is_poll(struct request *rq) |
4054cff9 CH |
1331 | { |
1332 | if (!rq->mq_hctx) | |
1333 | return false; | |
1334 | if (rq->mq_hctx->type != HCTX_TYPE_POLL) | |
1335 | return false; | |
4054cff9 CH |
1336 | return true; |
1337 | } | |
c6e99ea4 | 1338 | EXPORT_SYMBOL_GPL(blk_rq_is_poll); |
4054cff9 CH |
1339 | |
1340 | static void blk_rq_poll_completion(struct request *rq, struct completion *wait) | |
1341 | { | |
1342 | do { | |
38a8c4d1 | 1343 | blk_mq_poll(rq->q, blk_rq_to_qc(rq), NULL, 0); |
4054cff9 CH |
1344 | cond_resched(); |
1345 | } while (!completion_done(wait)); | |
1346 | } | |
1347 | ||
1348 | /** | |
1349 | * blk_execute_rq - insert a request into queue for execution | |
4054cff9 CH |
1350 | * @rq: request to insert |
1351 | * @at_head: insert request at head or tail of queue | |
1352 | * | |
1353 | * Description: | |
1354 | * Insert a fully prepared request at the back of the I/O scheduler queue | |
1355 | * for execution and wait for completion. | |
1356 | * Return: The blk_status_t result provided to blk_mq_end_request(). | |
1357 | */ | |
b84ba30b | 1358 | blk_status_t blk_execute_rq(struct request *rq, bool at_head) |
4054cff9 | 1359 | { |
f0dbe6e8 | 1360 | struct blk_mq_hw_ctx *hctx = rq->mq_hctx; |
32ac5a9b CH |
1361 | struct blk_rq_wait wait = { |
1362 | .done = COMPLETION_INITIALIZER_ONSTACK(wait.done), | |
1363 | }; | |
4054cff9 | 1364 | |
ae948fd6 CH |
1365 | WARN_ON(irqs_disabled()); |
1366 | WARN_ON(!blk_rq_is_passthrough(rq)); | |
4054cff9 CH |
1367 | |
1368 | rq->end_io_data = &wait; | |
ae948fd6 | 1369 | rq->end_io = blk_end_sync_rq; |
4054cff9 | 1370 | |
ae948fd6 | 1371 | blk_account_io_start(rq); |
710fa378 | 1372 | blk_mq_insert_request(rq, at_head ? BLK_MQ_INSERT_AT_HEAD : 0); |
f0dbe6e8 | 1373 | blk_mq_run_hw_queue(hctx, false); |
4054cff9 | 1374 | |
ae948fd6 | 1375 | if (blk_rq_is_poll(rq)) { |
32ac5a9b | 1376 | blk_rq_poll_completion(rq, &wait.done); |
ae948fd6 CH |
1377 | } else { |
1378 | /* | |
1379 | * Prevent hang_check timer from firing at us during very long | |
1380 | * I/O | |
1381 | */ | |
1382 | unsigned long hang_check = sysctl_hung_task_timeout_secs; | |
1383 | ||
1384 | if (hang_check) | |
32ac5a9b | 1385 | while (!wait_for_completion_io_timeout(&wait.done, |
ae948fd6 CH |
1386 | hang_check * (HZ/2))) |
1387 | ; | |
1388 | else | |
32ac5a9b | 1389 | wait_for_completion_io(&wait.done); |
ae948fd6 | 1390 | } |
4054cff9 | 1391 | |
32ac5a9b | 1392 | return wait.ret; |
4054cff9 CH |
1393 | } |
1394 | EXPORT_SYMBOL(blk_execute_rq); | |
1395 | ||
ed0791b2 | 1396 | static void __blk_mq_requeue_request(struct request *rq) |
320ae51f JA |
1397 | { |
1398 | struct request_queue *q = rq->q; | |
1399 | ||
923218f6 ML |
1400 | blk_mq_put_driver_tag(rq); |
1401 | ||
a54895fa | 1402 | trace_block_rq_requeue(rq); |
a7905043 | 1403 | rq_qos_requeue(q, rq); |
49f5baa5 | 1404 | |
12f5b931 KB |
1405 | if (blk_mq_request_started(rq)) { |
1406 | WRITE_ONCE(rq->state, MQ_RQ_IDLE); | |
da661267 | 1407 | rq->rq_flags &= ~RQF_TIMED_OUT; |
e2490073 | 1408 | } |
320ae51f JA |
1409 | } |
1410 | ||
2b053aca | 1411 | void blk_mq_requeue_request(struct request *rq, bool kick_requeue_list) |
ed0791b2 | 1412 | { |
214a4418 CH |
1413 | struct request_queue *q = rq->q; |
1414 | ||
ed0791b2 | 1415 | __blk_mq_requeue_request(rq); |
ed0791b2 | 1416 | |
105976f5 ML |
1417 | /* this request will be re-inserted to io scheduler queue */ |
1418 | blk_mq_sched_requeue_request(rq); | |
1419 | ||
b12e5c6c | 1420 | blk_mq_add_to_requeue_list(rq, BLK_MQ_INSERT_AT_HEAD); |
214a4418 CH |
1421 | |
1422 | if (kick_requeue_list) | |
1423 | blk_mq_kick_requeue_list(q); | |
ed0791b2 CH |
1424 | } |
1425 | EXPORT_SYMBOL(blk_mq_requeue_request); | |
1426 | ||
6fca6a61 CH |
1427 | static void blk_mq_requeue_work(struct work_struct *work) |
1428 | { | |
1429 | struct request_queue *q = | |
2849450a | 1430 | container_of(work, struct request_queue, requeue_work.work); |
6fca6a61 CH |
1431 | LIST_HEAD(rq_list); |
1432 | struct request *rq, *next; | |
6fca6a61 | 1433 | |
18e9781d | 1434 | spin_lock_irq(&q->requeue_lock); |
6fca6a61 | 1435 | list_splice_init(&q->requeue_list, &rq_list); |
18e9781d | 1436 | spin_unlock_irq(&q->requeue_lock); |
6fca6a61 CH |
1437 | |
1438 | list_for_each_entry_safe(rq, next, &rq_list, queuelist) { | |
aef1897c | 1439 | /* |
a1e948b8 CH |
1440 | * If RQF_DONTPREP ist set, the request has been started by the |
1441 | * driver already and might have driver-specific data allocated | |
1442 | * already. Insert it into the hctx dispatch list to avoid | |
1443 | * block layer merges for the request. | |
aef1897c | 1444 | */ |
a1e948b8 CH |
1445 | if (rq->rq_flags & RQF_DONTPREP) { |
1446 | rq->rq_flags &= ~RQF_SOFTBARRIER; | |
1447 | list_del_init(&rq->queuelist); | |
2b597613 | 1448 | blk_mq_request_bypass_insert(rq, 0); |
a1e948b8 CH |
1449 | } else if (rq->rq_flags & RQF_SOFTBARRIER) { |
1450 | rq->rq_flags &= ~RQF_SOFTBARRIER; | |
1451 | list_del_init(&rq->queuelist); | |
710fa378 | 1452 | blk_mq_insert_request(rq, BLK_MQ_INSERT_AT_HEAD); |
a1e948b8 | 1453 | } |
6fca6a61 CH |
1454 | } |
1455 | ||
1456 | while (!list_empty(&rq_list)) { | |
1457 | rq = list_entry(rq_list.next, struct request, queuelist); | |
1458 | list_del_init(&rq->queuelist); | |
710fa378 | 1459 | blk_mq_insert_request(rq, 0); |
6fca6a61 CH |
1460 | } |
1461 | ||
52d7f1b5 | 1462 | blk_mq_run_hw_queues(q, false); |
6fca6a61 CH |
1463 | } |
1464 | ||
b12e5c6c | 1465 | void blk_mq_add_to_requeue_list(struct request *rq, blk_insert_t insert_flags) |
6fca6a61 CH |
1466 | { |
1467 | struct request_queue *q = rq->q; | |
1468 | unsigned long flags; | |
1469 | ||
1470 | /* | |
1471 | * We abuse this flag that is otherwise used by the I/O scheduler to | |
ff821d27 | 1472 | * request head insertion from the workqueue. |
6fca6a61 | 1473 | */ |
e8064021 | 1474 | BUG_ON(rq->rq_flags & RQF_SOFTBARRIER); |
6fca6a61 CH |
1475 | |
1476 | spin_lock_irqsave(&q->requeue_lock, flags); | |
b12e5c6c | 1477 | if (insert_flags & BLK_MQ_INSERT_AT_HEAD) { |
e8064021 | 1478 | rq->rq_flags |= RQF_SOFTBARRIER; |
6fca6a61 CH |
1479 | list_add(&rq->queuelist, &q->requeue_list); |
1480 | } else { | |
1481 | list_add_tail(&rq->queuelist, &q->requeue_list); | |
1482 | } | |
1483 | spin_unlock_irqrestore(&q->requeue_lock, flags); | |
1484 | } | |
6fca6a61 CH |
1485 | |
1486 | void blk_mq_kick_requeue_list(struct request_queue *q) | |
1487 | { | |
ae943d20 | 1488 | kblockd_mod_delayed_work_on(WORK_CPU_UNBOUND, &q->requeue_work, 0); |
6fca6a61 CH |
1489 | } |
1490 | EXPORT_SYMBOL(blk_mq_kick_requeue_list); | |
1491 | ||
2849450a MS |
1492 | void blk_mq_delay_kick_requeue_list(struct request_queue *q, |
1493 | unsigned long msecs) | |
1494 | { | |
d4acf365 BVA |
1495 | kblockd_mod_delayed_work_on(WORK_CPU_UNBOUND, &q->requeue_work, |
1496 | msecs_to_jiffies(msecs)); | |
2849450a MS |
1497 | } |
1498 | EXPORT_SYMBOL(blk_mq_delay_kick_requeue_list); | |
1499 | ||
2dd6532e | 1500 | static bool blk_mq_rq_inflight(struct request *rq, void *priv) |
ae879912 JA |
1501 | { |
1502 | /* | |
8ab30a33 JG |
1503 | * If we find a request that isn't idle we know the queue is busy |
1504 | * as it's checked in the iter. | |
1505 | * Return false to stop the iteration. | |
ae879912 | 1506 | */ |
8ab30a33 | 1507 | if (blk_mq_request_started(rq)) { |
ae879912 JA |
1508 | bool *busy = priv; |
1509 | ||
1510 | *busy = true; | |
1511 | return false; | |
1512 | } | |
1513 | ||
1514 | return true; | |
1515 | } | |
1516 | ||
3c94d83c | 1517 | bool blk_mq_queue_inflight(struct request_queue *q) |
ae879912 JA |
1518 | { |
1519 | bool busy = false; | |
1520 | ||
3c94d83c | 1521 | blk_mq_queue_tag_busy_iter(q, blk_mq_rq_inflight, &busy); |
ae879912 JA |
1522 | return busy; |
1523 | } | |
3c94d83c | 1524 | EXPORT_SYMBOL_GPL(blk_mq_queue_inflight); |
ae879912 | 1525 | |
9bdb4833 | 1526 | static void blk_mq_rq_timed_out(struct request *req) |
320ae51f | 1527 | { |
da661267 | 1528 | req->rq_flags |= RQF_TIMED_OUT; |
d1210d5a CH |
1529 | if (req->q->mq_ops->timeout) { |
1530 | enum blk_eh_timer_return ret; | |
1531 | ||
9bdb4833 | 1532 | ret = req->q->mq_ops->timeout(req); |
d1210d5a CH |
1533 | if (ret == BLK_EH_DONE) |
1534 | return; | |
1535 | WARN_ON_ONCE(ret != BLK_EH_RESET_TIMER); | |
46f92d42 | 1536 | } |
d1210d5a CH |
1537 | |
1538 | blk_add_timer(req); | |
87ee7b11 | 1539 | } |
5b3f25fc | 1540 | |
82c22947 DJ |
1541 | struct blk_expired_data { |
1542 | bool has_timedout_rq; | |
1543 | unsigned long next; | |
1544 | unsigned long timeout_start; | |
1545 | }; | |
1546 | ||
1547 | static bool blk_mq_req_expired(struct request *rq, struct blk_expired_data *expired) | |
81481eb4 | 1548 | { |
12f5b931 | 1549 | unsigned long deadline; |
87ee7b11 | 1550 | |
12f5b931 KB |
1551 | if (blk_mq_rq_state(rq) != MQ_RQ_IN_FLIGHT) |
1552 | return false; | |
da661267 CH |
1553 | if (rq->rq_flags & RQF_TIMED_OUT) |
1554 | return false; | |
a7af0af3 | 1555 | |
079076b3 | 1556 | deadline = READ_ONCE(rq->deadline); |
82c22947 | 1557 | if (time_after_eq(expired->timeout_start, deadline)) |
12f5b931 | 1558 | return true; |
a7af0af3 | 1559 | |
82c22947 DJ |
1560 | if (expired->next == 0) |
1561 | expired->next = deadline; | |
1562 | else if (time_after(expired->next, deadline)) | |
1563 | expired->next = deadline; | |
12f5b931 | 1564 | return false; |
87ee7b11 JA |
1565 | } |
1566 | ||
2e315dc0 ML |
1567 | void blk_mq_put_rq_ref(struct request *rq) |
1568 | { | |
de671d61 JA |
1569 | if (is_flush_rq(rq)) { |
1570 | if (rq->end_io(rq, 0) == RQ_END_IO_FREE) | |
1571 | blk_mq_free_request(rq); | |
1572 | } else if (req_ref_put_and_test(rq)) { | |
2e315dc0 | 1573 | __blk_mq_free_request(rq); |
de671d61 | 1574 | } |
2e315dc0 ML |
1575 | } |
1576 | ||
2dd6532e | 1577 | static bool blk_mq_check_expired(struct request *rq, void *priv) |
1d9bd516 | 1578 | { |
82c22947 | 1579 | struct blk_expired_data *expired = priv; |
12f5b931 KB |
1580 | |
1581 | /* | |
c797b40c ML |
1582 | * blk_mq_queue_tag_busy_iter() has locked the request, so it cannot |
1583 | * be reallocated underneath the timeout handler's processing, then | |
1584 | * the expire check is reliable. If the request is not expired, then | |
1585 | * it was completed and reallocated as a new request after returning | |
1586 | * from blk_mq_check_expired(). | |
1d9bd516 | 1587 | */ |
82c22947 DJ |
1588 | if (blk_mq_req_expired(rq, expired)) { |
1589 | expired->has_timedout_rq = true; | |
1590 | return false; | |
1591 | } | |
1592 | return true; | |
1593 | } | |
1594 | ||
1595 | static bool blk_mq_handle_expired(struct request *rq, void *priv) | |
1596 | { | |
1597 | struct blk_expired_data *expired = priv; | |
1598 | ||
1599 | if (blk_mq_req_expired(rq, expired)) | |
9bdb4833 | 1600 | blk_mq_rq_timed_out(rq); |
7baa8572 | 1601 | return true; |
1d9bd516 TH |
1602 | } |
1603 | ||
287922eb | 1604 | static void blk_mq_timeout_work(struct work_struct *work) |
320ae51f | 1605 | { |
287922eb CH |
1606 | struct request_queue *q = |
1607 | container_of(work, struct request_queue, timeout_work); | |
82c22947 DJ |
1608 | struct blk_expired_data expired = { |
1609 | .timeout_start = jiffies, | |
1610 | }; | |
1d9bd516 | 1611 | struct blk_mq_hw_ctx *hctx; |
4f481208 | 1612 | unsigned long i; |
320ae51f | 1613 | |
71f79fb3 GKB |
1614 | /* A deadlock might occur if a request is stuck requiring a |
1615 | * timeout at the same time a queue freeze is waiting | |
1616 | * completion, since the timeout code would not be able to | |
1617 | * acquire the queue reference here. | |
1618 | * | |
1619 | * That's why we don't use blk_queue_enter here; instead, we use | |
1620 | * percpu_ref_tryget directly, because we need to be able to | |
1621 | * obtain a reference even in the short window between the queue | |
1622 | * starting to freeze, by dropping the first reference in | |
1671d522 | 1623 | * blk_freeze_queue_start, and the moment the last request is |
71f79fb3 GKB |
1624 | * consumed, marked by the instant q_usage_counter reaches |
1625 | * zero. | |
1626 | */ | |
1627 | if (!percpu_ref_tryget(&q->q_usage_counter)) | |
287922eb CH |
1628 | return; |
1629 | ||
82c22947 DJ |
1630 | /* check if there is any timed-out request */ |
1631 | blk_mq_queue_tag_busy_iter(q, blk_mq_check_expired, &expired); | |
1632 | if (expired.has_timedout_rq) { | |
1633 | /* | |
1634 | * Before walking tags, we must ensure any submit started | |
1635 | * before the current time has finished. Since the submit | |
1636 | * uses srcu or rcu, wait for a synchronization point to | |
1637 | * ensure all running submits have finished | |
1638 | */ | |
483239c7 | 1639 | blk_mq_wait_quiesce_done(q->tag_set); |
82c22947 DJ |
1640 | |
1641 | expired.next = 0; | |
1642 | blk_mq_queue_tag_busy_iter(q, blk_mq_handle_expired, &expired); | |
1643 | } | |
320ae51f | 1644 | |
82c22947 DJ |
1645 | if (expired.next != 0) { |
1646 | mod_timer(&q->timeout, expired.next); | |
0d2602ca | 1647 | } else { |
fcd36c36 BVA |
1648 | /* |
1649 | * Request timeouts are handled as a forward rolling timer. If | |
1650 | * we end up here it means that no requests are pending and | |
1651 | * also that no request has been pending for a while. Mark | |
1652 | * each hctx as idle. | |
1653 | */ | |
f054b56c ML |
1654 | queue_for_each_hw_ctx(q, hctx, i) { |
1655 | /* the hctx may be unmapped, so check it here */ | |
1656 | if (blk_mq_hw_queue_mapped(hctx)) | |
1657 | blk_mq_tag_idle(hctx); | |
1658 | } | |
0d2602ca | 1659 | } |
287922eb | 1660 | blk_queue_exit(q); |
320ae51f JA |
1661 | } |
1662 | ||
88459642 OS |
1663 | struct flush_busy_ctx_data { |
1664 | struct blk_mq_hw_ctx *hctx; | |
1665 | struct list_head *list; | |
1666 | }; | |
1667 | ||
1668 | static bool flush_busy_ctx(struct sbitmap *sb, unsigned int bitnr, void *data) | |
1669 | { | |
1670 | struct flush_busy_ctx_data *flush_data = data; | |
1671 | struct blk_mq_hw_ctx *hctx = flush_data->hctx; | |
1672 | struct blk_mq_ctx *ctx = hctx->ctxs[bitnr]; | |
c16d6b5a | 1673 | enum hctx_type type = hctx->type; |
88459642 | 1674 | |
88459642 | 1675 | spin_lock(&ctx->lock); |
c16d6b5a | 1676 | list_splice_tail_init(&ctx->rq_lists[type], flush_data->list); |
e9a99a63 | 1677 | sbitmap_clear_bit(sb, bitnr); |
88459642 OS |
1678 | spin_unlock(&ctx->lock); |
1679 | return true; | |
1680 | } | |
1681 | ||
1429d7c9 JA |
1682 | /* |
1683 | * Process software queues that have been marked busy, splicing them | |
1684 | * to the for-dispatch | |
1685 | */ | |
2c3ad667 | 1686 | void blk_mq_flush_busy_ctxs(struct blk_mq_hw_ctx *hctx, struct list_head *list) |
1429d7c9 | 1687 | { |
88459642 OS |
1688 | struct flush_busy_ctx_data data = { |
1689 | .hctx = hctx, | |
1690 | .list = list, | |
1691 | }; | |
1429d7c9 | 1692 | |
88459642 | 1693 | sbitmap_for_each_set(&hctx->ctx_map, flush_busy_ctx, &data); |
1429d7c9 | 1694 | } |
2c3ad667 | 1695 | EXPORT_SYMBOL_GPL(blk_mq_flush_busy_ctxs); |
1429d7c9 | 1696 | |
b347689f ML |
1697 | struct dispatch_rq_data { |
1698 | struct blk_mq_hw_ctx *hctx; | |
1699 | struct request *rq; | |
1700 | }; | |
1701 | ||
1702 | static bool dispatch_rq_from_ctx(struct sbitmap *sb, unsigned int bitnr, | |
1703 | void *data) | |
1704 | { | |
1705 | struct dispatch_rq_data *dispatch_data = data; | |
1706 | struct blk_mq_hw_ctx *hctx = dispatch_data->hctx; | |
1707 | struct blk_mq_ctx *ctx = hctx->ctxs[bitnr]; | |
c16d6b5a | 1708 | enum hctx_type type = hctx->type; |
b347689f ML |
1709 | |
1710 | spin_lock(&ctx->lock); | |
c16d6b5a ML |
1711 | if (!list_empty(&ctx->rq_lists[type])) { |
1712 | dispatch_data->rq = list_entry_rq(ctx->rq_lists[type].next); | |
b347689f | 1713 | list_del_init(&dispatch_data->rq->queuelist); |
c16d6b5a | 1714 | if (list_empty(&ctx->rq_lists[type])) |
b347689f ML |
1715 | sbitmap_clear_bit(sb, bitnr); |
1716 | } | |
1717 | spin_unlock(&ctx->lock); | |
1718 | ||
1719 | return !dispatch_data->rq; | |
1720 | } | |
1721 | ||
1722 | struct request *blk_mq_dequeue_from_ctx(struct blk_mq_hw_ctx *hctx, | |
1723 | struct blk_mq_ctx *start) | |
1724 | { | |
f31967f0 | 1725 | unsigned off = start ? start->index_hw[hctx->type] : 0; |
b347689f ML |
1726 | struct dispatch_rq_data data = { |
1727 | .hctx = hctx, | |
1728 | .rq = NULL, | |
1729 | }; | |
1730 | ||
1731 | __sbitmap_for_each_set(&hctx->ctx_map, off, | |
1732 | dispatch_rq_from_ctx, &data); | |
1733 | ||
1734 | return data.rq; | |
1735 | } | |
1736 | ||
a808a9d5 | 1737 | static bool __blk_mq_alloc_driver_tag(struct request *rq) |
570e9b73 | 1738 | { |
ae0f1a73 | 1739 | struct sbitmap_queue *bt = &rq->mq_hctx->tags->bitmap_tags; |
570e9b73 | 1740 | unsigned int tag_offset = rq->mq_hctx->tags->nr_reserved_tags; |
570e9b73 ML |
1741 | int tag; |
1742 | ||
568f2700 ML |
1743 | blk_mq_tag_busy(rq->mq_hctx); |
1744 | ||
570e9b73 | 1745 | if (blk_mq_tag_is_reserved(rq->mq_hctx->sched_tags, rq->internal_tag)) { |
ae0f1a73 | 1746 | bt = &rq->mq_hctx->tags->breserved_tags; |
570e9b73 | 1747 | tag_offset = 0; |
28500850 ML |
1748 | } else { |
1749 | if (!hctx_may_queue(rq->mq_hctx, bt)) | |
1750 | return false; | |
570e9b73 ML |
1751 | } |
1752 | ||
570e9b73 ML |
1753 | tag = __sbitmap_queue_get(bt); |
1754 | if (tag == BLK_MQ_NO_TAG) | |
1755 | return false; | |
1756 | ||
1757 | rq->tag = tag + tag_offset; | |
570e9b73 ML |
1758 | return true; |
1759 | } | |
1760 | ||
a808a9d5 | 1761 | bool __blk_mq_get_driver_tag(struct blk_mq_hw_ctx *hctx, struct request *rq) |
570e9b73 | 1762 | { |
a808a9d5 | 1763 | if (rq->tag == BLK_MQ_NO_TAG && !__blk_mq_alloc_driver_tag(rq)) |
568f2700 ML |
1764 | return false; |
1765 | ||
51db1c37 | 1766 | if ((hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED) && |
568f2700 ML |
1767 | !(rq->rq_flags & RQF_MQ_INFLIGHT)) { |
1768 | rq->rq_flags |= RQF_MQ_INFLIGHT; | |
bccf5e26 | 1769 | __blk_mq_inc_active_requests(hctx); |
568f2700 ML |
1770 | } |
1771 | hctx->tags->rqs[rq->tag] = rq; | |
1772 | return true; | |
570e9b73 ML |
1773 | } |
1774 | ||
eb619fdb JA |
1775 | static int blk_mq_dispatch_wake(wait_queue_entry_t *wait, unsigned mode, |
1776 | int flags, void *key) | |
da55f2cc OS |
1777 | { |
1778 | struct blk_mq_hw_ctx *hctx; | |
1779 | ||
1780 | hctx = container_of(wait, struct blk_mq_hw_ctx, dispatch_wait); | |
1781 | ||
5815839b | 1782 | spin_lock(&hctx->dispatch_wait_lock); |
e8618575 JA |
1783 | if (!list_empty(&wait->entry)) { |
1784 | struct sbitmap_queue *sbq; | |
1785 | ||
1786 | list_del_init(&wait->entry); | |
ae0f1a73 | 1787 | sbq = &hctx->tags->bitmap_tags; |
e8618575 JA |
1788 | atomic_dec(&sbq->ws_active); |
1789 | } | |
5815839b ML |
1790 | spin_unlock(&hctx->dispatch_wait_lock); |
1791 | ||
da55f2cc OS |
1792 | blk_mq_run_hw_queue(hctx, true); |
1793 | return 1; | |
1794 | } | |
1795 | ||
f906a6a0 JA |
1796 | /* |
1797 | * Mark us waiting for a tag. For shared tags, this involves hooking us into | |
ee3e4de5 BVA |
1798 | * the tag wakeups. For non-shared tags, we can simply mark us needing a |
1799 | * restart. For both cases, take care to check the condition again after | |
f906a6a0 JA |
1800 | * marking us as waiting. |
1801 | */ | |
2278d69f | 1802 | static bool blk_mq_mark_tag_wait(struct blk_mq_hw_ctx *hctx, |
f906a6a0 | 1803 | struct request *rq) |
da55f2cc | 1804 | { |
98b99e94 | 1805 | struct sbitmap_queue *sbq; |
5815839b | 1806 | struct wait_queue_head *wq; |
f906a6a0 JA |
1807 | wait_queue_entry_t *wait; |
1808 | bool ret; | |
da55f2cc | 1809 | |
47df9ce9 KS |
1810 | if (!(hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED) && |
1811 | !(blk_mq_is_shared_tags(hctx->flags))) { | |
684b7324 | 1812 | blk_mq_sched_mark_restart_hctx(hctx); |
f906a6a0 | 1813 | |
c27d53fb BVA |
1814 | /* |
1815 | * It's possible that a tag was freed in the window between the | |
1816 | * allocation failure and adding the hardware queue to the wait | |
1817 | * queue. | |
1818 | * | |
1819 | * Don't clear RESTART here, someone else could have set it. | |
1820 | * At most this will cost an extra queue run. | |
1821 | */ | |
8ab6bb9e | 1822 | return blk_mq_get_driver_tag(rq); |
eb619fdb | 1823 | } |
eb619fdb | 1824 | |
2278d69f | 1825 | wait = &hctx->dispatch_wait; |
c27d53fb BVA |
1826 | if (!list_empty_careful(&wait->entry)) |
1827 | return false; | |
1828 | ||
98b99e94 KS |
1829 | if (blk_mq_tag_is_reserved(rq->mq_hctx->sched_tags, rq->internal_tag)) |
1830 | sbq = &hctx->tags->breserved_tags; | |
1831 | else | |
1832 | sbq = &hctx->tags->bitmap_tags; | |
e8618575 | 1833 | wq = &bt_wait_ptr(sbq, hctx)->wait; |
5815839b ML |
1834 | |
1835 | spin_lock_irq(&wq->lock); | |
1836 | spin_lock(&hctx->dispatch_wait_lock); | |
c27d53fb | 1837 | if (!list_empty(&wait->entry)) { |
5815839b ML |
1838 | spin_unlock(&hctx->dispatch_wait_lock); |
1839 | spin_unlock_irq(&wq->lock); | |
c27d53fb | 1840 | return false; |
eb619fdb JA |
1841 | } |
1842 | ||
e8618575 | 1843 | atomic_inc(&sbq->ws_active); |
5815839b ML |
1844 | wait->flags &= ~WQ_FLAG_EXCLUSIVE; |
1845 | __add_wait_queue(wq, wait); | |
c27d53fb | 1846 | |
da55f2cc | 1847 | /* |
eb619fdb JA |
1848 | * It's possible that a tag was freed in the window between the |
1849 | * allocation failure and adding the hardware queue to the wait | |
1850 | * queue. | |
da55f2cc | 1851 | */ |
8ab6bb9e | 1852 | ret = blk_mq_get_driver_tag(rq); |
c27d53fb | 1853 | if (!ret) { |
5815839b ML |
1854 | spin_unlock(&hctx->dispatch_wait_lock); |
1855 | spin_unlock_irq(&wq->lock); | |
c27d53fb | 1856 | return false; |
eb619fdb | 1857 | } |
c27d53fb BVA |
1858 | |
1859 | /* | |
1860 | * We got a tag, remove ourselves from the wait queue to ensure | |
1861 | * someone else gets the wakeup. | |
1862 | */ | |
c27d53fb | 1863 | list_del_init(&wait->entry); |
e8618575 | 1864 | atomic_dec(&sbq->ws_active); |
5815839b ML |
1865 | spin_unlock(&hctx->dispatch_wait_lock); |
1866 | spin_unlock_irq(&wq->lock); | |
c27d53fb BVA |
1867 | |
1868 | return true; | |
da55f2cc OS |
1869 | } |
1870 | ||
6e768717 ML |
1871 | #define BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT 8 |
1872 | #define BLK_MQ_DISPATCH_BUSY_EWMA_FACTOR 4 | |
1873 | /* | |
1874 | * Update dispatch busy with the Exponential Weighted Moving Average(EWMA): | |
1875 | * - EWMA is one simple way to compute running average value | |
1876 | * - weight(7/8 and 1/8) is applied so that it can decrease exponentially | |
1877 | * - take 4 as factor for avoiding to get too small(0) result, and this | |
1878 | * factor doesn't matter because EWMA decreases exponentially | |
1879 | */ | |
1880 | static void blk_mq_update_dispatch_busy(struct blk_mq_hw_ctx *hctx, bool busy) | |
1881 | { | |
1882 | unsigned int ewma; | |
1883 | ||
6e768717 ML |
1884 | ewma = hctx->dispatch_busy; |
1885 | ||
1886 | if (!ewma && !busy) | |
1887 | return; | |
1888 | ||
1889 | ewma *= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT - 1; | |
1890 | if (busy) | |
1891 | ewma += 1 << BLK_MQ_DISPATCH_BUSY_EWMA_FACTOR; | |
1892 | ewma /= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT; | |
1893 | ||
1894 | hctx->dispatch_busy = ewma; | |
1895 | } | |
1896 | ||
86ff7c2a ML |
1897 | #define BLK_MQ_RESOURCE_DELAY 3 /* ms units */ |
1898 | ||
c92a4103 JT |
1899 | static void blk_mq_handle_dev_resource(struct request *rq, |
1900 | struct list_head *list) | |
1901 | { | |
c92a4103 JT |
1902 | list_add(&rq->queuelist, list); |
1903 | __blk_mq_requeue_request(rq); | |
1904 | } | |
1905 | ||
0512a75b KB |
1906 | static void blk_mq_handle_zone_resource(struct request *rq, |
1907 | struct list_head *zone_list) | |
1908 | { | |
1909 | /* | |
1910 | * If we end up here it is because we cannot dispatch a request to a | |
1911 | * specific zone due to LLD level zone-write locking or other zone | |
1912 | * related resource not being available. In this case, set the request | |
1913 | * aside in zone_list for retrying it later. | |
1914 | */ | |
1915 | list_add(&rq->queuelist, zone_list); | |
1916 | __blk_mq_requeue_request(rq); | |
1917 | } | |
1918 | ||
75383524 ML |
1919 | enum prep_dispatch { |
1920 | PREP_DISPATCH_OK, | |
1921 | PREP_DISPATCH_NO_TAG, | |
1922 | PREP_DISPATCH_NO_BUDGET, | |
1923 | }; | |
1924 | ||
1925 | static enum prep_dispatch blk_mq_prep_dispatch_rq(struct request *rq, | |
1926 | bool need_budget) | |
1927 | { | |
1928 | struct blk_mq_hw_ctx *hctx = rq->mq_hctx; | |
2a5a24aa | 1929 | int budget_token = -1; |
75383524 | 1930 | |
2a5a24aa ML |
1931 | if (need_budget) { |
1932 | budget_token = blk_mq_get_dispatch_budget(rq->q); | |
1933 | if (budget_token < 0) { | |
1934 | blk_mq_put_driver_tag(rq); | |
1935 | return PREP_DISPATCH_NO_BUDGET; | |
1936 | } | |
1937 | blk_mq_set_rq_budget_token(rq, budget_token); | |
75383524 ML |
1938 | } |
1939 | ||
1940 | if (!blk_mq_get_driver_tag(rq)) { | |
1941 | /* | |
1942 | * The initial allocation attempt failed, so we need to | |
1943 | * rerun the hardware queue when a tag is freed. The | |
1944 | * waitqueue takes care of that. If the queue is run | |
1945 | * before we add this entry back on the dispatch list, | |
1946 | * we'll re-run it below. | |
1947 | */ | |
1948 | if (!blk_mq_mark_tag_wait(hctx, rq)) { | |
1fd40b5e ML |
1949 | /* |
1950 | * All budgets not got from this function will be put | |
1951 | * together during handling partial dispatch | |
1952 | */ | |
1953 | if (need_budget) | |
2a5a24aa | 1954 | blk_mq_put_dispatch_budget(rq->q, budget_token); |
75383524 ML |
1955 | return PREP_DISPATCH_NO_TAG; |
1956 | } | |
1957 | } | |
1958 | ||
1959 | return PREP_DISPATCH_OK; | |
1960 | } | |
1961 | ||
1fd40b5e ML |
1962 | /* release all allocated budgets before calling to blk_mq_dispatch_rq_list */ |
1963 | static void blk_mq_release_budgets(struct request_queue *q, | |
2a5a24aa | 1964 | struct list_head *list) |
1fd40b5e | 1965 | { |
2a5a24aa | 1966 | struct request *rq; |
1fd40b5e | 1967 | |
2a5a24aa ML |
1968 | list_for_each_entry(rq, list, queuelist) { |
1969 | int budget_token = blk_mq_get_rq_budget_token(rq); | |
1fd40b5e | 1970 | |
2a5a24aa ML |
1971 | if (budget_token >= 0) |
1972 | blk_mq_put_dispatch_budget(q, budget_token); | |
1973 | } | |
1fd40b5e ML |
1974 | } |
1975 | ||
34c9f547 KS |
1976 | /* |
1977 | * blk_mq_commit_rqs will notify driver using bd->last that there is no | |
1978 | * more requests. (See comment in struct blk_mq_ops for commit_rqs for | |
1979 | * details) | |
1980 | * Attention, we should explicitly call this in unusual cases: | |
1981 | * 1) did not queue everything initially scheduled to queue | |
1982 | * 2) the last attempt to queue a request failed | |
1983 | */ | |
1984 | static void blk_mq_commit_rqs(struct blk_mq_hw_ctx *hctx, int queued, | |
1985 | bool from_schedule) | |
1986 | { | |
1987 | if (hctx->queue->mq_ops->commit_rqs && queued) { | |
1988 | trace_block_unplug(hctx->queue, queued, !from_schedule); | |
1989 | hctx->queue->mq_ops->commit_rqs(hctx); | |
1990 | } | |
1991 | } | |
1992 | ||
1f57f8d4 JA |
1993 | /* |
1994 | * Returns true if we did some work AND can potentially do more. | |
1995 | */ | |
445874e8 | 1996 | bool blk_mq_dispatch_rq_list(struct blk_mq_hw_ctx *hctx, struct list_head *list, |
1fd40b5e | 1997 | unsigned int nr_budgets) |
320ae51f | 1998 | { |
75383524 | 1999 | enum prep_dispatch prep; |
445874e8 | 2000 | struct request_queue *q = hctx->queue; |
f1ce99f7 | 2001 | struct request *rq; |
4ea58fe4 | 2002 | int queued; |
86ff7c2a | 2003 | blk_status_t ret = BLK_STS_OK; |
0512a75b | 2004 | LIST_HEAD(zone_list); |
9586e67b | 2005 | bool needs_resource = false; |
320ae51f | 2006 | |
81380ca1 OS |
2007 | if (list_empty(list)) |
2008 | return false; | |
2009 | ||
320ae51f JA |
2010 | /* |
2011 | * Now process all the entries, sending them to the driver. | |
2012 | */ | |
4ea58fe4 | 2013 | queued = 0; |
81380ca1 | 2014 | do { |
74c45052 | 2015 | struct blk_mq_queue_data bd; |
320ae51f | 2016 | |
f04c3df3 | 2017 | rq = list_first_entry(list, struct request, queuelist); |
0bca799b | 2018 | |
445874e8 | 2019 | WARN_ON_ONCE(hctx != rq->mq_hctx); |
1fd40b5e | 2020 | prep = blk_mq_prep_dispatch_rq(rq, !nr_budgets); |
75383524 | 2021 | if (prep != PREP_DISPATCH_OK) |
0bca799b | 2022 | break; |
de148297 | 2023 | |
320ae51f | 2024 | list_del_init(&rq->queuelist); |
320ae51f | 2025 | |
74c45052 | 2026 | bd.rq = rq; |
f1ce99f7 | 2027 | bd.last = list_empty(list); |
74c45052 | 2028 | |
1fd40b5e ML |
2029 | /* |
2030 | * once the request is queued to lld, no need to cover the | |
2031 | * budget any more | |
2032 | */ | |
2033 | if (nr_budgets) | |
2034 | nr_budgets--; | |
74c45052 | 2035 | ret = q->mq_ops->queue_rq(hctx, &bd); |
7bf13729 ML |
2036 | switch (ret) { |
2037 | case BLK_STS_OK: | |
2038 | queued++; | |
320ae51f | 2039 | break; |
7bf13729 | 2040 | case BLK_STS_RESOURCE: |
9586e67b NA |
2041 | needs_resource = true; |
2042 | fallthrough; | |
7bf13729 ML |
2043 | case BLK_STS_DEV_RESOURCE: |
2044 | blk_mq_handle_dev_resource(rq, list); | |
2045 | goto out; | |
2046 | case BLK_STS_ZONE_RESOURCE: | |
0512a75b KB |
2047 | /* |
2048 | * Move the request to zone_list and keep going through | |
2049 | * the dispatch list to find more requests the drive can | |
2050 | * accept. | |
2051 | */ | |
2052 | blk_mq_handle_zone_resource(rq, &zone_list); | |
9586e67b | 2053 | needs_resource = true; |
7bf13729 ML |
2054 | break; |
2055 | default: | |
e21ee5a6 | 2056 | blk_mq_end_request(rq, ret); |
320ae51f | 2057 | } |
81380ca1 | 2058 | } while (!list_empty(list)); |
7bf13729 | 2059 | out: |
0512a75b KB |
2060 | if (!list_empty(&zone_list)) |
2061 | list_splice_tail_init(&zone_list, list); | |
2062 | ||
632bfb63 | 2063 | /* If we didn't flush the entire list, we could have told the driver |
2064 | * there was more coming, but that turned out to be a lie. | |
2065 | */ | |
e4ef2e05 KS |
2066 | if (!list_empty(list) || ret != BLK_STS_OK) |
2067 | blk_mq_commit_rqs(hctx, queued, false); | |
2068 | ||
320ae51f JA |
2069 | /* |
2070 | * Any items that need requeuing? Stuff them into hctx->dispatch, | |
2071 | * that is where we will continue on next queue run. | |
2072 | */ | |
f04c3df3 | 2073 | if (!list_empty(list)) { |
86ff7c2a | 2074 | bool needs_restart; |
75383524 ML |
2075 | /* For non-shared tags, the RESTART check will suffice */ |
2076 | bool no_tag = prep == PREP_DISPATCH_NO_TAG && | |
47df9ce9 KS |
2077 | ((hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED) || |
2078 | blk_mq_is_shared_tags(hctx->flags)); | |
86ff7c2a | 2079 | |
2a5a24aa ML |
2080 | if (nr_budgets) |
2081 | blk_mq_release_budgets(q, list); | |
86ff7c2a | 2082 | |
320ae51f | 2083 | spin_lock(&hctx->lock); |
01e99aec | 2084 | list_splice_tail_init(list, &hctx->dispatch); |
320ae51f | 2085 | spin_unlock(&hctx->lock); |
f04c3df3 | 2086 | |
d7d8535f ML |
2087 | /* |
2088 | * Order adding requests to hctx->dispatch and checking | |
2089 | * SCHED_RESTART flag. The pair of this smp_mb() is the one | |
2090 | * in blk_mq_sched_restart(). Avoid restart code path to | |
2091 | * miss the new added requests to hctx->dispatch, meantime | |
2092 | * SCHED_RESTART is observed here. | |
2093 | */ | |
2094 | smp_mb(); | |
2095 | ||
9ba52e58 | 2096 | /* |
710c785f BVA |
2097 | * If SCHED_RESTART was set by the caller of this function and |
2098 | * it is no longer set that means that it was cleared by another | |
2099 | * thread and hence that a queue rerun is needed. | |
9ba52e58 | 2100 | * |
eb619fdb JA |
2101 | * If 'no_tag' is set, that means that we failed getting |
2102 | * a driver tag with an I/O scheduler attached. If our dispatch | |
2103 | * waitqueue is no longer active, ensure that we run the queue | |
2104 | * AFTER adding our entries back to the list. | |
bd166ef1 | 2105 | * |
710c785f BVA |
2106 | * If no I/O scheduler has been configured it is possible that |
2107 | * the hardware queue got stopped and restarted before requests | |
2108 | * were pushed back onto the dispatch list. Rerun the queue to | |
2109 | * avoid starvation. Notes: | |
2110 | * - blk_mq_run_hw_queue() checks whether or not a queue has | |
2111 | * been stopped before rerunning a queue. | |
2112 | * - Some but not all block drivers stop a queue before | |
fc17b653 | 2113 | * returning BLK_STS_RESOURCE. Two exceptions are scsi-mq |
710c785f | 2114 | * and dm-rq. |
86ff7c2a ML |
2115 | * |
2116 | * If driver returns BLK_STS_RESOURCE and SCHED_RESTART | |
2117 | * bit is set, run queue after a delay to avoid IO stalls | |
ab3cee37 | 2118 | * that could otherwise occur if the queue is idle. We'll do |
9586e67b NA |
2119 | * similar if we couldn't get budget or couldn't lock a zone |
2120 | * and SCHED_RESTART is set. | |
bd166ef1 | 2121 | */ |
86ff7c2a | 2122 | needs_restart = blk_mq_sched_needs_restart(hctx); |
9586e67b NA |
2123 | if (prep == PREP_DISPATCH_NO_BUDGET) |
2124 | needs_resource = true; | |
86ff7c2a | 2125 | if (!needs_restart || |
eb619fdb | 2126 | (no_tag && list_empty_careful(&hctx->dispatch_wait.entry))) |
bd166ef1 | 2127 | blk_mq_run_hw_queue(hctx, true); |
6d5e8d21 | 2128 | else if (needs_resource) |
86ff7c2a | 2129 | blk_mq_delay_run_hw_queue(hctx, BLK_MQ_RESOURCE_DELAY); |
1f57f8d4 | 2130 | |
6e768717 | 2131 | blk_mq_update_dispatch_busy(hctx, true); |
1f57f8d4 | 2132 | return false; |
4ea58fe4 | 2133 | } |
f04c3df3 | 2134 | |
4ea58fe4 KS |
2135 | blk_mq_update_dispatch_busy(hctx, false); |
2136 | return true; | |
f04c3df3 JA |
2137 | } |
2138 | ||
f82ddf19 ML |
2139 | static inline int blk_mq_first_mapped_cpu(struct blk_mq_hw_ctx *hctx) |
2140 | { | |
2141 | int cpu = cpumask_first_and(hctx->cpumask, cpu_online_mask); | |
2142 | ||
2143 | if (cpu >= nr_cpu_ids) | |
2144 | cpu = cpumask_first(hctx->cpumask); | |
2145 | return cpu; | |
2146 | } | |
2147 | ||
506e931f JA |
2148 | /* |
2149 | * It'd be great if the workqueue API had a way to pass | |
2150 | * in a mask and had some smarts for more clever placement. | |
2151 | * For now we just round-robin here, switching for every | |
2152 | * BLK_MQ_CPU_WORK_BATCH queued items. | |
2153 | */ | |
2154 | static int blk_mq_hctx_next_cpu(struct blk_mq_hw_ctx *hctx) | |
2155 | { | |
7bed4595 | 2156 | bool tried = false; |
476f8c98 | 2157 | int next_cpu = hctx->next_cpu; |
7bed4595 | 2158 | |
b657d7e6 CH |
2159 | if (hctx->queue->nr_hw_queues == 1) |
2160 | return WORK_CPU_UNBOUND; | |
506e931f JA |
2161 | |
2162 | if (--hctx->next_cpu_batch <= 0) { | |
7bed4595 | 2163 | select_cpu: |
476f8c98 | 2164 | next_cpu = cpumask_next_and(next_cpu, hctx->cpumask, |
20e4d813 | 2165 | cpu_online_mask); |
506e931f | 2166 | if (next_cpu >= nr_cpu_ids) |
f82ddf19 | 2167 | next_cpu = blk_mq_first_mapped_cpu(hctx); |
506e931f JA |
2168 | hctx->next_cpu_batch = BLK_MQ_CPU_WORK_BATCH; |
2169 | } | |
2170 | ||
7bed4595 ML |
2171 | /* |
2172 | * Do unbound schedule if we can't find a online CPU for this hctx, | |
2173 | * and it should only happen in the path of handling CPU DEAD. | |
2174 | */ | |
476f8c98 | 2175 | if (!cpu_online(next_cpu)) { |
7bed4595 ML |
2176 | if (!tried) { |
2177 | tried = true; | |
2178 | goto select_cpu; | |
2179 | } | |
2180 | ||
2181 | /* | |
2182 | * Make sure to re-select CPU next time once after CPUs | |
2183 | * in hctx->cpumask become online again. | |
2184 | */ | |
476f8c98 | 2185 | hctx->next_cpu = next_cpu; |
7bed4595 ML |
2186 | hctx->next_cpu_batch = 1; |
2187 | return WORK_CPU_UNBOUND; | |
2188 | } | |
476f8c98 ML |
2189 | |
2190 | hctx->next_cpu = next_cpu; | |
2191 | return next_cpu; | |
506e931f JA |
2192 | } |
2193 | ||
105663f7 | 2194 | /** |
1aa8d875 | 2195 | * blk_mq_delay_run_hw_queue - Run a hardware queue asynchronously. |
105663f7 | 2196 | * @hctx: Pointer to the hardware queue to run. |
fa94ba8a | 2197 | * @msecs: Milliseconds of delay to wait before running the queue. |
105663f7 | 2198 | * |
1aa8d875 | 2199 | * Run a hardware queue asynchronously with a delay of @msecs. |
105663f7 | 2200 | */ |
1aa8d875 | 2201 | void blk_mq_delay_run_hw_queue(struct blk_mq_hw_ctx *hctx, unsigned long msecs) |
320ae51f | 2202 | { |
5435c023 | 2203 | if (unlikely(blk_mq_hctx_stopped(hctx))) |
320ae51f | 2204 | return; |
ae943d20 BVA |
2205 | kblockd_mod_delayed_work_on(blk_mq_hctx_next_cpu(hctx), &hctx->run_work, |
2206 | msecs_to_jiffies(msecs)); | |
7587a5ae | 2207 | } |
7587a5ae BVA |
2208 | EXPORT_SYMBOL(blk_mq_delay_run_hw_queue); |
2209 | ||
105663f7 AA |
2210 | /** |
2211 | * blk_mq_run_hw_queue - Start to run a hardware queue. | |
2212 | * @hctx: Pointer to the hardware queue to run. | |
2213 | * @async: If we want to run the queue asynchronously. | |
2214 | * | |
2215 | * Check if the request queue is not in a quiesced state and if there are | |
2216 | * pending requests to be sent. If this is true, run the queue to send requests | |
2217 | * to hardware. | |
2218 | */ | |
626fb735 | 2219 | void blk_mq_run_hw_queue(struct blk_mq_hw_ctx *hctx, bool async) |
7587a5ae | 2220 | { |
24f5a90f ML |
2221 | bool need_run; |
2222 | ||
4d5bba5b CH |
2223 | /* |
2224 | * We can't run the queue inline with interrupts disabled. | |
2225 | */ | |
2226 | WARN_ON_ONCE(!async && in_interrupt()); | |
2227 | ||
24f5a90f ML |
2228 | /* |
2229 | * When queue is quiesced, we may be switching io scheduler, or | |
2230 | * updating nr_hw_queues, or other things, and we can't run queue | |
2231 | * any more, even __blk_mq_hctx_has_pending() can't be called safely. | |
2232 | * | |
2233 | * And queue will be rerun in blk_mq_unquiesce_queue() if it is | |
2234 | * quiesced. | |
2235 | */ | |
41adf531 | 2236 | __blk_mq_run_dispatch_ops(hctx->queue, false, |
2a904d00 ML |
2237 | need_run = !blk_queue_quiesced(hctx->queue) && |
2238 | blk_mq_hctx_has_pending(hctx)); | |
24f5a90f | 2239 | |
1aa8d875 CH |
2240 | if (!need_run) |
2241 | return; | |
2242 | ||
2243 | if (async || (hctx->flags & BLK_MQ_F_BLOCKING) || | |
2244 | !cpumask_test_cpu(raw_smp_processor_id(), hctx->cpumask)) { | |
2245 | blk_mq_delay_run_hw_queue(hctx, 0); | |
2246 | return; | |
2247 | } | |
2248 | ||
4d5bba5b CH |
2249 | blk_mq_run_dispatch_ops(hctx->queue, |
2250 | blk_mq_sched_dispatch_requests(hctx)); | |
320ae51f | 2251 | } |
5b727272 | 2252 | EXPORT_SYMBOL(blk_mq_run_hw_queue); |
320ae51f | 2253 | |
b6e68ee8 JK |
2254 | /* |
2255 | * Return prefered queue to dispatch from (if any) for non-mq aware IO | |
2256 | * scheduler. | |
2257 | */ | |
2258 | static struct blk_mq_hw_ctx *blk_mq_get_sq_hctx(struct request_queue *q) | |
2259 | { | |
5d05426e | 2260 | struct blk_mq_ctx *ctx = blk_mq_get_ctx(q); |
b6e68ee8 JK |
2261 | /* |
2262 | * If the IO scheduler does not respect hardware queues when | |
2263 | * dispatching, we just don't bother with multiple HW queues and | |
2264 | * dispatch from hctx for the current CPU since running multiple queues | |
2265 | * just causes lock contention inside the scheduler and pointless cache | |
2266 | * bouncing. | |
2267 | */ | |
51ab80f0 | 2268 | struct blk_mq_hw_ctx *hctx = ctx->hctxs[HCTX_TYPE_DEFAULT]; |
5d05426e | 2269 | |
b6e68ee8 JK |
2270 | if (!blk_mq_hctx_stopped(hctx)) |
2271 | return hctx; | |
2272 | return NULL; | |
2273 | } | |
2274 | ||
105663f7 | 2275 | /** |
24f7bb88 | 2276 | * blk_mq_run_hw_queues - Run all hardware queues in a request queue. |
105663f7 AA |
2277 | * @q: Pointer to the request queue to run. |
2278 | * @async: If we want to run the queue asynchronously. | |
2279 | */ | |
b94ec296 | 2280 | void blk_mq_run_hw_queues(struct request_queue *q, bool async) |
320ae51f | 2281 | { |
b6e68ee8 | 2282 | struct blk_mq_hw_ctx *hctx, *sq_hctx; |
4f481208 | 2283 | unsigned long i; |
320ae51f | 2284 | |
b6e68ee8 | 2285 | sq_hctx = NULL; |
4d337ceb | 2286 | if (blk_queue_sq_sched(q)) |
b6e68ee8 | 2287 | sq_hctx = blk_mq_get_sq_hctx(q); |
320ae51f | 2288 | queue_for_each_hw_ctx(q, hctx, i) { |
79f720a7 | 2289 | if (blk_mq_hctx_stopped(hctx)) |
320ae51f | 2290 | continue; |
b6e68ee8 JK |
2291 | /* |
2292 | * Dispatch from this hctx either if there's no hctx preferred | |
2293 | * by IO scheduler or if it has requests that bypass the | |
2294 | * scheduler. | |
2295 | */ | |
2296 | if (!sq_hctx || sq_hctx == hctx || | |
2297 | !list_empty_careful(&hctx->dispatch)) | |
2298 | blk_mq_run_hw_queue(hctx, async); | |
320ae51f JA |
2299 | } |
2300 | } | |
b94ec296 | 2301 | EXPORT_SYMBOL(blk_mq_run_hw_queues); |
320ae51f | 2302 | |
b9151e7b DA |
2303 | /** |
2304 | * blk_mq_delay_run_hw_queues - Run all hardware queues asynchronously. | |
2305 | * @q: Pointer to the request queue to run. | |
fa94ba8a | 2306 | * @msecs: Milliseconds of delay to wait before running the queues. |
b9151e7b DA |
2307 | */ |
2308 | void blk_mq_delay_run_hw_queues(struct request_queue *q, unsigned long msecs) | |
2309 | { | |
b6e68ee8 | 2310 | struct blk_mq_hw_ctx *hctx, *sq_hctx; |
4f481208 | 2311 | unsigned long i; |
b9151e7b | 2312 | |
b6e68ee8 | 2313 | sq_hctx = NULL; |
4d337ceb | 2314 | if (blk_queue_sq_sched(q)) |
b6e68ee8 | 2315 | sq_hctx = blk_mq_get_sq_hctx(q); |
b9151e7b DA |
2316 | queue_for_each_hw_ctx(q, hctx, i) { |
2317 | if (blk_mq_hctx_stopped(hctx)) | |
2318 | continue; | |
8f5fea65 DJ |
2319 | /* |
2320 | * If there is already a run_work pending, leave the | |
2321 | * pending delay untouched. Otherwise, a hctx can stall | |
2322 | * if another hctx is re-delaying the other's work | |
2323 | * before the work executes. | |
2324 | */ | |
2325 | if (delayed_work_pending(&hctx->run_work)) | |
2326 | continue; | |
b6e68ee8 JK |
2327 | /* |
2328 | * Dispatch from this hctx either if there's no hctx preferred | |
2329 | * by IO scheduler or if it has requests that bypass the | |
2330 | * scheduler. | |
2331 | */ | |
2332 | if (!sq_hctx || sq_hctx == hctx || | |
2333 | !list_empty_careful(&hctx->dispatch)) | |
2334 | blk_mq_delay_run_hw_queue(hctx, msecs); | |
b9151e7b DA |
2335 | } |
2336 | } | |
2337 | EXPORT_SYMBOL(blk_mq_delay_run_hw_queues); | |
2338 | ||
39a70c76 ML |
2339 | /* |
2340 | * This function is often used for pausing .queue_rq() by driver when | |
2341 | * there isn't enough resource or some conditions aren't satisfied, and | |
4d606219 | 2342 | * BLK_STS_RESOURCE is usually returned. |
39a70c76 ML |
2343 | * |
2344 | * We do not guarantee that dispatch can be drained or blocked | |
2345 | * after blk_mq_stop_hw_queue() returns. Please use | |
2346 | * blk_mq_quiesce_queue() for that requirement. | |
2347 | */ | |
2719aa21 JA |
2348 | void blk_mq_stop_hw_queue(struct blk_mq_hw_ctx *hctx) |
2349 | { | |
641a9ed6 | 2350 | cancel_delayed_work(&hctx->run_work); |
280d45f6 | 2351 | |
641a9ed6 | 2352 | set_bit(BLK_MQ_S_STOPPED, &hctx->state); |
2719aa21 | 2353 | } |
641a9ed6 | 2354 | EXPORT_SYMBOL(blk_mq_stop_hw_queue); |
2719aa21 | 2355 | |
39a70c76 ML |
2356 | /* |
2357 | * This function is often used for pausing .queue_rq() by driver when | |
2358 | * there isn't enough resource or some conditions aren't satisfied, and | |
4d606219 | 2359 | * BLK_STS_RESOURCE is usually returned. |
39a70c76 ML |
2360 | * |
2361 | * We do not guarantee that dispatch can be drained or blocked | |
2362 | * after blk_mq_stop_hw_queues() returns. Please use | |
2363 | * blk_mq_quiesce_queue() for that requirement. | |
2364 | */ | |
2719aa21 JA |
2365 | void blk_mq_stop_hw_queues(struct request_queue *q) |
2366 | { | |
641a9ed6 | 2367 | struct blk_mq_hw_ctx *hctx; |
4f481208 | 2368 | unsigned long i; |
641a9ed6 ML |
2369 | |
2370 | queue_for_each_hw_ctx(q, hctx, i) | |
2371 | blk_mq_stop_hw_queue(hctx); | |
280d45f6 CH |
2372 | } |
2373 | EXPORT_SYMBOL(blk_mq_stop_hw_queues); | |
2374 | ||
320ae51f JA |
2375 | void blk_mq_start_hw_queue(struct blk_mq_hw_ctx *hctx) |
2376 | { | |
2377 | clear_bit(BLK_MQ_S_STOPPED, &hctx->state); | |
e4043dcf | 2378 | |
0ffbce80 | 2379 | blk_mq_run_hw_queue(hctx, false); |
320ae51f JA |
2380 | } |
2381 | EXPORT_SYMBOL(blk_mq_start_hw_queue); | |
2382 | ||
2f268556 CH |
2383 | void blk_mq_start_hw_queues(struct request_queue *q) |
2384 | { | |
2385 | struct blk_mq_hw_ctx *hctx; | |
4f481208 | 2386 | unsigned long i; |
2f268556 CH |
2387 | |
2388 | queue_for_each_hw_ctx(q, hctx, i) | |
2389 | blk_mq_start_hw_queue(hctx); | |
2390 | } | |
2391 | EXPORT_SYMBOL(blk_mq_start_hw_queues); | |
2392 | ||
ae911c5e JA |
2393 | void blk_mq_start_stopped_hw_queue(struct blk_mq_hw_ctx *hctx, bool async) |
2394 | { | |
2395 | if (!blk_mq_hctx_stopped(hctx)) | |
2396 | return; | |
2397 | ||
2398 | clear_bit(BLK_MQ_S_STOPPED, &hctx->state); | |
2399 | blk_mq_run_hw_queue(hctx, async); | |
2400 | } | |
2401 | EXPORT_SYMBOL_GPL(blk_mq_start_stopped_hw_queue); | |
2402 | ||
1b4a3258 | 2403 | void blk_mq_start_stopped_hw_queues(struct request_queue *q, bool async) |
320ae51f JA |
2404 | { |
2405 | struct blk_mq_hw_ctx *hctx; | |
4f481208 | 2406 | unsigned long i; |
320ae51f | 2407 | |
ae911c5e JA |
2408 | queue_for_each_hw_ctx(q, hctx, i) |
2409 | blk_mq_start_stopped_hw_queue(hctx, async); | |
320ae51f JA |
2410 | } |
2411 | EXPORT_SYMBOL(blk_mq_start_stopped_hw_queues); | |
2412 | ||
70f4db63 | 2413 | static void blk_mq_run_work_fn(struct work_struct *work) |
320ae51f | 2414 | { |
c20a1a2c CH |
2415 | struct blk_mq_hw_ctx *hctx = |
2416 | container_of(work, struct blk_mq_hw_ctx, run_work.work); | |
7b607814 | 2417 | |
4d5bba5b CH |
2418 | blk_mq_run_dispatch_ops(hctx->queue, |
2419 | blk_mq_sched_dispatch_requests(hctx)); | |
320ae51f JA |
2420 | } |
2421 | ||
105663f7 AA |
2422 | /** |
2423 | * blk_mq_request_bypass_insert - Insert a request at dispatch list. | |
2424 | * @rq: Pointer to request to be inserted. | |
2b597613 | 2425 | * @flags: BLK_MQ_INSERT_* |
105663f7 | 2426 | * |
157f377b JA |
2427 | * Should only be used carefully, when the caller knows we want to |
2428 | * bypass a potential IO scheduler on the target device. | |
2429 | */ | |
2b597613 | 2430 | void blk_mq_request_bypass_insert(struct request *rq, blk_insert_t flags) |
157f377b | 2431 | { |
ea4f995e | 2432 | struct blk_mq_hw_ctx *hctx = rq->mq_hctx; |
157f377b JA |
2433 | |
2434 | spin_lock(&hctx->lock); | |
2b597613 | 2435 | if (flags & BLK_MQ_INSERT_AT_HEAD) |
01e99aec ML |
2436 | list_add(&rq->queuelist, &hctx->dispatch); |
2437 | else | |
2438 | list_add_tail(&rq->queuelist, &hctx->dispatch); | |
157f377b | 2439 | spin_unlock(&hctx->lock); |
157f377b JA |
2440 | } |
2441 | ||
05a93117 CH |
2442 | static void blk_mq_insert_requests(struct blk_mq_hw_ctx *hctx, |
2443 | struct blk_mq_ctx *ctx, struct list_head *list, | |
2444 | bool run_queue_async) | |
320ae51f | 2445 | { |
3f0cedc7 | 2446 | struct request *rq; |
c16d6b5a | 2447 | enum hctx_type type = hctx->type; |
3f0cedc7 | 2448 | |
94aa228c CH |
2449 | /* |
2450 | * Try to issue requests directly if the hw queue isn't busy to save an | |
2451 | * extra enqueue & dequeue to the sw queue. | |
2452 | */ | |
2453 | if (!hctx->dispatch_busy && !run_queue_async) { | |
2454 | blk_mq_run_dispatch_ops(hctx->queue, | |
2455 | blk_mq_try_issue_list_directly(hctx, list)); | |
2456 | if (list_empty(list)) | |
2457 | goto out; | |
2458 | } | |
2459 | ||
320ae51f JA |
2460 | /* |
2461 | * preemption doesn't flush plug list, so it's possible ctx->cpu is | |
2462 | * offline now | |
2463 | */ | |
3f0cedc7 | 2464 | list_for_each_entry(rq, list, queuelist) { |
e57690fe | 2465 | BUG_ON(rq->mq_ctx != ctx); |
a54895fa | 2466 | trace_block_rq_insert(rq); |
320ae51f | 2467 | } |
3f0cedc7 ML |
2468 | |
2469 | spin_lock(&ctx->lock); | |
c16d6b5a | 2470 | list_splice_tail_init(list, &ctx->rq_lists[type]); |
cfd0c552 | 2471 | blk_mq_hctx_mark_pending(hctx, ctx); |
320ae51f | 2472 | spin_unlock(&ctx->lock); |
94aa228c CH |
2473 | out: |
2474 | blk_mq_run_hw_queue(hctx, run_queue_async); | |
320ae51f JA |
2475 | } |
2476 | ||
710fa378 | 2477 | static void blk_mq_insert_request(struct request *rq, blk_insert_t flags) |
2bd215df CH |
2478 | { |
2479 | struct request_queue *q = rq->q; | |
2bd215df CH |
2480 | struct blk_mq_ctx *ctx = rq->mq_ctx; |
2481 | struct blk_mq_hw_ctx *hctx = rq->mq_hctx; | |
2482 | ||
53548d2a CH |
2483 | if (blk_rq_is_passthrough(rq)) { |
2484 | /* | |
2485 | * Passthrough request have to be added to hctx->dispatch | |
2486 | * directly. The device may be in a situation where it can't | |
2487 | * handle FS request, and always returns BLK_STS_RESOURCE for | |
2488 | * them, which gets them added to hctx->dispatch. | |
2489 | * | |
2490 | * If a passthrough request is required to unblock the queues, | |
2491 | * and it is added to the scheduler queue, there is no chance to | |
2492 | * dispatch it given we prioritize requests in hctx->dispatch. | |
2493 | */ | |
2b597613 | 2494 | blk_mq_request_bypass_insert(rq, flags); |
53548d2a | 2495 | } else if (rq->rq_flags & RQF_FLUSH_SEQ) { |
2bd215df CH |
2496 | /* |
2497 | * Firstly normal IO request is inserted to scheduler queue or | |
2498 | * sw queue, meantime we add flush request to dispatch queue( | |
2499 | * hctx->dispatch) directly and there is at most one in-flight | |
2500 | * flush request for each hw queue, so it doesn't matter to add | |
2501 | * flush request to tail or front of the dispatch queue. | |
2502 | * | |
2503 | * Secondly in case of NCQ, flush request belongs to non-NCQ | |
2504 | * command, and queueing it will fail when there is any | |
2505 | * in-flight normal IO request(NCQ command). When adding flush | |
2506 | * rq to the front of hctx->dispatch, it is easier to introduce | |
2507 | * extra time to flush rq's latency because of S_SCHED_RESTART | |
2508 | * compared with adding to the tail of dispatch queue, then | |
2509 | * chance of flush merge is increased, and less flush requests | |
2510 | * will be issued to controller. It is observed that ~10% time | |
2511 | * is saved in blktests block/004 on disk attached to AHCI/NCQ | |
2512 | * drive when adding flush rq to the front of hctx->dispatch. | |
2513 | * | |
2514 | * Simply queue flush rq to the front of hctx->dispatch so that | |
2515 | * intensive flush workloads can benefit in case of NCQ HW. | |
2516 | */ | |
2b597613 | 2517 | blk_mq_request_bypass_insert(rq, BLK_MQ_INSERT_AT_HEAD); |
53548d2a | 2518 | } else if (q->elevator) { |
2bd215df CH |
2519 | LIST_HEAD(list); |
2520 | ||
53548d2a CH |
2521 | WARN_ON_ONCE(rq->tag != BLK_MQ_NO_TAG); |
2522 | ||
2bd215df | 2523 | list_add(&rq->queuelist, &list); |
93fffe16 | 2524 | q->elevator->type->ops.insert_requests(hctx, &list, flags); |
2bd215df | 2525 | } else { |
4ec5c055 CH |
2526 | trace_block_rq_insert(rq); |
2527 | ||
2bd215df | 2528 | spin_lock(&ctx->lock); |
710fa378 | 2529 | if (flags & BLK_MQ_INSERT_AT_HEAD) |
4ec5c055 CH |
2530 | list_add(&rq->queuelist, &ctx->rq_lists[hctx->type]); |
2531 | else | |
2532 | list_add_tail(&rq->queuelist, | |
2533 | &ctx->rq_lists[hctx->type]); | |
a88db1e0 | 2534 | blk_mq_hctx_mark_pending(hctx, ctx); |
2bd215df CH |
2535 | spin_unlock(&ctx->lock); |
2536 | } | |
320ae51f JA |
2537 | } |
2538 | ||
14ccb66b CH |
2539 | static void blk_mq_bio_to_request(struct request *rq, struct bio *bio, |
2540 | unsigned int nr_segs) | |
320ae51f | 2541 | { |
93f221ae EB |
2542 | int err; |
2543 | ||
f924cdde CH |
2544 | if (bio->bi_opf & REQ_RAHEAD) |
2545 | rq->cmd_flags |= REQ_FAILFAST_MASK; | |
2546 | ||
2547 | rq->__sector = bio->bi_iter.bi_sector; | |
14ccb66b | 2548 | blk_rq_bio_prep(rq, bio, nr_segs); |
93f221ae EB |
2549 | |
2550 | /* This can't fail, since GFP_NOIO includes __GFP_DIRECT_RECLAIM. */ | |
2551 | err = blk_crypto_rq_bio_prep(rq, bio, GFP_NOIO); | |
2552 | WARN_ON_ONCE(err); | |
4b570521 | 2553 | |
b5af37ab | 2554 | blk_account_io_start(rq); |
320ae51f JA |
2555 | } |
2556 | ||
0f95549c | 2557 | static blk_status_t __blk_mq_issue_directly(struct blk_mq_hw_ctx *hctx, |
3e08773c | 2558 | struct request *rq, bool last) |
f984df1f | 2559 | { |
f984df1f | 2560 | struct request_queue *q = rq->q; |
f984df1f SL |
2561 | struct blk_mq_queue_data bd = { |
2562 | .rq = rq, | |
be94f058 | 2563 | .last = last, |
f984df1f | 2564 | }; |
f06345ad | 2565 | blk_status_t ret; |
0f95549c | 2566 | |
0f95549c MS |
2567 | /* |
2568 | * For OK queue, we are done. For error, caller may kill it. | |
2569 | * Any other error (busy), just add it to our list as we | |
2570 | * previously would have done. | |
2571 | */ | |
2572 | ret = q->mq_ops->queue_rq(hctx, &bd); | |
2573 | switch (ret) { | |
2574 | case BLK_STS_OK: | |
6ce3dd6e | 2575 | blk_mq_update_dispatch_busy(hctx, false); |
0f95549c MS |
2576 | break; |
2577 | case BLK_STS_RESOURCE: | |
86ff7c2a | 2578 | case BLK_STS_DEV_RESOURCE: |
6ce3dd6e | 2579 | blk_mq_update_dispatch_busy(hctx, true); |
0f95549c MS |
2580 | __blk_mq_requeue_request(rq); |
2581 | break; | |
2582 | default: | |
6ce3dd6e | 2583 | blk_mq_update_dispatch_busy(hctx, false); |
0f95549c MS |
2584 | break; |
2585 | } | |
2586 | ||
2587 | return ret; | |
2588 | } | |
2589 | ||
2b71b877 | 2590 | static bool blk_mq_get_budget_and_tag(struct request *rq) |
0f95549c | 2591 | { |
2a5a24aa | 2592 | int budget_token; |
d964f04a | 2593 | |
2b71b877 | 2594 | budget_token = blk_mq_get_dispatch_budget(rq->q); |
2a5a24aa | 2595 | if (budget_token < 0) |
2b71b877 | 2596 | return false; |
2a5a24aa | 2597 | blk_mq_set_rq_budget_token(rq, budget_token); |
8ab6bb9e | 2598 | if (!blk_mq_get_driver_tag(rq)) { |
2b71b877 CH |
2599 | blk_mq_put_dispatch_budget(rq->q, budget_token); |
2600 | return false; | |
88022d72 | 2601 | } |
2b71b877 | 2602 | return true; |
fd9c40f6 BVA |
2603 | } |
2604 | ||
105663f7 AA |
2605 | /** |
2606 | * blk_mq_try_issue_directly - Try to send a request directly to device driver. | |
2607 | * @hctx: Pointer of the associated hardware queue. | |
2608 | * @rq: Pointer to request to be sent. | |
105663f7 AA |
2609 | * |
2610 | * If the device has enough resources to accept a new request now, send the | |
2611 | * request directly to device driver. Else, insert at hctx->dispatch queue, so | |
2612 | * we can try send it another time in the future. Requests inserted at this | |
2613 | * queue have higher priority. | |
2614 | */ | |
fd9c40f6 | 2615 | static void blk_mq_try_issue_directly(struct blk_mq_hw_ctx *hctx, |
3e08773c | 2616 | struct request *rq) |
fd9c40f6 | 2617 | { |
e1f44ac0 CH |
2618 | blk_status_t ret; |
2619 | ||
2620 | if (blk_mq_hctx_stopped(hctx) || blk_queue_quiesced(rq->q)) { | |
710fa378 | 2621 | blk_mq_insert_request(rq, 0); |
e1f44ac0 CH |
2622 | return; |
2623 | } | |
2624 | ||
2625 | if ((rq->rq_flags & RQF_ELV) || !blk_mq_get_budget_and_tag(rq)) { | |
710fa378 | 2626 | blk_mq_insert_request(rq, 0); |
f0dbe6e8 | 2627 | blk_mq_run_hw_queue(hctx, false); |
e1f44ac0 CH |
2628 | return; |
2629 | } | |
fd9c40f6 | 2630 | |
e1f44ac0 CH |
2631 | ret = __blk_mq_issue_directly(hctx, rq, true); |
2632 | switch (ret) { | |
2633 | case BLK_STS_OK: | |
2634 | break; | |
2635 | case BLK_STS_RESOURCE: | |
2636 | case BLK_STS_DEV_RESOURCE: | |
2b597613 | 2637 | blk_mq_request_bypass_insert(rq, 0); |
2394395c | 2638 | blk_mq_run_hw_queue(hctx, false); |
e1f44ac0 CH |
2639 | break; |
2640 | default: | |
fd9c40f6 | 2641 | blk_mq_end_request(rq, ret); |
e1f44ac0 CH |
2642 | break; |
2643 | } | |
fd9c40f6 BVA |
2644 | } |
2645 | ||
06c8c691 | 2646 | static blk_status_t blk_mq_request_issue_directly(struct request *rq, bool last) |
fd9c40f6 | 2647 | { |
e1f44ac0 CH |
2648 | struct blk_mq_hw_ctx *hctx = rq->mq_hctx; |
2649 | ||
2650 | if (blk_mq_hctx_stopped(hctx) || blk_queue_quiesced(rq->q)) { | |
710fa378 | 2651 | blk_mq_insert_request(rq, 0); |
e1f44ac0 CH |
2652 | return BLK_STS_OK; |
2653 | } | |
2654 | ||
2655 | if (!blk_mq_get_budget_and_tag(rq)) | |
2656 | return BLK_STS_RESOURCE; | |
2657 | return __blk_mq_issue_directly(hctx, rq, last); | |
5eb6126e CH |
2658 | } |
2659 | ||
3e368fb0 | 2660 | static void blk_mq_plug_issue_direct(struct blk_plug *plug) |
b84c5b50 CH |
2661 | { |
2662 | struct blk_mq_hw_ctx *hctx = NULL; | |
2663 | struct request *rq; | |
2664 | int queued = 0; | |
0d617a83 | 2665 | blk_status_t ret = BLK_STS_OK; |
b84c5b50 CH |
2666 | |
2667 | while ((rq = rq_list_pop(&plug->mq_list))) { | |
2668 | bool last = rq_list_empty(plug->mq_list); | |
b84c5b50 CH |
2669 | |
2670 | if (hctx != rq->mq_hctx) { | |
34c9f547 KS |
2671 | if (hctx) { |
2672 | blk_mq_commit_rqs(hctx, queued, false); | |
2673 | queued = 0; | |
2674 | } | |
b84c5b50 CH |
2675 | hctx = rq->mq_hctx; |
2676 | } | |
2677 | ||
2678 | ret = blk_mq_request_issue_directly(rq, last); | |
2679 | switch (ret) { | |
2680 | case BLK_STS_OK: | |
2681 | queued++; | |
2682 | break; | |
2683 | case BLK_STS_RESOURCE: | |
2684 | case BLK_STS_DEV_RESOURCE: | |
2b597613 | 2685 | blk_mq_request_bypass_insert(rq, 0); |
2394395c | 2686 | blk_mq_run_hw_queue(hctx, false); |
0d617a83 | 2687 | goto out; |
b84c5b50 CH |
2688 | default: |
2689 | blk_mq_end_request(rq, ret); | |
b84c5b50 CH |
2690 | break; |
2691 | } | |
2692 | } | |
2693 | ||
0d617a83 KS |
2694 | out: |
2695 | if (ret != BLK_STS_OK) | |
34c9f547 | 2696 | blk_mq_commit_rqs(hctx, queued, false); |
b84c5b50 CH |
2697 | } |
2698 | ||
518579a9 KB |
2699 | static void __blk_mq_flush_plug_list(struct request_queue *q, |
2700 | struct blk_plug *plug) | |
2701 | { | |
2702 | if (blk_queue_quiesced(q)) | |
2703 | return; | |
2704 | q->mq_ops->queue_rqs(&plug->mq_list); | |
2705 | } | |
2706 | ||
26fed4ac JA |
2707 | static void blk_mq_dispatch_plug_list(struct blk_plug *plug, bool from_sched) |
2708 | { | |
2709 | struct blk_mq_hw_ctx *this_hctx = NULL; | |
2710 | struct blk_mq_ctx *this_ctx = NULL; | |
2711 | struct request *requeue_list = NULL; | |
34e0a279 | 2712 | struct request **requeue_lastp = &requeue_list; |
26fed4ac JA |
2713 | unsigned int depth = 0; |
2714 | LIST_HEAD(list); | |
2715 | ||
2716 | do { | |
2717 | struct request *rq = rq_list_pop(&plug->mq_list); | |
2718 | ||
2719 | if (!this_hctx) { | |
2720 | this_hctx = rq->mq_hctx; | |
2721 | this_ctx = rq->mq_ctx; | |
2722 | } else if (this_hctx != rq->mq_hctx || this_ctx != rq->mq_ctx) { | |
34e0a279 | 2723 | rq_list_add_tail(&requeue_lastp, rq); |
26fed4ac JA |
2724 | continue; |
2725 | } | |
34e0a279 | 2726 | list_add(&rq->queuelist, &list); |
26fed4ac JA |
2727 | depth++; |
2728 | } while (!rq_list_empty(plug->mq_list)); | |
2729 | ||
2730 | plug->mq_list = requeue_list; | |
2731 | trace_block_unplug(this_hctx->queue, depth, !from_sched); | |
05a93117 CH |
2732 | |
2733 | percpu_ref_get(&this_hctx->queue->q_usage_counter); | |
2734 | if (this_hctx->queue->elevator) { | |
2735 | this_hctx->queue->elevator->type->ops.insert_requests(this_hctx, | |
93fffe16 | 2736 | &list, 0); |
05a93117 CH |
2737 | blk_mq_run_hw_queue(this_hctx, from_sched); |
2738 | } else { | |
2739 | blk_mq_insert_requests(this_hctx, this_ctx, &list, from_sched); | |
2740 | } | |
2741 | percpu_ref_put(&this_hctx->queue->q_usage_counter); | |
26fed4ac JA |
2742 | } |
2743 | ||
b84c5b50 CH |
2744 | void blk_mq_flush_plug_list(struct blk_plug *plug, bool from_schedule) |
2745 | { | |
3c67d44d | 2746 | struct request *rq; |
b84c5b50 CH |
2747 | |
2748 | if (rq_list_empty(plug->mq_list)) | |
2749 | return; | |
2750 | plug->rq_count = 0; | |
2751 | ||
2752 | if (!plug->multiple_queues && !plug->has_elevator && !from_schedule) { | |
3c67d44d JA |
2753 | struct request_queue *q; |
2754 | ||
2755 | rq = rq_list_peek(&plug->mq_list); | |
2756 | q = rq->q; | |
2757 | ||
2758 | /* | |
2759 | * Peek first request and see if we have a ->queue_rqs() hook. | |
2760 | * If we do, we can dispatch the whole plug list in one go. We | |
2761 | * already know at this point that all requests belong to the | |
2762 | * same queue, caller must ensure that's the case. | |
2763 | * | |
2764 | * Since we pass off the full list to the driver at this point, | |
2765 | * we do not increment the active request count for the queue. | |
2766 | * Bypass shared tags for now because of that. | |
2767 | */ | |
2768 | if (q->mq_ops->queue_rqs && | |
2769 | !(rq->mq_hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED)) { | |
2770 | blk_mq_run_dispatch_ops(q, | |
518579a9 | 2771 | __blk_mq_flush_plug_list(q, plug)); |
3c67d44d JA |
2772 | if (rq_list_empty(plug->mq_list)) |
2773 | return; | |
2774 | } | |
73f3760e ML |
2775 | |
2776 | blk_mq_run_dispatch_ops(q, | |
3e368fb0 | 2777 | blk_mq_plug_issue_direct(plug)); |
b84c5b50 CH |
2778 | if (rq_list_empty(plug->mq_list)) |
2779 | return; | |
2780 | } | |
2781 | ||
b84c5b50 | 2782 | do { |
26fed4ac | 2783 | blk_mq_dispatch_plug_list(plug, from_schedule); |
b84c5b50 | 2784 | } while (!rq_list_empty(plug->mq_list)); |
b84c5b50 CH |
2785 | } |
2786 | ||
94aa228c | 2787 | static void blk_mq_try_issue_list_directly(struct blk_mq_hw_ctx *hctx, |
6ce3dd6e ML |
2788 | struct list_head *list) |
2789 | { | |
536167d4 | 2790 | int queued = 0; |
984ce0a7 | 2791 | blk_status_t ret = BLK_STS_OK; |
536167d4 | 2792 | |
6ce3dd6e | 2793 | while (!list_empty(list)) { |
6ce3dd6e ML |
2794 | struct request *rq = list_first_entry(list, struct request, |
2795 | queuelist); | |
2796 | ||
2797 | list_del_init(&rq->queuelist); | |
fd9c40f6 | 2798 | ret = blk_mq_request_issue_directly(rq, list_empty(list)); |
27e8b2bb KS |
2799 | switch (ret) { |
2800 | case BLK_STS_OK: | |
536167d4 | 2801 | queued++; |
27e8b2bb KS |
2802 | break; |
2803 | case BLK_STS_RESOURCE: | |
2804 | case BLK_STS_DEV_RESOURCE: | |
2b597613 | 2805 | blk_mq_request_bypass_insert(rq, 0); |
2394395c CH |
2806 | if (list_empty(list)) |
2807 | blk_mq_run_hw_queue(hctx, false); | |
27e8b2bb KS |
2808 | goto out; |
2809 | default: | |
2810 | blk_mq_end_request(rq, ret); | |
2811 | break; | |
2812 | } | |
6ce3dd6e | 2813 | } |
d666ba98 | 2814 | |
27e8b2bb | 2815 | out: |
984ce0a7 KS |
2816 | if (ret != BLK_STS_OK) |
2817 | blk_mq_commit_rqs(hctx, queued, false); | |
6ce3dd6e ML |
2818 | } |
2819 | ||
b131f201 | 2820 | static bool blk_mq_attempt_bio_merge(struct request_queue *q, |
0c5bcc92 | 2821 | struct bio *bio, unsigned int nr_segs) |
900e0807 JA |
2822 | { |
2823 | if (!blk_queue_nomerges(q) && bio_mergeable(bio)) { | |
0c5bcc92 | 2824 | if (blk_attempt_plug_merge(q, bio, nr_segs)) |
900e0807 JA |
2825 | return true; |
2826 | if (blk_mq_sched_bio_merge(q, bio, nr_segs)) | |
2827 | return true; | |
2828 | } | |
2829 | return false; | |
2830 | } | |
2831 | ||
71539717 JA |
2832 | static struct request *blk_mq_get_new_requests(struct request_queue *q, |
2833 | struct blk_plug *plug, | |
0a5aa8d1 SK |
2834 | struct bio *bio, |
2835 | unsigned int nsegs) | |
71539717 JA |
2836 | { |
2837 | struct blk_mq_alloc_data data = { | |
2838 | .q = q, | |
2839 | .nr_tags = 1, | |
9d497e29 | 2840 | .cmd_flags = bio->bi_opf, |
71539717 JA |
2841 | }; |
2842 | struct request *rq; | |
2843 | ||
5b13bc8a | 2844 | if (unlikely(bio_queue_enter(bio))) |
b637108a | 2845 | return NULL; |
900e0807 | 2846 | |
0a5aa8d1 SK |
2847 | if (blk_mq_attempt_bio_merge(q, bio, nsegs)) |
2848 | goto queue_exit; | |
2849 | ||
2850 | rq_qos_throttle(q, bio); | |
2851 | ||
71539717 JA |
2852 | if (plug) { |
2853 | data.nr_tags = plug->nr_ios; | |
2854 | plug->nr_ios = 1; | |
2855 | data.cached_rq = &plug->cached_rq; | |
2856 | } | |
2857 | ||
2858 | rq = __blk_mq_alloc_requests(&data); | |
373b5416 JA |
2859 | if (rq) |
2860 | return rq; | |
71539717 JA |
2861 | rq_qos_cleanup(q, bio); |
2862 | if (bio->bi_opf & REQ_NOWAIT) | |
2863 | bio_wouldblock_error(bio); | |
0a5aa8d1 | 2864 | queue_exit: |
5b13bc8a | 2865 | blk_queue_exit(q); |
71539717 JA |
2866 | return NULL; |
2867 | } | |
2868 | ||
5b13bc8a | 2869 | static inline struct request *blk_mq_get_cached_request(struct request_queue *q, |
0a5aa8d1 | 2870 | struct blk_plug *plug, struct bio **bio, unsigned int nsegs) |
71539717 | 2871 | { |
b637108a | 2872 | struct request *rq; |
77465647 | 2873 | enum hctx_type type, hctx_type; |
b637108a | 2874 | |
5b13bc8a CH |
2875 | if (!plug) |
2876 | return NULL; | |
81ea1222 ML |
2877 | rq = rq_list_peek(&plug->cached_rq); |
2878 | if (!rq || rq->q != q) | |
2879 | return NULL; | |
71539717 | 2880 | |
0a5aa8d1 SK |
2881 | if (blk_mq_attempt_bio_merge(q, *bio, nsegs)) { |
2882 | *bio = NULL; | |
2883 | return NULL; | |
2884 | } | |
2885 | ||
77465647 PB |
2886 | type = blk_mq_get_hctx_type((*bio)->bi_opf); |
2887 | hctx_type = rq->mq_hctx->type; | |
2888 | if (type != hctx_type && | |
2889 | !(type == HCTX_TYPE_READ && hctx_type == HCTX_TYPE_DEFAULT)) | |
5b13bc8a | 2890 | return NULL; |
0a5aa8d1 | 2891 | if (op_is_flush(rq->cmd_flags) != op_is_flush((*bio)->bi_opf)) |
5b13bc8a CH |
2892 | return NULL; |
2893 | ||
2645672f JA |
2894 | /* |
2895 | * If any qos ->throttle() end up blocking, we will have flushed the | |
2896 | * plug and hence killed the cached_rq list as well. Pop this entry | |
2897 | * before we throttle. | |
2898 | */ | |
5b13bc8a | 2899 | plug->cached_rq = rq_list_next(rq); |
2645672f JA |
2900 | rq_qos_throttle(q, *bio); |
2901 | ||
2902 | rq->cmd_flags = (*bio)->bi_opf; | |
5b13bc8a | 2903 | INIT_LIST_HEAD(&rq->queuelist); |
5b13bc8a | 2904 | return rq; |
71539717 JA |
2905 | } |
2906 | ||
82b74cac JK |
2907 | static void bio_set_ioprio(struct bio *bio) |
2908 | { | |
a78418e6 JK |
2909 | /* Nobody set ioprio so far? Initialize it based on task's nice value */ |
2910 | if (IOPRIO_PRIO_CLASS(bio->bi_ioprio) == IOPRIO_CLASS_NONE) | |
2911 | bio->bi_ioprio = get_current_ioprio(); | |
82b74cac JK |
2912 | blkcg_set_ioprio(bio); |
2913 | } | |
2914 | ||
105663f7 | 2915 | /** |
c62b37d9 | 2916 | * blk_mq_submit_bio - Create and send a request to block device. |
105663f7 AA |
2917 | * @bio: Bio pointer. |
2918 | * | |
2919 | * Builds up a request structure from @q and @bio and send to the device. The | |
2920 | * request may not be queued directly to hardware if: | |
2921 | * * This request can be merged with another one | |
2922 | * * We want to place request at plug queue for possible future merging | |
2923 | * * There is an IO scheduler active at this queue | |
2924 | * | |
2925 | * It will not queue the request if there is an error with the bio, or at the | |
2926 | * request creation. | |
105663f7 | 2927 | */ |
3e08773c | 2928 | void blk_mq_submit_bio(struct bio *bio) |
07068d5b | 2929 | { |
ed6cddef | 2930 | struct request_queue *q = bdev_get_queue(bio->bi_bdev); |
6deacb3b | 2931 | struct blk_plug *plug = blk_mq_plug(bio); |
ef295ecf | 2932 | const int is_sync = op_is_sync(bio->bi_opf); |
f0dbe6e8 | 2933 | struct blk_mq_hw_ctx *hctx; |
07068d5b | 2934 | struct request *rq; |
abd45c15 | 2935 | unsigned int nr_segs = 1; |
a892c8d5 | 2936 | blk_status_t ret; |
07068d5b | 2937 | |
51d798cd | 2938 | bio = blk_queue_bounce(bio, q); |
613b1488 | 2939 | if (bio_may_exceed_limits(bio, &q->limits)) { |
c55ddd90 | 2940 | bio = __bio_split_to_limits(bio, &q->limits, &nr_segs); |
613b1488 JA |
2941 | if (!bio) |
2942 | return; | |
2943 | } | |
f36ea50c | 2944 | |
e23947bd | 2945 | if (!bio_integrity_prep(bio)) |
900e0807 | 2946 | return; |
87760e5e | 2947 | |
9c6227e0 JK |
2948 | bio_set_ioprio(bio); |
2949 | ||
0a5aa8d1 | 2950 | rq = blk_mq_get_cached_request(q, plug, &bio, nr_segs); |
5b13bc8a | 2951 | if (!rq) { |
0a5aa8d1 SK |
2952 | if (!bio) |
2953 | return; | |
2954 | rq = blk_mq_get_new_requests(q, plug, bio, nr_segs); | |
5b13bc8a CH |
2955 | if (unlikely(!rq)) |
2956 | return; | |
2957 | } | |
87760e5e | 2958 | |
e8a676d6 | 2959 | trace_block_getrq(bio); |
d6f1dda2 | 2960 | |
c1c80384 | 2961 | rq_qos_track(q, rq, bio); |
07068d5b | 2962 | |
970d168d BVA |
2963 | blk_mq_bio_to_request(rq, bio, nr_segs); |
2964 | ||
9cd1e566 | 2965 | ret = blk_crypto_rq_get_keyslot(rq); |
a892c8d5 ST |
2966 | if (ret != BLK_STS_OK) { |
2967 | bio->bi_status = ret; | |
2968 | bio_endio(bio); | |
2969 | blk_mq_free_request(rq); | |
3e08773c | 2970 | return; |
a892c8d5 ST |
2971 | } |
2972 | ||
2b504bd4 ML |
2973 | if (op_is_flush(bio->bi_opf)) { |
2974 | blk_insert_flush(rq); | |
d92ca9d8 | 2975 | return; |
2b504bd4 | 2976 | } |
d92ca9d8 | 2977 | |
f0dbe6e8 | 2978 | if (plug) { |
ce5b009c | 2979 | blk_add_rq_to_plug(plug, rq); |
f0dbe6e8 CH |
2980 | return; |
2981 | } | |
2982 | ||
2983 | hctx = rq->mq_hctx; | |
2984 | if ((rq->rq_flags & RQF_ELV) || | |
2985 | (hctx->dispatch_busy && (q->nr_hw_queues == 1 || !is_sync))) { | |
710fa378 | 2986 | blk_mq_insert_request(rq, 0); |
f0dbe6e8 CH |
2987 | blk_mq_run_hw_queue(hctx, true); |
2988 | } else { | |
2989 | blk_mq_run_dispatch_ops(q, blk_mq_try_issue_directly(hctx, rq)); | |
2990 | } | |
320ae51f JA |
2991 | } |
2992 | ||
248c7933 | 2993 | #ifdef CONFIG_BLK_MQ_STACKING |
06c8c691 | 2994 | /** |
a5efda3c | 2995 | * blk_insert_cloned_request - Helper for stacking drivers to submit a request |
a5efda3c | 2996 | * @rq: the request being queued |
06c8c691 | 2997 | */ |
28db4711 | 2998 | blk_status_t blk_insert_cloned_request(struct request *rq) |
06c8c691 | 2999 | { |
28db4711 | 3000 | struct request_queue *q = rq->q; |
06c8c691 | 3001 | unsigned int max_sectors = blk_queue_get_max_sectors(q, req_op(rq)); |
49d24398 | 3002 | unsigned int max_segments = blk_rq_get_max_segments(rq); |
a5efda3c | 3003 | blk_status_t ret; |
06c8c691 CH |
3004 | |
3005 | if (blk_rq_sectors(rq) > max_sectors) { | |
3006 | /* | |
3007 | * SCSI device does not have a good way to return if | |
3008 | * Write Same/Zero is actually supported. If a device rejects | |
3009 | * a non-read/write command (discard, write same,etc.) the | |
3010 | * low-level device driver will set the relevant queue limit to | |
3011 | * 0 to prevent blk-lib from issuing more of the offending | |
3012 | * operations. Commands queued prior to the queue limit being | |
3013 | * reset need to be completed with BLK_STS_NOTSUPP to avoid I/O | |
3014 | * errors being propagated to upper layers. | |
3015 | */ | |
3016 | if (max_sectors == 0) | |
3017 | return BLK_STS_NOTSUPP; | |
3018 | ||
3019 | printk(KERN_ERR "%s: over max size limit. (%u > %u)\n", | |
3020 | __func__, blk_rq_sectors(rq), max_sectors); | |
3021 | return BLK_STS_IOERR; | |
3022 | } | |
3023 | ||
3024 | /* | |
3025 | * The queue settings related to segment counting may differ from the | |
3026 | * original queue. | |
3027 | */ | |
3028 | rq->nr_phys_segments = blk_recalc_rq_segments(rq); | |
49d24398 US |
3029 | if (rq->nr_phys_segments > max_segments) { |
3030 | printk(KERN_ERR "%s: over max segments limit. (%u > %u)\n", | |
3031 | __func__, rq->nr_phys_segments, max_segments); | |
06c8c691 CH |
3032 | return BLK_STS_IOERR; |
3033 | } | |
3034 | ||
28db4711 | 3035 | if (q->disk && should_fail_request(q->disk->part0, blk_rq_bytes(rq))) |
06c8c691 CH |
3036 | return BLK_STS_IOERR; |
3037 | ||
5b8562f0 EB |
3038 | ret = blk_crypto_rq_get_keyslot(rq); |
3039 | if (ret != BLK_STS_OK) | |
3040 | return ret; | |
06c8c691 CH |
3041 | |
3042 | blk_account_io_start(rq); | |
3043 | ||
3044 | /* | |
3045 | * Since we have a scheduler attached on the top device, | |
3046 | * bypass a potential scheduler on the bottom device for | |
3047 | * insert. | |
3048 | */ | |
28db4711 | 3049 | blk_mq_run_dispatch_ops(q, |
4cafe86c | 3050 | ret = blk_mq_request_issue_directly(rq, true)); |
592ee119 YK |
3051 | if (ret) |
3052 | blk_account_io_done(rq, ktime_get_ns()); | |
4cafe86c | 3053 | return ret; |
06c8c691 CH |
3054 | } |
3055 | EXPORT_SYMBOL_GPL(blk_insert_cloned_request); | |
3056 | ||
3057 | /** | |
3058 | * blk_rq_unprep_clone - Helper function to free all bios in a cloned request | |
3059 | * @rq: the clone request to be cleaned up | |
3060 | * | |
3061 | * Description: | |
3062 | * Free all bios in @rq for a cloned request. | |
3063 | */ | |
3064 | void blk_rq_unprep_clone(struct request *rq) | |
3065 | { | |
3066 | struct bio *bio; | |
3067 | ||
3068 | while ((bio = rq->bio) != NULL) { | |
3069 | rq->bio = bio->bi_next; | |
3070 | ||
3071 | bio_put(bio); | |
3072 | } | |
3073 | } | |
3074 | EXPORT_SYMBOL_GPL(blk_rq_unprep_clone); | |
3075 | ||
3076 | /** | |
3077 | * blk_rq_prep_clone - Helper function to setup clone request | |
3078 | * @rq: the request to be setup | |
3079 | * @rq_src: original request to be cloned | |
3080 | * @bs: bio_set that bios for clone are allocated from | |
3081 | * @gfp_mask: memory allocation mask for bio | |
3082 | * @bio_ctr: setup function to be called for each clone bio. | |
3083 | * Returns %0 for success, non %0 for failure. | |
3084 | * @data: private data to be passed to @bio_ctr | |
3085 | * | |
3086 | * Description: | |
3087 | * Clones bios in @rq_src to @rq, and copies attributes of @rq_src to @rq. | |
3088 | * Also, pages which the original bios are pointing to are not copied | |
3089 | * and the cloned bios just point same pages. | |
3090 | * So cloned bios must be completed before original bios, which means | |
3091 | * the caller must complete @rq before @rq_src. | |
3092 | */ | |
3093 | int blk_rq_prep_clone(struct request *rq, struct request *rq_src, | |
3094 | struct bio_set *bs, gfp_t gfp_mask, | |
3095 | int (*bio_ctr)(struct bio *, struct bio *, void *), | |
3096 | void *data) | |
3097 | { | |
3098 | struct bio *bio, *bio_src; | |
3099 | ||
3100 | if (!bs) | |
3101 | bs = &fs_bio_set; | |
3102 | ||
3103 | __rq_for_each_bio(bio_src, rq_src) { | |
abfc426d CH |
3104 | bio = bio_alloc_clone(rq->q->disk->part0, bio_src, gfp_mask, |
3105 | bs); | |
06c8c691 CH |
3106 | if (!bio) |
3107 | goto free_and_out; | |
3108 | ||
3109 | if (bio_ctr && bio_ctr(bio, bio_src, data)) | |
3110 | goto free_and_out; | |
3111 | ||
3112 | if (rq->bio) { | |
3113 | rq->biotail->bi_next = bio; | |
3114 | rq->biotail = bio; | |
3115 | } else { | |
3116 | rq->bio = rq->biotail = bio; | |
3117 | } | |
3118 | bio = NULL; | |
3119 | } | |
3120 | ||
3121 | /* Copy attributes of the original request to the clone request. */ | |
3122 | rq->__sector = blk_rq_pos(rq_src); | |
3123 | rq->__data_len = blk_rq_bytes(rq_src); | |
3124 | if (rq_src->rq_flags & RQF_SPECIAL_PAYLOAD) { | |
3125 | rq->rq_flags |= RQF_SPECIAL_PAYLOAD; | |
3126 | rq->special_vec = rq_src->special_vec; | |
3127 | } | |
3128 | rq->nr_phys_segments = rq_src->nr_phys_segments; | |
3129 | rq->ioprio = rq_src->ioprio; | |
3130 | ||
3131 | if (rq->bio && blk_crypto_rq_bio_prep(rq, rq->bio, gfp_mask) < 0) | |
3132 | goto free_and_out; | |
3133 | ||
3134 | return 0; | |
3135 | ||
3136 | free_and_out: | |
3137 | if (bio) | |
3138 | bio_put(bio); | |
3139 | blk_rq_unprep_clone(rq); | |
3140 | ||
3141 | return -ENOMEM; | |
3142 | } | |
3143 | EXPORT_SYMBOL_GPL(blk_rq_prep_clone); | |
248c7933 | 3144 | #endif /* CONFIG_BLK_MQ_STACKING */ |
06c8c691 | 3145 | |
f2b8f3ce CH |
3146 | /* |
3147 | * Steal bios from a request and add them to a bio list. | |
3148 | * The request must not have been partially completed before. | |
3149 | */ | |
3150 | void blk_steal_bios(struct bio_list *list, struct request *rq) | |
3151 | { | |
3152 | if (rq->bio) { | |
3153 | if (list->tail) | |
3154 | list->tail->bi_next = rq->bio; | |
3155 | else | |
3156 | list->head = rq->bio; | |
3157 | list->tail = rq->biotail; | |
3158 | ||
3159 | rq->bio = NULL; | |
3160 | rq->biotail = NULL; | |
3161 | } | |
3162 | ||
3163 | rq->__data_len = 0; | |
3164 | } | |
3165 | EXPORT_SYMBOL_GPL(blk_steal_bios); | |
3166 | ||
bd63141d ML |
3167 | static size_t order_to_size(unsigned int order) |
3168 | { | |
3169 | return (size_t)PAGE_SIZE << order; | |
3170 | } | |
3171 | ||
3172 | /* called before freeing request pool in @tags */ | |
f32e4eaf JG |
3173 | static void blk_mq_clear_rq_mapping(struct blk_mq_tags *drv_tags, |
3174 | struct blk_mq_tags *tags) | |
bd63141d | 3175 | { |
bd63141d ML |
3176 | struct page *page; |
3177 | unsigned long flags; | |
3178 | ||
76dd2980 YK |
3179 | /* |
3180 | * There is no need to clear mapping if driver tags is not initialized | |
3181 | * or the mapping belongs to the driver tags. | |
3182 | */ | |
3183 | if (!drv_tags || drv_tags == tags) | |
4f245d5b JG |
3184 | return; |
3185 | ||
bd63141d ML |
3186 | list_for_each_entry(page, &tags->page_list, lru) { |
3187 | unsigned long start = (unsigned long)page_address(page); | |
3188 | unsigned long end = start + order_to_size(page->private); | |
3189 | int i; | |
3190 | ||
f32e4eaf | 3191 | for (i = 0; i < drv_tags->nr_tags; i++) { |
bd63141d ML |
3192 | struct request *rq = drv_tags->rqs[i]; |
3193 | unsigned long rq_addr = (unsigned long)rq; | |
3194 | ||
3195 | if (rq_addr >= start && rq_addr < end) { | |
0a467d0f | 3196 | WARN_ON_ONCE(req_ref_read(rq) != 0); |
bd63141d ML |
3197 | cmpxchg(&drv_tags->rqs[i], rq, NULL); |
3198 | } | |
3199 | } | |
3200 | } | |
3201 | ||
3202 | /* | |
3203 | * Wait until all pending iteration is done. | |
3204 | * | |
3205 | * Request reference is cleared and it is guaranteed to be observed | |
3206 | * after the ->lock is released. | |
3207 | */ | |
3208 | spin_lock_irqsave(&drv_tags->lock, flags); | |
3209 | spin_unlock_irqrestore(&drv_tags->lock, flags); | |
3210 | } | |
3211 | ||
cc71a6f4 JA |
3212 | void blk_mq_free_rqs(struct blk_mq_tag_set *set, struct blk_mq_tags *tags, |
3213 | unsigned int hctx_idx) | |
95363efd | 3214 | { |
f32e4eaf | 3215 | struct blk_mq_tags *drv_tags; |
e9b267d9 | 3216 | struct page *page; |
320ae51f | 3217 | |
e02657ea ML |
3218 | if (list_empty(&tags->page_list)) |
3219 | return; | |
3220 | ||
079a2e3e JG |
3221 | if (blk_mq_is_shared_tags(set->flags)) |
3222 | drv_tags = set->shared_tags; | |
e155b0c2 JG |
3223 | else |
3224 | drv_tags = set->tags[hctx_idx]; | |
f32e4eaf | 3225 | |
65de57bb | 3226 | if (tags->static_rqs && set->ops->exit_request) { |
e9b267d9 | 3227 | int i; |
320ae51f | 3228 | |
24d2f903 | 3229 | for (i = 0; i < tags->nr_tags; i++) { |
2af8cbe3 JA |
3230 | struct request *rq = tags->static_rqs[i]; |
3231 | ||
3232 | if (!rq) | |
e9b267d9 | 3233 | continue; |
d6296d39 | 3234 | set->ops->exit_request(set, rq, hctx_idx); |
2af8cbe3 | 3235 | tags->static_rqs[i] = NULL; |
e9b267d9 | 3236 | } |
320ae51f | 3237 | } |
320ae51f | 3238 | |
f32e4eaf | 3239 | blk_mq_clear_rq_mapping(drv_tags, tags); |
bd63141d | 3240 | |
24d2f903 CH |
3241 | while (!list_empty(&tags->page_list)) { |
3242 | page = list_first_entry(&tags->page_list, struct page, lru); | |
6753471c | 3243 | list_del_init(&page->lru); |
f75782e4 CM |
3244 | /* |
3245 | * Remove kmemleak object previously allocated in | |
273938bf | 3246 | * blk_mq_alloc_rqs(). |
f75782e4 CM |
3247 | */ |
3248 | kmemleak_free(page_address(page)); | |
320ae51f JA |
3249 | __free_pages(page, page->private); |
3250 | } | |
cc71a6f4 | 3251 | } |
320ae51f | 3252 | |
e155b0c2 | 3253 | void blk_mq_free_rq_map(struct blk_mq_tags *tags) |
cc71a6f4 | 3254 | { |
24d2f903 | 3255 | kfree(tags->rqs); |
cc71a6f4 | 3256 | tags->rqs = NULL; |
2af8cbe3 JA |
3257 | kfree(tags->static_rqs); |
3258 | tags->static_rqs = NULL; | |
320ae51f | 3259 | |
e155b0c2 | 3260 | blk_mq_free_tags(tags); |
320ae51f JA |
3261 | } |
3262 | ||
4d805131 ML |
3263 | static enum hctx_type hctx_idx_to_type(struct blk_mq_tag_set *set, |
3264 | unsigned int hctx_idx) | |
3265 | { | |
3266 | int i; | |
3267 | ||
3268 | for (i = 0; i < set->nr_maps; i++) { | |
3269 | unsigned int start = set->map[i].queue_offset; | |
3270 | unsigned int end = start + set->map[i].nr_queues; | |
3271 | ||
3272 | if (hctx_idx >= start && hctx_idx < end) | |
3273 | break; | |
3274 | } | |
3275 | ||
3276 | if (i >= set->nr_maps) | |
3277 | i = HCTX_TYPE_DEFAULT; | |
3278 | ||
3279 | return i; | |
3280 | } | |
3281 | ||
3282 | static int blk_mq_get_hctx_node(struct blk_mq_tag_set *set, | |
3283 | unsigned int hctx_idx) | |
3284 | { | |
3285 | enum hctx_type type = hctx_idx_to_type(set, hctx_idx); | |
3286 | ||
3287 | return blk_mq_hw_queue_to_node(&set->map[type], hctx_idx); | |
3288 | } | |
3289 | ||
63064be1 JG |
3290 | static struct blk_mq_tags *blk_mq_alloc_rq_map(struct blk_mq_tag_set *set, |
3291 | unsigned int hctx_idx, | |
3292 | unsigned int nr_tags, | |
e155b0c2 | 3293 | unsigned int reserved_tags) |
320ae51f | 3294 | { |
4d805131 | 3295 | int node = blk_mq_get_hctx_node(set, hctx_idx); |
24d2f903 | 3296 | struct blk_mq_tags *tags; |
320ae51f | 3297 | |
59f082e4 SL |
3298 | if (node == NUMA_NO_NODE) |
3299 | node = set->numa_node; | |
3300 | ||
e155b0c2 JG |
3301 | tags = blk_mq_init_tags(nr_tags, reserved_tags, node, |
3302 | BLK_MQ_FLAG_TO_ALLOC_POLICY(set->flags)); | |
24d2f903 CH |
3303 | if (!tags) |
3304 | return NULL; | |
320ae51f | 3305 | |
590b5b7d | 3306 | tags->rqs = kcalloc_node(nr_tags, sizeof(struct request *), |
36e1f3d1 | 3307 | GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY, |
59f082e4 | 3308 | node); |
7edfd681 JC |
3309 | if (!tags->rqs) |
3310 | goto err_free_tags; | |
320ae51f | 3311 | |
590b5b7d KC |
3312 | tags->static_rqs = kcalloc_node(nr_tags, sizeof(struct request *), |
3313 | GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY, | |
3314 | node); | |
7edfd681 JC |
3315 | if (!tags->static_rqs) |
3316 | goto err_free_rqs; | |
2af8cbe3 | 3317 | |
cc71a6f4 | 3318 | return tags; |
7edfd681 JC |
3319 | |
3320 | err_free_rqs: | |
3321 | kfree(tags->rqs); | |
3322 | err_free_tags: | |
3323 | blk_mq_free_tags(tags); | |
3324 | return NULL; | |
cc71a6f4 JA |
3325 | } |
3326 | ||
1d9bd516 TH |
3327 | static int blk_mq_init_request(struct blk_mq_tag_set *set, struct request *rq, |
3328 | unsigned int hctx_idx, int node) | |
3329 | { | |
3330 | int ret; | |
3331 | ||
3332 | if (set->ops->init_request) { | |
3333 | ret = set->ops->init_request(set, rq, hctx_idx, node); | |
3334 | if (ret) | |
3335 | return ret; | |
3336 | } | |
3337 | ||
12f5b931 | 3338 | WRITE_ONCE(rq->state, MQ_RQ_IDLE); |
1d9bd516 TH |
3339 | return 0; |
3340 | } | |
3341 | ||
63064be1 JG |
3342 | static int blk_mq_alloc_rqs(struct blk_mq_tag_set *set, |
3343 | struct blk_mq_tags *tags, | |
3344 | unsigned int hctx_idx, unsigned int depth) | |
cc71a6f4 JA |
3345 | { |
3346 | unsigned int i, j, entries_per_page, max_order = 4; | |
4d805131 | 3347 | int node = blk_mq_get_hctx_node(set, hctx_idx); |
cc71a6f4 | 3348 | size_t rq_size, left; |
59f082e4 | 3349 | |
59f082e4 SL |
3350 | if (node == NUMA_NO_NODE) |
3351 | node = set->numa_node; | |
cc71a6f4 JA |
3352 | |
3353 | INIT_LIST_HEAD(&tags->page_list); | |
3354 | ||
320ae51f JA |
3355 | /* |
3356 | * rq_size is the size of the request plus driver payload, rounded | |
3357 | * to the cacheline size | |
3358 | */ | |
24d2f903 | 3359 | rq_size = round_up(sizeof(struct request) + set->cmd_size, |
320ae51f | 3360 | cache_line_size()); |
cc71a6f4 | 3361 | left = rq_size * depth; |
320ae51f | 3362 | |
cc71a6f4 | 3363 | for (i = 0; i < depth; ) { |
320ae51f JA |
3364 | int this_order = max_order; |
3365 | struct page *page; | |
3366 | int to_do; | |
3367 | void *p; | |
3368 | ||
b3a834b1 | 3369 | while (this_order && left < order_to_size(this_order - 1)) |
320ae51f JA |
3370 | this_order--; |
3371 | ||
3372 | do { | |
59f082e4 | 3373 | page = alloc_pages_node(node, |
36e1f3d1 | 3374 | GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY | __GFP_ZERO, |
a5164405 | 3375 | this_order); |
320ae51f JA |
3376 | if (page) |
3377 | break; | |
3378 | if (!this_order--) | |
3379 | break; | |
3380 | if (order_to_size(this_order) < rq_size) | |
3381 | break; | |
3382 | } while (1); | |
3383 | ||
3384 | if (!page) | |
24d2f903 | 3385 | goto fail; |
320ae51f JA |
3386 | |
3387 | page->private = this_order; | |
24d2f903 | 3388 | list_add_tail(&page->lru, &tags->page_list); |
320ae51f JA |
3389 | |
3390 | p = page_address(page); | |
f75782e4 CM |
3391 | /* |
3392 | * Allow kmemleak to scan these pages as they contain pointers | |
3393 | * to additional allocations like via ops->init_request(). | |
3394 | */ | |
36e1f3d1 | 3395 | kmemleak_alloc(p, order_to_size(this_order), 1, GFP_NOIO); |
320ae51f | 3396 | entries_per_page = order_to_size(this_order) / rq_size; |
cc71a6f4 | 3397 | to_do = min(entries_per_page, depth - i); |
320ae51f JA |
3398 | left -= to_do * rq_size; |
3399 | for (j = 0; j < to_do; j++) { | |
2af8cbe3 JA |
3400 | struct request *rq = p; |
3401 | ||
3402 | tags->static_rqs[i] = rq; | |
1d9bd516 TH |
3403 | if (blk_mq_init_request(set, rq, hctx_idx, node)) { |
3404 | tags->static_rqs[i] = NULL; | |
3405 | goto fail; | |
e9b267d9 CH |
3406 | } |
3407 | ||
320ae51f JA |
3408 | p += rq_size; |
3409 | i++; | |
3410 | } | |
3411 | } | |
cc71a6f4 | 3412 | return 0; |
320ae51f | 3413 | |
24d2f903 | 3414 | fail: |
cc71a6f4 JA |
3415 | blk_mq_free_rqs(set, tags, hctx_idx); |
3416 | return -ENOMEM; | |
320ae51f JA |
3417 | } |
3418 | ||
bf0beec0 ML |
3419 | struct rq_iter_data { |
3420 | struct blk_mq_hw_ctx *hctx; | |
3421 | bool has_rq; | |
3422 | }; | |
3423 | ||
2dd6532e | 3424 | static bool blk_mq_has_request(struct request *rq, void *data) |
bf0beec0 ML |
3425 | { |
3426 | struct rq_iter_data *iter_data = data; | |
3427 | ||
3428 | if (rq->mq_hctx != iter_data->hctx) | |
3429 | return true; | |
3430 | iter_data->has_rq = true; | |
3431 | return false; | |
3432 | } | |
3433 | ||
3434 | static bool blk_mq_hctx_has_requests(struct blk_mq_hw_ctx *hctx) | |
3435 | { | |
3436 | struct blk_mq_tags *tags = hctx->sched_tags ? | |
3437 | hctx->sched_tags : hctx->tags; | |
3438 | struct rq_iter_data data = { | |
3439 | .hctx = hctx, | |
3440 | }; | |
3441 | ||
3442 | blk_mq_all_tag_iter(tags, blk_mq_has_request, &data); | |
3443 | return data.has_rq; | |
3444 | } | |
3445 | ||
3446 | static inline bool blk_mq_last_cpu_in_hctx(unsigned int cpu, | |
3447 | struct blk_mq_hw_ctx *hctx) | |
3448 | { | |
9b51d9d8 | 3449 | if (cpumask_first_and(hctx->cpumask, cpu_online_mask) != cpu) |
bf0beec0 ML |
3450 | return false; |
3451 | if (cpumask_next_and(cpu, hctx->cpumask, cpu_online_mask) < nr_cpu_ids) | |
3452 | return false; | |
3453 | return true; | |
3454 | } | |
3455 | ||
3456 | static int blk_mq_hctx_notify_offline(unsigned int cpu, struct hlist_node *node) | |
3457 | { | |
3458 | struct blk_mq_hw_ctx *hctx = hlist_entry_safe(node, | |
3459 | struct blk_mq_hw_ctx, cpuhp_online); | |
3460 | ||
3461 | if (!cpumask_test_cpu(cpu, hctx->cpumask) || | |
3462 | !blk_mq_last_cpu_in_hctx(cpu, hctx)) | |
3463 | return 0; | |
3464 | ||
3465 | /* | |
3466 | * Prevent new request from being allocated on the current hctx. | |
3467 | * | |
3468 | * The smp_mb__after_atomic() Pairs with the implied barrier in | |
3469 | * test_and_set_bit_lock in sbitmap_get(). Ensures the inactive flag is | |
3470 | * seen once we return from the tag allocator. | |
3471 | */ | |
3472 | set_bit(BLK_MQ_S_INACTIVE, &hctx->state); | |
3473 | smp_mb__after_atomic(); | |
3474 | ||
3475 | /* | |
3476 | * Try to grab a reference to the queue and wait for any outstanding | |
3477 | * requests. If we could not grab a reference the queue has been | |
3478 | * frozen and there are no requests. | |
3479 | */ | |
3480 | if (percpu_ref_tryget(&hctx->queue->q_usage_counter)) { | |
3481 | while (blk_mq_hctx_has_requests(hctx)) | |
3482 | msleep(5); | |
3483 | percpu_ref_put(&hctx->queue->q_usage_counter); | |
3484 | } | |
3485 | ||
3486 | return 0; | |
3487 | } | |
3488 | ||
3489 | static int blk_mq_hctx_notify_online(unsigned int cpu, struct hlist_node *node) | |
3490 | { | |
3491 | struct blk_mq_hw_ctx *hctx = hlist_entry_safe(node, | |
3492 | struct blk_mq_hw_ctx, cpuhp_online); | |
3493 | ||
3494 | if (cpumask_test_cpu(cpu, hctx->cpumask)) | |
3495 | clear_bit(BLK_MQ_S_INACTIVE, &hctx->state); | |
3496 | return 0; | |
3497 | } | |
3498 | ||
e57690fe JA |
3499 | /* |
3500 | * 'cpu' is going away. splice any existing rq_list entries from this | |
3501 | * software queue to the hw queue dispatch list, and ensure that it | |
3502 | * gets run. | |
3503 | */ | |
9467f859 | 3504 | static int blk_mq_hctx_notify_dead(unsigned int cpu, struct hlist_node *node) |
484b4061 | 3505 | { |
9467f859 | 3506 | struct blk_mq_hw_ctx *hctx; |
484b4061 JA |
3507 | struct blk_mq_ctx *ctx; |
3508 | LIST_HEAD(tmp); | |
c16d6b5a | 3509 | enum hctx_type type; |
484b4061 | 3510 | |
9467f859 | 3511 | hctx = hlist_entry_safe(node, struct blk_mq_hw_ctx, cpuhp_dead); |
bf0beec0 ML |
3512 | if (!cpumask_test_cpu(cpu, hctx->cpumask)) |
3513 | return 0; | |
3514 | ||
e57690fe | 3515 | ctx = __blk_mq_get_ctx(hctx->queue, cpu); |
c16d6b5a | 3516 | type = hctx->type; |
484b4061 JA |
3517 | |
3518 | spin_lock(&ctx->lock); | |
c16d6b5a ML |
3519 | if (!list_empty(&ctx->rq_lists[type])) { |
3520 | list_splice_init(&ctx->rq_lists[type], &tmp); | |
484b4061 JA |
3521 | blk_mq_hctx_clear_pending(hctx, ctx); |
3522 | } | |
3523 | spin_unlock(&ctx->lock); | |
3524 | ||
3525 | if (list_empty(&tmp)) | |
9467f859 | 3526 | return 0; |
484b4061 | 3527 | |
e57690fe JA |
3528 | spin_lock(&hctx->lock); |
3529 | list_splice_tail_init(&tmp, &hctx->dispatch); | |
3530 | spin_unlock(&hctx->lock); | |
484b4061 JA |
3531 | |
3532 | blk_mq_run_hw_queue(hctx, true); | |
9467f859 | 3533 | return 0; |
484b4061 JA |
3534 | } |
3535 | ||
9467f859 | 3536 | static void blk_mq_remove_cpuhp(struct blk_mq_hw_ctx *hctx) |
484b4061 | 3537 | { |
bf0beec0 ML |
3538 | if (!(hctx->flags & BLK_MQ_F_STACKING)) |
3539 | cpuhp_state_remove_instance_nocalls(CPUHP_AP_BLK_MQ_ONLINE, | |
3540 | &hctx->cpuhp_online); | |
9467f859 TG |
3541 | cpuhp_state_remove_instance_nocalls(CPUHP_BLK_MQ_DEAD, |
3542 | &hctx->cpuhp_dead); | |
484b4061 JA |
3543 | } |
3544 | ||
364b6181 ML |
3545 | /* |
3546 | * Before freeing hw queue, clearing the flush request reference in | |
3547 | * tags->rqs[] for avoiding potential UAF. | |
3548 | */ | |
3549 | static void blk_mq_clear_flush_rq_mapping(struct blk_mq_tags *tags, | |
3550 | unsigned int queue_depth, struct request *flush_rq) | |
3551 | { | |
3552 | int i; | |
3553 | unsigned long flags; | |
3554 | ||
3555 | /* The hw queue may not be mapped yet */ | |
3556 | if (!tags) | |
3557 | return; | |
3558 | ||
0a467d0f | 3559 | WARN_ON_ONCE(req_ref_read(flush_rq) != 0); |
364b6181 ML |
3560 | |
3561 | for (i = 0; i < queue_depth; i++) | |
3562 | cmpxchg(&tags->rqs[i], flush_rq, NULL); | |
3563 | ||
3564 | /* | |
3565 | * Wait until all pending iteration is done. | |
3566 | * | |
3567 | * Request reference is cleared and it is guaranteed to be observed | |
3568 | * after the ->lock is released. | |
3569 | */ | |
3570 | spin_lock_irqsave(&tags->lock, flags); | |
3571 | spin_unlock_irqrestore(&tags->lock, flags); | |
3572 | } | |
3573 | ||
c3b4afca | 3574 | /* hctx->ctxs will be freed in queue's release handler */ |
08e98fc6 ML |
3575 | static void blk_mq_exit_hctx(struct request_queue *q, |
3576 | struct blk_mq_tag_set *set, | |
3577 | struct blk_mq_hw_ctx *hctx, unsigned int hctx_idx) | |
3578 | { | |
364b6181 ML |
3579 | struct request *flush_rq = hctx->fq->flush_rq; |
3580 | ||
8ab0b7dc ML |
3581 | if (blk_mq_hw_queue_mapped(hctx)) |
3582 | blk_mq_tag_idle(hctx); | |
08e98fc6 | 3583 | |
6cfeadbf ML |
3584 | if (blk_queue_init_done(q)) |
3585 | blk_mq_clear_flush_rq_mapping(set->tags[hctx_idx], | |
3586 | set->queue_depth, flush_rq); | |
f70ced09 | 3587 | if (set->ops->exit_request) |
364b6181 | 3588 | set->ops->exit_request(set, flush_rq, hctx_idx); |
f70ced09 | 3589 | |
08e98fc6 ML |
3590 | if (set->ops->exit_hctx) |
3591 | set->ops->exit_hctx(hctx, hctx_idx); | |
3592 | ||
9467f859 | 3593 | blk_mq_remove_cpuhp(hctx); |
2f8f1336 | 3594 | |
4e5cc99e ML |
3595 | xa_erase(&q->hctx_table, hctx_idx); |
3596 | ||
2f8f1336 ML |
3597 | spin_lock(&q->unused_hctx_lock); |
3598 | list_add(&hctx->hctx_list, &q->unused_hctx_list); | |
3599 | spin_unlock(&q->unused_hctx_lock); | |
08e98fc6 ML |
3600 | } |
3601 | ||
624dbe47 ML |
3602 | static void blk_mq_exit_hw_queues(struct request_queue *q, |
3603 | struct blk_mq_tag_set *set, int nr_queue) | |
3604 | { | |
3605 | struct blk_mq_hw_ctx *hctx; | |
4f481208 | 3606 | unsigned long i; |
624dbe47 ML |
3607 | |
3608 | queue_for_each_hw_ctx(q, hctx, i) { | |
3609 | if (i == nr_queue) | |
3610 | break; | |
08e98fc6 | 3611 | blk_mq_exit_hctx(q, set, hctx, i); |
624dbe47 | 3612 | } |
624dbe47 ML |
3613 | } |
3614 | ||
08e98fc6 ML |
3615 | static int blk_mq_init_hctx(struct request_queue *q, |
3616 | struct blk_mq_tag_set *set, | |
3617 | struct blk_mq_hw_ctx *hctx, unsigned hctx_idx) | |
320ae51f | 3618 | { |
7c6c5b7c ML |
3619 | hctx->queue_num = hctx_idx; |
3620 | ||
bf0beec0 ML |
3621 | if (!(hctx->flags & BLK_MQ_F_STACKING)) |
3622 | cpuhp_state_add_instance_nocalls(CPUHP_AP_BLK_MQ_ONLINE, | |
3623 | &hctx->cpuhp_online); | |
7c6c5b7c ML |
3624 | cpuhp_state_add_instance_nocalls(CPUHP_BLK_MQ_DEAD, &hctx->cpuhp_dead); |
3625 | ||
3626 | hctx->tags = set->tags[hctx_idx]; | |
3627 | ||
3628 | if (set->ops->init_hctx && | |
3629 | set->ops->init_hctx(hctx, set->driver_data, hctx_idx)) | |
3630 | goto unregister_cpu_notifier; | |
08e98fc6 | 3631 | |
7c6c5b7c ML |
3632 | if (blk_mq_init_request(set, hctx->fq->flush_rq, hctx_idx, |
3633 | hctx->numa_node)) | |
3634 | goto exit_hctx; | |
4e5cc99e ML |
3635 | |
3636 | if (xa_insert(&q->hctx_table, hctx_idx, hctx, GFP_KERNEL)) | |
3637 | goto exit_flush_rq; | |
3638 | ||
7c6c5b7c ML |
3639 | return 0; |
3640 | ||
4e5cc99e ML |
3641 | exit_flush_rq: |
3642 | if (set->ops->exit_request) | |
3643 | set->ops->exit_request(set, hctx->fq->flush_rq, hctx_idx); | |
7c6c5b7c ML |
3644 | exit_hctx: |
3645 | if (set->ops->exit_hctx) | |
3646 | set->ops->exit_hctx(hctx, hctx_idx); | |
3647 | unregister_cpu_notifier: | |
3648 | blk_mq_remove_cpuhp(hctx); | |
3649 | return -1; | |
3650 | } | |
3651 | ||
3652 | static struct blk_mq_hw_ctx * | |
3653 | blk_mq_alloc_hctx(struct request_queue *q, struct blk_mq_tag_set *set, | |
3654 | int node) | |
3655 | { | |
3656 | struct blk_mq_hw_ctx *hctx; | |
3657 | gfp_t gfp = GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY; | |
3658 | ||
704b914f | 3659 | hctx = kzalloc_node(sizeof(struct blk_mq_hw_ctx), gfp, node); |
7c6c5b7c ML |
3660 | if (!hctx) |
3661 | goto fail_alloc_hctx; | |
3662 | ||
3663 | if (!zalloc_cpumask_var_node(&hctx->cpumask, gfp, node)) | |
3664 | goto free_hctx; | |
3665 | ||
3666 | atomic_set(&hctx->nr_active, 0); | |
08e98fc6 | 3667 | if (node == NUMA_NO_NODE) |
7c6c5b7c ML |
3668 | node = set->numa_node; |
3669 | hctx->numa_node = node; | |
08e98fc6 | 3670 | |
9f993737 | 3671 | INIT_DELAYED_WORK(&hctx->run_work, blk_mq_run_work_fn); |
08e98fc6 ML |
3672 | spin_lock_init(&hctx->lock); |
3673 | INIT_LIST_HEAD(&hctx->dispatch); | |
3674 | hctx->queue = q; | |
51db1c37 | 3675 | hctx->flags = set->flags & ~BLK_MQ_F_TAG_QUEUE_SHARED; |
08e98fc6 | 3676 | |
2f8f1336 ML |
3677 | INIT_LIST_HEAD(&hctx->hctx_list); |
3678 | ||
320ae51f | 3679 | /* |
08e98fc6 ML |
3680 | * Allocate space for all possible cpus to avoid allocation at |
3681 | * runtime | |
320ae51f | 3682 | */ |
d904bfa7 | 3683 | hctx->ctxs = kmalloc_array_node(nr_cpu_ids, sizeof(void *), |
7c6c5b7c | 3684 | gfp, node); |
08e98fc6 | 3685 | if (!hctx->ctxs) |
7c6c5b7c | 3686 | goto free_cpumask; |
320ae51f | 3687 | |
5b202853 | 3688 | if (sbitmap_init_node(&hctx->ctx_map, nr_cpu_ids, ilog2(8), |
c548e62b | 3689 | gfp, node, false, false)) |
08e98fc6 | 3690 | goto free_ctxs; |
08e98fc6 | 3691 | hctx->nr_ctx = 0; |
320ae51f | 3692 | |
5815839b | 3693 | spin_lock_init(&hctx->dispatch_wait_lock); |
eb619fdb JA |
3694 | init_waitqueue_func_entry(&hctx->dispatch_wait, blk_mq_dispatch_wake); |
3695 | INIT_LIST_HEAD(&hctx->dispatch_wait.entry); | |
3696 | ||
754a1572 | 3697 | hctx->fq = blk_alloc_flush_queue(hctx->numa_node, set->cmd_size, gfp); |
f70ced09 | 3698 | if (!hctx->fq) |
7c6c5b7c | 3699 | goto free_bitmap; |
320ae51f | 3700 | |
7c6c5b7c | 3701 | blk_mq_hctx_kobj_init(hctx); |
6a83e74d | 3702 | |
7c6c5b7c | 3703 | return hctx; |
320ae51f | 3704 | |
08e98fc6 | 3705 | free_bitmap: |
88459642 | 3706 | sbitmap_free(&hctx->ctx_map); |
08e98fc6 ML |
3707 | free_ctxs: |
3708 | kfree(hctx->ctxs); | |
7c6c5b7c ML |
3709 | free_cpumask: |
3710 | free_cpumask_var(hctx->cpumask); | |
3711 | free_hctx: | |
3712 | kfree(hctx); | |
3713 | fail_alloc_hctx: | |
3714 | return NULL; | |
08e98fc6 | 3715 | } |
320ae51f | 3716 | |
320ae51f JA |
3717 | static void blk_mq_init_cpu_queues(struct request_queue *q, |
3718 | unsigned int nr_hw_queues) | |
3719 | { | |
b3c661b1 JA |
3720 | struct blk_mq_tag_set *set = q->tag_set; |
3721 | unsigned int i, j; | |
320ae51f JA |
3722 | |
3723 | for_each_possible_cpu(i) { | |
3724 | struct blk_mq_ctx *__ctx = per_cpu_ptr(q->queue_ctx, i); | |
3725 | struct blk_mq_hw_ctx *hctx; | |
c16d6b5a | 3726 | int k; |
320ae51f | 3727 | |
320ae51f JA |
3728 | __ctx->cpu = i; |
3729 | spin_lock_init(&__ctx->lock); | |
c16d6b5a ML |
3730 | for (k = HCTX_TYPE_DEFAULT; k < HCTX_MAX_TYPES; k++) |
3731 | INIT_LIST_HEAD(&__ctx->rq_lists[k]); | |
3732 | ||
320ae51f JA |
3733 | __ctx->queue = q; |
3734 | ||
320ae51f JA |
3735 | /* |
3736 | * Set local node, IFF we have more than one hw queue. If | |
3737 | * not, we remain on the home node of the device | |
3738 | */ | |
b3c661b1 JA |
3739 | for (j = 0; j < set->nr_maps; j++) { |
3740 | hctx = blk_mq_map_queue_type(q, j, i); | |
3741 | if (nr_hw_queues > 1 && hctx->numa_node == NUMA_NO_NODE) | |
576e85c5 | 3742 | hctx->numa_node = cpu_to_node(i); |
b3c661b1 | 3743 | } |
320ae51f JA |
3744 | } |
3745 | } | |
3746 | ||
63064be1 JG |
3747 | struct blk_mq_tags *blk_mq_alloc_map_and_rqs(struct blk_mq_tag_set *set, |
3748 | unsigned int hctx_idx, | |
3749 | unsigned int depth) | |
cc71a6f4 | 3750 | { |
63064be1 JG |
3751 | struct blk_mq_tags *tags; |
3752 | int ret; | |
cc71a6f4 | 3753 | |
e155b0c2 | 3754 | tags = blk_mq_alloc_rq_map(set, hctx_idx, depth, set->reserved_tags); |
63064be1 JG |
3755 | if (!tags) |
3756 | return NULL; | |
cc71a6f4 | 3757 | |
63064be1 JG |
3758 | ret = blk_mq_alloc_rqs(set, tags, hctx_idx, depth); |
3759 | if (ret) { | |
e155b0c2 | 3760 | blk_mq_free_rq_map(tags); |
63064be1 JG |
3761 | return NULL; |
3762 | } | |
cc71a6f4 | 3763 | |
63064be1 | 3764 | return tags; |
cc71a6f4 JA |
3765 | } |
3766 | ||
63064be1 JG |
3767 | static bool __blk_mq_alloc_map_and_rqs(struct blk_mq_tag_set *set, |
3768 | int hctx_idx) | |
cc71a6f4 | 3769 | { |
079a2e3e JG |
3770 | if (blk_mq_is_shared_tags(set->flags)) { |
3771 | set->tags[hctx_idx] = set->shared_tags; | |
1c0706a7 | 3772 | |
e155b0c2 | 3773 | return true; |
bd166ef1 | 3774 | } |
e155b0c2 | 3775 | |
63064be1 JG |
3776 | set->tags[hctx_idx] = blk_mq_alloc_map_and_rqs(set, hctx_idx, |
3777 | set->queue_depth); | |
3778 | ||
3779 | return set->tags[hctx_idx]; | |
cc71a6f4 JA |
3780 | } |
3781 | ||
645db34e JG |
3782 | void blk_mq_free_map_and_rqs(struct blk_mq_tag_set *set, |
3783 | struct blk_mq_tags *tags, | |
3784 | unsigned int hctx_idx) | |
cc71a6f4 | 3785 | { |
645db34e JG |
3786 | if (tags) { |
3787 | blk_mq_free_rqs(set, tags, hctx_idx); | |
e155b0c2 | 3788 | blk_mq_free_rq_map(tags); |
bd166ef1 | 3789 | } |
cc71a6f4 JA |
3790 | } |
3791 | ||
e155b0c2 JG |
3792 | static void __blk_mq_free_map_and_rqs(struct blk_mq_tag_set *set, |
3793 | unsigned int hctx_idx) | |
3794 | { | |
079a2e3e | 3795 | if (!blk_mq_is_shared_tags(set->flags)) |
e155b0c2 JG |
3796 | blk_mq_free_map_and_rqs(set, set->tags[hctx_idx], hctx_idx); |
3797 | ||
3798 | set->tags[hctx_idx] = NULL; | |
cc71a6f4 JA |
3799 | } |
3800 | ||
4b855ad3 | 3801 | static void blk_mq_map_swqueue(struct request_queue *q) |
320ae51f | 3802 | { |
4f481208 ML |
3803 | unsigned int j, hctx_idx; |
3804 | unsigned long i; | |
320ae51f JA |
3805 | struct blk_mq_hw_ctx *hctx; |
3806 | struct blk_mq_ctx *ctx; | |
2a34c087 | 3807 | struct blk_mq_tag_set *set = q->tag_set; |
320ae51f JA |
3808 | |
3809 | queue_for_each_hw_ctx(q, hctx, i) { | |
e4043dcf | 3810 | cpumask_clear(hctx->cpumask); |
320ae51f | 3811 | hctx->nr_ctx = 0; |
d416c92c | 3812 | hctx->dispatch_from = NULL; |
320ae51f JA |
3813 | } |
3814 | ||
3815 | /* | |
4b855ad3 | 3816 | * Map software to hardware queues. |
4412efec ML |
3817 | * |
3818 | * If the cpu isn't present, the cpu is mapped to first hctx. | |
320ae51f | 3819 | */ |
20e4d813 | 3820 | for_each_possible_cpu(i) { |
4412efec | 3821 | |
897bb0c7 | 3822 | ctx = per_cpu_ptr(q->queue_ctx, i); |
b3c661b1 | 3823 | for (j = 0; j < set->nr_maps; j++) { |
bb94aea1 JW |
3824 | if (!set->map[j].nr_queues) { |
3825 | ctx->hctxs[j] = blk_mq_map_queue_type(q, | |
3826 | HCTX_TYPE_DEFAULT, i); | |
e5edd5f2 | 3827 | continue; |
bb94aea1 | 3828 | } |
fd689871 ML |
3829 | hctx_idx = set->map[j].mq_map[i]; |
3830 | /* unmapped hw queue can be remapped after CPU topo changed */ | |
3831 | if (!set->tags[hctx_idx] && | |
63064be1 | 3832 | !__blk_mq_alloc_map_and_rqs(set, hctx_idx)) { |
fd689871 ML |
3833 | /* |
3834 | * If tags initialization fail for some hctx, | |
3835 | * that hctx won't be brought online. In this | |
3836 | * case, remap the current ctx to hctx[0] which | |
3837 | * is guaranteed to always have tags allocated | |
3838 | */ | |
3839 | set->map[j].mq_map[i] = 0; | |
3840 | } | |
e5edd5f2 | 3841 | |
b3c661b1 | 3842 | hctx = blk_mq_map_queue_type(q, j, i); |
8ccdf4a3 | 3843 | ctx->hctxs[j] = hctx; |
b3c661b1 JA |
3844 | /* |
3845 | * If the CPU is already set in the mask, then we've | |
3846 | * mapped this one already. This can happen if | |
3847 | * devices share queues across queue maps. | |
3848 | */ | |
3849 | if (cpumask_test_cpu(i, hctx->cpumask)) | |
3850 | continue; | |
3851 | ||
3852 | cpumask_set_cpu(i, hctx->cpumask); | |
3853 | hctx->type = j; | |
3854 | ctx->index_hw[hctx->type] = hctx->nr_ctx; | |
3855 | hctx->ctxs[hctx->nr_ctx++] = ctx; | |
3856 | ||
3857 | /* | |
3858 | * If the nr_ctx type overflows, we have exceeded the | |
3859 | * amount of sw queues we can support. | |
3860 | */ | |
3861 | BUG_ON(!hctx->nr_ctx); | |
3862 | } | |
bb94aea1 JW |
3863 | |
3864 | for (; j < HCTX_MAX_TYPES; j++) | |
3865 | ctx->hctxs[j] = blk_mq_map_queue_type(q, | |
3866 | HCTX_TYPE_DEFAULT, i); | |
320ae51f | 3867 | } |
506e931f JA |
3868 | |
3869 | queue_for_each_hw_ctx(q, hctx, i) { | |
4412efec ML |
3870 | /* |
3871 | * If no software queues are mapped to this hardware queue, | |
3872 | * disable it and free the request entries. | |
3873 | */ | |
3874 | if (!hctx->nr_ctx) { | |
3875 | /* Never unmap queue 0. We need it as a | |
3876 | * fallback in case of a new remap fails | |
3877 | * allocation | |
3878 | */ | |
e155b0c2 JG |
3879 | if (i) |
3880 | __blk_mq_free_map_and_rqs(set, i); | |
4412efec ML |
3881 | |
3882 | hctx->tags = NULL; | |
3883 | continue; | |
3884 | } | |
484b4061 | 3885 | |
2a34c087 ML |
3886 | hctx->tags = set->tags[i]; |
3887 | WARN_ON(!hctx->tags); | |
3888 | ||
889fa31f CY |
3889 | /* |
3890 | * Set the map size to the number of mapped software queues. | |
3891 | * This is more accurate and more efficient than looping | |
3892 | * over all possibly mapped software queues. | |
3893 | */ | |
88459642 | 3894 | sbitmap_resize(&hctx->ctx_map, hctx->nr_ctx); |
889fa31f | 3895 | |
484b4061 JA |
3896 | /* |
3897 | * Initialize batch roundrobin counts | |
3898 | */ | |
f82ddf19 | 3899 | hctx->next_cpu = blk_mq_first_mapped_cpu(hctx); |
506e931f JA |
3900 | hctx->next_cpu_batch = BLK_MQ_CPU_WORK_BATCH; |
3901 | } | |
320ae51f JA |
3902 | } |
3903 | ||
8e8320c9 JA |
3904 | /* |
3905 | * Caller needs to ensure that we're either frozen/quiesced, or that | |
3906 | * the queue isn't live yet. | |
3907 | */ | |
2404e607 | 3908 | static void queue_set_hctx_shared(struct request_queue *q, bool shared) |
0d2602ca JA |
3909 | { |
3910 | struct blk_mq_hw_ctx *hctx; | |
4f481208 | 3911 | unsigned long i; |
0d2602ca | 3912 | |
2404e607 | 3913 | queue_for_each_hw_ctx(q, hctx, i) { |
454bb677 | 3914 | if (shared) { |
51db1c37 | 3915 | hctx->flags |= BLK_MQ_F_TAG_QUEUE_SHARED; |
454bb677 YK |
3916 | } else { |
3917 | blk_mq_tag_idle(hctx); | |
51db1c37 | 3918 | hctx->flags &= ~BLK_MQ_F_TAG_QUEUE_SHARED; |
454bb677 | 3919 | } |
2404e607 JM |
3920 | } |
3921 | } | |
3922 | ||
655ac300 HR |
3923 | static void blk_mq_update_tag_set_shared(struct blk_mq_tag_set *set, |
3924 | bool shared) | |
2404e607 JM |
3925 | { |
3926 | struct request_queue *q; | |
0d2602ca | 3927 | |
705cda97 BVA |
3928 | lockdep_assert_held(&set->tag_list_lock); |
3929 | ||
0d2602ca JA |
3930 | list_for_each_entry(q, &set->tag_list, tag_set_list) { |
3931 | blk_mq_freeze_queue(q); | |
2404e607 | 3932 | queue_set_hctx_shared(q, shared); |
0d2602ca JA |
3933 | blk_mq_unfreeze_queue(q); |
3934 | } | |
3935 | } | |
3936 | ||
3937 | static void blk_mq_del_queue_tag_set(struct request_queue *q) | |
3938 | { | |
3939 | struct blk_mq_tag_set *set = q->tag_set; | |
3940 | ||
0d2602ca | 3941 | mutex_lock(&set->tag_list_lock); |
08c875cb | 3942 | list_del(&q->tag_set_list); |
2404e607 JM |
3943 | if (list_is_singular(&set->tag_list)) { |
3944 | /* just transitioned to unshared */ | |
51db1c37 | 3945 | set->flags &= ~BLK_MQ_F_TAG_QUEUE_SHARED; |
2404e607 | 3946 | /* update existing queue */ |
655ac300 | 3947 | blk_mq_update_tag_set_shared(set, false); |
2404e607 | 3948 | } |
0d2602ca | 3949 | mutex_unlock(&set->tag_list_lock); |
a347c7ad | 3950 | INIT_LIST_HEAD(&q->tag_set_list); |
0d2602ca JA |
3951 | } |
3952 | ||
3953 | static void blk_mq_add_queue_tag_set(struct blk_mq_tag_set *set, | |
3954 | struct request_queue *q) | |
3955 | { | |
0d2602ca | 3956 | mutex_lock(&set->tag_list_lock); |
2404e607 | 3957 | |
ff821d27 JA |
3958 | /* |
3959 | * Check to see if we're transitioning to shared (from 1 to 2 queues). | |
3960 | */ | |
3961 | if (!list_empty(&set->tag_list) && | |
51db1c37 ML |
3962 | !(set->flags & BLK_MQ_F_TAG_QUEUE_SHARED)) { |
3963 | set->flags |= BLK_MQ_F_TAG_QUEUE_SHARED; | |
2404e607 | 3964 | /* update existing queue */ |
655ac300 | 3965 | blk_mq_update_tag_set_shared(set, true); |
2404e607 | 3966 | } |
51db1c37 | 3967 | if (set->flags & BLK_MQ_F_TAG_QUEUE_SHARED) |
2404e607 | 3968 | queue_set_hctx_shared(q, true); |
08c875cb | 3969 | list_add_tail(&q->tag_set_list, &set->tag_list); |
2404e607 | 3970 | |
0d2602ca JA |
3971 | mutex_unlock(&set->tag_list_lock); |
3972 | } | |
3973 | ||
1db4909e ML |
3974 | /* All allocations will be freed in release handler of q->mq_kobj */ |
3975 | static int blk_mq_alloc_ctxs(struct request_queue *q) | |
3976 | { | |
3977 | struct blk_mq_ctxs *ctxs; | |
3978 | int cpu; | |
3979 | ||
3980 | ctxs = kzalloc(sizeof(*ctxs), GFP_KERNEL); | |
3981 | if (!ctxs) | |
3982 | return -ENOMEM; | |
3983 | ||
3984 | ctxs->queue_ctx = alloc_percpu(struct blk_mq_ctx); | |
3985 | if (!ctxs->queue_ctx) | |
3986 | goto fail; | |
3987 | ||
3988 | for_each_possible_cpu(cpu) { | |
3989 | struct blk_mq_ctx *ctx = per_cpu_ptr(ctxs->queue_ctx, cpu); | |
3990 | ctx->ctxs = ctxs; | |
3991 | } | |
3992 | ||
3993 | q->mq_kobj = &ctxs->kobj; | |
3994 | q->queue_ctx = ctxs->queue_ctx; | |
3995 | ||
3996 | return 0; | |
3997 | fail: | |
3998 | kfree(ctxs); | |
3999 | return -ENOMEM; | |
4000 | } | |
4001 | ||
e09aae7e ML |
4002 | /* |
4003 | * It is the actual release handler for mq, but we do it from | |
4004 | * request queue's release handler for avoiding use-after-free | |
4005 | * and headache because q->mq_kobj shouldn't have been introduced, | |
4006 | * but we can't group ctx/kctx kobj without it. | |
4007 | */ | |
4008 | void blk_mq_release(struct request_queue *q) | |
4009 | { | |
2f8f1336 | 4010 | struct blk_mq_hw_ctx *hctx, *next; |
4f481208 | 4011 | unsigned long i; |
e09aae7e | 4012 | |
2f8f1336 ML |
4013 | queue_for_each_hw_ctx(q, hctx, i) |
4014 | WARN_ON_ONCE(hctx && list_empty(&hctx->hctx_list)); | |
4015 | ||
4016 | /* all hctx are in .unused_hctx_list now */ | |
4017 | list_for_each_entry_safe(hctx, next, &q->unused_hctx_list, hctx_list) { | |
4018 | list_del_init(&hctx->hctx_list); | |
6c8b232e | 4019 | kobject_put(&hctx->kobj); |
c3b4afca | 4020 | } |
e09aae7e | 4021 | |
4e5cc99e | 4022 | xa_destroy(&q->hctx_table); |
e09aae7e | 4023 | |
7ea5fe31 ML |
4024 | /* |
4025 | * release .mq_kobj and sw queue's kobject now because | |
4026 | * both share lifetime with request queue. | |
4027 | */ | |
4028 | blk_mq_sysfs_deinit(q); | |
e09aae7e ML |
4029 | } |
4030 | ||
5ec780a6 | 4031 | static struct request_queue *blk_mq_init_queue_data(struct blk_mq_tag_set *set, |
2f227bb9 | 4032 | void *queuedata) |
b62c21b7 | 4033 | { |
26a9750a CH |
4034 | struct request_queue *q; |
4035 | int ret; | |
b62c21b7 | 4036 | |
80bd4a7a | 4037 | q = blk_alloc_queue(set->numa_node); |
26a9750a | 4038 | if (!q) |
b62c21b7 | 4039 | return ERR_PTR(-ENOMEM); |
26a9750a CH |
4040 | q->queuedata = queuedata; |
4041 | ret = blk_mq_init_allocated_queue(set, q); | |
4042 | if (ret) { | |
6f8191fd | 4043 | blk_put_queue(q); |
26a9750a CH |
4044 | return ERR_PTR(ret); |
4045 | } | |
b62c21b7 MS |
4046 | return q; |
4047 | } | |
2f227bb9 CH |
4048 | |
4049 | struct request_queue *blk_mq_init_queue(struct blk_mq_tag_set *set) | |
4050 | { | |
4051 | return blk_mq_init_queue_data(set, NULL); | |
4052 | } | |
b62c21b7 MS |
4053 | EXPORT_SYMBOL(blk_mq_init_queue); |
4054 | ||
6f8191fd CH |
4055 | /** |
4056 | * blk_mq_destroy_queue - shutdown a request queue | |
4057 | * @q: request queue to shutdown | |
4058 | * | |
81ea42b9 BVA |
4059 | * This shuts down a request queue allocated by blk_mq_init_queue(). All future |
4060 | * requests will be failed with -ENODEV. The caller is responsible for dropping | |
4061 | * the reference from blk_mq_init_queue() by calling blk_put_queue(). | |
6f8191fd CH |
4062 | * |
4063 | * Context: can sleep | |
4064 | */ | |
4065 | void blk_mq_destroy_queue(struct request_queue *q) | |
4066 | { | |
4067 | WARN_ON_ONCE(!queue_is_mq(q)); | |
4068 | WARN_ON_ONCE(blk_queue_registered(q)); | |
4069 | ||
4070 | might_sleep(); | |
4071 | ||
4072 | blk_queue_flag_set(QUEUE_FLAG_DYING, q); | |
4073 | blk_queue_start_drain(q); | |
56c1ee92 | 4074 | blk_mq_freeze_queue_wait(q); |
6f8191fd CH |
4075 | |
4076 | blk_sync_queue(q); | |
4077 | blk_mq_cancel_work_sync(q); | |
4078 | blk_mq_exit_queue(q); | |
6f8191fd CH |
4079 | } |
4080 | EXPORT_SYMBOL(blk_mq_destroy_queue); | |
4081 | ||
4dcc4874 CH |
4082 | struct gendisk *__blk_mq_alloc_disk(struct blk_mq_tag_set *set, void *queuedata, |
4083 | struct lock_class_key *lkclass) | |
9316a9ed JA |
4084 | { |
4085 | struct request_queue *q; | |
b461dfc4 | 4086 | struct gendisk *disk; |
9316a9ed | 4087 | |
b461dfc4 CH |
4088 | q = blk_mq_init_queue_data(set, queuedata); |
4089 | if (IS_ERR(q)) | |
4090 | return ERR_CAST(q); | |
9316a9ed | 4091 | |
4a1fa41d | 4092 | disk = __alloc_disk_node(q, set->numa_node, lkclass); |
b461dfc4 | 4093 | if (!disk) { |
0a3e5cc7 | 4094 | blk_mq_destroy_queue(q); |
2b3f056f | 4095 | blk_put_queue(q); |
b461dfc4 | 4096 | return ERR_PTR(-ENOMEM); |
9316a9ed | 4097 | } |
6f8191fd | 4098 | set_bit(GD_OWNS_QUEUE, &disk->state); |
b461dfc4 | 4099 | return disk; |
9316a9ed | 4100 | } |
b461dfc4 | 4101 | EXPORT_SYMBOL(__blk_mq_alloc_disk); |
9316a9ed | 4102 | |
6f8191fd CH |
4103 | struct gendisk *blk_mq_alloc_disk_for_queue(struct request_queue *q, |
4104 | struct lock_class_key *lkclass) | |
4105 | { | |
22c17e27 CH |
4106 | struct gendisk *disk; |
4107 | ||
6f8191fd CH |
4108 | if (!blk_get_queue(q)) |
4109 | return NULL; | |
22c17e27 CH |
4110 | disk = __alloc_disk_node(q, NUMA_NO_NODE, lkclass); |
4111 | if (!disk) | |
4112 | blk_put_queue(q); | |
4113 | return disk; | |
6f8191fd CH |
4114 | } |
4115 | EXPORT_SYMBOL(blk_mq_alloc_disk_for_queue); | |
4116 | ||
34d11ffa JW |
4117 | static struct blk_mq_hw_ctx *blk_mq_alloc_and_init_hctx( |
4118 | struct blk_mq_tag_set *set, struct request_queue *q, | |
4119 | int hctx_idx, int node) | |
4120 | { | |
2f8f1336 | 4121 | struct blk_mq_hw_ctx *hctx = NULL, *tmp; |
34d11ffa | 4122 | |
2f8f1336 ML |
4123 | /* reuse dead hctx first */ |
4124 | spin_lock(&q->unused_hctx_lock); | |
4125 | list_for_each_entry(tmp, &q->unused_hctx_list, hctx_list) { | |
4126 | if (tmp->numa_node == node) { | |
4127 | hctx = tmp; | |
4128 | break; | |
4129 | } | |
4130 | } | |
4131 | if (hctx) | |
4132 | list_del_init(&hctx->hctx_list); | |
4133 | spin_unlock(&q->unused_hctx_lock); | |
4134 | ||
4135 | if (!hctx) | |
4136 | hctx = blk_mq_alloc_hctx(q, set, node); | |
34d11ffa | 4137 | if (!hctx) |
7c6c5b7c | 4138 | goto fail; |
34d11ffa | 4139 | |
7c6c5b7c ML |
4140 | if (blk_mq_init_hctx(q, set, hctx, hctx_idx)) |
4141 | goto free_hctx; | |
34d11ffa JW |
4142 | |
4143 | return hctx; | |
7c6c5b7c ML |
4144 | |
4145 | free_hctx: | |
4146 | kobject_put(&hctx->kobj); | |
4147 | fail: | |
4148 | return NULL; | |
34d11ffa JW |
4149 | } |
4150 | ||
868f2f0b KB |
4151 | static void blk_mq_realloc_hw_ctxs(struct blk_mq_tag_set *set, |
4152 | struct request_queue *q) | |
320ae51f | 4153 | { |
4e5cc99e ML |
4154 | struct blk_mq_hw_ctx *hctx; |
4155 | unsigned long i, j; | |
ac0d6b92 | 4156 | |
fb350e0a ML |
4157 | /* protect against switching io scheduler */ |
4158 | mutex_lock(&q->sysfs_lock); | |
24d2f903 | 4159 | for (i = 0; i < set->nr_hw_queues; i++) { |
306f13ee | 4160 | int old_node; |
4d805131 | 4161 | int node = blk_mq_get_hctx_node(set, i); |
4e5cc99e | 4162 | struct blk_mq_hw_ctx *old_hctx = xa_load(&q->hctx_table, i); |
868f2f0b | 4163 | |
306f13ee ML |
4164 | if (old_hctx) { |
4165 | old_node = old_hctx->numa_node; | |
4166 | blk_mq_exit_hctx(q, set, old_hctx, i); | |
4167 | } | |
868f2f0b | 4168 | |
4e5cc99e | 4169 | if (!blk_mq_alloc_and_init_hctx(set, q, i, node)) { |
306f13ee | 4170 | if (!old_hctx) |
34d11ffa | 4171 | break; |
306f13ee ML |
4172 | pr_warn("Allocate new hctx on node %d fails, fallback to previous one on node %d\n", |
4173 | node, old_node); | |
4e5cc99e ML |
4174 | hctx = blk_mq_alloc_and_init_hctx(set, q, i, old_node); |
4175 | WARN_ON_ONCE(!hctx); | |
868f2f0b | 4176 | } |
320ae51f | 4177 | } |
e01ad46d JW |
4178 | /* |
4179 | * Increasing nr_hw_queues fails. Free the newly allocated | |
4180 | * hctxs and keep the previous q->nr_hw_queues. | |
4181 | */ | |
4182 | if (i != set->nr_hw_queues) { | |
4183 | j = q->nr_hw_queues; | |
e01ad46d JW |
4184 | } else { |
4185 | j = i; | |
e01ad46d JW |
4186 | q->nr_hw_queues = set->nr_hw_queues; |
4187 | } | |
34d11ffa | 4188 | |
4e5cc99e ML |
4189 | xa_for_each_start(&q->hctx_table, j, hctx, j) |
4190 | blk_mq_exit_hctx(q, set, hctx, j); | |
fb350e0a | 4191 | mutex_unlock(&q->sysfs_lock); |
868f2f0b KB |
4192 | } |
4193 | ||
42ee3061 ML |
4194 | static void blk_mq_update_poll_flag(struct request_queue *q) |
4195 | { | |
4196 | struct blk_mq_tag_set *set = q->tag_set; | |
4197 | ||
4198 | if (set->nr_maps > HCTX_TYPE_POLL && | |
4199 | set->map[HCTX_TYPE_POLL].nr_queues) | |
4200 | blk_queue_flag_set(QUEUE_FLAG_POLL, q); | |
4201 | else | |
4202 | blk_queue_flag_clear(QUEUE_FLAG_POLL, q); | |
4203 | } | |
4204 | ||
26a9750a CH |
4205 | int blk_mq_init_allocated_queue(struct blk_mq_tag_set *set, |
4206 | struct request_queue *q) | |
868f2f0b | 4207 | { |
66841672 ML |
4208 | /* mark the queue as mq asap */ |
4209 | q->mq_ops = set->ops; | |
4210 | ||
1db4909e | 4211 | if (blk_mq_alloc_ctxs(q)) |
54bdd67d | 4212 | goto err_exit; |
868f2f0b | 4213 | |
737f98cf ML |
4214 | /* init q->mq_kobj and sw queues' kobjects */ |
4215 | blk_mq_sysfs_init(q); | |
4216 | ||
2f8f1336 ML |
4217 | INIT_LIST_HEAD(&q->unused_hctx_list); |
4218 | spin_lock_init(&q->unused_hctx_lock); | |
4219 | ||
4e5cc99e ML |
4220 | xa_init(&q->hctx_table); |
4221 | ||
868f2f0b KB |
4222 | blk_mq_realloc_hw_ctxs(set, q); |
4223 | if (!q->nr_hw_queues) | |
4224 | goto err_hctxs; | |
320ae51f | 4225 | |
287922eb | 4226 | INIT_WORK(&q->timeout_work, blk_mq_timeout_work); |
e56f698b | 4227 | blk_queue_rq_timeout(q, set->timeout ? set->timeout : 30 * HZ); |
320ae51f | 4228 | |
a8908939 | 4229 | q->tag_set = set; |
320ae51f | 4230 | |
94eddfbe | 4231 | q->queue_flags |= QUEUE_FLAG_MQ_DEFAULT; |
42ee3061 | 4232 | blk_mq_update_poll_flag(q); |
320ae51f | 4233 | |
2849450a | 4234 | INIT_DELAYED_WORK(&q->requeue_work, blk_mq_requeue_work); |
6fca6a61 CH |
4235 | INIT_LIST_HEAD(&q->requeue_list); |
4236 | spin_lock_init(&q->requeue_lock); | |
4237 | ||
eba71768 JA |
4238 | q->nr_requests = set->queue_depth; |
4239 | ||
24d2f903 | 4240 | blk_mq_init_cpu_queues(q, set->nr_hw_queues); |
0d2602ca | 4241 | blk_mq_add_queue_tag_set(set, q); |
4b855ad3 | 4242 | blk_mq_map_swqueue(q); |
26a9750a | 4243 | return 0; |
18741986 | 4244 | |
320ae51f | 4245 | err_hctxs: |
943f45b9 | 4246 | blk_mq_release(q); |
c7de5726 ML |
4247 | err_exit: |
4248 | q->mq_ops = NULL; | |
26a9750a | 4249 | return -ENOMEM; |
320ae51f | 4250 | } |
b62c21b7 | 4251 | EXPORT_SYMBOL(blk_mq_init_allocated_queue); |
320ae51f | 4252 | |
c7e2d94b ML |
4253 | /* tags can _not_ be used after returning from blk_mq_exit_queue */ |
4254 | void blk_mq_exit_queue(struct request_queue *q) | |
320ae51f | 4255 | { |
630ef623 | 4256 | struct blk_mq_tag_set *set = q->tag_set; |
320ae51f | 4257 | |
630ef623 | 4258 | /* Checks hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED. */ |
624dbe47 | 4259 | blk_mq_exit_hw_queues(q, set, set->nr_hw_queues); |
630ef623 BVA |
4260 | /* May clear BLK_MQ_F_TAG_QUEUE_SHARED in hctx->flags. */ |
4261 | blk_mq_del_queue_tag_set(q); | |
320ae51f | 4262 | } |
320ae51f | 4263 | |
a5164405 JA |
4264 | static int __blk_mq_alloc_rq_maps(struct blk_mq_tag_set *set) |
4265 | { | |
4266 | int i; | |
4267 | ||
079a2e3e JG |
4268 | if (blk_mq_is_shared_tags(set->flags)) { |
4269 | set->shared_tags = blk_mq_alloc_map_and_rqs(set, | |
e155b0c2 JG |
4270 | BLK_MQ_NO_HCTX_IDX, |
4271 | set->queue_depth); | |
079a2e3e | 4272 | if (!set->shared_tags) |
e155b0c2 JG |
4273 | return -ENOMEM; |
4274 | } | |
4275 | ||
8229cca8 | 4276 | for (i = 0; i < set->nr_hw_queues; i++) { |
63064be1 | 4277 | if (!__blk_mq_alloc_map_and_rqs(set, i)) |
a5164405 | 4278 | goto out_unwind; |
8229cca8 XT |
4279 | cond_resched(); |
4280 | } | |
a5164405 JA |
4281 | |
4282 | return 0; | |
4283 | ||
4284 | out_unwind: | |
4285 | while (--i >= 0) | |
e155b0c2 JG |
4286 | __blk_mq_free_map_and_rqs(set, i); |
4287 | ||
079a2e3e JG |
4288 | if (blk_mq_is_shared_tags(set->flags)) { |
4289 | blk_mq_free_map_and_rqs(set, set->shared_tags, | |
e155b0c2 | 4290 | BLK_MQ_NO_HCTX_IDX); |
645db34e | 4291 | } |
a5164405 | 4292 | |
a5164405 JA |
4293 | return -ENOMEM; |
4294 | } | |
4295 | ||
4296 | /* | |
4297 | * Allocate the request maps associated with this tag_set. Note that this | |
4298 | * may reduce the depth asked for, if memory is tight. set->queue_depth | |
4299 | * will be updated to reflect the allocated depth. | |
4300 | */ | |
63064be1 | 4301 | static int blk_mq_alloc_set_map_and_rqs(struct blk_mq_tag_set *set) |
a5164405 JA |
4302 | { |
4303 | unsigned int depth; | |
4304 | int err; | |
4305 | ||
4306 | depth = set->queue_depth; | |
4307 | do { | |
4308 | err = __blk_mq_alloc_rq_maps(set); | |
4309 | if (!err) | |
4310 | break; | |
4311 | ||
4312 | set->queue_depth >>= 1; | |
4313 | if (set->queue_depth < set->reserved_tags + BLK_MQ_TAG_MIN) { | |
4314 | err = -ENOMEM; | |
4315 | break; | |
4316 | } | |
4317 | } while (set->queue_depth); | |
4318 | ||
4319 | if (!set->queue_depth || err) { | |
4320 | pr_err("blk-mq: failed to allocate request map\n"); | |
4321 | return -ENOMEM; | |
4322 | } | |
4323 | ||
4324 | if (depth != set->queue_depth) | |
4325 | pr_info("blk-mq: reduced tag depth (%u -> %u)\n", | |
4326 | depth, set->queue_depth); | |
4327 | ||
4328 | return 0; | |
4329 | } | |
4330 | ||
a4e1d0b7 | 4331 | static void blk_mq_update_queue_map(struct blk_mq_tag_set *set) |
ebe8bddb | 4332 | { |
6e66b493 BVA |
4333 | /* |
4334 | * blk_mq_map_queues() and multiple .map_queues() implementations | |
4335 | * expect that set->map[HCTX_TYPE_DEFAULT].nr_queues is set to the | |
4336 | * number of hardware queues. | |
4337 | */ | |
4338 | if (set->nr_maps == 1) | |
4339 | set->map[HCTX_TYPE_DEFAULT].nr_queues = set->nr_hw_queues; | |
4340 | ||
59388702 | 4341 | if (set->ops->map_queues && !is_kdump_kernel()) { |
b3c661b1 JA |
4342 | int i; |
4343 | ||
7d4901a9 ML |
4344 | /* |
4345 | * transport .map_queues is usually done in the following | |
4346 | * way: | |
4347 | * | |
4348 | * for (queue = 0; queue < set->nr_hw_queues; queue++) { | |
4349 | * mask = get_cpu_mask(queue) | |
4350 | * for_each_cpu(cpu, mask) | |
b3c661b1 | 4351 | * set->map[x].mq_map[cpu] = queue; |
7d4901a9 ML |
4352 | * } |
4353 | * | |
4354 | * When we need to remap, the table has to be cleared for | |
4355 | * killing stale mapping since one CPU may not be mapped | |
4356 | * to any hw queue. | |
4357 | */ | |
b3c661b1 JA |
4358 | for (i = 0; i < set->nr_maps; i++) |
4359 | blk_mq_clear_mq_map(&set->map[i]); | |
7d4901a9 | 4360 | |
a4e1d0b7 | 4361 | set->ops->map_queues(set); |
b3c661b1 JA |
4362 | } else { |
4363 | BUG_ON(set->nr_maps > 1); | |
a4e1d0b7 | 4364 | blk_mq_map_queues(&set->map[HCTX_TYPE_DEFAULT]); |
b3c661b1 | 4365 | } |
ebe8bddb OS |
4366 | } |
4367 | ||
f7e76dbc | 4368 | static int blk_mq_realloc_tag_set_tags(struct blk_mq_tag_set *set, |
ee9d5521 | 4369 | int new_nr_hw_queues) |
f7e76dbc BVA |
4370 | { |
4371 | struct blk_mq_tags **new_tags; | |
4372 | ||
ee9d5521 | 4373 | if (set->nr_hw_queues >= new_nr_hw_queues) |
d4b2e0d4 | 4374 | goto done; |
f7e76dbc BVA |
4375 | |
4376 | new_tags = kcalloc_node(new_nr_hw_queues, sizeof(struct blk_mq_tags *), | |
4377 | GFP_KERNEL, set->numa_node); | |
4378 | if (!new_tags) | |
4379 | return -ENOMEM; | |
4380 | ||
4381 | if (set->tags) | |
ee9d5521 | 4382 | memcpy(new_tags, set->tags, set->nr_hw_queues * |
f7e76dbc BVA |
4383 | sizeof(*set->tags)); |
4384 | kfree(set->tags); | |
4385 | set->tags = new_tags; | |
d4b2e0d4 | 4386 | done: |
f7e76dbc | 4387 | set->nr_hw_queues = new_nr_hw_queues; |
f7e76dbc BVA |
4388 | return 0; |
4389 | } | |
4390 | ||
a4391c64 JA |
4391 | /* |
4392 | * Alloc a tag set to be associated with one or more request queues. | |
4393 | * May fail with EINVAL for various error conditions. May adjust the | |
c018c84f | 4394 | * requested depth down, if it's too large. In that case, the set |
a4391c64 JA |
4395 | * value will be stored in set->queue_depth. |
4396 | */ | |
24d2f903 CH |
4397 | int blk_mq_alloc_tag_set(struct blk_mq_tag_set *set) |
4398 | { | |
b3c661b1 | 4399 | int i, ret; |
da695ba2 | 4400 | |
205fb5f5 BVA |
4401 | BUILD_BUG_ON(BLK_MQ_MAX_DEPTH > 1 << BLK_MQ_UNIQUE_TAG_BITS); |
4402 | ||
24d2f903 CH |
4403 | if (!set->nr_hw_queues) |
4404 | return -EINVAL; | |
a4391c64 | 4405 | if (!set->queue_depth) |
24d2f903 CH |
4406 | return -EINVAL; |
4407 | if (set->queue_depth < set->reserved_tags + BLK_MQ_TAG_MIN) | |
4408 | return -EINVAL; | |
4409 | ||
7d7e0f90 | 4410 | if (!set->ops->queue_rq) |
24d2f903 CH |
4411 | return -EINVAL; |
4412 | ||
de148297 ML |
4413 | if (!set->ops->get_budget ^ !set->ops->put_budget) |
4414 | return -EINVAL; | |
4415 | ||
a4391c64 JA |
4416 | if (set->queue_depth > BLK_MQ_MAX_DEPTH) { |
4417 | pr_info("blk-mq: reduced tag depth to %u\n", | |
4418 | BLK_MQ_MAX_DEPTH); | |
4419 | set->queue_depth = BLK_MQ_MAX_DEPTH; | |
4420 | } | |
24d2f903 | 4421 | |
b3c661b1 JA |
4422 | if (!set->nr_maps) |
4423 | set->nr_maps = 1; | |
4424 | else if (set->nr_maps > HCTX_MAX_TYPES) | |
4425 | return -EINVAL; | |
4426 | ||
6637fadf SL |
4427 | /* |
4428 | * If a crashdump is active, then we are potentially in a very | |
4429 | * memory constrained environment. Limit us to 1 queue and | |
4430 | * 64 tags to prevent using too much memory. | |
4431 | */ | |
4432 | if (is_kdump_kernel()) { | |
4433 | set->nr_hw_queues = 1; | |
59388702 | 4434 | set->nr_maps = 1; |
6637fadf SL |
4435 | set->queue_depth = min(64U, set->queue_depth); |
4436 | } | |
868f2f0b | 4437 | /* |
392546ae JA |
4438 | * There is no use for more h/w queues than cpus if we just have |
4439 | * a single map | |
868f2f0b | 4440 | */ |
392546ae | 4441 | if (set->nr_maps == 1 && set->nr_hw_queues > nr_cpu_ids) |
868f2f0b | 4442 | set->nr_hw_queues = nr_cpu_ids; |
6637fadf | 4443 | |
80bd4a7a CH |
4444 | if (set->flags & BLK_MQ_F_BLOCKING) { |
4445 | set->srcu = kmalloc(sizeof(*set->srcu), GFP_KERNEL); | |
4446 | if (!set->srcu) | |
4447 | return -ENOMEM; | |
4448 | ret = init_srcu_struct(set->srcu); | |
4449 | if (ret) | |
4450 | goto out_free_srcu; | |
4451 | } | |
24d2f903 | 4452 | |
da695ba2 | 4453 | ret = -ENOMEM; |
5ee20298 CH |
4454 | set->tags = kcalloc_node(set->nr_hw_queues, |
4455 | sizeof(struct blk_mq_tags *), GFP_KERNEL, | |
4456 | set->numa_node); | |
4457 | if (!set->tags) | |
80bd4a7a | 4458 | goto out_cleanup_srcu; |
24d2f903 | 4459 | |
b3c661b1 JA |
4460 | for (i = 0; i < set->nr_maps; i++) { |
4461 | set->map[i].mq_map = kcalloc_node(nr_cpu_ids, | |
07b35eb5 | 4462 | sizeof(set->map[i].mq_map[0]), |
b3c661b1 JA |
4463 | GFP_KERNEL, set->numa_node); |
4464 | if (!set->map[i].mq_map) | |
4465 | goto out_free_mq_map; | |
59388702 | 4466 | set->map[i].nr_queues = is_kdump_kernel() ? 1 : set->nr_hw_queues; |
b3c661b1 | 4467 | } |
bdd17e75 | 4468 | |
a4e1d0b7 | 4469 | blk_mq_update_queue_map(set); |
da695ba2 | 4470 | |
63064be1 | 4471 | ret = blk_mq_alloc_set_map_and_rqs(set); |
da695ba2 | 4472 | if (ret) |
bdd17e75 | 4473 | goto out_free_mq_map; |
24d2f903 | 4474 | |
0d2602ca JA |
4475 | mutex_init(&set->tag_list_lock); |
4476 | INIT_LIST_HEAD(&set->tag_list); | |
4477 | ||
24d2f903 | 4478 | return 0; |
bdd17e75 CH |
4479 | |
4480 | out_free_mq_map: | |
b3c661b1 JA |
4481 | for (i = 0; i < set->nr_maps; i++) { |
4482 | kfree(set->map[i].mq_map); | |
4483 | set->map[i].mq_map = NULL; | |
4484 | } | |
5676e7b6 RE |
4485 | kfree(set->tags); |
4486 | set->tags = NULL; | |
80bd4a7a CH |
4487 | out_cleanup_srcu: |
4488 | if (set->flags & BLK_MQ_F_BLOCKING) | |
4489 | cleanup_srcu_struct(set->srcu); | |
4490 | out_free_srcu: | |
4491 | if (set->flags & BLK_MQ_F_BLOCKING) | |
4492 | kfree(set->srcu); | |
da695ba2 | 4493 | return ret; |
24d2f903 CH |
4494 | } |
4495 | EXPORT_SYMBOL(blk_mq_alloc_tag_set); | |
4496 | ||
cdb14e0f CH |
4497 | /* allocate and initialize a tagset for a simple single-queue device */ |
4498 | int blk_mq_alloc_sq_tag_set(struct blk_mq_tag_set *set, | |
4499 | const struct blk_mq_ops *ops, unsigned int queue_depth, | |
4500 | unsigned int set_flags) | |
4501 | { | |
4502 | memset(set, 0, sizeof(*set)); | |
4503 | set->ops = ops; | |
4504 | set->nr_hw_queues = 1; | |
4505 | set->nr_maps = 1; | |
4506 | set->queue_depth = queue_depth; | |
4507 | set->numa_node = NUMA_NO_NODE; | |
4508 | set->flags = set_flags; | |
4509 | return blk_mq_alloc_tag_set(set); | |
4510 | } | |
4511 | EXPORT_SYMBOL_GPL(blk_mq_alloc_sq_tag_set); | |
4512 | ||
24d2f903 CH |
4513 | void blk_mq_free_tag_set(struct blk_mq_tag_set *set) |
4514 | { | |
b3c661b1 | 4515 | int i, j; |
24d2f903 | 4516 | |
f7e76dbc | 4517 | for (i = 0; i < set->nr_hw_queues; i++) |
e155b0c2 | 4518 | __blk_mq_free_map_and_rqs(set, i); |
484b4061 | 4519 | |
079a2e3e JG |
4520 | if (blk_mq_is_shared_tags(set->flags)) { |
4521 | blk_mq_free_map_and_rqs(set, set->shared_tags, | |
e155b0c2 JG |
4522 | BLK_MQ_NO_HCTX_IDX); |
4523 | } | |
32bc15af | 4524 | |
b3c661b1 JA |
4525 | for (j = 0; j < set->nr_maps; j++) { |
4526 | kfree(set->map[j].mq_map); | |
4527 | set->map[j].mq_map = NULL; | |
4528 | } | |
bdd17e75 | 4529 | |
981bd189 | 4530 | kfree(set->tags); |
5676e7b6 | 4531 | set->tags = NULL; |
80bd4a7a CH |
4532 | if (set->flags & BLK_MQ_F_BLOCKING) { |
4533 | cleanup_srcu_struct(set->srcu); | |
4534 | kfree(set->srcu); | |
4535 | } | |
24d2f903 CH |
4536 | } |
4537 | EXPORT_SYMBOL(blk_mq_free_tag_set); | |
4538 | ||
e3a2b3f9 JA |
4539 | int blk_mq_update_nr_requests(struct request_queue *q, unsigned int nr) |
4540 | { | |
4541 | struct blk_mq_tag_set *set = q->tag_set; | |
4542 | struct blk_mq_hw_ctx *hctx; | |
4f481208 ML |
4543 | int ret; |
4544 | unsigned long i; | |
e3a2b3f9 | 4545 | |
bd166ef1 | 4546 | if (!set) |
e3a2b3f9 JA |
4547 | return -EINVAL; |
4548 | ||
e5fa8140 AZ |
4549 | if (q->nr_requests == nr) |
4550 | return 0; | |
4551 | ||
70f36b60 | 4552 | blk_mq_freeze_queue(q); |
24f5a90f | 4553 | blk_mq_quiesce_queue(q); |
70f36b60 | 4554 | |
e3a2b3f9 JA |
4555 | ret = 0; |
4556 | queue_for_each_hw_ctx(q, hctx, i) { | |
e9137d4b KB |
4557 | if (!hctx->tags) |
4558 | continue; | |
bd166ef1 JA |
4559 | /* |
4560 | * If we're using an MQ scheduler, just update the scheduler | |
4561 | * queue depth. This is similar to what the old code would do. | |
4562 | */ | |
f6adcef5 | 4563 | if (hctx->sched_tags) { |
70f36b60 | 4564 | ret = blk_mq_tag_update_depth(hctx, &hctx->sched_tags, |
f6adcef5 | 4565 | nr, true); |
f6adcef5 JG |
4566 | } else { |
4567 | ret = blk_mq_tag_update_depth(hctx, &hctx->tags, nr, | |
4568 | false); | |
70f36b60 | 4569 | } |
e3a2b3f9 JA |
4570 | if (ret) |
4571 | break; | |
77f1e0a5 JA |
4572 | if (q->elevator && q->elevator->type->ops.depth_updated) |
4573 | q->elevator->type->ops.depth_updated(hctx); | |
e3a2b3f9 | 4574 | } |
d97e594c | 4575 | if (!ret) { |
e3a2b3f9 | 4576 | q->nr_requests = nr; |
079a2e3e | 4577 | if (blk_mq_is_shared_tags(set->flags)) { |
8fa04464 | 4578 | if (q->elevator) |
079a2e3e | 4579 | blk_mq_tag_update_sched_shared_tags(q); |
8fa04464 | 4580 | else |
079a2e3e | 4581 | blk_mq_tag_resize_shared_tags(set, nr); |
8fa04464 | 4582 | } |
d97e594c | 4583 | } |
e3a2b3f9 | 4584 | |
24f5a90f | 4585 | blk_mq_unquiesce_queue(q); |
70f36b60 | 4586 | blk_mq_unfreeze_queue(q); |
70f36b60 | 4587 | |
e3a2b3f9 JA |
4588 | return ret; |
4589 | } | |
4590 | ||
d48ece20 JW |
4591 | /* |
4592 | * request_queue and elevator_type pair. | |
4593 | * It is just used by __blk_mq_update_nr_hw_queues to cache | |
4594 | * the elevator_type associated with a request_queue. | |
4595 | */ | |
4596 | struct blk_mq_qe_pair { | |
4597 | struct list_head node; | |
4598 | struct request_queue *q; | |
4599 | struct elevator_type *type; | |
4600 | }; | |
4601 | ||
4602 | /* | |
4603 | * Cache the elevator_type in qe pair list and switch the | |
4604 | * io scheduler to 'none' | |
4605 | */ | |
4606 | static bool blk_mq_elv_switch_none(struct list_head *head, | |
4607 | struct request_queue *q) | |
4608 | { | |
4609 | struct blk_mq_qe_pair *qe; | |
4610 | ||
4611 | if (!q->elevator) | |
4612 | return true; | |
4613 | ||
4614 | qe = kmalloc(sizeof(*qe), GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY); | |
4615 | if (!qe) | |
4616 | return false; | |
4617 | ||
5fd7a84a ML |
4618 | /* q->elevator needs protection from ->sysfs_lock */ |
4619 | mutex_lock(&q->sysfs_lock); | |
4620 | ||
d48ece20 JW |
4621 | INIT_LIST_HEAD(&qe->node); |
4622 | qe->q = q; | |
4623 | qe->type = q->elevator->type; | |
dd6f7f17 CH |
4624 | /* keep a reference to the elevator module as we'll switch back */ |
4625 | __elevator_get(qe->type); | |
d48ece20 | 4626 | list_add(&qe->node, head); |
64b36075 | 4627 | elevator_disable(q); |
d48ece20 JW |
4628 | mutex_unlock(&q->sysfs_lock); |
4629 | ||
4630 | return true; | |
4631 | } | |
4632 | ||
4a3b666e JK |
4633 | static struct blk_mq_qe_pair *blk_lookup_qe_pair(struct list_head *head, |
4634 | struct request_queue *q) | |
d48ece20 JW |
4635 | { |
4636 | struct blk_mq_qe_pair *qe; | |
d48ece20 JW |
4637 | |
4638 | list_for_each_entry(qe, head, node) | |
4a3b666e JK |
4639 | if (qe->q == q) |
4640 | return qe; | |
d48ece20 | 4641 | |
4a3b666e JK |
4642 | return NULL; |
4643 | } | |
d48ece20 | 4644 | |
4a3b666e JK |
4645 | static void blk_mq_elv_switch_back(struct list_head *head, |
4646 | struct request_queue *q) | |
4647 | { | |
4648 | struct blk_mq_qe_pair *qe; | |
4649 | struct elevator_type *t; | |
4650 | ||
4651 | qe = blk_lookup_qe_pair(head, q); | |
4652 | if (!qe) | |
4653 | return; | |
4654 | t = qe->type; | |
d48ece20 JW |
4655 | list_del(&qe->node); |
4656 | kfree(qe); | |
4657 | ||
4658 | mutex_lock(&q->sysfs_lock); | |
8237c01f | 4659 | elevator_switch(q, t); |
8ed40ee3 JC |
4660 | /* drop the reference acquired in blk_mq_elv_switch_none */ |
4661 | elevator_put(t); | |
d48ece20 JW |
4662 | mutex_unlock(&q->sysfs_lock); |
4663 | } | |
4664 | ||
e4dc2b32 KB |
4665 | static void __blk_mq_update_nr_hw_queues(struct blk_mq_tag_set *set, |
4666 | int nr_hw_queues) | |
868f2f0b KB |
4667 | { |
4668 | struct request_queue *q; | |
d48ece20 | 4669 | LIST_HEAD(head); |
e01ad46d | 4670 | int prev_nr_hw_queues; |
868f2f0b | 4671 | |
705cda97 BVA |
4672 | lockdep_assert_held(&set->tag_list_lock); |
4673 | ||
392546ae | 4674 | if (set->nr_maps == 1 && nr_hw_queues > nr_cpu_ids) |
868f2f0b | 4675 | nr_hw_queues = nr_cpu_ids; |
fe35ec58 WZ |
4676 | if (nr_hw_queues < 1) |
4677 | return; | |
4678 | if (set->nr_maps == 1 && nr_hw_queues == set->nr_hw_queues) | |
868f2f0b KB |
4679 | return; |
4680 | ||
4681 | list_for_each_entry(q, &set->tag_list, tag_set_list) | |
4682 | blk_mq_freeze_queue(q); | |
d48ece20 JW |
4683 | /* |
4684 | * Switch IO scheduler to 'none', cleaning up the data associated | |
4685 | * with the previous scheduler. We will switch back once we are done | |
4686 | * updating the new sw to hw queue mappings. | |
4687 | */ | |
4688 | list_for_each_entry(q, &set->tag_list, tag_set_list) | |
4689 | if (!blk_mq_elv_switch_none(&head, q)) | |
4690 | goto switch_back; | |
868f2f0b | 4691 | |
477e19de JW |
4692 | list_for_each_entry(q, &set->tag_list, tag_set_list) { |
4693 | blk_mq_debugfs_unregister_hctxs(q); | |
eaa870f9 | 4694 | blk_mq_sysfs_unregister_hctxs(q); |
477e19de JW |
4695 | } |
4696 | ||
a2584e43 | 4697 | prev_nr_hw_queues = set->nr_hw_queues; |
ee9d5521 | 4698 | if (blk_mq_realloc_tag_set_tags(set, nr_hw_queues) < 0) |
f7e76dbc BVA |
4699 | goto reregister; |
4700 | ||
e01ad46d | 4701 | fallback: |
aa880ad6 | 4702 | blk_mq_update_queue_map(set); |
868f2f0b KB |
4703 | list_for_each_entry(q, &set->tag_list, tag_set_list) { |
4704 | blk_mq_realloc_hw_ctxs(set, q); | |
42ee3061 | 4705 | blk_mq_update_poll_flag(q); |
e01ad46d | 4706 | if (q->nr_hw_queues != set->nr_hw_queues) { |
a846a8e6 YB |
4707 | int i = prev_nr_hw_queues; |
4708 | ||
e01ad46d JW |
4709 | pr_warn("Increasing nr_hw_queues to %d fails, fallback to %d\n", |
4710 | nr_hw_queues, prev_nr_hw_queues); | |
a846a8e6 YB |
4711 | for (; i < set->nr_hw_queues; i++) |
4712 | __blk_mq_free_map_and_rqs(set, i); | |
4713 | ||
e01ad46d | 4714 | set->nr_hw_queues = prev_nr_hw_queues; |
7d76f856 | 4715 | blk_mq_map_queues(&set->map[HCTX_TYPE_DEFAULT]); |
e01ad46d JW |
4716 | goto fallback; |
4717 | } | |
477e19de JW |
4718 | blk_mq_map_swqueue(q); |
4719 | } | |
4720 | ||
f7e76dbc | 4721 | reregister: |
477e19de | 4722 | list_for_each_entry(q, &set->tag_list, tag_set_list) { |
eaa870f9 | 4723 | blk_mq_sysfs_register_hctxs(q); |
477e19de | 4724 | blk_mq_debugfs_register_hctxs(q); |
868f2f0b KB |
4725 | } |
4726 | ||
d48ece20 JW |
4727 | switch_back: |
4728 | list_for_each_entry(q, &set->tag_list, tag_set_list) | |
4729 | blk_mq_elv_switch_back(&head, q); | |
4730 | ||
868f2f0b KB |
4731 | list_for_each_entry(q, &set->tag_list, tag_set_list) |
4732 | blk_mq_unfreeze_queue(q); | |
4733 | } | |
e4dc2b32 KB |
4734 | |
4735 | void blk_mq_update_nr_hw_queues(struct blk_mq_tag_set *set, int nr_hw_queues) | |
4736 | { | |
4737 | mutex_lock(&set->tag_list_lock); | |
4738 | __blk_mq_update_nr_hw_queues(set, nr_hw_queues); | |
4739 | mutex_unlock(&set->tag_list_lock); | |
4740 | } | |
868f2f0b KB |
4741 | EXPORT_SYMBOL_GPL(blk_mq_update_nr_hw_queues); |
4742 | ||
54bdd67d KB |
4743 | int blk_mq_poll(struct request_queue *q, blk_qc_t cookie, struct io_comp_batch *iob, |
4744 | unsigned int flags) | |
bbd7bb70 | 4745 | { |
c6699d6f CH |
4746 | struct blk_mq_hw_ctx *hctx = blk_qc_to_hctx(q, cookie); |
4747 | long state = get_current_state(); | |
4748 | int ret; | |
bbd7bb70 | 4749 | |
aa61bec3 | 4750 | do { |
5a72e899 | 4751 | ret = q->mq_ops->poll(hctx, iob); |
bbd7bb70 | 4752 | if (ret > 0) { |
849a3700 | 4753 | __set_current_state(TASK_RUNNING); |
85f4d4b6 | 4754 | return ret; |
bbd7bb70 JA |
4755 | } |
4756 | ||
4757 | if (signal_pending_state(state, current)) | |
849a3700 | 4758 | __set_current_state(TASK_RUNNING); |
b03fbd4f | 4759 | if (task_is_running(current)) |
85f4d4b6 | 4760 | return 1; |
c6699d6f | 4761 | |
ef99b2d3 | 4762 | if (ret < 0 || (flags & BLK_POLL_ONESHOT)) |
bbd7bb70 JA |
4763 | break; |
4764 | cpu_relax(); | |
aa61bec3 | 4765 | } while (!need_resched()); |
bbd7bb70 | 4766 | |
67b4110f | 4767 | __set_current_state(TASK_RUNNING); |
85f4d4b6 | 4768 | return 0; |
bbd7bb70 | 4769 | } |
1052b8ac | 4770 | |
9cf2bab6 JA |
4771 | unsigned int blk_mq_rq_cpu(struct request *rq) |
4772 | { | |
4773 | return rq->mq_ctx->cpu; | |
4774 | } | |
4775 | EXPORT_SYMBOL(blk_mq_rq_cpu); | |
4776 | ||
2a19b28f ML |
4777 | void blk_mq_cancel_work_sync(struct request_queue *q) |
4778 | { | |
219cf43c JC |
4779 | struct blk_mq_hw_ctx *hctx; |
4780 | unsigned long i; | |
2a19b28f | 4781 | |
219cf43c | 4782 | cancel_delayed_work_sync(&q->requeue_work); |
2a19b28f | 4783 | |
219cf43c JC |
4784 | queue_for_each_hw_ctx(q, hctx, i) |
4785 | cancel_delayed_work_sync(&hctx->run_work); | |
2a19b28f ML |
4786 | } |
4787 | ||
320ae51f JA |
4788 | static int __init blk_mq_init(void) |
4789 | { | |
c3077b5d CH |
4790 | int i; |
4791 | ||
4792 | for_each_possible_cpu(i) | |
f9ab4918 | 4793 | init_llist_head(&per_cpu(blk_cpu_done, i)); |
c3077b5d CH |
4794 | open_softirq(BLOCK_SOFTIRQ, blk_done_softirq); |
4795 | ||
4796 | cpuhp_setup_state_nocalls(CPUHP_BLOCK_SOFTIRQ_DEAD, | |
4797 | "block/softirq:dead", NULL, | |
4798 | blk_softirq_cpu_dead); | |
9467f859 TG |
4799 | cpuhp_setup_state_multi(CPUHP_BLK_MQ_DEAD, "block/mq:dead", NULL, |
4800 | blk_mq_hctx_notify_dead); | |
bf0beec0 ML |
4801 | cpuhp_setup_state_multi(CPUHP_AP_BLK_MQ_ONLINE, "block/mq:online", |
4802 | blk_mq_hctx_notify_online, | |
4803 | blk_mq_hctx_notify_offline); | |
320ae51f JA |
4804 | return 0; |
4805 | } | |
4806 | subsys_initcall(blk_mq_init); |