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"
8 #include "btree_write_buffer.h"
13 static bool extent_matches_bp(struct bch_fs *c,
14 enum btree_id btree_id, unsigned level,
17 struct bch_backpointer bp)
19 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
20 const union bch_extent_entry *entry;
21 struct extent_ptr_decoded p;
23 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
25 struct bch_backpointer bp2;
30 bch2_extent_ptr_to_bp(c, btree_id, level, k, p,
32 if (bpos_eq(bucket, bucket2) &&
33 !memcmp(&bp, &bp2, sizeof(bp)))
40 int bch2_backpointer_invalid(const struct bch_fs *c, struct bkey_s_c k,
41 unsigned flags, struct printbuf *err)
43 struct bkey_s_c_backpointer bp = bkey_s_c_to_backpointer(k);
44 struct bpos bucket = bp_pos_to_bucket(c, bp.k->p);
46 if (bkey_val_bytes(bp.k) < sizeof(*bp.v)) {
47 prt_str(err, "incorrect value size");
48 return -BCH_ERR_invalid_bkey;
51 if (!bpos_eq(bp.k->p, bucket_pos_to_bp(c, bucket, bp.v->bucket_offset))) {
52 prt_str(err, "backpointer at wrong pos");
53 return -BCH_ERR_invalid_bkey;
59 void bch2_backpointer_to_text(struct printbuf *out, const struct bch_backpointer *bp)
61 prt_printf(out, "btree=%s l=%u offset=%llu:%u len=%u pos=",
62 bch2_btree_ids[bp->btree_id],
64 (u64) (bp->bucket_offset >> MAX_EXTENT_COMPRESS_RATIO_SHIFT),
65 (u32) bp->bucket_offset & ~(~0U << MAX_EXTENT_COMPRESS_RATIO_SHIFT),
67 bch2_bpos_to_text(out, bp->pos);
70 void bch2_backpointer_k_to_text(struct printbuf *out, struct bch_fs *c, struct bkey_s_c k)
72 bch2_backpointer_to_text(out, bkey_s_c_to_backpointer(k).v);
75 void bch2_backpointer_swab(struct bkey_s k)
77 struct bkey_s_backpointer bp = bkey_s_to_backpointer(k);
79 bp.v->bucket_offset = swab32(bp.v->bucket_offset);
80 bp.v->bucket_len = swab32(bp.v->bucket_len);
81 bch2_bpos_swab(&bp.v->pos);
84 #define BACKPOINTER_OFFSET_MAX ((1ULL << 40) - 1)
86 static inline int backpointer_cmp(struct bch_backpointer l, struct bch_backpointer r)
88 return cmp_int(l.bucket_offset, r.bucket_offset);
91 static int bch2_backpointer_del_by_offset(struct btree_trans *trans,
94 struct bch_backpointer bp)
96 struct bch_fs *c = trans->c;
97 struct btree_iter iter;
101 if (bp_offset < BACKPOINTER_OFFSET_MAX) {
102 struct bch_backpointer *bps;
103 struct bkey_i_alloc_v4 *a;
106 bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc,
110 BTREE_ITER_WITH_UPDATES);
111 k = bch2_btree_iter_peek_slot(&iter);
116 if (k.k->type != KEY_TYPE_alloc_v4) {
121 a = bch2_alloc_to_v4_mut(trans, k);
122 ret = PTR_ERR_OR_ZERO(a);
125 bps = alloc_v4_backpointers(&a->v);
126 nr = BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v);
128 for (i = 0; i < nr; i++) {
129 if (bps[i].bucket_offset == bp_offset)
131 if (bps[i].bucket_offset > bp_offset)
138 if (memcmp(&bps[i], &bp, sizeof(bp))) {
142 array_remove_item(bps, nr, i);
143 SET_BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v, nr);
144 set_alloc_v4_u64s(a);
145 ret = bch2_trans_update(trans, &iter, &a->k_i, 0);
147 bp_offset -= BACKPOINTER_OFFSET_MAX;
149 bch2_trans_iter_init(trans, &iter, BTREE_ID_backpointers,
150 bucket_pos_to_bp(c, bucket, bp_offset),
153 BTREE_ITER_WITH_UPDATES);
154 k = bch2_btree_iter_peek_slot(&iter);
159 if (k.k->type != KEY_TYPE_backpointer ||
160 memcmp(bkey_s_c_to_backpointer(k).v, &bp, sizeof(bp))) {
165 ret = bch2_btree_delete_at(trans, &iter, 0);
168 bch2_trans_iter_exit(trans, &iter);
172 bool bch2_bucket_backpointer_del(struct btree_trans *trans,
173 struct bkey_i_alloc_v4 *a,
174 struct bch_backpointer bp)
176 struct bch_backpointer *bps = alloc_v4_backpointers(&a->v);
177 unsigned i, nr = BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v);
179 for (i = 0; i < nr; i++) {
180 int cmp = backpointer_cmp(bps[i], bp) ?:
181 memcmp(&bps[i], &bp, sizeof(bp));
183 array_remove_item(bps, nr, i);
184 SET_BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v, nr);
185 set_alloc_v4_u64s(a);
195 static noinline int backpointer_mod_err(struct btree_trans *trans,
196 struct bch_backpointer bp,
197 struct bkey_s_c bp_k,
198 struct bkey_s_c orig_k,
201 struct bch_fs *c = trans->c;
202 struct printbuf buf = PRINTBUF;
205 prt_printf(&buf, "existing backpointer found when inserting ");
206 bch2_backpointer_to_text(&buf, &bp);
208 printbuf_indent_add(&buf, 2);
210 prt_printf(&buf, "found ");
211 bch2_bkey_val_to_text(&buf, c, bp_k);
214 prt_printf(&buf, "for ");
215 bch2_bkey_val_to_text(&buf, c, orig_k);
217 bch_err(c, "%s", buf.buf);
218 } else if (test_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags)) {
219 prt_printf(&buf, "backpointer not found when deleting");
221 printbuf_indent_add(&buf, 2);
223 prt_printf(&buf, "searching for ");
224 bch2_backpointer_to_text(&buf, &bp);
227 prt_printf(&buf, "got ");
228 bch2_bkey_val_to_text(&buf, c, bp_k);
231 prt_printf(&buf, "for ");
232 bch2_bkey_val_to_text(&buf, c, orig_k);
234 bch_err(c, "%s", buf.buf);
239 if (test_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags)) {
240 bch2_inconsistent_error(c);
247 int bch2_bucket_backpointer_mod_nowritebuffer(struct btree_trans *trans,
248 struct bkey_i_alloc_v4 *a,
249 struct bch_backpointer bp,
250 struct bkey_s_c orig_k,
253 struct bch_fs *c = trans->c;
254 struct bkey_i_backpointer *bp_k;
255 struct btree_iter bp_iter;
259 bp_k = bch2_trans_kmalloc_nomemzero(trans, sizeof(struct bkey_i_backpointer));
260 ret = PTR_ERR_OR_ZERO(bp_k);
264 bkey_backpointer_init(&bp_k->k_i);
265 bp_k->k.p = bucket_pos_to_bp(c, a->k.p, bp.bucket_offset);
269 bp_k->k.type = KEY_TYPE_deleted;
270 set_bkey_val_u64s(&bp_k->k, 0);
273 bch2_trans_iter_init(trans, &bp_iter, BTREE_ID_backpointers,
274 bucket_pos_to_bp(c, a->k.p, bp.bucket_offset),
277 BTREE_ITER_WITH_UPDATES);
278 k = bch2_btree_iter_peek_slot(&bp_iter);
285 : (k.k->type != KEY_TYPE_backpointer ||
286 memcmp(bkey_s_c_to_backpointer(k).v, &bp, sizeof(bp)))) {
287 ret = backpointer_mod_err(trans, bp, k, orig_k, insert);
292 ret = bch2_trans_update(trans, &bp_iter, &bp_k->k_i, 0);
294 bch2_trans_iter_exit(trans, &bp_iter);
299 * Find the next backpointer >= *bp_offset:
301 int bch2_get_next_backpointer(struct btree_trans *trans,
302 struct bpos bucket, int gen,
304 struct bch_backpointer *dst,
307 struct bch_fs *c = trans->c;
308 struct bpos bp_pos, bp_end_pos;
309 struct btree_iter alloc_iter, bp_iter = { NULL };
311 struct bkey_s_c_alloc_v4 a;
315 if (*bp_offset == U64_MAX)
318 bp_pos = bucket_pos_to_bp(c, bucket,
319 max(*bp_offset, BACKPOINTER_OFFSET_MAX) - BACKPOINTER_OFFSET_MAX);
320 bp_end_pos = bucket_pos_to_bp(c, bpos_nosnap_successor(bucket), 0);
322 bch2_trans_iter_init(trans, &alloc_iter, BTREE_ID_alloc,
323 bucket, BTREE_ITER_CACHED);
324 k = bch2_btree_iter_peek_slot(&alloc_iter);
329 if (k.k->type != KEY_TYPE_alloc_v4)
332 a = bkey_s_c_to_alloc_v4(k);
333 if (gen >= 0 && a.v->gen != gen)
336 for (i = 0; i < BCH_ALLOC_V4_NR_BACKPOINTERS(a.v); i++) {
337 if (alloc_v4_backpointers_c(a.v)[i].bucket_offset < *bp_offset)
340 *dst = alloc_v4_backpointers_c(a.v)[i];
341 *bp_offset = dst->bucket_offset;
345 for_each_btree_key_norestart(trans, bp_iter, BTREE_ID_backpointers,
347 if (bpos_ge(k.k->p, bp_end_pos))
350 if (k.k->type != KEY_TYPE_backpointer)
353 *dst = *bkey_s_c_to_backpointer(k).v;
354 *bp_offset = dst->bucket_offset + BACKPOINTER_OFFSET_MAX;
358 *bp_offset = U64_MAX;
360 bch2_trans_iter_exit(trans, &bp_iter);
361 bch2_trans_iter_exit(trans, &alloc_iter);
365 static void backpointer_not_found(struct btree_trans *trans,
368 struct bch_backpointer bp,
370 const char *thing_it_points_to)
372 struct bch_fs *c = trans->c;
373 struct printbuf buf = PRINTBUF;
375 if (likely(!bch2_backpointers_no_use_write_buffer))
378 prt_printf(&buf, "backpointer doesn't match %s it points to:\n ",
380 prt_printf(&buf, "bucket: ");
381 bch2_bpos_to_text(&buf, bucket);
382 prt_printf(&buf, "\n ");
384 if (bp_offset >= BACKPOINTER_OFFSET_MAX) {
386 bucket_pos_to_bp(c, bucket,
387 bp_offset - BACKPOINTER_OFFSET_MAX);
388 prt_printf(&buf, "backpointer pos: ");
389 bch2_bpos_to_text(&buf, bp_pos);
390 prt_printf(&buf, "\n ");
393 bch2_backpointer_to_text(&buf, &bp);
394 prt_printf(&buf, "\n ");
395 bch2_bkey_val_to_text(&buf, c, k);
396 if (!test_bit(BCH_FS_CHECK_BACKPOINTERS_DONE, &c->flags))
397 bch_err_ratelimited(c, "%s", buf.buf);
399 bch2_trans_inconsistent(trans, "%s", buf.buf);
404 struct bkey_s_c bch2_backpointer_get_key(struct btree_trans *trans,
405 struct btree_iter *iter,
408 struct bch_backpointer bp)
410 struct bch_fs *c = trans->c;
413 bch2_trans_node_iter_init(trans, iter,
417 min(bp.level, c->btree_roots[bp.btree_id].level),
419 k = bch2_btree_iter_peek_slot(iter);
421 bch2_trans_iter_exit(trans, iter);
425 if (bp.level == c->btree_roots[bp.btree_id].level + 1)
426 k = bkey_i_to_s_c(&c->btree_roots[bp.btree_id].key);
428 if (k.k && extent_matches_bp(c, bp.btree_id, bp.level, k, bucket, bp))
431 bch2_trans_iter_exit(trans, iter);
433 if (unlikely(bch2_backpointers_no_use_write_buffer)) {
438 * If a backpointer for a btree node wasn't found, it may be
439 * because it was overwritten by a new btree node that hasn't
440 * been written out yet - backpointer_get_node() checks for
443 b = bch2_backpointer_get_node(trans, iter, bucket, bp_offset, bp);
444 if (!IS_ERR_OR_NULL(b))
445 return bkey_i_to_s_c(&b->key);
447 bch2_trans_iter_exit(trans, iter);
450 return bkey_s_c_err(PTR_ERR(b));
451 return bkey_s_c_null;
454 backpointer_not_found(trans, bucket, bp_offset, bp, k, "extent");
457 return bkey_s_c_null;
460 struct btree *bch2_backpointer_get_node(struct btree_trans *trans,
461 struct btree_iter *iter,
464 struct bch_backpointer bp)
466 struct bch_fs *c = trans->c;
471 bch2_trans_node_iter_init(trans, iter,
477 b = bch2_btree_iter_peek_node(iter);
481 if (b && extent_matches_bp(c, bp.btree_id, bp.level,
482 bkey_i_to_s_c(&b->key),
486 if (b && btree_node_will_make_reachable(b)) {
487 b = ERR_PTR(-BCH_ERR_backpointer_to_overwritten_btree_node);
489 backpointer_not_found(trans, bucket, bp_offset, bp,
490 bkey_i_to_s_c(&b->key), "btree node");
494 bch2_trans_iter_exit(trans, iter);
498 static int bch2_check_btree_backpointer(struct btree_trans *trans, struct btree_iter *bp_iter,
501 struct bch_fs *c = trans->c;
502 struct btree_iter alloc_iter = { NULL };
504 struct bkey_s_c alloc_k;
505 struct printbuf buf = PRINTBUF;
508 if (fsck_err_on(!bch2_dev_exists2(c, k.k->p.inode), c,
509 "backpointer for mising device:\n%s",
510 (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
511 ret = bch2_btree_delete_at(trans, bp_iter, 0);
515 ca = bch_dev_bkey_exists(c, k.k->p.inode);
517 bch2_trans_iter_init(trans, &alloc_iter, BTREE_ID_alloc,
518 bp_pos_to_bucket(c, k.k->p), 0);
520 alloc_k = bch2_btree_iter_peek_slot(&alloc_iter);
521 ret = bkey_err(alloc_k);
525 if (fsck_err_on(alloc_k.k->type != KEY_TYPE_alloc_v4, c,
526 "backpointer for nonexistent alloc key: %llu:%llu:0\n%s",
527 alloc_iter.pos.inode, alloc_iter.pos.offset,
528 (bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf))) {
529 ret = bch2_btree_delete_at(trans, bp_iter, 0);
534 bch2_trans_iter_exit(trans, &alloc_iter);
539 /* verify that every backpointer has a corresponding alloc key */
540 int bch2_check_btree_backpointers(struct bch_fs *c)
542 struct btree_iter iter;
545 return bch2_trans_run(c,
546 for_each_btree_key_commit(&trans, iter,
547 BTREE_ID_backpointers, POS_MIN, 0, k,
548 NULL, NULL, BTREE_INSERT_LAZY_RW|BTREE_INSERT_NOFAIL,
549 bch2_check_btree_backpointer(&trans, &iter, k)));
557 static int check_bp_exists(struct btree_trans *trans,
558 struct bpos bucket_pos,
559 struct bch_backpointer bp,
560 struct bkey_s_c orig_k,
561 struct bpos bucket_start,
562 struct bpos bucket_end,
563 struct bpos_level *last_flushed)
565 struct bch_fs *c = trans->c;
566 struct btree_iter alloc_iter, bp_iter = { NULL };
567 struct printbuf buf = PRINTBUF;
568 struct bkey_s_c alloc_k, bp_k;
571 if (bpos_lt(bucket_pos, bucket_start) ||
572 bpos_gt(bucket_pos, bucket_end))
575 bch2_trans_iter_init(trans, &alloc_iter, BTREE_ID_alloc, bucket_pos, 0);
576 alloc_k = bch2_btree_iter_peek_slot(&alloc_iter);
577 ret = bkey_err(alloc_k);
581 if (alloc_k.k->type == KEY_TYPE_alloc_v4) {
582 struct bkey_s_c_alloc_v4 a = bkey_s_c_to_alloc_v4(alloc_k);
583 const struct bch_backpointer *bps = alloc_v4_backpointers_c(a.v);
584 unsigned i, nr = BCH_ALLOC_V4_NR_BACKPOINTERS(a.v);
586 for (i = 0; i < nr; i++) {
587 int cmp = backpointer_cmp(bps[i], bp) ?:
588 memcmp(&bps[i], &bp, sizeof(bp));
598 bch2_trans_iter_init(trans, &bp_iter, BTREE_ID_backpointers,
599 bucket_pos_to_bp(c, bucket_pos, bp.bucket_offset),
601 bp_k = bch2_btree_iter_peek_slot(&bp_iter);
602 ret = bkey_err(bp_k);
606 if (bp_k.k->type != KEY_TYPE_backpointer ||
607 memcmp(bkey_s_c_to_backpointer(bp_k).v, &bp, sizeof(bp))) {
608 if (last_flushed->level != bp.level ||
609 !bpos_eq(last_flushed->pos, orig_k.k->p)) {
610 last_flushed->level = bp.level;
611 last_flushed->pos = orig_k.k->p;
613 ret = bch2_btree_write_buffer_flush_sync(trans) ?:
614 -BCH_ERR_transaction_restart_write_buffer_flush;
622 bch2_trans_iter_exit(trans, &bp_iter);
623 bch2_trans_iter_exit(trans, &alloc_iter);
628 prt_printf(&buf, "missing backpointer for btree=%s l=%u ",
629 bch2_btree_ids[bp.btree_id], bp.level);
630 bch2_bkey_val_to_text(&buf, c, orig_k);
631 prt_printf(&buf, "\nbp pos ");
632 bch2_bpos_to_text(&buf, bp_iter.pos);
634 if (c->sb.version < bcachefs_metadata_version_backpointers ||
635 c->opts.reconstruct_alloc ||
636 fsck_err(c, "%s", buf.buf)) {
637 struct bkey_i_alloc_v4 *a = bch2_alloc_to_v4_mut(trans, alloc_k);
639 ret = PTR_ERR_OR_ZERO(a) ?:
640 bch2_bucket_backpointer_mod(trans, a, bp, orig_k, true);
646 static int check_extent_to_backpointers(struct btree_trans *trans,
647 struct btree_iter *iter,
648 struct bpos bucket_start,
649 struct bpos bucket_end,
650 struct bpos_level *last_flushed)
652 struct bch_fs *c = trans->c;
653 struct bkey_ptrs_c ptrs;
654 const union bch_extent_entry *entry;
655 struct extent_ptr_decoded p;
659 k = bch2_btree_iter_peek_all_levels(iter);
666 ptrs = bch2_bkey_ptrs_c(k);
667 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
668 struct bpos bucket_pos;
669 struct bch_backpointer bp;
674 bch2_extent_ptr_to_bp(c, iter->btree_id, iter->path->level,
675 k, p, &bucket_pos, &bp);
677 ret = check_bp_exists(trans, bucket_pos, bp, k,
678 bucket_start, bucket_end,
687 static int check_btree_root_to_backpointers(struct btree_trans *trans,
688 enum btree_id btree_id,
689 struct bpos bucket_start,
690 struct bpos bucket_end,
691 struct bpos_level *last_flushed)
693 struct bch_fs *c = trans->c;
694 struct btree_iter iter;
697 struct bkey_ptrs_c ptrs;
698 struct extent_ptr_decoded p;
699 const union bch_extent_entry *entry;
702 bch2_trans_node_iter_init(trans, &iter, btree_id, POS_MIN, 0,
703 c->btree_roots[btree_id].level, 0);
704 b = bch2_btree_iter_peek_node(&iter);
705 ret = PTR_ERR_OR_ZERO(b);
709 BUG_ON(b != btree_node_root(c, b));
711 k = bkey_i_to_s_c(&b->key);
712 ptrs = bch2_bkey_ptrs_c(k);
713 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
714 struct bpos bucket_pos;
715 struct bch_backpointer bp;
720 bch2_extent_ptr_to_bp(c, iter.btree_id, b->c.level + 1,
721 k, p, &bucket_pos, &bp);
723 ret = check_bp_exists(trans, bucket_pos, bp, k,
724 bucket_start, bucket_end,
730 bch2_trans_iter_exit(trans, &iter);
734 static inline struct bbpos bp_to_bbpos(struct bch_backpointer bp)
736 return (struct bbpos) {
737 .btree = bp.btree_id,
742 static size_t btree_nodes_fit_in_ram(struct bch_fs *c)
748 mem_bytes = i.totalram * i.mem_unit;
749 return div_u64(mem_bytes >> 1, btree_bytes(c));
752 int bch2_get_btree_in_memory_pos(struct btree_trans *trans,
753 unsigned btree_leaf_mask,
754 unsigned btree_interior_mask,
755 struct bbpos start, struct bbpos *end)
757 struct btree_iter iter;
759 size_t btree_nodes = btree_nodes_fit_in_ram(trans->c);
763 for (btree = start.btree; btree < BTREE_ID_NR && !ret; btree++) {
764 unsigned depth = ((1U << btree) & btree_leaf_mask) ? 1 : 2;
766 if (!((1U << btree) & btree_leaf_mask) &&
767 !((1U << btree) & btree_interior_mask))
770 bch2_trans_node_iter_init(trans, &iter, btree,
771 btree == start.btree ? start.pos : POS_MIN,
774 * for_each_btree_key_contineu() doesn't check the return value
775 * from bch2_btree_iter_advance(), which is needed when
776 * iterating over interior nodes where we'll see keys at
780 k = __bch2_btree_iter_peek_and_restart(trans, &iter, 0);
787 *end = BBPOS(btree, k.k->p);
788 bch2_trans_iter_exit(trans, &iter);
791 } while (bch2_btree_iter_advance(&iter));
792 bch2_trans_iter_exit(trans, &iter);
799 static int bch2_check_extents_to_backpointers_pass(struct btree_trans *trans,
800 struct bpos bucket_start,
801 struct bpos bucket_end)
803 struct btree_iter iter;
804 enum btree_id btree_id;
805 struct bpos_level last_flushed = { UINT_MAX };
808 for (btree_id = 0; btree_id < BTREE_ID_NR; btree_id++) {
809 unsigned depth = btree_type_has_ptrs(btree_id) ? 0 : 1;
811 bch2_trans_node_iter_init(trans, &iter, btree_id, POS_MIN, 0,
813 BTREE_ITER_ALL_LEVELS|
814 BTREE_ITER_PREFETCH);
817 ret = commit_do(trans, NULL, NULL,
818 BTREE_INSERT_LAZY_RW|
820 check_extent_to_backpointers(trans, &iter,
821 bucket_start, bucket_end,
825 } while (!bch2_btree_iter_advance(&iter));
827 bch2_trans_iter_exit(trans, &iter);
832 ret = commit_do(trans, NULL, NULL,
833 BTREE_INSERT_LAZY_RW|
835 check_btree_root_to_backpointers(trans, btree_id,
836 bucket_start, bucket_end,
844 static struct bpos bucket_pos_to_bp_safe(const struct bch_fs *c,
847 return bch2_dev_exists2(c, bucket.inode)
848 ? bucket_pos_to_bp(c, bucket, 0)
852 int bch2_get_alloc_in_memory_pos(struct btree_trans *trans,
853 struct bpos start, struct bpos *end)
855 struct btree_iter alloc_iter;
856 struct btree_iter bp_iter;
857 struct bkey_s_c alloc_k, bp_k;
858 size_t btree_nodes = btree_nodes_fit_in_ram(trans->c);
859 bool alloc_end = false, bp_end = false;
862 bch2_trans_node_iter_init(trans, &alloc_iter, BTREE_ID_alloc,
864 bch2_trans_node_iter_init(trans, &bp_iter, BTREE_ID_backpointers,
865 bucket_pos_to_bp_safe(trans->c, start), 0, 1, 0);
868 ? __bch2_btree_iter_peek_and_restart(trans, &alloc_iter, 0)
871 ? __bch2_btree_iter_peek_and_restart(trans, &bp_iter, 0)
874 ret = bkey_err(alloc_k) ?: bkey_err(bp_k);
875 if ((!alloc_k.k && !bp_k.k) || ret) {
886 if (bpos_lt(alloc_iter.pos, SPOS_MAX) &&
887 bpos_lt(bucket_pos_to_bp_safe(trans->c, alloc_iter.pos), bp_iter.pos)) {
888 if (!bch2_btree_iter_advance(&alloc_iter))
891 if (!bch2_btree_iter_advance(&bp_iter))
895 bch2_trans_iter_exit(trans, &bp_iter);
896 bch2_trans_iter_exit(trans, &alloc_iter);
900 int bch2_check_extents_to_backpointers(struct bch_fs *c)
902 struct btree_trans trans;
903 struct bpos start = POS_MIN, end;
906 bch2_trans_init(&trans, c, 0, 0);
908 ret = bch2_get_alloc_in_memory_pos(&trans, start, &end);
912 if (bpos_eq(start, POS_MIN) && !bpos_eq(end, SPOS_MAX))
913 bch_verbose(c, "%s(): alloc info does not fit in ram, running in multiple passes with %zu nodes per pass",
914 __func__, btree_nodes_fit_in_ram(c));
916 if (!bpos_eq(start, POS_MIN) || !bpos_eq(end, SPOS_MAX)) {
917 struct printbuf buf = PRINTBUF;
919 prt_str(&buf, "check_extents_to_backpointers(): ");
920 bch2_bpos_to_text(&buf, start);
922 bch2_bpos_to_text(&buf, end);
924 bch_verbose(c, "%s", buf.buf);
928 ret = bch2_check_extents_to_backpointers_pass(&trans, start, end);
929 if (ret || bpos_eq(end, SPOS_MAX))
932 start = bpos_successor(end);
934 bch2_trans_exit(&trans);
939 static int check_one_backpointer(struct btree_trans *trans,
944 struct bpos *last_flushed_pos)
946 struct bch_fs *c = trans->c;
947 struct btree_iter iter;
948 struct bch_backpointer bp;
952 struct printbuf buf = PRINTBUF;
955 ret = bch2_get_next_backpointer(trans, bucket, -1, bp_offset, &bp, 0);
956 if (ret || *bp_offset == U64_MAX)
959 pos = bp_to_bbpos(bp);
960 if (bbpos_cmp(pos, start) < 0 ||
961 bbpos_cmp(pos, end) > 0)
964 k = bch2_backpointer_get_key(trans, &iter, bucket, *bp_offset, bp);
966 if (ret == -BCH_ERR_backpointer_to_overwritten_btree_node)
971 bp_pos = bucket_pos_to_bp(c, bucket,
972 max(*bp_offset, BACKPOINTER_OFFSET_MAX) - BACKPOINTER_OFFSET_MAX);
974 if (!k.k && !bpos_eq(*last_flushed_pos, bp_pos)) {
975 *last_flushed_pos = bp_pos;
976 pr_info("flushing at %llu:%llu",
977 last_flushed_pos->inode,
978 last_flushed_pos->offset);
980 ret = bch2_btree_write_buffer_flush_sync(trans) ?:
981 -BCH_ERR_transaction_restart_write_buffer_flush;
985 if (fsck_err_on(!k.k, c,
986 "%s backpointer points to missing extent\n%s",
987 *bp_offset < BACKPOINTER_OFFSET_MAX ? "alloc" : "btree",
988 (bch2_backpointer_to_text(&buf, &bp), buf.buf))) {
989 ret = bch2_backpointer_del_by_offset(trans, bucket, *bp_offset, bp);
991 bch_err(c, "backpointer at %llu not found", *bp_offset);
995 bch2_trans_iter_exit(trans, &iter);
1000 static int bch2_check_backpointers_to_extents_pass(struct btree_trans *trans,
1004 struct btree_iter iter;
1006 struct bpos last_flushed_pos = SPOS_MAX;
1009 for_each_btree_key(trans, iter, BTREE_ID_alloc, POS_MIN,
1010 BTREE_ITER_PREFETCH, k, ret) {
1013 while (!(ret = commit_do(trans, NULL, NULL,
1014 BTREE_INSERT_LAZY_RW|
1015 BTREE_INSERT_NOFAIL,
1016 check_one_backpointer(trans, iter.pos, &bp_offset,
1017 start, end, &last_flushed_pos))) &&
1018 bp_offset < U64_MAX)
1024 bch2_trans_iter_exit(trans, &iter);
1025 return ret < 0 ? ret : 0;
1028 int bch2_check_backpointers_to_extents(struct bch_fs *c)
1030 struct btree_trans trans;
1031 struct bbpos start = (struct bbpos) { .btree = 0, .pos = POS_MIN, }, end;
1034 bch2_trans_init(&trans, c, 0, 0);
1036 ret = bch2_get_btree_in_memory_pos(&trans,
1037 (1U << BTREE_ID_extents)|
1038 (1U << BTREE_ID_reflink),
1044 if (!bbpos_cmp(start, BBPOS_MIN) &&
1045 bbpos_cmp(end, BBPOS_MAX))
1046 bch_verbose(c, "%s(): extents do not fit in ram, running in multiple passes with %zu nodes per pass",
1047 __func__, btree_nodes_fit_in_ram(c));
1049 if (bbpos_cmp(start, BBPOS_MIN) ||
1050 bbpos_cmp(end, BBPOS_MAX)) {
1051 struct printbuf buf = PRINTBUF;
1053 prt_str(&buf, "check_backpointers_to_extents(): ");
1054 bch2_bbpos_to_text(&buf, start);
1056 bch2_bbpos_to_text(&buf, end);
1058 bch_verbose(c, "%s", buf.buf);
1059 printbuf_exit(&buf);
1062 ret = bch2_check_backpointers_to_extents_pass(&trans, start, end);
1063 if (ret || !bbpos_cmp(end, BBPOS_MAX))
1066 start = bbpos_successor(end);
1068 bch2_trans_exit(&trans);