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 enum bkey_invalid_flags flags,
44 struct bkey_s_c_backpointer bp = bkey_s_c_to_backpointer(k);
45 struct bpos bucket = bp_pos_to_bucket(c, bp.k->p);
47 if (!bpos_eq(bp.k->p, bucket_pos_to_bp(c, bucket, bp.v->bucket_offset))) {
48 prt_str(err, "backpointer at wrong pos");
49 return -BCH_ERR_invalid_bkey;
55 void bch2_backpointer_to_text(struct printbuf *out, const struct bch_backpointer *bp)
57 prt_printf(out, "btree=%s l=%u offset=%llu:%u len=%u pos=",
58 bch2_btree_ids[bp->btree_id],
60 (u64) (bp->bucket_offset >> MAX_EXTENT_COMPRESS_RATIO_SHIFT),
61 (u32) bp->bucket_offset & ~(~0U << MAX_EXTENT_COMPRESS_RATIO_SHIFT),
63 bch2_bpos_to_text(out, bp->pos);
66 void bch2_backpointer_k_to_text(struct printbuf *out, struct bch_fs *c, struct bkey_s_c k)
68 prt_str(out, "bucket=");
69 bch2_bpos_to_text(out, bp_pos_to_bucket(c, k.k->p));
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 static noinline int backpointer_mod_err(struct btree_trans *trans,
85 struct bch_backpointer bp,
87 struct bkey_s_c orig_k,
90 struct bch_fs *c = trans->c;
91 struct printbuf buf = PRINTBUF;
94 prt_printf(&buf, "existing backpointer found when inserting ");
95 bch2_backpointer_to_text(&buf, &bp);
97 printbuf_indent_add(&buf, 2);
99 prt_printf(&buf, "found ");
100 bch2_bkey_val_to_text(&buf, c, bp_k);
103 prt_printf(&buf, "for ");
104 bch2_bkey_val_to_text(&buf, c, orig_k);
106 bch_err(c, "%s", buf.buf);
107 } else if (c->curr_recovery_pass > BCH_RECOVERY_PASS_check_extents_to_backpointers) {
108 prt_printf(&buf, "backpointer not found when deleting");
110 printbuf_indent_add(&buf, 2);
112 prt_printf(&buf, "searching for ");
113 bch2_backpointer_to_text(&buf, &bp);
116 prt_printf(&buf, "got ");
117 bch2_bkey_val_to_text(&buf, c, bp_k);
120 prt_printf(&buf, "for ");
121 bch2_bkey_val_to_text(&buf, c, orig_k);
123 bch_err(c, "%s", buf.buf);
128 if (c->curr_recovery_pass > BCH_RECOVERY_PASS_check_extents_to_backpointers) {
129 bch2_inconsistent_error(c);
136 int bch2_bucket_backpointer_mod_nowritebuffer(struct btree_trans *trans,
138 struct bch_backpointer bp,
139 struct bkey_s_c orig_k,
142 struct bch_fs *c = trans->c;
143 struct bkey_i_backpointer *bp_k;
144 struct btree_iter bp_iter;
148 bp_k = bch2_trans_kmalloc_nomemzero(trans, sizeof(struct bkey_i_backpointer));
149 ret = PTR_ERR_OR_ZERO(bp_k);
153 bkey_backpointer_init(&bp_k->k_i);
154 bp_k->k.p = bucket_pos_to_bp(c, bucket, bp.bucket_offset);
158 bp_k->k.type = KEY_TYPE_deleted;
159 set_bkey_val_u64s(&bp_k->k, 0);
162 k = bch2_bkey_get_iter(trans, &bp_iter, BTREE_ID_backpointers,
166 BTREE_ITER_WITH_UPDATES);
173 : (k.k->type != KEY_TYPE_backpointer ||
174 memcmp(bkey_s_c_to_backpointer(k).v, &bp, sizeof(bp)))) {
175 ret = backpointer_mod_err(trans, bp, k, orig_k, insert);
180 ret = bch2_trans_update(trans, &bp_iter, &bp_k->k_i, 0);
182 bch2_trans_iter_exit(trans, &bp_iter);
187 * Find the next backpointer >= *bp_offset:
189 int bch2_get_next_backpointer(struct btree_trans *trans,
190 struct bpos bucket, int gen,
192 struct bch_backpointer *bp,
195 struct bch_fs *c = trans->c;
196 struct bpos bp_end_pos = bucket_pos_to_bp(c, bpos_nosnap_successor(bucket), 0);
197 struct btree_iter alloc_iter = { NULL }, bp_iter = { NULL };
201 if (bpos_ge(*bp_pos, bp_end_pos))
205 k = bch2_bkey_get_iter(trans, &alloc_iter, BTREE_ID_alloc,
206 bucket, BTREE_ITER_CACHED|iter_flags);
211 if (k.k->type != KEY_TYPE_alloc_v4 ||
212 bkey_s_c_to_alloc_v4(k).v->gen != gen)
216 *bp_pos = bpos_max(*bp_pos, bucket_pos_to_bp(c, bucket, 0));
218 for_each_btree_key_norestart(trans, bp_iter, BTREE_ID_backpointers,
219 *bp_pos, iter_flags, k, ret) {
220 if (bpos_ge(k.k->p, bp_end_pos))
224 *bp = *bkey_s_c_to_backpointer(k).v;
230 bch2_trans_iter_exit(trans, &bp_iter);
231 bch2_trans_iter_exit(trans, &alloc_iter);
235 static void backpointer_not_found(struct btree_trans *trans,
237 struct bch_backpointer bp,
239 const char *thing_it_points_to)
241 struct bch_fs *c = trans->c;
242 struct printbuf buf = PRINTBUF;
243 struct bpos bucket = bp_pos_to_bucket(c, bp_pos);
245 if (likely(!bch2_backpointers_no_use_write_buffer))
248 prt_printf(&buf, "backpointer doesn't match %s it points to:\n ",
250 prt_printf(&buf, "bucket: ");
251 bch2_bpos_to_text(&buf, bucket);
252 prt_printf(&buf, "\n ");
254 prt_printf(&buf, "backpointer pos: ");
255 bch2_bpos_to_text(&buf, bp_pos);
256 prt_printf(&buf, "\n ");
258 bch2_backpointer_to_text(&buf, &bp);
259 prt_printf(&buf, "\n ");
260 bch2_bkey_val_to_text(&buf, c, k);
261 if (c->curr_recovery_pass >= BCH_RECOVERY_PASS_check_extents_to_backpointers)
262 bch_err_ratelimited(c, "%s", buf.buf);
264 bch2_trans_inconsistent(trans, "%s", buf.buf);
269 struct bkey_s_c bch2_backpointer_get_key(struct btree_trans *trans,
270 struct btree_iter *iter,
272 struct bch_backpointer bp,
275 struct bch_fs *c = trans->c;
276 struct btree_root *r = bch2_btree_id_root(c, bp.btree_id);
277 struct bpos bucket = bp_pos_to_bucket(c, bp_pos);
280 bch2_trans_node_iter_init(trans, iter,
284 min(bp.level, r->level),
286 k = bch2_btree_iter_peek_slot(iter);
288 bch2_trans_iter_exit(trans, iter);
292 if (bp.level == r->level + 1)
293 k = bkey_i_to_s_c(&r->key);
295 if (k.k && extent_matches_bp(c, bp.btree_id, bp.level, k, bucket, bp))
298 bch2_trans_iter_exit(trans, iter);
300 if (unlikely(bch2_backpointers_no_use_write_buffer)) {
305 * If a backpointer for a btree node wasn't found, it may be
306 * because it was overwritten by a new btree node that hasn't
307 * been written out yet - backpointer_get_node() checks for
310 b = bch2_backpointer_get_node(trans, iter, bp_pos, bp);
311 if (!IS_ERR_OR_NULL(b))
312 return bkey_i_to_s_c(&b->key);
314 bch2_trans_iter_exit(trans, iter);
317 return bkey_s_c_err(PTR_ERR(b));
318 return bkey_s_c_null;
321 backpointer_not_found(trans, bp_pos, bp, k, "extent");
324 return bkey_s_c_null;
327 struct btree *bch2_backpointer_get_node(struct btree_trans *trans,
328 struct btree_iter *iter,
330 struct bch_backpointer bp)
332 struct bch_fs *c = trans->c;
333 struct bpos bucket = bp_pos_to_bucket(c, bp_pos);
338 bch2_trans_node_iter_init(trans, iter,
344 b = bch2_btree_iter_peek_node(iter);
348 if (b && extent_matches_bp(c, bp.btree_id, bp.level,
349 bkey_i_to_s_c(&b->key),
353 if (b && btree_node_will_make_reachable(b)) {
354 b = ERR_PTR(-BCH_ERR_backpointer_to_overwritten_btree_node);
356 backpointer_not_found(trans, bp_pos, bp,
357 bkey_i_to_s_c(&b->key), "btree node");
361 bch2_trans_iter_exit(trans, iter);
365 static int bch2_check_btree_backpointer(struct btree_trans *trans, struct btree_iter *bp_iter,
368 struct bch_fs *c = trans->c;
369 struct btree_iter alloc_iter = { NULL };
371 struct bkey_s_c alloc_k;
372 struct printbuf buf = PRINTBUF;
375 if (fsck_err_on(!bch2_dev_exists2(c, k.k->p.inode), c,
376 "backpointer for mising device:\n%s",
377 (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
378 ret = bch2_btree_delete_at(trans, bp_iter, 0);
382 ca = bch_dev_bkey_exists(c, k.k->p.inode);
384 alloc_k = bch2_bkey_get_iter(trans, &alloc_iter, BTREE_ID_alloc,
385 bp_pos_to_bucket(c, k.k->p), 0);
386 ret = bkey_err(alloc_k);
390 if (fsck_err_on(alloc_k.k->type != KEY_TYPE_alloc_v4, c,
391 "backpointer for nonexistent alloc key: %llu:%llu:0\n%s",
392 alloc_iter.pos.inode, alloc_iter.pos.offset,
393 (bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf))) {
394 ret = bch2_btree_delete_at(trans, bp_iter, 0);
399 bch2_trans_iter_exit(trans, &alloc_iter);
404 /* verify that every backpointer has a corresponding alloc key */
405 int bch2_check_btree_backpointers(struct bch_fs *c)
407 struct btree_iter iter;
411 ret = bch2_trans_run(c,
412 for_each_btree_key_commit(&trans, iter,
413 BTREE_ID_backpointers, POS_MIN, 0, k,
414 NULL, NULL, BTREE_INSERT_LAZY_RW|BTREE_INSERT_NOFAIL,
415 bch2_check_btree_backpointer(&trans, &iter, k)));
426 static int check_bp_exists(struct btree_trans *trans,
428 struct bch_backpointer bp,
429 struct bkey_s_c orig_k,
430 struct bpos bucket_start,
431 struct bpos bucket_end,
432 struct bpos_level *last_flushed)
434 struct bch_fs *c = trans->c;
435 struct btree_iter bp_iter = { NULL };
436 struct printbuf buf = PRINTBUF;
437 struct bkey_s_c bp_k;
440 if (bpos_lt(bucket, bucket_start) ||
441 bpos_gt(bucket, bucket_end))
444 if (!bch2_dev_bucket_exists(c, bucket))
447 bp_k = bch2_bkey_get_iter(trans, &bp_iter, BTREE_ID_backpointers,
448 bucket_pos_to_bp(c, bucket, bp.bucket_offset),
450 ret = bkey_err(bp_k);
454 if (bp_k.k->type != KEY_TYPE_backpointer ||
455 memcmp(bkey_s_c_to_backpointer(bp_k).v, &bp, sizeof(bp))) {
456 if (last_flushed->level != bp.level ||
457 !bpos_eq(last_flushed->pos, orig_k.k->p)) {
458 last_flushed->level = bp.level;
459 last_flushed->pos = orig_k.k->p;
461 ret = bch2_btree_write_buffer_flush_sync(trans) ?:
462 -BCH_ERR_transaction_restart_write_buffer_flush;
470 bch2_trans_iter_exit(trans, &bp_iter);
474 prt_printf(&buf, "missing backpointer for btree=%s l=%u ",
475 bch2_btree_ids[bp.btree_id], bp.level);
476 bch2_bkey_val_to_text(&buf, c, orig_k);
477 prt_printf(&buf, "\nbp pos ");
478 bch2_bpos_to_text(&buf, bp_iter.pos);
480 if (c->sb.version < bcachefs_metadata_version_backpointers ||
481 c->opts.reconstruct_alloc ||
482 fsck_err(c, "%s", buf.buf))
483 ret = bch2_bucket_backpointer_mod(trans, bucket, bp, orig_k, true);
488 static int check_extent_to_backpointers(struct btree_trans *trans,
489 struct btree_iter *iter,
490 struct bpos bucket_start,
491 struct bpos bucket_end,
492 struct bpos_level *last_flushed)
494 struct bch_fs *c = trans->c;
495 struct bkey_ptrs_c ptrs;
496 const union bch_extent_entry *entry;
497 struct extent_ptr_decoded p;
501 k = bch2_btree_iter_peek_all_levels(iter);
508 ptrs = bch2_bkey_ptrs_c(k);
509 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
510 struct bpos bucket_pos;
511 struct bch_backpointer bp;
516 bch2_extent_ptr_to_bp(c, iter->btree_id, iter->path->level,
517 k, p, &bucket_pos, &bp);
519 ret = check_bp_exists(trans, bucket_pos, bp, k,
520 bucket_start, bucket_end,
529 static int check_btree_root_to_backpointers(struct btree_trans *trans,
530 enum btree_id btree_id,
531 struct bpos bucket_start,
532 struct bpos bucket_end,
533 struct bpos_level *last_flushed)
535 struct bch_fs *c = trans->c;
536 struct btree_root *r = bch2_btree_id_root(c, btree_id);
537 struct btree_iter iter;
540 struct bkey_ptrs_c ptrs;
541 struct extent_ptr_decoded p;
542 const union bch_extent_entry *entry;
545 bch2_trans_node_iter_init(trans, &iter, btree_id, POS_MIN, 0, r->level, 0);
546 b = bch2_btree_iter_peek_node(&iter);
547 ret = PTR_ERR_OR_ZERO(b);
551 BUG_ON(b != btree_node_root(c, b));
553 k = bkey_i_to_s_c(&b->key);
554 ptrs = bch2_bkey_ptrs_c(k);
555 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
556 struct bpos bucket_pos;
557 struct bch_backpointer bp;
562 bch2_extent_ptr_to_bp(c, iter.btree_id, b->c.level + 1,
563 k, p, &bucket_pos, &bp);
565 ret = check_bp_exists(trans, bucket_pos, bp, k,
566 bucket_start, bucket_end,
572 bch2_trans_iter_exit(trans, &iter);
576 static inline struct bbpos bp_to_bbpos(struct bch_backpointer bp)
578 return (struct bbpos) {
579 .btree = bp.btree_id,
584 static size_t btree_nodes_fit_in_ram(struct bch_fs *c)
590 mem_bytes = i.totalram * i.mem_unit;
591 return div_u64(mem_bytes >> 1, btree_bytes(c));
594 static int bch2_get_btree_in_memory_pos(struct btree_trans *trans,
595 unsigned btree_leaf_mask,
596 unsigned btree_interior_mask,
597 struct bbpos start, struct bbpos *end)
599 struct btree_iter iter;
601 size_t btree_nodes = btree_nodes_fit_in_ram(trans->c);
605 for (btree = start.btree; btree < BTREE_ID_NR && !ret; btree++) {
606 unsigned depth = ((1U << btree) & btree_leaf_mask) ? 1 : 2;
608 if (!((1U << btree) & btree_leaf_mask) &&
609 !((1U << btree) & btree_interior_mask))
612 bch2_trans_node_iter_init(trans, &iter, btree,
613 btree == start.btree ? start.pos : POS_MIN,
616 * for_each_btree_key_contineu() doesn't check the return value
617 * from bch2_btree_iter_advance(), which is needed when
618 * iterating over interior nodes where we'll see keys at
622 k = __bch2_btree_iter_peek_and_restart(trans, &iter, 0);
629 *end = BBPOS(btree, k.k->p);
630 bch2_trans_iter_exit(trans, &iter);
633 } while (bch2_btree_iter_advance(&iter));
634 bch2_trans_iter_exit(trans, &iter);
641 static int bch2_check_extents_to_backpointers_pass(struct btree_trans *trans,
642 struct bpos bucket_start,
643 struct bpos bucket_end)
645 struct bch_fs *c = trans->c;
646 struct btree_iter iter;
647 enum btree_id btree_id;
648 struct bpos_level last_flushed = { UINT_MAX };
651 for (btree_id = 0; btree_id < btree_id_nr_alive(c); btree_id++) {
652 unsigned depth = btree_type_has_ptrs(btree_id) ? 0 : 1;
654 bch2_trans_node_iter_init(trans, &iter, btree_id, POS_MIN, 0,
656 BTREE_ITER_ALL_LEVELS|
657 BTREE_ITER_PREFETCH);
660 ret = commit_do(trans, NULL, NULL,
661 BTREE_INSERT_LAZY_RW|
663 check_extent_to_backpointers(trans, &iter,
664 bucket_start, bucket_end,
668 } while (!bch2_btree_iter_advance(&iter));
670 bch2_trans_iter_exit(trans, &iter);
675 ret = commit_do(trans, NULL, NULL,
676 BTREE_INSERT_LAZY_RW|
678 check_btree_root_to_backpointers(trans, btree_id,
679 bucket_start, bucket_end,
687 static struct bpos bucket_pos_to_bp_safe(const struct bch_fs *c,
690 return bch2_dev_exists2(c, bucket.inode)
691 ? bucket_pos_to_bp(c, bucket, 0)
695 static int bch2_get_alloc_in_memory_pos(struct btree_trans *trans,
696 struct bpos start, struct bpos *end)
698 struct btree_iter alloc_iter;
699 struct btree_iter bp_iter;
700 struct bkey_s_c alloc_k, bp_k;
701 size_t btree_nodes = btree_nodes_fit_in_ram(trans->c);
702 bool alloc_end = false, bp_end = false;
705 bch2_trans_node_iter_init(trans, &alloc_iter, BTREE_ID_alloc,
707 bch2_trans_node_iter_init(trans, &bp_iter, BTREE_ID_backpointers,
708 bucket_pos_to_bp_safe(trans->c, start), 0, 1, 0);
711 ? __bch2_btree_iter_peek_and_restart(trans, &alloc_iter, 0)
714 ? __bch2_btree_iter_peek_and_restart(trans, &bp_iter, 0)
717 ret = bkey_err(alloc_k) ?: bkey_err(bp_k);
718 if ((!alloc_k.k && !bp_k.k) || ret) {
729 if (bpos_lt(alloc_iter.pos, SPOS_MAX) &&
730 bpos_lt(bucket_pos_to_bp_safe(trans->c, alloc_iter.pos), bp_iter.pos)) {
731 if (!bch2_btree_iter_advance(&alloc_iter))
734 if (!bch2_btree_iter_advance(&bp_iter))
738 bch2_trans_iter_exit(trans, &bp_iter);
739 bch2_trans_iter_exit(trans, &alloc_iter);
743 int bch2_check_extents_to_backpointers(struct bch_fs *c)
745 struct btree_trans trans;
746 struct bpos start = POS_MIN, end;
749 bch2_trans_init(&trans, c, 0, 0);
751 ret = bch2_get_alloc_in_memory_pos(&trans, start, &end);
755 if (bpos_eq(start, POS_MIN) && !bpos_eq(end, SPOS_MAX))
756 bch_verbose(c, "%s(): alloc info does not fit in ram, running in multiple passes with %zu nodes per pass",
757 __func__, btree_nodes_fit_in_ram(c));
759 if (!bpos_eq(start, POS_MIN) || !bpos_eq(end, SPOS_MAX)) {
760 struct printbuf buf = PRINTBUF;
762 prt_str(&buf, "check_extents_to_backpointers(): ");
763 bch2_bpos_to_text(&buf, start);
765 bch2_bpos_to_text(&buf, end);
767 bch_verbose(c, "%s", buf.buf);
771 ret = bch2_check_extents_to_backpointers_pass(&trans, start, end);
772 if (ret || bpos_eq(end, SPOS_MAX))
775 start = bpos_successor(end);
777 bch2_trans_exit(&trans);
784 static int check_one_backpointer(struct btree_trans *trans,
787 struct bkey_s_c_backpointer bp,
788 struct bpos *last_flushed_pos)
790 struct bch_fs *c = trans->c;
791 struct btree_iter iter;
792 struct bbpos pos = bp_to_bbpos(*bp.v);
794 struct printbuf buf = PRINTBUF;
797 if (bbpos_cmp(pos, start) < 0 ||
798 bbpos_cmp(pos, end) > 0)
801 k = bch2_backpointer_get_key(trans, &iter, bp.k->p, *bp.v, 0);
803 if (ret == -BCH_ERR_backpointer_to_overwritten_btree_node)
808 if (!k.k && !bpos_eq(*last_flushed_pos, bp.k->p)) {
809 *last_flushed_pos = bp.k->p;
810 ret = bch2_btree_write_buffer_flush_sync(trans) ?:
811 -BCH_ERR_transaction_restart_write_buffer_flush;
815 if (fsck_err_on(!k.k, c,
816 "backpointer for missing extent\n %s",
817 (bch2_bkey_val_to_text(&buf, c, bp.s_c), buf.buf))) {
818 ret = bch2_btree_delete_at_buffered(trans, BTREE_ID_backpointers, bp.k->p);
823 bch2_trans_iter_exit(trans, &iter);
828 static int bch2_check_backpointers_to_extents_pass(struct btree_trans *trans,
832 struct btree_iter iter;
834 struct bpos last_flushed_pos = SPOS_MAX;
836 return for_each_btree_key_commit(trans, iter, BTREE_ID_backpointers,
837 POS_MIN, BTREE_ITER_PREFETCH, k,
838 NULL, NULL, BTREE_INSERT_LAZY_RW|BTREE_INSERT_NOFAIL,
839 check_one_backpointer(trans, start, end,
840 bkey_s_c_to_backpointer(k),
844 int bch2_check_backpointers_to_extents(struct bch_fs *c)
846 struct btree_trans trans;
847 struct bbpos start = (struct bbpos) { .btree = 0, .pos = POS_MIN, }, end;
850 bch2_trans_init(&trans, c, 0, 0);
852 ret = bch2_get_btree_in_memory_pos(&trans,
853 (1U << BTREE_ID_extents)|
854 (1U << BTREE_ID_reflink),
860 if (!bbpos_cmp(start, BBPOS_MIN) &&
861 bbpos_cmp(end, BBPOS_MAX))
862 bch_verbose(c, "%s(): extents do not fit in ram, running in multiple passes with %zu nodes per pass",
863 __func__, btree_nodes_fit_in_ram(c));
865 if (bbpos_cmp(start, BBPOS_MIN) ||
866 bbpos_cmp(end, BBPOS_MAX)) {
867 struct printbuf buf = PRINTBUF;
869 prt_str(&buf, "check_backpointers_to_extents(): ");
870 bch2_bbpos_to_text(&buf, start);
872 bch2_bbpos_to_text(&buf, end);
874 bch_verbose(c, "%s", buf.buf);
878 ret = bch2_check_backpointers_to_extents_pass(&trans, start, end);
879 if (ret || !bbpos_cmp(end, BBPOS_MAX))
882 start = bbpos_successor(end);
884 bch2_trans_exit(&trans);