blk-mq: fix allocation for queue mapping table
[linux-block.git] / block / blk-mq-debugfs.c
CommitLineData
07e4fead
OS
1/*
2 * Copyright (C) 2017 Facebook
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
7 *
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
12 *
13 * You should have received a copy of the GNU General Public License
14 * along with this program. If not, see <https://www.gnu.org/licenses/>.
15 */
16
17#include <linux/kernel.h>
18#include <linux/blkdev.h>
19#include <linux/debugfs.h>
20
21#include <linux/blk-mq.h>
18fbda91 22#include "blk.h"
07e4fead 23#include "blk-mq.h"
d173a251 24#include "blk-mq-debugfs.h"
d96b37c0 25#include "blk-mq-tag.h"
cc56694f 26#include "blk-rq-qos.h"
07e4fead 27
1209cb7f
BVA
28static void print_stat(struct seq_file *m, struct blk_rq_stat *stat)
29{
30 if (stat->nr_samples) {
31 seq_printf(m, "samples=%d, mean=%lld, min=%llu, max=%llu",
32 stat->nr_samples, stat->mean, stat->min, stat->max);
33 } else {
34 seq_puts(m, "samples=0");
35 }
36}
37
38static int queue_poll_stat_show(void *data, struct seq_file *m)
39{
40 struct request_queue *q = data;
41 int bucket;
42
43 for (bucket = 0; bucket < BLK_MQ_POLL_STATS_BKTS/2; bucket++) {
44 seq_printf(m, "read (%d Bytes): ", 1 << (9+bucket));
45 print_stat(m, &q->poll_stat[2*bucket]);
46 seq_puts(m, "\n");
47
48 seq_printf(m, "write (%d Bytes): ", 1 << (9+bucket));
49 print_stat(m, &q->poll_stat[2*bucket+1]);
50 seq_puts(m, "\n");
51 }
52 return 0;
53}
54
55static void *queue_requeue_list_start(struct seq_file *m, loff_t *pos)
56 __acquires(&q->requeue_lock)
57{
58 struct request_queue *q = m->private;
59
60 spin_lock_irq(&q->requeue_lock);
61 return seq_list_start(&q->requeue_list, *pos);
62}
63
64static void *queue_requeue_list_next(struct seq_file *m, void *v, loff_t *pos)
65{
66 struct request_queue *q = m->private;
67
68 return seq_list_next(v, &q->requeue_list, pos);
69}
70
71static void queue_requeue_list_stop(struct seq_file *m, void *v)
72 __releases(&q->requeue_lock)
73{
74 struct request_queue *q = m->private;
75
76 spin_unlock_irq(&q->requeue_lock);
77}
78
79static const struct seq_operations queue_requeue_list_seq_ops = {
80 .start = queue_requeue_list_start,
81 .next = queue_requeue_list_next,
82 .stop = queue_requeue_list_stop,
83 .show = blk_mq_debugfs_rq_show,
84};
85
91d68905
BVA
86static int blk_flags_show(struct seq_file *m, const unsigned long flags,
87 const char *const *flag_name, int flag_name_count)
88{
89 bool sep = false;
90 int i;
91
92 for (i = 0; i < sizeof(flags) * BITS_PER_BYTE; i++) {
93 if (!(flags & BIT(i)))
94 continue;
95 if (sep)
bec03d6b 96 seq_puts(m, "|");
91d68905
BVA
97 sep = true;
98 if (i < flag_name_count && flag_name[i])
99 seq_puts(m, flag_name[i]);
100 else
101 seq_printf(m, "%d", i);
102 }
91d68905
BVA
103 return 0;
104}
105
cd84a62e
BVA
106static int queue_pm_only_show(void *data, struct seq_file *m)
107{
108 struct request_queue *q = data;
109
110 seq_printf(m, "%d\n", atomic_read(&q->pm_only));
111 return 0;
112}
113
1a435111 114#define QUEUE_FLAG_NAME(name) [QUEUE_FLAG_##name] = #name
91d68905 115static const char *const blk_queue_flag_name[] = {
1a435111 116 QUEUE_FLAG_NAME(STOPPED),
1a435111 117 QUEUE_FLAG_NAME(DYING),
1a435111
OS
118 QUEUE_FLAG_NAME(BIDI),
119 QUEUE_FLAG_NAME(NOMERGES),
120 QUEUE_FLAG_NAME(SAME_COMP),
121 QUEUE_FLAG_NAME(FAIL_IO),
1a435111
OS
122 QUEUE_FLAG_NAME(NONROT),
123 QUEUE_FLAG_NAME(IO_STAT),
124 QUEUE_FLAG_NAME(DISCARD),
125 QUEUE_FLAG_NAME(NOXMERGES),
126 QUEUE_FLAG_NAME(ADD_RANDOM),
127 QUEUE_FLAG_NAME(SECERASE),
128 QUEUE_FLAG_NAME(SAME_FORCE),
129 QUEUE_FLAG_NAME(DEAD),
130 QUEUE_FLAG_NAME(INIT_DONE),
131 QUEUE_FLAG_NAME(NO_SG_MERGE),
132 QUEUE_FLAG_NAME(POLL),
133 QUEUE_FLAG_NAME(WC),
134 QUEUE_FLAG_NAME(FUA),
135 QUEUE_FLAG_NAME(FLUSH_NQ),
136 QUEUE_FLAG_NAME(DAX),
137 QUEUE_FLAG_NAME(STATS),
138 QUEUE_FLAG_NAME(POLL_STATS),
139 QUEUE_FLAG_NAME(REGISTERED),
22d53821
BVA
140 QUEUE_FLAG_NAME(SCSI_PASSTHROUGH),
141 QUEUE_FLAG_NAME(QUIESCED),
91d68905 142};
1a435111 143#undef QUEUE_FLAG_NAME
91d68905 144
f57de23a 145static int queue_state_show(void *data, struct seq_file *m)
91d68905 146{
f57de23a 147 struct request_queue *q = data;
91d68905
BVA
148
149 blk_flags_show(m, q->queue_flags, blk_queue_flag_name,
150 ARRAY_SIZE(blk_queue_flag_name));
fd07dc81 151 seq_puts(m, "\n");
91d68905
BVA
152 return 0;
153}
154
f57de23a
OS
155static ssize_t queue_state_write(void *data, const char __user *buf,
156 size_t count, loff_t *ppos)
91d68905 157{
f57de23a 158 struct request_queue *q = data;
71b90511 159 char opbuf[16] = { }, *op;
91d68905 160
18d4d7d0
BVA
161 /*
162 * The "state" attribute is removed after blk_cleanup_queue() has called
163 * blk_mq_free_queue(). Return if QUEUE_FLAG_DEAD has been set to avoid
164 * triggering a use-after-free.
165 */
166 if (blk_queue_dead(q))
167 return -ENOENT;
168
71b90511 169 if (count >= sizeof(opbuf)) {
c7e4145a
OS
170 pr_err("%s: operation too long\n", __func__);
171 goto inval;
172 }
173
71b90511 174 if (copy_from_user(opbuf, buf, count))
91d68905 175 return -EFAULT;
71b90511 176 op = strstrip(opbuf);
91d68905
BVA
177 if (strcmp(op, "run") == 0) {
178 blk_mq_run_hw_queues(q, true);
179 } else if (strcmp(op, "start") == 0) {
180 blk_mq_start_stopped_hw_queues(q, true);
edea55ab
BVA
181 } else if (strcmp(op, "kick") == 0) {
182 blk_mq_kick_requeue_list(q);
91d68905 183 } else {
c7e4145a
OS
184 pr_err("%s: unsupported operation '%s'\n", __func__, op);
185inval:
edea55ab 186 pr_err("%s: use 'run', 'start' or 'kick'\n", __func__);
91d68905
BVA
187 return -EINVAL;
188 }
c7e4145a 189 return count;
91d68905
BVA
190}
191
f793dfd3
JA
192static int queue_write_hint_show(void *data, struct seq_file *m)
193{
194 struct request_queue *q = data;
195 int i;
196
197 for (i = 0; i < BLK_MAX_WRITE_HINTS; i++)
198 seq_printf(m, "hint%d: %llu\n", i, q->write_hints[i]);
199
200 return 0;
201}
202
203static ssize_t queue_write_hint_store(void *data, const char __user *buf,
204 size_t count, loff_t *ppos)
205{
206 struct request_queue *q = data;
207 int i;
208
209 for (i = 0; i < BLK_MAX_WRITE_HINTS; i++)
210 q->write_hints[i] = 0;
211
212 return count;
213}
214
1209cb7f
BVA
215static const struct blk_mq_debugfs_attr blk_mq_debugfs_queue_attrs[] = {
216 { "poll_stat", 0400, queue_poll_stat_show },
217 { "requeue_list", 0400, .seq_ops = &queue_requeue_list_seq_ops },
cd84a62e 218 { "pm_only", 0600, queue_pm_only_show, NULL },
1209cb7f
BVA
219 { "state", 0600, queue_state_show, queue_state_write },
220 { "write_hints", 0600, queue_write_hint_show, queue_write_hint_store },
18bc4230 221 { "zone_wlock", 0400, queue_zone_wlock_show, NULL },
1209cb7f
BVA
222 { },
223};
34dbad5d 224
1a435111 225#define HCTX_STATE_NAME(name) [BLK_MQ_S_##name] = #name
f5c0b091 226static const char *const hctx_state_name[] = {
1a435111
OS
227 HCTX_STATE_NAME(STOPPED),
228 HCTX_STATE_NAME(TAG_ACTIVE),
229 HCTX_STATE_NAME(SCHED_RESTART),
f5c0b091 230};
1a435111
OS
231#undef HCTX_STATE_NAME
232
f57de23a 233static int hctx_state_show(void *data, struct seq_file *m)
9abb2ad2 234{
f57de23a 235 struct blk_mq_hw_ctx *hctx = data;
9abb2ad2 236
f5c0b091
BVA
237 blk_flags_show(m, hctx->state, hctx_state_name,
238 ARRAY_SIZE(hctx_state_name));
fd07dc81 239 seq_puts(m, "\n");
9abb2ad2
OS
240 return 0;
241}
242
1a435111 243#define BLK_TAG_ALLOC_NAME(name) [BLK_TAG_ALLOC_##name] = #name
f5c0b091 244static const char *const alloc_policy_name[] = {
1a435111
OS
245 BLK_TAG_ALLOC_NAME(FIFO),
246 BLK_TAG_ALLOC_NAME(RR),
f5c0b091 247};
1a435111 248#undef BLK_TAG_ALLOC_NAME
f5c0b091 249
1a435111 250#define HCTX_FLAG_NAME(name) [ilog2(BLK_MQ_F_##name)] = #name
f5c0b091 251static const char *const hctx_flag_name[] = {
1a435111
OS
252 HCTX_FLAG_NAME(SHOULD_MERGE),
253 HCTX_FLAG_NAME(TAG_SHARED),
254 HCTX_FLAG_NAME(SG_MERGE),
255 HCTX_FLAG_NAME(BLOCKING),
256 HCTX_FLAG_NAME(NO_SCHED),
f5c0b091 257};
1a435111 258#undef HCTX_FLAG_NAME
f5c0b091 259
f57de23a 260static int hctx_flags_show(void *data, struct seq_file *m)
9abb2ad2 261{
f57de23a 262 struct blk_mq_hw_ctx *hctx = data;
f5c0b091 263 const int alloc_policy = BLK_MQ_FLAG_TO_ALLOC_POLICY(hctx->flags);
9abb2ad2 264
f5c0b091
BVA
265 seq_puts(m, "alloc_policy=");
266 if (alloc_policy < ARRAY_SIZE(alloc_policy_name) &&
267 alloc_policy_name[alloc_policy])
268 seq_puts(m, alloc_policy_name[alloc_policy]);
269 else
270 seq_printf(m, "%d", alloc_policy);
271 seq_puts(m, " ");
272 blk_flags_show(m,
273 hctx->flags ^ BLK_ALLOC_POLICY_TO_MQ_FLAG(alloc_policy),
274 hctx_flag_name, ARRAY_SIZE(hctx_flag_name));
fd07dc81 275 seq_puts(m, "\n");
9abb2ad2
OS
276 return 0;
277}
278
1a435111 279#define REQ_OP_NAME(name) [REQ_OP_##name] = #name
8658dca8 280static const char *const op_name[] = {
1a435111
OS
281 REQ_OP_NAME(READ),
282 REQ_OP_NAME(WRITE),
283 REQ_OP_NAME(FLUSH),
284 REQ_OP_NAME(DISCARD),
1a435111
OS
285 REQ_OP_NAME(SECURE_ERASE),
286 REQ_OP_NAME(ZONE_RESET),
287 REQ_OP_NAME(WRITE_SAME),
288 REQ_OP_NAME(WRITE_ZEROES),
289 REQ_OP_NAME(SCSI_IN),
290 REQ_OP_NAME(SCSI_OUT),
291 REQ_OP_NAME(DRV_IN),
292 REQ_OP_NAME(DRV_OUT),
8658dca8 293};
1a435111 294#undef REQ_OP_NAME
8658dca8 295
1a435111 296#define CMD_FLAG_NAME(name) [__REQ_##name] = #name
8658dca8 297static const char *const cmd_flag_name[] = {
1a435111
OS
298 CMD_FLAG_NAME(FAILFAST_DEV),
299 CMD_FLAG_NAME(FAILFAST_TRANSPORT),
300 CMD_FLAG_NAME(FAILFAST_DRIVER),
301 CMD_FLAG_NAME(SYNC),
302 CMD_FLAG_NAME(META),
303 CMD_FLAG_NAME(PRIO),
304 CMD_FLAG_NAME(NOMERGE),
305 CMD_FLAG_NAME(IDLE),
306 CMD_FLAG_NAME(INTEGRITY),
307 CMD_FLAG_NAME(FUA),
308 CMD_FLAG_NAME(PREFLUSH),
309 CMD_FLAG_NAME(RAHEAD),
310 CMD_FLAG_NAME(BACKGROUND),
311 CMD_FLAG_NAME(NOUNMAP),
22d53821 312 CMD_FLAG_NAME(NOWAIT),
8658dca8 313};
1a435111 314#undef CMD_FLAG_NAME
8658dca8 315
1a435111 316#define RQF_NAME(name) [ilog2((__force u32)RQF_##name)] = #name
8658dca8 317static const char *const rqf_name[] = {
1a435111 318 RQF_NAME(SORTED),
85ba3eff 319 RQF_NAME(STARTED),
1a435111
OS
320 RQF_NAME(SOFTBARRIER),
321 RQF_NAME(FLUSH_SEQ),
322 RQF_NAME(MIXED_MERGE),
323 RQF_NAME(MQ_INFLIGHT),
324 RQF_NAME(DONTPREP),
325 RQF_NAME(PREEMPT),
326 RQF_NAME(COPY_USER),
327 RQF_NAME(FAILED),
328 RQF_NAME(QUIET),
329 RQF_NAME(ELVPRIV),
330 RQF_NAME(IO_STAT),
331 RQF_NAME(ALLOCED),
332 RQF_NAME(PM),
333 RQF_NAME(HASHED),
334 RQF_NAME(STATS),
335 RQF_NAME(SPECIAL_PAYLOAD),
5d75d3f2 336 RQF_NAME(ZONE_WRITE_LOCKED),
76a86f9d 337 RQF_NAME(MQ_POLL_SLEPT),
8658dca8 338};
1a435111 339#undef RQF_NAME
8658dca8 340
ec6dcf63
BVA
341static const char *const blk_mq_rq_state_name_array[] = {
342 [MQ_RQ_IDLE] = "idle",
343 [MQ_RQ_IN_FLIGHT] = "in_flight",
344 [MQ_RQ_COMPLETE] = "complete",
345};
346
347static const char *blk_mq_rq_state_name(enum mq_rq_state rq_state)
348{
a1e79188 349 if (WARN_ON_ONCE((unsigned int)rq_state >=
ec6dcf63
BVA
350 ARRAY_SIZE(blk_mq_rq_state_name_array)))
351 return "(?)";
352 return blk_mq_rq_state_name_array[rq_state];
353}
354
daaadb3e 355int __blk_mq_debugfs_rq_show(struct seq_file *m, struct request *rq)
950cd7e9 356{
2836ee4b 357 const struct blk_mq_ops *const mq_ops = rq->q->mq_ops;
8658dca8 358 const unsigned int op = rq->cmd_flags & REQ_OP_MASK;
950cd7e9 359
8658dca8
BVA
360 seq_printf(m, "%p {.op=", rq);
361 if (op < ARRAY_SIZE(op_name) && op_name[op])
362 seq_printf(m, "%s", op_name[op]);
363 else
364 seq_printf(m, "%d", op);
365 seq_puts(m, ", .cmd_flags=");
366 blk_flags_show(m, rq->cmd_flags & ~REQ_OP_MASK, cmd_flag_name,
367 ARRAY_SIZE(cmd_flag_name));
368 seq_puts(m, ", .rq_flags=");
369 blk_flags_show(m, (__force unsigned int)rq->rq_flags, rqf_name,
370 ARRAY_SIZE(rqf_name));
ec6dcf63 371 seq_printf(m, ", .state=%s", blk_mq_rq_state_name(blk_mq_rq_state(rq)));
2836ee4b 372 seq_printf(m, ", .tag=%d, .internal_tag=%d", rq->tag,
8658dca8 373 rq->internal_tag);
2836ee4b
BVA
374 if (mq_ops->show_rq)
375 mq_ops->show_rq(m, rq);
376 seq_puts(m, "}\n");
950cd7e9
OS
377 return 0;
378}
daaadb3e
OS
379EXPORT_SYMBOL_GPL(__blk_mq_debugfs_rq_show);
380
381int blk_mq_debugfs_rq_show(struct seq_file *m, void *v)
382{
383 return __blk_mq_debugfs_rq_show(m, list_entry_rq(v));
384}
16b738f6 385EXPORT_SYMBOL_GPL(blk_mq_debugfs_rq_show);
950cd7e9
OS
386
387static void *hctx_dispatch_start(struct seq_file *m, loff_t *pos)
f3bcb0e6 388 __acquires(&hctx->lock)
950cd7e9
OS
389{
390 struct blk_mq_hw_ctx *hctx = m->private;
391
392 spin_lock(&hctx->lock);
393 return seq_list_start(&hctx->dispatch, *pos);
394}
395
396static void *hctx_dispatch_next(struct seq_file *m, void *v, loff_t *pos)
397{
398 struct blk_mq_hw_ctx *hctx = m->private;
399
400 return seq_list_next(v, &hctx->dispatch, pos);
401}
402
403static void hctx_dispatch_stop(struct seq_file *m, void *v)
f3bcb0e6 404 __releases(&hctx->lock)
950cd7e9
OS
405{
406 struct blk_mq_hw_ctx *hctx = m->private;
407
408 spin_unlock(&hctx->lock);
409}
410
411static const struct seq_operations hctx_dispatch_seq_ops = {
412 .start = hctx_dispatch_start,
413 .next = hctx_dispatch_next,
414 .stop = hctx_dispatch_stop,
415 .show = blk_mq_debugfs_rq_show,
416};
417
2720bab5
BVA
418struct show_busy_params {
419 struct seq_file *m;
420 struct blk_mq_hw_ctx *hctx;
421};
422
423/*
424 * Note: the state of a request may change while this function is in progress,
7baa8572
JA
425 * e.g. due to a concurrent blk_mq_finish_request() call. Returns true to
426 * keep iterating requests.
2720bab5 427 */
7baa8572 428static bool hctx_show_busy_rq(struct request *rq, void *data, bool reserved)
2720bab5
BVA
429{
430 const struct show_busy_params *params = data;
431
ea4f995e 432 if (rq->mq_hctx == params->hctx)
2720bab5
BVA
433 __blk_mq_debugfs_rq_show(params->m,
434 list_entry_rq(&rq->queuelist));
7baa8572
JA
435
436 return true;
2720bab5
BVA
437}
438
439static int hctx_busy_show(void *data, struct seq_file *m)
440{
441 struct blk_mq_hw_ctx *hctx = data;
442 struct show_busy_params params = { .m = m, .hctx = hctx };
443
444 blk_mq_tagset_busy_iter(hctx->queue->tag_set, hctx_show_busy_rq,
445 &params);
446
447 return 0;
448}
449
f57de23a 450static int hctx_ctx_map_show(void *data, struct seq_file *m)
0bfa5288 451{
f57de23a 452 struct blk_mq_hw_ctx *hctx = data;
0bfa5288
OS
453
454 sbitmap_bitmap_show(&hctx->ctx_map, m);
455 return 0;
456}
457
d96b37c0
OS
458static void blk_mq_debugfs_tags_show(struct seq_file *m,
459 struct blk_mq_tags *tags)
460{
461 seq_printf(m, "nr_tags=%u\n", tags->nr_tags);
462 seq_printf(m, "nr_reserved_tags=%u\n", tags->nr_reserved_tags);
463 seq_printf(m, "active_queues=%d\n",
464 atomic_read(&tags->active_queues));
465
466 seq_puts(m, "\nbitmap_tags:\n");
467 sbitmap_queue_show(&tags->bitmap_tags, m);
468
469 if (tags->nr_reserved_tags) {
470 seq_puts(m, "\nbreserved_tags:\n");
471 sbitmap_queue_show(&tags->breserved_tags, m);
472 }
473}
474
f57de23a 475static int hctx_tags_show(void *data, struct seq_file *m)
d96b37c0 476{
f57de23a 477 struct blk_mq_hw_ctx *hctx = data;
d96b37c0 478 struct request_queue *q = hctx->queue;
8c0f14ea 479 int res;
d96b37c0 480
8c0f14ea
BVA
481 res = mutex_lock_interruptible(&q->sysfs_lock);
482 if (res)
483 goto out;
d96b37c0
OS
484 if (hctx->tags)
485 blk_mq_debugfs_tags_show(m, hctx->tags);
486 mutex_unlock(&q->sysfs_lock);
487
8c0f14ea
BVA
488out:
489 return res;
d96b37c0
OS
490}
491
f57de23a 492static int hctx_tags_bitmap_show(void *data, struct seq_file *m)
d7e3621a 493{
f57de23a 494 struct blk_mq_hw_ctx *hctx = data;
d7e3621a 495 struct request_queue *q = hctx->queue;
8c0f14ea 496 int res;
d7e3621a 497
8c0f14ea
BVA
498 res = mutex_lock_interruptible(&q->sysfs_lock);
499 if (res)
500 goto out;
d7e3621a
OS
501 if (hctx->tags)
502 sbitmap_bitmap_show(&hctx->tags->bitmap_tags.sb, m);
503 mutex_unlock(&q->sysfs_lock);
8c0f14ea
BVA
504
505out:
506 return res;
d7e3621a
OS
507}
508
f57de23a 509static int hctx_sched_tags_show(void *data, struct seq_file *m)
d96b37c0 510{
f57de23a 511 struct blk_mq_hw_ctx *hctx = data;
d96b37c0 512 struct request_queue *q = hctx->queue;
8c0f14ea 513 int res;
d96b37c0 514
8c0f14ea
BVA
515 res = mutex_lock_interruptible(&q->sysfs_lock);
516 if (res)
517 goto out;
d96b37c0
OS
518 if (hctx->sched_tags)
519 blk_mq_debugfs_tags_show(m, hctx->sched_tags);
520 mutex_unlock(&q->sysfs_lock);
521
8c0f14ea
BVA
522out:
523 return res;
d96b37c0
OS
524}
525
f57de23a 526static int hctx_sched_tags_bitmap_show(void *data, struct seq_file *m)
d7e3621a 527{
f57de23a 528 struct blk_mq_hw_ctx *hctx = data;
d7e3621a 529 struct request_queue *q = hctx->queue;
8c0f14ea 530 int res;
d7e3621a 531
8c0f14ea
BVA
532 res = mutex_lock_interruptible(&q->sysfs_lock);
533 if (res)
534 goto out;
d7e3621a
OS
535 if (hctx->sched_tags)
536 sbitmap_bitmap_show(&hctx->sched_tags->bitmap_tags.sb, m);
537 mutex_unlock(&q->sysfs_lock);
8c0f14ea
BVA
538
539out:
540 return res;
d7e3621a
OS
541}
542
f57de23a 543static int hctx_io_poll_show(void *data, struct seq_file *m)
be215473 544{
f57de23a 545 struct blk_mq_hw_ctx *hctx = data;
be215473
OS
546
547 seq_printf(m, "considered=%lu\n", hctx->poll_considered);
548 seq_printf(m, "invoked=%lu\n", hctx->poll_invoked);
549 seq_printf(m, "success=%lu\n", hctx->poll_success);
550 return 0;
551}
552
f57de23a 553static ssize_t hctx_io_poll_write(void *data, const char __user *buf,
be215473
OS
554 size_t count, loff_t *ppos)
555{
f57de23a 556 struct blk_mq_hw_ctx *hctx = data;
be215473
OS
557
558 hctx->poll_considered = hctx->poll_invoked = hctx->poll_success = 0;
559 return count;
560}
561
f57de23a 562static int hctx_dispatched_show(void *data, struct seq_file *m)
be215473 563{
f57de23a 564 struct blk_mq_hw_ctx *hctx = data;
be215473
OS
565 int i;
566
567 seq_printf(m, "%8u\t%lu\n", 0U, hctx->dispatched[0]);
568
569 for (i = 1; i < BLK_MQ_MAX_DISPATCH_ORDER - 1; i++) {
570 unsigned int d = 1U << (i - 1);
571
572 seq_printf(m, "%8u\t%lu\n", d, hctx->dispatched[i]);
573 }
574
575 seq_printf(m, "%8u+\t%lu\n", 1U << (i - 1), hctx->dispatched[i]);
576 return 0;
577}
578
f57de23a 579static ssize_t hctx_dispatched_write(void *data, const char __user *buf,
be215473
OS
580 size_t count, loff_t *ppos)
581{
f57de23a 582 struct blk_mq_hw_ctx *hctx = data;
be215473
OS
583 int i;
584
585 for (i = 0; i < BLK_MQ_MAX_DISPATCH_ORDER; i++)
586 hctx->dispatched[i] = 0;
587 return count;
588}
589
f57de23a 590static int hctx_queued_show(void *data, struct seq_file *m)
4a46f05e 591{
f57de23a 592 struct blk_mq_hw_ctx *hctx = data;
4a46f05e
OS
593
594 seq_printf(m, "%lu\n", hctx->queued);
595 return 0;
596}
597
f57de23a 598static ssize_t hctx_queued_write(void *data, const char __user *buf,
4a46f05e
OS
599 size_t count, loff_t *ppos)
600{
f57de23a 601 struct blk_mq_hw_ctx *hctx = data;
4a46f05e
OS
602
603 hctx->queued = 0;
604 return count;
605}
606
f57de23a 607static int hctx_run_show(void *data, struct seq_file *m)
4a46f05e 608{
f57de23a 609 struct blk_mq_hw_ctx *hctx = data;
4a46f05e
OS
610
611 seq_printf(m, "%lu\n", hctx->run);
612 return 0;
613}
614
f57de23a
OS
615static ssize_t hctx_run_write(void *data, const char __user *buf, size_t count,
616 loff_t *ppos)
4a46f05e 617{
f57de23a 618 struct blk_mq_hw_ctx *hctx = data;
4a46f05e
OS
619
620 hctx->run = 0;
621 return count;
622}
623
f57de23a 624static int hctx_active_show(void *data, struct seq_file *m)
4a46f05e 625{
f57de23a 626 struct blk_mq_hw_ctx *hctx = data;
4a46f05e
OS
627
628 seq_printf(m, "%d\n", atomic_read(&hctx->nr_active));
629 return 0;
630}
631
6e768717
ML
632static int hctx_dispatch_busy_show(void *data, struct seq_file *m)
633{
634 struct blk_mq_hw_ctx *hctx = data;
635
636 seq_printf(m, "%u\n", hctx->dispatch_busy);
637 return 0;
638}
639
950cd7e9 640static void *ctx_rq_list_start(struct seq_file *m, loff_t *pos)
f3bcb0e6 641 __acquires(&ctx->lock)
950cd7e9
OS
642{
643 struct blk_mq_ctx *ctx = m->private;
644
645 spin_lock(&ctx->lock);
646 return seq_list_start(&ctx->rq_list, *pos);
647}
648
649static void *ctx_rq_list_next(struct seq_file *m, void *v, loff_t *pos)
650{
651 struct blk_mq_ctx *ctx = m->private;
652
653 return seq_list_next(v, &ctx->rq_list, pos);
654}
655
656static void ctx_rq_list_stop(struct seq_file *m, void *v)
f3bcb0e6 657 __releases(&ctx->lock)
950cd7e9
OS
658{
659 struct blk_mq_ctx *ctx = m->private;
660
661 spin_unlock(&ctx->lock);
662}
663
664static const struct seq_operations ctx_rq_list_seq_ops = {
665 .start = ctx_rq_list_start,
666 .next = ctx_rq_list_next,
667 .stop = ctx_rq_list_stop,
668 .show = blk_mq_debugfs_rq_show,
669};
f57de23a 670static int ctx_dispatched_show(void *data, struct seq_file *m)
4a46f05e 671{
f57de23a 672 struct blk_mq_ctx *ctx = data;
4a46f05e
OS
673
674 seq_printf(m, "%lu %lu\n", ctx->rq_dispatched[1], ctx->rq_dispatched[0]);
675 return 0;
676}
677
f57de23a 678static ssize_t ctx_dispatched_write(void *data, const char __user *buf,
4a46f05e
OS
679 size_t count, loff_t *ppos)
680{
f57de23a 681 struct blk_mq_ctx *ctx = data;
4a46f05e
OS
682
683 ctx->rq_dispatched[0] = ctx->rq_dispatched[1] = 0;
684 return count;
685}
686
f57de23a 687static int ctx_merged_show(void *data, struct seq_file *m)
4a46f05e 688{
f57de23a 689 struct blk_mq_ctx *ctx = data;
4a46f05e
OS
690
691 seq_printf(m, "%lu\n", ctx->rq_merged);
692 return 0;
693}
694
f57de23a
OS
695static ssize_t ctx_merged_write(void *data, const char __user *buf,
696 size_t count, loff_t *ppos)
4a46f05e 697{
f57de23a 698 struct blk_mq_ctx *ctx = data;
4a46f05e
OS
699
700 ctx->rq_merged = 0;
701 return count;
702}
703
f57de23a 704static int ctx_completed_show(void *data, struct seq_file *m)
4a46f05e 705{
f57de23a 706 struct blk_mq_ctx *ctx = data;
4a46f05e
OS
707
708 seq_printf(m, "%lu %lu\n", ctx->rq_completed[1], ctx->rq_completed[0]);
709 return 0;
710}
711
f57de23a
OS
712static ssize_t ctx_completed_write(void *data, const char __user *buf,
713 size_t count, loff_t *ppos)
4a46f05e 714{
f57de23a
OS
715 struct blk_mq_ctx *ctx = data;
716
717 ctx->rq_completed[0] = ctx->rq_completed[1] = 0;
718 return count;
4a46f05e
OS
719}
720
f57de23a
OS
721static int blk_mq_debugfs_show(struct seq_file *m, void *v)
722{
723 const struct blk_mq_debugfs_attr *attr = m->private;
724 void *data = d_inode(m->file->f_path.dentry->d_parent)->i_private;
725
726 return attr->show(data, m);
727}
728
729static ssize_t blk_mq_debugfs_write(struct file *file, const char __user *buf,
730 size_t count, loff_t *ppos)
4a46f05e
OS
731{
732 struct seq_file *m = file->private_data;
f57de23a
OS
733 const struct blk_mq_debugfs_attr *attr = m->private;
734 void *data = d_inode(file->f_path.dentry->d_parent)->i_private;
4a46f05e 735
6b136a24
EG
736 /*
737 * Attributes that only implement .seq_ops are read-only and 'attr' is
738 * the same with 'data' in this case.
739 */
740 if (attr == data || !attr->write)
f57de23a
OS
741 return -EPERM;
742
743 return attr->write(data, buf, count, ppos);
744}
745
746static int blk_mq_debugfs_open(struct inode *inode, struct file *file)
747{
748 const struct blk_mq_debugfs_attr *attr = inode->i_private;
749 void *data = d_inode(file->f_path.dentry->d_parent)->i_private;
750 struct seq_file *m;
751 int ret;
752
753 if (attr->seq_ops) {
754 ret = seq_open(file, attr->seq_ops);
755 if (!ret) {
756 m = file->private_data;
757 m->private = data;
758 }
759 return ret;
760 }
761
762 if (WARN_ON_ONCE(!attr->show))
763 return -EPERM;
764
765 return single_open(file, blk_mq_debugfs_show, inode->i_private);
4a46f05e
OS
766}
767
f57de23a
OS
768static int blk_mq_debugfs_release(struct inode *inode, struct file *file)
769{
770 const struct blk_mq_debugfs_attr *attr = inode->i_private;
771
772 if (attr->show)
773 return single_release(inode, file);
774 else
775 return seq_release(inode, file);
776}
777
f8465933 778static const struct file_operations blk_mq_debugfs_fops = {
f57de23a 779 .open = blk_mq_debugfs_open,
4a46f05e 780 .read = seq_read,
f57de23a 781 .write = blk_mq_debugfs_write,
4a46f05e 782 .llseek = seq_lseek,
f57de23a 783 .release = blk_mq_debugfs_release,
4a46f05e
OS
784};
785
07e4fead 786static const struct blk_mq_debugfs_attr blk_mq_debugfs_hctx_attrs[] = {
f57de23a
OS
787 {"state", 0400, hctx_state_show},
788 {"flags", 0400, hctx_flags_show},
789 {"dispatch", 0400, .seq_ops = &hctx_dispatch_seq_ops},
2720bab5 790 {"busy", 0400, hctx_busy_show},
f57de23a
OS
791 {"ctx_map", 0400, hctx_ctx_map_show},
792 {"tags", 0400, hctx_tags_show},
793 {"tags_bitmap", 0400, hctx_tags_bitmap_show},
794 {"sched_tags", 0400, hctx_sched_tags_show},
795 {"sched_tags_bitmap", 0400, hctx_sched_tags_bitmap_show},
796 {"io_poll", 0600, hctx_io_poll_show, hctx_io_poll_write},
797 {"dispatched", 0600, hctx_dispatched_show, hctx_dispatched_write},
798 {"queued", 0600, hctx_queued_show, hctx_queued_write},
799 {"run", 0600, hctx_run_show, hctx_run_write},
800 {"active", 0400, hctx_active_show},
6e768717 801 {"dispatch_busy", 0400, hctx_dispatch_busy_show},
72f2f8f6 802 {},
07e4fead
OS
803};
804
805static const struct blk_mq_debugfs_attr blk_mq_debugfs_ctx_attrs[] = {
f57de23a
OS
806 {"rq_list", 0400, .seq_ops = &ctx_rq_list_seq_ops},
807 {"dispatched", 0600, ctx_dispatched_show, ctx_dispatched_write},
808 {"merged", 0600, ctx_merged_show, ctx_merged_write},
809 {"completed", 0600, ctx_completed_show, ctx_completed_write},
72f2f8f6 810 {},
07e4fead
OS
811};
812
9c1051aa
OS
813static bool debugfs_create_files(struct dentry *parent, void *data,
814 const struct blk_mq_debugfs_attr *attr)
815{
816 d_inode(parent)->i_private = data;
817
818 for (; attr->name; attr++) {
819 if (!debugfs_create_file(attr->name, attr->mode, parent,
820 (void *)attr, &blk_mq_debugfs_fops))
821 return false;
822 }
823 return true;
824}
825
4c9e4019 826int blk_mq_debugfs_register(struct request_queue *q)
07e4fead 827{
9c1051aa
OS
828 struct blk_mq_hw_ctx *hctx;
829 int i;
830
18fbda91 831 if (!blk_debugfs_root)
07e4fead
OS
832 return -ENOENT;
833
4c9e4019
BVA
834 q->debugfs_dir = debugfs_create_dir(kobject_name(q->kobj.parent),
835 blk_debugfs_root);
07e4fead 836 if (!q->debugfs_dir)
9c1051aa 837 return -ENOMEM;
07e4fead 838
9c1051aa
OS
839 if (!debugfs_create_files(q->debugfs_dir, q,
840 blk_mq_debugfs_queue_attrs))
07e4fead
OS
841 goto err;
842
9c1051aa 843 /*
70e62f4b 844 * blk_mq_init_sched() attempted to do this already, but q->debugfs_dir
9c1051aa
OS
845 * didn't exist yet (because we don't know what to name the directory
846 * until the queue is registered to a gendisk).
847 */
70e62f4b
OS
848 if (q->elevator && !q->sched_debugfs_dir)
849 blk_mq_debugfs_register_sched(q);
850
851 /* Similarly, blk_mq_init_hctx() couldn't do this previously. */
9c1051aa
OS
852 queue_for_each_hw_ctx(q, hctx, i) {
853 if (!hctx->debugfs_dir && blk_mq_debugfs_register_hctx(q, hctx))
854 goto err;
d332ce09
OS
855 if (q->elevator && !hctx->sched_debugfs_dir &&
856 blk_mq_debugfs_register_sched_hctx(q, hctx))
857 goto err;
9c1051aa
OS
858 }
859
cc56694f
ML
860 if (q->rq_qos) {
861 struct rq_qos *rqos = q->rq_qos;
862
863 while (rqos) {
864 blk_mq_debugfs_register_rqos(rqos);
865 rqos = rqos->next;
866 }
867 }
868
07e4fead
OS
869 return 0;
870
871err:
872 blk_mq_debugfs_unregister(q);
873 return -ENOMEM;
874}
875
876void blk_mq_debugfs_unregister(struct request_queue *q)
877{
878 debugfs_remove_recursive(q->debugfs_dir);
d332ce09 879 q->sched_debugfs_dir = NULL;
07e4fead
OS
880 q->debugfs_dir = NULL;
881}
882
9c1051aa
OS
883static int blk_mq_debugfs_register_ctx(struct blk_mq_hw_ctx *hctx,
884 struct blk_mq_ctx *ctx)
07e4fead
OS
885{
886 struct dentry *ctx_dir;
887 char name[20];
07e4fead
OS
888
889 snprintf(name, sizeof(name), "cpu%u", ctx->cpu);
9c1051aa 890 ctx_dir = debugfs_create_dir(name, hctx->debugfs_dir);
07e4fead
OS
891 if (!ctx_dir)
892 return -ENOMEM;
893
72f2f8f6
BVA
894 if (!debugfs_create_files(ctx_dir, ctx, blk_mq_debugfs_ctx_attrs))
895 return -ENOMEM;
07e4fead
OS
896
897 return 0;
898}
899
9c1051aa
OS
900int blk_mq_debugfs_register_hctx(struct request_queue *q,
901 struct blk_mq_hw_ctx *hctx)
07e4fead
OS
902{
903 struct blk_mq_ctx *ctx;
07e4fead
OS
904 char name[20];
905 int i;
906
9c1051aa
OS
907 if (!q->debugfs_dir)
908 return -ENOENT;
909
88aabbd7 910 snprintf(name, sizeof(name), "hctx%u", hctx->queue_num);
9c1051aa
OS
911 hctx->debugfs_dir = debugfs_create_dir(name, q->debugfs_dir);
912 if (!hctx->debugfs_dir)
07e4fead
OS
913 return -ENOMEM;
914
9c1051aa
OS
915 if (!debugfs_create_files(hctx->debugfs_dir, hctx,
916 blk_mq_debugfs_hctx_attrs))
917 goto err;
07e4fead
OS
918
919 hctx_for_each_ctx(hctx, ctx, i) {
9c1051aa
OS
920 if (blk_mq_debugfs_register_ctx(hctx, ctx))
921 goto err;
07e4fead
OS
922 }
923
924 return 0;
9c1051aa
OS
925
926err:
927 blk_mq_debugfs_unregister_hctx(hctx);
928 return -ENOMEM;
929}
930
931void blk_mq_debugfs_unregister_hctx(struct blk_mq_hw_ctx *hctx)
932{
933 debugfs_remove_recursive(hctx->debugfs_dir);
d332ce09 934 hctx->sched_debugfs_dir = NULL;
9c1051aa 935 hctx->debugfs_dir = NULL;
07e4fead
OS
936}
937
9c1051aa 938int blk_mq_debugfs_register_hctxs(struct request_queue *q)
07e4fead
OS
939{
940 struct blk_mq_hw_ctx *hctx;
941 int i;
942
07e4fead
OS
943 queue_for_each_hw_ctx(q, hctx, i) {
944 if (blk_mq_debugfs_register_hctx(q, hctx))
9c1051aa 945 return -ENOMEM;
07e4fead
OS
946 }
947
948 return 0;
07e4fead
OS
949}
950
9c1051aa 951void blk_mq_debugfs_unregister_hctxs(struct request_queue *q)
07e4fead 952{
9c1051aa
OS
953 struct blk_mq_hw_ctx *hctx;
954 int i;
955
956 queue_for_each_hw_ctx(q, hctx, i)
957 blk_mq_debugfs_unregister_hctx(hctx);
07e4fead 958}
d332ce09
OS
959
960int blk_mq_debugfs_register_sched(struct request_queue *q)
961{
962 struct elevator_type *e = q->elevator->type;
963
964 if (!q->debugfs_dir)
965 return -ENOENT;
966
967 if (!e->queue_debugfs_attrs)
968 return 0;
969
970 q->sched_debugfs_dir = debugfs_create_dir("sched", q->debugfs_dir);
971 if (!q->sched_debugfs_dir)
972 return -ENOMEM;
973
974 if (!debugfs_create_files(q->sched_debugfs_dir, q,
975 e->queue_debugfs_attrs))
976 goto err;
977
978 return 0;
979
980err:
981 blk_mq_debugfs_unregister_sched(q);
982 return -ENOMEM;
983}
984
985void blk_mq_debugfs_unregister_sched(struct request_queue *q)
986{
987 debugfs_remove_recursive(q->sched_debugfs_dir);
988 q->sched_debugfs_dir = NULL;
989}
990
cc56694f
ML
991void blk_mq_debugfs_unregister_rqos(struct rq_qos *rqos)
992{
993 debugfs_remove_recursive(rqos->debugfs_dir);
994 rqos->debugfs_dir = NULL;
995}
996
997int blk_mq_debugfs_register_rqos(struct rq_qos *rqos)
998{
999 struct request_queue *q = rqos->q;
1000 const char *dir_name = rq_qos_id_to_name(rqos->id);
1001
1002 if (!q->debugfs_dir)
1003 return -ENOENT;
1004
1005 if (rqos->debugfs_dir || !rqos->ops->debugfs_attrs)
1006 return 0;
1007
1008 if (!q->rqos_debugfs_dir) {
1009 q->rqos_debugfs_dir = debugfs_create_dir("rqos",
1010 q->debugfs_dir);
1011 if (!q->rqos_debugfs_dir)
1012 return -ENOMEM;
1013 }
1014
1015 rqos->debugfs_dir = debugfs_create_dir(dir_name,
1016 rqos->q->rqos_debugfs_dir);
1017 if (!rqos->debugfs_dir)
1018 return -ENOMEM;
1019
1020 if (!debugfs_create_files(rqos->debugfs_dir, rqos,
1021 rqos->ops->debugfs_attrs))
1022 goto err;
1023 return 0;
1024 err:
1025 blk_mq_debugfs_unregister_rqos(rqos);
1026 return -ENOMEM;
1027}
1028
1029void blk_mq_debugfs_unregister_queue_rqos(struct request_queue *q)
1030{
1031 debugfs_remove_recursive(q->rqos_debugfs_dir);
1032 q->rqos_debugfs_dir = NULL;
1033}
1034
d332ce09
OS
1035int blk_mq_debugfs_register_sched_hctx(struct request_queue *q,
1036 struct blk_mq_hw_ctx *hctx)
1037{
1038 struct elevator_type *e = q->elevator->type;
1039
1040 if (!hctx->debugfs_dir)
1041 return -ENOENT;
1042
1043 if (!e->hctx_debugfs_attrs)
1044 return 0;
1045
1046 hctx->sched_debugfs_dir = debugfs_create_dir("sched",
1047 hctx->debugfs_dir);
1048 if (!hctx->sched_debugfs_dir)
1049 return -ENOMEM;
1050
1051 if (!debugfs_create_files(hctx->sched_debugfs_dir, hctx,
1052 e->hctx_debugfs_attrs))
1053 return -ENOMEM;
1054
1055 return 0;
1056}
1057
1058void blk_mq_debugfs_unregister_sched_hctx(struct blk_mq_hw_ctx *hctx)
1059{
1060 debugfs_remove_recursive(hctx->sched_debugfs_dir);
1061 hctx->sched_debugfs_dir = NULL;
1062}