git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/debug.c

   1 // SPDX-License-Identifier: GPL-2.0
   2 /*
   3  * Assorted bcachefs debug code
   4  *
   5  * Copyright 2010, 2011 Kent Overstreet <kent.overstreet@gmail.com>
   6  * Copyright 2012 Google, Inc.
   7  */
   8
   9 #include "bcachefs.h"
  10 #include "bkey_methods.h"
  11 #include "btree_cache.h"
  12 #include "btree_io.h"
  13 #include "btree_iter.h"
  14 #include "btree_locking.h"
  15 #include "btree_update.h"
  16 #include "buckets.h"
  17 #include "debug.h"
  18 #include "error.h"
  19 #include "extents.h"
  20 #include "fsck.h"
  21 #include "inode.h"
  22 #include "io.h"
  23 #include "super.h"
  24
  25 #include <linux/console.h>
  26 #include <linux/debugfs.h>
  27 #include <linux/module.h>
  28 #include <linux/random.h>
  29 #include <linux/seq_file.h>
  30
  31 static struct dentry *bch_debug;
  32
  33 static bool bch2_btree_verify_replica(struct bch_fs *c, struct btree *b,
  34                                       struct extent_ptr_decoded pick)
  35 {
  36         struct btree *v = c->verify_data;
  37         struct btree_node *n_ondisk = c->verify_ondisk;
  38         struct btree_node *n_sorted = c->verify_data->data;
  39         struct bset *sorted, *inmemory = &b->data->keys;
  40         struct bch_dev *ca = bch_dev_bkey_exists(c, pick.ptr.dev);
  41         struct bio *bio;
  42         bool failed = false, saw_error = false;
  43
  44         if (!bch2_dev_get_ioref(ca, READ))
  45                 return false;
  46
  47         bio = bio_alloc_bioset(ca->disk_sb.bdev,
  48                                buf_pages(n_sorted, btree_bytes(c)),
  49                                REQ_OP_READ|REQ_META,
  50                                GFP_NOIO,
  51                                &c->btree_bio);
  52         bio->bi_iter.bi_sector  = pick.ptr.offset;
  53         bch2_bio_map(bio, n_sorted, btree_bytes(c));
  54
  55         submit_bio_wait(bio);
  56
  57         bio_put(bio);
  58         percpu_ref_put(&ca->io_ref);
  59
  60         memcpy(n_ondisk, n_sorted, btree_bytes(c));
  61
  62         v->written = 0;
  63         if (bch2_btree_node_read_done(c, ca, v, false, &saw_error) || saw_error)
  64                 return false;
  65
  66         n_sorted = c->verify_data->data;
  67         sorted = &n_sorted->keys;
  68
  69         if (inmemory->u64s != sorted->u64s ||
  70             memcmp(inmemory->start,
  71                    sorted->start,
  72                    vstruct_end(inmemory) - (void *) inmemory->start)) {
  73                 unsigned offset = 0, sectors;
  74                 struct bset *i;
  75                 unsigned j;
  76
  77                 console_lock();
  78
  79                 printk(KERN_ERR "*** in memory:\n");
  80                 bch2_dump_bset(c, b, inmemory, 0);
  81
  82                 printk(KERN_ERR "*** read back in:\n");
  83                 bch2_dump_bset(c, v, sorted, 0);
  84
  85                 while (offset < v->written) {
  86                         if (!offset) {
  87                                 i = &n_ondisk->keys;
  88                                 sectors = vstruct_blocks(n_ondisk, c->block_bits) <<
  89                                         c->block_bits;
  90                         } else {
  91                                 struct btree_node_entry *bne =
  92                                         (void *) n_ondisk + (offset << 9);
  93                                 i = &bne->keys;
  94
  95                                 sectors = vstruct_blocks(bne, c->block_bits) <<
  96                                         c->block_bits;
  97                         }
  98
  99                         printk(KERN_ERR "*** on disk block %u:\n", offset);
 100                         bch2_dump_bset(c, b, i, offset);
 101
 102                         offset += sectors;
 103                 }
 104
 105                 for (j = 0; j < le16_to_cpu(inmemory->u64s); j++)
 106                         if (inmemory->_data[j] != sorted->_data[j])
 107                                 break;
 108
 109                 console_unlock();
 110                 bch_err(c, "verify failed at key %u", j);
 111
 112                 failed = true;
 113         }
 114
 115         if (v->written != b->written) {
 116                 bch_err(c, "written wrong: expected %u, got %u",
 117                         b->written, v->written);
 118                 failed = true;
 119         }
 120
 121         return failed;
 122 }
 123
 124 void __bch2_btree_verify(struct bch_fs *c, struct btree *b)
 125 {
 126         struct bkey_ptrs_c ptrs;
 127         struct extent_ptr_decoded p;
 128         const union bch_extent_entry *entry;
 129         struct btree *v;
 130         struct bset *inmemory = &b->data->keys;
 131         struct bkey_packed *k;
 132         bool failed = false;
 133
 134         if (c->opts.nochanges)
 135                 return;
 136
 137         bch2_btree_node_io_lock(b);
 138         mutex_lock(&c->verify_lock);
 139
 140         if (!c->verify_ondisk) {
 141                 c->verify_ondisk = kvpmalloc(btree_bytes(c), GFP_KERNEL);
 142                 if (!c->verify_ondisk)
 143                         goto out;
 144         }
 145
 146         if (!c->verify_data) {
 147                 c->verify_data = __bch2_btree_node_mem_alloc(c);
 148                 if (!c->verify_data)
 149                         goto out;
 150
 151                 list_del_init(&c->verify_data->list);
 152         }
 153
 154         BUG_ON(b->nsets != 1);
 155
 156         for (k = inmemory->start; k != vstruct_last(inmemory); k = bkey_next(k))
 157                 if (k->type == KEY_TYPE_btree_ptr_v2) {
 158                         struct bch_btree_ptr_v2 *v = (void *) bkeyp_val(&b->format, k);
 159                         v->mem_ptr = 0;
 160                 }
 161
 162         v = c->verify_data;
 163         bkey_copy(&v->key, &b->key);
 164         v->c.level      = b->c.level;
 165         v->c.btree_id   = b->c.btree_id;
 166         bch2_btree_keys_init(v);
 167
 168         ptrs = bch2_bkey_ptrs_c(bkey_i_to_s_c(&b->key));
 169         bkey_for_each_ptr_decode(&b->key.k, ptrs, p, entry)
 170                 failed |= bch2_btree_verify_replica(c, b, p);
 171
 172         if (failed) {
 173                 struct printbuf buf = PRINTBUF;
 174
 175                 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&b->key));
 176                 bch2_fs_fatal_error(c, "btree node verify failed for : %s\n", buf.buf);
 177                 printbuf_exit(&buf);
 178         }
 179 out:
 180         mutex_unlock(&c->verify_lock);
 181         bch2_btree_node_io_unlock(b);
 182 }
 183
 184 #ifdef CONFIG_DEBUG_FS
 185
 186 /* XXX: bch_fs refcounting */
 187
 188 struct dump_iter {
 189         struct bch_fs           *c;
 190         enum btree_id           id;
 191         struct bpos             from;
 192         struct bpos             prev_node;
 193         u64                     iter;
 194
 195         struct printbuf         buf;
 196
 197         char __user             *ubuf;  /* destination user buffer */
 198         size_t                  size;   /* size of requested read */
 199         ssize_t                 ret;    /* bytes read so far */
 200 };
 201
 202 static ssize_t flush_buf(struct dump_iter *i)
 203 {
 204         if (i->buf.pos) {
 205                 size_t bytes = min_t(size_t, i->buf.pos, i->size);
 206                 int err = copy_to_user(i->ubuf, i->buf.buf, bytes);
 207
 208                 if (err)
 209                         return err;
 210
 211                 i->ret   += bytes;
 212                 i->ubuf  += bytes;
 213                 i->size  -= bytes;
 214                 i->buf.pos -= bytes;
 215                 memmove(i->buf.buf, i->buf.buf + bytes, i->buf.pos);
 216         }
 217
 218         return i->size ? 0 : i->ret;
 219 }
 220
 221 static int bch2_dump_open(struct inode *inode, struct file *file)
 222 {
 223         struct btree_debug *bd = inode->i_private;
 224         struct dump_iter *i;
 225
 226         i = kzalloc(sizeof(struct dump_iter), GFP_KERNEL);
 227         if (!i)
 228                 return -ENOMEM;
 229
 230         file->private_data = i;
 231         i->from = POS_MIN;
 232         i->iter = 0;
 233         i->c    = container_of(bd, struct bch_fs, btree_debug[bd->id]);
 234         i->id   = bd->id;
 235         i->buf  = PRINTBUF;
 236
 237         return 0;
 238 }
 239
 240 static int bch2_dump_release(struct inode *inode, struct file *file)
 241 {
 242         struct dump_iter *i = file->private_data;
 243
 244         printbuf_exit(&i->buf);
 245         kfree(i);
 246         return 0;
 247 }
 248
 249 static ssize_t bch2_read_btree(struct file *file, char __user *buf,
 250                                size_t size, loff_t *ppos)
 251 {
 252         struct dump_iter *i = file->private_data;
 253         struct btree_trans trans;
 254         struct btree_iter iter;
 255         struct bkey_s_c k;
 256         ssize_t ret;
 257
 258         i->ubuf = buf;
 259         i->size = size;
 260         i->ret  = 0;
 261
 262         bch2_trans_init(&trans, i->c, 0, 0);
 263
 264         ret = for_each_btree_key2(&trans, iter, i->id, i->from,
 265                                   BTREE_ITER_PREFETCH|
 266                                   BTREE_ITER_ALL_SNAPSHOTS, k, ({
 267                 ret = flush_buf(i);
 268                 if (ret)
 269                         break;
 270
 271                 bch2_bkey_val_to_text(&i->buf, i->c, k);
 272                 prt_newline(&i->buf);
 273                 0;
 274         }));
 275         i->from = iter.pos;
 276
 277         if (!ret)
 278                 ret = flush_buf(i);
 279
 280         bch2_trans_exit(&trans);
 281
 282         return ret ?: i->ret;
 283 }
 284
 285 static const struct file_operations btree_debug_ops = {
 286         .owner          = THIS_MODULE,
 287         .open           = bch2_dump_open,
 288         .release        = bch2_dump_release,
 289         .read           = bch2_read_btree,
 290 };
 291
 292 static ssize_t bch2_read_btree_formats(struct file *file, char __user *buf,
 293                                        size_t size, loff_t *ppos)
 294 {
 295         struct dump_iter *i = file->private_data;
 296         struct btree_trans trans;
 297         struct btree_iter iter;
 298         struct btree *b;
 299         ssize_t ret;
 300
 301         i->ubuf = buf;
 302         i->size = size;
 303         i->ret  = 0;
 304
 305         ret = flush_buf(i);
 306         if (ret)
 307                 return ret;
 308
 309         if (bpos_eq(SPOS_MAX, i->from))
 310                 return i->ret;
 311
 312         bch2_trans_init(&trans, i->c, 0, 0);
 313
 314         for_each_btree_node(&trans, iter, i->id, i->from, 0, b, ret) {
 315                 ret = flush_buf(i);
 316                 if (ret)
 317                         break;
 318
 319                 bch2_btree_node_to_text(&i->buf, i->c, b);
 320                 i->from = !bpos_eq(SPOS_MAX, b->key.k.p)
 321                         ? bpos_successor(b->key.k.p)
 322                         : b->key.k.p;
 323         }
 324         bch2_trans_iter_exit(&trans, &iter);
 325
 326         bch2_trans_exit(&trans);
 327
 328         if (!ret)
 329                 ret = flush_buf(i);
 330
 331         return ret ?: i->ret;
 332 }
 333
 334 static const struct file_operations btree_format_debug_ops = {
 335         .owner          = THIS_MODULE,
 336         .open           = bch2_dump_open,
 337         .release        = bch2_dump_release,
 338         .read           = bch2_read_btree_formats,
 339 };
 340
 341 static ssize_t bch2_read_bfloat_failed(struct file *file, char __user *buf,
 342                                        size_t size, loff_t *ppos)
 343 {
 344         struct dump_iter *i = file->private_data;
 345         struct btree_trans trans;
 346         struct btree_iter iter;
 347         struct bkey_s_c k;
 348         ssize_t ret;
 349
 350         i->ubuf = buf;
 351         i->size = size;
 352         i->ret  = 0;
 353
 354         ret = flush_buf(i);
 355         if (ret)
 356                 return ret;
 357
 358         bch2_trans_init(&trans, i->c, 0, 0);
 359
 360         ret = for_each_btree_key2(&trans, iter, i->id, i->from,
 361                                   BTREE_ITER_PREFETCH|
 362                                   BTREE_ITER_ALL_SNAPSHOTS, k, ({
 363                 struct btree_path_level *l = &iter.path->l[0];
 364                 struct bkey_packed *_k =
 365                         bch2_btree_node_iter_peek(&l->iter, l->b);
 366
 367                 ret = flush_buf(i);
 368                 if (ret)
 369                         break;
 370
 371                 if (bpos_gt(l->b->key.k.p, i->prev_node)) {
 372                         bch2_btree_node_to_text(&i->buf, i->c, l->b);
 373                         i->prev_node = l->b->key.k.p;
 374                 }
 375
 376                 bch2_bfloat_to_text(&i->buf, l->b, _k);
 377                 0;
 378         }));
 379         i->from = iter.pos;
 380
 381         bch2_trans_exit(&trans);
 382
 383         if (!ret)
 384                 ret = flush_buf(i);
 385
 386         return ret ?: i->ret;
 387 }
 388
 389 static const struct file_operations bfloat_failed_debug_ops = {
 390         .owner          = THIS_MODULE,
 391         .open           = bch2_dump_open,
 392         .release        = bch2_dump_release,
 393         .read           = bch2_read_bfloat_failed,
 394 };
 395
 396 static void bch2_cached_btree_node_to_text(struct printbuf *out, struct bch_fs *c,
 397                                            struct btree *b)
 398 {
 399         if (!out->nr_tabstops)
 400                 printbuf_tabstop_push(out, 32);
 401
 402         prt_printf(out, "%px btree=%s l=%u ",
 403                b,
 404                bch2_btree_ids[b->c.btree_id],
 405                b->c.level);
 406         prt_newline(out);
 407
 408         printbuf_indent_add(out, 2);
 409
 410         bch2_bkey_val_to_text(out, c, bkey_i_to_s_c(&b->key));
 411         prt_newline(out);
 412
 413         prt_printf(out, "flags: ");
 414         prt_tab(out);
 415         prt_bitflags(out, bch2_btree_node_flags, b->flags);
 416         prt_newline(out);
 417
 418         prt_printf(out, "pcpu read locks: ");
 419         prt_tab(out);
 420         prt_printf(out, "%u", b->c.lock.readers != NULL);
 421         prt_newline(out);
 422
 423         prt_printf(out, "written:");
 424         prt_tab(out);
 425         prt_printf(out, "%u", b->written);
 426         prt_newline(out);
 427
 428         prt_printf(out, "writes blocked:");
 429         prt_tab(out);
 430         prt_printf(out, "%u", !list_empty_careful(&b->write_blocked));
 431         prt_newline(out);
 432
 433         prt_printf(out, "will make reachable:");
 434         prt_tab(out);
 435         prt_printf(out, "%lx", b->will_make_reachable);
 436         prt_newline(out);
 437
 438         prt_printf(out, "journal pin %px:", &b->writes[0].journal);
 439         prt_tab(out);
 440         prt_printf(out, "%llu", b->writes[0].journal.seq);
 441         prt_newline(out);
 442
 443         prt_printf(out, "journal pin %px:", &b->writes[1].journal);
 444         prt_tab(out);
 445         prt_printf(out, "%llu", b->writes[1].journal.seq);
 446         prt_newline(out);
 447
 448         printbuf_indent_sub(out, 2);
 449 }
 450
 451 static ssize_t bch2_cached_btree_nodes_read(struct file *file, char __user *buf,
 452                                             size_t size, loff_t *ppos)
 453 {
 454         struct dump_iter *i = file->private_data;
 455         struct bch_fs *c = i->c;
 456         bool done = false;
 457         ssize_t ret = 0;
 458
 459         i->ubuf = buf;
 460         i->size = size;
 461         i->ret  = 0;
 462
 463         do {
 464                 struct bucket_table *tbl;
 465                 struct rhash_head *pos;
 466                 struct btree *b;
 467
 468                 ret = flush_buf(i);
 469                 if (ret)
 470                         return ret;
 471
 472                 rcu_read_lock();
 473                 i->buf.atomic++;
 474                 tbl = rht_dereference_rcu(c->btree_cache.table.tbl,
 475                                           &c->btree_cache.table);
 476                 if (i->iter < tbl->size) {
 477                         rht_for_each_entry_rcu(b, pos, tbl, i->iter, hash)
 478                                 bch2_cached_btree_node_to_text(&i->buf, c, b);
 479                         i->iter++;
 480                 } else {
 481                         done = true;
 482                 }
 483                 --i->buf.atomic;
 484                 rcu_read_unlock();
 485         } while (!done);
 486
 487         if (i->buf.allocation_failure)
 488                 ret = -ENOMEM;
 489
 490         if (!ret)
 491                 ret = flush_buf(i);
 492
 493         return ret ?: i->ret;
 494 }
 495
 496 static const struct file_operations cached_btree_nodes_ops = {
 497         .owner          = THIS_MODULE,
 498         .open           = bch2_dump_open,
 499         .release        = bch2_dump_release,
 500         .read           = bch2_cached_btree_nodes_read,
 501 };
 502
 503 #ifdef CONFIG_BCACHEFS_DEBUG_TRANSACTIONS
 504 static ssize_t bch2_btree_transactions_read(struct file *file, char __user *buf,
 505                                             size_t size, loff_t *ppos)
 506 {
 507         struct dump_iter *i = file->private_data;
 508         struct bch_fs *c = i->c;
 509         struct btree_trans *trans;
 510         ssize_t ret = 0;
 511
 512         i->ubuf = buf;
 513         i->size = size;
 514         i->ret  = 0;
 515
 516         mutex_lock(&c->btree_trans_lock);
 517         list_for_each_entry(trans, &c->btree_trans_list, list) {
 518                 if (trans->locking_wait.task->pid <= i->iter)
 519                         continue;
 520
 521                 ret = flush_buf(i);
 522                 if (ret)
 523                         break;
 524
 525                 bch2_btree_trans_to_text(&i->buf, trans);
 526
 527                 prt_printf(&i->buf, "backtrace:");
 528                 prt_newline(&i->buf);
 529                 printbuf_indent_add(&i->buf, 2);
 530                 bch2_prt_backtrace(&i->buf, trans->locking_wait.task);
 531                 printbuf_indent_sub(&i->buf, 2);
 532                 prt_newline(&i->buf);
 533
 534                 i->iter = trans->locking_wait.task->pid;
 535         }
 536         mutex_unlock(&c->btree_trans_lock);
 537
 538         if (i->buf.allocation_failure)
 539                 ret = -ENOMEM;
 540
 541         if (!ret)
 542                 ret = flush_buf(i);
 543
 544         return ret ?: i->ret;
 545 }
 546
 547 static const struct file_operations btree_transactions_ops = {
 548         .owner          = THIS_MODULE,
 549         .open           = bch2_dump_open,
 550         .release        = bch2_dump_release,
 551         .read           = bch2_btree_transactions_read,
 552 };
 553 #endif /* CONFIG_BCACHEFS_DEBUG_TRANSACTIONS */
 554
 555 static ssize_t bch2_journal_pins_read(struct file *file, char __user *buf,
 556                                       size_t size, loff_t *ppos)
 557 {
 558         struct dump_iter *i = file->private_data;
 559         struct bch_fs *c = i->c;
 560         bool done = false;
 561         int err;
 562
 563         i->ubuf = buf;
 564         i->size = size;
 565         i->ret  = 0;
 566
 567         do {
 568                 err = flush_buf(i);
 569                 if (err)
 570                         return err;
 571
 572                 if (!i->size)
 573                         break;
 574
 575                 done = bch2_journal_seq_pins_to_text(&i->buf, &c->journal, &i->iter);
 576                 i->iter++;
 577         } while (!done);
 578
 579         if (i->buf.allocation_failure)
 580                 return -ENOMEM;
 581
 582         return i->ret;
 583 }
 584
 585 static const struct file_operations journal_pins_ops = {
 586         .owner          = THIS_MODULE,
 587         .open           = bch2_dump_open,
 588         .release        = bch2_dump_release,
 589         .read           = bch2_journal_pins_read,
 590 };
 591
 592 static int lock_held_stats_open(struct inode *inode, struct file *file)
 593 {
 594         struct bch_fs *c = inode->i_private;
 595         struct dump_iter *i;
 596
 597         i = kzalloc(sizeof(struct dump_iter), GFP_KERNEL);
 598
 599         if (!i)
 600                 return -ENOMEM;
 601
 602         i->iter = 0;
 603         i->c    = c;
 604         i->buf  = PRINTBUF;
 605         file->private_data = i;
 606
 607         return 0;
 608 }
 609
 610 static int lock_held_stats_release(struct inode *inode, struct file *file)
 611 {
 612         struct dump_iter *i = file->private_data;
 613
 614         printbuf_exit(&i->buf);
 615         kfree(i);
 616
 617         return 0;
 618 }
 619
 620 static ssize_t lock_held_stats_read(struct file *file, char __user *buf,
 621                                       size_t size, loff_t *ppos)
 622 {
 623         struct dump_iter        *i = file->private_data;
 624         struct bch_fs *c = i->c;
 625         int err;
 626
 627         i->ubuf = buf;
 628         i->size = size;
 629         i->ret  = 0;
 630
 631         while (1) {
 632                 struct btree_transaction_stats *s = &c->btree_transaction_stats[i->iter];
 633
 634                 err = flush_buf(i);
 635                 if (err)
 636                         return err;
 637
 638                 if (!i->size)
 639                         break;
 640
 641                 if (i->iter == ARRAY_SIZE(bch2_btree_transaction_fns) ||
 642                     !bch2_btree_transaction_fns[i->iter])
 643                         break;
 644
 645                 prt_printf(&i->buf, "%s: ", bch2_btree_transaction_fns[i->iter]);
 646                 prt_newline(&i->buf);
 647                 printbuf_indent_add(&i->buf, 2);
 648
 649                 mutex_lock(&s->lock);
 650
 651                 prt_printf(&i->buf, "Max mem used: %u", s->max_mem);
 652                 prt_newline(&i->buf);
 653
 654                 if (IS_ENABLED(CONFIG_BCACHEFS_LOCK_TIME_STATS)) {
 655                         prt_printf(&i->buf, "Lock hold times:");
 656                         prt_newline(&i->buf);
 657
 658                         printbuf_indent_add(&i->buf, 2);
 659                         bch2_time_stats_to_text(&i->buf, &s->lock_hold_times);
 660                         printbuf_indent_sub(&i->buf, 2);
 661                 }
 662
 663                 if (s->max_paths_text) {
 664                         prt_printf(&i->buf, "Maximum allocated btree paths (%u):", s->nr_max_paths);
 665                         prt_newline(&i->buf);
 666
 667                         printbuf_indent_add(&i->buf, 2);
 668                         prt_str_indented(&i->buf, s->max_paths_text);
 669                         printbuf_indent_sub(&i->buf, 2);
 670                 }
 671
 672                 mutex_unlock(&s->lock);
 673
 674                 printbuf_indent_sub(&i->buf, 2);
 675                 prt_newline(&i->buf);
 676                 i->iter++;
 677         }
 678
 679         if (i->buf.allocation_failure)
 680                 return -ENOMEM;
 681
 682         return i->ret;
 683 }
 684
 685 static const struct file_operations lock_held_stats_op = {
 686         .owner = THIS_MODULE,
 687         .open = lock_held_stats_open,
 688         .release = lock_held_stats_release,
 689         .read = lock_held_stats_read,
 690 };
 691
 692 static ssize_t bch2_btree_deadlock_read(struct file *file, char __user *buf,
 693                                             size_t size, loff_t *ppos)
 694 {
 695         struct dump_iter *i = file->private_data;
 696         struct bch_fs *c = i->c;
 697         struct btree_trans *trans;
 698         ssize_t ret = 0;
 699
 700         i->ubuf = buf;
 701         i->size = size;
 702         i->ret  = 0;
 703
 704         if (i->iter)
 705                 goto out;
 706
 707         mutex_lock(&c->btree_trans_lock);
 708         list_for_each_entry(trans, &c->btree_trans_list, list) {
 709                 if (trans->locking_wait.task->pid <= i->iter)
 710                         continue;
 711
 712                 ret = flush_buf(i);
 713                 if (ret)
 714                         break;
 715
 716                 bch2_check_for_deadlock(trans, &i->buf);
 717
 718                 i->iter = trans->locking_wait.task->pid;
 719         }
 720         mutex_unlock(&c->btree_trans_lock);
 721 out:
 722         if (i->buf.allocation_failure)
 723                 ret = -ENOMEM;
 724
 725         if (!ret)
 726                 ret = flush_buf(i);
 727
 728         return ret ?: i->ret;
 729 }
 730
 731 static const struct file_operations btree_deadlock_ops = {
 732         .owner          = THIS_MODULE,
 733         .open           = bch2_dump_open,
 734         .release        = bch2_dump_release,
 735         .read           = bch2_btree_deadlock_read,
 736 };
 737
 738 void bch2_fs_debug_exit(struct bch_fs *c)
 739 {
 740         if (!IS_ERR_OR_NULL(c->fs_debug_dir))
 741                 debugfs_remove_recursive(c->fs_debug_dir);
 742 }
 743
 744 void bch2_fs_debug_init(struct bch_fs *c)
 745 {
 746         struct btree_debug *bd;
 747         char name[100];
 748
 749         if (IS_ERR_OR_NULL(bch_debug))
 750                 return;
 751
 752         snprintf(name, sizeof(name), "%pU", c->sb.user_uuid.b);
 753         c->fs_debug_dir = debugfs_create_dir(name, bch_debug);
 754         if (IS_ERR_OR_NULL(c->fs_debug_dir))
 755                 return;
 756
 757         debugfs_create_file("cached_btree_nodes", 0400, c->fs_debug_dir,
 758                             c->btree_debug, &cached_btree_nodes_ops);
 759
 760 #ifdef CONFIG_BCACHEFS_DEBUG_TRANSACTIONS
 761         debugfs_create_file("btree_transactions", 0400, c->fs_debug_dir,
 762                             c->btree_debug, &btree_transactions_ops);
 763 #endif
 764
 765         debugfs_create_file("journal_pins", 0400, c->fs_debug_dir,
 766                             c->btree_debug, &journal_pins_ops);
 767
 768         debugfs_create_file("btree_transaction_stats", 0400, c->fs_debug_dir,
 769                             c, &lock_held_stats_op);
 770
 771         debugfs_create_file("btree_deadlock", 0400, c->fs_debug_dir,
 772                             c->btree_debug, &btree_deadlock_ops);
 773
 774         c->btree_debug_dir = debugfs_create_dir("btrees", c->fs_debug_dir);
 775         if (IS_ERR_OR_NULL(c->btree_debug_dir))
 776                 return;
 777
 778         for (bd = c->btree_debug;
 779              bd < c->btree_debug + ARRAY_SIZE(c->btree_debug);
 780              bd++) {
 781                 bd->id = bd - c->btree_debug;
 782                 debugfs_create_file(bch2_btree_ids[bd->id],
 783                                     0400, c->btree_debug_dir, bd,
 784                                     &btree_debug_ops);
 785
 786                 snprintf(name, sizeof(name), "%s-formats",
 787                          bch2_btree_ids[bd->id]);
 788
 789                 debugfs_create_file(name, 0400, c->btree_debug_dir, bd,
 790                                     &btree_format_debug_ops);
 791
 792                 snprintf(name, sizeof(name), "%s-bfloat-failed",
 793                          bch2_btree_ids[bd->id]);
 794
 795                 debugfs_create_file(name, 0400, c->btree_debug_dir, bd,
 796                                     &bfloat_failed_debug_ops);
 797         }
 798 }
 799
 800 #endif
 801
 802 void bch2_debug_exit(void)
 803 {
 804         if (!IS_ERR_OR_NULL(bch_debug))
 805                 debugfs_remove_recursive(bch_debug);
 806 }
 807
 808 int __init bch2_debug_init(void)
 809 {
 810         int ret = 0;
 811
 812         bch_debug = debugfs_create_dir("bcachefs", NULL);
 813         return ret;
 814 }