1 // SPDX-License-Identifier: GPL-2.0
5 #include "alloc_background.h"
7 #include "btree_update.h"
8 #include "btree_update_interior.h"
14 #include "fs-common.h"
16 #include "journal_io.h"
17 #include "journal_reclaim.h"
18 #include "journal_seq_blacklist.h"
24 #include "subvolume.h"
27 #include <linux/sort.h>
28 #include <linux/stat.h>
30 #define QSTR(n) { { { .len = strlen(n) } }, .name = n }
32 /* for -o reconstruct_alloc: */
33 static void drop_alloc_keys(struct journal_keys *keys)
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];
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:
49 static void zero_out_btree_mem_ptr(struct journal_keys *keys)
51 struct journal_key *i;
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;
58 /* iterate over keys read from the journal: */
60 static int __journal_key_cmp(enum btree_id l_btree_id,
63 const struct journal_key *r)
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));
70 static int journal_key_cmp(const struct journal_key *l, const struct journal_key *r)
72 return __journal_key_cmp(l->btree_id, l->level, l->k->k.p, r);
75 static inline size_t idx_to_pos(struct journal_keys *keys, size_t idx)
77 size_t gap_size = keys->size - keys->nr;
84 static inline struct journal_key *idx_to_key(struct journal_keys *keys, size_t idx)
86 return keys->d + idx_to_pos(keys, idx);
89 size_t bch2_journal_key_search(struct journal_keys *keys,
90 enum btree_id id, unsigned level,
93 size_t l = 0, r = keys->nr, m;
96 m = l + ((r - l) >> 1);
97 if (__journal_key_cmp(id, level, pos, idx_to_key(keys, m)) > 0)
103 BUG_ON(l < keys->nr &&
104 __journal_key_cmp(id, level, pos, idx_to_key(keys, l)) > 0);
107 __journal_key_cmp(id, level, pos, idx_to_key(keys, l - 1)) <= 0);
109 return idx_to_pos(keys, l);
112 struct bkey_i *bch2_journal_keys_peek(struct bch_fs *c, enum btree_id btree_id,
113 unsigned level, struct bpos pos)
115 struct journal_keys *keys = &c->journal_keys;
116 size_t idx = bch2_journal_key_search(keys, btree_id, level, pos);
118 while (idx < keys->size &&
119 keys->d[idx].overwritten) {
121 if (idx == keys->gap)
122 idx += keys->size - keys->nr;
125 if (idx < keys->size &&
126 keys->d[idx].btree_id == btree_id &&
127 keys->d[idx].level == level)
128 return keys->d[idx].k;
132 static void journal_iters_fix(struct bch_fs *c)
134 struct journal_keys *keys = &c->journal_keys;
135 /* The key we just inserted is immediately before the gap: */
136 struct journal_key *n = &keys->d[keys->gap - 1];
137 size_t gap_end = keys->gap + (keys->size - keys->nr);
138 struct btree_and_journal_iter *iter;
141 * If an iterator points one after the key we just inserted,
142 * and the key we just inserted compares >= the iterator's position,
143 * decrement the iterator so it points at the key we just inserted:
145 list_for_each_entry(iter, &c->journal_iters, journal.list)
146 if (iter->journal.idx == gap_end &&
148 iter->b->c.btree_id == n->btree_id &&
149 iter->b->c.level == n->level &&
150 bpos_cmp(n->k->k.p, iter->unpacked.p) >= 0)
151 iter->journal.idx = keys->gap - 1;
154 static void journal_iters_move_gap(struct bch_fs *c, size_t old_gap, size_t new_gap)
156 struct journal_keys *keys = &c->journal_keys;
157 struct journal_iter *iter;
158 size_t gap_size = keys->size - keys->nr;
160 list_for_each_entry(iter, &c->journal_iters, list) {
161 if (iter->idx > old_gap)
162 iter->idx -= gap_size;
163 if (iter->idx >= new_gap)
164 iter->idx += gap_size;
168 int bch2_journal_key_insert_take(struct bch_fs *c, enum btree_id id,
169 unsigned level, struct bkey_i *k)
171 struct journal_key n = {
177 * Ensure these keys are done last by journal replay, to unblock
180 .journal_seq = U32_MAX,
182 struct journal_keys *keys = &c->journal_keys;
183 size_t idx = bch2_journal_key_search(keys, id, level, k->k.p);
185 BUG_ON(test_bit(BCH_FS_RW, &c->flags));
187 if (idx < keys->size &&
188 journal_key_cmp(&n, &keys->d[idx]) == 0) {
189 if (keys->d[idx].allocated)
190 kfree(keys->d[idx].k);
196 idx -= keys->size - keys->nr;
198 if (keys->nr == keys->size) {
199 struct journal_keys new_keys = {
201 .size = keys->size * 2,
202 .journal_seq_base = keys->journal_seq_base,
205 new_keys.d = kvmalloc(sizeof(new_keys.d[0]) * new_keys.size, GFP_KERNEL);
207 bch_err(c, "%s: error allocating new key array (size %zu)",
208 __func__, new_keys.size);
212 /* Since @keys was full, there was no gap: */
213 memcpy(new_keys.d, keys->d, sizeof(keys->d[0]) * keys->nr);
217 /* And now the gap is at the end: */
218 keys->gap = keys->nr;
221 journal_iters_move_gap(c, keys->gap, idx);
223 move_gap(keys->d, keys->nr, keys->size, keys->gap, idx);
227 keys->d[keys->gap++] = n;
229 journal_iters_fix(c);
235 * Can only be used from the recovery thread while we're still RO - can't be
236 * used once we've got RW, as journal_keys is at that point used by multiple
239 int bch2_journal_key_insert(struct bch_fs *c, enum btree_id id,
240 unsigned level, struct bkey_i *k)
245 n = kmalloc(bkey_bytes(&k->k), GFP_KERNEL);
250 ret = bch2_journal_key_insert_take(c, id, level, n);
256 int bch2_journal_key_delete(struct bch_fs *c, enum btree_id id,
257 unsigned level, struct bpos pos)
259 struct bkey_i whiteout;
261 bkey_init(&whiteout.k);
264 return bch2_journal_key_insert(c, id, level, &whiteout);
267 void bch2_journal_key_overwritten(struct bch_fs *c, enum btree_id btree,
268 unsigned level, struct bpos pos)
270 struct journal_keys *keys = &c->journal_keys;
271 size_t idx = bch2_journal_key_search(keys, btree, level, pos);
273 if (idx < keys->size &&
274 keys->d[idx].btree_id == btree &&
275 keys->d[idx].level == level &&
276 !bpos_cmp(keys->d[idx].k->k.p, pos))
277 keys->d[idx].overwritten = true;
280 static struct bkey_i *bch2_journal_iter_peek(struct journal_iter *iter)
282 struct journal_key *k = iter->keys->d + iter->idx;
284 while (k < iter->keys->d + iter->keys->nr &&
285 k->btree_id == iter->btree_id &&
286 k->level == iter->level) {
291 k = iter->keys->d + iter->idx;
297 static void bch2_journal_iter_advance(struct journal_iter *iter)
299 if (iter->idx < iter->keys->size) {
301 if (iter->idx == iter->keys->gap)
302 iter->idx += iter->keys->size - iter->keys->nr;
306 static void bch2_journal_iter_exit(struct journal_iter *iter)
308 list_del(&iter->list);
311 static void bch2_journal_iter_init(struct bch_fs *c,
312 struct journal_iter *iter,
313 enum btree_id id, unsigned level,
318 iter->keys = &c->journal_keys;
319 iter->idx = bch2_journal_key_search(&c->journal_keys, id, level, pos);
322 static struct bkey_s_c bch2_journal_iter_peek_btree(struct btree_and_journal_iter *iter)
324 return bch2_btree_node_iter_peek_unpack(&iter->node_iter,
325 iter->b, &iter->unpacked);
328 static void bch2_journal_iter_advance_btree(struct btree_and_journal_iter *iter)
330 bch2_btree_node_iter_advance(&iter->node_iter, iter->b);
333 void bch2_btree_and_journal_iter_advance(struct btree_and_journal_iter *iter)
335 switch (iter->last) {
339 bch2_journal_iter_advance_btree(iter);
342 bch2_journal_iter_advance(&iter->journal);
349 struct bkey_s_c bch2_btree_and_journal_iter_peek(struct btree_and_journal_iter *iter)
354 struct bkey_s_c btree_k =
355 bch2_journal_iter_peek_btree(iter);
356 struct bkey_s_c journal_k =
357 bkey_i_to_s_c(bch2_journal_iter_peek(&iter->journal));
359 if (btree_k.k && journal_k.k) {
360 int cmp = bpos_cmp(btree_k.k->p, journal_k.k->p);
363 bch2_journal_iter_advance_btree(iter);
365 iter->last = cmp < 0 ? btree : journal;
366 } else if (btree_k.k) {
368 } else if (journal_k.k) {
369 iter->last = journal;
372 return bkey_s_c_null;
375 ret = iter->last == journal ? journal_k : btree_k;
378 bpos_cmp(ret.k->p, iter->b->data->max_key) > 0) {
379 iter->journal.idx = iter->journal.keys->nr;
381 return bkey_s_c_null;
384 if (!bkey_deleted(ret.k))
387 bch2_btree_and_journal_iter_advance(iter);
393 struct bkey_s_c bch2_btree_and_journal_iter_next(struct btree_and_journal_iter *iter)
395 bch2_btree_and_journal_iter_advance(iter);
397 return bch2_btree_and_journal_iter_peek(iter);
400 void bch2_btree_and_journal_iter_exit(struct btree_and_journal_iter *iter)
402 bch2_journal_iter_exit(&iter->journal);
405 void __bch2_btree_and_journal_iter_init_node_iter(struct btree_and_journal_iter *iter,
408 struct btree_node_iter node_iter,
411 memset(iter, 0, sizeof(*iter));
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);
420 * this version is used by btree_gc before filesystem has gone RW and
421 * multithreaded, so uses the journal_iters list:
423 void bch2_btree_and_journal_iter_init_node_iter(struct btree_and_journal_iter *iter,
427 struct btree_node_iter node_iter;
429 bch2_btree_node_iter_init_from_start(&node_iter, b);
430 __bch2_btree_and_journal_iter_init_node_iter(iter, c, b, node_iter, b->data->min_key);
431 list_add(&iter->journal.list, &c->journal_iters);
434 /* sort and dedup all keys in the journal: */
436 void bch2_journal_entries_free(struct list_head *list)
439 while (!list_empty(list)) {
440 struct journal_replay *i =
441 list_first_entry(list, struct journal_replay, list);
443 kvpfree(i, offsetof(struct journal_replay, j) +
444 vstruct_bytes(&i->j));
449 * When keys compare equal, oldest compares first:
451 static int journal_sort_key_cmp(const void *_l, const void *_r)
453 const struct journal_key *l = _l;
454 const struct journal_key *r = _r;
456 return journal_key_cmp(l, r) ?:
457 cmp_int(l->journal_seq, r->journal_seq) ?:
458 cmp_int(l->journal_offset, r->journal_offset);
461 void bch2_journal_keys_free(struct journal_keys *keys)
463 struct journal_key *i;
465 move_gap(keys->d, keys->nr, keys->size, keys->gap, keys->nr);
466 keys->gap = keys->nr;
468 for (i = keys->d; i < keys->d + keys->nr; i++)
474 keys->nr = keys->gap = keys->size = 0;
477 static struct journal_keys journal_keys_sort(struct list_head *journal_entries)
479 struct journal_replay *i;
480 struct jset_entry *entry;
481 struct bkey_i *k, *_n;
482 struct journal_keys keys = { NULL };
483 struct journal_key *src, *dst;
486 if (list_empty(journal_entries))
489 list_for_each_entry(i, journal_entries, list) {
493 if (!keys.journal_seq_base)
494 keys.journal_seq_base = le64_to_cpu(i->j.seq);
496 for_each_jset_key(k, _n, entry, &i->j)
500 keys.size = roundup_pow_of_two(nr_keys);
502 keys.d = kvmalloc(sizeof(keys.d[0]) * keys.size, GFP_KERNEL);
506 list_for_each_entry(i, journal_entries, list) {
510 BUG_ON(le64_to_cpu(i->j.seq) - keys.journal_seq_base > U32_MAX);
512 for_each_jset_key(k, _n, entry, &i->j)
513 keys.d[keys.nr++] = (struct journal_key) {
514 .btree_id = entry->btree_id,
515 .level = entry->level,
517 .journal_seq = le64_to_cpu(i->j.seq) -
518 keys.journal_seq_base,
519 .journal_offset = k->_data - i->j._data,
523 sort(keys.d, keys.nr, sizeof(keys.d[0]), journal_sort_key_cmp, NULL);
526 while (src < keys.d + keys.nr) {
527 while (src + 1 < keys.d + keys.nr &&
528 src[0].btree_id == src[1].btree_id &&
529 src[0].level == src[1].level &&
530 !bpos_cmp(src[0].k->k.p, src[1].k->k.p))
536 keys.nr = dst - keys.d;
542 /* journal replay: */
544 static void replay_now_at(struct journal *j, u64 seq)
546 BUG_ON(seq < j->replay_journal_seq);
547 BUG_ON(seq > j->replay_journal_seq_end);
549 while (j->replay_journal_seq < seq)
550 bch2_journal_pin_put(j, j->replay_journal_seq++);
553 static int bch2_journal_replay_key(struct btree_trans *trans,
554 struct journal_key *k)
556 struct btree_iter iter;
557 unsigned iter_flags =
559 BTREE_ITER_NOT_EXTENTS;
562 if (!k->level && k->btree_id == BTREE_ID_alloc)
563 iter_flags |= BTREE_ITER_CACHED;
565 bch2_trans_node_iter_init(trans, &iter, k->btree_id, k->k->k.p,
566 BTREE_MAX_DEPTH, k->level,
568 ret = bch2_btree_iter_traverse(&iter);
572 /* Must be checked with btree locked: */
576 ret = bch2_trans_update(trans, &iter, k->k, BTREE_TRIGGER_NORUN);
578 bch2_trans_iter_exit(trans, &iter);
582 static int journal_sort_seq_cmp(const void *_l, const void *_r)
584 const struct journal_key *l = *((const struct journal_key **)_l);
585 const struct journal_key *r = *((const struct journal_key **)_r);
587 return cmp_int(l->journal_seq, r->journal_seq);
590 static int bch2_journal_replay(struct bch_fs *c)
592 struct journal_keys *keys = &c->journal_keys;
593 struct journal_key **keys_sorted, *k;
594 struct journal *j = &c->journal;
598 move_gap(keys->d, keys->nr, keys->size, keys->gap, keys->nr);
599 keys->gap = keys->nr;
601 keys_sorted = kvmalloc_array(sizeof(*keys_sorted), keys->nr, GFP_KERNEL);
605 for (i = 0; i < keys->nr; i++)
606 keys_sorted[i] = &keys->d[i];
608 sort(keys_sorted, keys->nr,
609 sizeof(keys_sorted[0]),
610 journal_sort_seq_cmp, NULL);
613 replay_now_at(j, keys->journal_seq_base);
615 for (i = 0; i < keys->nr; i++) {
621 replay_now_at(j, keys->journal_seq_base + k->journal_seq);
623 ret = bch2_trans_do(c, NULL, NULL,
624 BTREE_INSERT_LAZY_RW|
627 ? BTREE_INSERT_JOURNAL_REPLAY|JOURNAL_WATERMARK_reserved
629 bch2_journal_replay_key(&trans, k));
631 bch_err(c, "journal replay: error %d while replaying key at btree %s level %u",
632 ret, bch2_btree_ids[k->btree_id], k->level);
637 replay_now_at(j, j->replay_journal_seq_end);
638 j->replay_journal_seq = 0;
640 bch2_journal_set_replay_done(j);
641 bch2_journal_flush_all_pins(j);
642 ret = bch2_journal_error(j);
644 if (keys->nr && !ret)
645 bch2_journal_log_msg(&c->journal, "journal replay finished");
651 /* journal replay early: */
653 static int journal_replay_entry_early(struct bch_fs *c,
654 struct jset_entry *entry)
658 switch (entry->type) {
659 case BCH_JSET_ENTRY_btree_root: {
660 struct btree_root *r;
662 if (entry->btree_id >= BTREE_ID_NR) {
663 bch_err(c, "filesystem has unknown btree type %u",
668 r = &c->btree_roots[entry->btree_id];
671 r->level = entry->level;
672 bkey_copy(&r->key, &entry->start[0]);
680 case BCH_JSET_ENTRY_usage: {
681 struct jset_entry_usage *u =
682 container_of(entry, struct jset_entry_usage, entry);
684 switch (entry->btree_id) {
685 case BCH_FS_USAGE_reserved:
686 if (entry->level < BCH_REPLICAS_MAX)
687 c->usage_base->persistent_reserved[entry->level] =
690 case BCH_FS_USAGE_inodes:
691 c->usage_base->nr_inodes = le64_to_cpu(u->v);
693 case BCH_FS_USAGE_key_version:
694 atomic64_set(&c->key_version,
701 case BCH_JSET_ENTRY_data_usage: {
702 struct jset_entry_data_usage *u =
703 container_of(entry, struct jset_entry_data_usage, entry);
705 ret = bch2_replicas_set_usage(c, &u->r,
709 case BCH_JSET_ENTRY_dev_usage: {
710 struct jset_entry_dev_usage *u =
711 container_of(entry, struct jset_entry_dev_usage, entry);
712 struct bch_dev *ca = bch_dev_bkey_exists(c, le32_to_cpu(u->dev));
713 unsigned i, nr_types = jset_entry_dev_usage_nr_types(u);
715 ca->usage_base->buckets_ec = le64_to_cpu(u->buckets_ec);
716 ca->usage_base->buckets_unavailable = le64_to_cpu(u->buckets_unavailable);
718 for (i = 0; i < min_t(unsigned, nr_types, BCH_DATA_NR); i++) {
719 ca->usage_base->d[i].buckets = le64_to_cpu(u->d[i].buckets);
720 ca->usage_base->d[i].sectors = le64_to_cpu(u->d[i].sectors);
721 ca->usage_base->d[i].fragmented = le64_to_cpu(u->d[i].fragmented);
726 case BCH_JSET_ENTRY_blacklist: {
727 struct jset_entry_blacklist *bl_entry =
728 container_of(entry, struct jset_entry_blacklist, entry);
730 ret = bch2_journal_seq_blacklist_add(c,
731 le64_to_cpu(bl_entry->seq),
732 le64_to_cpu(bl_entry->seq) + 1);
735 case BCH_JSET_ENTRY_blacklist_v2: {
736 struct jset_entry_blacklist_v2 *bl_entry =
737 container_of(entry, struct jset_entry_blacklist_v2, entry);
739 ret = bch2_journal_seq_blacklist_add(c,
740 le64_to_cpu(bl_entry->start),
741 le64_to_cpu(bl_entry->end) + 1);
744 case BCH_JSET_ENTRY_clock: {
745 struct jset_entry_clock *clock =
746 container_of(entry, struct jset_entry_clock, entry);
748 atomic64_set(&c->io_clock[clock->rw].now, le64_to_cpu(clock->time));
755 static int journal_replay_early(struct bch_fs *c,
756 struct bch_sb_field_clean *clean,
757 struct list_head *journal)
759 struct journal_replay *i;
760 struct jset_entry *entry;
764 for (entry = clean->start;
765 entry != vstruct_end(&clean->field);
766 entry = vstruct_next(entry)) {
767 ret = journal_replay_entry_early(c, entry);
772 list_for_each_entry(i, journal, list) {
776 vstruct_for_each(&i->j, entry) {
777 ret = journal_replay_entry_early(c, entry);
784 bch2_fs_usage_initialize(c);
789 /* sb clean section: */
791 static struct bkey_i *btree_root_find(struct bch_fs *c,
792 struct bch_sb_field_clean *clean,
794 enum btree_id id, unsigned *level)
797 struct jset_entry *entry, *start, *end;
800 start = clean->start;
801 end = vstruct_end(&clean->field);
804 end = vstruct_last(j);
807 for (entry = start; entry < end; entry = vstruct_next(entry))
808 if (entry->type == BCH_JSET_ENTRY_btree_root &&
809 entry->btree_id == id)
815 return ERR_PTR(-EINVAL);
818 *level = entry->level;
822 static int verify_superblock_clean(struct bch_fs *c,
823 struct bch_sb_field_clean **cleanp,
827 struct bch_sb_field_clean *clean = *cleanp;
828 struct printbuf buf1 = PRINTBUF;
829 struct printbuf buf2 = PRINTBUF;
832 if (mustfix_fsck_err_on(j->seq != clean->journal_seq, c,
833 "superblock journal seq (%llu) doesn't match journal (%llu) after clean shutdown",
834 le64_to_cpu(clean->journal_seq),
835 le64_to_cpu(j->seq))) {
841 for (i = 0; i < BTREE_ID_NR; i++) {
842 struct bkey_i *k1, *k2;
843 unsigned l1 = 0, l2 = 0;
845 k1 = btree_root_find(c, clean, NULL, i, &l1);
846 k2 = btree_root_find(c, NULL, j, i, &l2);
851 printbuf_reset(&buf1);
852 printbuf_reset(&buf2);
855 bch2_bkey_val_to_text(&buf1, c, bkey_i_to_s_c(k1));
857 pr_buf(&buf1, "(none)");
860 bch2_bkey_val_to_text(&buf2, c, bkey_i_to_s_c(k2));
862 pr_buf(&buf2, "(none)");
864 mustfix_fsck_err_on(!k1 || !k2 ||
867 k1->k.u64s != k2->k.u64s ||
868 memcmp(k1, k2, bkey_bytes(k1)) ||
870 "superblock btree root %u doesn't match journal after clean shutdown\n"
872 "journal: l=%u %s\n", i,
877 printbuf_exit(&buf2);
878 printbuf_exit(&buf1);
882 static struct bch_sb_field_clean *read_superblock_clean(struct bch_fs *c)
884 struct bch_sb_field_clean *clean, *sb_clean;
887 mutex_lock(&c->sb_lock);
888 sb_clean = bch2_sb_get_clean(c->disk_sb.sb);
890 if (fsck_err_on(!sb_clean, c,
891 "superblock marked clean but clean section not present")) {
892 SET_BCH_SB_CLEAN(c->disk_sb.sb, false);
894 mutex_unlock(&c->sb_lock);
898 clean = kmemdup(sb_clean, vstruct_bytes(&sb_clean->field),
901 mutex_unlock(&c->sb_lock);
902 return ERR_PTR(-ENOMEM);
905 ret = bch2_sb_clean_validate_late(c, clean, READ);
907 mutex_unlock(&c->sb_lock);
911 mutex_unlock(&c->sb_lock);
915 mutex_unlock(&c->sb_lock);
919 static int read_btree_roots(struct bch_fs *c)
924 for (i = 0; i < BTREE_ID_NR; i++) {
925 struct btree_root *r = &c->btree_roots[i];
930 if (i == BTREE_ID_alloc &&
931 c->opts.reconstruct_alloc) {
932 c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
937 __fsck_err(c, i == BTREE_ID_alloc
938 ? FSCK_CAN_IGNORE : 0,
939 "invalid btree root %s",
941 if (i == BTREE_ID_alloc)
942 c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
945 ret = bch2_btree_root_read(c, i, &r->key, r->level);
947 __fsck_err(c, i == BTREE_ID_alloc
948 ? FSCK_CAN_IGNORE : 0,
949 "error reading btree root %s",
951 if (i == BTREE_ID_alloc)
952 c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
956 for (i = 0; i < BTREE_ID_NR; i++)
957 if (!c->btree_roots[i].b)
958 bch2_btree_root_alloc(c, i);
963 static int bch2_fs_initialize_subvolumes(struct bch_fs *c)
965 struct bkey_i_snapshot root_snapshot;
966 struct bkey_i_subvolume root_volume;
969 bkey_snapshot_init(&root_snapshot.k_i);
970 root_snapshot.k.p.offset = U32_MAX;
971 root_snapshot.v.flags = 0;
972 root_snapshot.v.parent = 0;
973 root_snapshot.v.subvol = BCACHEFS_ROOT_SUBVOL;
974 root_snapshot.v.pad = 0;
975 SET_BCH_SNAPSHOT_SUBVOL(&root_snapshot.v, true);
977 ret = bch2_btree_insert(c, BTREE_ID_snapshots,
984 bkey_subvolume_init(&root_volume.k_i);
985 root_volume.k.p.offset = BCACHEFS_ROOT_SUBVOL;
986 root_volume.v.flags = 0;
987 root_volume.v.snapshot = cpu_to_le32(U32_MAX);
988 root_volume.v.inode = cpu_to_le64(BCACHEFS_ROOT_INO);
990 ret = bch2_btree_insert(c, BTREE_ID_subvolumes,
999 static int bch2_fs_upgrade_for_subvolumes(struct btree_trans *trans)
1001 struct btree_iter iter;
1003 struct bch_inode_unpacked inode;
1006 bch2_trans_iter_init(trans, &iter, BTREE_ID_inodes,
1007 SPOS(0, BCACHEFS_ROOT_INO, U32_MAX), 0);
1008 k = bch2_btree_iter_peek_slot(&iter);
1013 if (!bkey_is_inode(k.k)) {
1014 bch_err(trans->c, "root inode not found");
1019 ret = bch2_inode_unpack(k, &inode);
1022 inode.bi_subvol = BCACHEFS_ROOT_SUBVOL;
1024 ret = bch2_inode_write(trans, &iter, &inode);
1026 bch2_trans_iter_exit(trans, &iter);
1030 int bch2_fs_recovery(struct bch_fs *c)
1032 const char *err = "cannot allocate memory";
1033 struct bch_sb_field_clean *clean = NULL;
1034 struct jset *last_journal_entry = NULL;
1035 u64 blacklist_seq, journal_seq;
1036 bool write_sb = false;
1040 clean = read_superblock_clean(c);
1041 ret = PTR_ERR_OR_ZERO(clean);
1046 bch_info(c, "recovering from clean shutdown, journal seq %llu",
1047 le64_to_cpu(clean->journal_seq));
1049 bch_info(c, "recovering from unclean shutdown");
1051 if (!(c->sb.features & (1ULL << BCH_FEATURE_new_extent_overwrite))) {
1052 bch_err(c, "feature new_extent_overwrite not set, filesystem no longer supported");
1058 !(c->sb.features & (1ULL << BCH_FEATURE_extents_above_btree_updates))) {
1059 bch_err(c, "filesystem needs recovery from older version; run fsck from older bcachefs-tools to fix");
1064 if (!(c->sb.compat & (1ULL << BCH_COMPAT_bformat_overflow_done))) {
1065 bch_err(c, "filesystem may have incompatible bkey formats; run fsck from the compat branch to fix");
1070 if (!(c->sb.features & (1ULL << BCH_FEATURE_alloc_v2))) {
1071 bch_info(c, "alloc_v2 feature bit not set, fsck required");
1072 c->opts.fsck = true;
1073 c->opts.fix_errors = FSCK_OPT_YES;
1076 if (!c->replicas.entries ||
1077 c->opts.rebuild_replicas) {
1078 bch_info(c, "building replicas info");
1079 set_bit(BCH_FS_REBUILD_REPLICAS, &c->flags);
1082 if (!c->opts.nochanges) {
1083 if (c->sb.version < bcachefs_metadata_version_inode_backpointers) {
1084 bch_info(c, "version prior to inode backpointers, upgrade and fsck required");
1085 c->opts.version_upgrade = true;
1086 c->opts.fsck = true;
1087 c->opts.fix_errors = FSCK_OPT_YES;
1088 } else if (c->sb.version < bcachefs_metadata_version_subvol_dirent) {
1089 bch_info(c, "filesystem version is prior to subvol_dirent - upgrading");
1090 c->opts.version_upgrade = true;
1091 c->opts.fsck = true;
1092 } else if (c->sb.version < bcachefs_metadata_version_alloc_v4) {
1093 bch_info(c, "filesystem version is prior to alloc_v4 - upgrading");
1094 c->opts.version_upgrade = true;
1098 ret = bch2_blacklist_table_initialize(c);
1100 bch_err(c, "error initializing blacklist table");
1104 if (!c->sb.clean || c->opts.fsck || c->opts.keep_journal) {
1105 struct journal_replay *i;
1107 bch_verbose(c, "starting journal read");
1108 ret = bch2_journal_read(c, &c->journal_entries,
1109 &blacklist_seq, &journal_seq);
1113 list_for_each_entry_reverse(i, &c->journal_entries, list)
1115 last_journal_entry = &i->j;
1119 if (mustfix_fsck_err_on(c->sb.clean &&
1120 last_journal_entry &&
1121 !journal_entry_empty(last_journal_entry), c,
1122 "filesystem marked clean but journal not empty")) {
1123 c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
1124 SET_BCH_SB_CLEAN(c->disk_sb.sb, false);
1125 c->sb.clean = false;
1128 if (!last_journal_entry) {
1129 fsck_err_on(!c->sb.clean, c, "no journal entries found");
1133 c->journal_keys = journal_keys_sort(&c->journal_entries);
1134 if (!c->journal_keys.d) {
1139 if (c->sb.clean && last_journal_entry) {
1140 ret = verify_superblock_clean(c, &clean,
1141 last_journal_entry);
1148 bch_err(c, "no superblock clean section found");
1149 ret = BCH_FSCK_REPAIR_IMPOSSIBLE;
1153 blacklist_seq = journal_seq = le64_to_cpu(clean->journal_seq) + 1;
1156 if (c->opts.read_journal_only)
1159 if (c->opts.reconstruct_alloc) {
1160 c->sb.compat &= ~(1ULL << BCH_COMPAT_alloc_info);
1161 drop_alloc_keys(&c->journal_keys);
1164 zero_out_btree_mem_ptr(&c->journal_keys);
1166 ret = journal_replay_early(c, clean, &c->journal_entries);
1171 * After an unclean shutdown, skip then next few journal sequence
1172 * numbers as they may have been referenced by btree writes that
1173 * happened before their corresponding journal writes - those btree
1174 * writes need to be ignored, by skipping and blacklisting the next few
1175 * journal sequence numbers:
1180 if (blacklist_seq != journal_seq) {
1181 ret = bch2_journal_seq_blacklist_add(c,
1182 blacklist_seq, journal_seq);
1184 bch_err(c, "error creating new journal seq blacklist entry");
1189 ret = bch2_fs_journal_start(&c->journal, journal_seq,
1190 &c->journal_entries);
1194 ret = read_btree_roots(c);
1198 bch_verbose(c, "starting alloc read");
1199 err = "error reading allocation information";
1201 down_read(&c->gc_lock);
1202 ret = bch2_alloc_read(c);
1203 up_read(&c->gc_lock);
1207 bch_verbose(c, "alloc read done");
1209 bch_verbose(c, "starting stripes_read");
1210 err = "error reading stripes";
1211 ret = bch2_stripes_read(c);
1214 bch_verbose(c, "stripes_read done");
1217 * If we're not running fsck, this ensures bch2_fsck_err() calls are
1218 * instead interpreted as bch2_inconsistent_err() calls:
1221 set_bit(BCH_FS_FSCK_DONE, &c->flags);
1224 !(c->sb.compat & (1ULL << BCH_COMPAT_alloc_info)) ||
1225 !(c->sb.compat & (1ULL << BCH_COMPAT_alloc_metadata)) ||
1226 test_bit(BCH_FS_REBUILD_REPLICAS, &c->flags)) {
1227 bool metadata_only = c->opts.norecovery;
1229 bch_info(c, "checking allocations");
1230 err = "error checking allocations";
1231 ret = bch2_gc(c, true, metadata_only);
1234 bch_verbose(c, "done checking allocations");
1238 bch_info(c, "checking need_discard and freespace btrees");
1239 err = "error checking need_discard and freespace btrees";
1240 ret = bch2_check_alloc_info(c);
1244 ret = bch2_check_lrus(c, true);
1247 bch_verbose(c, "done checking need_discard and freespace btrees");
1250 bch2_stripes_heap_start(c);
1252 clear_bit(BCH_FS_REBUILD_REPLICAS, &c->flags);
1253 set_bit(BCH_FS_INITIAL_GC_DONE, &c->flags);
1254 set_bit(BCH_FS_MAY_GO_RW, &c->flags);
1257 * Skip past versions that might have possibly been used (as nonces),
1258 * but hadn't had their pointers written:
1260 if (c->sb.encryption_type && !c->sb.clean)
1261 atomic64_add(1 << 16, &c->key_version);
1263 if (c->opts.norecovery)
1266 bch_verbose(c, "starting journal replay, %zu keys", c->journal_keys.nr);
1267 err = "journal replay failed";
1268 ret = bch2_journal_replay(c);
1271 if (c->opts.verbose || !c->sb.clean)
1272 bch_info(c, "journal replay done");
1274 err = "error initializing freespace";
1275 ret = bch2_fs_freespace_init(c);
1280 bch_info(c, "checking alloc to lru refs");
1281 err = "error checking alloc to lru refs";
1282 ret = bch2_check_alloc_to_lru_refs(c);
1286 ret = bch2_check_lrus(c, true);
1289 bch_verbose(c, "done checking alloc to lru refs");
1292 if (c->sb.version < bcachefs_metadata_version_snapshot_2) {
1295 err = "error creating root snapshot node";
1296 ret = bch2_fs_initialize_subvolumes(c);
1301 bch_verbose(c, "reading snapshots table");
1302 err = "error reading snapshots table";
1303 ret = bch2_fs_snapshots_start(c);
1306 bch_verbose(c, "reading snapshots done");
1308 if (c->sb.version < bcachefs_metadata_version_snapshot_2) {
1309 /* set bi_subvol on root inode */
1310 err = "error upgrade root inode for subvolumes";
1311 ret = bch2_trans_do(c, NULL, NULL, BTREE_INSERT_LAZY_RW,
1312 bch2_fs_upgrade_for_subvolumes(&trans));
1318 bch_info(c, "starting fsck");
1319 err = "error in fsck";
1320 ret = bch2_fsck_full(c);
1323 bch_verbose(c, "fsck done");
1324 } else if (!c->sb.clean) {
1325 bch_verbose(c, "checking for deleted inodes");
1326 err = "error in recovery";
1327 ret = bch2_fsck_walk_inodes_only(c);
1330 bch_verbose(c, "check inodes done");
1333 if (enabled_qtypes(c)) {
1334 bch_verbose(c, "reading quotas");
1335 ret = bch2_fs_quota_read(c);
1338 bch_verbose(c, "quotas done");
1341 mutex_lock(&c->sb_lock);
1342 if (c->opts.version_upgrade) {
1343 c->disk_sb.sb->version = cpu_to_le16(bcachefs_metadata_version_current);
1344 c->disk_sb.sb->features[0] |= cpu_to_le64(BCH_SB_FEATURES_ALL);
1348 if (!test_bit(BCH_FS_ERROR, &c->flags)) {
1349 c->disk_sb.sb->compat[0] |= cpu_to_le64(1ULL << BCH_COMPAT_alloc_info);
1354 !test_bit(BCH_FS_ERROR, &c->flags) &&
1355 !test_bit(BCH_FS_ERRORS_NOT_FIXED, &c->flags)) {
1356 SET_BCH_SB_HAS_ERRORS(c->disk_sb.sb, 0);
1357 SET_BCH_SB_HAS_TOPOLOGY_ERRORS(c->disk_sb.sb, 0);
1362 bch2_write_super(c);
1363 mutex_unlock(&c->sb_lock);
1365 if (!(c->sb.compat & (1ULL << BCH_COMPAT_extents_above_btree_updates_done)) ||
1366 !(c->sb.compat & (1ULL << BCH_COMPAT_bformat_overflow_done)) ||
1367 le16_to_cpu(c->sb.version_min) < bcachefs_metadata_version_btree_ptr_sectors_written) {
1368 struct bch_move_stats stats;
1370 bch_move_stats_init(&stats, "recovery");
1372 bch_info(c, "scanning for old btree nodes");
1373 ret = bch2_fs_read_write(c);
1377 ret = bch2_scan_old_btree_nodes(c, &stats);
1380 bch_info(c, "scanning for old btree nodes done");
1383 if (c->journal_seq_blacklist_table &&
1384 c->journal_seq_blacklist_table->nr > 128)
1385 queue_work(system_long_wq, &c->journal_seq_blacklist_gc_work);
1389 set_bit(BCH_FS_FSCK_DONE, &c->flags);
1390 bch2_flush_fsck_errs(c);
1392 if (!c->opts.keep_journal) {
1393 bch2_journal_keys_free(&c->journal_keys);
1394 bch2_journal_entries_free(&c->journal_entries);
1398 bch_err(c, "Error in recovery: %s (%i)", err, ret);
1400 bch_verbose(c, "ret %i", ret);
1404 bch2_fs_emergency_read_only(c);
1408 int bch2_fs_initialize(struct bch_fs *c)
1410 struct bch_inode_unpacked root_inode, lostfound_inode;
1411 struct bkey_inode_buf packed_inode;
1412 struct qstr lostfound = QSTR("lost+found");
1413 const char *err = "cannot allocate memory";
1419 bch_notice(c, "initializing new filesystem");
1421 mutex_lock(&c->sb_lock);
1422 c->disk_sb.sb->compat[0] |= cpu_to_le64(1ULL << BCH_COMPAT_extents_above_btree_updates_done);
1423 c->disk_sb.sb->compat[0] |= cpu_to_le64(1ULL << BCH_COMPAT_bformat_overflow_done);
1425 if (c->opts.version_upgrade) {
1426 c->disk_sb.sb->version = cpu_to_le16(bcachefs_metadata_version_current);
1427 c->disk_sb.sb->features[0] |= cpu_to_le64(BCH_SB_FEATURES_ALL);
1428 bch2_write_super(c);
1430 mutex_unlock(&c->sb_lock);
1432 set_bit(BCH_FS_INITIAL_GC_DONE, &c->flags);
1433 set_bit(BCH_FS_MAY_GO_RW, &c->flags);
1434 set_bit(BCH_FS_FSCK_DONE, &c->flags);
1436 for (i = 0; i < BTREE_ID_NR; i++)
1437 bch2_btree_root_alloc(c, i);
1439 err = "unable to allocate journal buckets";
1440 for_each_online_member(ca, c, i) {
1441 ret = bch2_dev_journal_alloc(ca);
1443 percpu_ref_put(&ca->io_ref);
1449 * journal_res_get() will crash if called before this has
1450 * set up the journal.pin FIFO and journal.cur pointer:
1452 bch2_fs_journal_start(&c->journal, 1, &journal);
1453 bch2_journal_set_replay_done(&c->journal);
1455 err = "error going read-write";
1456 ret = bch2_fs_read_write_early(c);
1461 * Write out the superblock and journal buckets, now that we can do
1464 bch_verbose(c, "marking superblocks");
1465 err = "error marking superblock and journal";
1466 for_each_member_device(ca, c, i) {
1467 ret = bch2_trans_mark_dev_sb(c, ca);
1469 percpu_ref_put(&ca->ref);
1473 ca->new_fs_bucket_idx = 0;
1476 bch_verbose(c, "initializing freespace");
1477 err = "error initializing freespace";
1478 ret = bch2_fs_freespace_init(c);
1482 err = "error creating root snapshot node";
1483 ret = bch2_fs_initialize_subvolumes(c);
1487 bch_verbose(c, "reading snapshots table");
1488 err = "error reading snapshots table";
1489 ret = bch2_fs_snapshots_start(c);
1492 bch_verbose(c, "reading snapshots done");
1494 bch2_inode_init(c, &root_inode, 0, 0,
1495 S_IFDIR|S_IRWXU|S_IRUGO|S_IXUGO, 0, NULL);
1496 root_inode.bi_inum = BCACHEFS_ROOT_INO;
1497 root_inode.bi_subvol = BCACHEFS_ROOT_SUBVOL;
1498 bch2_inode_pack(c, &packed_inode, &root_inode);
1499 packed_inode.inode.k.p.snapshot = U32_MAX;
1501 err = "error creating root directory";
1502 ret = bch2_btree_insert(c, BTREE_ID_inodes,
1503 &packed_inode.inode.k_i,
1508 bch2_inode_init_early(c, &lostfound_inode);
1510 err = "error creating lost+found";
1511 ret = bch2_trans_do(c, NULL, NULL, 0,
1512 bch2_create_trans(&trans,
1513 BCACHEFS_ROOT_SUBVOL_INUM,
1514 &root_inode, &lostfound_inode,
1516 0, 0, S_IFDIR|0700, 0,
1517 NULL, NULL, (subvol_inum) { 0 }, 0));
1519 bch_err(c, "error creating lost+found");
1523 if (enabled_qtypes(c)) {
1524 ret = bch2_fs_quota_read(c);
1529 err = "error writing first journal entry";
1530 ret = bch2_journal_flush(&c->journal);
1534 mutex_lock(&c->sb_lock);
1535 SET_BCH_SB_INITIALIZED(c->disk_sb.sb, true);
1536 SET_BCH_SB_CLEAN(c->disk_sb.sb, false);
1538 bch2_write_super(c);
1539 mutex_unlock(&c->sb_lock);
1543 pr_err("Error initializing new filesystem: %s (%i)", err, ret);