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

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