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