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

   1 // SPDX-License-Identifier: GPL-2.0
   2
   3 #include "bcachefs.h"
   4 #include "backpointers.h"
   5 #include "bkey_buf.h"
   6 #include "alloc_background.h"
   7 #include "btree_gc.h"
   8 #include "btree_journal_iter.h"
   9 #include "btree_update.h"
  10 #include "btree_update_interior.h"
  11 #include "btree_io.h"
  12 #include "buckets.h"
  13 #include "dirent.h"
  14 #include "ec.h"
  15 #include "errcode.h"
  16 #include "error.h"
  17 #include "fs-common.h"
  18 #include "fsck.h"
  19 #include "journal_io.h"
  20 #include "journal_reclaim.h"
  21 #include "journal_seq_blacklist.h"
  22 #include "lru.h"
  23 #include "logged_ops.h"
  24 #include "move.h"
  25 #include "quota.h"
  26 #include "rebalance.h"
  27 #include "recovery.h"
  28 #include "replicas.h"
  29 #include "sb-clean.h"
  30 #include "snapshot.h"
  31 #include "subvolume.h"
  32 #include "super-io.h"
  33
  34 #include <linux/sort.h>
  35 #include <linux/stat.h>
  36
  37 #define QSTR(n) { { { .len = strlen(n) } }, .name = n }
  38
  39 static bool btree_id_is_alloc(enum btree_id id)
  40 {
  41         switch (id) {
  42         case BTREE_ID_alloc:
  43         case BTREE_ID_backpointers:
  44         case BTREE_ID_need_discard:
  45         case BTREE_ID_freespace:
  46         case BTREE_ID_bucket_gens:
  47                 return true;
  48         default:
  49                 return false;
  50         }
  51 }
  52
  53 /* for -o reconstruct_alloc: */
  54 static void drop_alloc_keys(struct journal_keys *keys)
  55 {
  56         size_t src, dst;
  57
  58         for (src = 0, dst = 0; src < keys->nr; src++)
  59                 if (!btree_id_is_alloc(keys->d[src].btree_id))
  60                         keys->d[dst++] = keys->d[src];
  61
  62         keys->nr = dst;
  63 }
  64
  65 /*
  66  * Btree node pointers have a field to stack a pointer to the in memory btree
  67  * node; we need to zero out this field when reading in btree nodes, or when
  68  * reading in keys from the journal:
  69  */
  70 static void zero_out_btree_mem_ptr(struct journal_keys *keys)
  71 {
  72         struct journal_key *i;
  73
  74         for (i = keys->d; i < keys->d + keys->nr; i++)
  75                 if (i->k->k.type == KEY_TYPE_btree_ptr_v2)
  76                         bkey_i_to_btree_ptr_v2(i->k)->v.mem_ptr = 0;
  77 }
  78
  79 /* journal replay: */
  80
  81 static void replay_now_at(struct journal *j, u64 seq)
  82 {
  83         BUG_ON(seq < j->replay_journal_seq);
  84
  85         seq = min(seq, j->replay_journal_seq_end);
  86
  87         while (j->replay_journal_seq < seq)
  88                 bch2_journal_pin_put(j, j->replay_journal_seq++);
  89 }
  90
  91 static int bch2_journal_replay_key(struct btree_trans *trans,
  92                                    struct journal_key *k)
  93 {
  94         struct btree_iter iter;
  95         unsigned iter_flags =
  96                 BTREE_ITER_INTENT|
  97                 BTREE_ITER_NOT_EXTENTS;
  98         unsigned update_flags = BTREE_TRIGGER_NORUN;
  99         int ret;
 100
 101         /*
 102          * BTREE_UPDATE_KEY_CACHE_RECLAIM disables key cache lookup/update to
 103          * keep the key cache coherent with the underlying btree. Nothing
 104          * besides the allocator is doing updates yet so we don't need key cache
 105          * coherency for non-alloc btrees, and key cache fills for snapshots
 106          * btrees use BTREE_ITER_FILTER_SNAPSHOTS, which isn't available until
 107          * the snapshots recovery pass runs.
 108          */
 109         if (!k->level && k->btree_id == BTREE_ID_alloc)
 110                 iter_flags |= BTREE_ITER_CACHED;
 111         else
 112                 update_flags |= BTREE_UPDATE_KEY_CACHE_RECLAIM;
 113
 114         bch2_trans_node_iter_init(trans, &iter, k->btree_id, k->k->k.p,
 115                                   BTREE_MAX_DEPTH, k->level,
 116                                   iter_flags);
 117         ret = bch2_btree_iter_traverse(&iter);
 118         if (ret)
 119                 goto out;
 120
 121         /* Must be checked with btree locked: */
 122         if (k->overwritten)
 123                 goto out;
 124
 125         ret = bch2_trans_update(trans, &iter, k->k, update_flags);
 126 out:
 127         bch2_trans_iter_exit(trans, &iter);
 128         return ret;
 129 }
 130
 131 static int journal_sort_seq_cmp(const void *_l, const void *_r)
 132 {
 133         const struct journal_key *l = *((const struct journal_key **)_l);
 134         const struct journal_key *r = *((const struct journal_key **)_r);
 135
 136         return cmp_int(l->journal_seq, r->journal_seq);
 137 }
 138
 139 static int bch2_journal_replay(struct bch_fs *c)
 140 {
 141         struct journal_keys *keys = &c->journal_keys;
 142         struct journal_key **keys_sorted, *k;
 143         struct journal *j = &c->journal;
 144         u64 start_seq   = c->journal_replay_seq_start;
 145         u64 end_seq     = c->journal_replay_seq_start;
 146         size_t i;
 147         int ret;
 148
 149         move_gap(keys->d, keys->nr, keys->size, keys->gap, keys->nr);
 150         keys->gap = keys->nr;
 151
 152         keys_sorted = kvmalloc_array(keys->nr, sizeof(*keys_sorted), GFP_KERNEL);
 153         if (!keys_sorted)
 154                 return -BCH_ERR_ENOMEM_journal_replay;
 155
 156         for (i = 0; i < keys->nr; i++)
 157                 keys_sorted[i] = &keys->d[i];
 158
 159         sort(keys_sorted, keys->nr,
 160              sizeof(keys_sorted[0]),
 161              journal_sort_seq_cmp, NULL);
 162
 163         if (keys->nr) {
 164                 ret = bch2_journal_log_msg(c, "Starting journal replay (%zu keys in entries %llu-%llu)",
 165                                            keys->nr, start_seq, end_seq);
 166                 if (ret)
 167                         goto err;
 168         }
 169
 170         for (i = 0; i < keys->nr; i++) {
 171                 k = keys_sorted[i];
 172
 173                 cond_resched();
 174
 175                 replay_now_at(j, k->journal_seq);
 176
 177                 ret = bch2_trans_do(c, NULL, NULL,
 178                                     BTREE_INSERT_LAZY_RW|
 179                                     BTREE_INSERT_NOFAIL|
 180                                     (!k->allocated
 181                                      ? BTREE_INSERT_JOURNAL_REPLAY|BCH_WATERMARK_reclaim
 182                                      : 0),
 183                              bch2_journal_replay_key(trans, k));
 184                 if (ret) {
 185                         bch_err(c, "journal replay: error while replaying key at btree %s level %u: %s",
 186                                 bch2_btree_id_str(k->btree_id), k->level, bch2_err_str(ret));
 187                         goto err;
 188                 }
 189         }
 190
 191         replay_now_at(j, j->replay_journal_seq_end);
 192         j->replay_journal_seq = 0;
 193
 194         bch2_journal_set_replay_done(j);
 195         bch2_journal_flush_all_pins(j);
 196         ret = bch2_journal_error(j);
 197
 198         if (keys->nr && !ret)
 199                 bch2_journal_log_msg(c, "journal replay finished");
 200 err:
 201         kvfree(keys_sorted);
 202
 203         if (ret)
 204                 bch_err_fn(c, ret);
 205         return ret;
 206 }
 207
 208 /* journal replay early: */
 209
 210 static int journal_replay_entry_early(struct bch_fs *c,
 211                                       struct jset_entry *entry)
 212 {
 213         int ret = 0;
 214
 215         switch (entry->type) {
 216         case BCH_JSET_ENTRY_btree_root: {
 217                 struct btree_root *r;
 218
 219                 while (entry->btree_id >= c->btree_roots_extra.nr + BTREE_ID_NR) {
 220                         ret = darray_push(&c->btree_roots_extra, (struct btree_root) { NULL });
 221                         if (ret)
 222                                 return ret;
 223                 }
 224
 225                 r = bch2_btree_id_root(c, entry->btree_id);
 226
 227                 if (entry->u64s) {
 228                         r->level = entry->level;
 229                         bkey_copy(&r->key, &entry->start[0]);
 230                         r->error = 0;
 231                 } else {
 232                         r->error = -EIO;
 233                 }
 234                 r->alive = true;
 235                 break;
 236         }
 237         case BCH_JSET_ENTRY_usage: {
 238                 struct jset_entry_usage *u =
 239                         container_of(entry, struct jset_entry_usage, entry);
 240
 241                 switch (entry->btree_id) {
 242                 case BCH_FS_USAGE_reserved:
 243                         if (entry->level < BCH_REPLICAS_MAX)
 244                                 c->usage_base->persistent_reserved[entry->level] =
 245                                         le64_to_cpu(u->v);
 246                         break;
 247                 case BCH_FS_USAGE_inodes:
 248                         c->usage_base->nr_inodes = le64_to_cpu(u->v);
 249                         break;
 250                 case BCH_FS_USAGE_key_version:
 251                         atomic64_set(&c->key_version,
 252                                      le64_to_cpu(u->v));
 253                         break;
 254                 }
 255
 256                 break;
 257         }
 258         case BCH_JSET_ENTRY_data_usage: {
 259                 struct jset_entry_data_usage *u =
 260                         container_of(entry, struct jset_entry_data_usage, entry);
 261
 262                 ret = bch2_replicas_set_usage(c, &u->r,
 263                                               le64_to_cpu(u->v));
 264                 break;
 265         }
 266         case BCH_JSET_ENTRY_dev_usage: {
 267                 struct jset_entry_dev_usage *u =
 268                         container_of(entry, struct jset_entry_dev_usage, entry);
 269                 struct bch_dev *ca = bch_dev_bkey_exists(c, le32_to_cpu(u->dev));
 270                 unsigned i, nr_types = jset_entry_dev_usage_nr_types(u);
 271
 272                 ca->usage_base->buckets_ec              = le64_to_cpu(u->buckets_ec);
 273
 274                 for (i = 0; i < min_t(unsigned, nr_types, BCH_DATA_NR); i++) {
 275                         ca->usage_base->d[i].buckets    = le64_to_cpu(u->d[i].buckets);
 276                         ca->usage_base->d[i].sectors    = le64_to_cpu(u->d[i].sectors);
 277                         ca->usage_base->d[i].fragmented = le64_to_cpu(u->d[i].fragmented);
 278                 }
 279
 280                 break;
 281         }
 282         case BCH_JSET_ENTRY_blacklist: {
 283                 struct jset_entry_blacklist *bl_entry =
 284                         container_of(entry, struct jset_entry_blacklist, entry);
 285
 286                 ret = bch2_journal_seq_blacklist_add(c,
 287                                 le64_to_cpu(bl_entry->seq),
 288                                 le64_to_cpu(bl_entry->seq) + 1);
 289                 break;
 290         }
 291         case BCH_JSET_ENTRY_blacklist_v2: {
 292                 struct jset_entry_blacklist_v2 *bl_entry =
 293                         container_of(entry, struct jset_entry_blacklist_v2, entry);
 294
 295                 ret = bch2_journal_seq_blacklist_add(c,
 296                                 le64_to_cpu(bl_entry->start),
 297                                 le64_to_cpu(bl_entry->end) + 1);
 298                 break;
 299         }
 300         case BCH_JSET_ENTRY_clock: {
 301                 struct jset_entry_clock *clock =
 302                         container_of(entry, struct jset_entry_clock, entry);
 303
 304                 atomic64_set(&c->io_clock[clock->rw].now, le64_to_cpu(clock->time));
 305         }
 306         }
 307
 308         return ret;
 309 }
 310
 311 static int journal_replay_early(struct bch_fs *c,
 312                                 struct bch_sb_field_clean *clean)
 313 {
 314         struct jset_entry *entry;
 315         int ret;
 316
 317         if (clean) {
 318                 for (entry = clean->start;
 319                      entry != vstruct_end(&clean->field);
 320                      entry = vstruct_next(entry)) {
 321                         ret = journal_replay_entry_early(c, entry);
 322                         if (ret)
 323                                 return ret;
 324                 }
 325         } else {
 326                 struct genradix_iter iter;
 327                 struct journal_replay *i, **_i;
 328
 329                 genradix_for_each(&c->journal_entries, iter, _i) {
 330                         i = *_i;
 331
 332                         if (!i || i->ignore)
 333                                 continue;
 334
 335                         vstruct_for_each(&i->j, entry) {
 336                                 ret = journal_replay_entry_early(c, entry);
 337                                 if (ret)
 338                                         return ret;
 339                         }
 340                 }
 341         }
 342
 343         bch2_fs_usage_initialize(c);
 344
 345         return 0;
 346 }
 347
 348 /* sb clean section: */
 349
 350 static int read_btree_roots(struct bch_fs *c)
 351 {
 352         unsigned i;
 353         int ret = 0;
 354
 355         for (i = 0; i < btree_id_nr_alive(c); i++) {
 356                 struct btree_root *r = bch2_btree_id_root(c, i);
 357
 358                 if (!r->alive)
 359                         continue;
 360
 361                 if (btree_id_is_alloc(i) &&
 362                     c->opts.reconstruct_alloc) {
 363                         c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
 364                         continue;
 365                 }
 366
 367                 if (r->error) {
 368                         __fsck_err(c, btree_id_is_alloc(i)
 369                                    ? FSCK_CAN_IGNORE : 0,
 370                                    "invalid btree root %s",
 371                                    bch2_btree_id_str(i));
 372                         if (i == BTREE_ID_alloc)
 373                                 c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
 374                 }
 375
 376                 ret = bch2_btree_root_read(c, i, &r->key, r->level);
 377                 if (ret) {
 378                         fsck_err(c,
 379                                  "error reading btree root %s",
 380                                  bch2_btree_id_str(i));
 381                         if (btree_id_is_alloc(i))
 382                                 c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
 383                         ret = 0;
 384                 }
 385         }
 386
 387         for (i = 0; i < BTREE_ID_NR; i++) {
 388                 struct btree_root *r = bch2_btree_id_root(c, i);
 389
 390                 if (!r->b) {
 391                         r->alive = false;
 392                         r->level = 0;
 393                         bch2_btree_root_alloc(c, i);
 394                 }
 395         }
 396 fsck_err:
 397         return ret;
 398 }
 399
 400 static int bch2_initialize_subvolumes(struct bch_fs *c)
 401 {
 402         struct bkey_i_snapshot_tree     root_tree;
 403         struct bkey_i_snapshot          root_snapshot;
 404         struct bkey_i_subvolume         root_volume;
 405         int ret;
 406
 407         bkey_snapshot_tree_init(&root_tree.k_i);
 408         root_tree.k.p.offset            = 1;
 409         root_tree.v.master_subvol       = cpu_to_le32(1);
 410         root_tree.v.root_snapshot       = cpu_to_le32(U32_MAX);
 411
 412         bkey_snapshot_init(&root_snapshot.k_i);
 413         root_snapshot.k.p.offset = U32_MAX;
 414         root_snapshot.v.flags   = 0;
 415         root_snapshot.v.parent  = 0;
 416         root_snapshot.v.subvol  = cpu_to_le32(BCACHEFS_ROOT_SUBVOL);
 417         root_snapshot.v.tree    = cpu_to_le32(1);
 418         SET_BCH_SNAPSHOT_SUBVOL(&root_snapshot.v, true);
 419
 420         bkey_subvolume_init(&root_volume.k_i);
 421         root_volume.k.p.offset = BCACHEFS_ROOT_SUBVOL;
 422         root_volume.v.flags     = 0;
 423         root_volume.v.snapshot  = cpu_to_le32(U32_MAX);
 424         root_volume.v.inode     = cpu_to_le64(BCACHEFS_ROOT_INO);
 425
 426         ret =   bch2_btree_insert(c, BTREE_ID_snapshot_trees,   &root_tree.k_i, NULL, 0) ?:
 427                 bch2_btree_insert(c, BTREE_ID_snapshots,        &root_snapshot.k_i, NULL, 0) ?:
 428                 bch2_btree_insert(c, BTREE_ID_subvolumes,       &root_volume.k_i, NULL, 0);
 429         if (ret)
 430                 bch_err_fn(c, ret);
 431         return ret;
 432 }
 433
 434 static int __bch2_fs_upgrade_for_subvolumes(struct btree_trans *trans)
 435 {
 436         struct btree_iter iter;
 437         struct bkey_s_c k;
 438         struct bch_inode_unpacked inode;
 439         int ret;
 440
 441         k = bch2_bkey_get_iter(trans, &iter, BTREE_ID_inodes,
 442                                SPOS(0, BCACHEFS_ROOT_INO, U32_MAX), 0);
 443         ret = bkey_err(k);
 444         if (ret)
 445                 return ret;
 446
 447         if (!bkey_is_inode(k.k)) {
 448                 bch_err(trans->c, "root inode not found");
 449                 ret = -BCH_ERR_ENOENT_inode;
 450                 goto err;
 451         }
 452
 453         ret = bch2_inode_unpack(k, &inode);
 454         BUG_ON(ret);
 455
 456         inode.bi_subvol = BCACHEFS_ROOT_SUBVOL;
 457
 458         ret = bch2_inode_write(trans, &iter, &inode);
 459 err:
 460         bch2_trans_iter_exit(trans, &iter);
 461         return ret;
 462 }
 463
 464 /* set bi_subvol on root inode */
 465 noinline_for_stack
 466 static int bch2_fs_upgrade_for_subvolumes(struct bch_fs *c)
 467 {
 468         int ret = bch2_trans_do(c, NULL, NULL, BTREE_INSERT_LAZY_RW,
 469                                 __bch2_fs_upgrade_for_subvolumes(trans));
 470         if (ret)
 471                 bch_err_fn(c, ret);
 472         return ret;
 473 }
 474
 475 const char * const bch2_recovery_passes[] = {
 476 #define x(_fn, _when)   #_fn,
 477         BCH_RECOVERY_PASSES()
 478 #undef x
 479         NULL
 480 };
 481
 482 static int bch2_check_allocations(struct bch_fs *c)
 483 {
 484         return bch2_gc(c, true, c->opts.norecovery);
 485 }
 486
 487 static int bch2_set_may_go_rw(struct bch_fs *c)
 488 {
 489         set_bit(BCH_FS_MAY_GO_RW, &c->flags);
 490         return 0;
 491 }
 492
 493 struct recovery_pass_fn {
 494         int             (*fn)(struct bch_fs *);
 495         unsigned        when;
 496 };
 497
 498 static struct recovery_pass_fn recovery_pass_fns[] = {
 499 #define x(_fn, _when)   { .fn = bch2_##_fn, .when = _when },
 500         BCH_RECOVERY_PASSES()
 501 #undef x
 502 };
 503
 504 static void check_version_upgrade(struct bch_fs *c)
 505 {
 506         unsigned latest_compatible = bch2_latest_compatible_version(c->sb.version);
 507         unsigned latest_version = bcachefs_metadata_version_current;
 508         unsigned old_version = c->sb.version_upgrade_complete ?: c->sb.version;
 509         unsigned new_version = 0;
 510         u64 recovery_passes;
 511
 512         if (old_version < bcachefs_metadata_required_upgrade_below) {
 513                 if (c->opts.version_upgrade == BCH_VERSION_UPGRADE_incompatible ||
 514                     latest_compatible < bcachefs_metadata_required_upgrade_below)
 515                         new_version = latest_version;
 516                 else
 517                         new_version = latest_compatible;
 518         } else {
 519                 switch (c->opts.version_upgrade) {
 520                 case BCH_VERSION_UPGRADE_compatible:
 521                         new_version = latest_compatible;
 522                         break;
 523                 case BCH_VERSION_UPGRADE_incompatible:
 524                         new_version = latest_version;
 525                         break;
 526                 case BCH_VERSION_UPGRADE_none:
 527                         new_version = old_version;
 528                         break;
 529                 }
 530         }
 531
 532         if (new_version > old_version) {
 533                 struct printbuf buf = PRINTBUF;
 534
 535                 if (old_version < bcachefs_metadata_required_upgrade_below)
 536                         prt_str(&buf, "Version upgrade required:\n");
 537
 538                 if (old_version != c->sb.version) {
 539                         prt_str(&buf, "Version upgrade from ");
 540                         bch2_version_to_text(&buf, c->sb.version_upgrade_complete);
 541                         prt_str(&buf, " to ");
 542                         bch2_version_to_text(&buf, c->sb.version);
 543                         prt_str(&buf, " incomplete\n");
 544                 }
 545
 546                 prt_printf(&buf, "Doing %s version upgrade from ",
 547                            BCH_VERSION_MAJOR(old_version) != BCH_VERSION_MAJOR(new_version)
 548                            ? "incompatible" : "compatible");
 549                 bch2_version_to_text(&buf, old_version);
 550                 prt_str(&buf, " to ");
 551                 bch2_version_to_text(&buf, new_version);
 552                 prt_newline(&buf);
 553
 554                 recovery_passes = bch2_upgrade_recovery_passes(c, old_version, new_version);
 555                 if (recovery_passes) {
 556                         if ((recovery_passes & RECOVERY_PASS_ALL_FSCK) == RECOVERY_PASS_ALL_FSCK)
 557                                 prt_str(&buf, "fsck required");
 558                         else {
 559                                 prt_str(&buf, "running recovery passes: ");
 560                                 prt_bitflags(&buf, bch2_recovery_passes, recovery_passes);
 561                         }
 562
 563                         c->recovery_passes_explicit |= recovery_passes;
 564                         c->opts.fix_errors = FSCK_FIX_yes;
 565                 }
 566
 567                 bch_info(c, "%s", buf.buf);
 568
 569                 mutex_lock(&c->sb_lock);
 570                 bch2_sb_upgrade(c, new_version);
 571                 mutex_unlock(&c->sb_lock);
 572
 573                 printbuf_exit(&buf);
 574         }
 575 }
 576
 577 u64 bch2_fsck_recovery_passes(void)
 578 {
 579         u64 ret = 0;
 580
 581         for (unsigned i = 0; i < ARRAY_SIZE(recovery_pass_fns); i++)
 582                 if (recovery_pass_fns[i].when & PASS_FSCK)
 583                         ret |= BIT_ULL(i);
 584         return ret;
 585 }
 586
 587 static bool should_run_recovery_pass(struct bch_fs *c, enum bch_recovery_pass pass)
 588 {
 589         struct recovery_pass_fn *p = recovery_pass_fns + c->curr_recovery_pass;
 590
 591         if (c->opts.norecovery && pass > BCH_RECOVERY_PASS_snapshots_read)
 592                 return false;
 593         if (c->recovery_passes_explicit & BIT_ULL(pass))
 594                 return true;
 595         if ((p->when & PASS_FSCK) && c->opts.fsck)
 596                 return true;
 597         if ((p->when & PASS_UNCLEAN) && !c->sb.clean)
 598                 return true;
 599         if (p->when & PASS_ALWAYS)
 600                 return true;
 601         return false;
 602 }
 603
 604 static int bch2_run_recovery_pass(struct bch_fs *c, enum bch_recovery_pass pass)
 605 {
 606         int ret;
 607
 608         c->curr_recovery_pass = pass;
 609
 610         if (should_run_recovery_pass(c, pass)) {
 611                 struct recovery_pass_fn *p = recovery_pass_fns + pass;
 612
 613                 if (!(p->when & PASS_SILENT))
 614                         printk(KERN_INFO bch2_log_msg(c, "%s..."),
 615                                bch2_recovery_passes[pass]);
 616                 ret = p->fn(c);
 617                 if (ret)
 618                         return ret;
 619                 if (!(p->when & PASS_SILENT))
 620                         printk(KERN_CONT " done\n");
 621
 622                 c->recovery_passes_complete |= BIT_ULL(pass);
 623         }
 624
 625         return 0;
 626 }
 627
 628 static int bch2_run_recovery_passes(struct bch_fs *c)
 629 {
 630         int ret = 0;
 631
 632         while (c->curr_recovery_pass < ARRAY_SIZE(recovery_pass_fns)) {
 633                 ret = bch2_run_recovery_pass(c, c->curr_recovery_pass);
 634                 if (bch2_err_matches(ret, BCH_ERR_restart_recovery))
 635                         continue;
 636                 if (ret)
 637                         break;
 638                 c->curr_recovery_pass++;
 639         }
 640
 641         return ret;
 642 }
 643
 644 int bch2_fs_recovery(struct bch_fs *c)
 645 {
 646         struct bch_sb_field_clean *clean = NULL;
 647         struct jset *last_journal_entry = NULL;
 648         u64 last_seq = 0, blacklist_seq, journal_seq;
 649         bool write_sb = false;
 650         int ret = 0;
 651
 652         if (c->sb.clean) {
 653                 clean = bch2_read_superblock_clean(c);
 654                 ret = PTR_ERR_OR_ZERO(clean);
 655                 if (ret)
 656                         goto err;
 657
 658                 bch_info(c, "recovering from clean shutdown, journal seq %llu",
 659                          le64_to_cpu(clean->journal_seq));
 660         } else {
 661                 bch_info(c, "recovering from unclean shutdown");
 662         }
 663
 664         if (!(c->sb.features & (1ULL << BCH_FEATURE_new_extent_overwrite))) {
 665                 bch_err(c, "feature new_extent_overwrite not set, filesystem no longer supported");
 666                 ret = -EINVAL;
 667                 goto err;
 668         }
 669
 670         if (!c->sb.clean &&
 671             !(c->sb.features & (1ULL << BCH_FEATURE_extents_above_btree_updates))) {
 672                 bch_err(c, "filesystem needs recovery from older version; run fsck from older bcachefs-tools to fix");
 673                 ret = -EINVAL;
 674                 goto err;
 675         }
 676
 677         if (c->opts.fsck || !(c->opts.nochanges && c->opts.norecovery))
 678                 check_version_upgrade(c);
 679
 680         if (c->opts.fsck && c->opts.norecovery) {
 681                 bch_err(c, "cannot select both norecovery and fsck");
 682                 ret = -EINVAL;
 683                 goto err;
 684         }
 685
 686         ret = bch2_blacklist_table_initialize(c);
 687         if (ret) {
 688                 bch_err(c, "error initializing blacklist table");
 689                 goto err;
 690         }
 691
 692         if (!c->sb.clean || c->opts.fsck || c->opts.keep_journal) {
 693                 struct genradix_iter iter;
 694                 struct journal_replay **i;
 695
 696                 bch_verbose(c, "starting journal read");
 697                 ret = bch2_journal_read(c, &last_seq, &blacklist_seq, &journal_seq);
 698                 if (ret)
 699                         goto err;
 700
 701                 /*
 702                  * note: cmd_list_journal needs the blacklist table fully up to date so
 703                  * it can asterisk ignored journal entries:
 704                  */
 705                 if (c->opts.read_journal_only)
 706                         goto out;
 707
 708                 genradix_for_each_reverse(&c->journal_entries, iter, i)
 709                         if (*i && !(*i)->ignore) {
 710                                 last_journal_entry = &(*i)->j;
 711                                 break;
 712                         }
 713
 714                 if (mustfix_fsck_err_on(c->sb.clean &&
 715                                         last_journal_entry &&
 716                                         !journal_entry_empty(last_journal_entry), c,
 717                                 "filesystem marked clean but journal not empty")) {
 718                         c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
 719                         SET_BCH_SB_CLEAN(c->disk_sb.sb, false);
 720                         c->sb.clean = false;
 721                 }
 722
 723                 if (!last_journal_entry) {
 724                         fsck_err_on(!c->sb.clean, c, "no journal entries found");
 725                         if (clean)
 726                                 goto use_clean;
 727
 728                         genradix_for_each_reverse(&c->journal_entries, iter, i)
 729                                 if (*i) {
 730                                         last_journal_entry = &(*i)->j;
 731                                         (*i)->ignore = false;
 732                                         break;
 733                                 }
 734                 }
 735
 736                 ret = bch2_journal_keys_sort(c);
 737                 if (ret)
 738                         goto err;
 739
 740                 if (c->sb.clean && last_journal_entry) {
 741                         ret = bch2_verify_superblock_clean(c, &clean,
 742                                                       last_journal_entry);
 743                         if (ret)
 744                                 goto err;
 745                 }
 746         } else {
 747 use_clean:
 748                 if (!clean) {
 749                         bch_err(c, "no superblock clean section found");
 750                         ret = -BCH_ERR_fsck_repair_impossible;
 751                         goto err;
 752
 753                 }
 754                 blacklist_seq = journal_seq = le64_to_cpu(clean->journal_seq) + 1;
 755         }
 756
 757         c->journal_replay_seq_start     = last_seq;
 758         c->journal_replay_seq_end       = blacklist_seq - 1;
 759
 760         if (c->opts.reconstruct_alloc) {
 761                 c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
 762                 drop_alloc_keys(&c->journal_keys);
 763         }
 764
 765         zero_out_btree_mem_ptr(&c->journal_keys);
 766
 767         ret = journal_replay_early(c, clean);
 768         if (ret)
 769                 goto err;
 770
 771         /*
 772          * After an unclean shutdown, skip then next few journal sequence
 773          * numbers as they may have been referenced by btree writes that
 774          * happened before their corresponding journal writes - those btree
 775          * writes need to be ignored, by skipping and blacklisting the next few
 776          * journal sequence numbers:
 777          */
 778         if (!c->sb.clean)
 779                 journal_seq += 8;
 780
 781         if (blacklist_seq != journal_seq) {
 782                 ret =   bch2_journal_log_msg(c, "blacklisting entries %llu-%llu",
 783                                              blacklist_seq, journal_seq) ?:
 784                         bch2_journal_seq_blacklist_add(c,
 785                                         blacklist_seq, journal_seq);
 786                 if (ret) {
 787                         bch_err(c, "error creating new journal seq blacklist entry");
 788                         goto err;
 789                 }
 790         }
 791
 792         ret =   bch2_journal_log_msg(c, "starting journal at entry %llu, replaying %llu-%llu",
 793                                      journal_seq, last_seq, blacklist_seq - 1) ?:
 794                 bch2_fs_journal_start(&c->journal, journal_seq);
 795         if (ret)
 796                 goto err;
 797
 798         if (c->opts.reconstruct_alloc)
 799                 bch2_journal_log_msg(c, "dropping alloc info");
 800
 801         /*
 802          * Skip past versions that might have possibly been used (as nonces),
 803          * but hadn't had their pointers written:
 804          */
 805         if (c->sb.encryption_type && !c->sb.clean)
 806                 atomic64_add(1 << 16, &c->key_version);
 807
 808         ret = read_btree_roots(c);
 809         if (ret)
 810                 goto err;
 811
 812         if (c->opts.fsck &&
 813             (IS_ENABLED(CONFIG_BCACHEFS_DEBUG) ||
 814              BCH_SB_HAS_TOPOLOGY_ERRORS(c->disk_sb.sb)))
 815                 c->recovery_passes_explicit |= BIT_ULL(BCH_RECOVERY_PASS_check_topology);
 816
 817         ret = bch2_run_recovery_passes(c);
 818         if (ret)
 819                 goto err;
 820
 821         /* If we fixed errors, verify that fs is actually clean now: */
 822         if (IS_ENABLED(CONFIG_BCACHEFS_DEBUG) &&
 823             test_bit(BCH_FS_ERRORS_FIXED, &c->flags) &&
 824             !test_bit(BCH_FS_ERRORS_NOT_FIXED, &c->flags) &&
 825             !test_bit(BCH_FS_ERROR, &c->flags)) {
 826                 bch_info(c, "Fixed errors, running fsck a second time to verify fs is clean");
 827                 clear_bit(BCH_FS_ERRORS_FIXED, &c->flags);
 828
 829                 c->curr_recovery_pass = BCH_RECOVERY_PASS_check_alloc_info;
 830
 831                 ret = bch2_run_recovery_passes(c);
 832                 if (ret)
 833                         goto err;
 834
 835                 if (test_bit(BCH_FS_ERRORS_FIXED, &c->flags) ||
 836                     test_bit(BCH_FS_ERRORS_NOT_FIXED, &c->flags)) {
 837                         bch_err(c, "Second fsck run was not clean");
 838                         set_bit(BCH_FS_ERRORS_NOT_FIXED, &c->flags);
 839                 }
 840
 841                 set_bit(BCH_FS_ERRORS_FIXED, &c->flags);
 842         }
 843
 844         if (enabled_qtypes(c)) {
 845                 bch_verbose(c, "reading quotas");
 846                 ret = bch2_fs_quota_read(c);
 847                 if (ret)
 848                         goto err;
 849                 bch_verbose(c, "quotas done");
 850         }
 851
 852         mutex_lock(&c->sb_lock);
 853         if (BCH_SB_VERSION_UPGRADE_COMPLETE(c->disk_sb.sb) != c->sb.version) {
 854                 SET_BCH_SB_VERSION_UPGRADE_COMPLETE(c->disk_sb.sb, c->sb.version);
 855                 write_sb = true;
 856         }
 857
 858         if (!test_bit(BCH_FS_ERROR, &c->flags)) {
 859                 c->disk_sb.sb->compat[0] |= cpu_to_le64(1ULL << BCH_COMPAT_alloc_info);
 860                 write_sb = true;
 861         }
 862
 863         if (c->opts.fsck &&
 864             !test_bit(BCH_FS_ERROR, &c->flags) &&
 865             !test_bit(BCH_FS_ERRORS_NOT_FIXED, &c->flags)) {
 866                 SET_BCH_SB_HAS_ERRORS(c->disk_sb.sb, 0);
 867                 SET_BCH_SB_HAS_TOPOLOGY_ERRORS(c->disk_sb.sb, 0);
 868                 write_sb = true;
 869         }
 870
 871         if (write_sb)
 872                 bch2_write_super(c);
 873         mutex_unlock(&c->sb_lock);
 874
 875         if (!(c->sb.compat & (1ULL << BCH_COMPAT_extents_above_btree_updates_done)) ||
 876             c->sb.version_min < bcachefs_metadata_version_btree_ptr_sectors_written) {
 877                 struct bch_move_stats stats;
 878
 879                 bch2_move_stats_init(&stats, "recovery");
 880
 881                 bch_info(c, "scanning for old btree nodes");
 882                 ret =   bch2_fs_read_write(c) ?:
 883                         bch2_scan_old_btree_nodes(c, &stats);
 884                 if (ret)
 885                         goto err;
 886                 bch_info(c, "scanning for old btree nodes done");
 887         }
 888
 889         if (c->journal_seq_blacklist_table &&
 890             c->journal_seq_blacklist_table->nr > 128)
 891                 queue_work(system_long_wq, &c->journal_seq_blacklist_gc_work);
 892
 893         ret = 0;
 894 out:
 895         set_bit(BCH_FS_FSCK_DONE, &c->flags);
 896         bch2_flush_fsck_errs(c);
 897
 898         if (!c->opts.keep_journal &&
 899             test_bit(JOURNAL_REPLAY_DONE, &c->journal.flags)) {
 900                 bch2_journal_keys_free(&c->journal_keys);
 901                 bch2_journal_entries_free(c);
 902         }
 903         kfree(clean);
 904
 905         if (!ret && test_bit(BCH_FS_NEED_DELETE_DEAD_SNAPSHOTS, &c->flags)) {
 906                 bch2_fs_read_write_early(c);
 907                 bch2_delete_dead_snapshots_async(c);
 908         }
 909
 910         if (ret)
 911                 bch_err_fn(c, ret);
 912         return ret;
 913 err:
 914 fsck_err:
 915         bch2_fs_emergency_read_only(c);
 916         goto out;
 917 }
 918
 919 int bch2_fs_initialize(struct bch_fs *c)
 920 {
 921         struct bch_inode_unpacked root_inode, lostfound_inode;
 922         struct bkey_inode_buf packed_inode;
 923         struct qstr lostfound = QSTR("lost+found");
 924         struct bch_dev *ca;
 925         unsigned i;
 926         int ret;
 927
 928         bch_notice(c, "initializing new filesystem");
 929
 930         mutex_lock(&c->sb_lock);
 931         c->disk_sb.sb->compat[0] |= cpu_to_le64(1ULL << BCH_COMPAT_extents_above_btree_updates_done);
 932         c->disk_sb.sb->compat[0] |= cpu_to_le64(1ULL << BCH_COMPAT_bformat_overflow_done);
 933
 934         bch2_sb_maybe_downgrade(c);
 935
 936         if (c->opts.version_upgrade != BCH_VERSION_UPGRADE_none) {
 937                 bch2_sb_upgrade(c, bcachefs_metadata_version_current);
 938                 SET_BCH_SB_VERSION_UPGRADE_COMPLETE(c->disk_sb.sb, bcachefs_metadata_version_current);
 939                 bch2_write_super(c);
 940         }
 941         mutex_unlock(&c->sb_lock);
 942
 943         c->curr_recovery_pass = ARRAY_SIZE(recovery_pass_fns);
 944         set_bit(BCH_FS_MAY_GO_RW, &c->flags);
 945         set_bit(BCH_FS_FSCK_DONE, &c->flags);
 946
 947         for (i = 0; i < BTREE_ID_NR; i++)
 948                 bch2_btree_root_alloc(c, i);
 949
 950         for_each_member_device(ca, c, i)
 951                 bch2_dev_usage_init(ca);
 952
 953         ret = bch2_fs_journal_alloc(c);
 954         if (ret)
 955                 goto err;
 956
 957         /*
 958          * journal_res_get() will crash if called before this has
 959          * set up the journal.pin FIFO and journal.cur pointer:
 960          */
 961         bch2_fs_journal_start(&c->journal, 1);
 962         bch2_journal_set_replay_done(&c->journal);
 963
 964         ret = bch2_fs_read_write_early(c);
 965         if (ret)
 966                 goto err;
 967
 968         /*
 969          * Write out the superblock and journal buckets, now that we can do
 970          * btree updates
 971          */
 972         bch_verbose(c, "marking superblocks");
 973         ret = bch2_trans_mark_dev_sbs(c);
 974         bch_err_msg(c, ret, "marking superblocks");
 975         if (ret)
 976                 goto err;
 977
 978         for_each_online_member(ca, c, i)
 979                 ca->new_fs_bucket_idx = 0;
 980
 981         ret = bch2_fs_freespace_init(c);
 982         if (ret)
 983                 goto err;
 984
 985         ret = bch2_initialize_subvolumes(c);
 986         if (ret)
 987                 goto err;
 988
 989         bch_verbose(c, "reading snapshots table");
 990         ret = bch2_snapshots_read(c);
 991         if (ret)
 992                 goto err;
 993         bch_verbose(c, "reading snapshots done");
 994
 995         bch2_inode_init(c, &root_inode, 0, 0, S_IFDIR|0755, 0, NULL);
 996         root_inode.bi_inum      = BCACHEFS_ROOT_INO;
 997         root_inode.bi_subvol    = BCACHEFS_ROOT_SUBVOL;
 998         bch2_inode_pack(&packed_inode, &root_inode);
 999         packed_inode.inode.k.p.snapshot = U32_MAX;
1000
1001         ret = bch2_btree_insert(c, BTREE_ID_inodes, &packed_inode.inode.k_i, NULL, 0);
1002         if (ret) {
1003                 bch_err_msg(c, ret, "creating root directory");
1004                 goto err;
1005         }
1006
1007         bch2_inode_init_early(c, &lostfound_inode);
1008
1009         ret = bch2_trans_do(c, NULL, NULL, 0,
1010                 bch2_create_trans(trans,
1011                                   BCACHEFS_ROOT_SUBVOL_INUM,
1012                                   &root_inode, &lostfound_inode,
1013                                   &lostfound,
1014                                   0, 0, S_IFDIR|0700, 0,
1015                                   NULL, NULL, (subvol_inum) { 0 }, 0));
1016         if (ret) {
1017                 bch_err_msg(c, ret, "creating lost+found");
1018                 goto err;
1019         }
1020
1021         if (enabled_qtypes(c)) {
1022                 ret = bch2_fs_quota_read(c);
1023                 if (ret)
1024                         goto err;
1025         }
1026
1027         ret = bch2_journal_flush(&c->journal);
1028         if (ret) {
1029                 bch_err_msg(c, ret, "writing first journal entry");
1030                 goto err;
1031         }
1032
1033         mutex_lock(&c->sb_lock);
1034         SET_BCH_SB_INITIALIZED(c->disk_sb.sb, true);
1035         SET_BCH_SB_CLEAN(c->disk_sb.sb, false);
1036
1037         bch2_write_super(c);
1038         mutex_unlock(&c->sb_lock);
1039
1040         return 0;
1041 err:
1042         bch_err_fn(ca, ret);
1043         return ret;
1044 }