Blame view
block/blk-mq-sched.c
14.1 KB
3dcf60bcb
|
1 |
// SPDX-License-Identifier: GPL-2.0 |
bd166ef18
|
2 3 4 5 6 7 8 9 10 11 12 13 14 |
/* * blk-mq scheduling framework * * Copyright (C) 2016 Jens Axboe */ #include <linux/kernel.h> #include <linux/module.h> #include <linux/blk-mq.h> #include <trace/events/block.h> #include "blk.h" #include "blk-mq.h" |
d332ce091
|
15 |
#include "blk-mq-debugfs.h" |
bd166ef18
|
16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 |
#include "blk-mq-sched.h" #include "blk-mq-tag.h" #include "blk-wbt.h" void blk_mq_sched_free_hctx_data(struct request_queue *q, void (*exit)(struct blk_mq_hw_ctx *)) { struct blk_mq_hw_ctx *hctx; int i; queue_for_each_hw_ctx(q, hctx, i) { if (exit && hctx->sched_data) exit(hctx); kfree(hctx->sched_data); hctx->sched_data = NULL; } } EXPORT_SYMBOL_GPL(blk_mq_sched_free_hctx_data); |
e2b3fa5af
|
34 |
void blk_mq_sched_assign_ioc(struct request *rq) |
bd166ef18
|
35 |
{ |
44e8c2bff
|
36 |
struct request_queue *q = rq->q; |
0c62bff1f
|
37 |
struct io_context *ioc; |
bd166ef18
|
38 |
struct io_cq *icq; |
0c62bff1f
|
39 40 41 42 43 44 |
/* * May not have an IO context if it's a passthrough request */ ioc = current->io_context; if (!ioc) return; |
0d945c1f9
|
45 |
spin_lock_irq(&q->queue_lock); |
bd166ef18
|
46 |
icq = ioc_lookup_icq(ioc, q); |
0d945c1f9
|
47 |
spin_unlock_irq(&q->queue_lock); |
bd166ef18
|
48 49 50 51 52 53 |
if (!icq) { icq = ioc_create_icq(ioc, q, GFP_ATOMIC); if (!icq) return; } |
ea511e3c2
|
54 |
get_io_context(icq->ioc); |
44e8c2bff
|
55 |
rq->elv.icq = icq; |
bd166ef18
|
56 |
} |
8e8320c93
|
57 58 59 60 |
/* * Mark a hardware queue as needing a restart. For shared queues, maintain * a count of how many hardware queues are marked for restart. */ |
7211aef86
|
61 |
void blk_mq_sched_mark_restart_hctx(struct blk_mq_hw_ctx *hctx) |
8e8320c93
|
62 63 64 |
{ if (test_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state)) return; |
97889f9ac
|
65 |
set_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state); |
8e8320c93
|
66 |
} |
7211aef86
|
67 |
EXPORT_SYMBOL_GPL(blk_mq_sched_mark_restart_hctx); |
8e8320c93
|
68 |
|
97889f9ac
|
69 |
void blk_mq_sched_restart(struct blk_mq_hw_ctx *hctx) |
8e8320c93
|
70 71 |
{ if (!test_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state)) |
97889f9ac
|
72 73 |
return; clear_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state); |
8e8320c93
|
74 |
|
97889f9ac
|
75 |
blk_mq_run_hw_queue(hctx, true); |
8e8320c93
|
76 |
} |
1f460b63d
|
77 78 79 80 81 82 |
/* * Only SCSI implements .get_budget and .put_budget, and SCSI restarts * its queue by itself in its completion handler, so we don't need to * restart queue if .get_budget() returns BLK_STS_NO_RESOURCE. */ static void blk_mq_do_dispatch_sched(struct blk_mq_hw_ctx *hctx) |
caf8eb0d6
|
83 84 85 86 87 88 |
{ struct request_queue *q = hctx->queue; struct elevator_queue *e = q->elevator; LIST_HEAD(rq_list); do { |
de1482974
|
89 |
struct request *rq; |
caf8eb0d6
|
90 |
|
f9cd4bfe9
|
91 |
if (e->type->ops.has_work && !e->type->ops.has_work(hctx)) |
caf8eb0d6
|
92 |
break; |
de1482974
|
93 |
|
88022d720
|
94 |
if (!blk_mq_get_dispatch_budget(hctx)) |
1f460b63d
|
95 |
break; |
de1482974
|
96 |
|
f9cd4bfe9
|
97 |
rq = e->type->ops.dispatch_request(hctx); |
de1482974
|
98 99 100 |
if (!rq) { blk_mq_put_dispatch_budget(hctx); break; |
de1482974
|
101 102 103 104 105 106 107 |
} /* * Now this rq owns the budget which has to be released * if this rq won't be queued to driver via .queue_rq() * in blk_mq_dispatch_rq_list(). */ |
caf8eb0d6
|
108 |
list_add(&rq->queuelist, &rq_list); |
de1482974
|
109 |
} while (blk_mq_dispatch_rq_list(q, &rq_list, true)); |
caf8eb0d6
|
110 |
} |
b347689ff
|
111 112 113 |
static struct blk_mq_ctx *blk_mq_next_ctx(struct blk_mq_hw_ctx *hctx, struct blk_mq_ctx *ctx) { |
f31967f0e
|
114 |
unsigned short idx = ctx->index_hw[hctx->type]; |
b347689ff
|
115 116 117 118 119 120 |
if (++idx == hctx->nr_ctx) idx = 0; return hctx->ctxs[idx]; } |
1f460b63d
|
121 122 123 124 125 126 |
/* * Only SCSI implements .get_budget and .put_budget, and SCSI restarts * its queue by itself in its completion handler, so we don't need to * restart queue if .get_budget() returns BLK_STS_NO_RESOURCE. */ static void blk_mq_do_dispatch_ctx(struct blk_mq_hw_ctx *hctx) |
b347689ff
|
127 128 129 130 131 132 133 |
{ struct request_queue *q = hctx->queue; LIST_HEAD(rq_list); struct blk_mq_ctx *ctx = READ_ONCE(hctx->dispatch_from); do { struct request *rq; |
b347689ff
|
134 135 136 |
if (!sbitmap_any_bit_set(&hctx->ctx_map)) break; |
88022d720
|
137 |
if (!blk_mq_get_dispatch_budget(hctx)) |
1f460b63d
|
138 |
break; |
b347689ff
|
139 140 141 142 143 |
rq = blk_mq_dequeue_from_ctx(hctx, ctx); if (!rq) { blk_mq_put_dispatch_budget(hctx); break; |
b347689ff
|
144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 |
} /* * Now this rq owns the budget which has to be released * if this rq won't be queued to driver via .queue_rq() * in blk_mq_dispatch_rq_list(). */ list_add(&rq->queuelist, &rq_list); /* round robin for fair dispatch */ ctx = blk_mq_next_ctx(hctx, rq->mq_ctx); } while (blk_mq_dispatch_rq_list(q, &rq_list, true)); WRITE_ONCE(hctx->dispatch_from, ctx); |
b347689ff
|
159 |
} |
1f460b63d
|
160 |
void blk_mq_sched_dispatch_requests(struct blk_mq_hw_ctx *hctx) |
bd166ef18
|
161 |
{ |
81380ca10
|
162 163 |
struct request_queue *q = hctx->queue; struct elevator_queue *e = q->elevator; |
f9cd4bfe9
|
164 |
const bool has_sched_dispatch = e && e->type->ops.dispatch_request; |
bd166ef18
|
165 |
LIST_HEAD(rq_list); |
f4560ffe8
|
166 167 |
/* RCU or SRCU read lock is needed before checking quiesced flag */ if (unlikely(blk_mq_hctx_stopped(hctx) || blk_queue_quiesced(q))) |
1f460b63d
|
168 |
return; |
bd166ef18
|
169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 |
hctx->run++; /* * If we have previous entries on our dispatch list, grab them first for * more fair dispatch. */ if (!list_empty_careful(&hctx->dispatch)) { spin_lock(&hctx->lock); if (!list_empty(&hctx->dispatch)) list_splice_init(&hctx->dispatch, &rq_list); spin_unlock(&hctx->lock); } /* * Only ask the scheduler for requests, if we didn't have residual * requests from the dispatch list. This is to avoid the case where * we only ever dispatch a fraction of the requests available because * of low device queue depth. Once we pull requests out of the IO * scheduler, we can no longer merge or sort them. So it's best to * leave them there for as long as we can. Mark the hw queue as * needing a restart in that case. |
caf8eb0d6
|
191 192 193 194 |
* * We want to dispatch from the scheduler if there was nothing * on the dispatch list or we were able to dispatch from the * dispatch list. |
bd166ef18
|
195 |
*/ |
c13660a08
|
196 |
if (!list_empty(&rq_list)) { |
d38d35155
|
197 |
blk_mq_sched_mark_restart_hctx(hctx); |
b347689ff
|
198 199 |
if (blk_mq_dispatch_rq_list(q, &rq_list, false)) { if (has_sched_dispatch) |
1f460b63d
|
200 |
blk_mq_do_dispatch_sched(hctx); |
b347689ff
|
201 |
else |
1f460b63d
|
202 |
blk_mq_do_dispatch_ctx(hctx); |
b347689ff
|
203 |
} |
caf8eb0d6
|
204 |
} else if (has_sched_dispatch) { |
1f460b63d
|
205 |
blk_mq_do_dispatch_sched(hctx); |
6e7687173
|
206 207 |
} else if (hctx->dispatch_busy) { /* dequeue request one by one from sw queue if queue is busy */ |
1f460b63d
|
208 |
blk_mq_do_dispatch_ctx(hctx); |
caf8eb0d6
|
209 |
} else { |
c13660a08
|
210 |
blk_mq_flush_busy_ctxs(hctx, &rq_list); |
de1482974
|
211 |
blk_mq_dispatch_rq_list(q, &rq_list, false); |
64765a75e
|
212 |
} |
bd166ef18
|
213 |
} |
e4d750c97
|
214 |
bool blk_mq_sched_try_merge(struct request_queue *q, struct bio *bio, |
14ccb66b3
|
215 |
unsigned int nr_segs, struct request **merged_request) |
bd166ef18
|
216 217 |
{ struct request *rq; |
bd166ef18
|
218 |
|
34fe7c054
|
219 220 |
switch (elv_merge(q, &rq, bio)) { case ELEVATOR_BACK_MERGE: |
bd166ef18
|
221 222 |
if (!blk_mq_sched_allow_merge(q, rq, bio)) return false; |
14ccb66b3
|
223 |
if (!bio_attempt_back_merge(rq, bio, nr_segs)) |
34fe7c054
|
224 225 226 227 228 229 |
return false; *merged_request = attempt_back_merge(q, rq); if (!*merged_request) elv_merged_request(q, rq, ELEVATOR_BACK_MERGE); return true; case ELEVATOR_FRONT_MERGE: |
bd166ef18
|
230 231 |
if (!blk_mq_sched_allow_merge(q, rq, bio)) return false; |
14ccb66b3
|
232 |
if (!bio_attempt_front_merge(rq, bio, nr_segs)) |
34fe7c054
|
233 234 235 236 237 |
return false; *merged_request = attempt_front_merge(q, rq); if (!*merged_request) elv_merged_request(q, rq, ELEVATOR_FRONT_MERGE); return true; |
bea99a500
|
238 239 |
case ELEVATOR_DISCARD_MERGE: return bio_attempt_discard_merge(q, rq, bio); |
34fe7c054
|
240 241 |
default: return false; |
bd166ef18
|
242 |
} |
bd166ef18
|
243 244 |
} EXPORT_SYMBOL_GPL(blk_mq_sched_try_merge); |
9bddeb2a5
|
245 |
/* |
9c5587346
|
246 247 |
* Iterate list of requests and see if we can merge this bio with any * of them. |
9bddeb2a5
|
248 |
*/ |
9c5587346
|
249 |
bool blk_mq_bio_list_merge(struct request_queue *q, struct list_head *list, |
14ccb66b3
|
250 |
struct bio *bio, unsigned int nr_segs) |
9bddeb2a5
|
251 252 253 |
{ struct request *rq; int checked = 8; |
9c5587346
|
254 |
list_for_each_entry_reverse(rq, list, queuelist) { |
9bddeb2a5
|
255 256 257 258 259 260 261 262 263 264 265 |
bool merged = false; if (!checked--) break; if (!blk_rq_merge_ok(rq, bio)) continue; switch (blk_try_merge(rq, bio)) { case ELEVATOR_BACK_MERGE: if (blk_mq_sched_allow_merge(q, rq, bio)) |
14ccb66b3
|
266 267 |
merged = bio_attempt_back_merge(rq, bio, nr_segs); |
9bddeb2a5
|
268 269 270 |
break; case ELEVATOR_FRONT_MERGE: if (blk_mq_sched_allow_merge(q, rq, bio)) |
14ccb66b3
|
271 272 |
merged = bio_attempt_front_merge(rq, bio, nr_segs); |
9bddeb2a5
|
273 274 275 276 277 278 279 |
break; case ELEVATOR_DISCARD_MERGE: merged = bio_attempt_discard_merge(q, rq, bio); break; default: continue; } |
9bddeb2a5
|
280 281 282 283 284 |
return merged; } return false; } |
9c5587346
|
285 286 287 288 289 290 291 292 |
EXPORT_SYMBOL_GPL(blk_mq_bio_list_merge); /* * Reverse check our software queue for entries that we could potentially * merge with. Currently includes a hand-wavy stop count of 8, to not spend * too much time checking for merges. */ static bool blk_mq_attempt_merge(struct request_queue *q, |
c16d6b5a9
|
293 |
struct blk_mq_hw_ctx *hctx, |
14ccb66b3
|
294 295 |
struct blk_mq_ctx *ctx, struct bio *bio, unsigned int nr_segs) |
9c5587346
|
296 |
{ |
c16d6b5a9
|
297 |
enum hctx_type type = hctx->type; |
9c5587346
|
298 |
lockdep_assert_held(&ctx->lock); |
14ccb66b3
|
299 |
if (blk_mq_bio_list_merge(q, &ctx->rq_lists[type], bio, nr_segs)) { |
9c5587346
|
300 301 302 303 304 305 |
ctx->rq_merged++; return true; } return false; } |
9bddeb2a5
|
306 |
|
14ccb66b3
|
307 308 |
bool __blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio, unsigned int nr_segs) |
bd166ef18
|
309 310 |
{ struct elevator_queue *e = q->elevator; |
9bddeb2a5
|
311 |
struct blk_mq_ctx *ctx = blk_mq_get_ctx(q); |
8ccdf4a37
|
312 |
struct blk_mq_hw_ctx *hctx = blk_mq_map_queue(q, bio->bi_opf, ctx); |
9bddeb2a5
|
313 |
bool ret = false; |
c16d6b5a9
|
314 |
enum hctx_type type; |
bd166ef18
|
315 |
|
c05f42206
|
316 |
if (e && e->type->ops.bio_merge) |
14ccb66b3
|
317 |
return e->type->ops.bio_merge(hctx, bio, nr_segs); |
bd166ef18
|
318 |
|
c16d6b5a9
|
319 |
type = hctx->type; |
b04f50ab8
|
320 |
if ((hctx->flags & BLK_MQ_F_SHOULD_MERGE) && |
c16d6b5a9
|
321 |
!list_empty_careful(&ctx->rq_lists[type])) { |
9bddeb2a5
|
322 323 |
/* default per sw-queue merge */ spin_lock(&ctx->lock); |
14ccb66b3
|
324 |
ret = blk_mq_attempt_merge(q, hctx, ctx, bio, nr_segs); |
9bddeb2a5
|
325 326 |
spin_unlock(&ctx->lock); } |
9bddeb2a5
|
327 |
return ret; |
bd166ef18
|
328 329 330 331 332 333 334 335 336 337 338 339 340 |
} bool blk_mq_sched_try_insert_merge(struct request_queue *q, struct request *rq) { return rq_mergeable(rq) && elv_attempt_insert_merge(q, rq); } EXPORT_SYMBOL_GPL(blk_mq_sched_try_insert_merge); void blk_mq_sched_request_inserted(struct request *rq) { trace_block_rq_insert(rq->q, rq); } EXPORT_SYMBOL_GPL(blk_mq_sched_request_inserted); |
0cacba6cf
|
341 |
static bool blk_mq_sched_bypass_insert(struct blk_mq_hw_ctx *hctx, |
a6a252e64
|
342 |
bool has_sched, |
0cacba6cf
|
343 |
struct request *rq) |
bd166ef18
|
344 |
{ |
a6a252e64
|
345 346 347 348 349 350 351 |
/* dispatch flush rq directly */ if (rq->rq_flags & RQF_FLUSH_SEQ) { spin_lock(&hctx->lock); list_add(&rq->queuelist, &hctx->dispatch); spin_unlock(&hctx->lock); return true; } |
923218f61
|
352 |
if (has_sched) |
bd166ef18
|
353 |
rq->rq_flags |= RQF_SORTED; |
bd166ef18
|
354 |
|
a6a252e64
|
355 |
return false; |
bd166ef18
|
356 |
} |
bd166ef18
|
357 |
|
bd6737f1a
|
358 |
void blk_mq_sched_insert_request(struct request *rq, bool at_head, |
9e97d2951
|
359 |
bool run_queue, bool async) |
bd6737f1a
|
360 361 362 363 |
{ struct request_queue *q = rq->q; struct elevator_queue *e = q->elevator; struct blk_mq_ctx *ctx = rq->mq_ctx; |
ea4f995ee
|
364 |
struct blk_mq_hw_ctx *hctx = rq->mq_hctx; |
bd6737f1a
|
365 |
|
a6a252e64
|
366 367 |
/* flush rq in flush machinery need to be dispatched directly */ if (!(rq->rq_flags & RQF_FLUSH_SEQ) && op_is_flush(rq->cmd_flags)) { |
923218f61
|
368 369 |
blk_insert_flush(rq); goto run; |
bd6737f1a
|
370 |
} |
923218f61
|
371 |
WARN_ON(e && (rq->tag != -1)); |
a6a252e64
|
372 |
if (blk_mq_sched_bypass_insert(hctx, !!e, rq)) |
0cacba6cf
|
373 |
goto run; |
f9cd4bfe9
|
374 |
if (e && e->type->ops.insert_requests) { |
bd6737f1a
|
375 376 377 |
LIST_HEAD(list); list_add(&rq->queuelist, &list); |
f9cd4bfe9
|
378 |
e->type->ops.insert_requests(hctx, &list, at_head); |
bd6737f1a
|
379 380 381 382 383 |
} else { spin_lock(&ctx->lock); __blk_mq_insert_request(hctx, rq, at_head); spin_unlock(&ctx->lock); } |
0cacba6cf
|
384 |
run: |
bd6737f1a
|
385 386 387 |
if (run_queue) blk_mq_run_hw_queue(hctx, async); } |
67cae4c94
|
388 |
void blk_mq_sched_insert_requests(struct blk_mq_hw_ctx *hctx, |
bd6737f1a
|
389 390 391 |
struct blk_mq_ctx *ctx, struct list_head *list, bool run_queue_async) { |
f9afca4d3
|
392 |
struct elevator_queue *e; |
e87eb301b
|
393 394 395 396 397 398 399 400 |
struct request_queue *q = hctx->queue; /* * blk_mq_sched_insert_requests() is called from flush plug * context only, and hold one usage counter to prevent queue * from being released. */ percpu_ref_get(&q->q_usage_counter); |
bd6737f1a
|
401 |
|
f9afca4d3
|
402 |
e = hctx->queue->elevator; |
f9cd4bfe9
|
403 404 |
if (e && e->type->ops.insert_requests) e->type->ops.insert_requests(hctx, list, false); |
6ce3dd6ee
|
405 406 407 408 409 410 |
else { /* * try to issue requests directly if the hw queue isn't * busy in case of 'none' scheduler, and this way may save * us one extra enqueue & dequeue to sw queue. */ |
fd9c40f64
|
411 |
if (!hctx->dispatch_busy && !e && !run_queue_async) { |
6ce3dd6ee
|
412 |
blk_mq_try_issue_list_directly(hctx, list); |
fd9c40f64
|
413 |
if (list_empty(list)) |
e87eb301b
|
414 |
goto out; |
fd9c40f64
|
415 416 |
} blk_mq_insert_requests(hctx, ctx, list); |
6ce3dd6ee
|
417 |
} |
bd6737f1a
|
418 419 |
blk_mq_run_hw_queue(hctx, run_queue_async); |
e87eb301b
|
420 421 |
out: percpu_ref_put(&q->q_usage_counter); |
bd6737f1a
|
422 |
} |
bd166ef18
|
423 424 425 426 427 428 429 430 431 432 |
static void blk_mq_sched_free_tags(struct blk_mq_tag_set *set, struct blk_mq_hw_ctx *hctx, unsigned int hctx_idx) { if (hctx->sched_tags) { blk_mq_free_rqs(set, hctx->sched_tags, hctx_idx); blk_mq_free_rq_map(hctx->sched_tags); hctx->sched_tags = NULL; } } |
6917ff0b5
|
433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 |
static int blk_mq_sched_alloc_tags(struct request_queue *q, struct blk_mq_hw_ctx *hctx, unsigned int hctx_idx) { struct blk_mq_tag_set *set = q->tag_set; int ret; hctx->sched_tags = blk_mq_alloc_rq_map(set, hctx_idx, q->nr_requests, set->reserved_tags); if (!hctx->sched_tags) return -ENOMEM; ret = blk_mq_alloc_rqs(set, hctx->sched_tags, hctx_idx, q->nr_requests); if (ret) blk_mq_sched_free_tags(set, hctx, hctx_idx); return ret; } |
c3e221921
|
451 |
/* called in queue's release handler, tagset has gone away */ |
54d5329d4
|
452 |
static void blk_mq_sched_tags_teardown(struct request_queue *q) |
bd166ef18
|
453 |
{ |
bd166ef18
|
454 |
struct blk_mq_hw_ctx *hctx; |
6917ff0b5
|
455 |
int i; |
c3e221921
|
456 457 458 459 460 461 |
queue_for_each_hw_ctx(q, hctx, i) { if (hctx->sched_tags) { blk_mq_free_rq_map(hctx->sched_tags); hctx->sched_tags = NULL; } } |
6917ff0b5
|
462 463 464 465 466 |
} int blk_mq_init_sched(struct request_queue *q, struct elevator_type *e) { struct blk_mq_hw_ctx *hctx; |
ee056f981
|
467 |
struct elevator_queue *eq; |
6917ff0b5
|
468 469 470 471 472 |
unsigned int i; int ret; if (!e) { q->elevator = NULL; |
32a50fabb
|
473 |
q->nr_requests = q->tag_set->queue_depth; |
6917ff0b5
|
474 475 |
return 0; } |
bd166ef18
|
476 477 |
/* |
32825c45f
|
478 479 480 |
* Default to double of smaller one between hw queue_depth and 128, * since we don't split into sync/async like the old code did. * Additionally, this is a per-hw queue depth. |
bd166ef18
|
481 |
*/ |
32825c45f
|
482 483 |
q->nr_requests = 2 * min_t(unsigned int, q->tag_set->queue_depth, BLKDEV_MAX_RQ); |
bd166ef18
|
484 |
|
bd166ef18
|
485 |
queue_for_each_hw_ctx(q, hctx, i) { |
6917ff0b5
|
486 |
ret = blk_mq_sched_alloc_tags(q, hctx, i); |
bd166ef18
|
487 |
if (ret) |
6917ff0b5
|
488 |
goto err; |
bd166ef18
|
489 |
} |
f9cd4bfe9
|
490 |
ret = e->ops.init_sched(q, e); |
6917ff0b5
|
491 492 |
if (ret) goto err; |
bd166ef18
|
493 |
|
d332ce091
|
494 495 496 |
blk_mq_debugfs_register_sched(q); queue_for_each_hw_ctx(q, hctx, i) { |
f9cd4bfe9
|
497 498 |
if (e->ops.init_hctx) { ret = e->ops.init_hctx(hctx, i); |
ee056f981
|
499 500 |
if (ret) { eq = q->elevator; |
c3e221921
|
501 |
blk_mq_sched_free_requests(q); |
ee056f981
|
502 503 504 505 506 |
blk_mq_exit_sched(q, eq); kobject_put(&eq->kobj); return ret; } } |
d332ce091
|
507 |
blk_mq_debugfs_register_sched_hctx(q, hctx); |
ee056f981
|
508 |
} |
bd166ef18
|
509 |
return 0; |
bd166ef18
|
510 |
|
6917ff0b5
|
511 |
err: |
c3e221921
|
512 |
blk_mq_sched_free_requests(q); |
54d5329d4
|
513 514 |
blk_mq_sched_tags_teardown(q); q->elevator = NULL; |
6917ff0b5
|
515 |
return ret; |
bd166ef18
|
516 |
} |
d34849913
|
517 |
|
c3e221921
|
518 519 520 521 522 523 524 525 526 527 |
/* * called in either blk_queue_cleanup or elevator_switch, tagset * is required for freeing requests */ void blk_mq_sched_free_requests(struct request_queue *q) { struct blk_mq_hw_ctx *hctx; int i; lockdep_assert_held(&q->sysfs_lock); |
c3e221921
|
528 529 530 531 532 533 |
queue_for_each_hw_ctx(q, hctx, i) { if (hctx->sched_tags) blk_mq_free_rqs(q->tag_set, hctx->sched_tags, i); } } |
54d5329d4
|
534 535 |
void blk_mq_exit_sched(struct request_queue *q, struct elevator_queue *e) { |
ee056f981
|
536 537 |
struct blk_mq_hw_ctx *hctx; unsigned int i; |
d332ce091
|
538 539 |
queue_for_each_hw_ctx(q, hctx, i) { blk_mq_debugfs_unregister_sched_hctx(hctx); |
f9cd4bfe9
|
540 541 |
if (e->type->ops.exit_hctx && hctx->sched_data) { e->type->ops.exit_hctx(hctx, i); |
d332ce091
|
542 |
hctx->sched_data = NULL; |
ee056f981
|
543 544 |
} } |
d332ce091
|
545 |
blk_mq_debugfs_unregister_sched(q); |
f9cd4bfe9
|
546 547 |
if (e->type->ops.exit_sched) e->type->ops.exit_sched(e); |
54d5329d4
|
548 549 550 |
blk_mq_sched_tags_teardown(q); q->elevator = NULL; } |