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

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