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