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 "alloc_background.h"
   5 #include "btree_gc.h"
   6 #include "btree_update.h"
   7 #include "btree_update_interior.h"
   8 #include "btree_io.h"
   9 #include "buckets.h"
  10 #include "dirent.h"
  11 #include "ec.h"
  12 #include "error.h"
  13 #include "fs-common.h"
  14 #include "fsck.h"
  15 #include "journal_io.h"
  16 #include "journal_reclaim.h"
  17 #include "journal_seq_blacklist.h"
  18 #include "quota.h"
  19 #include "recovery.h"
  20 #include "replicas.h"
  21 #include "super-io.h"
  22
  23 #include <linux/sort.h>
  24 #include <linux/stat.h>
  25
  26 #define QSTR(n) { { { .len = strlen(n) } }, .name = n }
  27
  28 /* iterate over keys read from the journal: */
  29
  30 struct journal_iter bch2_journal_iter_init(struct journal_keys *keys,
  31                                            enum btree_id id)
  32 {
  33         return (struct journal_iter) {
  34                 .keys           = keys,
  35                 .k              = keys->d,
  36                 .btree_id       = id,
  37         };
  38 }
  39
  40 struct bkey_s_c bch2_journal_iter_peek(struct journal_iter *iter)
  41 {
  42         while (1) {
  43                 if (iter->k == iter->keys->d + iter->keys->nr)
  44                         return bkey_s_c_null;
  45
  46                 if (iter->k->btree_id == iter->btree_id)
  47                         return bkey_i_to_s_c(iter->k->k);
  48
  49                 iter->k++;
  50         }
  51
  52         return bkey_s_c_null;
  53 }
  54
  55 struct bkey_s_c bch2_journal_iter_next(struct journal_iter *iter)
  56 {
  57         if (iter->k == iter->keys->d + iter->keys->nr)
  58                 return bkey_s_c_null;
  59
  60         iter->k++;
  61         return bch2_journal_iter_peek(iter);
  62 }
  63
  64 /* sort and dedup all keys in the journal: */
  65
  66 static void journal_entries_free(struct list_head *list)
  67 {
  68
  69         while (!list_empty(list)) {
  70                 struct journal_replay *i =
  71                         list_first_entry(list, struct journal_replay, list);
  72                 list_del(&i->list);
  73                 kvpfree(i, offsetof(struct journal_replay, j) +
  74                         vstruct_bytes(&i->j));
  75         }
  76 }
  77
  78 static int journal_sort_key_cmp(const void *_l, const void *_r)
  79 {
  80         const struct journal_key *l = _l;
  81         const struct journal_key *r = _r;
  82
  83         return cmp_int(l->btree_id, r->btree_id) ?:
  84                 bkey_cmp(l->pos, r->pos) ?:
  85                 cmp_int(l->journal_seq, r->journal_seq) ?:
  86                 cmp_int(l->journal_offset, r->journal_offset);
  87 }
  88
  89 static int journal_sort_seq_cmp(const void *_l, const void *_r)
  90 {
  91         const struct journal_key *l = _l;
  92         const struct journal_key *r = _r;
  93
  94         return cmp_int(l->journal_seq, r->journal_seq) ?:
  95                 cmp_int(l->btree_id, r->btree_id) ?:
  96                 bkey_cmp(l->pos, r->pos);
  97 }
  98
  99 static void journal_keys_sift(struct journal_keys *keys, struct journal_key *i)
 100 {
 101         while (i + 1 < keys->d + keys->nr &&
 102                journal_sort_key_cmp(i, i + 1) > 0) {
 103                 swap(i[0], i[1]);
 104                 i++;
 105         }
 106 }
 107
 108 static void journal_keys_free(struct journal_keys *keys)
 109 {
 110         struct journal_key *i;
 111
 112         for_each_journal_key(*keys, i)
 113                 if (i->allocated)
 114                         kfree(i->k);
 115         kvfree(keys->d);
 116         keys->d = NULL;
 117         keys->nr = 0;
 118 }
 119
 120 static struct journal_keys journal_keys_sort(struct list_head *journal_entries)
 121 {
 122         struct journal_replay *p;
 123         struct jset_entry *entry;
 124         struct bkey_i *k, *_n;
 125         struct journal_keys keys = { NULL }, keys_deduped = { NULL };
 126         struct journal_key *i;
 127         size_t nr_keys = 0;
 128
 129         list_for_each_entry(p, journal_entries, list)
 130                 for_each_jset_key(k, _n, entry, &p->j)
 131                         nr_keys++;
 132
 133         keys.journal_seq_base = keys_deduped.journal_seq_base =
 134                 le64_to_cpu(list_first_entry(journal_entries,
 135                                              struct journal_replay,
 136                                              list)->j.seq);
 137
 138         keys.d = kvmalloc(sizeof(keys.d[0]) * nr_keys, GFP_KERNEL);
 139         if (!keys.d)
 140                 goto err;
 141
 142         keys_deduped.d = kvmalloc(sizeof(keys.d[0]) * nr_keys * 2, GFP_KERNEL);
 143         if (!keys_deduped.d)
 144                 goto err;
 145
 146         list_for_each_entry(p, journal_entries, list)
 147                 for_each_jset_key(k, _n, entry, &p->j)
 148                         keys.d[keys.nr++] = (struct journal_key) {
 149                                 .btree_id       = entry->btree_id,
 150                                 .pos            = bkey_start_pos(&k->k),
 151                                 .k              = k,
 152                                 .journal_seq    = le64_to_cpu(p->j.seq) -
 153                                         keys.journal_seq_base,
 154                                 .journal_offset = k->_data - p->j._data,
 155                         };
 156
 157         sort(keys.d, nr_keys, sizeof(keys.d[0]), journal_sort_key_cmp, NULL);
 158
 159         i = keys.d;
 160         while (i < keys.d + keys.nr) {
 161                 if (i + 1 < keys.d + keys.nr &&
 162                     i[0].btree_id == i[1].btree_id &&
 163                     !bkey_cmp(i[0].pos, i[1].pos)) {
 164                         if (bkey_cmp(i[0].k->k.p, i[1].k->k.p) <= 0) {
 165                                 i++;
 166                         } else {
 167                                 bch2_cut_front(i[1].k->k.p, i[0].k);
 168                                 i[0].pos = i[1].k->k.p;
 169                                 journal_keys_sift(&keys, i);
 170                         }
 171                         continue;
 172                 }
 173
 174                 if (i + 1 < keys.d + keys.nr &&
 175                     i[0].btree_id == i[1].btree_id &&
 176                     bkey_cmp(i[0].k->k.p, bkey_start_pos(&i[1].k->k)) > 0) {
 177                         if ((cmp_int(i[0].journal_seq, i[1].journal_seq) ?:
 178                              cmp_int(i[0].journal_offset, i[1].journal_offset)) < 0) {
 179                                 if (bkey_cmp(i[0].k->k.p, i[1].k->k.p) <= 0) {
 180                                         bch2_cut_back(bkey_start_pos(&i[1].k->k), i[0].k);
 181                                 } else {
 182                                         struct bkey_i *split =
 183                                                 kmalloc(bkey_bytes(i[0].k), GFP_KERNEL);
 184
 185                                         if (!split)
 186                                                 goto err;
 187
 188                                         bkey_copy(split, i[0].k);
 189                                         bch2_cut_back(bkey_start_pos(&i[1].k->k), split);
 190                                         keys_deduped.d[keys_deduped.nr++] = (struct journal_key) {
 191                                                 .btree_id       = i[0].btree_id,
 192                                                 .allocated      = true,
 193                                                 .pos            = bkey_start_pos(&split->k),
 194                                                 .k              = split,
 195                                                 .journal_seq    = i[0].journal_seq,
 196                                                 .journal_offset = i[0].journal_offset,
 197                                         };
 198
 199                                         bch2_cut_front(i[1].k->k.p, i[0].k);
 200                                         i[0].pos = i[1].k->k.p;
 201                                         journal_keys_sift(&keys, i);
 202                                         continue;
 203                                 }
 204                         } else {
 205                                 if (bkey_cmp(i[0].k->k.p, i[1].k->k.p) >= 0) {
 206                                         i[1] = i[0];
 207                                         i++;
 208                                         continue;
 209                                 } else {
 210                                         bch2_cut_front(i[0].k->k.p, i[1].k);
 211                                         i[1].pos = i[0].k->k.p;
 212                                         journal_keys_sift(&keys, i + 1);
 213                                         continue;
 214                                 }
 215                         }
 216                 }
 217
 218                 keys_deduped.d[keys_deduped.nr++] = *i++;
 219         }
 220
 221         kvfree(keys.d);
 222         return keys_deduped;
 223 err:
 224         journal_keys_free(&keys_deduped);
 225         kvfree(keys.d);
 226         return (struct journal_keys) { NULL };
 227 }
 228
 229 /* journal replay: */
 230
 231 static void replay_now_at(struct journal *j, u64 seq)
 232 {
 233         BUG_ON(seq < j->replay_journal_seq);
 234         BUG_ON(seq > j->replay_journal_seq_end);
 235
 236         while (j->replay_journal_seq < seq)
 237                 bch2_journal_pin_put(j, j->replay_journal_seq++);
 238 }
 239
 240 static int bch2_extent_replay_key(struct bch_fs *c, enum btree_id btree_id,
 241                                   struct bkey_i *k)
 242 {
 243         struct btree_trans trans;
 244         struct btree_iter *iter, *split_iter;
 245         /*
 246          * We might cause compressed extents to be split, so we need to pass in
 247          * a disk_reservation:
 248          */
 249         struct disk_reservation disk_res =
 250                 bch2_disk_reservation_init(c, 0);
 251         struct bkey_i *split;
 252         struct bpos atomic_end;
 253         /*
 254          * Some extents aren't equivalent - w.r.t. what the triggers do
 255          * - if they're split:
 256          */
 257         bool remark_if_split = bch2_bkey_sectors_compressed(bkey_i_to_s_c(k)) ||
 258                 k->k.type == KEY_TYPE_reflink_p;
 259         bool remark = false;
 260         int ret;
 261
 262         bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
 263 retry:
 264         bch2_trans_begin(&trans);
 265
 266         iter = bch2_trans_get_iter(&trans, btree_id,
 267                                    bkey_start_pos(&k->k),
 268                                    BTREE_ITER_INTENT);
 269
 270         do {
 271                 ret = bch2_btree_iter_traverse(iter);
 272                 if (ret)
 273                         goto err;
 274
 275                 atomic_end = bpos_min(k->k.p, iter->l[0].b->key.k.p);
 276
 277                 split_iter = bch2_trans_copy_iter(&trans, iter);
 278                 ret = PTR_ERR_OR_ZERO(split_iter);
 279                 if (ret)
 280                         goto err;
 281
 282                 split = bch2_trans_kmalloc(&trans, bkey_bytes(&k->k));
 283                 ret = PTR_ERR_OR_ZERO(split);
 284                 if (ret)
 285                         goto err;
 286
 287                 if (!remark &&
 288                     remark_if_split &&
 289                     bkey_cmp(atomic_end, k->k.p) < 0) {
 290                         ret = bch2_disk_reservation_add(c, &disk_res,
 291                                         k->k.size *
 292                                         bch2_bkey_nr_ptrs_allocated(bkey_i_to_s_c(k)),
 293                                         BCH_DISK_RESERVATION_NOFAIL);
 294                         BUG_ON(ret);
 295
 296                         remark = true;
 297                 }
 298
 299                 bkey_copy(split, k);
 300                 bch2_cut_front(split_iter->pos, split);
 301                 bch2_cut_back(atomic_end, split);
 302
 303                 bch2_trans_update(&trans, split_iter, split);
 304                 bch2_btree_iter_set_pos(iter, split->k.p);
 305         } while (bkey_cmp(iter->pos, k->k.p) < 0);
 306
 307         if (remark) {
 308                 ret = bch2_trans_mark_key(&trans, bkey_i_to_s_c(k),
 309                                           0, -((s64) k->k.size),
 310                                           BCH_BUCKET_MARK_OVERWRITE) ?:
 311                       bch2_trans_commit(&trans, &disk_res, NULL,
 312                                         BTREE_INSERT_ATOMIC|
 313                                         BTREE_INSERT_NOFAIL|
 314                                         BTREE_INSERT_LAZY_RW|
 315                                         BTREE_INSERT_NOMARK_OVERWRITES|
 316                                         BTREE_INSERT_NO_CLEAR_REPLICAS);
 317         } else {
 318                 ret = bch2_trans_commit(&trans, &disk_res, NULL,
 319                                         BTREE_INSERT_ATOMIC|
 320                                         BTREE_INSERT_NOFAIL|
 321                                         BTREE_INSERT_LAZY_RW|
 322                                         BTREE_INSERT_JOURNAL_REPLAY|
 323                                         BTREE_INSERT_NOMARK);
 324         }
 325
 326         if (ret)
 327                 goto err;
 328 err:
 329         if (ret == -EINTR)
 330                 goto retry;
 331
 332         bch2_disk_reservation_put(c, &disk_res);
 333
 334         return bch2_trans_exit(&trans) ?: ret;
 335 }
 336
 337 static int bch2_journal_replay(struct bch_fs *c,
 338                                struct journal_keys keys)
 339 {
 340         struct journal *j = &c->journal;
 341         struct journal_key *i;
 342         int ret;
 343
 344         sort(keys.d, keys.nr, sizeof(keys.d[0]), journal_sort_seq_cmp, NULL);
 345
 346         for_each_journal_key(keys, i) {
 347                 replay_now_at(j, keys.journal_seq_base + i->journal_seq);
 348
 349                 if (i->btree_id == BTREE_ID_ALLOC)
 350                         ret = bch2_alloc_replay_key(c, i->k);
 351                 else if (btree_node_type_is_extents(i->btree_id))
 352                         ret = bch2_extent_replay_key(c, i->btree_id, i->k);
 353                 else
 354                         ret = bch2_btree_insert(c, i->btree_id, i->k,
 355                                                 NULL, NULL,
 356                                                 BTREE_INSERT_NOFAIL|
 357                                                 BTREE_INSERT_LAZY_RW|
 358                                                 BTREE_INSERT_JOURNAL_REPLAY|
 359                                                 BTREE_INSERT_NOMARK);
 360
 361                 if (ret) {
 362                         bch_err(c, "journal replay: error %d while replaying key",
 363                                 ret);
 364                         return ret;
 365                 }
 366
 367                 cond_resched();
 368         }
 369
 370         replay_now_at(j, j->replay_journal_seq_end);
 371         j->replay_journal_seq = 0;
 372
 373         bch2_journal_set_replay_done(j);
 374         bch2_journal_flush_all_pins(j);
 375         return bch2_journal_error(j);
 376 }
 377
 378 static bool journal_empty(struct list_head *journal)
 379 {
 380         return list_empty(journal) ||
 381                 journal_entry_empty(&list_last_entry(journal,
 382                                         struct journal_replay, list)->j);
 383 }
 384
 385 static int
 386 verify_journal_entries_not_blacklisted_or_missing(struct bch_fs *c,
 387                                                   struct list_head *journal)
 388 {
 389         struct journal_replay *i =
 390                 list_last_entry(journal, struct journal_replay, list);
 391         u64 start_seq   = le64_to_cpu(i->j.last_seq);
 392         u64 end_seq     = le64_to_cpu(i->j.seq);
 393         u64 seq         = start_seq;
 394         int ret = 0;
 395
 396         list_for_each_entry(i, journal, list) {
 397                 fsck_err_on(seq != le64_to_cpu(i->j.seq), c,
 398                         "journal entries %llu-%llu missing! (replaying %llu-%llu)",
 399                         seq, le64_to_cpu(i->j.seq) - 1,
 400                         start_seq, end_seq);
 401
 402                 seq = le64_to_cpu(i->j.seq);
 403
 404                 fsck_err_on(bch2_journal_seq_is_blacklisted(c, seq, false), c,
 405                             "found blacklisted journal entry %llu", seq);
 406
 407                 do {
 408                         seq++;
 409                 } while (bch2_journal_seq_is_blacklisted(c, seq, false));
 410         }
 411 fsck_err:
 412         return ret;
 413 }
 414
 415 /* journal replay early: */
 416
 417 static int journal_replay_entry_early(struct bch_fs *c,
 418                                       struct jset_entry *entry)
 419 {
 420         int ret = 0;
 421
 422         switch (entry->type) {
 423         case BCH_JSET_ENTRY_btree_root: {
 424                 struct btree_root *r;
 425
 426                 if (entry->btree_id >= BTREE_ID_NR) {
 427                         bch_err(c, "filesystem has unknown btree type %u",
 428                                 entry->btree_id);
 429                         return -EINVAL;
 430                 }
 431
 432                 r = &c->btree_roots[entry->btree_id];
 433
 434                 if (entry->u64s) {
 435                         r->level = entry->level;
 436                         bkey_copy(&r->key, &entry->start[0]);
 437                         r->error = 0;
 438                 } else {
 439                         r->error = -EIO;
 440                 }
 441                 r->alive = true;
 442                 break;
 443         }
 444         case BCH_JSET_ENTRY_usage: {
 445                 struct jset_entry_usage *u =
 446                         container_of(entry, struct jset_entry_usage, entry);
 447
 448                 switch (entry->btree_id) {
 449                 case FS_USAGE_RESERVED:
 450                         if (entry->level < BCH_REPLICAS_MAX)
 451                                 c->usage_base->persistent_reserved[entry->level] =
 452                                         le64_to_cpu(u->v);
 453                         break;
 454                 case FS_USAGE_INODES:
 455                         c->usage_base->nr_inodes = le64_to_cpu(u->v);
 456                         break;
 457                 case FS_USAGE_KEY_VERSION:
 458                         atomic64_set(&c->key_version,
 459                                      le64_to_cpu(u->v));
 460                         break;
 461                 }
 462
 463                 break;
 464         }
 465         case BCH_JSET_ENTRY_data_usage: {
 466                 struct jset_entry_data_usage *u =
 467                         container_of(entry, struct jset_entry_data_usage, entry);
 468                 ret = bch2_replicas_set_usage(c, &u->r,
 469                                               le64_to_cpu(u->v));
 470                 break;
 471         }
 472         case BCH_JSET_ENTRY_blacklist: {
 473                 struct jset_entry_blacklist *bl_entry =
 474                         container_of(entry, struct jset_entry_blacklist, entry);
 475
 476                 ret = bch2_journal_seq_blacklist_add(c,
 477                                 le64_to_cpu(bl_entry->seq),
 478                                 le64_to_cpu(bl_entry->seq) + 1);
 479                 break;
 480         }
 481         case BCH_JSET_ENTRY_blacklist_v2: {
 482                 struct jset_entry_blacklist_v2 *bl_entry =
 483                         container_of(entry, struct jset_entry_blacklist_v2, entry);
 484
 485                 ret = bch2_journal_seq_blacklist_add(c,
 486                                 le64_to_cpu(bl_entry->start),
 487                                 le64_to_cpu(bl_entry->end) + 1);
 488                 break;
 489         }
 490         }
 491
 492         return ret;
 493 }
 494
 495 static int journal_replay_early(struct bch_fs *c,
 496                                 struct bch_sb_field_clean *clean,
 497                                 struct list_head *journal)
 498 {
 499         struct jset_entry *entry;
 500         int ret;
 501
 502         if (clean) {
 503                 c->bucket_clock[READ].hand = le16_to_cpu(clean->read_clock);
 504                 c->bucket_clock[WRITE].hand = le16_to_cpu(clean->write_clock);
 505
 506                 for (entry = clean->start;
 507                      entry != vstruct_end(&clean->field);
 508                      entry = vstruct_next(entry)) {
 509                         ret = journal_replay_entry_early(c, entry);
 510                         if (ret)
 511                                 return ret;
 512                 }
 513         } else {
 514                 struct journal_replay *i =
 515                         list_last_entry(journal, struct journal_replay, list);
 516
 517                 c->bucket_clock[READ].hand = le16_to_cpu(i->j.read_clock);
 518                 c->bucket_clock[WRITE].hand = le16_to_cpu(i->j.write_clock);
 519
 520                 list_for_each_entry(i, journal, list)
 521                         vstruct_for_each(&i->j, entry) {
 522                                 ret = journal_replay_entry_early(c, entry);
 523                                 if (ret)
 524                                         return ret;
 525                         }
 526         }
 527
 528         bch2_fs_usage_initialize(c);
 529
 530         return 0;
 531 }
 532
 533 /* sb clean section: */
 534
 535 static struct bkey_i *btree_root_find(struct bch_fs *c,
 536                                       struct bch_sb_field_clean *clean,
 537                                       struct jset *j,
 538                                       enum btree_id id, unsigned *level)
 539 {
 540         struct bkey_i *k;
 541         struct jset_entry *entry, *start, *end;
 542
 543         if (clean) {
 544                 start = clean->start;
 545                 end = vstruct_end(&clean->field);
 546         } else {
 547                 start = j->start;
 548                 end = vstruct_last(j);
 549         }
 550
 551         for (entry = start; entry < end; entry = vstruct_next(entry))
 552                 if (entry->type == BCH_JSET_ENTRY_btree_root &&
 553                     entry->btree_id == id)
 554                         goto found;
 555
 556         return NULL;
 557 found:
 558         if (!entry->u64s)
 559                 return ERR_PTR(-EINVAL);
 560
 561         k = entry->start;
 562         *level = entry->level;
 563         return k;
 564 }
 565
 566 static int verify_superblock_clean(struct bch_fs *c,
 567                                    struct bch_sb_field_clean **cleanp,
 568                                    struct jset *j)
 569 {
 570         unsigned i;
 571         struct bch_sb_field_clean *clean = *cleanp;
 572         int ret = 0;
 573
 574         if (!c->sb.clean || !j)
 575                 return 0;
 576
 577         if (mustfix_fsck_err_on(j->seq != clean->journal_seq, c,
 578                         "superblock journal seq (%llu) doesn't match journal (%llu) after clean shutdown",
 579                         le64_to_cpu(clean->journal_seq),
 580                         le64_to_cpu(j->seq))) {
 581                 kfree(clean);
 582                 *cleanp = NULL;
 583                 return 0;
 584         }
 585
 586         mustfix_fsck_err_on(j->read_clock != clean->read_clock, c,
 587                         "superblock read clock doesn't match journal after clean shutdown");
 588         mustfix_fsck_err_on(j->write_clock != clean->write_clock, c,
 589                         "superblock read clock doesn't match journal after clean shutdown");
 590
 591         for (i = 0; i < BTREE_ID_NR; i++) {
 592                 struct bkey_i *k1, *k2;
 593                 unsigned l1 = 0, l2 = 0;
 594
 595                 k1 = btree_root_find(c, clean, NULL, i, &l1);
 596                 k2 = btree_root_find(c, NULL, j, i, &l2);
 597
 598                 if (!k1 && !k2)
 599                         continue;
 600
 601                 mustfix_fsck_err_on(!k1 || !k2 ||
 602                                     IS_ERR(k1) ||
 603                                     IS_ERR(k2) ||
 604                                     k1->k.u64s != k2->k.u64s ||
 605                                     memcmp(k1, k2, bkey_bytes(k1)) ||
 606                                     l1 != l2, c,
 607                         "superblock btree root doesn't match journal after clean shutdown");
 608         }
 609 fsck_err:
 610         return ret;
 611 }
 612
 613 static struct bch_sb_field_clean *read_superblock_clean(struct bch_fs *c)
 614 {
 615         struct bch_sb_field_clean *clean, *sb_clean;
 616         int ret;
 617
 618         mutex_lock(&c->sb_lock);
 619         sb_clean = bch2_sb_get_clean(c->disk_sb.sb);
 620
 621         if (fsck_err_on(!sb_clean, c,
 622                         "superblock marked clean but clean section not present")) {
 623                 SET_BCH_SB_CLEAN(c->disk_sb.sb, false);
 624                 c->sb.clean = false;
 625                 mutex_unlock(&c->sb_lock);
 626                 return NULL;
 627         }
 628
 629         clean = kmemdup(sb_clean, vstruct_bytes(&sb_clean->field),
 630                         GFP_KERNEL);
 631         if (!clean) {
 632                 mutex_unlock(&c->sb_lock);
 633                 return ERR_PTR(-ENOMEM);
 634         }
 635
 636         if (le16_to_cpu(c->disk_sb.sb->version) <
 637             bcachefs_metadata_version_bkey_renumber)
 638                 bch2_sb_clean_renumber(clean, READ);
 639
 640         mutex_unlock(&c->sb_lock);
 641
 642         return clean;
 643 fsck_err:
 644         mutex_unlock(&c->sb_lock);
 645         return ERR_PTR(ret);
 646 }
 647
 648 static int read_btree_roots(struct bch_fs *c)
 649 {
 650         unsigned i;
 651         int ret = 0;
 652
 653         for (i = 0; i < BTREE_ID_NR; i++) {
 654                 struct btree_root *r = &c->btree_roots[i];
 655
 656                 if (!r->alive)
 657                         continue;
 658
 659                 if (i == BTREE_ID_ALLOC &&
 660                     c->opts.reconstruct_alloc) {
 661                         c->sb.compat &= ~(1ULL << BCH_COMPAT_FEAT_ALLOC_INFO);
 662                         continue;
 663                 }
 664
 665
 666                 if (r->error) {
 667                         __fsck_err(c, i == BTREE_ID_ALLOC
 668                                    ? FSCK_CAN_IGNORE : 0,
 669                                    "invalid btree root %s",
 670                                    bch2_btree_ids[i]);
 671                         if (i == BTREE_ID_ALLOC)
 672                                 c->sb.compat &= ~(1ULL << BCH_COMPAT_FEAT_ALLOC_INFO);
 673                 }
 674
 675                 ret = bch2_btree_root_read(c, i, &r->key, r->level);
 676                 if (ret) {
 677                         __fsck_err(c, i == BTREE_ID_ALLOC
 678                                    ? FSCK_CAN_IGNORE : 0,
 679                                    "error reading btree root %s",
 680                                    bch2_btree_ids[i]);
 681                         if (i == BTREE_ID_ALLOC)
 682                                 c->sb.compat &= ~(1ULL << BCH_COMPAT_FEAT_ALLOC_INFO);
 683                 }
 684         }
 685
 686         for (i = 0; i < BTREE_ID_NR; i++)
 687                 if (!c->btree_roots[i].b)
 688                         bch2_btree_root_alloc(c, i);
 689 fsck_err:
 690         return ret;
 691 }
 692
 693 int bch2_fs_recovery(struct bch_fs *c)
 694 {
 695         const char *err = "cannot allocate memory";
 696         struct bch_sb_field_clean *clean = NULL;
 697         u64 journal_seq;
 698         LIST_HEAD(journal_entries);
 699         struct journal_keys journal_keys = { NULL };
 700         bool wrote = false, write_sb = false;
 701         int ret;
 702
 703         if (c->sb.clean)
 704                 clean = read_superblock_clean(c);
 705         ret = PTR_ERR_OR_ZERO(clean);
 706         if (ret)
 707                 goto err;
 708
 709         if (c->sb.clean)
 710                 bch_info(c, "recovering from clean shutdown, journal seq %llu",
 711                          le64_to_cpu(clean->journal_seq));
 712
 713         if (!c->replicas.entries) {
 714                 bch_info(c, "building replicas info");
 715                 set_bit(BCH_FS_REBUILD_REPLICAS, &c->flags);
 716         }
 717
 718         if (!c->sb.clean || c->opts.fsck) {
 719                 struct jset *j;
 720
 721                 ret = bch2_journal_read(c, &journal_entries);
 722                 if (ret)
 723                         goto err;
 724
 725                 if (mustfix_fsck_err_on(c->sb.clean && !journal_empty(&journal_entries), c,
 726                                 "filesystem marked clean but journal not empty")) {
 727                         c->sb.compat &= ~(1ULL << BCH_COMPAT_FEAT_ALLOC_INFO);
 728                         SET_BCH_SB_CLEAN(c->disk_sb.sb, false);
 729                         c->sb.clean = false;
 730                 }
 731
 732                 if (!c->sb.clean && list_empty(&journal_entries)) {
 733                         bch_err(c, "no journal entries found");
 734                         ret = BCH_FSCK_REPAIR_IMPOSSIBLE;
 735                         goto err;
 736                 }
 737
 738                 journal_keys = journal_keys_sort(&journal_entries);
 739                 if (!journal_keys.d) {
 740                         ret = -ENOMEM;
 741                         goto err;
 742                 }
 743
 744                 j = &list_last_entry(&journal_entries,
 745                                      struct journal_replay, list)->j;
 746
 747                 ret = verify_superblock_clean(c, &clean, j);
 748                 if (ret)
 749                         goto err;
 750
 751                 journal_seq = le64_to_cpu(j->seq) + 1;
 752         } else {
 753                 journal_seq = le64_to_cpu(clean->journal_seq) + 1;
 754         }
 755
 756         ret = journal_replay_early(c, clean, &journal_entries);
 757         if (ret)
 758                 goto err;
 759
 760         if (!c->sb.clean) {
 761                 ret = bch2_journal_seq_blacklist_add(c,
 762                                                      journal_seq,
 763                                                      journal_seq + 4);
 764                 if (ret) {
 765                         bch_err(c, "error creating new journal seq blacklist entry");
 766                         goto err;
 767                 }
 768
 769                 journal_seq += 4;
 770         }
 771
 772         ret = bch2_blacklist_table_initialize(c);
 773
 774         if (!list_empty(&journal_entries)) {
 775                 ret = verify_journal_entries_not_blacklisted_or_missing(c,
 776                                                         &journal_entries);
 777                 if (ret)
 778                         goto err;
 779         }
 780
 781         ret = bch2_fs_journal_start(&c->journal, journal_seq,
 782                                     &journal_entries);
 783         if (ret)
 784                 goto err;
 785
 786         ret = read_btree_roots(c);
 787         if (ret)
 788                 goto err;
 789
 790         bch_verbose(c, "starting alloc read");
 791         err = "error reading allocation information";
 792         ret = bch2_alloc_read(c, &journal_keys);
 793         if (ret)
 794                 goto err;
 795         bch_verbose(c, "alloc read done");
 796
 797         bch_verbose(c, "starting stripes_read");
 798         err = "error reading stripes";
 799         ret = bch2_stripes_read(c, &journal_keys);
 800         if (ret)
 801                 goto err;
 802         bch_verbose(c, "stripes_read done");
 803
 804         set_bit(BCH_FS_ALLOC_READ_DONE, &c->flags);
 805
 806         if ((c->sb.compat & (1ULL << BCH_COMPAT_FEAT_ALLOC_INFO)) &&
 807             !(c->sb.compat & (1ULL << BCH_COMPAT_FEAT_ALLOC_METADATA))) {
 808                 /*
 809                  * interior btree node updates aren't consistent with the
 810                  * journal; after an unclean shutdown we have to walk all
 811                  * pointers to metadata:
 812                  */
 813                 bch_info(c, "starting metadata mark and sweep");
 814                 err = "error in mark and sweep";
 815                 ret = bch2_gc(c, NULL, true, true);
 816                 if (ret)
 817                         goto err;
 818                 bch_verbose(c, "mark and sweep done");
 819         }
 820
 821         if (c->opts.fsck ||
 822             !(c->sb.compat & (1ULL << BCH_COMPAT_FEAT_ALLOC_INFO)) ||
 823             test_bit(BCH_FS_REBUILD_REPLICAS, &c->flags)) {
 824                 bch_info(c, "starting mark and sweep");
 825                 err = "error in mark and sweep";
 826                 ret = bch2_gc(c, &journal_keys, true, false);
 827                 if (ret)
 828                         goto err;
 829                 bch_verbose(c, "mark and sweep done");
 830         }
 831
 832         clear_bit(BCH_FS_REBUILD_REPLICAS, &c->flags);
 833         set_bit(BCH_FS_INITIAL_GC_DONE, &c->flags);
 834
 835         /*
 836          * Skip past versions that might have possibly been used (as nonces),
 837          * but hadn't had their pointers written:
 838          */
 839         if (c->sb.encryption_type && !c->sb.clean)
 840                 atomic64_add(1 << 16, &c->key_version);
 841
 842         if (c->opts.norecovery)
 843                 goto out;
 844
 845         bch_verbose(c, "starting journal replay");
 846         err = "journal replay failed";
 847         ret = bch2_journal_replay(c, journal_keys);
 848         if (ret)
 849                 goto err;
 850         bch_verbose(c, "journal replay done");
 851
 852         if (!c->opts.nochanges) {
 853                 /*
 854                  * note that even when filesystem was clean there might be work
 855                  * to do here, if we ran gc (because of fsck) which recalculated
 856                  * oldest_gen:
 857                  */
 858                 bch_verbose(c, "writing allocation info");
 859                 err = "error writing out alloc info";
 860                 ret = bch2_stripes_write(c, BTREE_INSERT_LAZY_RW, &wrote) ?:
 861                         bch2_alloc_write(c, BTREE_INSERT_LAZY_RW, &wrote);
 862                 if (ret) {
 863                         bch_err(c, "error writing alloc info");
 864                         goto err;
 865                 }
 866                 bch_verbose(c, "alloc write done");
 867
 868                 set_bit(BCH_FS_ALLOC_WRITTEN, &c->flags);
 869         }
 870
 871         if (!c->sb.clean) {
 872                 if (!(c->sb.features & (1 << BCH_FEATURE_ATOMIC_NLINK))) {
 873                         bch_info(c, "checking inode link counts");
 874                         err = "error in recovery";
 875                         ret = bch2_fsck_inode_nlink(c);
 876                         if (ret)
 877                                 goto err;
 878                         bch_verbose(c, "check inodes done");
 879
 880                 } else {
 881                         bch_verbose(c, "checking for deleted inodes");
 882                         err = "error in recovery";
 883                         ret = bch2_fsck_walk_inodes_only(c);
 884                         if (ret)
 885                                 goto err;
 886                         bch_verbose(c, "check inodes done");
 887                 }
 888         }
 889
 890         if (c->opts.fsck) {
 891                 bch_info(c, "starting fsck");
 892                 err = "error in fsck";
 893                 ret = bch2_fsck_full(c);
 894                 if (ret)
 895                         goto err;
 896                 bch_verbose(c, "fsck done");
 897         }
 898
 899         if (enabled_qtypes(c)) {
 900                 bch_verbose(c, "reading quotas");
 901                 ret = bch2_fs_quota_read(c);
 902                 if (ret)
 903                         goto err;
 904                 bch_verbose(c, "quotas done");
 905         }
 906
 907         mutex_lock(&c->sb_lock);
 908         if (c->opts.version_upgrade) {
 909                 if (c->sb.version < bcachefs_metadata_version_new_versioning)
 910                         c->disk_sb.sb->version_min =
 911                                 le16_to_cpu(bcachefs_metadata_version_min);
 912                 c->disk_sb.sb->version = le16_to_cpu(bcachefs_metadata_version_current);
 913                 write_sb = true;
 914         }
 915
 916         if (!(c->sb.features & (1ULL << BCH_FEATURE_INLINE_DATA))) {
 917                 c->disk_sb.sb->features[0] |=
 918                         cpu_to_le64(1ULL << BCH_FEATURE_INLINE_DATA);
 919                 write_sb = true;
 920         }
 921
 922         if (!test_bit(BCH_FS_ERROR, &c->flags)) {
 923                 c->disk_sb.sb->compat[0] |= 1ULL << BCH_COMPAT_FEAT_ALLOC_INFO;
 924                 write_sb = true;
 925         }
 926
 927         if (c->opts.fsck &&
 928             !test_bit(BCH_FS_ERROR, &c->flags)) {
 929                 c->disk_sb.sb->features[0] |= 1ULL << BCH_FEATURE_ATOMIC_NLINK;
 930                 SET_BCH_SB_HAS_ERRORS(c->disk_sb.sb, 0);
 931                 write_sb = true;
 932         }
 933
 934         if (write_sb)
 935                 bch2_write_super(c);
 936         mutex_unlock(&c->sb_lock);
 937
 938         if (c->journal_seq_blacklist_table &&
 939             c->journal_seq_blacklist_table->nr > 128)
 940                 queue_work(system_long_wq, &c->journal_seq_blacklist_gc_work);
 941 out:
 942         ret = 0;
 943 err:
 944 fsck_err:
 945         set_bit(BCH_FS_FSCK_DONE, &c->flags);
 946         bch2_flush_fsck_errs(c);
 947
 948         journal_keys_free(&journal_keys);
 949         journal_entries_free(&journal_entries);
 950         kfree(clean);
 951         if (ret)
 952                 bch_err(c, "Error in recovery: %s (%i)", err, ret);
 953         else
 954                 bch_verbose(c, "ret %i", ret);
 955         return ret;
 956 }
 957
 958 int bch2_fs_initialize(struct bch_fs *c)
 959 {
 960         struct bch_inode_unpacked root_inode, lostfound_inode;
 961         struct bkey_inode_buf packed_inode;
 962         struct qstr lostfound = QSTR("lost+found");
 963         const char *err = "cannot allocate memory";
 964         struct bch_dev *ca;
 965         LIST_HEAD(journal);
 966         unsigned i;
 967         int ret;
 968
 969         bch_notice(c, "initializing new filesystem");
 970
 971         mutex_lock(&c->sb_lock);
 972         for_each_online_member(ca, c, i)
 973                 bch2_mark_dev_superblock(c, ca, 0);
 974         mutex_unlock(&c->sb_lock);
 975
 976         set_bit(BCH_FS_ALLOC_READ_DONE, &c->flags);
 977         set_bit(BCH_FS_INITIAL_GC_DONE, &c->flags);
 978
 979         for (i = 0; i < BTREE_ID_NR; i++)
 980                 bch2_btree_root_alloc(c, i);
 981
 982         err = "unable to allocate journal buckets";
 983         for_each_online_member(ca, c, i) {
 984                 ret = bch2_dev_journal_alloc(ca);
 985                 if (ret) {
 986                         percpu_ref_put(&ca->io_ref);
 987                         goto err;
 988                 }
 989         }
 990
 991         /*
 992          * journal_res_get() will crash if called before this has
 993          * set up the journal.pin FIFO and journal.cur pointer:
 994          */
 995         bch2_fs_journal_start(&c->journal, 1, &journal);
 996         bch2_journal_set_replay_done(&c->journal);
 997
 998         err = "error going read write";
 999         ret = __bch2_fs_read_write(c, true);
1000         if (ret)
1001                 goto err;
1002
1003         bch2_inode_init(c, &root_inode, 0, 0,
1004                         S_IFDIR|S_IRWXU|S_IRUGO|S_IXUGO, 0, NULL);
1005         root_inode.bi_inum = BCACHEFS_ROOT_INO;
1006         bch2_inode_pack(&packed_inode, &root_inode);
1007
1008         err = "error creating root directory";
1009         ret = bch2_btree_insert(c, BTREE_ID_INODES,
1010                                 &packed_inode.inode.k_i,
1011                                 NULL, NULL, 0);
1012         if (ret)
1013                 goto err;
1014
1015         bch2_inode_init_early(c, &lostfound_inode);
1016
1017         err = "error creating lost+found";
1018         ret = bch2_trans_do(c, NULL, BTREE_INSERT_ATOMIC,
1019                 bch2_create_trans(&trans, BCACHEFS_ROOT_INO,
1020                                   &root_inode, &lostfound_inode,
1021                                   &lostfound,
1022                                   0, 0, S_IFDIR|0700, 0,
1023                                   NULL, NULL));
1024         if (ret)
1025                 goto err;
1026
1027         if (enabled_qtypes(c)) {
1028                 ret = bch2_fs_quota_read(c);
1029                 if (ret)
1030                         goto err;
1031         }
1032
1033         err = "error writing first journal entry";
1034         ret = bch2_journal_meta(&c->journal);
1035         if (ret)
1036                 goto err;
1037
1038         mutex_lock(&c->sb_lock);
1039         c->disk_sb.sb->version = c->disk_sb.sb->version_min =
1040                 le16_to_cpu(bcachefs_metadata_version_current);
1041         c->disk_sb.sb->features[0] |= 1ULL << BCH_FEATURE_ATOMIC_NLINK;
1042
1043         SET_BCH_SB_INITIALIZED(c->disk_sb.sb, true);
1044         SET_BCH_SB_CLEAN(c->disk_sb.sb, false);
1045
1046         bch2_write_super(c);
1047         mutex_unlock(&c->sb_lock);
1048
1049         return 0;
1050 err:
1051         pr_err("Error initializing new filesystem: %s (%i)", err, ret);
1052         return ret;
1053 }