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