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 void print_stat(struct seq_file
*m
, struct blk_rq_stat
*stat
)
29 if (stat
->nr_samples
) {
30 seq_printf(m
, "samples=%d, mean=%lld, min=%llu, max=%llu",
31 stat
->nr_samples
, stat
->mean
, stat
->min
, stat
->max
);
33 seq_puts(m
, "samples=0");
37 static int queue_poll_stat_show(void *data
, struct seq_file
*m
)
39 struct request_queue
*q
= data
;
42 for (bucket
= 0; bucket
< BLK_MQ_POLL_STATS_BKTS
/2; bucket
++) {
43 seq_printf(m
, "read (%d Bytes): ", 1 << (9+bucket
));
44 print_stat(m
, &q
->poll_stat
[2*bucket
]);
47 seq_printf(m
, "write (%d Bytes): ", 1 << (9+bucket
));
48 print_stat(m
, &q
->poll_stat
[2*bucket
+1]);
54 static void *queue_requeue_list_start(struct seq_file
*m
, loff_t
*pos
)
55 __acquires(&q
->requeue_lock
)
57 struct request_queue
*q
= m
->private;
59 spin_lock_irq(&q
->requeue_lock
);
60 return seq_list_start(&q
->requeue_list
, *pos
);
63 static void *queue_requeue_list_next(struct seq_file
*m
, void *v
, loff_t
*pos
)
65 struct request_queue
*q
= m
->private;
67 return seq_list_next(v
, &q
->requeue_list
, pos
);
70 static void queue_requeue_list_stop(struct seq_file
*m
, void *v
)
71 __releases(&q
->requeue_lock
)
73 struct request_queue
*q
= m
->private;
75 spin_unlock_irq(&q
->requeue_lock
);
78 static const struct seq_operations queue_requeue_list_seq_ops
= {
79 .start
= queue_requeue_list_start
,
80 .next
= queue_requeue_list_next
,
81 .stop
= queue_requeue_list_stop
,
82 .show
= blk_mq_debugfs_rq_show
,
85 static int blk_flags_show(struct seq_file
*m
, const unsigned long flags
,
86 const char *const *flag_name
, int flag_name_count
)
91 for (i
= 0; i
< sizeof(flags
) * BITS_PER_BYTE
; i
++) {
92 if (!(flags
& BIT(i
)))
97 if (i
< flag_name_count
&& flag_name
[i
])
98 seq_puts(m
, flag_name
[i
]);
100 seq_printf(m
, "%d", i
);
105 static int queue_pm_only_show(void *data
, struct seq_file
*m
)
107 struct request_queue
*q
= data
;
109 seq_printf(m
, "%d\n", atomic_read(&q
->pm_only
));
113 #define QUEUE_FLAG_NAME(name) [QUEUE_FLAG_##name] = #name
114 static const char *const blk_queue_flag_name
[] = {
115 QUEUE_FLAG_NAME(STOPPED
),
116 QUEUE_FLAG_NAME(DYING
),
117 QUEUE_FLAG_NAME(BYPASS
),
118 QUEUE_FLAG_NAME(BIDI
),
119 QUEUE_FLAG_NAME(NOMERGES
),
120 QUEUE_FLAG_NAME(SAME_COMP
),
121 QUEUE_FLAG_NAME(FAIL_IO
),
122 QUEUE_FLAG_NAME(NONROT
),
123 QUEUE_FLAG_NAME(IO_STAT
),
124 QUEUE_FLAG_NAME(DISCARD
),
125 QUEUE_FLAG_NAME(NOXMERGES
),
126 QUEUE_FLAG_NAME(ADD_RANDOM
),
127 QUEUE_FLAG_NAME(SECERASE
),
128 QUEUE_FLAG_NAME(SAME_FORCE
),
129 QUEUE_FLAG_NAME(DEAD
),
130 QUEUE_FLAG_NAME(INIT_DONE
),
131 QUEUE_FLAG_NAME(NO_SG_MERGE
),
132 QUEUE_FLAG_NAME(POLL
),
134 QUEUE_FLAG_NAME(FUA
),
135 QUEUE_FLAG_NAME(FLUSH_NQ
),
136 QUEUE_FLAG_NAME(DAX
),
137 QUEUE_FLAG_NAME(STATS
),
138 QUEUE_FLAG_NAME(POLL_STATS
),
139 QUEUE_FLAG_NAME(REGISTERED
),
140 QUEUE_FLAG_NAME(SCSI_PASSTHROUGH
),
141 QUEUE_FLAG_NAME(QUIESCED
),
143 #undef QUEUE_FLAG_NAME
145 static int queue_state_show(void *data
, struct seq_file
*m
)
147 struct request_queue
*q
= data
;
149 blk_flags_show(m
, q
->queue_flags
, blk_queue_flag_name
,
150 ARRAY_SIZE(blk_queue_flag_name
));
155 static ssize_t
queue_state_write(void *data
, const char __user
*buf
,
156 size_t count
, loff_t
*ppos
)
158 struct request_queue
*q
= data
;
159 char opbuf
[16] = { }, *op
;
162 * The "state" attribute is removed after blk_cleanup_queue() has called
163 * blk_mq_free_queue(). Return if QUEUE_FLAG_DEAD has been set to avoid
164 * triggering a use-after-free.
166 if (blk_queue_dead(q
))
169 if (count
>= sizeof(opbuf
)) {
170 pr_err("%s: operation too long\n", __func__
);
174 if (copy_from_user(opbuf
, buf
, count
))
176 op
= strstrip(opbuf
);
177 if (strcmp(op
, "run") == 0) {
178 blk_mq_run_hw_queues(q
, true);
179 } else if (strcmp(op
, "start") == 0) {
180 blk_mq_start_stopped_hw_queues(q
, true);
181 } else if (strcmp(op
, "kick") == 0) {
182 blk_mq_kick_requeue_list(q
);
184 pr_err("%s: unsupported operation '%s'\n", __func__
, op
);
186 pr_err("%s: use 'run', 'start' or 'kick'\n", __func__
);
192 static int queue_write_hint_show(void *data
, struct seq_file
*m
)
194 struct request_queue
*q
= data
;
197 for (i
= 0; i
< BLK_MAX_WRITE_HINTS
; i
++)
198 seq_printf(m
, "hint%d: %llu\n", i
, q
->write_hints
[i
]);
203 static ssize_t
queue_write_hint_store(void *data
, const char __user
*buf
,
204 size_t count
, loff_t
*ppos
)
206 struct request_queue
*q
= data
;
209 for (i
= 0; i
< BLK_MAX_WRITE_HINTS
; i
++)
210 q
->write_hints
[i
] = 0;
215 static const struct blk_mq_debugfs_attr blk_mq_debugfs_queue_attrs
[] = {
216 { "poll_stat", 0400, queue_poll_stat_show
},
217 { "requeue_list", 0400, .seq_ops
= &queue_requeue_list_seq_ops
},
218 { "pm_only", 0600, queue_pm_only_show
, NULL
},
219 { "state", 0600, queue_state_show
, queue_state_write
},
220 { "write_hints", 0600, queue_write_hint_show
, queue_write_hint_store
},
221 { "zone_wlock", 0400, queue_zone_wlock_show
, NULL
},
225 #define HCTX_STATE_NAME(name) [BLK_MQ_S_##name] = #name
226 static const char *const hctx_state_name
[] = {
227 HCTX_STATE_NAME(STOPPED
),
228 HCTX_STATE_NAME(TAG_ACTIVE
),
229 HCTX_STATE_NAME(SCHED_RESTART
),
231 #undef HCTX_STATE_NAME
233 static int hctx_state_show(void *data
, struct seq_file
*m
)
235 struct blk_mq_hw_ctx
*hctx
= data
;
237 blk_flags_show(m
, hctx
->state
, hctx_state_name
,
238 ARRAY_SIZE(hctx_state_name
));
243 #define BLK_TAG_ALLOC_NAME(name) [BLK_TAG_ALLOC_##name] = #name
244 static const char *const alloc_policy_name
[] = {
245 BLK_TAG_ALLOC_NAME(FIFO
),
246 BLK_TAG_ALLOC_NAME(RR
),
248 #undef BLK_TAG_ALLOC_NAME
250 #define HCTX_FLAG_NAME(name) [ilog2(BLK_MQ_F_##name)] = #name
251 static const char *const hctx_flag_name
[] = {
252 HCTX_FLAG_NAME(SHOULD_MERGE
),
253 HCTX_FLAG_NAME(TAG_SHARED
),
254 HCTX_FLAG_NAME(SG_MERGE
),
255 HCTX_FLAG_NAME(BLOCKING
),
256 HCTX_FLAG_NAME(NO_SCHED
),
258 #undef HCTX_FLAG_NAME
260 static int hctx_flags_show(void *data
, struct seq_file
*m
)
262 struct blk_mq_hw_ctx
*hctx
= data
;
263 const int alloc_policy
= BLK_MQ_FLAG_TO_ALLOC_POLICY(hctx
->flags
);
265 seq_puts(m
, "alloc_policy=");
266 if (alloc_policy
< ARRAY_SIZE(alloc_policy_name
) &&
267 alloc_policy_name
[alloc_policy
])
268 seq_puts(m
, alloc_policy_name
[alloc_policy
]);
270 seq_printf(m
, "%d", alloc_policy
);
273 hctx
->flags
^ BLK_ALLOC_POLICY_TO_MQ_FLAG(alloc_policy
),
274 hctx_flag_name
, ARRAY_SIZE(hctx_flag_name
));
279 #define REQ_OP_NAME(name) [REQ_OP_##name] = #name
280 static const char *const op_name
[] = {
284 REQ_OP_NAME(DISCARD
),
285 REQ_OP_NAME(SECURE_ERASE
),
286 REQ_OP_NAME(ZONE_RESET
),
287 REQ_OP_NAME(WRITE_SAME
),
288 REQ_OP_NAME(WRITE_ZEROES
),
289 REQ_OP_NAME(SCSI_IN
),
290 REQ_OP_NAME(SCSI_OUT
),
292 REQ_OP_NAME(DRV_OUT
),
296 #define CMD_FLAG_NAME(name) [__REQ_##name] = #name
297 static const char *const cmd_flag_name
[] = {
298 CMD_FLAG_NAME(FAILFAST_DEV
),
299 CMD_FLAG_NAME(FAILFAST_TRANSPORT
),
300 CMD_FLAG_NAME(FAILFAST_DRIVER
),
304 CMD_FLAG_NAME(NOMERGE
),
306 CMD_FLAG_NAME(INTEGRITY
),
308 CMD_FLAG_NAME(PREFLUSH
),
309 CMD_FLAG_NAME(RAHEAD
),
310 CMD_FLAG_NAME(BACKGROUND
),
311 CMD_FLAG_NAME(NOUNMAP
),
312 CMD_FLAG_NAME(NOWAIT
),
316 #define RQF_NAME(name) [ilog2((__force u32)RQF_##name)] = #name
317 static const char *const rqf_name
[] = {
320 RQF_NAME(SOFTBARRIER
),
322 RQF_NAME(MIXED_MERGE
),
323 RQF_NAME(MQ_INFLIGHT
),
335 RQF_NAME(SPECIAL_PAYLOAD
),
336 RQF_NAME(ZONE_WRITE_LOCKED
),
337 RQF_NAME(MQ_POLL_SLEPT
),
341 static const char *const blk_mq_rq_state_name_array
[] = {
342 [MQ_RQ_IDLE
] = "idle",
343 [MQ_RQ_IN_FLIGHT
] = "in_flight",
344 [MQ_RQ_COMPLETE
] = "complete",
347 static const char *blk_mq_rq_state_name(enum mq_rq_state rq_state
)
349 if (WARN_ON_ONCE((unsigned int)rq_state
>=
350 ARRAY_SIZE(blk_mq_rq_state_name_array
)))
352 return blk_mq_rq_state_name_array
[rq_state
];
355 int __blk_mq_debugfs_rq_show(struct seq_file
*m
, struct request
*rq
)
357 const struct blk_mq_ops
*const mq_ops
= rq
->q
->mq_ops
;
358 const unsigned int op
= rq
->cmd_flags
& REQ_OP_MASK
;
360 seq_printf(m
, "%p {.op=", rq
);
361 if (op
< ARRAY_SIZE(op_name
) && op_name
[op
])
362 seq_printf(m
, "%s", op_name
[op
]);
364 seq_printf(m
, "%d", op
);
365 seq_puts(m
, ", .cmd_flags=");
366 blk_flags_show(m
, rq
->cmd_flags
& ~REQ_OP_MASK
, cmd_flag_name
,
367 ARRAY_SIZE(cmd_flag_name
));
368 seq_puts(m
, ", .rq_flags=");
369 blk_flags_show(m
, (__force
unsigned int)rq
->rq_flags
, rqf_name
,
370 ARRAY_SIZE(rqf_name
));
371 seq_printf(m
, ", .state=%s", blk_mq_rq_state_name(blk_mq_rq_state(rq
)));
372 seq_printf(m
, ", .tag=%d, .internal_tag=%d", rq
->tag
,
375 mq_ops
->show_rq(m
, rq
);
379 EXPORT_SYMBOL_GPL(__blk_mq_debugfs_rq_show
);
381 int blk_mq_debugfs_rq_show(struct seq_file
*m
, void *v
)
383 return __blk_mq_debugfs_rq_show(m
, list_entry_rq(v
));
385 EXPORT_SYMBOL_GPL(blk_mq_debugfs_rq_show
);
387 static void *hctx_dispatch_start(struct seq_file
*m
, loff_t
*pos
)
388 __acquires(&hctx
->lock
)
390 struct blk_mq_hw_ctx
*hctx
= m
->private;
392 spin_lock(&hctx
->lock
);
393 return seq_list_start(&hctx
->dispatch
, *pos
);
396 static void *hctx_dispatch_next(struct seq_file
*m
, void *v
, loff_t
*pos
)
398 struct blk_mq_hw_ctx
*hctx
= m
->private;
400 return seq_list_next(v
, &hctx
->dispatch
, pos
);
403 static void hctx_dispatch_stop(struct seq_file
*m
, void *v
)
404 __releases(&hctx
->lock
)
406 struct blk_mq_hw_ctx
*hctx
= m
->private;
408 spin_unlock(&hctx
->lock
);
411 static const struct seq_operations hctx_dispatch_seq_ops
= {
412 .start
= hctx_dispatch_start
,
413 .next
= hctx_dispatch_next
,
414 .stop
= hctx_dispatch_stop
,
415 .show
= blk_mq_debugfs_rq_show
,
418 struct show_busy_params
{
420 struct blk_mq_hw_ctx
*hctx
;
424 * Note: the state of a request may change while this function is in progress,
425 * e.g. due to a concurrent blk_mq_finish_request() call. Returns true to
426 * keep iterating requests.
428 static bool hctx_show_busy_rq(struct request
*rq
, void *data
, bool reserved
)
430 const struct show_busy_params
*params
= data
;
432 if (rq
->mq_hctx
== params
->hctx
)
433 __blk_mq_debugfs_rq_show(params
->m
,
434 list_entry_rq(&rq
->queuelist
));
439 static int hctx_busy_show(void *data
, struct seq_file
*m
)
441 struct blk_mq_hw_ctx
*hctx
= data
;
442 struct show_busy_params params
= { .m
= m
, .hctx
= hctx
};
444 blk_mq_tagset_busy_iter(hctx
->queue
->tag_set
, hctx_show_busy_rq
,
450 static int hctx_ctx_map_show(void *data
, struct seq_file
*m
)
452 struct blk_mq_hw_ctx
*hctx
= data
;
454 sbitmap_bitmap_show(&hctx
->ctx_map
, m
);
458 static void blk_mq_debugfs_tags_show(struct seq_file
*m
,
459 struct blk_mq_tags
*tags
)
461 seq_printf(m
, "nr_tags=%u\n", tags
->nr_tags
);
462 seq_printf(m
, "nr_reserved_tags=%u\n", tags
->nr_reserved_tags
);
463 seq_printf(m
, "active_queues=%d\n",
464 atomic_read(&tags
->active_queues
));
466 seq_puts(m
, "\nbitmap_tags:\n");
467 sbitmap_queue_show(&tags
->bitmap_tags
, m
);
469 if (tags
->nr_reserved_tags
) {
470 seq_puts(m
, "\nbreserved_tags:\n");
471 sbitmap_queue_show(&tags
->breserved_tags
, m
);
475 static int hctx_tags_show(void *data
, struct seq_file
*m
)
477 struct blk_mq_hw_ctx
*hctx
= data
;
478 struct request_queue
*q
= hctx
->queue
;
481 res
= mutex_lock_interruptible(&q
->sysfs_lock
);
485 blk_mq_debugfs_tags_show(m
, hctx
->tags
);
486 mutex_unlock(&q
->sysfs_lock
);
492 static int hctx_tags_bitmap_show(void *data
, struct seq_file
*m
)
494 struct blk_mq_hw_ctx
*hctx
= data
;
495 struct request_queue
*q
= hctx
->queue
;
498 res
= mutex_lock_interruptible(&q
->sysfs_lock
);
502 sbitmap_bitmap_show(&hctx
->tags
->bitmap_tags
.sb
, m
);
503 mutex_unlock(&q
->sysfs_lock
);
509 static int hctx_sched_tags_show(void *data
, struct seq_file
*m
)
511 struct blk_mq_hw_ctx
*hctx
= data
;
512 struct request_queue
*q
= hctx
->queue
;
515 res
= mutex_lock_interruptible(&q
->sysfs_lock
);
518 if (hctx
->sched_tags
)
519 blk_mq_debugfs_tags_show(m
, hctx
->sched_tags
);
520 mutex_unlock(&q
->sysfs_lock
);
526 static int hctx_sched_tags_bitmap_show(void *data
, struct seq_file
*m
)
528 struct blk_mq_hw_ctx
*hctx
= data
;
529 struct request_queue
*q
= hctx
->queue
;
532 res
= mutex_lock_interruptible(&q
->sysfs_lock
);
535 if (hctx
->sched_tags
)
536 sbitmap_bitmap_show(&hctx
->sched_tags
->bitmap_tags
.sb
, m
);
537 mutex_unlock(&q
->sysfs_lock
);
543 static int hctx_io_poll_show(void *data
, struct seq_file
*m
)
545 struct blk_mq_hw_ctx
*hctx
= data
;
547 seq_printf(m
, "considered=%lu\n", hctx
->poll_considered
);
548 seq_printf(m
, "invoked=%lu\n", hctx
->poll_invoked
);
549 seq_printf(m
, "success=%lu\n", hctx
->poll_success
);
553 static ssize_t
hctx_io_poll_write(void *data
, const char __user
*buf
,
554 size_t count
, loff_t
*ppos
)
556 struct blk_mq_hw_ctx
*hctx
= data
;
558 hctx
->poll_considered
= hctx
->poll_invoked
= hctx
->poll_success
= 0;
562 static int hctx_dispatched_show(void *data
, struct seq_file
*m
)
564 struct blk_mq_hw_ctx
*hctx
= data
;
567 seq_printf(m
, "%8u\t%lu\n", 0U, hctx
->dispatched
[0]);
569 for (i
= 1; i
< BLK_MQ_MAX_DISPATCH_ORDER
- 1; i
++) {
570 unsigned int d
= 1U << (i
- 1);
572 seq_printf(m
, "%8u\t%lu\n", d
, hctx
->dispatched
[i
]);
575 seq_printf(m
, "%8u+\t%lu\n", 1U << (i
- 1), hctx
->dispatched
[i
]);
579 static ssize_t
hctx_dispatched_write(void *data
, const char __user
*buf
,
580 size_t count
, loff_t
*ppos
)
582 struct blk_mq_hw_ctx
*hctx
= data
;
585 for (i
= 0; i
< BLK_MQ_MAX_DISPATCH_ORDER
; i
++)
586 hctx
->dispatched
[i
] = 0;
590 static int hctx_queued_show(void *data
, struct seq_file
*m
)
592 struct blk_mq_hw_ctx
*hctx
= data
;
594 seq_printf(m
, "%lu\n", hctx
->queued
);
598 static ssize_t
hctx_queued_write(void *data
, const char __user
*buf
,
599 size_t count
, loff_t
*ppos
)
601 struct blk_mq_hw_ctx
*hctx
= data
;
607 static int hctx_run_show(void *data
, struct seq_file
*m
)
609 struct blk_mq_hw_ctx
*hctx
= data
;
611 seq_printf(m
, "%lu\n", hctx
->run
);
615 static ssize_t
hctx_run_write(void *data
, const char __user
*buf
, size_t count
,
618 struct blk_mq_hw_ctx
*hctx
= data
;
624 static int hctx_active_show(void *data
, struct seq_file
*m
)
626 struct blk_mq_hw_ctx
*hctx
= data
;
628 seq_printf(m
, "%d\n", atomic_read(&hctx
->nr_active
));
632 static int hctx_dispatch_busy_show(void *data
, struct seq_file
*m
)
634 struct blk_mq_hw_ctx
*hctx
= data
;
636 seq_printf(m
, "%u\n", hctx
->dispatch_busy
);
640 static void *ctx_rq_list_start(struct seq_file
*m
, loff_t
*pos
)
641 __acquires(&ctx
->lock
)
643 struct blk_mq_ctx
*ctx
= m
->private;
645 spin_lock(&ctx
->lock
);
646 return seq_list_start(&ctx
->rq_list
, *pos
);
649 static void *ctx_rq_list_next(struct seq_file
*m
, void *v
, loff_t
*pos
)
651 struct blk_mq_ctx
*ctx
= m
->private;
653 return seq_list_next(v
, &ctx
->rq_list
, pos
);
656 static void ctx_rq_list_stop(struct seq_file
*m
, void *v
)
657 __releases(&ctx
->lock
)
659 struct blk_mq_ctx
*ctx
= m
->private;
661 spin_unlock(&ctx
->lock
);
664 static const struct seq_operations ctx_rq_list_seq_ops
= {
665 .start
= ctx_rq_list_start
,
666 .next
= ctx_rq_list_next
,
667 .stop
= ctx_rq_list_stop
,
668 .show
= blk_mq_debugfs_rq_show
,
670 static int ctx_dispatched_show(void *data
, struct seq_file
*m
)
672 struct blk_mq_ctx
*ctx
= data
;
674 seq_printf(m
, "%lu %lu\n", ctx
->rq_dispatched
[1], ctx
->rq_dispatched
[0]);
678 static ssize_t
ctx_dispatched_write(void *data
, const char __user
*buf
,
679 size_t count
, loff_t
*ppos
)
681 struct blk_mq_ctx
*ctx
= data
;
683 ctx
->rq_dispatched
[0] = ctx
->rq_dispatched
[1] = 0;
687 static int ctx_merged_show(void *data
, struct seq_file
*m
)
689 struct blk_mq_ctx
*ctx
= data
;
691 seq_printf(m
, "%lu\n", ctx
->rq_merged
);
695 static ssize_t
ctx_merged_write(void *data
, const char __user
*buf
,
696 size_t count
, loff_t
*ppos
)
698 struct blk_mq_ctx
*ctx
= data
;
704 static int ctx_completed_show(void *data
, struct seq_file
*m
)
706 struct blk_mq_ctx
*ctx
= data
;
708 seq_printf(m
, "%lu %lu\n", ctx
->rq_completed
[1], ctx
->rq_completed
[0]);
712 static ssize_t
ctx_completed_write(void *data
, const char __user
*buf
,
713 size_t count
, loff_t
*ppos
)
715 struct blk_mq_ctx
*ctx
= data
;
717 ctx
->rq_completed
[0] = ctx
->rq_completed
[1] = 0;
721 static int blk_mq_debugfs_show(struct seq_file
*m
, void *v
)
723 const struct blk_mq_debugfs_attr
*attr
= m
->private;
724 void *data
= d_inode(m
->file
->f_path
.dentry
->d_parent
)->i_private
;
726 return attr
->show(data
, m
);
729 static ssize_t
blk_mq_debugfs_write(struct file
*file
, const char __user
*buf
,
730 size_t count
, loff_t
*ppos
)
732 struct seq_file
*m
= file
->private_data
;
733 const struct blk_mq_debugfs_attr
*attr
= m
->private;
734 void *data
= d_inode(file
->f_path
.dentry
->d_parent
)->i_private
;
737 * Attributes that only implement .seq_ops are read-only and 'attr' is
738 * the same with 'data' in this case.
740 if (attr
== data
|| !attr
->write
)
743 return attr
->write(data
, buf
, count
, ppos
);
746 static int blk_mq_debugfs_open(struct inode
*inode
, struct file
*file
)
748 const struct blk_mq_debugfs_attr
*attr
= inode
->i_private
;
749 void *data
= d_inode(file
->f_path
.dentry
->d_parent
)->i_private
;
754 ret
= seq_open(file
, attr
->seq_ops
);
756 m
= file
->private_data
;
762 if (WARN_ON_ONCE(!attr
->show
))
765 return single_open(file
, blk_mq_debugfs_show
, inode
->i_private
);
768 static int blk_mq_debugfs_release(struct inode
*inode
, struct file
*file
)
770 const struct blk_mq_debugfs_attr
*attr
= inode
->i_private
;
773 return single_release(inode
, file
);
775 return seq_release(inode
, file
);
778 static const struct file_operations blk_mq_debugfs_fops
= {
779 .open
= blk_mq_debugfs_open
,
781 .write
= blk_mq_debugfs_write
,
783 .release
= blk_mq_debugfs_release
,
786 static const struct blk_mq_debugfs_attr blk_mq_debugfs_hctx_attrs
[] = {
787 {"state", 0400, hctx_state_show
},
788 {"flags", 0400, hctx_flags_show
},
789 {"dispatch", 0400, .seq_ops
= &hctx_dispatch_seq_ops
},
790 {"busy", 0400, hctx_busy_show
},
791 {"ctx_map", 0400, hctx_ctx_map_show
},
792 {"tags", 0400, hctx_tags_show
},
793 {"tags_bitmap", 0400, hctx_tags_bitmap_show
},
794 {"sched_tags", 0400, hctx_sched_tags_show
},
795 {"sched_tags_bitmap", 0400, hctx_sched_tags_bitmap_show
},
796 {"io_poll", 0600, hctx_io_poll_show
, hctx_io_poll_write
},
797 {"dispatched", 0600, hctx_dispatched_show
, hctx_dispatched_write
},
798 {"queued", 0600, hctx_queued_show
, hctx_queued_write
},
799 {"run", 0600, hctx_run_show
, hctx_run_write
},
800 {"active", 0400, hctx_active_show
},
801 {"dispatch_busy", 0400, hctx_dispatch_busy_show
},
805 static const struct blk_mq_debugfs_attr blk_mq_debugfs_ctx_attrs
[] = {
806 {"rq_list", 0400, .seq_ops
= &ctx_rq_list_seq_ops
},
807 {"dispatched", 0600, ctx_dispatched_show
, ctx_dispatched_write
},
808 {"merged", 0600, ctx_merged_show
, ctx_merged_write
},
809 {"completed", 0600, ctx_completed_show
, ctx_completed_write
},
813 static bool debugfs_create_files(struct dentry
*parent
, void *data
,
814 const struct blk_mq_debugfs_attr
*attr
)
816 d_inode(parent
)->i_private
= data
;
818 for (; attr
->name
; attr
++) {
819 if (!debugfs_create_file(attr
->name
, attr
->mode
, parent
,
820 (void *)attr
, &blk_mq_debugfs_fops
))
826 int blk_mq_debugfs_register(struct request_queue
*q
)
828 struct blk_mq_hw_ctx
*hctx
;
831 if (!blk_debugfs_root
)
834 q
->debugfs_dir
= debugfs_create_dir(kobject_name(q
->kobj
.parent
),
839 if (!debugfs_create_files(q
->debugfs_dir
, q
,
840 blk_mq_debugfs_queue_attrs
))
844 * blk_mq_init_sched() attempted to do this already, but q->debugfs_dir
845 * didn't exist yet (because we don't know what to name the directory
846 * until the queue is registered to a gendisk).
848 if (q
->elevator
&& !q
->sched_debugfs_dir
)
849 blk_mq_debugfs_register_sched(q
);
851 /* Similarly, blk_mq_init_hctx() couldn't do this previously. */
852 queue_for_each_hw_ctx(q
, hctx
, i
) {
853 if (!hctx
->debugfs_dir
&& blk_mq_debugfs_register_hctx(q
, hctx
))
855 if (q
->elevator
&& !hctx
->sched_debugfs_dir
&&
856 blk_mq_debugfs_register_sched_hctx(q
, hctx
))
863 blk_mq_debugfs_unregister(q
);
867 void blk_mq_debugfs_unregister(struct request_queue
*q
)
869 debugfs_remove_recursive(q
->debugfs_dir
);
870 q
->sched_debugfs_dir
= NULL
;
871 q
->debugfs_dir
= NULL
;
874 static int blk_mq_debugfs_register_ctx(struct blk_mq_hw_ctx
*hctx
,
875 struct blk_mq_ctx
*ctx
)
877 struct dentry
*ctx_dir
;
880 snprintf(name
, sizeof(name
), "cpu%u", ctx
->cpu
);
881 ctx_dir
= debugfs_create_dir(name
, hctx
->debugfs_dir
);
885 if (!debugfs_create_files(ctx_dir
, ctx
, blk_mq_debugfs_ctx_attrs
))
891 int blk_mq_debugfs_register_hctx(struct request_queue
*q
,
892 struct blk_mq_hw_ctx
*hctx
)
894 struct blk_mq_ctx
*ctx
;
901 snprintf(name
, sizeof(name
), "hctx%u", hctx
->queue_num
);
902 hctx
->debugfs_dir
= debugfs_create_dir(name
, q
->debugfs_dir
);
903 if (!hctx
->debugfs_dir
)
906 if (!debugfs_create_files(hctx
->debugfs_dir
, hctx
,
907 blk_mq_debugfs_hctx_attrs
))
910 hctx_for_each_ctx(hctx
, ctx
, i
) {
911 if (blk_mq_debugfs_register_ctx(hctx
, ctx
))
918 blk_mq_debugfs_unregister_hctx(hctx
);
922 void blk_mq_debugfs_unregister_hctx(struct blk_mq_hw_ctx
*hctx
)
924 debugfs_remove_recursive(hctx
->debugfs_dir
);
925 hctx
->sched_debugfs_dir
= NULL
;
926 hctx
->debugfs_dir
= NULL
;
929 int blk_mq_debugfs_register_hctxs(struct request_queue
*q
)
931 struct blk_mq_hw_ctx
*hctx
;
934 queue_for_each_hw_ctx(q
, hctx
, i
) {
935 if (blk_mq_debugfs_register_hctx(q
, hctx
))
942 void blk_mq_debugfs_unregister_hctxs(struct request_queue
*q
)
944 struct blk_mq_hw_ctx
*hctx
;
947 queue_for_each_hw_ctx(q
, hctx
, i
)
948 blk_mq_debugfs_unregister_hctx(hctx
);
951 int blk_mq_debugfs_register_sched(struct request_queue
*q
)
953 struct elevator_type
*e
= q
->elevator
->type
;
958 if (!e
->queue_debugfs_attrs
)
961 q
->sched_debugfs_dir
= debugfs_create_dir("sched", q
->debugfs_dir
);
962 if (!q
->sched_debugfs_dir
)
965 if (!debugfs_create_files(q
->sched_debugfs_dir
, q
,
966 e
->queue_debugfs_attrs
))
972 blk_mq_debugfs_unregister_sched(q
);
976 void blk_mq_debugfs_unregister_sched(struct request_queue
*q
)
978 debugfs_remove_recursive(q
->sched_debugfs_dir
);
979 q
->sched_debugfs_dir
= NULL
;
982 int blk_mq_debugfs_register_sched_hctx(struct request_queue
*q
,
983 struct blk_mq_hw_ctx
*hctx
)
985 struct elevator_type
*e
= q
->elevator
->type
;
987 if (!hctx
->debugfs_dir
)
990 if (!e
->hctx_debugfs_attrs
)
993 hctx
->sched_debugfs_dir
= debugfs_create_dir("sched",
995 if (!hctx
->sched_debugfs_dir
)
998 if (!debugfs_create_files(hctx
->sched_debugfs_dir
, hctx
,
999 e
->hctx_debugfs_attrs
))
1005 void blk_mq_debugfs_unregister_sched_hctx(struct blk_mq_hw_ctx
*hctx
)
1007 debugfs_remove_recursive(hctx
->sched_debugfs_dir
);
1008 hctx
->sched_debugfs_dir
= NULL
;