blk-mq-debugfs.c 25.3 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"
M
Ming Lei 已提交
26
#include "blk-rq-qos.h"
27

28 29 30 31 32 33 34 35 36 37 38 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 75 76 77 78 79 80 81 82 83 84 85
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");
	}
}

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

	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");

		seq_printf(m, "write (%d Bytes): ",  1 << (9+bucket));
		print_stat(m, &q->poll_stat[2*bucket+1]);
		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,
};

86 87 88 89 90 91 92 93 94 95
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)
96
			seq_puts(m, "|");
97 98 99 100 101 102 103 104 105
		sep = true;
		if (i < flag_name_count && flag_name[i])
			seq_puts(m, flag_name[i]);
		else
			seq_printf(m, "%d", i);
	}
	return 0;
}

106 107 108 109 110 111 112 113
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;
}

114
#define QUEUE_FLAG_NAME(name) [QUEUE_FLAG_##name] = #name
115
static const char *const blk_queue_flag_name[] = {
116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139
	QUEUE_FLAG_NAME(STOPPED),
	QUEUE_FLAG_NAME(DYING),
	QUEUE_FLAG_NAME(BIDI),
	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(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),
140 141
	QUEUE_FLAG_NAME(SCSI_PASSTHROUGH),
	QUEUE_FLAG_NAME(QUIESCED),
142
};
143
#undef QUEUE_FLAG_NAME
144

145
static int queue_state_show(void *data, struct seq_file *m)
146
{
147
	struct request_queue *q = data;
148 149 150

	blk_flags_show(m, q->queue_flags, blk_queue_flag_name,
		       ARRAY_SIZE(blk_queue_flag_name));
151
	seq_puts(m, "\n");
152 153 154
	return 0;
}

155 156
static ssize_t queue_state_write(void *data, const char __user *buf,
				 size_t count, loff_t *ppos)
157
{
158
	struct request_queue *q = data;
159
	char opbuf[16] = { }, *op;
160

161 162 163 164 165 166 167 168
	/*
	 * 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;

169
	if (count >= sizeof(opbuf)) {
170 171 172 173
		pr_err("%s: operation too long\n", __func__);
		goto inval;
	}

174
	if (copy_from_user(opbuf, buf, count))
175
		return -EFAULT;
176
	op = strstrip(opbuf);
177 178 179 180
	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);
181 182
	} else if (strcmp(op, "kick") == 0) {
		blk_mq_kick_requeue_list(q);
183
	} else {
184 185
		pr_err("%s: unsupported operation '%s'\n", __func__, op);
inval:
186
		pr_err("%s: use 'run', 'start' or 'kick'\n", __func__);
187 188
		return -EINVAL;
	}
189
	return count;
190 191
}

192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214
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;
}

215 216 217
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 },
218
	{ "pm_only", 0600, queue_pm_only_show, NULL },
219 220
	{ "state", 0600, queue_state_show, queue_state_write },
	{ "write_hints", 0600, queue_write_hint_show, queue_write_hint_store },
221
	{ "zone_wlock", 0400, queue_zone_wlock_show, NULL },
222 223
	{ },
};
224

225
#define HCTX_STATE_NAME(name) [BLK_MQ_S_##name] = #name
226
static const char *const hctx_state_name[] = {
227 228 229
	HCTX_STATE_NAME(STOPPED),
	HCTX_STATE_NAME(TAG_ACTIVE),
	HCTX_STATE_NAME(SCHED_RESTART),
230
};
231 232
#undef HCTX_STATE_NAME

233
static int hctx_state_show(void *data, struct seq_file *m)
234
{
235
	struct blk_mq_hw_ctx *hctx = data;
236

237 238
	blk_flags_show(m, hctx->state, hctx_state_name,
		       ARRAY_SIZE(hctx_state_name));
239
	seq_puts(m, "\n");
240 241 242
	return 0;
}

243
#define BLK_TAG_ALLOC_NAME(name) [BLK_TAG_ALLOC_##name] = #name
244
static const char *const alloc_policy_name[] = {
245 246
	BLK_TAG_ALLOC_NAME(FIFO),
	BLK_TAG_ALLOC_NAME(RR),
247
};
248
#undef BLK_TAG_ALLOC_NAME
249

250
#define HCTX_FLAG_NAME(name) [ilog2(BLK_MQ_F_##name)] = #name
251
static const char *const hctx_flag_name[] = {
252 253 254 255 256
	HCTX_FLAG_NAME(SHOULD_MERGE),
	HCTX_FLAG_NAME(TAG_SHARED),
	HCTX_FLAG_NAME(SG_MERGE),
	HCTX_FLAG_NAME(BLOCKING),
	HCTX_FLAG_NAME(NO_SCHED),
257
};
258
#undef HCTX_FLAG_NAME
259

260
static int hctx_flags_show(void *data, struct seq_file *m)
261
{
262
	struct blk_mq_hw_ctx *hctx = data;
263
	const int alloc_policy = BLK_MQ_FLAG_TO_ALLOC_POLICY(hctx->flags);
264

265 266 267 268 269 270 271 272 273 274
	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));
275
	seq_puts(m, "\n");
276 277 278
	return 0;
}

279
#define REQ_OP_NAME(name) [REQ_OP_##name] = #name
280
static const char *const op_name[] = {
281 282 283 284 285 286 287 288 289 290 291 292
	REQ_OP_NAME(READ),
	REQ_OP_NAME(WRITE),
	REQ_OP_NAME(FLUSH),
	REQ_OP_NAME(DISCARD),
	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),
293
};
294
#undef REQ_OP_NAME
295

296
#define CMD_FLAG_NAME(name) [__REQ_##name] = #name
297
static const char *const cmd_flag_name[] = {
298 299 300 301 302 303 304 305 306 307 308 309 310 311
	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),
312
	CMD_FLAG_NAME(NOWAIT),
313
};
314
#undef CMD_FLAG_NAME
315

316
#define RQF_NAME(name) [ilog2((__force u32)RQF_##name)] = #name
317
static const char *const rqf_name[] = {
318
	RQF_NAME(SORTED),
319
	RQF_NAME(STARTED),
320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335
	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),
336
	RQF_NAME(ZONE_WRITE_LOCKED),
J
Jens Axboe 已提交
337
	RQF_NAME(MQ_POLL_SLEPT),
338
};
339
#undef RQF_NAME
340

341 342 343 344 345 346 347 348
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)
{
349
	if (WARN_ON_ONCE((unsigned int)rq_state >=
350 351 352 353 354
			 ARRAY_SIZE(blk_mq_rq_state_name_array)))
		return "(?)";
	return blk_mq_rq_state_name_array[rq_state];
}

355
int __blk_mq_debugfs_rq_show(struct seq_file *m, struct request *rq)
356
{
357
	const struct blk_mq_ops *const mq_ops = rq->q->mq_ops;
358
	const unsigned int op = rq->cmd_flags & REQ_OP_MASK;
359

360 361 362 363 364 365 366 367 368 369 370
	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));
371
	seq_printf(m, ", .state=%s", blk_mq_rq_state_name(blk_mq_rq_state(rq)));
372
	seq_printf(m, ", .tag=%d, .internal_tag=%d", rq->tag,
373
		   rq->internal_tag);
374 375 376
	if (mq_ops->show_rq)
		mq_ops->show_rq(m, rq);
	seq_puts(m, "}\n");
377 378
	return 0;
}
379 380 381 382 383 384
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 已提交
385
EXPORT_SYMBOL_GPL(blk_mq_debugfs_rq_show);
386 387

static void *hctx_dispatch_start(struct seq_file *m, loff_t *pos)
388
	__acquires(&hctx->lock)
389 390 391 392 393 394 395 396 397 398 399 400 401 402 403
{
	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)
404
	__releases(&hctx->lock)
405 406 407 408 409 410 411 412 413 414 415 416 417
{
	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,
};

418 419 420 421 422 423 424
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,
425 426
 * e.g. due to a concurrent blk_mq_finish_request() call. Returns true to
 * keep iterating requests.
427
 */
428
static bool hctx_show_busy_rq(struct request *rq, void *data, bool reserved)
429 430 431
{
	const struct show_busy_params *params = data;

432
	if (rq->mq_hctx == params->hctx)
433 434
		__blk_mq_debugfs_rq_show(params->m,
					 list_entry_rq(&rq->queuelist));
435 436

	return true;
437 438 439 440 441 442 443 444 445 446 447 448 449
}

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

450
static int hctx_ctx_map_show(void *data, struct seq_file *m)
451
{
452
	struct blk_mq_hw_ctx *hctx = data;
453 454 455 456 457

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

458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474
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);
	}
}

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 482 483
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
484 485 486 487
	if (hctx->tags)
		blk_mq_debugfs_tags_show(m, hctx->tags);
	mutex_unlock(&q->sysfs_lock);

488 489
out:
	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 499 500
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
501 502 503
	if (hctx->tags)
		sbitmap_bitmap_show(&hctx->tags->bitmap_tags.sb, m);
	mutex_unlock(&q->sysfs_lock);
504 505 506

out:
	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 516 517
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
518 519 520 521
	if (hctx->sched_tags)
		blk_mq_debugfs_tags_show(m, hctx->sched_tags);
	mutex_unlock(&q->sysfs_lock);

522 523
out:
	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 533 534
	res = mutex_lock_interruptible(&q->sysfs_lock);
	if (res)
		goto out;
535 536 537
	if (hctx->sched_tags)
		sbitmap_bitmap_show(&hctx->sched_tags->bitmap_tags.sb, m);
	mutex_unlock(&q->sysfs_lock);
538 539 540

out:
	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 548 549 550 551 552

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

553
static ssize_t hctx_io_poll_write(void *data, const char __user *buf,
554 555
				  size_t count, loff_t *ppos)
{
556
	struct blk_mq_hw_ctx *hctx = data;
557 558 559 560 561

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

562
static int hctx_dispatched_show(void *data, struct seq_file *m)
563
{
564
	struct blk_mq_hw_ctx *hctx = data;
565 566 567 568 569 570 571 572 573 574 575 576 577 578
	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;
}

579
static ssize_t hctx_dispatched_write(void *data, const char __user *buf,
580 581
				     size_t count, loff_t *ppos)
{
582
	struct blk_mq_hw_ctx *hctx = data;
583 584 585 586 587 588 589
	int i;

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

590
static int hctx_queued_show(void *data, struct seq_file *m)
591
{
592
	struct blk_mq_hw_ctx *hctx = data;
593 594 595 596 597

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

598
static ssize_t hctx_queued_write(void *data, const char __user *buf,
599 600
				 size_t count, loff_t *ppos)
{
601
	struct blk_mq_hw_ctx *hctx = data;
602 603 604 605 606

	hctx->queued = 0;
	return count;
}

607
static int hctx_run_show(void *data, struct seq_file *m)
608
{
609
	struct blk_mq_hw_ctx *hctx = data;
610 611 612 613 614

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

615 616
static ssize_t hctx_run_write(void *data, const char __user *buf, size_t count,
			      loff_t *ppos)
617
{
618
	struct blk_mq_hw_ctx *hctx = data;
619 620 621 622 623

	hctx->run = 0;
	return count;
}

624
static int hctx_active_show(void *data, struct seq_file *m)
625
{
626
	struct blk_mq_hw_ctx *hctx = data;
627 628 629 630 631

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

632 633 634 635 636 637 638 639
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;
}

640
static void *ctx_rq_list_start(struct seq_file *m, loff_t *pos)
641
	__acquires(&ctx->lock)
642 643 644 645 646 647 648 649 650 651 652 653 654 655 656
{
	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)
657
	__releases(&ctx->lock)
658 659 660 661 662 663 664 665 666 667 668 669
{
	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,
};
670
static int ctx_dispatched_show(void *data, struct seq_file *m)
671
{
672
	struct blk_mq_ctx *ctx = data;
673 674 675 676 677

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

678
static ssize_t ctx_dispatched_write(void *data, const char __user *buf,
679 680
				    size_t count, loff_t *ppos)
{
681
	struct blk_mq_ctx *ctx = data;
682 683 684 685 686

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

687
static int ctx_merged_show(void *data, struct seq_file *m)
688
{
689
	struct blk_mq_ctx *ctx = data;
690 691 692 693 694

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

695 696
static ssize_t ctx_merged_write(void *data, const char __user *buf,
				size_t count, loff_t *ppos)
697
{
698
	struct blk_mq_ctx *ctx = data;
699 700 701 702 703

	ctx->rq_merged = 0;
	return count;
}

704
static int ctx_completed_show(void *data, struct seq_file *m)
705
{
706
	struct blk_mq_ctx *ctx = data;
707 708 709 710 711

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

712 713
static ssize_t ctx_completed_write(void *data, const char __user *buf,
				   size_t count, loff_t *ppos)
714
{
715 716 717 718
	struct blk_mq_ctx *ctx = data;

	ctx->rq_completed[0] = ctx->rq_completed[1] = 0;
	return count;
719 720
}

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

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

768 769 770 771 772 773 774 775 776 777
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);
}

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 788 789
	{"state", 0400, hctx_state_show},
	{"flags", 0400, hctx_flags_show},
	{"dispatch", 0400, .seq_ops = &hctx_dispatch_seq_ops},
790
	{"busy", 0400, hctx_busy_show},
791 792 793 794 795 796 797 798 799 800
	{"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},
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 807 808 809
	{"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},
810
	{},
811 812
};

813 814 815 816 817 818 819 820 821 822 823 824 825
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;
}

826
int blk_mq_debugfs_register(struct request_queue *q)
827
{
828 829 830
	struct blk_mq_hw_ctx *hctx;
	int i;

831
	if (!blk_debugfs_root)
832 833
		return -ENOENT;

834 835
	q->debugfs_dir = debugfs_create_dir(kobject_name(q->kobj.parent),
					    blk_debugfs_root);
836
	if (!q->debugfs_dir)
837
		return -ENOMEM;
838

839 840
	if (!debugfs_create_files(q->debugfs_dir, q,
				  blk_mq_debugfs_queue_attrs))
841 842
		goto err;

843
	/*
844
	 * blk_mq_init_sched() attempted to do this already, but q->debugfs_dir
845 846 847
	 * didn't exist yet (because we don't know what to name the directory
	 * until the queue is registered to a gendisk).
	 */
848 849 850 851
	if (q->elevator && !q->sched_debugfs_dir)
		blk_mq_debugfs_register_sched(q);

	/* Similarly, blk_mq_init_hctx() couldn't do this previously. */
852 853 854
	queue_for_each_hw_ctx(q, hctx, i) {
		if (!hctx->debugfs_dir && blk_mq_debugfs_register_hctx(q, hctx))
			goto err;
855 856 857
		if (q->elevator && !hctx->sched_debugfs_dir &&
		    blk_mq_debugfs_register_sched_hctx(q, hctx))
			goto err;
858 859
	}

M
Ming Lei 已提交
860 861 862 863 864 865 866 867 868
	if (q->rq_qos) {
		struct rq_qos *rqos = q->rq_qos;

		while (rqos) {
			blk_mq_debugfs_register_rqos(rqos);
			rqos = rqos->next;
		}
	}

869 870 871 872 873 874 875 876 877 878
	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);
879
	q->sched_debugfs_dir = NULL;
880 881 882
	q->debugfs_dir = NULL;
}

883 884
static int blk_mq_debugfs_register_ctx(struct blk_mq_hw_ctx *hctx,
				       struct blk_mq_ctx *ctx)
885 886 887 888 889
{
	struct dentry *ctx_dir;
	char name[20];

	snprintf(name, sizeof(name), "cpu%u", ctx->cpu);
890
	ctx_dir = debugfs_create_dir(name, hctx->debugfs_dir);
891 892 893
	if (!ctx_dir)
		return -ENOMEM;

894 895
	if (!debugfs_create_files(ctx_dir, ctx, blk_mq_debugfs_ctx_attrs))
		return -ENOMEM;
896 897 898 899

	return 0;
}

900 901
int blk_mq_debugfs_register_hctx(struct request_queue *q,
				 struct blk_mq_hw_ctx *hctx)
902 903 904 905 906
{
	struct blk_mq_ctx *ctx;
	char name[20];
	int i;

907 908 909
	if (!q->debugfs_dir)
		return -ENOENT;

910
	snprintf(name, sizeof(name), "hctx%u", hctx->queue_num);
911 912
	hctx->debugfs_dir = debugfs_create_dir(name, q->debugfs_dir);
	if (!hctx->debugfs_dir)
913 914
		return -ENOMEM;

915 916 917
	if (!debugfs_create_files(hctx->debugfs_dir, hctx,
				  blk_mq_debugfs_hctx_attrs))
		goto err;
918 919

	hctx_for_each_ctx(hctx, ctx, i) {
920 921
		if (blk_mq_debugfs_register_ctx(hctx, ctx))
			goto err;
922 923 924
	}

	return 0;
925 926 927 928 929 930 931 932 933

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);
934
	hctx->sched_debugfs_dir = NULL;
935
	hctx->debugfs_dir = NULL;
936 937
}

938
int blk_mq_debugfs_register_hctxs(struct request_queue *q)
939 940 941 942 943 944
{
	struct blk_mq_hw_ctx *hctx;
	int i;

	queue_for_each_hw_ctx(q, hctx, i) {
		if (blk_mq_debugfs_register_hctx(q, hctx))
945
			return -ENOMEM;
946 947 948 949 950
	}

	return 0;
}

951
void blk_mq_debugfs_unregister_hctxs(struct request_queue *q)
952
{
953 954 955 956 957
	struct blk_mq_hw_ctx *hctx;
	int i;

	queue_for_each_hw_ctx(q, hctx, i)
		blk_mq_debugfs_unregister_hctx(hctx);
958
}
959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990

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

M
Ming Lei 已提交
991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034
void blk_mq_debugfs_unregister_rqos(struct rq_qos *rqos)
{
	debugfs_remove_recursive(rqos->debugfs_dir);
	rqos->debugfs_dir = NULL;
}

int blk_mq_debugfs_register_rqos(struct rq_qos *rqos)
{
	struct request_queue *q = rqos->q;
	const char *dir_name = rq_qos_id_to_name(rqos->id);

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

	if (rqos->debugfs_dir || !rqos->ops->debugfs_attrs)
		return 0;

	if (!q->rqos_debugfs_dir) {
		q->rqos_debugfs_dir = debugfs_create_dir("rqos",
							 q->debugfs_dir);
		if (!q->rqos_debugfs_dir)
			return -ENOMEM;
	}

	rqos->debugfs_dir = debugfs_create_dir(dir_name,
					       rqos->q->rqos_debugfs_dir);
	if (!rqos->debugfs_dir)
		return -ENOMEM;

	if (!debugfs_create_files(rqos->debugfs_dir, rqos,
				  rqos->ops->debugfs_attrs))
		goto err;
	return 0;
 err:
	blk_mq_debugfs_unregister_rqos(rqos);
	return -ENOMEM;
}

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

1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062
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;
}