]>
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> | |
f75782e4 | 13 | #include <linux/kmemleak.h> |
320ae51f JA |
14 | #include <linux/mm.h> |
15 | #include <linux/init.h> | |
16 | #include <linux/slab.h> | |
17 | #include <linux/workqueue.h> | |
18 | #include <linux/smp.h> | |
19 | #include <linux/llist.h> | |
20 | #include <linux/list_sort.h> | |
21 | #include <linux/cpu.h> | |
22 | #include <linux/cache.h> | |
23 | #include <linux/sched/sysctl.h> | |
105ab3d8 | 24 | #include <linux/sched/topology.h> |
174cd4b1 | 25 | #include <linux/sched/signal.h> |
320ae51f | 26 | #include <linux/delay.h> |
aedcd72f | 27 | #include <linux/crash_dump.h> |
88c7b2b7 | 28 | #include <linux/prefetch.h> |
a892c8d5 | 29 | #include <linux/blk-crypto.h> |
320ae51f JA |
30 | |
31 | #include <trace/events/block.h> | |
32 | ||
33 | #include <linux/blk-mq.h> | |
54d4e6ab | 34 | #include <linux/t10-pi.h> |
320ae51f JA |
35 | #include "blk.h" |
36 | #include "blk-mq.h" | |
9c1051aa | 37 | #include "blk-mq-debugfs.h" |
320ae51f | 38 | #include "blk-mq-tag.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" |
320ae51f | 43 | |
c3077b5d CH |
44 | static DEFINE_PER_CPU(struct list_head, blk_cpu_done); |
45 | ||
34dbad5d OS |
46 | static void blk_mq_poll_stats_start(struct request_queue *q); |
47 | static void blk_mq_poll_stats_fn(struct blk_stat_callback *cb); | |
48 | ||
720b8ccc SB |
49 | static int blk_mq_poll_stats_bkt(const struct request *rq) |
50 | { | |
3d244306 | 51 | int ddir, sectors, bucket; |
720b8ccc | 52 | |
99c749a4 | 53 | ddir = rq_data_dir(rq); |
3d244306 | 54 | sectors = blk_rq_stats_sectors(rq); |
720b8ccc | 55 | |
3d244306 | 56 | bucket = ddir + 2 * ilog2(sectors); |
720b8ccc SB |
57 | |
58 | if (bucket < 0) | |
59 | return -1; | |
60 | else if (bucket >= BLK_MQ_POLL_STATS_BKTS) | |
61 | return ddir + BLK_MQ_POLL_STATS_BKTS - 2; | |
62 | ||
63 | return bucket; | |
64 | } | |
65 | ||
320ae51f | 66 | /* |
85fae294 YY |
67 | * Check if any of the ctx, dispatch list or elevator |
68 | * have pending work in this hardware queue. | |
320ae51f | 69 | */ |
79f720a7 | 70 | static bool blk_mq_hctx_has_pending(struct blk_mq_hw_ctx *hctx) |
320ae51f | 71 | { |
79f720a7 JA |
72 | return !list_empty_careful(&hctx->dispatch) || |
73 | sbitmap_any_bit_set(&hctx->ctx_map) || | |
bd166ef1 | 74 | blk_mq_sched_has_work(hctx); |
1429d7c9 JA |
75 | } |
76 | ||
320ae51f JA |
77 | /* |
78 | * Mark this ctx as having pending work in this hardware queue | |
79 | */ | |
80 | static void blk_mq_hctx_mark_pending(struct blk_mq_hw_ctx *hctx, | |
81 | struct blk_mq_ctx *ctx) | |
82 | { | |
f31967f0 JA |
83 | const int bit = ctx->index_hw[hctx->type]; |
84 | ||
85 | if (!sbitmap_test_bit(&hctx->ctx_map, bit)) | |
86 | sbitmap_set_bit(&hctx->ctx_map, bit); | |
1429d7c9 JA |
87 | } |
88 | ||
89 | static void blk_mq_hctx_clear_pending(struct blk_mq_hw_ctx *hctx, | |
90 | struct blk_mq_ctx *ctx) | |
91 | { | |
f31967f0 JA |
92 | const int bit = ctx->index_hw[hctx->type]; |
93 | ||
94 | sbitmap_clear_bit(&hctx->ctx_map, bit); | |
320ae51f JA |
95 | } |
96 | ||
f299b7c7 JA |
97 | struct mq_inflight { |
98 | struct hd_struct *part; | |
a2e80f6f | 99 | unsigned int inflight[2]; |
f299b7c7 JA |
100 | }; |
101 | ||
7baa8572 | 102 | static bool blk_mq_check_inflight(struct blk_mq_hw_ctx *hctx, |
f299b7c7 JA |
103 | struct request *rq, void *priv, |
104 | bool reserved) | |
105 | { | |
106 | struct mq_inflight *mi = priv; | |
107 | ||
a926c7af | 108 | if (rq->part == mi->part && blk_mq_rq_state(rq) == MQ_RQ_IN_FLIGHT) |
bb4e6b14 | 109 | mi->inflight[rq_data_dir(rq)]++; |
7baa8572 JA |
110 | |
111 | return true; | |
f299b7c7 JA |
112 | } |
113 | ||
e016b782 | 114 | unsigned int blk_mq_in_flight(struct request_queue *q, struct hd_struct *part) |
f299b7c7 | 115 | { |
a2e80f6f | 116 | struct mq_inflight mi = { .part = part }; |
f299b7c7 | 117 | |
f299b7c7 | 118 | blk_mq_queue_tag_busy_iter(q, blk_mq_check_inflight, &mi); |
e016b782 | 119 | |
a2e80f6f | 120 | return mi.inflight[0] + mi.inflight[1]; |
bf0ddaba OS |
121 | } |
122 | ||
123 | void blk_mq_in_flight_rw(struct request_queue *q, struct hd_struct *part, | |
124 | unsigned int inflight[2]) | |
125 | { | |
a2e80f6f | 126 | struct mq_inflight mi = { .part = part }; |
bf0ddaba | 127 | |
bb4e6b14 | 128 | blk_mq_queue_tag_busy_iter(q, blk_mq_check_inflight, &mi); |
a2e80f6f PB |
129 | inflight[0] = mi.inflight[0]; |
130 | inflight[1] = mi.inflight[1]; | |
bf0ddaba OS |
131 | } |
132 | ||
1671d522 | 133 | void blk_freeze_queue_start(struct request_queue *q) |
43a5e4e2 | 134 | { |
7996a8b5 BL |
135 | mutex_lock(&q->mq_freeze_lock); |
136 | if (++q->mq_freeze_depth == 1) { | |
3ef28e83 | 137 | percpu_ref_kill(&q->q_usage_counter); |
7996a8b5 | 138 | mutex_unlock(&q->mq_freeze_lock); |
344e9ffc | 139 | if (queue_is_mq(q)) |
055f6e18 | 140 | blk_mq_run_hw_queues(q, false); |
7996a8b5 BL |
141 | } else { |
142 | mutex_unlock(&q->mq_freeze_lock); | |
cddd5d17 | 143 | } |
f3af020b | 144 | } |
1671d522 | 145 | EXPORT_SYMBOL_GPL(blk_freeze_queue_start); |
f3af020b | 146 | |
6bae363e | 147 | void blk_mq_freeze_queue_wait(struct request_queue *q) |
f3af020b | 148 | { |
3ef28e83 | 149 | wait_event(q->mq_freeze_wq, percpu_ref_is_zero(&q->q_usage_counter)); |
43a5e4e2 | 150 | } |
6bae363e | 151 | EXPORT_SYMBOL_GPL(blk_mq_freeze_queue_wait); |
43a5e4e2 | 152 | |
f91328c4 KB |
153 | int blk_mq_freeze_queue_wait_timeout(struct request_queue *q, |
154 | unsigned long timeout) | |
155 | { | |
156 | return wait_event_timeout(q->mq_freeze_wq, | |
157 | percpu_ref_is_zero(&q->q_usage_counter), | |
158 | timeout); | |
159 | } | |
160 | EXPORT_SYMBOL_GPL(blk_mq_freeze_queue_wait_timeout); | |
43a5e4e2 | 161 | |
f3af020b TH |
162 | /* |
163 | * Guarantee no request is in use, so we can change any data structure of | |
164 | * the queue afterward. | |
165 | */ | |
3ef28e83 | 166 | void blk_freeze_queue(struct request_queue *q) |
f3af020b | 167 | { |
3ef28e83 DW |
168 | /* |
169 | * In the !blk_mq case we are only calling this to kill the | |
170 | * q_usage_counter, otherwise this increases the freeze depth | |
171 | * and waits for it to return to zero. For this reason there is | |
172 | * no blk_unfreeze_queue(), and blk_freeze_queue() is not | |
173 | * exported to drivers as the only user for unfreeze is blk_mq. | |
174 | */ | |
1671d522 | 175 | blk_freeze_queue_start(q); |
f3af020b TH |
176 | blk_mq_freeze_queue_wait(q); |
177 | } | |
3ef28e83 DW |
178 | |
179 | void blk_mq_freeze_queue(struct request_queue *q) | |
180 | { | |
181 | /* | |
182 | * ...just an alias to keep freeze and unfreeze actions balanced | |
183 | * in the blk_mq_* namespace | |
184 | */ | |
185 | blk_freeze_queue(q); | |
186 | } | |
c761d96b | 187 | EXPORT_SYMBOL_GPL(blk_mq_freeze_queue); |
f3af020b | 188 | |
b4c6a028 | 189 | void blk_mq_unfreeze_queue(struct request_queue *q) |
320ae51f | 190 | { |
7996a8b5 BL |
191 | mutex_lock(&q->mq_freeze_lock); |
192 | q->mq_freeze_depth--; | |
193 | WARN_ON_ONCE(q->mq_freeze_depth < 0); | |
194 | if (!q->mq_freeze_depth) { | |
bdd63160 | 195 | percpu_ref_resurrect(&q->q_usage_counter); |
320ae51f | 196 | wake_up_all(&q->mq_freeze_wq); |
add703fd | 197 | } |
7996a8b5 | 198 | mutex_unlock(&q->mq_freeze_lock); |
320ae51f | 199 | } |
b4c6a028 | 200 | EXPORT_SYMBOL_GPL(blk_mq_unfreeze_queue); |
320ae51f | 201 | |
852ec809 BVA |
202 | /* |
203 | * FIXME: replace the scsi_internal_device_*block_nowait() calls in the | |
204 | * mpt3sas driver such that this function can be removed. | |
205 | */ | |
206 | void blk_mq_quiesce_queue_nowait(struct request_queue *q) | |
207 | { | |
8814ce8a | 208 | blk_queue_flag_set(QUEUE_FLAG_QUIESCED, q); |
852ec809 BVA |
209 | } |
210 | EXPORT_SYMBOL_GPL(blk_mq_quiesce_queue_nowait); | |
211 | ||
6a83e74d | 212 | /** |
69e07c4a | 213 | * blk_mq_quiesce_queue() - wait until all ongoing dispatches have finished |
6a83e74d BVA |
214 | * @q: request queue. |
215 | * | |
216 | * Note: this function does not prevent that the struct request end_io() | |
69e07c4a ML |
217 | * callback function is invoked. Once this function is returned, we make |
218 | * sure no dispatch can happen until the queue is unquiesced via | |
219 | * blk_mq_unquiesce_queue(). | |
6a83e74d BVA |
220 | */ |
221 | void blk_mq_quiesce_queue(struct request_queue *q) | |
222 | { | |
223 | struct blk_mq_hw_ctx *hctx; | |
224 | unsigned int i; | |
225 | bool rcu = false; | |
226 | ||
1d9e9bc6 | 227 | blk_mq_quiesce_queue_nowait(q); |
f4560ffe | 228 | |
6a83e74d BVA |
229 | queue_for_each_hw_ctx(q, hctx, i) { |
230 | if (hctx->flags & BLK_MQ_F_BLOCKING) | |
05707b64 | 231 | synchronize_srcu(hctx->srcu); |
6a83e74d BVA |
232 | else |
233 | rcu = true; | |
234 | } | |
235 | if (rcu) | |
236 | synchronize_rcu(); | |
237 | } | |
238 | EXPORT_SYMBOL_GPL(blk_mq_quiesce_queue); | |
239 | ||
e4e73913 ML |
240 | /* |
241 | * blk_mq_unquiesce_queue() - counterpart of blk_mq_quiesce_queue() | |
242 | * @q: request queue. | |
243 | * | |
244 | * This function recovers queue into the state before quiescing | |
245 | * which is done by blk_mq_quiesce_queue. | |
246 | */ | |
247 | void blk_mq_unquiesce_queue(struct request_queue *q) | |
248 | { | |
8814ce8a | 249 | blk_queue_flag_clear(QUEUE_FLAG_QUIESCED, q); |
f4560ffe | 250 | |
1d9e9bc6 ML |
251 | /* dispatch requests which are inserted during quiescing */ |
252 | blk_mq_run_hw_queues(q, true); | |
e4e73913 ML |
253 | } |
254 | EXPORT_SYMBOL_GPL(blk_mq_unquiesce_queue); | |
255 | ||
aed3ea94 JA |
256 | void blk_mq_wake_waiters(struct request_queue *q) |
257 | { | |
258 | struct blk_mq_hw_ctx *hctx; | |
259 | unsigned int i; | |
260 | ||
261 | queue_for_each_hw_ctx(q, hctx, i) | |
262 | if (blk_mq_hw_queue_mapped(hctx)) | |
263 | blk_mq_tag_wakeup_all(hctx->tags, true); | |
264 | } | |
265 | ||
fe1f4526 | 266 | /* |
9a91b05b HT |
267 | * Only need start/end time stamping if we have iostat or |
268 | * blk stats enabled, or using an IO scheduler. | |
fe1f4526 JA |
269 | */ |
270 | static inline bool blk_mq_need_time_stamp(struct request *rq) | |
271 | { | |
9a91b05b | 272 | return (rq->rq_flags & (RQF_IO_STAT | RQF_STATS)) || rq->q->elevator; |
fe1f4526 JA |
273 | } |
274 | ||
e4cdf1a1 | 275 | static struct request *blk_mq_rq_ctx_init(struct blk_mq_alloc_data *data, |
7ea4d8a4 | 276 | unsigned int tag, u64 alloc_time_ns) |
320ae51f | 277 | { |
e4cdf1a1 CH |
278 | struct blk_mq_tags *tags = blk_mq_tags_from_data(data); |
279 | struct request *rq = tags->static_rqs[tag]; | |
c3a148d2 | 280 | |
42fdc5e4 | 281 | if (data->q->elevator) { |
76647368 | 282 | rq->tag = BLK_MQ_NO_TAG; |
e4cdf1a1 CH |
283 | rq->internal_tag = tag; |
284 | } else { | |
e4cdf1a1 | 285 | rq->tag = tag; |
76647368 | 286 | rq->internal_tag = BLK_MQ_NO_TAG; |
e4cdf1a1 CH |
287 | } |
288 | ||
af76e555 | 289 | /* csd/requeue_work/fifo_time is initialized before use */ |
e4cdf1a1 CH |
290 | rq->q = data->q; |
291 | rq->mq_ctx = data->ctx; | |
ea4f995e | 292 | rq->mq_hctx = data->hctx; |
568f2700 | 293 | rq->rq_flags = 0; |
7ea4d8a4 | 294 | rq->cmd_flags = data->cmd_flags; |
1b6d65a0 BVA |
295 | if (data->flags & BLK_MQ_REQ_PREEMPT) |
296 | rq->rq_flags |= RQF_PREEMPT; | |
e4cdf1a1 | 297 | if (blk_queue_io_stat(data->q)) |
e8064021 | 298 | rq->rq_flags |= RQF_IO_STAT; |
7c3fb70f | 299 | INIT_LIST_HEAD(&rq->queuelist); |
af76e555 CH |
300 | INIT_HLIST_NODE(&rq->hash); |
301 | RB_CLEAR_NODE(&rq->rb_node); | |
af76e555 CH |
302 | rq->rq_disk = NULL; |
303 | rq->part = NULL; | |
6f816b4b TH |
304 | #ifdef CONFIG_BLK_RQ_ALLOC_TIME |
305 | rq->alloc_time_ns = alloc_time_ns; | |
306 | #endif | |
fe1f4526 JA |
307 | if (blk_mq_need_time_stamp(rq)) |
308 | rq->start_time_ns = ktime_get_ns(); | |
309 | else | |
310 | rq->start_time_ns = 0; | |
544ccc8d | 311 | rq->io_start_time_ns = 0; |
3d244306 | 312 | rq->stats_sectors = 0; |
af76e555 CH |
313 | rq->nr_phys_segments = 0; |
314 | #if defined(CONFIG_BLK_DEV_INTEGRITY) | |
315 | rq->nr_integrity_segments = 0; | |
316 | #endif | |
a892c8d5 | 317 | blk_crypto_rq_set_defaults(rq); |
af76e555 | 318 | /* tag was already set */ |
079076b3 | 319 | WRITE_ONCE(rq->deadline, 0); |
af76e555 | 320 | |
f6be4fb4 JA |
321 | rq->timeout = 0; |
322 | ||
af76e555 CH |
323 | rq->end_io = NULL; |
324 | rq->end_io_data = NULL; | |
af76e555 | 325 | |
7ea4d8a4 | 326 | data->ctx->rq_dispatched[op_is_sync(data->cmd_flags)]++; |
12f5b931 | 327 | refcount_set(&rq->ref, 1); |
7ea4d8a4 CH |
328 | |
329 | if (!op_is_flush(data->cmd_flags)) { | |
330 | struct elevator_queue *e = data->q->elevator; | |
331 | ||
332 | rq->elv.icq = NULL; | |
333 | if (e && e->type->ops.prepare_request) { | |
334 | if (e->type->icq_cache) | |
335 | blk_mq_sched_assign_ioc(rq); | |
336 | ||
337 | e->type->ops.prepare_request(rq); | |
338 | rq->rq_flags |= RQF_ELVPRIV; | |
339 | } | |
340 | } | |
341 | ||
342 | data->hctx->queued++; | |
e4cdf1a1 | 343 | return rq; |
5dee8577 CH |
344 | } |
345 | ||
e6e7abff | 346 | static struct request *__blk_mq_alloc_request(struct blk_mq_alloc_data *data) |
d2c0d383 | 347 | { |
e6e7abff | 348 | struct request_queue *q = data->q; |
d2c0d383 | 349 | struct elevator_queue *e = q->elevator; |
6f816b4b | 350 | u64 alloc_time_ns = 0; |
600c3b0c | 351 | unsigned int tag; |
d2c0d383 | 352 | |
6f816b4b TH |
353 | /* alloc_time includes depth and tag waits */ |
354 | if (blk_queue_rq_alloc_time(q)) | |
355 | alloc_time_ns = ktime_get_ns(); | |
356 | ||
f9afca4d | 357 | if (data->cmd_flags & REQ_NOWAIT) |
03a07c92 | 358 | data->flags |= BLK_MQ_REQ_NOWAIT; |
d2c0d383 CH |
359 | |
360 | if (e) { | |
d2c0d383 CH |
361 | /* |
362 | * Flush requests are special and go directly to the | |
17a51199 JA |
363 | * dispatch list. Don't include reserved tags in the |
364 | * limiting, as it isn't useful. | |
d2c0d383 | 365 | */ |
f9afca4d JA |
366 | if (!op_is_flush(data->cmd_flags) && |
367 | e->type->ops.limit_depth && | |
17a51199 | 368 | !(data->flags & BLK_MQ_REQ_RESERVED)) |
f9afca4d | 369 | e->type->ops.limit_depth(data->cmd_flags, data); |
d2c0d383 CH |
370 | } |
371 | ||
bf0beec0 | 372 | retry: |
600c3b0c CH |
373 | data->ctx = blk_mq_get_ctx(q); |
374 | data->hctx = blk_mq_map_queue(q, data->cmd_flags, data->ctx); | |
42fdc5e4 | 375 | if (!e) |
600c3b0c CH |
376 | blk_mq_tag_busy(data->hctx); |
377 | ||
bf0beec0 ML |
378 | /* |
379 | * Waiting allocations only fail because of an inactive hctx. In that | |
380 | * case just retry the hctx assignment and tag allocation as CPU hotplug | |
381 | * should have migrated us to an online CPU by now. | |
382 | */ | |
e4cdf1a1 | 383 | tag = blk_mq_get_tag(data); |
bf0beec0 ML |
384 | if (tag == BLK_MQ_NO_TAG) { |
385 | if (data->flags & BLK_MQ_REQ_NOWAIT) | |
386 | return NULL; | |
387 | ||
388 | /* | |
389 | * Give up the CPU and sleep for a random short time to ensure | |
390 | * that thread using a realtime scheduling class are migrated | |
70f15a4f | 391 | * off the CPU, and thus off the hctx that is going away. |
bf0beec0 ML |
392 | */ |
393 | msleep(3); | |
394 | goto retry; | |
395 | } | |
7ea4d8a4 | 396 | return blk_mq_rq_ctx_init(data, tag, alloc_time_ns); |
d2c0d383 CH |
397 | } |
398 | ||
cd6ce148 | 399 | struct request *blk_mq_alloc_request(struct request_queue *q, unsigned int op, |
9a95e4ef | 400 | blk_mq_req_flags_t flags) |
320ae51f | 401 | { |
e6e7abff CH |
402 | struct blk_mq_alloc_data data = { |
403 | .q = q, | |
404 | .flags = flags, | |
405 | .cmd_flags = op, | |
406 | }; | |
bd166ef1 | 407 | struct request *rq; |
a492f075 | 408 | int ret; |
320ae51f | 409 | |
3a0a5299 | 410 | ret = blk_queue_enter(q, flags); |
a492f075 JL |
411 | if (ret) |
412 | return ERR_PTR(ret); | |
320ae51f | 413 | |
e6e7abff | 414 | rq = __blk_mq_alloc_request(&data); |
bd166ef1 | 415 | if (!rq) |
a5ea5811 | 416 | goto out_queue_exit; |
0c4de0f3 CH |
417 | rq->__data_len = 0; |
418 | rq->__sector = (sector_t) -1; | |
419 | rq->bio = rq->biotail = NULL; | |
320ae51f | 420 | return rq; |
a5ea5811 CH |
421 | out_queue_exit: |
422 | blk_queue_exit(q); | |
423 | return ERR_PTR(-EWOULDBLOCK); | |
320ae51f | 424 | } |
4bb659b1 | 425 | EXPORT_SYMBOL(blk_mq_alloc_request); |
320ae51f | 426 | |
cd6ce148 | 427 | struct request *blk_mq_alloc_request_hctx(struct request_queue *q, |
9a95e4ef | 428 | unsigned int op, blk_mq_req_flags_t flags, unsigned int hctx_idx) |
1f5bd336 | 429 | { |
e6e7abff CH |
430 | struct blk_mq_alloc_data data = { |
431 | .q = q, | |
432 | .flags = flags, | |
433 | .cmd_flags = op, | |
434 | }; | |
600c3b0c | 435 | u64 alloc_time_ns = 0; |
6d2809d5 | 436 | unsigned int cpu; |
600c3b0c | 437 | unsigned int tag; |
1f5bd336 ML |
438 | int ret; |
439 | ||
600c3b0c CH |
440 | /* alloc_time includes depth and tag waits */ |
441 | if (blk_queue_rq_alloc_time(q)) | |
442 | alloc_time_ns = ktime_get_ns(); | |
443 | ||
1f5bd336 ML |
444 | /* |
445 | * If the tag allocator sleeps we could get an allocation for a | |
446 | * different hardware context. No need to complicate the low level | |
447 | * allocator for this for the rare use case of a command tied to | |
448 | * a specific queue. | |
449 | */ | |
600c3b0c | 450 | if (WARN_ON_ONCE(!(flags & (BLK_MQ_REQ_NOWAIT | BLK_MQ_REQ_RESERVED)))) |
1f5bd336 ML |
451 | return ERR_PTR(-EINVAL); |
452 | ||
453 | if (hctx_idx >= q->nr_hw_queues) | |
454 | return ERR_PTR(-EIO); | |
455 | ||
3a0a5299 | 456 | ret = blk_queue_enter(q, flags); |
1f5bd336 ML |
457 | if (ret) |
458 | return ERR_PTR(ret); | |
459 | ||
c8712c6a CH |
460 | /* |
461 | * Check if the hardware context is actually mapped to anything. | |
462 | * If not tell the caller that it should skip this queue. | |
463 | */ | |
a5ea5811 | 464 | ret = -EXDEV; |
e6e7abff CH |
465 | data.hctx = q->queue_hw_ctx[hctx_idx]; |
466 | if (!blk_mq_hw_queue_mapped(data.hctx)) | |
a5ea5811 | 467 | goto out_queue_exit; |
e6e7abff CH |
468 | cpu = cpumask_first_and(data.hctx->cpumask, cpu_online_mask); |
469 | data.ctx = __blk_mq_get_ctx(q, cpu); | |
1f5bd336 | 470 | |
42fdc5e4 | 471 | if (!q->elevator) |
600c3b0c CH |
472 | blk_mq_tag_busy(data.hctx); |
473 | ||
a5ea5811 | 474 | ret = -EWOULDBLOCK; |
600c3b0c CH |
475 | tag = blk_mq_get_tag(&data); |
476 | if (tag == BLK_MQ_NO_TAG) | |
a5ea5811 | 477 | goto out_queue_exit; |
600c3b0c CH |
478 | return blk_mq_rq_ctx_init(&data, tag, alloc_time_ns); |
479 | ||
a5ea5811 CH |
480 | out_queue_exit: |
481 | blk_queue_exit(q); | |
482 | return ERR_PTR(ret); | |
1f5bd336 ML |
483 | } |
484 | EXPORT_SYMBOL_GPL(blk_mq_alloc_request_hctx); | |
485 | ||
12f5b931 KB |
486 | static void __blk_mq_free_request(struct request *rq) |
487 | { | |
488 | struct request_queue *q = rq->q; | |
489 | struct blk_mq_ctx *ctx = rq->mq_ctx; | |
ea4f995e | 490 | struct blk_mq_hw_ctx *hctx = rq->mq_hctx; |
12f5b931 KB |
491 | const int sched_tag = rq->internal_tag; |
492 | ||
a892c8d5 | 493 | blk_crypto_free_request(rq); |
986d413b | 494 | blk_pm_mark_last_busy(rq); |
ea4f995e | 495 | rq->mq_hctx = NULL; |
76647368 | 496 | if (rq->tag != BLK_MQ_NO_TAG) |
cae740a0 | 497 | blk_mq_put_tag(hctx->tags, ctx, rq->tag); |
76647368 | 498 | if (sched_tag != BLK_MQ_NO_TAG) |
cae740a0 | 499 | blk_mq_put_tag(hctx->sched_tags, ctx, sched_tag); |
12f5b931 KB |
500 | blk_mq_sched_restart(hctx); |
501 | blk_queue_exit(q); | |
502 | } | |
503 | ||
6af54051 | 504 | void blk_mq_free_request(struct request *rq) |
320ae51f | 505 | { |
320ae51f | 506 | struct request_queue *q = rq->q; |
6af54051 CH |
507 | struct elevator_queue *e = q->elevator; |
508 | struct blk_mq_ctx *ctx = rq->mq_ctx; | |
ea4f995e | 509 | struct blk_mq_hw_ctx *hctx = rq->mq_hctx; |
6af54051 | 510 | |
5bbf4e5a | 511 | if (rq->rq_flags & RQF_ELVPRIV) { |
f9cd4bfe JA |
512 | if (e && e->type->ops.finish_request) |
513 | e->type->ops.finish_request(rq); | |
6af54051 CH |
514 | if (rq->elv.icq) { |
515 | put_io_context(rq->elv.icq->ioc); | |
516 | rq->elv.icq = NULL; | |
517 | } | |
518 | } | |
320ae51f | 519 | |
6af54051 | 520 | ctx->rq_completed[rq_is_sync(rq)]++; |
e8064021 | 521 | if (rq->rq_flags & RQF_MQ_INFLIGHT) |
bccf5e26 | 522 | __blk_mq_dec_active_requests(hctx); |
87760e5e | 523 | |
7beb2f84 JA |
524 | if (unlikely(laptop_mode && !blk_rq_is_passthrough(rq))) |
525 | laptop_io_completion(q->backing_dev_info); | |
526 | ||
a7905043 | 527 | rq_qos_done(q, rq); |
0d2602ca | 528 | |
12f5b931 KB |
529 | WRITE_ONCE(rq->state, MQ_RQ_IDLE); |
530 | if (refcount_dec_and_test(&rq->ref)) | |
531 | __blk_mq_free_request(rq); | |
320ae51f | 532 | } |
1a3b595a | 533 | EXPORT_SYMBOL_GPL(blk_mq_free_request); |
320ae51f | 534 | |
2a842aca | 535 | inline void __blk_mq_end_request(struct request *rq, blk_status_t error) |
320ae51f | 536 | { |
fe1f4526 JA |
537 | u64 now = 0; |
538 | ||
539 | if (blk_mq_need_time_stamp(rq)) | |
540 | now = ktime_get_ns(); | |
522a7775 | 541 | |
4bc6339a OS |
542 | if (rq->rq_flags & RQF_STATS) { |
543 | blk_mq_poll_stats_start(rq->q); | |
522a7775 | 544 | blk_stat_add(rq, now); |
4bc6339a OS |
545 | } |
546 | ||
87890092 | 547 | blk_mq_sched_completed_request(rq, now); |
ed88660a | 548 | |
522a7775 | 549 | blk_account_io_done(rq, now); |
0d11e6ac | 550 | |
91b63639 | 551 | if (rq->end_io) { |
a7905043 | 552 | rq_qos_done(rq->q, rq); |
320ae51f | 553 | rq->end_io(rq, error); |
91b63639 | 554 | } else { |
320ae51f | 555 | blk_mq_free_request(rq); |
91b63639 | 556 | } |
320ae51f | 557 | } |
c8a446ad | 558 | EXPORT_SYMBOL(__blk_mq_end_request); |
63151a44 | 559 | |
2a842aca | 560 | void blk_mq_end_request(struct request *rq, blk_status_t error) |
63151a44 CH |
561 | { |
562 | if (blk_update_request(rq, error, blk_rq_bytes(rq))) | |
563 | BUG(); | |
c8a446ad | 564 | __blk_mq_end_request(rq, error); |
63151a44 | 565 | } |
c8a446ad | 566 | EXPORT_SYMBOL(blk_mq_end_request); |
320ae51f | 567 | |
c3077b5d CH |
568 | /* |
569 | * Softirq action handler - move entries to local list and loop over them | |
570 | * while passing them to the queue registered handler. | |
571 | */ | |
572 | static __latent_entropy void blk_done_softirq(struct softirq_action *h) | |
320ae51f | 573 | { |
c3077b5d | 574 | struct list_head *cpu_list, local_list; |
320ae51f | 575 | |
c3077b5d CH |
576 | local_irq_disable(); |
577 | cpu_list = this_cpu_ptr(&blk_cpu_done); | |
578 | list_replace_init(cpu_list, &local_list); | |
579 | local_irq_enable(); | |
580 | ||
581 | while (!list_empty(&local_list)) { | |
582 | struct request *rq; | |
583 | ||
584 | rq = list_entry(local_list.next, struct request, ipi_list); | |
585 | list_del_init(&rq->ipi_list); | |
586 | rq->q->mq_ops->complete(rq); | |
587 | } | |
320ae51f | 588 | } |
320ae51f | 589 | |
115243f5 | 590 | static void blk_mq_trigger_softirq(struct request *rq) |
320ae51f | 591 | { |
d391a7a3 CH |
592 | struct list_head *list; |
593 | unsigned long flags; | |
c3077b5d | 594 | |
d391a7a3 CH |
595 | local_irq_save(flags); |
596 | list = this_cpu_ptr(&blk_cpu_done); | |
c3077b5d CH |
597 | list_add_tail(&rq->ipi_list, list); |
598 | ||
115243f5 CH |
599 | /* |
600 | * If the list only contains our just added request, signal a raise of | |
601 | * the softirq. If there are already entries there, someone already | |
602 | * raised the irq but it hasn't run yet. | |
603 | */ | |
c3077b5d CH |
604 | if (list->next == &rq->ipi_list) |
605 | raise_softirq_irqoff(BLOCK_SOFTIRQ); | |
d391a7a3 | 606 | local_irq_restore(flags); |
115243f5 CH |
607 | } |
608 | ||
c3077b5d CH |
609 | static int blk_softirq_cpu_dead(unsigned int cpu) |
610 | { | |
611 | /* | |
612 | * If a CPU goes away, splice its entries to the current CPU | |
613 | * and trigger a run of the softirq | |
614 | */ | |
615 | local_irq_disable(); | |
616 | list_splice_init(&per_cpu(blk_cpu_done, cpu), | |
617 | this_cpu_ptr(&blk_cpu_done)); | |
618 | raise_softirq_irqoff(BLOCK_SOFTIRQ); | |
619 | local_irq_enable(); | |
620 | ||
621 | return 0; | |
622 | } | |
623 | ||
40d09b53 CH |
624 | |
625 | static void __blk_mq_complete_request_remote(void *data) | |
c3077b5d | 626 | { |
40d09b53 | 627 | struct request *rq = data; |
320ae51f | 628 | |
36e76539 | 629 | /* |
d391a7a3 CH |
630 | * For most of single queue controllers, there is only one irq vector |
631 | * for handling I/O completion, and the only irq's affinity is set | |
632 | * to all possible CPUs. On most of ARCHs, this affinity means the irq | |
633 | * is handled on one specific CPU. | |
36e76539 | 634 | * |
d391a7a3 CH |
635 | * So complete I/O requests in softirq context in case of single queue |
636 | * devices to avoid degrading I/O performance due to irqsoff latency. | |
36e76539 | 637 | */ |
d391a7a3 CH |
638 | if (rq->q->nr_hw_queues == 1) |
639 | blk_mq_trigger_softirq(rq); | |
640 | else | |
641 | rq->q->mq_ops->complete(rq); | |
c3077b5d CH |
642 | } |
643 | ||
96339526 CH |
644 | static inline bool blk_mq_complete_need_ipi(struct request *rq) |
645 | { | |
646 | int cpu = raw_smp_processor_id(); | |
647 | ||
648 | if (!IS_ENABLED(CONFIG_SMP) || | |
649 | !test_bit(QUEUE_FLAG_SAME_COMP, &rq->q->queue_flags)) | |
650 | return false; | |
651 | ||
652 | /* same CPU or cache domain? Complete locally */ | |
653 | if (cpu == rq->mq_ctx->cpu || | |
654 | (!test_bit(QUEUE_FLAG_SAME_FORCE, &rq->q->queue_flags) && | |
655 | cpus_share_cache(cpu, rq->mq_ctx->cpu))) | |
656 | return false; | |
657 | ||
658 | /* don't try to IPI to an offline CPU */ | |
659 | return cpu_online(rq->mq_ctx->cpu); | |
660 | } | |
661 | ||
40d09b53 | 662 | bool blk_mq_complete_request_remote(struct request *rq) |
320ae51f | 663 | { |
af78ff7c | 664 | WRITE_ONCE(rq->state, MQ_RQ_COMPLETE); |
36e76539 | 665 | |
4ab32bf3 JA |
666 | /* |
667 | * For a polled request, always complete locallly, it's pointless | |
668 | * to redirect the completion. | |
669 | */ | |
40d09b53 CH |
670 | if (rq->cmd_flags & REQ_HIPRI) |
671 | return false; | |
38535201 | 672 | |
96339526 | 673 | if (blk_mq_complete_need_ipi(rq)) { |
30a91cb4 | 674 | rq->csd.func = __blk_mq_complete_request_remote; |
3d6efbf6 CH |
675 | rq->csd.info = rq; |
676 | rq->csd.flags = 0; | |
96339526 | 677 | smp_call_function_single_async(rq->mq_ctx->cpu, &rq->csd); |
3d6efbf6 | 678 | } else { |
40d09b53 CH |
679 | if (rq->q->nr_hw_queues > 1) |
680 | return false; | |
681 | blk_mq_trigger_softirq(rq); | |
3d6efbf6 | 682 | } |
40d09b53 CH |
683 | |
684 | return true; | |
685 | } | |
686 | EXPORT_SYMBOL_GPL(blk_mq_complete_request_remote); | |
687 | ||
688 | /** | |
689 | * blk_mq_complete_request - end I/O on a request | |
690 | * @rq: the request being processed | |
691 | * | |
692 | * Description: | |
693 | * Complete a request by scheduling the ->complete_rq operation. | |
694 | **/ | |
695 | void blk_mq_complete_request(struct request *rq) | |
696 | { | |
697 | if (!blk_mq_complete_request_remote(rq)) | |
698 | rq->q->mq_ops->complete(rq); | |
320ae51f | 699 | } |
15f73f5b | 700 | EXPORT_SYMBOL(blk_mq_complete_request); |
30a91cb4 | 701 | |
04ced159 | 702 | static void hctx_unlock(struct blk_mq_hw_ctx *hctx, int srcu_idx) |
b7435db8 | 703 | __releases(hctx->srcu) |
04ced159 JA |
704 | { |
705 | if (!(hctx->flags & BLK_MQ_F_BLOCKING)) | |
706 | rcu_read_unlock(); | |
707 | else | |
05707b64 | 708 | srcu_read_unlock(hctx->srcu, srcu_idx); |
04ced159 JA |
709 | } |
710 | ||
711 | static void hctx_lock(struct blk_mq_hw_ctx *hctx, int *srcu_idx) | |
b7435db8 | 712 | __acquires(hctx->srcu) |
04ced159 | 713 | { |
08b5a6e2 JA |
714 | if (!(hctx->flags & BLK_MQ_F_BLOCKING)) { |
715 | /* shut up gcc false positive */ | |
716 | *srcu_idx = 0; | |
04ced159 | 717 | rcu_read_lock(); |
08b5a6e2 | 718 | } else |
05707b64 | 719 | *srcu_idx = srcu_read_lock(hctx->srcu); |
04ced159 JA |
720 | } |
721 | ||
105663f7 AA |
722 | /** |
723 | * blk_mq_start_request - Start processing a request | |
724 | * @rq: Pointer to request to be started | |
725 | * | |
726 | * Function used by device drivers to notify the block layer that a request | |
727 | * is going to be processed now, so blk layer can do proper initializations | |
728 | * such as starting the timeout timer. | |
729 | */ | |
e2490073 | 730 | void blk_mq_start_request(struct request *rq) |
320ae51f JA |
731 | { |
732 | struct request_queue *q = rq->q; | |
733 | ||
734 | trace_block_rq_issue(q, rq); | |
735 | ||
cf43e6be | 736 | if (test_bit(QUEUE_FLAG_STATS, &q->queue_flags)) { |
544ccc8d | 737 | rq->io_start_time_ns = ktime_get_ns(); |
3d244306 | 738 | rq->stats_sectors = blk_rq_sectors(rq); |
cf43e6be | 739 | rq->rq_flags |= RQF_STATS; |
a7905043 | 740 | rq_qos_issue(q, rq); |
cf43e6be JA |
741 | } |
742 | ||
1d9bd516 | 743 | WARN_ON_ONCE(blk_mq_rq_state(rq) != MQ_RQ_IDLE); |
538b7534 | 744 | |
1d9bd516 | 745 | blk_add_timer(rq); |
12f5b931 | 746 | WRITE_ONCE(rq->state, MQ_RQ_IN_FLIGHT); |
49f5baa5 | 747 | |
54d4e6ab MG |
748 | #ifdef CONFIG_BLK_DEV_INTEGRITY |
749 | if (blk_integrity_rq(rq) && req_op(rq) == REQ_OP_WRITE) | |
750 | q->integrity.profile->prepare_fn(rq); | |
751 | #endif | |
320ae51f | 752 | } |
e2490073 | 753 | EXPORT_SYMBOL(blk_mq_start_request); |
320ae51f | 754 | |
ed0791b2 | 755 | static void __blk_mq_requeue_request(struct request *rq) |
320ae51f JA |
756 | { |
757 | struct request_queue *q = rq->q; | |
758 | ||
923218f6 ML |
759 | blk_mq_put_driver_tag(rq); |
760 | ||
320ae51f | 761 | trace_block_rq_requeue(q, rq); |
a7905043 | 762 | rq_qos_requeue(q, rq); |
49f5baa5 | 763 | |
12f5b931 KB |
764 | if (blk_mq_request_started(rq)) { |
765 | WRITE_ONCE(rq->state, MQ_RQ_IDLE); | |
da661267 | 766 | rq->rq_flags &= ~RQF_TIMED_OUT; |
e2490073 | 767 | } |
320ae51f JA |
768 | } |
769 | ||
2b053aca | 770 | void blk_mq_requeue_request(struct request *rq, bool kick_requeue_list) |
ed0791b2 | 771 | { |
ed0791b2 | 772 | __blk_mq_requeue_request(rq); |
ed0791b2 | 773 | |
105976f5 ML |
774 | /* this request will be re-inserted to io scheduler queue */ |
775 | blk_mq_sched_requeue_request(rq); | |
776 | ||
7d692330 | 777 | BUG_ON(!list_empty(&rq->queuelist)); |
2b053aca | 778 | blk_mq_add_to_requeue_list(rq, true, kick_requeue_list); |
ed0791b2 CH |
779 | } |
780 | EXPORT_SYMBOL(blk_mq_requeue_request); | |
781 | ||
6fca6a61 CH |
782 | static void blk_mq_requeue_work(struct work_struct *work) |
783 | { | |
784 | struct request_queue *q = | |
2849450a | 785 | container_of(work, struct request_queue, requeue_work.work); |
6fca6a61 CH |
786 | LIST_HEAD(rq_list); |
787 | struct request *rq, *next; | |
6fca6a61 | 788 | |
18e9781d | 789 | spin_lock_irq(&q->requeue_lock); |
6fca6a61 | 790 | list_splice_init(&q->requeue_list, &rq_list); |
18e9781d | 791 | spin_unlock_irq(&q->requeue_lock); |
6fca6a61 CH |
792 | |
793 | list_for_each_entry_safe(rq, next, &rq_list, queuelist) { | |
aef1897c | 794 | if (!(rq->rq_flags & (RQF_SOFTBARRIER | RQF_DONTPREP))) |
6fca6a61 CH |
795 | continue; |
796 | ||
e8064021 | 797 | rq->rq_flags &= ~RQF_SOFTBARRIER; |
6fca6a61 | 798 | list_del_init(&rq->queuelist); |
aef1897c JW |
799 | /* |
800 | * If RQF_DONTPREP, rq has contained some driver specific | |
801 | * data, so insert it to hctx dispatch list to avoid any | |
802 | * merge. | |
803 | */ | |
804 | if (rq->rq_flags & RQF_DONTPREP) | |
01e99aec | 805 | blk_mq_request_bypass_insert(rq, false, false); |
aef1897c JW |
806 | else |
807 | blk_mq_sched_insert_request(rq, true, false, false); | |
6fca6a61 CH |
808 | } |
809 | ||
810 | while (!list_empty(&rq_list)) { | |
811 | rq = list_entry(rq_list.next, struct request, queuelist); | |
812 | list_del_init(&rq->queuelist); | |
9e97d295 | 813 | blk_mq_sched_insert_request(rq, false, false, false); |
6fca6a61 CH |
814 | } |
815 | ||
52d7f1b5 | 816 | blk_mq_run_hw_queues(q, false); |
6fca6a61 CH |
817 | } |
818 | ||
2b053aca BVA |
819 | void blk_mq_add_to_requeue_list(struct request *rq, bool at_head, |
820 | bool kick_requeue_list) | |
6fca6a61 CH |
821 | { |
822 | struct request_queue *q = rq->q; | |
823 | unsigned long flags; | |
824 | ||
825 | /* | |
826 | * We abuse this flag that is otherwise used by the I/O scheduler to | |
ff821d27 | 827 | * request head insertion from the workqueue. |
6fca6a61 | 828 | */ |
e8064021 | 829 | BUG_ON(rq->rq_flags & RQF_SOFTBARRIER); |
6fca6a61 CH |
830 | |
831 | spin_lock_irqsave(&q->requeue_lock, flags); | |
832 | if (at_head) { | |
e8064021 | 833 | rq->rq_flags |= RQF_SOFTBARRIER; |
6fca6a61 CH |
834 | list_add(&rq->queuelist, &q->requeue_list); |
835 | } else { | |
836 | list_add_tail(&rq->queuelist, &q->requeue_list); | |
837 | } | |
838 | spin_unlock_irqrestore(&q->requeue_lock, flags); | |
2b053aca BVA |
839 | |
840 | if (kick_requeue_list) | |
841 | blk_mq_kick_requeue_list(q); | |
6fca6a61 | 842 | } |
6fca6a61 CH |
843 | |
844 | void blk_mq_kick_requeue_list(struct request_queue *q) | |
845 | { | |
ae943d20 | 846 | kblockd_mod_delayed_work_on(WORK_CPU_UNBOUND, &q->requeue_work, 0); |
6fca6a61 CH |
847 | } |
848 | EXPORT_SYMBOL(blk_mq_kick_requeue_list); | |
849 | ||
2849450a MS |
850 | void blk_mq_delay_kick_requeue_list(struct request_queue *q, |
851 | unsigned long msecs) | |
852 | { | |
d4acf365 BVA |
853 | kblockd_mod_delayed_work_on(WORK_CPU_UNBOUND, &q->requeue_work, |
854 | msecs_to_jiffies(msecs)); | |
2849450a MS |
855 | } |
856 | EXPORT_SYMBOL(blk_mq_delay_kick_requeue_list); | |
857 | ||
0e62f51f JA |
858 | struct request *blk_mq_tag_to_rq(struct blk_mq_tags *tags, unsigned int tag) |
859 | { | |
88c7b2b7 JA |
860 | if (tag < tags->nr_tags) { |
861 | prefetch(tags->rqs[tag]); | |
4ee86bab | 862 | return tags->rqs[tag]; |
88c7b2b7 | 863 | } |
4ee86bab HR |
864 | |
865 | return NULL; | |
24d2f903 CH |
866 | } |
867 | EXPORT_SYMBOL(blk_mq_tag_to_rq); | |
868 | ||
3c94d83c JA |
869 | static bool blk_mq_rq_inflight(struct blk_mq_hw_ctx *hctx, struct request *rq, |
870 | void *priv, bool reserved) | |
ae879912 JA |
871 | { |
872 | /* | |
05a4fed6 | 873 | * If we find a request that isn't idle and the queue matches, |
3c94d83c | 874 | * we know the queue is busy. Return false to stop the iteration. |
ae879912 | 875 | */ |
05a4fed6 | 876 | if (blk_mq_request_started(rq) && rq->q == hctx->queue) { |
ae879912 JA |
877 | bool *busy = priv; |
878 | ||
879 | *busy = true; | |
880 | return false; | |
881 | } | |
882 | ||
883 | return true; | |
884 | } | |
885 | ||
3c94d83c | 886 | bool blk_mq_queue_inflight(struct request_queue *q) |
ae879912 JA |
887 | { |
888 | bool busy = false; | |
889 | ||
3c94d83c | 890 | blk_mq_queue_tag_busy_iter(q, blk_mq_rq_inflight, &busy); |
ae879912 JA |
891 | return busy; |
892 | } | |
3c94d83c | 893 | EXPORT_SYMBOL_GPL(blk_mq_queue_inflight); |
ae879912 | 894 | |
358f70da | 895 | static void blk_mq_rq_timed_out(struct request *req, bool reserved) |
320ae51f | 896 | { |
da661267 | 897 | req->rq_flags |= RQF_TIMED_OUT; |
d1210d5a CH |
898 | if (req->q->mq_ops->timeout) { |
899 | enum blk_eh_timer_return ret; | |
900 | ||
901 | ret = req->q->mq_ops->timeout(req, reserved); | |
902 | if (ret == BLK_EH_DONE) | |
903 | return; | |
904 | WARN_ON_ONCE(ret != BLK_EH_RESET_TIMER); | |
46f92d42 | 905 | } |
d1210d5a CH |
906 | |
907 | blk_add_timer(req); | |
87ee7b11 | 908 | } |
5b3f25fc | 909 | |
12f5b931 | 910 | static bool blk_mq_req_expired(struct request *rq, unsigned long *next) |
81481eb4 | 911 | { |
12f5b931 | 912 | unsigned long deadline; |
87ee7b11 | 913 | |
12f5b931 KB |
914 | if (blk_mq_rq_state(rq) != MQ_RQ_IN_FLIGHT) |
915 | return false; | |
da661267 CH |
916 | if (rq->rq_flags & RQF_TIMED_OUT) |
917 | return false; | |
a7af0af3 | 918 | |
079076b3 | 919 | deadline = READ_ONCE(rq->deadline); |
12f5b931 KB |
920 | if (time_after_eq(jiffies, deadline)) |
921 | return true; | |
a7af0af3 | 922 | |
12f5b931 KB |
923 | if (*next == 0) |
924 | *next = deadline; | |
925 | else if (time_after(*next, deadline)) | |
926 | *next = deadline; | |
927 | return false; | |
87ee7b11 JA |
928 | } |
929 | ||
7baa8572 | 930 | static bool blk_mq_check_expired(struct blk_mq_hw_ctx *hctx, |
1d9bd516 TH |
931 | struct request *rq, void *priv, bool reserved) |
932 | { | |
12f5b931 KB |
933 | unsigned long *next = priv; |
934 | ||
935 | /* | |
936 | * Just do a quick check if it is expired before locking the request in | |
937 | * so we're not unnecessarilly synchronizing across CPUs. | |
938 | */ | |
939 | if (!blk_mq_req_expired(rq, next)) | |
7baa8572 | 940 | return true; |
12f5b931 KB |
941 | |
942 | /* | |
943 | * We have reason to believe the request may be expired. Take a | |
944 | * reference on the request to lock this request lifetime into its | |
945 | * currently allocated context to prevent it from being reallocated in | |
946 | * the event the completion by-passes this timeout handler. | |
947 | * | |
948 | * If the reference was already released, then the driver beat the | |
949 | * timeout handler to posting a natural completion. | |
950 | */ | |
951 | if (!refcount_inc_not_zero(&rq->ref)) | |
7baa8572 | 952 | return true; |
12f5b931 | 953 | |
1d9bd516 | 954 | /* |
12f5b931 KB |
955 | * The request is now locked and cannot be reallocated underneath the |
956 | * timeout handler's processing. Re-verify this exact request is truly | |
957 | * expired; if it is not expired, then the request was completed and | |
958 | * reallocated as a new request. | |
1d9bd516 | 959 | */ |
12f5b931 | 960 | if (blk_mq_req_expired(rq, next)) |
1d9bd516 | 961 | blk_mq_rq_timed_out(rq, reserved); |
8d699663 YY |
962 | |
963 | if (is_flush_rq(rq, hctx)) | |
964 | rq->end_io(rq, 0); | |
965 | else if (refcount_dec_and_test(&rq->ref)) | |
12f5b931 | 966 | __blk_mq_free_request(rq); |
7baa8572 JA |
967 | |
968 | return true; | |
1d9bd516 TH |
969 | } |
970 | ||
287922eb | 971 | static void blk_mq_timeout_work(struct work_struct *work) |
320ae51f | 972 | { |
287922eb CH |
973 | struct request_queue *q = |
974 | container_of(work, struct request_queue, timeout_work); | |
12f5b931 | 975 | unsigned long next = 0; |
1d9bd516 | 976 | struct blk_mq_hw_ctx *hctx; |
81481eb4 | 977 | int i; |
320ae51f | 978 | |
71f79fb3 GKB |
979 | /* A deadlock might occur if a request is stuck requiring a |
980 | * timeout at the same time a queue freeze is waiting | |
981 | * completion, since the timeout code would not be able to | |
982 | * acquire the queue reference here. | |
983 | * | |
984 | * That's why we don't use blk_queue_enter here; instead, we use | |
985 | * percpu_ref_tryget directly, because we need to be able to | |
986 | * obtain a reference even in the short window between the queue | |
987 | * starting to freeze, by dropping the first reference in | |
1671d522 | 988 | * blk_freeze_queue_start, and the moment the last request is |
71f79fb3 GKB |
989 | * consumed, marked by the instant q_usage_counter reaches |
990 | * zero. | |
991 | */ | |
992 | if (!percpu_ref_tryget(&q->q_usage_counter)) | |
287922eb CH |
993 | return; |
994 | ||
12f5b931 | 995 | blk_mq_queue_tag_busy_iter(q, blk_mq_check_expired, &next); |
320ae51f | 996 | |
12f5b931 KB |
997 | if (next != 0) { |
998 | mod_timer(&q->timeout, next); | |
0d2602ca | 999 | } else { |
fcd36c36 BVA |
1000 | /* |
1001 | * Request timeouts are handled as a forward rolling timer. If | |
1002 | * we end up here it means that no requests are pending and | |
1003 | * also that no request has been pending for a while. Mark | |
1004 | * each hctx as idle. | |
1005 | */ | |
f054b56c ML |
1006 | queue_for_each_hw_ctx(q, hctx, i) { |
1007 | /* the hctx may be unmapped, so check it here */ | |
1008 | if (blk_mq_hw_queue_mapped(hctx)) | |
1009 | blk_mq_tag_idle(hctx); | |
1010 | } | |
0d2602ca | 1011 | } |
287922eb | 1012 | blk_queue_exit(q); |
320ae51f JA |
1013 | } |
1014 | ||
88459642 OS |
1015 | struct flush_busy_ctx_data { |
1016 | struct blk_mq_hw_ctx *hctx; | |
1017 | struct list_head *list; | |
1018 | }; | |
1019 | ||
1020 | static bool flush_busy_ctx(struct sbitmap *sb, unsigned int bitnr, void *data) | |
1021 | { | |
1022 | struct flush_busy_ctx_data *flush_data = data; | |
1023 | struct blk_mq_hw_ctx *hctx = flush_data->hctx; | |
1024 | struct blk_mq_ctx *ctx = hctx->ctxs[bitnr]; | |
c16d6b5a | 1025 | enum hctx_type type = hctx->type; |
88459642 | 1026 | |
88459642 | 1027 | spin_lock(&ctx->lock); |
c16d6b5a | 1028 | list_splice_tail_init(&ctx->rq_lists[type], flush_data->list); |
e9a99a63 | 1029 | sbitmap_clear_bit(sb, bitnr); |
88459642 OS |
1030 | spin_unlock(&ctx->lock); |
1031 | return true; | |
1032 | } | |
1033 | ||
1429d7c9 JA |
1034 | /* |
1035 | * Process software queues that have been marked busy, splicing them | |
1036 | * to the for-dispatch | |
1037 | */ | |
2c3ad667 | 1038 | void blk_mq_flush_busy_ctxs(struct blk_mq_hw_ctx *hctx, struct list_head *list) |
1429d7c9 | 1039 | { |
88459642 OS |
1040 | struct flush_busy_ctx_data data = { |
1041 | .hctx = hctx, | |
1042 | .list = list, | |
1043 | }; | |
1429d7c9 | 1044 | |
88459642 | 1045 | sbitmap_for_each_set(&hctx->ctx_map, flush_busy_ctx, &data); |
1429d7c9 | 1046 | } |
2c3ad667 | 1047 | EXPORT_SYMBOL_GPL(blk_mq_flush_busy_ctxs); |
1429d7c9 | 1048 | |
b347689f ML |
1049 | struct dispatch_rq_data { |
1050 | struct blk_mq_hw_ctx *hctx; | |
1051 | struct request *rq; | |
1052 | }; | |
1053 | ||
1054 | static bool dispatch_rq_from_ctx(struct sbitmap *sb, unsigned int bitnr, | |
1055 | void *data) | |
1056 | { | |
1057 | struct dispatch_rq_data *dispatch_data = data; | |
1058 | struct blk_mq_hw_ctx *hctx = dispatch_data->hctx; | |
1059 | struct blk_mq_ctx *ctx = hctx->ctxs[bitnr]; | |
c16d6b5a | 1060 | enum hctx_type type = hctx->type; |
b347689f ML |
1061 | |
1062 | spin_lock(&ctx->lock); | |
c16d6b5a ML |
1063 | if (!list_empty(&ctx->rq_lists[type])) { |
1064 | dispatch_data->rq = list_entry_rq(ctx->rq_lists[type].next); | |
b347689f | 1065 | list_del_init(&dispatch_data->rq->queuelist); |
c16d6b5a | 1066 | if (list_empty(&ctx->rq_lists[type])) |
b347689f ML |
1067 | sbitmap_clear_bit(sb, bitnr); |
1068 | } | |
1069 | spin_unlock(&ctx->lock); | |
1070 | ||
1071 | return !dispatch_data->rq; | |
1072 | } | |
1073 | ||
1074 | struct request *blk_mq_dequeue_from_ctx(struct blk_mq_hw_ctx *hctx, | |
1075 | struct blk_mq_ctx *start) | |
1076 | { | |
f31967f0 | 1077 | unsigned off = start ? start->index_hw[hctx->type] : 0; |
b347689f ML |
1078 | struct dispatch_rq_data data = { |
1079 | .hctx = hctx, | |
1080 | .rq = NULL, | |
1081 | }; | |
1082 | ||
1083 | __sbitmap_for_each_set(&hctx->ctx_map, off, | |
1084 | dispatch_rq_from_ctx, &data); | |
1085 | ||
1086 | return data.rq; | |
1087 | } | |
1088 | ||
703fd1c0 JA |
1089 | static inline unsigned int queued_to_index(unsigned int queued) |
1090 | { | |
1091 | if (!queued) | |
1092 | return 0; | |
1429d7c9 | 1093 | |
703fd1c0 | 1094 | return min(BLK_MQ_MAX_DISPATCH_ORDER - 1, ilog2(queued) + 1); |
1429d7c9 JA |
1095 | } |
1096 | ||
570e9b73 ML |
1097 | static bool __blk_mq_get_driver_tag(struct request *rq) |
1098 | { | |
222a5ae0 | 1099 | struct sbitmap_queue *bt = rq->mq_hctx->tags->bitmap_tags; |
570e9b73 | 1100 | unsigned int tag_offset = rq->mq_hctx->tags->nr_reserved_tags; |
570e9b73 ML |
1101 | int tag; |
1102 | ||
568f2700 ML |
1103 | blk_mq_tag_busy(rq->mq_hctx); |
1104 | ||
570e9b73 | 1105 | if (blk_mq_tag_is_reserved(rq->mq_hctx->sched_tags, rq->internal_tag)) { |
222a5ae0 | 1106 | bt = rq->mq_hctx->tags->breserved_tags; |
570e9b73 | 1107 | tag_offset = 0; |
28500850 ML |
1108 | } else { |
1109 | if (!hctx_may_queue(rq->mq_hctx, bt)) | |
1110 | return false; | |
570e9b73 ML |
1111 | } |
1112 | ||
570e9b73 ML |
1113 | tag = __sbitmap_queue_get(bt); |
1114 | if (tag == BLK_MQ_NO_TAG) | |
1115 | return false; | |
1116 | ||
1117 | rq->tag = tag + tag_offset; | |
570e9b73 ML |
1118 | return true; |
1119 | } | |
1120 | ||
1121 | static bool blk_mq_get_driver_tag(struct request *rq) | |
1122 | { | |
568f2700 ML |
1123 | struct blk_mq_hw_ctx *hctx = rq->mq_hctx; |
1124 | ||
1125 | if (rq->tag == BLK_MQ_NO_TAG && !__blk_mq_get_driver_tag(rq)) | |
1126 | return false; | |
1127 | ||
51db1c37 | 1128 | if ((hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED) && |
568f2700 ML |
1129 | !(rq->rq_flags & RQF_MQ_INFLIGHT)) { |
1130 | rq->rq_flags |= RQF_MQ_INFLIGHT; | |
bccf5e26 | 1131 | __blk_mq_inc_active_requests(hctx); |
568f2700 ML |
1132 | } |
1133 | hctx->tags->rqs[rq->tag] = rq; | |
1134 | return true; | |
570e9b73 ML |
1135 | } |
1136 | ||
eb619fdb JA |
1137 | static int blk_mq_dispatch_wake(wait_queue_entry_t *wait, unsigned mode, |
1138 | int flags, void *key) | |
da55f2cc OS |
1139 | { |
1140 | struct blk_mq_hw_ctx *hctx; | |
1141 | ||
1142 | hctx = container_of(wait, struct blk_mq_hw_ctx, dispatch_wait); | |
1143 | ||
5815839b | 1144 | spin_lock(&hctx->dispatch_wait_lock); |
e8618575 JA |
1145 | if (!list_empty(&wait->entry)) { |
1146 | struct sbitmap_queue *sbq; | |
1147 | ||
1148 | list_del_init(&wait->entry); | |
222a5ae0 | 1149 | sbq = hctx->tags->bitmap_tags; |
e8618575 JA |
1150 | atomic_dec(&sbq->ws_active); |
1151 | } | |
5815839b ML |
1152 | spin_unlock(&hctx->dispatch_wait_lock); |
1153 | ||
da55f2cc OS |
1154 | blk_mq_run_hw_queue(hctx, true); |
1155 | return 1; | |
1156 | } | |
1157 | ||
f906a6a0 JA |
1158 | /* |
1159 | * Mark us waiting for a tag. For shared tags, this involves hooking us into | |
ee3e4de5 BVA |
1160 | * the tag wakeups. For non-shared tags, we can simply mark us needing a |
1161 | * restart. For both cases, take care to check the condition again after | |
f906a6a0 JA |
1162 | * marking us as waiting. |
1163 | */ | |
2278d69f | 1164 | static bool blk_mq_mark_tag_wait(struct blk_mq_hw_ctx *hctx, |
f906a6a0 | 1165 | struct request *rq) |
da55f2cc | 1166 | { |
222a5ae0 | 1167 | struct sbitmap_queue *sbq = hctx->tags->bitmap_tags; |
5815839b | 1168 | struct wait_queue_head *wq; |
f906a6a0 JA |
1169 | wait_queue_entry_t *wait; |
1170 | bool ret; | |
da55f2cc | 1171 | |
51db1c37 | 1172 | if (!(hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED)) { |
684b7324 | 1173 | blk_mq_sched_mark_restart_hctx(hctx); |
f906a6a0 | 1174 | |
c27d53fb BVA |
1175 | /* |
1176 | * It's possible that a tag was freed in the window between the | |
1177 | * allocation failure and adding the hardware queue to the wait | |
1178 | * queue. | |
1179 | * | |
1180 | * Don't clear RESTART here, someone else could have set it. | |
1181 | * At most this will cost an extra queue run. | |
1182 | */ | |
8ab6bb9e | 1183 | return blk_mq_get_driver_tag(rq); |
eb619fdb | 1184 | } |
eb619fdb | 1185 | |
2278d69f | 1186 | wait = &hctx->dispatch_wait; |
c27d53fb BVA |
1187 | if (!list_empty_careful(&wait->entry)) |
1188 | return false; | |
1189 | ||
e8618575 | 1190 | wq = &bt_wait_ptr(sbq, hctx)->wait; |
5815839b ML |
1191 | |
1192 | spin_lock_irq(&wq->lock); | |
1193 | spin_lock(&hctx->dispatch_wait_lock); | |
c27d53fb | 1194 | if (!list_empty(&wait->entry)) { |
5815839b ML |
1195 | spin_unlock(&hctx->dispatch_wait_lock); |
1196 | spin_unlock_irq(&wq->lock); | |
c27d53fb | 1197 | return false; |
eb619fdb JA |
1198 | } |
1199 | ||
e8618575 | 1200 | atomic_inc(&sbq->ws_active); |
5815839b ML |
1201 | wait->flags &= ~WQ_FLAG_EXCLUSIVE; |
1202 | __add_wait_queue(wq, wait); | |
c27d53fb | 1203 | |
da55f2cc | 1204 | /* |
eb619fdb JA |
1205 | * It's possible that a tag was freed in the window between the |
1206 | * allocation failure and adding the hardware queue to the wait | |
1207 | * queue. | |
da55f2cc | 1208 | */ |
8ab6bb9e | 1209 | ret = blk_mq_get_driver_tag(rq); |
c27d53fb | 1210 | if (!ret) { |
5815839b ML |
1211 | spin_unlock(&hctx->dispatch_wait_lock); |
1212 | spin_unlock_irq(&wq->lock); | |
c27d53fb | 1213 | return false; |
eb619fdb | 1214 | } |
c27d53fb BVA |
1215 | |
1216 | /* | |
1217 | * We got a tag, remove ourselves from the wait queue to ensure | |
1218 | * someone else gets the wakeup. | |
1219 | */ | |
c27d53fb | 1220 | list_del_init(&wait->entry); |
e8618575 | 1221 | atomic_dec(&sbq->ws_active); |
5815839b ML |
1222 | spin_unlock(&hctx->dispatch_wait_lock); |
1223 | spin_unlock_irq(&wq->lock); | |
c27d53fb BVA |
1224 | |
1225 | return true; | |
da55f2cc OS |
1226 | } |
1227 | ||
6e768717 ML |
1228 | #define BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT 8 |
1229 | #define BLK_MQ_DISPATCH_BUSY_EWMA_FACTOR 4 | |
1230 | /* | |
1231 | * Update dispatch busy with the Exponential Weighted Moving Average(EWMA): | |
1232 | * - EWMA is one simple way to compute running average value | |
1233 | * - weight(7/8 and 1/8) is applied so that it can decrease exponentially | |
1234 | * - take 4 as factor for avoiding to get too small(0) result, and this | |
1235 | * factor doesn't matter because EWMA decreases exponentially | |
1236 | */ | |
1237 | static void blk_mq_update_dispatch_busy(struct blk_mq_hw_ctx *hctx, bool busy) | |
1238 | { | |
1239 | unsigned int ewma; | |
1240 | ||
1241 | if (hctx->queue->elevator) | |
1242 | return; | |
1243 | ||
1244 | ewma = hctx->dispatch_busy; | |
1245 | ||
1246 | if (!ewma && !busy) | |
1247 | return; | |
1248 | ||
1249 | ewma *= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT - 1; | |
1250 | if (busy) | |
1251 | ewma += 1 << BLK_MQ_DISPATCH_BUSY_EWMA_FACTOR; | |
1252 | ewma /= BLK_MQ_DISPATCH_BUSY_EWMA_WEIGHT; | |
1253 | ||
1254 | hctx->dispatch_busy = ewma; | |
1255 | } | |
1256 | ||
86ff7c2a ML |
1257 | #define BLK_MQ_RESOURCE_DELAY 3 /* ms units */ |
1258 | ||
c92a4103 JT |
1259 | static void blk_mq_handle_dev_resource(struct request *rq, |
1260 | struct list_head *list) | |
1261 | { | |
1262 | struct request *next = | |
1263 | list_first_entry_or_null(list, struct request, queuelist); | |
1264 | ||
1265 | /* | |
1266 | * If an I/O scheduler has been configured and we got a driver tag for | |
1267 | * the next request already, free it. | |
1268 | */ | |
1269 | if (next) | |
1270 | blk_mq_put_driver_tag(next); | |
1271 | ||
1272 | list_add(&rq->queuelist, list); | |
1273 | __blk_mq_requeue_request(rq); | |
1274 | } | |
1275 | ||
0512a75b KB |
1276 | static void blk_mq_handle_zone_resource(struct request *rq, |
1277 | struct list_head *zone_list) | |
1278 | { | |
1279 | /* | |
1280 | * If we end up here it is because we cannot dispatch a request to a | |
1281 | * specific zone due to LLD level zone-write locking or other zone | |
1282 | * related resource not being available. In this case, set the request | |
1283 | * aside in zone_list for retrying it later. | |
1284 | */ | |
1285 | list_add(&rq->queuelist, zone_list); | |
1286 | __blk_mq_requeue_request(rq); | |
1287 | } | |
1288 | ||
75383524 ML |
1289 | enum prep_dispatch { |
1290 | PREP_DISPATCH_OK, | |
1291 | PREP_DISPATCH_NO_TAG, | |
1292 | PREP_DISPATCH_NO_BUDGET, | |
1293 | }; | |
1294 | ||
1295 | static enum prep_dispatch blk_mq_prep_dispatch_rq(struct request *rq, | |
1296 | bool need_budget) | |
1297 | { | |
1298 | struct blk_mq_hw_ctx *hctx = rq->mq_hctx; | |
1299 | ||
1300 | if (need_budget && !blk_mq_get_dispatch_budget(rq->q)) { | |
1301 | blk_mq_put_driver_tag(rq); | |
1302 | return PREP_DISPATCH_NO_BUDGET; | |
1303 | } | |
1304 | ||
1305 | if (!blk_mq_get_driver_tag(rq)) { | |
1306 | /* | |
1307 | * The initial allocation attempt failed, so we need to | |
1308 | * rerun the hardware queue when a tag is freed. The | |
1309 | * waitqueue takes care of that. If the queue is run | |
1310 | * before we add this entry back on the dispatch list, | |
1311 | * we'll re-run it below. | |
1312 | */ | |
1313 | if (!blk_mq_mark_tag_wait(hctx, rq)) { | |
1fd40b5e ML |
1314 | /* |
1315 | * All budgets not got from this function will be put | |
1316 | * together during handling partial dispatch | |
1317 | */ | |
1318 | if (need_budget) | |
1319 | blk_mq_put_dispatch_budget(rq->q); | |
75383524 ML |
1320 | return PREP_DISPATCH_NO_TAG; |
1321 | } | |
1322 | } | |
1323 | ||
1324 | return PREP_DISPATCH_OK; | |
1325 | } | |
1326 | ||
1fd40b5e ML |
1327 | /* release all allocated budgets before calling to blk_mq_dispatch_rq_list */ |
1328 | static void blk_mq_release_budgets(struct request_queue *q, | |
1329 | unsigned int nr_budgets) | |
1330 | { | |
1331 | int i; | |
1332 | ||
1333 | for (i = 0; i < nr_budgets; i++) | |
1334 | blk_mq_put_dispatch_budget(q); | |
1335 | } | |
1336 | ||
1f57f8d4 JA |
1337 | /* |
1338 | * Returns true if we did some work AND can potentially do more. | |
1339 | */ | |
445874e8 | 1340 | bool blk_mq_dispatch_rq_list(struct blk_mq_hw_ctx *hctx, struct list_head *list, |
1fd40b5e | 1341 | unsigned int nr_budgets) |
320ae51f | 1342 | { |
75383524 | 1343 | enum prep_dispatch prep; |
445874e8 | 1344 | struct request_queue *q = hctx->queue; |
6d6f167c | 1345 | struct request *rq, *nxt; |
fc17b653 | 1346 | int errors, queued; |
86ff7c2a | 1347 | blk_status_t ret = BLK_STS_OK; |
0512a75b | 1348 | LIST_HEAD(zone_list); |
320ae51f | 1349 | |
81380ca1 OS |
1350 | if (list_empty(list)) |
1351 | return false; | |
1352 | ||
320ae51f JA |
1353 | /* |
1354 | * Now process all the entries, sending them to the driver. | |
1355 | */ | |
93efe981 | 1356 | errors = queued = 0; |
81380ca1 | 1357 | do { |
74c45052 | 1358 | struct blk_mq_queue_data bd; |
320ae51f | 1359 | |
f04c3df3 | 1360 | rq = list_first_entry(list, struct request, queuelist); |
0bca799b | 1361 | |
445874e8 | 1362 | WARN_ON_ONCE(hctx != rq->mq_hctx); |
1fd40b5e | 1363 | prep = blk_mq_prep_dispatch_rq(rq, !nr_budgets); |
75383524 | 1364 | if (prep != PREP_DISPATCH_OK) |
0bca799b | 1365 | break; |
de148297 | 1366 | |
320ae51f | 1367 | list_del_init(&rq->queuelist); |
320ae51f | 1368 | |
74c45052 | 1369 | bd.rq = rq; |
113285b4 JA |
1370 | |
1371 | /* | |
1372 | * Flag last if we have no more requests, or if we have more | |
1373 | * but can't assign a driver tag to it. | |
1374 | */ | |
1375 | if (list_empty(list)) | |
1376 | bd.last = true; | |
1377 | else { | |
113285b4 | 1378 | nxt = list_first_entry(list, struct request, queuelist); |
8ab6bb9e | 1379 | bd.last = !blk_mq_get_driver_tag(nxt); |
113285b4 | 1380 | } |
74c45052 | 1381 | |
1fd40b5e ML |
1382 | /* |
1383 | * once the request is queued to lld, no need to cover the | |
1384 | * budget any more | |
1385 | */ | |
1386 | if (nr_budgets) | |
1387 | nr_budgets--; | |
74c45052 | 1388 | ret = q->mq_ops->queue_rq(hctx, &bd); |
7bf13729 ML |
1389 | switch (ret) { |
1390 | case BLK_STS_OK: | |
1391 | queued++; | |
320ae51f | 1392 | break; |
7bf13729 ML |
1393 | case BLK_STS_RESOURCE: |
1394 | case BLK_STS_DEV_RESOURCE: | |
1395 | blk_mq_handle_dev_resource(rq, list); | |
1396 | goto out; | |
1397 | case BLK_STS_ZONE_RESOURCE: | |
0512a75b KB |
1398 | /* |
1399 | * Move the request to zone_list and keep going through | |
1400 | * the dispatch list to find more requests the drive can | |
1401 | * accept. | |
1402 | */ | |
1403 | blk_mq_handle_zone_resource(rq, &zone_list); | |
7bf13729 ML |
1404 | break; |
1405 | default: | |
93efe981 | 1406 | errors++; |
2a842aca | 1407 | blk_mq_end_request(rq, BLK_STS_IOERR); |
320ae51f | 1408 | } |
81380ca1 | 1409 | } while (!list_empty(list)); |
7bf13729 | 1410 | out: |
0512a75b KB |
1411 | if (!list_empty(&zone_list)) |
1412 | list_splice_tail_init(&zone_list, list); | |
1413 | ||
703fd1c0 | 1414 | hctx->dispatched[queued_to_index(queued)]++; |
320ae51f JA |
1415 | |
1416 | /* | |
1417 | * Any items that need requeuing? Stuff them into hctx->dispatch, | |
1418 | * that is where we will continue on next queue run. | |
1419 | */ | |
f04c3df3 | 1420 | if (!list_empty(list)) { |
86ff7c2a | 1421 | bool needs_restart; |
75383524 ML |
1422 | /* For non-shared tags, the RESTART check will suffice */ |
1423 | bool no_tag = prep == PREP_DISPATCH_NO_TAG && | |
51db1c37 | 1424 | (hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED); |
75383524 | 1425 | bool no_budget_avail = prep == PREP_DISPATCH_NO_BUDGET; |
86ff7c2a | 1426 | |
1fd40b5e | 1427 | blk_mq_release_budgets(q, nr_budgets); |
86ff7c2a | 1428 | |
d666ba98 JA |
1429 | /* |
1430 | * If we didn't flush the entire list, we could have told | |
1431 | * the driver there was more coming, but that turned out to | |
1432 | * be a lie. | |
1433 | */ | |
536167d4 | 1434 | if (q->mq_ops->commit_rqs && queued) |
d666ba98 JA |
1435 | q->mq_ops->commit_rqs(hctx); |
1436 | ||
320ae51f | 1437 | spin_lock(&hctx->lock); |
01e99aec | 1438 | list_splice_tail_init(list, &hctx->dispatch); |
320ae51f | 1439 | spin_unlock(&hctx->lock); |
f04c3df3 | 1440 | |
d7d8535f ML |
1441 | /* |
1442 | * Order adding requests to hctx->dispatch and checking | |
1443 | * SCHED_RESTART flag. The pair of this smp_mb() is the one | |
1444 | * in blk_mq_sched_restart(). Avoid restart code path to | |
1445 | * miss the new added requests to hctx->dispatch, meantime | |
1446 | * SCHED_RESTART is observed here. | |
1447 | */ | |
1448 | smp_mb(); | |
1449 | ||
9ba52e58 | 1450 | /* |
710c785f BVA |
1451 | * If SCHED_RESTART was set by the caller of this function and |
1452 | * it is no longer set that means that it was cleared by another | |
1453 | * thread and hence that a queue rerun is needed. | |
9ba52e58 | 1454 | * |
eb619fdb JA |
1455 | * If 'no_tag' is set, that means that we failed getting |
1456 | * a driver tag with an I/O scheduler attached. If our dispatch | |
1457 | * waitqueue is no longer active, ensure that we run the queue | |
1458 | * AFTER adding our entries back to the list. | |
bd166ef1 | 1459 | * |
710c785f BVA |
1460 | * If no I/O scheduler has been configured it is possible that |
1461 | * the hardware queue got stopped and restarted before requests | |
1462 | * were pushed back onto the dispatch list. Rerun the queue to | |
1463 | * avoid starvation. Notes: | |
1464 | * - blk_mq_run_hw_queue() checks whether or not a queue has | |
1465 | * been stopped before rerunning a queue. | |
1466 | * - Some but not all block drivers stop a queue before | |
fc17b653 | 1467 | * returning BLK_STS_RESOURCE. Two exceptions are scsi-mq |
710c785f | 1468 | * and dm-rq. |
86ff7c2a ML |
1469 | * |
1470 | * If driver returns BLK_STS_RESOURCE and SCHED_RESTART | |
1471 | * bit is set, run queue after a delay to avoid IO stalls | |
ab3cee37 DA |
1472 | * that could otherwise occur if the queue is idle. We'll do |
1473 | * similar if we couldn't get budget and SCHED_RESTART is set. | |
bd166ef1 | 1474 | */ |
86ff7c2a ML |
1475 | needs_restart = blk_mq_sched_needs_restart(hctx); |
1476 | if (!needs_restart || | |
eb619fdb | 1477 | (no_tag && list_empty_careful(&hctx->dispatch_wait.entry))) |
bd166ef1 | 1478 | blk_mq_run_hw_queue(hctx, true); |
ab3cee37 DA |
1479 | else if (needs_restart && (ret == BLK_STS_RESOURCE || |
1480 | no_budget_avail)) | |
86ff7c2a | 1481 | blk_mq_delay_run_hw_queue(hctx, BLK_MQ_RESOURCE_DELAY); |
1f57f8d4 | 1482 | |
6e768717 | 1483 | blk_mq_update_dispatch_busy(hctx, true); |
1f57f8d4 | 1484 | return false; |
6e768717 ML |
1485 | } else |
1486 | blk_mq_update_dispatch_busy(hctx, false); | |
f04c3df3 | 1487 | |
93efe981 | 1488 | return (queued + errors) != 0; |
f04c3df3 JA |
1489 | } |
1490 | ||
105663f7 AA |
1491 | /** |
1492 | * __blk_mq_run_hw_queue - Run a hardware queue. | |
1493 | * @hctx: Pointer to the hardware queue to run. | |
1494 | * | |
1495 | * Send pending requests to the hardware. | |
1496 | */ | |
6a83e74d BVA |
1497 | static void __blk_mq_run_hw_queue(struct blk_mq_hw_ctx *hctx) |
1498 | { | |
1499 | int srcu_idx; | |
1500 | ||
b7a71e66 JA |
1501 | /* |
1502 | * We should be running this queue from one of the CPUs that | |
1503 | * are mapped to it. | |
7df938fb ML |
1504 | * |
1505 | * There are at least two related races now between setting | |
1506 | * hctx->next_cpu from blk_mq_hctx_next_cpu() and running | |
1507 | * __blk_mq_run_hw_queue(): | |
1508 | * | |
1509 | * - hctx->next_cpu is found offline in blk_mq_hctx_next_cpu(), | |
1510 | * but later it becomes online, then this warning is harmless | |
1511 | * at all | |
1512 | * | |
1513 | * - hctx->next_cpu is found online in blk_mq_hctx_next_cpu(), | |
1514 | * but later it becomes offline, then the warning can't be | |
1515 | * triggered, and we depend on blk-mq timeout handler to | |
1516 | * handle dispatched requests to this hctx | |
b7a71e66 | 1517 | */ |
7df938fb ML |
1518 | if (!cpumask_test_cpu(raw_smp_processor_id(), hctx->cpumask) && |
1519 | cpu_online(hctx->next_cpu)) { | |
1520 | printk(KERN_WARNING "run queue from wrong CPU %d, hctx %s\n", | |
1521 | raw_smp_processor_id(), | |
1522 | cpumask_empty(hctx->cpumask) ? "inactive": "active"); | |
1523 | dump_stack(); | |
1524 | } | |
6a83e74d | 1525 | |
b7a71e66 JA |
1526 | /* |
1527 | * We can't run the queue inline with ints disabled. Ensure that | |
1528 | * we catch bad users of this early. | |
1529 | */ | |
1530 | WARN_ON_ONCE(in_interrupt()); | |
1531 | ||
04ced159 | 1532 | might_sleep_if(hctx->flags & BLK_MQ_F_BLOCKING); |
bf4907c0 | 1533 | |
04ced159 JA |
1534 | hctx_lock(hctx, &srcu_idx); |
1535 | blk_mq_sched_dispatch_requests(hctx); | |
1536 | hctx_unlock(hctx, srcu_idx); | |
6a83e74d BVA |
1537 | } |
1538 | ||
f82ddf19 ML |
1539 | static inline int blk_mq_first_mapped_cpu(struct blk_mq_hw_ctx *hctx) |
1540 | { | |
1541 | int cpu = cpumask_first_and(hctx->cpumask, cpu_online_mask); | |
1542 | ||
1543 | if (cpu >= nr_cpu_ids) | |
1544 | cpu = cpumask_first(hctx->cpumask); | |
1545 | return cpu; | |
1546 | } | |
1547 | ||
506e931f JA |
1548 | /* |
1549 | * It'd be great if the workqueue API had a way to pass | |
1550 | * in a mask and had some smarts for more clever placement. | |
1551 | * For now we just round-robin here, switching for every | |
1552 | * BLK_MQ_CPU_WORK_BATCH queued items. | |
1553 | */ | |
1554 | static int blk_mq_hctx_next_cpu(struct blk_mq_hw_ctx *hctx) | |
1555 | { | |
7bed4595 | 1556 | bool tried = false; |
476f8c98 | 1557 | int next_cpu = hctx->next_cpu; |
7bed4595 | 1558 | |
b657d7e6 CH |
1559 | if (hctx->queue->nr_hw_queues == 1) |
1560 | return WORK_CPU_UNBOUND; | |
506e931f JA |
1561 | |
1562 | if (--hctx->next_cpu_batch <= 0) { | |
7bed4595 | 1563 | select_cpu: |
476f8c98 | 1564 | next_cpu = cpumask_next_and(next_cpu, hctx->cpumask, |
20e4d813 | 1565 | cpu_online_mask); |
506e931f | 1566 | if (next_cpu >= nr_cpu_ids) |
f82ddf19 | 1567 | next_cpu = blk_mq_first_mapped_cpu(hctx); |
506e931f JA |
1568 | hctx->next_cpu_batch = BLK_MQ_CPU_WORK_BATCH; |
1569 | } | |
1570 | ||
7bed4595 ML |
1571 | /* |
1572 | * Do unbound schedule if we can't find a online CPU for this hctx, | |
1573 | * and it should only happen in the path of handling CPU DEAD. | |
1574 | */ | |
476f8c98 | 1575 | if (!cpu_online(next_cpu)) { |
7bed4595 ML |
1576 | if (!tried) { |
1577 | tried = true; | |
1578 | goto select_cpu; | |
1579 | } | |
1580 | ||
1581 | /* | |
1582 | * Make sure to re-select CPU next time once after CPUs | |
1583 | * in hctx->cpumask become online again. | |
1584 | */ | |
476f8c98 | 1585 | hctx->next_cpu = next_cpu; |
7bed4595 ML |
1586 | hctx->next_cpu_batch = 1; |
1587 | return WORK_CPU_UNBOUND; | |
1588 | } | |
476f8c98 ML |
1589 | |
1590 | hctx->next_cpu = next_cpu; | |
1591 | return next_cpu; | |
506e931f JA |
1592 | } |
1593 | ||
105663f7 AA |
1594 | /** |
1595 | * __blk_mq_delay_run_hw_queue - Run (or schedule to run) a hardware queue. | |
1596 | * @hctx: Pointer to the hardware queue to run. | |
1597 | * @async: If we want to run the queue asynchronously. | |
1598 | * @msecs: Microseconds of delay to wait before running the queue. | |
1599 | * | |
1600 | * If !@async, try to run the queue now. Else, run the queue asynchronously and | |
1601 | * with a delay of @msecs. | |
1602 | */ | |
7587a5ae BVA |
1603 | static void __blk_mq_delay_run_hw_queue(struct blk_mq_hw_ctx *hctx, bool async, |
1604 | unsigned long msecs) | |
320ae51f | 1605 | { |
5435c023 | 1606 | if (unlikely(blk_mq_hctx_stopped(hctx))) |
320ae51f JA |
1607 | return; |
1608 | ||
1b792f2f | 1609 | if (!async && !(hctx->flags & BLK_MQ_F_BLOCKING)) { |
2a90d4aa PB |
1610 | int cpu = get_cpu(); |
1611 | if (cpumask_test_cpu(cpu, hctx->cpumask)) { | |
398205b8 | 1612 | __blk_mq_run_hw_queue(hctx); |
2a90d4aa | 1613 | put_cpu(); |
398205b8 PB |
1614 | return; |
1615 | } | |
e4043dcf | 1616 | |
2a90d4aa | 1617 | put_cpu(); |
e4043dcf | 1618 | } |
398205b8 | 1619 | |
ae943d20 BVA |
1620 | kblockd_mod_delayed_work_on(blk_mq_hctx_next_cpu(hctx), &hctx->run_work, |
1621 | msecs_to_jiffies(msecs)); | |
7587a5ae BVA |
1622 | } |
1623 | ||
105663f7 AA |
1624 | /** |
1625 | * blk_mq_delay_run_hw_queue - Run a hardware queue asynchronously. | |
1626 | * @hctx: Pointer to the hardware queue to run. | |
1627 | * @msecs: Microseconds of delay to wait before running the queue. | |
1628 | * | |
1629 | * Run a hardware queue asynchronously with a delay of @msecs. | |
1630 | */ | |
7587a5ae BVA |
1631 | void blk_mq_delay_run_hw_queue(struct blk_mq_hw_ctx *hctx, unsigned long msecs) |
1632 | { | |
1633 | __blk_mq_delay_run_hw_queue(hctx, true, msecs); | |
1634 | } | |
1635 | EXPORT_SYMBOL(blk_mq_delay_run_hw_queue); | |
1636 | ||
105663f7 AA |
1637 | /** |
1638 | * blk_mq_run_hw_queue - Start to run a hardware queue. | |
1639 | * @hctx: Pointer to the hardware queue to run. | |
1640 | * @async: If we want to run the queue asynchronously. | |
1641 | * | |
1642 | * Check if the request queue is not in a quiesced state and if there are | |
1643 | * pending requests to be sent. If this is true, run the queue to send requests | |
1644 | * to hardware. | |
1645 | */ | |
626fb735 | 1646 | void blk_mq_run_hw_queue(struct blk_mq_hw_ctx *hctx, bool async) |
7587a5ae | 1647 | { |
24f5a90f ML |
1648 | int srcu_idx; |
1649 | bool need_run; | |
1650 | ||
1651 | /* | |
1652 | * When queue is quiesced, we may be switching io scheduler, or | |
1653 | * updating nr_hw_queues, or other things, and we can't run queue | |
1654 | * any more, even __blk_mq_hctx_has_pending() can't be called safely. | |
1655 | * | |
1656 | * And queue will be rerun in blk_mq_unquiesce_queue() if it is | |
1657 | * quiesced. | |
1658 | */ | |
04ced159 JA |
1659 | hctx_lock(hctx, &srcu_idx); |
1660 | need_run = !blk_queue_quiesced(hctx->queue) && | |
1661 | blk_mq_hctx_has_pending(hctx); | |
1662 | hctx_unlock(hctx, srcu_idx); | |
24f5a90f | 1663 | |
626fb735 | 1664 | if (need_run) |
79f720a7 | 1665 | __blk_mq_delay_run_hw_queue(hctx, async, 0); |
320ae51f | 1666 | } |
5b727272 | 1667 | EXPORT_SYMBOL(blk_mq_run_hw_queue); |
320ae51f | 1668 | |
105663f7 AA |
1669 | /** |
1670 | * blk_mq_run_hw_queue - Run all hardware queues in a request queue. | |
1671 | * @q: Pointer to the request queue to run. | |
1672 | * @async: If we want to run the queue asynchronously. | |
1673 | */ | |
b94ec296 | 1674 | void blk_mq_run_hw_queues(struct request_queue *q, bool async) |
320ae51f JA |
1675 | { |
1676 | struct blk_mq_hw_ctx *hctx; | |
1677 | int i; | |
1678 | ||
1679 | queue_for_each_hw_ctx(q, hctx, i) { | |
79f720a7 | 1680 | if (blk_mq_hctx_stopped(hctx)) |
320ae51f JA |
1681 | continue; |
1682 | ||
b94ec296 | 1683 | blk_mq_run_hw_queue(hctx, async); |
320ae51f JA |
1684 | } |
1685 | } | |
b94ec296 | 1686 | EXPORT_SYMBOL(blk_mq_run_hw_queues); |
320ae51f | 1687 | |
b9151e7b DA |
1688 | /** |
1689 | * blk_mq_delay_run_hw_queues - Run all hardware queues asynchronously. | |
1690 | * @q: Pointer to the request queue to run. | |
1691 | * @msecs: Microseconds of delay to wait before running the queues. | |
1692 | */ | |
1693 | void blk_mq_delay_run_hw_queues(struct request_queue *q, unsigned long msecs) | |
1694 | { | |
1695 | struct blk_mq_hw_ctx *hctx; | |
1696 | int i; | |
1697 | ||
1698 | queue_for_each_hw_ctx(q, hctx, i) { | |
1699 | if (blk_mq_hctx_stopped(hctx)) | |
1700 | continue; | |
1701 | ||
1702 | blk_mq_delay_run_hw_queue(hctx, msecs); | |
1703 | } | |
1704 | } | |
1705 | EXPORT_SYMBOL(blk_mq_delay_run_hw_queues); | |
1706 | ||
fd001443 BVA |
1707 | /** |
1708 | * blk_mq_queue_stopped() - check whether one or more hctxs have been stopped | |
1709 | * @q: request queue. | |
1710 | * | |
1711 | * The caller is responsible for serializing this function against | |
1712 | * blk_mq_{start,stop}_hw_queue(). | |
1713 | */ | |
1714 | bool blk_mq_queue_stopped(struct request_queue *q) | |
1715 | { | |
1716 | struct blk_mq_hw_ctx *hctx; | |
1717 | int i; | |
1718 | ||
1719 | queue_for_each_hw_ctx(q, hctx, i) | |
1720 | if (blk_mq_hctx_stopped(hctx)) | |
1721 | return true; | |
1722 | ||
1723 | return false; | |
1724 | } | |
1725 | EXPORT_SYMBOL(blk_mq_queue_stopped); | |
1726 | ||
39a70c76 ML |
1727 | /* |
1728 | * This function is often used for pausing .queue_rq() by driver when | |
1729 | * there isn't enough resource or some conditions aren't satisfied, and | |
4d606219 | 1730 | * BLK_STS_RESOURCE is usually returned. |
39a70c76 ML |
1731 | * |
1732 | * We do not guarantee that dispatch can be drained or blocked | |
1733 | * after blk_mq_stop_hw_queue() returns. Please use | |
1734 | * blk_mq_quiesce_queue() for that requirement. | |
1735 | */ | |
2719aa21 JA |
1736 | void blk_mq_stop_hw_queue(struct blk_mq_hw_ctx *hctx) |
1737 | { | |
641a9ed6 | 1738 | cancel_delayed_work(&hctx->run_work); |
280d45f6 | 1739 | |
641a9ed6 | 1740 | set_bit(BLK_MQ_S_STOPPED, &hctx->state); |
2719aa21 | 1741 | } |
641a9ed6 | 1742 | EXPORT_SYMBOL(blk_mq_stop_hw_queue); |
2719aa21 | 1743 | |
39a70c76 ML |
1744 | /* |
1745 | * This function is often used for pausing .queue_rq() by driver when | |
1746 | * there isn't enough resource or some conditions aren't satisfied, and | |
4d606219 | 1747 | * BLK_STS_RESOURCE is usually returned. |
39a70c76 ML |
1748 | * |
1749 | * We do not guarantee that dispatch can be drained or blocked | |
1750 | * after blk_mq_stop_hw_queues() returns. Please use | |
1751 | * blk_mq_quiesce_queue() for that requirement. | |
1752 | */ | |
2719aa21 JA |
1753 | void blk_mq_stop_hw_queues(struct request_queue *q) |
1754 | { | |
641a9ed6 ML |
1755 | struct blk_mq_hw_ctx *hctx; |
1756 | int i; | |
1757 | ||
1758 | queue_for_each_hw_ctx(q, hctx, i) | |
1759 | blk_mq_stop_hw_queue(hctx); | |
280d45f6 CH |
1760 | } |
1761 | EXPORT_SYMBOL(blk_mq_stop_hw_queues); | |
1762 | ||
320ae51f JA |
1763 | void blk_mq_start_hw_queue(struct blk_mq_hw_ctx *hctx) |
1764 | { | |
1765 | clear_bit(BLK_MQ_S_STOPPED, &hctx->state); | |
e4043dcf | 1766 | |
0ffbce80 | 1767 | blk_mq_run_hw_queue(hctx, false); |
320ae51f JA |
1768 | } |
1769 | EXPORT_SYMBOL(blk_mq_start_hw_queue); | |
1770 | ||
2f268556 CH |
1771 | void blk_mq_start_hw_queues(struct request_queue *q) |
1772 | { | |
1773 | struct blk_mq_hw_ctx *hctx; | |
1774 | int i; | |
1775 | ||
1776 | queue_for_each_hw_ctx(q, hctx, i) | |
1777 | blk_mq_start_hw_queue(hctx); | |
1778 | } | |
1779 | EXPORT_SYMBOL(blk_mq_start_hw_queues); | |
1780 | ||
ae911c5e JA |
1781 | void blk_mq_start_stopped_hw_queue(struct blk_mq_hw_ctx *hctx, bool async) |
1782 | { | |
1783 | if (!blk_mq_hctx_stopped(hctx)) | |
1784 | return; | |
1785 | ||
1786 | clear_bit(BLK_MQ_S_STOPPED, &hctx->state); | |
1787 | blk_mq_run_hw_queue(hctx, async); | |
1788 | } | |
1789 | EXPORT_SYMBOL_GPL(blk_mq_start_stopped_hw_queue); | |
1790 | ||
1b4a3258 | 1791 | void blk_mq_start_stopped_hw_queues(struct request_queue *q, bool async) |
320ae51f JA |
1792 | { |
1793 | struct blk_mq_hw_ctx *hctx; | |
1794 | int i; | |
1795 | ||
ae911c5e JA |
1796 | queue_for_each_hw_ctx(q, hctx, i) |
1797 | blk_mq_start_stopped_hw_queue(hctx, async); | |
320ae51f JA |
1798 | } |
1799 | EXPORT_SYMBOL(blk_mq_start_stopped_hw_queues); | |
1800 | ||
70f4db63 | 1801 | static void blk_mq_run_work_fn(struct work_struct *work) |
320ae51f JA |
1802 | { |
1803 | struct blk_mq_hw_ctx *hctx; | |
1804 | ||
9f993737 | 1805 | hctx = container_of(work, struct blk_mq_hw_ctx, run_work.work); |
320ae51f | 1806 | |
21c6e939 | 1807 | /* |
15fe8a90 | 1808 | * If we are stopped, don't run the queue. |
21c6e939 | 1809 | */ |
0841031a | 1810 | if (blk_mq_hctx_stopped(hctx)) |
0196d6b4 | 1811 | return; |
7587a5ae BVA |
1812 | |
1813 | __blk_mq_run_hw_queue(hctx); | |
1814 | } | |
1815 | ||
cfd0c552 | 1816 | static inline void __blk_mq_insert_req_list(struct blk_mq_hw_ctx *hctx, |
cfd0c552 ML |
1817 | struct request *rq, |
1818 | bool at_head) | |
320ae51f | 1819 | { |
e57690fe | 1820 | struct blk_mq_ctx *ctx = rq->mq_ctx; |
c16d6b5a | 1821 | enum hctx_type type = hctx->type; |
e57690fe | 1822 | |
7b607814 BVA |
1823 | lockdep_assert_held(&ctx->lock); |
1824 | ||
01b983c9 JA |
1825 | trace_block_rq_insert(hctx->queue, rq); |
1826 | ||
72a0a36e | 1827 | if (at_head) |
c16d6b5a | 1828 | list_add(&rq->queuelist, &ctx->rq_lists[type]); |
72a0a36e | 1829 | else |
c16d6b5a | 1830 | list_add_tail(&rq->queuelist, &ctx->rq_lists[type]); |
cfd0c552 | 1831 | } |
4bb659b1 | 1832 | |
2c3ad667 JA |
1833 | void __blk_mq_insert_request(struct blk_mq_hw_ctx *hctx, struct request *rq, |
1834 | bool at_head) | |
cfd0c552 ML |
1835 | { |
1836 | struct blk_mq_ctx *ctx = rq->mq_ctx; | |
1837 | ||
7b607814 BVA |
1838 | lockdep_assert_held(&ctx->lock); |
1839 | ||
e57690fe | 1840 | __blk_mq_insert_req_list(hctx, rq, at_head); |
320ae51f | 1841 | blk_mq_hctx_mark_pending(hctx, ctx); |
320ae51f JA |
1842 | } |
1843 | ||
105663f7 AA |
1844 | /** |
1845 | * blk_mq_request_bypass_insert - Insert a request at dispatch list. | |
1846 | * @rq: Pointer to request to be inserted. | |
26bfeb26 | 1847 | * @at_head: true if the request should be inserted at the head of the list. |
105663f7 AA |
1848 | * @run_queue: If we should run the hardware queue after inserting the request. |
1849 | * | |
157f377b JA |
1850 | * Should only be used carefully, when the caller knows we want to |
1851 | * bypass a potential IO scheduler on the target device. | |
1852 | */ | |
01e99aec ML |
1853 | void blk_mq_request_bypass_insert(struct request *rq, bool at_head, |
1854 | bool run_queue) | |
157f377b | 1855 | { |
ea4f995e | 1856 | struct blk_mq_hw_ctx *hctx = rq->mq_hctx; |
157f377b JA |
1857 | |
1858 | spin_lock(&hctx->lock); | |
01e99aec ML |
1859 | if (at_head) |
1860 | list_add(&rq->queuelist, &hctx->dispatch); | |
1861 | else | |
1862 | list_add_tail(&rq->queuelist, &hctx->dispatch); | |
157f377b JA |
1863 | spin_unlock(&hctx->lock); |
1864 | ||
b0850297 ML |
1865 | if (run_queue) |
1866 | blk_mq_run_hw_queue(hctx, false); | |
157f377b JA |
1867 | } |
1868 | ||
bd166ef1 JA |
1869 | void blk_mq_insert_requests(struct blk_mq_hw_ctx *hctx, struct blk_mq_ctx *ctx, |
1870 | struct list_head *list) | |
320ae51f JA |
1871 | |
1872 | { | |
3f0cedc7 | 1873 | struct request *rq; |
c16d6b5a | 1874 | enum hctx_type type = hctx->type; |
3f0cedc7 | 1875 | |
320ae51f JA |
1876 | /* |
1877 | * preemption doesn't flush plug list, so it's possible ctx->cpu is | |
1878 | * offline now | |
1879 | */ | |
3f0cedc7 | 1880 | list_for_each_entry(rq, list, queuelist) { |
e57690fe | 1881 | BUG_ON(rq->mq_ctx != ctx); |
3f0cedc7 | 1882 | trace_block_rq_insert(hctx->queue, rq); |
320ae51f | 1883 | } |
3f0cedc7 ML |
1884 | |
1885 | spin_lock(&ctx->lock); | |
c16d6b5a | 1886 | list_splice_tail_init(list, &ctx->rq_lists[type]); |
cfd0c552 | 1887 | blk_mq_hctx_mark_pending(hctx, ctx); |
320ae51f | 1888 | spin_unlock(&ctx->lock); |
320ae51f JA |
1889 | } |
1890 | ||
3110fc79 | 1891 | static int plug_rq_cmp(void *priv, struct list_head *a, struct list_head *b) |
320ae51f JA |
1892 | { |
1893 | struct request *rqa = container_of(a, struct request, queuelist); | |
1894 | struct request *rqb = container_of(b, struct request, queuelist); | |
1895 | ||
7d30a621 PB |
1896 | if (rqa->mq_ctx != rqb->mq_ctx) |
1897 | return rqa->mq_ctx > rqb->mq_ctx; | |
1898 | if (rqa->mq_hctx != rqb->mq_hctx) | |
1899 | return rqa->mq_hctx > rqb->mq_hctx; | |
3110fc79 JA |
1900 | |
1901 | return blk_rq_pos(rqa) > blk_rq_pos(rqb); | |
320ae51f JA |
1902 | } |
1903 | ||
1904 | void blk_mq_flush_plug_list(struct blk_plug *plug, bool from_schedule) | |
1905 | { | |
320ae51f | 1906 | LIST_HEAD(list); |
320ae51f | 1907 | |
95ed0c5b PB |
1908 | if (list_empty(&plug->mq_list)) |
1909 | return; | |
320ae51f JA |
1910 | list_splice_init(&plug->mq_list, &list); |
1911 | ||
ce5b009c JA |
1912 | if (plug->rq_count > 2 && plug->multiple_queues) |
1913 | list_sort(NULL, &list, plug_rq_cmp); | |
320ae51f | 1914 | |
bcc816df DZ |
1915 | plug->rq_count = 0; |
1916 | ||
95ed0c5b PB |
1917 | do { |
1918 | struct list_head rq_list; | |
1919 | struct request *rq, *head_rq = list_entry_rq(list.next); | |
1920 | struct list_head *pos = &head_rq->queuelist; /* skip first */ | |
1921 | struct blk_mq_hw_ctx *this_hctx = head_rq->mq_hctx; | |
1922 | struct blk_mq_ctx *this_ctx = head_rq->mq_ctx; | |
1923 | unsigned int depth = 1; | |
1924 | ||
1925 | list_for_each_continue(pos, &list) { | |
1926 | rq = list_entry_rq(pos); | |
1927 | BUG_ON(!rq->q); | |
1928 | if (rq->mq_hctx != this_hctx || rq->mq_ctx != this_ctx) | |
1929 | break; | |
1930 | depth++; | |
320ae51f JA |
1931 | } |
1932 | ||
95ed0c5b PB |
1933 | list_cut_before(&rq_list, &list, pos); |
1934 | trace_block_unplug(head_rq->q, depth, !from_schedule); | |
67cae4c9 | 1935 | blk_mq_sched_insert_requests(this_hctx, this_ctx, &rq_list, |
bd166ef1 | 1936 | from_schedule); |
95ed0c5b | 1937 | } while(!list_empty(&list)); |
320ae51f JA |
1938 | } |
1939 | ||
14ccb66b CH |
1940 | static void blk_mq_bio_to_request(struct request *rq, struct bio *bio, |
1941 | unsigned int nr_segs) | |
320ae51f | 1942 | { |
93f221ae EB |
1943 | int err; |
1944 | ||
f924cdde CH |
1945 | if (bio->bi_opf & REQ_RAHEAD) |
1946 | rq->cmd_flags |= REQ_FAILFAST_MASK; | |
1947 | ||
1948 | rq->__sector = bio->bi_iter.bi_sector; | |
1949 | rq->write_hint = bio->bi_write_hint; | |
14ccb66b | 1950 | blk_rq_bio_prep(rq, bio, nr_segs); |
93f221ae EB |
1951 | |
1952 | /* This can't fail, since GFP_NOIO includes __GFP_DIRECT_RECLAIM. */ | |
1953 | err = blk_crypto_rq_bio_prep(rq, bio, GFP_NOIO); | |
1954 | WARN_ON_ONCE(err); | |
4b570521 | 1955 | |
b5af37ab | 1956 | blk_account_io_start(rq); |
320ae51f JA |
1957 | } |
1958 | ||
0f95549c MS |
1959 | static blk_status_t __blk_mq_issue_directly(struct blk_mq_hw_ctx *hctx, |
1960 | struct request *rq, | |
be94f058 | 1961 | blk_qc_t *cookie, bool last) |
f984df1f | 1962 | { |
f984df1f | 1963 | struct request_queue *q = rq->q; |
f984df1f SL |
1964 | struct blk_mq_queue_data bd = { |
1965 | .rq = rq, | |
be94f058 | 1966 | .last = last, |
f984df1f | 1967 | }; |
bd166ef1 | 1968 | blk_qc_t new_cookie; |
f06345ad | 1969 | blk_status_t ret; |
0f95549c MS |
1970 | |
1971 | new_cookie = request_to_qc_t(hctx, rq); | |
1972 | ||
1973 | /* | |
1974 | * For OK queue, we are done. For error, caller may kill it. | |
1975 | * Any other error (busy), just add it to our list as we | |
1976 | * previously would have done. | |
1977 | */ | |
1978 | ret = q->mq_ops->queue_rq(hctx, &bd); | |
1979 | switch (ret) { | |
1980 | case BLK_STS_OK: | |
6ce3dd6e | 1981 | blk_mq_update_dispatch_busy(hctx, false); |
0f95549c MS |
1982 | *cookie = new_cookie; |
1983 | break; | |
1984 | case BLK_STS_RESOURCE: | |
86ff7c2a | 1985 | case BLK_STS_DEV_RESOURCE: |
6ce3dd6e | 1986 | blk_mq_update_dispatch_busy(hctx, true); |
0f95549c MS |
1987 | __blk_mq_requeue_request(rq); |
1988 | break; | |
1989 | default: | |
6ce3dd6e | 1990 | blk_mq_update_dispatch_busy(hctx, false); |
0f95549c MS |
1991 | *cookie = BLK_QC_T_NONE; |
1992 | break; | |
1993 | } | |
1994 | ||
1995 | return ret; | |
1996 | } | |
1997 | ||
fd9c40f6 | 1998 | static blk_status_t __blk_mq_try_issue_directly(struct blk_mq_hw_ctx *hctx, |
0f95549c | 1999 | struct request *rq, |
396eaf21 | 2000 | blk_qc_t *cookie, |
fd9c40f6 | 2001 | bool bypass_insert, bool last) |
0f95549c MS |
2002 | { |
2003 | struct request_queue *q = rq->q; | |
d964f04a ML |
2004 | bool run_queue = true; |
2005 | ||
23d4ee19 | 2006 | /* |
fd9c40f6 | 2007 | * RCU or SRCU read lock is needed before checking quiesced flag. |
23d4ee19 | 2008 | * |
fd9c40f6 BVA |
2009 | * When queue is stopped or quiesced, ignore 'bypass_insert' from |
2010 | * blk_mq_request_issue_directly(), and return BLK_STS_OK to caller, | |
2011 | * and avoid driver to try to dispatch again. | |
23d4ee19 | 2012 | */ |
fd9c40f6 | 2013 | if (blk_mq_hctx_stopped(hctx) || blk_queue_quiesced(q)) { |
d964f04a | 2014 | run_queue = false; |
fd9c40f6 BVA |
2015 | bypass_insert = false; |
2016 | goto insert; | |
d964f04a | 2017 | } |
f984df1f | 2018 | |
fd9c40f6 BVA |
2019 | if (q->elevator && !bypass_insert) |
2020 | goto insert; | |
2253efc8 | 2021 | |
65c76369 | 2022 | if (!blk_mq_get_dispatch_budget(q)) |
fd9c40f6 | 2023 | goto insert; |
bd166ef1 | 2024 | |
8ab6bb9e | 2025 | if (!blk_mq_get_driver_tag(rq)) { |
65c76369 | 2026 | blk_mq_put_dispatch_budget(q); |
fd9c40f6 | 2027 | goto insert; |
88022d72 | 2028 | } |
de148297 | 2029 | |
fd9c40f6 BVA |
2030 | return __blk_mq_issue_directly(hctx, rq, cookie, last); |
2031 | insert: | |
2032 | if (bypass_insert) | |
2033 | return BLK_STS_RESOURCE; | |
2034 | ||
db03f88f ML |
2035 | blk_mq_sched_insert_request(rq, false, run_queue, false); |
2036 | ||
fd9c40f6 BVA |
2037 | return BLK_STS_OK; |
2038 | } | |
2039 | ||
105663f7 AA |
2040 | /** |
2041 | * blk_mq_try_issue_directly - Try to send a request directly to device driver. | |
2042 | * @hctx: Pointer of the associated hardware queue. | |
2043 | * @rq: Pointer to request to be sent. | |
2044 | * @cookie: Request queue cookie. | |
2045 | * | |
2046 | * If the device has enough resources to accept a new request now, send the | |
2047 | * request directly to device driver. Else, insert at hctx->dispatch queue, so | |
2048 | * we can try send it another time in the future. Requests inserted at this | |
2049 | * queue have higher priority. | |
2050 | */ | |
fd9c40f6 BVA |
2051 | static void blk_mq_try_issue_directly(struct blk_mq_hw_ctx *hctx, |
2052 | struct request *rq, blk_qc_t *cookie) | |
2053 | { | |
2054 | blk_status_t ret; | |
2055 | int srcu_idx; | |
2056 | ||
2057 | might_sleep_if(hctx->flags & BLK_MQ_F_BLOCKING); | |
2058 | ||
2059 | hctx_lock(hctx, &srcu_idx); | |
2060 | ||
2061 | ret = __blk_mq_try_issue_directly(hctx, rq, cookie, false, true); | |
2062 | if (ret == BLK_STS_RESOURCE || ret == BLK_STS_DEV_RESOURCE) | |
01e99aec | 2063 | blk_mq_request_bypass_insert(rq, false, true); |
fd9c40f6 BVA |
2064 | else if (ret != BLK_STS_OK) |
2065 | blk_mq_end_request(rq, ret); | |
2066 | ||
2067 | hctx_unlock(hctx, srcu_idx); | |
2068 | } | |
2069 | ||
2070 | blk_status_t blk_mq_request_issue_directly(struct request *rq, bool last) | |
2071 | { | |
2072 | blk_status_t ret; | |
2073 | int srcu_idx; | |
2074 | blk_qc_t unused_cookie; | |
2075 | struct blk_mq_hw_ctx *hctx = rq->mq_hctx; | |
2076 | ||
2077 | hctx_lock(hctx, &srcu_idx); | |
2078 | ret = __blk_mq_try_issue_directly(hctx, rq, &unused_cookie, true, last); | |
04ced159 | 2079 | hctx_unlock(hctx, srcu_idx); |
7f556a44 JW |
2080 | |
2081 | return ret; | |
5eb6126e CH |
2082 | } |
2083 | ||
6ce3dd6e ML |
2084 | void blk_mq_try_issue_list_directly(struct blk_mq_hw_ctx *hctx, |
2085 | struct list_head *list) | |
2086 | { | |
536167d4 KB |
2087 | int queued = 0; |
2088 | ||
6ce3dd6e | 2089 | while (!list_empty(list)) { |
fd9c40f6 | 2090 | blk_status_t ret; |
6ce3dd6e ML |
2091 | struct request *rq = list_first_entry(list, struct request, |
2092 | queuelist); | |
2093 | ||
2094 | list_del_init(&rq->queuelist); | |
fd9c40f6 BVA |
2095 | ret = blk_mq_request_issue_directly(rq, list_empty(list)); |
2096 | if (ret != BLK_STS_OK) { | |
2097 | if (ret == BLK_STS_RESOURCE || | |
2098 | ret == BLK_STS_DEV_RESOURCE) { | |
01e99aec | 2099 | blk_mq_request_bypass_insert(rq, false, |
c616cbee | 2100 | list_empty(list)); |
fd9c40f6 BVA |
2101 | break; |
2102 | } | |
2103 | blk_mq_end_request(rq, ret); | |
536167d4 KB |
2104 | } else |
2105 | queued++; | |
6ce3dd6e | 2106 | } |
d666ba98 JA |
2107 | |
2108 | /* | |
2109 | * If we didn't flush the entire list, we could have told | |
2110 | * the driver there was more coming, but that turned out to | |
2111 | * be a lie. | |
2112 | */ | |
536167d4 | 2113 | if (!list_empty(list) && hctx->queue->mq_ops->commit_rqs && queued) |
d666ba98 | 2114 | hctx->queue->mq_ops->commit_rqs(hctx); |
6ce3dd6e ML |
2115 | } |
2116 | ||
ce5b009c JA |
2117 | static void blk_add_rq_to_plug(struct blk_plug *plug, struct request *rq) |
2118 | { | |
2119 | list_add_tail(&rq->queuelist, &plug->mq_list); | |
2120 | plug->rq_count++; | |
2121 | if (!plug->multiple_queues && !list_is_singular(&plug->mq_list)) { | |
2122 | struct request *tmp; | |
2123 | ||
2124 | tmp = list_first_entry(&plug->mq_list, struct request, | |
2125 | queuelist); | |
2126 | if (tmp->q != rq->q) | |
2127 | plug->multiple_queues = true; | |
2128 | } | |
2129 | } | |
2130 | ||
105663f7 | 2131 | /** |
c62b37d9 | 2132 | * blk_mq_submit_bio - Create and send a request to block device. |
105663f7 AA |
2133 | * @bio: Bio pointer. |
2134 | * | |
2135 | * Builds up a request structure from @q and @bio and send to the device. The | |
2136 | * request may not be queued directly to hardware if: | |
2137 | * * This request can be merged with another one | |
2138 | * * We want to place request at plug queue for possible future merging | |
2139 | * * There is an IO scheduler active at this queue | |
2140 | * | |
2141 | * It will not queue the request if there is an error with the bio, or at the | |
2142 | * request creation. | |
2143 | * | |
2144 | * Returns: Request queue cookie. | |
2145 | */ | |
c62b37d9 | 2146 | blk_qc_t blk_mq_submit_bio(struct bio *bio) |
07068d5b | 2147 | { |
c62b37d9 | 2148 | struct request_queue *q = bio->bi_disk->queue; |
ef295ecf | 2149 | const int is_sync = op_is_sync(bio->bi_opf); |
f73f44eb | 2150 | const int is_flush_fua = op_is_flush(bio->bi_opf); |
e6e7abff CH |
2151 | struct blk_mq_alloc_data data = { |
2152 | .q = q, | |
2153 | }; | |
07068d5b | 2154 | struct request *rq; |
f984df1f | 2155 | struct blk_plug *plug; |
5b3f341f | 2156 | struct request *same_queue_rq = NULL; |
14ccb66b | 2157 | unsigned int nr_segs; |
7b371636 | 2158 | blk_qc_t cookie; |
a892c8d5 | 2159 | blk_status_t ret; |
07068d5b JA |
2160 | |
2161 | blk_queue_bounce(q, &bio); | |
f695ca38 | 2162 | __blk_queue_split(&bio, &nr_segs); |
f36ea50c | 2163 | |
e23947bd | 2164 | if (!bio_integrity_prep(bio)) |
ac7c5675 | 2165 | goto queue_exit; |
07068d5b | 2166 | |
87c279e6 | 2167 | if (!is_flush_fua && !blk_queue_nomerges(q) && |
14ccb66b | 2168 | blk_attempt_plug_merge(q, bio, nr_segs, &same_queue_rq)) |
ac7c5675 | 2169 | goto queue_exit; |
f984df1f | 2170 | |
14ccb66b | 2171 | if (blk_mq_sched_bio_merge(q, bio, nr_segs)) |
ac7c5675 | 2172 | goto queue_exit; |
bd166ef1 | 2173 | |
d5337560 | 2174 | rq_qos_throttle(q, bio); |
87760e5e | 2175 | |
7809167d | 2176 | data.cmd_flags = bio->bi_opf; |
e6e7abff | 2177 | rq = __blk_mq_alloc_request(&data); |
87760e5e | 2178 | if (unlikely(!rq)) { |
c1c80384 | 2179 | rq_qos_cleanup(q, bio); |
7b6620d7 | 2180 | if (bio->bi_opf & REQ_NOWAIT) |
03a07c92 | 2181 | bio_wouldblock_error(bio); |
ac7c5675 | 2182 | goto queue_exit; |
87760e5e JA |
2183 | } |
2184 | ||
d6f1dda2 XW |
2185 | trace_block_getrq(q, bio, bio->bi_opf); |
2186 | ||
c1c80384 | 2187 | rq_qos_track(q, rq, bio); |
07068d5b | 2188 | |
fd2d3326 | 2189 | cookie = request_to_qc_t(data.hctx, rq); |
07068d5b | 2190 | |
970d168d BVA |
2191 | blk_mq_bio_to_request(rq, bio, nr_segs); |
2192 | ||
a892c8d5 ST |
2193 | ret = blk_crypto_init_request(rq); |
2194 | if (ret != BLK_STS_OK) { | |
2195 | bio->bi_status = ret; | |
2196 | bio_endio(bio); | |
2197 | blk_mq_free_request(rq); | |
2198 | return BLK_QC_T_NONE; | |
2199 | } | |
2200 | ||
b49773e7 | 2201 | plug = blk_mq_plug(q, bio); |
07068d5b | 2202 | if (unlikely(is_flush_fua)) { |
105663f7 | 2203 | /* Bypass scheduler for flush requests */ |
923218f6 ML |
2204 | blk_insert_flush(rq); |
2205 | blk_mq_run_hw_queue(data.hctx, true); | |
3154df26 ML |
2206 | } else if (plug && (q->nr_hw_queues == 1 || q->mq_ops->commit_rqs || |
2207 | !blk_queue_nonrot(q))) { | |
b2c5d16b JA |
2208 | /* |
2209 | * Use plugging if we have a ->commit_rqs() hook as well, as | |
2210 | * we know the driver uses bd->last in a smart fashion. | |
3154df26 ML |
2211 | * |
2212 | * Use normal plugging if this disk is slow HDD, as sequential | |
2213 | * IO may benefit a lot from plug merging. | |
b2c5d16b | 2214 | */ |
5f0ed774 | 2215 | unsigned int request_count = plug->rq_count; |
600271d9 SL |
2216 | struct request *last = NULL; |
2217 | ||
676d0607 | 2218 | if (!request_count) |
e6c4438b | 2219 | trace_block_plug(q); |
600271d9 SL |
2220 | else |
2221 | last = list_entry_rq(plug->mq_list.prev); | |
b094f89c | 2222 | |
600271d9 SL |
2223 | if (request_count >= BLK_MAX_REQUEST_COUNT || (last && |
2224 | blk_rq_bytes(last) >= BLK_PLUG_FLUSH_SIZE)) { | |
e6c4438b JM |
2225 | blk_flush_plug_list(plug, false); |
2226 | trace_block_plug(q); | |
320ae51f | 2227 | } |
b094f89c | 2228 | |
ce5b009c | 2229 | blk_add_rq_to_plug(plug, rq); |
a12de1d4 | 2230 | } else if (q->elevator) { |
105663f7 | 2231 | /* Insert the request at the IO scheduler queue */ |
a12de1d4 | 2232 | blk_mq_sched_insert_request(rq, false, true, true); |
2299722c | 2233 | } else if (plug && !blk_queue_nomerges(q)) { |
07068d5b | 2234 | /* |
6a83e74d | 2235 | * We do limited plugging. If the bio can be merged, do that. |
f984df1f SL |
2236 | * Otherwise the existing request in the plug list will be |
2237 | * issued. So the plug list will have one request at most | |
2299722c CH |
2238 | * The plug list might get flushed before this. If that happens, |
2239 | * the plug list is empty, and same_queue_rq is invalid. | |
07068d5b | 2240 | */ |
2299722c CH |
2241 | if (list_empty(&plug->mq_list)) |
2242 | same_queue_rq = NULL; | |
4711b573 | 2243 | if (same_queue_rq) { |
2299722c | 2244 | list_del_init(&same_queue_rq->queuelist); |
4711b573 JA |
2245 | plug->rq_count--; |
2246 | } | |
ce5b009c | 2247 | blk_add_rq_to_plug(plug, rq); |
ff3b74b8 | 2248 | trace_block_plug(q); |
2299722c | 2249 | |
dad7a3be | 2250 | if (same_queue_rq) { |
ea4f995e | 2251 | data.hctx = same_queue_rq->mq_hctx; |
ff3b74b8 | 2252 | trace_block_unplug(q, 1, true); |
2299722c | 2253 | blk_mq_try_issue_directly(data.hctx, same_queue_rq, |
fd9c40f6 | 2254 | &cookie); |
dad7a3be | 2255 | } |
a12de1d4 ML |
2256 | } else if ((q->nr_hw_queues > 1 && is_sync) || |
2257 | !data.hctx->dispatch_busy) { | |
105663f7 AA |
2258 | /* |
2259 | * There is no scheduler and we can try to send directly | |
2260 | * to the hardware. | |
2261 | */ | |
fd9c40f6 | 2262 | blk_mq_try_issue_directly(data.hctx, rq, &cookie); |
ab42f35d | 2263 | } else { |
105663f7 | 2264 | /* Default case. */ |
8fa9f556 | 2265 | blk_mq_sched_insert_request(rq, false, true, true); |
ab42f35d | 2266 | } |
320ae51f | 2267 | |
7b371636 | 2268 | return cookie; |
ac7c5675 CH |
2269 | queue_exit: |
2270 | blk_queue_exit(q); | |
2271 | return BLK_QC_T_NONE; | |
320ae51f | 2272 | } |
c62b37d9 | 2273 | EXPORT_SYMBOL_GPL(blk_mq_submit_bio); /* only for request based dm */ |
320ae51f | 2274 | |
cc71a6f4 JA |
2275 | void blk_mq_free_rqs(struct blk_mq_tag_set *set, struct blk_mq_tags *tags, |
2276 | unsigned int hctx_idx) | |
95363efd | 2277 | { |
e9b267d9 | 2278 | struct page *page; |
320ae51f | 2279 | |
24d2f903 | 2280 | if (tags->rqs && set->ops->exit_request) { |
e9b267d9 | 2281 | int i; |
320ae51f | 2282 | |
24d2f903 | 2283 | for (i = 0; i < tags->nr_tags; i++) { |
2af8cbe3 JA |
2284 | struct request *rq = tags->static_rqs[i]; |
2285 | ||
2286 | if (!rq) | |
e9b267d9 | 2287 | continue; |
d6296d39 | 2288 | set->ops->exit_request(set, rq, hctx_idx); |
2af8cbe3 | 2289 | tags->static_rqs[i] = NULL; |
e9b267d9 | 2290 | } |
320ae51f | 2291 | } |
320ae51f | 2292 | |
24d2f903 CH |
2293 | while (!list_empty(&tags->page_list)) { |
2294 | page = list_first_entry(&tags->page_list, struct page, lru); | |
6753471c | 2295 | list_del_init(&page->lru); |
f75782e4 CM |
2296 | /* |
2297 | * Remove kmemleak object previously allocated in | |
273938bf | 2298 | * blk_mq_alloc_rqs(). |
f75782e4 CM |
2299 | */ |
2300 | kmemleak_free(page_address(page)); | |
320ae51f JA |
2301 | __free_pages(page, page->private); |
2302 | } | |
cc71a6f4 | 2303 | } |
320ae51f | 2304 | |
1c0706a7 | 2305 | void blk_mq_free_rq_map(struct blk_mq_tags *tags, unsigned int flags) |
cc71a6f4 | 2306 | { |
24d2f903 | 2307 | kfree(tags->rqs); |
cc71a6f4 | 2308 | tags->rqs = NULL; |
2af8cbe3 JA |
2309 | kfree(tags->static_rqs); |
2310 | tags->static_rqs = NULL; | |
320ae51f | 2311 | |
1c0706a7 | 2312 | blk_mq_free_tags(tags, flags); |
320ae51f JA |
2313 | } |
2314 | ||
cc71a6f4 JA |
2315 | struct blk_mq_tags *blk_mq_alloc_rq_map(struct blk_mq_tag_set *set, |
2316 | unsigned int hctx_idx, | |
2317 | unsigned int nr_tags, | |
1c0706a7 JG |
2318 | unsigned int reserved_tags, |
2319 | unsigned int flags) | |
320ae51f | 2320 | { |
24d2f903 | 2321 | struct blk_mq_tags *tags; |
59f082e4 | 2322 | int node; |
320ae51f | 2323 | |
7d76f856 | 2324 | node = blk_mq_hw_queue_to_node(&set->map[HCTX_TYPE_DEFAULT], hctx_idx); |
59f082e4 SL |
2325 | if (node == NUMA_NO_NODE) |
2326 | node = set->numa_node; | |
2327 | ||
1c0706a7 | 2328 | tags = blk_mq_init_tags(nr_tags, reserved_tags, node, flags); |
24d2f903 CH |
2329 | if (!tags) |
2330 | return NULL; | |
320ae51f | 2331 | |
590b5b7d | 2332 | tags->rqs = kcalloc_node(nr_tags, sizeof(struct request *), |
36e1f3d1 | 2333 | GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY, |
59f082e4 | 2334 | node); |
24d2f903 | 2335 | if (!tags->rqs) { |
1c0706a7 | 2336 | blk_mq_free_tags(tags, flags); |
24d2f903 CH |
2337 | return NULL; |
2338 | } | |
320ae51f | 2339 | |
590b5b7d KC |
2340 | tags->static_rqs = kcalloc_node(nr_tags, sizeof(struct request *), |
2341 | GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY, | |
2342 | node); | |
2af8cbe3 JA |
2343 | if (!tags->static_rqs) { |
2344 | kfree(tags->rqs); | |
1c0706a7 | 2345 | blk_mq_free_tags(tags, flags); |
2af8cbe3 JA |
2346 | return NULL; |
2347 | } | |
2348 | ||
cc71a6f4 JA |
2349 | return tags; |
2350 | } | |
2351 | ||
2352 | static size_t order_to_size(unsigned int order) | |
2353 | { | |
2354 | return (size_t)PAGE_SIZE << order; | |
2355 | } | |
2356 | ||
1d9bd516 TH |
2357 | static int blk_mq_init_request(struct blk_mq_tag_set *set, struct request *rq, |
2358 | unsigned int hctx_idx, int node) | |
2359 | { | |
2360 | int ret; | |
2361 | ||
2362 | if (set->ops->init_request) { | |
2363 | ret = set->ops->init_request(set, rq, hctx_idx, node); | |
2364 | if (ret) | |
2365 | return ret; | |
2366 | } | |
2367 | ||
12f5b931 | 2368 | WRITE_ONCE(rq->state, MQ_RQ_IDLE); |
1d9bd516 TH |
2369 | return 0; |
2370 | } | |
2371 | ||
cc71a6f4 JA |
2372 | int blk_mq_alloc_rqs(struct blk_mq_tag_set *set, struct blk_mq_tags *tags, |
2373 | unsigned int hctx_idx, unsigned int depth) | |
2374 | { | |
2375 | unsigned int i, j, entries_per_page, max_order = 4; | |
2376 | size_t rq_size, left; | |
59f082e4 SL |
2377 | int node; |
2378 | ||
7d76f856 | 2379 | node = blk_mq_hw_queue_to_node(&set->map[HCTX_TYPE_DEFAULT], hctx_idx); |
59f082e4 SL |
2380 | if (node == NUMA_NO_NODE) |
2381 | node = set->numa_node; | |
cc71a6f4 JA |
2382 | |
2383 | INIT_LIST_HEAD(&tags->page_list); | |
2384 | ||
320ae51f JA |
2385 | /* |
2386 | * rq_size is the size of the request plus driver payload, rounded | |
2387 | * to the cacheline size | |
2388 | */ | |
24d2f903 | 2389 | rq_size = round_up(sizeof(struct request) + set->cmd_size, |
320ae51f | 2390 | cache_line_size()); |
cc71a6f4 | 2391 | left = rq_size * depth; |
320ae51f | 2392 | |
cc71a6f4 | 2393 | for (i = 0; i < depth; ) { |
320ae51f JA |
2394 | int this_order = max_order; |
2395 | struct page *page; | |
2396 | int to_do; | |
2397 | void *p; | |
2398 | ||
b3a834b1 | 2399 | while (this_order && left < order_to_size(this_order - 1)) |
320ae51f JA |
2400 | this_order--; |
2401 | ||
2402 | do { | |
59f082e4 | 2403 | page = alloc_pages_node(node, |
36e1f3d1 | 2404 | GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY | __GFP_ZERO, |
a5164405 | 2405 | this_order); |
320ae51f JA |
2406 | if (page) |
2407 | break; | |
2408 | if (!this_order--) | |
2409 | break; | |
2410 | if (order_to_size(this_order) < rq_size) | |
2411 | break; | |
2412 | } while (1); | |
2413 | ||
2414 | if (!page) | |
24d2f903 | 2415 | goto fail; |
320ae51f JA |
2416 | |
2417 | page->private = this_order; | |
24d2f903 | 2418 | list_add_tail(&page->lru, &tags->page_list); |
320ae51f JA |
2419 | |
2420 | p = page_address(page); | |
f75782e4 CM |
2421 | /* |
2422 | * Allow kmemleak to scan these pages as they contain pointers | |
2423 | * to additional allocations like via ops->init_request(). | |
2424 | */ | |
36e1f3d1 | 2425 | kmemleak_alloc(p, order_to_size(this_order), 1, GFP_NOIO); |
320ae51f | 2426 | entries_per_page = order_to_size(this_order) / rq_size; |
cc71a6f4 | 2427 | to_do = min(entries_per_page, depth - i); |
320ae51f JA |
2428 | left -= to_do * rq_size; |
2429 | for (j = 0; j < to_do; j++) { | |
2af8cbe3 JA |
2430 | struct request *rq = p; |
2431 | ||
2432 | tags->static_rqs[i] = rq; | |
1d9bd516 TH |
2433 | if (blk_mq_init_request(set, rq, hctx_idx, node)) { |
2434 | tags->static_rqs[i] = NULL; | |
2435 | goto fail; | |
e9b267d9 CH |
2436 | } |
2437 | ||
320ae51f JA |
2438 | p += rq_size; |
2439 | i++; | |
2440 | } | |
2441 | } | |
cc71a6f4 | 2442 | return 0; |
320ae51f | 2443 | |
24d2f903 | 2444 | fail: |
cc71a6f4 JA |
2445 | blk_mq_free_rqs(set, tags, hctx_idx); |
2446 | return -ENOMEM; | |
320ae51f JA |
2447 | } |
2448 | ||
bf0beec0 ML |
2449 | struct rq_iter_data { |
2450 | struct blk_mq_hw_ctx *hctx; | |
2451 | bool has_rq; | |
2452 | }; | |
2453 | ||
2454 | static bool blk_mq_has_request(struct request *rq, void *data, bool reserved) | |
2455 | { | |
2456 | struct rq_iter_data *iter_data = data; | |
2457 | ||
2458 | if (rq->mq_hctx != iter_data->hctx) | |
2459 | return true; | |
2460 | iter_data->has_rq = true; | |
2461 | return false; | |
2462 | } | |
2463 | ||
2464 | static bool blk_mq_hctx_has_requests(struct blk_mq_hw_ctx *hctx) | |
2465 | { | |
2466 | struct blk_mq_tags *tags = hctx->sched_tags ? | |
2467 | hctx->sched_tags : hctx->tags; | |
2468 | struct rq_iter_data data = { | |
2469 | .hctx = hctx, | |
2470 | }; | |
2471 | ||
2472 | blk_mq_all_tag_iter(tags, blk_mq_has_request, &data); | |
2473 | return data.has_rq; | |
2474 | } | |
2475 | ||
2476 | static inline bool blk_mq_last_cpu_in_hctx(unsigned int cpu, | |
2477 | struct blk_mq_hw_ctx *hctx) | |
2478 | { | |
2479 | if (cpumask_next_and(-1, hctx->cpumask, cpu_online_mask) != cpu) | |
2480 | return false; | |
2481 | if (cpumask_next_and(cpu, hctx->cpumask, cpu_online_mask) < nr_cpu_ids) | |
2482 | return false; | |
2483 | return true; | |
2484 | } | |
2485 | ||
2486 | static int blk_mq_hctx_notify_offline(unsigned int cpu, struct hlist_node *node) | |
2487 | { | |
2488 | struct blk_mq_hw_ctx *hctx = hlist_entry_safe(node, | |
2489 | struct blk_mq_hw_ctx, cpuhp_online); | |
2490 | ||
2491 | if (!cpumask_test_cpu(cpu, hctx->cpumask) || | |
2492 | !blk_mq_last_cpu_in_hctx(cpu, hctx)) | |
2493 | return 0; | |
2494 | ||
2495 | /* | |
2496 | * Prevent new request from being allocated on the current hctx. | |
2497 | * | |
2498 | * The smp_mb__after_atomic() Pairs with the implied barrier in | |
2499 | * test_and_set_bit_lock in sbitmap_get(). Ensures the inactive flag is | |
2500 | * seen once we return from the tag allocator. | |
2501 | */ | |
2502 | set_bit(BLK_MQ_S_INACTIVE, &hctx->state); | |
2503 | smp_mb__after_atomic(); | |
2504 | ||
2505 | /* | |
2506 | * Try to grab a reference to the queue and wait for any outstanding | |
2507 | * requests. If we could not grab a reference the queue has been | |
2508 | * frozen and there are no requests. | |
2509 | */ | |
2510 | if (percpu_ref_tryget(&hctx->queue->q_usage_counter)) { | |
2511 | while (blk_mq_hctx_has_requests(hctx)) | |
2512 | msleep(5); | |
2513 | percpu_ref_put(&hctx->queue->q_usage_counter); | |
2514 | } | |
2515 | ||
2516 | return 0; | |
2517 | } | |
2518 | ||
2519 | static int blk_mq_hctx_notify_online(unsigned int cpu, struct hlist_node *node) | |
2520 | { | |
2521 | struct blk_mq_hw_ctx *hctx = hlist_entry_safe(node, | |
2522 | struct blk_mq_hw_ctx, cpuhp_online); | |
2523 | ||
2524 | if (cpumask_test_cpu(cpu, hctx->cpumask)) | |
2525 | clear_bit(BLK_MQ_S_INACTIVE, &hctx->state); | |
2526 | return 0; | |
2527 | } | |
2528 | ||
e57690fe JA |
2529 | /* |
2530 | * 'cpu' is going away. splice any existing rq_list entries from this | |
2531 | * software queue to the hw queue dispatch list, and ensure that it | |
2532 | * gets run. | |
2533 | */ | |
9467f859 | 2534 | static int blk_mq_hctx_notify_dead(unsigned int cpu, struct hlist_node *node) |
484b4061 | 2535 | { |
9467f859 | 2536 | struct blk_mq_hw_ctx *hctx; |
484b4061 JA |
2537 | struct blk_mq_ctx *ctx; |
2538 | LIST_HEAD(tmp); | |
c16d6b5a | 2539 | enum hctx_type type; |
484b4061 | 2540 | |
9467f859 | 2541 | hctx = hlist_entry_safe(node, struct blk_mq_hw_ctx, cpuhp_dead); |
bf0beec0 ML |
2542 | if (!cpumask_test_cpu(cpu, hctx->cpumask)) |
2543 | return 0; | |
2544 | ||
e57690fe | 2545 | ctx = __blk_mq_get_ctx(hctx->queue, cpu); |
c16d6b5a | 2546 | type = hctx->type; |
484b4061 JA |
2547 | |
2548 | spin_lock(&ctx->lock); | |
c16d6b5a ML |
2549 | if (!list_empty(&ctx->rq_lists[type])) { |
2550 | list_splice_init(&ctx->rq_lists[type], &tmp); | |
484b4061 JA |
2551 | blk_mq_hctx_clear_pending(hctx, ctx); |
2552 | } | |
2553 | spin_unlock(&ctx->lock); | |
2554 | ||
2555 | if (list_empty(&tmp)) | |
9467f859 | 2556 | return 0; |
484b4061 | 2557 | |
e57690fe JA |
2558 | spin_lock(&hctx->lock); |
2559 | list_splice_tail_init(&tmp, &hctx->dispatch); | |
2560 | spin_unlock(&hctx->lock); | |
484b4061 JA |
2561 | |
2562 | blk_mq_run_hw_queue(hctx, true); | |
9467f859 | 2563 | return 0; |
484b4061 JA |
2564 | } |
2565 | ||
9467f859 | 2566 | static void blk_mq_remove_cpuhp(struct blk_mq_hw_ctx *hctx) |
484b4061 | 2567 | { |
bf0beec0 ML |
2568 | if (!(hctx->flags & BLK_MQ_F_STACKING)) |
2569 | cpuhp_state_remove_instance_nocalls(CPUHP_AP_BLK_MQ_ONLINE, | |
2570 | &hctx->cpuhp_online); | |
9467f859 TG |
2571 | cpuhp_state_remove_instance_nocalls(CPUHP_BLK_MQ_DEAD, |
2572 | &hctx->cpuhp_dead); | |
484b4061 JA |
2573 | } |
2574 | ||
c3b4afca | 2575 | /* hctx->ctxs will be freed in queue's release handler */ |
08e98fc6 ML |
2576 | static void blk_mq_exit_hctx(struct request_queue *q, |
2577 | struct blk_mq_tag_set *set, | |
2578 | struct blk_mq_hw_ctx *hctx, unsigned int hctx_idx) | |
2579 | { | |
8ab0b7dc ML |
2580 | if (blk_mq_hw_queue_mapped(hctx)) |
2581 | blk_mq_tag_idle(hctx); | |
08e98fc6 | 2582 | |
f70ced09 | 2583 | if (set->ops->exit_request) |
d6296d39 | 2584 | set->ops->exit_request(set, hctx->fq->flush_rq, hctx_idx); |
f70ced09 | 2585 | |
08e98fc6 ML |
2586 | if (set->ops->exit_hctx) |
2587 | set->ops->exit_hctx(hctx, hctx_idx); | |
2588 | ||
9467f859 | 2589 | blk_mq_remove_cpuhp(hctx); |
2f8f1336 ML |
2590 | |
2591 | spin_lock(&q->unused_hctx_lock); | |
2592 | list_add(&hctx->hctx_list, &q->unused_hctx_list); | |
2593 | spin_unlock(&q->unused_hctx_lock); | |
08e98fc6 ML |
2594 | } |
2595 | ||
624dbe47 ML |
2596 | static void blk_mq_exit_hw_queues(struct request_queue *q, |
2597 | struct blk_mq_tag_set *set, int nr_queue) | |
2598 | { | |
2599 | struct blk_mq_hw_ctx *hctx; | |
2600 | unsigned int i; | |
2601 | ||
2602 | queue_for_each_hw_ctx(q, hctx, i) { | |
2603 | if (i == nr_queue) | |
2604 | break; | |
477e19de | 2605 | blk_mq_debugfs_unregister_hctx(hctx); |
08e98fc6 | 2606 | blk_mq_exit_hctx(q, set, hctx, i); |
624dbe47 | 2607 | } |
624dbe47 ML |
2608 | } |
2609 | ||
7c6c5b7c ML |
2610 | static int blk_mq_hw_ctx_size(struct blk_mq_tag_set *tag_set) |
2611 | { | |
2612 | int hw_ctx_size = sizeof(struct blk_mq_hw_ctx); | |
2613 | ||
2614 | BUILD_BUG_ON(ALIGN(offsetof(struct blk_mq_hw_ctx, srcu), | |
2615 | __alignof__(struct blk_mq_hw_ctx)) != | |
2616 | sizeof(struct blk_mq_hw_ctx)); | |
2617 | ||
2618 | if (tag_set->flags & BLK_MQ_F_BLOCKING) | |
2619 | hw_ctx_size += sizeof(struct srcu_struct); | |
2620 | ||
2621 | return hw_ctx_size; | |
2622 | } | |
2623 | ||
08e98fc6 ML |
2624 | static int blk_mq_init_hctx(struct request_queue *q, |
2625 | struct blk_mq_tag_set *set, | |
2626 | struct blk_mq_hw_ctx *hctx, unsigned hctx_idx) | |
320ae51f | 2627 | { |
7c6c5b7c ML |
2628 | hctx->queue_num = hctx_idx; |
2629 | ||
bf0beec0 ML |
2630 | if (!(hctx->flags & BLK_MQ_F_STACKING)) |
2631 | cpuhp_state_add_instance_nocalls(CPUHP_AP_BLK_MQ_ONLINE, | |
2632 | &hctx->cpuhp_online); | |
7c6c5b7c ML |
2633 | cpuhp_state_add_instance_nocalls(CPUHP_BLK_MQ_DEAD, &hctx->cpuhp_dead); |
2634 | ||
2635 | hctx->tags = set->tags[hctx_idx]; | |
2636 | ||
2637 | if (set->ops->init_hctx && | |
2638 | set->ops->init_hctx(hctx, set->driver_data, hctx_idx)) | |
2639 | goto unregister_cpu_notifier; | |
08e98fc6 | 2640 | |
7c6c5b7c ML |
2641 | if (blk_mq_init_request(set, hctx->fq->flush_rq, hctx_idx, |
2642 | hctx->numa_node)) | |
2643 | goto exit_hctx; | |
2644 | return 0; | |
2645 | ||
2646 | exit_hctx: | |
2647 | if (set->ops->exit_hctx) | |
2648 | set->ops->exit_hctx(hctx, hctx_idx); | |
2649 | unregister_cpu_notifier: | |
2650 | blk_mq_remove_cpuhp(hctx); | |
2651 | return -1; | |
2652 | } | |
2653 | ||
2654 | static struct blk_mq_hw_ctx * | |
2655 | blk_mq_alloc_hctx(struct request_queue *q, struct blk_mq_tag_set *set, | |
2656 | int node) | |
2657 | { | |
2658 | struct blk_mq_hw_ctx *hctx; | |
2659 | gfp_t gfp = GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY; | |
2660 | ||
2661 | hctx = kzalloc_node(blk_mq_hw_ctx_size(set), gfp, node); | |
2662 | if (!hctx) | |
2663 | goto fail_alloc_hctx; | |
2664 | ||
2665 | if (!zalloc_cpumask_var_node(&hctx->cpumask, gfp, node)) | |
2666 | goto free_hctx; | |
2667 | ||
2668 | atomic_set(&hctx->nr_active, 0); | |
b445547e | 2669 | atomic_set(&hctx->elevator_queued, 0); |
08e98fc6 | 2670 | if (node == NUMA_NO_NODE) |
7c6c5b7c ML |
2671 | node = set->numa_node; |
2672 | hctx->numa_node = node; | |
08e98fc6 | 2673 | |
9f993737 | 2674 | INIT_DELAYED_WORK(&hctx->run_work, blk_mq_run_work_fn); |
08e98fc6 ML |
2675 | spin_lock_init(&hctx->lock); |
2676 | INIT_LIST_HEAD(&hctx->dispatch); | |
2677 | hctx->queue = q; | |
51db1c37 | 2678 | hctx->flags = set->flags & ~BLK_MQ_F_TAG_QUEUE_SHARED; |
08e98fc6 | 2679 | |
2f8f1336 ML |
2680 | INIT_LIST_HEAD(&hctx->hctx_list); |
2681 | ||
320ae51f | 2682 | /* |
08e98fc6 ML |
2683 | * Allocate space for all possible cpus to avoid allocation at |
2684 | * runtime | |
320ae51f | 2685 | */ |
d904bfa7 | 2686 | hctx->ctxs = kmalloc_array_node(nr_cpu_ids, sizeof(void *), |
7c6c5b7c | 2687 | gfp, node); |
08e98fc6 | 2688 | if (!hctx->ctxs) |
7c6c5b7c | 2689 | goto free_cpumask; |
320ae51f | 2690 | |
5b202853 | 2691 | if (sbitmap_init_node(&hctx->ctx_map, nr_cpu_ids, ilog2(8), |
7c6c5b7c | 2692 | gfp, node)) |
08e98fc6 | 2693 | goto free_ctxs; |
08e98fc6 | 2694 | hctx->nr_ctx = 0; |
320ae51f | 2695 | |
5815839b | 2696 | spin_lock_init(&hctx->dispatch_wait_lock); |
eb619fdb JA |
2697 | init_waitqueue_func_entry(&hctx->dispatch_wait, blk_mq_dispatch_wake); |
2698 | INIT_LIST_HEAD(&hctx->dispatch_wait.entry); | |
2699 | ||
754a1572 | 2700 | hctx->fq = blk_alloc_flush_queue(hctx->numa_node, set->cmd_size, gfp); |
f70ced09 | 2701 | if (!hctx->fq) |
7c6c5b7c | 2702 | goto free_bitmap; |
320ae51f | 2703 | |
6a83e74d | 2704 | if (hctx->flags & BLK_MQ_F_BLOCKING) |
05707b64 | 2705 | init_srcu_struct(hctx->srcu); |
7c6c5b7c | 2706 | blk_mq_hctx_kobj_init(hctx); |
6a83e74d | 2707 | |
7c6c5b7c | 2708 | return hctx; |
320ae51f | 2709 | |
08e98fc6 | 2710 | free_bitmap: |
88459642 | 2711 | sbitmap_free(&hctx->ctx_map); |
08e98fc6 ML |
2712 | free_ctxs: |
2713 | kfree(hctx->ctxs); | |
7c6c5b7c ML |
2714 | free_cpumask: |
2715 | free_cpumask_var(hctx->cpumask); | |
2716 | free_hctx: | |
2717 | kfree(hctx); | |
2718 | fail_alloc_hctx: | |
2719 | return NULL; | |
08e98fc6 | 2720 | } |
320ae51f | 2721 | |
320ae51f JA |
2722 | static void blk_mq_init_cpu_queues(struct request_queue *q, |
2723 | unsigned int nr_hw_queues) | |
2724 | { | |
b3c661b1 JA |
2725 | struct blk_mq_tag_set *set = q->tag_set; |
2726 | unsigned int i, j; | |
320ae51f JA |
2727 | |
2728 | for_each_possible_cpu(i) { | |
2729 | struct blk_mq_ctx *__ctx = per_cpu_ptr(q->queue_ctx, i); | |
2730 | struct blk_mq_hw_ctx *hctx; | |
c16d6b5a | 2731 | int k; |
320ae51f | 2732 | |
320ae51f JA |
2733 | __ctx->cpu = i; |
2734 | spin_lock_init(&__ctx->lock); | |
c16d6b5a ML |
2735 | for (k = HCTX_TYPE_DEFAULT; k < HCTX_MAX_TYPES; k++) |
2736 | INIT_LIST_HEAD(&__ctx->rq_lists[k]); | |
2737 | ||
320ae51f JA |
2738 | __ctx->queue = q; |
2739 | ||
320ae51f JA |
2740 | /* |
2741 | * Set local node, IFF we have more than one hw queue. If | |
2742 | * not, we remain on the home node of the device | |
2743 | */ | |
b3c661b1 JA |
2744 | for (j = 0; j < set->nr_maps; j++) { |
2745 | hctx = blk_mq_map_queue_type(q, j, i); | |
2746 | if (nr_hw_queues > 1 && hctx->numa_node == NUMA_NO_NODE) | |
2747 | hctx->numa_node = local_memory_node(cpu_to_node(i)); | |
2748 | } | |
320ae51f JA |
2749 | } |
2750 | } | |
2751 | ||
03b63b02 WZ |
2752 | static bool __blk_mq_alloc_map_and_request(struct blk_mq_tag_set *set, |
2753 | int hctx_idx) | |
cc71a6f4 | 2754 | { |
1c0706a7 | 2755 | unsigned int flags = set->flags; |
cc71a6f4 JA |
2756 | int ret = 0; |
2757 | ||
2758 | set->tags[hctx_idx] = blk_mq_alloc_rq_map(set, hctx_idx, | |
1c0706a7 | 2759 | set->queue_depth, set->reserved_tags, flags); |
cc71a6f4 JA |
2760 | if (!set->tags[hctx_idx]) |
2761 | return false; | |
2762 | ||
2763 | ret = blk_mq_alloc_rqs(set, set->tags[hctx_idx], hctx_idx, | |
2764 | set->queue_depth); | |
2765 | if (!ret) | |
2766 | return true; | |
2767 | ||
1c0706a7 | 2768 | blk_mq_free_rq_map(set->tags[hctx_idx], flags); |
cc71a6f4 JA |
2769 | set->tags[hctx_idx] = NULL; |
2770 | return false; | |
2771 | } | |
2772 | ||
2773 | static void blk_mq_free_map_and_requests(struct blk_mq_tag_set *set, | |
2774 | unsigned int hctx_idx) | |
2775 | { | |
1c0706a7 JG |
2776 | unsigned int flags = set->flags; |
2777 | ||
4e6db0f2 | 2778 | if (set->tags && set->tags[hctx_idx]) { |
bd166ef1 | 2779 | blk_mq_free_rqs(set, set->tags[hctx_idx], hctx_idx); |
1c0706a7 | 2780 | blk_mq_free_rq_map(set->tags[hctx_idx], flags); |
bd166ef1 JA |
2781 | set->tags[hctx_idx] = NULL; |
2782 | } | |
cc71a6f4 JA |
2783 | } |
2784 | ||
4b855ad3 | 2785 | static void blk_mq_map_swqueue(struct request_queue *q) |
320ae51f | 2786 | { |
b3c661b1 | 2787 | unsigned int i, j, hctx_idx; |
320ae51f JA |
2788 | struct blk_mq_hw_ctx *hctx; |
2789 | struct blk_mq_ctx *ctx; | |
2a34c087 | 2790 | struct blk_mq_tag_set *set = q->tag_set; |
320ae51f JA |
2791 | |
2792 | queue_for_each_hw_ctx(q, hctx, i) { | |
e4043dcf | 2793 | cpumask_clear(hctx->cpumask); |
320ae51f | 2794 | hctx->nr_ctx = 0; |
d416c92c | 2795 | hctx->dispatch_from = NULL; |
320ae51f JA |
2796 | } |
2797 | ||
2798 | /* | |
4b855ad3 | 2799 | * Map software to hardware queues. |
4412efec ML |
2800 | * |
2801 | * If the cpu isn't present, the cpu is mapped to first hctx. | |
320ae51f | 2802 | */ |
20e4d813 | 2803 | for_each_possible_cpu(i) { |
4412efec | 2804 | |
897bb0c7 | 2805 | ctx = per_cpu_ptr(q->queue_ctx, i); |
b3c661b1 | 2806 | for (j = 0; j < set->nr_maps; j++) { |
bb94aea1 JW |
2807 | if (!set->map[j].nr_queues) { |
2808 | ctx->hctxs[j] = blk_mq_map_queue_type(q, | |
2809 | HCTX_TYPE_DEFAULT, i); | |
e5edd5f2 | 2810 | continue; |
bb94aea1 | 2811 | } |
fd689871 ML |
2812 | hctx_idx = set->map[j].mq_map[i]; |
2813 | /* unmapped hw queue can be remapped after CPU topo changed */ | |
2814 | if (!set->tags[hctx_idx] && | |
03b63b02 | 2815 | !__blk_mq_alloc_map_and_request(set, hctx_idx)) { |
fd689871 ML |
2816 | /* |
2817 | * If tags initialization fail for some hctx, | |
2818 | * that hctx won't be brought online. In this | |
2819 | * case, remap the current ctx to hctx[0] which | |
2820 | * is guaranteed to always have tags allocated | |
2821 | */ | |
2822 | set->map[j].mq_map[i] = 0; | |
2823 | } | |
e5edd5f2 | 2824 | |
b3c661b1 | 2825 | hctx = blk_mq_map_queue_type(q, j, i); |
8ccdf4a3 | 2826 | ctx->hctxs[j] = hctx; |
b3c661b1 JA |
2827 | /* |
2828 | * If the CPU is already set in the mask, then we've | |
2829 | * mapped this one already. This can happen if | |
2830 | * devices share queues across queue maps. | |
2831 | */ | |
2832 | if (cpumask_test_cpu(i, hctx->cpumask)) | |
2833 | continue; | |
2834 | ||
2835 | cpumask_set_cpu(i, hctx->cpumask); | |
2836 | hctx->type = j; | |
2837 | ctx->index_hw[hctx->type] = hctx->nr_ctx; | |
2838 | hctx->ctxs[hctx->nr_ctx++] = ctx; | |
2839 | ||
2840 | /* | |
2841 | * If the nr_ctx type overflows, we have exceeded the | |
2842 | * amount of sw queues we can support. | |
2843 | */ | |
2844 | BUG_ON(!hctx->nr_ctx); | |
2845 | } | |
bb94aea1 JW |
2846 | |
2847 | for (; j < HCTX_MAX_TYPES; j++) | |
2848 | ctx->hctxs[j] = blk_mq_map_queue_type(q, | |
2849 | HCTX_TYPE_DEFAULT, i); | |
320ae51f | 2850 | } |
506e931f JA |
2851 | |
2852 | queue_for_each_hw_ctx(q, hctx, i) { | |
4412efec ML |
2853 | /* |
2854 | * If no software queues are mapped to this hardware queue, | |
2855 | * disable it and free the request entries. | |
2856 | */ | |
2857 | if (!hctx->nr_ctx) { | |
2858 | /* Never unmap queue 0. We need it as a | |
2859 | * fallback in case of a new remap fails | |
2860 | * allocation | |
2861 | */ | |
2862 | if (i && set->tags[i]) | |
2863 | blk_mq_free_map_and_requests(set, i); | |
2864 | ||
2865 | hctx->tags = NULL; | |
2866 | continue; | |
2867 | } | |
484b4061 | 2868 | |
2a34c087 ML |
2869 | hctx->tags = set->tags[i]; |
2870 | WARN_ON(!hctx->tags); | |
2871 | ||
889fa31f CY |
2872 | /* |
2873 | * Set the map size to the number of mapped software queues. | |
2874 | * This is more accurate and more efficient than looping | |
2875 | * over all possibly mapped software queues. | |
2876 | */ | |
88459642 | 2877 | sbitmap_resize(&hctx->ctx_map, hctx->nr_ctx); |
889fa31f | 2878 | |
484b4061 JA |
2879 | /* |
2880 | * Initialize batch roundrobin counts | |
2881 | */ | |
f82ddf19 | 2882 | hctx->next_cpu = blk_mq_first_mapped_cpu(hctx); |
506e931f JA |
2883 | hctx->next_cpu_batch = BLK_MQ_CPU_WORK_BATCH; |
2884 | } | |
320ae51f JA |
2885 | } |
2886 | ||
8e8320c9 JA |
2887 | /* |
2888 | * Caller needs to ensure that we're either frozen/quiesced, or that | |
2889 | * the queue isn't live yet. | |
2890 | */ | |
2404e607 | 2891 | static void queue_set_hctx_shared(struct request_queue *q, bool shared) |
0d2602ca JA |
2892 | { |
2893 | struct blk_mq_hw_ctx *hctx; | |
0d2602ca JA |
2894 | int i; |
2895 | ||
2404e607 | 2896 | queue_for_each_hw_ctx(q, hctx, i) { |
97889f9a | 2897 | if (shared) |
51db1c37 | 2898 | hctx->flags |= BLK_MQ_F_TAG_QUEUE_SHARED; |
97889f9a | 2899 | else |
51db1c37 | 2900 | hctx->flags &= ~BLK_MQ_F_TAG_QUEUE_SHARED; |
2404e607 JM |
2901 | } |
2902 | } | |
2903 | ||
655ac300 HR |
2904 | static void blk_mq_update_tag_set_shared(struct blk_mq_tag_set *set, |
2905 | bool shared) | |
2404e607 JM |
2906 | { |
2907 | struct request_queue *q; | |
0d2602ca | 2908 | |
705cda97 BVA |
2909 | lockdep_assert_held(&set->tag_list_lock); |
2910 | ||
0d2602ca JA |
2911 | list_for_each_entry(q, &set->tag_list, tag_set_list) { |
2912 | blk_mq_freeze_queue(q); | |
2404e607 | 2913 | queue_set_hctx_shared(q, shared); |
0d2602ca JA |
2914 | blk_mq_unfreeze_queue(q); |
2915 | } | |
2916 | } | |
2917 | ||
2918 | static void blk_mq_del_queue_tag_set(struct request_queue *q) | |
2919 | { | |
2920 | struct blk_mq_tag_set *set = q->tag_set; | |
2921 | ||
0d2602ca | 2922 | mutex_lock(&set->tag_list_lock); |
08c875cb | 2923 | list_del(&q->tag_set_list); |
2404e607 JM |
2924 | if (list_is_singular(&set->tag_list)) { |
2925 | /* just transitioned to unshared */ | |
51db1c37 | 2926 | set->flags &= ~BLK_MQ_F_TAG_QUEUE_SHARED; |
2404e607 | 2927 | /* update existing queue */ |
655ac300 | 2928 | blk_mq_update_tag_set_shared(set, false); |
2404e607 | 2929 | } |
0d2602ca | 2930 | mutex_unlock(&set->tag_list_lock); |
a347c7ad | 2931 | INIT_LIST_HEAD(&q->tag_set_list); |
0d2602ca JA |
2932 | } |
2933 | ||
2934 | static void blk_mq_add_queue_tag_set(struct blk_mq_tag_set *set, | |
2935 | struct request_queue *q) | |
2936 | { | |
0d2602ca | 2937 | mutex_lock(&set->tag_list_lock); |
2404e607 | 2938 | |
ff821d27 JA |
2939 | /* |
2940 | * Check to see if we're transitioning to shared (from 1 to 2 queues). | |
2941 | */ | |
2942 | if (!list_empty(&set->tag_list) && | |
51db1c37 ML |
2943 | !(set->flags & BLK_MQ_F_TAG_QUEUE_SHARED)) { |
2944 | set->flags |= BLK_MQ_F_TAG_QUEUE_SHARED; | |
2404e607 | 2945 | /* update existing queue */ |
655ac300 | 2946 | blk_mq_update_tag_set_shared(set, true); |
2404e607 | 2947 | } |
51db1c37 | 2948 | if (set->flags & BLK_MQ_F_TAG_QUEUE_SHARED) |
2404e607 | 2949 | queue_set_hctx_shared(q, true); |
08c875cb | 2950 | list_add_tail(&q->tag_set_list, &set->tag_list); |
2404e607 | 2951 | |
0d2602ca JA |
2952 | mutex_unlock(&set->tag_list_lock); |
2953 | } | |
2954 | ||
1db4909e ML |
2955 | /* All allocations will be freed in release handler of q->mq_kobj */ |
2956 | static int blk_mq_alloc_ctxs(struct request_queue *q) | |
2957 | { | |
2958 | struct blk_mq_ctxs *ctxs; | |
2959 | int cpu; | |
2960 | ||
2961 | ctxs = kzalloc(sizeof(*ctxs), GFP_KERNEL); | |
2962 | if (!ctxs) | |
2963 | return -ENOMEM; | |
2964 | ||
2965 | ctxs->queue_ctx = alloc_percpu(struct blk_mq_ctx); | |
2966 | if (!ctxs->queue_ctx) | |
2967 | goto fail; | |
2968 | ||
2969 | for_each_possible_cpu(cpu) { | |
2970 | struct blk_mq_ctx *ctx = per_cpu_ptr(ctxs->queue_ctx, cpu); | |
2971 | ctx->ctxs = ctxs; | |
2972 | } | |
2973 | ||
2974 | q->mq_kobj = &ctxs->kobj; | |
2975 | q->queue_ctx = ctxs->queue_ctx; | |
2976 | ||
2977 | return 0; | |
2978 | fail: | |
2979 | kfree(ctxs); | |
2980 | return -ENOMEM; | |
2981 | } | |
2982 | ||
e09aae7e ML |
2983 | /* |
2984 | * It is the actual release handler for mq, but we do it from | |
2985 | * request queue's release handler for avoiding use-after-free | |
2986 | * and headache because q->mq_kobj shouldn't have been introduced, | |
2987 | * but we can't group ctx/kctx kobj without it. | |
2988 | */ | |
2989 | void blk_mq_release(struct request_queue *q) | |
2990 | { | |
2f8f1336 ML |
2991 | struct blk_mq_hw_ctx *hctx, *next; |
2992 | int i; | |
e09aae7e | 2993 | |
2f8f1336 ML |
2994 | queue_for_each_hw_ctx(q, hctx, i) |
2995 | WARN_ON_ONCE(hctx && list_empty(&hctx->hctx_list)); | |
2996 | ||
2997 | /* all hctx are in .unused_hctx_list now */ | |
2998 | list_for_each_entry_safe(hctx, next, &q->unused_hctx_list, hctx_list) { | |
2999 | list_del_init(&hctx->hctx_list); | |
6c8b232e | 3000 | kobject_put(&hctx->kobj); |
c3b4afca | 3001 | } |
e09aae7e ML |
3002 | |
3003 | kfree(q->queue_hw_ctx); | |
3004 | ||
7ea5fe31 ML |
3005 | /* |
3006 | * release .mq_kobj and sw queue's kobject now because | |
3007 | * both share lifetime with request queue. | |
3008 | */ | |
3009 | blk_mq_sysfs_deinit(q); | |
e09aae7e ML |
3010 | } |
3011 | ||
2f227bb9 CH |
3012 | struct request_queue *blk_mq_init_queue_data(struct blk_mq_tag_set *set, |
3013 | void *queuedata) | |
b62c21b7 MS |
3014 | { |
3015 | struct request_queue *uninit_q, *q; | |
3016 | ||
c62b37d9 | 3017 | uninit_q = blk_alloc_queue(set->numa_node); |
b62c21b7 MS |
3018 | if (!uninit_q) |
3019 | return ERR_PTR(-ENOMEM); | |
2f227bb9 | 3020 | uninit_q->queuedata = queuedata; |
b62c21b7 | 3021 | |
737eb78e DLM |
3022 | /* |
3023 | * Initialize the queue without an elevator. device_add_disk() will do | |
3024 | * the initialization. | |
3025 | */ | |
3026 | q = blk_mq_init_allocated_queue(set, uninit_q, false); | |
b62c21b7 MS |
3027 | if (IS_ERR(q)) |
3028 | blk_cleanup_queue(uninit_q); | |
3029 | ||
3030 | return q; | |
3031 | } | |
2f227bb9 CH |
3032 | EXPORT_SYMBOL_GPL(blk_mq_init_queue_data); |
3033 | ||
3034 | struct request_queue *blk_mq_init_queue(struct blk_mq_tag_set *set) | |
3035 | { | |
3036 | return blk_mq_init_queue_data(set, NULL); | |
3037 | } | |
b62c21b7 MS |
3038 | EXPORT_SYMBOL(blk_mq_init_queue); |
3039 | ||
9316a9ed JA |
3040 | /* |
3041 | * Helper for setting up a queue with mq ops, given queue depth, and | |
3042 | * the passed in mq ops flags. | |
3043 | */ | |
3044 | struct request_queue *blk_mq_init_sq_queue(struct blk_mq_tag_set *set, | |
3045 | const struct blk_mq_ops *ops, | |
3046 | unsigned int queue_depth, | |
3047 | unsigned int set_flags) | |
3048 | { | |
3049 | struct request_queue *q; | |
3050 | int ret; | |
3051 | ||
3052 | memset(set, 0, sizeof(*set)); | |
3053 | set->ops = ops; | |
3054 | set->nr_hw_queues = 1; | |
b3c661b1 | 3055 | set->nr_maps = 1; |
9316a9ed JA |
3056 | set->queue_depth = queue_depth; |
3057 | set->numa_node = NUMA_NO_NODE; | |
3058 | set->flags = set_flags; | |
3059 | ||
3060 | ret = blk_mq_alloc_tag_set(set); | |
3061 | if (ret) | |
3062 | return ERR_PTR(ret); | |
3063 | ||
3064 | q = blk_mq_init_queue(set); | |
3065 | if (IS_ERR(q)) { | |
3066 | blk_mq_free_tag_set(set); | |
3067 | return q; | |
3068 | } | |
3069 | ||
3070 | return q; | |
3071 | } | |
3072 | EXPORT_SYMBOL(blk_mq_init_sq_queue); | |
3073 | ||
34d11ffa JW |
3074 | static struct blk_mq_hw_ctx *blk_mq_alloc_and_init_hctx( |
3075 | struct blk_mq_tag_set *set, struct request_queue *q, | |
3076 | int hctx_idx, int node) | |
3077 | { | |
2f8f1336 | 3078 | struct blk_mq_hw_ctx *hctx = NULL, *tmp; |
34d11ffa | 3079 | |
2f8f1336 ML |
3080 | /* reuse dead hctx first */ |
3081 | spin_lock(&q->unused_hctx_lock); | |
3082 | list_for_each_entry(tmp, &q->unused_hctx_list, hctx_list) { | |
3083 | if (tmp->numa_node == node) { | |
3084 | hctx = tmp; | |
3085 | break; | |
3086 | } | |
3087 | } | |
3088 | if (hctx) | |
3089 | list_del_init(&hctx->hctx_list); | |
3090 | spin_unlock(&q->unused_hctx_lock); | |
3091 | ||
3092 | if (!hctx) | |
3093 | hctx = blk_mq_alloc_hctx(q, set, node); | |
34d11ffa | 3094 | if (!hctx) |
7c6c5b7c | 3095 | goto fail; |
34d11ffa | 3096 | |
7c6c5b7c ML |
3097 | if (blk_mq_init_hctx(q, set, hctx, hctx_idx)) |
3098 | goto free_hctx; | |
34d11ffa JW |
3099 | |
3100 | return hctx; | |
7c6c5b7c ML |
3101 | |
3102 | free_hctx: | |
3103 | kobject_put(&hctx->kobj); | |
3104 | fail: | |
3105 | return NULL; | |
34d11ffa JW |
3106 | } |
3107 | ||
868f2f0b KB |
3108 | static void blk_mq_realloc_hw_ctxs(struct blk_mq_tag_set *set, |
3109 | struct request_queue *q) | |
320ae51f | 3110 | { |
e01ad46d | 3111 | int i, j, end; |
868f2f0b | 3112 | struct blk_mq_hw_ctx **hctxs = q->queue_hw_ctx; |
f14bbe77 | 3113 | |
ac0d6b92 BVA |
3114 | if (q->nr_hw_queues < set->nr_hw_queues) { |
3115 | struct blk_mq_hw_ctx **new_hctxs; | |
3116 | ||
3117 | new_hctxs = kcalloc_node(set->nr_hw_queues, | |
3118 | sizeof(*new_hctxs), GFP_KERNEL, | |
3119 | set->numa_node); | |
3120 | if (!new_hctxs) | |
3121 | return; | |
3122 | if (hctxs) | |
3123 | memcpy(new_hctxs, hctxs, q->nr_hw_queues * | |
3124 | sizeof(*hctxs)); | |
3125 | q->queue_hw_ctx = new_hctxs; | |
ac0d6b92 BVA |
3126 | kfree(hctxs); |
3127 | hctxs = new_hctxs; | |
3128 | } | |
3129 | ||
fb350e0a ML |
3130 | /* protect against switching io scheduler */ |
3131 | mutex_lock(&q->sysfs_lock); | |
24d2f903 | 3132 | for (i = 0; i < set->nr_hw_queues; i++) { |
868f2f0b | 3133 | int node; |
34d11ffa | 3134 | struct blk_mq_hw_ctx *hctx; |
868f2f0b | 3135 | |
7d76f856 | 3136 | node = blk_mq_hw_queue_to_node(&set->map[HCTX_TYPE_DEFAULT], i); |
34d11ffa JW |
3137 | /* |
3138 | * If the hw queue has been mapped to another numa node, | |
3139 | * we need to realloc the hctx. If allocation fails, fallback | |
3140 | * to use the previous one. | |
3141 | */ | |
3142 | if (hctxs[i] && (hctxs[i]->numa_node == node)) | |
3143 | continue; | |
868f2f0b | 3144 | |
34d11ffa JW |
3145 | hctx = blk_mq_alloc_and_init_hctx(set, q, i, node); |
3146 | if (hctx) { | |
2f8f1336 | 3147 | if (hctxs[i]) |
34d11ffa | 3148 | blk_mq_exit_hctx(q, set, hctxs[i], i); |
34d11ffa JW |
3149 | hctxs[i] = hctx; |
3150 | } else { | |
3151 | if (hctxs[i]) | |
3152 | pr_warn("Allocate new hctx on node %d fails,\ | |
3153 | fallback to previous one on node %d\n", | |
3154 | node, hctxs[i]->numa_node); | |
3155 | else | |
3156 | break; | |
868f2f0b | 3157 | } |
320ae51f | 3158 | } |
e01ad46d JW |
3159 | /* |
3160 | * Increasing nr_hw_queues fails. Free the newly allocated | |
3161 | * hctxs and keep the previous q->nr_hw_queues. | |
3162 | */ | |
3163 | if (i != set->nr_hw_queues) { | |
3164 | j = q->nr_hw_queues; | |
3165 | end = i; | |
3166 | } else { | |
3167 | j = i; | |
3168 | end = q->nr_hw_queues; | |
3169 | q->nr_hw_queues = set->nr_hw_queues; | |
3170 | } | |
34d11ffa | 3171 | |
e01ad46d | 3172 | for (; j < end; j++) { |
868f2f0b KB |
3173 | struct blk_mq_hw_ctx *hctx = hctxs[j]; |
3174 | ||
3175 | if (hctx) { | |
cc71a6f4 JA |
3176 | if (hctx->tags) |
3177 | blk_mq_free_map_and_requests(set, j); | |
868f2f0b | 3178 | blk_mq_exit_hctx(q, set, hctx, j); |
868f2f0b | 3179 | hctxs[j] = NULL; |
868f2f0b KB |
3180 | } |
3181 | } | |
fb350e0a | 3182 | mutex_unlock(&q->sysfs_lock); |
868f2f0b KB |
3183 | } |
3184 | ||
3185 | struct request_queue *blk_mq_init_allocated_queue(struct blk_mq_tag_set *set, | |
737eb78e DLM |
3186 | struct request_queue *q, |
3187 | bool elevator_init) | |
868f2f0b | 3188 | { |
66841672 ML |
3189 | /* mark the queue as mq asap */ |
3190 | q->mq_ops = set->ops; | |
3191 | ||
34dbad5d | 3192 | q->poll_cb = blk_stat_alloc_callback(blk_mq_poll_stats_fn, |
720b8ccc SB |
3193 | blk_mq_poll_stats_bkt, |
3194 | BLK_MQ_POLL_STATS_BKTS, q); | |
34dbad5d OS |
3195 | if (!q->poll_cb) |
3196 | goto err_exit; | |
3197 | ||
1db4909e | 3198 | if (blk_mq_alloc_ctxs(q)) |
41de54c6 | 3199 | goto err_poll; |
868f2f0b | 3200 | |
737f98cf ML |
3201 | /* init q->mq_kobj and sw queues' kobjects */ |
3202 | blk_mq_sysfs_init(q); | |
3203 | ||
2f8f1336 ML |
3204 | INIT_LIST_HEAD(&q->unused_hctx_list); |
3205 | spin_lock_init(&q->unused_hctx_lock); | |
3206 | ||
868f2f0b KB |
3207 | blk_mq_realloc_hw_ctxs(set, q); |
3208 | if (!q->nr_hw_queues) | |
3209 | goto err_hctxs; | |
320ae51f | 3210 | |
287922eb | 3211 | INIT_WORK(&q->timeout_work, blk_mq_timeout_work); |
e56f698b | 3212 | blk_queue_rq_timeout(q, set->timeout ? set->timeout : 30 * HZ); |
320ae51f | 3213 | |
a8908939 | 3214 | q->tag_set = set; |
320ae51f | 3215 | |
94eddfbe | 3216 | q->queue_flags |= QUEUE_FLAG_MQ_DEFAULT; |
cd19181b ML |
3217 | if (set->nr_maps > HCTX_TYPE_POLL && |
3218 | set->map[HCTX_TYPE_POLL].nr_queues) | |
6544d229 | 3219 | blk_queue_flag_set(QUEUE_FLAG_POLL, q); |
320ae51f | 3220 | |
1be036e9 CH |
3221 | q->sg_reserved_size = INT_MAX; |
3222 | ||
2849450a | 3223 | INIT_DELAYED_WORK(&q->requeue_work, blk_mq_requeue_work); |
6fca6a61 CH |
3224 | INIT_LIST_HEAD(&q->requeue_list); |
3225 | spin_lock_init(&q->requeue_lock); | |
3226 | ||
eba71768 JA |
3227 | q->nr_requests = set->queue_depth; |
3228 | ||
64f1c21e JA |
3229 | /* |
3230 | * Default to classic polling | |
3231 | */ | |
29ece8b4 | 3232 | q->poll_nsec = BLK_MQ_POLL_CLASSIC; |
64f1c21e | 3233 | |
24d2f903 | 3234 | blk_mq_init_cpu_queues(q, set->nr_hw_queues); |
0d2602ca | 3235 | blk_mq_add_queue_tag_set(set, q); |
4b855ad3 | 3236 | blk_mq_map_swqueue(q); |
4593fdbe | 3237 | |
737eb78e DLM |
3238 | if (elevator_init) |
3239 | elevator_init_mq(q); | |
d3484991 | 3240 | |
320ae51f | 3241 | return q; |
18741986 | 3242 | |
320ae51f | 3243 | err_hctxs: |
868f2f0b | 3244 | kfree(q->queue_hw_ctx); |
73d9c8d4 | 3245 | q->nr_hw_queues = 0; |
1db4909e | 3246 | blk_mq_sysfs_deinit(q); |
41de54c6 JS |
3247 | err_poll: |
3248 | blk_stat_free_callback(q->poll_cb); | |
3249 | q->poll_cb = NULL; | |
c7de5726 ML |
3250 | err_exit: |
3251 | q->mq_ops = NULL; | |
320ae51f JA |
3252 | return ERR_PTR(-ENOMEM); |
3253 | } | |
b62c21b7 | 3254 | EXPORT_SYMBOL(blk_mq_init_allocated_queue); |
320ae51f | 3255 | |
c7e2d94b ML |
3256 | /* tags can _not_ be used after returning from blk_mq_exit_queue */ |
3257 | void blk_mq_exit_queue(struct request_queue *q) | |
320ae51f | 3258 | { |
624dbe47 | 3259 | struct blk_mq_tag_set *set = q->tag_set; |
320ae51f | 3260 | |
0d2602ca | 3261 | blk_mq_del_queue_tag_set(q); |
624dbe47 | 3262 | blk_mq_exit_hw_queues(q, set, set->nr_hw_queues); |
320ae51f | 3263 | } |
320ae51f | 3264 | |
a5164405 JA |
3265 | static int __blk_mq_alloc_rq_maps(struct blk_mq_tag_set *set) |
3266 | { | |
3267 | int i; | |
3268 | ||
8229cca8 | 3269 | for (i = 0; i < set->nr_hw_queues; i++) { |
03b63b02 | 3270 | if (!__blk_mq_alloc_map_and_request(set, i)) |
a5164405 | 3271 | goto out_unwind; |
8229cca8 XT |
3272 | cond_resched(); |
3273 | } | |
a5164405 JA |
3274 | |
3275 | return 0; | |
3276 | ||
3277 | out_unwind: | |
3278 | while (--i >= 0) | |
2e194422 | 3279 | blk_mq_free_map_and_requests(set, i); |
a5164405 | 3280 | |
a5164405 JA |
3281 | return -ENOMEM; |
3282 | } | |
3283 | ||
3284 | /* | |
3285 | * Allocate the request maps associated with this tag_set. Note that this | |
3286 | * may reduce the depth asked for, if memory is tight. set->queue_depth | |
3287 | * will be updated to reflect the allocated depth. | |
3288 | */ | |
79fab528 | 3289 | static int blk_mq_alloc_map_and_requests(struct blk_mq_tag_set *set) |
a5164405 JA |
3290 | { |
3291 | unsigned int depth; | |
3292 | int err; | |
3293 | ||
3294 | depth = set->queue_depth; | |
3295 | do { | |
3296 | err = __blk_mq_alloc_rq_maps(set); | |
3297 | if (!err) | |
3298 | break; | |
3299 | ||
3300 | set->queue_depth >>= 1; | |
3301 | if (set->queue_depth < set->reserved_tags + BLK_MQ_TAG_MIN) { | |
3302 | err = -ENOMEM; | |
3303 | break; | |
3304 | } | |
3305 | } while (set->queue_depth); | |
3306 | ||
3307 | if (!set->queue_depth || err) { | |
3308 | pr_err("blk-mq: failed to allocate request map\n"); | |
3309 | return -ENOMEM; | |
3310 | } | |
3311 | ||
3312 | if (depth != set->queue_depth) | |
3313 | pr_info("blk-mq: reduced tag depth (%u -> %u)\n", | |
3314 | depth, set->queue_depth); | |
3315 | ||
3316 | return 0; | |
3317 | } | |
3318 | ||
ebe8bddb OS |
3319 | static int blk_mq_update_queue_map(struct blk_mq_tag_set *set) |
3320 | { | |
6e66b493 BVA |
3321 | /* |
3322 | * blk_mq_map_queues() and multiple .map_queues() implementations | |
3323 | * expect that set->map[HCTX_TYPE_DEFAULT].nr_queues is set to the | |
3324 | * number of hardware queues. | |
3325 | */ | |
3326 | if (set->nr_maps == 1) | |
3327 | set->map[HCTX_TYPE_DEFAULT].nr_queues = set->nr_hw_queues; | |
3328 | ||
59388702 | 3329 | if (set->ops->map_queues && !is_kdump_kernel()) { |
b3c661b1 JA |
3330 | int i; |
3331 | ||
7d4901a9 ML |
3332 | /* |
3333 | * transport .map_queues is usually done in the following | |
3334 | * way: | |
3335 | * | |
3336 | * for (queue = 0; queue < set->nr_hw_queues; queue++) { | |
3337 | * mask = get_cpu_mask(queue) | |
3338 | * for_each_cpu(cpu, mask) | |
b3c661b1 | 3339 | * set->map[x].mq_map[cpu] = queue; |
7d4901a9 ML |
3340 | * } |
3341 | * | |
3342 | * When we need to remap, the table has to be cleared for | |
3343 | * killing stale mapping since one CPU may not be mapped | |
3344 | * to any hw queue. | |
3345 | */ | |
b3c661b1 JA |
3346 | for (i = 0; i < set->nr_maps; i++) |
3347 | blk_mq_clear_mq_map(&set->map[i]); | |
7d4901a9 | 3348 | |
ebe8bddb | 3349 | return set->ops->map_queues(set); |
b3c661b1 JA |
3350 | } else { |
3351 | BUG_ON(set->nr_maps > 1); | |
7d76f856 | 3352 | return blk_mq_map_queues(&set->map[HCTX_TYPE_DEFAULT]); |
b3c661b1 | 3353 | } |
ebe8bddb OS |
3354 | } |
3355 | ||
f7e76dbc BVA |
3356 | static int blk_mq_realloc_tag_set_tags(struct blk_mq_tag_set *set, |
3357 | int cur_nr_hw_queues, int new_nr_hw_queues) | |
3358 | { | |
3359 | struct blk_mq_tags **new_tags; | |
3360 | ||
3361 | if (cur_nr_hw_queues >= new_nr_hw_queues) | |
3362 | return 0; | |
3363 | ||
3364 | new_tags = kcalloc_node(new_nr_hw_queues, sizeof(struct blk_mq_tags *), | |
3365 | GFP_KERNEL, set->numa_node); | |
3366 | if (!new_tags) | |
3367 | return -ENOMEM; | |
3368 | ||
3369 | if (set->tags) | |
3370 | memcpy(new_tags, set->tags, cur_nr_hw_queues * | |
3371 | sizeof(*set->tags)); | |
3372 | kfree(set->tags); | |
3373 | set->tags = new_tags; | |
3374 | set->nr_hw_queues = new_nr_hw_queues; | |
3375 | ||
3376 | return 0; | |
3377 | } | |
3378 | ||
a4391c64 JA |
3379 | /* |
3380 | * Alloc a tag set to be associated with one or more request queues. | |
3381 | * May fail with EINVAL for various error conditions. May adjust the | |
c018c84f | 3382 | * requested depth down, if it's too large. In that case, the set |
a4391c64 JA |
3383 | * value will be stored in set->queue_depth. |
3384 | */ | |
24d2f903 CH |
3385 | int blk_mq_alloc_tag_set(struct blk_mq_tag_set *set) |
3386 | { | |
b3c661b1 | 3387 | int i, ret; |
da695ba2 | 3388 | |
205fb5f5 BVA |
3389 | BUILD_BUG_ON(BLK_MQ_MAX_DEPTH > 1 << BLK_MQ_UNIQUE_TAG_BITS); |
3390 | ||
24d2f903 CH |
3391 | if (!set->nr_hw_queues) |
3392 | return -EINVAL; | |
a4391c64 | 3393 | if (!set->queue_depth) |
24d2f903 CH |
3394 | return -EINVAL; |
3395 | if (set->queue_depth < set->reserved_tags + BLK_MQ_TAG_MIN) | |
3396 | return -EINVAL; | |
3397 | ||
7d7e0f90 | 3398 | if (!set->ops->queue_rq) |
24d2f903 CH |
3399 | return -EINVAL; |
3400 | ||
de148297 ML |
3401 | if (!set->ops->get_budget ^ !set->ops->put_budget) |
3402 | return -EINVAL; | |
3403 | ||
a4391c64 JA |
3404 | if (set->queue_depth > BLK_MQ_MAX_DEPTH) { |
3405 | pr_info("blk-mq: reduced tag depth to %u\n", | |
3406 | BLK_MQ_MAX_DEPTH); | |
3407 | set->queue_depth = BLK_MQ_MAX_DEPTH; | |
3408 | } | |
24d2f903 | 3409 | |
b3c661b1 JA |
3410 | if (!set->nr_maps) |
3411 | set->nr_maps = 1; | |
3412 | else if (set->nr_maps > HCTX_MAX_TYPES) | |
3413 | return -EINVAL; | |
3414 | ||
6637fadf SL |
3415 | /* |
3416 | * If a crashdump is active, then we are potentially in a very | |
3417 | * memory constrained environment. Limit us to 1 queue and | |
3418 | * 64 tags to prevent using too much memory. | |
3419 | */ | |
3420 | if (is_kdump_kernel()) { | |
3421 | set->nr_hw_queues = 1; | |
59388702 | 3422 | set->nr_maps = 1; |
6637fadf SL |
3423 | set->queue_depth = min(64U, set->queue_depth); |
3424 | } | |
868f2f0b | 3425 | /* |
392546ae JA |
3426 | * There is no use for more h/w queues than cpus if we just have |
3427 | * a single map | |
868f2f0b | 3428 | */ |
392546ae | 3429 | if (set->nr_maps == 1 && set->nr_hw_queues > nr_cpu_ids) |
868f2f0b | 3430 | set->nr_hw_queues = nr_cpu_ids; |
6637fadf | 3431 | |
f7e76dbc | 3432 | if (blk_mq_realloc_tag_set_tags(set, 0, set->nr_hw_queues) < 0) |
a5164405 | 3433 | return -ENOMEM; |
24d2f903 | 3434 | |
da695ba2 | 3435 | ret = -ENOMEM; |
b3c661b1 JA |
3436 | for (i = 0; i < set->nr_maps; i++) { |
3437 | set->map[i].mq_map = kcalloc_node(nr_cpu_ids, | |
07b35eb5 | 3438 | sizeof(set->map[i].mq_map[0]), |
b3c661b1 JA |
3439 | GFP_KERNEL, set->numa_node); |
3440 | if (!set->map[i].mq_map) | |
3441 | goto out_free_mq_map; | |
59388702 | 3442 | set->map[i].nr_queues = is_kdump_kernel() ? 1 : set->nr_hw_queues; |
b3c661b1 | 3443 | } |
bdd17e75 | 3444 | |
ebe8bddb | 3445 | ret = blk_mq_update_queue_map(set); |
da695ba2 CH |
3446 | if (ret) |
3447 | goto out_free_mq_map; | |
3448 | ||
79fab528 | 3449 | ret = blk_mq_alloc_map_and_requests(set); |
da695ba2 | 3450 | if (ret) |
bdd17e75 | 3451 | goto out_free_mq_map; |
24d2f903 | 3452 | |
32bc15af | 3453 | if (blk_mq_is_sbitmap_shared(set->flags)) { |
f1b49fdc JG |
3454 | atomic_set(&set->active_queues_shared_sbitmap, 0); |
3455 | ||
32bc15af JG |
3456 | if (blk_mq_init_shared_sbitmap(set, set->flags)) { |
3457 | ret = -ENOMEM; | |
3458 | goto out_free_mq_rq_maps; | |
3459 | } | |
3460 | } | |
3461 | ||
0d2602ca JA |
3462 | mutex_init(&set->tag_list_lock); |
3463 | INIT_LIST_HEAD(&set->tag_list); | |
3464 | ||
24d2f903 | 3465 | return 0; |
bdd17e75 | 3466 | |
32bc15af JG |
3467 | out_free_mq_rq_maps: |
3468 | for (i = 0; i < set->nr_hw_queues; i++) | |
3469 | blk_mq_free_map_and_requests(set, i); | |
bdd17e75 | 3470 | out_free_mq_map: |
b3c661b1 JA |
3471 | for (i = 0; i < set->nr_maps; i++) { |
3472 | kfree(set->map[i].mq_map); | |
3473 | set->map[i].mq_map = NULL; | |
3474 | } | |
5676e7b6 RE |
3475 | kfree(set->tags); |
3476 | set->tags = NULL; | |
da695ba2 | 3477 | return ret; |
24d2f903 CH |
3478 | } |
3479 | EXPORT_SYMBOL(blk_mq_alloc_tag_set); | |
3480 | ||
3481 | void blk_mq_free_tag_set(struct blk_mq_tag_set *set) | |
3482 | { | |
b3c661b1 | 3483 | int i, j; |
24d2f903 | 3484 | |
f7e76dbc | 3485 | for (i = 0; i < set->nr_hw_queues; i++) |
cc71a6f4 | 3486 | blk_mq_free_map_and_requests(set, i); |
484b4061 | 3487 | |
32bc15af JG |
3488 | if (blk_mq_is_sbitmap_shared(set->flags)) |
3489 | blk_mq_exit_shared_sbitmap(set); | |
3490 | ||
b3c661b1 JA |
3491 | for (j = 0; j < set->nr_maps; j++) { |
3492 | kfree(set->map[j].mq_map); | |
3493 | set->map[j].mq_map = NULL; | |
3494 | } | |
bdd17e75 | 3495 | |
981bd189 | 3496 | kfree(set->tags); |
5676e7b6 | 3497 | set->tags = NULL; |
24d2f903 CH |
3498 | } |
3499 | EXPORT_SYMBOL(blk_mq_free_tag_set); | |
3500 | ||
e3a2b3f9 JA |
3501 | int blk_mq_update_nr_requests(struct request_queue *q, unsigned int nr) |
3502 | { | |
3503 | struct blk_mq_tag_set *set = q->tag_set; | |
3504 | struct blk_mq_hw_ctx *hctx; | |
3505 | int i, ret; | |
3506 | ||
bd166ef1 | 3507 | if (!set) |
e3a2b3f9 JA |
3508 | return -EINVAL; |
3509 | ||
e5fa8140 AZ |
3510 | if (q->nr_requests == nr) |
3511 | return 0; | |
3512 | ||
70f36b60 | 3513 | blk_mq_freeze_queue(q); |
24f5a90f | 3514 | blk_mq_quiesce_queue(q); |
70f36b60 | 3515 | |
e3a2b3f9 JA |
3516 | ret = 0; |
3517 | queue_for_each_hw_ctx(q, hctx, i) { | |
e9137d4b KB |
3518 | if (!hctx->tags) |
3519 | continue; | |
bd166ef1 JA |
3520 | /* |
3521 | * If we're using an MQ scheduler, just update the scheduler | |
3522 | * queue depth. This is similar to what the old code would do. | |
3523 | */ | |
70f36b60 | 3524 | if (!hctx->sched_tags) { |
c2e82a23 | 3525 | ret = blk_mq_tag_update_depth(hctx, &hctx->tags, nr, |
70f36b60 | 3526 | false); |
32bc15af JG |
3527 | if (!ret && blk_mq_is_sbitmap_shared(set->flags)) |
3528 | blk_mq_tag_resize_shared_sbitmap(set, nr); | |
70f36b60 JA |
3529 | } else { |
3530 | ret = blk_mq_tag_update_depth(hctx, &hctx->sched_tags, | |
3531 | nr, true); | |
3532 | } | |
e3a2b3f9 JA |
3533 | if (ret) |
3534 | break; | |
77f1e0a5 JA |
3535 | if (q->elevator && q->elevator->type->ops.depth_updated) |
3536 | q->elevator->type->ops.depth_updated(hctx); | |
e3a2b3f9 JA |
3537 | } |
3538 | ||
3539 | if (!ret) | |
3540 | q->nr_requests = nr; | |
3541 | ||
24f5a90f | 3542 | blk_mq_unquiesce_queue(q); |
70f36b60 | 3543 | blk_mq_unfreeze_queue(q); |
70f36b60 | 3544 | |
e3a2b3f9 JA |
3545 | return ret; |
3546 | } | |
3547 | ||
d48ece20 JW |
3548 | /* |
3549 | * request_queue and elevator_type pair. | |
3550 | * It is just used by __blk_mq_update_nr_hw_queues to cache | |
3551 | * the elevator_type associated with a request_queue. | |
3552 | */ | |
3553 | struct blk_mq_qe_pair { | |
3554 | struct list_head node; | |
3555 | struct request_queue *q; | |
3556 | struct elevator_type *type; | |
3557 | }; | |
3558 | ||
3559 | /* | |
3560 | * Cache the elevator_type in qe pair list and switch the | |
3561 | * io scheduler to 'none' | |
3562 | */ | |
3563 | static bool blk_mq_elv_switch_none(struct list_head *head, | |
3564 | struct request_queue *q) | |
3565 | { | |
3566 | struct blk_mq_qe_pair *qe; | |
3567 | ||
3568 | if (!q->elevator) | |
3569 | return true; | |
3570 | ||
3571 | qe = kmalloc(sizeof(*qe), GFP_NOIO | __GFP_NOWARN | __GFP_NORETRY); | |
3572 | if (!qe) | |
3573 | return false; | |
3574 | ||
3575 | INIT_LIST_HEAD(&qe->node); | |
3576 | qe->q = q; | |
3577 | qe->type = q->elevator->type; | |
3578 | list_add(&qe->node, head); | |
3579 | ||
3580 | mutex_lock(&q->sysfs_lock); | |
3581 | /* | |
3582 | * After elevator_switch_mq, the previous elevator_queue will be | |
3583 | * released by elevator_release. The reference of the io scheduler | |
3584 | * module get by elevator_get will also be put. So we need to get | |
3585 | * a reference of the io scheduler module here to prevent it to be | |
3586 | * removed. | |
3587 | */ | |
3588 | __module_get(qe->type->elevator_owner); | |
3589 | elevator_switch_mq(q, NULL); | |
3590 | mutex_unlock(&q->sysfs_lock); | |
3591 | ||
3592 | return true; | |
3593 | } | |
3594 | ||
3595 | static void blk_mq_elv_switch_back(struct list_head *head, | |
3596 | struct request_queue *q) | |
3597 | { | |
3598 | struct blk_mq_qe_pair *qe; | |
3599 | struct elevator_type *t = NULL; | |
3600 | ||
3601 | list_for_each_entry(qe, head, node) | |
3602 | if (qe->q == q) { | |
3603 | t = qe->type; | |
3604 | break; | |
3605 | } | |
3606 | ||
3607 | if (!t) | |
3608 | return; | |
3609 | ||
3610 | list_del(&qe->node); | |
3611 | kfree(qe); | |
3612 | ||
3613 | mutex_lock(&q->sysfs_lock); | |
3614 | elevator_switch_mq(q, t); | |
3615 | mutex_unlock(&q->sysfs_lock); | |
3616 | } | |
3617 | ||
e4dc2b32 KB |
3618 | static void __blk_mq_update_nr_hw_queues(struct blk_mq_tag_set *set, |
3619 | int nr_hw_queues) | |
868f2f0b KB |
3620 | { |
3621 | struct request_queue *q; | |
d48ece20 | 3622 | LIST_HEAD(head); |
e01ad46d | 3623 | int prev_nr_hw_queues; |
868f2f0b | 3624 | |
705cda97 BVA |
3625 | lockdep_assert_held(&set->tag_list_lock); |
3626 | ||
392546ae | 3627 | if (set->nr_maps == 1 && nr_hw_queues > nr_cpu_ids) |
868f2f0b | 3628 | nr_hw_queues = nr_cpu_ids; |
fe35ec58 WZ |
3629 | if (nr_hw_queues < 1) |
3630 | return; | |
3631 | if (set->nr_maps == 1 && nr_hw_queues == set->nr_hw_queues) | |
868f2f0b KB |
3632 | return; |
3633 | ||
3634 | list_for_each_entry(q, &set->tag_list, tag_set_list) | |
3635 | blk_mq_freeze_queue(q); | |
d48ece20 JW |
3636 | /* |
3637 | * Switch IO scheduler to 'none', cleaning up the data associated | |
3638 | * with the previous scheduler. We will switch back once we are done | |
3639 | * updating the new sw to hw queue mappings. | |
3640 | */ | |
3641 | list_for_each_entry(q, &set->tag_list, tag_set_list) | |
3642 | if (!blk_mq_elv_switch_none(&head, q)) | |
3643 | goto switch_back; | |
868f2f0b | 3644 | |
477e19de JW |
3645 | list_for_each_entry(q, &set->tag_list, tag_set_list) { |
3646 | blk_mq_debugfs_unregister_hctxs(q); | |
3647 | blk_mq_sysfs_unregister(q); | |
3648 | } | |
3649 | ||
a2584e43 | 3650 | prev_nr_hw_queues = set->nr_hw_queues; |
f7e76dbc BVA |
3651 | if (blk_mq_realloc_tag_set_tags(set, set->nr_hw_queues, nr_hw_queues) < |
3652 | 0) | |
3653 | goto reregister; | |
3654 | ||
868f2f0b | 3655 | set->nr_hw_queues = nr_hw_queues; |
e01ad46d | 3656 | fallback: |
aa880ad6 | 3657 | blk_mq_update_queue_map(set); |
868f2f0b KB |
3658 | list_for_each_entry(q, &set->tag_list, tag_set_list) { |
3659 | blk_mq_realloc_hw_ctxs(set, q); | |
e01ad46d JW |
3660 | if (q->nr_hw_queues != set->nr_hw_queues) { |
3661 | pr_warn("Increasing nr_hw_queues to %d fails, fallback to %d\n", | |
3662 | nr_hw_queues, prev_nr_hw_queues); | |
3663 | set->nr_hw_queues = prev_nr_hw_queues; | |
7d76f856 | 3664 | blk_mq_map_queues(&set->map[HCTX_TYPE_DEFAULT]); |
e01ad46d JW |
3665 | goto fallback; |
3666 | } | |
477e19de JW |
3667 | blk_mq_map_swqueue(q); |
3668 | } | |
3669 | ||
f7e76dbc | 3670 | reregister: |
477e19de JW |
3671 | list_for_each_entry(q, &set->tag_list, tag_set_list) { |
3672 | blk_mq_sysfs_register(q); | |
3673 | blk_mq_debugfs_register_hctxs(q); | |
868f2f0b KB |
3674 | } |
3675 | ||
d48ece20 JW |
3676 | switch_back: |
3677 | list_for_each_entry(q, &set->tag_list, tag_set_list) | |
3678 | blk_mq_elv_switch_back(&head, q); | |
3679 | ||
868f2f0b KB |
3680 | list_for_each_entry(q, &set->tag_list, tag_set_list) |
3681 | blk_mq_unfreeze_queue(q); | |
3682 | } | |
e4dc2b32 KB |
3683 | |
3684 | void blk_mq_update_nr_hw_queues(struct blk_mq_tag_set *set, int nr_hw_queues) | |
3685 | { | |
3686 | mutex_lock(&set->tag_list_lock); | |
3687 | __blk_mq_update_nr_hw_queues(set, nr_hw_queues); | |
3688 | mutex_unlock(&set->tag_list_lock); | |
3689 | } | |
868f2f0b KB |
3690 | EXPORT_SYMBOL_GPL(blk_mq_update_nr_hw_queues); |
3691 | ||
34dbad5d OS |
3692 | /* Enable polling stats and return whether they were already enabled. */ |
3693 | static bool blk_poll_stats_enable(struct request_queue *q) | |
3694 | { | |
3695 | if (test_bit(QUEUE_FLAG_POLL_STATS, &q->queue_flags) || | |
7dfdbc73 | 3696 | blk_queue_flag_test_and_set(QUEUE_FLAG_POLL_STATS, q)) |
34dbad5d OS |
3697 | return true; |
3698 | blk_stat_add_callback(q, q->poll_cb); | |
3699 | return false; | |
3700 | } | |
3701 | ||
3702 | static void blk_mq_poll_stats_start(struct request_queue *q) | |
3703 | { | |
3704 | /* | |
3705 | * We don't arm the callback if polling stats are not enabled or the | |
3706 | * callback is already active. | |
3707 | */ | |
3708 | if (!test_bit(QUEUE_FLAG_POLL_STATS, &q->queue_flags) || | |
3709 | blk_stat_is_active(q->poll_cb)) | |
3710 | return; | |
3711 | ||
3712 | blk_stat_activate_msecs(q->poll_cb, 100); | |
3713 | } | |
3714 | ||
3715 | static void blk_mq_poll_stats_fn(struct blk_stat_callback *cb) | |
3716 | { | |
3717 | struct request_queue *q = cb->data; | |
720b8ccc | 3718 | int bucket; |
34dbad5d | 3719 | |
720b8ccc SB |
3720 | for (bucket = 0; bucket < BLK_MQ_POLL_STATS_BKTS; bucket++) { |
3721 | if (cb->stat[bucket].nr_samples) | |
3722 | q->poll_stat[bucket] = cb->stat[bucket]; | |
3723 | } | |
34dbad5d OS |
3724 | } |
3725 | ||
64f1c21e | 3726 | static unsigned long blk_mq_poll_nsecs(struct request_queue *q, |
64f1c21e JA |
3727 | struct request *rq) |
3728 | { | |
64f1c21e | 3729 | unsigned long ret = 0; |
720b8ccc | 3730 | int bucket; |
64f1c21e JA |
3731 | |
3732 | /* | |
3733 | * If stats collection isn't on, don't sleep but turn it on for | |
3734 | * future users | |
3735 | */ | |
34dbad5d | 3736 | if (!blk_poll_stats_enable(q)) |
64f1c21e JA |
3737 | return 0; |
3738 | ||
64f1c21e JA |
3739 | /* |
3740 | * As an optimistic guess, use half of the mean service time | |
3741 | * for this type of request. We can (and should) make this smarter. | |
3742 | * For instance, if the completion latencies are tight, we can | |
3743 | * get closer than just half the mean. This is especially | |
3744 | * important on devices where the completion latencies are longer | |
720b8ccc SB |
3745 | * than ~10 usec. We do use the stats for the relevant IO size |
3746 | * if available which does lead to better estimates. | |
64f1c21e | 3747 | */ |
720b8ccc SB |
3748 | bucket = blk_mq_poll_stats_bkt(rq); |
3749 | if (bucket < 0) | |
3750 | return ret; | |
3751 | ||
3752 | if (q->poll_stat[bucket].nr_samples) | |
3753 | ret = (q->poll_stat[bucket].mean + 1) / 2; | |
64f1c21e JA |
3754 | |
3755 | return ret; | |
3756 | } | |
3757 | ||
06426adf JA |
3758 | static bool blk_mq_poll_hybrid_sleep(struct request_queue *q, |
3759 | struct request *rq) | |
3760 | { | |
3761 | struct hrtimer_sleeper hs; | |
3762 | enum hrtimer_mode mode; | |
64f1c21e | 3763 | unsigned int nsecs; |
06426adf JA |
3764 | ktime_t kt; |
3765 | ||
76a86f9d | 3766 | if (rq->rq_flags & RQF_MQ_POLL_SLEPT) |
64f1c21e JA |
3767 | return false; |
3768 | ||
3769 | /* | |
1052b8ac | 3770 | * If we get here, hybrid polling is enabled. Hence poll_nsec can be: |
64f1c21e | 3771 | * |
64f1c21e JA |
3772 | * 0: use half of prev avg |
3773 | * >0: use this specific value | |
3774 | */ | |
1052b8ac | 3775 | if (q->poll_nsec > 0) |
64f1c21e JA |
3776 | nsecs = q->poll_nsec; |
3777 | else | |
cae740a0 | 3778 | nsecs = blk_mq_poll_nsecs(q, rq); |
64f1c21e JA |
3779 | |
3780 | if (!nsecs) | |
06426adf JA |
3781 | return false; |
3782 | ||
76a86f9d | 3783 | rq->rq_flags |= RQF_MQ_POLL_SLEPT; |
06426adf JA |
3784 | |
3785 | /* | |
3786 | * This will be replaced with the stats tracking code, using | |
3787 | * 'avg_completion_time / 2' as the pre-sleep target. | |
3788 | */ | |
8b0e1953 | 3789 | kt = nsecs; |
06426adf JA |
3790 | |
3791 | mode = HRTIMER_MODE_REL; | |
dbc1625f | 3792 | hrtimer_init_sleeper_on_stack(&hs, CLOCK_MONOTONIC, mode); |
06426adf JA |
3793 | hrtimer_set_expires(&hs.timer, kt); |
3794 | ||
06426adf | 3795 | do { |
5a61c363 | 3796 | if (blk_mq_rq_state(rq) == MQ_RQ_COMPLETE) |
06426adf JA |
3797 | break; |
3798 | set_current_state(TASK_UNINTERRUPTIBLE); | |
9dd8813e | 3799 | hrtimer_sleeper_start_expires(&hs, mode); |
06426adf JA |
3800 | if (hs.task) |
3801 | io_schedule(); | |
3802 | hrtimer_cancel(&hs.timer); | |
3803 | mode = HRTIMER_MODE_ABS; | |
3804 | } while (hs.task && !signal_pending(current)); | |
3805 | ||
3806 | __set_current_state(TASK_RUNNING); | |
3807 | destroy_hrtimer_on_stack(&hs.timer); | |
3808 | return true; | |
3809 | } | |
3810 | ||
1052b8ac JA |
3811 | static bool blk_mq_poll_hybrid(struct request_queue *q, |
3812 | struct blk_mq_hw_ctx *hctx, blk_qc_t cookie) | |
bbd7bb70 | 3813 | { |
1052b8ac JA |
3814 | struct request *rq; |
3815 | ||
29ece8b4 | 3816 | if (q->poll_nsec == BLK_MQ_POLL_CLASSIC) |
1052b8ac JA |
3817 | return false; |
3818 | ||
3819 | if (!blk_qc_t_is_internal(cookie)) | |
3820 | rq = blk_mq_tag_to_rq(hctx->tags, blk_qc_t_to_tag(cookie)); | |
3821 | else { | |
3822 | rq = blk_mq_tag_to_rq(hctx->sched_tags, blk_qc_t_to_tag(cookie)); | |
3823 | /* | |
3824 | * With scheduling, if the request has completed, we'll | |
3825 | * get a NULL return here, as we clear the sched tag when | |
3826 | * that happens. The request still remains valid, like always, | |
3827 | * so we should be safe with just the NULL check. | |
3828 | */ | |
3829 | if (!rq) | |
3830 | return false; | |
3831 | } | |
3832 | ||
cae740a0 | 3833 | return blk_mq_poll_hybrid_sleep(q, rq); |
1052b8ac JA |
3834 | } |
3835 | ||
529262d5 CH |
3836 | /** |
3837 | * blk_poll - poll for IO completions | |
3838 | * @q: the queue | |
3839 | * @cookie: cookie passed back at IO submission time | |
3840 | * @spin: whether to spin for completions | |
3841 | * | |
3842 | * Description: | |
3843 | * Poll for completions on the passed in queue. Returns number of | |
3844 | * completed entries found. If @spin is true, then blk_poll will continue | |
3845 | * looping until at least one completion is found, unless the task is | |
3846 | * otherwise marked running (or we need to reschedule). | |
3847 | */ | |
3848 | int blk_poll(struct request_queue *q, blk_qc_t cookie, bool spin) | |
1052b8ac JA |
3849 | { |
3850 | struct blk_mq_hw_ctx *hctx; | |
bbd7bb70 JA |
3851 | long state; |
3852 | ||
529262d5 CH |
3853 | if (!blk_qc_t_valid(cookie) || |
3854 | !test_bit(QUEUE_FLAG_POLL, &q->queue_flags)) | |
1052b8ac JA |
3855 | return 0; |
3856 | ||
529262d5 CH |
3857 | if (current->plug) |
3858 | blk_flush_plug_list(current->plug, false); | |
3859 | ||
1052b8ac JA |
3860 | hctx = q->queue_hw_ctx[blk_qc_t_to_queue_num(cookie)]; |
3861 | ||
06426adf JA |
3862 | /* |
3863 | * If we sleep, have the caller restart the poll loop to reset | |
3864 | * the state. Like for the other success return cases, the | |
3865 | * caller is responsible for checking if the IO completed. If | |
3866 | * the IO isn't complete, we'll get called again and will go | |
3867 | * straight to the busy poll loop. | |
3868 | */ | |
1052b8ac | 3869 | if (blk_mq_poll_hybrid(q, hctx, cookie)) |
85f4d4b6 | 3870 | return 1; |
06426adf | 3871 | |
bbd7bb70 JA |
3872 | hctx->poll_considered++; |
3873 | ||
3874 | state = current->state; | |
aa61bec3 | 3875 | do { |
bbd7bb70 JA |
3876 | int ret; |
3877 | ||
3878 | hctx->poll_invoked++; | |
3879 | ||
9743139c | 3880 | ret = q->mq_ops->poll(hctx); |
bbd7bb70 JA |
3881 | if (ret > 0) { |
3882 | hctx->poll_success++; | |
849a3700 | 3883 | __set_current_state(TASK_RUNNING); |
85f4d4b6 | 3884 | return ret; |
bbd7bb70 JA |
3885 | } |
3886 | ||
3887 | if (signal_pending_state(state, current)) | |
849a3700 | 3888 | __set_current_state(TASK_RUNNING); |
bbd7bb70 JA |
3889 | |
3890 | if (current->state == TASK_RUNNING) | |
85f4d4b6 | 3891 | return 1; |
0a1b8b87 | 3892 | if (ret < 0 || !spin) |
bbd7bb70 JA |
3893 | break; |
3894 | cpu_relax(); | |
aa61bec3 | 3895 | } while (!need_resched()); |
bbd7bb70 | 3896 | |
67b4110f | 3897 | __set_current_state(TASK_RUNNING); |
85f4d4b6 | 3898 | return 0; |
bbd7bb70 | 3899 | } |
529262d5 | 3900 | EXPORT_SYMBOL_GPL(blk_poll); |
bbd7bb70 | 3901 | |
9cf2bab6 JA |
3902 | unsigned int blk_mq_rq_cpu(struct request *rq) |
3903 | { | |
3904 | return rq->mq_ctx->cpu; | |
3905 | } | |
3906 | EXPORT_SYMBOL(blk_mq_rq_cpu); | |
3907 | ||
320ae51f JA |
3908 | static int __init blk_mq_init(void) |
3909 | { | |
c3077b5d CH |
3910 | int i; |
3911 | ||
3912 | for_each_possible_cpu(i) | |
3913 | INIT_LIST_HEAD(&per_cpu(blk_cpu_done, i)); | |
3914 | open_softirq(BLOCK_SOFTIRQ, blk_done_softirq); | |
3915 | ||
3916 | cpuhp_setup_state_nocalls(CPUHP_BLOCK_SOFTIRQ_DEAD, | |
3917 | "block/softirq:dead", NULL, | |
3918 | blk_softirq_cpu_dead); | |
9467f859 TG |
3919 | cpuhp_setup_state_multi(CPUHP_BLK_MQ_DEAD, "block/mq:dead", NULL, |
3920 | blk_mq_hctx_notify_dead); | |
bf0beec0 ML |
3921 | cpuhp_setup_state_multi(CPUHP_AP_BLK_MQ_ONLINE, "block/mq:online", |
3922 | blk_mq_hctx_notify_online, | |
3923 | blk_mq_hctx_notify_offline); | |
320ae51f JA |
3924 | return 0; |
3925 | } | |
3926 | subsys_initcall(blk_mq_init); |