blk-mq-debugfs.c 24.4 KB
Newer Older
1
// SPDX-License-Identifier: GPL-2.0
2 3 4 5 6 7 8 9 10
/*
 * Copyright (C) 2017 Facebook
 */

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

#include <linux/blk-mq.h>
11
#include "blk.h"
12
#include "blk-mq.h"
13
#include "blk-mq-debugfs.h"
14
#include "blk-mq-tag.h"
M
Ming Lei 已提交
15
#include "blk-rq-qos.h"
16

17 18 19
static void print_stat(struct seq_file *m, struct blk_rq_stat *stat)
{
	if (stat->nr_samples) {
20
		seq_printf(m, "samples=%d, mean=%llu, min=%llu, max=%llu",
21 22 23 24 25 26 27 28 29 30 31
			   stat->nr_samples, stat->mean, stat->min, stat->max);
	} else {
		seq_puts(m, "samples=0");
	}
}

static int queue_poll_stat_show(void *data, struct seq_file *m)
{
	struct request_queue *q = data;
	int bucket;

32 33 34
	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]);
35 36
		seq_puts(m, "\n");

37 38
		seq_printf(m, "write (%d Bytes): ",  1 << (9 + bucket));
		print_stat(m, &q->poll_stat[2 * bucket + 1]);
39 40 41 42 43 44 45 46 47 48 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
		seq_puts(m, "\n");
	}
	return 0;
}

static void *queue_requeue_list_start(struct seq_file *m, loff_t *pos)
	__acquires(&q->requeue_lock)
{
	struct request_queue *q = m->private;

	spin_lock_irq(&q->requeue_lock);
	return seq_list_start(&q->requeue_list, *pos);
}

static void *queue_requeue_list_next(struct seq_file *m, void *v, loff_t *pos)
{
	struct request_queue *q = m->private;

	return seq_list_next(v, &q->requeue_list, pos);
}

static void queue_requeue_list_stop(struct seq_file *m, void *v)
	__releases(&q->requeue_lock)
{
	struct request_queue *q = m->private;

	spin_unlock_irq(&q->requeue_lock);
}

static const struct seq_operations queue_requeue_list_seq_ops = {
	.start	= queue_requeue_list_start,
	.next	= queue_requeue_list_next,
	.stop	= queue_requeue_list_stop,
	.show	= blk_mq_debugfs_rq_show,
};

75 76 77 78 79 80 81 82 83 84
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)
85
			seq_puts(m, "|");
86 87 88 89 90 91 92 93 94
		sep = true;
		if (i < flag_name_count && flag_name[i])
			seq_puts(m, flag_name[i]);
		else
			seq_printf(m, "%d", i);
	}
	return 0;
}

95 96 97 98 99 100 101 102
static int queue_pm_only_show(void *data, struct seq_file *m)
{
	struct request_queue *q = data;

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

103
#define QUEUE_FLAG_NAME(name) [QUEUE_FLAG_##name] = #name
104
static const char *const blk_queue_flag_name[] = {
105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125
	QUEUE_FLAG_NAME(STOPPED),
	QUEUE_FLAG_NAME(DYING),
	QUEUE_FLAG_NAME(NOMERGES),
	QUEUE_FLAG_NAME(SAME_COMP),
	QUEUE_FLAG_NAME(FAIL_IO),
	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(POLL),
	QUEUE_FLAG_NAME(WC),
	QUEUE_FLAG_NAME(FUA),
	QUEUE_FLAG_NAME(DAX),
	QUEUE_FLAG_NAME(STATS),
	QUEUE_FLAG_NAME(POLL_STATS),
	QUEUE_FLAG_NAME(REGISTERED),
126 127
	QUEUE_FLAG_NAME(SCSI_PASSTHROUGH),
	QUEUE_FLAG_NAME(QUIESCED),
128 129 130
	QUEUE_FLAG_NAME(PCI_P2PDMA),
	QUEUE_FLAG_NAME(ZONE_RESETALL),
	QUEUE_FLAG_NAME(RQ_ALLOC_TIME),
131
};
132
#undef QUEUE_FLAG_NAME
133

134
static int queue_state_show(void *data, struct seq_file *m)
135
{
136
	struct request_queue *q = data;
137 138 139

	blk_flags_show(m, q->queue_flags, blk_queue_flag_name,
		       ARRAY_SIZE(blk_queue_flag_name));
140
	seq_puts(m, "\n");
141 142 143
	return 0;
}

144 145
static ssize_t queue_state_write(void *data, const char __user *buf,
				 size_t count, loff_t *ppos)
146
{
147
	struct request_queue *q = data;
148
	char opbuf[16] = { }, *op;
149

150 151 152 153 154 155 156 157
	/*
	 * 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;

158
	if (count >= sizeof(opbuf)) {
159 160 161 162
		pr_err("%s: operation too long\n", __func__);
		goto inval;
	}

163
	if (copy_from_user(opbuf, buf, count))
164
		return -EFAULT;
165
	op = strstrip(opbuf);
166 167 168 169
	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);
170 171
	} else if (strcmp(op, "kick") == 0) {
		blk_mq_kick_requeue_list(q);
172
	} else {
173 174
		pr_err("%s: unsupported operation '%s'\n", __func__, op);
inval:
175
		pr_err("%s: use 'run', 'start' or 'kick'\n", __func__);
176 177
		return -EINVAL;
	}
178
	return count;
179 180
}

181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203
static int queue_write_hint_show(void *data, struct seq_file *m)
{
	struct request_queue *q = data;
	int i;

	for (i = 0; i < BLK_MAX_WRITE_HINTS; i++)
		seq_printf(m, "hint%d: %llu\n", i, q->write_hints[i]);

	return 0;
}

static ssize_t queue_write_hint_store(void *data, const char __user *buf,
				      size_t count, loff_t *ppos)
{
	struct request_queue *q = data;
	int i;

	for (i = 0; i < BLK_MAX_WRITE_HINTS; i++)
		q->write_hints[i] = 0;

	return count;
}

204 205 206
static const struct blk_mq_debugfs_attr blk_mq_debugfs_queue_attrs[] = {
	{ "poll_stat", 0400, queue_poll_stat_show },
	{ "requeue_list", 0400, .seq_ops = &queue_requeue_list_seq_ops },
207
	{ "pm_only", 0600, queue_pm_only_show, NULL },
208 209
	{ "state", 0600, queue_state_show, queue_state_write },
	{ "write_hints", 0600, queue_write_hint_show, queue_write_hint_store },
210
	{ "zone_wlock", 0400, queue_zone_wlock_show, NULL },
211 212
	{ },
};
213

214
#define HCTX_STATE_NAME(name) [BLK_MQ_S_##name] = #name
215
static const char *const hctx_state_name[] = {
216 217 218
	HCTX_STATE_NAME(STOPPED),
	HCTX_STATE_NAME(TAG_ACTIVE),
	HCTX_STATE_NAME(SCHED_RESTART),
219
	HCTX_STATE_NAME(INACTIVE),
220
};
221 222
#undef HCTX_STATE_NAME

223
static int hctx_state_show(void *data, struct seq_file *m)
224
{
225
	struct blk_mq_hw_ctx *hctx = data;
226

227 228
	blk_flags_show(m, hctx->state, hctx_state_name,
		       ARRAY_SIZE(hctx_state_name));
229
	seq_puts(m, "\n");
230 231 232
	return 0;
}

233
#define BLK_TAG_ALLOC_NAME(name) [BLK_TAG_ALLOC_##name] = #name
234
static const char *const alloc_policy_name[] = {
235 236
	BLK_TAG_ALLOC_NAME(FIFO),
	BLK_TAG_ALLOC_NAME(RR),
237
};
238
#undef BLK_TAG_ALLOC_NAME
239

240
#define HCTX_FLAG_NAME(name) [ilog2(BLK_MQ_F_##name)] = #name
241
static const char *const hctx_flag_name[] = {
242
	HCTX_FLAG_NAME(SHOULD_MERGE),
243
	HCTX_FLAG_NAME(TAG_QUEUE_SHARED),
244 245
	HCTX_FLAG_NAME(BLOCKING),
	HCTX_FLAG_NAME(NO_SCHED),
246
	HCTX_FLAG_NAME(STACKING),
247
};
248
#undef HCTX_FLAG_NAME
249

250
static int hctx_flags_show(void *data, struct seq_file *m)
251
{
252
	struct blk_mq_hw_ctx *hctx = data;
253
	const int alloc_policy = BLK_MQ_FLAG_TO_ALLOC_POLICY(hctx->flags);
254

255 256 257 258 259 260 261 262 263 264
	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));
265
	seq_puts(m, "\n");
266 267 268
	return 0;
}

269
#define CMD_FLAG_NAME(name) [__REQ_##name] = #name
270
static const char *const cmd_flag_name[] = {
271 272 273 274 275 276 277 278 279 280 281 282 283
	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),
284
	CMD_FLAG_NAME(NOWAIT),
285 286
	CMD_FLAG_NAME(NOUNMAP),
	CMD_FLAG_NAME(HIPRI),
287
};
288
#undef CMD_FLAG_NAME
289

290
#define RQF_NAME(name) [ilog2((__force u32)RQF_##name)] = #name
291
static const char *const rqf_name[] = {
292
	RQF_NAME(SORTED),
293
	RQF_NAME(STARTED),
294 295 296 297 298 299 300 301 302 303 304 305 306 307 308
	RQF_NAME(SOFTBARRIER),
	RQF_NAME(FLUSH_SEQ),
	RQF_NAME(MIXED_MERGE),
	RQF_NAME(MQ_INFLIGHT),
	RQF_NAME(DONTPREP),
	RQF_NAME(PREEMPT),
	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),
309
	RQF_NAME(ZONE_WRITE_LOCKED),
J
Jens Axboe 已提交
310
	RQF_NAME(MQ_POLL_SLEPT),
311
};
312
#undef RQF_NAME
313

314 315 316 317 318 319 320 321
static const char *const blk_mq_rq_state_name_array[] = {
	[MQ_RQ_IDLE]		= "idle",
	[MQ_RQ_IN_FLIGHT]	= "in_flight",
	[MQ_RQ_COMPLETE]	= "complete",
};

static const char *blk_mq_rq_state_name(enum mq_rq_state rq_state)
{
322
	if (WARN_ON_ONCE((unsigned int)rq_state >=
323 324 325 326 327
			 ARRAY_SIZE(blk_mq_rq_state_name_array)))
		return "(?)";
	return blk_mq_rq_state_name_array[rq_state];
}

328
int __blk_mq_debugfs_rq_show(struct seq_file *m, struct request *rq)
329
{
330
	const struct blk_mq_ops *const mq_ops = rq->q->mq_ops;
331
	const unsigned int op = req_op(rq);
332
	const char *op_str = blk_op_str(op);
333

334
	seq_printf(m, "%p {.op=", rq);
335
	if (strcmp(op_str, "UNKNOWN") == 0)
336
		seq_printf(m, "%u", op);
337
	else
338
		seq_printf(m, "%s", op_str);
339 340 341 342 343 344
	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));
345
	seq_printf(m, ", .state=%s", blk_mq_rq_state_name(blk_mq_rq_state(rq)));
346
	seq_printf(m, ", .tag=%d, .internal_tag=%d", rq->tag,
347
		   rq->internal_tag);
348 349 350
	if (mq_ops->show_rq)
		mq_ops->show_rq(m, rq);
	seq_puts(m, "}\n");
351 352
	return 0;
}
353 354 355 356 357 358
EXPORT_SYMBOL_GPL(__blk_mq_debugfs_rq_show);

int blk_mq_debugfs_rq_show(struct seq_file *m, void *v)
{
	return __blk_mq_debugfs_rq_show(m, list_entry_rq(v));
}
O
Omar Sandoval 已提交
359
EXPORT_SYMBOL_GPL(blk_mq_debugfs_rq_show);
360 361

static void *hctx_dispatch_start(struct seq_file *m, loff_t *pos)
362
	__acquires(&hctx->lock)
363 364 365 366 367 368 369 370 371 372 373 374 375 376 377
{
	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)
378
	__releases(&hctx->lock)
379 380 381 382 383 384 385 386 387 388 389 390 391
{
	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,
};

392 393 394 395 396 397 398
struct show_busy_params {
	struct seq_file		*m;
	struct blk_mq_hw_ctx	*hctx;
};

/*
 * Note: the state of a request may change while this function is in progress,
399 400
 * e.g. due to a concurrent blk_mq_finish_request() call. Returns true to
 * keep iterating requests.
401
 */
402
static bool hctx_show_busy_rq(struct request *rq, void *data, bool reserved)
403 404 405
{
	const struct show_busy_params *params = data;

406
	if (rq->mq_hctx == params->hctx)
407
		__blk_mq_debugfs_rq_show(params->m, rq);
408 409

	return true;
410 411 412 413 414 415 416 417 418 419 420 421 422
}

static int hctx_busy_show(void *data, struct seq_file *m)
{
	struct blk_mq_hw_ctx *hctx = data;
	struct show_busy_params params = { .m = m, .hctx = hctx };

	blk_mq_tagset_busy_iter(hctx->queue->tag_set, hctx_show_busy_rq,
				&params);

	return 0;
}

423 424 425 426 427 428 429 430 431 432 433 434 435 436 437
static const char *const hctx_types[] = {
	[HCTX_TYPE_DEFAULT]	= "default",
	[HCTX_TYPE_READ]	= "read",
	[HCTX_TYPE_POLL]	= "poll",
};

static int hctx_type_show(void *data, struct seq_file *m)
{
	struct blk_mq_hw_ctx *hctx = data;

	BUILD_BUG_ON(ARRAY_SIZE(hctx_types) != HCTX_MAX_TYPES);
	seq_printf(m, "%s\n", hctx_types[hctx->type]);
	return 0;
}

438
static int hctx_ctx_map_show(void *data, struct seq_file *m)
439
{
440
	struct blk_mq_hw_ctx *hctx = data;
441 442 443 444 445

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

446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462
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);
	}
}

463
static int hctx_tags_show(void *data, struct seq_file *m)
464
{
465
	struct blk_mq_hw_ctx *hctx = data;
466
	struct request_queue *q = hctx->queue;
467
	int res;
468

469 470 471
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
472 473 474 475
	if (hctx->tags)
		blk_mq_debugfs_tags_show(m, hctx->tags);
	mutex_unlock(&q->sysfs_lock);

476 477
out:
	return res;
478 479
}

480
static int hctx_tags_bitmap_show(void *data, struct seq_file *m)
481
{
482
	struct blk_mq_hw_ctx *hctx = data;
483
	struct request_queue *q = hctx->queue;
484
	int res;
485

486 487 488
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
489 490 491
	if (hctx->tags)
		sbitmap_bitmap_show(&hctx->tags->bitmap_tags.sb, m);
	mutex_unlock(&q->sysfs_lock);
492 493 494

out:
	return res;
495 496
}

497
static int hctx_sched_tags_show(void *data, struct seq_file *m)
498
{
499
	struct blk_mq_hw_ctx *hctx = data;
500
	struct request_queue *q = hctx->queue;
501
	int res;
502

503 504 505
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
506 507 508 509
	if (hctx->sched_tags)
		blk_mq_debugfs_tags_show(m, hctx->sched_tags);
	mutex_unlock(&q->sysfs_lock);

510 511
out:
	return res;
512 513
}

514
static int hctx_sched_tags_bitmap_show(void *data, struct seq_file *m)
515
{
516
	struct blk_mq_hw_ctx *hctx = data;
517
	struct request_queue *q = hctx->queue;
518
	int res;
519

520 521 522
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
523 524 525
	if (hctx->sched_tags)
		sbitmap_bitmap_show(&hctx->sched_tags->bitmap_tags.sb, m);
	mutex_unlock(&q->sysfs_lock);
526 527 528

out:
	return res;
529 530
}

531
static int hctx_io_poll_show(void *data, struct seq_file *m)
532
{
533
	struct blk_mq_hw_ctx *hctx = data;
534 535 536 537 538 539 540

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

541
static ssize_t hctx_io_poll_write(void *data, const char __user *buf,
542 543
				  size_t count, loff_t *ppos)
{
544
	struct blk_mq_hw_ctx *hctx = data;
545 546 547 548 549

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

550
static int hctx_dispatched_show(void *data, struct seq_file *m)
551
{
552
	struct blk_mq_hw_ctx *hctx = data;
553 554 555 556 557 558 559 560 561 562 563 564 565 566
	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;
}

567
static ssize_t hctx_dispatched_write(void *data, const char __user *buf,
568 569
				     size_t count, loff_t *ppos)
{
570
	struct blk_mq_hw_ctx *hctx = data;
571 572 573 574 575 576 577
	int i;

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

578
static int hctx_queued_show(void *data, struct seq_file *m)
579
{
580
	struct blk_mq_hw_ctx *hctx = data;
581 582 583 584 585

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

586
static ssize_t hctx_queued_write(void *data, const char __user *buf,
587 588
				 size_t count, loff_t *ppos)
{
589
	struct blk_mq_hw_ctx *hctx = data;
590 591 592 593 594

	hctx->queued = 0;
	return count;
}

595
static int hctx_run_show(void *data, struct seq_file *m)
596
{
597
	struct blk_mq_hw_ctx *hctx = data;
598 599 600 601 602

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

603 604
static ssize_t hctx_run_write(void *data, const char __user *buf, size_t count,
			      loff_t *ppos)
605
{
606
	struct blk_mq_hw_ctx *hctx = data;
607 608 609 610 611

	hctx->run = 0;
	return count;
}

612
static int hctx_active_show(void *data, struct seq_file *m)
613
{
614
	struct blk_mq_hw_ctx *hctx = data;
615 616 617 618 619

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

620 621 622 623 624 625 626 627
static int hctx_dispatch_busy_show(void *data, struct seq_file *m)
{
	struct blk_mq_hw_ctx *hctx = data;

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

M
Ming Lei 已提交
628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663
#define CTX_RQ_SEQ_OPS(name, type)					\
static void *ctx_##name##_rq_list_start(struct seq_file *m, loff_t *pos) \
	__acquires(&ctx->lock)						\
{									\
	struct blk_mq_ctx *ctx = m->private;				\
									\
	spin_lock(&ctx->lock);						\
	return seq_list_start(&ctx->rq_lists[type], *pos);		\
}									\
									\
static void *ctx_##name##_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_lists[type], pos);		\
}									\
									\
static void ctx_##name##_rq_list_stop(struct seq_file *m, void *v)	\
	__releases(&ctx->lock)						\
{									\
	struct blk_mq_ctx *ctx = m->private;				\
									\
	spin_unlock(&ctx->lock);					\
}									\
									\
static const struct seq_operations ctx_##name##_rq_list_seq_ops = {	\
	.start	= ctx_##name##_rq_list_start,				\
	.next	= ctx_##name##_rq_list_next,				\
	.stop	= ctx_##name##_rq_list_stop,				\
	.show	= blk_mq_debugfs_rq_show,				\
}

CTX_RQ_SEQ_OPS(default, HCTX_TYPE_DEFAULT);
CTX_RQ_SEQ_OPS(read, HCTX_TYPE_READ);
CTX_RQ_SEQ_OPS(poll, HCTX_TYPE_POLL);
664

665
static int ctx_dispatched_show(void *data, struct seq_file *m)
666
{
667
	struct blk_mq_ctx *ctx = data;
668 669 670 671 672

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

673
static ssize_t ctx_dispatched_write(void *data, const char __user *buf,
674 675
				    size_t count, loff_t *ppos)
{
676
	struct blk_mq_ctx *ctx = data;
677 678 679 680 681

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

682
static int ctx_merged_show(void *data, struct seq_file *m)
683
{
684
	struct blk_mq_ctx *ctx = data;
685 686 687 688 689

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

690 691
static ssize_t ctx_merged_write(void *data, const char __user *buf,
				size_t count, loff_t *ppos)
692
{
693
	struct blk_mq_ctx *ctx = data;
694 695 696 697 698

	ctx->rq_merged = 0;
	return count;
}

699
static int ctx_completed_show(void *data, struct seq_file *m)
700
{
701
	struct blk_mq_ctx *ctx = data;
702 703 704 705 706

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

707 708
static ssize_t ctx_completed_write(void *data, const char __user *buf,
				   size_t count, loff_t *ppos)
709
{
710 711 712 713
	struct blk_mq_ctx *ctx = data;

	ctx->rq_completed[0] = ctx->rq_completed[1] = 0;
	return count;
714 715
}

716 717 718 719 720 721 722 723 724 725
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)
726 727
{
	struct seq_file *m = file->private_data;
728 729
	const struct blk_mq_debugfs_attr *attr = m->private;
	void *data = d_inode(file->f_path.dentry->d_parent)->i_private;
730

731 732 733 734 735
	/*
	 * Attributes that only implement .seq_ops are read-only and 'attr' is
	 * the same with 'data' in this case.
	 */
	if (attr == data || !attr->write)
736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760
		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);
761 762
}

763 764 765 766 767 768
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);
769 770

	return seq_release(inode, file);
771 772
}

773
static const struct file_operations blk_mq_debugfs_fops = {
774
	.open		= blk_mq_debugfs_open,
775
	.read		= seq_read,
776
	.write		= blk_mq_debugfs_write,
777
	.llseek		= seq_lseek,
778
	.release	= blk_mq_debugfs_release,
779 780
};

781
static const struct blk_mq_debugfs_attr blk_mq_debugfs_hctx_attrs[] = {
782 783 784
	{"state", 0400, hctx_state_show},
	{"flags", 0400, hctx_flags_show},
	{"dispatch", 0400, .seq_ops = &hctx_dispatch_seq_ops},
785
	{"busy", 0400, hctx_busy_show},
786 787 788 789 790 791 792 793 794 795
	{"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},
796
	{"dispatch_busy", 0400, hctx_dispatch_busy_show},
797
	{"type", 0400, hctx_type_show},
798
	{},
799 800 801
};

static const struct blk_mq_debugfs_attr blk_mq_debugfs_ctx_attrs[] = {
M
Ming Lei 已提交
802 803 804
	{"default_rq_list", 0400, .seq_ops = &ctx_default_rq_list_seq_ops},
	{"read_rq_list", 0400, .seq_ops = &ctx_read_rq_list_seq_ops},
	{"poll_rq_list", 0400, .seq_ops = &ctx_poll_rq_list_seq_ops},
805 806 807
	{"dispatched", 0600, ctx_dispatched_show, ctx_dispatched_write},
	{"merged", 0600, ctx_merged_show, ctx_merged_write},
	{"completed", 0600, ctx_completed_show, ctx_completed_write},
808
	{},
809 810
};

811
static void debugfs_create_files(struct dentry *parent, void *data,
812 813
				 const struct blk_mq_debugfs_attr *attr)
{
814
	if (IS_ERR_OR_NULL(parent))
815
		return;
816

817 818
	d_inode(parent)->i_private = data;

819 820 821
	for (; attr->name; attr++)
		debugfs_create_file(attr->name, attr->mode, parent,
				    (void *)attr, &blk_mq_debugfs_fops);
822 823
}

824
void blk_mq_debugfs_register(struct request_queue *q)
825
{
826 827 828
	struct blk_mq_hw_ctx *hctx;
	int i;

829
	debugfs_create_files(q->debugfs_dir, q, blk_mq_debugfs_queue_attrs);
830

831
	/*
832
	 * blk_mq_init_sched() attempted to do this already, but q->debugfs_dir
833 834 835
	 * didn't exist yet (because we don't know what to name the directory
	 * until the queue is registered to a gendisk).
	 */
836 837 838 839
	if (q->elevator && !q->sched_debugfs_dir)
		blk_mq_debugfs_register_sched(q);

	/* Similarly, blk_mq_init_hctx() couldn't do this previously. */
840
	queue_for_each_hw_ctx(q, hctx, i) {
841 842 843 844
		if (!hctx->debugfs_dir)
			blk_mq_debugfs_register_hctx(q, hctx);
		if (q->elevator && !hctx->sched_debugfs_dir)
			blk_mq_debugfs_register_sched_hctx(q, hctx);
845 846
	}

M
Ming Lei 已提交
847 848 849 850 851 852 853 854
	if (q->rq_qos) {
		struct rq_qos *rqos = q->rq_qos;

		while (rqos) {
			blk_mq_debugfs_register_rqos(rqos);
			rqos = rqos->next;
		}
	}
855 856 857 858
}

void blk_mq_debugfs_unregister(struct request_queue *q)
{
859
	q->sched_debugfs_dir = NULL;
860 861
}

862 863
static void blk_mq_debugfs_register_ctx(struct blk_mq_hw_ctx *hctx,
					struct blk_mq_ctx *ctx)
864 865 866 867 868
{
	struct dentry *ctx_dir;
	char name[20];

	snprintf(name, sizeof(name), "cpu%u", ctx->cpu);
869
	ctx_dir = debugfs_create_dir(name, hctx->debugfs_dir);
870

871
	debugfs_create_files(ctx_dir, ctx, blk_mq_debugfs_ctx_attrs);
872 873
}

874 875
void blk_mq_debugfs_register_hctx(struct request_queue *q,
				  struct blk_mq_hw_ctx *hctx)
876 877 878 879 880
{
	struct blk_mq_ctx *ctx;
	char name[20];
	int i;

881
	snprintf(name, sizeof(name), "hctx%u", hctx->queue_num);
882
	hctx->debugfs_dir = debugfs_create_dir(name, q->debugfs_dir);
883

884
	debugfs_create_files(hctx->debugfs_dir, hctx, blk_mq_debugfs_hctx_attrs);
885

886 887
	hctx_for_each_ctx(hctx, ctx, i)
		blk_mq_debugfs_register_ctx(hctx, ctx);
888 889 890 891 892
}

void blk_mq_debugfs_unregister_hctx(struct blk_mq_hw_ctx *hctx)
{
	debugfs_remove_recursive(hctx->debugfs_dir);
893
	hctx->sched_debugfs_dir = NULL;
894
	hctx->debugfs_dir = NULL;
895 896
}

897
void blk_mq_debugfs_register_hctxs(struct request_queue *q)
898 899 900 901
{
	struct blk_mq_hw_ctx *hctx;
	int i;

902 903
	queue_for_each_hw_ctx(q, hctx, i)
		blk_mq_debugfs_register_hctx(q, hctx);
904 905
}

906
void blk_mq_debugfs_unregister_hctxs(struct request_queue *q)
907
{
908 909 910 911 912
	struct blk_mq_hw_ctx *hctx;
	int i;

	queue_for_each_hw_ctx(q, hctx, i)
		blk_mq_debugfs_unregister_hctx(hctx);
913
}
914

915
void blk_mq_debugfs_register_sched(struct request_queue *q)
916 917 918
{
	struct elevator_type *e = q->elevator->type;

919 920 921 922 923 924 925
	/*
	 * If the parent directory has not been created yet, return, we will be
	 * called again later on and the directory/files will be created then.
	 */
	if (!q->debugfs_dir)
		return;

926
	if (!e->queue_debugfs_attrs)
927
		return;
928 929 930

	q->sched_debugfs_dir = debugfs_create_dir("sched", q->debugfs_dir);

931
	debugfs_create_files(q->sched_debugfs_dir, q, e->queue_debugfs_attrs);
932 933 934 935 936 937 938 939
}

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

M
Ming Lei 已提交
940 941 942 943 944 945
void blk_mq_debugfs_unregister_rqos(struct rq_qos *rqos)
{
	debugfs_remove_recursive(rqos->debugfs_dir);
	rqos->debugfs_dir = NULL;
}

946
void blk_mq_debugfs_register_rqos(struct rq_qos *rqos)
M
Ming Lei 已提交
947 948 949 950 951
{
	struct request_queue *q = rqos->q;
	const char *dir_name = rq_qos_id_to_name(rqos->id);

	if (rqos->debugfs_dir || !rqos->ops->debugfs_attrs)
952
		return;
M
Ming Lei 已提交
953

954
	if (!q->rqos_debugfs_dir)
M
Ming Lei 已提交
955 956 957 958 959 960
		q->rqos_debugfs_dir = debugfs_create_dir("rqos",
							 q->debugfs_dir);

	rqos->debugfs_dir = debugfs_create_dir(dir_name,
					       rqos->q->rqos_debugfs_dir);

961
	debugfs_create_files(rqos->debugfs_dir, rqos, rqos->ops->debugfs_attrs);
M
Ming Lei 已提交
962 963 964 965 966 967 968 969
}

void blk_mq_debugfs_unregister_queue_rqos(struct request_queue *q)
{
	debugfs_remove_recursive(q->rqos_debugfs_dir);
	q->rqos_debugfs_dir = NULL;
}

970 971
void blk_mq_debugfs_register_sched_hctx(struct request_queue *q,
					struct blk_mq_hw_ctx *hctx)
972 973 974 975
{
	struct elevator_type *e = q->elevator->type;

	if (!e->hctx_debugfs_attrs)
976
		return;
977 978 979

	hctx->sched_debugfs_dir = debugfs_create_dir("sched",
						     hctx->debugfs_dir);
980 981
	debugfs_create_files(hctx->sched_debugfs_dir, hctx,
			     e->hctx_debugfs_attrs);
982 983 984 985 986 987 988
}

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