xref: /linux/block/blk-mq-debugfs.c (revision 9b960d8cd6f712cb2c03e2bdd4d5ca058238037f)
1 // SPDX-License-Identifier: GPL-2.0
2 /*
3  * Copyright (C) 2017 Facebook
4  */
5 
6 #include <linux/kernel.h>
7 #include <linux/blkdev.h>
8 #include <linux/build_bug.h>
9 #include <linux/debugfs.h>
10 
11 #include "blk.h"
12 #include "blk-mq.h"
13 #include "blk-mq-debugfs.h"
14 #include "blk-mq-sched.h"
15 #include "blk-rq-qos.h"
16 
queue_poll_stat_show(void * data,struct seq_file * m)17 static int queue_poll_stat_show(void *data, struct seq_file *m)
18 {
19 	return 0;
20 }
21 
queue_requeue_list_start(struct seq_file * m,loff_t * pos)22 static void *queue_requeue_list_start(struct seq_file *m, loff_t *pos)
23 	__acquires(&q->requeue_lock)
24 {
25 	struct request_queue *q = m->private;
26 
27 	spin_lock_irq(&q->requeue_lock);
28 	return seq_list_start(&q->requeue_list, *pos);
29 }
30 
queue_requeue_list_next(struct seq_file * m,void * v,loff_t * pos)31 static void *queue_requeue_list_next(struct seq_file *m, void *v, loff_t *pos)
32 {
33 	struct request_queue *q = m->private;
34 
35 	return seq_list_next(v, &q->requeue_list, pos);
36 }
37 
queue_requeue_list_stop(struct seq_file * m,void * v)38 static void queue_requeue_list_stop(struct seq_file *m, void *v)
39 	__releases(&q->requeue_lock)
40 {
41 	struct request_queue *q = m->private;
42 
43 	spin_unlock_irq(&q->requeue_lock);
44 }
45 
46 static const struct seq_operations queue_requeue_list_seq_ops = {
47 	.start	= queue_requeue_list_start,
48 	.next	= queue_requeue_list_next,
49 	.stop	= queue_requeue_list_stop,
50 	.show	= blk_mq_debugfs_rq_show,
51 };
52 
blk_flags_show(struct seq_file * m,const unsigned long flags,const char * const * flag_name,int flag_name_count)53 static int blk_flags_show(struct seq_file *m, const unsigned long flags,
54 			  const char *const *flag_name, int flag_name_count)
55 {
56 	bool sep = false;
57 	int i;
58 
59 	for (i = 0; i < sizeof(flags) * BITS_PER_BYTE; i++) {
60 		if (!(flags & BIT(i)))
61 			continue;
62 		if (sep)
63 			seq_puts(m, "|");
64 		sep = true;
65 		if (i < flag_name_count && flag_name[i])
66 			seq_puts(m, flag_name[i]);
67 		else
68 			seq_printf(m, "%d", i);
69 	}
70 	return 0;
71 }
72 
queue_pm_only_show(void * data,struct seq_file * m)73 static int queue_pm_only_show(void *data, struct seq_file *m)
74 {
75 	struct request_queue *q = data;
76 
77 	seq_printf(m, "%d\n", atomic_read(&q->pm_only));
78 	return 0;
79 }
80 
81 #define QUEUE_FLAG_NAME(name) [QUEUE_FLAG_##name] = #name
82 static const char *const blk_queue_flag_name[] = {
83 	QUEUE_FLAG_NAME(DYING),
84 	QUEUE_FLAG_NAME(NOMERGES),
85 	QUEUE_FLAG_NAME(SAME_COMP),
86 	QUEUE_FLAG_NAME(FAIL_IO),
87 	QUEUE_FLAG_NAME(NOXMERGES),
88 	QUEUE_FLAG_NAME(SAME_FORCE),
89 	QUEUE_FLAG_NAME(INIT_DONE),
90 	QUEUE_FLAG_NAME(STATS),
91 	QUEUE_FLAG_NAME(REGISTERED),
92 	QUEUE_FLAG_NAME(QUIESCED),
93 	QUEUE_FLAG_NAME(RQ_ALLOC_TIME),
94 	QUEUE_FLAG_NAME(HCTX_ACTIVE),
95 	QUEUE_FLAG_NAME(SQ_SCHED),
96 };
97 #undef QUEUE_FLAG_NAME
98 
queue_state_show(void * data,struct seq_file * m)99 static int queue_state_show(void *data, struct seq_file *m)
100 {
101 	struct request_queue *q = data;
102 
103 	BUILD_BUG_ON(ARRAY_SIZE(blk_queue_flag_name) != QUEUE_FLAG_MAX);
104 	blk_flags_show(m, q->queue_flags, blk_queue_flag_name,
105 		       ARRAY_SIZE(blk_queue_flag_name));
106 	seq_puts(m, "\n");
107 	return 0;
108 }
109 
queue_state_write(void * data,const char __user * buf,size_t count,loff_t * ppos)110 static ssize_t queue_state_write(void *data, const char __user *buf,
111 				 size_t count, loff_t *ppos)
112 {
113 	struct request_queue *q = data;
114 	char opbuf[16] = { }, *op;
115 
116 	/*
117 	 * The "state" attribute is removed when the queue is removed.  Don't
118 	 * allow setting the state on a dying queue to avoid a use-after-free.
119 	 */
120 	if (blk_queue_dying(q))
121 		return -ENOENT;
122 
123 	if (count >= sizeof(opbuf)) {
124 		pr_err("%s: operation too long\n", __func__);
125 		goto inval;
126 	}
127 
128 	if (copy_from_user(opbuf, buf, count))
129 		return -EFAULT;
130 	op = strstrip(opbuf);
131 	if (strcmp(op, "run") == 0) {
132 		blk_mq_run_hw_queues(q, true);
133 	} else if (strcmp(op, "start") == 0) {
134 		blk_mq_start_stopped_hw_queues(q, true);
135 	} else if (strcmp(op, "kick") == 0) {
136 		blk_mq_kick_requeue_list(q);
137 	} else {
138 		pr_err("%s: unsupported operation '%s'\n", __func__, op);
139 inval:
140 		pr_err("%s: use 'run', 'start' or 'kick'\n", __func__);
141 		return -EINVAL;
142 	}
143 	return count;
144 }
145 
146 static const struct blk_mq_debugfs_attr blk_mq_debugfs_queue_attrs[] = {
147 	{ "poll_stat", 0400, queue_poll_stat_show },
148 	{ "requeue_list", 0400, .seq_ops = &queue_requeue_list_seq_ops },
149 	{ "pm_only", 0600, queue_pm_only_show, NULL },
150 	{ "state", 0600, queue_state_show, queue_state_write },
151 	{ "zone_wplugs", 0400, queue_zone_wplugs_show, NULL },
152 	{ },
153 };
154 
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(INACTIVE),
161 };
162 #undef HCTX_STATE_NAME
163 
hctx_state_show(void * data,struct seq_file * m)164 static int hctx_state_show(void *data, struct seq_file *m)
165 {
166 	struct blk_mq_hw_ctx *hctx = data;
167 
168 	BUILD_BUG_ON(ARRAY_SIZE(hctx_state_name) != BLK_MQ_S_MAX);
169 	blk_flags_show(m, hctx->state, hctx_state_name,
170 		       ARRAY_SIZE(hctx_state_name));
171 	seq_puts(m, "\n");
172 	return 0;
173 }
174 
175 #define HCTX_FLAG_NAME(name) [ilog2(BLK_MQ_F_##name)] = #name
176 static const char *const hctx_flag_name[] = {
177 	HCTX_FLAG_NAME(TAG_QUEUE_SHARED),
178 	HCTX_FLAG_NAME(STACKING),
179 	HCTX_FLAG_NAME(TAG_HCTX_SHARED),
180 	HCTX_FLAG_NAME(BLOCKING),
181 	HCTX_FLAG_NAME(TAG_RR),
182 	HCTX_FLAG_NAME(NO_SCHED_BY_DEFAULT),
183 };
184 #undef HCTX_FLAG_NAME
185 
hctx_flags_show(void * data,struct seq_file * m)186 static int hctx_flags_show(void *data, struct seq_file *m)
187 {
188 	struct blk_mq_hw_ctx *hctx = data;
189 
190 	BUILD_BUG_ON(ARRAY_SIZE(hctx_flag_name) != ilog2(BLK_MQ_F_MAX));
191 
192 	blk_flags_show(m, hctx->flags, hctx_flag_name,
193 			ARRAY_SIZE(hctx_flag_name));
194 	seq_puts(m, "\n");
195 	return 0;
196 }
197 
198 #define CMD_FLAG_NAME(name) [__REQ_##name] = #name
199 static const char *const cmd_flag_name[] = {
200 	CMD_FLAG_NAME(FAILFAST_DEV),
201 	CMD_FLAG_NAME(FAILFAST_TRANSPORT),
202 	CMD_FLAG_NAME(FAILFAST_DRIVER),
203 	CMD_FLAG_NAME(SYNC),
204 	CMD_FLAG_NAME(META),
205 	CMD_FLAG_NAME(PRIO),
206 	CMD_FLAG_NAME(NOMERGE),
207 	CMD_FLAG_NAME(IDLE),
208 	CMD_FLAG_NAME(INTEGRITY),
209 	CMD_FLAG_NAME(FUA),
210 	CMD_FLAG_NAME(PREFLUSH),
211 	CMD_FLAG_NAME(RAHEAD),
212 	CMD_FLAG_NAME(BACKGROUND),
213 	CMD_FLAG_NAME(NOWAIT),
214 	CMD_FLAG_NAME(POLLED),
215 	CMD_FLAG_NAME(ALLOC_CACHE),
216 	CMD_FLAG_NAME(SWAP),
217 	CMD_FLAG_NAME(DRV),
218 	CMD_FLAG_NAME(FS_PRIVATE),
219 	CMD_FLAG_NAME(ATOMIC),
220 	CMD_FLAG_NAME(NOUNMAP),
221 };
222 #undef CMD_FLAG_NAME
223 
224 #define RQF_NAME(name) [__RQF_##name] = #name
225 static const char *const rqf_name[] = {
226 	RQF_NAME(STARTED),
227 	RQF_NAME(FLUSH_SEQ),
228 	RQF_NAME(MIXED_MERGE),
229 	RQF_NAME(DONTPREP),
230 	RQF_NAME(SCHED_TAGS),
231 	RQF_NAME(USE_SCHED),
232 	RQF_NAME(FAILED),
233 	RQF_NAME(QUIET),
234 	RQF_NAME(IO_STAT),
235 	RQF_NAME(PM),
236 	RQF_NAME(HASHED),
237 	RQF_NAME(STATS),
238 	RQF_NAME(SPECIAL_PAYLOAD),
239 	RQF_NAME(ZONE_WRITE_PLUGGING),
240 	RQF_NAME(TIMED_OUT),
241 	RQF_NAME(RESV),
242 };
243 #undef RQF_NAME
244 
245 static const char *const blk_mq_rq_state_name_array[] = {
246 	[MQ_RQ_IDLE]		= "idle",
247 	[MQ_RQ_IN_FLIGHT]	= "in_flight",
248 	[MQ_RQ_COMPLETE]	= "complete",
249 };
250 
blk_mq_rq_state_name(enum mq_rq_state rq_state)251 static const char *blk_mq_rq_state_name(enum mq_rq_state rq_state)
252 {
253 	if (WARN_ON_ONCE((unsigned int)rq_state >=
254 			 ARRAY_SIZE(blk_mq_rq_state_name_array)))
255 		return "(?)";
256 	return blk_mq_rq_state_name_array[rq_state];
257 }
258 
__blk_mq_debugfs_rq_show(struct seq_file * m,struct request * rq)259 int __blk_mq_debugfs_rq_show(struct seq_file *m, struct request *rq)
260 {
261 	const struct blk_mq_ops *const mq_ops = rq->q->mq_ops;
262 	const enum req_op op = req_op(rq);
263 	const char *op_str = blk_op_str(op);
264 
265 	BUILD_BUG_ON(ARRAY_SIZE(cmd_flag_name) != __REQ_NR_BITS);
266 	BUILD_BUG_ON(ARRAY_SIZE(rqf_name) != __RQF_BITS);
267 
268 	seq_printf(m, "%p {.op=", rq);
269 	if (strcmp(op_str, "UNKNOWN") == 0)
270 		seq_printf(m, "%u", op);
271 	else
272 		seq_printf(m, "%s", op_str);
273 	seq_puts(m, ", .cmd_flags=");
274 	blk_flags_show(m, (__force unsigned int)(rq->cmd_flags & ~REQ_OP_MASK),
275 		       cmd_flag_name, ARRAY_SIZE(cmd_flag_name));
276 	seq_puts(m, ", .rq_flags=");
277 	blk_flags_show(m, (__force unsigned int)rq->rq_flags, rqf_name,
278 		       ARRAY_SIZE(rqf_name));
279 	seq_printf(m, ", .state=%s", blk_mq_rq_state_name(blk_mq_rq_state(rq)));
280 	seq_printf(m, ", .tag=%d, .internal_tag=%d", rq->tag,
281 		   rq->internal_tag);
282 	if (mq_ops->show_rq)
283 		mq_ops->show_rq(m, rq);
284 	seq_puts(m, "}\n");
285 	return 0;
286 }
287 EXPORT_SYMBOL_GPL(__blk_mq_debugfs_rq_show);
288 
blk_mq_debugfs_rq_show(struct seq_file * m,void * v)289 int blk_mq_debugfs_rq_show(struct seq_file *m, void *v)
290 {
291 	return __blk_mq_debugfs_rq_show(m, list_entry_rq(v));
292 }
293 EXPORT_SYMBOL_GPL(blk_mq_debugfs_rq_show);
294 
hctx_dispatch_start(struct seq_file * m,loff_t * pos)295 static void *hctx_dispatch_start(struct seq_file *m, loff_t *pos)
296 	__acquires(&hctx->lock)
297 {
298 	struct blk_mq_hw_ctx *hctx = m->private;
299 
300 	spin_lock(&hctx->lock);
301 	return seq_list_start(&hctx->dispatch, *pos);
302 }
303 
hctx_dispatch_next(struct seq_file * m,void * v,loff_t * pos)304 static void *hctx_dispatch_next(struct seq_file *m, void *v, loff_t *pos)
305 {
306 	struct blk_mq_hw_ctx *hctx = m->private;
307 
308 	return seq_list_next(v, &hctx->dispatch, pos);
309 }
310 
hctx_dispatch_stop(struct seq_file * m,void * v)311 static void hctx_dispatch_stop(struct seq_file *m, void *v)
312 	__releases(&hctx->lock)
313 {
314 	struct blk_mq_hw_ctx *hctx = m->private;
315 
316 	spin_unlock(&hctx->lock);
317 }
318 
319 static const struct seq_operations hctx_dispatch_seq_ops = {
320 	.start	= hctx_dispatch_start,
321 	.next	= hctx_dispatch_next,
322 	.stop	= hctx_dispatch_stop,
323 	.show	= blk_mq_debugfs_rq_show,
324 };
325 
326 struct show_busy_params {
327 	struct seq_file		*m;
328 	struct blk_mq_hw_ctx	*hctx;
329 };
330 
331 /*
332  * Note: the state of a request may change while this function is in progress,
333  * e.g. due to a concurrent blk_mq_finish_request() call. Returns true to
334  * keep iterating requests.
335  */
hctx_show_busy_rq(struct request * rq,void * data)336 static bool hctx_show_busy_rq(struct request *rq, void *data)
337 {
338 	const struct show_busy_params *params = data;
339 
340 	if (rq->mq_hctx == params->hctx)
341 		__blk_mq_debugfs_rq_show(params->m, rq);
342 
343 	return true;
344 }
345 
hctx_busy_show(void * data,struct seq_file * m)346 static int hctx_busy_show(void *data, struct seq_file *m)
347 {
348 	struct blk_mq_hw_ctx *hctx = data;
349 	struct show_busy_params params = { .m = m, .hctx = hctx };
350 	int res;
351 
352 	res = mutex_lock_interruptible(&hctx->queue->elevator_lock);
353 	if (res)
354 		return res;
355 	blk_mq_tagset_busy_iter(hctx->queue->tag_set, hctx_show_busy_rq,
356 				&params);
357 	mutex_unlock(&hctx->queue->elevator_lock);
358 
359 	return 0;
360 }
361 
362 static const char *const hctx_types[] = {
363 	[HCTX_TYPE_DEFAULT]	= "default",
364 	[HCTX_TYPE_READ]	= "read",
365 	[HCTX_TYPE_POLL]	= "poll",
366 };
367 
hctx_type_show(void * data,struct seq_file * m)368 static int hctx_type_show(void *data, struct seq_file *m)
369 {
370 	struct blk_mq_hw_ctx *hctx = data;
371 
372 	BUILD_BUG_ON(ARRAY_SIZE(hctx_types) != HCTX_MAX_TYPES);
373 	seq_printf(m, "%s\n", hctx_types[hctx->type]);
374 	return 0;
375 }
376 
hctx_ctx_map_show(void * data,struct seq_file * m)377 static int hctx_ctx_map_show(void *data, struct seq_file *m)
378 {
379 	struct blk_mq_hw_ctx *hctx = data;
380 
381 	sbitmap_bitmap_show(&hctx->ctx_map, m);
382 	return 0;
383 }
384 
blk_mq_debugfs_tags_show(struct seq_file * m,struct blk_mq_tags * tags)385 static void blk_mq_debugfs_tags_show(struct seq_file *m,
386 				     struct blk_mq_tags *tags)
387 {
388 	seq_printf(m, "nr_tags=%u\n", tags->nr_tags);
389 	seq_printf(m, "nr_reserved_tags=%u\n", tags->nr_reserved_tags);
390 	seq_printf(m, "active_queues=%d\n",
391 		   READ_ONCE(tags->active_queues));
392 
393 	seq_puts(m, "\nbitmap_tags:\n");
394 	sbitmap_queue_show(&tags->bitmap_tags, m);
395 
396 	if (tags->nr_reserved_tags) {
397 		seq_puts(m, "\nbreserved_tags:\n");
398 		sbitmap_queue_show(&tags->breserved_tags, m);
399 	}
400 }
401 
hctx_tags_show(void * data,struct seq_file * m)402 static int hctx_tags_show(void *data, struct seq_file *m)
403 {
404 	struct blk_mq_hw_ctx *hctx = data;
405 	struct request_queue *q = hctx->queue;
406 	int res;
407 
408 	res = mutex_lock_interruptible(&q->elevator_lock);
409 	if (res)
410 		return res;
411 	if (hctx->tags)
412 		blk_mq_debugfs_tags_show(m, hctx->tags);
413 	mutex_unlock(&q->elevator_lock);
414 
415 	return 0;
416 }
417 
hctx_tags_bitmap_show(void * data,struct seq_file * m)418 static int hctx_tags_bitmap_show(void *data, struct seq_file *m)
419 {
420 	struct blk_mq_hw_ctx *hctx = data;
421 	struct request_queue *q = hctx->queue;
422 	int res;
423 
424 	res = mutex_lock_interruptible(&q->elevator_lock);
425 	if (res)
426 		return res;
427 	if (hctx->tags)
428 		sbitmap_bitmap_show(&hctx->tags->bitmap_tags.sb, m);
429 	mutex_unlock(&q->elevator_lock);
430 
431 	return 0;
432 }
433 
hctx_sched_tags_show(void * data,struct seq_file * m)434 static int hctx_sched_tags_show(void *data, struct seq_file *m)
435 {
436 	struct blk_mq_hw_ctx *hctx = data;
437 	struct request_queue *q = hctx->queue;
438 	int res;
439 
440 	res = mutex_lock_interruptible(&q->elevator_lock);
441 	if (res)
442 		return res;
443 	if (hctx->sched_tags)
444 		blk_mq_debugfs_tags_show(m, hctx->sched_tags);
445 	mutex_unlock(&q->elevator_lock);
446 
447 	return 0;
448 }
449 
hctx_sched_tags_bitmap_show(void * data,struct seq_file * m)450 static int hctx_sched_tags_bitmap_show(void *data, struct seq_file *m)
451 {
452 	struct blk_mq_hw_ctx *hctx = data;
453 	struct request_queue *q = hctx->queue;
454 	int res;
455 
456 	res = mutex_lock_interruptible(&q->elevator_lock);
457 	if (res)
458 		return res;
459 	if (hctx->sched_tags)
460 		sbitmap_bitmap_show(&hctx->sched_tags->bitmap_tags.sb, m);
461 	mutex_unlock(&q->elevator_lock);
462 
463 	return 0;
464 }
465 
hctx_active_show(void * data,struct seq_file * m)466 static int hctx_active_show(void *data, struct seq_file *m)
467 {
468 	struct blk_mq_hw_ctx *hctx = data;
469 
470 	seq_printf(m, "%d\n", __blk_mq_active_requests(hctx));
471 	return 0;
472 }
473 
hctx_dispatch_busy_show(void * data,struct seq_file * m)474 static int hctx_dispatch_busy_show(void *data, struct seq_file *m)
475 {
476 	struct blk_mq_hw_ctx *hctx = data;
477 
478 	seq_printf(m, "%u\n", hctx->dispatch_busy);
479 	return 0;
480 }
481 
482 #define CTX_RQ_SEQ_OPS(name, type)					\
483 static void *ctx_##name##_rq_list_start(struct seq_file *m, loff_t *pos) \
484 	__acquires(&ctx->lock)						\
485 {									\
486 	struct blk_mq_ctx *ctx = m->private;				\
487 									\
488 	spin_lock(&ctx->lock);						\
489 	return seq_list_start(&ctx->rq_lists[type], *pos);		\
490 }									\
491 									\
492 static void *ctx_##name##_rq_list_next(struct seq_file *m, void *v,	\
493 				     loff_t *pos)			\
494 {									\
495 	struct blk_mq_ctx *ctx = m->private;				\
496 									\
497 	return seq_list_next(v, &ctx->rq_lists[type], pos);		\
498 }									\
499 									\
500 static void ctx_##name##_rq_list_stop(struct seq_file *m, void *v)	\
501 	__releases(&ctx->lock)						\
502 {									\
503 	struct blk_mq_ctx *ctx = m->private;				\
504 									\
505 	spin_unlock(&ctx->lock);					\
506 }									\
507 									\
508 static const struct seq_operations ctx_##name##_rq_list_seq_ops = {	\
509 	.start	= ctx_##name##_rq_list_start,				\
510 	.next	= ctx_##name##_rq_list_next,				\
511 	.stop	= ctx_##name##_rq_list_stop,				\
512 	.show	= blk_mq_debugfs_rq_show,				\
513 }
514 
515 CTX_RQ_SEQ_OPS(default, HCTX_TYPE_DEFAULT);
516 CTX_RQ_SEQ_OPS(read, HCTX_TYPE_READ);
517 CTX_RQ_SEQ_OPS(poll, HCTX_TYPE_POLL);
518 
blk_mq_debugfs_show(struct seq_file * m,void * v)519 static int blk_mq_debugfs_show(struct seq_file *m, void *v)
520 {
521 	const struct blk_mq_debugfs_attr *attr = m->private;
522 	void *data = d_inode(m->file->f_path.dentry->d_parent)->i_private;
523 
524 	return attr->show(data, m);
525 }
526 
blk_mq_debugfs_write(struct file * file,const char __user * buf,size_t count,loff_t * ppos)527 static ssize_t blk_mq_debugfs_write(struct file *file, const char __user *buf,
528 				    size_t count, loff_t *ppos)
529 {
530 	struct seq_file *m = file->private_data;
531 	const struct blk_mq_debugfs_attr *attr = m->private;
532 	void *data = d_inode(file->f_path.dentry->d_parent)->i_private;
533 
534 	/*
535 	 * Attributes that only implement .seq_ops are read-only and 'attr' is
536 	 * the same with 'data' in this case.
537 	 */
538 	if (attr == data || !attr->write)
539 		return -EPERM;
540 
541 	return attr->write(data, buf, count, ppos);
542 }
543 
blk_mq_debugfs_open(struct inode * inode,struct file * file)544 static int blk_mq_debugfs_open(struct inode *inode, struct file *file)
545 {
546 	const struct blk_mq_debugfs_attr *attr = inode->i_private;
547 	void *data = d_inode(file->f_path.dentry->d_parent)->i_private;
548 	struct seq_file *m;
549 	int ret;
550 
551 	if (attr->seq_ops) {
552 		ret = seq_open(file, attr->seq_ops);
553 		if (!ret) {
554 			m = file->private_data;
555 			m->private = data;
556 		}
557 		return ret;
558 	}
559 
560 	if (WARN_ON_ONCE(!attr->show))
561 		return -EPERM;
562 
563 	return single_open(file, blk_mq_debugfs_show, inode->i_private);
564 }
565 
blk_mq_debugfs_release(struct inode * inode,struct file * file)566 static int blk_mq_debugfs_release(struct inode *inode, struct file *file)
567 {
568 	const struct blk_mq_debugfs_attr *attr = inode->i_private;
569 
570 	if (attr->show)
571 		return single_release(inode, file);
572 
573 	return seq_release(inode, file);
574 }
575 
576 static const struct file_operations blk_mq_debugfs_fops = {
577 	.open		= blk_mq_debugfs_open,
578 	.read		= seq_read,
579 	.write		= blk_mq_debugfs_write,
580 	.llseek		= seq_lseek,
581 	.release	= blk_mq_debugfs_release,
582 };
583 
584 static const struct blk_mq_debugfs_attr blk_mq_debugfs_hctx_attrs[] = {
585 	{"state", 0400, hctx_state_show},
586 	{"flags", 0400, hctx_flags_show},
587 	{"dispatch", 0400, .seq_ops = &hctx_dispatch_seq_ops},
588 	{"busy", 0400, hctx_busy_show},
589 	{"ctx_map", 0400, hctx_ctx_map_show},
590 	{"tags", 0400, hctx_tags_show},
591 	{"tags_bitmap", 0400, hctx_tags_bitmap_show},
592 	{"sched_tags", 0400, hctx_sched_tags_show},
593 	{"sched_tags_bitmap", 0400, hctx_sched_tags_bitmap_show},
594 	{"active", 0400, hctx_active_show},
595 	{"dispatch_busy", 0400, hctx_dispatch_busy_show},
596 	{"type", 0400, hctx_type_show},
597 	{},
598 };
599 
600 static const struct blk_mq_debugfs_attr blk_mq_debugfs_ctx_attrs[] = {
601 	{"default_rq_list", 0400, .seq_ops = &ctx_default_rq_list_seq_ops},
602 	{"read_rq_list", 0400, .seq_ops = &ctx_read_rq_list_seq_ops},
603 	{"poll_rq_list", 0400, .seq_ops = &ctx_poll_rq_list_seq_ops},
604 	{},
605 };
606 
debugfs_create_files(struct dentry * parent,void * data,const struct blk_mq_debugfs_attr * attr)607 static void debugfs_create_files(struct dentry *parent, void *data,
608 				 const struct blk_mq_debugfs_attr *attr)
609 {
610 	if (IS_ERR_OR_NULL(parent))
611 		return;
612 
613 	d_inode(parent)->i_private = data;
614 
615 	for (; attr->name; attr++)
616 		debugfs_create_file(attr->name, attr->mode, parent,
617 				    (void *)attr, &blk_mq_debugfs_fops);
618 }
619 
blk_mq_debugfs_register(struct request_queue * q)620 void blk_mq_debugfs_register(struct request_queue *q)
621 {
622 	struct blk_mq_hw_ctx *hctx;
623 	unsigned long i;
624 
625 	debugfs_create_files(q->debugfs_dir, q, blk_mq_debugfs_queue_attrs);
626 
627 	/*
628 	 * blk_mq_init_sched() attempted to do this already, but q->debugfs_dir
629 	 * didn't exist yet (because we don't know what to name the directory
630 	 * until the queue is registered to a gendisk).
631 	 */
632 	if (q->elevator && !q->sched_debugfs_dir)
633 		blk_mq_debugfs_register_sched(q);
634 
635 	/* Similarly, blk_mq_init_hctx() couldn't do this previously. */
636 	queue_for_each_hw_ctx(q, hctx, i) {
637 		if (!hctx->debugfs_dir)
638 			blk_mq_debugfs_register_hctx(q, hctx);
639 		if (q->elevator && !hctx->sched_debugfs_dir)
640 			blk_mq_debugfs_register_sched_hctx(q, hctx);
641 	}
642 
643 	if (q->rq_qos) {
644 		struct rq_qos *rqos = q->rq_qos;
645 
646 		while (rqos) {
647 			blk_mq_debugfs_register_rqos(rqos);
648 			rqos = rqos->next;
649 		}
650 	}
651 }
652 
blk_mq_debugfs_register_ctx(struct blk_mq_hw_ctx * hctx,struct blk_mq_ctx * ctx)653 static void blk_mq_debugfs_register_ctx(struct blk_mq_hw_ctx *hctx,
654 					struct blk_mq_ctx *ctx)
655 {
656 	struct dentry *ctx_dir;
657 	char name[20];
658 
659 	snprintf(name, sizeof(name), "cpu%u", ctx->cpu);
660 	ctx_dir = debugfs_create_dir(name, hctx->debugfs_dir);
661 
662 	debugfs_create_files(ctx_dir, ctx, blk_mq_debugfs_ctx_attrs);
663 }
664 
blk_mq_debugfs_register_hctx(struct request_queue * q,struct blk_mq_hw_ctx * hctx)665 void blk_mq_debugfs_register_hctx(struct request_queue *q,
666 				  struct blk_mq_hw_ctx *hctx)
667 {
668 	struct blk_mq_ctx *ctx;
669 	char name[20];
670 	int i;
671 
672 	if (!q->debugfs_dir)
673 		return;
674 
675 	snprintf(name, sizeof(name), "hctx%u", hctx->queue_num);
676 	hctx->debugfs_dir = debugfs_create_dir(name, q->debugfs_dir);
677 
678 	debugfs_create_files(hctx->debugfs_dir, hctx, blk_mq_debugfs_hctx_attrs);
679 
680 	hctx_for_each_ctx(hctx, ctx, i)
681 		blk_mq_debugfs_register_ctx(hctx, ctx);
682 }
683 
blk_mq_debugfs_unregister_hctx(struct blk_mq_hw_ctx * hctx)684 void blk_mq_debugfs_unregister_hctx(struct blk_mq_hw_ctx *hctx)
685 {
686 	if (!hctx->queue->debugfs_dir)
687 		return;
688 	debugfs_remove_recursive(hctx->debugfs_dir);
689 	hctx->sched_debugfs_dir = NULL;
690 	hctx->debugfs_dir = NULL;
691 }
692 
blk_mq_debugfs_register_hctxs(struct request_queue * q)693 void blk_mq_debugfs_register_hctxs(struct request_queue *q)
694 {
695 	struct blk_mq_hw_ctx *hctx;
696 	unsigned long i;
697 
698 	queue_for_each_hw_ctx(q, hctx, i)
699 		blk_mq_debugfs_register_hctx(q, hctx);
700 }
701 
blk_mq_debugfs_unregister_hctxs(struct request_queue * q)702 void blk_mq_debugfs_unregister_hctxs(struct request_queue *q)
703 {
704 	struct blk_mq_hw_ctx *hctx;
705 	unsigned long i;
706 
707 	queue_for_each_hw_ctx(q, hctx, i)
708 		blk_mq_debugfs_unregister_hctx(hctx);
709 }
710 
blk_mq_debugfs_register_sched(struct request_queue * q)711 void blk_mq_debugfs_register_sched(struct request_queue *q)
712 {
713 	struct elevator_type *e = q->elevator->type;
714 
715 	lockdep_assert_held(&q->debugfs_mutex);
716 
717 	/*
718 	 * If the parent directory has not been created yet, return, we will be
719 	 * called again later on and the directory/files will be created then.
720 	 */
721 	if (!q->debugfs_dir)
722 		return;
723 
724 	if (!e->queue_debugfs_attrs)
725 		return;
726 
727 	q->sched_debugfs_dir = debugfs_create_dir("sched", q->debugfs_dir);
728 
729 	debugfs_create_files(q->sched_debugfs_dir, q, e->queue_debugfs_attrs);
730 }
731 
blk_mq_debugfs_unregister_sched(struct request_queue * q)732 void blk_mq_debugfs_unregister_sched(struct request_queue *q)
733 {
734 	lockdep_assert_held(&q->debugfs_mutex);
735 
736 	debugfs_remove_recursive(q->sched_debugfs_dir);
737 	q->sched_debugfs_dir = NULL;
738 }
739 
rq_qos_id_to_name(enum rq_qos_id id)740 static const char *rq_qos_id_to_name(enum rq_qos_id id)
741 {
742 	switch (id) {
743 	case RQ_QOS_WBT:
744 		return "wbt";
745 	case RQ_QOS_LATENCY:
746 		return "latency";
747 	case RQ_QOS_COST:
748 		return "cost";
749 	}
750 	return "unknown";
751 }
752 
blk_mq_debugfs_unregister_rqos(struct rq_qos * rqos)753 void blk_mq_debugfs_unregister_rqos(struct rq_qos *rqos)
754 {
755 	lockdep_assert_held(&rqos->disk->queue->debugfs_mutex);
756 
757 	if (!rqos->disk->queue->debugfs_dir)
758 		return;
759 	debugfs_remove_recursive(rqos->debugfs_dir);
760 	rqos->debugfs_dir = NULL;
761 }
762 
blk_mq_debugfs_register_rqos(struct rq_qos * rqos)763 void blk_mq_debugfs_register_rqos(struct rq_qos *rqos)
764 {
765 	struct request_queue *q = rqos->disk->queue;
766 	const char *dir_name = rq_qos_id_to_name(rqos->id);
767 
768 	lockdep_assert_held(&q->debugfs_mutex);
769 
770 	if (rqos->debugfs_dir || !rqos->ops->debugfs_attrs)
771 		return;
772 
773 	if (!q->rqos_debugfs_dir)
774 		q->rqos_debugfs_dir = debugfs_create_dir("rqos",
775 							 q->debugfs_dir);
776 
777 	rqos->debugfs_dir = debugfs_create_dir(dir_name, q->rqos_debugfs_dir);
778 	debugfs_create_files(rqos->debugfs_dir, rqos, rqos->ops->debugfs_attrs);
779 }
780 
blk_mq_debugfs_register_sched_hctx(struct request_queue * q,struct blk_mq_hw_ctx * hctx)781 void blk_mq_debugfs_register_sched_hctx(struct request_queue *q,
782 					struct blk_mq_hw_ctx *hctx)
783 {
784 	struct elevator_type *e = q->elevator->type;
785 
786 	lockdep_assert_held(&q->debugfs_mutex);
787 
788 	/*
789 	 * If the parent debugfs directory has not been created yet, return;
790 	 * We will be called again later on with appropriate parent debugfs
791 	 * directory from blk_register_queue()
792 	 */
793 	if (!hctx->debugfs_dir)
794 		return;
795 
796 	if (!e->hctx_debugfs_attrs)
797 		return;
798 
799 	hctx->sched_debugfs_dir = debugfs_create_dir("sched",
800 						     hctx->debugfs_dir);
801 	debugfs_create_files(hctx->sched_debugfs_dir, hctx,
802 			     e->hctx_debugfs_attrs);
803 }
804 
blk_mq_debugfs_unregister_sched_hctx(struct blk_mq_hw_ctx * hctx)805 void blk_mq_debugfs_unregister_sched_hctx(struct blk_mq_hw_ctx *hctx)
806 {
807 	lockdep_assert_held(&hctx->queue->debugfs_mutex);
808 
809 	if (!hctx->queue->debugfs_dir)
810 		return;
811 	debugfs_remove_recursive(hctx->sched_debugfs_dir);
812 	hctx->sched_debugfs_dir = NULL;
813 }
814