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"
22 #include <linux/sched/mm.h>
23 #include <trace/events/bcachefs.h>
25 void bch2_btree_node_io_unlock(struct btree *b)
27 EBUG_ON(!btree_node_write_in_flight(b));
29 clear_btree_node_write_in_flight_inner(b);
30 clear_btree_node_write_in_flight(b);
31 wake_up_bit(&b->flags, BTREE_NODE_write_in_flight);
34 void bch2_btree_node_io_lock(struct btree *b)
36 BUG_ON(lock_class_is_held(&bch2_btree_node_lock_key));
38 wait_on_bit_lock_io(&b->flags, BTREE_NODE_write_in_flight,
39 TASK_UNINTERRUPTIBLE);
42 void __bch2_btree_node_wait_on_read(struct btree *b)
44 wait_on_bit_io(&b->flags, BTREE_NODE_read_in_flight,
45 TASK_UNINTERRUPTIBLE);
48 void __bch2_btree_node_wait_on_write(struct btree *b)
50 wait_on_bit_io(&b->flags, BTREE_NODE_write_in_flight,
51 TASK_UNINTERRUPTIBLE);
54 void bch2_btree_node_wait_on_read(struct btree *b)
56 BUG_ON(lock_class_is_held(&bch2_btree_node_lock_key));
58 wait_on_bit_io(&b->flags, BTREE_NODE_read_in_flight,
59 TASK_UNINTERRUPTIBLE);
62 void bch2_btree_node_wait_on_write(struct btree *b)
64 BUG_ON(lock_class_is_held(&bch2_btree_node_lock_key));
66 wait_on_bit_io(&b->flags, BTREE_NODE_write_in_flight,
67 TASK_UNINTERRUPTIBLE);
70 static void verify_no_dups(struct btree *b,
71 struct bkey_packed *start,
72 struct bkey_packed *end)
74 #ifdef CONFIG_BCACHEFS_DEBUG
75 struct bkey_packed *k, *p;
80 for (p = start, k = bkey_next(start);
82 p = k, k = bkey_next(k)) {
83 struct bkey l = bkey_unpack_key(b, p);
84 struct bkey r = bkey_unpack_key(b, k);
86 BUG_ON(bpos_cmp(l.p, bkey_start_pos(&r)) >= 0);
91 static void set_needs_whiteout(struct bset *i, int v)
93 struct bkey_packed *k;
95 for (k = i->start; k != vstruct_last(i); k = bkey_next(k))
96 k->needs_whiteout = v;
99 static void btree_bounce_free(struct bch_fs *c, size_t size,
100 bool used_mempool, void *p)
103 mempool_free(p, &c->btree_bounce_pool);
108 static void *btree_bounce_alloc(struct bch_fs *c, size_t size,
111 unsigned flags = memalloc_nofs_save();
114 BUG_ON(size > btree_bytes(c));
116 *used_mempool = false;
117 p = vpmalloc(size, __GFP_NOWARN|GFP_NOWAIT);
119 *used_mempool = true;
120 p = mempool_alloc(&c->btree_bounce_pool, GFP_NOIO);
122 memalloc_nofs_restore(flags);
126 static void sort_bkey_ptrs(const struct btree *bt,
127 struct bkey_packed **ptrs, unsigned nr)
129 unsigned n = nr, a = nr / 2, b, c, d;
134 /* Heap sort: see lib/sort.c: */
139 swap(ptrs[0], ptrs[n]);
143 for (b = a; c = 2 * b + 1, (d = c + 1) < n;)
144 b = bch2_bkey_cmp_packed(bt,
146 ptrs[d]) >= 0 ? c : d;
151 bch2_bkey_cmp_packed(bt,
158 swap(ptrs[b], ptrs[c]);
163 static void bch2_sort_whiteouts(struct bch_fs *c, struct btree *b)
165 struct bkey_packed *new_whiteouts, **ptrs, **ptrs_end, *k;
166 bool used_mempool = false;
167 size_t bytes = b->whiteout_u64s * sizeof(u64);
169 if (!b->whiteout_u64s)
172 new_whiteouts = btree_bounce_alloc(c, bytes, &used_mempool);
174 ptrs = ptrs_end = ((void *) new_whiteouts + bytes);
176 for (k = unwritten_whiteouts_start(c, b);
177 k != unwritten_whiteouts_end(c, b);
181 sort_bkey_ptrs(b, ptrs, ptrs_end - ptrs);
185 while (ptrs != ptrs_end) {
191 verify_no_dups(b, new_whiteouts,
192 (void *) ((u64 *) new_whiteouts + b->whiteout_u64s));
194 memcpy_u64s(unwritten_whiteouts_start(c, b),
195 new_whiteouts, b->whiteout_u64s);
197 btree_bounce_free(c, bytes, used_mempool, new_whiteouts);
200 static bool should_compact_bset(struct btree *b, struct bset_tree *t,
201 bool compacting, enum compact_mode mode)
203 if (!bset_dead_u64s(b, t))
208 return should_compact_bset_lazy(b, t) ||
209 (compacting && !bset_written(b, bset(b, t)));
217 static bool bch2_drop_whiteouts(struct btree *b, enum compact_mode mode)
222 for_each_bset(b, t) {
223 struct bset *i = bset(b, t);
224 struct bkey_packed *k, *n, *out, *start, *end;
225 struct btree_node_entry *src = NULL, *dst = NULL;
227 if (t != b->set && !bset_written(b, i)) {
228 src = container_of(i, struct btree_node_entry, keys);
229 dst = max(write_block(b),
230 (void *) btree_bkey_last(b, t - 1));
236 if (!should_compact_bset(b, t, ret, mode)) {
238 memmove(dst, src, sizeof(*src) +
239 le16_to_cpu(src->keys.u64s) *
242 set_btree_bset(b, t, i);
247 start = btree_bkey_first(b, t);
248 end = btree_bkey_last(b, t);
251 memmove(dst, src, sizeof(*src));
253 set_btree_bset(b, t, i);
258 for (k = start; k != end; k = n) {
261 if (!bkey_deleted(k)) {
263 out = bkey_next(out);
265 BUG_ON(k->needs_whiteout);
269 i->u64s = cpu_to_le16((u64 *) out - i->_data);
270 set_btree_bset_end(b, t);
271 bch2_bset_set_no_aux_tree(b, t);
275 bch2_verify_btree_nr_keys(b);
277 bch2_btree_build_aux_trees(b);
282 bool bch2_compact_whiteouts(struct bch_fs *c, struct btree *b,
283 enum compact_mode mode)
285 return bch2_drop_whiteouts(b, mode);
288 static void btree_node_sort(struct bch_fs *c, struct btree *b,
291 bool filter_whiteouts)
293 struct btree_node *out;
294 struct sort_iter sort_iter;
296 struct bset *start_bset = bset(b, &b->set[start_idx]);
297 bool used_mempool = false;
298 u64 start_time, seq = 0;
299 unsigned i, u64s = 0, bytes, shift = end_idx - start_idx - 1;
300 bool sorting_entire_node = start_idx == 0 &&
303 sort_iter_init(&sort_iter, b);
305 for (t = b->set + start_idx;
306 t < b->set + end_idx;
308 u64s += le16_to_cpu(bset(b, t)->u64s);
309 sort_iter_add(&sort_iter,
310 btree_bkey_first(b, t),
311 btree_bkey_last(b, t));
314 bytes = sorting_entire_node
316 : __vstruct_bytes(struct btree_node, u64s);
318 out = btree_bounce_alloc(c, bytes, &used_mempool);
320 start_time = local_clock();
322 u64s = bch2_sort_keys(out->keys.start, &sort_iter, filter_whiteouts);
324 out->keys.u64s = cpu_to_le16(u64s);
326 BUG_ON(vstruct_end(&out->keys) > (void *) out + bytes);
328 if (sorting_entire_node)
329 bch2_time_stats_update(&c->times[BCH_TIME_btree_node_sort],
332 /* Make sure we preserve bset journal_seq: */
333 for (t = b->set + start_idx; t < b->set + end_idx; t++)
334 seq = max(seq, le64_to_cpu(bset(b, t)->journal_seq));
335 start_bset->journal_seq = cpu_to_le64(seq);
337 if (sorting_entire_node) {
338 unsigned u64s = le16_to_cpu(out->keys.u64s);
340 BUG_ON(bytes != btree_bytes(c));
343 * Our temporary buffer is the same size as the btree node's
344 * buffer, we can just swap buffers instead of doing a big
348 out->keys.u64s = cpu_to_le16(u64s);
350 set_btree_bset(b, b->set, &b->data->keys);
352 start_bset->u64s = out->keys.u64s;
353 memcpy_u64s(start_bset->start,
355 le16_to_cpu(out->keys.u64s));
358 for (i = start_idx + 1; i < end_idx; i++)
359 b->nr.bset_u64s[start_idx] +=
364 for (i = start_idx + 1; i < b->nsets; i++) {
365 b->nr.bset_u64s[i] = b->nr.bset_u64s[i + shift];
366 b->set[i] = b->set[i + shift];
369 for (i = b->nsets; i < MAX_BSETS; i++)
370 b->nr.bset_u64s[i] = 0;
372 set_btree_bset_end(b, &b->set[start_idx]);
373 bch2_bset_set_no_aux_tree(b, &b->set[start_idx]);
375 btree_bounce_free(c, bytes, used_mempool, out);
377 bch2_verify_btree_nr_keys(b);
380 void bch2_btree_sort_into(struct bch_fs *c,
384 struct btree_nr_keys nr;
385 struct btree_node_iter src_iter;
386 u64 start_time = local_clock();
388 BUG_ON(dst->nsets != 1);
390 bch2_bset_set_no_aux_tree(dst, dst->set);
392 bch2_btree_node_iter_init_from_start(&src_iter, src);
394 nr = bch2_sort_repack(btree_bset_first(dst),
399 bch2_time_stats_update(&c->times[BCH_TIME_btree_node_sort],
402 set_btree_bset_end(dst, dst->set);
404 dst->nr.live_u64s += nr.live_u64s;
405 dst->nr.bset_u64s[0] += nr.bset_u64s[0];
406 dst->nr.packed_keys += nr.packed_keys;
407 dst->nr.unpacked_keys += nr.unpacked_keys;
409 bch2_verify_btree_nr_keys(dst);
412 #define SORT_CRIT (4096 / sizeof(u64))
415 * We're about to add another bset to the btree node, so if there's currently
416 * too many bsets - sort some of them together:
418 static bool btree_node_compact(struct bch_fs *c, struct btree *b)
420 unsigned unwritten_idx;
423 for (unwritten_idx = 0;
424 unwritten_idx < b->nsets;
426 if (!bset_written(b, bset(b, &b->set[unwritten_idx])))
429 if (b->nsets - unwritten_idx > 1) {
430 btree_node_sort(c, b, unwritten_idx,
435 if (unwritten_idx > 1) {
436 btree_node_sort(c, b, 0, unwritten_idx, false);
443 void bch2_btree_build_aux_trees(struct btree *b)
448 bch2_bset_build_aux_tree(b, t,
449 !bset_written(b, bset(b, t)) &&
450 t == bset_tree_last(b));
454 * @bch_btree_init_next - initialize a new (unwritten) bset that can then be
457 * Safe to call if there already is an unwritten bset - will only add a new bset
458 * if @b doesn't already have one.
460 * Returns true if we sorted (i.e. invalidated iterators
462 void bch2_btree_init_next(struct btree_trans *trans, struct btree *b)
464 struct bch_fs *c = trans->c;
465 struct btree_node_entry *bne;
466 bool reinit_iter = false;
468 EBUG_ON(!(b->c.lock.state.seq & 1));
469 BUG_ON(bset_written(b, bset(b, &b->set[1])));
471 if (b->nsets == MAX_BSETS &&
472 !btree_node_write_in_flight(b)) {
473 unsigned log_u64s[] = {
474 ilog2(bset_u64s(&b->set[0])),
475 ilog2(bset_u64s(&b->set[1])),
476 ilog2(bset_u64s(&b->set[2])),
479 if (log_u64s[1] >= (log_u64s[0] + log_u64s[2]) / 2) {
480 bch2_btree_node_write(c, b, SIX_LOCK_write, 0);
485 if (b->nsets == MAX_BSETS &&
486 btree_node_compact(c, b))
489 BUG_ON(b->nsets >= MAX_BSETS);
491 bne = want_new_bset(c, b);
493 bch2_bset_init_next(c, b, bne);
495 bch2_btree_build_aux_trees(b);
498 bch2_trans_node_reinit_iter(trans, b);
501 static void btree_pos_to_text(struct printbuf *out, struct bch_fs *c,
504 prt_printf(out, "%s level %u/%u\n ",
505 bch2_btree_ids[b->c.btree_id],
507 c->btree_roots[b->c.btree_id].level);
508 bch2_bkey_val_to_text(out, c, bkey_i_to_s_c(&b->key));
511 static void btree_err_msg(struct printbuf *out, struct bch_fs *c,
513 struct btree *b, struct bset *i,
514 unsigned offset, int write)
516 prt_printf(out, bch2_log_msg(c, ""));
518 prt_str(out, "error validating btree node ");
520 prt_str(out, "corrupt btree node before write ");
522 prt_printf(out, "on %s ", ca->name);
523 prt_printf(out, "at btree ");
524 btree_pos_to_text(out, c, b);
526 prt_printf(out, "\n node offset %u", b->written);
528 prt_printf(out, " bset u64s %u", le16_to_cpu(i->u64s));
532 enum btree_err_type {
534 BTREE_ERR_WANT_RETRY,
535 BTREE_ERR_MUST_RETRY,
539 enum btree_validate_ret {
540 BTREE_RETRY_READ = 64,
543 #define btree_err(type, c, ca, b, i, msg, ...) \
546 struct printbuf out = PRINTBUF; \
548 btree_err_msg(&out, c, ca, b, i, b->written, write); \
549 prt_printf(&out, msg, ##__VA_ARGS__); \
551 if (type == BTREE_ERR_FIXABLE && \
553 !test_bit(BCH_FS_INITIAL_GC_DONE, &c->flags)) { \
554 mustfix_fsck_err(c, "%s", out.buf); \
558 bch2_print_string_as_lines(KERN_ERR, out.buf); \
563 case BTREE_ERR_FIXABLE: \
564 ret = -BCH_ERR_fsck_errors_not_fixed; \
566 case BTREE_ERR_WANT_RETRY: \
568 ret = BTREE_RETRY_READ; \
572 case BTREE_ERR_MUST_RETRY: \
573 ret = BTREE_RETRY_READ; \
575 case BTREE_ERR_FATAL: \
576 ret = -BCH_ERR_fsck_errors_not_fixed; \
581 if (bch2_fs_inconsistent(c)) { \
582 ret = -BCH_ERR_fsck_errors_not_fixed; \
588 printbuf_exit(&out); \
592 #define btree_err_on(cond, ...) ((cond) ? btree_err(__VA_ARGS__) : false)
595 * When btree topology repair changes the start or end of a node, that might
596 * mean we have to drop keys that are no longer inside the node:
598 void bch2_btree_node_drop_keys_outside_node(struct btree *b)
602 struct bkey unpacked;
603 struct btree_node_iter iter;
605 for_each_bset(b, t) {
606 struct bset *i = bset(b, t);
607 struct bkey_packed *k;
609 for (k = i->start; k != vstruct_last(i); k = bkey_next(k))
610 if (bkey_cmp_left_packed(b, k, &b->data->min_key) >= 0)
614 unsigned shift = (u64 *) k - (u64 *) i->start;
616 memmove_u64s_down(i->start, k,
617 (u64 *) vstruct_end(i) - (u64 *) k);
618 i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - shift);
619 set_btree_bset_end(b, t);
622 for (k = i->start; k != vstruct_last(i); k = bkey_next(k))
623 if (bkey_cmp_left_packed(b, k, &b->data->max_key) > 0)
626 if (k != vstruct_last(i)) {
627 i->u64s = cpu_to_le16((u64 *) k - (u64 *) i->start);
628 set_btree_bset_end(b, t);
633 * Always rebuild search trees: eytzinger search tree nodes directly
634 * depend on the values of min/max key:
636 bch2_bset_set_no_aux_tree(b, b->set);
637 bch2_btree_build_aux_trees(b);
639 for_each_btree_node_key_unpack(b, k, &iter, &unpacked) {
640 BUG_ON(bpos_cmp(k.k->p, b->data->min_key) < 0);
641 BUG_ON(bpos_cmp(k.k->p, b->data->max_key) > 0);
645 static int validate_bset(struct bch_fs *c, struct bch_dev *ca,
646 struct btree *b, struct bset *i,
647 unsigned offset, unsigned sectors,
648 int write, bool have_retry)
650 unsigned version = le16_to_cpu(i->version);
652 struct printbuf buf1 = PRINTBUF;
653 struct printbuf buf2 = PRINTBUF;
656 btree_err_on((version != BCH_BSET_VERSION_OLD &&
657 version < bcachefs_metadata_version_min) ||
658 version >= bcachefs_metadata_version_max,
659 BTREE_ERR_FATAL, c, ca, b, i,
660 "unsupported bset version");
662 if (btree_err_on(version < c->sb.version_min,
663 BTREE_ERR_FIXABLE, c, NULL, b, i,
664 "bset version %u older than superblock version_min %u",
665 version, c->sb.version_min)) {
666 mutex_lock(&c->sb_lock);
667 c->disk_sb.sb->version_min = cpu_to_le16(version);
669 mutex_unlock(&c->sb_lock);
672 if (btree_err_on(version > c->sb.version,
673 BTREE_ERR_FIXABLE, c, NULL, b, i,
674 "bset version %u newer than superblock version %u",
675 version, c->sb.version)) {
676 mutex_lock(&c->sb_lock);
677 c->disk_sb.sb->version = cpu_to_le16(version);
679 mutex_unlock(&c->sb_lock);
682 btree_err_on(BSET_SEPARATE_WHITEOUTS(i),
683 BTREE_ERR_FATAL, c, ca, b, i,
684 "BSET_SEPARATE_WHITEOUTS no longer supported");
686 if (btree_err_on(offset + sectors > btree_sectors(c),
687 BTREE_ERR_FIXABLE, c, ca, b, i,
688 "bset past end of btree node")) {
694 btree_err_on(offset && !i->u64s,
695 BTREE_ERR_FIXABLE, c, ca, b, i,
698 btree_err_on(BSET_OFFSET(i) &&
699 BSET_OFFSET(i) != offset,
700 BTREE_ERR_WANT_RETRY, c, ca, b, i,
701 "bset at wrong sector offset");
704 struct btree_node *bn =
705 container_of(i, struct btree_node, keys);
706 /* These indicate that we read the wrong btree node: */
708 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
709 struct bch_btree_ptr_v2 *bp =
710 &bkey_i_to_btree_ptr_v2(&b->key)->v;
713 btree_err_on(bp->seq != bn->keys.seq,
714 BTREE_ERR_MUST_RETRY, c, ca, b, NULL,
715 "incorrect sequence number (wrong btree node)");
718 btree_err_on(BTREE_NODE_ID(bn) != b->c.btree_id,
719 BTREE_ERR_MUST_RETRY, c, ca, b, i,
720 "incorrect btree id");
722 btree_err_on(BTREE_NODE_LEVEL(bn) != b->c.level,
723 BTREE_ERR_MUST_RETRY, c, ca, b, i,
727 compat_btree_node(b->c.level, b->c.btree_id, version,
728 BSET_BIG_ENDIAN(i), write, bn);
730 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
731 struct bch_btree_ptr_v2 *bp =
732 &bkey_i_to_btree_ptr_v2(&b->key)->v;
734 if (BTREE_PTR_RANGE_UPDATED(bp)) {
735 b->data->min_key = bp->min_key;
736 b->data->max_key = b->key.k.p;
739 btree_err_on(bpos_cmp(b->data->min_key, bp->min_key),
740 BTREE_ERR_MUST_RETRY, c, ca, b, NULL,
741 "incorrect min_key: got %s should be %s",
742 (printbuf_reset(&buf1),
743 bch2_bpos_to_text(&buf1, bn->min_key), buf1.buf),
744 (printbuf_reset(&buf2),
745 bch2_bpos_to_text(&buf2, bp->min_key), buf2.buf));
748 btree_err_on(bpos_cmp(bn->max_key, b->key.k.p),
749 BTREE_ERR_MUST_RETRY, c, ca, b, i,
750 "incorrect max key %s",
751 (printbuf_reset(&buf1),
752 bch2_bpos_to_text(&buf1, bn->max_key), buf1.buf));
755 compat_btree_node(b->c.level, b->c.btree_id, version,
756 BSET_BIG_ENDIAN(i), write, bn);
758 err = bch2_bkey_format_validate(&bn->format);
760 BTREE_ERR_FATAL, c, ca, b, i,
761 "invalid bkey format: %s", err);
763 compat_bformat(b->c.level, b->c.btree_id, version,
764 BSET_BIG_ENDIAN(i), write,
769 printbuf_exit(&buf2);
770 printbuf_exit(&buf1);
774 static int bset_key_invalid(struct bch_fs *c, struct btree *b,
776 bool updated_range, int rw,
777 struct printbuf *err)
779 return __bch2_bkey_invalid(c, k, btree_node_type(b), READ, err) ?:
780 (!updated_range ? bch2_bkey_in_btree_node(b, k, err) : 0) ?:
781 (rw == WRITE ? bch2_bkey_val_invalid(c, k, READ, err) : 0);
784 static int validate_bset_keys(struct bch_fs *c, struct btree *b,
785 struct bset *i, int write, bool have_retry)
787 unsigned version = le16_to_cpu(i->version);
788 struct bkey_packed *k, *prev = NULL;
789 struct printbuf buf = PRINTBUF;
790 bool updated_range = b->key.k.type == KEY_TYPE_btree_ptr_v2 &&
791 BTREE_PTR_RANGE_UPDATED(&bkey_i_to_btree_ptr_v2(&b->key)->v);
795 k != vstruct_last(i);) {
799 if (btree_err_on(bkey_next(k) > vstruct_last(i),
800 BTREE_ERR_FIXABLE, c, NULL, b, i,
801 "key extends past end of bset")) {
802 i->u64s = cpu_to_le16((u64 *) k - i->_data);
806 if (btree_err_on(k->format > KEY_FORMAT_CURRENT,
807 BTREE_ERR_FIXABLE, c, NULL, b, i,
808 "invalid bkey format %u", k->format)) {
809 i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
810 memmove_u64s_down(k, bkey_next(k),
811 (u64 *) vstruct_end(i) - (u64 *) k);
815 /* XXX: validate k->u64s */
817 bch2_bkey_compat(b->c.level, b->c.btree_id, version,
818 BSET_BIG_ENDIAN(i), write,
821 u = __bkey_disassemble(b, k, &tmp);
823 printbuf_reset(&buf);
824 if (bset_key_invalid(c, b, u.s_c, updated_range, write, &buf)) {
825 printbuf_reset(&buf);
826 prt_printf(&buf, "invalid bkey: ");
827 bset_key_invalid(c, b, u.s_c, updated_range, write, &buf);
828 prt_printf(&buf, "\n ");
829 bch2_bkey_val_to_text(&buf, c, u.s_c);
831 btree_err(BTREE_ERR_FIXABLE, c, NULL, b, i, "%s", buf.buf);
833 i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
834 memmove_u64s_down(k, bkey_next(k),
835 (u64 *) vstruct_end(i) - (u64 *) k);
840 bch2_bkey_compat(b->c.level, b->c.btree_id, version,
841 BSET_BIG_ENDIAN(i), write,
844 if (prev && bkey_iter_cmp(b, prev, k) > 0) {
845 struct bkey up = bkey_unpack_key(b, prev);
847 printbuf_reset(&buf);
848 prt_printf(&buf, "keys out of order: ");
849 bch2_bkey_to_text(&buf, &up);
850 prt_printf(&buf, " > ");
851 bch2_bkey_to_text(&buf, u.k);
853 bch2_dump_bset(c, b, i, 0);
855 if (btree_err(BTREE_ERR_FIXABLE, c, NULL, b, i, "%s", buf.buf)) {
856 i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
857 memmove_u64s_down(k, bkey_next(k),
858 (u64 *) vstruct_end(i) - (u64 *) k);
871 int bch2_btree_node_read_done(struct bch_fs *c, struct bch_dev *ca,
872 struct btree *b, bool have_retry)
874 struct btree_node_entry *bne;
875 struct sort_iter *iter;
876 struct btree_node *sorted;
877 struct bkey_packed *k;
878 struct bch_extent_ptr *ptr;
880 bool used_mempool, blacklisted;
881 bool updated_range = b->key.k.type == KEY_TYPE_btree_ptr_v2 &&
882 BTREE_PTR_RANGE_UPDATED(&bkey_i_to_btree_ptr_v2(&b->key)->v);
884 unsigned blacklisted_written, nonblacklisted_written = 0;
885 unsigned ptr_written = btree_ptr_sectors_written(&b->key);
886 struct printbuf buf = PRINTBUF;
887 int ret, retry_read = 0, write = READ;
889 b->version_ondisk = U16_MAX;
890 /* We might get called multiple times on read retry: */
893 iter = mempool_alloc(&c->fill_iter, GFP_NOIO);
894 sort_iter_init(iter, b);
895 iter->size = (btree_blocks(c) + 1) * 2;
897 if (bch2_meta_read_fault("btree"))
898 btree_err(BTREE_ERR_MUST_RETRY, c, ca, b, NULL,
901 btree_err_on(le64_to_cpu(b->data->magic) != bset_magic(c),
902 BTREE_ERR_MUST_RETRY, c, ca, b, NULL,
903 "bad magic: want %llx, got %llx",
904 bset_magic(c), le64_to_cpu(b->data->magic));
906 btree_err_on(!b->data->keys.seq,
907 BTREE_ERR_MUST_RETRY, c, ca, b, NULL,
908 "bad btree header: seq 0");
910 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
911 struct bch_btree_ptr_v2 *bp =
912 &bkey_i_to_btree_ptr_v2(&b->key)->v;
914 btree_err_on(b->data->keys.seq != bp->seq,
915 BTREE_ERR_MUST_RETRY, c, ca, b, NULL,
916 "got wrong btree node (seq %llx want %llx)",
917 b->data->keys.seq, bp->seq);
920 while (b->written < (ptr_written ?: btree_sectors(c))) {
923 struct bch_csum csum;
924 bool first = !b->written;
929 btree_err_on(!bch2_checksum_type_valid(c, BSET_CSUM_TYPE(i)),
930 BTREE_ERR_WANT_RETRY, c, ca, b, i,
931 "unknown checksum type %llu",
934 nonce = btree_nonce(i, b->written << 9);
935 csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, b->data);
937 btree_err_on(bch2_crc_cmp(csum, b->data->csum),
938 BTREE_ERR_WANT_RETRY, c, ca, b, i,
941 ret = bset_encrypt(c, i, b->written << 9);
942 if (bch2_fs_fatal_err_on(ret, c,
943 "error decrypting btree node: %i", ret))
946 btree_err_on(btree_node_type_is_extents(btree_node_type(b)) &&
947 !BTREE_NODE_NEW_EXTENT_OVERWRITE(b->data),
948 BTREE_ERR_FATAL, c, NULL, b, NULL,
949 "btree node does not have NEW_EXTENT_OVERWRITE set");
951 sectors = vstruct_sectors(b->data, c->block_bits);
953 bne = write_block(b);
956 if (i->seq != b->data->keys.seq)
959 btree_err_on(!bch2_checksum_type_valid(c, BSET_CSUM_TYPE(i)),
960 BTREE_ERR_WANT_RETRY, c, ca, b, i,
961 "unknown checksum type %llu",
964 nonce = btree_nonce(i, b->written << 9);
965 csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bne);
967 btree_err_on(bch2_crc_cmp(csum, bne->csum),
968 BTREE_ERR_WANT_RETRY, c, ca, b, i,
971 ret = bset_encrypt(c, i, b->written << 9);
972 if (bch2_fs_fatal_err_on(ret, c,
973 "error decrypting btree node: %i\n", ret))
976 sectors = vstruct_sectors(bne, c->block_bits);
979 b->version_ondisk = min(b->version_ondisk,
980 le16_to_cpu(i->version));
982 ret = validate_bset(c, ca, b, i, b->written, sectors,
988 btree_node_set_format(b, b->data->format);
990 ret = validate_bset_keys(c, b, i, READ, have_retry);
994 SET_BSET_BIG_ENDIAN(i, CPU_BIG_ENDIAN);
996 blacklisted = bch2_journal_seq_is_blacklisted(c,
997 le64_to_cpu(i->journal_seq),
1000 btree_err_on(blacklisted && first,
1001 BTREE_ERR_FIXABLE, c, ca, b, i,
1002 "first btree node bset has blacklisted journal seq (%llu)",
1003 le64_to_cpu(i->journal_seq));
1005 btree_err_on(blacklisted && ptr_written,
1006 BTREE_ERR_FIXABLE, c, ca, b, i,
1007 "found blacklisted bset (journal seq %llu) in btree node at offset %u-%u/%u",
1008 le64_to_cpu(i->journal_seq),
1009 b->written, b->written + sectors, ptr_written);
1011 b->written += sectors;
1013 if (blacklisted && !first)
1020 nonblacklisted_written = b->written;
1024 btree_err_on(b->written < ptr_written,
1025 BTREE_ERR_WANT_RETRY, c, ca, b, NULL,
1026 "btree node data missing: expected %u sectors, found %u",
1027 ptr_written, b->written);
1029 for (bne = write_block(b);
1030 bset_byte_offset(b, bne) < btree_bytes(c);
1031 bne = (void *) bne + block_bytes(c))
1032 btree_err_on(bne->keys.seq == b->data->keys.seq &&
1033 !bch2_journal_seq_is_blacklisted(c,
1034 le64_to_cpu(bne->keys.journal_seq),
1036 BTREE_ERR_WANT_RETRY, c, ca, b, NULL,
1037 "found bset signature after last bset");
1040 * Blacklisted bsets are those that were written after the most recent
1041 * (flush) journal write. Since there wasn't a flush, they may not have
1042 * made it to all devices - which means we shouldn't write new bsets
1043 * after them, as that could leave a gap and then reads from that device
1044 * wouldn't find all the bsets in that btree node - which means it's
1045 * important that we start writing new bsets after the most recent _non_
1048 blacklisted_written = b->written;
1049 b->written = nonblacklisted_written;
1052 sorted = btree_bounce_alloc(c, btree_bytes(c), &used_mempool);
1053 sorted->keys.u64s = 0;
1055 set_btree_bset(b, b->set, &b->data->keys);
1057 b->nr = bch2_key_sort_fix_overlapping(c, &sorted->keys, iter);
1059 u64s = le16_to_cpu(sorted->keys.u64s);
1061 sorted->keys.u64s = cpu_to_le16(u64s);
1062 swap(sorted, b->data);
1063 set_btree_bset(b, b->set, &b->data->keys);
1066 BUG_ON(b->nr.live_u64s != u64s);
1068 btree_bounce_free(c, btree_bytes(c), used_mempool, sorted);
1071 bch2_btree_node_drop_keys_outside_node(b);
1074 for (k = i->start; k != vstruct_last(i);) {
1076 struct bkey_s u = __bkey_disassemble(b, k, &tmp);
1078 printbuf_reset(&buf);
1080 if (bch2_bkey_val_invalid(c, u.s_c, READ, &buf) ||
1081 (bch2_inject_invalid_keys &&
1082 !bversion_cmp(u.k->version, MAX_VERSION))) {
1083 printbuf_reset(&buf);
1085 prt_printf(&buf, "invalid bkey: ");
1086 bch2_bkey_val_invalid(c, u.s_c, READ, &buf);
1087 prt_printf(&buf, "\n ");
1088 bch2_bkey_val_to_text(&buf, c, u.s_c);
1090 btree_err(BTREE_ERR_FIXABLE, c, NULL, b, i, "%s", buf.buf);
1092 btree_keys_account_key_drop(&b->nr, 0, k);
1094 i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
1095 memmove_u64s_down(k, bkey_next(k),
1096 (u64 *) vstruct_end(i) - (u64 *) k);
1097 set_btree_bset_end(b, b->set);
1101 if (u.k->type == KEY_TYPE_btree_ptr_v2) {
1102 struct bkey_s_btree_ptr_v2 bp = bkey_s_to_btree_ptr_v2(u);
1110 bch2_bset_build_aux_tree(b, b->set, false);
1112 set_needs_whiteout(btree_bset_first(b), true);
1114 btree_node_reset_sib_u64s(b);
1116 bkey_for_each_ptr(bch2_bkey_ptrs(bkey_i_to_s(&b->key)), ptr) {
1117 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
1119 if (ca->mi.state != BCH_MEMBER_STATE_rw)
1120 set_btree_node_need_rewrite(b);
1124 set_btree_node_need_rewrite(b);
1126 mempool_free(iter, &c->fill_iter);
1127 printbuf_exit(&buf);
1130 if (ret == BTREE_RETRY_READ) {
1133 bch2_inconsistent_error(c);
1134 set_btree_node_read_error(b);
1139 static void btree_node_read_work(struct work_struct *work)
1141 struct btree_read_bio *rb =
1142 container_of(work, struct btree_read_bio, work);
1143 struct bch_fs *c = rb->c;
1144 struct btree *b = rb->b;
1145 struct bch_dev *ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1146 struct bio *bio = &rb->bio;
1147 struct bch_io_failures failed = { .nr = 0 };
1148 struct printbuf buf = PRINTBUF;
1149 bool saw_error = false;
1156 bch_info(c, "retrying read");
1157 ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1158 rb->have_ioref = bch2_dev_get_ioref(ca, READ);
1159 bio_reset(bio, NULL, REQ_OP_READ|REQ_SYNC|REQ_META);
1160 bio->bi_iter.bi_sector = rb->pick.ptr.offset;
1161 bio->bi_iter.bi_size = btree_bytes(c);
1163 if (rb->have_ioref) {
1164 bio_set_dev(bio, ca->disk_sb.bdev);
1165 submit_bio_wait(bio);
1167 bio->bi_status = BLK_STS_REMOVED;
1170 printbuf_reset(&buf);
1171 btree_pos_to_text(&buf, c, b);
1172 bch2_dev_io_err_on(bio->bi_status, ca, "btree read error %s for %s",
1173 bch2_blk_status_to_str(bio->bi_status), buf.buf);
1175 percpu_ref_put(&ca->io_ref);
1176 rb->have_ioref = false;
1178 bch2_mark_io_failure(&failed, &rb->pick);
1180 can_retry = bch2_bkey_pick_read_device(c,
1181 bkey_i_to_s_c(&b->key),
1182 &failed, &rb->pick) > 0;
1184 if (!bio->bi_status &&
1185 !bch2_btree_node_read_done(c, ca, b, can_retry)) {
1187 bch_info(c, "retry success");
1194 set_btree_node_read_error(b);
1199 bch2_time_stats_update(&c->times[BCH_TIME_btree_node_read],
1202 printbuf_exit(&buf);
1204 if (saw_error && !btree_node_read_error(b))
1205 bch2_btree_node_rewrite_async(c, b);
1207 clear_btree_node_read_in_flight(b);
1208 wake_up_bit(&b->flags, BTREE_NODE_read_in_flight);
1211 static void btree_node_read_endio(struct bio *bio)
1213 struct btree_read_bio *rb =
1214 container_of(bio, struct btree_read_bio, bio);
1215 struct bch_fs *c = rb->c;
1217 if (rb->have_ioref) {
1218 struct bch_dev *ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1220 bch2_latency_acct(ca, rb->start_time, READ);
1223 queue_work(c->io_complete_wq, &rb->work);
1226 struct btree_node_read_all {
1231 void *buf[BCH_REPLICAS_MAX];
1232 struct bio *bio[BCH_REPLICAS_MAX];
1233 int err[BCH_REPLICAS_MAX];
1236 static unsigned btree_node_sectors_written(struct bch_fs *c, void *data)
1238 struct btree_node *bn = data;
1239 struct btree_node_entry *bne;
1240 unsigned offset = 0;
1242 if (le64_to_cpu(bn->magic) != bset_magic(c))
1245 while (offset < btree_sectors(c)) {
1247 offset += vstruct_sectors(bn, c->block_bits);
1249 bne = data + (offset << 9);
1250 if (bne->keys.seq != bn->keys.seq)
1252 offset += vstruct_sectors(bne, c->block_bits);
1259 static bool btree_node_has_extra_bsets(struct bch_fs *c, unsigned offset, void *data)
1261 struct btree_node *bn = data;
1262 struct btree_node_entry *bne;
1267 while (offset < btree_sectors(c)) {
1268 bne = data + (offset << 9);
1269 if (bne->keys.seq == bn->keys.seq)
1278 static void btree_node_read_all_replicas_done(struct closure *cl)
1280 struct btree_node_read_all *ra =
1281 container_of(cl, struct btree_node_read_all, cl);
1282 struct bch_fs *c = ra->c;
1283 struct btree *b = ra->b;
1284 struct printbuf buf = PRINTBUF;
1285 bool dump_bset_maps = false;
1286 bool have_retry = false;
1287 int ret = 0, best = -1, write = READ;
1288 unsigned i, written = 0, written2 = 0;
1289 __le64 seq = b->key.k.type == KEY_TYPE_btree_ptr_v2
1290 ? bkey_i_to_btree_ptr_v2(&b->key)->v.seq : 0;
1292 for (i = 0; i < ra->nr; i++) {
1293 struct btree_node *bn = ra->buf[i];
1298 if (le64_to_cpu(bn->magic) != bset_magic(c) ||
1299 (seq && seq != bn->keys.seq))
1304 written = btree_node_sectors_written(c, bn);
1308 written2 = btree_node_sectors_written(c, ra->buf[i]);
1309 if (btree_err_on(written2 != written, BTREE_ERR_FIXABLE, c, NULL, b, NULL,
1310 "btree node sectors written mismatch: %u != %u",
1311 written, written2) ||
1312 btree_err_on(btree_node_has_extra_bsets(c, written2, ra->buf[i]),
1313 BTREE_ERR_FIXABLE, c, NULL, b, NULL,
1314 "found bset signature after last bset") ||
1315 btree_err_on(memcmp(ra->buf[best], ra->buf[i], written << 9),
1316 BTREE_ERR_FIXABLE, c, NULL, b, NULL,
1317 "btree node replicas content mismatch"))
1318 dump_bset_maps = true;
1320 if (written2 > written) {
1326 if (dump_bset_maps) {
1327 for (i = 0; i < ra->nr; i++) {
1328 struct btree_node *bn = ra->buf[i];
1329 struct btree_node_entry *bne = NULL;
1330 unsigned offset = 0, sectors;
1336 printbuf_reset(&buf);
1338 while (offset < btree_sectors(c)) {
1340 sectors = vstruct_sectors(bn, c->block_bits);
1342 bne = ra->buf[i] + (offset << 9);
1343 if (bne->keys.seq != bn->keys.seq)
1345 sectors = vstruct_sectors(bne, c->block_bits);
1348 prt_printf(&buf, " %u-%u", offset, offset + sectors);
1349 if (bne && bch2_journal_seq_is_blacklisted(c,
1350 le64_to_cpu(bne->keys.journal_seq), false))
1351 prt_printf(&buf, "*");
1355 while (offset < btree_sectors(c)) {
1356 bne = ra->buf[i] + (offset << 9);
1357 if (bne->keys.seq == bn->keys.seq) {
1359 prt_printf(&buf, " GAP");
1362 sectors = vstruct_sectors(bne, c->block_bits);
1363 prt_printf(&buf, " %u-%u", offset, offset + sectors);
1364 if (bch2_journal_seq_is_blacklisted(c,
1365 le64_to_cpu(bne->keys.journal_seq), false))
1366 prt_printf(&buf, "*");
1371 bch_err(c, "replica %u:%s", i, buf.buf);
1376 memcpy(b->data, ra->buf[best], btree_bytes(c));
1377 ret = bch2_btree_node_read_done(c, NULL, b, false);
1383 set_btree_node_read_error(b);
1385 for (i = 0; i < ra->nr; i++) {
1386 mempool_free(ra->buf[i], &c->btree_bounce_pool);
1387 bio_put(ra->bio[i]);
1390 closure_debug_destroy(&ra->cl);
1392 printbuf_exit(&buf);
1394 clear_btree_node_read_in_flight(b);
1395 wake_up_bit(&b->flags, BTREE_NODE_read_in_flight);
1398 static void btree_node_read_all_replicas_endio(struct bio *bio)
1400 struct btree_read_bio *rb =
1401 container_of(bio, struct btree_read_bio, bio);
1402 struct bch_fs *c = rb->c;
1403 struct btree_node_read_all *ra = rb->ra;
1405 if (rb->have_ioref) {
1406 struct bch_dev *ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1408 bch2_latency_acct(ca, rb->start_time, READ);
1411 ra->err[rb->idx] = bio->bi_status;
1412 closure_put(&ra->cl);
1416 * XXX This allocates multiple times from the same mempools, and can deadlock
1417 * under sufficient memory pressure (but is only a debug path)
1419 static int btree_node_read_all_replicas(struct bch_fs *c, struct btree *b, bool sync)
1421 struct bkey_s_c k = bkey_i_to_s_c(&b->key);
1422 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
1423 const union bch_extent_entry *entry;
1424 struct extent_ptr_decoded pick;
1425 struct btree_node_read_all *ra;
1428 ra = kzalloc(sizeof(*ra), GFP_NOFS);
1432 closure_init(&ra->cl, NULL);
1435 ra->nr = bch2_bkey_nr_ptrs(k);
1437 for (i = 0; i < ra->nr; i++) {
1438 ra->buf[i] = mempool_alloc(&c->btree_bounce_pool, GFP_NOFS);
1439 ra->bio[i] = bio_alloc_bioset(NULL,
1440 buf_pages(ra->buf[i], btree_bytes(c)),
1441 REQ_OP_READ|REQ_SYNC|REQ_META,
1447 bkey_for_each_ptr_decode(k.k, ptrs, pick, entry) {
1448 struct bch_dev *ca = bch_dev_bkey_exists(c, pick.ptr.dev);
1449 struct btree_read_bio *rb =
1450 container_of(ra->bio[i], struct btree_read_bio, bio);
1454 rb->start_time = local_clock();
1455 rb->have_ioref = bch2_dev_get_ioref(ca, READ);
1458 rb->bio.bi_iter.bi_sector = pick.ptr.offset;
1459 rb->bio.bi_end_io = btree_node_read_all_replicas_endio;
1460 bch2_bio_map(&rb->bio, ra->buf[i], btree_bytes(c));
1462 if (rb->have_ioref) {
1463 this_cpu_add(ca->io_done->sectors[READ][BCH_DATA_btree],
1464 bio_sectors(&rb->bio));
1465 bio_set_dev(&rb->bio, ca->disk_sb.bdev);
1467 closure_get(&ra->cl);
1468 submit_bio(&rb->bio);
1470 ra->err[i] = BLK_STS_REMOVED;
1477 closure_sync(&ra->cl);
1478 btree_node_read_all_replicas_done(&ra->cl);
1480 continue_at(&ra->cl, btree_node_read_all_replicas_done,
1487 void bch2_btree_node_read(struct bch_fs *c, struct btree *b,
1490 struct extent_ptr_decoded pick;
1491 struct btree_read_bio *rb;
1496 trace_and_count(c, btree_node_read, c, b);
1498 if (bch2_verify_all_btree_replicas &&
1499 !btree_node_read_all_replicas(c, b, sync))
1502 ret = bch2_bkey_pick_read_device(c, bkey_i_to_s_c(&b->key),
1506 struct printbuf buf = PRINTBUF;
1508 prt_str(&buf, "btree node read error: no device to read from\n at ");
1509 btree_pos_to_text(&buf, c, b);
1510 bch_err(c, "%s", buf.buf);
1512 if (test_bit(BCH_FS_TOPOLOGY_REPAIR_DONE, &c->flags))
1513 bch2_fatal_error(c);
1515 set_btree_node_read_error(b);
1516 clear_btree_node_read_in_flight(b);
1517 wake_up_bit(&b->flags, BTREE_NODE_read_in_flight);
1518 printbuf_exit(&buf);
1522 ca = bch_dev_bkey_exists(c, pick.ptr.dev);
1524 bio = bio_alloc_bioset(NULL,
1525 buf_pages(b->data, btree_bytes(c)),
1526 REQ_OP_READ|REQ_SYNC|REQ_META,
1529 rb = container_of(bio, struct btree_read_bio, bio);
1533 rb->start_time = local_clock();
1534 rb->have_ioref = bch2_dev_get_ioref(ca, READ);
1536 INIT_WORK(&rb->work, btree_node_read_work);
1537 bio->bi_iter.bi_sector = pick.ptr.offset;
1538 bio->bi_end_io = btree_node_read_endio;
1539 bch2_bio_map(bio, b->data, btree_bytes(c));
1541 if (rb->have_ioref) {
1542 this_cpu_add(ca->io_done->sectors[READ][BCH_DATA_btree],
1544 bio_set_dev(bio, ca->disk_sb.bdev);
1547 submit_bio_wait(bio);
1549 btree_node_read_work(&rb->work);
1554 bio->bi_status = BLK_STS_REMOVED;
1557 btree_node_read_work(&rb->work);
1559 queue_work(c->io_complete_wq, &rb->work);
1563 int bch2_btree_root_read(struct bch_fs *c, enum btree_id id,
1564 const struct bkey_i *k, unsigned level)
1570 closure_init_stack(&cl);
1573 ret = bch2_btree_cache_cannibalize_lock(c, &cl);
1577 b = bch2_btree_node_mem_alloc(c, level != 0);
1578 bch2_btree_cache_cannibalize_unlock(c);
1582 bkey_copy(&b->key, k);
1583 BUG_ON(bch2_btree_node_hash_insert(&c->btree_cache, b, level, id));
1585 set_btree_node_read_in_flight(b);
1587 bch2_btree_node_read(c, b, true);
1589 if (btree_node_read_error(b)) {
1590 bch2_btree_node_hash_remove(&c->btree_cache, b);
1592 mutex_lock(&c->btree_cache.lock);
1593 list_move(&b->list, &c->btree_cache.freeable);
1594 mutex_unlock(&c->btree_cache.lock);
1600 bch2_btree_set_root_for_read(c, b);
1602 six_unlock_write(&b->c.lock);
1603 six_unlock_intent(&b->c.lock);
1608 void bch2_btree_complete_write(struct bch_fs *c, struct btree *b,
1609 struct btree_write *w)
1611 unsigned long old, new, v = READ_ONCE(b->will_make_reachable);
1619 } while ((v = cmpxchg(&b->will_make_reachable, old, new)) != old);
1622 closure_put(&((struct btree_update *) new)->cl);
1624 bch2_journal_pin_drop(&c->journal, &w->journal);
1627 static void __btree_node_write_done(struct bch_fs *c, struct btree *b)
1629 struct btree_write *w = btree_prev_write(b);
1630 unsigned long old, new, v;
1632 bch2_btree_complete_write(c, b, w);
1634 v = READ_ONCE(b->flags);
1638 if ((old & (1U << BTREE_NODE_dirty)) &&
1639 (old & (1U << BTREE_NODE_need_write)) &&
1640 !(old & (1U << BTREE_NODE_never_write)) &&
1641 !(old & (1U << BTREE_NODE_write_blocked)) &&
1642 !(old & (1U << BTREE_NODE_will_make_reachable))) {
1643 new &= ~(1U << BTREE_NODE_dirty);
1644 new &= ~(1U << BTREE_NODE_need_write);
1645 new |= (1U << BTREE_NODE_write_in_flight);
1646 new |= (1U << BTREE_NODE_write_in_flight_inner);
1647 new |= (1U << BTREE_NODE_just_written);
1648 new ^= (1U << BTREE_NODE_write_idx);
1650 new &= ~(1U << BTREE_NODE_write_in_flight);
1651 new &= ~(1U << BTREE_NODE_write_in_flight_inner);
1653 } while ((v = cmpxchg(&b->flags, old, new)) != old);
1655 if (new & (1U << BTREE_NODE_write_in_flight))
1656 __bch2_btree_node_write(c, b, BTREE_WRITE_ALREADY_STARTED);
1658 wake_up_bit(&b->flags, BTREE_NODE_write_in_flight);
1661 static void btree_node_write_done(struct bch_fs *c, struct btree *b)
1663 struct btree_trans trans;
1665 bch2_trans_init(&trans, c, 0, 0);
1667 btree_node_lock_nopath_nofail(&trans, &b->c, SIX_LOCK_read);
1668 __btree_node_write_done(c, b);
1669 six_unlock_read(&b->c.lock);
1671 bch2_trans_exit(&trans);
1674 static void btree_node_write_work(struct work_struct *work)
1676 struct btree_write_bio *wbio =
1677 container_of(work, struct btree_write_bio, work);
1678 struct bch_fs *c = wbio->wbio.c;
1679 struct btree *b = wbio->wbio.bio.bi_private;
1680 struct bch_extent_ptr *ptr;
1683 btree_bounce_free(c,
1685 wbio->wbio.used_mempool,
1688 bch2_bkey_drop_ptrs(bkey_i_to_s(&wbio->key), ptr,
1689 bch2_dev_list_has_dev(wbio->wbio.failed, ptr->dev));
1691 if (!bch2_bkey_nr_ptrs(bkey_i_to_s_c(&wbio->key)))
1694 if (wbio->wbio.first_btree_write) {
1695 if (wbio->wbio.failed.nr) {
1699 ret = bch2_trans_do(c, NULL, NULL, 0,
1700 bch2_btree_node_update_key_get_iter(&trans, b, &wbio->key,
1701 !wbio->wbio.failed.nr));
1706 bio_put(&wbio->wbio.bio);
1707 btree_node_write_done(c, b);
1710 set_btree_node_noevict(b);
1711 bch2_fs_fatal_error(c, "fatal error writing btree node");
1715 static void btree_node_write_endio(struct bio *bio)
1717 struct bch_write_bio *wbio = to_wbio(bio);
1718 struct bch_write_bio *parent = wbio->split ? wbio->parent : NULL;
1719 struct bch_write_bio *orig = parent ?: wbio;
1720 struct btree_write_bio *wb = container_of(orig, struct btree_write_bio, wbio);
1721 struct bch_fs *c = wbio->c;
1722 struct btree *b = wbio->bio.bi_private;
1723 struct bch_dev *ca = bch_dev_bkey_exists(c, wbio->dev);
1724 unsigned long flags;
1726 if (wbio->have_ioref)
1727 bch2_latency_acct(ca, wbio->submit_time, WRITE);
1729 if (bch2_dev_io_err_on(bio->bi_status, ca, "btree write error: %s",
1730 bch2_blk_status_to_str(bio->bi_status)) ||
1731 bch2_meta_write_fault("btree")) {
1732 spin_lock_irqsave(&c->btree_write_error_lock, flags);
1733 bch2_dev_list_add_dev(&orig->failed, wbio->dev);
1734 spin_unlock_irqrestore(&c->btree_write_error_lock, flags);
1737 if (wbio->have_ioref)
1738 percpu_ref_put(&ca->io_ref);
1742 bio_endio(&parent->bio);
1746 clear_btree_node_write_in_flight_inner(b);
1747 wake_up_bit(&b->flags, BTREE_NODE_write_in_flight_inner);
1748 INIT_WORK(&wb->work, btree_node_write_work);
1749 queue_work(c->btree_io_complete_wq, &wb->work);
1752 static int validate_bset_for_write(struct bch_fs *c, struct btree *b,
1753 struct bset *i, unsigned sectors)
1755 struct printbuf buf = PRINTBUF;
1758 ret = bch2_bkey_invalid(c, bkey_i_to_s_c(&b->key),
1759 BKEY_TYPE_btree, WRITE, &buf);
1762 bch2_fs_inconsistent(c, "invalid btree node key before write: %s", buf.buf);
1763 printbuf_exit(&buf);
1767 ret = validate_bset_keys(c, b, i, WRITE, false) ?:
1768 validate_bset(c, NULL, b, i, b->written, sectors, WRITE, false);
1770 bch2_inconsistent_error(c);
1777 static void btree_write_submit(struct work_struct *work)
1779 struct btree_write_bio *wbio = container_of(work, struct btree_write_bio, work);
1780 struct bch_extent_ptr *ptr;
1781 __BKEY_PADDED(k, BKEY_BTREE_PTR_VAL_U64s_MAX) tmp;
1783 bkey_copy(&tmp.k, &wbio->key);
1785 bkey_for_each_ptr(bch2_bkey_ptrs(bkey_i_to_s(&tmp.k)), ptr)
1786 ptr->offset += wbio->sector_offset;
1788 bch2_submit_wbio_replicas(&wbio->wbio, wbio->wbio.c, BCH_DATA_btree, &tmp.k);
1791 void __bch2_btree_node_write(struct bch_fs *c, struct btree *b, unsigned flags)
1793 struct btree_write_bio *wbio;
1794 struct bset_tree *t;
1796 struct btree_node *bn = NULL;
1797 struct btree_node_entry *bne = NULL;
1798 struct sort_iter sort_iter;
1800 unsigned bytes_to_write, sectors_to_write, bytes, u64s;
1803 unsigned long old, new;
1804 bool validate_before_checksum = false;
1808 if (flags & BTREE_WRITE_ALREADY_STARTED)
1812 * We may only have a read lock on the btree node - the dirty bit is our
1813 * "lock" against racing with other threads that may be trying to start
1814 * a write, we do a write iff we clear the dirty bit. Since setting the
1815 * dirty bit requires a write lock, we can't race with other threads
1819 old = new = READ_ONCE(b->flags);
1821 if (!(old & (1 << BTREE_NODE_dirty)))
1824 if ((flags & BTREE_WRITE_ONLY_IF_NEED) &&
1825 !(old & (1 << BTREE_NODE_need_write)))
1829 ((1 << BTREE_NODE_never_write)|
1830 (1 << BTREE_NODE_write_blocked)))
1834 (old & (1 << BTREE_NODE_will_make_reachable)))
1837 if (old & (1 << BTREE_NODE_write_in_flight))
1840 new &= ~(1 << BTREE_NODE_dirty);
1841 new &= ~(1 << BTREE_NODE_need_write);
1842 new |= (1 << BTREE_NODE_write_in_flight);
1843 new |= (1 << BTREE_NODE_write_in_flight_inner);
1844 new |= (1 << BTREE_NODE_just_written);
1845 new ^= (1 << BTREE_NODE_write_idx);
1846 } while (cmpxchg_acquire(&b->flags, old, new) != old);
1848 if (new & (1U << BTREE_NODE_need_write))
1851 atomic_dec(&c->btree_cache.dirty);
1853 BUG_ON(btree_node_fake(b));
1854 BUG_ON((b->will_make_reachable != 0) != !b->written);
1856 BUG_ON(b->written >= btree_sectors(c));
1857 BUG_ON(b->written & (block_sectors(c) - 1));
1858 BUG_ON(bset_written(b, btree_bset_last(b)));
1859 BUG_ON(le64_to_cpu(b->data->magic) != bset_magic(c));
1860 BUG_ON(memcmp(&b->data->format, &b->format, sizeof(b->format)));
1862 bch2_sort_whiteouts(c, b);
1864 sort_iter_init(&sort_iter, b);
1867 ? sizeof(struct btree_node)
1868 : sizeof(struct btree_node_entry);
1870 bytes += b->whiteout_u64s * sizeof(u64);
1872 for_each_bset(b, t) {
1875 if (bset_written(b, i))
1878 bytes += le16_to_cpu(i->u64s) * sizeof(u64);
1879 sort_iter_add(&sort_iter,
1880 btree_bkey_first(b, t),
1881 btree_bkey_last(b, t));
1882 seq = max(seq, le64_to_cpu(i->journal_seq));
1885 BUG_ON(b->written && !seq);
1887 /* bch2_varint_decode may read up to 7 bytes past the end of the buffer: */
1890 /* buffer must be a multiple of the block size */
1891 bytes = round_up(bytes, block_bytes(c));
1893 data = btree_bounce_alloc(c, bytes, &used_mempool);
1901 bne->keys = b->data->keys;
1905 i->journal_seq = cpu_to_le64(seq);
1908 sort_iter_add(&sort_iter,
1909 unwritten_whiteouts_start(c, b),
1910 unwritten_whiteouts_end(c, b));
1911 SET_BSET_SEPARATE_WHITEOUTS(i, false);
1913 b->whiteout_u64s = 0;
1915 u64s = bch2_sort_keys(i->start, &sort_iter, false);
1916 le16_add_cpu(&i->u64s, u64s);
1918 BUG_ON(!b->written && i->u64s != b->data->keys.u64s);
1920 set_needs_whiteout(i, false);
1922 /* do we have data to write? */
1923 if (b->written && !i->u64s)
1926 bytes_to_write = vstruct_end(i) - data;
1927 sectors_to_write = round_up(bytes_to_write, block_bytes(c)) >> 9;
1930 b->key.k.type == KEY_TYPE_btree_ptr_v2)
1931 BUG_ON(btree_ptr_sectors_written(&b->key) != sectors_to_write);
1933 memset(data + bytes_to_write, 0,
1934 (sectors_to_write << 9) - bytes_to_write);
1936 BUG_ON(b->written + sectors_to_write > btree_sectors(c));
1937 BUG_ON(BSET_BIG_ENDIAN(i) != CPU_BIG_ENDIAN);
1938 BUG_ON(i->seq != b->data->keys.seq);
1940 i->version = c->sb.version < bcachefs_metadata_version_bkey_renumber
1941 ? cpu_to_le16(BCH_BSET_VERSION_OLD)
1942 : cpu_to_le16(c->sb.version);
1943 SET_BSET_OFFSET(i, b->written);
1944 SET_BSET_CSUM_TYPE(i, bch2_meta_checksum_type(c));
1946 if (bch2_csum_type_is_encryption(BSET_CSUM_TYPE(i)))
1947 validate_before_checksum = true;
1949 /* validate_bset will be modifying: */
1950 if (le16_to_cpu(i->version) < bcachefs_metadata_version_current)
1951 validate_before_checksum = true;
1953 /* if we're going to be encrypting, check metadata validity first: */
1954 if (validate_before_checksum &&
1955 validate_bset_for_write(c, b, i, sectors_to_write))
1958 ret = bset_encrypt(c, i, b->written << 9);
1959 if (bch2_fs_fatal_err_on(ret, c,
1960 "error encrypting btree node: %i\n", ret))
1963 nonce = btree_nonce(i, b->written << 9);
1966 bn->csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bn);
1968 bne->csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bne);
1970 /* if we're not encrypting, check metadata after checksumming: */
1971 if (!validate_before_checksum &&
1972 validate_bset_for_write(c, b, i, sectors_to_write))
1976 * We handle btree write errors by immediately halting the journal -
1977 * after we've done that, we can't issue any subsequent btree writes
1978 * because they might have pointers to new nodes that failed to write.
1980 * Furthermore, there's no point in doing any more btree writes because
1981 * with the journal stopped, we're never going to update the journal to
1982 * reflect that those writes were done and the data flushed from the
1985 * Also on journal error, the pending write may have updates that were
1986 * never journalled (interior nodes, see btree_update_nodes_written()) -
1987 * it's critical that we don't do the write in that case otherwise we
1988 * will have updates visible that weren't in the journal:
1990 * Make sure to update b->written so bch2_btree_init_next() doesn't
1993 if (bch2_journal_error(&c->journal) ||
1997 trace_and_count(c, btree_node_write, b, bytes_to_write, sectors_to_write);
1999 wbio = container_of(bio_alloc_bioset(NULL,
2000 buf_pages(data, sectors_to_write << 9),
2001 REQ_OP_WRITE|REQ_META,
2004 struct btree_write_bio, wbio.bio);
2005 wbio_init(&wbio->wbio.bio);
2007 wbio->data_bytes = bytes;
2008 wbio->sector_offset = b->written;
2010 wbio->wbio.used_mempool = used_mempool;
2011 wbio->wbio.first_btree_write = !b->written;
2012 wbio->wbio.bio.bi_end_io = btree_node_write_endio;
2013 wbio->wbio.bio.bi_private = b;
2015 bch2_bio_map(&wbio->wbio.bio, data, sectors_to_write << 9);
2017 bkey_copy(&wbio->key, &b->key);
2019 b->written += sectors_to_write;
2021 if (wbio->key.k.type == KEY_TYPE_btree_ptr_v2)
2022 bkey_i_to_btree_ptr_v2(&wbio->key)->v.sectors_written =
2023 cpu_to_le16(b->written);
2025 atomic64_inc(&c->btree_writes_nr);
2026 atomic64_add(sectors_to_write, &c->btree_writes_sectors);
2028 INIT_WORK(&wbio->work, btree_write_submit);
2029 queue_work(c->io_complete_wq, &wbio->work);
2032 set_btree_node_noevict(b);
2033 b->written += sectors_to_write;
2035 btree_bounce_free(c, bytes, used_mempool, data);
2036 __btree_node_write_done(c, b);
2040 * Work that must be done with write lock held:
2042 bool bch2_btree_post_write_cleanup(struct bch_fs *c, struct btree *b)
2044 bool invalidated_iter = false;
2045 struct btree_node_entry *bne;
2046 struct bset_tree *t;
2048 if (!btree_node_just_written(b))
2051 BUG_ON(b->whiteout_u64s);
2053 clear_btree_node_just_written(b);
2056 * Note: immediately after write, bset_written() doesn't work - the
2057 * amount of data we had to write after compaction might have been
2058 * smaller than the offset of the last bset.
2060 * However, we know that all bsets have been written here, as long as
2061 * we're still holding the write lock:
2065 * XXX: decide if we really want to unconditionally sort down to a
2069 btree_node_sort(c, b, 0, b->nsets, true);
2070 invalidated_iter = true;
2072 invalidated_iter = bch2_drop_whiteouts(b, COMPACT_ALL);
2076 set_needs_whiteout(bset(b, t), true);
2078 bch2_btree_verify(c, b);
2081 * If later we don't unconditionally sort down to a single bset, we have
2082 * to ensure this is still true:
2084 BUG_ON((void *) btree_bkey_last(b, bset_tree_last(b)) > write_block(b));
2086 bne = want_new_bset(c, b);
2088 bch2_bset_init_next(c, b, bne);
2090 bch2_btree_build_aux_trees(b);
2092 return invalidated_iter;
2096 * Use this one if the node is intent locked:
2098 void bch2_btree_node_write(struct bch_fs *c, struct btree *b,
2099 enum six_lock_type lock_type_held,
2102 if (lock_type_held == SIX_LOCK_intent ||
2103 (lock_type_held == SIX_LOCK_read &&
2104 six_lock_tryupgrade(&b->c.lock))) {
2105 __bch2_btree_node_write(c, b, flags);
2107 /* don't cycle lock unnecessarily: */
2108 if (btree_node_just_written(b) &&
2109 six_trylock_write(&b->c.lock)) {
2110 bch2_btree_post_write_cleanup(c, b);
2111 six_unlock_write(&b->c.lock);
2114 if (lock_type_held == SIX_LOCK_read)
2115 six_lock_downgrade(&b->c.lock);
2117 __bch2_btree_node_write(c, b, flags);
2118 if (lock_type_held == SIX_LOCK_write &&
2119 btree_node_just_written(b))
2120 bch2_btree_post_write_cleanup(c, b);
2124 static bool __bch2_btree_flush_all(struct bch_fs *c, unsigned flag)
2126 struct bucket_table *tbl;
2127 struct rhash_head *pos;
2133 for_each_cached_btree(b, c, tbl, i, pos)
2134 if (test_bit(flag, &b->flags)) {
2136 wait_on_bit_io(&b->flags, flag, TASK_UNINTERRUPTIBLE);
2145 bool bch2_btree_flush_all_reads(struct bch_fs *c)
2147 return __bch2_btree_flush_all(c, BTREE_NODE_read_in_flight);
2150 bool bch2_btree_flush_all_writes(struct bch_fs *c)
2152 return __bch2_btree_flush_all(c, BTREE_NODE_write_in_flight);