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

   1 // SPDX-License-Identifier: GPL-2.0
   2
   3 #include "bcachefs.h"
   4 #include "bkey_buf.h"
   5 #include "btree_cache.h"
   6 #include "btree_update.h"
   7 #include "buckets.h"
   8 #include "darray.h"
   9 #include "dirent.h"
  10 #include "error.h"
  11 #include "fs-common.h"
  12 #include "fsck.h"
  13 #include "inode.h"
  14 #include "keylist.h"
  15 #include "recovery.h"
  16 #include "snapshot.h"
  17 #include "super.h"
  18 #include "xattr.h"
  19
  20 #include <linux/bsearch.h>
  21 #include <linux/dcache.h> /* struct qstr */
  22
  23 /*
  24  * XXX: this is handling transaction restarts without returning
  25  * -BCH_ERR_transaction_restart_nested, this is not how we do things anymore:
  26  */
  27 static s64 bch2_count_inode_sectors(struct btree_trans *trans, u64 inum,
  28                                     u32 snapshot)
  29 {
  30         u64 sectors = 0;
  31
  32         int ret = for_each_btree_key_upto(trans, iter, BTREE_ID_extents,
  33                                 SPOS(inum, 0, snapshot),
  34                                 POS(inum, U64_MAX),
  35                                 0, k, ({
  36                 if (bkey_extent_is_allocation(k.k))
  37                         sectors += k.k->size;
  38                 0;
  39         }));
  40
  41         return ret ?: sectors;
  42 }
  43
  44 static s64 bch2_count_subdirs(struct btree_trans *trans, u64 inum,
  45                                     u32 snapshot)
  46 {
  47         u64 subdirs = 0;
  48
  49         int ret = for_each_btree_key_upto(trans, iter, BTREE_ID_dirents,
  50                                     SPOS(inum, 0, snapshot),
  51                                     POS(inum, U64_MAX),
  52                                     0, k, ({
  53                 if (k.k->type == KEY_TYPE_dirent &&
  54                     bkey_s_c_to_dirent(k).v->d_type == DT_DIR)
  55                         subdirs++;
  56                 0;
  57         }));
  58
  59         return ret ?: subdirs;
  60 }
  61
  62 static int subvol_lookup(struct btree_trans *trans, u32 subvol,
  63                          u32 *snapshot, u64 *inum)
  64 {
  65         struct bch_subvolume s;
  66         int ret;
  67
  68         ret = bch2_subvolume_get(trans, subvol, false, 0, &s);
  69
  70         *snapshot = le32_to_cpu(s.snapshot);
  71         *inum = le64_to_cpu(s.inode);
  72         return ret;
  73 }
  74
  75 static int lookup_first_inode(struct btree_trans *trans, u64 inode_nr,
  76                               struct bch_inode_unpacked *inode)
  77 {
  78         struct btree_iter iter;
  79         struct bkey_s_c k;
  80         int ret;
  81
  82         bch2_trans_iter_init(trans, &iter, BTREE_ID_inodes,
  83                              POS(0, inode_nr),
  84                              BTREE_ITER_ALL_SNAPSHOTS);
  85         k = bch2_btree_iter_peek(&iter);
  86         ret = bkey_err(k);
  87         if (ret)
  88                 goto err;
  89
  90         if (!k.k || !bkey_eq(k.k->p, POS(0, inode_nr))) {
  91                 ret = -BCH_ERR_ENOENT_inode;
  92                 goto err;
  93         }
  94
  95         ret = bch2_inode_unpack(k, inode);
  96 err:
  97         bch_err_msg(trans->c, ret, "fetching inode %llu", inode_nr);
  98         bch2_trans_iter_exit(trans, &iter);
  99         return ret;
 100 }
 101
 102 static int lookup_inode(struct btree_trans *trans, u64 inode_nr,
 103                           struct bch_inode_unpacked *inode,
 104                           u32 *snapshot)
 105 {
 106         struct btree_iter iter;
 107         struct bkey_s_c k;
 108         int ret;
 109
 110         k = bch2_bkey_get_iter(trans, &iter, BTREE_ID_inodes,
 111                                SPOS(0, inode_nr, *snapshot), 0);
 112         ret = bkey_err(k);
 113         if (ret)
 114                 goto err;
 115
 116         ret = bkey_is_inode(k.k)
 117                 ? bch2_inode_unpack(k, inode)
 118                 : -BCH_ERR_ENOENT_inode;
 119         if (!ret)
 120                 *snapshot = iter.pos.snapshot;
 121 err:
 122         bch_err_msg(trans->c, ret, "fetching inode %llu:%u", inode_nr, *snapshot);
 123         bch2_trans_iter_exit(trans, &iter);
 124         return ret;
 125 }
 126
 127 static int __lookup_dirent(struct btree_trans *trans,
 128                            struct bch_hash_info hash_info,
 129                            subvol_inum dir, struct qstr *name,
 130                            u64 *target, unsigned *type)
 131 {
 132         struct btree_iter iter;
 133         struct bkey_s_c_dirent d;
 134         int ret;
 135
 136         ret = bch2_hash_lookup(trans, &iter, bch2_dirent_hash_desc,
 137                                &hash_info, dir, name, 0);
 138         if (ret)
 139                 return ret;
 140
 141         d = bkey_s_c_to_dirent(bch2_btree_iter_peek_slot(&iter));
 142         *target = le64_to_cpu(d.v->d_inum);
 143         *type = d.v->d_type;
 144         bch2_trans_iter_exit(trans, &iter);
 145         return 0;
 146 }
 147
 148 static int __write_inode(struct btree_trans *trans,
 149                          struct bch_inode_unpacked *inode,
 150                          u32 snapshot)
 151 {
 152         struct bkey_inode_buf *inode_p =
 153                 bch2_trans_kmalloc(trans, sizeof(*inode_p));
 154
 155         if (IS_ERR(inode_p))
 156                 return PTR_ERR(inode_p);
 157
 158         bch2_inode_pack(inode_p, inode);
 159         inode_p->inode.k.p.snapshot = snapshot;
 160
 161         return bch2_btree_insert_nonextent(trans, BTREE_ID_inodes,
 162                                 &inode_p->inode.k_i,
 163                                 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
 164 }
 165
 166 static int fsck_write_inode(struct btree_trans *trans,
 167                             struct bch_inode_unpacked *inode,
 168                             u32 snapshot)
 169 {
 170         int ret = commit_do(trans, NULL, NULL, BCH_TRANS_COMMIT_no_enospc,
 171                             __write_inode(trans, inode, snapshot));
 172         bch_err_fn(trans->c, ret);
 173         return ret;
 174 }
 175
 176 static int __remove_dirent(struct btree_trans *trans, struct bpos pos)
 177 {
 178         struct bch_fs *c = trans->c;
 179         struct btree_iter iter;
 180         struct bch_inode_unpacked dir_inode;
 181         struct bch_hash_info dir_hash_info;
 182         int ret;
 183
 184         ret = lookup_first_inode(trans, pos.inode, &dir_inode);
 185         if (ret)
 186                 goto err;
 187
 188         dir_hash_info = bch2_hash_info_init(c, &dir_inode);
 189
 190         bch2_trans_iter_init(trans, &iter, BTREE_ID_dirents, pos, BTREE_ITER_INTENT);
 191
 192         ret = bch2_hash_delete_at(trans, bch2_dirent_hash_desc,
 193                                   &dir_hash_info, &iter,
 194                                   BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
 195         bch2_trans_iter_exit(trans, &iter);
 196 err:
 197         bch_err_fn(c, ret);
 198         return ret;
 199 }
 200
 201 /* Get lost+found, create if it doesn't exist: */
 202 static int lookup_lostfound(struct btree_trans *trans, u32 snapshot,
 203                             struct bch_inode_unpacked *lostfound)
 204 {
 205         struct bch_fs *c = trans->c;
 206         struct qstr lostfound_str = QSTR("lost+found");
 207         u64 inum = 0;
 208         unsigned d_type = 0;
 209         int ret;
 210
 211         struct bch_snapshot_tree st;
 212         ret = bch2_snapshot_tree_lookup(trans,
 213                         bch2_snapshot_tree(c, snapshot), &st);
 214         if (ret)
 215                 return ret;
 216
 217         subvol_inum root_inum = { .subvol = le32_to_cpu(st.master_subvol) };
 218         u32 subvol_snapshot;
 219
 220         ret = subvol_lookup(trans, le32_to_cpu(st.master_subvol),
 221                             &subvol_snapshot, &root_inum.inum);
 222         bch_err_msg(c, ret, "looking up root subvol");
 223         if (ret)
 224                 return ret;
 225
 226         struct bch_inode_unpacked root_inode;
 227         struct bch_hash_info root_hash_info;
 228         ret = lookup_inode(trans, root_inum.inum, &root_inode, &snapshot);
 229         bch_err_msg(c, ret, "looking up root inode");
 230         if (ret)
 231                 return ret;
 232
 233         root_hash_info = bch2_hash_info_init(c, &root_inode);
 234
 235         ret = __lookup_dirent(trans, root_hash_info, root_inum,
 236                               &lostfound_str, &inum, &d_type);
 237         if (bch2_err_matches(ret, ENOENT))
 238                 goto create_lostfound;
 239
 240         bch_err_fn(c, ret);
 241         if (ret)
 242                 return ret;
 243
 244         if (d_type != DT_DIR) {
 245                 bch_err(c, "error looking up lost+found: not a directory");
 246                 return -BCH_ERR_ENOENT_not_directory;
 247         }
 248
 249         /*
 250          * The bch2_check_dirents pass has already run, dangling dirents
 251          * shouldn't exist here:
 252          */
 253         return lookup_inode(trans, inum, lostfound, &snapshot);
 254
 255 create_lostfound:
 256         /*
 257          * XXX: we could have a nicer log message here  if we had a nice way to
 258          * walk backpointers to print a path
 259          */
 260         bch_notice(c, "creating lost+found in snapshot %u", le32_to_cpu(st.root_snapshot));
 261
 262         u64 now = bch2_current_time(c);
 263         struct btree_iter lostfound_iter = { NULL };
 264         u64 cpu = raw_smp_processor_id();
 265
 266         bch2_inode_init_early(c, lostfound);
 267         bch2_inode_init_late(lostfound, now, 0, 0, S_IFDIR|0700, 0, &root_inode);
 268         lostfound->bi_dir = root_inode.bi_inum;
 269
 270         root_inode.bi_nlink++;
 271
 272         ret = bch2_inode_create(trans, &lostfound_iter, lostfound, snapshot, cpu);
 273         if (ret)
 274                 goto err;
 275
 276         bch2_btree_iter_set_snapshot(&lostfound_iter, snapshot);
 277         ret = bch2_btree_iter_traverse(&lostfound_iter);
 278         if (ret)
 279                 goto err;
 280
 281         ret =   bch2_dirent_create_snapshot(trans,
 282                                 root_inode.bi_inum, snapshot, &root_hash_info,
 283                                 mode_to_type(lostfound->bi_mode),
 284                                 &lostfound_str,
 285                                 lostfound->bi_inum,
 286                                 &lostfound->bi_dir_offset,
 287                                 BCH_HASH_SET_MUST_CREATE) ?:
 288                 bch2_inode_write_flags(trans, &lostfound_iter, lostfound,
 289                                        BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
 290 err:
 291         bch_err_msg(c, ret, "creating lost+found");
 292         bch2_trans_iter_exit(trans, &lostfound_iter);
 293         return ret;
 294 }
 295
 296 static int reattach_inode(struct btree_trans *trans,
 297                           struct bch_inode_unpacked *inode,
 298                           u32 inode_snapshot)
 299 {
 300         struct bch_hash_info dir_hash;
 301         struct bch_inode_unpacked lostfound;
 302         char name_buf[20];
 303         struct qstr name;
 304         u64 dir_offset = 0;
 305         int ret;
 306
 307         ret = lookup_lostfound(trans, inode_snapshot, &lostfound);
 308         if (ret)
 309                 return ret;
 310
 311         if (S_ISDIR(inode->bi_mode)) {
 312                 lostfound.bi_nlink++;
 313
 314                 ret = __write_inode(trans, &lostfound, U32_MAX);
 315                 if (ret)
 316                         return ret;
 317         }
 318
 319         dir_hash = bch2_hash_info_init(trans->c, &lostfound);
 320
 321         snprintf(name_buf, sizeof(name_buf), "%llu", inode->bi_inum);
 322         name = (struct qstr) QSTR(name_buf);
 323
 324         ret = bch2_dirent_create_snapshot(trans,
 325                                 lostfound.bi_inum, inode_snapshot,
 326                                 &dir_hash,
 327                                 inode_d_type(inode),
 328                                 &name, inode->bi_inum, &dir_offset,
 329                                 BCH_HASH_SET_MUST_CREATE);
 330         if (ret)
 331                 return ret;
 332
 333         inode->bi_dir           = lostfound.bi_inum;
 334         inode->bi_dir_offset    = dir_offset;
 335
 336         return __write_inode(trans, inode, inode_snapshot);
 337 }
 338
 339 static int remove_backpointer(struct btree_trans *trans,
 340                               struct bch_inode_unpacked *inode)
 341 {
 342         struct btree_iter iter;
 343         struct bkey_s_c_dirent d;
 344         int ret;
 345
 346         d = bch2_bkey_get_iter_typed(trans, &iter, BTREE_ID_dirents,
 347                                      POS(inode->bi_dir, inode->bi_dir_offset), 0,
 348                                      dirent);
 349         ret =   bkey_err(d) ?:
 350                 __remove_dirent(trans, d.k->p);
 351         bch2_trans_iter_exit(trans, &iter);
 352         return ret;
 353 }
 354
 355 struct snapshots_seen_entry {
 356         u32                             id;
 357         u32                             equiv;
 358 };
 359
 360 struct snapshots_seen {
 361         struct bpos                     pos;
 362         DARRAY(struct snapshots_seen_entry) ids;
 363 };
 364
 365 static inline void snapshots_seen_exit(struct snapshots_seen *s)
 366 {
 367         darray_exit(&s->ids);
 368 }
 369
 370 static inline void snapshots_seen_init(struct snapshots_seen *s)
 371 {
 372         memset(s, 0, sizeof(*s));
 373 }
 374
 375 static int snapshots_seen_add_inorder(struct bch_fs *c, struct snapshots_seen *s, u32 id)
 376 {
 377         struct snapshots_seen_entry *i, n = {
 378                 .id     = id,
 379                 .equiv  = bch2_snapshot_equiv(c, id),
 380         };
 381         int ret = 0;
 382
 383         __darray_for_each(s->ids, i) {
 384                 if (i->id == id)
 385                         return 0;
 386                 if (i->id > id)
 387                         break;
 388         }
 389
 390         ret = darray_insert_item(&s->ids, i - s->ids.data, n);
 391         if (ret)
 392                 bch_err(c, "error reallocating snapshots_seen table (size %zu)",
 393                         s->ids.size);
 394         return ret;
 395 }
 396
 397 static int snapshots_seen_update(struct bch_fs *c, struct snapshots_seen *s,
 398                                  enum btree_id btree_id, struct bpos pos)
 399 {
 400         struct snapshots_seen_entry n = {
 401                 .id     = pos.snapshot,
 402                 .equiv  = bch2_snapshot_equiv(c, pos.snapshot),
 403         };
 404         int ret = 0;
 405
 406         if (!bkey_eq(s->pos, pos))
 407                 s->ids.nr = 0;
 408
 409         s->pos = pos;
 410         s->pos.snapshot = n.equiv;
 411
 412         darray_for_each(s->ids, i) {
 413                 if (i->id == n.id)
 414                         return 0;
 415
 416                 /*
 417                  * We currently don't rigorously track for snapshot cleanup
 418                  * needing to be run, so it shouldn't be a fsck error yet:
 419                  */
 420                 if (i->equiv == n.equiv) {
 421                         bch_err(c, "snapshot deletion did not finish:\n"
 422                                 "  duplicate keys in btree %s at %llu:%llu snapshots %u, %u (equiv %u)\n",
 423                                 bch2_btree_id_str(btree_id),
 424                                 pos.inode, pos.offset,
 425                                 i->id, n.id, n.equiv);
 426                         set_bit(BCH_FS_need_delete_dead_snapshots, &c->flags);
 427                         return bch2_run_explicit_recovery_pass(c, BCH_RECOVERY_PASS_delete_dead_snapshots);
 428                 }
 429         }
 430
 431         ret = darray_push(&s->ids, n);
 432         if (ret)
 433                 bch_err(c, "error reallocating snapshots_seen table (size %zu)",
 434                         s->ids.size);
 435         return ret;
 436 }
 437
 438 /**
 439  * key_visible_in_snapshot - returns true if @id is a descendent of @ancestor,
 440  * and @ancestor hasn't been overwritten in @seen
 441  *
 442  * @c:          filesystem handle
 443  * @seen:       list of snapshot ids already seen at current position
 444  * @id:         descendent snapshot id
 445  * @ancestor:   ancestor snapshot id
 446  *
 447  * Returns:     whether key in @ancestor snapshot is visible in @id snapshot
 448  */
 449 static bool key_visible_in_snapshot(struct bch_fs *c, struct snapshots_seen *seen,
 450                                     u32 id, u32 ancestor)
 451 {
 452         ssize_t i;
 453
 454         EBUG_ON(id > ancestor);
 455         EBUG_ON(!bch2_snapshot_is_equiv(c, id));
 456         EBUG_ON(!bch2_snapshot_is_equiv(c, ancestor));
 457
 458         /* @ancestor should be the snapshot most recently added to @seen */
 459         EBUG_ON(ancestor != seen->pos.snapshot);
 460         EBUG_ON(ancestor != seen->ids.data[seen->ids.nr - 1].equiv);
 461
 462         if (id == ancestor)
 463                 return true;
 464
 465         if (!bch2_snapshot_is_ancestor(c, id, ancestor))
 466                 return false;
 467
 468         /*
 469          * We know that @id is a descendant of @ancestor, we're checking if
 470          * we've seen a key that overwrote @ancestor - i.e. also a descendent of
 471          * @ascestor and with @id as a descendent.
 472          *
 473          * But we already know that we're scanning IDs between @id and @ancestor
 474          * numerically, since snapshot ID lists are kept sorted, so if we find
 475          * an id that's an ancestor of @id we're done:
 476          */
 477
 478         for (i = seen->ids.nr - 2;
 479              i >= 0 && seen->ids.data[i].equiv >= id;
 480              --i)
 481                 if (bch2_snapshot_is_ancestor(c, id, seen->ids.data[i].equiv))
 482                         return false;
 483
 484         return true;
 485 }
 486
 487 /**
 488  * ref_visible - given a key with snapshot id @src that points to a key with
 489  * snapshot id @dst, test whether there is some snapshot in which @dst is
 490  * visible.
 491  *
 492  * @c:          filesystem handle
 493  * @s:          list of snapshot IDs already seen at @src
 494  * @src:        snapshot ID of src key
 495  * @dst:        snapshot ID of dst key
 496  * Returns:     true if there is some snapshot in which @dst is visible
 497  *
 498  * Assumes we're visiting @src keys in natural key order
 499  */
 500 static bool ref_visible(struct bch_fs *c, struct snapshots_seen *s,
 501                         u32 src, u32 dst)
 502 {
 503         return dst <= src
 504                 ? key_visible_in_snapshot(c, s, dst, src)
 505                 : bch2_snapshot_is_ancestor(c, src, dst);
 506 }
 507
 508 static int ref_visible2(struct bch_fs *c,
 509                         u32 src, struct snapshots_seen *src_seen,
 510                         u32 dst, struct snapshots_seen *dst_seen)
 511 {
 512         src = bch2_snapshot_equiv(c, src);
 513         dst = bch2_snapshot_equiv(c, dst);
 514
 515         if (dst > src) {
 516                 swap(dst, src);
 517                 swap(dst_seen, src_seen);
 518         }
 519         return key_visible_in_snapshot(c, src_seen, dst, src);
 520 }
 521
 522 #define for_each_visible_inode(_c, _s, _w, _snapshot, _i)                               \
 523         for (_i = (_w)->inodes.data; _i < (_w)->inodes.data + (_w)->inodes.nr &&        \
 524              (_i)->snapshot <= (_snapshot); _i++)                                       \
 525                 if (key_visible_in_snapshot(_c, _s, _i->snapshot, _snapshot))
 526
 527 struct inode_walker_entry {
 528         struct bch_inode_unpacked inode;
 529         u32                     snapshot;
 530         bool                    seen_this_pos;
 531         u64                     count;
 532 };
 533
 534 struct inode_walker {
 535         bool                            first_this_inode;
 536         bool                            recalculate_sums;
 537         struct bpos                     last_pos;
 538
 539         DARRAY(struct inode_walker_entry) inodes;
 540 };
 541
 542 static void inode_walker_exit(struct inode_walker *w)
 543 {
 544         darray_exit(&w->inodes);
 545 }
 546
 547 static struct inode_walker inode_walker_init(void)
 548 {
 549         return (struct inode_walker) { 0, };
 550 }
 551
 552 static int add_inode(struct bch_fs *c, struct inode_walker *w,
 553                      struct bkey_s_c inode)
 554 {
 555         struct bch_inode_unpacked u;
 556
 557         BUG_ON(bch2_inode_unpack(inode, &u));
 558
 559         return darray_push(&w->inodes, ((struct inode_walker_entry) {
 560                 .inode          = u,
 561                 .snapshot       = bch2_snapshot_equiv(c, inode.k->p.snapshot),
 562         }));
 563 }
 564
 565 static int get_inodes_all_snapshots(struct btree_trans *trans,
 566                                     struct inode_walker *w, u64 inum)
 567 {
 568         struct bch_fs *c = trans->c;
 569         struct btree_iter iter;
 570         struct bkey_s_c k;
 571         int ret;
 572
 573         w->recalculate_sums = false;
 574         w->inodes.nr = 0;
 575
 576         for_each_btree_key_norestart(trans, iter, BTREE_ID_inodes, POS(0, inum),
 577                                      BTREE_ITER_ALL_SNAPSHOTS, k, ret) {
 578                 if (k.k->p.offset != inum)
 579                         break;
 580
 581                 if (bkey_is_inode(k.k))
 582                         add_inode(c, w, k);
 583         }
 584         bch2_trans_iter_exit(trans, &iter);
 585
 586         if (ret)
 587                 return ret;
 588
 589         w->first_this_inode = true;
 590         return 0;
 591 }
 592
 593 static struct inode_walker_entry *
 594 lookup_inode_for_snapshot(struct bch_fs *c, struct inode_walker *w,
 595                           u32 snapshot, bool is_whiteout)
 596 {
 597         struct inode_walker_entry *i;
 598
 599         snapshot = bch2_snapshot_equiv(c, snapshot);
 600
 601         __darray_for_each(w->inodes, i)
 602                 if (bch2_snapshot_is_ancestor(c, snapshot, i->snapshot))
 603                         goto found;
 604
 605         return NULL;
 606 found:
 607         BUG_ON(snapshot > i->snapshot);
 608
 609         if (snapshot != i->snapshot && !is_whiteout) {
 610                 struct inode_walker_entry new = *i;
 611                 size_t pos;
 612                 int ret;
 613
 614                 new.snapshot = snapshot;
 615                 new.count = 0;
 616
 617                 bch_info(c, "have key for inode %llu:%u but have inode in ancestor snapshot %u",
 618                          w->last_pos.inode, snapshot, i->snapshot);
 619
 620                 while (i > w->inodes.data && i[-1].snapshot > snapshot)
 621                         --i;
 622
 623                 pos = i - w->inodes.data;
 624                 ret = darray_insert_item(&w->inodes, pos, new);
 625                 if (ret)
 626                         return ERR_PTR(ret);
 627
 628                 i = w->inodes.data + pos;
 629         }
 630
 631         return i;
 632 }
 633
 634 static struct inode_walker_entry *walk_inode(struct btree_trans *trans,
 635                                              struct inode_walker *w, struct bpos pos,
 636                                              bool is_whiteout)
 637 {
 638         if (w->last_pos.inode != pos.inode) {
 639                 int ret = get_inodes_all_snapshots(trans, w, pos.inode);
 640                 if (ret)
 641                         return ERR_PTR(ret);
 642         } else if (bkey_cmp(w->last_pos, pos)) {
 643                 darray_for_each(w->inodes, i)
 644                         i->seen_this_pos = false;
 645         }
 646
 647         w->last_pos = pos;
 648
 649         return lookup_inode_for_snapshot(trans->c, w, pos.snapshot, is_whiteout);
 650 }
 651
 652 static int __get_visible_inodes(struct btree_trans *trans,
 653                                 struct inode_walker *w,
 654                                 struct snapshots_seen *s,
 655                                 u64 inum)
 656 {
 657         struct bch_fs *c = trans->c;
 658         struct btree_iter iter;
 659         struct bkey_s_c k;
 660         int ret;
 661
 662         w->inodes.nr = 0;
 663
 664         for_each_btree_key_norestart(trans, iter, BTREE_ID_inodes, POS(0, inum),
 665                            BTREE_ITER_ALL_SNAPSHOTS, k, ret) {
 666                 u32 equiv = bch2_snapshot_equiv(c, k.k->p.snapshot);
 667
 668                 if (k.k->p.offset != inum)
 669                         break;
 670
 671                 if (!ref_visible(c, s, s->pos.snapshot, equiv))
 672                         continue;
 673
 674                 if (bkey_is_inode(k.k))
 675                         add_inode(c, w, k);
 676
 677                 if (equiv >= s->pos.snapshot)
 678                         break;
 679         }
 680         bch2_trans_iter_exit(trans, &iter);
 681
 682         return ret;
 683 }
 684
 685 static int check_key_has_snapshot(struct btree_trans *trans,
 686                                   struct btree_iter *iter,
 687                                   struct bkey_s_c k)
 688 {
 689         struct bch_fs *c = trans->c;
 690         struct printbuf buf = PRINTBUF;
 691         int ret = 0;
 692
 693         if (mustfix_fsck_err_on(!bch2_snapshot_equiv(c, k.k->p.snapshot), c,
 694                                 bkey_in_missing_snapshot,
 695                                 "key in missing snapshot: %s",
 696                                 (bch2_bkey_val_to_text(&buf, c, k), buf.buf)))
 697                 ret = bch2_btree_delete_at(trans, iter,
 698                                             BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE) ?: 1;
 699 fsck_err:
 700         printbuf_exit(&buf);
 701         return ret;
 702 }
 703
 704 static int hash_redo_key(struct btree_trans *trans,
 705                          const struct bch_hash_desc desc,
 706                          struct bch_hash_info *hash_info,
 707                          struct btree_iter *k_iter, struct bkey_s_c k)
 708 {
 709         struct bkey_i *delete;
 710         struct bkey_i *tmp;
 711
 712         delete = bch2_trans_kmalloc(trans, sizeof(*delete));
 713         if (IS_ERR(delete))
 714                 return PTR_ERR(delete);
 715
 716         tmp = bch2_bkey_make_mut_noupdate(trans, k);
 717         if (IS_ERR(tmp))
 718                 return PTR_ERR(tmp);
 719
 720         bkey_init(&delete->k);
 721         delete->k.p = k_iter->pos;
 722         return  bch2_btree_iter_traverse(k_iter) ?:
 723                 bch2_trans_update(trans, k_iter, delete, 0) ?:
 724                 bch2_hash_set_snapshot(trans, desc, hash_info,
 725                                        (subvol_inum) { 0, k.k->p.inode },
 726                                        k.k->p.snapshot, tmp,
 727                                        BCH_HASH_SET_MUST_CREATE,
 728                                        BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE) ?:
 729                 bch2_trans_commit(trans, NULL, NULL, BCH_TRANS_COMMIT_no_enospc);
 730 }
 731
 732 static int hash_check_key(struct btree_trans *trans,
 733                           const struct bch_hash_desc desc,
 734                           struct bch_hash_info *hash_info,
 735                           struct btree_iter *k_iter, struct bkey_s_c hash_k)
 736 {
 737         struct bch_fs *c = trans->c;
 738         struct btree_iter iter = { NULL };
 739         struct printbuf buf = PRINTBUF;
 740         struct bkey_s_c k;
 741         u64 hash;
 742         int ret = 0;
 743
 744         if (hash_k.k->type != desc.key_type)
 745                 return 0;
 746
 747         hash = desc.hash_bkey(hash_info, hash_k);
 748
 749         if (likely(hash == hash_k.k->p.offset))
 750                 return 0;
 751
 752         if (hash_k.k->p.offset < hash)
 753                 goto bad_hash;
 754
 755         for_each_btree_key_norestart(trans, iter, desc.btree_id,
 756                                      SPOS(hash_k.k->p.inode, hash, hash_k.k->p.snapshot),
 757                                      BTREE_ITER_SLOTS, k, ret) {
 758                 if (bkey_eq(k.k->p, hash_k.k->p))
 759                         break;
 760
 761                 if (fsck_err_on(k.k->type == desc.key_type &&
 762                                 !desc.cmp_bkey(k, hash_k), c,
 763                                 hash_table_key_duplicate,
 764                                 "duplicate hash table keys:\n%s",
 765                                 (printbuf_reset(&buf),
 766                                  bch2_bkey_val_to_text(&buf, c, hash_k),
 767                                  buf.buf))) {
 768                         ret = bch2_hash_delete_at(trans, desc, hash_info, k_iter, 0) ?: 1;
 769                         break;
 770                 }
 771
 772                 if (bkey_deleted(k.k)) {
 773                         bch2_trans_iter_exit(trans, &iter);
 774                         goto bad_hash;
 775                 }
 776         }
 777 out:
 778         bch2_trans_iter_exit(trans, &iter);
 779         printbuf_exit(&buf);
 780         return ret;
 781 bad_hash:
 782         if (fsck_err(c, hash_table_key_wrong_offset,
 783                      "hash table key at wrong offset: btree %s inode %llu offset %llu, hashed to %llu\n%s",
 784                      bch2_btree_id_str(desc.btree_id), hash_k.k->p.inode, hash_k.k->p.offset, hash,
 785                      (printbuf_reset(&buf),
 786                       bch2_bkey_val_to_text(&buf, c, hash_k), buf.buf))) {
 787                 ret = hash_redo_key(trans, desc, hash_info, k_iter, hash_k);
 788                 bch_err_fn(c, ret);
 789                 if (ret)
 790                         return ret;
 791                 ret = -BCH_ERR_transaction_restart_nested;
 792         }
 793 fsck_err:
 794         goto out;
 795 }
 796
 797 static int check_inode_deleted_list(struct btree_trans *trans, struct bpos p)
 798 {
 799         struct btree_iter iter;
 800         struct bkey_s_c k = bch2_bkey_get_iter(trans, &iter, BTREE_ID_deleted_inodes, p, 0);
 801         int ret = bkey_err(k);
 802         if (ret)
 803                 return ret;
 804
 805         bch2_trans_iter_exit(trans, &iter);
 806         return k.k->type == KEY_TYPE_set;
 807 }
 808
 809 static int check_inode(struct btree_trans *trans,
 810                        struct btree_iter *iter,
 811                        struct bkey_s_c k,
 812                        struct bch_inode_unpacked *prev,
 813                        struct snapshots_seen *s,
 814                        bool full)
 815 {
 816         struct bch_fs *c = trans->c;
 817         struct bch_inode_unpacked u;
 818         bool do_update = false;
 819         int ret;
 820
 821         ret = check_key_has_snapshot(trans, iter, k);
 822         if (ret < 0)
 823                 goto err;
 824         if (ret)
 825                 return 0;
 826
 827         ret = snapshots_seen_update(c, s, iter->btree_id, k.k->p);
 828         if (ret)
 829                 goto err;
 830
 831         if (!bkey_is_inode(k.k))
 832                 return 0;
 833
 834         BUG_ON(bch2_inode_unpack(k, &u));
 835
 836         if (!full &&
 837             !(u.bi_flags & (BCH_INODE_i_size_dirty|
 838                             BCH_INODE_i_sectors_dirty|
 839                             BCH_INODE_unlinked)))
 840                 return 0;
 841
 842         if (prev->bi_inum != u.bi_inum)
 843                 *prev = u;
 844
 845         if (fsck_err_on(prev->bi_hash_seed      != u.bi_hash_seed ||
 846                         inode_d_type(prev)      != inode_d_type(&u),
 847                         c, inode_snapshot_mismatch,
 848                         "inodes in different snapshots don't match")) {
 849                 bch_err(c, "repair not implemented yet");
 850                 return -BCH_ERR_fsck_repair_unimplemented;
 851         }
 852
 853         if ((u.bi_flags & (BCH_INODE_i_size_dirty|BCH_INODE_unlinked)) &&
 854             bch2_key_has_snapshot_overwrites(trans, BTREE_ID_inodes, k.k->p)) {
 855                 struct bpos new_min_pos;
 856
 857                 ret = bch2_propagate_key_to_snapshot_leaves(trans, iter->btree_id, k, &new_min_pos);
 858                 if (ret)
 859                         goto err;
 860
 861                 u.bi_flags &= ~BCH_INODE_i_size_dirty|BCH_INODE_unlinked;
 862
 863                 ret = __write_inode(trans, &u, iter->pos.snapshot);
 864                 bch_err_msg(c, ret, "in fsck updating inode");
 865                 if (ret)
 866                         return ret;
 867
 868                 if (!bpos_eq(new_min_pos, POS_MIN))
 869                         bch2_btree_iter_set_pos(iter, bpos_predecessor(new_min_pos));
 870                 return 0;
 871         }
 872
 873         if (u.bi_flags & BCH_INODE_unlinked &&
 874             c->sb.version >= bcachefs_metadata_version_deleted_inodes) {
 875                 ret = check_inode_deleted_list(trans, k.k->p);
 876                 if (ret < 0)
 877                         return ret;
 878
 879                 fsck_err_on(ret, c, unlinked_inode_not_on_deleted_list,
 880                             "inode %llu:%u unlinked, but not on deleted list",
 881                             u.bi_inum, k.k->p.snapshot);
 882                 ret = 0;
 883         }
 884
 885         if (u.bi_flags & BCH_INODE_unlinked &&
 886             (!c->sb.clean ||
 887              fsck_err(c, inode_unlinked_but_clean,
 888                       "filesystem marked clean, but inode %llu unlinked",
 889                       u.bi_inum))) {
 890                 ret = bch2_inode_rm_snapshot(trans, u.bi_inum, iter->pos.snapshot);
 891                 bch_err_msg(c, ret, "in fsck deleting inode");
 892                 return ret;
 893         }
 894
 895         if (u.bi_flags & BCH_INODE_i_size_dirty &&
 896             (!c->sb.clean ||
 897              fsck_err(c, inode_i_size_dirty_but_clean,
 898                       "filesystem marked clean, but inode %llu has i_size dirty",
 899                       u.bi_inum))) {
 900                 bch_verbose(c, "truncating inode %llu", u.bi_inum);
 901
 902                 /*
 903                  * XXX: need to truncate partial blocks too here - or ideally
 904                  * just switch units to bytes and that issue goes away
 905                  */
 906                 ret = bch2_btree_delete_range_trans(trans, BTREE_ID_extents,
 907                                 SPOS(u.bi_inum, round_up(u.bi_size, block_bytes(c)) >> 9,
 908                                      iter->pos.snapshot),
 909                                 POS(u.bi_inum, U64_MAX),
 910                                 0, NULL);
 911                 bch_err_msg(c, ret, "in fsck truncating inode");
 912                 if (ret)
 913                         return ret;
 914
 915                 /*
 916                  * We truncated without our normal sector accounting hook, just
 917                  * make sure we recalculate it:
 918                  */
 919                 u.bi_flags |= BCH_INODE_i_sectors_dirty;
 920
 921                 u.bi_flags &= ~BCH_INODE_i_size_dirty;
 922                 do_update = true;
 923         }
 924
 925         if (u.bi_flags & BCH_INODE_i_sectors_dirty &&
 926             (!c->sb.clean ||
 927              fsck_err(c, inode_i_sectors_dirty_but_clean,
 928                       "filesystem marked clean, but inode %llu has i_sectors dirty",
 929                       u.bi_inum))) {
 930                 s64 sectors;
 931
 932                 bch_verbose(c, "recounting sectors for inode %llu",
 933                             u.bi_inum);
 934
 935                 sectors = bch2_count_inode_sectors(trans, u.bi_inum, iter->pos.snapshot);
 936                 if (sectors < 0) {
 937                         bch_err_msg(c, sectors, "in fsck recounting inode sectors");
 938                         return sectors;
 939                 }
 940
 941                 u.bi_sectors = sectors;
 942                 u.bi_flags &= ~BCH_INODE_i_sectors_dirty;
 943                 do_update = true;
 944         }
 945
 946         if (u.bi_flags & BCH_INODE_backptr_untrusted) {
 947                 u.bi_dir = 0;
 948                 u.bi_dir_offset = 0;
 949                 u.bi_flags &= ~BCH_INODE_backptr_untrusted;
 950                 do_update = true;
 951         }
 952
 953         if (do_update) {
 954                 ret = __write_inode(trans, &u, iter->pos.snapshot);
 955                 bch_err_msg(c, ret, "in fsck updating inode");
 956                 if (ret)
 957                         return ret;
 958         }
 959 err:
 960 fsck_err:
 961         bch_err_fn(c, ret);
 962         return ret;
 963 }
 964
 965 int bch2_check_inodes(struct bch_fs *c)
 966 {
 967         bool full = c->opts.fsck;
 968         struct bch_inode_unpacked prev = { 0 };
 969         struct snapshots_seen s;
 970
 971         snapshots_seen_init(&s);
 972
 973         int ret = bch2_trans_run(c,
 974                 for_each_btree_key_commit(trans, iter, BTREE_ID_inodes,
 975                                 POS_MIN,
 976                                 BTREE_ITER_PREFETCH|BTREE_ITER_ALL_SNAPSHOTS, k,
 977                                 NULL, NULL, BCH_TRANS_COMMIT_no_enospc,
 978                         check_inode(trans, &iter, k, &prev, &s, full)));
 979
 980         snapshots_seen_exit(&s);
 981         bch_err_fn(c, ret);
 982         return ret;
 983 }
 984
 985 static struct bkey_s_c_dirent dirent_get_by_pos(struct btree_trans *trans,
 986                                                 struct btree_iter *iter,
 987                                                 struct bpos pos)
 988 {
 989         return bch2_bkey_get_iter_typed(trans, iter, BTREE_ID_dirents, pos, 0, dirent);
 990 }
 991
 992 static bool inode_points_to_dirent(struct bch_inode_unpacked *inode,
 993                                    struct bkey_s_c_dirent d)
 994 {
 995         return  inode->bi_dir           == d.k->p.inode &&
 996                 inode->bi_dir_offset    == d.k->p.offset;
 997 }
 998
 999 static bool dirent_points_to_inode(struct bkey_s_c_dirent d,
1000                                    struct bch_inode_unpacked *inode)
1001 {
1002         return d.v->d_type == DT_SUBVOL
1003                 ? le32_to_cpu(d.v->d_child_subvol)      == inode->bi_subvol
1004                 : le64_to_cpu(d.v->d_inum)              == inode->bi_inum;
1005 }
1006
1007 static int check_i_sectors(struct btree_trans *trans, struct inode_walker *w)
1008 {
1009         struct bch_fs *c = trans->c;
1010         u32 restart_count = trans->restart_count;
1011         int ret = 0;
1012         s64 count2;
1013
1014         darray_for_each(w->inodes, i) {
1015                 if (i->inode.bi_sectors == i->count)
1016                         continue;
1017
1018                 count2 = bch2_count_inode_sectors(trans, w->last_pos.inode, i->snapshot);
1019
1020                 if (w->recalculate_sums)
1021                         i->count = count2;
1022
1023                 if (i->count != count2) {
1024                         bch_err(c, "fsck counted i_sectors wrong for inode %llu:%u: got %llu should be %llu",
1025                                 w->last_pos.inode, i->snapshot, i->count, count2);
1026                         return -BCH_ERR_internal_fsck_err;
1027                 }
1028
1029                 if (fsck_err_on(!(i->inode.bi_flags & BCH_INODE_i_sectors_dirty),
1030                                 c, inode_i_sectors_wrong,
1031                                 "inode %llu:%u has incorrect i_sectors: got %llu, should be %llu",
1032                                 w->last_pos.inode, i->snapshot,
1033                                 i->inode.bi_sectors, i->count)) {
1034                         i->inode.bi_sectors = i->count;
1035                         ret = fsck_write_inode(trans, &i->inode, i->snapshot);
1036                         if (ret)
1037                                 break;
1038                 }
1039         }
1040 fsck_err:
1041         bch_err_fn(c, ret);
1042         return ret ?: trans_was_restarted(trans, restart_count);
1043 }
1044
1045 struct extent_end {
1046         u32                     snapshot;
1047         u64                     offset;
1048         struct snapshots_seen   seen;
1049 };
1050
1051 struct extent_ends {
1052         struct bpos                     last_pos;
1053         DARRAY(struct extent_end)       e;
1054 };
1055
1056 static void extent_ends_reset(struct extent_ends *extent_ends)
1057 {
1058         darray_for_each(extent_ends->e, i)
1059                 snapshots_seen_exit(&i->seen);
1060         extent_ends->e.nr = 0;
1061 }
1062
1063 static void extent_ends_exit(struct extent_ends *extent_ends)
1064 {
1065         extent_ends_reset(extent_ends);
1066         darray_exit(&extent_ends->e);
1067 }
1068
1069 static void extent_ends_init(struct extent_ends *extent_ends)
1070 {
1071         memset(extent_ends, 0, sizeof(*extent_ends));
1072 }
1073
1074 static int extent_ends_at(struct bch_fs *c,
1075                           struct extent_ends *extent_ends,
1076                           struct snapshots_seen *seen,
1077                           struct bkey_s_c k)
1078 {
1079         struct extent_end *i, n = (struct extent_end) {
1080                 .offset         = k.k->p.offset,
1081                 .snapshot       = k.k->p.snapshot,
1082                 .seen           = *seen,
1083         };
1084
1085         n.seen.ids.data = kmemdup(seen->ids.data,
1086                               sizeof(seen->ids.data[0]) * seen->ids.size,
1087                               GFP_KERNEL);
1088         if (!n.seen.ids.data)
1089                 return -BCH_ERR_ENOMEM_fsck_extent_ends_at;
1090
1091         __darray_for_each(extent_ends->e, i) {
1092                 if (i->snapshot == k.k->p.snapshot) {
1093                         snapshots_seen_exit(&i->seen);
1094                         *i = n;
1095                         return 0;
1096                 }
1097
1098                 if (i->snapshot >= k.k->p.snapshot)
1099                         break;
1100         }
1101
1102         return darray_insert_item(&extent_ends->e, i - extent_ends->e.data, n);
1103 }
1104
1105 static int overlapping_extents_found(struct btree_trans *trans,
1106                                      enum btree_id btree,
1107                                      struct bpos pos1, struct snapshots_seen *pos1_seen,
1108                                      struct bkey pos2,
1109                                      bool *fixed,
1110                                      struct extent_end *extent_end)
1111 {
1112         struct bch_fs *c = trans->c;
1113         struct printbuf buf = PRINTBUF;
1114         struct btree_iter iter1, iter2 = { NULL };
1115         struct bkey_s_c k1, k2;
1116         int ret;
1117
1118         BUG_ON(bkey_le(pos1, bkey_start_pos(&pos2)));
1119
1120         bch2_trans_iter_init(trans, &iter1, btree, pos1,
1121                              BTREE_ITER_ALL_SNAPSHOTS|
1122                              BTREE_ITER_NOT_EXTENTS);
1123         k1 = bch2_btree_iter_peek_upto(&iter1, POS(pos1.inode, U64_MAX));
1124         ret = bkey_err(k1);
1125         if (ret)
1126                 goto err;
1127
1128         prt_str(&buf, "\n  ");
1129         bch2_bkey_val_to_text(&buf, c, k1);
1130
1131         if (!bpos_eq(pos1, k1.k->p)) {
1132                 prt_str(&buf, "\n  wanted\n  ");
1133                 bch2_bpos_to_text(&buf, pos1);
1134                 prt_str(&buf, "\n  ");
1135                 bch2_bkey_to_text(&buf, &pos2);
1136
1137                 bch_err(c, "%s: error finding first overlapping extent when repairing, got%s",
1138                         __func__, buf.buf);
1139                 ret = -BCH_ERR_internal_fsck_err;
1140                 goto err;
1141         }
1142
1143         bch2_trans_copy_iter(&iter2, &iter1);
1144
1145         while (1) {
1146                 bch2_btree_iter_advance(&iter2);
1147
1148                 k2 = bch2_btree_iter_peek_upto(&iter2, POS(pos1.inode, U64_MAX));
1149                 ret = bkey_err(k2);
1150                 if (ret)
1151                         goto err;
1152
1153                 if (bpos_ge(k2.k->p, pos2.p))
1154                         break;
1155         }
1156
1157         prt_str(&buf, "\n  ");
1158         bch2_bkey_val_to_text(&buf, c, k2);
1159
1160         if (bpos_gt(k2.k->p, pos2.p) ||
1161             pos2.size != k2.k->size) {
1162                 bch_err(c, "%s: error finding seconding overlapping extent when repairing%s",
1163                         __func__, buf.buf);
1164                 ret = -BCH_ERR_internal_fsck_err;
1165                 goto err;
1166         }
1167
1168         prt_printf(&buf, "\n  overwriting %s extent",
1169                    pos1.snapshot >= pos2.p.snapshot ? "first" : "second");
1170
1171         if (fsck_err(c, extent_overlapping,
1172                      "overlapping extents%s", buf.buf)) {
1173                 struct btree_iter *old_iter = &iter1;
1174                 struct disk_reservation res = { 0 };
1175
1176                 if (pos1.snapshot < pos2.p.snapshot) {
1177                         old_iter = &iter2;
1178                         swap(k1, k2);
1179                 }
1180
1181                 trans->extra_disk_res += bch2_bkey_sectors_compressed(k2);
1182
1183                 ret =   bch2_trans_update_extent_overwrite(trans, old_iter,
1184                                 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE,
1185                                 k1, k2) ?:
1186                         bch2_trans_commit(trans, &res, NULL, BCH_TRANS_COMMIT_no_enospc);
1187                 bch2_disk_reservation_put(c, &res);
1188
1189                 if (ret)
1190                         goto err;
1191
1192                 *fixed = true;
1193
1194                 if (pos1.snapshot == pos2.p.snapshot) {
1195                         /*
1196                          * We overwrote the first extent, and did the overwrite
1197                          * in the same snapshot:
1198                          */
1199                         extent_end->offset = bkey_start_offset(&pos2);
1200                 } else if (pos1.snapshot > pos2.p.snapshot) {
1201                         /*
1202                          * We overwrote the first extent in pos2's snapshot:
1203                          */
1204                         ret = snapshots_seen_add_inorder(c, pos1_seen, pos2.p.snapshot);
1205                 } else {
1206                         /*
1207                          * We overwrote the second extent - restart
1208                          * check_extent() from the top:
1209                          */
1210                         ret = -BCH_ERR_transaction_restart_nested;
1211                 }
1212         }
1213 fsck_err:
1214 err:
1215         bch2_trans_iter_exit(trans, &iter2);
1216         bch2_trans_iter_exit(trans, &iter1);
1217         printbuf_exit(&buf);
1218         return ret;
1219 }
1220
1221 static int check_overlapping_extents(struct btree_trans *trans,
1222                               struct snapshots_seen *seen,
1223                               struct extent_ends *extent_ends,
1224                               struct bkey_s_c k,
1225                               u32 equiv,
1226                               struct btree_iter *iter,
1227                               bool *fixed)
1228 {
1229         struct bch_fs *c = trans->c;
1230         int ret = 0;
1231
1232         /* transaction restart, running again */
1233         if (bpos_eq(extent_ends->last_pos, k.k->p))
1234                 return 0;
1235
1236         if (extent_ends->last_pos.inode != k.k->p.inode)
1237                 extent_ends_reset(extent_ends);
1238
1239         darray_for_each(extent_ends->e, i) {
1240                 if (i->offset <= bkey_start_offset(k.k))
1241                         continue;
1242
1243                 if (!ref_visible2(c,
1244                                   k.k->p.snapshot, seen,
1245                                   i->snapshot, &i->seen))
1246                         continue;
1247
1248                 ret = overlapping_extents_found(trans, iter->btree_id,
1249                                                 SPOS(iter->pos.inode,
1250                                                      i->offset,
1251                                                      i->snapshot),
1252                                                 &i->seen,
1253                                                 *k.k, fixed, i);
1254                 if (ret)
1255                         goto err;
1256         }
1257
1258         ret = extent_ends_at(c, extent_ends, seen, k);
1259         if (ret)
1260                 goto err;
1261
1262         extent_ends->last_pos = k.k->p;
1263 err:
1264         return ret;
1265 }
1266
1267 static int check_extent_overbig(struct btree_trans *trans, struct btree_iter *iter,
1268                                 struct bkey_s_c k)
1269 {
1270         struct bch_fs *c = trans->c;
1271         struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
1272         struct bch_extent_crc_unpacked crc;
1273         const union bch_extent_entry *i;
1274         unsigned encoded_extent_max_sectors = c->opts.encoded_extent_max >> 9;
1275
1276         bkey_for_each_crc(k.k, ptrs, crc, i)
1277                 if (crc_is_encoded(crc) &&
1278                     crc.uncompressed_size > encoded_extent_max_sectors) {
1279                         struct printbuf buf = PRINTBUF;
1280
1281                         bch2_bkey_val_to_text(&buf, c, k);
1282                         bch_err(c, "overbig encoded extent, please report this:\n  %s", buf.buf);
1283                         printbuf_exit(&buf);
1284                 }
1285
1286         return 0;
1287 }
1288
1289 static int check_extent(struct btree_trans *trans, struct btree_iter *iter,
1290                         struct bkey_s_c k,
1291                         struct inode_walker *inode,
1292                         struct snapshots_seen *s,
1293                         struct extent_ends *extent_ends)
1294 {
1295         struct bch_fs *c = trans->c;
1296         struct inode_walker_entry *i;
1297         struct printbuf buf = PRINTBUF;
1298         struct bpos equiv = k.k->p;
1299         int ret = 0;
1300
1301         equiv.snapshot = bch2_snapshot_equiv(c, k.k->p.snapshot);
1302
1303         ret = check_key_has_snapshot(trans, iter, k);
1304         if (ret) {
1305                 ret = ret < 0 ? ret : 0;
1306                 goto out;
1307         }
1308
1309         if (inode->last_pos.inode != k.k->p.inode) {
1310                 ret = check_i_sectors(trans, inode);
1311                 if (ret)
1312                         goto err;
1313         }
1314
1315         i = walk_inode(trans, inode, equiv, k.k->type == KEY_TYPE_whiteout);
1316         ret = PTR_ERR_OR_ZERO(i);
1317         if (ret)
1318                 goto err;
1319
1320         ret = snapshots_seen_update(c, s, iter->btree_id, k.k->p);
1321         if (ret)
1322                 goto err;
1323
1324         if (k.k->type != KEY_TYPE_whiteout) {
1325                 if (fsck_err_on(!i, c, extent_in_missing_inode,
1326                                 "extent in missing inode:\n  %s",
1327                                 (printbuf_reset(&buf),
1328                                  bch2_bkey_val_to_text(&buf, c, k), buf.buf)))
1329                         goto delete;
1330
1331                 if (fsck_err_on(i &&
1332                                 !S_ISREG(i->inode.bi_mode) &&
1333                                 !S_ISLNK(i->inode.bi_mode),
1334                                 c, extent_in_non_reg_inode,
1335                                 "extent in non regular inode mode %o:\n  %s",
1336                                 i->inode.bi_mode,
1337                                 (printbuf_reset(&buf),
1338                                  bch2_bkey_val_to_text(&buf, c, k), buf.buf)))
1339                         goto delete;
1340
1341                 ret = check_overlapping_extents(trans, s, extent_ends, k,
1342                                                 equiv.snapshot, iter,
1343                                                 &inode->recalculate_sums);
1344                 if (ret)
1345                         goto err;
1346         }
1347
1348         /*
1349          * Check inodes in reverse order, from oldest snapshots to newest,
1350          * starting from the inode that matches this extent's snapshot. If we
1351          * didn't have one, iterate over all inodes:
1352          */
1353         if (!i)
1354                 i = inode->inodes.data + inode->inodes.nr - 1;
1355
1356         for (;
1357              inode->inodes.data && i >= inode->inodes.data;
1358              --i) {
1359                 if (i->snapshot > equiv.snapshot ||
1360                     !key_visible_in_snapshot(c, s, i->snapshot, equiv.snapshot))
1361                         continue;
1362
1363                 if (k.k->type != KEY_TYPE_whiteout) {
1364                         if (fsck_err_on(!(i->inode.bi_flags & BCH_INODE_i_size_dirty) &&
1365                                         k.k->p.offset > round_up(i->inode.bi_size, block_bytes(c)) >> 9 &&
1366                                         !bkey_extent_is_reservation(k),
1367                                         c, extent_past_end_of_inode,
1368                                         "extent type past end of inode %llu:%u, i_size %llu\n  %s",
1369                                         i->inode.bi_inum, i->snapshot, i->inode.bi_size,
1370                                         (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1371                                 struct btree_iter iter2;
1372
1373                                 bch2_trans_copy_iter(&iter2, iter);
1374                                 bch2_btree_iter_set_snapshot(&iter2, i->snapshot);
1375                                 ret =   bch2_btree_iter_traverse(&iter2) ?:
1376                                         bch2_btree_delete_at(trans, &iter2,
1377                                                 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
1378                                 bch2_trans_iter_exit(trans, &iter2);
1379                                 if (ret)
1380                                         goto err;
1381
1382                                 iter->k.type = KEY_TYPE_whiteout;
1383                         }
1384
1385                         if (bkey_extent_is_allocation(k.k))
1386                                 i->count += k.k->size;
1387                 }
1388
1389                 i->seen_this_pos = true;
1390         }
1391 out:
1392 err:
1393 fsck_err:
1394         printbuf_exit(&buf);
1395         bch_err_fn(c, ret);
1396         return ret;
1397 delete:
1398         ret = bch2_btree_delete_at(trans, iter, BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
1399         goto out;
1400 }
1401
1402 /*
1403  * Walk extents: verify that extents have a corresponding S_ISREG inode, and
1404  * that i_size an i_sectors are consistent
1405  */
1406 int bch2_check_extents(struct bch_fs *c)
1407 {
1408         struct inode_walker w = inode_walker_init();
1409         struct snapshots_seen s;
1410         struct extent_ends extent_ends;
1411         struct disk_reservation res = { 0 };
1412
1413         snapshots_seen_init(&s);
1414         extent_ends_init(&extent_ends);
1415
1416         int ret = bch2_trans_run(c,
1417                 for_each_btree_key_commit(trans, iter, BTREE_ID_extents,
1418                                 POS(BCACHEFS_ROOT_INO, 0),
1419                                 BTREE_ITER_PREFETCH|BTREE_ITER_ALL_SNAPSHOTS, k,
1420                                 &res, NULL,
1421                                 BCH_TRANS_COMMIT_no_enospc, ({
1422                         bch2_disk_reservation_put(c, &res);
1423                         check_extent(trans, &iter, k, &w, &s, &extent_ends) ?:
1424                         check_extent_overbig(trans, &iter, k);
1425                 })) ?:
1426                 check_i_sectors(trans, &w));
1427
1428         bch2_disk_reservation_put(c, &res);
1429         extent_ends_exit(&extent_ends);
1430         inode_walker_exit(&w);
1431         snapshots_seen_exit(&s);
1432
1433         bch_err_fn(c, ret);
1434         return ret;
1435 }
1436
1437 int bch2_check_indirect_extents(struct bch_fs *c)
1438 {
1439         struct disk_reservation res = { 0 };
1440
1441         int ret = bch2_trans_run(c,
1442                 for_each_btree_key_commit(trans, iter, BTREE_ID_reflink,
1443                                 POS_MIN,
1444                                 BTREE_ITER_PREFETCH, k,
1445                                 &res, NULL,
1446                                 BCH_TRANS_COMMIT_no_enospc, ({
1447                         bch2_disk_reservation_put(c, &res);
1448                         check_extent_overbig(trans, &iter, k);
1449                 })));
1450
1451         bch2_disk_reservation_put(c, &res);
1452         bch_err_fn(c, ret);
1453         return ret;
1454 }
1455
1456 static int check_subdir_count(struct btree_trans *trans, struct inode_walker *w)
1457 {
1458         struct bch_fs *c = trans->c;
1459         u32 restart_count = trans->restart_count;
1460         int ret = 0;
1461         s64 count2;
1462
1463         darray_for_each(w->inodes, i) {
1464                 if (i->inode.bi_nlink == i->count)
1465                         continue;
1466
1467                 count2 = bch2_count_subdirs(trans, w->last_pos.inode, i->snapshot);
1468                 if (count2 < 0)
1469                         return count2;
1470
1471                 if (i->count != count2) {
1472                         bch_err(c, "fsck counted subdirectories wrong: got %llu should be %llu",
1473                                 i->count, count2);
1474                         i->count = count2;
1475                         if (i->inode.bi_nlink == i->count)
1476                                 continue;
1477                 }
1478
1479                 if (fsck_err_on(i->inode.bi_nlink != i->count,
1480                                 c, inode_dir_wrong_nlink,
1481                                 "directory %llu:%u with wrong i_nlink: got %u, should be %llu",
1482                                 w->last_pos.inode, i->snapshot, i->inode.bi_nlink, i->count)) {
1483                         i->inode.bi_nlink = i->count;
1484                         ret = fsck_write_inode(trans, &i->inode, i->snapshot);
1485                         if (ret)
1486                                 break;
1487                 }
1488         }
1489 fsck_err:
1490         bch_err_fn(c, ret);
1491         return ret ?: trans_was_restarted(trans, restart_count);
1492 }
1493
1494 static int check_dirent_target(struct btree_trans *trans,
1495                                struct btree_iter *iter,
1496                                struct bkey_s_c_dirent d,
1497                                struct bch_inode_unpacked *target,
1498                                u32 target_snapshot)
1499 {
1500         struct bch_fs *c = trans->c;
1501         struct bkey_i_dirent *n;
1502         struct printbuf buf = PRINTBUF;
1503         struct btree_iter bp_iter = { NULL };
1504         int ret = 0;
1505
1506         if (!target->bi_dir &&
1507             !target->bi_dir_offset) {
1508                 target->bi_dir          = d.k->p.inode;
1509                 target->bi_dir_offset   = d.k->p.offset;
1510
1511                 ret = __write_inode(trans, target, target_snapshot);
1512                 if (ret)
1513                         goto err;
1514         }
1515
1516         if (!inode_points_to_dirent(target, d)) {
1517                 struct bkey_s_c_dirent bp_dirent = dirent_get_by_pos(trans, &bp_iter,
1518                                       SPOS(target->bi_dir, target->bi_dir_offset, target_snapshot));
1519                 ret = bkey_err(bp_dirent);
1520                 if (ret && !bch2_err_matches(ret, ENOENT))
1521                         goto err;
1522
1523                 bool backpointer_exists = !ret;
1524                 ret = 0;
1525
1526                 bch2_bkey_val_to_text(&buf, c, d.s_c);
1527                 prt_newline(&buf);
1528                 if (backpointer_exists)
1529                         bch2_bkey_val_to_text(&buf, c, bp_dirent.s_c);
1530
1531                 if (fsck_err_on(S_ISDIR(target->bi_mode) && backpointer_exists,
1532                                 c, inode_dir_multiple_links,
1533                                 "directory %llu:%u with multiple links\n%s",
1534                                 target->bi_inum, target_snapshot, buf.buf)) {
1535                         ret = __remove_dirent(trans, d.k->p);
1536                         goto out;
1537                 }
1538
1539                 /*
1540                  * hardlinked file with nlink 0:
1541                  * We're just adjusting nlink here so check_nlinks() will pick
1542                  * it up, it ignores inodes with nlink 0
1543                  */
1544                 if (fsck_err_on(backpointer_exists && !target->bi_nlink,
1545                                 c, inode_multiple_links_but_nlink_0,
1546                                 "inode %llu:%u type %s has multiple links but i_nlink 0\n%s",
1547                                 target->bi_inum, target_snapshot, bch2_d_types[d.v->d_type], buf.buf)) {
1548                         target->bi_nlink++;
1549                         target->bi_flags &= ~BCH_INODE_unlinked;
1550
1551                         ret = __write_inode(trans, target, target_snapshot);
1552                         if (ret)
1553                                 goto err;
1554                 }
1555
1556                 if (fsck_err_on(!backpointer_exists,
1557                                 c, inode_wrong_backpointer,
1558                                 "inode %llu:%u has wrong backpointer:\n"
1559                                 "got       %llu:%llu\n"
1560                                 "should be %llu:%llu",
1561                                 target->bi_inum, target_snapshot,
1562                                 target->bi_dir,
1563                                 target->bi_dir_offset,
1564                                 d.k->p.inode,
1565                                 d.k->p.offset)) {
1566                         target->bi_dir          = d.k->p.inode;
1567                         target->bi_dir_offset   = d.k->p.offset;
1568
1569                         ret = __write_inode(trans, target, target_snapshot);
1570                         if (ret)
1571                                 goto err;
1572                 }
1573         }
1574
1575         if (fsck_err_on(d.v->d_type != inode_d_type(target),
1576                         c, dirent_d_type_wrong,
1577                         "incorrect d_type: got %s, should be %s:\n%s",
1578                         bch2_d_type_str(d.v->d_type),
1579                         bch2_d_type_str(inode_d_type(target)),
1580                         (printbuf_reset(&buf),
1581                          bch2_bkey_val_to_text(&buf, c, d.s_c), buf.buf))) {
1582                 n = bch2_trans_kmalloc(trans, bkey_bytes(d.k));
1583                 ret = PTR_ERR_OR_ZERO(n);
1584                 if (ret)
1585                         goto err;
1586
1587                 bkey_reassemble(&n->k_i, d.s_c);
1588                 n->v.d_type = inode_d_type(target);
1589
1590                 ret = bch2_trans_update(trans, iter, &n->k_i, 0);
1591                 if (ret)
1592                         goto err;
1593
1594                 d = dirent_i_to_s_c(n);
1595         }
1596
1597         if (d.v->d_type == DT_SUBVOL &&
1598             target->bi_parent_subvol != le32_to_cpu(d.v->d_parent_subvol) &&
1599             (c->sb.version < bcachefs_metadata_version_subvol_dirent ||
1600              fsck_err(c, dirent_d_parent_subvol_wrong,
1601                       "dirent has wrong d_parent_subvol field: got %u, should be %u",
1602                       le32_to_cpu(d.v->d_parent_subvol),
1603                       target->bi_parent_subvol))) {
1604                 n = bch2_trans_kmalloc(trans, bkey_bytes(d.k));
1605                 ret = PTR_ERR_OR_ZERO(n);
1606                 if (ret)
1607                         goto err;
1608
1609                 bkey_reassemble(&n->k_i, d.s_c);
1610                 n->v.d_parent_subvol = cpu_to_le32(target->bi_parent_subvol);
1611
1612                 ret = bch2_trans_update(trans, iter, &n->k_i, 0);
1613                 if (ret)
1614                         goto err;
1615
1616                 d = dirent_i_to_s_c(n);
1617         }
1618 out:
1619 err:
1620 fsck_err:
1621         bch2_trans_iter_exit(trans, &bp_iter);
1622         printbuf_exit(&buf);
1623         bch_err_fn(c, ret);
1624         return ret;
1625 }
1626
1627 static int check_dirent(struct btree_trans *trans, struct btree_iter *iter,
1628                         struct bkey_s_c k,
1629                         struct bch_hash_info *hash_info,
1630                         struct inode_walker *dir,
1631                         struct inode_walker *target,
1632                         struct snapshots_seen *s)
1633 {
1634         struct bch_fs *c = trans->c;
1635         struct bkey_s_c_dirent d;
1636         struct inode_walker_entry *i;
1637         struct printbuf buf = PRINTBUF;
1638         struct bpos equiv;
1639         int ret = 0;
1640
1641         ret = check_key_has_snapshot(trans, iter, k);
1642         if (ret) {
1643                 ret = ret < 0 ? ret : 0;
1644                 goto out;
1645         }
1646
1647         equiv = k.k->p;
1648         equiv.snapshot = bch2_snapshot_equiv(c, k.k->p.snapshot);
1649
1650         ret = snapshots_seen_update(c, s, iter->btree_id, k.k->p);
1651         if (ret)
1652                 goto err;
1653
1654         if (k.k->type == KEY_TYPE_whiteout)
1655                 goto out;
1656
1657         if (dir->last_pos.inode != k.k->p.inode) {
1658                 ret = check_subdir_count(trans, dir);
1659                 if (ret)
1660                         goto err;
1661         }
1662
1663         BUG_ON(!btree_iter_path(trans, iter)->should_be_locked);
1664
1665         i = walk_inode(trans, dir, equiv, k.k->type == KEY_TYPE_whiteout);
1666         ret = PTR_ERR_OR_ZERO(i);
1667         if (ret < 0)
1668                 goto err;
1669
1670         if (dir->first_this_inode && dir->inodes.nr)
1671                 *hash_info = bch2_hash_info_init(c, &dir->inodes.data[0].inode);
1672         dir->first_this_inode = false;
1673
1674         if (fsck_err_on(!i, c, dirent_in_missing_dir_inode,
1675                         "dirent in nonexisting directory:\n%s",
1676                         (printbuf_reset(&buf),
1677                          bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1678                 ret = bch2_btree_delete_at(trans, iter,
1679                                 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
1680                 goto out;
1681         }
1682
1683         if (!i)
1684                 goto out;
1685
1686         if (fsck_err_on(!S_ISDIR(i->inode.bi_mode),
1687                         c, dirent_in_non_dir_inode,
1688                         "dirent in non directory inode type %s:\n%s",
1689                         bch2_d_type_str(inode_d_type(&i->inode)),
1690                         (printbuf_reset(&buf),
1691                          bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1692                 ret = bch2_btree_delete_at(trans, iter, 0);
1693                 goto out;
1694         }
1695
1696         ret = hash_check_key(trans, bch2_dirent_hash_desc, hash_info, iter, k);
1697         if (ret < 0)
1698                 goto err;
1699         if (ret) {
1700                 /* dirent has been deleted */
1701                 ret = 0;
1702                 goto out;
1703         }
1704
1705         if (k.k->type != KEY_TYPE_dirent)
1706                 goto out;
1707
1708         d = bkey_s_c_to_dirent(k);
1709
1710         if (d.v->d_type == DT_SUBVOL) {
1711                 struct bch_inode_unpacked subvol_root;
1712                 u32 target_subvol = le32_to_cpu(d.v->d_child_subvol);
1713                 u32 target_snapshot;
1714                 u64 target_inum;
1715
1716                 ret = subvol_lookup(trans, target_subvol,
1717                                       &target_snapshot, &target_inum);
1718                 if (ret && !bch2_err_matches(ret, ENOENT))
1719                         goto err;
1720
1721                 if (fsck_err_on(ret, c, dirent_to_missing_subvol,
1722                                 "dirent points to missing subvolume %u",
1723                                 le32_to_cpu(d.v->d_child_subvol))) {
1724                         ret = __remove_dirent(trans, d.k->p);
1725                         goto err;
1726                 }
1727
1728                 ret = lookup_inode(trans, target_inum,
1729                                    &subvol_root, &target_snapshot);
1730                 if (ret && !bch2_err_matches(ret, ENOENT))
1731                         goto err;
1732
1733                 if (fsck_err_on(ret, c, subvol_to_missing_root,
1734                                 "subvolume %u points to missing subvolume root %llu",
1735                                 target_subvol,
1736                                 target_inum)) {
1737                         bch_err(c, "repair not implemented yet");
1738                         ret = -EINVAL;
1739                         goto err;
1740                 }
1741
1742                 if (fsck_err_on(subvol_root.bi_subvol != target_subvol,
1743                                 c, subvol_root_wrong_bi_subvol,
1744                                 "subvol root %llu has wrong bi_subvol field: got %u, should be %u",
1745                                 target_inum,
1746                                 subvol_root.bi_subvol, target_subvol)) {
1747                         subvol_root.bi_subvol = target_subvol;
1748                         ret = __write_inode(trans, &subvol_root, target_snapshot);
1749                         if (ret)
1750                                 goto err;
1751                 }
1752
1753                 ret = check_dirent_target(trans, iter, d, &subvol_root,
1754                                           target_snapshot);
1755                 if (ret)
1756                         goto err;
1757         } else {
1758                 ret = __get_visible_inodes(trans, target, s, le64_to_cpu(d.v->d_inum));
1759                 if (ret)
1760                         goto err;
1761
1762                 if (fsck_err_on(!target->inodes.nr,
1763                                 c, dirent_to_missing_inode,
1764                                 "dirent points to missing inode: (equiv %u)\n%s",
1765                                 equiv.snapshot,
1766                                 (printbuf_reset(&buf),
1767                                  bch2_bkey_val_to_text(&buf, c, k),
1768                                  buf.buf))) {
1769                         ret = __remove_dirent(trans, d.k->p);
1770                         if (ret)
1771                                 goto err;
1772                 }
1773
1774                 darray_for_each(target->inodes, i) {
1775                         ret = check_dirent_target(trans, iter, d,
1776                                                   &i->inode, i->snapshot);
1777                         if (ret)
1778                                 goto err;
1779                 }
1780         }
1781
1782         if (d.v->d_type == DT_DIR)
1783                 for_each_visible_inode(c, s, dir, equiv.snapshot, i)
1784                         i->count++;
1785
1786 out:
1787 err:
1788 fsck_err:
1789         printbuf_exit(&buf);
1790         bch_err_fn(c, ret);
1791         return ret;
1792 }
1793
1794 /*
1795  * Walk dirents: verify that they all have a corresponding S_ISDIR inode,
1796  * validate d_type
1797  */
1798 int bch2_check_dirents(struct bch_fs *c)
1799 {
1800         struct inode_walker dir = inode_walker_init();
1801         struct inode_walker target = inode_walker_init();
1802         struct snapshots_seen s;
1803         struct bch_hash_info hash_info;
1804
1805         snapshots_seen_init(&s);
1806
1807         int ret = bch2_trans_run(c,
1808                 for_each_btree_key_commit(trans, iter, BTREE_ID_dirents,
1809                                 POS(BCACHEFS_ROOT_INO, 0),
1810                                 BTREE_ITER_PREFETCH|BTREE_ITER_ALL_SNAPSHOTS,
1811                                 k,
1812                                 NULL, NULL,
1813                                 BCH_TRANS_COMMIT_no_enospc,
1814                         check_dirent(trans, &iter, k, &hash_info, &dir, &target, &s)));
1815
1816         snapshots_seen_exit(&s);
1817         inode_walker_exit(&dir);
1818         inode_walker_exit(&target);
1819         bch_err_fn(c, ret);
1820         return ret;
1821 }
1822
1823 static int check_xattr(struct btree_trans *trans, struct btree_iter *iter,
1824                        struct bkey_s_c k,
1825                        struct bch_hash_info *hash_info,
1826                        struct inode_walker *inode)
1827 {
1828         struct bch_fs *c = trans->c;
1829         struct inode_walker_entry *i;
1830         int ret;
1831
1832         ret = check_key_has_snapshot(trans, iter, k);
1833         if (ret)
1834                 return ret;
1835
1836         i = walk_inode(trans, inode, k.k->p, k.k->type == KEY_TYPE_whiteout);
1837         ret = PTR_ERR_OR_ZERO(i);
1838         if (ret)
1839                 return ret;
1840
1841         if (inode->first_this_inode && inode->inodes.nr)
1842                 *hash_info = bch2_hash_info_init(c, &inode->inodes.data[0].inode);
1843         inode->first_this_inode = false;
1844
1845         if (fsck_err_on(!i, c, xattr_in_missing_inode,
1846                         "xattr for missing inode %llu",
1847                         k.k->p.inode))
1848                 return bch2_btree_delete_at(trans, iter, 0);
1849
1850         if (!i)
1851                 return 0;
1852
1853         ret = hash_check_key(trans, bch2_xattr_hash_desc, hash_info, iter, k);
1854 fsck_err:
1855         bch_err_fn(c, ret);
1856         return ret;
1857 }
1858
1859 /*
1860  * Walk xattrs: verify that they all have a corresponding inode
1861  */
1862 int bch2_check_xattrs(struct bch_fs *c)
1863 {
1864         struct inode_walker inode = inode_walker_init();
1865         struct bch_hash_info hash_info;
1866         int ret = 0;
1867
1868         ret = bch2_trans_run(c,
1869                 for_each_btree_key_commit(trans, iter, BTREE_ID_xattrs,
1870                         POS(BCACHEFS_ROOT_INO, 0),
1871                         BTREE_ITER_PREFETCH|BTREE_ITER_ALL_SNAPSHOTS,
1872                         k,
1873                         NULL, NULL,
1874                         BCH_TRANS_COMMIT_no_enospc,
1875                 check_xattr(trans, &iter, k, &hash_info, &inode)));
1876         bch_err_fn(c, ret);
1877         return ret;
1878 }
1879
1880 static int check_root_trans(struct btree_trans *trans)
1881 {
1882         struct bch_fs *c = trans->c;
1883         struct bch_inode_unpacked root_inode;
1884         u32 snapshot;
1885         u64 inum;
1886         int ret;
1887
1888         ret = subvol_lookup(trans, BCACHEFS_ROOT_SUBVOL, &snapshot, &inum);
1889         if (ret && !bch2_err_matches(ret, ENOENT))
1890                 return ret;
1891
1892         if (mustfix_fsck_err_on(ret, c, root_subvol_missing,
1893                                 "root subvol missing")) {
1894                 struct bkey_i_subvolume root_subvol;
1895
1896                 snapshot        = U32_MAX;
1897                 inum            = BCACHEFS_ROOT_INO;
1898
1899                 bkey_subvolume_init(&root_subvol.k_i);
1900                 root_subvol.k.p.offset = BCACHEFS_ROOT_SUBVOL;
1901                 root_subvol.v.flags     = 0;
1902                 root_subvol.v.snapshot  = cpu_to_le32(snapshot);
1903                 root_subvol.v.inode     = cpu_to_le64(inum);
1904                 ret = bch2_btree_insert_trans(trans, BTREE_ID_subvolumes, &root_subvol.k_i, 0);
1905                 bch_err_msg(c, ret, "writing root subvol");
1906                 if (ret)
1907                         goto err;
1908         }
1909
1910         ret = lookup_inode(trans, BCACHEFS_ROOT_INO, &root_inode, &snapshot);
1911         if (ret && !bch2_err_matches(ret, ENOENT))
1912                 return ret;
1913
1914         if (mustfix_fsck_err_on(ret, c, root_dir_missing,
1915                                 "root directory missing") ||
1916             mustfix_fsck_err_on(!S_ISDIR(root_inode.bi_mode),
1917                                 c, root_inode_not_dir,
1918                                 "root inode not a directory")) {
1919                 bch2_inode_init(c, &root_inode, 0, 0, S_IFDIR|0755,
1920                                 0, NULL);
1921                 root_inode.bi_inum = inum;
1922
1923                 ret = __write_inode(trans, &root_inode, snapshot);
1924                 bch_err_msg(c, ret, "writing root inode");
1925         }
1926 err:
1927 fsck_err:
1928         return ret;
1929 }
1930
1931 /* Get root directory, create if it doesn't exist: */
1932 int bch2_check_root(struct bch_fs *c)
1933 {
1934         int ret = bch2_trans_do(c, NULL, NULL, BCH_TRANS_COMMIT_no_enospc,
1935                 check_root_trans(trans));
1936         bch_err_fn(c, ret);
1937         return ret;
1938 }
1939
1940 struct pathbuf_entry {
1941         u64     inum;
1942         u32     snapshot;
1943 };
1944
1945 typedef DARRAY(struct pathbuf_entry) pathbuf;
1946
1947 static bool path_is_dup(pathbuf *p, u64 inum, u32 snapshot)
1948 {
1949         darray_for_each(*p, i)
1950                 if (i->inum     == inum &&
1951                     i->snapshot == snapshot)
1952                         return true;
1953         return false;
1954 }
1955
1956 static int path_down(struct bch_fs *c, pathbuf *p,
1957                      u64 inum, u32 snapshot)
1958 {
1959         int ret = darray_push(p, ((struct pathbuf_entry) {
1960                 .inum           = inum,
1961                 .snapshot       = snapshot,
1962         }));
1963
1964         if (ret)
1965                 bch_err(c, "fsck: error allocating memory for pathbuf, size %zu",
1966                         p->size);
1967         return ret;
1968 }
1969
1970 /*
1971  * Check that a given inode is reachable from the root:
1972  *
1973  * XXX: we should also be verifying that inodes are in the right subvolumes
1974  */
1975 static int check_path(struct btree_trans *trans,
1976                       pathbuf *p,
1977                       struct bch_inode_unpacked *inode,
1978                       u32 snapshot)
1979 {
1980         struct bch_fs *c = trans->c;
1981         int ret = 0;
1982
1983         snapshot = bch2_snapshot_equiv(c, snapshot);
1984         p->nr = 0;
1985
1986         while (!(inode->bi_inum == BCACHEFS_ROOT_INO &&
1987                  inode->bi_subvol == BCACHEFS_ROOT_SUBVOL)) {
1988                 struct btree_iter dirent_iter;
1989                 struct bkey_s_c_dirent d;
1990                 u32 parent_snapshot = snapshot;
1991
1992                 if (inode->bi_subvol) {
1993                         u64 inum;
1994
1995                         ret = subvol_lookup(trans, inode->bi_parent_subvol,
1996                                             &parent_snapshot, &inum);
1997                         if (ret)
1998                                 break;
1999                 }
2000
2001                 d = dirent_get_by_pos(trans, &dirent_iter,
2002                                       SPOS(inode->bi_dir, inode->bi_dir_offset,
2003                                            parent_snapshot));
2004                 ret = bkey_err(d.s_c);
2005                 if (ret && !bch2_err_matches(ret, ENOENT))
2006                         break;
2007
2008                 if (!ret && !dirent_points_to_inode(d, inode)) {
2009                         bch2_trans_iter_exit(trans, &dirent_iter);
2010                         ret = -BCH_ERR_ENOENT_dirent_doesnt_match_inode;
2011                 }
2012
2013                 if (bch2_err_matches(ret, ENOENT)) {
2014                         if (fsck_err(c,  inode_unreachable,
2015                                      "unreachable inode %llu:%u, type %s nlink %u backptr %llu:%llu",
2016                                      inode->bi_inum, snapshot,
2017                                      bch2_d_type_str(inode_d_type(inode)),
2018                                      inode->bi_nlink,
2019                                      inode->bi_dir,
2020                                      inode->bi_dir_offset))
2021                                 ret = reattach_inode(trans, inode, snapshot);
2022                         break;
2023                 }
2024
2025                 bch2_trans_iter_exit(trans, &dirent_iter);
2026
2027                 if (!S_ISDIR(inode->bi_mode))
2028                         break;
2029
2030                 ret = path_down(c, p, inode->bi_inum, snapshot);
2031                 if (ret) {
2032                         bch_err(c, "memory allocation failure");
2033                         return ret;
2034                 }
2035
2036                 snapshot = parent_snapshot;
2037
2038                 ret = lookup_inode(trans, inode->bi_dir, inode, &snapshot);
2039                 if (ret) {
2040                         /* Should have been caught in dirents pass */
2041                         if (!bch2_err_matches(ret, BCH_ERR_transaction_restart))
2042                                 bch_err(c, "error looking up parent directory: %i", ret);
2043                         break;
2044                 }
2045
2046                 if (path_is_dup(p, inode->bi_inum, snapshot)) {
2047                         /* XXX print path */
2048                         bch_err(c, "directory structure loop");
2049
2050                         darray_for_each(*p, i)
2051                                 pr_err("%llu:%u", i->inum, i->snapshot);
2052                         pr_err("%llu:%u", inode->bi_inum, snapshot);
2053
2054                         if (!fsck_err(c, dir_loop, "directory structure loop"))
2055                                 return 0;
2056
2057                         ret = remove_backpointer(trans, inode);
2058                         if (ret && !bch2_err_matches(ret, BCH_ERR_transaction_restart))
2059                                 bch_err_msg(c, ret, "removing dirent");
2060                         if (ret)
2061                                 break;
2062
2063                         ret = reattach_inode(trans, inode, snapshot);
2064                         if (ret && !bch2_err_matches(ret, BCH_ERR_transaction_restart))
2065                                 bch_err_msg(c, ret, "reattaching inode %llu", inode->bi_inum);
2066                         break;
2067                 }
2068         }
2069 fsck_err:
2070         bch_err_fn(c, ret);
2071         return ret;
2072 }
2073
2074 /*
2075  * Check for unreachable inodes, as well as loops in the directory structure:
2076  * After bch2_check_dirents(), if an inode backpointer doesn't exist that means it's
2077  * unreachable:
2078  */
2079 int bch2_check_directory_structure(struct bch_fs *c)
2080 {
2081         struct bch_inode_unpacked u;
2082         pathbuf path = { 0, };
2083         int ret;
2084
2085         ret = bch2_trans_run(c,
2086                 for_each_btree_key_commit(trans, iter, BTREE_ID_inodes, POS_MIN,
2087                                           BTREE_ITER_INTENT|
2088                                           BTREE_ITER_PREFETCH|
2089                                           BTREE_ITER_ALL_SNAPSHOTS, k,
2090                                           NULL, NULL, BCH_TRANS_COMMIT_no_enospc, ({
2091                         if (!bkey_is_inode(k.k))
2092                                 continue;
2093
2094                         BUG_ON(bch2_inode_unpack(k, &u));
2095
2096                         if (u.bi_flags & BCH_INODE_unlinked)
2097                                 continue;
2098
2099                         check_path(trans, &path, &u, iter.pos.snapshot);
2100                 })));
2101         darray_exit(&path);
2102
2103         bch_err_fn(c, ret);
2104         return ret;
2105 }
2106
2107 struct nlink_table {
2108         size_t          nr;
2109         size_t          size;
2110
2111         struct nlink {
2112                 u64     inum;
2113                 u32     snapshot;
2114                 u32     count;
2115         }               *d;
2116 };
2117
2118 static int add_nlink(struct bch_fs *c, struct nlink_table *t,
2119                      u64 inum, u32 snapshot)
2120 {
2121         if (t->nr == t->size) {
2122                 size_t new_size = max_t(size_t, 128UL, t->size * 2);
2123                 void *d = kvmalloc_array(new_size, sizeof(t->d[0]), GFP_KERNEL);
2124
2125                 if (!d) {
2126                         bch_err(c, "fsck: error allocating memory for nlink_table, size %zu",
2127                                 new_size);
2128                         return -BCH_ERR_ENOMEM_fsck_add_nlink;
2129                 }
2130
2131                 if (t->d)
2132                         memcpy(d, t->d, t->size * sizeof(t->d[0]));
2133                 kvfree(t->d);
2134
2135                 t->d = d;
2136                 t->size = new_size;
2137         }
2138
2139
2140         t->d[t->nr++] = (struct nlink) {
2141                 .inum           = inum,
2142                 .snapshot       = snapshot,
2143         };
2144
2145         return 0;
2146 }
2147
2148 static int nlink_cmp(const void *_l, const void *_r)
2149 {
2150         const struct nlink *l = _l;
2151         const struct nlink *r = _r;
2152
2153         return cmp_int(l->inum, r->inum);
2154 }
2155
2156 static void inc_link(struct bch_fs *c, struct snapshots_seen *s,
2157                      struct nlink_table *links,
2158                      u64 range_start, u64 range_end, u64 inum, u32 snapshot)
2159 {
2160         struct nlink *link, key = {
2161                 .inum = inum, .snapshot = U32_MAX,
2162         };
2163
2164         if (inum < range_start || inum >= range_end)
2165                 return;
2166
2167         link = __inline_bsearch(&key, links->d, links->nr,
2168                                 sizeof(links->d[0]), nlink_cmp);
2169         if (!link)
2170                 return;
2171
2172         while (link > links->d && link[0].inum == link[-1].inum)
2173                 --link;
2174
2175         for (; link < links->d + links->nr && link->inum == inum; link++)
2176                 if (ref_visible(c, s, snapshot, link->snapshot)) {
2177                         link->count++;
2178                         if (link->snapshot >= snapshot)
2179                                 break;
2180                 }
2181 }
2182
2183 noinline_for_stack
2184 static int check_nlinks_find_hardlinks(struct bch_fs *c,
2185                                        struct nlink_table *t,
2186                                        u64 start, u64 *end)
2187 {
2188         int ret = bch2_trans_run(c,
2189                 for_each_btree_key(trans, iter, BTREE_ID_inodes,
2190                                    POS(0, start),
2191                                    BTREE_ITER_INTENT|
2192                                    BTREE_ITER_PREFETCH|
2193                                    BTREE_ITER_ALL_SNAPSHOTS, k, ({
2194                         if (!bkey_is_inode(k.k))
2195                                 continue;
2196
2197                         /* Should never fail, checked by bch2_inode_invalid: */
2198                         struct bch_inode_unpacked u;
2199                         BUG_ON(bch2_inode_unpack(k, &u));
2200
2201                         /*
2202                          * Backpointer and directory structure checks are sufficient for
2203                          * directories, since they can't have hardlinks:
2204                          */
2205                         if (S_ISDIR(u.bi_mode))
2206                                 continue;
2207
2208                         if (!u.bi_nlink)
2209                                 continue;
2210
2211                         ret = add_nlink(c, t, k.k->p.offset, k.k->p.snapshot);
2212                         if (ret) {
2213                                 *end = k.k->p.offset;
2214                                 ret = 0;
2215                                 break;
2216                         }
2217                         0;
2218                 })));
2219
2220         bch_err_fn(c, ret);
2221         return ret;
2222 }
2223
2224 noinline_for_stack
2225 static int check_nlinks_walk_dirents(struct bch_fs *c, struct nlink_table *links,
2226                                      u64 range_start, u64 range_end)
2227 {
2228         struct snapshots_seen s;
2229
2230         snapshots_seen_init(&s);
2231
2232         int ret = bch2_trans_run(c,
2233                 for_each_btree_key(trans, iter, BTREE_ID_dirents, POS_MIN,
2234                                    BTREE_ITER_INTENT|
2235                                    BTREE_ITER_PREFETCH|
2236                                    BTREE_ITER_ALL_SNAPSHOTS, k, ({
2237                         ret = snapshots_seen_update(c, &s, iter.btree_id, k.k->p);
2238                         if (ret)
2239                                 break;
2240
2241                         if (k.k->type == KEY_TYPE_dirent) {
2242                                 struct bkey_s_c_dirent d = bkey_s_c_to_dirent(k);
2243
2244                                 if (d.v->d_type != DT_DIR &&
2245                                     d.v->d_type != DT_SUBVOL)
2246                                         inc_link(c, &s, links, range_start, range_end,
2247                                                  le64_to_cpu(d.v->d_inum),
2248                                                  bch2_snapshot_equiv(c, d.k->p.snapshot));
2249                         }
2250                         0;
2251                 })));
2252
2253         snapshots_seen_exit(&s);
2254
2255         bch_err_fn(c, ret);
2256         return ret;
2257 }
2258
2259 static int check_nlinks_update_inode(struct btree_trans *trans, struct btree_iter *iter,
2260                                      struct bkey_s_c k,
2261                                      struct nlink_table *links,
2262                                      size_t *idx, u64 range_end)
2263 {
2264         struct bch_fs *c = trans->c;
2265         struct bch_inode_unpacked u;
2266         struct nlink *link = &links->d[*idx];
2267         int ret = 0;
2268
2269         if (k.k->p.offset >= range_end)
2270                 return 1;
2271
2272         if (!bkey_is_inode(k.k))
2273                 return 0;
2274
2275         BUG_ON(bch2_inode_unpack(k, &u));
2276
2277         if (S_ISDIR(u.bi_mode))
2278                 return 0;
2279
2280         if (!u.bi_nlink)
2281                 return 0;
2282
2283         while ((cmp_int(link->inum, k.k->p.offset) ?:
2284                 cmp_int(link->snapshot, k.k->p.snapshot)) < 0) {
2285                 BUG_ON(*idx == links->nr);
2286                 link = &links->d[++*idx];
2287         }
2288
2289         if (fsck_err_on(bch2_inode_nlink_get(&u) != link->count,
2290                         c, inode_wrong_nlink,
2291                         "inode %llu type %s has wrong i_nlink (%u, should be %u)",
2292                         u.bi_inum, bch2_d_types[mode_to_type(u.bi_mode)],
2293                         bch2_inode_nlink_get(&u), link->count)) {
2294                 bch2_inode_nlink_set(&u, link->count);
2295                 ret = __write_inode(trans, &u, k.k->p.snapshot);
2296         }
2297 fsck_err:
2298         return ret;
2299 }
2300
2301 noinline_for_stack
2302 static int check_nlinks_update_hardlinks(struct bch_fs *c,
2303                                struct nlink_table *links,
2304                                u64 range_start, u64 range_end)
2305 {
2306         size_t idx = 0;
2307
2308         int ret = bch2_trans_run(c,
2309                 for_each_btree_key_commit(trans, iter, BTREE_ID_inodes,
2310                                 POS(0, range_start),
2311                                 BTREE_ITER_INTENT|BTREE_ITER_PREFETCH|BTREE_ITER_ALL_SNAPSHOTS, k,
2312                                 NULL, NULL, BCH_TRANS_COMMIT_no_enospc,
2313                         check_nlinks_update_inode(trans, &iter, k, links, &idx, range_end)));
2314         if (ret < 0) {
2315                 bch_err(c, "error in fsck walking inodes: %s", bch2_err_str(ret));
2316                 return ret;
2317         }
2318
2319         return 0;
2320 }
2321
2322 int bch2_check_nlinks(struct bch_fs *c)
2323 {
2324         struct nlink_table links = { 0 };
2325         u64 this_iter_range_start, next_iter_range_start = 0;
2326         int ret = 0;
2327
2328         do {
2329                 this_iter_range_start = next_iter_range_start;
2330                 next_iter_range_start = U64_MAX;
2331
2332                 ret = check_nlinks_find_hardlinks(c, &links,
2333                                                   this_iter_range_start,
2334                                                   &next_iter_range_start);
2335
2336                 ret = check_nlinks_walk_dirents(c, &links,
2337                                           this_iter_range_start,
2338                                           next_iter_range_start);
2339                 if (ret)
2340                         break;
2341
2342                 ret = check_nlinks_update_hardlinks(c, &links,
2343                                          this_iter_range_start,
2344                                          next_iter_range_start);
2345                 if (ret)
2346                         break;
2347
2348                 links.nr = 0;
2349         } while (next_iter_range_start != U64_MAX);
2350
2351         kvfree(links.d);
2352         bch_err_fn(c, ret);
2353         return ret;
2354 }
2355
2356 static int fix_reflink_p_key(struct btree_trans *trans, struct btree_iter *iter,
2357                              struct bkey_s_c k)
2358 {
2359         struct bkey_s_c_reflink_p p;
2360         struct bkey_i_reflink_p *u;
2361
2362         if (k.k->type != KEY_TYPE_reflink_p)
2363                 return 0;
2364
2365         p = bkey_s_c_to_reflink_p(k);
2366
2367         if (!p.v->front_pad && !p.v->back_pad)
2368                 return 0;
2369
2370         u = bch2_trans_kmalloc(trans, sizeof(*u));
2371         int ret = PTR_ERR_OR_ZERO(u);
2372         if (ret)
2373                 return ret;
2374
2375         bkey_reassemble(&u->k_i, k);
2376         u->v.front_pad  = 0;
2377         u->v.back_pad   = 0;
2378
2379         return bch2_trans_update(trans, iter, &u->k_i, BTREE_TRIGGER_NORUN);
2380 }
2381
2382 int bch2_fix_reflink_p(struct bch_fs *c)
2383 {
2384         if (c->sb.version >= bcachefs_metadata_version_reflink_p_fix)
2385                 return 0;
2386
2387         int ret = bch2_trans_run(c,
2388                 for_each_btree_key_commit(trans, iter,
2389                                 BTREE_ID_extents, POS_MIN,
2390                                 BTREE_ITER_INTENT|BTREE_ITER_PREFETCH|
2391                                 BTREE_ITER_ALL_SNAPSHOTS, k,
2392                                 NULL, NULL, BCH_TRANS_COMMIT_no_enospc,
2393                         fix_reflink_p_key(trans, &iter, k)));
2394         bch_err_fn(c, ret);
2395         return ret;
2396 }