blk-mq-debugfs.c 20.7 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-debugfs.h"
25
#include "blk-mq-tag.h"
26

27 28 29 30 31 32 33 34 35 36
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)
37
			seq_puts(m, "|");
38 39 40 41 42 43 44 45 46
		sep = true;
		if (i < flag_name_count && flag_name[i])
			seq_puts(m, flag_name[i]);
		else
			seq_printf(m, "%d", i);
	}
	return 0;
}

47
#define QUEUE_FLAG_NAME(name) [QUEUE_FLAG_##name] = #name
48
static const char *const blk_queue_flag_name[] = {
49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77
	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),
78
};
79
#undef QUEUE_FLAG_NAME
80

81
static int queue_state_show(void *data, struct seq_file *m)
82
{
83
	struct request_queue *q = data;
84 85 86

	blk_flags_show(m, q->queue_flags, blk_queue_flag_name,
		       ARRAY_SIZE(blk_queue_flag_name));
87
	seq_puts(m, "\n");
88 89 90
	return 0;
}

91 92
static ssize_t queue_state_write(void *data, const char __user *buf,
				 size_t count, loff_t *ppos)
93
{
94
	struct request_queue *q = data;
95
	char opbuf[16] = { }, *op;
96

97 98 99 100 101 102 103 104
	/*
	 * 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;

105
	if (count >= sizeof(opbuf)) {
106 107 108 109
		pr_err("%s: operation too long\n", __func__);
		goto inval;
	}

110
	if (copy_from_user(opbuf, buf, count))
111
		return -EFAULT;
112
	op = strstrip(opbuf);
113 114 115 116 117
	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 {
118 119 120
		pr_err("%s: unsupported operation '%s'\n", __func__, op);
inval:
		pr_err("%s: use either 'run' or 'start'\n", __func__);
121 122
		return -EINVAL;
	}
123
	return count;
124 125
}

126 127 128 129 130 131 132 133 134 135
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");
	}
}

136
static int queue_poll_stat_show(void *data, struct seq_file *m)
137
{
138
	struct request_queue *q = data;
139
	int bucket;
140

141 142 143 144
	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");
145

146 147 148 149
		seq_printf(m, "write (%d Bytes): ",  1 << (9+bucket));
		print_stat(m, &q->poll_stat[2*bucket+1]);
		seq_puts(m, "\n");
	}
150 151 152
	return 0;
}

153
#define HCTX_STATE_NAME(name) [BLK_MQ_S_##name] = #name
154
static const char *const hctx_state_name[] = {
155 156 157 158 159
	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),
160
};
161 162
#undef HCTX_STATE_NAME

163
static int hctx_state_show(void *data, struct seq_file *m)
164
{
165
	struct blk_mq_hw_ctx *hctx = data;
166

167 168
	blk_flags_show(m, hctx->state, hctx_state_name,
		       ARRAY_SIZE(hctx_state_name));
169
	seq_puts(m, "\n");
170 171 172
	return 0;
}

173
#define BLK_TAG_ALLOC_NAME(name) [BLK_TAG_ALLOC_##name] = #name
174
static const char *const alloc_policy_name[] = {
175 176
	BLK_TAG_ALLOC_NAME(FIFO),
	BLK_TAG_ALLOC_NAME(RR),
177
};
178
#undef BLK_TAG_ALLOC_NAME
179

180
#define HCTX_FLAG_NAME(name) [ilog2(BLK_MQ_F_##name)] = #name
181
static const char *const hctx_flag_name[] = {
182 183 184 185 186
	HCTX_FLAG_NAME(SHOULD_MERGE),
	HCTX_FLAG_NAME(TAG_SHARED),
	HCTX_FLAG_NAME(SG_MERGE),
	HCTX_FLAG_NAME(BLOCKING),
	HCTX_FLAG_NAME(NO_SCHED),
187
};
188
#undef HCTX_FLAG_NAME
189

190
static int hctx_flags_show(void *data, struct seq_file *m)
191
{
192
	struct blk_mq_hw_ctx *hctx = data;
193
	const int alloc_policy = BLK_MQ_FLAG_TO_ALLOC_POLICY(hctx->flags);
194

195 196 197 198 199 200 201 202 203 204
	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));
205
	seq_puts(m, "\n");
206 207 208
	return 0;
}

209
#define REQ_OP_NAME(name) [REQ_OP_##name] = #name
210
static const char *const op_name[] = {
211 212 213 214 215 216 217 218 219 220 221 222 223
	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),
224
};
225
#undef REQ_OP_NAME
226

227
#define CMD_FLAG_NAME(name) [__REQ_##name] = #name
228
static const char *const cmd_flag_name[] = {
229 230 231 232 233 234 235 236 237 238 239 240 241 242
	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),
243
};
244
#undef CMD_FLAG_NAME
245

246
#define RQF_NAME(name) [ilog2((__force u32)RQF_##name)] = #name
247
static const char *const rqf_name[] = {
248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266
	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),
267
};
268
#undef RQF_NAME
269

270 271 272
static int blk_mq_debugfs_rq_show(struct seq_file *m, void *v)
{
	struct request *rq = list_entry_rq(v);
273
	const struct blk_mq_ops *const mq_ops = rq->q->mq_ops;
274
	const unsigned int op = rq->cmd_flags & REQ_OP_MASK;
275

276 277 278 279 280 281 282 283 284 285 286
	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));
287
	seq_printf(m, ", .tag=%d, .internal_tag=%d", rq->tag,
288
		   rq->internal_tag);
289 290 291
	if (mq_ops->show_rq)
		mq_ops->show_rq(m, rq);
	seq_puts(m, "}\n");
292 293 294 295
	return 0;
}

static void *hctx_dispatch_start(struct seq_file *m, loff_t *pos)
296
	__acquires(&hctx->lock)
297 298 299 300 301 302 303 304 305 306 307 308 309 310 311
{
	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)
312
	__releases(&hctx->lock)
313 314 315 316 317 318 319 320 321 322 323 324 325
{
	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,
};

326
static int hctx_ctx_map_show(void *data, struct seq_file *m)
327
{
328
	struct blk_mq_hw_ctx *hctx = data;
329 330 331 332 333

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

334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350
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);
	}
}

351
static int hctx_tags_show(void *data, struct seq_file *m)
352
{
353
	struct blk_mq_hw_ctx *hctx = data;
354
	struct request_queue *q = hctx->queue;
355
	int res;
356

357 358 359
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
360 361 362 363
	if (hctx->tags)
		blk_mq_debugfs_tags_show(m, hctx->tags);
	mutex_unlock(&q->sysfs_lock);

364 365
out:
	return res;
366 367
}

368
static int hctx_tags_bitmap_show(void *data, struct seq_file *m)
369
{
370
	struct blk_mq_hw_ctx *hctx = data;
371
	struct request_queue *q = hctx->queue;
372
	int res;
373

374 375 376
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
377 378 379
	if (hctx->tags)
		sbitmap_bitmap_show(&hctx->tags->bitmap_tags.sb, m);
	mutex_unlock(&q->sysfs_lock);
380 381 382

out:
	return res;
383 384
}

385
static int hctx_sched_tags_show(void *data, struct seq_file *m)
386
{
387
	struct blk_mq_hw_ctx *hctx = data;
388
	struct request_queue *q = hctx->queue;
389
	int res;
390

391 392 393
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
394 395 396 397
	if (hctx->sched_tags)
		blk_mq_debugfs_tags_show(m, hctx->sched_tags);
	mutex_unlock(&q->sysfs_lock);

398 399
out:
	return res;
400 401
}

402
static int hctx_sched_tags_bitmap_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 409 410
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
411 412 413
	if (hctx->sched_tags)
		sbitmap_bitmap_show(&hctx->sched_tags->bitmap_tags.sb, m);
	mutex_unlock(&q->sysfs_lock);
414 415 416

out:
	return res;
417 418
}

419
static int hctx_io_poll_show(void *data, struct seq_file *m)
420
{
421
	struct blk_mq_hw_ctx *hctx = data;
422 423 424 425 426 427 428

	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;
}

429
static ssize_t hctx_io_poll_write(void *data, const char __user *buf,
430 431
				  size_t count, loff_t *ppos)
{
432
	struct blk_mq_hw_ctx *hctx = data;
433 434 435 436 437

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

438
static int hctx_dispatched_show(void *data, struct seq_file *m)
439
{
440
	struct blk_mq_hw_ctx *hctx = data;
441 442 443 444 445 446 447 448 449 450 451 452 453 454
	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;
}

455
static ssize_t hctx_dispatched_write(void *data, const char __user *buf,
456 457
				     size_t count, loff_t *ppos)
{
458
	struct blk_mq_hw_ctx *hctx = data;
459 460 461 462 463 464 465
	int i;

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

466
static int hctx_queued_show(void *data, struct seq_file *m)
467
{
468
	struct blk_mq_hw_ctx *hctx = data;
469 470 471 472 473

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

474
static ssize_t hctx_queued_write(void *data, const char __user *buf,
475 476
				 size_t count, loff_t *ppos)
{
477
	struct blk_mq_hw_ctx *hctx = data;
478 479 480 481 482

	hctx->queued = 0;
	return count;
}

483
static int hctx_run_show(void *data, struct seq_file *m)
484
{
485
	struct blk_mq_hw_ctx *hctx = data;
486 487 488 489 490

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

491 492
static ssize_t hctx_run_write(void *data, const char __user *buf, size_t count,
			      loff_t *ppos)
493
{
494
	struct blk_mq_hw_ctx *hctx = data;
495 496 497 498 499

	hctx->run = 0;
	return count;
}

500
static int hctx_active_show(void *data, struct seq_file *m)
501
{
502
	struct blk_mq_hw_ctx *hctx = data;
503 504 505 506 507

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

508
static void *ctx_rq_list_start(struct seq_file *m, loff_t *pos)
509
	__acquires(&ctx->lock)
510 511 512 513 514 515 516 517 518 519 520 521 522 523 524
{
	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)
525
	__releases(&ctx->lock)
526 527 528 529 530 531 532 533 534 535 536 537
{
	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,
};
538
static int ctx_dispatched_show(void *data, struct seq_file *m)
539
{
540
	struct blk_mq_ctx *ctx = data;
541 542 543 544 545

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

546
static ssize_t ctx_dispatched_write(void *data, const char __user *buf,
547 548
				    size_t count, loff_t *ppos)
{
549
	struct blk_mq_ctx *ctx = data;
550 551 552 553 554

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

555
static int ctx_merged_show(void *data, struct seq_file *m)
556
{
557
	struct blk_mq_ctx *ctx = data;
558 559 560 561 562

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

563 564
static ssize_t ctx_merged_write(void *data, const char __user *buf,
				size_t count, loff_t *ppos)
565
{
566
	struct blk_mq_ctx *ctx = data;
567 568 569 570 571

	ctx->rq_merged = 0;
	return count;
}

572
static int ctx_completed_show(void *data, struct seq_file *m)
573
{
574
	struct blk_mq_ctx *ctx = data;
575 576 577 578 579

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

580 581
static ssize_t ctx_completed_write(void *data, const char __user *buf,
				   size_t count, loff_t *ppos)
582
{
583 584 585 586
	struct blk_mq_ctx *ctx = data;

	ctx->rq_completed[0] = ctx->rq_completed[1] = 0;
	return count;
587 588
}

589 590 591 592 593 594 595 596 597 598
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)
599 600
{
	struct seq_file *m = file->private_data;
601 602
	const struct blk_mq_debugfs_attr *attr = m->private;
	void *data = d_inode(file->f_path.dentry->d_parent)->i_private;
603

604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629
	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);
630 631
}

632 633 634 635 636 637 638 639 640 641 642 643
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,
644
	.read		= seq_read,
645
	.write		= blk_mq_debugfs_write,
646
	.llseek		= seq_lseek,
647
	.release	= blk_mq_debugfs_release,
648 649
};

650
static const struct blk_mq_debugfs_attr blk_mq_debugfs_queue_attrs[] = {
651 652
	{"poll_stat", 0400, queue_poll_stat_show},
	{"state", 0600, queue_state_show, queue_state_write},
653 654 655
	{},
};

656
static const struct blk_mq_debugfs_attr blk_mq_debugfs_hctx_attrs[] = {
657 658 659 660 661 662 663 664 665 666 667 668 669
	{"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},
670
	{},
671 672 673
};

static const struct blk_mq_debugfs_attr blk_mq_debugfs_ctx_attrs[] = {
674 675 676 677
	{"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},
678
	{},
679 680
};

681 682 683 684 685 686 687 688 689 690 691 692 693
static bool debugfs_create_files(struct dentry *parent, void *data,
				 const struct blk_mq_debugfs_attr *attr)
{
	d_inode(parent)->i_private = data;

	for (; attr->name; attr++) {
		if (!debugfs_create_file(attr->name, attr->mode, parent,
					 (void *)attr, &blk_mq_debugfs_fops))
			return false;
	}
	return true;
}

694
int blk_mq_debugfs_register(struct request_queue *q)
695
{
696 697 698
	struct blk_mq_hw_ctx *hctx;
	int i;

699
	if (!blk_debugfs_root)
700 701
		return -ENOENT;

702 703
	q->debugfs_dir = debugfs_create_dir(kobject_name(q->kobj.parent),
					    blk_debugfs_root);
704
	if (!q->debugfs_dir)
705
		return -ENOMEM;
706

707 708
	if (!debugfs_create_files(q->debugfs_dir, q,
				  blk_mq_debugfs_queue_attrs))
709 710
		goto err;

711 712 713 714 715 716 717 718
	/*
	 * blk_mq_init_hctx() attempted to do this already, but q->debugfs_dir
	 * didn't exist yet (because we don't know what to name the directory
	 * until the queue is registered to a gendisk).
	 */
	queue_for_each_hw_ctx(q, hctx, i) {
		if (!hctx->debugfs_dir && blk_mq_debugfs_register_hctx(q, hctx))
			goto err;
719 720 721
		if (q->elevator && !hctx->sched_debugfs_dir &&
		    blk_mq_debugfs_register_sched_hctx(q, hctx))
			goto err;
722 723
	}

724 725 726 727 728 729 730 731 732 733
	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);
734
	q->sched_debugfs_dir = NULL;
735 736 737
	q->debugfs_dir = NULL;
}

738 739
static int blk_mq_debugfs_register_ctx(struct blk_mq_hw_ctx *hctx,
				       struct blk_mq_ctx *ctx)
740 741 742 743 744
{
	struct dentry *ctx_dir;
	char name[20];

	snprintf(name, sizeof(name), "cpu%u", ctx->cpu);
745
	ctx_dir = debugfs_create_dir(name, hctx->debugfs_dir);
746 747 748
	if (!ctx_dir)
		return -ENOMEM;

749 750
	if (!debugfs_create_files(ctx_dir, ctx, blk_mq_debugfs_ctx_attrs))
		return -ENOMEM;
751 752 753 754

	return 0;
}

755 756
int blk_mq_debugfs_register_hctx(struct request_queue *q,
				 struct blk_mq_hw_ctx *hctx)
757 758 759 760 761
{
	struct blk_mq_ctx *ctx;
	char name[20];
	int i;

762 763 764
	if (!q->debugfs_dir)
		return -ENOENT;

765
	snprintf(name, sizeof(name), "hctx%u", hctx->queue_num);
766 767
	hctx->debugfs_dir = debugfs_create_dir(name, q->debugfs_dir);
	if (!hctx->debugfs_dir)
768 769
		return -ENOMEM;

770 771 772
	if (!debugfs_create_files(hctx->debugfs_dir, hctx,
				  blk_mq_debugfs_hctx_attrs))
		goto err;
773 774

	hctx_for_each_ctx(hctx, ctx, i) {
775 776
		if (blk_mq_debugfs_register_ctx(hctx, ctx))
			goto err;
777 778 779
	}

	return 0;
780 781 782 783 784 785 786 787 788

err:
	blk_mq_debugfs_unregister_hctx(hctx);
	return -ENOMEM;
}

void blk_mq_debugfs_unregister_hctx(struct blk_mq_hw_ctx *hctx)
{
	debugfs_remove_recursive(hctx->debugfs_dir);
789
	hctx->sched_debugfs_dir = NULL;
790
	hctx->debugfs_dir = NULL;
791 792
}

793
int blk_mq_debugfs_register_hctxs(struct request_queue *q)
794 795 796 797 798 799
{
	struct blk_mq_hw_ctx *hctx;
	int i;

	queue_for_each_hw_ctx(q, hctx, i) {
		if (blk_mq_debugfs_register_hctx(q, hctx))
800
			return -ENOMEM;
801 802 803 804 805
	}

	return 0;
}

806
void blk_mq_debugfs_unregister_hctxs(struct request_queue *q)
807
{
808 809 810 811 812
	struct blk_mq_hw_ctx *hctx;
	int i;

	queue_for_each_hw_ctx(q, hctx, i)
		blk_mq_debugfs_unregister_hctx(hctx);
813
}
814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873

int blk_mq_debugfs_register_sched(struct request_queue *q)
{
	struct elevator_type *e = q->elevator->type;

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

	if (!e->queue_debugfs_attrs)
		return 0;

	q->sched_debugfs_dir = debugfs_create_dir("sched", q->debugfs_dir);
	if (!q->sched_debugfs_dir)
		return -ENOMEM;

	if (!debugfs_create_files(q->sched_debugfs_dir, q,
				  e->queue_debugfs_attrs))
		goto err;

	return 0;

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

void blk_mq_debugfs_unregister_sched(struct request_queue *q)
{
	debugfs_remove_recursive(q->sched_debugfs_dir);
	q->sched_debugfs_dir = NULL;
}

int blk_mq_debugfs_register_sched_hctx(struct request_queue *q,
				       struct blk_mq_hw_ctx *hctx)
{
	struct elevator_type *e = q->elevator->type;

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

	if (!e->hctx_debugfs_attrs)
		return 0;

	hctx->sched_debugfs_dir = debugfs_create_dir("sched",
						     hctx->debugfs_dir);
	if (!hctx->sched_debugfs_dir)
		return -ENOMEM;

	if (!debugfs_create_files(hctx->sched_debugfs_dir, hctx,
				  e->hctx_debugfs_attrs))
		return -ENOMEM;

	return 0;
}

void blk_mq_debugfs_unregister_sched_hctx(struct blk_mq_hw_ctx *hctx)
{
	debugfs_remove_recursive(hctx->sched_debugfs_dir);
	hctx->sched_debugfs_dir = NULL;
}