1 // SPDX-License-Identifier: GPL-2.0
3 #include "alloc_background.h"
4 #include "backpointers.h"
5 #include "btree_cache.h"
6 #include "btree_update.h"
9 #define MAX_EXTENT_COMPRESS_RATIO_SHIFT 10
12 * Convert from pos in backpointer btree to pos of corresponding bucket in alloc
15 static inline struct bpos bp_pos_to_bucket(const struct bch_fs *c,
18 struct bch_dev *ca = bch_dev_bkey_exists(c, bp_pos.inode);
19 u64 bucket_sector = bp_pos.offset >> MAX_EXTENT_COMPRESS_RATIO_SHIFT;
21 return POS(bp_pos.inode, sector_to_bucket(ca, bucket_sector));
25 * Convert from pos in alloc btree + bucket offset to pos in backpointer btree:
27 static inline struct bpos bucket_pos_to_bp(const struct bch_fs *c,
31 struct bch_dev *ca = bch_dev_bkey_exists(c, bucket.inode);
33 return POS(bucket.inode,
34 (bucket_to_sector(ca, bucket.offset) <<
35 MAX_EXTENT_COMPRESS_RATIO_SHIFT) + bucket_offset);
38 void bch2_extent_ptr_to_bp(struct bch_fs *c,
39 enum btree_id btree_id, unsigned level,
40 struct bkey_s_c k, struct extent_ptr_decoded p,
41 struct bpos *bucket_pos, struct bch_backpointer *bp)
43 enum bch_data_type data_type = level ? BCH_DATA_btree : BCH_DATA_user;
44 s64 sectors = level ? btree_sectors(c) : k.k->size;
47 *bucket_pos = PTR_BUCKET_POS_OFFSET(c, &p.ptr, &bucket_offset);
48 *bp = (struct bch_backpointer) {
51 .data_type = data_type,
52 .bucket_offset = ((u64) bucket_offset << MAX_EXTENT_COMPRESS_RATIO_SHIFT) +
54 .bucket_len = ptr_disk_sectors(sectors, p),
59 static bool extent_matches_bp(struct bch_fs *c,
60 enum btree_id btree_id, unsigned level,
63 struct bch_backpointer bp)
65 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
66 const union bch_extent_entry *entry;
67 struct extent_ptr_decoded p;
69 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
71 struct bch_backpointer bp2;
76 bch2_extent_ptr_to_bp(c, btree_id, level, k, p,
78 if (!bpos_cmp(bucket, bucket2) &&
79 !memcmp(&bp, &bp2, sizeof(bp)))
86 int bch2_backpointer_invalid(const struct bch_fs *c, struct bkey_s_c k,
87 int rw, struct printbuf *err)
89 struct bkey_s_c_backpointer bp = bkey_s_c_to_backpointer(k);
90 struct bpos bucket = bp_pos_to_bucket(c, bp.k->p);
92 if (bkey_val_bytes(bp.k) < sizeof(*bp.v)) {
93 prt_str(err, "incorrect value size");
97 if (bpos_cmp(bp.k->p, bucket_pos_to_bp(c, bucket, bp.v->bucket_offset))) {
98 prt_str(err, "backpointer at wrong pos");
105 void bch2_backpointer_to_text(struct printbuf *out, const struct bch_backpointer *bp)
107 prt_printf(out, "btree=%s l=%u offset=%llu:%u len=%u pos=",
108 bch2_btree_ids[bp->btree_id],
110 (u64) (bp->bucket_offset >> MAX_EXTENT_COMPRESS_RATIO_SHIFT),
111 (u32) bp->bucket_offset & ~(~0U << MAX_EXTENT_COMPRESS_RATIO_SHIFT),
113 bch2_bpos_to_text(out, bp->pos);
116 void bch2_backpointer_k_to_text(struct printbuf *out, struct bch_fs *c, struct bkey_s_c k)
118 bch2_backpointer_to_text(out, bkey_s_c_to_backpointer(k).v);
121 void bch2_backpointer_swab(struct bkey_s k)
123 struct bkey_s_backpointer bp = bkey_s_to_backpointer(k);
125 bp.v->bucket_offset = swab32(bp.v->bucket_offset);
126 bp.v->bucket_len = swab32(bp.v->bucket_len);
127 bch2_bpos_swab(&bp.v->pos);
130 #define BACKPOINTER_OFFSET_MAX ((1ULL << 40) - 1)
132 static inline int backpointer_cmp(struct bch_backpointer l, struct bch_backpointer r)
134 return cmp_int(l.bucket_offset, r.bucket_offset);
137 static int bch2_backpointer_del_by_offset(struct btree_trans *trans,
140 struct bch_backpointer bp)
142 struct bch_fs *c = trans->c;
143 struct btree_iter iter;
147 if (bp_offset < BACKPOINTER_OFFSET_MAX) {
148 struct bch_backpointer *bps;
149 struct bkey_i_alloc_v4 *a;
152 bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc,
156 BTREE_ITER_WITH_UPDATES);
157 k = bch2_btree_iter_peek_slot(&iter);
162 if (k.k->type != KEY_TYPE_alloc_v4) {
167 a = bch2_alloc_to_v4_mut(trans, k);
168 ret = PTR_ERR_OR_ZERO(a);
171 bps = alloc_v4_backpointers(&a->v);
172 nr = BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v);
174 for (i = 0; i < nr; i++) {
175 if (bps[i].bucket_offset == bp_offset)
177 if (bps[i].bucket_offset > bp_offset)
184 if (memcmp(&bps[i], &bp, sizeof(bp))) {
188 array_remove_item(bps, nr, i);
189 SET_BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v, nr);
190 set_alloc_v4_u64s(a);
191 ret = bch2_trans_update(trans, &iter, &a->k_i, 0);
193 bp_offset -= BACKPOINTER_OFFSET_MAX;
195 bch2_trans_iter_init(trans, &iter, BTREE_ID_backpointers,
196 bucket_pos_to_bp(c, bucket, bp_offset),
199 BTREE_ITER_WITH_UPDATES);
200 k = bch2_btree_iter_peek_slot(&iter);
205 if (k.k->type != KEY_TYPE_backpointer ||
206 memcmp(bkey_s_c_to_backpointer(k).v, &bp, sizeof(bp))) {
211 ret = bch2_btree_delete_at(trans, &iter, 0);
214 bch2_trans_iter_exit(trans, &iter);
218 int bch2_bucket_backpointer_del(struct btree_trans *trans,
219 struct bkey_i_alloc_v4 *a,
220 struct bch_backpointer bp,
221 struct bkey_s_c orig_k)
223 struct bch_fs *c = trans->c;
224 struct bch_backpointer *bps = alloc_v4_backpointers(&a->v);
225 unsigned i, nr = BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v);
226 struct btree_iter bp_iter;
230 for (i = 0; i < nr; i++) {
231 int cmp = backpointer_cmp(bps[i], bp) ?:
232 memcmp(&bps[i], &bp, sizeof(bp));
241 array_remove_item(bps, nr, i);
242 SET_BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v, nr);
243 set_alloc_v4_u64s(a);
246 bch2_trans_iter_init(trans, &bp_iter, BTREE_ID_backpointers,
247 bucket_pos_to_bp(c, a->k.p, bp.bucket_offset),
250 BTREE_ITER_WITH_UPDATES);
251 k = bch2_btree_iter_peek_slot(&bp_iter);
256 if (k.k->type != KEY_TYPE_backpointer ||
257 memcmp(bkey_s_c_to_backpointer(k).v, &bp, sizeof(bp))) {
258 struct printbuf buf = PRINTBUF;
260 prt_printf(&buf, "backpointer not found when deleting");
262 printbuf_indent_add(&buf, 2);
264 prt_printf(&buf, "searching for ");
265 bch2_backpointer_to_text(&buf, &bp);
268 prt_printf(&buf, "got ");
269 bch2_bkey_val_to_text(&buf, c, k);
272 prt_str(&buf, "alloc ");
273 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&a->k_i));
276 prt_printf(&buf, "for ");
277 bch2_bkey_val_to_text(&buf, c, orig_k);
279 if (!test_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags)) {
280 bch_err(c, "%s", buf.buf);
283 bch2_trans_inconsistent(trans, "%s", buf.buf);
289 ret = bch2_btree_delete_at(trans, &bp_iter, 0);
291 bch2_trans_iter_exit(trans, &bp_iter);
295 int bch2_bucket_backpointer_add(struct btree_trans *trans,
296 struct bkey_i_alloc_v4 *a,
297 struct bch_backpointer bp,
298 struct bkey_s_c orig_k)
300 struct bch_fs *c = trans->c;
302 struct bch_backpointer *bps = alloc_v4_backpointers(&a->v);
303 unsigned i, nr = BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v);
304 struct bkey_i_backpointer *bp_k;
305 struct btree_iter bp_iter;
309 /* Check for duplicates: */
310 for (i = 0; i < nr; i++) {
311 int cmp = backpointer_cmp(bps[i], bp);
317 (bps[i - 1].bucket_offset +
318 bps[i - 1].bucket_len > bp.bucket_offset)) ||
320 (bp.bucket_offset + bp.bucket_len > bps[i].bucket_offset))) {
321 struct printbuf buf = PRINTBUF;
323 prt_printf(&buf, "overlapping backpointer found when inserting ");
324 bch2_backpointer_to_text(&buf, &bp);
326 printbuf_indent_add(&buf, 2);
328 prt_printf(&buf, "into ");
329 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&a->k_i));
332 prt_printf(&buf, "for ");
333 bch2_bkey_val_to_text(&buf, c, orig_k);
335 if (!test_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags))
336 bch_err(c, "%s", buf.buf);
338 bch2_trans_inconsistent(trans, "%s", buf.buf);
344 if (nr < BCH_ALLOC_V4_NR_BACKPOINTERS_MAX) {
345 array_insert_item(bps, nr, i, bp);
346 SET_BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v, nr);
347 set_alloc_v4_u64s(a);
351 /* Overflow: use backpointer btree */
352 bp_k = bch2_trans_kmalloc(trans, sizeof(*bp_k));
353 ret = PTR_ERR_OR_ZERO(bp_k);
357 ca = bch_dev_bkey_exists(c, a->k.p.inode);
359 bkey_backpointer_init(&bp_k->k_i);
360 bp_k->k.p = bucket_pos_to_bp(c, a->k.p, bp.bucket_offset);
363 bch2_trans_iter_init(trans, &bp_iter, BTREE_ID_backpointers, bp_k->k.p,
366 BTREE_ITER_WITH_UPDATES);
367 k = bch2_btree_iter_peek_slot(&bp_iter);
373 struct printbuf buf = PRINTBUF;
375 prt_printf(&buf, "existing btree backpointer key found when inserting ");
376 bch2_backpointer_to_text(&buf, &bp);
378 printbuf_indent_add(&buf, 2);
380 prt_printf(&buf, "found ");
381 bch2_bkey_val_to_text(&buf, c, k);
384 prt_printf(&buf, "for ");
385 bch2_bkey_val_to_text(&buf, c, orig_k);
387 if (!test_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags))
388 bch_err(c, "%s", buf.buf);
390 bch2_trans_inconsistent(trans, "%s", buf.buf);
397 ret = bch2_trans_update(trans, &bp_iter, &bp_k->k_i, 0);
399 bch2_trans_iter_exit(trans, &bp_iter);
404 * Find the next backpointer >= *bp_offset:
406 int bch2_get_next_backpointer(struct btree_trans *trans,
407 struct bpos bucket, int gen,
409 struct bch_backpointer *dst)
411 struct bch_fs *c = trans->c;
413 bucket_pos_to_bp(c, bucket,
414 max(*bp_offset, BACKPOINTER_OFFSET_MAX) - BACKPOINTER_OFFSET_MAX);
415 struct bpos bp_end_pos =
416 bucket_pos_to_bp(c, bpos_nosnap_successor(bucket), 0);
417 struct btree_iter alloc_iter, bp_iter = { NULL };
419 struct bkey_s_c_alloc_v4 a;
423 bch2_trans_iter_init(trans, &alloc_iter, BTREE_ID_alloc,
424 bucket, BTREE_ITER_CACHED);
425 k = bch2_btree_iter_peek_slot(&alloc_iter);
430 if (k.k->type != KEY_TYPE_alloc_v4)
433 a = bkey_s_c_to_alloc_v4(k);
434 if (gen >= 0 && a.v->gen != gen)
437 for (i = 0; i < BCH_ALLOC_V4_NR_BACKPOINTERS(a.v); i++) {
438 if (alloc_v4_backpointers_c(a.v)[i].bucket_offset < *bp_offset)
441 *dst = alloc_v4_backpointers_c(a.v)[i];
442 *bp_offset = dst->bucket_offset;
446 for_each_btree_key_norestart(trans, bp_iter, BTREE_ID_backpointers,
448 if (bpos_cmp(k.k->p, bp_end_pos) >= 0)
451 if (k.k->type != KEY_TYPE_backpointer)
454 *dst = *bkey_s_c_to_backpointer(k).v;
455 *bp_offset = dst->bucket_offset + BACKPOINTER_OFFSET_MAX;
459 *bp_offset = U64_MAX;
461 bch2_trans_iter_exit(trans, &bp_iter);
462 bch2_trans_iter_exit(trans, &alloc_iter);
466 static void backpointer_not_found(struct btree_trans *trans,
469 struct bch_backpointer bp,
471 const char *thing_it_points_to)
473 struct bch_fs *c = trans->c;
474 struct printbuf buf = PRINTBUF;
476 prt_printf(&buf, "backpointer doesn't match %s it points to:\n ",
478 prt_printf(&buf, "bucket: ");
479 bch2_bpos_to_text(&buf, bucket);
480 prt_printf(&buf, "\n ");
482 if (bp_offset >= BACKPOINTER_OFFSET_MAX) {
484 bucket_pos_to_bp(c, bucket,
485 bp_offset - BACKPOINTER_OFFSET_MAX);
486 prt_printf(&buf, "backpointer pos: ");
487 bch2_bpos_to_text(&buf, bp_pos);
488 prt_printf(&buf, "\n ");
491 bch2_backpointer_to_text(&buf, &bp);
492 prt_printf(&buf, "\n ");
493 bch2_bkey_val_to_text(&buf, c, k);
494 if (!test_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags))
495 bch_err_ratelimited(c, "%s", buf.buf);
497 bch2_trans_inconsistent(trans, "%s", buf.buf);
502 struct bkey_s_c bch2_backpointer_get_key(struct btree_trans *trans,
503 struct btree_iter *iter,
506 struct bch_backpointer bp)
508 struct bch_fs *c = trans->c;
511 bch2_trans_node_iter_init(trans, iter,
515 min(bp.level, c->btree_roots[bp.btree_id].level),
517 k = bch2_btree_iter_peek_slot(iter);
519 bch2_trans_iter_exit(trans, iter);
523 if (bp.level == c->btree_roots[bp.btree_id].level + 1)
524 k = bkey_i_to_s_c(&c->btree_roots[bp.btree_id].key);
526 if (extent_matches_bp(c, bp.btree_id, bp.level, k, bucket, bp))
529 bch2_trans_iter_exit(trans, iter);
535 * If a backpointer for a btree node wasn't found, it may be
536 * because it was overwritten by a new btree node that hasn't
537 * been written out yet - backpointer_get_node() checks for
540 b = bch2_backpointer_get_node(trans, iter, bucket, bp_offset, bp);
541 if (!IS_ERR_OR_NULL(b))
542 return bkey_i_to_s_c(&b->key);
544 bch2_trans_iter_exit(trans, iter);
547 return bkey_s_c_err(PTR_ERR(b));
548 return bkey_s_c_null;
551 backpointer_not_found(trans, bucket, bp_offset, bp, k, "extent");
552 return bkey_s_c_null;
555 struct btree *bch2_backpointer_get_node(struct btree_trans *trans,
556 struct btree_iter *iter,
559 struct bch_backpointer bp)
561 struct bch_fs *c = trans->c;
566 bch2_trans_node_iter_init(trans, iter,
572 b = bch2_btree_iter_peek_node(iter);
576 if (extent_matches_bp(c, bp.btree_id, bp.level,
577 bkey_i_to_s_c(&b->key),
581 if (btree_node_will_make_reachable(b)) {
582 b = ERR_PTR(-BCH_ERR_backpointer_to_overwritten_btree_node);
584 backpointer_not_found(trans, bucket, bp_offset, bp,
585 bkey_i_to_s_c(&b->key), "btree node");
589 bch2_trans_iter_exit(trans, iter);
593 static int bch2_check_btree_backpointer(struct btree_trans *trans, struct btree_iter *bp_iter,
596 struct bch_fs *c = trans->c;
597 struct btree_iter alloc_iter = { NULL };
599 struct bkey_s_c alloc_k;
600 struct printbuf buf = PRINTBUF;
603 if (fsck_err_on(!bch2_dev_exists2(c, k.k->p.inode), c,
604 "backpointer for mising device:\n%s",
605 (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
606 ret = bch2_btree_delete_at(trans, bp_iter, 0);
610 ca = bch_dev_bkey_exists(c, k.k->p.inode);
612 bch2_trans_iter_init(trans, &alloc_iter, BTREE_ID_alloc,
613 bp_pos_to_bucket(c, k.k->p), 0);
615 alloc_k = bch2_btree_iter_peek_slot(&alloc_iter);
616 ret = bkey_err(alloc_k);
620 if (fsck_err_on(alloc_k.k->type != KEY_TYPE_alloc_v4, c,
621 "backpointer for nonexistent alloc key: %llu:%llu:0\n%s",
622 alloc_iter.pos.inode, alloc_iter.pos.offset,
623 (bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf))) {
624 ret = bch2_btree_delete_at(trans, bp_iter, 0);
629 bch2_trans_iter_exit(trans, &alloc_iter);
634 /* verify that every backpointer has a corresponding alloc key */
635 int bch2_check_btree_backpointers(struct bch_fs *c)
637 struct btree_iter iter;
640 return bch2_trans_run(c,
641 for_each_btree_key_commit(&trans, iter,
642 BTREE_ID_backpointers, POS_MIN, 0, k,
643 NULL, NULL, BTREE_INSERT_LAZY_RW|BTREE_INSERT_NOFAIL,
644 bch2_check_btree_backpointer(&trans, &iter, k)));
647 static int check_bp_exists(struct btree_trans *trans,
648 struct bpos bucket_pos,
649 struct bch_backpointer bp,
650 struct bkey_s_c orig_k)
652 struct bch_fs *c = trans->c;
653 struct btree_iter alloc_iter, bp_iter = { NULL };
654 struct printbuf buf = PRINTBUF;
655 struct bkey_s_c alloc_k, bp_k;
658 bch2_trans_iter_init(trans, &alloc_iter, BTREE_ID_alloc, bucket_pos, 0);
659 alloc_k = bch2_btree_iter_peek_slot(&alloc_iter);
660 ret = bkey_err(alloc_k);
664 if (alloc_k.k->type == KEY_TYPE_alloc_v4) {
665 struct bkey_s_c_alloc_v4 a = bkey_s_c_to_alloc_v4(alloc_k);
666 const struct bch_backpointer *bps = alloc_v4_backpointers_c(a.v);
667 unsigned i, nr = BCH_ALLOC_V4_NR_BACKPOINTERS(a.v);
669 for (i = 0; i < nr; i++) {
670 int cmp = backpointer_cmp(bps[i], bp) ?:
671 memcmp(&bps[i], &bp, sizeof(bp));
681 bch2_trans_iter_init(trans, &bp_iter, BTREE_ID_backpointers,
682 bucket_pos_to_bp(c, bucket_pos, bp.bucket_offset),
684 bp_k = bch2_btree_iter_peek_slot(&bp_iter);
685 ret = bkey_err(bp_k);
689 if (bp_k.k->type != KEY_TYPE_backpointer ||
690 memcmp(bkey_s_c_to_backpointer(bp_k).v, &bp, sizeof(bp)))
695 bch2_trans_iter_exit(trans, &bp_iter);
696 bch2_trans_iter_exit(trans, &alloc_iter);
700 prt_printf(&buf, "missing backpointer for btree=%s l=%u ",
701 bch2_btree_ids[bp.btree_id], bp.level);
702 bch2_bkey_val_to_text(&buf, c, orig_k);
703 prt_printf(&buf, "\nin alloc key ");
704 bch2_bkey_val_to_text(&buf, c, alloc_k);
706 if (c->sb.version < bcachefs_metadata_version_backpointers ||
707 c->opts.reconstruct_alloc ||
708 fsck_err(c, "%s", buf.buf)) {
709 struct bkey_i_alloc_v4 *a = bch2_alloc_to_v4_mut(trans, alloc_k);
711 ret = PTR_ERR_OR_ZERO(a) ?:
712 bch2_bucket_backpointer_add(trans, a, bp, orig_k) ?:
713 bch2_trans_update(trans, &alloc_iter, &a->k_i, 0);
719 static int check_extent_to_backpointers(struct btree_trans *trans,
720 struct btree_iter *iter)
722 struct bch_fs *c = trans->c;
723 struct bkey_ptrs_c ptrs;
724 const union bch_extent_entry *entry;
725 struct extent_ptr_decoded p;
729 k = bch2_btree_iter_peek_all_levels(iter);
736 ptrs = bch2_bkey_ptrs_c(k);
737 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
738 struct bpos bucket_pos;
739 struct bch_backpointer bp;
744 bch2_extent_ptr_to_bp(c, iter->btree_id, iter->path->level,
745 k, p, &bucket_pos, &bp);
747 ret = check_bp_exists(trans, bucket_pos, bp, k);
755 static int check_btree_root_to_backpointers(struct btree_trans *trans,
756 enum btree_id btree_id)
758 struct bch_fs *c = trans->c;
759 struct btree_iter iter;
762 struct bkey_ptrs_c ptrs;
763 struct extent_ptr_decoded p;
764 const union bch_extent_entry *entry;
767 bch2_trans_node_iter_init(trans, &iter, btree_id, POS_MIN, 0,
768 c->btree_roots[btree_id].level, 0);
769 b = bch2_btree_iter_peek_node(&iter);
770 ret = PTR_ERR_OR_ZERO(b);
774 BUG_ON(b != btree_node_root(c, b));
776 k = bkey_i_to_s_c(&b->key);
777 ptrs = bch2_bkey_ptrs_c(k);
778 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
779 struct bpos bucket_pos;
780 struct bch_backpointer bp;
785 bch2_extent_ptr_to_bp(c, iter.btree_id, iter.path->level + 1,
786 k, p, &bucket_pos, &bp);
788 ret = check_bp_exists(trans, bucket_pos, bp, k);
793 bch2_trans_iter_exit(trans, &iter);
797 int bch2_check_extents_to_backpointers(struct bch_fs *c)
799 struct btree_trans trans;
800 struct btree_iter iter;
801 enum btree_id btree_id;
804 bch2_trans_init(&trans, c, 0, 0);
805 for (btree_id = 0; btree_id < BTREE_ID_NR; btree_id++) {
806 bch2_trans_node_iter_init(&trans, &iter, btree_id, POS_MIN, 0,
808 BTREE_ITER_ALL_LEVELS|
809 BTREE_ITER_PREFETCH);
812 ret = commit_do(&trans, NULL, NULL,
813 BTREE_INSERT_LAZY_RW|
815 check_extent_to_backpointers(&trans, &iter));
818 } while (!bch2_btree_iter_advance(&iter));
820 bch2_trans_iter_exit(&trans, &iter);
825 ret = commit_do(&trans, NULL, NULL,
826 BTREE_INSERT_LAZY_RW|
828 check_btree_root_to_backpointers(&trans, btree_id));
832 bch2_trans_exit(&trans);
836 static int check_one_backpointer(struct btree_trans *trans,
840 struct btree_iter iter;
841 struct bch_backpointer bp;
843 struct printbuf buf = PRINTBUF;
846 ret = bch2_get_next_backpointer(trans, bucket, -1,
848 if (ret || *bp_offset == U64_MAX)
851 k = bch2_backpointer_get_key(trans, &iter, bucket, *bp_offset, bp);
853 if (ret == -BCH_ERR_backpointer_to_overwritten_btree_node)
858 if (fsck_err_on(!k.k, trans->c,
859 "%s backpointer points to missing extent\n%s",
860 *bp_offset < BACKPOINTER_OFFSET_MAX ? "alloc" : "btree",
861 (bch2_backpointer_to_text(&buf, &bp), buf.buf))) {
862 ret = bch2_backpointer_del_by_offset(trans, bucket, *bp_offset, bp);
864 bch_err(trans->c, "backpointer at %llu not found", *bp_offset);
867 bch2_trans_iter_exit(trans, &iter);
873 int bch2_check_backpointers_to_extents(struct bch_fs *c)
875 struct btree_trans trans;
876 struct btree_iter iter;
880 bch2_trans_init(&trans, c, 0, 0);
881 for_each_btree_key(&trans, iter, BTREE_ID_alloc, POS_MIN,
882 BTREE_ITER_PREFETCH, k, ret) {
885 while (!(ret = commit_do(&trans, NULL, NULL,
886 BTREE_INSERT_LAZY_RW|
888 check_one_backpointer(&trans, iter.pos, &bp_offset))) &&
895 bch2_trans_iter_exit(&trans, &iter);
896 bch2_trans_exit(&trans);
897 return ret < 0 ? ret : 0;