blk-mq-debugfs.c 19.2 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
/*
 * Copyright (C) 2017 Facebook
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public
 * License v2 as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */

#include <linux/kernel.h>
#include <linux/blkdev.h>
#include <linux/debugfs.h>

#include <linux/blk-mq.h>
22
#include "blk.h"
23
#include "blk-mq.h"
24
#include "blk-mq-tag.h"
25 26 27 28

struct blk_mq_debugfs_attr {
	const char *name;
	umode_t mode;
29 30 31 32
	int (*show)(void *, struct seq_file *);
	ssize_t (*write)(void *, const char __user *, size_t, loff_t *);
	/* Set either .show or .seq_ops. */
	const struct seq_operations *seq_ops;
33 34
};

35 36 37 38 39 40 41 42 43 44
static int blk_flags_show(struct seq_file *m, const unsigned long flags,
			  const char *const *flag_name, int flag_name_count)
{
	bool sep = false;
	int i;

	for (i = 0; i < sizeof(flags) * BITS_PER_BYTE; i++) {
		if (!(flags & BIT(i)))
			continue;
		if (sep)
45
			seq_puts(m, "|");
46 47 48 49 50 51 52 53 54
		sep = true;
		if (i < flag_name_count && flag_name[i])
			seq_puts(m, flag_name[i]);
		else
			seq_printf(m, "%d", i);
	}
	return 0;
}

55
#define QUEUE_FLAG_NAME(name) [QUEUE_FLAG_##name] = #name
56
static const char *const blk_queue_flag_name[] = {
57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85
	QUEUE_FLAG_NAME(QUEUED),
	QUEUE_FLAG_NAME(STOPPED),
	QUEUE_FLAG_NAME(SYNCFULL),
	QUEUE_FLAG_NAME(ASYNCFULL),
	QUEUE_FLAG_NAME(DYING),
	QUEUE_FLAG_NAME(BYPASS),
	QUEUE_FLAG_NAME(BIDI),
	QUEUE_FLAG_NAME(NOMERGES),
	QUEUE_FLAG_NAME(SAME_COMP),
	QUEUE_FLAG_NAME(FAIL_IO),
	QUEUE_FLAG_NAME(STACKABLE),
	QUEUE_FLAG_NAME(NONROT),
	QUEUE_FLAG_NAME(IO_STAT),
	QUEUE_FLAG_NAME(DISCARD),
	QUEUE_FLAG_NAME(NOXMERGES),
	QUEUE_FLAG_NAME(ADD_RANDOM),
	QUEUE_FLAG_NAME(SECERASE),
	QUEUE_FLAG_NAME(SAME_FORCE),
	QUEUE_FLAG_NAME(DEAD),
	QUEUE_FLAG_NAME(INIT_DONE),
	QUEUE_FLAG_NAME(NO_SG_MERGE),
	QUEUE_FLAG_NAME(POLL),
	QUEUE_FLAG_NAME(WC),
	QUEUE_FLAG_NAME(FUA),
	QUEUE_FLAG_NAME(FLUSH_NQ),
	QUEUE_FLAG_NAME(DAX),
	QUEUE_FLAG_NAME(STATS),
	QUEUE_FLAG_NAME(POLL_STATS),
	QUEUE_FLAG_NAME(REGISTERED),
86
};
87
#undef QUEUE_FLAG_NAME
88

89
static int queue_state_show(void *data, struct seq_file *m)
90
{
91
	struct request_queue *q = data;
92 93 94

	blk_flags_show(m, q->queue_flags, blk_queue_flag_name,
		       ARRAY_SIZE(blk_queue_flag_name));
95
	seq_puts(m, "\n");
96 97 98
	return 0;
}

99 100
static ssize_t queue_state_write(void *data, const char __user *buf,
				 size_t count, loff_t *ppos)
101
{
102
	struct request_queue *q = data;
103
	char opbuf[16] = { }, *op;
104

105 106 107 108 109 110 111 112
	/*
	 * The "state" attribute is removed after blk_cleanup_queue() has called
	 * blk_mq_free_queue(). Return if QUEUE_FLAG_DEAD has been set to avoid
	 * triggering a use-after-free.
	 */
	if (blk_queue_dead(q))
		return -ENOENT;

113
	if (count >= sizeof(opbuf)) {
114 115 116 117
		pr_err("%s: operation too long\n", __func__);
		goto inval;
	}

118
	if (copy_from_user(opbuf, buf, count))
119
		return -EFAULT;
120
	op = strstrip(opbuf);
121 122 123 124 125
	if (strcmp(op, "run") == 0) {
		blk_mq_run_hw_queues(q, true);
	} else if (strcmp(op, "start") == 0) {
		blk_mq_start_stopped_hw_queues(q, true);
	} else {
126 127 128
		pr_err("%s: unsupported operation '%s'\n", __func__, op);
inval:
		pr_err("%s: use either 'run' or 'start'\n", __func__);
129 130
		return -EINVAL;
	}
131
	return count;
132 133
}

134 135 136 137 138 139 140 141 142 143
static void print_stat(struct seq_file *m, struct blk_rq_stat *stat)
{
	if (stat->nr_samples) {
		seq_printf(m, "samples=%d, mean=%lld, min=%llu, max=%llu",
			   stat->nr_samples, stat->mean, stat->min, stat->max);
	} else {
		seq_puts(m, "samples=0");
	}
}

144
static int queue_poll_stat_show(void *data, struct seq_file *m)
145
{
146
	struct request_queue *q = data;
147
	int bucket;
148

149 150 151 152
	for (bucket = 0; bucket < BLK_MQ_POLL_STATS_BKTS/2; bucket++) {
		seq_printf(m, "read  (%d Bytes): ", 1 << (9+bucket));
		print_stat(m, &q->poll_stat[2*bucket]);
		seq_puts(m, "\n");
153

154 155 156 157
		seq_printf(m, "write (%d Bytes): ",  1 << (9+bucket));
		print_stat(m, &q->poll_stat[2*bucket+1]);
		seq_puts(m, "\n");
	}
158 159 160
	return 0;
}

161
#define HCTX_STATE_NAME(name) [BLK_MQ_S_##name] = #name
162
static const char *const hctx_state_name[] = {
163 164 165 166 167
	HCTX_STATE_NAME(STOPPED),
	HCTX_STATE_NAME(TAG_ACTIVE),
	HCTX_STATE_NAME(SCHED_RESTART),
	HCTX_STATE_NAME(TAG_WAITING),
	HCTX_STATE_NAME(START_ON_RUN),
168
};
169 170
#undef HCTX_STATE_NAME

171
static int hctx_state_show(void *data, struct seq_file *m)
172
{
173
	struct blk_mq_hw_ctx *hctx = data;
174

175 176
	blk_flags_show(m, hctx->state, hctx_state_name,
		       ARRAY_SIZE(hctx_state_name));
177
	seq_puts(m, "\n");
178 179 180
	return 0;
}

181
#define BLK_TAG_ALLOC_NAME(name) [BLK_TAG_ALLOC_##name] = #name
182
static const char *const alloc_policy_name[] = {
183 184
	BLK_TAG_ALLOC_NAME(FIFO),
	BLK_TAG_ALLOC_NAME(RR),
185
};
186
#undef BLK_TAG_ALLOC_NAME
187

188
#define HCTX_FLAG_NAME(name) [ilog2(BLK_MQ_F_##name)] = #name
189
static const char *const hctx_flag_name[] = {
190 191 192 193 194
	HCTX_FLAG_NAME(SHOULD_MERGE),
	HCTX_FLAG_NAME(TAG_SHARED),
	HCTX_FLAG_NAME(SG_MERGE),
	HCTX_FLAG_NAME(BLOCKING),
	HCTX_FLAG_NAME(NO_SCHED),
195
};
196
#undef HCTX_FLAG_NAME
197

198
static int hctx_flags_show(void *data, struct seq_file *m)
199
{
200
	struct blk_mq_hw_ctx *hctx = data;
201
	const int alloc_policy = BLK_MQ_FLAG_TO_ALLOC_POLICY(hctx->flags);
202

203 204 205 206 207 208 209 210 211 212
	seq_puts(m, "alloc_policy=");
	if (alloc_policy < ARRAY_SIZE(alloc_policy_name) &&
	    alloc_policy_name[alloc_policy])
		seq_puts(m, alloc_policy_name[alloc_policy]);
	else
		seq_printf(m, "%d", alloc_policy);
	seq_puts(m, " ");
	blk_flags_show(m,
		       hctx->flags ^ BLK_ALLOC_POLICY_TO_MQ_FLAG(alloc_policy),
		       hctx_flag_name, ARRAY_SIZE(hctx_flag_name));
213
	seq_puts(m, "\n");
214 215 216
	return 0;
}

217
#define REQ_OP_NAME(name) [REQ_OP_##name] = #name
218
static const char *const op_name[] = {
219 220 221 222 223 224 225 226 227 228 229 230 231
	REQ_OP_NAME(READ),
	REQ_OP_NAME(WRITE),
	REQ_OP_NAME(FLUSH),
	REQ_OP_NAME(DISCARD),
	REQ_OP_NAME(ZONE_REPORT),
	REQ_OP_NAME(SECURE_ERASE),
	REQ_OP_NAME(ZONE_RESET),
	REQ_OP_NAME(WRITE_SAME),
	REQ_OP_NAME(WRITE_ZEROES),
	REQ_OP_NAME(SCSI_IN),
	REQ_OP_NAME(SCSI_OUT),
	REQ_OP_NAME(DRV_IN),
	REQ_OP_NAME(DRV_OUT),
232
};
233
#undef REQ_OP_NAME
234

235
#define CMD_FLAG_NAME(name) [__REQ_##name] = #name
236
static const char *const cmd_flag_name[] = {
237 238 239 240 241 242 243 244 245 246 247 248 249 250
	CMD_FLAG_NAME(FAILFAST_DEV),
	CMD_FLAG_NAME(FAILFAST_TRANSPORT),
	CMD_FLAG_NAME(FAILFAST_DRIVER),
	CMD_FLAG_NAME(SYNC),
	CMD_FLAG_NAME(META),
	CMD_FLAG_NAME(PRIO),
	CMD_FLAG_NAME(NOMERGE),
	CMD_FLAG_NAME(IDLE),
	CMD_FLAG_NAME(INTEGRITY),
	CMD_FLAG_NAME(FUA),
	CMD_FLAG_NAME(PREFLUSH),
	CMD_FLAG_NAME(RAHEAD),
	CMD_FLAG_NAME(BACKGROUND),
	CMD_FLAG_NAME(NOUNMAP),
251
};
252
#undef CMD_FLAG_NAME
253

254
#define RQF_NAME(name) [ilog2((__force u32)RQF_##name)] = #name
255
static const char *const rqf_name[] = {
256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274
	RQF_NAME(SORTED),
	RQF_NAME(STARTED),
	RQF_NAME(QUEUED),
	RQF_NAME(SOFTBARRIER),
	RQF_NAME(FLUSH_SEQ),
	RQF_NAME(MIXED_MERGE),
	RQF_NAME(MQ_INFLIGHT),
	RQF_NAME(DONTPREP),
	RQF_NAME(PREEMPT),
	RQF_NAME(COPY_USER),
	RQF_NAME(FAILED),
	RQF_NAME(QUIET),
	RQF_NAME(ELVPRIV),
	RQF_NAME(IO_STAT),
	RQF_NAME(ALLOCED),
	RQF_NAME(PM),
	RQF_NAME(HASHED),
	RQF_NAME(STATS),
	RQF_NAME(SPECIAL_PAYLOAD),
275
};
276
#undef RQF_NAME
277

278 279 280
static int blk_mq_debugfs_rq_show(struct seq_file *m, void *v)
{
	struct request *rq = list_entry_rq(v);
281
	const struct blk_mq_ops *const mq_ops = rq->q->mq_ops;
282
	const unsigned int op = rq->cmd_flags & REQ_OP_MASK;
283

284 285 286 287 288 289 290 291 292 293 294
	seq_printf(m, "%p {.op=", rq);
	if (op < ARRAY_SIZE(op_name) && op_name[op])
		seq_printf(m, "%s", op_name[op]);
	else
		seq_printf(m, "%d", op);
	seq_puts(m, ", .cmd_flags=");
	blk_flags_show(m, rq->cmd_flags & ~REQ_OP_MASK, cmd_flag_name,
		       ARRAY_SIZE(cmd_flag_name));
	seq_puts(m, ", .rq_flags=");
	blk_flags_show(m, (__force unsigned int)rq->rq_flags, rqf_name,
		       ARRAY_SIZE(rqf_name));
295
	seq_printf(m, ", .tag=%d, .internal_tag=%d", rq->tag,
296
		   rq->internal_tag);
297 298 299
	if (mq_ops->show_rq)
		mq_ops->show_rq(m, rq);
	seq_puts(m, "}\n");
300 301 302 303
	return 0;
}

static void *hctx_dispatch_start(struct seq_file *m, loff_t *pos)
304
	__acquires(&hctx->lock)
305 306 307 308 309 310 311 312 313 314 315 316 317 318 319
{
	struct blk_mq_hw_ctx *hctx = m->private;

	spin_lock(&hctx->lock);
	return seq_list_start(&hctx->dispatch, *pos);
}

static void *hctx_dispatch_next(struct seq_file *m, void *v, loff_t *pos)
{
	struct blk_mq_hw_ctx *hctx = m->private;

	return seq_list_next(v, &hctx->dispatch, pos);
}

static void hctx_dispatch_stop(struct seq_file *m, void *v)
320
	__releases(&hctx->lock)
321 322 323 324 325 326 327 328 329 330 331 332 333
{
	struct blk_mq_hw_ctx *hctx = m->private;

	spin_unlock(&hctx->lock);
}

static const struct seq_operations hctx_dispatch_seq_ops = {
	.start	= hctx_dispatch_start,
	.next	= hctx_dispatch_next,
	.stop	= hctx_dispatch_stop,
	.show	= blk_mq_debugfs_rq_show,
};

334
static int hctx_ctx_map_show(void *data, struct seq_file *m)
335
{
336
	struct blk_mq_hw_ctx *hctx = data;
337 338 339 340 341

	sbitmap_bitmap_show(&hctx->ctx_map, m);
	return 0;
}

342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358
static void blk_mq_debugfs_tags_show(struct seq_file *m,
				     struct blk_mq_tags *tags)
{
	seq_printf(m, "nr_tags=%u\n", tags->nr_tags);
	seq_printf(m, "nr_reserved_tags=%u\n", tags->nr_reserved_tags);
	seq_printf(m, "active_queues=%d\n",
		   atomic_read(&tags->active_queues));

	seq_puts(m, "\nbitmap_tags:\n");
	sbitmap_queue_show(&tags->bitmap_tags, m);

	if (tags->nr_reserved_tags) {
		seq_puts(m, "\nbreserved_tags:\n");
		sbitmap_queue_show(&tags->breserved_tags, m);
	}
}

359
static int hctx_tags_show(void *data, struct seq_file *m)
360
{
361
	struct blk_mq_hw_ctx *hctx = data;
362
	struct request_queue *q = hctx->queue;
363
	int res;
364

365 366 367
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
368 369 370 371
	if (hctx->tags)
		blk_mq_debugfs_tags_show(m, hctx->tags);
	mutex_unlock(&q->sysfs_lock);

372 373
out:
	return res;
374 375
}

376
static int hctx_tags_bitmap_show(void *data, struct seq_file *m)
377
{
378
	struct blk_mq_hw_ctx *hctx = data;
379
	struct request_queue *q = hctx->queue;
380
	int res;
381

382 383 384
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
385 386 387
	if (hctx->tags)
		sbitmap_bitmap_show(&hctx->tags->bitmap_tags.sb, m);
	mutex_unlock(&q->sysfs_lock);
388 389 390

out:
	return res;
391 392
}

393
static int hctx_sched_tags_show(void *data, struct seq_file *m)
394
{
395
	struct blk_mq_hw_ctx *hctx = data;
396
	struct request_queue *q = hctx->queue;
397
	int res;
398

399 400 401
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
402 403 404 405
	if (hctx->sched_tags)
		blk_mq_debugfs_tags_show(m, hctx->sched_tags);
	mutex_unlock(&q->sysfs_lock);

406 407
out:
	return res;
408 409
}

410
static int hctx_sched_tags_bitmap_show(void *data, struct seq_file *m)
411
{
412
	struct blk_mq_hw_ctx *hctx = data;
413
	struct request_queue *q = hctx->queue;
414
	int res;
415

416 417 418
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
419 420 421
	if (hctx->sched_tags)
		sbitmap_bitmap_show(&hctx->sched_tags->bitmap_tags.sb, m);
	mutex_unlock(&q->sysfs_lock);
422 423 424

out:
	return res;
425 426
}

427
static int hctx_io_poll_show(void *data, struct seq_file *m)
428
{
429
	struct blk_mq_hw_ctx *hctx = data;
430 431 432 433 434 435 436

	seq_printf(m, "considered=%lu\n", hctx->poll_considered);
	seq_printf(m, "invoked=%lu\n", hctx->poll_invoked);
	seq_printf(m, "success=%lu\n", hctx->poll_success);
	return 0;
}

437
static ssize_t hctx_io_poll_write(void *data, const char __user *buf,
438 439
				  size_t count, loff_t *ppos)
{
440
	struct blk_mq_hw_ctx *hctx = data;
441 442 443 444 445

	hctx->poll_considered = hctx->poll_invoked = hctx->poll_success = 0;
	return count;
}

446
static int hctx_dispatched_show(void *data, struct seq_file *m)
447
{
448
	struct blk_mq_hw_ctx *hctx = data;
449 450 451 452 453 454 455 456 457 458 459 460 461 462
	int i;

	seq_printf(m, "%8u\t%lu\n", 0U, hctx->dispatched[0]);

	for (i = 1; i < BLK_MQ_MAX_DISPATCH_ORDER - 1; i++) {
		unsigned int d = 1U << (i - 1);

		seq_printf(m, "%8u\t%lu\n", d, hctx->dispatched[i]);
	}

	seq_printf(m, "%8u+\t%lu\n", 1U << (i - 1), hctx->dispatched[i]);
	return 0;
}

463
static ssize_t hctx_dispatched_write(void *data, const char __user *buf,
464 465
				     size_t count, loff_t *ppos)
{
466
	struct blk_mq_hw_ctx *hctx = data;
467 468 469 470 471 472 473
	int i;

	for (i = 0; i < BLK_MQ_MAX_DISPATCH_ORDER; i++)
		hctx->dispatched[i] = 0;
	return count;
}

474
static int hctx_queued_show(void *data, struct seq_file *m)
475
{
476
	struct blk_mq_hw_ctx *hctx = data;
477 478 479 480 481

	seq_printf(m, "%lu\n", hctx->queued);
	return 0;
}

482
static ssize_t hctx_queued_write(void *data, const char __user *buf,
483 484
				 size_t count, loff_t *ppos)
{
485
	struct blk_mq_hw_ctx *hctx = data;
486 487 488 489 490

	hctx->queued = 0;
	return count;
}

491
static int hctx_run_show(void *data, struct seq_file *m)
492
{
493
	struct blk_mq_hw_ctx *hctx = data;
494 495 496 497 498

	seq_printf(m, "%lu\n", hctx->run);
	return 0;
}

499 500
static ssize_t hctx_run_write(void *data, const char __user *buf, size_t count,
			      loff_t *ppos)
501
{
502
	struct blk_mq_hw_ctx *hctx = data;
503 504 505 506 507

	hctx->run = 0;
	return count;
}

508
static int hctx_active_show(void *data, struct seq_file *m)
509
{
510
	struct blk_mq_hw_ctx *hctx = data;
511 512 513 514 515

	seq_printf(m, "%d\n", atomic_read(&hctx->nr_active));
	return 0;
}

516
static void *ctx_rq_list_start(struct seq_file *m, loff_t *pos)
517
	__acquires(&ctx->lock)
518 519 520 521 522 523 524 525 526 527 528 529 530 531 532
{
	struct blk_mq_ctx *ctx = m->private;

	spin_lock(&ctx->lock);
	return seq_list_start(&ctx->rq_list, *pos);
}

static void *ctx_rq_list_next(struct seq_file *m, void *v, loff_t *pos)
{
	struct blk_mq_ctx *ctx = m->private;

	return seq_list_next(v, &ctx->rq_list, pos);
}

static void ctx_rq_list_stop(struct seq_file *m, void *v)
533
	__releases(&ctx->lock)
534 535 536 537 538 539 540 541 542 543 544 545
{
	struct blk_mq_ctx *ctx = m->private;

	spin_unlock(&ctx->lock);
}

static const struct seq_operations ctx_rq_list_seq_ops = {
	.start	= ctx_rq_list_start,
	.next	= ctx_rq_list_next,
	.stop	= ctx_rq_list_stop,
	.show	= blk_mq_debugfs_rq_show,
};
546
static int ctx_dispatched_show(void *data, struct seq_file *m)
547
{
548
	struct blk_mq_ctx *ctx = data;
549 550 551 552 553

	seq_printf(m, "%lu %lu\n", ctx->rq_dispatched[1], ctx->rq_dispatched[0]);
	return 0;
}

554
static ssize_t ctx_dispatched_write(void *data, const char __user *buf,
555 556
				    size_t count, loff_t *ppos)
{
557
	struct blk_mq_ctx *ctx = data;
558 559 560 561 562

	ctx->rq_dispatched[0] = ctx->rq_dispatched[1] = 0;
	return count;
}

563
static int ctx_merged_show(void *data, struct seq_file *m)
564
{
565
	struct blk_mq_ctx *ctx = data;
566 567 568 569 570

	seq_printf(m, "%lu\n", ctx->rq_merged);
	return 0;
}

571 572
static ssize_t ctx_merged_write(void *data, const char __user *buf,
				size_t count, loff_t *ppos)
573
{
574
	struct blk_mq_ctx *ctx = data;
575 576 577 578 579

	ctx->rq_merged = 0;
	return count;
}

580
static int ctx_completed_show(void *data, struct seq_file *m)
581
{
582
	struct blk_mq_ctx *ctx = data;
583 584 585 586 587

	seq_printf(m, "%lu %lu\n", ctx->rq_completed[1], ctx->rq_completed[0]);
	return 0;
}

588 589
static ssize_t ctx_completed_write(void *data, const char __user *buf,
				   size_t count, loff_t *ppos)
590
{
591 592 593 594
	struct blk_mq_ctx *ctx = data;

	ctx->rq_completed[0] = ctx->rq_completed[1] = 0;
	return count;
595 596
}

597 598 599 600 601 602 603 604 605 606
static int blk_mq_debugfs_show(struct seq_file *m, void *v)
{
	const struct blk_mq_debugfs_attr *attr = m->private;
	void *data = d_inode(m->file->f_path.dentry->d_parent)->i_private;

	return attr->show(data, m);
}

static ssize_t blk_mq_debugfs_write(struct file *file, const char __user *buf,
				    size_t count, loff_t *ppos)
607 608
{
	struct seq_file *m = file->private_data;
609 610
	const struct blk_mq_debugfs_attr *attr = m->private;
	void *data = d_inode(file->f_path.dentry->d_parent)->i_private;
611

612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637
	if (!attr->write)
		return -EPERM;

	return attr->write(data, buf, count, ppos);
}

static int blk_mq_debugfs_open(struct inode *inode, struct file *file)
{
	const struct blk_mq_debugfs_attr *attr = inode->i_private;
	void *data = d_inode(file->f_path.dentry->d_parent)->i_private;
	struct seq_file *m;
	int ret;

	if (attr->seq_ops) {
		ret = seq_open(file, attr->seq_ops);
		if (!ret) {
			m = file->private_data;
			m->private = data;
		}
		return ret;
	}

	if (WARN_ON_ONCE(!attr->show))
		return -EPERM;

	return single_open(file, blk_mq_debugfs_show, inode->i_private);
638 639
}

640 641 642 643 644 645 646 647 648 649 650 651
static int blk_mq_debugfs_release(struct inode *inode, struct file *file)
{
	const struct blk_mq_debugfs_attr *attr = inode->i_private;

	if (attr->show)
		return single_release(inode, file);
	else
		return seq_release(inode, file);
}

const struct file_operations blk_mq_debugfs_fops = {
	.open		= blk_mq_debugfs_open,
652
	.read		= seq_read,
653
	.write		= blk_mq_debugfs_write,
654
	.llseek		= seq_lseek,
655
	.release	= blk_mq_debugfs_release,
656 657
};

658
static const struct blk_mq_debugfs_attr blk_mq_debugfs_queue_attrs[] = {
659 660
	{"poll_stat", 0400, queue_poll_stat_show},
	{"state", 0600, queue_state_show, queue_state_write},
661 662 663
	{},
};

664
static const struct blk_mq_debugfs_attr blk_mq_debugfs_hctx_attrs[] = {
665 666 667 668 669 670 671 672 673 674 675 676 677
	{"state", 0400, hctx_state_show},
	{"flags", 0400, hctx_flags_show},
	{"dispatch", 0400, .seq_ops = &hctx_dispatch_seq_ops},
	{"ctx_map", 0400, hctx_ctx_map_show},
	{"tags", 0400, hctx_tags_show},
	{"tags_bitmap", 0400, hctx_tags_bitmap_show},
	{"sched_tags", 0400, hctx_sched_tags_show},
	{"sched_tags_bitmap", 0400, hctx_sched_tags_bitmap_show},
	{"io_poll", 0600, hctx_io_poll_show, hctx_io_poll_write},
	{"dispatched", 0600, hctx_dispatched_show, hctx_dispatched_write},
	{"queued", 0600, hctx_queued_show, hctx_queued_write},
	{"run", 0600, hctx_run_show, hctx_run_write},
	{"active", 0400, hctx_active_show},
678
	{},
679 680 681
};

static const struct blk_mq_debugfs_attr blk_mq_debugfs_ctx_attrs[] = {
682 683 684 685
	{"rq_list", 0400, .seq_ops = &ctx_rq_list_seq_ops},
	{"dispatched", 0600, ctx_dispatched_show, ctx_dispatched_write},
	{"merged", 0600, ctx_merged_show, ctx_merged_write},
	{"completed", 0600, ctx_completed_show, ctx_completed_write},
686
	{},
687 688
};

689
int blk_mq_debugfs_register(struct request_queue *q)
690
{
691
	if (!blk_debugfs_root)
692 693
		return -ENOENT;

694 695
	q->debugfs_dir = debugfs_create_dir(kobject_name(q->kobj.parent),
					    blk_debugfs_root);
696 697 698
	if (!q->debugfs_dir)
		goto err;

699
	if (blk_mq_debugfs_register_mq(q))
700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715
		goto err;

	return 0;

err:
	blk_mq_debugfs_unregister(q);
	return -ENOMEM;
}

void blk_mq_debugfs_unregister(struct request_queue *q)
{
	debugfs_remove_recursive(q->debugfs_dir);
	q->mq_debugfs_dir = NULL;
	q->debugfs_dir = NULL;
}

716
static bool debugfs_create_files(struct dentry *parent, void *data,
717
				 const struct blk_mq_debugfs_attr *attr)
718
{
719 720
	d_inode(parent)->i_private = data;

721 722
	for (; attr->name; attr++) {
		if (!debugfs_create_file(attr->name, attr->mode, parent,
723
					 (void *)attr, &blk_mq_debugfs_fops))
724 725 726 727 728
			return false;
	}
	return true;
}

729 730 731 732 733 734 735 736 737 738 739 740
static int blk_mq_debugfs_register_ctx(struct request_queue *q,
				       struct blk_mq_ctx *ctx,
				       struct dentry *hctx_dir)
{
	struct dentry *ctx_dir;
	char name[20];

	snprintf(name, sizeof(name), "cpu%u", ctx->cpu);
	ctx_dir = debugfs_create_dir(name, hctx_dir);
	if (!ctx_dir)
		return -ENOMEM;

741 742
	if (!debugfs_create_files(ctx_dir, ctx, blk_mq_debugfs_ctx_attrs))
		return -ENOMEM;
743 744 745 746 747 748 749 750 751 752 753 754

	return 0;
}

static int blk_mq_debugfs_register_hctx(struct request_queue *q,
					struct blk_mq_hw_ctx *hctx)
{
	struct blk_mq_ctx *ctx;
	struct dentry *hctx_dir;
	char name[20];
	int i;

755
	snprintf(name, sizeof(name), "hctx%u", hctx->queue_num);
756 757 758 759
	hctx_dir = debugfs_create_dir(name, q->mq_debugfs_dir);
	if (!hctx_dir)
		return -ENOMEM;

760 761
	if (!debugfs_create_files(hctx_dir, hctx, blk_mq_debugfs_hctx_attrs))
		return -ENOMEM;
762 763 764 765 766 767 768 769 770

	hctx_for_each_ctx(hctx, ctx, i) {
		if (blk_mq_debugfs_register_ctx(q, ctx, hctx_dir))
			return -ENOMEM;
	}

	return 0;
}

771
int blk_mq_debugfs_register_mq(struct request_queue *q)
772 773 774 775 776 777 778 779 780 781 782
{
	struct blk_mq_hw_ctx *hctx;
	int i;

	if (!q->debugfs_dir)
		return -ENOENT;

	q->mq_debugfs_dir = debugfs_create_dir("mq", q->debugfs_dir);
	if (!q->mq_debugfs_dir)
		goto err;

783 784 785
	if (!debugfs_create_files(q->mq_debugfs_dir, q, blk_mq_debugfs_queue_attrs))
		goto err;

786 787 788 789 790 791 792 793
	queue_for_each_hw_ctx(q, hctx, i) {
		if (blk_mq_debugfs_register_hctx(q, hctx))
			goto err;
	}

	return 0;

err:
794
	blk_mq_debugfs_unregister_mq(q);
795 796 797
	return -ENOMEM;
}

798
void blk_mq_debugfs_unregister_mq(struct request_queue *q)
799 800 801 802
{
	debugfs_remove_recursive(q->mq_debugfs_dir);
	q->mq_debugfs_dir = NULL;
}