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         return ret;
 689 }
 690
 691 /* journal replay early: */
 692
 693 static int journal_replay_entry_early(struct bch_fs *c,
 694                                       struct jset_entry *entry)
 695 {
 696         int ret = 0;
 697
 698         switch (entry->type) {
 699         case BCH_JSET_ENTRY_btree_root: {
 700                 struct btree_root *r;
 701
 702                 if (entry->btree_id >= BTREE_ID_NR) {
 703                         bch_err(c, "filesystem has unknown btree type %u",
 704                                 entry->btree_id);
 705                         return -EINVAL;
 706                 }
 707
 708                 r = &c->btree_roots[entry->btree_id];
 709
 710                 if (entry->u64s) {
 711                         r->level = entry->level;
 712                         bkey_copy(&r->key, &entry->start[0]);
 713                         r->error = 0;
 714                 } else {
 715                         r->error = -EIO;
 716                 }
 717                 r->alive = true;
 718                 break;
 719         }
 720         case BCH_JSET_ENTRY_usage: {
 721                 struct jset_entry_usage *u =
 722                         container_of(entry, struct jset_entry_usage, entry);
 723
 724                 switch (entry->btree_id) {
 725                 case BCH_FS_USAGE_reserved:
 726                         if (entry->level < BCH_REPLICAS_MAX)
 727                                 c->usage_base->persistent_reserved[entry->level] =
 728                                         le64_to_cpu(u->v);
 729                         break;
 730                 case BCH_FS_USAGE_inodes:
 731                         c->usage_base->nr_inodes = le64_to_cpu(u->v);
 732                         break;
 733                 case BCH_FS_USAGE_key_version:
 734                         atomic64_set(&c->key_version,
 735                                      le64_to_cpu(u->v));
 736                         break;
 737                 }
 738
 739                 break;
 740         }
 741         case BCH_JSET_ENTRY_data_usage: {
 742                 struct jset_entry_data_usage *u =
 743                         container_of(entry, struct jset_entry_data_usage, entry);
 744
 745                 ret = bch2_replicas_set_usage(c, &u->r,
 746                                               le64_to_cpu(u->v));
 747                 break;
 748         }
 749         case BCH_JSET_ENTRY_dev_usage: {
 750                 struct jset_entry_dev_usage *u =
 751                         container_of(entry, struct jset_entry_dev_usage, entry);
 752                 struct bch_dev *ca = bch_dev_bkey_exists(c, le32_to_cpu(u->dev));
 753                 unsigned i, nr_types = jset_entry_dev_usage_nr_types(u);
 754
 755                 ca->usage_base->buckets_ec              = le64_to_cpu(u->buckets_ec);
 756
 757                 for (i = 0; i < min_t(unsigned, nr_types, BCH_DATA_NR); i++) {
 758                         ca->usage_base->d[i].buckets    = le64_to_cpu(u->d[i].buckets);
 759                         ca->usage_base->d[i].sectors    = le64_to_cpu(u->d[i].sectors);
 760                         ca->usage_base->d[i].fragmented = le64_to_cpu(u->d[i].fragmented);
 761                 }
 762
 763                 break;
 764         }
 765         case BCH_JSET_ENTRY_blacklist: {
 766                 struct jset_entry_blacklist *bl_entry =
 767                         container_of(entry, struct jset_entry_blacklist, entry);
 768
 769                 ret = bch2_journal_seq_blacklist_add(c,
 770                                 le64_to_cpu(bl_entry->seq),
 771                                 le64_to_cpu(bl_entry->seq) + 1);
 772                 break;
 773         }
 774         case BCH_JSET_ENTRY_blacklist_v2: {
 775                 struct jset_entry_blacklist_v2 *bl_entry =
 776                         container_of(entry, struct jset_entry_blacklist_v2, entry);
 777
 778                 ret = bch2_journal_seq_blacklist_add(c,
 779                                 le64_to_cpu(bl_entry->start),
 780                                 le64_to_cpu(bl_entry->end) + 1);
 781                 break;
 782         }
 783         case BCH_JSET_ENTRY_clock: {
 784                 struct jset_entry_clock *clock =
 785                         container_of(entry, struct jset_entry_clock, entry);
 786
 787                 atomic64_set(&c->io_clock[clock->rw].now, le64_to_cpu(clock->time));
 788         }
 789         }
 790
 791         return ret;
 792 }
 793
 794 static int journal_replay_early(struct bch_fs *c,
 795                                 struct bch_sb_field_clean *clean)
 796 {
 797         struct jset_entry *entry;
 798         int ret;
 799
 800         if (clean) {
 801                 for (entry = clean->start;
 802                      entry != vstruct_end(&clean->field);
 803                      entry = vstruct_next(entry)) {
 804                         ret = journal_replay_entry_early(c, entry);
 805                         if (ret)
 806                                 return ret;
 807                 }
 808         } else {
 809                 struct genradix_iter iter;
 810                 struct journal_replay *i, **_i;
 811
 812                 genradix_for_each(&c->journal_entries, iter, _i) {
 813                         i = *_i;
 814
 815                         if (!i || i->ignore)
 816                                 continue;
 817
 818                         vstruct_for_each(&i->j, entry) {
 819                                 ret = journal_replay_entry_early(c, entry);
 820                                 if (ret)
 821                                         return ret;
 822                         }
 823                 }
 824         }
 825
 826         bch2_fs_usage_initialize(c);
 827
 828         return 0;
 829 }
 830
 831 /* sb clean section: */
 832
 833 static struct bkey_i *btree_root_find(struct bch_fs *c,
 834                                       struct bch_sb_field_clean *clean,
 835                                       struct jset *j,
 836                                       enum btree_id id, unsigned *level)
 837 {
 838         struct bkey_i *k;
 839         struct jset_entry *entry, *start, *end;
 840
 841         if (clean) {
 842                 start = clean->start;
 843                 end = vstruct_end(&clean->field);
 844         } else {
 845                 start = j->start;
 846                 end = vstruct_last(j);
 847         }
 848
 849         for (entry = start; entry < end; entry = vstruct_next(entry))
 850                 if (entry->type == BCH_JSET_ENTRY_btree_root &&
 851                     entry->btree_id == id)
 852                         goto found;
 853
 854         return NULL;
 855 found:
 856         if (!entry->u64s)
 857                 return ERR_PTR(-EINVAL);
 858
 859         k = entry->start;
 860         *level = entry->level;
 861         return k;
 862 }
 863
 864 static int verify_superblock_clean(struct bch_fs *c,
 865                                    struct bch_sb_field_clean **cleanp,
 866                                    struct jset *j)
 867 {
 868         unsigned i;
 869         struct bch_sb_field_clean *clean = *cleanp;
 870         struct printbuf buf1 = PRINTBUF;
 871         struct printbuf buf2 = PRINTBUF;
 872         int ret = 0;
 873
 874         if (mustfix_fsck_err_on(j->seq != clean->journal_seq, c,
 875                         "superblock journal seq (%llu) doesn't match journal (%llu) after clean shutdown",
 876                         le64_to_cpu(clean->journal_seq),
 877                         le64_to_cpu(j->seq))) {
 878                 kfree(clean);
 879                 *cleanp = NULL;
 880                 return 0;
 881         }
 882
 883         for (i = 0; i < BTREE_ID_NR; i++) {
 884                 struct bkey_i *k1, *k2;
 885                 unsigned l1 = 0, l2 = 0;
 886
 887                 k1 = btree_root_find(c, clean, NULL, i, &l1);
 888                 k2 = btree_root_find(c, NULL, j, i, &l2);
 889
 890                 if (!k1 && !k2)
 891                         continue;
 892
 893                 printbuf_reset(&buf1);
 894                 printbuf_reset(&buf2);
 895
 896                 if (k1)
 897                         bch2_bkey_val_to_text(&buf1, c, bkey_i_to_s_c(k1));
 898                 else
 899                         prt_printf(&buf1, "(none)");
 900
 901                 if (k2)
 902                         bch2_bkey_val_to_text(&buf2, c, bkey_i_to_s_c(k2));
 903                 else
 904                         prt_printf(&buf2, "(none)");
 905
 906                 mustfix_fsck_err_on(!k1 || !k2 ||
 907                                     IS_ERR(k1) ||
 908                                     IS_ERR(k2) ||
 909                                     k1->k.u64s != k2->k.u64s ||
 910                                     memcmp(k1, k2, bkey_bytes(&k1->k)) ||
 911                                     l1 != l2, c,
 912                         "superblock btree root %u doesn't match journal after clean shutdown\n"
 913                         "sb:      l=%u %s\n"
 914                         "journal: l=%u %s\n", i,
 915                         l1, buf1.buf,
 916                         l2, buf2.buf);
 917         }
 918 fsck_err:
 919         printbuf_exit(&buf2);
 920         printbuf_exit(&buf1);
 921         return ret;
 922 }
 923
 924 static struct bch_sb_field_clean *read_superblock_clean(struct bch_fs *c)
 925 {
 926         struct bch_sb_field_clean *clean, *sb_clean;
 927         int ret;
 928
 929         mutex_lock(&c->sb_lock);
 930         sb_clean = bch2_sb_get_clean(c->disk_sb.sb);
 931
 932         if (fsck_err_on(!sb_clean, c,
 933                         "superblock marked clean but clean section not present")) {
 934                 SET_BCH_SB_CLEAN(c->disk_sb.sb, false);
 935                 c->sb.clean = false;
 936                 mutex_unlock(&c->sb_lock);
 937                 return NULL;
 938         }
 939
 940         clean = kmemdup(sb_clean, vstruct_bytes(&sb_clean->field),
 941                         GFP_KERNEL);
 942         if (!clean) {
 943                 mutex_unlock(&c->sb_lock);
 944                 return ERR_PTR(-BCH_ERR_ENOMEM_read_superblock_clean);
 945         }
 946
 947         ret = bch2_sb_clean_validate_late(c, clean, READ);
 948         if (ret) {
 949                 mutex_unlock(&c->sb_lock);
 950                 return ERR_PTR(ret);
 951         }
 952
 953         mutex_unlock(&c->sb_lock);
 954
 955         return clean;
 956 fsck_err:
 957         mutex_unlock(&c->sb_lock);
 958         return ERR_PTR(ret);
 959 }
 960
 961 static bool btree_id_is_alloc(enum btree_id id)
 962 {
 963         switch (id) {
 964         case BTREE_ID_alloc:
 965         case BTREE_ID_backpointers:
 966         case BTREE_ID_need_discard:
 967         case BTREE_ID_freespace:
 968         case BTREE_ID_bucket_gens:
 969                 return true;
 970         default:
 971                 return false;
 972         }
 973 }
 974
 975 static int read_btree_roots(struct bch_fs *c)
 976 {
 977         unsigned i;
 978         int ret = 0;
 979
 980         for (i = 0; i < BTREE_ID_NR; i++) {
 981                 struct btree_root *r = &c->btree_roots[i];
 982
 983                 if (!r->alive)
 984                         continue;
 985
 986                 if (btree_id_is_alloc(i) &&
 987                     c->opts.reconstruct_alloc) {
 988                         c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
 989                         continue;
 990                 }
 991
 992                 if (r->error) {
 993                         __fsck_err(c, btree_id_is_alloc(i)
 994                                    ? FSCK_CAN_IGNORE : 0,
 995                                    "invalid btree root %s",
 996                                    bch2_btree_ids[i]);
 997                         if (i == BTREE_ID_alloc)
 998                                 c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
 999                 }
1000
1001                 ret = bch2_btree_root_read(c, i, &r->key, r->level);
1002                 if (ret) {
1003                         __fsck_err(c,
1004                                    btree_id_is_alloc(i)
1005                                    ? FSCK_CAN_IGNORE : 0,
1006                                    "error reading btree root %s",
1007                                    bch2_btree_ids[i]);
1008                         if (btree_id_is_alloc(i))
1009                                 c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
1010                 }
1011         }
1012
1013         for (i = 0; i < BTREE_ID_NR; i++) {
1014                 struct btree_root *r = &c->btree_roots[i];
1015
1016                 if (!r->b) {
1017                         r->alive = false;
1018                         r->level = 0;
1019                         bch2_btree_root_alloc(c, i);
1020                 }
1021         }
1022 fsck_err:
1023         return ret;
1024 }
1025
1026 static int bch2_fs_initialize_subvolumes(struct bch_fs *c)
1027 {
1028         struct bkey_i_snapshot  root_snapshot;
1029         struct bkey_i_subvolume root_volume;
1030         int ret;
1031
1032         bkey_snapshot_init(&root_snapshot.k_i);
1033         root_snapshot.k.p.offset = U32_MAX;
1034         root_snapshot.v.flags   = 0;
1035         root_snapshot.v.parent  = 0;
1036         root_snapshot.v.subvol  = BCACHEFS_ROOT_SUBVOL;
1037         root_snapshot.v.pad     = 0;
1038         SET_BCH_SNAPSHOT_SUBVOL(&root_snapshot.v, true);
1039
1040         ret = bch2_btree_insert(c, BTREE_ID_snapshots,
1041                                 &root_snapshot.k_i,
1042                                 NULL, NULL, 0);
1043         if (ret)
1044                 return ret;
1045
1046         bkey_subvolume_init(&root_volume.k_i);
1047         root_volume.k.p.offset = BCACHEFS_ROOT_SUBVOL;
1048         root_volume.v.flags     = 0;
1049         root_volume.v.snapshot  = cpu_to_le32(U32_MAX);
1050         root_volume.v.inode     = cpu_to_le64(BCACHEFS_ROOT_INO);
1051
1052         ret = bch2_btree_insert(c, BTREE_ID_subvolumes,
1053                                 &root_volume.k_i,
1054                                 NULL, NULL, 0);
1055         if (ret)
1056                 return ret;
1057
1058         return 0;
1059 }
1060
1061 static int bch2_fs_upgrade_for_subvolumes(struct btree_trans *trans)
1062 {
1063         struct btree_iter iter;
1064         struct bkey_s_c k;
1065         struct bch_inode_unpacked inode;
1066         int ret;
1067
1068         bch2_trans_iter_init(trans, &iter, BTREE_ID_inodes,
1069                              SPOS(0, BCACHEFS_ROOT_INO, U32_MAX), 0);
1070         k = bch2_btree_iter_peek_slot(&iter);
1071         ret = bkey_err(k);
1072         if (ret)
1073                 goto err;
1074
1075         if (!bkey_is_inode(k.k)) {
1076                 bch_err(trans->c, "root inode not found");
1077                 ret = -ENOENT;
1078                 goto err;
1079         }
1080
1081         ret = bch2_inode_unpack(k, &inode);
1082         BUG_ON(ret);
1083
1084         inode.bi_subvol = BCACHEFS_ROOT_SUBVOL;
1085
1086         ret = bch2_inode_write(trans, &iter, &inode);
1087 err:
1088         bch2_trans_iter_exit(trans, &iter);
1089         return ret;
1090 }
1091
1092 int bch2_fs_recovery(struct bch_fs *c)
1093 {
1094         const char *err = "cannot allocate memory";
1095         struct bch_sb_field_clean *clean = NULL;
1096         struct jset *last_journal_entry = NULL;
1097         u64 last_seq, blacklist_seq, journal_seq;
1098         bool write_sb = false;
1099         int ret = 0;
1100
1101         if (c->sb.clean)
1102                 clean = read_superblock_clean(c);
1103         ret = PTR_ERR_OR_ZERO(clean);
1104         if (ret)
1105                 goto err;
1106
1107         if (c->sb.clean)
1108                 bch_info(c, "recovering from clean shutdown, journal seq %llu",
1109                          le64_to_cpu(clean->journal_seq));
1110         else
1111                 bch_info(c, "recovering from unclean shutdown");
1112
1113         if (!(c->sb.features & (1ULL << BCH_FEATURE_new_extent_overwrite))) {
1114                 bch_err(c, "feature new_extent_overwrite not set, filesystem no longer supported");
1115                 ret = -EINVAL;
1116                 goto err;
1117         }
1118
1119         if (!c->sb.clean &&
1120             !(c->sb.features & (1ULL << BCH_FEATURE_extents_above_btree_updates))) {
1121                 bch_err(c, "filesystem needs recovery from older version; run fsck from older bcachefs-tools to fix");
1122                 ret = -EINVAL;
1123                 goto err;
1124         }
1125
1126         if (!(c->sb.compat & (1ULL << BCH_COMPAT_bformat_overflow_done))) {
1127                 bch_err(c, "filesystem may have incompatible bkey formats; run fsck from the compat branch to fix");
1128                 ret = -EINVAL;
1129                 goto err;
1130         }
1131
1132         if (!(c->sb.features & (1ULL << BCH_FEATURE_alloc_v2))) {
1133                 bch_info(c, "alloc_v2 feature bit not set, fsck required");
1134                 c->opts.fsck = true;
1135                 c->opts.fix_errors = FSCK_OPT_YES;
1136         }
1137
1138         if (!c->opts.nochanges) {
1139                 if (c->sb.version < bcachefs_metadata_version_no_bps_in_alloc_keys) {
1140                         bch_info(c, "version prior to no_bps_in_alloc_keys, upgrade and fsck required");
1141                         c->opts.version_upgrade = true;
1142                         c->opts.fsck            = true;
1143                         c->opts.fix_errors      = FSCK_OPT_YES;
1144                 }
1145         }
1146
1147         if (c->opts.fsck && c->opts.norecovery) {
1148                 bch_err(c, "cannot select both norecovery and fsck");
1149                 ret = -EINVAL;
1150                 goto err;
1151         }
1152
1153         ret = bch2_blacklist_table_initialize(c);
1154         if (ret) {
1155                 bch_err(c, "error initializing blacklist table");
1156                 goto err;
1157         }
1158
1159         if (!c->sb.clean || c->opts.fsck || c->opts.keep_journal) {
1160                 struct genradix_iter iter;
1161                 struct journal_replay **i;
1162
1163                 bch_verbose(c, "starting journal read");
1164                 ret = bch2_journal_read(c, &last_seq, &blacklist_seq, &journal_seq);
1165                 if (ret)
1166                         goto err;
1167
1168                 /*
1169                  * note: cmd_list_journal needs the blacklist table fully up to date so
1170                  * it can asterisk ignored journal entries:
1171                  */
1172                 if (c->opts.read_journal_only)
1173                         goto out;
1174
1175                 genradix_for_each_reverse(&c->journal_entries, iter, i)
1176                         if (*i && !(*i)->ignore) {
1177                                 last_journal_entry = &(*i)->j;
1178                                 break;
1179                         }
1180
1181                 if (mustfix_fsck_err_on(c->sb.clean &&
1182                                         last_journal_entry &&
1183                                         !journal_entry_empty(last_journal_entry), c,
1184                                 "filesystem marked clean but journal not empty")) {
1185                         c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
1186                         SET_BCH_SB_CLEAN(c->disk_sb.sb, false);
1187                         c->sb.clean = false;
1188                 }
1189
1190                 if (!last_journal_entry) {
1191                         fsck_err_on(!c->sb.clean, c, "no journal entries found");
1192                         if (clean)
1193                                 goto use_clean;
1194
1195                         genradix_for_each_reverse(&c->journal_entries, iter, i)
1196                                 if (*i) {
1197                                         last_journal_entry = &(*i)->j;
1198                                         (*i)->ignore = false;
1199                                         break;
1200                                 }
1201                 }
1202
1203                 ret = journal_keys_sort(c);
1204                 if (ret)
1205                         goto err;
1206
1207                 if (c->sb.clean && last_journal_entry) {
1208                         ret = verify_superblock_clean(c, &clean,
1209                                                       last_journal_entry);
1210                         if (ret)
1211                                 goto err;
1212                 }
1213         } else {
1214 use_clean:
1215                 if (!clean) {
1216                         bch_err(c, "no superblock clean section found");
1217                         ret = -BCH_ERR_fsck_repair_impossible;
1218                         goto err;
1219
1220                 }
1221                 blacklist_seq = journal_seq = le64_to_cpu(clean->journal_seq) + 1;
1222         }
1223
1224         if (c->opts.reconstruct_alloc) {
1225                 c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
1226                 drop_alloc_keys(&c->journal_keys);
1227         }
1228
1229         zero_out_btree_mem_ptr(&c->journal_keys);
1230
1231         ret = journal_replay_early(c, clean);
1232         if (ret)
1233                 goto err;
1234
1235         /*
1236          * After an unclean shutdown, skip then next few journal sequence
1237          * numbers as they may have been referenced by btree writes that
1238          * happened before their corresponding journal writes - those btree
1239          * writes need to be ignored, by skipping and blacklisting the next few
1240          * journal sequence numbers:
1241          */
1242         if (!c->sb.clean)
1243                 journal_seq += 8;
1244
1245         if (blacklist_seq != journal_seq) {
1246                 ret =   bch2_journal_log_msg(c, "blacklisting entries %llu-%llu",
1247                                              blacklist_seq, journal_seq) ?:
1248                         bch2_journal_seq_blacklist_add(c,
1249                                         blacklist_seq, journal_seq);
1250                 if (ret) {
1251                         bch_err(c, "error creating new journal seq blacklist entry");
1252                         goto err;
1253                 }
1254         }
1255
1256         ret =   bch2_journal_log_msg(c, "starting journal at entry %llu, replaying %llu-%llu",
1257                                      journal_seq, last_seq, blacklist_seq - 1) ?:
1258                 bch2_fs_journal_start(&c->journal, journal_seq);
1259         if (ret)
1260                 goto err;
1261
1262         if (c->opts.reconstruct_alloc)
1263                 bch2_journal_log_msg(c, "dropping alloc info");
1264
1265         /*
1266          * Skip past versions that might have possibly been used (as nonces),
1267          * but hadn't had their pointers written:
1268          */
1269         if (c->sb.encryption_type && !c->sb.clean)
1270                 atomic64_add(1 << 16, &c->key_version);
1271
1272         ret = read_btree_roots(c);
1273         if (ret)
1274                 goto err;
1275
1276         bch_verbose(c, "starting alloc read");
1277         err = "error reading allocation information";
1278
1279         down_read(&c->gc_lock);
1280         ret = c->sb.version < bcachefs_metadata_version_bucket_gens
1281                 ? bch2_alloc_read(c)
1282                 : bch2_bucket_gens_read(c);
1283         up_read(&c->gc_lock);
1284
1285         if (ret)
1286                 goto err;
1287         bch_verbose(c, "alloc read done");
1288
1289         bch_verbose(c, "starting stripes_read");
1290         err = "error reading stripes";
1291         ret = bch2_stripes_read(c);
1292         if (ret)
1293                 goto err;
1294         bch_verbose(c, "stripes_read done");
1295
1296         if (c->sb.version < bcachefs_metadata_version_snapshot_2) {
1297                 err = "error creating root snapshot node";
1298                 ret = bch2_fs_initialize_subvolumes(c);
1299                 if (ret)
1300                         goto err;
1301         }
1302
1303         bch_verbose(c, "reading snapshots table");
1304         err = "error reading snapshots table";
1305         ret = bch2_fs_snapshots_start(c);
1306         if (ret)
1307                 goto err;
1308         bch_verbose(c, "reading snapshots done");
1309
1310         if (c->opts.fsck) {
1311                 bool metadata_only = c->opts.norecovery;
1312
1313                 bch_info(c, "checking allocations");
1314                 err = "error checking allocations";
1315                 ret = bch2_gc(c, true, metadata_only);
1316                 if (ret)
1317                         goto err;
1318                 bch_verbose(c, "done checking allocations");
1319
1320                 set_bit(BCH_FS_INITIAL_GC_DONE, &c->flags);
1321
1322                 set_bit(BCH_FS_MAY_GO_RW, &c->flags);
1323
1324                 bch_info(c, "starting journal replay, %zu keys", c->journal_keys.nr);
1325                 err = "journal replay failed";
1326                 ret = bch2_journal_replay(c, last_seq, blacklist_seq - 1);
1327                 if (ret)
1328                         goto err;
1329                 if (c->opts.verbose || !c->sb.clean)
1330                         bch_info(c, "journal replay done");
1331
1332                 bch_info(c, "checking need_discard and freespace btrees");
1333                 err = "error checking need_discard and freespace btrees";
1334                 ret = bch2_check_alloc_info(c);
1335                 if (ret)
1336                         goto err;
1337                 bch_verbose(c, "done checking need_discard and freespace btrees");
1338
1339                 set_bit(BCH_FS_CHECK_ALLOC_DONE, &c->flags);
1340
1341                 bch_info(c, "checking lrus");
1342                 err = "error checking lrus";
1343                 ret = bch2_check_lrus(c);
1344                 if (ret)
1345                         goto err;
1346                 bch_verbose(c, "done checking lrus");
1347                 set_bit(BCH_FS_CHECK_LRUS_DONE, &c->flags);
1348
1349                 bch_info(c, "checking backpointers to alloc keys");
1350                 err = "error checking backpointers to alloc keys";
1351                 ret = bch2_check_btree_backpointers(c);
1352                 if (ret)
1353                         goto err;
1354                 bch_verbose(c, "done checking backpointers to alloc keys");
1355
1356                 bch_info(c, "checking backpointers to extents");
1357                 err = "error checking backpointers to extents";
1358                 ret = bch2_check_backpointers_to_extents(c);
1359                 if (ret)
1360                         goto err;
1361                 bch_verbose(c, "done checking backpointers to extents");
1362
1363                 bch_info(c, "checking extents to backpointers");
1364                 err = "error checking extents to backpointers";
1365                 ret = bch2_check_extents_to_backpointers(c);
1366                 if (ret)
1367                         goto err;
1368                 bch_verbose(c, "done checking extents to backpointers");
1369                 set_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags);
1370
1371                 bch_info(c, "checking alloc to lru refs");
1372                 err = "error checking alloc to lru refs";
1373                 ret = bch2_check_alloc_to_lru_refs(c);
1374                 if (ret)
1375                         goto err;
1376                 bch_verbose(c, "done checking alloc to lru refs");
1377                 set_bit(BCH_FS_CHECK_ALLOC_TO_LRU_REFS_DONE, &c->flags);
1378         } else {
1379                 set_bit(BCH_FS_INITIAL_GC_DONE, &c->flags);
1380                 set_bit(BCH_FS_CHECK_ALLOC_DONE, &c->flags);
1381                 set_bit(BCH_FS_CHECK_LRUS_DONE, &c->flags);
1382                 set_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags);
1383                 set_bit(BCH_FS_CHECK_ALLOC_TO_LRU_REFS_DONE, &c->flags);
1384                 set_bit(BCH_FS_FSCK_DONE, &c->flags);
1385
1386                 if (c->opts.norecovery)
1387                         goto out;
1388
1389                 set_bit(BCH_FS_MAY_GO_RW, &c->flags);
1390
1391                 bch_verbose(c, "starting journal replay, %zu keys", c->journal_keys.nr);
1392                 err = "journal replay failed";
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         err = "error initializing freespace";
1401         ret = bch2_fs_freespace_init(c);
1402         if (ret)
1403                 goto err;
1404
1405         if (c->sb.version < bcachefs_metadata_version_bucket_gens &&
1406             c->opts.version_upgrade) {
1407                 bch_info(c, "initializing bucket_gens");
1408                 err = "error initializing bucket gens";
1409                 ret = bch2_bucket_gens_init(c);
1410                 if (ret)
1411                         goto err;
1412                 bch_verbose(c, "bucket_gens init done");
1413         }
1414
1415         if (c->sb.version < bcachefs_metadata_version_snapshot_2) {
1416                 /* set bi_subvol on root inode */
1417                 err = "error upgrade root inode for subvolumes";
1418                 ret = bch2_trans_do(c, NULL, NULL, BTREE_INSERT_LAZY_RW,
1419                                     bch2_fs_upgrade_for_subvolumes(&trans));
1420                 if (ret)
1421                         goto err;
1422         }
1423
1424         if (c->opts.fsck) {
1425                 bch_info(c, "starting fsck");
1426                 err = "error in fsck";
1427                 ret = bch2_fsck_full(c);
1428                 if (ret)
1429                         goto err;
1430                 bch_verbose(c, "fsck done");
1431         } else if (!c->sb.clean) {
1432                 bch_verbose(c, "checking for deleted inodes");
1433                 err = "error in recovery";
1434                 ret = bch2_fsck_walk_inodes_only(c);
1435                 if (ret)
1436                         goto err;
1437                 bch_verbose(c, "check inodes done");
1438         }
1439
1440         if (enabled_qtypes(c)) {
1441                 bch_verbose(c, "reading quotas");
1442                 ret = bch2_fs_quota_read(c);
1443                 if (ret)
1444                         goto err;
1445                 bch_verbose(c, "quotas done");
1446         }
1447
1448         mutex_lock(&c->sb_lock);
1449         if (c->opts.version_upgrade) {
1450                 c->disk_sb.sb->version = cpu_to_le16(bcachefs_metadata_version_current);
1451                 c->disk_sb.sb->features[0] |= cpu_to_le64(BCH_SB_FEATURES_ALL);
1452                 write_sb = true;
1453         }
1454
1455         if (!test_bit(BCH_FS_ERROR, &c->flags)) {
1456                 c->disk_sb.sb->compat[0] |= cpu_to_le64(1ULL << BCH_COMPAT_alloc_info);
1457                 write_sb = true;
1458         }
1459
1460         if (c->opts.fsck &&
1461             !test_bit(BCH_FS_ERROR, &c->flags) &&
1462             !test_bit(BCH_FS_ERRORS_NOT_FIXED, &c->flags)) {
1463                 SET_BCH_SB_HAS_ERRORS(c->disk_sb.sb, 0);
1464                 SET_BCH_SB_HAS_TOPOLOGY_ERRORS(c->disk_sb.sb, 0);
1465                 write_sb = true;
1466         }
1467
1468         if (write_sb)
1469                 bch2_write_super(c);
1470         mutex_unlock(&c->sb_lock);
1471
1472         if (!(c->sb.compat & (1ULL << BCH_COMPAT_extents_above_btree_updates_done)) ||
1473             !(c->sb.compat & (1ULL << BCH_COMPAT_bformat_overflow_done)) ||
1474             le16_to_cpu(c->sb.version_min) < bcachefs_metadata_version_btree_ptr_sectors_written) {
1475                 struct bch_move_stats stats;
1476
1477                 bch2_move_stats_init(&stats, "recovery");
1478
1479                 bch_info(c, "scanning for old btree nodes");
1480                 ret = bch2_fs_read_write(c);
1481                 if (ret)
1482                         goto err;
1483
1484                 ret = bch2_scan_old_btree_nodes(c, &stats);
1485                 if (ret)
1486                         goto err;
1487                 bch_info(c, "scanning for old btree nodes done");
1488         }
1489
1490         if (c->journal_seq_blacklist_table &&
1491             c->journal_seq_blacklist_table->nr > 128)
1492                 queue_work(system_long_wq, &c->journal_seq_blacklist_gc_work);
1493
1494         ret = 0;
1495 out:
1496         set_bit(BCH_FS_FSCK_DONE, &c->flags);
1497         bch2_flush_fsck_errs(c);
1498
1499         if (!c->opts.keep_journal &&
1500             test_bit(JOURNAL_REPLAY_DONE, &c->journal.flags)) {
1501                 bch2_journal_keys_free(&c->journal_keys);
1502                 bch2_journal_entries_free(c);
1503         }
1504         kfree(clean);
1505
1506         if (!ret && test_bit(BCH_FS_HAVE_DELETED_SNAPSHOTS, &c->flags)) {
1507                 bch2_fs_read_write_early(c);
1508                 bch2_delete_dead_snapshots_async(c);
1509         }
1510
1511         if (ret)
1512                 bch_err(c, "Error in recovery: %s (%s)", err, bch2_err_str(ret));
1513         else
1514                 bch_verbose(c, "ret %s", bch2_err_str(ret));
1515         return ret;
1516 err:
1517 fsck_err:
1518         bch2_fs_emergency_read_only(c);
1519         goto out;
1520 }
1521
1522 int bch2_fs_initialize(struct bch_fs *c)
1523 {
1524         struct bch_inode_unpacked root_inode, lostfound_inode;
1525         struct bkey_inode_buf packed_inode;
1526         struct qstr lostfound = QSTR("lost+found");
1527         const char *err = "cannot allocate memory";
1528         struct bch_dev *ca;
1529         unsigned i;
1530         int ret;
1531
1532         bch_notice(c, "initializing new filesystem");
1533
1534         mutex_lock(&c->sb_lock);
1535         c->disk_sb.sb->compat[0] |= cpu_to_le64(1ULL << BCH_COMPAT_extents_above_btree_updates_done);
1536         c->disk_sb.sb->compat[0] |= cpu_to_le64(1ULL << BCH_COMPAT_bformat_overflow_done);
1537
1538         if (c->sb.version < bcachefs_metadata_version_inode_v3)
1539                 c->opts.version_upgrade = true;
1540
1541         if (c->opts.version_upgrade) {
1542                 c->disk_sb.sb->version = cpu_to_le16(bcachefs_metadata_version_current);
1543                 c->disk_sb.sb->features[0] |= cpu_to_le64(BCH_SB_FEATURES_ALL);
1544                 bch2_write_super(c);
1545         }
1546         mutex_unlock(&c->sb_lock);
1547
1548         set_bit(BCH_FS_INITIAL_GC_DONE, &c->flags);
1549         set_bit(BCH_FS_CHECK_LRUS_DONE, &c->flags);
1550         set_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags);
1551         set_bit(BCH_FS_CHECK_ALLOC_TO_LRU_REFS_DONE, &c->flags);
1552         set_bit(BCH_FS_MAY_GO_RW, &c->flags);
1553         set_bit(BCH_FS_FSCK_DONE, &c->flags);
1554
1555         for (i = 0; i < BTREE_ID_NR; i++)
1556                 bch2_btree_root_alloc(c, i);
1557
1558         for_each_online_member(ca, c, i)
1559                 bch2_dev_usage_init(ca);
1560
1561         err = "unable to allocate journal buckets";
1562         for_each_online_member(ca, c, i) {
1563                 ret = bch2_dev_journal_alloc(ca);
1564                 if (ret) {
1565                         percpu_ref_put(&ca->io_ref);
1566                         goto err;
1567                 }
1568         }
1569
1570         /*
1571          * journal_res_get() will crash if called before this has
1572          * set up the journal.pin FIFO and journal.cur pointer:
1573          */
1574         bch2_fs_journal_start(&c->journal, 1);
1575         bch2_journal_set_replay_done(&c->journal);
1576
1577         err = "error going read-write";
1578         ret = bch2_fs_read_write_early(c);
1579         if (ret)
1580                 goto err;
1581
1582         /*
1583          * Write out the superblock and journal buckets, now that we can do
1584          * btree updates
1585          */
1586         bch_verbose(c, "marking superblocks");
1587         err = "error marking superblock and journal";
1588         for_each_member_device(ca, c, i) {
1589                 ret = bch2_trans_mark_dev_sb(c, ca);
1590                 if (ret) {
1591                         percpu_ref_put(&ca->ref);
1592                         goto err;
1593                 }
1594
1595                 ca->new_fs_bucket_idx = 0;
1596         }
1597
1598         bch_verbose(c, "initializing freespace");
1599         err = "error initializing freespace";
1600         ret = bch2_fs_freespace_init(c);
1601         if (ret)
1602                 goto err;
1603
1604         err = "error creating root snapshot node";
1605         ret = bch2_fs_initialize_subvolumes(c);
1606         if (ret)
1607                 goto err;
1608
1609         bch_verbose(c, "reading snapshots table");
1610         err = "error reading snapshots table";
1611         ret = bch2_fs_snapshots_start(c);
1612         if (ret)
1613                 goto err;
1614         bch_verbose(c, "reading snapshots done");
1615
1616         bch2_inode_init(c, &root_inode, 0, 0, S_IFDIR|0755, 0, NULL);
1617         root_inode.bi_inum      = BCACHEFS_ROOT_INO;
1618         root_inode.bi_subvol    = BCACHEFS_ROOT_SUBVOL;
1619         bch2_inode_pack(&packed_inode, &root_inode);
1620         packed_inode.inode.k.p.snapshot = U32_MAX;
1621
1622         err = "error creating root directory";
1623         ret = bch2_btree_insert(c, BTREE_ID_inodes,
1624                                 &packed_inode.inode.k_i,
1625                                 NULL, NULL, 0);
1626         if (ret)
1627                 goto err;
1628
1629         bch2_inode_init_early(c, &lostfound_inode);
1630
1631         err = "error creating lost+found";
1632         ret = bch2_trans_do(c, NULL, NULL, 0,
1633                 bch2_create_trans(&trans,
1634                                   BCACHEFS_ROOT_SUBVOL_INUM,
1635                                   &root_inode, &lostfound_inode,
1636                                   &lostfound,
1637                                   0, 0, S_IFDIR|0700, 0,
1638                                   NULL, NULL, (subvol_inum) { 0 }, 0));
1639         if (ret) {
1640                 bch_err(c, "error creating lost+found");
1641                 goto err;
1642         }
1643
1644         if (enabled_qtypes(c)) {
1645                 ret = bch2_fs_quota_read(c);
1646                 if (ret)
1647                         goto err;
1648         }
1649
1650         err = "error writing first journal entry";
1651         ret = bch2_journal_flush(&c->journal);
1652         if (ret)
1653                 goto err;
1654
1655         mutex_lock(&c->sb_lock);
1656         SET_BCH_SB_INITIALIZED(c->disk_sb.sb, true);
1657         SET_BCH_SB_CLEAN(c->disk_sb.sb, false);
1658
1659         bch2_write_super(c);
1660         mutex_unlock(&c->sb_lock);
1661
1662         return 0;
1663 err:
1664         pr_err("Error initializing new filesystem: %s (%s)", err, bch2_err_str(ret));
1665         return ret;
1666 }