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_update_interior.h"
9 #include "btree_write_buffer.h"
14 static bool extent_matches_bp(struct bch_fs *c,
15 enum btree_id btree_id, unsigned level,
18 struct bch_backpointer bp)
20 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
21 const union bch_extent_entry *entry;
22 struct extent_ptr_decoded p;
24 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
26 struct bch_backpointer bp2;
31 bch2_extent_ptr_to_bp(c, btree_id, level, k, p,
33 if (bpos_eq(bucket, bucket2) &&
34 !memcmp(&bp, &bp2, sizeof(bp)))
41 int bch2_backpointer_invalid(struct bch_fs *c, struct bkey_s_c k,
42 enum bkey_invalid_flags flags,
45 struct bkey_s_c_backpointer bp = bkey_s_c_to_backpointer(k);
46 struct bpos bucket = bp_pos_to_bucket(c, bp.k->p);
49 bkey_fsck_err_on(!bpos_eq(bp.k->p, bucket_pos_to_bp(c, bucket, bp.v->bucket_offset)),
51 backpointer_pos_wrong,
52 "backpointer at wrong pos");
57 void bch2_backpointer_to_text(struct printbuf *out, const struct bch_backpointer *bp)
59 prt_printf(out, "btree=%s l=%u offset=%llu:%u len=%u pos=",
60 bch2_btree_id_str(bp->btree_id),
62 (u64) (bp->bucket_offset >> MAX_EXTENT_COMPRESS_RATIO_SHIFT),
63 (u32) bp->bucket_offset & ~(~0U << MAX_EXTENT_COMPRESS_RATIO_SHIFT),
65 bch2_bpos_to_text(out, bp->pos);
68 void bch2_backpointer_k_to_text(struct printbuf *out, struct bch_fs *c, struct bkey_s_c k)
70 prt_str(out, "bucket=");
71 bch2_bpos_to_text(out, bp_pos_to_bucket(c, k.k->p));
74 bch2_backpointer_to_text(out, bkey_s_c_to_backpointer(k).v);
77 void bch2_backpointer_swab(struct bkey_s k)
79 struct bkey_s_backpointer bp = bkey_s_to_backpointer(k);
81 bp.v->bucket_offset = swab40(bp.v->bucket_offset);
82 bp.v->bucket_len = swab32(bp.v->bucket_len);
83 bch2_bpos_swab(&bp.v->pos);
86 static noinline int backpointer_mod_err(struct btree_trans *trans,
87 struct bch_backpointer bp,
89 struct bkey_s_c orig_k,
92 struct bch_fs *c = trans->c;
93 struct printbuf buf = PRINTBUF;
96 prt_printf(&buf, "existing backpointer found when inserting ");
97 bch2_backpointer_to_text(&buf, &bp);
99 printbuf_indent_add(&buf, 2);
101 prt_printf(&buf, "found ");
102 bch2_bkey_val_to_text(&buf, c, bp_k);
105 prt_printf(&buf, "for ");
106 bch2_bkey_val_to_text(&buf, c, orig_k);
108 bch_err(c, "%s", buf.buf);
109 } else if (c->curr_recovery_pass > BCH_RECOVERY_PASS_check_extents_to_backpointers) {
110 prt_printf(&buf, "backpointer not found when deleting");
112 printbuf_indent_add(&buf, 2);
114 prt_printf(&buf, "searching for ");
115 bch2_backpointer_to_text(&buf, &bp);
118 prt_printf(&buf, "got ");
119 bch2_bkey_val_to_text(&buf, c, bp_k);
122 prt_printf(&buf, "for ");
123 bch2_bkey_val_to_text(&buf, c, orig_k);
125 bch_err(c, "%s", buf.buf);
130 if (c->curr_recovery_pass > BCH_RECOVERY_PASS_check_extents_to_backpointers) {
131 bch2_inconsistent_error(c);
138 int bch2_bucket_backpointer_mod_nowritebuffer(struct btree_trans *trans,
140 struct bch_backpointer bp,
141 struct bkey_s_c orig_k,
144 struct btree_iter bp_iter;
146 struct bkey_i_backpointer *bp_k;
149 bp_k = bch2_trans_kmalloc_nomemzero(trans, sizeof(struct bkey_i_backpointer));
150 ret = PTR_ERR_OR_ZERO(bp_k);
154 bkey_backpointer_init(&bp_k->k_i);
155 bp_k->k.p = bucket_pos_to_bp(trans->c, bucket, bp.bucket_offset);
159 bp_k->k.type = KEY_TYPE_deleted;
160 set_bkey_val_u64s(&bp_k->k, 0);
163 k = bch2_bkey_get_iter(trans, &bp_iter, BTREE_ID_backpointers,
167 BTREE_ITER_WITH_UPDATES);
174 : (k.k->type != KEY_TYPE_backpointer ||
175 memcmp(bkey_s_c_to_backpointer(k).v, &bp, sizeof(bp)))) {
176 ret = backpointer_mod_err(trans, bp, k, orig_k, insert);
181 ret = bch2_trans_update(trans, &bp_iter, &bp_k->k_i, 0);
183 bch2_trans_iter_exit(trans, &bp_iter);
188 * Find the next backpointer >= *bp_offset:
190 int bch2_get_next_backpointer(struct btree_trans *trans,
191 struct bpos bucket, int gen,
193 struct bch_backpointer *bp,
196 struct bch_fs *c = trans->c;
197 struct bpos bp_end_pos = bucket_pos_to_bp(c, bpos_nosnap_successor(bucket), 0);
198 struct btree_iter alloc_iter = { NULL }, bp_iter = { NULL };
202 if (bpos_ge(*bp_pos, bp_end_pos))
206 k = bch2_bkey_get_iter(trans, &alloc_iter, BTREE_ID_alloc,
207 bucket, BTREE_ITER_CACHED|iter_flags);
212 if (k.k->type != KEY_TYPE_alloc_v4 ||
213 bkey_s_c_to_alloc_v4(k).v->gen != gen)
217 *bp_pos = bpos_max(*bp_pos, bucket_pos_to_bp(c, bucket, 0));
219 for_each_btree_key_norestart(trans, bp_iter, BTREE_ID_backpointers,
220 *bp_pos, iter_flags, k, ret) {
221 if (bpos_ge(k.k->p, bp_end_pos))
225 *bp = *bkey_s_c_to_backpointer(k).v;
231 bch2_trans_iter_exit(trans, &bp_iter);
232 bch2_trans_iter_exit(trans, &alloc_iter);
236 static void backpointer_not_found(struct btree_trans *trans,
238 struct bch_backpointer bp,
241 struct bch_fs *c = trans->c;
242 struct printbuf buf = PRINTBUF;
243 struct bpos bucket = bp_pos_to_bucket(c, bp_pos);
246 * If we're using the btree write buffer, the backpointer we were
247 * looking at may have already been deleted - failure to find what it
248 * pointed to is not an error:
250 if (likely(!bch2_backpointers_no_use_write_buffer))
253 prt_printf(&buf, "backpointer doesn't match %s it points to:\n ",
254 bp.level ? "btree node" : "extent");
255 prt_printf(&buf, "bucket: ");
256 bch2_bpos_to_text(&buf, bucket);
257 prt_printf(&buf, "\n ");
259 prt_printf(&buf, "backpointer pos: ");
260 bch2_bpos_to_text(&buf, bp_pos);
261 prt_printf(&buf, "\n ");
263 bch2_backpointer_to_text(&buf, &bp);
264 prt_printf(&buf, "\n ");
265 bch2_bkey_val_to_text(&buf, c, k);
266 if (c->curr_recovery_pass >= BCH_RECOVERY_PASS_check_extents_to_backpointers)
267 bch_err_ratelimited(c, "%s", buf.buf);
269 bch2_trans_inconsistent(trans, "%s", buf.buf);
274 struct bkey_s_c bch2_backpointer_get_key(struct btree_trans *trans,
275 struct btree_iter *iter,
277 struct bch_backpointer bp,
280 if (likely(!bp.level)) {
281 struct bch_fs *c = trans->c;
282 struct bpos bucket = bp_pos_to_bucket(c, bp_pos);
285 bch2_trans_node_iter_init(trans, iter,
290 k = bch2_btree_iter_peek_slot(iter);
292 bch2_trans_iter_exit(trans, iter);
296 if (k.k && extent_matches_bp(c, bp.btree_id, bp.level, k, bucket, bp))
299 bch2_trans_iter_exit(trans, iter);
300 backpointer_not_found(trans, bp_pos, bp, k);
301 return bkey_s_c_null;
303 struct btree *b = bch2_backpointer_get_node(trans, iter, bp_pos, bp);
305 if (IS_ERR_OR_NULL(b)) {
306 bch2_trans_iter_exit(trans, iter);
307 return IS_ERR(b) ? bkey_s_c_err(PTR_ERR(b)) : bkey_s_c_null;
309 return bkey_i_to_s_c(&b->key);
313 struct btree *bch2_backpointer_get_node(struct btree_trans *trans,
314 struct btree_iter *iter,
316 struct bch_backpointer bp)
318 struct bch_fs *c = trans->c;
319 struct bpos bucket = bp_pos_to_bucket(c, bp_pos);
324 bch2_trans_node_iter_init(trans, iter,
330 b = bch2_btree_iter_peek_node(iter);
331 if (IS_ERR_OR_NULL(b))
334 BUG_ON(b->c.level != bp.level - 1);
336 if (extent_matches_bp(c, bp.btree_id, bp.level,
337 bkey_i_to_s_c(&b->key),
341 if (btree_node_will_make_reachable(b)) {
342 b = ERR_PTR(-BCH_ERR_backpointer_to_overwritten_btree_node);
344 backpointer_not_found(trans, bp_pos, bp, bkey_i_to_s_c(&b->key));
348 bch2_trans_iter_exit(trans, iter);
352 static int bch2_check_btree_backpointer(struct btree_trans *trans, struct btree_iter *bp_iter,
355 struct bch_fs *c = trans->c;
356 struct btree_iter alloc_iter = { NULL };
357 struct bkey_s_c alloc_k;
358 struct printbuf buf = PRINTBUF;
361 if (fsck_err_on(!bch2_dev_exists2(c, k.k->p.inode), c,
362 backpointer_to_missing_device,
363 "backpointer for missing device:\n%s",
364 (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
365 ret = bch2_btree_delete_at(trans, bp_iter, 0);
369 alloc_k = bch2_bkey_get_iter(trans, &alloc_iter, BTREE_ID_alloc,
370 bp_pos_to_bucket(c, k.k->p), 0);
371 ret = bkey_err(alloc_k);
375 if (fsck_err_on(alloc_k.k->type != KEY_TYPE_alloc_v4, c,
376 backpointer_to_missing_alloc,
377 "backpointer for nonexistent alloc key: %llu:%llu:0\n%s",
378 alloc_iter.pos.inode, alloc_iter.pos.offset,
379 (bch2_bkey_val_to_text(&buf, c, alloc_k), buf.buf))) {
380 ret = bch2_btree_delete_at(trans, bp_iter, 0);
385 bch2_trans_iter_exit(trans, &alloc_iter);
390 /* verify that every backpointer has a corresponding alloc key */
391 int bch2_check_btree_backpointers(struct bch_fs *c)
393 struct btree_iter iter;
397 ret = bch2_trans_run(c,
398 for_each_btree_key_commit(trans, iter,
399 BTREE_ID_backpointers, POS_MIN, 0, k,
400 NULL, NULL, BCH_TRANS_COMMIT_lazy_rw|BCH_TRANS_COMMIT_no_enospc,
401 bch2_check_btree_backpointer(trans, &iter, k)));
412 static int check_bp_exists(struct btree_trans *trans,
414 struct bch_backpointer bp,
415 struct bkey_s_c orig_k,
416 struct bpos bucket_start,
417 struct bpos bucket_end,
418 struct bpos_level *last_flushed)
420 struct bch_fs *c = trans->c;
421 struct btree_iter bp_iter = { NULL };
422 struct printbuf buf = PRINTBUF;
423 struct bkey_s_c bp_k;
426 if (bpos_lt(bucket, bucket_start) ||
427 bpos_gt(bucket, bucket_end))
430 if (!bch2_dev_bucket_exists(c, bucket))
433 bp_k = bch2_bkey_get_iter(trans, &bp_iter, BTREE_ID_backpointers,
434 bucket_pos_to_bp(c, bucket, bp.bucket_offset),
436 ret = bkey_err(bp_k);
440 if (bp_k.k->type != KEY_TYPE_backpointer ||
441 memcmp(bkey_s_c_to_backpointer(bp_k).v, &bp, sizeof(bp))) {
442 if (last_flushed->level != bp.level ||
443 !bpos_eq(last_flushed->pos, orig_k.k->p)) {
444 last_flushed->level = bp.level;
445 last_flushed->pos = orig_k.k->p;
447 ret = bch2_btree_write_buffer_flush_sync(trans) ?:
448 -BCH_ERR_transaction_restart_write_buffer_flush;
456 bch2_trans_iter_exit(trans, &bp_iter);
460 prt_printf(&buf, "missing backpointer for btree=%s l=%u ",
461 bch2_btree_id_str(bp.btree_id), bp.level);
462 bch2_bkey_val_to_text(&buf, c, orig_k);
463 prt_printf(&buf, "\nbp pos ");
464 bch2_bpos_to_text(&buf, bp_iter.pos);
466 if (c->sb.version_upgrade_complete < bcachefs_metadata_version_backpointers ||
467 c->opts.reconstruct_alloc ||
468 fsck_err(c, ptr_to_missing_backpointer, "%s", buf.buf))
469 ret = bch2_bucket_backpointer_mod(trans, bucket, bp, orig_k, true);
474 static int check_extent_to_backpointers(struct btree_trans *trans,
475 enum btree_id btree, unsigned level,
476 struct bpos bucket_start,
477 struct bpos bucket_end,
478 struct bpos_level *last_flushed,
481 struct bch_fs *c = trans->c;
482 struct bkey_ptrs_c ptrs;
483 const union bch_extent_entry *entry;
484 struct extent_ptr_decoded p;
487 ptrs = bch2_bkey_ptrs_c(k);
488 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
489 struct bpos bucket_pos;
490 struct bch_backpointer bp;
495 bch2_extent_ptr_to_bp(c, btree, level,
496 k, p, &bucket_pos, &bp);
498 ret = check_bp_exists(trans, bucket_pos, bp, k,
499 bucket_start, bucket_end,
508 static int check_btree_root_to_backpointers(struct btree_trans *trans,
509 enum btree_id btree_id,
510 struct bpos bucket_start,
511 struct bpos bucket_end,
512 struct bpos_level *last_flushed,
515 struct bch_fs *c = trans->c;
516 struct btree_iter iter;
521 bch2_trans_node_iter_init(trans, &iter, btree_id, POS_MIN,
522 0, bch2_btree_id_root(c, btree_id)->b->c.level, 0);
523 b = bch2_btree_iter_peek_node(&iter);
524 ret = PTR_ERR_OR_ZERO(b);
528 if (b != btree_node_root(c, b)) {
529 bch2_trans_iter_exit(trans, &iter);
535 k = bkey_i_to_s_c(&b->key);
536 ret = check_extent_to_backpointers(trans, btree_id, b->c.level + 1,
537 bucket_start, bucket_end,
540 bch2_trans_iter_exit(trans, &iter);
544 static inline struct bbpos bp_to_bbpos(struct bch_backpointer bp)
546 return (struct bbpos) {
547 .btree = bp.btree_id,
552 static size_t btree_nodes_fit_in_ram(struct bch_fs *c)
558 mem_bytes = i.totalram * i.mem_unit;
559 return div_u64(mem_bytes >> 1, btree_bytes(c));
562 static int bch2_get_btree_in_memory_pos(struct btree_trans *trans,
563 unsigned btree_leaf_mask,
564 unsigned btree_interior_mask,
565 struct bbpos start, struct bbpos *end)
567 struct btree_iter iter;
569 size_t btree_nodes = btree_nodes_fit_in_ram(trans->c);
573 for (btree = start.btree; btree < BTREE_ID_NR && !ret; btree++) {
574 unsigned depth = ((1U << btree) & btree_leaf_mask) ? 1 : 2;
576 if (!((1U << btree) & btree_leaf_mask) &&
577 !((1U << btree) & btree_interior_mask))
580 bch2_trans_node_iter_init(trans, &iter, btree,
581 btree == start.btree ? start.pos : POS_MIN,
584 * for_each_btree_key_contineu() doesn't check the return value
585 * from bch2_btree_iter_advance(), which is needed when
586 * iterating over interior nodes where we'll see keys at
590 k = __bch2_btree_iter_peek_and_restart(trans, &iter, 0);
597 *end = BBPOS(btree, k.k->p);
598 bch2_trans_iter_exit(trans, &iter);
601 } while (bch2_btree_iter_advance(&iter));
602 bch2_trans_iter_exit(trans, &iter);
609 static int bch2_check_extents_to_backpointers_pass(struct btree_trans *trans,
610 struct bpos bucket_start,
611 struct bpos bucket_end)
613 struct bch_fs *c = trans->c;
614 struct btree_iter iter;
615 enum btree_id btree_id;
617 struct bpos_level last_flushed = { UINT_MAX, POS_MIN };
620 for (btree_id = 0; btree_id < btree_id_nr_alive(c); btree_id++) {
621 int level, depth = btree_type_has_ptrs(btree_id) ? 0 : 1;
623 ret = commit_do(trans, NULL, NULL,
624 BCH_TRANS_COMMIT_lazy_rw|
625 BCH_TRANS_COMMIT_no_enospc,
626 check_btree_root_to_backpointers(trans, btree_id,
627 bucket_start, bucket_end,
628 &last_flushed, &level));
632 while (level >= depth) {
633 bch2_trans_node_iter_init(trans, &iter, btree_id, POS_MIN, 0,
635 BTREE_ITER_PREFETCH);
636 for_each_btree_key_continue(trans, iter, BTREE_ITER_PREFETCH, k, ret) {
637 ret = commit_do(trans, NULL, NULL,
638 BCH_TRANS_COMMIT_lazy_rw|
639 BCH_TRANS_COMMIT_no_enospc,
640 check_extent_to_backpointers(trans, btree_id, level,
641 bucket_start, bucket_end,
646 if (bpos_eq(iter.pos, SPOS_MAX))
649 bch2_trans_iter_exit(trans, &iter);
661 static struct bpos bucket_pos_to_bp_safe(const struct bch_fs *c,
664 return bch2_dev_exists2(c, bucket.inode)
665 ? bucket_pos_to_bp(c, bucket, 0)
669 static int bch2_get_alloc_in_memory_pos(struct btree_trans *trans,
670 struct bpos start, struct bpos *end)
672 struct btree_iter alloc_iter;
673 struct btree_iter bp_iter;
674 struct bkey_s_c alloc_k, bp_k;
675 size_t btree_nodes = btree_nodes_fit_in_ram(trans->c);
676 bool alloc_end = false, bp_end = false;
679 bch2_trans_node_iter_init(trans, &alloc_iter, BTREE_ID_alloc,
681 bch2_trans_node_iter_init(trans, &bp_iter, BTREE_ID_backpointers,
682 bucket_pos_to_bp_safe(trans->c, start), 0, 1, 0);
685 ? __bch2_btree_iter_peek_and_restart(trans, &alloc_iter, 0)
688 ? __bch2_btree_iter_peek_and_restart(trans, &bp_iter, 0)
691 ret = bkey_err(alloc_k) ?: bkey_err(bp_k);
692 if ((!alloc_k.k && !bp_k.k) || ret) {
699 *end = alloc_k.k ? alloc_k.k->p : SPOS_MAX;
703 if (bpos_lt(alloc_iter.pos, SPOS_MAX) &&
704 bpos_lt(bucket_pos_to_bp_safe(trans->c, alloc_iter.pos), bp_iter.pos)) {
705 if (!bch2_btree_iter_advance(&alloc_iter))
708 if (!bch2_btree_iter_advance(&bp_iter))
712 bch2_trans_iter_exit(trans, &bp_iter);
713 bch2_trans_iter_exit(trans, &alloc_iter);
717 int bch2_check_extents_to_backpointers(struct bch_fs *c)
719 struct btree_trans *trans = bch2_trans_get(c);
720 struct bpos start = POS_MIN, end;
724 ret = bch2_get_alloc_in_memory_pos(trans, start, &end);
728 if (bpos_eq(start, POS_MIN) && !bpos_eq(end, SPOS_MAX))
729 bch_verbose(c, "%s(): alloc info does not fit in ram, running in multiple passes with %zu nodes per pass",
730 __func__, btree_nodes_fit_in_ram(c));
732 if (!bpos_eq(start, POS_MIN) || !bpos_eq(end, SPOS_MAX)) {
733 struct printbuf buf = PRINTBUF;
735 prt_str(&buf, "check_extents_to_backpointers(): ");
736 bch2_bpos_to_text(&buf, start);
738 bch2_bpos_to_text(&buf, end);
740 bch_verbose(c, "%s", buf.buf);
744 ret = bch2_check_extents_to_backpointers_pass(trans, start, end);
745 if (ret || bpos_eq(end, SPOS_MAX))
748 start = bpos_successor(end);
750 bch2_trans_put(trans);
757 static int check_one_backpointer(struct btree_trans *trans,
760 struct bkey_s_c_backpointer bp,
761 struct bpos *last_flushed_pos)
763 struct bch_fs *c = trans->c;
764 struct btree_iter iter;
765 struct bbpos pos = bp_to_bbpos(*bp.v);
767 struct printbuf buf = PRINTBUF;
770 if (bbpos_cmp(pos, start) < 0 ||
771 bbpos_cmp(pos, end) > 0)
774 k = bch2_backpointer_get_key(trans, &iter, bp.k->p, *bp.v, 0);
776 if (ret == -BCH_ERR_backpointer_to_overwritten_btree_node)
781 if (!k.k && !bpos_eq(*last_flushed_pos, bp.k->p)) {
782 *last_flushed_pos = bp.k->p;
783 ret = bch2_btree_write_buffer_flush_sync(trans) ?:
784 -BCH_ERR_transaction_restart_write_buffer_flush;
788 if (fsck_err_on(!k.k, c,
789 backpointer_to_missing_ptr,
790 "backpointer for missing %s\n %s",
791 bp.v->level ? "btree node" : "extent",
792 (bch2_bkey_val_to_text(&buf, c, bp.s_c), buf.buf))) {
793 ret = bch2_btree_delete_at_buffered(trans, BTREE_ID_backpointers, bp.k->p);
798 bch2_trans_iter_exit(trans, &iter);
803 static int bch2_check_backpointers_to_extents_pass(struct btree_trans *trans,
807 struct btree_iter iter;
809 struct bpos last_flushed_pos = SPOS_MAX;
811 return for_each_btree_key_commit(trans, iter, BTREE_ID_backpointers,
812 POS_MIN, BTREE_ITER_PREFETCH, k,
813 NULL, NULL, BCH_TRANS_COMMIT_lazy_rw|BCH_TRANS_COMMIT_no_enospc,
814 check_one_backpointer(trans, start, end,
815 bkey_s_c_to_backpointer(k),
819 int bch2_check_backpointers_to_extents(struct bch_fs *c)
821 struct btree_trans *trans = bch2_trans_get(c);
822 struct bbpos start = (struct bbpos) { .btree = 0, .pos = POS_MIN, }, end;
826 ret = bch2_get_btree_in_memory_pos(trans,
827 (1U << BTREE_ID_extents)|
828 (1U << BTREE_ID_reflink),
834 if (!bbpos_cmp(start, BBPOS_MIN) &&
835 bbpos_cmp(end, BBPOS_MAX))
836 bch_verbose(c, "%s(): extents do not fit in ram, running in multiple passes with %zu nodes per pass",
837 __func__, btree_nodes_fit_in_ram(c));
839 if (bbpos_cmp(start, BBPOS_MIN) ||
840 bbpos_cmp(end, BBPOS_MAX)) {
841 struct printbuf buf = PRINTBUF;
843 prt_str(&buf, "check_backpointers_to_extents(): ");
844 bch2_bbpos_to_text(&buf, start);
846 bch2_bbpos_to_text(&buf, end);
848 bch_verbose(c, "%s", buf.buf);
852 ret = bch2_check_backpointers_to_extents_pass(trans, start, end);
853 if (ret || !bbpos_cmp(end, BBPOS_MAX))
856 start = bbpos_successor(end);
858 bch2_trans_put(trans);