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(QUEUED
),
116 QUEUE_FLAG_NAME(STOPPED
),
117 QUEUE_FLAG_NAME(DYING
),
118 QUEUE_FLAG_NAME(BYPASS
),
119 QUEUE_FLAG_NAME(BIDI
),
120 QUEUE_FLAG_NAME(NOMERGES
),
121 QUEUE_FLAG_NAME(SAME_COMP
),
122 QUEUE_FLAG_NAME(FAIL_IO
),
123 QUEUE_FLAG_NAME(NONROT
),
124 QUEUE_FLAG_NAME(IO_STAT
),
125 QUEUE_FLAG_NAME(DISCARD
),
126 QUEUE_FLAG_NAME(NOXMERGES
),
127 QUEUE_FLAG_NAME(ADD_RANDOM
),
128 QUEUE_FLAG_NAME(SECERASE
),
129 QUEUE_FLAG_NAME(SAME_FORCE
),
130 QUEUE_FLAG_NAME(DEAD
),
131 QUEUE_FLAG_NAME(INIT_DONE
),
132 QUEUE_FLAG_NAME(NO_SG_MERGE
),
133 QUEUE_FLAG_NAME(POLL
),
135 QUEUE_FLAG_NAME(FUA
),
136 QUEUE_FLAG_NAME(FLUSH_NQ
),
137 QUEUE_FLAG_NAME(DAX
),
138 QUEUE_FLAG_NAME(STATS
),
139 QUEUE_FLAG_NAME(POLL_STATS
),
140 QUEUE_FLAG_NAME(REGISTERED
),
141 QUEUE_FLAG_NAME(SCSI_PASSTHROUGH
),
142 QUEUE_FLAG_NAME(QUIESCED
),
144 #undef QUEUE_FLAG_NAME
146 static int queue_state_show(void *data
, struct seq_file
*m
)
148 struct request_queue
*q
= data
;
150 blk_flags_show(m
, q
->queue_flags
, blk_queue_flag_name
,
151 ARRAY_SIZE(blk_queue_flag_name
));
156 static ssize_t
queue_state_write(void *data
, const char __user
*buf
,
157 size_t count
, loff_t
*ppos
)
159 struct request_queue
*q
= data
;
160 char opbuf
[16] = { }, *op
;
163 * The "state" attribute is removed after blk_cleanup_queue() has called
164 * blk_mq_free_queue(). Return if QUEUE_FLAG_DEAD has been set to avoid
165 * triggering a use-after-free.
167 if (blk_queue_dead(q
))
170 if (count
>= sizeof(opbuf
)) {
171 pr_err("%s: operation too long\n", __func__
);
175 if (copy_from_user(opbuf
, buf
, count
))
177 op
= strstrip(opbuf
);
178 if (strcmp(op
, "run") == 0) {
179 blk_mq_run_hw_queues(q
, true);
180 } else if (strcmp(op
, "start") == 0) {
181 blk_mq_start_stopped_hw_queues(q
, true);
182 } else if (strcmp(op
, "kick") == 0) {
183 blk_mq_kick_requeue_list(q
);
185 pr_err("%s: unsupported operation '%s'\n", __func__
, op
);
187 pr_err("%s: use 'run', 'start' or 'kick'\n", __func__
);
193 static int queue_write_hint_show(void *data
, struct seq_file
*m
)
195 struct request_queue
*q
= data
;
198 for (i
= 0; i
< BLK_MAX_WRITE_HINTS
; i
++)
199 seq_printf(m
, "hint%d: %llu\n", i
, q
->write_hints
[i
]);
204 static ssize_t
queue_write_hint_store(void *data
, const char __user
*buf
,
205 size_t count
, loff_t
*ppos
)
207 struct request_queue
*q
= data
;
210 for (i
= 0; i
< BLK_MAX_WRITE_HINTS
; i
++)
211 q
->write_hints
[i
] = 0;
216 static const struct blk_mq_debugfs_attr blk_mq_debugfs_queue_attrs
[] = {
217 { "poll_stat", 0400, queue_poll_stat_show
},
218 { "requeue_list", 0400, .seq_ops
= &queue_requeue_list_seq_ops
},
219 { "pm_only", 0600, queue_pm_only_show
, NULL
},
220 { "state", 0600, queue_state_show
, queue_state_write
},
221 { "write_hints", 0600, queue_write_hint_show
, queue_write_hint_store
},
222 { "zone_wlock", 0400, queue_zone_wlock_show
, NULL
},
226 #define HCTX_STATE_NAME(name) [BLK_MQ_S_##name] = #name
227 static const char *const hctx_state_name
[] = {
228 HCTX_STATE_NAME(STOPPED
),
229 HCTX_STATE_NAME(TAG_ACTIVE
),
230 HCTX_STATE_NAME(SCHED_RESTART
),
232 #undef HCTX_STATE_NAME
234 static int hctx_state_show(void *data
, struct seq_file
*m
)
236 struct blk_mq_hw_ctx
*hctx
= data
;
238 blk_flags_show(m
, hctx
->state
, hctx_state_name
,
239 ARRAY_SIZE(hctx_state_name
));
244 #define BLK_TAG_ALLOC_NAME(name) [BLK_TAG_ALLOC_##name] = #name
245 static const char *const alloc_policy_name
[] = {
246 BLK_TAG_ALLOC_NAME(FIFO
),
247 BLK_TAG_ALLOC_NAME(RR
),
249 #undef BLK_TAG_ALLOC_NAME
251 #define HCTX_FLAG_NAME(name) [ilog2(BLK_MQ_F_##name)] = #name
252 static const char *const hctx_flag_name
[] = {
253 HCTX_FLAG_NAME(SHOULD_MERGE
),
254 HCTX_FLAG_NAME(TAG_SHARED
),
255 HCTX_FLAG_NAME(SG_MERGE
),
256 HCTX_FLAG_NAME(BLOCKING
),
257 HCTX_FLAG_NAME(NO_SCHED
),
259 #undef HCTX_FLAG_NAME
261 static int hctx_flags_show(void *data
, struct seq_file
*m
)
263 struct blk_mq_hw_ctx
*hctx
= data
;
264 const int alloc_policy
= BLK_MQ_FLAG_TO_ALLOC_POLICY(hctx
->flags
);
266 seq_puts(m
, "alloc_policy=");
267 if (alloc_policy
< ARRAY_SIZE(alloc_policy_name
) &&
268 alloc_policy_name
[alloc_policy
])
269 seq_puts(m
, alloc_policy_name
[alloc_policy
]);
271 seq_printf(m
, "%d", alloc_policy
);
274 hctx
->flags
^ BLK_ALLOC_POLICY_TO_MQ_FLAG(alloc_policy
),
275 hctx_flag_name
, ARRAY_SIZE(hctx_flag_name
));
280 #define REQ_OP_NAME(name) [REQ_OP_##name] = #name
281 static const char *const op_name
[] = {
285 REQ_OP_NAME(DISCARD
),
286 REQ_OP_NAME(ZONE_REPORT
),
287 REQ_OP_NAME(SECURE_ERASE
),
288 REQ_OP_NAME(ZONE_RESET
),
289 REQ_OP_NAME(WRITE_SAME
),
290 REQ_OP_NAME(WRITE_ZEROES
),
291 REQ_OP_NAME(SCSI_IN
),
292 REQ_OP_NAME(SCSI_OUT
),
294 REQ_OP_NAME(DRV_OUT
),
298 #define CMD_FLAG_NAME(name) [__REQ_##name] = #name
299 static const char *const cmd_flag_name
[] = {
300 CMD_FLAG_NAME(FAILFAST_DEV
),
301 CMD_FLAG_NAME(FAILFAST_TRANSPORT
),
302 CMD_FLAG_NAME(FAILFAST_DRIVER
),
306 CMD_FLAG_NAME(NOMERGE
),
308 CMD_FLAG_NAME(INTEGRITY
),
310 CMD_FLAG_NAME(PREFLUSH
),
311 CMD_FLAG_NAME(RAHEAD
),
312 CMD_FLAG_NAME(BACKGROUND
),
313 CMD_FLAG_NAME(NOUNMAP
),
314 CMD_FLAG_NAME(NOWAIT
),
318 #define RQF_NAME(name) [ilog2((__force u32)RQF_##name)] = #name
319 static const char *const rqf_name
[] = {
323 RQF_NAME(SOFTBARRIER
),
325 RQF_NAME(MIXED_MERGE
),
326 RQF_NAME(MQ_INFLIGHT
),
338 RQF_NAME(SPECIAL_PAYLOAD
),
339 RQF_NAME(ZONE_WRITE_LOCKED
),
340 RQF_NAME(MQ_POLL_SLEPT
),
344 static const char *const blk_mq_rq_state_name_array
[] = {
345 [MQ_RQ_IDLE
] = "idle",
346 [MQ_RQ_IN_FLIGHT
] = "in_flight",
347 [MQ_RQ_COMPLETE
] = "complete",
350 static const char *blk_mq_rq_state_name(enum mq_rq_state rq_state
)
352 if (WARN_ON_ONCE((unsigned int)rq_state
>=
353 ARRAY_SIZE(blk_mq_rq_state_name_array
)))
355 return blk_mq_rq_state_name_array
[rq_state
];
358 int __blk_mq_debugfs_rq_show(struct seq_file
*m
, struct request
*rq
)
360 const struct blk_mq_ops
*const mq_ops
= rq
->q
->mq_ops
;
361 const unsigned int op
= rq
->cmd_flags
& REQ_OP_MASK
;
363 seq_printf(m
, "%p {.op=", rq
);
364 if (op
< ARRAY_SIZE(op_name
) && op_name
[op
])
365 seq_printf(m
, "%s", op_name
[op
]);
367 seq_printf(m
, "%d", op
);
368 seq_puts(m
, ", .cmd_flags=");
369 blk_flags_show(m
, rq
->cmd_flags
& ~REQ_OP_MASK
, cmd_flag_name
,
370 ARRAY_SIZE(cmd_flag_name
));
371 seq_puts(m
, ", .rq_flags=");
372 blk_flags_show(m
, (__force
unsigned int)rq
->rq_flags
, rqf_name
,
373 ARRAY_SIZE(rqf_name
));
374 seq_printf(m
, ", .state=%s", blk_mq_rq_state_name(blk_mq_rq_state(rq
)));
375 seq_printf(m
, ", .tag=%d, .internal_tag=%d", rq
->tag
,
378 mq_ops
->show_rq(m
, rq
);
382 EXPORT_SYMBOL_GPL(__blk_mq_debugfs_rq_show
);
384 int blk_mq_debugfs_rq_show(struct seq_file
*m
, void *v
)
386 return __blk_mq_debugfs_rq_show(m
, list_entry_rq(v
));
388 EXPORT_SYMBOL_GPL(blk_mq_debugfs_rq_show
);
390 static void *hctx_dispatch_start(struct seq_file
*m
, loff_t
*pos
)
391 __acquires(&hctx
->lock
)
393 struct blk_mq_hw_ctx
*hctx
= m
->private;
395 spin_lock(&hctx
->lock
);
396 return seq_list_start(&hctx
->dispatch
, *pos
);
399 static void *hctx_dispatch_next(struct seq_file
*m
, void *v
, loff_t
*pos
)
401 struct blk_mq_hw_ctx
*hctx
= m
->private;
403 return seq_list_next(v
, &hctx
->dispatch
, pos
);
406 static void hctx_dispatch_stop(struct seq_file
*m
, void *v
)
407 __releases(&hctx
->lock
)
409 struct blk_mq_hw_ctx
*hctx
= m
->private;
411 spin_unlock(&hctx
->lock
);
414 static const struct seq_operations hctx_dispatch_seq_ops
= {
415 .start
= hctx_dispatch_start
,
416 .next
= hctx_dispatch_next
,
417 .stop
= hctx_dispatch_stop
,
418 .show
= blk_mq_debugfs_rq_show
,
421 struct show_busy_params
{
423 struct blk_mq_hw_ctx
*hctx
;
427 * Note: the state of a request may change while this function is in progress,
428 * e.g. due to a concurrent blk_mq_finish_request() call.
430 static void hctx_show_busy_rq(struct request
*rq
, void *data
, bool reserved
)
432 const struct show_busy_params
*params
= data
;
434 if (blk_mq_map_queue(rq
->q
, rq
->mq_ctx
->cpu
) == params
->hctx
&&
435 blk_mq_rq_state(rq
) != MQ_RQ_IDLE
)
436 __blk_mq_debugfs_rq_show(params
->m
,
437 list_entry_rq(&rq
->queuelist
));
440 static int hctx_busy_show(void *data
, struct seq_file
*m
)
442 struct blk_mq_hw_ctx
*hctx
= data
;
443 struct show_busy_params params
= { .m
= m
, .hctx
= hctx
};
445 blk_mq_tagset_busy_iter(hctx
->queue
->tag_set
, hctx_show_busy_rq
,
451 static int hctx_ctx_map_show(void *data
, struct seq_file
*m
)
453 struct blk_mq_hw_ctx
*hctx
= data
;
455 sbitmap_bitmap_show(&hctx
->ctx_map
, m
);
459 static void blk_mq_debugfs_tags_show(struct seq_file
*m
,
460 struct blk_mq_tags
*tags
)
462 seq_printf(m
, "nr_tags=%u\n", tags
->nr_tags
);
463 seq_printf(m
, "nr_reserved_tags=%u\n", tags
->nr_reserved_tags
);
464 seq_printf(m
, "active_queues=%d\n",
465 atomic_read(&tags
->active_queues
));
467 seq_puts(m
, "\nbitmap_tags:\n");
468 sbitmap_queue_show(&tags
->bitmap_tags
, m
);
470 if (tags
->nr_reserved_tags
) {
471 seq_puts(m
, "\nbreserved_tags:\n");
472 sbitmap_queue_show(&tags
->breserved_tags
, m
);
476 static int hctx_tags_show(void *data
, struct seq_file
*m
)
478 struct blk_mq_hw_ctx
*hctx
= data
;
479 struct request_queue
*q
= hctx
->queue
;
482 res
= mutex_lock_interruptible(&q
->sysfs_lock
);
486 blk_mq_debugfs_tags_show(m
, hctx
->tags
);
487 mutex_unlock(&q
->sysfs_lock
);
493 static int hctx_tags_bitmap_show(void *data
, struct seq_file
*m
)
495 struct blk_mq_hw_ctx
*hctx
= data
;
496 struct request_queue
*q
= hctx
->queue
;
499 res
= mutex_lock_interruptible(&q
->sysfs_lock
);
503 sbitmap_bitmap_show(&hctx
->tags
->bitmap_tags
.sb
, m
);
504 mutex_unlock(&q
->sysfs_lock
);
510 static int hctx_sched_tags_show(void *data
, struct seq_file
*m
)
512 struct blk_mq_hw_ctx
*hctx
= data
;
513 struct request_queue
*q
= hctx
->queue
;
516 res
= mutex_lock_interruptible(&q
->sysfs_lock
);
519 if (hctx
->sched_tags
)
520 blk_mq_debugfs_tags_show(m
, hctx
->sched_tags
);
521 mutex_unlock(&q
->sysfs_lock
);
527 static int hctx_sched_tags_bitmap_show(void *data
, struct seq_file
*m
)
529 struct blk_mq_hw_ctx
*hctx
= data
;
530 struct request_queue
*q
= hctx
->queue
;
533 res
= mutex_lock_interruptible(&q
->sysfs_lock
);
536 if (hctx
->sched_tags
)
537 sbitmap_bitmap_show(&hctx
->sched_tags
->bitmap_tags
.sb
, m
);
538 mutex_unlock(&q
->sysfs_lock
);
544 static int hctx_io_poll_show(void *data
, struct seq_file
*m
)
546 struct blk_mq_hw_ctx
*hctx
= data
;
548 seq_printf(m
, "considered=%lu\n", hctx
->poll_considered
);
549 seq_printf(m
, "invoked=%lu\n", hctx
->poll_invoked
);
550 seq_printf(m
, "success=%lu\n", hctx
->poll_success
);
554 static ssize_t
hctx_io_poll_write(void *data
, const char __user
*buf
,
555 size_t count
, loff_t
*ppos
)
557 struct blk_mq_hw_ctx
*hctx
= data
;
559 hctx
->poll_considered
= hctx
->poll_invoked
= hctx
->poll_success
= 0;
563 static int hctx_dispatched_show(void *data
, struct seq_file
*m
)
565 struct blk_mq_hw_ctx
*hctx
= data
;
568 seq_printf(m
, "%8u\t%lu\n", 0U, hctx
->dispatched
[0]);
570 for (i
= 1; i
< BLK_MQ_MAX_DISPATCH_ORDER
- 1; i
++) {
571 unsigned int d
= 1U << (i
- 1);
573 seq_printf(m
, "%8u\t%lu\n", d
, hctx
->dispatched
[i
]);
576 seq_printf(m
, "%8u+\t%lu\n", 1U << (i
- 1), hctx
->dispatched
[i
]);
580 static ssize_t
hctx_dispatched_write(void *data
, const char __user
*buf
,
581 size_t count
, loff_t
*ppos
)
583 struct blk_mq_hw_ctx
*hctx
= data
;
586 for (i
= 0; i
< BLK_MQ_MAX_DISPATCH_ORDER
; i
++)
587 hctx
->dispatched
[i
] = 0;
591 static int hctx_queued_show(void *data
, struct seq_file
*m
)
593 struct blk_mq_hw_ctx
*hctx
= data
;
595 seq_printf(m
, "%lu\n", hctx
->queued
);
599 static ssize_t
hctx_queued_write(void *data
, const char __user
*buf
,
600 size_t count
, loff_t
*ppos
)
602 struct blk_mq_hw_ctx
*hctx
= data
;
608 static int hctx_run_show(void *data
, struct seq_file
*m
)
610 struct blk_mq_hw_ctx
*hctx
= data
;
612 seq_printf(m
, "%lu\n", hctx
->run
);
616 static ssize_t
hctx_run_write(void *data
, const char __user
*buf
, size_t count
,
619 struct blk_mq_hw_ctx
*hctx
= data
;
625 static int hctx_active_show(void *data
, struct seq_file
*m
)
627 struct blk_mq_hw_ctx
*hctx
= data
;
629 seq_printf(m
, "%d\n", atomic_read(&hctx
->nr_active
));
633 static int hctx_dispatch_busy_show(void *data
, struct seq_file
*m
)
635 struct blk_mq_hw_ctx
*hctx
= data
;
637 seq_printf(m
, "%u\n", hctx
->dispatch_busy
);
641 static void *ctx_rq_list_start(struct seq_file
*m
, loff_t
*pos
)
642 __acquires(&ctx
->lock
)
644 struct blk_mq_ctx
*ctx
= m
->private;
646 spin_lock(&ctx
->lock
);
647 return seq_list_start(&ctx
->rq_list
, *pos
);
650 static void *ctx_rq_list_next(struct seq_file
*m
, void *v
, loff_t
*pos
)
652 struct blk_mq_ctx
*ctx
= m
->private;
654 return seq_list_next(v
, &ctx
->rq_list
, pos
);
657 static void ctx_rq_list_stop(struct seq_file
*m
, void *v
)
658 __releases(&ctx
->lock
)
660 struct blk_mq_ctx
*ctx
= m
->private;
662 spin_unlock(&ctx
->lock
);
665 static const struct seq_operations ctx_rq_list_seq_ops
= {
666 .start
= ctx_rq_list_start
,
667 .next
= ctx_rq_list_next
,
668 .stop
= ctx_rq_list_stop
,
669 .show
= blk_mq_debugfs_rq_show
,
671 static int ctx_dispatched_show(void *data
, struct seq_file
*m
)
673 struct blk_mq_ctx
*ctx
= data
;
675 seq_printf(m
, "%lu %lu\n", ctx
->rq_dispatched
[1], ctx
->rq_dispatched
[0]);
679 static ssize_t
ctx_dispatched_write(void *data
, const char __user
*buf
,
680 size_t count
, loff_t
*ppos
)
682 struct blk_mq_ctx
*ctx
= data
;
684 ctx
->rq_dispatched
[0] = ctx
->rq_dispatched
[1] = 0;
688 static int ctx_merged_show(void *data
, struct seq_file
*m
)
690 struct blk_mq_ctx
*ctx
= data
;
692 seq_printf(m
, "%lu\n", ctx
->rq_merged
);
696 static ssize_t
ctx_merged_write(void *data
, const char __user
*buf
,
697 size_t count
, loff_t
*ppos
)
699 struct blk_mq_ctx
*ctx
= data
;
705 static int ctx_completed_show(void *data
, struct seq_file
*m
)
707 struct blk_mq_ctx
*ctx
= data
;
709 seq_printf(m
, "%lu %lu\n", ctx
->rq_completed
[1], ctx
->rq_completed
[0]);
713 static ssize_t
ctx_completed_write(void *data
, const char __user
*buf
,
714 size_t count
, loff_t
*ppos
)
716 struct blk_mq_ctx
*ctx
= data
;
718 ctx
->rq_completed
[0] = ctx
->rq_completed
[1] = 0;
722 static int blk_mq_debugfs_show(struct seq_file
*m
, void *v
)
724 const struct blk_mq_debugfs_attr
*attr
= m
->private;
725 void *data
= d_inode(m
->file
->f_path
.dentry
->d_parent
)->i_private
;
727 return attr
->show(data
, m
);
730 static ssize_t
blk_mq_debugfs_write(struct file
*file
, const char __user
*buf
,
731 size_t count
, loff_t
*ppos
)
733 struct seq_file
*m
= file
->private_data
;
734 const struct blk_mq_debugfs_attr
*attr
= m
->private;
735 void *data
= d_inode(file
->f_path
.dentry
->d_parent
)->i_private
;
738 * Attributes that only implement .seq_ops are read-only and 'attr' is
739 * the same with 'data' in this case.
741 if (attr
== data
|| !attr
->write
)
744 return attr
->write(data
, buf
, count
, ppos
);
747 static int blk_mq_debugfs_open(struct inode
*inode
, struct file
*file
)
749 const struct blk_mq_debugfs_attr
*attr
= inode
->i_private
;
750 void *data
= d_inode(file
->f_path
.dentry
->d_parent
)->i_private
;
755 ret
= seq_open(file
, attr
->seq_ops
);
757 m
= file
->private_data
;
763 if (WARN_ON_ONCE(!attr
->show
))
766 return single_open(file
, blk_mq_debugfs_show
, inode
->i_private
);
769 static int blk_mq_debugfs_release(struct inode
*inode
, struct file
*file
)
771 const struct blk_mq_debugfs_attr
*attr
= inode
->i_private
;
774 return single_release(inode
, file
);
776 return seq_release(inode
, file
);
779 static const struct file_operations blk_mq_debugfs_fops
= {
780 .open
= blk_mq_debugfs_open
,
782 .write
= blk_mq_debugfs_write
,
784 .release
= blk_mq_debugfs_release
,
787 static const struct blk_mq_debugfs_attr blk_mq_debugfs_hctx_attrs
[] = {
788 {"state", 0400, hctx_state_show
},
789 {"flags", 0400, hctx_flags_show
},
790 {"dispatch", 0400, .seq_ops
= &hctx_dispatch_seq_ops
},
791 {"busy", 0400, hctx_busy_show
},
792 {"ctx_map", 0400, hctx_ctx_map_show
},
793 {"tags", 0400, hctx_tags_show
},
794 {"tags_bitmap", 0400, hctx_tags_bitmap_show
},
795 {"sched_tags", 0400, hctx_sched_tags_show
},
796 {"sched_tags_bitmap", 0400, hctx_sched_tags_bitmap_show
},
797 {"io_poll", 0600, hctx_io_poll_show
, hctx_io_poll_write
},
798 {"dispatched", 0600, hctx_dispatched_show
, hctx_dispatched_write
},
799 {"queued", 0600, hctx_queued_show
, hctx_queued_write
},
800 {"run", 0600, hctx_run_show
, hctx_run_write
},
801 {"active", 0400, hctx_active_show
},
802 {"dispatch_busy", 0400, hctx_dispatch_busy_show
},
806 static const struct blk_mq_debugfs_attr blk_mq_debugfs_ctx_attrs
[] = {
807 {"rq_list", 0400, .seq_ops
= &ctx_rq_list_seq_ops
},
808 {"dispatched", 0600, ctx_dispatched_show
, ctx_dispatched_write
},
809 {"merged", 0600, ctx_merged_show
, ctx_merged_write
},
810 {"completed", 0600, ctx_completed_show
, ctx_completed_write
},
814 static bool debugfs_create_files(struct dentry
*parent
, void *data
,
815 const struct blk_mq_debugfs_attr
*attr
)
817 d_inode(parent
)->i_private
= data
;
819 for (; attr
->name
; attr
++) {
820 if (!debugfs_create_file(attr
->name
, attr
->mode
, parent
,
821 (void *)attr
, &blk_mq_debugfs_fops
))
827 int blk_mq_debugfs_register(struct request_queue
*q
)
829 struct blk_mq_hw_ctx
*hctx
;
832 if (!blk_debugfs_root
)
835 q
->debugfs_dir
= debugfs_create_dir(kobject_name(q
->kobj
.parent
),
840 if (!debugfs_create_files(q
->debugfs_dir
, q
,
841 blk_mq_debugfs_queue_attrs
))
845 * blk_mq_init_sched() attempted to do this already, but q->debugfs_dir
846 * didn't exist yet (because we don't know what to name the directory
847 * until the queue is registered to a gendisk).
849 if (q
->elevator
&& !q
->sched_debugfs_dir
)
850 blk_mq_debugfs_register_sched(q
);
852 /* Similarly, blk_mq_init_hctx() couldn't do this previously. */
853 queue_for_each_hw_ctx(q
, hctx
, i
) {
854 if (!hctx
->debugfs_dir
&& blk_mq_debugfs_register_hctx(q
, hctx
))
856 if (q
->elevator
&& !hctx
->sched_debugfs_dir
&&
857 blk_mq_debugfs_register_sched_hctx(q
, hctx
))
864 blk_mq_debugfs_unregister(q
);
868 void blk_mq_debugfs_unregister(struct request_queue
*q
)
870 debugfs_remove_recursive(q
->debugfs_dir
);
871 q
->sched_debugfs_dir
= NULL
;
872 q
->debugfs_dir
= NULL
;
875 static int blk_mq_debugfs_register_ctx(struct blk_mq_hw_ctx
*hctx
,
876 struct blk_mq_ctx
*ctx
)
878 struct dentry
*ctx_dir
;
881 snprintf(name
, sizeof(name
), "cpu%u", ctx
->cpu
);
882 ctx_dir
= debugfs_create_dir(name
, hctx
->debugfs_dir
);
886 if (!debugfs_create_files(ctx_dir
, ctx
, blk_mq_debugfs_ctx_attrs
))
892 int blk_mq_debugfs_register_hctx(struct request_queue
*q
,
893 struct blk_mq_hw_ctx
*hctx
)
895 struct blk_mq_ctx
*ctx
;
902 snprintf(name
, sizeof(name
), "hctx%u", hctx
->queue_num
);
903 hctx
->debugfs_dir
= debugfs_create_dir(name
, q
->debugfs_dir
);
904 if (!hctx
->debugfs_dir
)
907 if (!debugfs_create_files(hctx
->debugfs_dir
, hctx
,
908 blk_mq_debugfs_hctx_attrs
))
911 hctx_for_each_ctx(hctx
, ctx
, i
) {
912 if (blk_mq_debugfs_register_ctx(hctx
, ctx
))
919 blk_mq_debugfs_unregister_hctx(hctx
);
923 void blk_mq_debugfs_unregister_hctx(struct blk_mq_hw_ctx
*hctx
)
925 debugfs_remove_recursive(hctx
->debugfs_dir
);
926 hctx
->sched_debugfs_dir
= NULL
;
927 hctx
->debugfs_dir
= NULL
;
930 int blk_mq_debugfs_register_hctxs(struct request_queue
*q
)
932 struct blk_mq_hw_ctx
*hctx
;
935 queue_for_each_hw_ctx(q
, hctx
, i
) {
936 if (blk_mq_debugfs_register_hctx(q
, hctx
))
943 void blk_mq_debugfs_unregister_hctxs(struct request_queue
*q
)
945 struct blk_mq_hw_ctx
*hctx
;
948 queue_for_each_hw_ctx(q
, hctx
, i
)
949 blk_mq_debugfs_unregister_hctx(hctx
);
952 int blk_mq_debugfs_register_sched(struct request_queue
*q
)
954 struct elevator_type
*e
= q
->elevator
->type
;
959 if (!e
->queue_debugfs_attrs
)
962 q
->sched_debugfs_dir
= debugfs_create_dir("sched", q
->debugfs_dir
);
963 if (!q
->sched_debugfs_dir
)
966 if (!debugfs_create_files(q
->sched_debugfs_dir
, q
,
967 e
->queue_debugfs_attrs
))
973 blk_mq_debugfs_unregister_sched(q
);
977 void blk_mq_debugfs_unregister_sched(struct request_queue
*q
)
979 debugfs_remove_recursive(q
->sched_debugfs_dir
);
980 q
->sched_debugfs_dir
= NULL
;
983 int blk_mq_debugfs_register_sched_hctx(struct request_queue
*q
,
984 struct blk_mq_hw_ctx
*hctx
)
986 struct elevator_type
*e
= q
->elevator
->type
;
988 if (!hctx
->debugfs_dir
)
991 if (!e
->hctx_debugfs_attrs
)
994 hctx
->sched_debugfs_dir
= debugfs_create_dir("sched",
996 if (!hctx
->sched_debugfs_dir
)
999 if (!debugfs_create_files(hctx
->sched_debugfs_dir
, hctx
,
1000 e
->hctx_debugfs_attrs
))
1006 void blk_mq_debugfs_unregister_sched_hctx(struct blk_mq_hw_ctx
*hctx
)
1008 debugfs_remove_recursive(hctx
->sched_debugfs_dir
);
1009 hctx
->sched_debugfs_dir
= NULL
;