1 // SPDX-License-Identifier: GPL-2.0
4 #include "alloc_background.h"
5 #include "backpointers.h"
6 #include "btree_cache.h"
7 #include "btree_update.h"
12 #define MAX_EXTENT_COMPRESS_RATIO_SHIFT 10
15 * Convert from pos in backpointer btree to pos of corresponding bucket in alloc
18 static inline struct bpos bp_pos_to_bucket(const struct bch_fs *c,
21 struct bch_dev *ca = bch_dev_bkey_exists(c, bp_pos.inode);
22 u64 bucket_sector = bp_pos.offset >> MAX_EXTENT_COMPRESS_RATIO_SHIFT;
24 return POS(bp_pos.inode, sector_to_bucket(ca, bucket_sector));
28 * Convert from pos in alloc btree + bucket offset to pos in backpointer btree:
30 static inline struct bpos bucket_pos_to_bp(const struct bch_fs *c,
34 struct bch_dev *ca = bch_dev_bkey_exists(c, bucket.inode);
37 ret = POS(bucket.inode,
38 (bucket_to_sector(ca, bucket.offset) <<
39 MAX_EXTENT_COMPRESS_RATIO_SHIFT) + bucket_offset);
41 BUG_ON(bkey_cmp(bucket, bp_pos_to_bucket(c, ret)));
46 void bch2_extent_ptr_to_bp(struct bch_fs *c,
47 enum btree_id btree_id, unsigned level,
48 struct bkey_s_c k, struct extent_ptr_decoded p,
49 struct bpos *bucket_pos, struct bch_backpointer *bp)
51 enum bch_data_type data_type = level ? BCH_DATA_btree : BCH_DATA_user;
52 s64 sectors = level ? btree_sectors(c) : k.k->size;
55 *bucket_pos = PTR_BUCKET_POS_OFFSET(c, &p.ptr, &bucket_offset);
56 *bp = (struct bch_backpointer) {
59 .data_type = data_type,
60 .bucket_offset = ((u64) bucket_offset << MAX_EXTENT_COMPRESS_RATIO_SHIFT) +
62 .bucket_len = ptr_disk_sectors(sectors, p),
67 static bool extent_matches_bp(struct bch_fs *c,
68 enum btree_id btree_id, unsigned level,
71 struct bch_backpointer bp)
73 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
74 const union bch_extent_entry *entry;
75 struct extent_ptr_decoded p;
77 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
79 struct bch_backpointer bp2;
84 bch2_extent_ptr_to_bp(c, btree_id, level, k, p,
86 if (!bpos_cmp(bucket, bucket2) &&
87 !memcmp(&bp, &bp2, sizeof(bp)))
94 int bch2_backpointer_invalid(const struct bch_fs *c, struct bkey_s_c k,
95 int rw, struct printbuf *err)
97 struct bkey_s_c_backpointer bp = bkey_s_c_to_backpointer(k);
98 struct bpos bucket = bp_pos_to_bucket(c, bp.k->p);
100 if (bkey_val_bytes(bp.k) < sizeof(*bp.v)) {
101 prt_str(err, "incorrect value size");
105 if (bpos_cmp(bp.k->p, bucket_pos_to_bp(c, bucket, bp.v->bucket_offset))) {
106 prt_str(err, "backpointer at wrong pos");
113 void bch2_backpointer_to_text(struct printbuf *out, const struct bch_backpointer *bp)
115 prt_printf(out, "btree=%s l=%u offset=%llu:%u len=%u pos=",
116 bch2_btree_ids[bp->btree_id],
118 (u64) (bp->bucket_offset >> MAX_EXTENT_COMPRESS_RATIO_SHIFT),
119 (u32) bp->bucket_offset & ~(~0U << MAX_EXTENT_COMPRESS_RATIO_SHIFT),
121 bch2_bpos_to_text(out, bp->pos);
124 void bch2_backpointer_k_to_text(struct printbuf *out, struct bch_fs *c, struct bkey_s_c k)
126 bch2_backpointer_to_text(out, bkey_s_c_to_backpointer(k).v);
129 void bch2_backpointer_swab(struct bkey_s k)
131 struct bkey_s_backpointer bp = bkey_s_to_backpointer(k);
133 bp.v->bucket_offset = swab32(bp.v->bucket_offset);
134 bp.v->bucket_len = swab32(bp.v->bucket_len);
135 bch2_bpos_swab(&bp.v->pos);
138 #define BACKPOINTER_OFFSET_MAX ((1ULL << 40) - 1)
140 static inline int backpointer_cmp(struct bch_backpointer l, struct bch_backpointer r)
142 return cmp_int(l.bucket_offset, r.bucket_offset);
145 static int bch2_backpointer_del_by_offset(struct btree_trans *trans,
148 struct bch_backpointer bp)
150 struct bch_fs *c = trans->c;
151 struct btree_iter iter;
155 if (bp_offset < BACKPOINTER_OFFSET_MAX) {
156 struct bch_backpointer *bps;
157 struct bkey_i_alloc_v4 *a;
160 bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc,
164 BTREE_ITER_WITH_UPDATES);
165 k = bch2_btree_iter_peek_slot(&iter);
170 if (k.k->type != KEY_TYPE_alloc_v4) {
175 a = bch2_alloc_to_v4_mut(trans, k);
176 ret = PTR_ERR_OR_ZERO(a);
179 bps = alloc_v4_backpointers(&a->v);
180 nr = BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v);
182 for (i = 0; i < nr; i++) {
183 if (bps[i].bucket_offset == bp_offset)
185 if (bps[i].bucket_offset > bp_offset)
192 if (memcmp(&bps[i], &bp, sizeof(bp))) {
196 array_remove_item(bps, nr, i);
197 SET_BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v, nr);
198 set_alloc_v4_u64s(a);
199 ret = bch2_trans_update(trans, &iter, &a->k_i, 0);
201 bp_offset -= BACKPOINTER_OFFSET_MAX;
203 bch2_trans_iter_init(trans, &iter, BTREE_ID_backpointers,
204 bucket_pos_to_bp(c, bucket, bp_offset),
207 BTREE_ITER_WITH_UPDATES);
208 k = bch2_btree_iter_peek_slot(&iter);
213 if (k.k->type != KEY_TYPE_backpointer ||
214 memcmp(bkey_s_c_to_backpointer(k).v, &bp, sizeof(bp))) {
219 ret = bch2_btree_delete_at(trans, &iter, 0);
222 bch2_trans_iter_exit(trans, &iter);
226 int bch2_bucket_backpointer_del(struct btree_trans *trans,
227 struct bkey_i_alloc_v4 *a,
228 struct bch_backpointer bp,
229 struct bkey_s_c orig_k)
231 struct bch_fs *c = trans->c;
232 struct bch_backpointer *bps = alloc_v4_backpointers(&a->v);
233 unsigned i, nr = BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v);
234 struct btree_iter bp_iter;
238 for (i = 0; i < nr; i++) {
239 int cmp = backpointer_cmp(bps[i], bp) ?:
240 memcmp(&bps[i], &bp, sizeof(bp));
249 array_remove_item(bps, nr, i);
250 SET_BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v, nr);
251 set_alloc_v4_u64s(a);
254 bch2_trans_iter_init(trans, &bp_iter, BTREE_ID_backpointers,
255 bucket_pos_to_bp(c, a->k.p, bp.bucket_offset),
258 BTREE_ITER_WITH_UPDATES);
259 k = bch2_btree_iter_peek_slot(&bp_iter);
264 if (k.k->type != KEY_TYPE_backpointer ||
265 memcmp(bkey_s_c_to_backpointer(k).v, &bp, sizeof(bp))) {
266 struct printbuf buf = PRINTBUF;
268 prt_printf(&buf, "backpointer not found when deleting");
270 printbuf_indent_add(&buf, 2);
272 prt_printf(&buf, "searching for ");
273 bch2_backpointer_to_text(&buf, &bp);
276 prt_printf(&buf, "got ");
277 bch2_bkey_val_to_text(&buf, c, k);
280 prt_str(&buf, "alloc ");
281 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&a->k_i));
284 prt_printf(&buf, "for ");
285 bch2_bkey_val_to_text(&buf, c, orig_k);
287 if (!test_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags)) {
288 bch_err(c, "%s", buf.buf);
291 bch2_trans_inconsistent(trans, "%s", buf.buf);
297 ret = bch2_btree_delete_at(trans, &bp_iter, 0);
299 bch2_trans_iter_exit(trans, &bp_iter);
303 int bch2_bucket_backpointer_add(struct btree_trans *trans,
304 struct bkey_i_alloc_v4 *a,
305 struct bch_backpointer bp,
306 struct bkey_s_c orig_k)
308 struct bch_fs *c = trans->c;
310 struct bch_backpointer *bps = alloc_v4_backpointers(&a->v);
311 unsigned i, nr = BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v);
312 struct bkey_i_backpointer *bp_k;
313 struct btree_iter bp_iter;
317 /* Check for duplicates: */
318 for (i = 0; i < nr; i++) {
319 int cmp = backpointer_cmp(bps[i], bp);
325 (bps[i - 1].bucket_offset +
326 bps[i - 1].bucket_len > bp.bucket_offset)) ||
328 (bp.bucket_offset + bp.bucket_len > bps[i].bucket_offset))) {
329 struct printbuf buf = PRINTBUF;
331 prt_printf(&buf, "overlapping backpointer found when inserting ");
332 bch2_backpointer_to_text(&buf, &bp);
334 printbuf_indent_add(&buf, 2);
336 prt_printf(&buf, "into ");
337 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&a->k_i));
340 prt_printf(&buf, "for ");
341 bch2_bkey_val_to_text(&buf, c, orig_k);
343 if (!test_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags))
344 bch_err(c, "%s", buf.buf);
346 bch2_trans_inconsistent(trans, "%s", buf.buf);
352 if (nr < BCH_ALLOC_V4_NR_BACKPOINTERS_MAX) {
353 array_insert_item(bps, nr, i, bp);
354 SET_BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v, nr);
355 set_alloc_v4_u64s(a);
359 /* Overflow: use backpointer btree */
360 bp_k = bch2_trans_kmalloc(trans, sizeof(*bp_k));
361 ret = PTR_ERR_OR_ZERO(bp_k);
365 ca = bch_dev_bkey_exists(c, a->k.p.inode);
367 bkey_backpointer_init(&bp_k->k_i);
368 bp_k->k.p = bucket_pos_to_bp(c, a->k.p, bp.bucket_offset);
371 bch2_trans_iter_init(trans, &bp_iter, BTREE_ID_backpointers, bp_k->k.p,
374 BTREE_ITER_WITH_UPDATES);
375 k = bch2_btree_iter_peek_slot(&bp_iter);
381 struct printbuf buf = PRINTBUF;
383 prt_printf(&buf, "existing btree backpointer key found when inserting ");
384 bch2_backpointer_to_text(&buf, &bp);
386 printbuf_indent_add(&buf, 2);
388 prt_printf(&buf, "found ");
389 bch2_bkey_val_to_text(&buf, c, k);
392 prt_printf(&buf, "for ");
393 bch2_bkey_val_to_text(&buf, c, orig_k);
395 if (!test_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags))
396 bch_err(c, "%s", buf.buf);
398 bch2_trans_inconsistent(trans, "%s", buf.buf);
405 ret = bch2_trans_update(trans, &bp_iter, &bp_k->k_i, 0);
407 bch2_trans_iter_exit(trans, &bp_iter);
412 * Find the next backpointer >= *bp_offset:
414 int bch2_get_next_backpointer(struct btree_trans *trans,
415 struct bpos bucket, int gen,
417 struct bch_backpointer *dst,
420 struct bch_fs *c = trans->c;
421 struct bpos bp_pos, bp_end_pos;
422 struct btree_iter alloc_iter, bp_iter = { NULL };
424 struct bkey_s_c_alloc_v4 a;
428 if (*bp_offset == U64_MAX)
431 bp_pos = bucket_pos_to_bp(c, bucket,
432 max(*bp_offset, BACKPOINTER_OFFSET_MAX) - BACKPOINTER_OFFSET_MAX);
433 bp_end_pos = bucket_pos_to_bp(c, bpos_nosnap_successor(bucket), 0);
435 bch2_trans_iter_init(trans, &alloc_iter, BTREE_ID_alloc,
436 bucket, BTREE_ITER_CACHED);
437 k = bch2_btree_iter_peek_slot(&alloc_iter);
442 if (k.k->type != KEY_TYPE_alloc_v4)
445 a = bkey_s_c_to_alloc_v4(k);
446 if (gen >= 0 && a.v->gen != gen)
449 for (i = 0; i < BCH_ALLOC_V4_NR_BACKPOINTERS(a.v); i++) {
450 if (alloc_v4_backpointers_c(a.v)[i].bucket_offset < *bp_offset)
453 *dst = alloc_v4_backpointers_c(a.v)[i];
454 *bp_offset = dst->bucket_offset;
458 for_each_btree_key_norestart(trans, bp_iter, BTREE_ID_backpointers,
460 if (bpos_cmp(k.k->p, bp_end_pos) >= 0)
463 if (k.k->type != KEY_TYPE_backpointer)
466 *dst = *bkey_s_c_to_backpointer(k).v;
467 *bp_offset = dst->bucket_offset + BACKPOINTER_OFFSET_MAX;
471 *bp_offset = U64_MAX;
473 bch2_trans_iter_exit(trans, &bp_iter);
474 bch2_trans_iter_exit(trans, &alloc_iter);
478 static void backpointer_not_found(struct btree_trans *trans,
481 struct bch_backpointer bp,
483 const char *thing_it_points_to)
485 struct bch_fs *c = trans->c;
486 struct printbuf buf = PRINTBUF;
488 prt_printf(&buf, "backpointer doesn't match %s it points to:\n ",
490 prt_printf(&buf, "bucket: ");
491 bch2_bpos_to_text(&buf, bucket);
492 prt_printf(&buf, "\n ");
494 if (bp_offset >= BACKPOINTER_OFFSET_MAX) {
496 bucket_pos_to_bp(c, bucket,
497 bp_offset - BACKPOINTER_OFFSET_MAX);
498 prt_printf(&buf, "backpointer pos: ");
499 bch2_bpos_to_text(&buf, bp_pos);
500 prt_printf(&buf, "\n ");
503 bch2_backpointer_to_text(&buf, &bp);
504 prt_printf(&buf, "\n ");
505 bch2_bkey_val_to_text(&buf, c, k);
506 if (!test_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags))
507 bch_err_ratelimited(c, "%s", buf.buf);
509 bch2_trans_inconsistent(trans, "%s", buf.buf);
514 struct bkey_s_c bch2_backpointer_get_key(struct btree_trans *trans,
515 struct btree_iter *iter,
518 struct bch_backpointer bp)
520 struct bch_fs *c = trans->c;
523 bch2_trans_node_iter_init(trans, iter,
527 min(bp.level, c->btree_roots[bp.btree_id].level),
529 k = bch2_btree_iter_peek_slot(iter);
531 bch2_trans_iter_exit(trans, iter);
535 if (bp.level == c->btree_roots[bp.btree_id].level + 1)
536 k = bkey_i_to_s_c(&c->btree_roots[bp.btree_id].key);
538 if (k.k && extent_matches_bp(c, bp.btree_id, bp.level, k, bucket, bp))
541 bch2_trans_iter_exit(trans, iter);
547 * If a backpointer for a btree node wasn't found, it may be
548 * because it was overwritten by a new btree node that hasn't
549 * been written out yet - backpointer_get_node() checks for
552 b = bch2_backpointer_get_node(trans, iter, bucket, bp_offset, bp);
553 if (!IS_ERR_OR_NULL(b))
554 return bkey_i_to_s_c(&b->key);
556 bch2_trans_iter_exit(trans, iter);
559 return bkey_s_c_err(PTR_ERR(b));
560 return bkey_s_c_null;
563 backpointer_not_found(trans, bucket, bp_offset, bp, k, "extent");
564 return bkey_s_c_null;
567 struct btree *bch2_backpointer_get_node(struct btree_trans *trans,
568 struct btree_iter *iter,
571 struct bch_backpointer bp)
573 struct bch_fs *c = trans->c;
578 bch2_trans_node_iter_init(trans, iter,
584 b = bch2_btree_iter_peek_node(iter);
588 if (b && extent_matches_bp(c, bp.btree_id, bp.level,
589 bkey_i_to_s_c(&b->key),
593 if (b && btree_node_will_make_reachable(b)) {
594 b = ERR_PTR(-BCH_ERR_backpointer_to_overwritten_btree_node);
596 backpointer_not_found(trans, bucket, bp_offset, bp,
597 bkey_i_to_s_c(&b->key), "btree node");
601 bch2_trans_iter_exit(trans, iter);
605 static int bch2_check_btree_backpointer(struct btree_trans *trans, struct btree_iter *bp_iter,
608 struct bch_fs *c = trans->c;
609 struct btree_iter alloc_iter = { NULL };
611 struct bkey_s_c alloc_k;
612 struct printbuf buf = PRINTBUF;
615 if (fsck_err_on(!bch2_dev_exists2(c, k.k->p.inode), c,
616 "backpointer for mising device:\n%s",
617 (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
618 ret = bch2_btree_delete_at(trans, bp_iter, 0);
622 ca = bch_dev_bkey_exists(c, k.k->p.inode);
624 bch2_trans_iter_init(trans, &alloc_iter, BTREE_ID_alloc,
625 bp_pos_to_bucket(c, k.k->p), 0);
627 alloc_k = bch2_btree_iter_peek_slot(&alloc_iter);
628 ret = bkey_err(alloc_k);
632 if (fsck_err_on(alloc_k.k->type != KEY_TYPE_alloc_v4, c,
633 "backpointer for nonexistent alloc key: %llu:%llu:0\n%s",
634 alloc_iter.pos.inode, alloc_iter.pos.offset,
635 (bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf))) {
636 ret = bch2_btree_delete_at(trans, bp_iter, 0);
641 bch2_trans_iter_exit(trans, &alloc_iter);
646 /* verify that every backpointer has a corresponding alloc key */
647 int bch2_check_btree_backpointers(struct bch_fs *c)
649 struct btree_iter iter;
652 return bch2_trans_run(c,
653 for_each_btree_key_commit(&trans, iter,
654 BTREE_ID_backpointers, POS_MIN, 0, k,
655 NULL, NULL, BTREE_INSERT_LAZY_RW|BTREE_INSERT_NOFAIL,
656 bch2_check_btree_backpointer(&trans, &iter, k)));
659 static int check_bp_exists(struct btree_trans *trans,
660 struct bpos bucket_pos,
661 struct bch_backpointer bp,
662 struct bkey_s_c orig_k,
663 struct bpos bucket_start,
664 struct bpos bucket_end)
666 struct bch_fs *c = trans->c;
667 struct btree_iter alloc_iter, bp_iter = { NULL };
668 struct printbuf buf = PRINTBUF;
669 struct bkey_s_c alloc_k, bp_k;
672 if (bpos_cmp(bucket_pos, bucket_start) < 0 ||
673 bpos_cmp(bucket_pos, bucket_end) > 0)
676 bch2_trans_iter_init(trans, &alloc_iter, BTREE_ID_alloc, bucket_pos, 0);
677 alloc_k = bch2_btree_iter_peek_slot(&alloc_iter);
678 ret = bkey_err(alloc_k);
682 if (alloc_k.k->type == KEY_TYPE_alloc_v4) {
683 struct bkey_s_c_alloc_v4 a = bkey_s_c_to_alloc_v4(alloc_k);
684 const struct bch_backpointer *bps = alloc_v4_backpointers_c(a.v);
685 unsigned i, nr = BCH_ALLOC_V4_NR_BACKPOINTERS(a.v);
687 for (i = 0; i < nr; i++) {
688 int cmp = backpointer_cmp(bps[i], bp) ?:
689 memcmp(&bps[i], &bp, sizeof(bp));
699 bch2_trans_iter_init(trans, &bp_iter, BTREE_ID_backpointers,
700 bucket_pos_to_bp(c, bucket_pos, bp.bucket_offset),
702 bp_k = bch2_btree_iter_peek_slot(&bp_iter);
703 ret = bkey_err(bp_k);
707 if (bp_k.k->type != KEY_TYPE_backpointer ||
708 memcmp(bkey_s_c_to_backpointer(bp_k).v, &bp, sizeof(bp)))
713 bch2_trans_iter_exit(trans, &bp_iter);
714 bch2_trans_iter_exit(trans, &alloc_iter);
718 prt_printf(&buf, "missing backpointer for btree=%s l=%u ",
719 bch2_btree_ids[bp.btree_id], bp.level);
720 bch2_bkey_val_to_text(&buf, c, orig_k);
721 prt_printf(&buf, "\nin alloc key ");
722 bch2_bkey_val_to_text(&buf, c, alloc_k);
724 if (c->sb.version < bcachefs_metadata_version_backpointers ||
725 c->opts.reconstruct_alloc ||
726 fsck_err(c, "%s", buf.buf)) {
727 struct bkey_i_alloc_v4 *a = bch2_alloc_to_v4_mut(trans, alloc_k);
729 ret = PTR_ERR_OR_ZERO(a) ?:
730 bch2_bucket_backpointer_add(trans, a, bp, orig_k) ?:
731 bch2_trans_update(trans, &alloc_iter, &a->k_i, 0);
737 static int check_extent_to_backpointers(struct btree_trans *trans,
738 struct btree_iter *iter,
739 struct bpos bucket_start,
740 struct bpos bucket_end)
742 struct bch_fs *c = trans->c;
743 struct bkey_ptrs_c ptrs;
744 const union bch_extent_entry *entry;
745 struct extent_ptr_decoded p;
749 k = bch2_btree_iter_peek_all_levels(iter);
756 ptrs = bch2_bkey_ptrs_c(k);
757 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
758 struct bpos bucket_pos;
759 struct bch_backpointer bp;
764 bch2_extent_ptr_to_bp(c, iter->btree_id, iter->path->level,
765 k, p, &bucket_pos, &bp);
767 ret = check_bp_exists(trans, bucket_pos, bp, k, bucket_start, bucket_end);
775 static int check_btree_root_to_backpointers(struct btree_trans *trans,
776 enum btree_id btree_id,
777 struct bpos bucket_start,
778 struct bpos bucket_end)
780 struct bch_fs *c = trans->c;
781 struct btree_iter iter;
784 struct bkey_ptrs_c ptrs;
785 struct extent_ptr_decoded p;
786 const union bch_extent_entry *entry;
789 bch2_trans_node_iter_init(trans, &iter, btree_id, POS_MIN, 0,
790 c->btree_roots[btree_id].level, 0);
791 b = bch2_btree_iter_peek_node(&iter);
792 ret = PTR_ERR_OR_ZERO(b);
796 BUG_ON(b != btree_node_root(c, b));
798 k = bkey_i_to_s_c(&b->key);
799 ptrs = bch2_bkey_ptrs_c(k);
800 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
801 struct bpos bucket_pos;
802 struct bch_backpointer bp;
807 bch2_extent_ptr_to_bp(c, iter.btree_id, iter.path->level + 1,
808 k, p, &bucket_pos, &bp);
810 ret = check_bp_exists(trans, bucket_pos, bp, k, bucket_start, bucket_end);
815 bch2_trans_iter_exit(trans, &iter);
819 static inline struct bbpos bp_to_bbpos(struct bch_backpointer bp)
821 return (struct bbpos) {
822 .btree = bp.btree_id,
827 static size_t btree_nodes_fit_in_ram(struct bch_fs *c)
833 mem_bytes = i.totalram * i.mem_unit;
834 return (mem_bytes >> 1) / btree_bytes(c);
837 int bch2_get_btree_in_memory_pos(struct btree_trans *trans,
838 unsigned btree_leaf_mask,
839 unsigned btree_interior_mask,
840 struct bbpos start, struct bbpos *end)
842 struct btree_iter iter;
844 size_t btree_nodes = btree_nodes_fit_in_ram(trans->c);
848 for (btree = start.btree; btree < BTREE_ID_NR && !ret; btree++) {
849 unsigned depth = ((1U << btree) & btree_leaf_mask) ? 1 : 2;
851 if (!((1U << btree) & btree_leaf_mask) &&
852 !((1U << btree) & btree_interior_mask))
855 bch2_trans_node_iter_init(trans, &iter, btree,
856 btree == start.btree ? start.pos : POS_MIN,
859 * for_each_btree_key_contineu() doesn't check the return value
860 * from bch2_btree_iter_advance(), which is needed when
861 * iterating over interior nodes where we'll see keys at
865 k = __bch2_btree_iter_peek_and_restart(trans, &iter, 0);
872 *end = BBPOS(btree, k.k->p);
873 bch2_trans_iter_exit(trans, &iter);
876 } while (bch2_btree_iter_advance(&iter));
877 bch2_trans_iter_exit(trans, &iter);
884 static int bch2_check_extents_to_backpointers_pass(struct btree_trans *trans,
885 struct bpos bucket_start,
886 struct bpos bucket_end)
888 struct btree_iter iter;
889 enum btree_id btree_id;
892 for (btree_id = 0; btree_id < BTREE_ID_NR; btree_id++) {
893 unsigned depth = btree_type_has_ptrs(btree_id) ? 0 : 1;
895 bch2_trans_node_iter_init(trans, &iter, btree_id, POS_MIN, 0,
897 BTREE_ITER_ALL_LEVELS|
898 BTREE_ITER_PREFETCH);
901 ret = commit_do(trans, NULL, NULL,
902 BTREE_INSERT_LAZY_RW|
904 check_extent_to_backpointers(trans, &iter,
905 bucket_start, bucket_end));
908 } while (!bch2_btree_iter_advance(&iter));
910 bch2_trans_iter_exit(trans, &iter);
915 ret = commit_do(trans, NULL, NULL,
916 BTREE_INSERT_LAZY_RW|
918 check_btree_root_to_backpointers(trans, btree_id,
919 bucket_start, bucket_end));
926 int bch2_get_alloc_in_memory_pos(struct btree_trans *trans,
927 struct bpos start, struct bpos *end)
929 struct btree_iter alloc_iter;
930 struct btree_iter bp_iter;
931 struct bkey_s_c alloc_k, bp_k;
932 size_t btree_nodes = btree_nodes_fit_in_ram(trans->c);
933 bool alloc_end = false, bp_end = false;
936 bch2_trans_node_iter_init(trans, &alloc_iter, BTREE_ID_alloc,
938 bch2_trans_node_iter_init(trans, &bp_iter, BTREE_ID_backpointers,
939 bucket_pos_to_bp(trans->c, start, 0), 0, 1, 0);
942 ? __bch2_btree_iter_peek_and_restart(trans, &alloc_iter, 0)
945 ? __bch2_btree_iter_peek_and_restart(trans, &bp_iter, 0)
948 ret = bkey_err(alloc_k) ?: bkey_err(bp_k);
949 if ((!alloc_k.k && !bp_k.k) || ret) {
960 if (bpos_cmp(alloc_iter.pos, SPOS_MAX) &&
961 bpos_cmp(bucket_pos_to_bp(trans->c, alloc_iter.pos, 0), bp_iter.pos) < 0) {
962 if (!bch2_btree_iter_advance(&alloc_iter))
965 if (!bch2_btree_iter_advance(&bp_iter))
969 bch2_trans_iter_exit(trans, &bp_iter);
970 bch2_trans_iter_exit(trans, &alloc_iter);
974 int bch2_check_extents_to_backpointers(struct bch_fs *c)
976 struct btree_trans trans;
977 struct bpos start = POS_MIN, end;
980 bch2_trans_init(&trans, c, 0, 0);
982 ret = bch2_get_alloc_in_memory_pos(&trans, start, &end);
986 if (!bpos_cmp(start, POS_MIN) && bpos_cmp(end, SPOS_MAX))
987 bch_verbose(c, "%s(): alloc info does not fit in ram, running in multiple passes with %zu nodes per pass",
988 __func__, btree_nodes_fit_in_ram(c));
990 if (bpos_cmp(start, POS_MIN) || bpos_cmp(end, SPOS_MAX)) {
991 struct printbuf buf = PRINTBUF;
993 prt_str(&buf, "check_extents_to_backpointers(): ");
994 bch2_bpos_to_text(&buf, start);
996 bch2_bpos_to_text(&buf, end);
998 bch_verbose(c, "%s", buf.buf);
1002 ret = bch2_check_extents_to_backpointers_pass(&trans, start, end);
1003 if (ret || !bpos_cmp(end, SPOS_MAX))
1006 start = bpos_successor(end);
1008 bch2_trans_exit(&trans);
1013 static int check_one_backpointer(struct btree_trans *trans,
1019 struct btree_iter iter;
1020 struct bch_backpointer bp;
1023 struct printbuf buf = PRINTBUF;
1026 ret = bch2_get_next_backpointer(trans, bucket, -1, bp_offset, &bp, 0);
1027 if (ret || *bp_offset == U64_MAX)
1030 pos = bp_to_bbpos(bp);
1031 if (bbpos_cmp(pos, start) < 0 ||
1032 bbpos_cmp(pos, end) > 0)
1035 k = bch2_backpointer_get_key(trans, &iter, bucket, *bp_offset, bp);
1037 if (ret == -BCH_ERR_backpointer_to_overwritten_btree_node)
1042 if (fsck_err_on(!k.k, trans->c,
1043 "%s backpointer points to missing extent\n%s",
1044 *bp_offset < BACKPOINTER_OFFSET_MAX ? "alloc" : "btree",
1045 (bch2_backpointer_to_text(&buf, &bp), buf.buf))) {
1046 ret = bch2_backpointer_del_by_offset(trans, bucket, *bp_offset, bp);
1048 bch_err(trans->c, "backpointer at %llu not found", *bp_offset);
1051 bch2_trans_iter_exit(trans, &iter);
1053 printbuf_exit(&buf);
1057 static int bch2_check_backpointers_to_extents_pass(struct btree_trans *trans,
1061 struct btree_iter iter;
1065 for_each_btree_key(trans, iter, BTREE_ID_alloc, POS_MIN,
1066 BTREE_ITER_PREFETCH, k, ret) {
1069 while (!(ret = commit_do(trans, NULL, NULL,
1070 BTREE_INSERT_LAZY_RW|
1071 BTREE_INSERT_NOFAIL,
1072 check_one_backpointer(trans, iter.pos, &bp_offset, start, end))) &&
1073 bp_offset < U64_MAX)
1079 bch2_trans_iter_exit(trans, &iter);
1080 return ret < 0 ? ret : 0;
1083 int bch2_check_backpointers_to_extents(struct bch_fs *c)
1085 struct btree_trans trans;
1086 struct bbpos start = (struct bbpos) { .btree = 0, .pos = POS_MIN, }, end;
1089 bch2_trans_init(&trans, c, 0, 0);
1091 ret = bch2_get_btree_in_memory_pos(&trans,
1092 (1U << BTREE_ID_extents)|
1093 (1U << BTREE_ID_reflink),
1099 if (!bbpos_cmp(start, BBPOS_MIN) &&
1100 bbpos_cmp(end, BBPOS_MAX))
1101 bch_verbose(c, "%s(): extents do not fit in ram, running in multiple passes with %zu nodes per pass",
1102 __func__, btree_nodes_fit_in_ram(c));
1104 if (bbpos_cmp(start, BBPOS_MIN) ||
1105 bbpos_cmp(end, BBPOS_MAX)) {
1106 struct printbuf buf = PRINTBUF;
1108 prt_str(&buf, "check_backpointers_to_extents(): ");
1109 bch2_bbpos_to_text(&buf, start);
1111 bch2_bbpos_to_text(&buf, end);
1113 bch_verbose(c, "%s", buf.buf);
1114 printbuf_exit(&buf);
1117 ret = bch2_check_backpointers_to_extents_pass(&trans, start, end);
1118 if (ret || !bbpos_cmp(end, BBPOS_MAX))
1121 start = bbpos_successor(end);
1123 bch2_trans_exit(&trans);