xref: /linux/block/blk-mq-debugfs.c (revision b1d29ba82cf2bc784f4c963ddd6a2cf29e229b33)
1 /*
2  * Copyright (C) 2017 Facebook
3  *
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.
7  *
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.
12  *
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/>.
15  */
16 
17 #include <linux/kernel.h>
18 #include <linux/blkdev.h>
19 #include <linux/debugfs.h>
20 
21 #include <linux/blk-mq.h>
22 #include "blk.h"
23 #include "blk-mq.h"
24 #include "blk-mq-debugfs.h"
25 #include "blk-mq-tag.h"
26 
27 static void print_stat(struct seq_file *m, struct blk_rq_stat *stat)
28 {
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);
32 	} else {
33 		seq_puts(m, "samples=0");
34 	}
35 }
36 
37 static int queue_poll_stat_show(void *data, struct seq_file *m)
38 {
39 	struct request_queue *q = data;
40 	int bucket;
41 
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]);
45 		seq_puts(m, "\n");
46 
47 		seq_printf(m, "write (%d Bytes): ",  1 << (9+bucket));
48 		print_stat(m, &q->poll_stat[2*bucket+1]);
49 		seq_puts(m, "\n");
50 	}
51 	return 0;
52 }
53 
54 static void *queue_requeue_list_start(struct seq_file *m, loff_t *pos)
55 	__acquires(&q->requeue_lock)
56 {
57 	struct request_queue *q = m->private;
58 
59 	spin_lock_irq(&q->requeue_lock);
60 	return seq_list_start(&q->requeue_list, *pos);
61 }
62 
63 static void *queue_requeue_list_next(struct seq_file *m, void *v, loff_t *pos)
64 {
65 	struct request_queue *q = m->private;
66 
67 	return seq_list_next(v, &q->requeue_list, pos);
68 }
69 
70 static void queue_requeue_list_stop(struct seq_file *m, void *v)
71 	__releases(&q->requeue_lock)
72 {
73 	struct request_queue *q = m->private;
74 
75 	spin_unlock_irq(&q->requeue_lock);
76 }
77 
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,
83 };
84 
85 static int blk_flags_show(struct seq_file *m, const unsigned long flags,
86 			  const char *const *flag_name, int flag_name_count)
87 {
88 	bool sep = false;
89 	int i;
90 
91 	for (i = 0; i < sizeof(flags) * BITS_PER_BYTE; i++) {
92 		if (!(flags & BIT(i)))
93 			continue;
94 		if (sep)
95 			seq_puts(m, "|");
96 		sep = true;
97 		if (i < flag_name_count && flag_name[i])
98 			seq_puts(m, flag_name[i]);
99 		else
100 			seq_printf(m, "%d", i);
101 	}
102 	return 0;
103 }
104 
105 static int queue_pm_only_show(void *data, struct seq_file *m)
106 {
107 	struct request_queue *q = data;
108 
109 	seq_printf(m, "%d\n", atomic_read(&q->pm_only));
110 	return 0;
111 }
112 
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),
134 	QUEUE_FLAG_NAME(WC),
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),
143 };
144 #undef QUEUE_FLAG_NAME
145 
146 static int queue_state_show(void *data, struct seq_file *m)
147 {
148 	struct request_queue *q = data;
149 
150 	blk_flags_show(m, q->queue_flags, blk_queue_flag_name,
151 		       ARRAY_SIZE(blk_queue_flag_name));
152 	seq_puts(m, "\n");
153 	return 0;
154 }
155 
156 static ssize_t queue_state_write(void *data, const char __user *buf,
157 				 size_t count, loff_t *ppos)
158 {
159 	struct request_queue *q = data;
160 	char opbuf[16] = { }, *op;
161 
162 	/*
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.
166 	 */
167 	if (blk_queue_dead(q))
168 		return -ENOENT;
169 
170 	if (count >= sizeof(opbuf)) {
171 		pr_err("%s: operation too long\n", __func__);
172 		goto inval;
173 	}
174 
175 	if (copy_from_user(opbuf, buf, count))
176 		return -EFAULT;
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);
184 	} else {
185 		pr_err("%s: unsupported operation '%s'\n", __func__, op);
186 inval:
187 		pr_err("%s: use 'run', 'start' or 'kick'\n", __func__);
188 		return -EINVAL;
189 	}
190 	return count;
191 }
192 
193 static int queue_write_hint_show(void *data, struct seq_file *m)
194 {
195 	struct request_queue *q = data;
196 	int i;
197 
198 	for (i = 0; i < BLK_MAX_WRITE_HINTS; i++)
199 		seq_printf(m, "hint%d: %llu\n", i, q->write_hints[i]);
200 
201 	return 0;
202 }
203 
204 static ssize_t queue_write_hint_store(void *data, const char __user *buf,
205 				      size_t count, loff_t *ppos)
206 {
207 	struct request_queue *q = data;
208 	int i;
209 
210 	for (i = 0; i < BLK_MAX_WRITE_HINTS; i++)
211 		q->write_hints[i] = 0;
212 
213 	return count;
214 }
215 
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 },
223 	{ },
224 };
225 
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),
231 };
232 #undef HCTX_STATE_NAME
233 
234 static int hctx_state_show(void *data, struct seq_file *m)
235 {
236 	struct blk_mq_hw_ctx *hctx = data;
237 
238 	blk_flags_show(m, hctx->state, hctx_state_name,
239 		       ARRAY_SIZE(hctx_state_name));
240 	seq_puts(m, "\n");
241 	return 0;
242 }
243 
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),
248 };
249 #undef BLK_TAG_ALLOC_NAME
250 
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),
258 };
259 #undef HCTX_FLAG_NAME
260 
261 static int hctx_flags_show(void *data, struct seq_file *m)
262 {
263 	struct blk_mq_hw_ctx *hctx = data;
264 	const int alloc_policy = BLK_MQ_FLAG_TO_ALLOC_POLICY(hctx->flags);
265 
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]);
270 	else
271 		seq_printf(m, "%d", alloc_policy);
272 	seq_puts(m, " ");
273 	blk_flags_show(m,
274 		       hctx->flags ^ BLK_ALLOC_POLICY_TO_MQ_FLAG(alloc_policy),
275 		       hctx_flag_name, ARRAY_SIZE(hctx_flag_name));
276 	seq_puts(m, "\n");
277 	return 0;
278 }
279 
280 #define REQ_OP_NAME(name) [REQ_OP_##name] = #name
281 static const char *const op_name[] = {
282 	REQ_OP_NAME(READ),
283 	REQ_OP_NAME(WRITE),
284 	REQ_OP_NAME(FLUSH),
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),
293 	REQ_OP_NAME(DRV_IN),
294 	REQ_OP_NAME(DRV_OUT),
295 };
296 #undef REQ_OP_NAME
297 
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),
303 	CMD_FLAG_NAME(SYNC),
304 	CMD_FLAG_NAME(META),
305 	CMD_FLAG_NAME(PRIO),
306 	CMD_FLAG_NAME(NOMERGE),
307 	CMD_FLAG_NAME(IDLE),
308 	CMD_FLAG_NAME(INTEGRITY),
309 	CMD_FLAG_NAME(FUA),
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),
315 };
316 #undef CMD_FLAG_NAME
317 
318 #define RQF_NAME(name) [ilog2((__force u32)RQF_##name)] = #name
319 static const char *const rqf_name[] = {
320 	RQF_NAME(SORTED),
321 	RQF_NAME(STARTED),
322 	RQF_NAME(QUEUED),
323 	RQF_NAME(SOFTBARRIER),
324 	RQF_NAME(FLUSH_SEQ),
325 	RQF_NAME(MIXED_MERGE),
326 	RQF_NAME(MQ_INFLIGHT),
327 	RQF_NAME(DONTPREP),
328 	RQF_NAME(PREEMPT),
329 	RQF_NAME(COPY_USER),
330 	RQF_NAME(FAILED),
331 	RQF_NAME(QUIET),
332 	RQF_NAME(ELVPRIV),
333 	RQF_NAME(IO_STAT),
334 	RQF_NAME(ALLOCED),
335 	RQF_NAME(PM),
336 	RQF_NAME(HASHED),
337 	RQF_NAME(STATS),
338 	RQF_NAME(SPECIAL_PAYLOAD),
339 	RQF_NAME(ZONE_WRITE_LOCKED),
340 	RQF_NAME(MQ_POLL_SLEPT),
341 };
342 #undef RQF_NAME
343 
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",
348 };
349 
350 static const char *blk_mq_rq_state_name(enum mq_rq_state rq_state)
351 {
352 	if (WARN_ON_ONCE((unsigned int)rq_state >=
353 			 ARRAY_SIZE(blk_mq_rq_state_name_array)))
354 		return "(?)";
355 	return blk_mq_rq_state_name_array[rq_state];
356 }
357 
358 int __blk_mq_debugfs_rq_show(struct seq_file *m, struct request *rq)
359 {
360 	const struct blk_mq_ops *const mq_ops = rq->q->mq_ops;
361 	const unsigned int op = rq->cmd_flags & REQ_OP_MASK;
362 
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]);
366 	else
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,
376 		   rq->internal_tag);
377 	if (mq_ops->show_rq)
378 		mq_ops->show_rq(m, rq);
379 	seq_puts(m, "}\n");
380 	return 0;
381 }
382 EXPORT_SYMBOL_GPL(__blk_mq_debugfs_rq_show);
383 
384 int blk_mq_debugfs_rq_show(struct seq_file *m, void *v)
385 {
386 	return __blk_mq_debugfs_rq_show(m, list_entry_rq(v));
387 }
388 EXPORT_SYMBOL_GPL(blk_mq_debugfs_rq_show);
389 
390 static void *hctx_dispatch_start(struct seq_file *m, loff_t *pos)
391 	__acquires(&hctx->lock)
392 {
393 	struct blk_mq_hw_ctx *hctx = m->private;
394 
395 	spin_lock(&hctx->lock);
396 	return seq_list_start(&hctx->dispatch, *pos);
397 }
398 
399 static void *hctx_dispatch_next(struct seq_file *m, void *v, loff_t *pos)
400 {
401 	struct blk_mq_hw_ctx *hctx = m->private;
402 
403 	return seq_list_next(v, &hctx->dispatch, pos);
404 }
405 
406 static void hctx_dispatch_stop(struct seq_file *m, void *v)
407 	__releases(&hctx->lock)
408 {
409 	struct blk_mq_hw_ctx *hctx = m->private;
410 
411 	spin_unlock(&hctx->lock);
412 }
413 
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,
419 };
420 
421 struct show_busy_params {
422 	struct seq_file		*m;
423 	struct blk_mq_hw_ctx	*hctx;
424 };
425 
426 /*
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.
429  */
430 static void hctx_show_busy_rq(struct request *rq, void *data, bool reserved)
431 {
432 	const struct show_busy_params *params = data;
433 
434 	if (blk_mq_map_queue(rq->q, rq->mq_ctx->cpu) == params->hctx)
435 		__blk_mq_debugfs_rq_show(params->m,
436 					 list_entry_rq(&rq->queuelist));
437 }
438 
439 static int hctx_busy_show(void *data, struct seq_file *m)
440 {
441 	struct blk_mq_hw_ctx *hctx = data;
442 	struct show_busy_params params = { .m = m, .hctx = hctx };
443 
444 	blk_mq_tagset_busy_iter(hctx->queue->tag_set, hctx_show_busy_rq,
445 				&params);
446 
447 	return 0;
448 }
449 
450 static int hctx_ctx_map_show(void *data, struct seq_file *m)
451 {
452 	struct blk_mq_hw_ctx *hctx = data;
453 
454 	sbitmap_bitmap_show(&hctx->ctx_map, m);
455 	return 0;
456 }
457 
458 static void blk_mq_debugfs_tags_show(struct seq_file *m,
459 				     struct blk_mq_tags *tags)
460 {
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));
465 
466 	seq_puts(m, "\nbitmap_tags:\n");
467 	sbitmap_queue_show(&tags->bitmap_tags, m);
468 
469 	if (tags->nr_reserved_tags) {
470 		seq_puts(m, "\nbreserved_tags:\n");
471 		sbitmap_queue_show(&tags->breserved_tags, m);
472 	}
473 }
474 
475 static int hctx_tags_show(void *data, struct seq_file *m)
476 {
477 	struct blk_mq_hw_ctx *hctx = data;
478 	struct request_queue *q = hctx->queue;
479 	int res;
480 
481 	res = mutex_lock_interruptible(&q->sysfs_lock);
482 	if (res)
483 		goto out;
484 	if (hctx->tags)
485 		blk_mq_debugfs_tags_show(m, hctx->tags);
486 	mutex_unlock(&q->sysfs_lock);
487 
488 out:
489 	return res;
490 }
491 
492 static int hctx_tags_bitmap_show(void *data, struct seq_file *m)
493 {
494 	struct blk_mq_hw_ctx *hctx = data;
495 	struct request_queue *q = hctx->queue;
496 	int res;
497 
498 	res = mutex_lock_interruptible(&q->sysfs_lock);
499 	if (res)
500 		goto out;
501 	if (hctx->tags)
502 		sbitmap_bitmap_show(&hctx->tags->bitmap_tags.sb, m);
503 	mutex_unlock(&q->sysfs_lock);
504 
505 out:
506 	return res;
507 }
508 
509 static int hctx_sched_tags_show(void *data, struct seq_file *m)
510 {
511 	struct blk_mq_hw_ctx *hctx = data;
512 	struct request_queue *q = hctx->queue;
513 	int res;
514 
515 	res = mutex_lock_interruptible(&q->sysfs_lock);
516 	if (res)
517 		goto out;
518 	if (hctx->sched_tags)
519 		blk_mq_debugfs_tags_show(m, hctx->sched_tags);
520 	mutex_unlock(&q->sysfs_lock);
521 
522 out:
523 	return res;
524 }
525 
526 static int hctx_sched_tags_bitmap_show(void *data, struct seq_file *m)
527 {
528 	struct blk_mq_hw_ctx *hctx = data;
529 	struct request_queue *q = hctx->queue;
530 	int res;
531 
532 	res = mutex_lock_interruptible(&q->sysfs_lock);
533 	if (res)
534 		goto out;
535 	if (hctx->sched_tags)
536 		sbitmap_bitmap_show(&hctx->sched_tags->bitmap_tags.sb, m);
537 	mutex_unlock(&q->sysfs_lock);
538 
539 out:
540 	return res;
541 }
542 
543 static int hctx_io_poll_show(void *data, struct seq_file *m)
544 {
545 	struct blk_mq_hw_ctx *hctx = data;
546 
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);
550 	return 0;
551 }
552 
553 static ssize_t hctx_io_poll_write(void *data, const char __user *buf,
554 				  size_t count, loff_t *ppos)
555 {
556 	struct blk_mq_hw_ctx *hctx = data;
557 
558 	hctx->poll_considered = hctx->poll_invoked = hctx->poll_success = 0;
559 	return count;
560 }
561 
562 static int hctx_dispatched_show(void *data, struct seq_file *m)
563 {
564 	struct blk_mq_hw_ctx *hctx = data;
565 	int i;
566 
567 	seq_printf(m, "%8u\t%lu\n", 0U, hctx->dispatched[0]);
568 
569 	for (i = 1; i < BLK_MQ_MAX_DISPATCH_ORDER - 1; i++) {
570 		unsigned int d = 1U << (i - 1);
571 
572 		seq_printf(m, "%8u\t%lu\n", d, hctx->dispatched[i]);
573 	}
574 
575 	seq_printf(m, "%8u+\t%lu\n", 1U << (i - 1), hctx->dispatched[i]);
576 	return 0;
577 }
578 
579 static ssize_t hctx_dispatched_write(void *data, const char __user *buf,
580 				     size_t count, loff_t *ppos)
581 {
582 	struct blk_mq_hw_ctx *hctx = data;
583 	int i;
584 
585 	for (i = 0; i < BLK_MQ_MAX_DISPATCH_ORDER; i++)
586 		hctx->dispatched[i] = 0;
587 	return count;
588 }
589 
590 static int hctx_queued_show(void *data, struct seq_file *m)
591 {
592 	struct blk_mq_hw_ctx *hctx = data;
593 
594 	seq_printf(m, "%lu\n", hctx->queued);
595 	return 0;
596 }
597 
598 static ssize_t hctx_queued_write(void *data, const char __user *buf,
599 				 size_t count, loff_t *ppos)
600 {
601 	struct blk_mq_hw_ctx *hctx = data;
602 
603 	hctx->queued = 0;
604 	return count;
605 }
606 
607 static int hctx_run_show(void *data, struct seq_file *m)
608 {
609 	struct blk_mq_hw_ctx *hctx = data;
610 
611 	seq_printf(m, "%lu\n", hctx->run);
612 	return 0;
613 }
614 
615 static ssize_t hctx_run_write(void *data, const char __user *buf, size_t count,
616 			      loff_t *ppos)
617 {
618 	struct blk_mq_hw_ctx *hctx = data;
619 
620 	hctx->run = 0;
621 	return count;
622 }
623 
624 static int hctx_active_show(void *data, struct seq_file *m)
625 {
626 	struct blk_mq_hw_ctx *hctx = data;
627 
628 	seq_printf(m, "%d\n", atomic_read(&hctx->nr_active));
629 	return 0;
630 }
631 
632 static int hctx_dispatch_busy_show(void *data, struct seq_file *m)
633 {
634 	struct blk_mq_hw_ctx *hctx = data;
635 
636 	seq_printf(m, "%u\n", hctx->dispatch_busy);
637 	return 0;
638 }
639 
640 static void *ctx_rq_list_start(struct seq_file *m, loff_t *pos)
641 	__acquires(&ctx->lock)
642 {
643 	struct blk_mq_ctx *ctx = m->private;
644 
645 	spin_lock(&ctx->lock);
646 	return seq_list_start(&ctx->rq_list, *pos);
647 }
648 
649 static void *ctx_rq_list_next(struct seq_file *m, void *v, loff_t *pos)
650 {
651 	struct blk_mq_ctx *ctx = m->private;
652 
653 	return seq_list_next(v, &ctx->rq_list, pos);
654 }
655 
656 static void ctx_rq_list_stop(struct seq_file *m, void *v)
657 	__releases(&ctx->lock)
658 {
659 	struct blk_mq_ctx *ctx = m->private;
660 
661 	spin_unlock(&ctx->lock);
662 }
663 
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,
669 };
670 static int ctx_dispatched_show(void *data, struct seq_file *m)
671 {
672 	struct blk_mq_ctx *ctx = data;
673 
674 	seq_printf(m, "%lu %lu\n", ctx->rq_dispatched[1], ctx->rq_dispatched[0]);
675 	return 0;
676 }
677 
678 static ssize_t ctx_dispatched_write(void *data, const char __user *buf,
679 				    size_t count, loff_t *ppos)
680 {
681 	struct blk_mq_ctx *ctx = data;
682 
683 	ctx->rq_dispatched[0] = ctx->rq_dispatched[1] = 0;
684 	return count;
685 }
686 
687 static int ctx_merged_show(void *data, struct seq_file *m)
688 {
689 	struct blk_mq_ctx *ctx = data;
690 
691 	seq_printf(m, "%lu\n", ctx->rq_merged);
692 	return 0;
693 }
694 
695 static ssize_t ctx_merged_write(void *data, const char __user *buf,
696 				size_t count, loff_t *ppos)
697 {
698 	struct blk_mq_ctx *ctx = data;
699 
700 	ctx->rq_merged = 0;
701 	return count;
702 }
703 
704 static int ctx_completed_show(void *data, struct seq_file *m)
705 {
706 	struct blk_mq_ctx *ctx = data;
707 
708 	seq_printf(m, "%lu %lu\n", ctx->rq_completed[1], ctx->rq_completed[0]);
709 	return 0;
710 }
711 
712 static ssize_t ctx_completed_write(void *data, const char __user *buf,
713 				   size_t count, loff_t *ppos)
714 {
715 	struct blk_mq_ctx *ctx = data;
716 
717 	ctx->rq_completed[0] = ctx->rq_completed[1] = 0;
718 	return count;
719 }
720 
721 static int blk_mq_debugfs_show(struct seq_file *m, void *v)
722 {
723 	const struct blk_mq_debugfs_attr *attr = m->private;
724 	void *data = d_inode(m->file->f_path.dentry->d_parent)->i_private;
725 
726 	return attr->show(data, m);
727 }
728 
729 static ssize_t blk_mq_debugfs_write(struct file *file, const char __user *buf,
730 				    size_t count, loff_t *ppos)
731 {
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;
735 
736 	/*
737 	 * Attributes that only implement .seq_ops are read-only and 'attr' is
738 	 * the same with 'data' in this case.
739 	 */
740 	if (attr == data || !attr->write)
741 		return -EPERM;
742 
743 	return attr->write(data, buf, count, ppos);
744 }
745 
746 static int blk_mq_debugfs_open(struct inode *inode, struct file *file)
747 {
748 	const struct blk_mq_debugfs_attr *attr = inode->i_private;
749 	void *data = d_inode(file->f_path.dentry->d_parent)->i_private;
750 	struct seq_file *m;
751 	int ret;
752 
753 	if (attr->seq_ops) {
754 		ret = seq_open(file, attr->seq_ops);
755 		if (!ret) {
756 			m = file->private_data;
757 			m->private = data;
758 		}
759 		return ret;
760 	}
761 
762 	if (WARN_ON_ONCE(!attr->show))
763 		return -EPERM;
764 
765 	return single_open(file, blk_mq_debugfs_show, inode->i_private);
766 }
767 
768 static int blk_mq_debugfs_release(struct inode *inode, struct file *file)
769 {
770 	const struct blk_mq_debugfs_attr *attr = inode->i_private;
771 
772 	if (attr->show)
773 		return single_release(inode, file);
774 	else
775 		return seq_release(inode, file);
776 }
777 
778 static const struct file_operations blk_mq_debugfs_fops = {
779 	.open		= blk_mq_debugfs_open,
780 	.read		= seq_read,
781 	.write		= blk_mq_debugfs_write,
782 	.llseek		= seq_lseek,
783 	.release	= blk_mq_debugfs_release,
784 };
785 
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},
802 	{},
803 };
804 
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},
810 	{},
811 };
812 
813 static bool debugfs_create_files(struct dentry *parent, void *data,
814 				 const struct blk_mq_debugfs_attr *attr)
815 {
816 	d_inode(parent)->i_private = data;
817 
818 	for (; attr->name; attr++) {
819 		if (!debugfs_create_file(attr->name, attr->mode, parent,
820 					 (void *)attr, &blk_mq_debugfs_fops))
821 			return false;
822 	}
823 	return true;
824 }
825 
826 int blk_mq_debugfs_register(struct request_queue *q)
827 {
828 	struct blk_mq_hw_ctx *hctx;
829 	int i;
830 
831 	if (!blk_debugfs_root)
832 		return -ENOENT;
833 
834 	q->debugfs_dir = debugfs_create_dir(kobject_name(q->kobj.parent),
835 					    blk_debugfs_root);
836 	if (!q->debugfs_dir)
837 		return -ENOMEM;
838 
839 	if (!debugfs_create_files(q->debugfs_dir, q,
840 				  blk_mq_debugfs_queue_attrs))
841 		goto err;
842 
843 	/*
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).
847 	 */
848 	if (q->elevator && !q->sched_debugfs_dir)
849 		blk_mq_debugfs_register_sched(q);
850 
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))
854 			goto err;
855 		if (q->elevator && !hctx->sched_debugfs_dir &&
856 		    blk_mq_debugfs_register_sched_hctx(q, hctx))
857 			goto err;
858 	}
859 
860 	return 0;
861 
862 err:
863 	blk_mq_debugfs_unregister(q);
864 	return -ENOMEM;
865 }
866 
867 void blk_mq_debugfs_unregister(struct request_queue *q)
868 {
869 	debugfs_remove_recursive(q->debugfs_dir);
870 	q->sched_debugfs_dir = NULL;
871 	q->debugfs_dir = NULL;
872 }
873 
874 static int blk_mq_debugfs_register_ctx(struct blk_mq_hw_ctx *hctx,
875 				       struct blk_mq_ctx *ctx)
876 {
877 	struct dentry *ctx_dir;
878 	char name[20];
879 
880 	snprintf(name, sizeof(name), "cpu%u", ctx->cpu);
881 	ctx_dir = debugfs_create_dir(name, hctx->debugfs_dir);
882 	if (!ctx_dir)
883 		return -ENOMEM;
884 
885 	if (!debugfs_create_files(ctx_dir, ctx, blk_mq_debugfs_ctx_attrs))
886 		return -ENOMEM;
887 
888 	return 0;
889 }
890 
891 int blk_mq_debugfs_register_hctx(struct request_queue *q,
892 				 struct blk_mq_hw_ctx *hctx)
893 {
894 	struct blk_mq_ctx *ctx;
895 	char name[20];
896 	int i;
897 
898 	if (!q->debugfs_dir)
899 		return -ENOENT;
900 
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)
904 		return -ENOMEM;
905 
906 	if (!debugfs_create_files(hctx->debugfs_dir, hctx,
907 				  blk_mq_debugfs_hctx_attrs))
908 		goto err;
909 
910 	hctx_for_each_ctx(hctx, ctx, i) {
911 		if (blk_mq_debugfs_register_ctx(hctx, ctx))
912 			goto err;
913 	}
914 
915 	return 0;
916 
917 err:
918 	blk_mq_debugfs_unregister_hctx(hctx);
919 	return -ENOMEM;
920 }
921 
922 void blk_mq_debugfs_unregister_hctx(struct blk_mq_hw_ctx *hctx)
923 {
924 	debugfs_remove_recursive(hctx->debugfs_dir);
925 	hctx->sched_debugfs_dir = NULL;
926 	hctx->debugfs_dir = NULL;
927 }
928 
929 int blk_mq_debugfs_register_hctxs(struct request_queue *q)
930 {
931 	struct blk_mq_hw_ctx *hctx;
932 	int i;
933 
934 	queue_for_each_hw_ctx(q, hctx, i) {
935 		if (blk_mq_debugfs_register_hctx(q, hctx))
936 			return -ENOMEM;
937 	}
938 
939 	return 0;
940 }
941 
942 void blk_mq_debugfs_unregister_hctxs(struct request_queue *q)
943 {
944 	struct blk_mq_hw_ctx *hctx;
945 	int i;
946 
947 	queue_for_each_hw_ctx(q, hctx, i)
948 		blk_mq_debugfs_unregister_hctx(hctx);
949 }
950 
951 int blk_mq_debugfs_register_sched(struct request_queue *q)
952 {
953 	struct elevator_type *e = q->elevator->type;
954 
955 	if (!q->debugfs_dir)
956 		return -ENOENT;
957 
958 	if (!e->queue_debugfs_attrs)
959 		return 0;
960 
961 	q->sched_debugfs_dir = debugfs_create_dir("sched", q->debugfs_dir);
962 	if (!q->sched_debugfs_dir)
963 		return -ENOMEM;
964 
965 	if (!debugfs_create_files(q->sched_debugfs_dir, q,
966 				  e->queue_debugfs_attrs))
967 		goto err;
968 
969 	return 0;
970 
971 err:
972 	blk_mq_debugfs_unregister_sched(q);
973 	return -ENOMEM;
974 }
975 
976 void blk_mq_debugfs_unregister_sched(struct request_queue *q)
977 {
978 	debugfs_remove_recursive(q->sched_debugfs_dir);
979 	q->sched_debugfs_dir = NULL;
980 }
981 
982 int blk_mq_debugfs_register_sched_hctx(struct request_queue *q,
983 				       struct blk_mq_hw_ctx *hctx)
984 {
985 	struct elevator_type *e = q->elevator->type;
986 
987 	if (!hctx->debugfs_dir)
988 		return -ENOENT;
989 
990 	if (!e->hctx_debugfs_attrs)
991 		return 0;
992 
993 	hctx->sched_debugfs_dir = debugfs_create_dir("sched",
994 						     hctx->debugfs_dir);
995 	if (!hctx->sched_debugfs_dir)
996 		return -ENOMEM;
997 
998 	if (!debugfs_create_files(hctx->sched_debugfs_dir, hctx,
999 				  e->hctx_debugfs_attrs))
1000 		return -ENOMEM;
1001 
1002 	return 0;
1003 }
1004 
1005 void blk_mq_debugfs_unregister_sched_hctx(struct blk_mq_hw_ctx *hctx)
1006 {
1007 	debugfs_remove_recursive(hctx->sched_debugfs_dir);
1008 	hctx->sched_debugfs_dir = NULL;
1009 }
1010