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 static void verify_no_dups(struct btree *b,
26 struct bkey_packed *start,
27 struct bkey_packed *end,
30 #ifdef CONFIG_BCACHEFS_DEBUG
31 struct bkey_packed *k, *p;
36 for (p = start, k = bkey_next_skip_noops(start, end);
38 p = k, k = bkey_next_skip_noops(k, end)) {
39 struct bkey l = bkey_unpack_key(b, p);
40 struct bkey r = bkey_unpack_key(b, k);
43 ? bkey_cmp(l.p, bkey_start_pos(&r)) > 0
44 : bkey_cmp(l.p, bkey_start_pos(&r)) >= 0);
45 //BUG_ON(bkey_cmp_packed(&b->format, p, k) >= 0);
50 static void set_needs_whiteout(struct bset *i, int v)
52 struct bkey_packed *k;
56 k = bkey_next_skip_noops(k, vstruct_last(i)))
57 k->needs_whiteout = v;
60 static void btree_bounce_free(struct bch_fs *c, size_t size,
61 bool used_mempool, void *p)
64 mempool_free(p, &c->btree_bounce_pool);
69 static void *btree_bounce_alloc(struct bch_fs *c, size_t size,
72 unsigned flags = memalloc_nofs_save();
75 BUG_ON(size > btree_bytes(c));
77 *used_mempool = false;
78 p = vpmalloc(size, __GFP_NOWARN|GFP_NOWAIT);
81 p = mempool_alloc(&c->btree_bounce_pool, GFP_NOIO);
83 memalloc_nofs_restore(flags);
87 static void sort_bkey_ptrs(const struct btree *bt,
88 struct bkey_packed **ptrs, unsigned nr)
90 unsigned n = nr, a = nr / 2, b, c, d;
95 /* Heap sort: see lib/sort.c: */
100 swap(ptrs[0], ptrs[n]);
104 for (b = a; c = 2 * b + 1, (d = c + 1) < n;)
105 b = bkey_cmp_packed(bt,
107 ptrs[d]) >= 0 ? c : d;
119 swap(ptrs[b], ptrs[c]);
124 static void bch2_sort_whiteouts(struct bch_fs *c, struct btree *b)
126 struct bkey_packed *new_whiteouts, **ptrs, **ptrs_end, *k;
127 bool used_mempool = false;
128 size_t bytes = b->whiteout_u64s * sizeof(u64);
130 if (!b->whiteout_u64s)
133 new_whiteouts = btree_bounce_alloc(c, bytes, &used_mempool);
135 ptrs = ptrs_end = ((void *) new_whiteouts + bytes);
137 for (k = unwritten_whiteouts_start(c, b);
138 k != unwritten_whiteouts_end(c, b);
142 sort_bkey_ptrs(b, ptrs, ptrs_end - ptrs);
146 while (ptrs != ptrs_end) {
152 verify_no_dups(b, new_whiteouts,
153 (void *) ((u64 *) new_whiteouts + b->whiteout_u64s),
154 btree_node_old_extent_overwrite(b));
156 memcpy_u64s(unwritten_whiteouts_start(c, b),
157 new_whiteouts, b->whiteout_u64s);
159 btree_bounce_free(c, bytes, used_mempool, new_whiteouts);
162 static bool should_compact_bset(struct btree *b, struct bset_tree *t,
163 bool compacting, enum compact_mode mode)
165 if (!bset_dead_u64s(b, t))
170 return should_compact_bset_lazy(b, t) ||
171 (compacting && !bset_written(b, bset(b, t)));
179 static bool bch2_compact_extent_whiteouts(struct bch_fs *c,
181 enum compact_mode mode)
183 const struct bkey_format *f = &b->format;
185 struct bkey_packed *whiteouts = NULL;
186 struct bkey_packed *u_start, *u_pos;
187 struct sort_iter sort_iter;
188 unsigned bytes, whiteout_u64s = 0, u64s;
189 bool used_mempool, compacting = false;
191 BUG_ON(!btree_node_is_extents(b));
194 if (should_compact_bset(b, t, whiteout_u64s != 0, mode))
195 whiteout_u64s += bset_dead_u64s(b, t);
200 bch2_sort_whiteouts(c, b);
202 sort_iter_init(&sort_iter, b);
204 whiteout_u64s += b->whiteout_u64s;
205 bytes = whiteout_u64s * sizeof(u64);
207 whiteouts = btree_bounce_alloc(c, bytes, &used_mempool);
208 u_start = u_pos = whiteouts;
210 memcpy_u64s(u_pos, unwritten_whiteouts_start(c, b),
212 u_pos = (void *) u_pos + b->whiteout_u64s * sizeof(u64);
214 sort_iter_add(&sort_iter, u_start, u_pos);
216 for_each_bset(b, t) {
217 struct bset *i = bset(b, t);
218 struct bkey_packed *k, *n, *out, *start, *end;
219 struct btree_node_entry *src = NULL, *dst = NULL;
221 if (t != b->set && !bset_written(b, i)) {
222 src = container_of(i, struct btree_node_entry, keys);
223 dst = max(write_block(b),
224 (void *) btree_bkey_last(b, t - 1));
230 if (!should_compact_bset(b, t, compacting, mode)) {
232 memmove(dst, src, sizeof(*src) +
233 le16_to_cpu(src->keys.u64s) *
236 set_btree_bset(b, t, i);
244 end = vstruct_last(i);
247 memmove(dst, src, sizeof(*src));
249 set_btree_bset(b, t, i);
254 for (k = start; k != end; k = n) {
255 n = bkey_next_skip_noops(k, end);
260 BUG_ON(bkey_whiteout(k) &&
264 if (bkey_whiteout(k) && !k->needs_whiteout)
267 if (bkey_whiteout(k)) {
268 memcpy_u64s(u_pos, k, bkeyp_key_u64s(f, k));
269 set_bkeyp_val_u64s(f, u_pos, 0);
270 u_pos = bkey_next(u_pos);
273 out = bkey_next(out);
277 sort_iter_add(&sort_iter, u_start, u_pos);
279 i->u64s = cpu_to_le16((u64 *) out - i->_data);
280 set_btree_bset_end(b, t);
281 bch2_bset_set_no_aux_tree(b, t);
284 b->whiteout_u64s = (u64 *) u_pos - (u64 *) whiteouts;
286 BUG_ON((void *) unwritten_whiteouts_start(c, b) <
287 (void *) btree_bkey_last(b, bset_tree_last(b)));
289 u64s = bch2_sort_extent_whiteouts(unwritten_whiteouts_start(c, b),
292 BUG_ON(u64s > b->whiteout_u64s);
293 BUG_ON(u_pos != whiteouts && !u64s);
295 if (u64s != b->whiteout_u64s) {
296 void *src = unwritten_whiteouts_start(c, b);
298 b->whiteout_u64s = u64s;
299 memmove_u64s_up(unwritten_whiteouts_start(c, b), src, u64s);
303 unwritten_whiteouts_start(c, b),
304 unwritten_whiteouts_end(c, b),
307 btree_bounce_free(c, bytes, used_mempool, whiteouts);
309 bch2_btree_build_aux_trees(b);
311 bch_btree_keys_u64s_remaining(c, b);
312 bch2_verify_btree_nr_keys(b);
317 static bool bch2_drop_whiteouts(struct btree *b, enum compact_mode mode)
322 for_each_bset(b, t) {
323 struct bset *i = bset(b, t);
324 struct bkey_packed *k, *n, *out, *start, *end;
325 struct btree_node_entry *src = NULL, *dst = NULL;
327 if (t != b->set && !bset_written(b, i)) {
328 src = container_of(i, struct btree_node_entry, keys);
329 dst = max(write_block(b),
330 (void *) btree_bkey_last(b, t - 1));
336 if (!should_compact_bset(b, t, ret, mode)) {
338 memmove(dst, src, sizeof(*src) +
339 le16_to_cpu(src->keys.u64s) *
342 set_btree_bset(b, t, i);
347 start = btree_bkey_first(b, t);
348 end = btree_bkey_last(b, t);
351 memmove(dst, src, sizeof(*src));
353 set_btree_bset(b, t, i);
358 for (k = start; k != end; k = n) {
359 n = bkey_next_skip_noops(k, end);
361 if (!bkey_whiteout(k)) {
363 out = bkey_next(out);
365 BUG_ON(k->needs_whiteout);
369 i->u64s = cpu_to_le16((u64 *) out - i->_data);
370 set_btree_bset_end(b, t);
371 bch2_bset_set_no_aux_tree(b, t);
375 bch2_verify_btree_nr_keys(b);
377 bch2_btree_build_aux_trees(b);
382 bool bch2_compact_whiteouts(struct bch_fs *c, struct btree *b,
383 enum compact_mode mode)
385 return !btree_node_old_extent_overwrite(b)
386 ? bch2_drop_whiteouts(b, mode)
387 : bch2_compact_extent_whiteouts(c, b, mode);
390 static void btree_node_sort(struct bch_fs *c, struct btree *b,
391 struct btree_iter *iter,
394 bool filter_whiteouts)
396 struct btree_node *out;
397 struct sort_iter sort_iter;
399 struct bset *start_bset = bset(b, &b->set[start_idx]);
400 bool used_mempool = false;
401 u64 start_time, seq = 0;
402 unsigned i, u64s = 0, bytes, shift = end_idx - start_idx - 1;
403 bool sorting_entire_node = start_idx == 0 &&
406 sort_iter_init(&sort_iter, b);
408 for (t = b->set + start_idx;
409 t < b->set + end_idx;
411 u64s += le16_to_cpu(bset(b, t)->u64s);
412 sort_iter_add(&sort_iter,
413 btree_bkey_first(b, t),
414 btree_bkey_last(b, t));
417 bytes = sorting_entire_node
419 : __vstruct_bytes(struct btree_node, u64s);
421 out = btree_bounce_alloc(c, bytes, &used_mempool);
423 start_time = local_clock();
425 if (btree_node_old_extent_overwrite(b))
426 filter_whiteouts = bset_written(b, start_bset);
428 u64s = (btree_node_old_extent_overwrite(b)
430 : bch2_sort_keys)(out->keys.start,
434 out->keys.u64s = cpu_to_le16(u64s);
436 BUG_ON(vstruct_end(&out->keys) > (void *) out + bytes);
438 if (sorting_entire_node)
439 bch2_time_stats_update(&c->times[BCH_TIME_btree_node_sort],
442 /* Make sure we preserve bset journal_seq: */
443 for (t = b->set + start_idx; t < b->set + end_idx; t++)
444 seq = max(seq, le64_to_cpu(bset(b, t)->journal_seq));
445 start_bset->journal_seq = cpu_to_le64(seq);
447 if (sorting_entire_node) {
448 unsigned u64s = le16_to_cpu(out->keys.u64s);
450 BUG_ON(bytes != btree_bytes(c));
453 * Our temporary buffer is the same size as the btree node's
454 * buffer, we can just swap buffers instead of doing a big
458 out->keys.u64s = cpu_to_le16(u64s);
460 set_btree_bset(b, b->set, &b->data->keys);
462 start_bset->u64s = out->keys.u64s;
463 memcpy_u64s(start_bset->start,
465 le16_to_cpu(out->keys.u64s));
468 for (i = start_idx + 1; i < end_idx; i++)
469 b->nr.bset_u64s[start_idx] +=
474 for (i = start_idx + 1; i < b->nsets; i++) {
475 b->nr.bset_u64s[i] = b->nr.bset_u64s[i + shift];
476 b->set[i] = b->set[i + shift];
479 for (i = b->nsets; i < MAX_BSETS; i++)
480 b->nr.bset_u64s[i] = 0;
482 set_btree_bset_end(b, &b->set[start_idx]);
483 bch2_bset_set_no_aux_tree(b, &b->set[start_idx]);
485 btree_bounce_free(c, bytes, used_mempool, out);
487 bch2_verify_btree_nr_keys(b);
490 void bch2_btree_sort_into(struct bch_fs *c,
494 struct btree_nr_keys nr;
495 struct btree_node_iter src_iter;
496 u64 start_time = local_clock();
498 BUG_ON(dst->nsets != 1);
500 bch2_bset_set_no_aux_tree(dst, dst->set);
502 bch2_btree_node_iter_init_from_start(&src_iter, src);
504 if (btree_node_is_extents(src))
505 nr = bch2_sort_repack_merge(c, btree_bset_first(dst),
510 nr = bch2_sort_repack(btree_bset_first(dst),
515 bch2_time_stats_update(&c->times[BCH_TIME_btree_node_sort],
518 set_btree_bset_end(dst, dst->set);
520 dst->nr.live_u64s += nr.live_u64s;
521 dst->nr.bset_u64s[0] += nr.bset_u64s[0];
522 dst->nr.packed_keys += nr.packed_keys;
523 dst->nr.unpacked_keys += nr.unpacked_keys;
525 bch2_verify_btree_nr_keys(dst);
528 #define SORT_CRIT (4096 / sizeof(u64))
531 * We're about to add another bset to the btree node, so if there's currently
532 * too many bsets - sort some of them together:
534 static bool btree_node_compact(struct bch_fs *c, struct btree *b,
535 struct btree_iter *iter)
537 unsigned unwritten_idx;
540 for (unwritten_idx = 0;
541 unwritten_idx < b->nsets;
543 if (!bset_written(b, bset(b, &b->set[unwritten_idx])))
546 if (b->nsets - unwritten_idx > 1) {
547 btree_node_sort(c, b, iter, unwritten_idx,
552 if (unwritten_idx > 1) {
553 btree_node_sort(c, b, iter, 0, unwritten_idx, false);
560 void bch2_btree_build_aux_trees(struct btree *b)
565 bch2_bset_build_aux_tree(b, t,
566 !bset_written(b, bset(b, t)) &&
567 t == bset_tree_last(b));
571 * @bch_btree_init_next - initialize a new (unwritten) bset that can then be
574 * Safe to call if there already is an unwritten bset - will only add a new bset
575 * if @b doesn't already have one.
577 * Returns true if we sorted (i.e. invalidated iterators
579 void bch2_btree_init_next(struct bch_fs *c, struct btree *b,
580 struct btree_iter *iter)
582 struct btree_node_entry *bne;
585 EBUG_ON(!(b->c.lock.state.seq & 1));
586 EBUG_ON(iter && iter->l[b->c.level].b != b);
588 did_sort = btree_node_compact(c, b, iter);
590 bne = want_new_bset(c, b);
592 bch2_bset_init_next(c, b, bne);
594 bch2_btree_build_aux_trees(b);
596 if (iter && did_sort)
597 bch2_btree_iter_reinit_node(iter, b);
600 static void btree_err_msg(struct printbuf *out, struct bch_fs *c,
601 struct btree *b, struct bset *i,
602 unsigned offset, int write)
604 pr_buf(out, "error validating btree node %sat btree %u level %u/%u\n"
606 write ? "before write " : "",
607 b->c.btree_id, b->c.level,
608 c->btree_roots[b->c.btree_id].level);
609 bch2_bkey_val_to_text(out, c, bkey_i_to_s_c(&b->key));
611 pr_buf(out, " node offset %u", b->written);
613 pr_buf(out, " bset u64s %u", le16_to_cpu(i->u64s));
616 enum btree_err_type {
618 BTREE_ERR_WANT_RETRY,
619 BTREE_ERR_MUST_RETRY,
623 enum btree_validate_ret {
624 BTREE_RETRY_READ = 64,
627 #define btree_err(type, c, b, i, msg, ...) \
631 struct printbuf out = PBUF(_buf); \
633 btree_err_msg(&out, c, b, i, b->written, write); \
634 pr_buf(&out, ": " msg, ##__VA_ARGS__); \
636 if (type == BTREE_ERR_FIXABLE && \
638 !test_bit(BCH_FS_INITIAL_GC_DONE, &c->flags)) { \
639 mustfix_fsck_err(c, "%s", _buf); \
645 bch_err(c, "%s", _buf); \
648 case BTREE_ERR_FIXABLE: \
649 ret = BCH_FSCK_ERRORS_NOT_FIXED; \
651 case BTREE_ERR_WANT_RETRY: \
653 ret = BTREE_RETRY_READ; \
657 case BTREE_ERR_MUST_RETRY: \
658 ret = BTREE_RETRY_READ; \
660 case BTREE_ERR_FATAL: \
661 ret = BCH_FSCK_ERRORS_NOT_FIXED; \
666 bch_err(c, "corrupt metadata before write: %s", _buf); \
668 if (bch2_fs_inconsistent(c)) { \
669 ret = BCH_FSCK_ERRORS_NOT_FIXED; \
678 #define btree_err_on(cond, ...) ((cond) ? btree_err(__VA_ARGS__) : false)
680 static int validate_bset(struct bch_fs *c, struct btree *b,
681 struct bset *i, unsigned sectors,
682 int write, bool have_retry)
684 unsigned version = le16_to_cpu(i->version);
688 btree_err_on((version != BCH_BSET_VERSION_OLD &&
689 version < bcachefs_metadata_version_min) ||
690 version >= bcachefs_metadata_version_max,
691 BTREE_ERR_FATAL, c, b, i,
692 "unsupported bset version");
694 if (btree_err_on(b->written + sectors > c->opts.btree_node_size,
695 BTREE_ERR_FIXABLE, c, b, i,
696 "bset past end of btree node")) {
701 btree_err_on(b->written && !i->u64s,
702 BTREE_ERR_FIXABLE, c, b, i,
706 struct btree_node *bn =
707 container_of(i, struct btree_node, keys);
708 /* These indicate that we read the wrong btree node: */
710 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
711 struct bch_btree_ptr_v2 *bp =
712 &bkey_i_to_btree_ptr_v2(&b->key)->v;
715 btree_err_on(bp->seq != bn->keys.seq,
716 BTREE_ERR_MUST_RETRY, c, b, NULL,
717 "incorrect sequence number (wrong btree node)");
720 btree_err_on(BTREE_NODE_ID(bn) != b->c.btree_id,
721 BTREE_ERR_MUST_RETRY, c, b, i,
722 "incorrect btree id");
724 btree_err_on(BTREE_NODE_LEVEL(bn) != b->c.level,
725 BTREE_ERR_MUST_RETRY, c, b, i,
728 if (BSET_BIG_ENDIAN(i) != CPU_BIG_ENDIAN) {
729 u64 *p = (u64 *) &bn->ptr;
735 compat_btree_node(b->c.level, b->c.btree_id, version,
736 BSET_BIG_ENDIAN(i), write, bn);
738 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
739 struct bch_btree_ptr_v2 *bp =
740 &bkey_i_to_btree_ptr_v2(&b->key)->v;
742 btree_err_on(bkey_cmp(b->data->min_key, bp->min_key),
743 BTREE_ERR_MUST_RETRY, c, b, NULL,
744 "incorrect min_key: got %llu:%llu should be %llu:%llu",
745 b->data->min_key.inode,
746 b->data->min_key.offset,
751 btree_err_on(bkey_cmp(bn->max_key, b->key.k.p),
752 BTREE_ERR_MUST_RETRY, c, b, i,
753 "incorrect max key %llu:%llu",
758 compat_btree_node(b->c.level, b->c.btree_id, version,
759 BSET_BIG_ENDIAN(i), write, bn);
761 /* XXX: ideally we would be validating min_key too */
764 * not correct anymore, due to btree node write error
767 * need to add bn->seq to btree keys and verify
770 btree_err_on(!extent_contains_ptr(bkey_i_to_s_c_extent(&b->key),
772 BTREE_ERR_FATAL, c, b, i,
773 "incorrect backpointer");
775 err = bch2_bkey_format_validate(&bn->format);
777 BTREE_ERR_FATAL, c, b, i,
778 "invalid bkey format: %s", err);
780 compat_bformat(b->c.level, b->c.btree_id, version,
781 BSET_BIG_ENDIAN(i), write,
788 static int validate_bset_keys(struct bch_fs *c, struct btree *b,
789 struct bset *i, unsigned *whiteout_u64s,
790 int write, bool have_retry)
792 unsigned version = le16_to_cpu(i->version);
793 struct bkey_packed *k, *prev = NULL;
794 bool seen_non_whiteout = false;
797 if (!BSET_SEPARATE_WHITEOUTS(i)) {
798 seen_non_whiteout = true;
803 k != vstruct_last(i);) {
808 if (btree_err_on(bkey_next(k) > vstruct_last(i),
809 BTREE_ERR_FIXABLE, c, b, i,
810 "key extends past end of bset")) {
811 i->u64s = cpu_to_le16((u64 *) k - i->_data);
815 if (btree_err_on(k->format > KEY_FORMAT_CURRENT,
816 BTREE_ERR_FIXABLE, c, b, i,
817 "invalid bkey format %u", k->format)) {
818 i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
819 memmove_u64s_down(k, bkey_next(k),
820 (u64 *) vstruct_end(i) - (u64 *) k);
824 /* XXX: validate k->u64s */
826 bch2_bkey_compat(b->c.level, b->c.btree_id, version,
827 BSET_BIG_ENDIAN(i), write,
830 u = __bkey_disassemble(b, k, &tmp);
832 invalid = __bch2_bkey_invalid(c, u.s_c, btree_node_type(b)) ?:
833 bch2_bkey_in_btree_node(b, u.s_c) ?:
834 (write ? bch2_bkey_val_invalid(c, u.s_c) : NULL);
838 bch2_bkey_val_to_text(&PBUF(buf), c, u.s_c);
839 btree_err(BTREE_ERR_FIXABLE, c, b, i,
840 "invalid bkey:\n%s\n%s", invalid, buf);
842 i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
843 memmove_u64s_down(k, bkey_next(k),
844 (u64 *) vstruct_end(i) - (u64 *) k);
849 bch2_bkey_compat(b->c.level, b->c.btree_id, version,
850 BSET_BIG_ENDIAN(i), write,
854 * with the separate whiteouts thing (used for extents), the
855 * second set of keys actually can have whiteouts too, so we
856 * can't solely go off bkey_whiteout()...
859 if (!seen_non_whiteout &&
860 (!bkey_whiteout(k) ||
861 (prev && bkey_iter_cmp(b, prev, k) > 0))) {
862 *whiteout_u64s = k->_data - i->_data;
863 seen_non_whiteout = true;
864 } else if (prev && bkey_iter_cmp(b, prev, k) > 0) {
867 struct bkey up = bkey_unpack_key(b, prev);
869 bch2_bkey_to_text(&PBUF(buf1), &up);
870 bch2_bkey_to_text(&PBUF(buf2), u.k);
872 bch2_dump_bset(c, b, i, 0);
873 btree_err(BTREE_ERR_FATAL, c, b, i,
874 "keys out of order: %s > %s",
876 /* XXX: repair this */
880 k = bkey_next_skip_noops(k, vstruct_last(i));
886 int bch2_btree_node_read_done(struct bch_fs *c, struct btree *b, bool have_retry)
888 struct btree_node_entry *bne;
889 struct sort_iter *iter;
890 struct btree_node *sorted;
891 struct bkey_packed *k;
892 struct bch_extent_ptr *ptr;
894 bool used_mempool, blacklisted;
896 int ret, retry_read = 0, write = READ;
898 iter = mempool_alloc(&c->fill_iter, GFP_NOIO);
899 sort_iter_init(iter, b);
900 iter->size = (btree_blocks(c) + 1) * 2;
902 if (bch2_meta_read_fault("btree"))
903 btree_err(BTREE_ERR_MUST_RETRY, c, b, NULL,
906 btree_err_on(le64_to_cpu(b->data->magic) != bset_magic(c),
907 BTREE_ERR_MUST_RETRY, c, b, NULL,
910 btree_err_on(!b->data->keys.seq,
911 BTREE_ERR_MUST_RETRY, c, b, NULL,
914 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
915 struct bch_btree_ptr_v2 *bp =
916 &bkey_i_to_btree_ptr_v2(&b->key)->v;
918 btree_err_on(b->data->keys.seq != bp->seq,
919 BTREE_ERR_MUST_RETRY, c, b, NULL,
920 "got wrong btree node (seq %llx want %llx)",
921 b->data->keys.seq, bp->seq);
924 while (b->written < c->opts.btree_node_size) {
925 unsigned sectors, whiteout_u64s = 0;
927 struct bch_csum csum;
928 bool first = !b->written;
933 btree_err_on(!bch2_checksum_type_valid(c, BSET_CSUM_TYPE(i)),
934 BTREE_ERR_WANT_RETRY, c, b, i,
935 "unknown checksum type %llu",
938 nonce = btree_nonce(i, b->written << 9);
939 csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, b->data);
941 btree_err_on(bch2_crc_cmp(csum, b->data->csum),
942 BTREE_ERR_WANT_RETRY, c, b, i,
945 bset_encrypt(c, i, b->written << 9);
947 if (btree_node_is_extents(b) &&
948 !BTREE_NODE_NEW_EXTENT_OVERWRITE(b->data)) {
949 set_btree_node_old_extent_overwrite(b);
950 set_btree_node_need_rewrite(b);
953 sectors = vstruct_sectors(b->data, c->block_bits);
955 bne = write_block(b);
958 if (i->seq != b->data->keys.seq)
961 btree_err_on(!bch2_checksum_type_valid(c, BSET_CSUM_TYPE(i)),
962 BTREE_ERR_WANT_RETRY, c, b, i,
963 "unknown checksum type %llu",
966 nonce = btree_nonce(i, b->written << 9);
967 csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bne);
969 btree_err_on(bch2_crc_cmp(csum, bne->csum),
970 BTREE_ERR_WANT_RETRY, c, b, i,
973 bset_encrypt(c, i, b->written << 9);
975 sectors = vstruct_sectors(bne, c->block_bits);
978 ret = validate_bset(c, b, i, sectors,
984 btree_node_set_format(b, b->data->format);
986 ret = validate_bset_keys(c, b, i, &whiteout_u64s,
991 SET_BSET_BIG_ENDIAN(i, CPU_BIG_ENDIAN);
993 b->written += sectors;
995 blacklisted = bch2_journal_seq_is_blacklisted(c,
996 le64_to_cpu(i->journal_seq),
999 btree_err_on(blacklisted && first,
1000 BTREE_ERR_FIXABLE, c, b, i,
1001 "first btree node bset has blacklisted journal seq");
1002 if (blacklisted && !first)
1005 sort_iter_add(iter, i->start,
1006 vstruct_idx(i, whiteout_u64s));
1009 vstruct_idx(i, whiteout_u64s),
1013 for (bne = write_block(b);
1014 bset_byte_offset(b, bne) < btree_bytes(c);
1015 bne = (void *) bne + block_bytes(c))
1016 btree_err_on(bne->keys.seq == b->data->keys.seq,
1017 BTREE_ERR_WANT_RETRY, c, b, NULL,
1018 "found bset signature after last bset");
1020 sorted = btree_bounce_alloc(c, btree_bytes(c), &used_mempool);
1021 sorted->keys.u64s = 0;
1023 set_btree_bset(b, b->set, &b->data->keys);
1025 b->nr = (btree_node_old_extent_overwrite(b)
1026 ? bch2_extent_sort_fix_overlapping
1027 : bch2_key_sort_fix_overlapping)(c, &sorted->keys, iter);
1029 u64s = le16_to_cpu(sorted->keys.u64s);
1031 sorted->keys.u64s = cpu_to_le16(u64s);
1032 swap(sorted, b->data);
1033 set_btree_bset(b, b->set, &b->data->keys);
1036 BUG_ON(b->nr.live_u64s != u64s);
1038 btree_bounce_free(c, btree_bytes(c), used_mempool, sorted);
1041 for (k = i->start; k != vstruct_last(i);) {
1043 struct bkey_s u = __bkey_disassemble(b, k, &tmp);
1044 const char *invalid = bch2_bkey_val_invalid(c, u.s_c);
1047 (inject_invalid_keys(c) &&
1048 !bversion_cmp(u.k->version, MAX_VERSION))) {
1051 bch2_bkey_val_to_text(&PBUF(buf), c, u.s_c);
1052 btree_err(BTREE_ERR_FIXABLE, c, b, i,
1053 "invalid bkey %s: %s", buf, invalid);
1055 btree_keys_account_key_drop(&b->nr, 0, k);
1057 i->u64s = cpu_to_le16(le16_to_cpu(i->u64s) - k->u64s);
1058 memmove_u64s_down(k, bkey_next(k),
1059 (u64 *) vstruct_end(i) - (u64 *) k);
1060 set_btree_bset_end(b, b->set);
1064 if (u.k->type == KEY_TYPE_btree_ptr_v2) {
1065 struct bkey_s_btree_ptr_v2 bp = bkey_s_to_btree_ptr_v2(u);
1070 k = bkey_next_skip_noops(k, vstruct_last(i));
1073 bch2_bset_build_aux_tree(b, b->set, false);
1075 set_needs_whiteout(btree_bset_first(b), true);
1077 btree_node_reset_sib_u64s(b);
1079 bkey_for_each_ptr(bch2_bkey_ptrs(bkey_i_to_s(&b->key)), ptr) {
1080 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
1082 if (ca->mi.state != BCH_MEMBER_STATE_RW)
1083 set_btree_node_need_rewrite(b);
1086 mempool_free(iter, &c->fill_iter);
1089 if (ret == BTREE_RETRY_READ) {
1092 bch2_inconsistent_error(c);
1093 set_btree_node_read_error(b);
1098 static void btree_node_read_work(struct work_struct *work)
1100 struct btree_read_bio *rb =
1101 container_of(work, struct btree_read_bio, work);
1102 struct bch_fs *c = rb->c;
1103 struct bch_dev *ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1104 struct btree *b = rb->bio.bi_private;
1105 struct bio *bio = &rb->bio;
1106 struct bch_io_failures failed = { .nr = 0 };
1111 bch_info(c, "retrying read");
1112 ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1113 rb->have_ioref = bch2_dev_get_ioref(ca, READ);
1115 bio->bi_opf = REQ_OP_READ|REQ_SYNC|REQ_META;
1116 bio->bi_iter.bi_sector = rb->pick.ptr.offset;
1117 bio->bi_iter.bi_size = btree_bytes(c);
1119 if (rb->have_ioref) {
1120 bio_set_dev(bio, ca->disk_sb.bdev);
1121 submit_bio_wait(bio);
1123 bio->bi_status = BLK_STS_REMOVED;
1126 bch2_dev_io_err_on(bio->bi_status, ca, "btree read: %s",
1127 bch2_blk_status_to_str(bio->bi_status));
1129 percpu_ref_put(&ca->io_ref);
1130 rb->have_ioref = false;
1132 bch2_mark_io_failure(&failed, &rb->pick);
1134 can_retry = bch2_bkey_pick_read_device(c,
1135 bkey_i_to_s_c(&b->key),
1136 &failed, &rb->pick) > 0;
1138 if (!bio->bi_status &&
1139 !bch2_btree_node_read_done(c, b, can_retry))
1143 set_btree_node_read_error(b);
1148 bch2_time_stats_update(&c->times[BCH_TIME_btree_node_read],
1151 clear_btree_node_read_in_flight(b);
1152 wake_up_bit(&b->flags, BTREE_NODE_read_in_flight);
1155 static void btree_node_read_endio(struct bio *bio)
1157 struct btree_read_bio *rb =
1158 container_of(bio, struct btree_read_bio, bio);
1159 struct bch_fs *c = rb->c;
1161 if (rb->have_ioref) {
1162 struct bch_dev *ca = bch_dev_bkey_exists(c, rb->pick.ptr.dev);
1163 bch2_latency_acct(ca, rb->start_time, READ);
1166 queue_work(system_unbound_wq, &rb->work);
1169 void bch2_btree_node_read(struct bch_fs *c, struct btree *b,
1172 struct extent_ptr_decoded pick;
1173 struct btree_read_bio *rb;
1178 trace_btree_read(c, b);
1180 ret = bch2_bkey_pick_read_device(c, bkey_i_to_s_c(&b->key),
1182 if (bch2_fs_fatal_err_on(ret <= 0, c,
1183 "btree node read error: no device to read from")) {
1184 set_btree_node_read_error(b);
1188 ca = bch_dev_bkey_exists(c, pick.ptr.dev);
1190 bio = bio_alloc_bioset(GFP_NOIO, buf_pages(b->data,
1193 rb = container_of(bio, struct btree_read_bio, bio);
1195 rb->start_time = local_clock();
1196 rb->have_ioref = bch2_dev_get_ioref(ca, READ);
1198 INIT_WORK(&rb->work, btree_node_read_work);
1199 bio->bi_opf = REQ_OP_READ|REQ_SYNC|REQ_META;
1200 bio->bi_iter.bi_sector = pick.ptr.offset;
1201 bio->bi_end_io = btree_node_read_endio;
1202 bio->bi_private = b;
1203 bch2_bio_map(bio, b->data, btree_bytes(c));
1205 set_btree_node_read_in_flight(b);
1207 if (rb->have_ioref) {
1208 this_cpu_add(ca->io_done->sectors[READ][BCH_DATA_btree],
1210 bio_set_dev(bio, ca->disk_sb.bdev);
1213 submit_bio_wait(bio);
1215 bio->bi_private = b;
1216 btree_node_read_work(&rb->work);
1221 bio->bi_status = BLK_STS_REMOVED;
1224 btree_node_read_work(&rb->work);
1226 queue_work(system_unbound_wq, &rb->work);
1231 int bch2_btree_root_read(struct bch_fs *c, enum btree_id id,
1232 const struct bkey_i *k, unsigned level)
1238 closure_init_stack(&cl);
1241 ret = bch2_btree_cache_cannibalize_lock(c, &cl);
1245 b = bch2_btree_node_mem_alloc(c);
1246 bch2_btree_cache_cannibalize_unlock(c);
1250 bkey_copy(&b->key, k);
1251 BUG_ON(bch2_btree_node_hash_insert(&c->btree_cache, b, level, id));
1253 bch2_btree_node_read(c, b, true);
1255 if (btree_node_read_error(b)) {
1256 bch2_btree_node_hash_remove(&c->btree_cache, b);
1258 mutex_lock(&c->btree_cache.lock);
1259 list_move(&b->list, &c->btree_cache.freeable);
1260 mutex_unlock(&c->btree_cache.lock);
1266 bch2_btree_set_root_for_read(c, b);
1268 six_unlock_write(&b->c.lock);
1269 six_unlock_intent(&b->c.lock);
1274 void bch2_btree_complete_write(struct bch_fs *c, struct btree *b,
1275 struct btree_write *w)
1277 unsigned long old, new, v = READ_ONCE(b->will_make_reachable);
1285 } while ((v = cmpxchg(&b->will_make_reachable, old, new)) != old);
1288 closure_put(&((struct btree_update *) new)->cl);
1290 bch2_journal_pin_drop(&c->journal, &w->journal);
1293 static void btree_node_write_done(struct bch_fs *c, struct btree *b)
1295 struct btree_write *w = btree_prev_write(b);
1297 bch2_btree_complete_write(c, b, w);
1298 btree_node_io_unlock(b);
1301 static void bch2_btree_node_write_error(struct bch_fs *c,
1302 struct btree_write_bio *wbio)
1304 struct btree *b = wbio->wbio.bio.bi_private;
1305 __BKEY_PADDED(k, BKEY_BTREE_PTR_VAL_U64s_MAX) tmp;
1306 struct bch_extent_ptr *ptr;
1307 struct btree_trans trans;
1308 struct btree_iter *iter;
1311 bch2_trans_init(&trans, c, 0, 0);
1313 iter = bch2_trans_get_node_iter(&trans, b->c.btree_id, b->key.k.p,
1314 BTREE_MAX_DEPTH, b->c.level, 0);
1316 ret = bch2_btree_iter_traverse(iter);
1320 /* has node been freed? */
1321 if (iter->l[b->c.level].b != b) {
1322 /* node has been freed: */
1323 BUG_ON(!btree_node_dying(b));
1327 BUG_ON(!btree_node_hashed(b));
1329 bkey_copy(&tmp.k, &b->key);
1331 bch2_bkey_drop_ptrs(bkey_i_to_s(&tmp.k), ptr,
1332 bch2_dev_list_has_dev(wbio->wbio.failed, ptr->dev));
1334 if (!bch2_bkey_nr_ptrs(bkey_i_to_s_c(&tmp.k)))
1337 ret = bch2_btree_node_update_key(c, iter, b, &tmp.k);
1343 bch2_trans_exit(&trans);
1344 bio_put(&wbio->wbio.bio);
1345 btree_node_write_done(c, b);
1348 set_btree_node_noevict(b);
1349 bch2_fs_fatal_error(c, "fatal error writing btree node");
1353 void bch2_btree_write_error_work(struct work_struct *work)
1355 struct bch_fs *c = container_of(work, struct bch_fs,
1356 btree_write_error_work);
1360 spin_lock_irq(&c->btree_write_error_lock);
1361 bio = bio_list_pop(&c->btree_write_error_list);
1362 spin_unlock_irq(&c->btree_write_error_lock);
1367 bch2_btree_node_write_error(c,
1368 container_of(bio, struct btree_write_bio, wbio.bio));
1372 static void btree_node_write_work(struct work_struct *work)
1374 struct btree_write_bio *wbio =
1375 container_of(work, struct btree_write_bio, work);
1376 struct bch_fs *c = wbio->wbio.c;
1377 struct btree *b = wbio->wbio.bio.bi_private;
1379 btree_bounce_free(c,
1381 wbio->wbio.used_mempool,
1384 if (wbio->wbio.failed.nr) {
1385 unsigned long flags;
1387 spin_lock_irqsave(&c->btree_write_error_lock, flags);
1388 bio_list_add(&c->btree_write_error_list, &wbio->wbio.bio);
1389 spin_unlock_irqrestore(&c->btree_write_error_lock, flags);
1391 queue_work(c->wq, &c->btree_write_error_work);
1395 bio_put(&wbio->wbio.bio);
1396 btree_node_write_done(c, b);
1399 static void btree_node_write_endio(struct bio *bio)
1401 struct bch_write_bio *wbio = to_wbio(bio);
1402 struct bch_write_bio *parent = wbio->split ? wbio->parent : NULL;
1403 struct bch_write_bio *orig = parent ?: wbio;
1404 struct bch_fs *c = wbio->c;
1405 struct bch_dev *ca = bch_dev_bkey_exists(c, wbio->dev);
1406 unsigned long flags;
1408 if (wbio->have_ioref)
1409 bch2_latency_acct(ca, wbio->submit_time, WRITE);
1411 if (bch2_dev_io_err_on(bio->bi_status, ca, "btree write: %s",
1412 bch2_blk_status_to_str(bio->bi_status)) ||
1413 bch2_meta_write_fault("btree")) {
1414 spin_lock_irqsave(&c->btree_write_error_lock, flags);
1415 bch2_dev_list_add_dev(&orig->failed, wbio->dev);
1416 spin_unlock_irqrestore(&c->btree_write_error_lock, flags);
1419 if (wbio->have_ioref)
1420 percpu_ref_put(&ca->io_ref);
1424 bio_endio(&parent->bio);
1426 struct btree_write_bio *wb =
1427 container_of(orig, struct btree_write_bio, wbio);
1429 INIT_WORK(&wb->work, btree_node_write_work);
1430 queue_work(system_unbound_wq, &wb->work);
1434 static int validate_bset_for_write(struct bch_fs *c, struct btree *b,
1435 struct bset *i, unsigned sectors)
1437 unsigned whiteout_u64s = 0;
1440 if (bch2_bkey_invalid(c, bkey_i_to_s_c(&b->key), BKEY_TYPE_BTREE))
1443 ret = validate_bset(c, b, i, sectors, WRITE, false) ?:
1444 validate_bset_keys(c, b, i, &whiteout_u64s, WRITE, false);
1446 bch2_inconsistent_error(c);
1451 void __bch2_btree_node_write(struct bch_fs *c, struct btree *b,
1452 enum six_lock_type lock_type_held)
1454 struct btree_write_bio *wbio;
1455 struct bset_tree *t;
1457 struct btree_node *bn = NULL;
1458 struct btree_node_entry *bne = NULL;
1460 struct bch_extent_ptr *ptr;
1461 struct sort_iter sort_iter;
1463 unsigned bytes_to_write, sectors_to_write, bytes, u64s;
1466 unsigned long old, new;
1467 bool validate_before_checksum = false;
1470 if (test_bit(BCH_FS_HOLD_BTREE_WRITES, &c->flags))
1474 * We may only have a read lock on the btree node - the dirty bit is our
1475 * "lock" against racing with other threads that may be trying to start
1476 * a write, we do a write iff we clear the dirty bit. Since setting the
1477 * dirty bit requires a write lock, we can't race with other threads
1481 old = new = READ_ONCE(b->flags);
1483 if (!(old & (1 << BTREE_NODE_dirty)))
1486 if (!btree_node_may_write(b))
1489 if (old & (1 << BTREE_NODE_write_in_flight)) {
1490 btree_node_wait_on_io(b);
1494 new &= ~(1 << BTREE_NODE_dirty);
1495 new &= ~(1 << BTREE_NODE_need_write);
1496 new |= (1 << BTREE_NODE_write_in_flight);
1497 new |= (1 << BTREE_NODE_just_written);
1498 new ^= (1 << BTREE_NODE_write_idx);
1499 } while (cmpxchg_acquire(&b->flags, old, new) != old);
1501 BUG_ON(btree_node_fake(b));
1502 BUG_ON((b->will_make_reachable != 0) != !b->written);
1504 BUG_ON(b->written >= c->opts.btree_node_size);
1505 BUG_ON(b->written & (c->opts.block_size - 1));
1506 BUG_ON(bset_written(b, btree_bset_last(b)));
1507 BUG_ON(le64_to_cpu(b->data->magic) != bset_magic(c));
1508 BUG_ON(memcmp(&b->data->format, &b->format, sizeof(b->format)));
1510 bch2_sort_whiteouts(c, b);
1512 sort_iter_init(&sort_iter, b);
1515 ? sizeof(struct btree_node)
1516 : sizeof(struct btree_node_entry);
1518 bytes += b->whiteout_u64s * sizeof(u64);
1520 for_each_bset(b, t) {
1523 if (bset_written(b, i))
1526 bytes += le16_to_cpu(i->u64s) * sizeof(u64);
1527 sort_iter_add(&sort_iter,
1528 btree_bkey_first(b, t),
1529 btree_bkey_last(b, t));
1530 seq = max(seq, le64_to_cpu(i->journal_seq));
1533 data = btree_bounce_alloc(c, bytes, &used_mempool);
1541 bne->keys = b->data->keys;
1545 i->journal_seq = cpu_to_le64(seq);
1548 if (!btree_node_old_extent_overwrite(b)) {
1549 sort_iter_add(&sort_iter,
1550 unwritten_whiteouts_start(c, b),
1551 unwritten_whiteouts_end(c, b));
1552 SET_BSET_SEPARATE_WHITEOUTS(i, false);
1554 memcpy_u64s(i->start,
1555 unwritten_whiteouts_start(c, b),
1557 i->u64s = cpu_to_le16(b->whiteout_u64s);
1558 SET_BSET_SEPARATE_WHITEOUTS(i, true);
1561 b->whiteout_u64s = 0;
1563 u64s = btree_node_old_extent_overwrite(b)
1564 ? bch2_sort_extents(vstruct_last(i), &sort_iter, false)
1565 : bch2_sort_keys(i->start, &sort_iter, false);
1566 le16_add_cpu(&i->u64s, u64s);
1568 set_needs_whiteout(i, false);
1570 /* do we have data to write? */
1571 if (b->written && !i->u64s)
1574 bytes_to_write = vstruct_end(i) - data;
1575 sectors_to_write = round_up(bytes_to_write, block_bytes(c)) >> 9;
1577 memset(data + bytes_to_write, 0,
1578 (sectors_to_write << 9) - bytes_to_write);
1580 BUG_ON(b->written + sectors_to_write > c->opts.btree_node_size);
1581 BUG_ON(BSET_BIG_ENDIAN(i) != CPU_BIG_ENDIAN);
1582 BUG_ON(i->seq != b->data->keys.seq);
1584 i->version = c->sb.version < bcachefs_metadata_version_new_versioning
1585 ? cpu_to_le16(BCH_BSET_VERSION_OLD)
1586 : cpu_to_le16(c->sb.version);
1587 SET_BSET_CSUM_TYPE(i, bch2_meta_checksum_type(c));
1589 if (bch2_csum_type_is_encryption(BSET_CSUM_TYPE(i)))
1590 validate_before_checksum = true;
1592 /* validate_bset will be modifying: */
1593 if (le16_to_cpu(i->version) < bcachefs_metadata_version_max)
1594 validate_before_checksum = true;
1596 /* if we're going to be encrypting, check metadata validity first: */
1597 if (validate_before_checksum &&
1598 validate_bset_for_write(c, b, i, sectors_to_write))
1601 bset_encrypt(c, i, b->written << 9);
1603 nonce = btree_nonce(i, b->written << 9);
1606 bn->csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bn);
1608 bne->csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bne);
1610 /* if we're not encrypting, check metadata after checksumming: */
1611 if (!validate_before_checksum &&
1612 validate_bset_for_write(c, b, i, sectors_to_write))
1616 * We handle btree write errors by immediately halting the journal -
1617 * after we've done that, we can't issue any subsequent btree writes
1618 * because they might have pointers to new nodes that failed to write.
1620 * Furthermore, there's no point in doing any more btree writes because
1621 * with the journal stopped, we're never going to update the journal to
1622 * reflect that those writes were done and the data flushed from the
1625 * Also on journal error, the pending write may have updates that were
1626 * never journalled (interior nodes, see btree_update_nodes_written()) -
1627 * it's critical that we don't do the write in that case otherwise we
1628 * will have updates visible that weren't in the journal:
1630 * Make sure to update b->written so bch2_btree_init_next() doesn't
1633 if (bch2_journal_error(&c->journal) ||
1637 trace_btree_write(b, bytes_to_write, sectors_to_write);
1639 wbio = container_of(bio_alloc_bioset(GFP_NOIO,
1640 buf_pages(data, sectors_to_write << 9),
1642 struct btree_write_bio, wbio.bio);
1643 wbio_init(&wbio->wbio.bio);
1645 wbio->bytes = bytes;
1646 wbio->wbio.used_mempool = used_mempool;
1647 wbio->wbio.bio.bi_opf = REQ_OP_WRITE|REQ_META;
1648 wbio->wbio.bio.bi_end_io = btree_node_write_endio;
1649 wbio->wbio.bio.bi_private = b;
1651 bch2_bio_map(&wbio->wbio.bio, data, sectors_to_write << 9);
1654 * If we're appending to a leaf node, we don't technically need FUA -
1655 * this write just needs to be persisted before the next journal write,
1656 * which will be marked FLUSH|FUA.
1658 * Similarly if we're writing a new btree root - the pointer is going to
1659 * be in the next journal entry.
1661 * But if we're writing a new btree node (that isn't a root) or
1662 * appending to a non leaf btree node, we need either FUA or a flush
1663 * when we write the parent with the new pointer. FUA is cheaper than a
1664 * flush, and writes appending to leaf nodes aren't blocking anything so
1665 * just make all btree node writes FUA to keep things sane.
1668 bkey_copy(&k.key, &b->key);
1670 bkey_for_each_ptr(bch2_bkey_ptrs(bkey_i_to_s(&k.key)), ptr)
1671 ptr->offset += b->written;
1673 b->written += sectors_to_write;
1675 /* XXX: submitting IO with btree locks held: */
1676 bch2_submit_wbio_replicas(&wbio->wbio, c, BCH_DATA_btree, &k.key);
1679 set_btree_node_noevict(b);
1680 b->written += sectors_to_write;
1682 btree_bounce_free(c, bytes, used_mempool, data);
1683 btree_node_write_done(c, b);
1687 * Work that must be done with write lock held:
1689 bool bch2_btree_post_write_cleanup(struct bch_fs *c, struct btree *b)
1691 bool invalidated_iter = false;
1692 struct btree_node_entry *bne;
1693 struct bset_tree *t;
1695 if (!btree_node_just_written(b))
1698 BUG_ON(b->whiteout_u64s);
1700 clear_btree_node_just_written(b);
1703 * Note: immediately after write, bset_written() doesn't work - the
1704 * amount of data we had to write after compaction might have been
1705 * smaller than the offset of the last bset.
1707 * However, we know that all bsets have been written here, as long as
1708 * we're still holding the write lock:
1712 * XXX: decide if we really want to unconditionally sort down to a
1716 btree_node_sort(c, b, NULL, 0, b->nsets, true);
1717 invalidated_iter = true;
1719 invalidated_iter = bch2_drop_whiteouts(b, COMPACT_ALL);
1723 set_needs_whiteout(bset(b, t), true);
1725 bch2_btree_verify(c, b);
1728 * If later we don't unconditionally sort down to a single bset, we have
1729 * to ensure this is still true:
1731 BUG_ON((void *) btree_bkey_last(b, bset_tree_last(b)) > write_block(b));
1733 bne = want_new_bset(c, b);
1735 bch2_bset_init_next(c, b, bne);
1737 bch2_btree_build_aux_trees(b);
1739 return invalidated_iter;
1743 * Use this one if the node is intent locked:
1745 void bch2_btree_node_write(struct bch_fs *c, struct btree *b,
1746 enum six_lock_type lock_type_held)
1748 BUG_ON(lock_type_held == SIX_LOCK_write);
1750 if (lock_type_held == SIX_LOCK_intent ||
1751 six_lock_tryupgrade(&b->c.lock)) {
1752 __bch2_btree_node_write(c, b, SIX_LOCK_intent);
1754 /* don't cycle lock unnecessarily: */
1755 if (btree_node_just_written(b) &&
1756 six_trylock_write(&b->c.lock)) {
1757 bch2_btree_post_write_cleanup(c, b);
1758 six_unlock_write(&b->c.lock);
1761 if (lock_type_held == SIX_LOCK_read)
1762 six_lock_downgrade(&b->c.lock);
1764 __bch2_btree_node_write(c, b, SIX_LOCK_read);
1768 static void __bch2_btree_flush_all(struct bch_fs *c, unsigned flag)
1770 struct bucket_table *tbl;
1771 struct rhash_head *pos;
1776 for_each_cached_btree(b, c, tbl, i, pos)
1777 if (test_bit(flag, &b->flags)) {
1779 wait_on_bit_io(&b->flags, flag, TASK_UNINTERRUPTIBLE);
1786 void bch2_btree_flush_all_reads(struct bch_fs *c)
1788 __bch2_btree_flush_all(c, BTREE_NODE_read_in_flight);
1791 void bch2_btree_flush_all_writes(struct bch_fs *c)
1793 __bch2_btree_flush_all(c, BTREE_NODE_write_in_flight);
1796 void bch2_btree_verify_flushed(struct bch_fs *c)
1798 struct bucket_table *tbl;
1799 struct rhash_head *pos;
1804 for_each_cached_btree(b, c, tbl, i, pos) {
1805 unsigned long flags = READ_ONCE(b->flags);
1807 BUG_ON((flags & (1 << BTREE_NODE_dirty)) ||
1808 (flags & (1 << BTREE_NODE_write_in_flight)));
1813 void bch2_dirty_btree_nodes_to_text(struct printbuf *out, struct bch_fs *c)
1815 struct bucket_table *tbl;
1816 struct rhash_head *pos;
1821 for_each_cached_btree(b, c, tbl, i, pos) {
1822 unsigned long flags = READ_ONCE(b->flags);
1824 if (!(flags & (1 << BTREE_NODE_dirty)))
1827 pr_buf(out, "%p d %u n %u l %u w %u b %u r %u:%lu\n",
1829 (flags & (1 << BTREE_NODE_dirty)) != 0,
1830 (flags & (1 << BTREE_NODE_need_write)) != 0,
1833 !list_empty_careful(&b->write_blocked),
1834 b->will_make_reachable != 0,
1835 b->will_make_reachable & 1);