1 /* 2 * Copyright (C) 2017 Facebook 3 * 4 * This program is free software; you can redistribute it and/or 5 * modify it under the terms of the GNU General Public 6 * License v2 as published by the Free Software Foundation. 7 * 8 * This program is distributed in the hope that it will be useful, 9 * but WITHOUT ANY WARRANTY; without even the implied warranty of 10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 11 * General Public License for more details. 12 * 13 * You should have received a copy of the GNU General Public License 14 * along with this program. If not, see <https://www.gnu.org/licenses/>. 15 */ 16 17 #include <linux/kernel.h> 18 #include <linux/blkdev.h> 19 #include <linux/debugfs.h> 20 21 #include <linux/blk-mq.h> 22 #include "blk.h" 23 #include "blk-mq.h" 24 #include "blk-mq-debugfs.h" 25 #include "blk-mq-tag.h" 26 27 static void print_stat(struct seq_file *m, struct blk_rq_stat *stat) 28 { 29 if (stat->nr_samples) { 30 seq_printf(m, "samples=%d, mean=%lld, min=%llu, max=%llu", 31 stat->nr_samples, stat->mean, stat->min, stat->max); 32 } else { 33 seq_puts(m, "samples=0"); 34 } 35 } 36 37 static int queue_poll_stat_show(void *data, struct seq_file *m) 38 { 39 struct request_queue *q = data; 40 int bucket; 41 42 for (bucket = 0; bucket < BLK_MQ_POLL_STATS_BKTS/2; bucket++) { 43 seq_printf(m, "read (%d Bytes): ", 1 << (9+bucket)); 44 print_stat(m, &q->poll_stat[2*bucket]); 45 seq_puts(m, "\n"); 46 47 seq_printf(m, "write (%d Bytes): ", 1 << (9+bucket)); 48 print_stat(m, &q->poll_stat[2*bucket+1]); 49 seq_puts(m, "\n"); 50 } 51 return 0; 52 } 53 54 static void *queue_requeue_list_start(struct seq_file *m, loff_t *pos) 55 __acquires(&q->requeue_lock) 56 { 57 struct request_queue *q = m->private; 58 59 spin_lock_irq(&q->requeue_lock); 60 return seq_list_start(&q->requeue_list, *pos); 61 } 62 63 static void *queue_requeue_list_next(struct seq_file *m, void *v, loff_t *pos) 64 { 65 struct request_queue *q = m->private; 66 67 return seq_list_next(v, &q->requeue_list, pos); 68 } 69 70 static void queue_requeue_list_stop(struct seq_file *m, void *v) 71 __releases(&q->requeue_lock) 72 { 73 struct request_queue *q = m->private; 74 75 spin_unlock_irq(&q->requeue_lock); 76 } 77 78 static const struct seq_operations queue_requeue_list_seq_ops = { 79 .start = queue_requeue_list_start, 80 .next = queue_requeue_list_next, 81 .stop = queue_requeue_list_stop, 82 .show = blk_mq_debugfs_rq_show, 83 }; 84 85 static int blk_flags_show(struct seq_file *m, const unsigned long flags, 86 const char *const *flag_name, int flag_name_count) 87 { 88 bool sep = false; 89 int i; 90 91 for (i = 0; i < sizeof(flags) * BITS_PER_BYTE; i++) { 92 if (!(flags & BIT(i))) 93 continue; 94 if (sep) 95 seq_puts(m, "|"); 96 sep = true; 97 if (i < flag_name_count && flag_name[i]) 98 seq_puts(m, flag_name[i]); 99 else 100 seq_printf(m, "%d", i); 101 } 102 return 0; 103 } 104 105 #define QUEUE_FLAG_NAME(name) [QUEUE_FLAG_##name] = #name 106 static const char *const blk_queue_flag_name[] = { 107 QUEUE_FLAG_NAME(QUEUED), 108 QUEUE_FLAG_NAME(STOPPED), 109 QUEUE_FLAG_NAME(DYING), 110 QUEUE_FLAG_NAME(BYPASS), 111 QUEUE_FLAG_NAME(BIDI), 112 QUEUE_FLAG_NAME(NOMERGES), 113 QUEUE_FLAG_NAME(SAME_COMP), 114 QUEUE_FLAG_NAME(FAIL_IO), 115 QUEUE_FLAG_NAME(NONROT), 116 QUEUE_FLAG_NAME(IO_STAT), 117 QUEUE_FLAG_NAME(DISCARD), 118 QUEUE_FLAG_NAME(NOXMERGES), 119 QUEUE_FLAG_NAME(ADD_RANDOM), 120 QUEUE_FLAG_NAME(SECERASE), 121 QUEUE_FLAG_NAME(SAME_FORCE), 122 QUEUE_FLAG_NAME(DEAD), 123 QUEUE_FLAG_NAME(INIT_DONE), 124 QUEUE_FLAG_NAME(NO_SG_MERGE), 125 QUEUE_FLAG_NAME(POLL), 126 QUEUE_FLAG_NAME(WC), 127 QUEUE_FLAG_NAME(FUA), 128 QUEUE_FLAG_NAME(FLUSH_NQ), 129 QUEUE_FLAG_NAME(DAX), 130 QUEUE_FLAG_NAME(STATS), 131 QUEUE_FLAG_NAME(POLL_STATS), 132 QUEUE_FLAG_NAME(REGISTERED), 133 QUEUE_FLAG_NAME(SCSI_PASSTHROUGH), 134 QUEUE_FLAG_NAME(QUIESCED), 135 QUEUE_FLAG_NAME(PREEMPT_ONLY), 136 }; 137 #undef QUEUE_FLAG_NAME 138 139 static int queue_state_show(void *data, struct seq_file *m) 140 { 141 struct request_queue *q = data; 142 143 blk_flags_show(m, q->queue_flags, blk_queue_flag_name, 144 ARRAY_SIZE(blk_queue_flag_name)); 145 seq_puts(m, "\n"); 146 return 0; 147 } 148 149 static ssize_t queue_state_write(void *data, const char __user *buf, 150 size_t count, loff_t *ppos) 151 { 152 struct request_queue *q = data; 153 char opbuf[16] = { }, *op; 154 155 /* 156 * The "state" attribute is removed after blk_cleanup_queue() has called 157 * blk_mq_free_queue(). Return if QUEUE_FLAG_DEAD has been set to avoid 158 * triggering a use-after-free. 159 */ 160 if (blk_queue_dead(q)) 161 return -ENOENT; 162 163 if (count >= sizeof(opbuf)) { 164 pr_err("%s: operation too long\n", __func__); 165 goto inval; 166 } 167 168 if (copy_from_user(opbuf, buf, count)) 169 return -EFAULT; 170 op = strstrip(opbuf); 171 if (strcmp(op, "run") == 0) { 172 blk_mq_run_hw_queues(q, true); 173 } else if (strcmp(op, "start") == 0) { 174 blk_mq_start_stopped_hw_queues(q, true); 175 } else if (strcmp(op, "kick") == 0) { 176 blk_mq_kick_requeue_list(q); 177 } else { 178 pr_err("%s: unsupported operation '%s'\n", __func__, op); 179 inval: 180 pr_err("%s: use 'run', 'start' or 'kick'\n", __func__); 181 return -EINVAL; 182 } 183 return count; 184 } 185 186 static int queue_write_hint_show(void *data, struct seq_file *m) 187 { 188 struct request_queue *q = data; 189 int i; 190 191 for (i = 0; i < BLK_MAX_WRITE_HINTS; i++) 192 seq_printf(m, "hint%d: %llu\n", i, q->write_hints[i]); 193 194 return 0; 195 } 196 197 static ssize_t queue_write_hint_store(void *data, const char __user *buf, 198 size_t count, loff_t *ppos) 199 { 200 struct request_queue *q = data; 201 int i; 202 203 for (i = 0; i < BLK_MAX_WRITE_HINTS; i++) 204 q->write_hints[i] = 0; 205 206 return count; 207 } 208 209 static int queue_zone_wlock_show(void *data, struct seq_file *m) 210 { 211 struct request_queue *q = data; 212 unsigned int i; 213 214 if (!q->seq_zones_wlock) 215 return 0; 216 217 for (i = 0; i < blk_queue_nr_zones(q); i++) 218 if (test_bit(i, q->seq_zones_wlock)) 219 seq_printf(m, "%u\n", i); 220 221 return 0; 222 } 223 224 static const struct blk_mq_debugfs_attr blk_mq_debugfs_queue_attrs[] = { 225 { "poll_stat", 0400, queue_poll_stat_show }, 226 { "requeue_list", 0400, .seq_ops = &queue_requeue_list_seq_ops }, 227 { "state", 0600, queue_state_show, queue_state_write }, 228 { "write_hints", 0600, queue_write_hint_show, queue_write_hint_store }, 229 { "zone_wlock", 0400, queue_zone_wlock_show, NULL }, 230 { }, 231 }; 232 233 #define HCTX_STATE_NAME(name) [BLK_MQ_S_##name] = #name 234 static const char *const hctx_state_name[] = { 235 HCTX_STATE_NAME(STOPPED), 236 HCTX_STATE_NAME(TAG_ACTIVE), 237 HCTX_STATE_NAME(SCHED_RESTART), 238 HCTX_STATE_NAME(START_ON_RUN), 239 }; 240 #undef HCTX_STATE_NAME 241 242 static int hctx_state_show(void *data, struct seq_file *m) 243 { 244 struct blk_mq_hw_ctx *hctx = data; 245 246 blk_flags_show(m, hctx->state, hctx_state_name, 247 ARRAY_SIZE(hctx_state_name)); 248 seq_puts(m, "\n"); 249 return 0; 250 } 251 252 #define BLK_TAG_ALLOC_NAME(name) [BLK_TAG_ALLOC_##name] = #name 253 static const char *const alloc_policy_name[] = { 254 BLK_TAG_ALLOC_NAME(FIFO), 255 BLK_TAG_ALLOC_NAME(RR), 256 }; 257 #undef BLK_TAG_ALLOC_NAME 258 259 #define HCTX_FLAG_NAME(name) [ilog2(BLK_MQ_F_##name)] = #name 260 static const char *const hctx_flag_name[] = { 261 HCTX_FLAG_NAME(SHOULD_MERGE), 262 HCTX_FLAG_NAME(TAG_SHARED), 263 HCTX_FLAG_NAME(SG_MERGE), 264 HCTX_FLAG_NAME(BLOCKING), 265 HCTX_FLAG_NAME(NO_SCHED), 266 }; 267 #undef HCTX_FLAG_NAME 268 269 static int hctx_flags_show(void *data, struct seq_file *m) 270 { 271 struct blk_mq_hw_ctx *hctx = data; 272 const int alloc_policy = BLK_MQ_FLAG_TO_ALLOC_POLICY(hctx->flags); 273 274 seq_puts(m, "alloc_policy="); 275 if (alloc_policy < ARRAY_SIZE(alloc_policy_name) && 276 alloc_policy_name[alloc_policy]) 277 seq_puts(m, alloc_policy_name[alloc_policy]); 278 else 279 seq_printf(m, "%d", alloc_policy); 280 seq_puts(m, " "); 281 blk_flags_show(m, 282 hctx->flags ^ BLK_ALLOC_POLICY_TO_MQ_FLAG(alloc_policy), 283 hctx_flag_name, ARRAY_SIZE(hctx_flag_name)); 284 seq_puts(m, "\n"); 285 return 0; 286 } 287 288 #define REQ_OP_NAME(name) [REQ_OP_##name] = #name 289 static const char *const op_name[] = { 290 REQ_OP_NAME(READ), 291 REQ_OP_NAME(WRITE), 292 REQ_OP_NAME(FLUSH), 293 REQ_OP_NAME(DISCARD), 294 REQ_OP_NAME(ZONE_REPORT), 295 REQ_OP_NAME(SECURE_ERASE), 296 REQ_OP_NAME(ZONE_RESET), 297 REQ_OP_NAME(WRITE_SAME), 298 REQ_OP_NAME(WRITE_ZEROES), 299 REQ_OP_NAME(SCSI_IN), 300 REQ_OP_NAME(SCSI_OUT), 301 REQ_OP_NAME(DRV_IN), 302 REQ_OP_NAME(DRV_OUT), 303 }; 304 #undef REQ_OP_NAME 305 306 #define CMD_FLAG_NAME(name) [__REQ_##name] = #name 307 static const char *const cmd_flag_name[] = { 308 CMD_FLAG_NAME(FAILFAST_DEV), 309 CMD_FLAG_NAME(FAILFAST_TRANSPORT), 310 CMD_FLAG_NAME(FAILFAST_DRIVER), 311 CMD_FLAG_NAME(SYNC), 312 CMD_FLAG_NAME(META), 313 CMD_FLAG_NAME(PRIO), 314 CMD_FLAG_NAME(NOMERGE), 315 CMD_FLAG_NAME(IDLE), 316 CMD_FLAG_NAME(INTEGRITY), 317 CMD_FLAG_NAME(FUA), 318 CMD_FLAG_NAME(PREFLUSH), 319 CMD_FLAG_NAME(RAHEAD), 320 CMD_FLAG_NAME(BACKGROUND), 321 CMD_FLAG_NAME(NOUNMAP), 322 CMD_FLAG_NAME(NOWAIT), 323 }; 324 #undef CMD_FLAG_NAME 325 326 #define RQF_NAME(name) [ilog2((__force u32)RQF_##name)] = #name 327 static const char *const rqf_name[] = { 328 RQF_NAME(SORTED), 329 RQF_NAME(STARTED), 330 RQF_NAME(QUEUED), 331 RQF_NAME(SOFTBARRIER), 332 RQF_NAME(FLUSH_SEQ), 333 RQF_NAME(MIXED_MERGE), 334 RQF_NAME(MQ_INFLIGHT), 335 RQF_NAME(DONTPREP), 336 RQF_NAME(PREEMPT), 337 RQF_NAME(COPY_USER), 338 RQF_NAME(FAILED), 339 RQF_NAME(QUIET), 340 RQF_NAME(ELVPRIV), 341 RQF_NAME(IO_STAT), 342 RQF_NAME(ALLOCED), 343 RQF_NAME(PM), 344 RQF_NAME(HASHED), 345 RQF_NAME(STATS), 346 RQF_NAME(SPECIAL_PAYLOAD), 347 RQF_NAME(ZONE_WRITE_LOCKED), 348 RQF_NAME(MQ_TIMEOUT_EXPIRED), 349 RQF_NAME(MQ_POLL_SLEPT), 350 }; 351 #undef RQF_NAME 352 353 static const char *const blk_mq_rq_state_name_array[] = { 354 [MQ_RQ_IDLE] = "idle", 355 [MQ_RQ_IN_FLIGHT] = "in_flight", 356 [MQ_RQ_COMPLETE] = "complete", 357 }; 358 359 static const char *blk_mq_rq_state_name(enum mq_rq_state rq_state) 360 { 361 if (WARN_ON_ONCE((unsigned int)rq_state > 362 ARRAY_SIZE(blk_mq_rq_state_name_array))) 363 return "(?)"; 364 return blk_mq_rq_state_name_array[rq_state]; 365 } 366 367 int __blk_mq_debugfs_rq_show(struct seq_file *m, struct request *rq) 368 { 369 const struct blk_mq_ops *const mq_ops = rq->q->mq_ops; 370 const unsigned int op = rq->cmd_flags & REQ_OP_MASK; 371 372 seq_printf(m, "%p {.op=", rq); 373 if (op < ARRAY_SIZE(op_name) && op_name[op]) 374 seq_printf(m, "%s", op_name[op]); 375 else 376 seq_printf(m, "%d", op); 377 seq_puts(m, ", .cmd_flags="); 378 blk_flags_show(m, rq->cmd_flags & ~REQ_OP_MASK, cmd_flag_name, 379 ARRAY_SIZE(cmd_flag_name)); 380 seq_puts(m, ", .rq_flags="); 381 blk_flags_show(m, (__force unsigned int)rq->rq_flags, rqf_name, 382 ARRAY_SIZE(rqf_name)); 383 seq_printf(m, ", .state=%s", blk_mq_rq_state_name(blk_mq_rq_state(rq))); 384 seq_printf(m, ", .tag=%d, .internal_tag=%d", rq->tag, 385 rq->internal_tag); 386 if (mq_ops->show_rq) 387 mq_ops->show_rq(m, rq); 388 seq_puts(m, "}\n"); 389 return 0; 390 } 391 EXPORT_SYMBOL_GPL(__blk_mq_debugfs_rq_show); 392 393 int blk_mq_debugfs_rq_show(struct seq_file *m, void *v) 394 { 395 return __blk_mq_debugfs_rq_show(m, list_entry_rq(v)); 396 } 397 EXPORT_SYMBOL_GPL(blk_mq_debugfs_rq_show); 398 399 static void *hctx_dispatch_start(struct seq_file *m, loff_t *pos) 400 __acquires(&hctx->lock) 401 { 402 struct blk_mq_hw_ctx *hctx = m->private; 403 404 spin_lock(&hctx->lock); 405 return seq_list_start(&hctx->dispatch, *pos); 406 } 407 408 static void *hctx_dispatch_next(struct seq_file *m, void *v, loff_t *pos) 409 { 410 struct blk_mq_hw_ctx *hctx = m->private; 411 412 return seq_list_next(v, &hctx->dispatch, pos); 413 } 414 415 static void hctx_dispatch_stop(struct seq_file *m, void *v) 416 __releases(&hctx->lock) 417 { 418 struct blk_mq_hw_ctx *hctx = m->private; 419 420 spin_unlock(&hctx->lock); 421 } 422 423 static const struct seq_operations hctx_dispatch_seq_ops = { 424 .start = hctx_dispatch_start, 425 .next = hctx_dispatch_next, 426 .stop = hctx_dispatch_stop, 427 .show = blk_mq_debugfs_rq_show, 428 }; 429 430 struct show_busy_params { 431 struct seq_file *m; 432 struct blk_mq_hw_ctx *hctx; 433 }; 434 435 /* 436 * Note: the state of a request may change while this function is in progress, 437 * e.g. due to a concurrent blk_mq_finish_request() call. 438 */ 439 static void hctx_show_busy_rq(struct request *rq, void *data, bool reserved) 440 { 441 const struct show_busy_params *params = data; 442 443 if (blk_mq_map_queue(rq->q, rq->mq_ctx->cpu) == params->hctx && 444 blk_mq_rq_state(rq) != MQ_RQ_IDLE) 445 __blk_mq_debugfs_rq_show(params->m, 446 list_entry_rq(&rq->queuelist)); 447 } 448 449 static int hctx_busy_show(void *data, struct seq_file *m) 450 { 451 struct blk_mq_hw_ctx *hctx = data; 452 struct show_busy_params params = { .m = m, .hctx = hctx }; 453 454 blk_mq_tagset_busy_iter(hctx->queue->tag_set, hctx_show_busy_rq, 455 ¶ms); 456 457 return 0; 458 } 459 460 static int hctx_ctx_map_show(void *data, struct seq_file *m) 461 { 462 struct blk_mq_hw_ctx *hctx = data; 463 464 sbitmap_bitmap_show(&hctx->ctx_map, m); 465 return 0; 466 } 467 468 static void blk_mq_debugfs_tags_show(struct seq_file *m, 469 struct blk_mq_tags *tags) 470 { 471 seq_printf(m, "nr_tags=%u\n", tags->nr_tags); 472 seq_printf(m, "nr_reserved_tags=%u\n", tags->nr_reserved_tags); 473 seq_printf(m, "active_queues=%d\n", 474 atomic_read(&tags->active_queues)); 475 476 seq_puts(m, "\nbitmap_tags:\n"); 477 sbitmap_queue_show(&tags->bitmap_tags, m); 478 479 if (tags->nr_reserved_tags) { 480 seq_puts(m, "\nbreserved_tags:\n"); 481 sbitmap_queue_show(&tags->breserved_tags, m); 482 } 483 } 484 485 static int hctx_tags_show(void *data, struct seq_file *m) 486 { 487 struct blk_mq_hw_ctx *hctx = data; 488 struct request_queue *q = hctx->queue; 489 int res; 490 491 res = mutex_lock_interruptible(&q->sysfs_lock); 492 if (res) 493 goto out; 494 if (hctx->tags) 495 blk_mq_debugfs_tags_show(m, hctx->tags); 496 mutex_unlock(&q->sysfs_lock); 497 498 out: 499 return res; 500 } 501 502 static int hctx_tags_bitmap_show(void *data, struct seq_file *m) 503 { 504 struct blk_mq_hw_ctx *hctx = data; 505 struct request_queue *q = hctx->queue; 506 int res; 507 508 res = mutex_lock_interruptible(&q->sysfs_lock); 509 if (res) 510 goto out; 511 if (hctx->tags) 512 sbitmap_bitmap_show(&hctx->tags->bitmap_tags.sb, m); 513 mutex_unlock(&q->sysfs_lock); 514 515 out: 516 return res; 517 } 518 519 static int hctx_sched_tags_show(void *data, struct seq_file *m) 520 { 521 struct blk_mq_hw_ctx *hctx = data; 522 struct request_queue *q = hctx->queue; 523 int res; 524 525 res = mutex_lock_interruptible(&q->sysfs_lock); 526 if (res) 527 goto out; 528 if (hctx->sched_tags) 529 blk_mq_debugfs_tags_show(m, hctx->sched_tags); 530 mutex_unlock(&q->sysfs_lock); 531 532 out: 533 return res; 534 } 535 536 static int hctx_sched_tags_bitmap_show(void *data, struct seq_file *m) 537 { 538 struct blk_mq_hw_ctx *hctx = data; 539 struct request_queue *q = hctx->queue; 540 int res; 541 542 res = mutex_lock_interruptible(&q->sysfs_lock); 543 if (res) 544 goto out; 545 if (hctx->sched_tags) 546 sbitmap_bitmap_show(&hctx->sched_tags->bitmap_tags.sb, m); 547 mutex_unlock(&q->sysfs_lock); 548 549 out: 550 return res; 551 } 552 553 static int hctx_io_poll_show(void *data, struct seq_file *m) 554 { 555 struct blk_mq_hw_ctx *hctx = data; 556 557 seq_printf(m, "considered=%lu\n", hctx->poll_considered); 558 seq_printf(m, "invoked=%lu\n", hctx->poll_invoked); 559 seq_printf(m, "success=%lu\n", hctx->poll_success); 560 return 0; 561 } 562 563 static ssize_t hctx_io_poll_write(void *data, const char __user *buf, 564 size_t count, loff_t *ppos) 565 { 566 struct blk_mq_hw_ctx *hctx = data; 567 568 hctx->poll_considered = hctx->poll_invoked = hctx->poll_success = 0; 569 return count; 570 } 571 572 static int hctx_dispatched_show(void *data, struct seq_file *m) 573 { 574 struct blk_mq_hw_ctx *hctx = data; 575 int i; 576 577 seq_printf(m, "%8u\t%lu\n", 0U, hctx->dispatched[0]); 578 579 for (i = 1; i < BLK_MQ_MAX_DISPATCH_ORDER - 1; i++) { 580 unsigned int d = 1U << (i - 1); 581 582 seq_printf(m, "%8u\t%lu\n", d, hctx->dispatched[i]); 583 } 584 585 seq_printf(m, "%8u+\t%lu\n", 1U << (i - 1), hctx->dispatched[i]); 586 return 0; 587 } 588 589 static ssize_t hctx_dispatched_write(void *data, const char __user *buf, 590 size_t count, loff_t *ppos) 591 { 592 struct blk_mq_hw_ctx *hctx = data; 593 int i; 594 595 for (i = 0; i < BLK_MQ_MAX_DISPATCH_ORDER; i++) 596 hctx->dispatched[i] = 0; 597 return count; 598 } 599 600 static int hctx_queued_show(void *data, struct seq_file *m) 601 { 602 struct blk_mq_hw_ctx *hctx = data; 603 604 seq_printf(m, "%lu\n", hctx->queued); 605 return 0; 606 } 607 608 static ssize_t hctx_queued_write(void *data, const char __user *buf, 609 size_t count, loff_t *ppos) 610 { 611 struct blk_mq_hw_ctx *hctx = data; 612 613 hctx->queued = 0; 614 return count; 615 } 616 617 static int hctx_run_show(void *data, struct seq_file *m) 618 { 619 struct blk_mq_hw_ctx *hctx = data; 620 621 seq_printf(m, "%lu\n", hctx->run); 622 return 0; 623 } 624 625 static ssize_t hctx_run_write(void *data, const char __user *buf, size_t count, 626 loff_t *ppos) 627 { 628 struct blk_mq_hw_ctx *hctx = data; 629 630 hctx->run = 0; 631 return count; 632 } 633 634 static int hctx_active_show(void *data, struct seq_file *m) 635 { 636 struct blk_mq_hw_ctx *hctx = data; 637 638 seq_printf(m, "%d\n", atomic_read(&hctx->nr_active)); 639 return 0; 640 } 641 642 static void *ctx_rq_list_start(struct seq_file *m, loff_t *pos) 643 __acquires(&ctx->lock) 644 { 645 struct blk_mq_ctx *ctx = m->private; 646 647 spin_lock(&ctx->lock); 648 return seq_list_start(&ctx->rq_list, *pos); 649 } 650 651 static void *ctx_rq_list_next(struct seq_file *m, void *v, loff_t *pos) 652 { 653 struct blk_mq_ctx *ctx = m->private; 654 655 return seq_list_next(v, &ctx->rq_list, pos); 656 } 657 658 static void ctx_rq_list_stop(struct seq_file *m, void *v) 659 __releases(&ctx->lock) 660 { 661 struct blk_mq_ctx *ctx = m->private; 662 663 spin_unlock(&ctx->lock); 664 } 665 666 static const struct seq_operations ctx_rq_list_seq_ops = { 667 .start = ctx_rq_list_start, 668 .next = ctx_rq_list_next, 669 .stop = ctx_rq_list_stop, 670 .show = blk_mq_debugfs_rq_show, 671 }; 672 static int ctx_dispatched_show(void *data, struct seq_file *m) 673 { 674 struct blk_mq_ctx *ctx = data; 675 676 seq_printf(m, "%lu %lu\n", ctx->rq_dispatched[1], ctx->rq_dispatched[0]); 677 return 0; 678 } 679 680 static ssize_t ctx_dispatched_write(void *data, const char __user *buf, 681 size_t count, loff_t *ppos) 682 { 683 struct blk_mq_ctx *ctx = data; 684 685 ctx->rq_dispatched[0] = ctx->rq_dispatched[1] = 0; 686 return count; 687 } 688 689 static int ctx_merged_show(void *data, struct seq_file *m) 690 { 691 struct blk_mq_ctx *ctx = data; 692 693 seq_printf(m, "%lu\n", ctx->rq_merged); 694 return 0; 695 } 696 697 static ssize_t ctx_merged_write(void *data, const char __user *buf, 698 size_t count, loff_t *ppos) 699 { 700 struct blk_mq_ctx *ctx = data; 701 702 ctx->rq_merged = 0; 703 return count; 704 } 705 706 static int ctx_completed_show(void *data, struct seq_file *m) 707 { 708 struct blk_mq_ctx *ctx = data; 709 710 seq_printf(m, "%lu %lu\n", ctx->rq_completed[1], ctx->rq_completed[0]); 711 return 0; 712 } 713 714 static ssize_t ctx_completed_write(void *data, const char __user *buf, 715 size_t count, loff_t *ppos) 716 { 717 struct blk_mq_ctx *ctx = data; 718 719 ctx->rq_completed[0] = ctx->rq_completed[1] = 0; 720 return count; 721 } 722 723 static int blk_mq_debugfs_show(struct seq_file *m, void *v) 724 { 725 const struct blk_mq_debugfs_attr *attr = m->private; 726 void *data = d_inode(m->file->f_path.dentry->d_parent)->i_private; 727 728 return attr->show(data, m); 729 } 730 731 static ssize_t blk_mq_debugfs_write(struct file *file, const char __user *buf, 732 size_t count, loff_t *ppos) 733 { 734 struct seq_file *m = file->private_data; 735 const struct blk_mq_debugfs_attr *attr = m->private; 736 void *data = d_inode(file->f_path.dentry->d_parent)->i_private; 737 738 /* 739 * Attributes that only implement .seq_ops are read-only and 'attr' is 740 * the same with 'data' in this case. 741 */ 742 if (attr == data || !attr->write) 743 return -EPERM; 744 745 return attr->write(data, buf, count, ppos); 746 } 747 748 static int blk_mq_debugfs_open(struct inode *inode, struct file *file) 749 { 750 const struct blk_mq_debugfs_attr *attr = inode->i_private; 751 void *data = d_inode(file->f_path.dentry->d_parent)->i_private; 752 struct seq_file *m; 753 int ret; 754 755 if (attr->seq_ops) { 756 ret = seq_open(file, attr->seq_ops); 757 if (!ret) { 758 m = file->private_data; 759 m->private = data; 760 } 761 return ret; 762 } 763 764 if (WARN_ON_ONCE(!attr->show)) 765 return -EPERM; 766 767 return single_open(file, blk_mq_debugfs_show, inode->i_private); 768 } 769 770 static int blk_mq_debugfs_release(struct inode *inode, struct file *file) 771 { 772 const struct blk_mq_debugfs_attr *attr = inode->i_private; 773 774 if (attr->show) 775 return single_release(inode, file); 776 else 777 return seq_release(inode, file); 778 } 779 780 static const struct file_operations blk_mq_debugfs_fops = { 781 .open = blk_mq_debugfs_open, 782 .read = seq_read, 783 .write = blk_mq_debugfs_write, 784 .llseek = seq_lseek, 785 .release = blk_mq_debugfs_release, 786 }; 787 788 static const struct blk_mq_debugfs_attr blk_mq_debugfs_hctx_attrs[] = { 789 {"state", 0400, hctx_state_show}, 790 {"flags", 0400, hctx_flags_show}, 791 {"dispatch", 0400, .seq_ops = &hctx_dispatch_seq_ops}, 792 {"busy", 0400, hctx_busy_show}, 793 {"ctx_map", 0400, hctx_ctx_map_show}, 794 {"tags", 0400, hctx_tags_show}, 795 {"tags_bitmap", 0400, hctx_tags_bitmap_show}, 796 {"sched_tags", 0400, hctx_sched_tags_show}, 797 {"sched_tags_bitmap", 0400, hctx_sched_tags_bitmap_show}, 798 {"io_poll", 0600, hctx_io_poll_show, hctx_io_poll_write}, 799 {"dispatched", 0600, hctx_dispatched_show, hctx_dispatched_write}, 800 {"queued", 0600, hctx_queued_show, hctx_queued_write}, 801 {"run", 0600, hctx_run_show, hctx_run_write}, 802 {"active", 0400, hctx_active_show}, 803 {}, 804 }; 805 806 static const struct blk_mq_debugfs_attr blk_mq_debugfs_ctx_attrs[] = { 807 {"rq_list", 0400, .seq_ops = &ctx_rq_list_seq_ops}, 808 {"dispatched", 0600, ctx_dispatched_show, ctx_dispatched_write}, 809 {"merged", 0600, ctx_merged_show, ctx_merged_write}, 810 {"completed", 0600, ctx_completed_show, ctx_completed_write}, 811 {}, 812 }; 813 814 static bool debugfs_create_files(struct dentry *parent, void *data, 815 const struct blk_mq_debugfs_attr *attr) 816 { 817 d_inode(parent)->i_private = data; 818 819 for (; attr->name; attr++) { 820 if (!debugfs_create_file(attr->name, attr->mode, parent, 821 (void *)attr, &blk_mq_debugfs_fops)) 822 return false; 823 } 824 return true; 825 } 826 827 int blk_mq_debugfs_register(struct request_queue *q) 828 { 829 struct blk_mq_hw_ctx *hctx; 830 int i; 831 832 if (!blk_debugfs_root) 833 return -ENOENT; 834 835 q->debugfs_dir = debugfs_create_dir(kobject_name(q->kobj.parent), 836 blk_debugfs_root); 837 if (!q->debugfs_dir) 838 return -ENOMEM; 839 840 if (!debugfs_create_files(q->debugfs_dir, q, 841 blk_mq_debugfs_queue_attrs)) 842 goto err; 843 844 /* 845 * blk_mq_init_sched() attempted to do this already, but q->debugfs_dir 846 * didn't exist yet (because we don't know what to name the directory 847 * until the queue is registered to a gendisk). 848 */ 849 if (q->elevator && !q->sched_debugfs_dir) 850 blk_mq_debugfs_register_sched(q); 851 852 /* Similarly, blk_mq_init_hctx() couldn't do this previously. */ 853 queue_for_each_hw_ctx(q, hctx, i) { 854 if (!hctx->debugfs_dir && blk_mq_debugfs_register_hctx(q, hctx)) 855 goto err; 856 if (q->elevator && !hctx->sched_debugfs_dir && 857 blk_mq_debugfs_register_sched_hctx(q, hctx)) 858 goto err; 859 } 860 861 return 0; 862 863 err: 864 blk_mq_debugfs_unregister(q); 865 return -ENOMEM; 866 } 867 868 void blk_mq_debugfs_unregister(struct request_queue *q) 869 { 870 debugfs_remove_recursive(q->debugfs_dir); 871 q->sched_debugfs_dir = NULL; 872 q->debugfs_dir = NULL; 873 } 874 875 static int blk_mq_debugfs_register_ctx(struct blk_mq_hw_ctx *hctx, 876 struct blk_mq_ctx *ctx) 877 { 878 struct dentry *ctx_dir; 879 char name[20]; 880 881 snprintf(name, sizeof(name), "cpu%u", ctx->cpu); 882 ctx_dir = debugfs_create_dir(name, hctx->debugfs_dir); 883 if (!ctx_dir) 884 return -ENOMEM; 885 886 if (!debugfs_create_files(ctx_dir, ctx, blk_mq_debugfs_ctx_attrs)) 887 return -ENOMEM; 888 889 return 0; 890 } 891 892 int blk_mq_debugfs_register_hctx(struct request_queue *q, 893 struct blk_mq_hw_ctx *hctx) 894 { 895 struct blk_mq_ctx *ctx; 896 char name[20]; 897 int i; 898 899 if (!q->debugfs_dir) 900 return -ENOENT; 901 902 snprintf(name, sizeof(name), "hctx%u", hctx->queue_num); 903 hctx->debugfs_dir = debugfs_create_dir(name, q->debugfs_dir); 904 if (!hctx->debugfs_dir) 905 return -ENOMEM; 906 907 if (!debugfs_create_files(hctx->debugfs_dir, hctx, 908 blk_mq_debugfs_hctx_attrs)) 909 goto err; 910 911 hctx_for_each_ctx(hctx, ctx, i) { 912 if (blk_mq_debugfs_register_ctx(hctx, ctx)) 913 goto err; 914 } 915 916 return 0; 917 918 err: 919 blk_mq_debugfs_unregister_hctx(hctx); 920 return -ENOMEM; 921 } 922 923 void blk_mq_debugfs_unregister_hctx(struct blk_mq_hw_ctx *hctx) 924 { 925 debugfs_remove_recursive(hctx->debugfs_dir); 926 hctx->sched_debugfs_dir = NULL; 927 hctx->debugfs_dir = NULL; 928 } 929 930 int blk_mq_debugfs_register_hctxs(struct request_queue *q) 931 { 932 struct blk_mq_hw_ctx *hctx; 933 int i; 934 935 queue_for_each_hw_ctx(q, hctx, i) { 936 if (blk_mq_debugfs_register_hctx(q, hctx)) 937 return -ENOMEM; 938 } 939 940 return 0; 941 } 942 943 void blk_mq_debugfs_unregister_hctxs(struct request_queue *q) 944 { 945 struct blk_mq_hw_ctx *hctx; 946 int i; 947 948 queue_for_each_hw_ctx(q, hctx, i) 949 blk_mq_debugfs_unregister_hctx(hctx); 950 } 951 952 int blk_mq_debugfs_register_sched(struct request_queue *q) 953 { 954 struct elevator_type *e = q->elevator->type; 955 956 if (!q->debugfs_dir) 957 return -ENOENT; 958 959 if (!e->queue_debugfs_attrs) 960 return 0; 961 962 q->sched_debugfs_dir = debugfs_create_dir("sched", q->debugfs_dir); 963 if (!q->sched_debugfs_dir) 964 return -ENOMEM; 965 966 if (!debugfs_create_files(q->sched_debugfs_dir, q, 967 e->queue_debugfs_attrs)) 968 goto err; 969 970 return 0; 971 972 err: 973 blk_mq_debugfs_unregister_sched(q); 974 return -ENOMEM; 975 } 976 977 void blk_mq_debugfs_unregister_sched(struct request_queue *q) 978 { 979 debugfs_remove_recursive(q->sched_debugfs_dir); 980 q->sched_debugfs_dir = NULL; 981 } 982 983 int blk_mq_debugfs_register_sched_hctx(struct request_queue *q, 984 struct blk_mq_hw_ctx *hctx) 985 { 986 struct elevator_type *e = q->elevator->type; 987 988 if (!hctx->debugfs_dir) 989 return -ENOENT; 990 991 if (!e->hctx_debugfs_attrs) 992 return 0; 993 994 hctx->sched_debugfs_dir = debugfs_create_dir("sched", 995 hctx->debugfs_dir); 996 if (!hctx->sched_debugfs_dir) 997 return -ENOMEM; 998 999 if (!debugfs_create_files(hctx->sched_debugfs_dir, hctx, 1000 e->hctx_debugfs_attrs)) 1001 return -ENOMEM; 1002 1003 return 0; 1004 } 1005 1006 void blk_mq_debugfs_unregister_sched_hctx(struct blk_mq_hw_ctx *hctx) 1007 { 1008 debugfs_remove_recursive(hctx->sched_debugfs_dir); 1009 hctx->sched_debugfs_dir = NULL; 1010 } 1011