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 "bkey_buf.h"
   5 #include "alloc_background.h"
   6 #include "btree_gc.h"
   7 #include "btree_update.h"
   8 #include "btree_update_interior.h"
   9 #include "btree_io.h"
  10 #include "buckets.h"
  11 #include "dirent.h"
  12 #include "ec.h"
  13 #include "error.h"
  14 #include "fs-common.h"
  15 #include "fsck.h"
  16 #include "journal_io.h"
  17 #include "journal_reclaim.h"
  18 #include "journal_seq_blacklist.h"
  19 #include "lru.h"
  20 #include "move.h"
  21 #include "quota.h"
  22 #include "recovery.h"
  23 #include "replicas.h"
  24 #include "subvolume.h"
  25 #include "super-io.h"
  26
  27 #include <linux/sort.h>
  28 #include <linux/stat.h>
  29
  30 #define QSTR(n) { { { .len = strlen(n) } }, .name = n }
  31
  32 /* for -o reconstruct_alloc: */
  33 static void drop_alloc_keys(struct journal_keys *keys)
  34 {
  35         size_t src, dst;
  36
  37         for (src = 0, dst = 0; src < keys->nr; src++)
  38                 if (keys->d[src].btree_id != BTREE_ID_alloc)
  39                         keys->d[dst++] = keys->d[src];
  40
  41         keys->nr = dst;
  42 }
  43
  44 /*
  45  * Btree node pointers have a field to stack a pointer to the in memory btree
  46  * node; we need to zero out this field when reading in btree nodes, or when
  47  * reading in keys from the journal:
  48  */
  49 static void zero_out_btree_mem_ptr(struct journal_keys *keys)
  50 {
  51         struct journal_key *i;
  52
  53         for (i = keys->d; i < keys->d + keys->nr; i++)
  54                 if (i->k->k.type == KEY_TYPE_btree_ptr_v2)
  55                         bkey_i_to_btree_ptr_v2(i->k)->v.mem_ptr = 0;
  56 }
  57
  58 /* iterate over keys read from the journal: */
  59
  60 static int __journal_key_cmp(enum btree_id      l_btree_id,
  61                              unsigned           l_level,
  62                              struct bpos        l_pos,
  63                              const struct journal_key *r)
  64 {
  65         return (cmp_int(l_btree_id,     r->btree_id) ?:
  66                 cmp_int(l_level,        r->level) ?:
  67                 bpos_cmp(l_pos, r->k->k.p));
  68 }
  69
  70 static int journal_key_cmp(const struct journal_key *l, const struct journal_key *r)
  71 {
  72         return __journal_key_cmp(l->btree_id, l->level, l->k->k.p, r);
  73 }
  74
  75 static inline size_t idx_to_pos(struct journal_keys *keys, size_t idx)
  76 {
  77         size_t gap_size = keys->size - keys->nr;
  78
  79         if (idx >= keys->gap)
  80                 idx += gap_size;
  81         return idx;
  82 }
  83
  84 static inline struct journal_key *idx_to_key(struct journal_keys *keys, size_t idx)
  85 {
  86         return keys->d + idx_to_pos(keys, idx);
  87 }
  88
  89 size_t bch2_journal_key_search(struct journal_keys *keys,
  90                                enum btree_id id, unsigned level,
  91                                struct bpos pos)
  92 {
  93         size_t l = 0, r = keys->nr, m;
  94
  95         while (l < r) {
  96                 m = l + ((r - l) >> 1);
  97                 if (__journal_key_cmp(id, level, pos, idx_to_key(keys, m)) > 0)
  98                         l = m + 1;
  99                 else
 100                         r = m;
 101         }
 102
 103         BUG_ON(l < keys->nr &&
 104                __journal_key_cmp(id, level, pos, idx_to_key(keys, l)) > 0);
 105
 106         BUG_ON(l &&
 107                __journal_key_cmp(id, level, pos, idx_to_key(keys, l - 1)) <= 0);
 108
 109         return idx_to_pos(keys, l);
 110 }
 111
 112 struct bkey_i *bch2_journal_keys_peek(struct bch_fs *c, enum btree_id btree_id,
 113                                       unsigned level, struct bpos pos)
 114 {
 115         struct journal_keys *keys = &c->journal_keys;
 116         size_t idx = bch2_journal_key_search(keys, btree_id, level, pos);
 117
 118         while (idx < keys->size &&
 119                keys->d[idx].overwritten) {
 120                 idx++;
 121                 if (idx == keys->gap)
 122                         idx += keys->size - keys->nr;
 123         }
 124
 125         if (idx < keys->size &&
 126             keys->d[idx].btree_id == btree_id &&
 127             keys->d[idx].level == level)
 128                 return keys->d[idx].k;
 129         return NULL;
 130 }
 131
 132 static void journal_iters_fix(struct bch_fs *c)
 133 {
 134         struct journal_keys *keys = &c->journal_keys;
 135         /* The key we just inserted is immediately before the gap: */
 136         struct journal_key *n = &keys->d[keys->gap - 1];
 137         size_t gap_end = keys->gap + (keys->size - keys->nr);
 138         struct btree_and_journal_iter *iter;
 139
 140         /*
 141          * If an iterator points one after the key we just inserted,
 142          * and the key we just inserted compares >= the iterator's position,
 143          * decrement the iterator so it points at the key we just inserted:
 144          */
 145         list_for_each_entry(iter, &c->journal_iters, journal.list)
 146                 if (iter->journal.idx == gap_end &&
 147                     iter->last &&
 148                     iter->b->c.btree_id == n->btree_id &&
 149                     iter->b->c.level    == n->level &&
 150                     bpos_cmp(n->k->k.p, iter->unpacked.p) >= 0)
 151                         iter->journal.idx = keys->gap - 1;
 152 }
 153
 154 static void journal_iters_move_gap(struct bch_fs *c, size_t old_gap, size_t new_gap)
 155 {
 156         struct journal_keys *keys = &c->journal_keys;
 157         struct journal_iter *iter;
 158         size_t gap_size = keys->size - keys->nr;
 159
 160         list_for_each_entry(iter, &c->journal_iters, list) {
 161                 if (iter->idx > old_gap)
 162                         iter->idx -= gap_size;
 163                 if (iter->idx >= new_gap)
 164                         iter->idx += gap_size;
 165         }
 166 }
 167
 168 int bch2_journal_key_insert_take(struct bch_fs *c, enum btree_id id,
 169                                  unsigned level, struct bkey_i *k)
 170 {
 171         struct journal_key n = {
 172                 .btree_id       = id,
 173                 .level          = level,
 174                 .k              = k,
 175                 .allocated      = true,
 176                 /*
 177                  * Ensure these keys are done last by journal replay, to unblock
 178                  * journal reclaim:
 179                  */
 180                 .journal_seq    = U32_MAX,
 181         };
 182         struct journal_keys *keys = &c->journal_keys;
 183         size_t idx = bch2_journal_key_search(keys, id, level, k->k.p);
 184
 185         BUG_ON(test_bit(BCH_FS_RW, &c->flags));
 186
 187         if (idx < keys->size &&
 188             journal_key_cmp(&n, &keys->d[idx]) == 0) {
 189                 if (keys->d[idx].allocated)
 190                         kfree(keys->d[idx].k);
 191                 keys->d[idx] = n;
 192                 return 0;
 193         }
 194
 195         if (idx > keys->gap)
 196                 idx -= keys->size - keys->nr;
 197
 198         if (keys->nr == keys->size) {
 199                 struct journal_keys new_keys = {
 200                         .nr                     = keys->nr,
 201                         .size                   = keys->size * 2,
 202                         .journal_seq_base       = keys->journal_seq_base,
 203                 };
 204
 205                 new_keys.d = kvmalloc(sizeof(new_keys.d[0]) * new_keys.size, GFP_KERNEL);
 206                 if (!new_keys.d) {
 207                         bch_err(c, "%s: error allocating new key array (size %zu)",
 208                                 __func__, new_keys.size);
 209                         return -ENOMEM;
 210                 }
 211
 212                 /* Since @keys was full, there was no gap: */
 213                 memcpy(new_keys.d, keys->d, sizeof(keys->d[0]) * keys->nr);
 214                 kvfree(keys->d);
 215                 *keys = new_keys;
 216
 217                 /* And now the gap is at the end: */
 218                 keys->gap = keys->nr;
 219         }
 220
 221         journal_iters_move_gap(c, keys->gap, idx);
 222
 223         move_gap(keys->d, keys->nr, keys->size, keys->gap, idx);
 224         keys->gap = idx;
 225
 226         keys->nr++;
 227         keys->d[keys->gap++] = n;
 228
 229         journal_iters_fix(c);
 230
 231         return 0;
 232 }
 233
 234 /*
 235  * Can only be used from the recovery thread while we're still RO - can't be
 236  * used once we've got RW, as journal_keys is at that point used by multiple
 237  * threads:
 238  */
 239 int bch2_journal_key_insert(struct bch_fs *c, enum btree_id id,
 240                             unsigned level, struct bkey_i *k)
 241 {
 242         struct bkey_i *n;
 243         int ret;
 244
 245         n = kmalloc(bkey_bytes(&k->k), GFP_KERNEL);
 246         if (!n)
 247                 return -ENOMEM;
 248
 249         bkey_copy(n, k);
 250         ret = bch2_journal_key_insert_take(c, id, level, n);
 251         if (ret)
 252                 kfree(n);
 253         return ret;
 254 }
 255
 256 int bch2_journal_key_delete(struct bch_fs *c, enum btree_id id,
 257                             unsigned level, struct bpos pos)
 258 {
 259         struct bkey_i whiteout;
 260
 261         bkey_init(&whiteout.k);
 262         whiteout.k.p = pos;
 263
 264         return bch2_journal_key_insert(c, id, level, &whiteout);
 265 }
 266
 267 void bch2_journal_key_overwritten(struct bch_fs *c, enum btree_id btree,
 268                                   unsigned level, struct bpos pos)
 269 {
 270         struct journal_keys *keys = &c->journal_keys;
 271         size_t idx = bch2_journal_key_search(keys, btree, level, pos);
 272
 273         if (idx < keys->size &&
 274             keys->d[idx].btree_id       == btree &&
 275             keys->d[idx].level          == level &&
 276             !bpos_cmp(keys->d[idx].k->k.p, pos))
 277                 keys->d[idx].overwritten = true;
 278 }
 279
 280 static struct bkey_i *bch2_journal_iter_peek(struct journal_iter *iter)
 281 {
 282         struct journal_key *k = iter->keys->d + iter->idx;
 283
 284         while (k < iter->keys->d + iter->keys->nr &&
 285                k->btree_id      == iter->btree_id &&
 286                k->level         == iter->level) {
 287                 if (!k->overwritten)
 288                         return k->k;
 289
 290                 iter->idx++;
 291                 k = iter->keys->d + iter->idx;
 292         }
 293
 294         return NULL;
 295 }
 296
 297 static void bch2_journal_iter_advance(struct journal_iter *iter)
 298 {
 299         if (iter->idx < iter->keys->size) {
 300                 iter->idx++;
 301                 if (iter->idx == iter->keys->gap)
 302                         iter->idx += iter->keys->size - iter->keys->nr;
 303         }
 304 }
 305
 306 static void bch2_journal_iter_exit(struct journal_iter *iter)
 307 {
 308         list_del(&iter->list);
 309 }
 310
 311 static void bch2_journal_iter_init(struct bch_fs *c,
 312                                    struct journal_iter *iter,
 313                                    enum btree_id id, unsigned level,
 314                                    struct bpos pos)
 315 {
 316         iter->btree_id  = id;
 317         iter->level     = level;
 318         iter->keys      = &c->journal_keys;
 319         iter->idx       = bch2_journal_key_search(&c->journal_keys, id, level, pos);
 320 }
 321
 322 static struct bkey_s_c bch2_journal_iter_peek_btree(struct btree_and_journal_iter *iter)
 323 {
 324         return bch2_btree_node_iter_peek_unpack(&iter->node_iter,
 325                                                 iter->b, &iter->unpacked);
 326 }
 327
 328 static void bch2_journal_iter_advance_btree(struct btree_and_journal_iter *iter)
 329 {
 330         bch2_btree_node_iter_advance(&iter->node_iter, iter->b);
 331 }
 332
 333 void bch2_btree_and_journal_iter_advance(struct btree_and_journal_iter *iter)
 334 {
 335         switch (iter->last) {
 336         case none:
 337                 break;
 338         case btree:
 339                 bch2_journal_iter_advance_btree(iter);
 340                 break;
 341         case journal:
 342                 bch2_journal_iter_advance(&iter->journal);
 343                 break;
 344         }
 345
 346         iter->last = none;
 347 }
 348
 349 struct bkey_s_c bch2_btree_and_journal_iter_peek(struct btree_and_journal_iter *iter)
 350 {
 351         struct bkey_s_c ret;
 352
 353         while (1) {
 354                 struct bkey_s_c btree_k         =
 355                         bch2_journal_iter_peek_btree(iter);
 356                 struct bkey_s_c journal_k       =
 357                         bkey_i_to_s_c(bch2_journal_iter_peek(&iter->journal));
 358
 359                 if (btree_k.k && journal_k.k) {
 360                         int cmp = bpos_cmp(btree_k.k->p, journal_k.k->p);
 361
 362                         if (!cmp)
 363                                 bch2_journal_iter_advance_btree(iter);
 364
 365                         iter->last = cmp < 0 ? btree : journal;
 366                 } else if (btree_k.k) {
 367                         iter->last = btree;
 368                 } else if (journal_k.k) {
 369                         iter->last = journal;
 370                 } else {
 371                         iter->last = none;
 372                         return bkey_s_c_null;
 373                 }
 374
 375                 ret = iter->last == journal ? journal_k : btree_k;
 376
 377                 if (iter->b &&
 378                     bpos_cmp(ret.k->p, iter->b->data->max_key) > 0) {
 379                         iter->journal.idx = iter->journal.keys->nr;
 380                         iter->last = none;
 381                         return bkey_s_c_null;
 382                 }
 383
 384                 if (!bkey_deleted(ret.k))
 385                         break;
 386
 387                 bch2_btree_and_journal_iter_advance(iter);
 388         }
 389
 390         return ret;
 391 }
 392
 393 struct bkey_s_c bch2_btree_and_journal_iter_next(struct btree_and_journal_iter *iter)
 394 {
 395         bch2_btree_and_journal_iter_advance(iter);
 396
 397         return bch2_btree_and_journal_iter_peek(iter);
 398 }
 399
 400 void bch2_btree_and_journal_iter_exit(struct btree_and_journal_iter *iter)
 401 {
 402         bch2_journal_iter_exit(&iter->journal);
 403 }
 404
 405 void __bch2_btree_and_journal_iter_init_node_iter(struct btree_and_journal_iter *iter,
 406                                                   struct bch_fs *c,
 407                                                   struct btree *b,
 408                                                   struct btree_node_iter node_iter,
 409                                                   struct bpos pos)
 410 {
 411         memset(iter, 0, sizeof(*iter));
 412
 413         iter->b = b;
 414         iter->node_iter = node_iter;
 415         bch2_journal_iter_init(c, &iter->journal, b->c.btree_id, b->c.level, pos);
 416         INIT_LIST_HEAD(&iter->journal.list);
 417 }
 418
 419 /*
 420  * this version is used by btree_gc before filesystem has gone RW and
 421  * multithreaded, so uses the journal_iters list:
 422  */
 423 void bch2_btree_and_journal_iter_init_node_iter(struct btree_and_journal_iter *iter,
 424                                                 struct bch_fs *c,
 425                                                 struct btree *b)
 426 {
 427         struct btree_node_iter node_iter;
 428
 429         bch2_btree_node_iter_init_from_start(&node_iter, b);
 430         __bch2_btree_and_journal_iter_init_node_iter(iter, c, b, node_iter, b->data->min_key);
 431         list_add(&iter->journal.list, &c->journal_iters);
 432 }
 433
 434 /* sort and dedup all keys in the journal: */
 435
 436 void bch2_journal_entries_free(struct list_head *list)
 437 {
 438
 439         while (!list_empty(list)) {
 440                 struct journal_replay *i =
 441                         list_first_entry(list, struct journal_replay, list);
 442                 list_del(&i->list);
 443                 kvpfree(i, offsetof(struct journal_replay, j) +
 444                         vstruct_bytes(&i->j));
 445         }
 446 }
 447
 448 /*
 449  * When keys compare equal, oldest compares first:
 450  */
 451 static int journal_sort_key_cmp(const void *_l, const void *_r)
 452 {
 453         const struct journal_key *l = _l;
 454         const struct journal_key *r = _r;
 455
 456         return  journal_key_cmp(l, r) ?:
 457                 cmp_int(l->journal_seq, r->journal_seq) ?:
 458                 cmp_int(l->journal_offset, r->journal_offset);
 459 }
 460
 461 void bch2_journal_keys_free(struct journal_keys *keys)
 462 {
 463         struct journal_key *i;
 464
 465         move_gap(keys->d, keys->nr, keys->size, keys->gap, keys->nr);
 466         keys->gap = keys->nr;
 467
 468         for (i = keys->d; i < keys->d + keys->nr; i++)
 469                 if (i->allocated)
 470                         kfree(i->k);
 471
 472         kvfree(keys->d);
 473         keys->d = NULL;
 474         keys->nr = keys->gap = keys->size = 0;
 475 }
 476
 477 static struct journal_keys journal_keys_sort(struct list_head *journal_entries)
 478 {
 479         struct journal_replay *i;
 480         struct jset_entry *entry;
 481         struct bkey_i *k, *_n;
 482         struct journal_keys keys = { NULL };
 483         struct journal_key *src, *dst;
 484         size_t nr_keys = 0;
 485
 486         if (list_empty(journal_entries))
 487                 return keys;
 488
 489         list_for_each_entry(i, journal_entries, list) {
 490                 if (i->ignore)
 491                         continue;
 492
 493                 if (!keys.journal_seq_base)
 494                         keys.journal_seq_base = le64_to_cpu(i->j.seq);
 495
 496                 for_each_jset_key(k, _n, entry, &i->j)
 497                         nr_keys++;
 498         }
 499
 500         keys.size = roundup_pow_of_two(nr_keys);
 501
 502         keys.d = kvmalloc(sizeof(keys.d[0]) * keys.size, GFP_KERNEL);
 503         if (!keys.d)
 504                 goto err;
 505
 506         list_for_each_entry(i, journal_entries, list) {
 507                 if (i->ignore)
 508                         continue;
 509
 510                 BUG_ON(le64_to_cpu(i->j.seq) - keys.journal_seq_base > U32_MAX);
 511
 512                 for_each_jset_key(k, _n, entry, &i->j)
 513                         keys.d[keys.nr++] = (struct journal_key) {
 514                                 .btree_id       = entry->btree_id,
 515                                 .level          = entry->level,
 516                                 .k              = k,
 517                                 .journal_seq    = le64_to_cpu(i->j.seq) -
 518                                         keys.journal_seq_base,
 519                                 .journal_offset = k->_data - i->j._data,
 520                         };
 521         }
 522
 523         sort(keys.d, keys.nr, sizeof(keys.d[0]), journal_sort_key_cmp, NULL);
 524
 525         src = dst = keys.d;
 526         while (src < keys.d + keys.nr) {
 527                 while (src + 1 < keys.d + keys.nr &&
 528                        src[0].btree_id  == src[1].btree_id &&
 529                        src[0].level     == src[1].level &&
 530                        !bpos_cmp(src[0].k->k.p, src[1].k->k.p))
 531                         src++;
 532
 533                 *dst++ = *src++;
 534         }
 535
 536         keys.nr = dst - keys.d;
 537         keys.gap = keys.nr;
 538 err:
 539         return keys;
 540 }
 541
 542 /* journal replay: */
 543
 544 static void replay_now_at(struct journal *j, u64 seq)
 545 {
 546         BUG_ON(seq < j->replay_journal_seq);
 547         BUG_ON(seq > j->replay_journal_seq_end);
 548
 549         while (j->replay_journal_seq < seq)
 550                 bch2_journal_pin_put(j, j->replay_journal_seq++);
 551 }
 552
 553 static int bch2_journal_replay_key(struct btree_trans *trans,
 554                                    struct journal_key *k)
 555 {
 556         struct btree_iter iter;
 557         unsigned iter_flags =
 558                 BTREE_ITER_INTENT|
 559                 BTREE_ITER_NOT_EXTENTS;
 560         int ret;
 561
 562         if (!k->level && k->btree_id == BTREE_ID_alloc)
 563                 iter_flags |= BTREE_ITER_CACHED;
 564
 565         bch2_trans_node_iter_init(trans, &iter, k->btree_id, k->k->k.p,
 566                                   BTREE_MAX_DEPTH, k->level,
 567                                   iter_flags);
 568         ret = bch2_btree_iter_traverse(&iter);
 569         if (ret)
 570                 goto out;
 571
 572         /* Must be checked with btree locked: */
 573         if (k->overwritten)
 574                 goto out;
 575
 576         ret = bch2_trans_update(trans, &iter, k->k, BTREE_TRIGGER_NORUN);
 577 out:
 578         bch2_trans_iter_exit(trans, &iter);
 579         return ret;
 580 }
 581
 582 static int journal_sort_seq_cmp(const void *_l, const void *_r)
 583 {
 584         const struct journal_key *l = *((const struct journal_key **)_l);
 585         const struct journal_key *r = *((const struct journal_key **)_r);
 586
 587         return cmp_int(l->journal_seq, r->journal_seq);
 588 }
 589
 590 static int bch2_journal_replay(struct bch_fs *c)
 591 {
 592         struct journal_keys *keys = &c->journal_keys;
 593         struct journal_key **keys_sorted, *k;
 594         struct journal *j = &c->journal;
 595         size_t i;
 596         int ret;
 597
 598         move_gap(keys->d, keys->nr, keys->size, keys->gap, keys->nr);
 599         keys->gap = keys->nr;
 600
 601         keys_sorted = kvmalloc_array(sizeof(*keys_sorted), keys->nr, GFP_KERNEL);
 602         if (!keys_sorted)
 603                 return -ENOMEM;
 604
 605         for (i = 0; i < keys->nr; i++)
 606                 keys_sorted[i] = &keys->d[i];
 607
 608         sort(keys_sorted, keys->nr,
 609              sizeof(keys_sorted[0]),
 610              journal_sort_seq_cmp, NULL);
 611
 612         if (keys->nr)
 613                 replay_now_at(j, keys->journal_seq_base);
 614
 615         for (i = 0; i < keys->nr; i++) {
 616                 k = keys_sorted[i];
 617
 618                 cond_resched();
 619
 620                 if (!k->allocated)
 621                         replay_now_at(j, keys->journal_seq_base + k->journal_seq);
 622
 623                 ret = bch2_trans_do(c, NULL, NULL,
 624                                     BTREE_INSERT_LAZY_RW|
 625                                     BTREE_INSERT_NOFAIL|
 626                                     (!k->allocated
 627                                      ? BTREE_INSERT_JOURNAL_REPLAY|JOURNAL_WATERMARK_reserved
 628                                      : 0),
 629                              bch2_journal_replay_key(&trans, k));
 630                 if (ret) {
 631                         bch_err(c, "journal replay: error %d while replaying key at btree %s level %u",
 632                                 ret, bch2_btree_ids[k->btree_id], k->level);
 633                         goto err;
 634                 }
 635         }
 636
 637         replay_now_at(j, j->replay_journal_seq_end);
 638         j->replay_journal_seq = 0;
 639
 640         bch2_journal_set_replay_done(j);
 641         bch2_journal_flush_all_pins(j);
 642         ret = bch2_journal_error(j);
 643
 644         if (keys->nr && !ret)
 645                 bch2_journal_log_msg(&c->journal, "journal replay finished");
 646 err:
 647         kvfree(keys_sorted);
 648         return ret;
 649 }
 650
 651 /* journal replay early: */
 652
 653 static int journal_replay_entry_early(struct bch_fs *c,
 654                                       struct jset_entry *entry)
 655 {
 656         int ret = 0;
 657
 658         switch (entry->type) {
 659         case BCH_JSET_ENTRY_btree_root: {
 660                 struct btree_root *r;
 661
 662                 if (entry->btree_id >= BTREE_ID_NR) {
 663                         bch_err(c, "filesystem has unknown btree type %u",
 664                                 entry->btree_id);
 665                         return -EINVAL;
 666                 }
 667
 668                 r = &c->btree_roots[entry->btree_id];
 669
 670                 if (entry->u64s) {
 671                         r->level = entry->level;
 672                         bkey_copy(&r->key, &entry->start[0]);
 673                         r->error = 0;
 674                 } else {
 675                         r->error = -EIO;
 676                 }
 677                 r->alive = true;
 678                 break;
 679         }
 680         case BCH_JSET_ENTRY_usage: {
 681                 struct jset_entry_usage *u =
 682                         container_of(entry, struct jset_entry_usage, entry);
 683
 684                 switch (entry->btree_id) {
 685                 case BCH_FS_USAGE_reserved:
 686                         if (entry->level < BCH_REPLICAS_MAX)
 687                                 c->usage_base->persistent_reserved[entry->level] =
 688                                         le64_to_cpu(u->v);
 689                         break;
 690                 case BCH_FS_USAGE_inodes:
 691                         c->usage_base->nr_inodes = le64_to_cpu(u->v);
 692                         break;
 693                 case BCH_FS_USAGE_key_version:
 694                         atomic64_set(&c->key_version,
 695                                      le64_to_cpu(u->v));
 696                         break;
 697                 }
 698
 699                 break;
 700         }
 701         case BCH_JSET_ENTRY_data_usage: {
 702                 struct jset_entry_data_usage *u =
 703                         container_of(entry, struct jset_entry_data_usage, entry);
 704
 705                 ret = bch2_replicas_set_usage(c, &u->r,
 706                                               le64_to_cpu(u->v));
 707                 break;
 708         }
 709         case BCH_JSET_ENTRY_dev_usage: {
 710                 struct jset_entry_dev_usage *u =
 711                         container_of(entry, struct jset_entry_dev_usage, entry);
 712                 struct bch_dev *ca = bch_dev_bkey_exists(c, le32_to_cpu(u->dev));
 713                 unsigned i, nr_types = jset_entry_dev_usage_nr_types(u);
 714
 715                 ca->usage_base->buckets_ec              = le64_to_cpu(u->buckets_ec);
 716
 717                 for (i = 0; i < min_t(unsigned, nr_types, BCH_DATA_NR); i++) {
 718                         ca->usage_base->d[i].buckets    = le64_to_cpu(u->d[i].buckets);
 719                         ca->usage_base->d[i].sectors    = le64_to_cpu(u->d[i].sectors);
 720                         ca->usage_base->d[i].fragmented = le64_to_cpu(u->d[i].fragmented);
 721                 }
 722
 723                 break;
 724         }
 725         case BCH_JSET_ENTRY_blacklist: {
 726                 struct jset_entry_blacklist *bl_entry =
 727                         container_of(entry, struct jset_entry_blacklist, entry);
 728
 729                 ret = bch2_journal_seq_blacklist_add(c,
 730                                 le64_to_cpu(bl_entry->seq),
 731                                 le64_to_cpu(bl_entry->seq) + 1);
 732                 break;
 733         }
 734         case BCH_JSET_ENTRY_blacklist_v2: {
 735                 struct jset_entry_blacklist_v2 *bl_entry =
 736                         container_of(entry, struct jset_entry_blacklist_v2, entry);
 737
 738                 ret = bch2_journal_seq_blacklist_add(c,
 739                                 le64_to_cpu(bl_entry->start),
 740                                 le64_to_cpu(bl_entry->end) + 1);
 741                 break;
 742         }
 743         case BCH_JSET_ENTRY_clock: {
 744                 struct jset_entry_clock *clock =
 745                         container_of(entry, struct jset_entry_clock, entry);
 746
 747                 atomic64_set(&c->io_clock[clock->rw].now, le64_to_cpu(clock->time));
 748         }
 749         }
 750
 751         return ret;
 752 }
 753
 754 static int journal_replay_early(struct bch_fs *c,
 755                                 struct bch_sb_field_clean *clean,
 756                                 struct list_head *journal)
 757 {
 758         struct journal_replay *i;
 759         struct jset_entry *entry;
 760         int ret;
 761
 762         if (clean) {
 763                 for (entry = clean->start;
 764                      entry != vstruct_end(&clean->field);
 765                      entry = vstruct_next(entry)) {
 766                         ret = journal_replay_entry_early(c, entry);
 767                         if (ret)
 768                                 return ret;
 769                 }
 770         } else {
 771                 list_for_each_entry(i, journal, list) {
 772                         if (i->ignore)
 773                                 continue;
 774
 775                         vstruct_for_each(&i->j, entry) {
 776                                 ret = journal_replay_entry_early(c, entry);
 777                                 if (ret)
 778                                         return ret;
 779                         }
 780                 }
 781         }
 782
 783         bch2_fs_usage_initialize(c);
 784
 785         return 0;
 786 }
 787
 788 /* sb clean section: */
 789
 790 static struct bkey_i *btree_root_find(struct bch_fs *c,
 791                                       struct bch_sb_field_clean *clean,
 792                                       struct jset *j,
 793                                       enum btree_id id, unsigned *level)
 794 {
 795         struct bkey_i *k;
 796         struct jset_entry *entry, *start, *end;
 797
 798         if (clean) {
 799                 start = clean->start;
 800                 end = vstruct_end(&clean->field);
 801         } else {
 802                 start = j->start;
 803                 end = vstruct_last(j);
 804         }
 805
 806         for (entry = start; entry < end; entry = vstruct_next(entry))
 807                 if (entry->type == BCH_JSET_ENTRY_btree_root &&
 808                     entry->btree_id == id)
 809                         goto found;
 810
 811         return NULL;
 812 found:
 813         if (!entry->u64s)
 814                 return ERR_PTR(-EINVAL);
 815
 816         k = entry->start;
 817         *level = entry->level;
 818         return k;
 819 }
 820
 821 static int verify_superblock_clean(struct bch_fs *c,
 822                                    struct bch_sb_field_clean **cleanp,
 823                                    struct jset *j)
 824 {
 825         unsigned i;
 826         struct bch_sb_field_clean *clean = *cleanp;
 827         struct printbuf buf1 = PRINTBUF;
 828         struct printbuf buf2 = PRINTBUF;
 829         int ret = 0;
 830
 831         if (mustfix_fsck_err_on(j->seq != clean->journal_seq, c,
 832                         "superblock journal seq (%llu) doesn't match journal (%llu) after clean shutdown",
 833                         le64_to_cpu(clean->journal_seq),
 834                         le64_to_cpu(j->seq))) {
 835                 kfree(clean);
 836                 *cleanp = NULL;
 837                 return 0;
 838         }
 839
 840         for (i = 0; i < BTREE_ID_NR; i++) {
 841                 struct bkey_i *k1, *k2;
 842                 unsigned l1 = 0, l2 = 0;
 843
 844                 k1 = btree_root_find(c, clean, NULL, i, &l1);
 845                 k2 = btree_root_find(c, NULL, j, i, &l2);
 846
 847                 if (!k1 && !k2)
 848                         continue;
 849
 850                 printbuf_reset(&buf1);
 851                 printbuf_reset(&buf2);
 852
 853                 if (k1)
 854                         bch2_bkey_val_to_text(&buf1, c, bkey_i_to_s_c(k1));
 855                 else
 856                         pr_buf(&buf1, "(none)");
 857
 858                 if (k2)
 859                         bch2_bkey_val_to_text(&buf2, c, bkey_i_to_s_c(k2));
 860                 else
 861                         pr_buf(&buf2, "(none)");
 862
 863                 mustfix_fsck_err_on(!k1 || !k2 ||
 864                                     IS_ERR(k1) ||
 865                                     IS_ERR(k2) ||
 866                                     k1->k.u64s != k2->k.u64s ||
 867                                     memcmp(k1, k2, bkey_bytes(k1)) ||
 868                                     l1 != l2, c,
 869                         "superblock btree root %u doesn't match journal after clean shutdown\n"
 870                         "sb:      l=%u %s\n"
 871                         "journal: l=%u %s\n", i,
 872                         l1, buf1.buf,
 873                         l2, buf2.buf);
 874         }
 875 fsck_err:
 876         printbuf_exit(&buf2);
 877         printbuf_exit(&buf1);
 878         return ret;
 879 }
 880
 881 static struct bch_sb_field_clean *read_superblock_clean(struct bch_fs *c)
 882 {
 883         struct bch_sb_field_clean *clean, *sb_clean;
 884         int ret;
 885
 886         mutex_lock(&c->sb_lock);
 887         sb_clean = bch2_sb_get_clean(c->disk_sb.sb);
 888
 889         if (fsck_err_on(!sb_clean, c,
 890                         "superblock marked clean but clean section not present")) {
 891                 SET_BCH_SB_CLEAN(c->disk_sb.sb, false);
 892                 c->sb.clean = false;
 893                 mutex_unlock(&c->sb_lock);
 894                 return NULL;
 895         }
 896
 897         clean = kmemdup(sb_clean, vstruct_bytes(&sb_clean->field),
 898                         GFP_KERNEL);
 899         if (!clean) {
 900                 mutex_unlock(&c->sb_lock);
 901                 return ERR_PTR(-ENOMEM);
 902         }
 903
 904         ret = bch2_sb_clean_validate_late(c, clean, READ);
 905         if (ret) {
 906                 mutex_unlock(&c->sb_lock);
 907                 return ERR_PTR(ret);
 908         }
 909
 910         mutex_unlock(&c->sb_lock);
 911
 912         return clean;
 913 fsck_err:
 914         mutex_unlock(&c->sb_lock);
 915         return ERR_PTR(ret);
 916 }
 917
 918 static int read_btree_roots(struct bch_fs *c)
 919 {
 920         unsigned i;
 921         int ret = 0;
 922
 923         for (i = 0; i < BTREE_ID_NR; i++) {
 924                 struct btree_root *r = &c->btree_roots[i];
 925
 926                 if (!r->alive)
 927                         continue;
 928
 929                 if (i == BTREE_ID_alloc &&
 930                     c->opts.reconstruct_alloc) {
 931                         c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
 932                         continue;
 933                 }
 934
 935                 if (r->error) {
 936                         __fsck_err(c, i == BTREE_ID_alloc
 937                                    ? FSCK_CAN_IGNORE : 0,
 938                                    "invalid btree root %s",
 939                                    bch2_btree_ids[i]);
 940                         if (i == BTREE_ID_alloc)
 941                                 c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
 942                 }
 943
 944                 ret = bch2_btree_root_read(c, i, &r->key, r->level);
 945                 if (ret) {
 946                         __fsck_err(c, i == BTREE_ID_alloc
 947                                    ? FSCK_CAN_IGNORE : 0,
 948                                    "error reading btree root %s",
 949                                    bch2_btree_ids[i]);
 950                         if (i == BTREE_ID_alloc)
 951                                 c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
 952                 }
 953         }
 954
 955         for (i = 0; i < BTREE_ID_NR; i++)
 956                 if (!c->btree_roots[i].b)
 957                         bch2_btree_root_alloc(c, i);
 958 fsck_err:
 959         return ret;
 960 }
 961
 962 static int bch2_fs_initialize_subvolumes(struct bch_fs *c)
 963 {
 964         struct bkey_i_snapshot  root_snapshot;
 965         struct bkey_i_subvolume root_volume;
 966         int ret;
 967
 968         bkey_snapshot_init(&root_snapshot.k_i);
 969         root_snapshot.k.p.offset = U32_MAX;
 970         root_snapshot.v.flags   = 0;
 971         root_snapshot.v.parent  = 0;
 972         root_snapshot.v.subvol  = BCACHEFS_ROOT_SUBVOL;
 973         root_snapshot.v.pad     = 0;
 974         SET_BCH_SNAPSHOT_SUBVOL(&root_snapshot.v, true);
 975
 976         ret = bch2_btree_insert(c, BTREE_ID_snapshots,
 977                                 &root_snapshot.k_i,
 978                                 NULL, NULL, 0);
 979         if (ret)
 980                 return ret;
 981
 982
 983         bkey_subvolume_init(&root_volume.k_i);
 984         root_volume.k.p.offset = BCACHEFS_ROOT_SUBVOL;
 985         root_volume.v.flags     = 0;
 986         root_volume.v.snapshot  = cpu_to_le32(U32_MAX);
 987         root_volume.v.inode     = cpu_to_le64(BCACHEFS_ROOT_INO);
 988
 989         ret = bch2_btree_insert(c, BTREE_ID_subvolumes,
 990                                 &root_volume.k_i,
 991                                 NULL, NULL, 0);
 992         if (ret)
 993                 return ret;
 994
 995         return 0;
 996 }
 997
 998 static int bch2_fs_upgrade_for_subvolumes(struct btree_trans *trans)
 999 {
1000         struct btree_iter iter;
1001         struct bkey_s_c k;
1002         struct bch_inode_unpacked inode;
1003         int ret;
1004
1005         bch2_trans_iter_init(trans, &iter, BTREE_ID_inodes,
1006                              SPOS(0, BCACHEFS_ROOT_INO, U32_MAX), 0);
1007         k = bch2_btree_iter_peek_slot(&iter);
1008         ret = bkey_err(k);
1009         if (ret)
1010                 goto err;
1011
1012         if (!bkey_is_inode(k.k)) {
1013                 bch_err(trans->c, "root inode not found");
1014                 ret = -ENOENT;
1015                 goto err;
1016         }
1017
1018         ret = bch2_inode_unpack(k, &inode);
1019         BUG_ON(ret);
1020
1021         inode.bi_subvol = BCACHEFS_ROOT_SUBVOL;
1022
1023         ret = bch2_inode_write(trans, &iter, &inode);
1024 err:
1025         bch2_trans_iter_exit(trans, &iter);
1026         return ret;
1027 }
1028
1029 int bch2_fs_recovery(struct bch_fs *c)
1030 {
1031         const char *err = "cannot allocate memory";
1032         struct bch_sb_field_clean *clean = NULL;
1033         struct jset *last_journal_entry = NULL;
1034         u64 blacklist_seq, journal_seq;
1035         bool write_sb = false;
1036         int ret = 0;
1037
1038         if (c->sb.clean)
1039                 clean = read_superblock_clean(c);
1040         ret = PTR_ERR_OR_ZERO(clean);
1041         if (ret)
1042                 goto err;
1043
1044         if (c->sb.clean)
1045                 bch_info(c, "recovering from clean shutdown, journal seq %llu",
1046                          le64_to_cpu(clean->journal_seq));
1047         else
1048                 bch_info(c, "recovering from unclean shutdown");
1049
1050         if (!(c->sb.features & (1ULL << BCH_FEATURE_new_extent_overwrite))) {
1051                 bch_err(c, "feature new_extent_overwrite not set, filesystem no longer supported");
1052                 ret = -EINVAL;
1053                 goto err;
1054         }
1055
1056         if (!c->sb.clean &&
1057             !(c->sb.features & (1ULL << BCH_FEATURE_extents_above_btree_updates))) {
1058                 bch_err(c, "filesystem needs recovery from older version; run fsck from older bcachefs-tools to fix");
1059                 ret = -EINVAL;
1060                 goto err;
1061         }
1062
1063         if (!(c->sb.compat & (1ULL << BCH_COMPAT_bformat_overflow_done))) {
1064                 bch_err(c, "filesystem may have incompatible bkey formats; run fsck from the compat branch to fix");
1065                 ret = -EINVAL;
1066                 goto err;
1067         }
1068
1069         if (!(c->sb.features & (1ULL << BCH_FEATURE_alloc_v2))) {
1070                 bch_info(c, "alloc_v2 feature bit not set, fsck required");
1071                 c->opts.fsck = true;
1072                 c->opts.fix_errors = FSCK_OPT_YES;
1073         }
1074
1075         if (!c->replicas.entries ||
1076             c->opts.rebuild_replicas) {
1077                 bch_info(c, "building replicas info");
1078                 set_bit(BCH_FS_REBUILD_REPLICAS, &c->flags);
1079         }
1080
1081         if (!c->opts.nochanges) {
1082                 if (c->sb.version < bcachefs_metadata_version_new_data_types) {
1083                         bch_info(c, "version prior to new_data_types, upgrade and fsck required");
1084                         c->opts.version_upgrade = true;
1085                         c->opts.fsck            = true;
1086                         c->opts.fix_errors      = FSCK_OPT_YES;
1087                 }
1088         }
1089
1090         ret = bch2_blacklist_table_initialize(c);
1091         if (ret) {
1092                 bch_err(c, "error initializing blacklist table");
1093                 goto err;
1094         }
1095
1096         if (!c->sb.clean || c->opts.fsck || c->opts.keep_journal) {
1097                 struct journal_replay *i;
1098
1099                 bch_verbose(c, "starting journal read");
1100                 ret = bch2_journal_read(c, &c->journal_entries,
1101                                         &blacklist_seq, &journal_seq);
1102                 if (ret)
1103                         goto err;
1104
1105                 list_for_each_entry_reverse(i, &c->journal_entries, list)
1106                         if (!i->ignore) {
1107                                 last_journal_entry = &i->j;
1108                                 break;
1109                         }
1110
1111                 if (mustfix_fsck_err_on(c->sb.clean &&
1112                                         last_journal_entry &&
1113                                         !journal_entry_empty(last_journal_entry), c,
1114                                 "filesystem marked clean but journal not empty")) {
1115                         c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
1116                         SET_BCH_SB_CLEAN(c->disk_sb.sb, false);
1117                         c->sb.clean = false;
1118                 }
1119
1120                 if (!last_journal_entry) {
1121                         fsck_err_on(!c->sb.clean, c, "no journal entries found");
1122                         goto use_clean;
1123                 }
1124
1125                 c->journal_keys = journal_keys_sort(&c->journal_entries);
1126                 if (!c->journal_keys.d) {
1127                         ret = -ENOMEM;
1128                         goto err;
1129                 }
1130
1131                 if (c->sb.clean && last_journal_entry) {
1132                         ret = verify_superblock_clean(c, &clean,
1133                                                       last_journal_entry);
1134                         if (ret)
1135                                 goto err;
1136                 }
1137         } else {
1138 use_clean:
1139                 if (!clean) {
1140                         bch_err(c, "no superblock clean section found");
1141                         ret = BCH_FSCK_REPAIR_IMPOSSIBLE;
1142                         goto err;
1143
1144                 }
1145                 blacklist_seq = journal_seq = le64_to_cpu(clean->journal_seq) + 1;
1146         }
1147
1148         if (c->opts.read_journal_only)
1149                 goto out;
1150
1151         if (c->opts.reconstruct_alloc) {
1152                 c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
1153                 drop_alloc_keys(&c->journal_keys);
1154         }
1155
1156         zero_out_btree_mem_ptr(&c->journal_keys);
1157
1158         ret = journal_replay_early(c, clean, &c->journal_entries);
1159         if (ret)
1160                 goto err;
1161
1162         /*
1163          * After an unclean shutdown, skip then next few journal sequence
1164          * numbers as they may have been referenced by btree writes that
1165          * happened before their corresponding journal writes - those btree
1166          * writes need to be ignored, by skipping and blacklisting the next few
1167          * journal sequence numbers:
1168          */
1169         if (!c->sb.clean)
1170                 journal_seq += 8;
1171
1172         if (blacklist_seq != journal_seq) {
1173                 ret = bch2_journal_seq_blacklist_add(c,
1174                                         blacklist_seq, journal_seq);
1175                 if (ret) {
1176                         bch_err(c, "error creating new journal seq blacklist entry");
1177                         goto err;
1178                 }
1179         }
1180
1181         ret = bch2_fs_journal_start(&c->journal, journal_seq,
1182                                     &c->journal_entries);
1183         if (ret)
1184                 goto err;
1185
1186         ret = read_btree_roots(c);
1187         if (ret)
1188                 goto err;
1189
1190         bch_verbose(c, "starting alloc read");
1191         err = "error reading allocation information";
1192
1193         down_read(&c->gc_lock);
1194         ret = bch2_alloc_read(c);
1195         up_read(&c->gc_lock);
1196
1197         if (ret)
1198                 goto err;
1199         bch_verbose(c, "alloc read done");
1200
1201         bch_verbose(c, "starting stripes_read");
1202         err = "error reading stripes";
1203         ret = bch2_stripes_read(c);
1204         if (ret)
1205                 goto err;
1206         bch_verbose(c, "stripes_read done");
1207
1208         /*
1209          * If we're not running fsck, this ensures bch2_fsck_err() calls are
1210          * instead interpreted as bch2_inconsistent_err() calls:
1211          */
1212         if (!c->opts.fsck)
1213                 set_bit(BCH_FS_FSCK_DONE, &c->flags);
1214
1215         if (c->opts.fsck ||
1216             !(c->sb.compat & (1ULL << BCH_COMPAT_alloc_info)) ||
1217             !(c->sb.compat & (1ULL << BCH_COMPAT_alloc_metadata)) ||
1218             test_bit(BCH_FS_REBUILD_REPLICAS, &c->flags)) {
1219                 bool metadata_only = c->opts.norecovery;
1220
1221                 bch_info(c, "checking allocations");
1222                 err = "error checking allocations";
1223                 ret = bch2_gc(c, true, metadata_only);
1224                 if (ret)
1225                         goto err;
1226                 bch_verbose(c, "done checking allocations");
1227         }
1228
1229         if (c->opts.fsck) {
1230                 bch_info(c, "checking need_discard and freespace btrees");
1231                 err = "error checking need_discard and freespace btrees";
1232                 ret = bch2_check_alloc_info(c);
1233                 if (ret)
1234                         goto err;
1235
1236                 ret = bch2_check_lrus(c, true);
1237                 if (ret)
1238                         goto err;
1239                 bch_verbose(c, "done checking need_discard and freespace btrees");
1240         }
1241
1242         bch2_stripes_heap_start(c);
1243
1244         clear_bit(BCH_FS_REBUILD_REPLICAS, &c->flags);
1245         set_bit(BCH_FS_INITIAL_GC_DONE, &c->flags);
1246         set_bit(BCH_FS_MAY_GO_RW, &c->flags);
1247
1248         /*
1249          * Skip past versions that might have possibly been used (as nonces),
1250          * but hadn't had their pointers written:
1251          */
1252         if (c->sb.encryption_type && !c->sb.clean)
1253                 atomic64_add(1 << 16, &c->key_version);
1254
1255         if (c->opts.norecovery)
1256                 goto out;
1257
1258         bch_verbose(c, "starting journal replay, %zu keys", c->journal_keys.nr);
1259         err = "journal replay failed";
1260         ret = bch2_journal_replay(c);
1261         if (ret)
1262                 goto err;
1263         if (c->opts.verbose || !c->sb.clean)
1264                 bch_info(c, "journal replay done");
1265
1266         err = "error initializing freespace";
1267         ret = bch2_fs_freespace_init(c);
1268         if (ret)
1269                 goto err;
1270
1271         if (c->opts.fsck) {
1272                 bch_info(c, "checking alloc to lru refs");
1273                 err = "error checking alloc to lru refs";
1274                 ret = bch2_check_alloc_to_lru_refs(c);
1275                 if (ret)
1276                         goto err;
1277
1278                 ret = bch2_check_lrus(c, true);
1279                 if (ret)
1280                         goto err;
1281                 bch_verbose(c, "done checking alloc to lru refs");
1282         }
1283
1284         if (c->sb.version < bcachefs_metadata_version_snapshot_2) {
1285                 bch2_fs_lazy_rw(c);
1286
1287                 err = "error creating root snapshot node";
1288                 ret = bch2_fs_initialize_subvolumes(c);
1289                 if (ret)
1290                         goto err;
1291         }
1292
1293         bch_verbose(c, "reading snapshots table");
1294         err = "error reading snapshots table";
1295         ret = bch2_fs_snapshots_start(c);
1296         if (ret)
1297                 goto err;
1298         bch_verbose(c, "reading snapshots done");
1299
1300         if (c->sb.version < bcachefs_metadata_version_snapshot_2) {
1301                 /* set bi_subvol on root inode */
1302                 err = "error upgrade root inode for subvolumes";
1303                 ret = bch2_trans_do(c, NULL, NULL, BTREE_INSERT_LAZY_RW,
1304                                     bch2_fs_upgrade_for_subvolumes(&trans));
1305                 if (ret)
1306                         goto err;
1307         }
1308
1309         if (c->opts.fsck) {
1310                 bch_info(c, "starting fsck");
1311                 err = "error in fsck";
1312                 ret = bch2_fsck_full(c);
1313                 if (ret)
1314                         goto err;
1315                 bch_verbose(c, "fsck done");
1316         } else if (!c->sb.clean) {
1317                 bch_verbose(c, "checking for deleted inodes");
1318                 err = "error in recovery";
1319                 ret = bch2_fsck_walk_inodes_only(c);
1320                 if (ret)
1321                         goto err;
1322                 bch_verbose(c, "check inodes done");
1323         }
1324
1325         if (enabled_qtypes(c)) {
1326                 bch_verbose(c, "reading quotas");
1327                 ret = bch2_fs_quota_read(c);
1328                 if (ret)
1329                         goto err;
1330                 bch_verbose(c, "quotas done");
1331         }
1332
1333         mutex_lock(&c->sb_lock);
1334         if (c->opts.version_upgrade) {
1335                 c->disk_sb.sb->version = cpu_to_le16(bcachefs_metadata_version_current);
1336                 c->disk_sb.sb->features[0] |= cpu_to_le64(BCH_SB_FEATURES_ALL);
1337                 write_sb = true;
1338         }
1339
1340         if (!test_bit(BCH_FS_ERROR, &c->flags)) {
1341                 c->disk_sb.sb->compat[0] |= cpu_to_le64(1ULL << BCH_COMPAT_alloc_info);
1342                 write_sb = true;
1343         }
1344
1345         if (c->opts.fsck &&
1346             !test_bit(BCH_FS_ERROR, &c->flags) &&
1347             !test_bit(BCH_FS_ERRORS_NOT_FIXED, &c->flags)) {
1348                 SET_BCH_SB_HAS_ERRORS(c->disk_sb.sb, 0);
1349                 SET_BCH_SB_HAS_TOPOLOGY_ERRORS(c->disk_sb.sb, 0);
1350                 write_sb = true;
1351         }
1352
1353         if (write_sb)
1354                 bch2_write_super(c);
1355         mutex_unlock(&c->sb_lock);
1356
1357         if (!(c->sb.compat & (1ULL << BCH_COMPAT_extents_above_btree_updates_done)) ||
1358             !(c->sb.compat & (1ULL << BCH_COMPAT_bformat_overflow_done)) ||
1359             le16_to_cpu(c->sb.version_min) < bcachefs_metadata_version_btree_ptr_sectors_written) {
1360                 struct bch_move_stats stats;
1361
1362                 bch_move_stats_init(&stats, "recovery");
1363
1364                 bch_info(c, "scanning for old btree nodes");
1365                 ret = bch2_fs_read_write(c);
1366                 if (ret)
1367                         goto err;
1368
1369                 ret = bch2_scan_old_btree_nodes(c, &stats);
1370                 if (ret)
1371                         goto err;
1372                 bch_info(c, "scanning for old btree nodes done");
1373         }
1374
1375         if (c->journal_seq_blacklist_table &&
1376             c->journal_seq_blacklist_table->nr > 128)
1377                 queue_work(system_long_wq, &c->journal_seq_blacklist_gc_work);
1378
1379         ret = 0;
1380 out:
1381         set_bit(BCH_FS_FSCK_DONE, &c->flags);
1382         bch2_flush_fsck_errs(c);
1383
1384         if (!c->opts.keep_journal) {
1385                 bch2_journal_keys_free(&c->journal_keys);
1386                 bch2_journal_entries_free(&c->journal_entries);
1387         }
1388         kfree(clean);
1389         if (ret)
1390                 bch_err(c, "Error in recovery: %s (%i)", err, ret);
1391         else
1392                 bch_verbose(c, "ret %i", ret);
1393         return ret;
1394 err:
1395 fsck_err:
1396         bch2_fs_emergency_read_only(c);
1397         goto out;
1398 }
1399
1400 int bch2_fs_initialize(struct bch_fs *c)
1401 {
1402         struct bch_inode_unpacked root_inode, lostfound_inode;
1403         struct bkey_inode_buf packed_inode;
1404         struct qstr lostfound = QSTR("lost+found");
1405         const char *err = "cannot allocate memory";
1406         struct bch_dev *ca;
1407         LIST_HEAD(journal);
1408         unsigned i;
1409         int ret;
1410
1411         bch_notice(c, "initializing new filesystem");
1412
1413         mutex_lock(&c->sb_lock);
1414         c->disk_sb.sb->compat[0] |= cpu_to_le64(1ULL << BCH_COMPAT_extents_above_btree_updates_done);
1415         c->disk_sb.sb->compat[0] |= cpu_to_le64(1ULL << BCH_COMPAT_bformat_overflow_done);
1416
1417         if (c->opts.version_upgrade) {
1418                 c->disk_sb.sb->version = cpu_to_le16(bcachefs_metadata_version_current);
1419                 c->disk_sb.sb->features[0] |= cpu_to_le64(BCH_SB_FEATURES_ALL);
1420                 bch2_write_super(c);
1421         }
1422         mutex_unlock(&c->sb_lock);
1423
1424         set_bit(BCH_FS_INITIAL_GC_DONE, &c->flags);
1425         set_bit(BCH_FS_MAY_GO_RW, &c->flags);
1426         set_bit(BCH_FS_FSCK_DONE, &c->flags);
1427
1428         for (i = 0; i < BTREE_ID_NR; i++)
1429                 bch2_btree_root_alloc(c, i);
1430
1431         for_each_online_member(ca, c, i)
1432                 bch2_dev_usage_init(ca);
1433
1434         err = "unable to allocate journal buckets";
1435         for_each_online_member(ca, c, i) {
1436                 ret = bch2_dev_journal_alloc(ca);
1437                 if (ret) {
1438                         percpu_ref_put(&ca->io_ref);
1439                         goto err;
1440                 }
1441         }
1442
1443         /*
1444          * journal_res_get() will crash if called before this has
1445          * set up the journal.pin FIFO and journal.cur pointer:
1446          */
1447         bch2_fs_journal_start(&c->journal, 1, &journal);
1448         bch2_journal_set_replay_done(&c->journal);
1449
1450         err = "error going read-write";
1451         ret = bch2_fs_read_write_early(c);
1452         if (ret)
1453                 goto err;
1454
1455         /*
1456          * Write out the superblock and journal buckets, now that we can do
1457          * btree updates
1458          */
1459         bch_verbose(c, "marking superblocks");
1460         err = "error marking superblock and journal";
1461         for_each_member_device(ca, c, i) {
1462                 ret = bch2_trans_mark_dev_sb(c, ca);
1463                 if (ret) {
1464                         percpu_ref_put(&ca->ref);
1465                         goto err;
1466                 }
1467
1468                 ca->new_fs_bucket_idx = 0;
1469         }
1470
1471         bch_verbose(c, "initializing freespace");
1472         err = "error initializing freespace";
1473         ret = bch2_fs_freespace_init(c);
1474         if (ret)
1475                 goto err;
1476
1477         err = "error creating root snapshot node";
1478         ret = bch2_fs_initialize_subvolumes(c);
1479         if (ret)
1480                 goto err;
1481
1482         bch_verbose(c, "reading snapshots table");
1483         err = "error reading snapshots table";
1484         ret = bch2_fs_snapshots_start(c);
1485         if (ret)
1486                 goto err;
1487         bch_verbose(c, "reading snapshots done");
1488
1489         bch2_inode_init(c, &root_inode, 0, 0,
1490                         S_IFDIR|S_IRWXU|S_IRUGO|S_IXUGO, 0, NULL);
1491         root_inode.bi_inum      = BCACHEFS_ROOT_INO;
1492         root_inode.bi_subvol    = BCACHEFS_ROOT_SUBVOL;
1493         bch2_inode_pack(c, &packed_inode, &root_inode);
1494         packed_inode.inode.k.p.snapshot = U32_MAX;
1495
1496         err = "error creating root directory";
1497         ret = bch2_btree_insert(c, BTREE_ID_inodes,
1498                                 &packed_inode.inode.k_i,
1499                                 NULL, NULL, 0);
1500         if (ret)
1501                 goto err;
1502
1503         bch2_inode_init_early(c, &lostfound_inode);
1504
1505         err = "error creating lost+found";
1506         ret = bch2_trans_do(c, NULL, NULL, 0,
1507                 bch2_create_trans(&trans,
1508                                   BCACHEFS_ROOT_SUBVOL_INUM,
1509                                   &root_inode, &lostfound_inode,
1510                                   &lostfound,
1511                                   0, 0, S_IFDIR|0700, 0,
1512                                   NULL, NULL, (subvol_inum) { 0 }, 0));
1513         if (ret) {
1514                 bch_err(c, "error creating lost+found");
1515                 goto err;
1516         }
1517
1518         if (enabled_qtypes(c)) {
1519                 ret = bch2_fs_quota_read(c);
1520                 if (ret)
1521                         goto err;
1522         }
1523
1524         err = "error writing first journal entry";
1525         ret = bch2_journal_flush(&c->journal);
1526         if (ret)
1527                 goto err;
1528
1529         mutex_lock(&c->sb_lock);
1530         SET_BCH_SB_INITIALIZED(c->disk_sb.sb, true);
1531         SET_BCH_SB_CLEAN(c->disk_sb.sb, false);
1532
1533         bch2_write_super(c);
1534         mutex_unlock(&c->sb_lock);
1535
1536         return 0;
1537 err:
1538         pr_err("Error initializing new filesystem: %s (%i)", err, ret);
1539         return ret;
1540 }