1 // SPDX-License-Identifier: GPL-2.0
5 #include "btree_update.h"
13 #include "subvolume.h"
17 #include <linux/bsearch.h>
18 #include <linux/dcache.h> /* struct qstr */
20 #define QSTR(n) { { { .len = strlen(n) } }, .name = n }
22 static s64 bch2_count_inode_sectors(struct btree_trans *trans, u64 inum,
25 struct btree_iter iter;
30 for_each_btree_key(trans, iter, BTREE_ID_extents,
31 SPOS(inum, 0, snapshot), 0, k, ret) {
32 if (k.k->p.inode != inum)
35 if (bkey_extent_is_allocation(k.k))
39 bch2_trans_iter_exit(trans, &iter);
41 return ret ?: sectors;
44 static s64 bch2_count_subdirs(struct btree_trans *trans, u64 inum,
47 struct btree_iter iter;
49 struct bkey_s_c_dirent d;
53 for_each_btree_key(trans, iter, BTREE_ID_dirents,
54 SPOS(inum, 0, snapshot), 0, k, ret) {
55 if (k.k->p.inode != inum)
58 if (k.k->type != KEY_TYPE_dirent)
61 d = bkey_s_c_to_dirent(k);
62 if (d.v->d_type == DT_DIR)
66 bch2_trans_iter_exit(trans, &iter);
68 return ret ?: subdirs;
71 static int __snapshot_lookup_subvol(struct btree_trans *trans, u32 snapshot,
74 struct btree_iter iter;
78 bch2_trans_iter_init(trans, &iter, BTREE_ID_snapshots,
80 k = bch2_btree_iter_peek_slot(&iter);
85 if (k.k->type != KEY_TYPE_snapshot) {
86 bch_err(trans->c, "snapshot %u not fonud", snapshot);
91 *subvol = le32_to_cpu(bkey_s_c_to_snapshot(k).v->subvol);
93 bch2_trans_iter_exit(trans, &iter);
98 static int __subvol_lookup(struct btree_trans *trans, u32 subvol,
99 u32 *snapshot, u64 *inum)
101 struct bch_subvolume s;
104 ret = bch2_subvolume_get(trans, subvol, false, 0, &s);
106 *snapshot = le32_to_cpu(s.snapshot);
107 *inum = le64_to_cpu(s.inode);
111 static int subvol_lookup(struct btree_trans *trans, u32 subvol,
112 u32 *snapshot, u64 *inum)
114 return lockrestart_do(trans, __subvol_lookup(trans, subvol, snapshot, inum));
117 static int lookup_first_inode(struct btree_trans *trans, u64 inode_nr,
118 struct bch_inode_unpacked *inode)
120 struct btree_iter iter;
124 bch2_trans_iter_init(trans, &iter, BTREE_ID_inodes,
126 BTREE_ITER_ALL_SNAPSHOTS);
127 k = bch2_btree_iter_peek(&iter);
132 if (!k.k || bkey_cmp(k.k->p, POS(0, inode_nr))) {
137 ret = bch2_inode_unpack(k, inode);
139 if (ret && ret != -EINTR)
140 bch_err(trans->c, "error %i fetching inode %llu",
142 bch2_trans_iter_exit(trans, &iter);
146 static int __lookup_inode(struct btree_trans *trans, u64 inode_nr,
147 struct bch_inode_unpacked *inode,
150 struct btree_iter iter;
154 bch2_trans_iter_init(trans, &iter, BTREE_ID_inodes,
155 SPOS(0, inode_nr, *snapshot), 0);
156 k = bch2_btree_iter_peek_slot(&iter);
161 ret = bkey_is_inode(k.k)
162 ? bch2_inode_unpack(k, inode)
165 *snapshot = iter.pos.snapshot;
167 if (ret && ret != -EINTR)
168 bch_err(trans->c, "error %i fetching inode %llu:%u",
169 ret, inode_nr, *snapshot);
170 bch2_trans_iter_exit(trans, &iter);
174 static int lookup_inode(struct btree_trans *trans, u64 inode_nr,
175 struct bch_inode_unpacked *inode,
178 return lockrestart_do(trans, __lookup_inode(trans, inode_nr, inode, snapshot));
181 static int __lookup_dirent(struct btree_trans *trans,
182 struct bch_hash_info hash_info,
183 subvol_inum dir, struct qstr *name,
184 u64 *target, unsigned *type)
186 struct btree_iter iter;
187 struct bkey_s_c_dirent d;
190 ret = bch2_hash_lookup(trans, &iter, bch2_dirent_hash_desc,
191 &hash_info, dir, name, 0);
195 d = bkey_s_c_to_dirent(bch2_btree_iter_peek_slot(&iter));
196 *target = le64_to_cpu(d.v->d_inum);
198 bch2_trans_iter_exit(trans, &iter);
202 static int __write_inode(struct btree_trans *trans,
203 struct bch_inode_unpacked *inode,
206 struct btree_iter iter;
209 bch2_trans_iter_init(trans, &iter, BTREE_ID_inodes,
210 SPOS(0, inode->bi_inum, snapshot),
213 ret = bch2_btree_iter_traverse(&iter) ?:
214 bch2_inode_write(trans, &iter, inode);
215 bch2_trans_iter_exit(trans, &iter);
219 static int write_inode(struct btree_trans *trans,
220 struct bch_inode_unpacked *inode,
223 int ret = commit_do(trans, NULL, NULL,
225 BTREE_INSERT_LAZY_RW,
226 __write_inode(trans, inode, snapshot));
228 bch_err(trans->c, "error in fsck: error %i updating inode", ret);
232 static int fsck_inode_rm(struct btree_trans *trans, u64 inum, u32 snapshot)
234 struct bch_fs *c = trans->c;
235 struct btree_iter iter = { NULL };
236 struct bkey_i_inode_generation delete;
237 struct bch_inode_unpacked inode_u;
241 ret = bch2_btree_delete_range_trans(trans, BTREE_ID_extents,
242 SPOS(inum, 0, snapshot),
243 SPOS(inum, U64_MAX, snapshot),
245 bch2_btree_delete_range_trans(trans, BTREE_ID_dirents,
246 SPOS(inum, 0, snapshot),
247 SPOS(inum, U64_MAX, snapshot),
249 bch2_btree_delete_range_trans(trans, BTREE_ID_xattrs,
250 SPOS(inum, 0, snapshot),
251 SPOS(inum, U64_MAX, snapshot),
256 bch2_trans_begin(trans);
258 bch2_trans_iter_init(trans, &iter, BTREE_ID_inodes,
259 SPOS(0, inum, snapshot), BTREE_ITER_INTENT);
260 k = bch2_btree_iter_peek_slot(&iter);
266 if (!bkey_is_inode(k.k)) {
267 bch2_fs_inconsistent(c,
268 "inode %llu:%u not found when deleting",
274 bch2_inode_unpack(k, &inode_u);
276 /* Subvolume root? */
277 if (inode_u.bi_subvol)
278 bch_warn(c, "deleting inode %llu marked as unlinked, but also a subvolume root!?", inode_u.bi_inum);
280 bkey_inode_generation_init(&delete.k_i);
281 delete.k.p = iter.pos;
282 delete.v.bi_generation = cpu_to_le32(inode_u.bi_generation + 1);
284 ret = bch2_trans_update(trans, &iter, &delete.k_i, 0) ?:
285 bch2_trans_commit(trans, NULL, NULL,
286 BTREE_INSERT_NOFAIL);
288 bch2_trans_iter_exit(trans, &iter);
295 static int __remove_dirent(struct btree_trans *trans, struct bpos pos)
297 struct bch_fs *c = trans->c;
298 struct btree_iter iter;
299 struct bch_inode_unpacked dir_inode;
300 struct bch_hash_info dir_hash_info;
303 ret = lookup_first_inode(trans, pos.inode, &dir_inode);
307 dir_hash_info = bch2_hash_info_init(c, &dir_inode);
309 bch2_trans_iter_init(trans, &iter, BTREE_ID_dirents, pos, BTREE_ITER_INTENT);
311 ret = bch2_hash_delete_at(trans, bch2_dirent_hash_desc,
312 &dir_hash_info, &iter,
313 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
314 bch2_trans_iter_exit(trans, &iter);
316 if (ret && ret != -EINTR)
317 bch_err(c, "error %i from __remove_dirent()", ret);
321 /* Get lost+found, create if it doesn't exist: */
322 static int lookup_lostfound(struct btree_trans *trans, u32 subvol,
323 struct bch_inode_unpacked *lostfound)
325 struct bch_fs *c = trans->c;
326 struct bch_inode_unpacked root;
327 struct bch_hash_info root_hash_info;
328 struct qstr lostfound_str = QSTR("lost+found");
329 subvol_inum root_inum = { .subvol = subvol };
335 ret = __subvol_lookup(trans, subvol, &snapshot, &root_inum.inum);
339 ret = __lookup_inode(trans, root_inum.inum, &root, &snapshot);
343 root_hash_info = bch2_hash_info_init(c, &root);
345 ret = __lookup_dirent(trans, root_hash_info, root_inum,
346 &lostfound_str, &inum, &d_type);
347 if (ret == -ENOENT) {
348 bch_notice(c, "creating lost+found");
349 goto create_lostfound;
352 if (ret && ret != -EINTR)
353 bch_err(c, "error looking up lost+found: %i", ret);
357 if (d_type != DT_DIR) {
358 bch_err(c, "error looking up lost+found: not a directory");
363 * The check_dirents pass has already run, dangling dirents
364 * shouldn't exist here:
366 return __lookup_inode(trans, inum, lostfound, &snapshot);
369 bch2_inode_init_early(c, lostfound);
371 ret = bch2_create_trans(trans, root_inum, &root,
372 lostfound, &lostfound_str,
373 0, 0, S_IFDIR|0700, 0, NULL, NULL,
374 (subvol_inum) { }, 0);
375 if (ret && ret != -EINTR)
376 bch_err(c, "error creating lost+found: %i", ret);
380 static int __reattach_inode(struct btree_trans *trans,
381 struct bch_inode_unpacked *inode,
384 struct bch_hash_info dir_hash;
385 struct bch_inode_unpacked lostfound;
392 ret = __snapshot_lookup_subvol(trans, inode_snapshot, &subvol);
396 ret = lookup_lostfound(trans, subvol, &lostfound);
400 if (S_ISDIR(inode->bi_mode)) {
401 lostfound.bi_nlink++;
403 ret = __write_inode(trans, &lostfound, U32_MAX);
408 dir_hash = bch2_hash_info_init(trans->c, &lostfound);
410 snprintf(name_buf, sizeof(name_buf), "%llu", inode->bi_inum);
411 name = (struct qstr) QSTR(name_buf);
413 ret = bch2_dirent_create(trans,
416 .inum = lostfound.bi_inum,
420 &name, inode->bi_inum, &dir_offset,
421 BCH_HASH_SET_MUST_CREATE);
425 inode->bi_dir = lostfound.bi_inum;
426 inode->bi_dir_offset = dir_offset;
428 return __write_inode(trans, inode, inode_snapshot);
431 static int reattach_inode(struct btree_trans *trans,
432 struct bch_inode_unpacked *inode,
435 int ret = commit_do(trans, NULL, NULL,
436 BTREE_INSERT_LAZY_RW|
438 __reattach_inode(trans, inode, inode_snapshot));
440 bch_err(trans->c, "error %i reattaching inode %llu",
441 ret, inode->bi_inum);
448 static int remove_backpointer(struct btree_trans *trans,
449 struct bch_inode_unpacked *inode)
451 struct btree_iter iter;
455 bch2_trans_iter_init(trans, &iter, BTREE_ID_dirents,
456 POS(inode->bi_dir, inode->bi_dir_offset), 0);
457 k = bch2_btree_iter_peek_slot(&iter);
461 if (k.k->type != KEY_TYPE_dirent) {
466 ret = __remove_dirent(trans, k.k->p);
468 bch2_trans_iter_exit(trans, &iter);
472 struct snapshots_seen_entry {
477 struct snapshots_seen {
479 DARRAY(struct snapshots_seen_entry) ids;
482 static inline void snapshots_seen_exit(struct snapshots_seen *s)
484 darray_exit(&s->ids);
487 static inline void snapshots_seen_init(struct snapshots_seen *s)
489 memset(s, 0, sizeof(*s));
492 static int snapshots_seen_add(struct bch_fs *c, struct snapshots_seen *s, u32 id)
494 struct snapshots_seen_entry *i, n = { id, id };
497 darray_for_each(s->ids, i) {
498 if (n.equiv < i->equiv)
501 if (i->equiv == n.equiv) {
502 bch_err(c, "adding duplicate snapshot in snapshots_seen_add()");
507 ret = darray_insert_item(&s->ids, i - s->ids.data, n);
509 bch_err(c, "error reallocating snapshots_seen table (size %zu)",
514 static int snapshots_seen_update(struct bch_fs *c, struct snapshots_seen *s,
515 enum btree_id btree_id, struct bpos pos)
517 struct snapshots_seen_entry *i, n = {
519 .equiv = bch2_snapshot_equiv(c, pos.snapshot),
523 if (bkey_cmp(s->pos, pos))
526 pos.snapshot = n.equiv;
529 darray_for_each(s->ids, i)
530 if (i->equiv == n.equiv) {
532 bch_err(c, "snapshot deletion did not run correctly:\n"
533 " duplicate keys in btree %s at %llu:%llu snapshots %u, %u (equiv %u)\n",
534 bch2_btree_ids[btree_id],
535 pos.inode, pos.offset,
536 i->id, n.id, n.equiv);
537 return -NEED_SNAPSHOT_CLEANUP;
543 ret = darray_push(&s->ids, n);
545 bch_err(c, "error reallocating snapshots_seen table (size %zu)",
551 * key_visible_in_snapshot - returns true if @id is a descendent of @ancestor,
552 * and @ancestor hasn't been overwritten in @seen
554 * That is, returns whether key in @ancestor snapshot is visible in @id snapshot
556 static bool key_visible_in_snapshot(struct bch_fs *c, struct snapshots_seen *seen,
557 u32 id, u32 ancestor)
560 u32 top = seen->ids.nr ? seen->ids.data[seen->ids.nr - 1].equiv : 0;
562 BUG_ON(id > ancestor);
563 BUG_ON(!bch2_snapshot_is_equiv(c, id));
564 BUG_ON(!bch2_snapshot_is_equiv(c, ancestor));
566 /* @ancestor should be the snapshot most recently added to @seen */
567 BUG_ON(ancestor != seen->pos.snapshot);
568 BUG_ON(ancestor != top);
573 if (!bch2_snapshot_is_ancestor(c, id, ancestor))
576 for (i = seen->ids.nr - 2;
577 i >= 0 && seen->ids.data[i].equiv >= id;
579 if (bch2_snapshot_is_ancestor(c, id, seen->ids.data[i].equiv) &&
580 bch2_snapshot_is_ancestor(c, seen->ids.data[i].equiv, ancestor))
587 * ref_visible - given a key with snapshot id @src that points to a key with
588 * snapshot id @dst, test whether there is some snapshot in which @dst is
591 * This assumes we're visiting @src keys in natural key order.
593 * @s - list of snapshot IDs already seen at @src
594 * @src - snapshot ID of src key
595 * @dst - snapshot ID of dst key
597 static int ref_visible(struct bch_fs *c, struct snapshots_seen *s,
601 ? key_visible_in_snapshot(c, s, dst, src)
602 : bch2_snapshot_is_ancestor(c, src, dst);
605 #define for_each_visible_inode(_c, _s, _w, _snapshot, _i) \
606 for (_i = (_w)->inodes.data; _i < (_w)->inodes.data + (_w)->inodes.nr && \
607 (_i)->snapshot <= (_snapshot); _i++) \
608 if (key_visible_in_snapshot(_c, _s, _i->snapshot, _snapshot))
610 struct inode_walker_entry {
611 struct bch_inode_unpacked inode;
616 struct inode_walker {
617 bool first_this_inode;
620 DARRAY(struct inode_walker_entry) inodes;
623 static void inode_walker_exit(struct inode_walker *w)
625 darray_exit(&w->inodes);
628 static struct inode_walker inode_walker_init(void)
630 return (struct inode_walker) { 0, };
633 static int add_inode(struct bch_fs *c, struct inode_walker *w,
634 struct bkey_s_c inode)
636 struct bch_inode_unpacked u;
638 BUG_ON(bch2_inode_unpack(inode, &u));
640 return darray_push(&w->inodes, ((struct inode_walker_entry) {
642 .snapshot = bch2_snapshot_equiv(c, inode.k->p.snapshot),
646 static int __walk_inode(struct btree_trans *trans,
647 struct inode_walker *w, struct bpos pos)
649 struct bch_fs *c = trans->c;
650 struct btree_iter iter;
655 pos.snapshot = bch2_snapshot_equiv(c, pos.snapshot);
657 if (pos.inode == w->cur_inum) {
658 w->first_this_inode = false;
659 goto lookup_snapshot;
664 for_each_btree_key(trans, iter, BTREE_ID_inodes, POS(0, pos.inode),
665 BTREE_ITER_ALL_SNAPSHOTS, k, ret) {
666 if (k.k->p.offset != pos.inode)
669 if (bkey_is_inode(k.k))
672 bch2_trans_iter_exit(trans, &iter);
677 w->cur_inum = pos.inode;
678 w->first_this_inode = true;
680 for (i = 0; i < w->inodes.nr; i++)
681 if (bch2_snapshot_is_ancestor(c, pos.snapshot, w->inodes.data[i].snapshot))
685 BUG_ON(pos.snapshot > w->inodes.data[i].snapshot);
687 if (pos.snapshot != w->inodes.data[i].snapshot) {
688 struct inode_walker_entry e = w->inodes.data[i];
690 e.snapshot = pos.snapshot;
693 bch_info(c, "have key for inode %llu:%u but have inode in ancestor snapshot %u",
694 pos.inode, pos.snapshot, w->inodes.data[i].snapshot);
696 while (i && w->inodes.data[i - 1].snapshot > pos.snapshot)
699 ret = darray_insert_item(&w->inodes, i, e);
707 static int __get_visible_inodes(struct btree_trans *trans,
708 struct inode_walker *w,
709 struct snapshots_seen *s,
712 struct bch_fs *c = trans->c;
713 struct btree_iter iter;
719 for_each_btree_key(trans, iter, BTREE_ID_inodes, POS(0, inum),
720 BTREE_ITER_ALL_SNAPSHOTS, k, ret) {
721 u32 equiv = bch2_snapshot_equiv(c, k.k->p.snapshot);
723 if (k.k->p.offset != inum)
726 if (!ref_visible(c, s, s->pos.snapshot, equiv))
729 if (bkey_is_inode(k.k))
732 if (equiv >= s->pos.snapshot)
735 bch2_trans_iter_exit(trans, &iter);
740 static int check_key_has_snapshot(struct btree_trans *trans,
741 struct btree_iter *iter,
744 struct bch_fs *c = trans->c;
745 struct printbuf buf = PRINTBUF;
748 if (mustfix_fsck_err_on(!bch2_snapshot_equiv(c, k.k->p.snapshot), c,
749 "key in missing snapshot: %s",
750 (bch2_bkey_val_to_text(&buf, c, k), buf.buf)))
751 ret = bch2_btree_delete_at(trans, iter,
752 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE) ?: 1;
758 static int hash_redo_key(struct btree_trans *trans,
759 const struct bch_hash_desc desc,
760 struct bch_hash_info *hash_info,
761 struct btree_iter *k_iter, struct bkey_s_c k)
763 bch_err(trans->c, "hash_redo_key() not implemented yet");
766 struct bkey_i *delete;
769 delete = bch2_trans_kmalloc(trans, sizeof(*delete));
771 return PTR_ERR(delete);
773 tmp = bch2_trans_kmalloc(trans, bkey_bytes(k.k));
777 bkey_reassemble(tmp, k);
779 bkey_init(&delete->k);
780 delete->k.p = k_iter->pos;
781 return bch2_btree_iter_traverse(k_iter) ?:
782 bch2_trans_update(trans, k_iter, delete, 0) ?:
783 bch2_hash_set(trans, desc, hash_info, k_iter->pos.inode, tmp, 0);
787 static int hash_check_key(struct btree_trans *trans,
788 const struct bch_hash_desc desc,
789 struct bch_hash_info *hash_info,
790 struct btree_iter *k_iter, struct bkey_s_c hash_k)
792 struct bch_fs *c = trans->c;
793 struct btree_iter iter = { NULL };
794 struct printbuf buf = PRINTBUF;
799 if (hash_k.k->type != desc.key_type)
802 hash = desc.hash_bkey(hash_info, hash_k);
804 if (likely(hash == hash_k.k->p.offset))
807 if (hash_k.k->p.offset < hash)
810 for_each_btree_key_norestart(trans, iter, desc.btree_id,
811 POS(hash_k.k->p.inode, hash),
812 BTREE_ITER_SLOTS, k, ret) {
813 if (!bkey_cmp(k.k->p, hash_k.k->p))
816 if (fsck_err_on(k.k->type == desc.key_type &&
817 !desc.cmp_bkey(k, hash_k), c,
818 "duplicate hash table keys:\n%s",
819 (printbuf_reset(&buf),
820 bch2_bkey_val_to_text(&buf, c, hash_k),
822 ret = bch2_hash_delete_at(trans, desc, hash_info, k_iter, 0) ?: 1;
826 if (bkey_deleted(k.k)) {
827 bch2_trans_iter_exit(trans, &iter);
832 bch2_trans_iter_exit(trans, &iter);
836 if (fsck_err(c, "hash table key at wrong offset: btree %s inode %llu offset %llu, "
837 "hashed to %llu\n%s",
838 bch2_btree_ids[desc.btree_id], hash_k.k->p.inode, hash_k.k->p.offset, hash,
839 (printbuf_reset(&buf),
840 bch2_bkey_val_to_text(&buf, c, hash_k), buf.buf)) == FSCK_ERR_IGNORE)
843 ret = hash_redo_key(trans, desc, hash_info, k_iter, hash_k);
845 bch_err(c, "hash_redo_key err %i", ret);
853 static int check_inode(struct btree_trans *trans,
854 struct btree_iter *iter,
856 struct bch_inode_unpacked *prev,
857 struct snapshots_seen *s,
860 struct bch_fs *c = trans->c;
861 struct bch_inode_unpacked u;
862 bool do_update = false;
865 ret = check_key_has_snapshot(trans, iter, k);
871 ret = snapshots_seen_update(c, s, iter->btree_id, k.k->p);
876 * if snapshot id isn't a leaf node, skip it - deletion in
877 * particular is not atomic, so on the internal snapshot nodes
878 * we can see inodes marked for deletion after a clean shutdown
880 if (bch2_snapshot_internal_node(c, k.k->p.snapshot))
883 if (!bkey_is_inode(k.k))
886 BUG_ON(bch2_inode_unpack(k, &u));
889 !(u.bi_flags & (BCH_INODE_I_SIZE_DIRTY|
890 BCH_INODE_I_SECTORS_DIRTY|
891 BCH_INODE_UNLINKED)))
894 if (prev->bi_inum != u.bi_inum)
897 if (fsck_err_on(prev->bi_hash_seed != u.bi_hash_seed ||
898 inode_d_type(prev) != inode_d_type(&u), c,
899 "inodes in different snapshots don't match")) {
900 bch_err(c, "repair not implemented yet");
904 if (u.bi_flags & BCH_INODE_UNLINKED &&
906 fsck_err(c, "filesystem marked clean, but inode %llu unlinked",
908 bch2_trans_unlock(trans);
911 ret = fsck_inode_rm(trans, u.bi_inum, iter->pos.snapshot);
913 bch_err(c, "error in fsck: error %i while deleting inode", ret);
917 if (u.bi_flags & BCH_INODE_I_SIZE_DIRTY &&
919 fsck_err(c, "filesystem marked clean, but inode %llu has i_size dirty",
921 bch_verbose(c, "truncating inode %llu", u.bi_inum);
923 bch2_trans_unlock(trans);
927 * XXX: need to truncate partial blocks too here - or ideally
928 * just switch units to bytes and that issue goes away
930 ret = bch2_btree_delete_range_trans(trans, BTREE_ID_extents,
931 SPOS(u.bi_inum, round_up(u.bi_size, block_bytes(c)) >> 9,
933 POS(u.bi_inum, U64_MAX),
936 bch_err(c, "error in fsck: error %i truncating inode", ret);
941 * We truncated without our normal sector accounting hook, just
942 * make sure we recalculate it:
944 u.bi_flags |= BCH_INODE_I_SECTORS_DIRTY;
946 u.bi_flags &= ~BCH_INODE_I_SIZE_DIRTY;
950 if (u.bi_flags & BCH_INODE_I_SECTORS_DIRTY &&
952 fsck_err(c, "filesystem marked clean, but inode %llu has i_sectors dirty",
956 bch_verbose(c, "recounting sectors for inode %llu",
959 sectors = bch2_count_inode_sectors(trans, u.bi_inum, iter->pos.snapshot);
961 bch_err(c, "error in fsck: error %i recounting inode sectors",
966 u.bi_sectors = sectors;
967 u.bi_flags &= ~BCH_INODE_I_SECTORS_DIRTY;
971 if (u.bi_flags & BCH_INODE_BACKPTR_UNTRUSTED) {
974 u.bi_flags &= ~BCH_INODE_BACKPTR_UNTRUSTED;
979 ret = __write_inode(trans, &u, iter->pos.snapshot);
981 bch_err(c, "error in fsck: error %i "
982 "updating inode", ret);
987 bch_err(c, "error %i from check_inode()", ret);
992 static int check_inodes(struct bch_fs *c, bool full)
994 struct btree_trans trans;
995 struct btree_iter iter;
996 struct bch_inode_unpacked prev = { 0 };
997 struct snapshots_seen s;
1001 snapshots_seen_init(&s);
1002 bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
1004 ret = for_each_btree_key_commit(&trans, iter, BTREE_ID_inodes,
1006 BTREE_ITER_PREFETCH|BTREE_ITER_ALL_SNAPSHOTS,
1009 BTREE_INSERT_LAZY_RW|BTREE_INSERT_NOFAIL,
1010 check_inode(&trans, &iter, k, &prev, &s, full));
1012 bch2_trans_exit(&trans);
1013 snapshots_seen_exit(&s);
1015 bch_err(c, "error %i from check_inodes()", ret);
1020 * Checking for overlapping extents needs to be reimplemented
1023 static int fix_overlapping_extent(struct btree_trans *trans,
1024 struct bkey_s_c k, struct bpos cut_at)
1026 struct btree_iter iter;
1030 u = bch2_trans_kmalloc(trans, bkey_bytes(k.k));
1031 ret = PTR_ERR_OR_ZERO(u);
1035 bkey_reassemble(u, k);
1036 bch2_cut_front(cut_at, u);
1040 * We don't want to go through the extent_handle_overwrites path:
1042 * XXX: this is going to screw up disk accounting, extent triggers
1043 * assume things about extent overwrites - we should be running the
1044 * triggers manually here
1046 bch2_trans_iter_init(trans, &iter, BTREE_ID_extents, u->k.p,
1047 BTREE_ITER_INTENT|BTREE_ITER_NOT_EXTENTS);
1049 BUG_ON(iter.flags & BTREE_ITER_IS_EXTENTS);
1050 ret = bch2_btree_iter_traverse(&iter) ?:
1051 bch2_trans_update(trans, &iter, u, BTREE_TRIGGER_NORUN) ?:
1052 bch2_trans_commit(trans, NULL, NULL,
1053 BTREE_INSERT_NOFAIL|
1054 BTREE_INSERT_LAZY_RW);
1055 bch2_trans_iter_exit(trans, &iter);
1060 static struct bkey_s_c_dirent dirent_get_by_pos(struct btree_trans *trans,
1061 struct btree_iter *iter,
1067 bch2_trans_iter_init(trans, iter, BTREE_ID_dirents, pos, 0);
1068 k = bch2_btree_iter_peek_slot(iter);
1070 if (!ret && k.k->type != KEY_TYPE_dirent)
1073 bch2_trans_iter_exit(trans, iter);
1074 return (struct bkey_s_c_dirent) { .k = ERR_PTR(ret) };
1077 return bkey_s_c_to_dirent(k);
1080 static bool inode_points_to_dirent(struct bch_inode_unpacked *inode,
1081 struct bkey_s_c_dirent d)
1083 return inode->bi_dir == d.k->p.inode &&
1084 inode->bi_dir_offset == d.k->p.offset;
1087 static bool dirent_points_to_inode(struct bkey_s_c_dirent d,
1088 struct bch_inode_unpacked *inode)
1090 return d.v->d_type == DT_SUBVOL
1091 ? le32_to_cpu(d.v->d_child_subvol) == inode->bi_subvol
1092 : le64_to_cpu(d.v->d_inum) == inode->bi_inum;
1095 static int inode_backpointer_exists(struct btree_trans *trans,
1096 struct bch_inode_unpacked *inode,
1099 struct btree_iter iter;
1100 struct bkey_s_c_dirent d;
1103 d = dirent_get_by_pos(trans, &iter,
1104 SPOS(inode->bi_dir, inode->bi_dir_offset, snapshot));
1105 ret = bkey_err(d.s_c);
1107 return ret == -ENOENT ? 0 : ret;
1109 ret = dirent_points_to_inode(d, inode);
1110 bch2_trans_iter_exit(trans, &iter);
1114 static int check_i_sectors(struct btree_trans *trans, struct inode_walker *w)
1116 struct bch_fs *c = trans->c;
1117 struct inode_walker_entry *i;
1118 int ret = 0, ret2 = 0;
1121 darray_for_each(w->inodes, i) {
1122 if (i->inode.bi_sectors == i->count)
1125 count2 = lockrestart_do(trans,
1126 bch2_count_inode_sectors(trans, w->cur_inum, i->snapshot));
1128 if (i->count != count2) {
1129 bch_err(c, "fsck counted i_sectors wrong: got %llu should be %llu",
1132 if (i->inode.bi_sectors == i->count)
1136 if (fsck_err_on(!(i->inode.bi_flags & BCH_INODE_I_SECTORS_DIRTY), c,
1137 "inode %llu:%u has incorrect i_sectors: got %llu, should be %llu",
1138 w->cur_inum, i->snapshot,
1139 i->inode.bi_sectors, i->count) == FSCK_ERR_IGNORE)
1142 i->inode.bi_sectors = i->count;
1143 ret = write_inode(trans, &i->inode, i->snapshot);
1150 bch_err(c, "error %i from check_i_sectors()", ret);
1154 static int check_extent(struct btree_trans *trans, struct btree_iter *iter,
1156 struct inode_walker *inode,
1157 struct snapshots_seen *s)
1159 struct bch_fs *c = trans->c;
1160 struct inode_walker_entry *i;
1161 struct printbuf buf = PRINTBUF;
1165 ret = check_key_has_snapshot(trans, iter, k);
1167 ret = ret < 0 ? ret : 0;
1172 equiv.snapshot = bch2_snapshot_equiv(c, k.k->p.snapshot);
1174 ret = snapshots_seen_update(c, s, iter->btree_id, k.k->p);
1178 if (k.k->type == KEY_TYPE_whiteout)
1181 if (inode->cur_inum != k.k->p.inode) {
1182 ret = check_i_sectors(trans, inode);
1187 if (!iter->path->should_be_locked) {
1189 * hack: check_i_sectors may have handled a transaction restart,
1190 * it shouldn't be but we need to fix the new i_sectors check
1191 * code and delete the old bch2_count_inode_sectors() first
1196 if (bkey_cmp(prev.k->k.p, bkey_start_pos(k.k)) > 0) {
1200 bch2_bkey_val_to_text(&PBUF(buf1), c, bkey_i_to_s_c(prev.k));
1201 bch2_bkey_val_to_text(&PBUF(buf2), c, k);
1203 if (fsck_err(c, "overlapping extents:\n%s\n%s", buf1, buf2)) {
1204 ret = fix_overlapping_extent(trans, k, prev.k->k.p) ?: -EINTR;
1209 ret = __walk_inode(trans, inode, equiv);
1213 if (fsck_err_on(ret == INT_MAX, c,
1214 "extent in missing inode:\n %s",
1215 (printbuf_reset(&buf),
1216 bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1217 ret = bch2_btree_delete_at(trans, iter,
1218 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
1222 if (ret == INT_MAX) {
1227 i = inode->inodes.data + ret;
1230 if (fsck_err_on(!S_ISREG(i->inode.bi_mode) &&
1231 !S_ISLNK(i->inode.bi_mode), c,
1232 "extent in non regular inode mode %o:\n %s",
1234 (printbuf_reset(&buf),
1235 bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1236 ret = bch2_btree_delete_at(trans, iter,
1237 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
1242 * Check inodes in reverse order, from oldest snapshots to newest, so
1243 * that we emit the fewest number of whiteouts necessary:
1245 for (i = inode->inodes.data + inode->inodes.nr - 1;
1246 i >= inode->inodes.data;
1248 if (i->snapshot > equiv.snapshot ||
1249 !key_visible_in_snapshot(c, s, i->snapshot, equiv.snapshot))
1252 if (fsck_err_on(!(i->inode.bi_flags & BCH_INODE_I_SIZE_DIRTY) &&
1253 k.k->type != KEY_TYPE_reservation &&
1254 k.k->p.offset > round_up(i->inode.bi_size, block_bytes(c)) >> 9, c,
1255 "extent type past end of inode %llu:%u, i_size %llu\n %s",
1256 i->inode.bi_inum, i->snapshot, i->inode.bi_size,
1257 (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1258 struct btree_iter iter2;
1260 bch2_trans_copy_iter(&iter2, iter);
1261 bch2_btree_iter_set_snapshot(&iter2, i->snapshot);
1262 ret = bch2_btree_iter_traverse(&iter2) ?:
1263 bch2_btree_delete_at(trans, &iter2,
1264 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
1265 bch2_trans_iter_exit(trans, &iter2);
1269 if (i->snapshot != equiv.snapshot) {
1270 ret = snapshots_seen_add(c, s, i->snapshot);
1277 if (bkey_extent_is_allocation(k.k))
1278 for_each_visible_inode(c, s, inode, equiv.snapshot, i)
1279 i->count += k.k->size;
1281 bch2_bkey_buf_reassemble(&prev, c, k);
1287 printbuf_exit(&buf);
1289 if (ret && ret != -EINTR)
1290 bch_err(c, "error %i from check_extent()", ret);
1295 * Walk extents: verify that extents have a corresponding S_ISREG inode, and
1296 * that i_size an i_sectors are consistent
1299 static int check_extents(struct bch_fs *c)
1301 struct inode_walker w = inode_walker_init();
1302 struct snapshots_seen s;
1303 struct btree_trans trans;
1304 struct btree_iter iter;
1309 struct bkey_buf prev;
1310 bch2_bkey_buf_init(&prev);
1311 prev.k->k = KEY(0, 0, 0);
1313 snapshots_seen_init(&s);
1314 bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
1316 bch_verbose(c, "checking extents");
1318 ret = for_each_btree_key_commit(&trans, iter, BTREE_ID_extents,
1319 POS(BCACHEFS_ROOT_INO, 0),
1320 BTREE_ITER_PREFETCH|BTREE_ITER_ALL_SNAPSHOTS, k,
1322 BTREE_INSERT_LAZY_RW|BTREE_INSERT_NOFAIL,
1323 check_extent(&trans, &iter, k, &w, &s));
1325 bch2_bkey_buf_exit(&prev, c);
1327 inode_walker_exit(&w);
1328 bch2_trans_exit(&trans);
1329 snapshots_seen_exit(&s);
1332 bch_err(c, "error %i from check_extents()", ret);
1336 static int check_subdir_count(struct btree_trans *trans, struct inode_walker *w)
1338 struct bch_fs *c = trans->c;
1339 struct inode_walker_entry *i;
1340 int ret = 0, ret2 = 0;
1343 darray_for_each(w->inodes, i) {
1344 if (i->inode.bi_nlink == i->count)
1347 count2 = bch2_count_subdirs(trans, w->cur_inum, i->snapshot);
1351 if (i->count != count2) {
1352 bch_err(c, "fsck counted subdirectories wrong: got %llu should be %llu",
1355 if (i->inode.bi_nlink == i->count)
1359 if (fsck_err_on(i->inode.bi_nlink != i->count, c,
1360 "directory %llu:%u with wrong i_nlink: got %u, should be %llu",
1361 w->cur_inum, i->snapshot, i->inode.bi_nlink, i->count)) {
1362 i->inode.bi_nlink = i->count;
1363 ret = write_inode(trans, &i->inode, i->snapshot);
1371 bch_err(c, "error %i from check_subdir_count()", ret);
1375 static int check_dirent_target(struct btree_trans *trans,
1376 struct btree_iter *iter,
1377 struct bkey_s_c_dirent d,
1378 struct bch_inode_unpacked *target,
1379 u32 target_snapshot)
1381 struct bch_fs *c = trans->c;
1382 struct bkey_i_dirent *n;
1383 bool backpointer_exists = true;
1384 struct printbuf buf = PRINTBUF;
1387 if (!target->bi_dir &&
1388 !target->bi_dir_offset) {
1389 target->bi_dir = d.k->p.inode;
1390 target->bi_dir_offset = d.k->p.offset;
1392 ret = __write_inode(trans, target, target_snapshot);
1397 if (!inode_points_to_dirent(target, d)) {
1398 ret = inode_backpointer_exists(trans, target, d.k->p.snapshot);
1402 backpointer_exists = ret;
1405 if (fsck_err_on(S_ISDIR(target->bi_mode) &&
1406 backpointer_exists, c,
1407 "directory %llu with multiple links",
1409 ret = __remove_dirent(trans, d.k->p);
1413 if (fsck_err_on(backpointer_exists &&
1414 !target->bi_nlink, c,
1415 "inode %llu type %s has multiple links but i_nlink 0",
1416 target->bi_inum, bch2_d_types[d.v->d_type])) {
1418 target->bi_flags &= ~BCH_INODE_UNLINKED;
1420 ret = __write_inode(trans, target, target_snapshot);
1425 if (fsck_err_on(!backpointer_exists, c,
1426 "inode %llu:%u has wrong backpointer:\n"
1428 "should be %llu:%llu",
1429 target->bi_inum, target_snapshot,
1431 target->bi_dir_offset,
1434 target->bi_dir = d.k->p.inode;
1435 target->bi_dir_offset = d.k->p.offset;
1437 ret = __write_inode(trans, target, target_snapshot);
1443 if (fsck_err_on(d.v->d_type != inode_d_type(target), c,
1444 "incorrect d_type: got %s, should be %s:\n%s",
1445 bch2_d_type_str(d.v->d_type),
1446 bch2_d_type_str(inode_d_type(target)),
1447 (printbuf_reset(&buf),
1448 bch2_bkey_val_to_text(&buf, c, d.s_c), buf.buf))) {
1449 n = bch2_trans_kmalloc(trans, bkey_bytes(d.k));
1450 ret = PTR_ERR_OR_ZERO(n);
1454 bkey_reassemble(&n->k_i, d.s_c);
1455 n->v.d_type = inode_d_type(target);
1457 ret = bch2_trans_update(trans, iter, &n->k_i, 0);
1461 d = dirent_i_to_s_c(n);
1464 if (d.v->d_type == DT_SUBVOL &&
1465 target->bi_parent_subvol != le32_to_cpu(d.v->d_parent_subvol) &&
1466 (c->sb.version < bcachefs_metadata_version_subvol_dirent ||
1467 fsck_err(c, "dirent has wrong d_parent_subvol field: got %u, should be %u",
1468 le32_to_cpu(d.v->d_parent_subvol),
1469 target->bi_parent_subvol))) {
1470 n = bch2_trans_kmalloc(trans, bkey_bytes(d.k));
1471 ret = PTR_ERR_OR_ZERO(n);
1475 bkey_reassemble(&n->k_i, d.s_c);
1476 n->v.d_parent_subvol = cpu_to_le32(target->bi_parent_subvol);
1478 ret = bch2_trans_update(trans, iter, &n->k_i, 0);
1482 d = dirent_i_to_s_c(n);
1487 printbuf_exit(&buf);
1489 if (ret && ret != -EINTR)
1490 bch_err(c, "error %i from check_target()", ret);
1494 static int check_dirent(struct btree_trans *trans, struct btree_iter *iter,
1496 struct bch_hash_info *hash_info,
1497 struct inode_walker *dir,
1498 struct inode_walker *target,
1499 struct snapshots_seen *s)
1501 struct bch_fs *c = trans->c;
1502 struct bkey_s_c_dirent d;
1503 struct inode_walker_entry *i;
1504 struct printbuf buf = PRINTBUF;
1508 ret = check_key_has_snapshot(trans, iter, k);
1510 ret = ret < 0 ? ret : 0;
1515 equiv.snapshot = bch2_snapshot_equiv(c, k.k->p.snapshot);
1517 ret = snapshots_seen_update(c, s, iter->btree_id, k.k->p);
1521 if (k.k->type == KEY_TYPE_whiteout)
1524 if (dir->cur_inum != k.k->p.inode) {
1525 ret = check_subdir_count(trans, dir);
1530 if (!iter->path->should_be_locked) {
1531 /* hack: see check_extent() */
1535 ret = __walk_inode(trans, dir, equiv);
1539 if (fsck_err_on(ret == INT_MAX, c,
1540 "dirent in nonexisting directory:\n%s",
1541 (printbuf_reset(&buf),
1542 bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1543 ret = bch2_btree_delete_at(trans, iter,
1544 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
1548 if (ret == INT_MAX) {
1553 i = dir->inodes.data + ret;
1556 if (fsck_err_on(!S_ISDIR(i->inode.bi_mode), c,
1557 "dirent in non directory inode type %s:\n%s",
1558 bch2_d_type_str(inode_d_type(&i->inode)),
1559 (printbuf_reset(&buf),
1560 bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
1561 ret = bch2_btree_delete_at(trans, iter, 0);
1565 if (dir->first_this_inode)
1566 *hash_info = bch2_hash_info_init(c, &dir->inodes.data[0].inode);
1568 ret = hash_check_key(trans, bch2_dirent_hash_desc,
1569 hash_info, iter, k);
1573 /* dirent has been deleted */
1578 if (k.k->type != KEY_TYPE_dirent)
1581 d = bkey_s_c_to_dirent(k);
1583 if (d.v->d_type == DT_SUBVOL) {
1584 struct bch_inode_unpacked subvol_root;
1585 u32 target_subvol = le32_to_cpu(d.v->d_child_subvol);
1586 u32 target_snapshot;
1589 ret = __subvol_lookup(trans, target_subvol,
1590 &target_snapshot, &target_inum);
1591 if (ret && ret != -ENOENT)
1594 if (fsck_err_on(ret, c,
1595 "dirent points to missing subvolume %llu",
1596 le64_to_cpu(d.v->d_child_subvol))) {
1597 ret = __remove_dirent(trans, d.k->p);
1601 ret = __lookup_inode(trans, target_inum,
1602 &subvol_root, &target_snapshot);
1603 if (ret && ret != -ENOENT)
1606 if (fsck_err_on(ret, c,
1607 "subvolume %u points to missing subvolume root %llu",
1610 bch_err(c, "repair not implemented yet");
1615 if (fsck_err_on(subvol_root.bi_subvol != target_subvol, c,
1616 "subvol root %llu has wrong bi_subvol field: got %u, should be %u",
1618 subvol_root.bi_subvol, target_subvol)) {
1619 subvol_root.bi_subvol = target_subvol;
1620 ret = __write_inode(trans, &subvol_root, target_snapshot);
1625 ret = check_dirent_target(trans, iter, d, &subvol_root,
1630 ret = __get_visible_inodes(trans, target, s, le64_to_cpu(d.v->d_inum));
1634 if (fsck_err_on(!target->inodes.nr, c,
1635 "dirent points to missing inode: (equiv %u)\n%s",
1637 (printbuf_reset(&buf),
1638 bch2_bkey_val_to_text(&buf, c, k),
1640 ret = __remove_dirent(trans, d.k->p);
1645 darray_for_each(target->inodes, i) {
1646 ret = check_dirent_target(trans, iter, d,
1647 &i->inode, i->snapshot);
1653 if (d.v->d_type == DT_DIR)
1654 for_each_visible_inode(c, s, dir, equiv.snapshot, i)
1660 printbuf_exit(&buf);
1662 if (ret && ret != -EINTR)
1663 bch_err(c, "error %i from check_dirent()", ret);
1668 * Walk dirents: verify that they all have a corresponding S_ISDIR inode,
1672 static int check_dirents(struct bch_fs *c)
1674 struct inode_walker dir = inode_walker_init();
1675 struct inode_walker target = inode_walker_init();
1676 struct snapshots_seen s;
1677 struct bch_hash_info hash_info;
1678 struct btree_trans trans;
1679 struct btree_iter iter;
1683 bch_verbose(c, "checking dirents");
1685 snapshots_seen_init(&s);
1686 bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
1688 ret = for_each_btree_key_commit(&trans, iter, BTREE_ID_dirents,
1689 POS(BCACHEFS_ROOT_INO, 0),
1690 BTREE_ITER_PREFETCH|BTREE_ITER_ALL_SNAPSHOTS,
1693 BTREE_INSERT_LAZY_RW|BTREE_INSERT_NOFAIL,
1694 check_dirent(&trans, &iter, k, &hash_info, &dir, &target, &s));
1696 bch2_trans_exit(&trans);
1697 snapshots_seen_exit(&s);
1698 inode_walker_exit(&dir);
1699 inode_walker_exit(&target);
1702 bch_err(c, "error %i from check_dirents()", ret);
1706 static int check_xattr(struct btree_trans *trans, struct btree_iter *iter,
1708 struct bch_hash_info *hash_info,
1709 struct inode_walker *inode)
1711 struct bch_fs *c = trans->c;
1714 ret = check_key_has_snapshot(trans, iter, k);
1718 ret = __walk_inode(trans, inode, k.k->p);
1722 if (fsck_err_on(ret == INT_MAX, c,
1723 "xattr for missing inode %llu",
1725 return bch2_btree_delete_at(trans, iter, 0);
1732 if (inode->first_this_inode)
1733 *hash_info = bch2_hash_info_init(c, &inode->inodes.data[0].inode);
1735 ret = hash_check_key(trans, bch2_xattr_hash_desc, hash_info, iter, k);
1737 if (ret && ret != -EINTR)
1738 bch_err(c, "error %i from check_xattr()", ret);
1743 * Walk xattrs: verify that they all have a corresponding inode
1746 static int check_xattrs(struct bch_fs *c)
1748 struct inode_walker inode = inode_walker_init();
1749 struct bch_hash_info hash_info;
1750 struct btree_trans trans;
1751 struct btree_iter iter;
1755 bch_verbose(c, "checking xattrs");
1757 bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
1759 ret = for_each_btree_key_commit(&trans, iter, BTREE_ID_xattrs,
1760 POS(BCACHEFS_ROOT_INO, 0),
1761 BTREE_ITER_PREFETCH|BTREE_ITER_ALL_SNAPSHOTS,
1764 BTREE_INSERT_LAZY_RW|BTREE_INSERT_NOFAIL,
1765 check_xattr(&trans, &iter, k, &hash_info, &inode));
1767 bch2_trans_exit(&trans);
1770 bch_err(c, "error %i from check_xattrs()", ret);
1774 static int check_root_trans(struct btree_trans *trans)
1776 struct bch_fs *c = trans->c;
1777 struct bch_inode_unpacked root_inode;
1782 ret = __subvol_lookup(trans, BCACHEFS_ROOT_SUBVOL, &snapshot, &inum);
1783 if (ret && ret != -ENOENT)
1786 if (mustfix_fsck_err_on(ret, c, "root subvol missing")) {
1787 struct bkey_i_subvolume root_subvol;
1790 inum = BCACHEFS_ROOT_INO;
1792 bkey_subvolume_init(&root_subvol.k_i);
1793 root_subvol.k.p.offset = BCACHEFS_ROOT_SUBVOL;
1794 root_subvol.v.flags = 0;
1795 root_subvol.v.snapshot = cpu_to_le32(snapshot);
1796 root_subvol.v.inode = cpu_to_le64(inum);
1797 ret = commit_do(trans, NULL, NULL,
1798 BTREE_INSERT_NOFAIL|
1799 BTREE_INSERT_LAZY_RW,
1800 __bch2_btree_insert(trans, BTREE_ID_subvolumes, &root_subvol.k_i));
1802 bch_err(c, "error writing root subvol: %i", ret);
1808 ret = __lookup_inode(trans, BCACHEFS_ROOT_INO, &root_inode, &snapshot);
1809 if (ret && ret != -ENOENT)
1812 if (mustfix_fsck_err_on(ret, c, "root directory missing") ||
1813 mustfix_fsck_err_on(!S_ISDIR(root_inode.bi_mode), c,
1814 "root inode not a directory")) {
1815 bch2_inode_init(c, &root_inode, 0, 0, S_IFDIR|0755,
1817 root_inode.bi_inum = inum;
1819 ret = __write_inode(trans, &root_inode, snapshot);
1821 bch_err(c, "error writing root inode: %i", ret);
1828 /* Get root directory, create if it doesn't exist: */
1830 static int check_root(struct bch_fs *c)
1832 bch_verbose(c, "checking root directory");
1834 return bch2_trans_do(c, NULL, NULL,
1835 BTREE_INSERT_NOFAIL|
1836 BTREE_INSERT_LAZY_RW,
1837 check_root_trans(&trans));
1840 struct pathbuf_entry {
1845 typedef DARRAY(struct pathbuf_entry) pathbuf;
1847 static bool path_is_dup(pathbuf *p, u64 inum, u32 snapshot)
1849 struct pathbuf_entry *i;
1851 darray_for_each(*p, i)
1852 if (i->inum == inum &&
1853 i->snapshot == snapshot)
1859 static int path_down(struct bch_fs *c, pathbuf *p,
1860 u64 inum, u32 snapshot)
1862 int ret = darray_push(p, ((struct pathbuf_entry) {
1864 .snapshot = snapshot,
1868 bch_err(c, "fsck: error allocating memory for pathbuf, size %zu",
1874 * Check that a given inode is reachable from the root:
1876 * XXX: we should also be verifying that inodes are in the right subvolumes
1878 static int check_path(struct btree_trans *trans,
1880 struct bch_inode_unpacked *inode,
1883 struct bch_fs *c = trans->c;
1886 snapshot = bch2_snapshot_equiv(c, snapshot);
1889 while (!(inode->bi_inum == BCACHEFS_ROOT_INO &&
1890 inode->bi_subvol == BCACHEFS_ROOT_SUBVOL)) {
1891 struct btree_iter dirent_iter;
1892 struct bkey_s_c_dirent d;
1893 u32 parent_snapshot = snapshot;
1895 if (inode->bi_subvol) {
1898 ret = subvol_lookup(trans, inode->bi_parent_subvol,
1899 &parent_snapshot, &inum);
1904 ret = lockrestart_do(trans,
1905 PTR_ERR_OR_ZERO((d = dirent_get_by_pos(trans, &dirent_iter,
1906 SPOS(inode->bi_dir, inode->bi_dir_offset,
1907 parent_snapshot))).k));
1908 if (ret && ret != -ENOENT)
1911 if (!ret && !dirent_points_to_inode(d, inode)) {
1912 bch2_trans_iter_exit(trans, &dirent_iter);
1916 if (ret == -ENOENT) {
1917 if (fsck_err(c, "unreachable inode %llu:%u, type %s nlink %u backptr %llu:%llu",
1918 inode->bi_inum, snapshot,
1919 bch2_d_type_str(inode_d_type(inode)),
1922 inode->bi_dir_offset))
1923 ret = reattach_inode(trans, inode, snapshot);
1927 bch2_trans_iter_exit(trans, &dirent_iter);
1929 if (!S_ISDIR(inode->bi_mode))
1932 ret = path_down(c, p, inode->bi_inum, snapshot);
1934 bch_err(c, "memory allocation failure");
1938 snapshot = parent_snapshot;
1940 ret = lookup_inode(trans, inode->bi_dir, inode, &snapshot);
1942 /* Should have been caught in dirents pass */
1943 bch_err(c, "error looking up parent directory: %i", ret);
1947 if (path_is_dup(p, inode->bi_inum, snapshot)) {
1948 struct pathbuf_entry *i;
1950 /* XXX print path */
1951 bch_err(c, "directory structure loop");
1953 darray_for_each(*p, i)
1954 pr_err("%llu:%u", i->inum, i->snapshot);
1955 pr_err("%llu:%u", inode->bi_inum, snapshot);
1957 if (!fsck_err(c, "directory structure loop"))
1960 ret = commit_do(trans, NULL, NULL,
1961 BTREE_INSERT_NOFAIL|
1962 BTREE_INSERT_LAZY_RW,
1963 remove_backpointer(trans, inode));
1965 bch_err(c, "error removing dirent: %i", ret);
1969 ret = reattach_inode(trans, inode, snapshot);
1974 bch_err(c, "%s: err %i", __func__, ret);
1979 * Check for unreachable inodes, as well as loops in the directory structure:
1980 * After check_dirents(), if an inode backpointer doesn't exist that means it's
1984 static int check_directory_structure(struct bch_fs *c)
1986 struct btree_trans trans;
1987 struct btree_iter iter;
1989 struct bch_inode_unpacked u;
1990 pathbuf path = { 0, };
1993 bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
1995 for_each_btree_key(&trans, iter, BTREE_ID_inodes, POS_MIN,
1997 BTREE_ITER_PREFETCH|
1998 BTREE_ITER_ALL_SNAPSHOTS, k, ret) {
1999 if (!bkey_is_inode(k.k))
2002 ret = bch2_inode_unpack(k, &u);
2004 /* Should have been caught earlier in fsck: */
2005 bch_err(c, "error unpacking inode %llu: %i", k.k->p.offset, ret);
2009 if (u.bi_flags & BCH_INODE_UNLINKED)
2012 ret = check_path(&trans, &path, &u, iter.pos.snapshot);
2016 bch2_trans_iter_exit(&trans, &iter);
2018 BUG_ON(ret == -EINTR);
2022 bch2_trans_exit(&trans);
2026 struct nlink_table {
2037 static int add_nlink(struct bch_fs *c, struct nlink_table *t,
2038 u64 inum, u32 snapshot)
2040 if (t->nr == t->size) {
2041 size_t new_size = max_t(size_t, 128UL, t->size * 2);
2042 void *d = kvmalloc(new_size * sizeof(t->d[0]), GFP_KERNEL);
2044 bch_err(c, "fsck: error allocating memory for nlink_table, size %zu",
2050 memcpy(d, t->d, t->size * sizeof(t->d[0]));
2058 t->d[t->nr++] = (struct nlink) {
2060 .snapshot = snapshot,
2066 static int nlink_cmp(const void *_l, const void *_r)
2068 const struct nlink *l = _l;
2069 const struct nlink *r = _r;
2071 return cmp_int(l->inum, r->inum) ?: cmp_int(l->snapshot, r->snapshot);
2074 static void inc_link(struct bch_fs *c, struct snapshots_seen *s,
2075 struct nlink_table *links,
2076 u64 range_start, u64 range_end, u64 inum, u32 snapshot)
2078 struct nlink *link, key = {
2079 .inum = inum, .snapshot = U32_MAX,
2082 if (inum < range_start || inum >= range_end)
2085 link = __inline_bsearch(&key, links->d, links->nr,
2086 sizeof(links->d[0]), nlink_cmp);
2090 while (link > links->d && link[0].inum == link[-1].inum)
2093 for (; link < links->d + links->nr && link->inum == inum; link++)
2094 if (ref_visible(c, s, snapshot, link->snapshot)) {
2096 if (link->snapshot >= snapshot)
2102 static int check_nlinks_find_hardlinks(struct bch_fs *c,
2103 struct nlink_table *t,
2104 u64 start, u64 *end)
2106 struct btree_trans trans;
2107 struct btree_iter iter;
2109 struct bch_inode_unpacked u;
2112 bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
2114 for_each_btree_key(&trans, iter, BTREE_ID_inodes,
2117 BTREE_ITER_PREFETCH|
2118 BTREE_ITER_ALL_SNAPSHOTS, k, ret) {
2119 if (!bkey_is_inode(k.k))
2122 /* Should never fail, checked by bch2_inode_invalid: */
2123 BUG_ON(bch2_inode_unpack(k, &u));
2126 * Backpointer and directory structure checks are sufficient for
2127 * directories, since they can't have hardlinks:
2129 if (S_ISDIR(le16_to_cpu(u.bi_mode)))
2135 ret = add_nlink(c, t, k.k->p.offset, k.k->p.snapshot);
2137 *end = k.k->p.offset;
2143 bch2_trans_iter_exit(&trans, &iter);
2144 bch2_trans_exit(&trans);
2147 bch_err(c, "error in fsck: btree error %i while walking inodes", ret);
2153 static int check_nlinks_walk_dirents(struct bch_fs *c, struct nlink_table *links,
2154 u64 range_start, u64 range_end)
2156 struct btree_trans trans;
2157 struct snapshots_seen s;
2158 struct btree_iter iter;
2160 struct bkey_s_c_dirent d;
2163 snapshots_seen_init(&s);
2165 bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
2167 for_each_btree_key(&trans, iter, BTREE_ID_dirents, POS_MIN,
2169 BTREE_ITER_PREFETCH|
2170 BTREE_ITER_ALL_SNAPSHOTS, k, ret) {
2171 ret = snapshots_seen_update(c, &s, iter.btree_id, k.k->p);
2175 switch (k.k->type) {
2176 case KEY_TYPE_dirent:
2177 d = bkey_s_c_to_dirent(k);
2179 if (d.v->d_type != DT_DIR &&
2180 d.v->d_type != DT_SUBVOL)
2181 inc_link(c, &s, links, range_start, range_end,
2182 le64_to_cpu(d.v->d_inum),
2183 bch2_snapshot_equiv(c, d.k->p.snapshot));
2187 bch2_trans_iter_exit(&trans, &iter);
2190 bch_err(c, "error in fsck: btree error %i while walking dirents", ret);
2192 bch2_trans_exit(&trans);
2193 snapshots_seen_exit(&s);
2198 static int check_nlinks_update_hardlinks(struct bch_fs *c,
2199 struct nlink_table *links,
2200 u64 range_start, u64 range_end)
2202 struct btree_trans trans;
2203 struct btree_iter iter;
2205 struct bch_inode_unpacked u;
2206 struct nlink *link = links->d;
2209 bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
2211 for_each_btree_key(&trans, iter, BTREE_ID_inodes,
2212 POS(0, range_start),
2214 BTREE_ITER_PREFETCH|
2215 BTREE_ITER_ALL_SNAPSHOTS, k, ret) {
2216 if (k.k->p.offset >= range_end)
2219 if (!bkey_is_inode(k.k))
2222 BUG_ON(bch2_inode_unpack(k, &u));
2224 if (S_ISDIR(le16_to_cpu(u.bi_mode)))
2230 while ((cmp_int(link->inum, k.k->p.offset) ?:
2231 cmp_int(link->snapshot, k.k->p.snapshot)) < 0) {
2233 BUG_ON(link >= links->d + links->nr);
2236 if (fsck_err_on(bch2_inode_nlink_get(&u) != link->count, c,
2237 "inode %llu type %s has wrong i_nlink (%u, should be %u)",
2238 u.bi_inum, bch2_d_types[mode_to_type(u.bi_mode)],
2239 bch2_inode_nlink_get(&u), link->count)) {
2240 bch2_inode_nlink_set(&u, link->count);
2242 ret = write_inode(&trans, &u, k.k->p.snapshot);
2244 bch_err(c, "error in fsck: error %i updating inode", ret);
2248 bch2_trans_iter_exit(&trans, &iter);
2249 bch2_trans_exit(&trans);
2252 bch_err(c, "error in fsck: btree error %i while walking inodes", ret);
2258 static int check_nlinks(struct bch_fs *c)
2260 struct nlink_table links = { 0 };
2261 u64 this_iter_range_start, next_iter_range_start = 0;
2264 bch_verbose(c, "checking inode nlinks");
2267 this_iter_range_start = next_iter_range_start;
2268 next_iter_range_start = U64_MAX;
2270 ret = check_nlinks_find_hardlinks(c, &links,
2271 this_iter_range_start,
2272 &next_iter_range_start);
2274 ret = check_nlinks_walk_dirents(c, &links,
2275 this_iter_range_start,
2276 next_iter_range_start);
2280 ret = check_nlinks_update_hardlinks(c, &links,
2281 this_iter_range_start,
2282 next_iter_range_start);
2287 } while (next_iter_range_start != U64_MAX);
2294 static int fix_reflink_p_key(struct btree_trans *trans, struct btree_iter *iter)
2297 struct bkey_s_c_reflink_p p;
2298 struct bkey_i_reflink_p *u;
2301 k = bch2_btree_iter_peek(iter);
2309 if (k.k->type != KEY_TYPE_reflink_p)
2312 p = bkey_s_c_to_reflink_p(k);
2314 if (!p.v->front_pad && !p.v->back_pad)
2317 u = bch2_trans_kmalloc(trans, sizeof(*u));
2318 ret = PTR_ERR_OR_ZERO(u);
2322 bkey_reassemble(&u->k_i, k);
2326 return bch2_trans_update(trans, iter, &u->k_i, BTREE_TRIGGER_NORUN);
2330 static int fix_reflink_p(struct bch_fs *c)
2332 struct btree_trans trans;
2333 struct btree_iter iter;
2337 if (c->sb.version >= bcachefs_metadata_version_reflink_p_fix)
2340 bch_verbose(c, "fixing reflink_p keys");
2342 bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
2344 for_each_btree_key(&trans, iter, BTREE_ID_extents, POS_MIN,
2346 BTREE_ITER_PREFETCH|
2347 BTREE_ITER_ALL_SNAPSHOTS, k, ret) {
2348 if (k.k->type == KEY_TYPE_reflink_p) {
2349 ret = commit_do(&trans, NULL, NULL,
2350 BTREE_INSERT_NOFAIL|
2351 BTREE_INSERT_LAZY_RW,
2352 fix_reflink_p_key(&trans, &iter));
2357 bch2_trans_iter_exit(&trans, &iter);
2359 bch2_trans_exit(&trans);
2364 * Checks for inconsistencies that shouldn't happen, unless we have a bug.
2365 * Doesn't fix them yet, mainly because they haven't yet been observed:
2367 int bch2_fsck_full(struct bch_fs *c)
2371 ret = bch2_fs_check_snapshots(c) ?:
2372 bch2_fs_check_subvols(c) ?:
2373 bch2_delete_dead_snapshots(c) ?:
2374 check_inodes(c, true) ?:
2379 check_directory_structure(c) ?:
2383 if (ret == -NEED_SNAPSHOT_CLEANUP) {
2384 set_bit(BCH_FS_HAVE_DELETED_SNAPSHOTS, &c->flags);
2391 int bch2_fsck_walk_inodes_only(struct bch_fs *c)
2393 return bch2_fs_check_snapshots(c) ?:
2394 bch2_fs_check_subvols(c) ?:
2395 bch2_delete_dead_snapshots(c) ?:
2396 check_inodes(c, false);