2 * Copyright (C) 2017 Facebook
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.
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.
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/>.
17 #include <linux/kernel.h>
18 #include <linux/blkdev.h>
19 #include <linux/debugfs.h>
21 #include <linux/blk-mq.h>
24 #include "blk-mq-debugfs.h"
25 #include "blk-mq-tag.h"
27 static int blk_flags_show(struct seq_file *m, const unsigned long flags,
28 const char *const *flag_name, int flag_name_count)
33 for (i = 0; i < sizeof(flags) * BITS_PER_BYTE; i++) {
34 if (!(flags & BIT(i)))
39 if (i < flag_name_count && flag_name[i])
40 seq_puts(m, flag_name[i]);
42 seq_printf(m, "%d", i);
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(SYNCFULL),
52 QUEUE_FLAG_NAME(ASYNCFULL),
53 QUEUE_FLAG_NAME(DYING),
54 QUEUE_FLAG_NAME(BYPASS),
55 QUEUE_FLAG_NAME(BIDI),
56 QUEUE_FLAG_NAME(NOMERGES),
57 QUEUE_FLAG_NAME(SAME_COMP),
58 QUEUE_FLAG_NAME(FAIL_IO),
59 QUEUE_FLAG_NAME(STACKABLE),
60 QUEUE_FLAG_NAME(NONROT),
61 QUEUE_FLAG_NAME(IO_STAT),
62 QUEUE_FLAG_NAME(DISCARD),
63 QUEUE_FLAG_NAME(NOXMERGES),
64 QUEUE_FLAG_NAME(ADD_RANDOM),
65 QUEUE_FLAG_NAME(SECERASE),
66 QUEUE_FLAG_NAME(SAME_FORCE),
67 QUEUE_FLAG_NAME(DEAD),
68 QUEUE_FLAG_NAME(INIT_DONE),
69 QUEUE_FLAG_NAME(NO_SG_MERGE),
70 QUEUE_FLAG_NAME(POLL),
73 QUEUE_FLAG_NAME(FLUSH_NQ),
75 QUEUE_FLAG_NAME(STATS),
76 QUEUE_FLAG_NAME(POLL_STATS),
77 QUEUE_FLAG_NAME(REGISTERED),
79 #undef QUEUE_FLAG_NAME
81 static int queue_state_show(void *data, struct seq_file *m)
83 struct request_queue *q = data;
85 blk_flags_show(m, q->queue_flags, blk_queue_flag_name,
86 ARRAY_SIZE(blk_queue_flag_name));
91 static ssize_t queue_state_write(void *data, const char __user *buf,
92 size_t count, loff_t *ppos)
94 struct request_queue *q = data;
95 char opbuf[16] = { }, *op;
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.
102 if (blk_queue_dead(q))
105 if (count >= sizeof(opbuf)) {
106 pr_err("%s: operation too long\n", __func__);
110 if (copy_from_user(opbuf, buf, count))
112 op = strstrip(opbuf);
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);
117 } else if (strcmp(op, "kick") == 0) {
118 blk_mq_kick_requeue_list(q);
120 pr_err("%s: unsupported operation '%s'\n", __func__, op);
122 pr_err("%s: use 'run', 'start' or 'kick'\n", __func__);
128 static void print_stat(struct seq_file *m, struct blk_rq_stat *stat)
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);
134 seq_puts(m, "samples=0");
138 static int queue_poll_stat_show(void *data, struct seq_file *m)
140 struct request_queue *q = data;
143 for (bucket = 0; bucket < BLK_MQ_POLL_STATS_BKTS/2; bucket++) {
144 seq_printf(m, "read (%d Bytes): ", 1 << (9+bucket));
145 print_stat(m, &q->poll_stat[2*bucket]);
148 seq_printf(m, "write (%d Bytes): ", 1 << (9+bucket));
149 print_stat(m, &q->poll_stat[2*bucket+1]);
155 #define HCTX_STATE_NAME(name) [BLK_MQ_S_##name] = #name
156 static const char *const hctx_state_name[] = {
157 HCTX_STATE_NAME(STOPPED),
158 HCTX_STATE_NAME(TAG_ACTIVE),
159 HCTX_STATE_NAME(SCHED_RESTART),
160 HCTX_STATE_NAME(TAG_WAITING),
161 HCTX_STATE_NAME(START_ON_RUN),
163 #undef HCTX_STATE_NAME
165 static int hctx_state_show(void *data, struct seq_file *m)
167 struct blk_mq_hw_ctx *hctx = data;
169 blk_flags_show(m, hctx->state, hctx_state_name,
170 ARRAY_SIZE(hctx_state_name));
175 #define BLK_TAG_ALLOC_NAME(name) [BLK_TAG_ALLOC_##name] = #name
176 static const char *const alloc_policy_name[] = {
177 BLK_TAG_ALLOC_NAME(FIFO),
178 BLK_TAG_ALLOC_NAME(RR),
180 #undef BLK_TAG_ALLOC_NAME
182 #define HCTX_FLAG_NAME(name) [ilog2(BLK_MQ_F_##name)] = #name
183 static const char *const hctx_flag_name[] = {
184 HCTX_FLAG_NAME(SHOULD_MERGE),
185 HCTX_FLAG_NAME(TAG_SHARED),
186 HCTX_FLAG_NAME(SG_MERGE),
187 HCTX_FLAG_NAME(BLOCKING),
188 HCTX_FLAG_NAME(NO_SCHED),
190 #undef HCTX_FLAG_NAME
192 static int hctx_flags_show(void *data, struct seq_file *m)
194 struct blk_mq_hw_ctx *hctx = data;
195 const int alloc_policy = BLK_MQ_FLAG_TO_ALLOC_POLICY(hctx->flags);
197 seq_puts(m, "alloc_policy=");
198 if (alloc_policy < ARRAY_SIZE(alloc_policy_name) &&
199 alloc_policy_name[alloc_policy])
200 seq_puts(m, alloc_policy_name[alloc_policy]);
202 seq_printf(m, "%d", alloc_policy);
205 hctx->flags ^ BLK_ALLOC_POLICY_TO_MQ_FLAG(alloc_policy),
206 hctx_flag_name, ARRAY_SIZE(hctx_flag_name));
211 #define REQ_OP_NAME(name) [REQ_OP_##name] = #name
212 static const char *const op_name[] = {
216 REQ_OP_NAME(DISCARD),
217 REQ_OP_NAME(ZONE_REPORT),
218 REQ_OP_NAME(SECURE_ERASE),
219 REQ_OP_NAME(ZONE_RESET),
220 REQ_OP_NAME(WRITE_SAME),
221 REQ_OP_NAME(WRITE_ZEROES),
222 REQ_OP_NAME(SCSI_IN),
223 REQ_OP_NAME(SCSI_OUT),
225 REQ_OP_NAME(DRV_OUT),
229 #define CMD_FLAG_NAME(name) [__REQ_##name] = #name
230 static const char *const cmd_flag_name[] = {
231 CMD_FLAG_NAME(FAILFAST_DEV),
232 CMD_FLAG_NAME(FAILFAST_TRANSPORT),
233 CMD_FLAG_NAME(FAILFAST_DRIVER),
237 CMD_FLAG_NAME(NOMERGE),
239 CMD_FLAG_NAME(INTEGRITY),
241 CMD_FLAG_NAME(PREFLUSH),
242 CMD_FLAG_NAME(RAHEAD),
243 CMD_FLAG_NAME(BACKGROUND),
244 CMD_FLAG_NAME(NOUNMAP),
248 #define RQF_NAME(name) [ilog2((__force u32)RQF_##name)] = #name
249 static const char *const rqf_name[] = {
253 RQF_NAME(SOFTBARRIER),
255 RQF_NAME(MIXED_MERGE),
256 RQF_NAME(MQ_INFLIGHT),
268 RQF_NAME(SPECIAL_PAYLOAD),
272 #define RQAF_NAME(name) [REQ_ATOM_##name] = #name
273 static const char *const rqaf_name[] = {
276 RQAF_NAME(POLL_SLEPT),
280 int __blk_mq_debugfs_rq_show(struct seq_file *m, struct request *rq)
282 const struct blk_mq_ops *const mq_ops = rq->q->mq_ops;
283 const unsigned int op = rq->cmd_flags & REQ_OP_MASK;
285 seq_printf(m, "%p {.op=", rq);
286 if (op < ARRAY_SIZE(op_name) && op_name[op])
287 seq_printf(m, "%s", op_name[op]);
289 seq_printf(m, "%d", op);
290 seq_puts(m, ", .cmd_flags=");
291 blk_flags_show(m, rq->cmd_flags & ~REQ_OP_MASK, cmd_flag_name,
292 ARRAY_SIZE(cmd_flag_name));
293 seq_puts(m, ", .rq_flags=");
294 blk_flags_show(m, (__force unsigned int)rq->rq_flags, rqf_name,
295 ARRAY_SIZE(rqf_name));
296 seq_puts(m, ", .atomic_flags=");
297 blk_flags_show(m, rq->atomic_flags, rqaf_name, ARRAY_SIZE(rqaf_name));
298 seq_printf(m, ", .tag=%d, .internal_tag=%d", rq->tag,
301 mq_ops->show_rq(m, rq);
305 EXPORT_SYMBOL_GPL(__blk_mq_debugfs_rq_show);
307 int blk_mq_debugfs_rq_show(struct seq_file *m, void *v)
309 return __blk_mq_debugfs_rq_show(m, list_entry_rq(v));
311 EXPORT_SYMBOL_GPL(blk_mq_debugfs_rq_show);
313 static void *queue_requeue_list_start(struct seq_file *m, loff_t *pos)
314 __acquires(&q->requeue_lock)
316 struct request_queue *q = m->private;
318 spin_lock_irq(&q->requeue_lock);
319 return seq_list_start(&q->requeue_list, *pos);
322 static void *queue_requeue_list_next(struct seq_file *m, void *v, loff_t *pos)
324 struct request_queue *q = m->private;
326 return seq_list_next(v, &q->requeue_list, pos);
329 static void queue_requeue_list_stop(struct seq_file *m, void *v)
330 __releases(&q->requeue_lock)
332 struct request_queue *q = m->private;
334 spin_unlock_irq(&q->requeue_lock);
337 static const struct seq_operations queue_requeue_list_seq_ops = {
338 .start = queue_requeue_list_start,
339 .next = queue_requeue_list_next,
340 .stop = queue_requeue_list_stop,
341 .show = blk_mq_debugfs_rq_show,
344 static void *hctx_dispatch_start(struct seq_file *m, loff_t *pos)
345 __acquires(&hctx->lock)
347 struct blk_mq_hw_ctx *hctx = m->private;
349 spin_lock(&hctx->lock);
350 return seq_list_start(&hctx->dispatch, *pos);
353 static void *hctx_dispatch_next(struct seq_file *m, void *v, loff_t *pos)
355 struct blk_mq_hw_ctx *hctx = m->private;
357 return seq_list_next(v, &hctx->dispatch, pos);
360 static void hctx_dispatch_stop(struct seq_file *m, void *v)
361 __releases(&hctx->lock)
363 struct blk_mq_hw_ctx *hctx = m->private;
365 spin_unlock(&hctx->lock);
368 static const struct seq_operations hctx_dispatch_seq_ops = {
369 .start = hctx_dispatch_start,
370 .next = hctx_dispatch_next,
371 .stop = hctx_dispatch_stop,
372 .show = blk_mq_debugfs_rq_show,
375 struct show_busy_params {
377 struct blk_mq_hw_ctx *hctx;
381 * Note: the state of a request may change while this function is in progress,
382 * e.g. due to a concurrent blk_mq_finish_request() call.
384 static void hctx_show_busy_rq(struct request *rq, void *data, bool reserved)
386 const struct show_busy_params *params = data;
388 if (blk_mq_map_queue(rq->q, rq->mq_ctx->cpu) == params->hctx &&
389 test_bit(REQ_ATOM_STARTED, &rq->atomic_flags))
390 __blk_mq_debugfs_rq_show(params->m,
391 list_entry_rq(&rq->queuelist));
394 static int hctx_busy_show(void *data, struct seq_file *m)
396 struct blk_mq_hw_ctx *hctx = data;
397 struct show_busy_params params = { .m = m, .hctx = hctx };
399 blk_mq_tagset_busy_iter(hctx->queue->tag_set, hctx_show_busy_rq,
405 static int hctx_ctx_map_show(void *data, struct seq_file *m)
407 struct blk_mq_hw_ctx *hctx = data;
409 sbitmap_bitmap_show(&hctx->ctx_map, m);
413 static void blk_mq_debugfs_tags_show(struct seq_file *m,
414 struct blk_mq_tags *tags)
416 seq_printf(m, "nr_tags=%u\n", tags->nr_tags);
417 seq_printf(m, "nr_reserved_tags=%u\n", tags->nr_reserved_tags);
418 seq_printf(m, "active_queues=%d\n",
419 atomic_read(&tags->active_queues));
421 seq_puts(m, "\nbitmap_tags:\n");
422 sbitmap_queue_show(&tags->bitmap_tags, m);
424 if (tags->nr_reserved_tags) {
425 seq_puts(m, "\nbreserved_tags:\n");
426 sbitmap_queue_show(&tags->breserved_tags, m);
430 static int hctx_tags_show(void *data, struct seq_file *m)
432 struct blk_mq_hw_ctx *hctx = data;
433 struct request_queue *q = hctx->queue;
436 res = mutex_lock_interruptible(&q->sysfs_lock);
440 blk_mq_debugfs_tags_show(m, hctx->tags);
441 mutex_unlock(&q->sysfs_lock);
447 static int hctx_tags_bitmap_show(void *data, struct seq_file *m)
449 struct blk_mq_hw_ctx *hctx = data;
450 struct request_queue *q = hctx->queue;
453 res = mutex_lock_interruptible(&q->sysfs_lock);
457 sbitmap_bitmap_show(&hctx->tags->bitmap_tags.sb, m);
458 mutex_unlock(&q->sysfs_lock);
464 static int hctx_sched_tags_show(void *data, struct seq_file *m)
466 struct blk_mq_hw_ctx *hctx = data;
467 struct request_queue *q = hctx->queue;
470 res = mutex_lock_interruptible(&q->sysfs_lock);
473 if (hctx->sched_tags)
474 blk_mq_debugfs_tags_show(m, hctx->sched_tags);
475 mutex_unlock(&q->sysfs_lock);
481 static int hctx_sched_tags_bitmap_show(void *data, struct seq_file *m)
483 struct blk_mq_hw_ctx *hctx = data;
484 struct request_queue *q = hctx->queue;
487 res = mutex_lock_interruptible(&q->sysfs_lock);
490 if (hctx->sched_tags)
491 sbitmap_bitmap_show(&hctx->sched_tags->bitmap_tags.sb, m);
492 mutex_unlock(&q->sysfs_lock);
498 static int hctx_io_poll_show(void *data, struct seq_file *m)
500 struct blk_mq_hw_ctx *hctx = data;
502 seq_printf(m, "considered=%lu\n", hctx->poll_considered);
503 seq_printf(m, "invoked=%lu\n", hctx->poll_invoked);
504 seq_printf(m, "success=%lu\n", hctx->poll_success);
508 static ssize_t hctx_io_poll_write(void *data, const char __user *buf,
509 size_t count, loff_t *ppos)
511 struct blk_mq_hw_ctx *hctx = data;
513 hctx->poll_considered = hctx->poll_invoked = hctx->poll_success = 0;
517 static int hctx_dispatched_show(void *data, struct seq_file *m)
519 struct blk_mq_hw_ctx *hctx = data;
522 seq_printf(m, "%8u\t%lu\n", 0U, hctx->dispatched[0]);
524 for (i = 1; i < BLK_MQ_MAX_DISPATCH_ORDER - 1; i++) {
525 unsigned int d = 1U << (i - 1);
527 seq_printf(m, "%8u\t%lu\n", d, hctx->dispatched[i]);
530 seq_printf(m, "%8u+\t%lu\n", 1U << (i - 1), hctx->dispatched[i]);
534 static ssize_t hctx_dispatched_write(void *data, const char __user *buf,
535 size_t count, loff_t *ppos)
537 struct blk_mq_hw_ctx *hctx = data;
540 for (i = 0; i < BLK_MQ_MAX_DISPATCH_ORDER; i++)
541 hctx->dispatched[i] = 0;
545 static int hctx_queued_show(void *data, struct seq_file *m)
547 struct blk_mq_hw_ctx *hctx = data;
549 seq_printf(m, "%lu\n", hctx->queued);
553 static ssize_t hctx_queued_write(void *data, const char __user *buf,
554 size_t count, loff_t *ppos)
556 struct blk_mq_hw_ctx *hctx = data;
562 static int hctx_run_show(void *data, struct seq_file *m)
564 struct blk_mq_hw_ctx *hctx = data;
566 seq_printf(m, "%lu\n", hctx->run);
570 static ssize_t hctx_run_write(void *data, const char __user *buf, size_t count,
573 struct blk_mq_hw_ctx *hctx = data;
579 static int hctx_active_show(void *data, struct seq_file *m)
581 struct blk_mq_hw_ctx *hctx = data;
583 seq_printf(m, "%d\n", atomic_read(&hctx->nr_active));
587 static void *ctx_rq_list_start(struct seq_file *m, loff_t *pos)
588 __acquires(&ctx->lock)
590 struct blk_mq_ctx *ctx = m->private;
592 spin_lock(&ctx->lock);
593 return seq_list_start(&ctx->rq_list, *pos);
596 static void *ctx_rq_list_next(struct seq_file *m, void *v, loff_t *pos)
598 struct blk_mq_ctx *ctx = m->private;
600 return seq_list_next(v, &ctx->rq_list, pos);
603 static void ctx_rq_list_stop(struct seq_file *m, void *v)
604 __releases(&ctx->lock)
606 struct blk_mq_ctx *ctx = m->private;
608 spin_unlock(&ctx->lock);
611 static const struct seq_operations ctx_rq_list_seq_ops = {
612 .start = ctx_rq_list_start,
613 .next = ctx_rq_list_next,
614 .stop = ctx_rq_list_stop,
615 .show = blk_mq_debugfs_rq_show,
617 static int ctx_dispatched_show(void *data, struct seq_file *m)
619 struct blk_mq_ctx *ctx = data;
621 seq_printf(m, "%lu %lu\n", ctx->rq_dispatched[1], ctx->rq_dispatched[0]);
625 static ssize_t ctx_dispatched_write(void *data, const char __user *buf,
626 size_t count, loff_t *ppos)
628 struct blk_mq_ctx *ctx = data;
630 ctx->rq_dispatched[0] = ctx->rq_dispatched[1] = 0;
634 static int ctx_merged_show(void *data, struct seq_file *m)
636 struct blk_mq_ctx *ctx = data;
638 seq_printf(m, "%lu\n", ctx->rq_merged);
642 static ssize_t ctx_merged_write(void *data, const char __user *buf,
643 size_t count, loff_t *ppos)
645 struct blk_mq_ctx *ctx = data;
651 static int ctx_completed_show(void *data, struct seq_file *m)
653 struct blk_mq_ctx *ctx = data;
655 seq_printf(m, "%lu %lu\n", ctx->rq_completed[1], ctx->rq_completed[0]);
659 static ssize_t ctx_completed_write(void *data, const char __user *buf,
660 size_t count, loff_t *ppos)
662 struct blk_mq_ctx *ctx = data;
664 ctx->rq_completed[0] = ctx->rq_completed[1] = 0;
668 static int blk_mq_debugfs_show(struct seq_file *m, void *v)
670 const struct blk_mq_debugfs_attr *attr = m->private;
671 void *data = d_inode(m->file->f_path.dentry->d_parent)->i_private;
673 return attr->show(data, m);
676 static ssize_t blk_mq_debugfs_write(struct file *file, const char __user *buf,
677 size_t count, loff_t *ppos)
679 struct seq_file *m = file->private_data;
680 const struct blk_mq_debugfs_attr *attr = m->private;
681 void *data = d_inode(file->f_path.dentry->d_parent)->i_private;
686 return attr->write(data, buf, count, ppos);
689 static int blk_mq_debugfs_open(struct inode *inode, struct file *file)
691 const struct blk_mq_debugfs_attr *attr = inode->i_private;
692 void *data = d_inode(file->f_path.dentry->d_parent)->i_private;
697 ret = seq_open(file, attr->seq_ops);
699 m = file->private_data;
705 if (WARN_ON_ONCE(!attr->show))
708 return single_open(file, blk_mq_debugfs_show, inode->i_private);
711 static int blk_mq_debugfs_release(struct inode *inode, struct file *file)
713 const struct blk_mq_debugfs_attr *attr = inode->i_private;
716 return single_release(inode, file);
718 return seq_release(inode, file);
721 const struct file_operations blk_mq_debugfs_fops = {
722 .open = blk_mq_debugfs_open,
724 .write = blk_mq_debugfs_write,
726 .release = blk_mq_debugfs_release,
729 static const struct blk_mq_debugfs_attr blk_mq_debugfs_queue_attrs[] = {
730 {"poll_stat", 0400, queue_poll_stat_show},
731 {"requeue_list", 0400, .seq_ops = &queue_requeue_list_seq_ops},
732 {"state", 0600, queue_state_show, queue_state_write},
736 static const struct blk_mq_debugfs_attr blk_mq_debugfs_hctx_attrs[] = {
737 {"state", 0400, hctx_state_show},
738 {"flags", 0400, hctx_flags_show},
739 {"dispatch", 0400, .seq_ops = &hctx_dispatch_seq_ops},
740 {"busy", 0400, hctx_busy_show},
741 {"ctx_map", 0400, hctx_ctx_map_show},
742 {"tags", 0400, hctx_tags_show},
743 {"tags_bitmap", 0400, hctx_tags_bitmap_show},
744 {"sched_tags", 0400, hctx_sched_tags_show},
745 {"sched_tags_bitmap", 0400, hctx_sched_tags_bitmap_show},
746 {"io_poll", 0600, hctx_io_poll_show, hctx_io_poll_write},
747 {"dispatched", 0600, hctx_dispatched_show, hctx_dispatched_write},
748 {"queued", 0600, hctx_queued_show, hctx_queued_write},
749 {"run", 0600, hctx_run_show, hctx_run_write},
750 {"active", 0400, hctx_active_show},
754 static const struct blk_mq_debugfs_attr blk_mq_debugfs_ctx_attrs[] = {
755 {"rq_list", 0400, .seq_ops = &ctx_rq_list_seq_ops},
756 {"dispatched", 0600, ctx_dispatched_show, ctx_dispatched_write},
757 {"merged", 0600, ctx_merged_show, ctx_merged_write},
758 {"completed", 0600, ctx_completed_show, ctx_completed_write},
762 static bool debugfs_create_files(struct dentry *parent, void *data,
763 const struct blk_mq_debugfs_attr *attr)
765 d_inode(parent)->i_private = data;
767 for (; attr->name; attr++) {
768 if (!debugfs_create_file(attr->name, attr->mode, parent,
769 (void *)attr, &blk_mq_debugfs_fops))
775 int blk_mq_debugfs_register(struct request_queue *q)
777 struct blk_mq_hw_ctx *hctx;
780 if (!blk_debugfs_root)
783 q->debugfs_dir = debugfs_create_dir(kobject_name(q->kobj.parent),
788 if (!debugfs_create_files(q->debugfs_dir, q,
789 blk_mq_debugfs_queue_attrs))
793 * blk_mq_init_hctx() attempted to do this already, but q->debugfs_dir
794 * didn't exist yet (because we don't know what to name the directory
795 * until the queue is registered to a gendisk).
797 queue_for_each_hw_ctx(q, hctx, i) {
798 if (!hctx->debugfs_dir && blk_mq_debugfs_register_hctx(q, hctx))
800 if (q->elevator && !hctx->sched_debugfs_dir &&
801 blk_mq_debugfs_register_sched_hctx(q, hctx))
808 blk_mq_debugfs_unregister(q);
812 void blk_mq_debugfs_unregister(struct request_queue *q)
814 debugfs_remove_recursive(q->debugfs_dir);
815 q->sched_debugfs_dir = NULL;
816 q->debugfs_dir = NULL;
819 static int blk_mq_debugfs_register_ctx(struct blk_mq_hw_ctx *hctx,
820 struct blk_mq_ctx *ctx)
822 struct dentry *ctx_dir;
825 snprintf(name, sizeof(name), "cpu%u", ctx->cpu);
826 ctx_dir = debugfs_create_dir(name, hctx->debugfs_dir);
830 if (!debugfs_create_files(ctx_dir, ctx, blk_mq_debugfs_ctx_attrs))
836 int blk_mq_debugfs_register_hctx(struct request_queue *q,
837 struct blk_mq_hw_ctx *hctx)
839 struct blk_mq_ctx *ctx;
846 snprintf(name, sizeof(name), "hctx%u", hctx->queue_num);
847 hctx->debugfs_dir = debugfs_create_dir(name, q->debugfs_dir);
848 if (!hctx->debugfs_dir)
851 if (!debugfs_create_files(hctx->debugfs_dir, hctx,
852 blk_mq_debugfs_hctx_attrs))
855 hctx_for_each_ctx(hctx, ctx, i) {
856 if (blk_mq_debugfs_register_ctx(hctx, ctx))
863 blk_mq_debugfs_unregister_hctx(hctx);
867 void blk_mq_debugfs_unregister_hctx(struct blk_mq_hw_ctx *hctx)
869 debugfs_remove_recursive(hctx->debugfs_dir);
870 hctx->sched_debugfs_dir = NULL;
871 hctx->debugfs_dir = NULL;
874 int blk_mq_debugfs_register_hctxs(struct request_queue *q)
876 struct blk_mq_hw_ctx *hctx;
879 queue_for_each_hw_ctx(q, hctx, i) {
880 if (blk_mq_debugfs_register_hctx(q, hctx))
887 void blk_mq_debugfs_unregister_hctxs(struct request_queue *q)
889 struct blk_mq_hw_ctx *hctx;
892 queue_for_each_hw_ctx(q, hctx, i)
893 blk_mq_debugfs_unregister_hctx(hctx);
896 int blk_mq_debugfs_register_sched(struct request_queue *q)
898 struct elevator_type *e = q->elevator->type;
903 if (!e->queue_debugfs_attrs)
906 q->sched_debugfs_dir = debugfs_create_dir("sched", q->debugfs_dir);
907 if (!q->sched_debugfs_dir)
910 if (!debugfs_create_files(q->sched_debugfs_dir, q,
911 e->queue_debugfs_attrs))
917 blk_mq_debugfs_unregister_sched(q);
921 void blk_mq_debugfs_unregister_sched(struct request_queue *q)
923 debugfs_remove_recursive(q->sched_debugfs_dir);
924 q->sched_debugfs_dir = NULL;
927 int blk_mq_debugfs_register_sched_hctx(struct request_queue *q,
928 struct blk_mq_hw_ctx *hctx)
930 struct elevator_type *e = q->elevator->type;
932 if (!hctx->debugfs_dir)
935 if (!e->hctx_debugfs_attrs)
938 hctx->sched_debugfs_dir = debugfs_create_dir("sched",
940 if (!hctx->sched_debugfs_dir)
943 if (!debugfs_create_files(hctx->sched_debugfs_dir, hctx,
944 e->hctx_debugfs_attrs))
950 void blk_mq_debugfs_unregister_sched_hctx(struct blk_mq_hw_ctx *hctx)
952 debugfs_remove_recursive(hctx->sched_debugfs_dir);
953 hctx->sched_debugfs_dir = NULL;