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);
118 pr_err("%s: unsupported operation '%s'\n", __func__, op);
120 pr_err("%s: use either 'run' or 'start'\n", __func__);
126 static void print_stat(struct seq_file *m, struct blk_rq_stat *stat)
128 if (stat->nr_samples) {
129 seq_printf(m, "samples=%d, mean=%lld, min=%llu, max=%llu",
130 stat->nr_samples, stat->mean, stat->min, stat->max);
132 seq_puts(m, "samples=0");
136 static int queue_poll_stat_show(void *data, struct seq_file *m)
138 struct request_queue *q = data;
141 for (bucket = 0; bucket < BLK_MQ_POLL_STATS_BKTS/2; bucket++) {
142 seq_printf(m, "read (%d Bytes): ", 1 << (9+bucket));
143 print_stat(m, &q->poll_stat[2*bucket]);
146 seq_printf(m, "write (%d Bytes): ", 1 << (9+bucket));
147 print_stat(m, &q->poll_stat[2*bucket+1]);
153 #define HCTX_STATE_NAME(name) [BLK_MQ_S_##name] = #name
154 static const char *const hctx_state_name[] = {
155 HCTX_STATE_NAME(STOPPED),
156 HCTX_STATE_NAME(TAG_ACTIVE),
157 HCTX_STATE_NAME(SCHED_RESTART),
158 HCTX_STATE_NAME(TAG_WAITING),
159 HCTX_STATE_NAME(START_ON_RUN),
161 #undef HCTX_STATE_NAME
163 static int hctx_state_show(void *data, struct seq_file *m)
165 struct blk_mq_hw_ctx *hctx = data;
167 blk_flags_show(m, hctx->state, hctx_state_name,
168 ARRAY_SIZE(hctx_state_name));
173 #define BLK_TAG_ALLOC_NAME(name) [BLK_TAG_ALLOC_##name] = #name
174 static const char *const alloc_policy_name[] = {
175 BLK_TAG_ALLOC_NAME(FIFO),
176 BLK_TAG_ALLOC_NAME(RR),
178 #undef BLK_TAG_ALLOC_NAME
180 #define HCTX_FLAG_NAME(name) [ilog2(BLK_MQ_F_##name)] = #name
181 static const char *const hctx_flag_name[] = {
182 HCTX_FLAG_NAME(SHOULD_MERGE),
183 HCTX_FLAG_NAME(TAG_SHARED),
184 HCTX_FLAG_NAME(SG_MERGE),
185 HCTX_FLAG_NAME(BLOCKING),
186 HCTX_FLAG_NAME(NO_SCHED),
188 #undef HCTX_FLAG_NAME
190 static int hctx_flags_show(void *data, struct seq_file *m)
192 struct blk_mq_hw_ctx *hctx = data;
193 const int alloc_policy = BLK_MQ_FLAG_TO_ALLOC_POLICY(hctx->flags);
195 seq_puts(m, "alloc_policy=");
196 if (alloc_policy < ARRAY_SIZE(alloc_policy_name) &&
197 alloc_policy_name[alloc_policy])
198 seq_puts(m, alloc_policy_name[alloc_policy]);
200 seq_printf(m, "%d", alloc_policy);
203 hctx->flags ^ BLK_ALLOC_POLICY_TO_MQ_FLAG(alloc_policy),
204 hctx_flag_name, ARRAY_SIZE(hctx_flag_name));
209 #define REQ_OP_NAME(name) [REQ_OP_##name] = #name
210 static const char *const op_name[] = {
214 REQ_OP_NAME(DISCARD),
215 REQ_OP_NAME(ZONE_REPORT),
216 REQ_OP_NAME(SECURE_ERASE),
217 REQ_OP_NAME(ZONE_RESET),
218 REQ_OP_NAME(WRITE_SAME),
219 REQ_OP_NAME(WRITE_ZEROES),
220 REQ_OP_NAME(SCSI_IN),
221 REQ_OP_NAME(SCSI_OUT),
223 REQ_OP_NAME(DRV_OUT),
227 #define CMD_FLAG_NAME(name) [__REQ_##name] = #name
228 static const char *const cmd_flag_name[] = {
229 CMD_FLAG_NAME(FAILFAST_DEV),
230 CMD_FLAG_NAME(FAILFAST_TRANSPORT),
231 CMD_FLAG_NAME(FAILFAST_DRIVER),
235 CMD_FLAG_NAME(NOMERGE),
237 CMD_FLAG_NAME(INTEGRITY),
239 CMD_FLAG_NAME(PREFLUSH),
240 CMD_FLAG_NAME(RAHEAD),
241 CMD_FLAG_NAME(BACKGROUND),
242 CMD_FLAG_NAME(NOUNMAP),
246 #define RQF_NAME(name) [ilog2((__force u32)RQF_##name)] = #name
247 static const char *const rqf_name[] = {
251 RQF_NAME(SOFTBARRIER),
253 RQF_NAME(MIXED_MERGE),
254 RQF_NAME(MQ_INFLIGHT),
266 RQF_NAME(SPECIAL_PAYLOAD),
270 #define RQAF_NAME(name) [REQ_ATOM_##name] = #name
271 static const char *const rqaf_name[] = {
274 RQAF_NAME(POLL_SLEPT),
278 int __blk_mq_debugfs_rq_show(struct seq_file *m, struct request *rq)
280 const struct blk_mq_ops *const mq_ops = rq->q->mq_ops;
281 const unsigned int op = rq->cmd_flags & REQ_OP_MASK;
283 seq_printf(m, "%p {.op=", rq);
284 if (op < ARRAY_SIZE(op_name) && op_name[op])
285 seq_printf(m, "%s", op_name[op]);
287 seq_printf(m, "%d", op);
288 seq_puts(m, ", .cmd_flags=");
289 blk_flags_show(m, rq->cmd_flags & ~REQ_OP_MASK, cmd_flag_name,
290 ARRAY_SIZE(cmd_flag_name));
291 seq_puts(m, ", .rq_flags=");
292 blk_flags_show(m, (__force unsigned int)rq->rq_flags, rqf_name,
293 ARRAY_SIZE(rqf_name));
294 seq_puts(m, ", .atomic_flags=");
295 blk_flags_show(m, rq->atomic_flags, rqaf_name, ARRAY_SIZE(rqaf_name));
296 seq_printf(m, ", .tag=%d, .internal_tag=%d", rq->tag,
299 mq_ops->show_rq(m, rq);
303 EXPORT_SYMBOL_GPL(__blk_mq_debugfs_rq_show);
305 int blk_mq_debugfs_rq_show(struct seq_file *m, void *v)
307 return __blk_mq_debugfs_rq_show(m, list_entry_rq(v));
309 EXPORT_SYMBOL_GPL(blk_mq_debugfs_rq_show);
311 static void *queue_requeue_list_start(struct seq_file *m, loff_t *pos)
312 __acquires(&q->requeue_lock)
314 struct request_queue *q = m->private;
316 spin_lock_irq(&q->requeue_lock);
317 return seq_list_start(&q->requeue_list, *pos);
320 static void *queue_requeue_list_next(struct seq_file *m, void *v, loff_t *pos)
322 struct request_queue *q = m->private;
324 return seq_list_next(v, &q->requeue_list, pos);
327 static void queue_requeue_list_stop(struct seq_file *m, void *v)
328 __releases(&q->requeue_lock)
330 struct request_queue *q = m->private;
332 spin_unlock_irq(&q->requeue_lock);
335 static const struct seq_operations queue_requeue_list_seq_ops = {
336 .start = queue_requeue_list_start,
337 .next = queue_requeue_list_next,
338 .stop = queue_requeue_list_stop,
339 .show = blk_mq_debugfs_rq_show,
342 static void *hctx_dispatch_start(struct seq_file *m, loff_t *pos)
343 __acquires(&hctx->lock)
345 struct blk_mq_hw_ctx *hctx = m->private;
347 spin_lock(&hctx->lock);
348 return seq_list_start(&hctx->dispatch, *pos);
351 static void *hctx_dispatch_next(struct seq_file *m, void *v, loff_t *pos)
353 struct blk_mq_hw_ctx *hctx = m->private;
355 return seq_list_next(v, &hctx->dispatch, pos);
358 static void hctx_dispatch_stop(struct seq_file *m, void *v)
359 __releases(&hctx->lock)
361 struct blk_mq_hw_ctx *hctx = m->private;
363 spin_unlock(&hctx->lock);
366 static const struct seq_operations hctx_dispatch_seq_ops = {
367 .start = hctx_dispatch_start,
368 .next = hctx_dispatch_next,
369 .stop = hctx_dispatch_stop,
370 .show = blk_mq_debugfs_rq_show,
373 struct show_busy_params {
375 struct blk_mq_hw_ctx *hctx;
379 * Note: the state of a request may change while this function is in progress,
380 * e.g. due to a concurrent blk_mq_finish_request() call.
382 static void hctx_show_busy_rq(struct request *rq, void *data, bool reserved)
384 const struct show_busy_params *params = data;
386 if (blk_mq_map_queue(rq->q, rq->mq_ctx->cpu) == params->hctx &&
387 test_bit(REQ_ATOM_STARTED, &rq->atomic_flags))
388 __blk_mq_debugfs_rq_show(params->m,
389 list_entry_rq(&rq->queuelist));
392 static int hctx_busy_show(void *data, struct seq_file *m)
394 struct blk_mq_hw_ctx *hctx = data;
395 struct show_busy_params params = { .m = m, .hctx = hctx };
397 blk_mq_tagset_busy_iter(hctx->queue->tag_set, hctx_show_busy_rq,
403 static int hctx_ctx_map_show(void *data, struct seq_file *m)
405 struct blk_mq_hw_ctx *hctx = data;
407 sbitmap_bitmap_show(&hctx->ctx_map, m);
411 static void blk_mq_debugfs_tags_show(struct seq_file *m,
412 struct blk_mq_tags *tags)
414 seq_printf(m, "nr_tags=%u\n", tags->nr_tags);
415 seq_printf(m, "nr_reserved_tags=%u\n", tags->nr_reserved_tags);
416 seq_printf(m, "active_queues=%d\n",
417 atomic_read(&tags->active_queues));
419 seq_puts(m, "\nbitmap_tags:\n");
420 sbitmap_queue_show(&tags->bitmap_tags, m);
422 if (tags->nr_reserved_tags) {
423 seq_puts(m, "\nbreserved_tags:\n");
424 sbitmap_queue_show(&tags->breserved_tags, m);
428 static int hctx_tags_show(void *data, struct seq_file *m)
430 struct blk_mq_hw_ctx *hctx = data;
431 struct request_queue *q = hctx->queue;
434 res = mutex_lock_interruptible(&q->sysfs_lock);
438 blk_mq_debugfs_tags_show(m, hctx->tags);
439 mutex_unlock(&q->sysfs_lock);
445 static int hctx_tags_bitmap_show(void *data, struct seq_file *m)
447 struct blk_mq_hw_ctx *hctx = data;
448 struct request_queue *q = hctx->queue;
451 res = mutex_lock_interruptible(&q->sysfs_lock);
455 sbitmap_bitmap_show(&hctx->tags->bitmap_tags.sb, m);
456 mutex_unlock(&q->sysfs_lock);
462 static int hctx_sched_tags_show(void *data, struct seq_file *m)
464 struct blk_mq_hw_ctx *hctx = data;
465 struct request_queue *q = hctx->queue;
468 res = mutex_lock_interruptible(&q->sysfs_lock);
471 if (hctx->sched_tags)
472 blk_mq_debugfs_tags_show(m, hctx->sched_tags);
473 mutex_unlock(&q->sysfs_lock);
479 static int hctx_sched_tags_bitmap_show(void *data, struct seq_file *m)
481 struct blk_mq_hw_ctx *hctx = data;
482 struct request_queue *q = hctx->queue;
485 res = mutex_lock_interruptible(&q->sysfs_lock);
488 if (hctx->sched_tags)
489 sbitmap_bitmap_show(&hctx->sched_tags->bitmap_tags.sb, m);
490 mutex_unlock(&q->sysfs_lock);
496 static int hctx_io_poll_show(void *data, struct seq_file *m)
498 struct blk_mq_hw_ctx *hctx = data;
500 seq_printf(m, "considered=%lu\n", hctx->poll_considered);
501 seq_printf(m, "invoked=%lu\n", hctx->poll_invoked);
502 seq_printf(m, "success=%lu\n", hctx->poll_success);
506 static ssize_t hctx_io_poll_write(void *data, const char __user *buf,
507 size_t count, loff_t *ppos)
509 struct blk_mq_hw_ctx *hctx = data;
511 hctx->poll_considered = hctx->poll_invoked = hctx->poll_success = 0;
515 static int hctx_dispatched_show(void *data, struct seq_file *m)
517 struct blk_mq_hw_ctx *hctx = data;
520 seq_printf(m, "%8u\t%lu\n", 0U, hctx->dispatched[0]);
522 for (i = 1; i < BLK_MQ_MAX_DISPATCH_ORDER - 1; i++) {
523 unsigned int d = 1U << (i - 1);
525 seq_printf(m, "%8u\t%lu\n", d, hctx->dispatched[i]);
528 seq_printf(m, "%8u+\t%lu\n", 1U << (i - 1), hctx->dispatched[i]);
532 static ssize_t hctx_dispatched_write(void *data, const char __user *buf,
533 size_t count, loff_t *ppos)
535 struct blk_mq_hw_ctx *hctx = data;
538 for (i = 0; i < BLK_MQ_MAX_DISPATCH_ORDER; i++)
539 hctx->dispatched[i] = 0;
543 static int hctx_queued_show(void *data, struct seq_file *m)
545 struct blk_mq_hw_ctx *hctx = data;
547 seq_printf(m, "%lu\n", hctx->queued);
551 static ssize_t hctx_queued_write(void *data, const char __user *buf,
552 size_t count, loff_t *ppos)
554 struct blk_mq_hw_ctx *hctx = data;
560 static int hctx_run_show(void *data, struct seq_file *m)
562 struct blk_mq_hw_ctx *hctx = data;
564 seq_printf(m, "%lu\n", hctx->run);
568 static ssize_t hctx_run_write(void *data, const char __user *buf, size_t count,
571 struct blk_mq_hw_ctx *hctx = data;
577 static int hctx_active_show(void *data, struct seq_file *m)
579 struct blk_mq_hw_ctx *hctx = data;
581 seq_printf(m, "%d\n", atomic_read(&hctx->nr_active));
585 static void *ctx_rq_list_start(struct seq_file *m, loff_t *pos)
586 __acquires(&ctx->lock)
588 struct blk_mq_ctx *ctx = m->private;
590 spin_lock(&ctx->lock);
591 return seq_list_start(&ctx->rq_list, *pos);
594 static void *ctx_rq_list_next(struct seq_file *m, void *v, loff_t *pos)
596 struct blk_mq_ctx *ctx = m->private;
598 return seq_list_next(v, &ctx->rq_list, pos);
601 static void ctx_rq_list_stop(struct seq_file *m, void *v)
602 __releases(&ctx->lock)
604 struct blk_mq_ctx *ctx = m->private;
606 spin_unlock(&ctx->lock);
609 static const struct seq_operations ctx_rq_list_seq_ops = {
610 .start = ctx_rq_list_start,
611 .next = ctx_rq_list_next,
612 .stop = ctx_rq_list_stop,
613 .show = blk_mq_debugfs_rq_show,
615 static int ctx_dispatched_show(void *data, struct seq_file *m)
617 struct blk_mq_ctx *ctx = data;
619 seq_printf(m, "%lu %lu\n", ctx->rq_dispatched[1], ctx->rq_dispatched[0]);
623 static ssize_t ctx_dispatched_write(void *data, const char __user *buf,
624 size_t count, loff_t *ppos)
626 struct blk_mq_ctx *ctx = data;
628 ctx->rq_dispatched[0] = ctx->rq_dispatched[1] = 0;
632 static int ctx_merged_show(void *data, struct seq_file *m)
634 struct blk_mq_ctx *ctx = data;
636 seq_printf(m, "%lu\n", ctx->rq_merged);
640 static ssize_t ctx_merged_write(void *data, const char __user *buf,
641 size_t count, loff_t *ppos)
643 struct blk_mq_ctx *ctx = data;
649 static int ctx_completed_show(void *data, struct seq_file *m)
651 struct blk_mq_ctx *ctx = data;
653 seq_printf(m, "%lu %lu\n", ctx->rq_completed[1], ctx->rq_completed[0]);
657 static ssize_t ctx_completed_write(void *data, const char __user *buf,
658 size_t count, loff_t *ppos)
660 struct blk_mq_ctx *ctx = data;
662 ctx->rq_completed[0] = ctx->rq_completed[1] = 0;
666 static int blk_mq_debugfs_show(struct seq_file *m, void *v)
668 const struct blk_mq_debugfs_attr *attr = m->private;
669 void *data = d_inode(m->file->f_path.dentry->d_parent)->i_private;
671 return attr->show(data, m);
674 static ssize_t blk_mq_debugfs_write(struct file *file, const char __user *buf,
675 size_t count, loff_t *ppos)
677 struct seq_file *m = file->private_data;
678 const struct blk_mq_debugfs_attr *attr = m->private;
679 void *data = d_inode(file->f_path.dentry->d_parent)->i_private;
684 return attr->write(data, buf, count, ppos);
687 static int blk_mq_debugfs_open(struct inode *inode, struct file *file)
689 const struct blk_mq_debugfs_attr *attr = inode->i_private;
690 void *data = d_inode(file->f_path.dentry->d_parent)->i_private;
695 ret = seq_open(file, attr->seq_ops);
697 m = file->private_data;
703 if (WARN_ON_ONCE(!attr->show))
706 return single_open(file, blk_mq_debugfs_show, inode->i_private);
709 static int blk_mq_debugfs_release(struct inode *inode, struct file *file)
711 const struct blk_mq_debugfs_attr *attr = inode->i_private;
714 return single_release(inode, file);
716 return seq_release(inode, file);
719 const struct file_operations blk_mq_debugfs_fops = {
720 .open = blk_mq_debugfs_open,
722 .write = blk_mq_debugfs_write,
724 .release = blk_mq_debugfs_release,
727 static const struct blk_mq_debugfs_attr blk_mq_debugfs_queue_attrs[] = {
728 {"poll_stat", 0400, queue_poll_stat_show},
729 {"requeue_list", 0400, .seq_ops = &queue_requeue_list_seq_ops},
730 {"state", 0600, queue_state_show, queue_state_write},
734 static const struct blk_mq_debugfs_attr blk_mq_debugfs_hctx_attrs[] = {
735 {"state", 0400, hctx_state_show},
736 {"flags", 0400, hctx_flags_show},
737 {"dispatch", 0400, .seq_ops = &hctx_dispatch_seq_ops},
738 {"busy", 0400, hctx_busy_show},
739 {"ctx_map", 0400, hctx_ctx_map_show},
740 {"tags", 0400, hctx_tags_show},
741 {"tags_bitmap", 0400, hctx_tags_bitmap_show},
742 {"sched_tags", 0400, hctx_sched_tags_show},
743 {"sched_tags_bitmap", 0400, hctx_sched_tags_bitmap_show},
744 {"io_poll", 0600, hctx_io_poll_show, hctx_io_poll_write},
745 {"dispatched", 0600, hctx_dispatched_show, hctx_dispatched_write},
746 {"queued", 0600, hctx_queued_show, hctx_queued_write},
747 {"run", 0600, hctx_run_show, hctx_run_write},
748 {"active", 0400, hctx_active_show},
752 static const struct blk_mq_debugfs_attr blk_mq_debugfs_ctx_attrs[] = {
753 {"rq_list", 0400, .seq_ops = &ctx_rq_list_seq_ops},
754 {"dispatched", 0600, ctx_dispatched_show, ctx_dispatched_write},
755 {"merged", 0600, ctx_merged_show, ctx_merged_write},
756 {"completed", 0600, ctx_completed_show, ctx_completed_write},
760 static bool debugfs_create_files(struct dentry *parent, void *data,
761 const struct blk_mq_debugfs_attr *attr)
763 d_inode(parent)->i_private = data;
765 for (; attr->name; attr++) {
766 if (!debugfs_create_file(attr->name, attr->mode, parent,
767 (void *)attr, &blk_mq_debugfs_fops))
773 int blk_mq_debugfs_register(struct request_queue *q)
775 struct blk_mq_hw_ctx *hctx;
778 if (!blk_debugfs_root)
781 q->debugfs_dir = debugfs_create_dir(kobject_name(q->kobj.parent),
786 if (!debugfs_create_files(q->debugfs_dir, q,
787 blk_mq_debugfs_queue_attrs))
791 * blk_mq_init_hctx() attempted to do this already, but q->debugfs_dir
792 * didn't exist yet (because we don't know what to name the directory
793 * until the queue is registered to a gendisk).
795 queue_for_each_hw_ctx(q, hctx, i) {
796 if (!hctx->debugfs_dir && blk_mq_debugfs_register_hctx(q, hctx))
798 if (q->elevator && !hctx->sched_debugfs_dir &&
799 blk_mq_debugfs_register_sched_hctx(q, hctx))
806 blk_mq_debugfs_unregister(q);
810 void blk_mq_debugfs_unregister(struct request_queue *q)
812 debugfs_remove_recursive(q->debugfs_dir);
813 q->sched_debugfs_dir = NULL;
814 q->debugfs_dir = NULL;
817 static int blk_mq_debugfs_register_ctx(struct blk_mq_hw_ctx *hctx,
818 struct blk_mq_ctx *ctx)
820 struct dentry *ctx_dir;
823 snprintf(name, sizeof(name), "cpu%u", ctx->cpu);
824 ctx_dir = debugfs_create_dir(name, hctx->debugfs_dir);
828 if (!debugfs_create_files(ctx_dir, ctx, blk_mq_debugfs_ctx_attrs))
834 int blk_mq_debugfs_register_hctx(struct request_queue *q,
835 struct blk_mq_hw_ctx *hctx)
837 struct blk_mq_ctx *ctx;
844 snprintf(name, sizeof(name), "hctx%u", hctx->queue_num);
845 hctx->debugfs_dir = debugfs_create_dir(name, q->debugfs_dir);
846 if (!hctx->debugfs_dir)
849 if (!debugfs_create_files(hctx->debugfs_dir, hctx,
850 blk_mq_debugfs_hctx_attrs))
853 hctx_for_each_ctx(hctx, ctx, i) {
854 if (blk_mq_debugfs_register_ctx(hctx, ctx))
861 blk_mq_debugfs_unregister_hctx(hctx);
865 void blk_mq_debugfs_unregister_hctx(struct blk_mq_hw_ctx *hctx)
867 debugfs_remove_recursive(hctx->debugfs_dir);
868 hctx->sched_debugfs_dir = NULL;
869 hctx->debugfs_dir = NULL;
872 int blk_mq_debugfs_register_hctxs(struct request_queue *q)
874 struct blk_mq_hw_ctx *hctx;
877 queue_for_each_hw_ctx(q, hctx, i) {
878 if (blk_mq_debugfs_register_hctx(q, hctx))
885 void blk_mq_debugfs_unregister_hctxs(struct request_queue *q)
887 struct blk_mq_hw_ctx *hctx;
890 queue_for_each_hw_ctx(q, hctx, i)
891 blk_mq_debugfs_unregister_hctx(hctx);
894 int blk_mq_debugfs_register_sched(struct request_queue *q)
896 struct elevator_type *e = q->elevator->type;
901 if (!e->queue_debugfs_attrs)
904 q->sched_debugfs_dir = debugfs_create_dir("sched", q->debugfs_dir);
905 if (!q->sched_debugfs_dir)
908 if (!debugfs_create_files(q->sched_debugfs_dir, q,
909 e->queue_debugfs_attrs))
915 blk_mq_debugfs_unregister_sched(q);
919 void blk_mq_debugfs_unregister_sched(struct request_queue *q)
921 debugfs_remove_recursive(q->sched_debugfs_dir);
922 q->sched_debugfs_dir = NULL;
925 int blk_mq_debugfs_register_sched_hctx(struct request_queue *q,
926 struct blk_mq_hw_ctx *hctx)
928 struct elevator_type *e = q->elevator->type;
930 if (!hctx->debugfs_dir)
933 if (!e->hctx_debugfs_attrs)
936 hctx->sched_debugfs_dir = debugfs_create_dir("sched",
938 if (!hctx->sched_debugfs_dir)
941 if (!debugfs_create_files(hctx->sched_debugfs_dir, hctx,
942 e->hctx_debugfs_attrs))
948 void blk_mq_debugfs_unregister_sched_hctx(struct blk_mq_hw_ctx *hctx)
950 debugfs_remove_recursive(hctx->sched_debugfs_dir);
951 hctx->sched_debugfs_dir = NULL;