1 // SPDX-License-Identifier: GPL-2.0
4 #include "bkey_methods.h"
6 #include "btree_cache.h"
8 #include "btree_iter.h"
9 #include "btree_locking.h"
10 #include "btree_update.h"
11 #include "btree_update_interior.h"
18 #include "journal_reclaim.h"
19 #include "journal_seq_blacklist.h"
24 #include <linux/sched/mm.h>
26 void bch2_btree_node_io_unlock(struct btree *b)
28 EBUG_ON(!btree_node_write_in_flight(b));
30 clear_btree_node_write_in_flight_inner(b);
31 clear_btree_node_write_in_flight(b);
32 wake_up_bit(&b->flags, BTREE_NODE_write_in_flight);
35 void bch2_btree_node_io_lock(struct btree *b)
37 bch2_assert_btree_nodes_not_locked();
39 wait_on_bit_lock_io(&b->flags, BTREE_NODE_write_in_flight,
40 TASK_UNINTERRUPTIBLE);
43 void __bch2_btree_node_wait_on_read(struct btree *b)
45 wait_on_bit_io(&b->flags, BTREE_NODE_read_in_flight,
46 TASK_UNINTERRUPTIBLE);
49 void __bch2_btree_node_wait_on_write(struct btree *b)
51 wait_on_bit_io(&b->flags, BTREE_NODE_write_in_flight,
52 TASK_UNINTERRUPTIBLE);
55 void bch2_btree_node_wait_on_read(struct btree *b)
57 bch2_assert_btree_nodes_not_locked();
59 wait_on_bit_io(&b->flags, BTREE_NODE_read_in_flight,
60 TASK_UNINTERRUPTIBLE);
63 void bch2_btree_node_wait_on_write(struct btree *b)
65 bch2_assert_btree_nodes_not_locked();
67 wait_on_bit_io(&b->flags, BTREE_NODE_write_in_flight,
68 TASK_UNINTERRUPTIBLE);
71 static void verify_no_dups(struct btree *b,
72 struct bkey_packed *start,
73 struct bkey_packed *end)
75 #ifdef CONFIG_BCACHEFS_DEBUG
76 struct bkey_packed *k, *p;
81 for (p = start, k = bkey_p_next(start);
83 p = k, k = bkey_p_next(k)) {
84 struct bkey l = bkey_unpack_key(b, p);
85 struct bkey r = bkey_unpack_key(b, k);
87 BUG_ON(bpos_ge(l.p, bkey_start_pos(&r)));
92 static void set_needs_whiteout(struct bset *i, int v)
94 struct bkey_packed *k;
96 for (k = i->start; k != vstruct_last(i); k = bkey_p_next(k))
97 k->needs_whiteout = v;
100 static void btree_bounce_free(struct bch_fs *c, size_t size,
101 bool used_mempool, void *p)
104 mempool_free(p, &c->btree_bounce_pool);
109 static void *btree_bounce_alloc(struct bch_fs *c, size_t size,
112 unsigned flags = memalloc_nofs_save();
115 BUG_ON(size > btree_bytes(c));
117 *used_mempool = false;
118 p = vpmalloc(size, __GFP_NOWARN|GFP_NOWAIT);
120 *used_mempool = true;
121 p = mempool_alloc(&c->btree_bounce_pool, GFP_NOFS);
123 memalloc_nofs_restore(flags);
127 static void sort_bkey_ptrs(const struct btree *bt,
128 struct bkey_packed **ptrs, unsigned nr)
130 unsigned n = nr, a = nr / 2, b, c, d;
135 /* Heap sort: see lib/sort.c: */
140 swap(ptrs[0], ptrs[n]);
144 for (b = a; c = 2 * b + 1, (d = c + 1) < n;)
145 b = bch2_bkey_cmp_packed(bt,
147 ptrs[d]) >= 0 ? c : d;
152 bch2_bkey_cmp_packed(bt,
159 swap(ptrs[b], ptrs[c]);
164 static void bch2_sort_whiteouts(struct bch_fs *c, struct btree *b)
166 struct bkey_packed *new_whiteouts, **ptrs, **ptrs_end, *k;
167 bool used_mempool = false;
168 size_t bytes = b->whiteout_u64s * sizeof(u64);
170 if (!b->whiteout_u64s)
173 new_whiteouts = btree_bounce_alloc(c, bytes, &used_mempool);
175 ptrs = ptrs_end = ((void *) new_whiteouts + bytes);
177 for (k = unwritten_whiteouts_start(c, b);
178 k != unwritten_whiteouts_end(c, b);
182 sort_bkey_ptrs(b, ptrs, ptrs_end - ptrs);
186 while (ptrs != ptrs_end) {
187 bkey_p_copy(k, *ptrs);
192 verify_no_dups(b, new_whiteouts,
193 (void *) ((u64 *) new_whiteouts + b->whiteout_u64s));
195 memcpy_u64s(unwritten_whiteouts_start(c, b),
196 new_whiteouts, b->whiteout_u64s);
198 btree_bounce_free(c, bytes, used_mempool, new_whiteouts);
201 static bool should_compact_bset(struct btree *b, struct bset_tree *t,
202 bool compacting, enum compact_mode mode)
204 if (!bset_dead_u64s(b, t))
209 return should_compact_bset_lazy(b, t) ||
210 (compacting && !bset_written(b, bset(b, t)));
218 static bool bch2_drop_whiteouts(struct btree *b, enum compact_mode mode)
223 for_each_bset(b, t) {
224 struct bset *i = bset(b, t);
225 struct bkey_packed *k, *n, *out, *start, *end;
226 struct btree_node_entry *src = NULL, *dst = NULL;
228 if (t != b->set && !bset_written(b, i)) {
229 src = container_of(i, struct btree_node_entry, keys);
230 dst = max(write_block(b),
231 (void *) btree_bkey_last(b, t - 1));
237 if (!should_compact_bset(b, t, ret, mode)) {
239 memmove(dst, src, sizeof(*src) +
240 le16_to_cpu(src->keys.u64s) *
243 set_btree_bset(b, t, i);
248 start = btree_bkey_first(b, t);
249 end = btree_bkey_last(b, t);
252 memmove(dst, src, sizeof(*src));
254 set_btree_bset(b, t, i);
259 for (k = start; k != end; k = n) {
262 if (!bkey_deleted(k)) {
264 out = bkey_p_next(out);
266 BUG_ON(k->needs_whiteout);
270 i->u64s = cpu_to_le16((u64 *) out - i->_data);
271 set_btree_bset_end(b, t);
272 bch2_bset_set_no_aux_tree(b, t);
276 bch2_verify_btree_nr_keys(b);
278 bch2_btree_build_aux_trees(b);
283 bool bch2_compact_whiteouts(struct bch_fs *c, struct btree *b,
284 enum compact_mode mode)
286 return bch2_drop_whiteouts(b, mode);
289 static void btree_node_sort(struct bch_fs *c, struct btree *b,
292 bool filter_whiteouts)
294 struct btree_node *out;
295 struct sort_iter_stack sort_iter;
297 struct bset *start_bset = bset(b, &b->set[start_idx]);
298 bool used_mempool = false;
299 u64 start_time, seq = 0;
300 unsigned i, u64s = 0, bytes, shift = end_idx - start_idx - 1;
301 bool sorting_entire_node = start_idx == 0 &&
304 sort_iter_stack_init(&sort_iter, b);
306 for (t = b->set + start_idx;
307 t < b->set + end_idx;
309 u64s += le16_to_cpu(bset(b, t)->u64s);
310 sort_iter_add(&sort_iter.iter,
311 btree_bkey_first(b, t),
312 btree_bkey_last(b, t));
315 bytes = sorting_entire_node
317 : __vstruct_bytes(struct btree_node, u64s);
319 out = btree_bounce_alloc(c, bytes, &used_mempool);
321 start_time = local_clock();
323 u64s = bch2_sort_keys(out->keys.start, &sort_iter.iter, filter_whiteouts);
325 out->keys.u64s = cpu_to_le16(u64s);
327 BUG_ON(vstruct_end(&out->keys) > (void *) out + bytes);
329 if (sorting_entire_node)
330 bch2_time_stats_update(&c->times[BCH_TIME_btree_node_sort],
333 /* Make sure we preserve bset journal_seq: */
334 for (t = b->set + start_idx; t < b->set + end_idx; t++)
335 seq = max(seq, le64_to_cpu(bset(b, t)->journal_seq));
336 start_bset->journal_seq = cpu_to_le64(seq);
338 if (sorting_entire_node) {
339 u64s = le16_to_cpu(out->keys.u64s);
341 BUG_ON(bytes != btree_bytes(c));
344 * Our temporary buffer is the same size as the btree node's
345 * buffer, we can just swap buffers instead of doing a big
349 out->keys.u64s = cpu_to_le16(u64s);
351 set_btree_bset(b, b->set, &b->data->keys);
353 start_bset->u64s = out->keys.u64s;
354 memcpy_u64s(start_bset->start,
356 le16_to_cpu(out->keys.u64s));
359 for (i = start_idx + 1; i < end_idx; i++)
360 b->nr.bset_u64s[start_idx] +=
365 for (i = start_idx + 1; i < b->nsets; i++) {
366 b->nr.bset_u64s[i] = b->nr.bset_u64s[i + shift];
367 b->set[i] = b->set[i + shift];
370 for (i = b->nsets; i < MAX_BSETS; i++)
371 b->nr.bset_u64s[i] = 0;
373 set_btree_bset_end(b, &b->set[start_idx]);
374 bch2_bset_set_no_aux_tree(b, &b->set[start_idx]);
376 btree_bounce_free(c, bytes, used_mempool, out);
378 bch2_verify_btree_nr_keys(b);
381 void bch2_btree_sort_into(struct bch_fs *c,
385 struct btree_nr_keys nr;
386 struct btree_node_iter src_iter;
387 u64 start_time = local_clock();
389 BUG_ON(dst->nsets != 1);
391 bch2_bset_set_no_aux_tree(dst, dst->set);
393 bch2_btree_node_iter_init_from_start(&src_iter, src);
395 nr = bch2_sort_repack(btree_bset_first(dst),
400 bch2_time_stats_update(&c->times[BCH_TIME_btree_node_sort],
403 set_btree_bset_end(dst, dst->set);
405 dst->nr.live_u64s += nr.live_u64s;
406 dst->nr.bset_u64s[0] += nr.bset_u64s[0];
407 dst->nr.packed_keys += nr.packed_keys;
408 dst->nr.unpacked_keys += nr.unpacked_keys;
410 bch2_verify_btree_nr_keys(dst);
414 * We're about to add another bset to the btree node, so if there's currently
415 * too many bsets - sort some of them together:
417 static bool btree_node_compact(struct bch_fs *c, struct btree *b)
419 unsigned unwritten_idx;
422 for (unwritten_idx = 0;
423 unwritten_idx < b->nsets;
425 if (!bset_written(b, bset(b, &b->set[unwritten_idx])))
428 if (b->nsets - unwritten_idx > 1) {
429 btree_node_sort(c, b, unwritten_idx,
434 if (unwritten_idx > 1) {
435 btree_node_sort(c, b, 0, unwritten_idx, false);
442 void bch2_btree_build_aux_trees(struct btree *b)
447 bch2_bset_build_aux_tree(b, t,
448 !bset_written(b, bset(b, t)) &&
449 t == bset_tree_last(b));
453 * If we have MAX_BSETS (3) bsets, should we sort them all down to just one?
455 * The first bset is going to be of similar order to the size of the node, the
456 * last bset is bounded by btree_write_set_buffer(), which is set to keep the
457 * memmove on insert from being too expensive: the middle bset should, ideally,
458 * be the geometric mean of the first and the last.
460 * Returns true if the middle bset is greater than that geometric mean:
462 static inline bool should_compact_all(struct bch_fs *c, struct btree *b)
464 unsigned mid_u64s_bits =
465 (ilog2(btree_max_u64s(c)) + BTREE_WRITE_SET_U64s_BITS) / 2;
467 return bset_u64s(&b->set[1]) > 1U << mid_u64s_bits;
471 * @bch_btree_init_next - initialize a new (unwritten) bset that can then be
474 * Safe to call if there already is an unwritten bset - will only add a new bset
475 * if @b doesn't already have one.
477 * Returns true if we sorted (i.e. invalidated iterators
479 void bch2_btree_init_next(struct btree_trans *trans, struct btree *b)
481 struct bch_fs *c = trans->c;
482 struct btree_node_entry *bne;
483 bool reinit_iter = false;
485 EBUG_ON(!six_lock_counts(&b->c.lock).n[SIX_LOCK_write]);
486 BUG_ON(bset_written(b, bset(b, &b->set[1])));
487 BUG_ON(btree_node_just_written(b));
489 if (b->nsets == MAX_BSETS &&
490 !btree_node_write_in_flight(b) &&
491 should_compact_all(c, b)) {
492 bch2_btree_node_write(c, b, SIX_LOCK_write,
493 BTREE_WRITE_init_next_bset);
497 if (b->nsets == MAX_BSETS &&
498 btree_node_compact(c, b))
501 BUG_ON(b->nsets >= MAX_BSETS);
503 bne = want_new_bset(c, b);
505 bch2_bset_init_next(c, b, bne);
507 bch2_btree_build_aux_trees(b);
510 bch2_trans_node_reinit_iter(trans, b);
513 static void btree_err_msg(struct printbuf *out, struct bch_fs *c,
515 struct btree *b, struct bset *i,
516 unsigned offset, int write)
518 prt_printf(out, bch2_log_msg(c, "%s"),
520 ? "error validating btree node "
521 : "corrupt btree node before write ");
523 prt_printf(out, "on %s ", ca->name);
524 prt_printf(out, "at btree ");
525 bch2_btree_pos_to_text(out, c, b);
527 prt_printf(out, "\n node offset %u", b->written);
529 prt_printf(out, " bset u64s %u", le16_to_cpu(i->u64s));
534 static int __btree_err(int ret,
541 enum bch_sb_error_id err_type,
542 const char *fmt, ...)
544 struct printbuf out = PRINTBUF;
547 btree_err_msg(&out, c, ca, b, i, b->written, write);
550 prt_vprintf(&out, fmt, args);
553 if (write == WRITE) {
554 bch2_print_string_as_lines(KERN_ERR, out.buf);
555 ret = c->opts.errors == BCH_ON_ERROR_continue
557 : -BCH_ERR_fsck_errors_not_fixed;
561 if (!have_retry && ret == -BCH_ERR_btree_node_read_err_want_retry)
562 ret = -BCH_ERR_btree_node_read_err_fixable;
563 if (!have_retry && ret == -BCH_ERR_btree_node_read_err_must_retry)
564 ret = -BCH_ERR_btree_node_read_err_bad_node;
566 if (ret != -BCH_ERR_btree_node_read_err_fixable)
567 bch2_sb_error_count(c, err_type);
570 case -BCH_ERR_btree_node_read_err_fixable:
571 ret = bch2_fsck_err(c, FSCK_CAN_FIX, err_type, "%s", out.buf);
572 if (ret != -BCH_ERR_fsck_fix &&
573 ret != -BCH_ERR_fsck_ignore)
575 ret = -BCH_ERR_fsck_fix;
577 case -BCH_ERR_btree_node_read_err_want_retry:
578 case -BCH_ERR_btree_node_read_err_must_retry:
579 bch2_print_string_as_lines(KERN_ERR, out.buf);
581 case -BCH_ERR_btree_node_read_err_bad_node:
582 bch2_print_string_as_lines(KERN_ERR, out.buf);
583 bch2_topology_error(c);
584 ret = bch2_run_explicit_recovery_pass(c, BCH_RECOVERY_PASS_check_topology) ?: -EIO;
586 case -BCH_ERR_btree_node_read_err_incompatible:
587 bch2_print_string_as_lines(KERN_ERR, out.buf);
588 ret = -BCH_ERR_fsck_errors_not_fixed;
599 #define btree_err(type, c, ca, b, i, _err_type, msg, ...) \
601 int _ret = __btree_err(type, c, ca, b, i, write, have_retry, \
602 BCH_FSCK_ERR_##_err_type, \
603 msg, ##__VA_ARGS__); \
605 if (_ret != -BCH_ERR_fsck_fix) { \
613 #define btree_err_on(cond, ...) ((cond) ? btree_err(__VA_ARGS__) : false)
616 * When btree topology repair changes the start or end of a node, that might
617 * mean we have to drop keys that are no longer inside the node:
620 void bch2_btree_node_drop_keys_outside_node(struct btree *b)
624 for_each_bset(b, t) {
625 struct bset *i = bset(b, t);
626 struct bkey_packed *k;
628 for (k = i->start; k != vstruct_last(i); k = bkey_p_next(k))
629 if (bkey_cmp_left_packed(b, k, &b->data->min_key) >= 0)
633 unsigned shift = (u64 *) k - (u64 *) i->start;
635 memmove_u64s_down(i->start, k,
636 (u64 *) vstruct_end(i) - (u64 *) k);
637 i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - shift);
638 set_btree_bset_end(b, t);
641 for (k = i->start; k != vstruct_last(i); k = bkey_p_next(k))
642 if (bkey_cmp_left_packed(b, k, &b->data->max_key) > 0)
645 if (k != vstruct_last(i)) {
646 i->u64s = cpu_to_le16((u64 *) k - (u64 *) i->start);
647 set_btree_bset_end(b, t);
652 * Always rebuild search trees: eytzinger search tree nodes directly
653 * depend on the values of min/max key:
655 bch2_bset_set_no_aux_tree(b, b->set);
656 bch2_btree_build_aux_trees(b);
659 struct bkey unpacked;
660 struct btree_node_iter iter;
661 for_each_btree_node_key_unpack(b, k, &iter, &unpacked) {
662 BUG_ON(bpos_lt(k.k->p, b->data->min_key));
663 BUG_ON(bpos_gt(k.k->p, b->data->max_key));
667 static int validate_bset(struct bch_fs *c, struct bch_dev *ca,
668 struct btree *b, struct bset *i,
669 unsigned offset, unsigned sectors,
670 int write, bool have_retry, bool *saw_error)
672 unsigned version = le16_to_cpu(i->version);
673 struct printbuf buf1 = PRINTBUF;
674 struct printbuf buf2 = PRINTBUF;
677 btree_err_on(!bch2_version_compatible(version),
678 -BCH_ERR_btree_node_read_err_incompatible,
680 btree_node_unsupported_version,
681 "unsupported bset version %u.%u",
682 BCH_VERSION_MAJOR(version),
683 BCH_VERSION_MINOR(version));
685 if (btree_err_on(version < c->sb.version_min,
686 -BCH_ERR_btree_node_read_err_fixable,
688 btree_node_bset_older_than_sb_min,
689 "bset version %u older than superblock version_min %u",
690 version, c->sb.version_min)) {
691 mutex_lock(&c->sb_lock);
692 c->disk_sb.sb->version_min = cpu_to_le16(version);
694 mutex_unlock(&c->sb_lock);
697 if (btree_err_on(BCH_VERSION_MAJOR(version) >
698 BCH_VERSION_MAJOR(c->sb.version),
699 -BCH_ERR_btree_node_read_err_fixable,
701 btree_node_bset_newer_than_sb,
702 "bset version %u newer than superblock version %u",
703 version, c->sb.version)) {
704 mutex_lock(&c->sb_lock);
705 c->disk_sb.sb->version = cpu_to_le16(version);
707 mutex_unlock(&c->sb_lock);
710 btree_err_on(BSET_SEPARATE_WHITEOUTS(i),
711 -BCH_ERR_btree_node_read_err_incompatible,
713 btree_node_unsupported_version,
714 "BSET_SEPARATE_WHITEOUTS no longer supported");
716 if (btree_err_on(offset + sectors > btree_sectors(c),
717 -BCH_ERR_btree_node_read_err_fixable,
719 bset_past_end_of_btree_node,
720 "bset past end of btree node")) {
726 btree_err_on(offset && !i->u64s,
727 -BCH_ERR_btree_node_read_err_fixable,
732 btree_err_on(BSET_OFFSET(i) && BSET_OFFSET(i) != offset,
733 -BCH_ERR_btree_node_read_err_want_retry,
735 bset_wrong_sector_offset,
736 "bset at wrong sector offset");
739 struct btree_node *bn =
740 container_of(i, struct btree_node, keys);
741 /* These indicate that we read the wrong btree node: */
743 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
744 struct bch_btree_ptr_v2 *bp =
745 &bkey_i_to_btree_ptr_v2(&b->key)->v;
748 btree_err_on(bp->seq != bn->keys.seq,
749 -BCH_ERR_btree_node_read_err_must_retry,
752 "incorrect sequence number (wrong btree node)");
755 btree_err_on(BTREE_NODE_ID(bn) != b->c.btree_id,
756 -BCH_ERR_btree_node_read_err_must_retry,
758 btree_node_bad_btree,
759 "incorrect btree id");
761 btree_err_on(BTREE_NODE_LEVEL(bn) != b->c.level,
762 -BCH_ERR_btree_node_read_err_must_retry,
764 btree_node_bad_level,
768 compat_btree_node(b->c.level, b->c.btree_id, version,
769 BSET_BIG_ENDIAN(i), write, bn);
771 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
772 struct bch_btree_ptr_v2 *bp =
773 &bkey_i_to_btree_ptr_v2(&b->key)->v;
775 if (BTREE_PTR_RANGE_UPDATED(bp)) {
776 b->data->min_key = bp->min_key;
777 b->data->max_key = b->key.k.p;
780 btree_err_on(!bpos_eq(b->data->min_key, bp->min_key),
781 -BCH_ERR_btree_node_read_err_must_retry,
783 btree_node_bad_min_key,
784 "incorrect min_key: got %s should be %s",
785 (printbuf_reset(&buf1),
786 bch2_bpos_to_text(&buf1, bn->min_key), buf1.buf),
787 (printbuf_reset(&buf2),
788 bch2_bpos_to_text(&buf2, bp->min_key), buf2.buf));
791 btree_err_on(!bpos_eq(bn->max_key, b->key.k.p),
792 -BCH_ERR_btree_node_read_err_must_retry,
794 btree_node_bad_max_key,
795 "incorrect max key %s",
796 (printbuf_reset(&buf1),
797 bch2_bpos_to_text(&buf1, bn->max_key), buf1.buf));
800 compat_btree_node(b->c.level, b->c.btree_id, version,
801 BSET_BIG_ENDIAN(i), write, bn);
803 btree_err_on(bch2_bkey_format_invalid(c, &bn->format, write, &buf1),
804 -BCH_ERR_btree_node_read_err_bad_node,
806 btree_node_bad_format,
807 "invalid bkey format: %s\n %s", buf1.buf,
808 (printbuf_reset(&buf2),
809 bch2_bkey_format_to_text(&buf2, &bn->format), buf2.buf));
810 printbuf_reset(&buf1);
812 compat_bformat(b->c.level, b->c.btree_id, version,
813 BSET_BIG_ENDIAN(i), write,
818 printbuf_exit(&buf2);
819 printbuf_exit(&buf1);
823 static int bset_key_invalid(struct bch_fs *c, struct btree *b,
825 bool updated_range, int rw,
826 struct printbuf *err)
828 return __bch2_bkey_invalid(c, k, btree_node_type(b), READ, err) ?:
829 (!updated_range ? bch2_bkey_in_btree_node(c, b, k, err) : 0) ?:
830 (rw == WRITE ? bch2_bkey_val_invalid(c, k, READ, err) : 0);
833 static int validate_bset_keys(struct bch_fs *c, struct btree *b,
834 struct bset *i, int write,
835 bool have_retry, bool *saw_error)
837 unsigned version = le16_to_cpu(i->version);
838 struct bkey_packed *k, *prev = NULL;
839 struct printbuf buf = PRINTBUF;
840 bool updated_range = b->key.k.type == KEY_TYPE_btree_ptr_v2 &&
841 BTREE_PTR_RANGE_UPDATED(&bkey_i_to_btree_ptr_v2(&b->key)->v);
845 k != vstruct_last(i);) {
849 if (btree_err_on(bkey_p_next(k) > vstruct_last(i),
850 -BCH_ERR_btree_node_read_err_fixable,
852 btree_node_bkey_past_bset_end,
853 "key extends past end of bset")) {
854 i->u64s = cpu_to_le16((u64 *) k - i->_data);
858 if (btree_err_on(k->format > KEY_FORMAT_CURRENT,
859 -BCH_ERR_btree_node_read_err_fixable,
861 btree_node_bkey_bad_format,
862 "invalid bkey format %u", k->format)) {
863 i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
864 memmove_u64s_down(k, bkey_p_next(k),
865 (u64 *) vstruct_end(i) - (u64 *) k);
869 /* XXX: validate k->u64s */
871 bch2_bkey_compat(b->c.level, b->c.btree_id, version,
872 BSET_BIG_ENDIAN(i), write,
875 u = __bkey_disassemble(b, k, &tmp);
877 printbuf_reset(&buf);
878 if (bset_key_invalid(c, b, u.s_c, updated_range, write, &buf)) {
879 printbuf_reset(&buf);
880 bset_key_invalid(c, b, u.s_c, updated_range, write, &buf);
881 prt_printf(&buf, "\n ");
882 bch2_bkey_val_to_text(&buf, c, u.s_c);
884 btree_err(-BCH_ERR_btree_node_read_err_fixable,
887 "invalid bkey: %s", buf.buf);
889 i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
890 memmove_u64s_down(k, bkey_p_next(k),
891 (u64 *) vstruct_end(i) - (u64 *) k);
896 bch2_bkey_compat(b->c.level, b->c.btree_id, version,
897 BSET_BIG_ENDIAN(i), write,
900 if (prev && bkey_iter_cmp(b, prev, k) > 0) {
901 struct bkey up = bkey_unpack_key(b, prev);
903 printbuf_reset(&buf);
904 prt_printf(&buf, "keys out of order: ");
905 bch2_bkey_to_text(&buf, &up);
906 prt_printf(&buf, " > ");
907 bch2_bkey_to_text(&buf, u.k);
909 bch2_dump_bset(c, b, i, 0);
911 if (btree_err(-BCH_ERR_btree_node_read_err_fixable,
913 btree_node_bkey_out_of_order,
915 i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
916 memmove_u64s_down(k, bkey_p_next(k),
917 (u64 *) vstruct_end(i) - (u64 *) k);
930 int bch2_btree_node_read_done(struct bch_fs *c, struct bch_dev *ca,
931 struct btree *b, bool have_retry, bool *saw_error)
933 struct btree_node_entry *bne;
934 struct sort_iter *iter;
935 struct btree_node *sorted;
936 struct bkey_packed *k;
938 bool used_mempool, blacklisted;
939 bool updated_range = b->key.k.type == KEY_TYPE_btree_ptr_v2 &&
940 BTREE_PTR_RANGE_UPDATED(&bkey_i_to_btree_ptr_v2(&b->key)->v);
942 unsigned ptr_written = btree_ptr_sectors_written(&b->key);
943 struct printbuf buf = PRINTBUF;
944 int ret = 0, retry_read = 0, write = READ;
945 u64 start_time = local_clock();
947 b->version_ondisk = U16_MAX;
948 /* We might get called multiple times on read retry: */
951 iter = mempool_alloc(&c->fill_iter, GFP_NOFS);
952 sort_iter_init(iter, b, (btree_blocks(c) + 1) * 2);
954 if (bch2_meta_read_fault("btree"))
955 btree_err(-BCH_ERR_btree_node_read_err_must_retry,
957 btree_node_fault_injected,
960 btree_err_on(le64_to_cpu(b->data->magic) != bset_magic(c),
961 -BCH_ERR_btree_node_read_err_must_retry,
963 btree_node_bad_magic,
964 "bad magic: want %llx, got %llx",
965 bset_magic(c), le64_to_cpu(b->data->magic));
967 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
968 struct bch_btree_ptr_v2 *bp =
969 &bkey_i_to_btree_ptr_v2(&b->key)->v;
971 bch2_bpos_to_text(&buf, b->data->min_key);
973 bch2_bpos_to_text(&buf, b->data->max_key);
975 btree_err_on(b->data->keys.seq != bp->seq,
976 -BCH_ERR_btree_node_read_err_must_retry,
979 "got wrong btree node (want %llx got %llx)\n"
980 "got btree %s level %llu pos %s",
981 bp->seq, b->data->keys.seq,
982 bch2_btree_id_str(BTREE_NODE_ID(b->data)),
983 BTREE_NODE_LEVEL(b->data),
986 btree_err_on(!b->data->keys.seq,
987 -BCH_ERR_btree_node_read_err_must_retry,
990 "bad btree header: seq 0");
993 while (b->written < (ptr_written ?: btree_sectors(c))) {
996 bool first = !b->written;
1002 btree_err_on(!bch2_checksum_type_valid(c, BSET_CSUM_TYPE(i)),
1003 -BCH_ERR_btree_node_read_err_want_retry,
1006 "unknown checksum type %llu", BSET_CSUM_TYPE(i));
1008 nonce = btree_nonce(i, b->written << 9);
1010 csum_bad = bch2_crc_cmp(b->data->csum,
1011 csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, b->data));
1013 bch2_io_error(ca, BCH_MEMBER_ERROR_checksum);
1015 btree_err_on(csum_bad,
1016 -BCH_ERR_btree_node_read_err_want_retry,
1019 "invalid checksum");
1021 ret = bset_encrypt(c, i, b->written << 9);
1022 if (bch2_fs_fatal_err_on(ret, c,
1023 "error decrypting btree node: %i", ret))
1026 btree_err_on(btree_node_type_is_extents(btree_node_type(b)) &&
1027 !BTREE_NODE_NEW_EXTENT_OVERWRITE(b->data),
1028 -BCH_ERR_btree_node_read_err_incompatible,
1030 btree_node_unsupported_version,
1031 "btree node does not have NEW_EXTENT_OVERWRITE set");
1033 sectors = vstruct_sectors(b->data, c->block_bits);
1035 bne = write_block(b);
1038 if (i->seq != b->data->keys.seq)
1041 btree_err_on(!bch2_checksum_type_valid(c, BSET_CSUM_TYPE(i)),
1042 -BCH_ERR_btree_node_read_err_want_retry,
1045 "unknown checksum type %llu", BSET_CSUM_TYPE(i));
1047 nonce = btree_nonce(i, b->written << 9);
1048 csum_bad = bch2_crc_cmp(bne->csum,
1049 csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bne));
1051 bch2_io_error(ca, BCH_MEMBER_ERROR_checksum);
1053 btree_err_on(csum_bad,
1054 -BCH_ERR_btree_node_read_err_want_retry,
1057 "invalid checksum");
1059 ret = bset_encrypt(c, i, b->written << 9);
1060 if (bch2_fs_fatal_err_on(ret, c,
1061 "error decrypting btree node: %i\n", ret))
1064 sectors = vstruct_sectors(bne, c->block_bits);
1067 b->version_ondisk = min(b->version_ondisk,
1068 le16_to_cpu(i->version));
1070 ret = validate_bset(c, ca, b, i, b->written, sectors,
1071 READ, have_retry, saw_error);
1076 btree_node_set_format(b, b->data->format);
1078 ret = validate_bset_keys(c, b, i, READ, have_retry, saw_error);
1082 SET_BSET_BIG_ENDIAN(i, CPU_BIG_ENDIAN);
1084 blacklisted = bch2_journal_seq_is_blacklisted(c,
1085 le64_to_cpu(i->journal_seq),
1088 btree_err_on(blacklisted && first,
1089 -BCH_ERR_btree_node_read_err_fixable,
1091 bset_blacklisted_journal_seq,
1092 "first btree node bset has blacklisted journal seq (%llu)",
1093 le64_to_cpu(i->journal_seq));
1095 btree_err_on(blacklisted && ptr_written,
1096 -BCH_ERR_btree_node_read_err_fixable,
1098 first_bset_blacklisted_journal_seq,
1099 "found blacklisted bset (journal seq %llu) in btree node at offset %u-%u/%u",
1100 le64_to_cpu(i->journal_seq),
1101 b->written, b->written + sectors, ptr_written);
1103 b->written += sectors;
1105 if (blacklisted && !first)
1114 btree_err_on(b->written < ptr_written,
1115 -BCH_ERR_btree_node_read_err_want_retry,
1117 btree_node_data_missing,
1118 "btree node data missing: expected %u sectors, found %u",
1119 ptr_written, b->written);
1121 for (bne = write_block(b);
1122 bset_byte_offset(b, bne) < btree_bytes(c);
1123 bne = (void *) bne + block_bytes(c))
1124 btree_err_on(bne->keys.seq == b->data->keys.seq &&
1125 !bch2_journal_seq_is_blacklisted(c,
1126 le64_to_cpu(bne->keys.journal_seq),
1128 -BCH_ERR_btree_node_read_err_want_retry,
1130 btree_node_bset_after_end,
1131 "found bset signature after last bset");
1134 sorted = btree_bounce_alloc(c, btree_bytes(c), &used_mempool);
1135 sorted->keys.u64s = 0;
1137 set_btree_bset(b, b->set, &b->data->keys);
1139 b->nr = bch2_key_sort_fix_overlapping(c, &sorted->keys, iter);
1141 u64s = le16_to_cpu(sorted->keys.u64s);
1143 sorted->keys.u64s = cpu_to_le16(u64s);
1144 swap(sorted, b->data);
1145 set_btree_bset(b, b->set, &b->data->keys);
1148 BUG_ON(b->nr.live_u64s != u64s);
1150 btree_bounce_free(c, btree_bytes(c), used_mempool, sorted);
1153 bch2_btree_node_drop_keys_outside_node(b);
1156 for (k = i->start; k != vstruct_last(i);) {
1158 struct bkey_s u = __bkey_disassemble(b, k, &tmp);
1160 printbuf_reset(&buf);
1162 if (bch2_bkey_val_invalid(c, u.s_c, READ, &buf) ||
1163 (bch2_inject_invalid_keys &&
1164 !bversion_cmp(u.k->version, MAX_VERSION))) {
1165 printbuf_reset(&buf);
1167 prt_printf(&buf, "invalid bkey: ");
1168 bch2_bkey_val_invalid(c, u.s_c, READ, &buf);
1169 prt_printf(&buf, "\n ");
1170 bch2_bkey_val_to_text(&buf, c, u.s_c);
1172 btree_err(-BCH_ERR_btree_node_read_err_fixable,
1174 btree_node_bad_bkey,
1177 btree_keys_account_key_drop(&b->nr, 0, k);
1179 i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
1180 memmove_u64s_down(k, bkey_p_next(k),
1181 (u64 *) vstruct_end(i) - (u64 *) k);
1182 set_btree_bset_end(b, b->set);
1186 if (u.k->type == KEY_TYPE_btree_ptr_v2) {
1187 struct bkey_s_btree_ptr_v2 bp = bkey_s_to_btree_ptr_v2(u);
1195 bch2_bset_build_aux_tree(b, b->set, false);
1197 set_needs_whiteout(btree_bset_first(b), true);
1199 btree_node_reset_sib_u64s(b);
1201 bkey_for_each_ptr(bch2_bkey_ptrs(bkey_i_to_s(&b->key)), ptr) {
1202 struct bch_dev *ca2 = bch_dev_bkey_exists(c, ptr->dev);
1204 if (ca2->mi.state != BCH_MEMBER_STATE_rw)
1205 set_btree_node_need_rewrite(b);
1209 set_btree_node_need_rewrite(b);
1211 mempool_free(iter, &c->fill_iter);
1212 printbuf_exit(&buf);
1213 bch2_time_stats_update(&c->times[BCH_TIME_btree_node_read_done], start_time);
1216 if (ret == -BCH_ERR_btree_node_read_err_want_retry ||
1217 ret == -BCH_ERR_btree_node_read_err_must_retry)
1220 set_btree_node_read_error(b);
1224 static void btree_node_read_work(struct work_struct *work)
1226 struct btree_read_bio *rb =
1227 container_of(work, struct btree_read_bio, work);
1228 struct bch_fs *c = rb->c;
1229 struct btree *b = rb->b;
1230 struct bch_dev *ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1231 struct bio *bio = &rb->bio;
1232 struct bch_io_failures failed = { .nr = 0 };
1233 struct printbuf buf = PRINTBUF;
1234 bool saw_error = false;
1241 bch_info(c, "retrying read");
1242 ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1243 rb->have_ioref = bch2_dev_get_ioref(ca, READ);
1244 bio_reset(bio, NULL, REQ_OP_READ|REQ_SYNC|REQ_META);
1245 bio->bi_iter.bi_sector = rb->pick.ptr.offset;
1246 bio->bi_iter.bi_size = btree_bytes(c);
1248 if (rb->have_ioref) {
1249 bio_set_dev(bio, ca->disk_sb.bdev);
1250 submit_bio_wait(bio);
1252 bio->bi_status = BLK_STS_REMOVED;
1255 printbuf_reset(&buf);
1256 bch2_btree_pos_to_text(&buf, c, b);
1257 bch2_dev_io_err_on(bio->bi_status, ca, BCH_MEMBER_ERROR_read,
1258 "btree read error %s for %s",
1259 bch2_blk_status_to_str(bio->bi_status), buf.buf);
1261 percpu_ref_put(&ca->io_ref);
1262 rb->have_ioref = false;
1264 bch2_mark_io_failure(&failed, &rb->pick);
1266 can_retry = bch2_bkey_pick_read_device(c,
1267 bkey_i_to_s_c(&b->key),
1268 &failed, &rb->pick) > 0;
1270 if (!bio->bi_status &&
1271 !bch2_btree_node_read_done(c, ca, b, can_retry, &saw_error)) {
1273 bch_info(c, "retry success");
1280 set_btree_node_read_error(b);
1285 bch2_time_stats_update(&c->times[BCH_TIME_btree_node_read],
1289 if (saw_error && !btree_node_read_error(b)) {
1290 printbuf_reset(&buf);
1291 bch2_bpos_to_text(&buf, b->key.k.p);
1292 bch_info(c, "%s: rewriting btree node at btree=%s level=%u %s due to error",
1293 __func__, bch2_btree_id_str(b->c.btree_id), b->c.level, buf.buf);
1295 bch2_btree_node_rewrite_async(c, b);
1298 printbuf_exit(&buf);
1299 clear_btree_node_read_in_flight(b);
1300 wake_up_bit(&b->flags, BTREE_NODE_read_in_flight);
1303 static void btree_node_read_endio(struct bio *bio)
1305 struct btree_read_bio *rb =
1306 container_of(bio, struct btree_read_bio, bio);
1307 struct bch_fs *c = rb->c;
1309 if (rb->have_ioref) {
1310 struct bch_dev *ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1312 bch2_latency_acct(ca, rb->start_time, READ);
1315 queue_work(c->io_complete_wq, &rb->work);
1318 struct btree_node_read_all {
1323 void *buf[BCH_REPLICAS_MAX];
1324 struct bio *bio[BCH_REPLICAS_MAX];
1325 blk_status_t err[BCH_REPLICAS_MAX];
1328 static unsigned btree_node_sectors_written(struct bch_fs *c, void *data)
1330 struct btree_node *bn = data;
1331 struct btree_node_entry *bne;
1332 unsigned offset = 0;
1334 if (le64_to_cpu(bn->magic) != bset_magic(c))
1337 while (offset < btree_sectors(c)) {
1339 offset += vstruct_sectors(bn, c->block_bits);
1341 bne = data + (offset << 9);
1342 if (bne->keys.seq != bn->keys.seq)
1344 offset += vstruct_sectors(bne, c->block_bits);
1351 static bool btree_node_has_extra_bsets(struct bch_fs *c, unsigned offset, void *data)
1353 struct btree_node *bn = data;
1354 struct btree_node_entry *bne;
1359 while (offset < btree_sectors(c)) {
1360 bne = data + (offset << 9);
1361 if (bne->keys.seq == bn->keys.seq)
1370 static CLOSURE_CALLBACK(btree_node_read_all_replicas_done)
1372 closure_type(ra, struct btree_node_read_all, cl);
1373 struct bch_fs *c = ra->c;
1374 struct btree *b = ra->b;
1375 struct printbuf buf = PRINTBUF;
1376 bool dump_bset_maps = false;
1377 bool have_retry = false;
1378 int ret = 0, best = -1, write = READ;
1379 unsigned i, written = 0, written2 = 0;
1380 __le64 seq = b->key.k.type == KEY_TYPE_btree_ptr_v2
1381 ? bkey_i_to_btree_ptr_v2(&b->key)->v.seq : 0;
1382 bool _saw_error = false, *saw_error = &_saw_error;
1384 for (i = 0; i < ra->nr; i++) {
1385 struct btree_node *bn = ra->buf[i];
1390 if (le64_to_cpu(bn->magic) != bset_magic(c) ||
1391 (seq && seq != bn->keys.seq))
1396 written = btree_node_sectors_written(c, bn);
1400 written2 = btree_node_sectors_written(c, ra->buf[i]);
1401 if (btree_err_on(written2 != written, -BCH_ERR_btree_node_read_err_fixable,
1403 btree_node_replicas_sectors_written_mismatch,
1404 "btree node sectors written mismatch: %u != %u",
1405 written, written2) ||
1406 btree_err_on(btree_node_has_extra_bsets(c, written2, ra->buf[i]),
1407 -BCH_ERR_btree_node_read_err_fixable,
1409 btree_node_bset_after_end,
1410 "found bset signature after last bset") ||
1411 btree_err_on(memcmp(ra->buf[best], ra->buf[i], written << 9),
1412 -BCH_ERR_btree_node_read_err_fixable,
1414 btree_node_replicas_data_mismatch,
1415 "btree node replicas content mismatch"))
1416 dump_bset_maps = true;
1418 if (written2 > written) {
1424 if (dump_bset_maps) {
1425 for (i = 0; i < ra->nr; i++) {
1426 struct btree_node *bn = ra->buf[i];
1427 struct btree_node_entry *bne = NULL;
1428 unsigned offset = 0, sectors;
1434 printbuf_reset(&buf);
1436 while (offset < btree_sectors(c)) {
1438 sectors = vstruct_sectors(bn, c->block_bits);
1440 bne = ra->buf[i] + (offset << 9);
1441 if (bne->keys.seq != bn->keys.seq)
1443 sectors = vstruct_sectors(bne, c->block_bits);
1446 prt_printf(&buf, " %u-%u", offset, offset + sectors);
1447 if (bne && bch2_journal_seq_is_blacklisted(c,
1448 le64_to_cpu(bne->keys.journal_seq), false))
1449 prt_printf(&buf, "*");
1453 while (offset < btree_sectors(c)) {
1454 bne = ra->buf[i] + (offset << 9);
1455 if (bne->keys.seq == bn->keys.seq) {
1457 prt_printf(&buf, " GAP");
1460 sectors = vstruct_sectors(bne, c->block_bits);
1461 prt_printf(&buf, " %u-%u", offset, offset + sectors);
1462 if (bch2_journal_seq_is_blacklisted(c,
1463 le64_to_cpu(bne->keys.journal_seq), false))
1464 prt_printf(&buf, "*");
1469 bch_err(c, "replica %u:%s", i, buf.buf);
1474 memcpy(b->data, ra->buf[best], btree_bytes(c));
1475 ret = bch2_btree_node_read_done(c, NULL, b, false, saw_error);
1481 set_btree_node_read_error(b);
1482 else if (*saw_error)
1483 bch2_btree_node_rewrite_async(c, b);
1485 for (i = 0; i < ra->nr; i++) {
1486 mempool_free(ra->buf[i], &c->btree_bounce_pool);
1487 bio_put(ra->bio[i]);
1490 closure_debug_destroy(&ra->cl);
1492 printbuf_exit(&buf);
1494 clear_btree_node_read_in_flight(b);
1495 wake_up_bit(&b->flags, BTREE_NODE_read_in_flight);
1498 static void btree_node_read_all_replicas_endio(struct bio *bio)
1500 struct btree_read_bio *rb =
1501 container_of(bio, struct btree_read_bio, bio);
1502 struct bch_fs *c = rb->c;
1503 struct btree_node_read_all *ra = rb->ra;
1505 if (rb->have_ioref) {
1506 struct bch_dev *ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1508 bch2_latency_acct(ca, rb->start_time, READ);
1511 ra->err[rb->idx] = bio->bi_status;
1512 closure_put(&ra->cl);
1516 * XXX This allocates multiple times from the same mempools, and can deadlock
1517 * under sufficient memory pressure (but is only a debug path)
1519 static int btree_node_read_all_replicas(struct bch_fs *c, struct btree *b, bool sync)
1521 struct bkey_s_c k = bkey_i_to_s_c(&b->key);
1522 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
1523 const union bch_extent_entry *entry;
1524 struct extent_ptr_decoded pick;
1525 struct btree_node_read_all *ra;
1528 ra = kzalloc(sizeof(*ra), GFP_NOFS);
1530 return -BCH_ERR_ENOMEM_btree_node_read_all_replicas;
1532 closure_init(&ra->cl, NULL);
1535 ra->nr = bch2_bkey_nr_ptrs(k);
1537 for (i = 0; i < ra->nr; i++) {
1538 ra->buf[i] = mempool_alloc(&c->btree_bounce_pool, GFP_NOFS);
1539 ra->bio[i] = bio_alloc_bioset(NULL,
1540 buf_pages(ra->buf[i], btree_bytes(c)),
1541 REQ_OP_READ|REQ_SYNC|REQ_META,
1547 bkey_for_each_ptr_decode(k.k, ptrs, pick, entry) {
1548 struct bch_dev *ca = bch_dev_bkey_exists(c, pick.ptr.dev);
1549 struct btree_read_bio *rb =
1550 container_of(ra->bio[i], struct btree_read_bio, bio);
1554 rb->start_time = local_clock();
1555 rb->have_ioref = bch2_dev_get_ioref(ca, READ);
1558 rb->bio.bi_iter.bi_sector = pick.ptr.offset;
1559 rb->bio.bi_end_io = btree_node_read_all_replicas_endio;
1560 bch2_bio_map(&rb->bio, ra->buf[i], btree_bytes(c));
1562 if (rb->have_ioref) {
1563 this_cpu_add(ca->io_done->sectors[READ][BCH_DATA_btree],
1564 bio_sectors(&rb->bio));
1565 bio_set_dev(&rb->bio, ca->disk_sb.bdev);
1567 closure_get(&ra->cl);
1568 submit_bio(&rb->bio);
1570 ra->err[i] = BLK_STS_REMOVED;
1577 closure_sync(&ra->cl);
1578 btree_node_read_all_replicas_done(&ra->cl.work);
1580 continue_at(&ra->cl, btree_node_read_all_replicas_done,
1587 void bch2_btree_node_read(struct btree_trans *trans, struct btree *b,
1590 struct bch_fs *c = trans->c;
1591 struct extent_ptr_decoded pick;
1592 struct btree_read_bio *rb;
1597 trace_and_count(c, btree_node_read, trans, b);
1599 if (bch2_verify_all_btree_replicas &&
1600 !btree_node_read_all_replicas(c, b, sync))
1603 ret = bch2_bkey_pick_read_device(c, bkey_i_to_s_c(&b->key),
1607 struct printbuf buf = PRINTBUF;
1609 prt_str(&buf, "btree node read error: no device to read from\n at ");
1610 bch2_btree_pos_to_text(&buf, c, b);
1611 bch_err(c, "%s", buf.buf);
1613 if (c->recovery_passes_explicit & BIT_ULL(BCH_RECOVERY_PASS_check_topology) &&
1614 c->curr_recovery_pass > BCH_RECOVERY_PASS_check_topology)
1615 bch2_fatal_error(c);
1617 set_btree_node_read_error(b);
1618 clear_btree_node_read_in_flight(b);
1619 wake_up_bit(&b->flags, BTREE_NODE_read_in_flight);
1620 printbuf_exit(&buf);
1624 ca = bch_dev_bkey_exists(c, pick.ptr.dev);
1626 bio = bio_alloc_bioset(NULL,
1627 buf_pages(b->data, btree_bytes(c)),
1628 REQ_OP_READ|REQ_SYNC|REQ_META,
1631 rb = container_of(bio, struct btree_read_bio, bio);
1635 rb->start_time = local_clock();
1636 rb->have_ioref = bch2_dev_get_ioref(ca, READ);
1638 INIT_WORK(&rb->work, btree_node_read_work);
1639 bio->bi_iter.bi_sector = pick.ptr.offset;
1640 bio->bi_end_io = btree_node_read_endio;
1641 bch2_bio_map(bio, b->data, btree_bytes(c));
1643 if (rb->have_ioref) {
1644 this_cpu_add(ca->io_done->sectors[READ][BCH_DATA_btree],
1646 bio_set_dev(bio, ca->disk_sb.bdev);
1649 submit_bio_wait(bio);
1650 bch2_latency_acct(ca, rb->start_time, READ);
1651 btree_node_read_work(&rb->work);
1656 bio->bi_status = BLK_STS_REMOVED;
1659 btree_node_read_work(&rb->work);
1661 queue_work(c->io_complete_wq, &rb->work);
1665 static int __bch2_btree_root_read(struct btree_trans *trans, enum btree_id id,
1666 const struct bkey_i *k, unsigned level)
1668 struct bch_fs *c = trans->c;
1673 closure_init_stack(&cl);
1676 ret = bch2_btree_cache_cannibalize_lock(trans, &cl);
1680 b = bch2_btree_node_mem_alloc(trans, level != 0);
1681 bch2_btree_cache_cannibalize_unlock(trans);
1685 bkey_copy(&b->key, k);
1686 BUG_ON(bch2_btree_node_hash_insert(&c->btree_cache, b, level, id));
1688 set_btree_node_read_in_flight(b);
1690 bch2_btree_node_read(trans, b, true);
1692 if (btree_node_read_error(b)) {
1693 bch2_btree_node_hash_remove(&c->btree_cache, b);
1695 mutex_lock(&c->btree_cache.lock);
1696 list_move(&b->list, &c->btree_cache.freeable);
1697 mutex_unlock(&c->btree_cache.lock);
1703 bch2_btree_set_root_for_read(c, b);
1705 six_unlock_write(&b->c.lock);
1706 six_unlock_intent(&b->c.lock);
1711 int bch2_btree_root_read(struct bch_fs *c, enum btree_id id,
1712 const struct bkey_i *k, unsigned level)
1714 return bch2_trans_run(c, __bch2_btree_root_read(trans, id, k, level));
1717 static void bch2_btree_complete_write(struct bch_fs *c, struct btree *b,
1718 struct btree_write *w)
1720 unsigned long old, new, v = READ_ONCE(b->will_make_reachable);
1728 } while ((v = cmpxchg(&b->will_make_reachable, old, new)) != old);
1731 closure_put(&((struct btree_update *) new)->cl);
1733 bch2_journal_pin_drop(&c->journal, &w->journal);
1736 static void __btree_node_write_done(struct bch_fs *c, struct btree *b)
1738 struct btree_write *w = btree_prev_write(b);
1739 unsigned long old, new, v;
1742 bch2_btree_complete_write(c, b, w);
1744 v = READ_ONCE(b->flags);
1748 if ((old & (1U << BTREE_NODE_dirty)) &&
1749 (old & (1U << BTREE_NODE_need_write)) &&
1750 !(old & (1U << BTREE_NODE_never_write)) &&
1751 !(old & (1U << BTREE_NODE_write_blocked)) &&
1752 !(old & (1U << BTREE_NODE_will_make_reachable))) {
1753 new &= ~(1U << BTREE_NODE_dirty);
1754 new &= ~(1U << BTREE_NODE_need_write);
1755 new |= (1U << BTREE_NODE_write_in_flight);
1756 new |= (1U << BTREE_NODE_write_in_flight_inner);
1757 new |= (1U << BTREE_NODE_just_written);
1758 new ^= (1U << BTREE_NODE_write_idx);
1760 type = new & BTREE_WRITE_TYPE_MASK;
1761 new &= ~BTREE_WRITE_TYPE_MASK;
1763 new &= ~(1U << BTREE_NODE_write_in_flight);
1764 new &= ~(1U << BTREE_NODE_write_in_flight_inner);
1766 } while ((v = cmpxchg(&b->flags, old, new)) != old);
1768 if (new & (1U << BTREE_NODE_write_in_flight))
1769 __bch2_btree_node_write(c, b, BTREE_WRITE_ALREADY_STARTED|type);
1771 wake_up_bit(&b->flags, BTREE_NODE_write_in_flight);
1774 static void btree_node_write_done(struct bch_fs *c, struct btree *b)
1776 struct btree_trans *trans = bch2_trans_get(c);
1778 btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_read);
1779 __btree_node_write_done(c, b);
1780 six_unlock_read(&b->c.lock);
1782 bch2_trans_put(trans);
1785 static void btree_node_write_work(struct work_struct *work)
1787 struct btree_write_bio *wbio =
1788 container_of(work, struct btree_write_bio, work);
1789 struct bch_fs *c = wbio->wbio.c;
1790 struct btree *b = wbio->wbio.bio.bi_private;
1791 struct bch_extent_ptr *ptr;
1794 btree_bounce_free(c,
1796 wbio->wbio.used_mempool,
1799 bch2_bkey_drop_ptrs(bkey_i_to_s(&wbio->key), ptr,
1800 bch2_dev_list_has_dev(wbio->wbio.failed, ptr->dev));
1802 if (!bch2_bkey_nr_ptrs(bkey_i_to_s_c(&wbio->key))) {
1803 ret = -BCH_ERR_btree_write_all_failed;
1807 if (wbio->wbio.first_btree_write) {
1808 if (wbio->wbio.failed.nr) {
1812 ret = bch2_trans_do(c, NULL, NULL, 0,
1813 bch2_btree_node_update_key_get_iter(trans, b, &wbio->key,
1814 BCH_WATERMARK_reclaim|
1815 BCH_TRANS_COMMIT_journal_reclaim|
1816 BCH_TRANS_COMMIT_no_enospc|
1817 BCH_TRANS_COMMIT_no_check_rw,
1818 !wbio->wbio.failed.nr));
1823 bio_put(&wbio->wbio.bio);
1824 btree_node_write_done(c, b);
1827 set_btree_node_noevict(b);
1828 if (!bch2_err_matches(ret, EROFS))
1829 bch2_fs_fatal_error(c, "fatal error writing btree node: %s", bch2_err_str(ret));
1833 static void btree_node_write_endio(struct bio *bio)
1835 struct bch_write_bio *wbio = to_wbio(bio);
1836 struct bch_write_bio *parent = wbio->split ? wbio->parent : NULL;
1837 struct bch_write_bio *orig = parent ?: wbio;
1838 struct btree_write_bio *wb = container_of(orig, struct btree_write_bio, wbio);
1839 struct bch_fs *c = wbio->c;
1840 struct btree *b = wbio->bio.bi_private;
1841 struct bch_dev *ca = bch_dev_bkey_exists(c, wbio->dev);
1842 unsigned long flags;
1844 if (wbio->have_ioref)
1845 bch2_latency_acct(ca, wbio->submit_time, WRITE);
1847 if (bch2_dev_io_err_on(bio->bi_status, ca, BCH_MEMBER_ERROR_write,
1848 "btree write error: %s",
1849 bch2_blk_status_to_str(bio->bi_status)) ||
1850 bch2_meta_write_fault("btree")) {
1851 spin_lock_irqsave(&c->btree_write_error_lock, flags);
1852 bch2_dev_list_add_dev(&orig->failed, wbio->dev);
1853 spin_unlock_irqrestore(&c->btree_write_error_lock, flags);
1856 if (wbio->have_ioref)
1857 percpu_ref_put(&ca->io_ref);
1861 bio_endio(&parent->bio);
1865 clear_btree_node_write_in_flight_inner(b);
1866 wake_up_bit(&b->flags, BTREE_NODE_write_in_flight_inner);
1867 INIT_WORK(&wb->work, btree_node_write_work);
1868 queue_work(c->btree_io_complete_wq, &wb->work);
1871 static int validate_bset_for_write(struct bch_fs *c, struct btree *b,
1872 struct bset *i, unsigned sectors)
1874 struct printbuf buf = PRINTBUF;
1878 ret = bch2_bkey_invalid(c, bkey_i_to_s_c(&b->key),
1879 BKEY_TYPE_btree, WRITE, &buf);
1882 bch2_fs_inconsistent(c, "invalid btree node key before write: %s", buf.buf);
1883 printbuf_exit(&buf);
1887 ret = validate_bset_keys(c, b, i, WRITE, false, &saw_error) ?:
1888 validate_bset(c, NULL, b, i, b->written, sectors, WRITE, false, &saw_error);
1890 bch2_inconsistent_error(c);
1897 static void btree_write_submit(struct work_struct *work)
1899 struct btree_write_bio *wbio = container_of(work, struct btree_write_bio, work);
1900 BKEY_PADDED_ONSTACK(k, BKEY_BTREE_PTR_VAL_U64s_MAX) tmp;
1902 bkey_copy(&tmp.k, &wbio->key);
1904 bkey_for_each_ptr(bch2_bkey_ptrs(bkey_i_to_s(&tmp.k)), ptr)
1905 ptr->offset += wbio->sector_offset;
1907 bch2_submit_wbio_replicas(&wbio->wbio, wbio->wbio.c, BCH_DATA_btree,
1911 void __bch2_btree_node_write(struct bch_fs *c, struct btree *b, unsigned flags)
1913 struct btree_write_bio *wbio;
1914 struct bset_tree *t;
1916 struct btree_node *bn = NULL;
1917 struct btree_node_entry *bne = NULL;
1918 struct sort_iter_stack sort_iter;
1920 unsigned bytes_to_write, sectors_to_write, bytes, u64s;
1923 unsigned long old, new;
1924 bool validate_before_checksum = false;
1925 enum btree_write_type type = flags & BTREE_WRITE_TYPE_MASK;
1929 if (flags & BTREE_WRITE_ALREADY_STARTED)
1933 * We may only have a read lock on the btree node - the dirty bit is our
1934 * "lock" against racing with other threads that may be trying to start
1935 * a write, we do a write iff we clear the dirty bit. Since setting the
1936 * dirty bit requires a write lock, we can't race with other threads
1940 old = new = READ_ONCE(b->flags);
1942 if (!(old & (1 << BTREE_NODE_dirty)))
1945 if ((flags & BTREE_WRITE_ONLY_IF_NEED) &&
1946 !(old & (1 << BTREE_NODE_need_write)))
1950 ((1 << BTREE_NODE_never_write)|
1951 (1 << BTREE_NODE_write_blocked)))
1955 (old & (1 << BTREE_NODE_will_make_reachable)))
1958 if (old & (1 << BTREE_NODE_write_in_flight))
1961 if (flags & BTREE_WRITE_ONLY_IF_NEED)
1962 type = new & BTREE_WRITE_TYPE_MASK;
1963 new &= ~BTREE_WRITE_TYPE_MASK;
1965 new &= ~(1 << BTREE_NODE_dirty);
1966 new &= ~(1 << BTREE_NODE_need_write);
1967 new |= (1 << BTREE_NODE_write_in_flight);
1968 new |= (1 << BTREE_NODE_write_in_flight_inner);
1969 new |= (1 << BTREE_NODE_just_written);
1970 new ^= (1 << BTREE_NODE_write_idx);
1971 } while (cmpxchg_acquire(&b->flags, old, new) != old);
1973 if (new & (1U << BTREE_NODE_need_write))
1976 BUG_ON((type == BTREE_WRITE_initial) != (b->written == 0));
1978 atomic_dec(&c->btree_cache.dirty);
1980 BUG_ON(btree_node_fake(b));
1981 BUG_ON((b->will_make_reachable != 0) != !b->written);
1983 BUG_ON(b->written >= btree_sectors(c));
1984 BUG_ON(b->written & (block_sectors(c) - 1));
1985 BUG_ON(bset_written(b, btree_bset_last(b)));
1986 BUG_ON(le64_to_cpu(b->data->magic) != bset_magic(c));
1987 BUG_ON(memcmp(&b->data->format, &b->format, sizeof(b->format)));
1989 bch2_sort_whiteouts(c, b);
1991 sort_iter_stack_init(&sort_iter, b);
1994 ? sizeof(struct btree_node)
1995 : sizeof(struct btree_node_entry);
1997 bytes += b->whiteout_u64s * sizeof(u64);
1999 for_each_bset(b, t) {
2002 if (bset_written(b, i))
2005 bytes += le16_to_cpu(i->u64s) * sizeof(u64);
2006 sort_iter_add(&sort_iter.iter,
2007 btree_bkey_first(b, t),
2008 btree_bkey_last(b, t));
2009 seq = max(seq, le64_to_cpu(i->journal_seq));
2012 BUG_ON(b->written && !seq);
2014 /* bch2_varint_decode may read up to 7 bytes past the end of the buffer: */
2017 /* buffer must be a multiple of the block size */
2018 bytes = round_up(bytes, block_bytes(c));
2020 data = btree_bounce_alloc(c, bytes, &used_mempool);
2028 bne->keys = b->data->keys;
2032 i->journal_seq = cpu_to_le64(seq);
2035 sort_iter_add(&sort_iter.iter,
2036 unwritten_whiteouts_start(c, b),
2037 unwritten_whiteouts_end(c, b));
2038 SET_BSET_SEPARATE_WHITEOUTS(i, false);
2040 b->whiteout_u64s = 0;
2042 u64s = bch2_sort_keys(i->start, &sort_iter.iter, false);
2043 le16_add_cpu(&i->u64s, u64s);
2045 BUG_ON(!b->written && i->u64s != b->data->keys.u64s);
2047 set_needs_whiteout(i, false);
2049 /* do we have data to write? */
2050 if (b->written && !i->u64s)
2053 bytes_to_write = vstruct_end(i) - data;
2054 sectors_to_write = round_up(bytes_to_write, block_bytes(c)) >> 9;
2057 b->key.k.type == KEY_TYPE_btree_ptr_v2)
2058 BUG_ON(btree_ptr_sectors_written(&b->key) != sectors_to_write);
2060 memset(data + bytes_to_write, 0,
2061 (sectors_to_write << 9) - bytes_to_write);
2063 BUG_ON(b->written + sectors_to_write > btree_sectors(c));
2064 BUG_ON(BSET_BIG_ENDIAN(i) != CPU_BIG_ENDIAN);
2065 BUG_ON(i->seq != b->data->keys.seq);
2067 i->version = cpu_to_le16(c->sb.version);
2068 SET_BSET_OFFSET(i, b->written);
2069 SET_BSET_CSUM_TYPE(i, bch2_meta_checksum_type(c));
2071 if (bch2_csum_type_is_encryption(BSET_CSUM_TYPE(i)))
2072 validate_before_checksum = true;
2074 /* validate_bset will be modifying: */
2075 if (le16_to_cpu(i->version) < bcachefs_metadata_version_current)
2076 validate_before_checksum = true;
2078 /* if we're going to be encrypting, check metadata validity first: */
2079 if (validate_before_checksum &&
2080 validate_bset_for_write(c, b, i, sectors_to_write))
2083 ret = bset_encrypt(c, i, b->written << 9);
2084 if (bch2_fs_fatal_err_on(ret, c,
2085 "error encrypting btree node: %i\n", ret))
2088 nonce = btree_nonce(i, b->written << 9);
2091 bn->csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bn);
2093 bne->csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bne);
2095 /* if we're not encrypting, check metadata after checksumming: */
2096 if (!validate_before_checksum &&
2097 validate_bset_for_write(c, b, i, sectors_to_write))
2101 * We handle btree write errors by immediately halting the journal -
2102 * after we've done that, we can't issue any subsequent btree writes
2103 * because they might have pointers to new nodes that failed to write.
2105 * Furthermore, there's no point in doing any more btree writes because
2106 * with the journal stopped, we're never going to update the journal to
2107 * reflect that those writes were done and the data flushed from the
2110 * Also on journal error, the pending write may have updates that were
2111 * never journalled (interior nodes, see btree_update_nodes_written()) -
2112 * it's critical that we don't do the write in that case otherwise we
2113 * will have updates visible that weren't in the journal:
2115 * Make sure to update b->written so bch2_btree_init_next() doesn't
2118 if (bch2_journal_error(&c->journal) ||
2122 trace_and_count(c, btree_node_write, b, bytes_to_write, sectors_to_write);
2124 wbio = container_of(bio_alloc_bioset(NULL,
2125 buf_pages(data, sectors_to_write << 9),
2126 REQ_OP_WRITE|REQ_META,
2129 struct btree_write_bio, wbio.bio);
2130 wbio_init(&wbio->wbio.bio);
2132 wbio->data_bytes = bytes;
2133 wbio->sector_offset = b->written;
2135 wbio->wbio.used_mempool = used_mempool;
2136 wbio->wbio.first_btree_write = !b->written;
2137 wbio->wbio.bio.bi_end_io = btree_node_write_endio;
2138 wbio->wbio.bio.bi_private = b;
2140 bch2_bio_map(&wbio->wbio.bio, data, sectors_to_write << 9);
2142 bkey_copy(&wbio->key, &b->key);
2144 b->written += sectors_to_write;
2146 if (wbio->key.k.type == KEY_TYPE_btree_ptr_v2)
2147 bkey_i_to_btree_ptr_v2(&wbio->key)->v.sectors_written =
2148 cpu_to_le16(b->written);
2150 atomic64_inc(&c->btree_write_stats[type].nr);
2151 atomic64_add(bytes_to_write, &c->btree_write_stats[type].bytes);
2153 INIT_WORK(&wbio->work, btree_write_submit);
2154 queue_work(c->io_complete_wq, &wbio->work);
2157 set_btree_node_noevict(b);
2158 b->written += sectors_to_write;
2160 btree_bounce_free(c, bytes, used_mempool, data);
2161 __btree_node_write_done(c, b);
2165 * Work that must be done with write lock held:
2167 bool bch2_btree_post_write_cleanup(struct bch_fs *c, struct btree *b)
2169 bool invalidated_iter = false;
2170 struct btree_node_entry *bne;
2171 struct bset_tree *t;
2173 if (!btree_node_just_written(b))
2176 BUG_ON(b->whiteout_u64s);
2178 clear_btree_node_just_written(b);
2181 * Note: immediately after write, bset_written() doesn't work - the
2182 * amount of data we had to write after compaction might have been
2183 * smaller than the offset of the last bset.
2185 * However, we know that all bsets have been written here, as long as
2186 * we're still holding the write lock:
2190 * XXX: decide if we really want to unconditionally sort down to a
2194 btree_node_sort(c, b, 0, b->nsets, true);
2195 invalidated_iter = true;
2197 invalidated_iter = bch2_drop_whiteouts(b, COMPACT_ALL);
2201 set_needs_whiteout(bset(b, t), true);
2203 bch2_btree_verify(c, b);
2206 * If later we don't unconditionally sort down to a single bset, we have
2207 * to ensure this is still true:
2209 BUG_ON((void *) btree_bkey_last(b, bset_tree_last(b)) > write_block(b));
2211 bne = want_new_bset(c, b);
2213 bch2_bset_init_next(c, b, bne);
2215 bch2_btree_build_aux_trees(b);
2217 return invalidated_iter;
2221 * Use this one if the node is intent locked:
2223 void bch2_btree_node_write(struct bch_fs *c, struct btree *b,
2224 enum six_lock_type lock_type_held,
2227 if (lock_type_held == SIX_LOCK_intent ||
2228 (lock_type_held == SIX_LOCK_read &&
2229 six_lock_tryupgrade(&b->c.lock))) {
2230 __bch2_btree_node_write(c, b, flags);
2232 /* don't cycle lock unnecessarily: */
2233 if (btree_node_just_written(b) &&
2234 six_trylock_write(&b->c.lock)) {
2235 bch2_btree_post_write_cleanup(c, b);
2236 six_unlock_write(&b->c.lock);
2239 if (lock_type_held == SIX_LOCK_read)
2240 six_lock_downgrade(&b->c.lock);
2242 __bch2_btree_node_write(c, b, flags);
2243 if (lock_type_held == SIX_LOCK_write &&
2244 btree_node_just_written(b))
2245 bch2_btree_post_write_cleanup(c, b);
2249 static bool __bch2_btree_flush_all(struct bch_fs *c, unsigned flag)
2251 struct bucket_table *tbl;
2252 struct rhash_head *pos;
2258 for_each_cached_btree(b, c, tbl, i, pos)
2259 if (test_bit(flag, &b->flags)) {
2261 wait_on_bit_io(&b->flags, flag, TASK_UNINTERRUPTIBLE);
2270 bool bch2_btree_flush_all_reads(struct bch_fs *c)
2272 return __bch2_btree_flush_all(c, BTREE_NODE_read_in_flight);
2275 bool bch2_btree_flush_all_writes(struct bch_fs *c)
2277 return __bch2_btree_flush_all(c, BTREE_NODE_write_in_flight);
2280 static const char * const bch2_btree_write_types[] = {
2281 #define x(t, n) [n] = #t,
2282 BCH_BTREE_WRITE_TYPES()
2286 void bch2_btree_write_stats_to_text(struct printbuf *out, struct bch_fs *c)
2288 printbuf_tabstop_push(out, 20);
2289 printbuf_tabstop_push(out, 10);
2294 prt_str(out, "size");
2297 for (unsigned i = 0; i < BTREE_WRITE_TYPE_NR; i++) {
2298 u64 nr = atomic64_read(&c->btree_write_stats[i].nr);
2299 u64 bytes = atomic64_read(&c->btree_write_stats[i].bytes);
2301 prt_printf(out, "%s:", bch2_btree_write_types[i]);
2305 prt_human_readable_u64(out, nr ? div64_u64(bytes, nr) : 0);