1 // SPDX-License-Identifier: GPL-2.0
3 * Code for working with individual keys, and sorted sets of keys with in a
6 * Copyright 2012 Google, Inc.
10 #include "btree_cache.h"
12 #include "eytzinger.h"
15 #include <asm/unaligned.h>
16 #include <linux/console.h>
17 #include <linux/random.h>
18 #include <linux/prefetch.h>
21 #include "alloc_types.h"
22 #include <trace/events/bcachefs.h>
24 static inline void __bch2_btree_node_iter_advance(struct btree_node_iter *,
27 static inline unsigned __btree_node_iter_used(struct btree_node_iter *iter)
29 unsigned n = ARRAY_SIZE(iter->data);
31 while (n && __btree_node_iter_set_end(iter, n - 1))
37 struct bset_tree *bch2_bkey_to_bset(struct btree *b, struct bkey_packed *k)
39 unsigned offset = __btree_node_key_to_offset(b, k);
43 if (offset <= t->end_offset) {
44 EBUG_ON(offset < btree_bkey_first_offset(t));
52 * There are never duplicate live keys in the btree - but including keys that
53 * have been flagged as deleted (and will be cleaned up later) we _will_ see
56 * Thus the sort order is: usual key comparison first, but for keys that compare
57 * equal the deleted key(s) come first, and the (at most one) live version comes
60 * The main reason for this is insertion: to handle overwrites, we first iterate
61 * over keys that compare equal to our insert key, and then insert immediately
62 * prior to the first key greater than the key we're inserting - our insert
63 * position will be after all keys that compare equal to our insert key, which
64 * by the time we actually do the insert will all be deleted.
67 void bch2_dump_bset(struct bch_fs *c, struct btree *b,
68 struct bset *i, unsigned set)
70 struct bkey_packed *_k, *_n;
81 _n = bkey_next_skip_noops(_k, vstruct_last(i));
83 k = bkey_disassemble(b, _k, &uk);
85 bch2_bkey_val_to_text(&PBUF(buf), c, k);
87 bch2_bkey_to_text(&PBUF(buf), k.k);
88 printk(KERN_ERR "block %u key %5zu: %s\n", set,
89 _k->_data - i->_data, buf);
91 if (_n == vstruct_last(i))
94 n = bkey_unpack_key(b, _n);
96 if (bkey_cmp(bkey_start_pos(&n), k.k->p) < 0) {
97 printk(KERN_ERR "Key skipped backwards\n");
101 if (!bkey_deleted(k.k) &&
102 !bkey_cmp(n.p, k.k->p))
103 printk(KERN_ERR "Duplicate keys\n");
107 void bch2_dump_btree_node(struct bch_fs *c, struct btree *b)
113 bch2_dump_bset(c, b, bset(b, t), t - b->set);
117 void bch2_dump_btree_node_iter(struct btree *b,
118 struct btree_node_iter *iter)
120 struct btree_node_iter_set *set;
122 printk(KERN_ERR "btree node iter with %u/%u sets:\n",
123 __btree_node_iter_used(iter), b->nsets);
125 btree_node_iter_for_each(iter, set) {
126 struct bkey_packed *k = __btree_node_offset_to_key(b, set->k);
127 struct bset_tree *t = bch2_bkey_to_bset(b, k);
128 struct bkey uk = bkey_unpack_key(b, k);
131 bch2_bkey_to_text(&PBUF(buf), &uk);
132 printk(KERN_ERR "set %zu key %u: %s\n",
133 t - b->set, set->k, buf);
137 #ifdef CONFIG_BCACHEFS_DEBUG
139 void __bch2_verify_btree_nr_keys(struct btree *b)
142 struct bkey_packed *k;
143 struct btree_nr_keys nr = { 0 };
146 bset_tree_for_each_key(b, t, k)
147 if (!bkey_whiteout(k))
148 btree_keys_account_key_add(&nr, t - b->set, k);
150 BUG_ON(memcmp(&nr, &b->nr, sizeof(nr)));
153 static void bch2_btree_node_iter_next_check(struct btree_node_iter *_iter,
156 struct btree_node_iter iter = *_iter;
157 const struct bkey_packed *k, *n;
159 k = bch2_btree_node_iter_peek_all(&iter, b);
160 __bch2_btree_node_iter_advance(&iter, b);
161 n = bch2_btree_node_iter_peek_all(&iter, b);
163 bkey_unpack_key(b, k);
166 bkey_iter_cmp(b, k, n) > 0) {
167 struct btree_node_iter_set *set;
168 struct bkey ku = bkey_unpack_key(b, k);
169 struct bkey nu = bkey_unpack_key(b, n);
170 char buf1[80], buf2[80];
172 bch2_dump_btree_node(NULL, b);
173 bch2_bkey_to_text(&PBUF(buf1), &ku);
174 bch2_bkey_to_text(&PBUF(buf2), &nu);
175 printk(KERN_ERR "out of order/overlapping:\n%s\n%s\n",
177 printk(KERN_ERR "iter was:");
179 btree_node_iter_for_each(_iter, set) {
180 struct bkey_packed *k = __btree_node_offset_to_key(b, set->k);
181 struct bset_tree *t = bch2_bkey_to_bset(b, k);
182 printk(" [%zi %zi]", t - b->set,
183 k->_data - bset(b, t)->_data);
189 void bch2_btree_node_iter_verify(struct btree_node_iter *iter,
192 struct btree_node_iter_set *set, *s2;
193 struct bkey_packed *k, *p;
196 if (bch2_btree_node_iter_end(iter))
199 /* Verify no duplicates: */
200 btree_node_iter_for_each(iter, set)
201 btree_node_iter_for_each(iter, s2)
202 BUG_ON(set != s2 && set->end == s2->end);
204 /* Verify that set->end is correct: */
205 btree_node_iter_for_each(iter, set) {
207 if (set->end == t->end_offset)
211 BUG_ON(set->k < btree_bkey_first_offset(t) ||
212 set->k >= t->end_offset);
215 /* Verify iterator is sorted: */
216 btree_node_iter_for_each(iter, set)
217 BUG_ON(set != iter->data &&
218 btree_node_iter_cmp(b, set[-1], set[0]) > 0);
220 k = bch2_btree_node_iter_peek_all(iter, b);
222 for_each_bset(b, t) {
223 if (iter->data[0].end == t->end_offset)
226 p = bch2_bkey_prev_all(b, t,
227 bch2_btree_node_iter_bset_pos(iter, b, t));
229 BUG_ON(p && bkey_iter_cmp(b, k, p) < 0);
233 void bch2_verify_insert_pos(struct btree *b, struct bkey_packed *where,
234 struct bkey_packed *insert, unsigned clobber_u64s)
236 struct bset_tree *t = bch2_bkey_to_bset(b, where);
237 struct bkey_packed *prev = bch2_bkey_prev_all(b, t, where);
238 struct bkey_packed *next = (void *) (where->_data + clobber_u64s);
241 bkey_iter_cmp(b, prev, insert) > 0);
244 bkey_iter_cmp(b, prev, insert) > 0) {
245 struct bkey k1 = bkey_unpack_key(b, prev);
246 struct bkey k2 = bkey_unpack_key(b, insert);
250 bch2_dump_btree_node(NULL, b);
251 bch2_bkey_to_text(&PBUF(buf1), &k1);
252 bch2_bkey_to_text(&PBUF(buf2), &k2);
254 panic("prev > insert:\n"
261 BUG_ON(next != btree_bkey_last(b, t) &&
262 bkey_iter_cmp(b, insert, next) > 0);
264 if (next != btree_bkey_last(b, t) &&
265 bkey_iter_cmp(b, insert, next) > 0) {
266 struct bkey k1 = bkey_unpack_key(b, insert);
267 struct bkey k2 = bkey_unpack_key(b, next);
271 bch2_dump_btree_node(NULL, b);
272 bch2_bkey_to_text(&PBUF(buf1), &k1);
273 bch2_bkey_to_text(&PBUF(buf2), &k2);
275 panic("insert > next:\n"
285 static inline void bch2_btree_node_iter_next_check(struct btree_node_iter *iter,
290 /* Auxiliary search trees */
292 #define BFLOAT_FAILED_UNPACKED U8_MAX
293 #define BFLOAT_FAILED U8_MAX
300 #define BKEY_MANTISSA_BITS 16
302 static unsigned bkey_float_byte_offset(unsigned idx)
304 return idx * sizeof(struct bkey_float);
308 struct bkey_float f[0];
316 static unsigned bset_aux_tree_buf_end(const struct bset_tree *t)
318 BUG_ON(t->aux_data_offset == U16_MAX);
320 switch (bset_aux_tree_type(t)) {
321 case BSET_NO_AUX_TREE:
322 return t->aux_data_offset;
323 case BSET_RO_AUX_TREE:
324 return t->aux_data_offset +
325 DIV_ROUND_UP(t->size * sizeof(struct bkey_float) +
326 t->size * sizeof(u8), 8);
327 case BSET_RW_AUX_TREE:
328 return t->aux_data_offset +
329 DIV_ROUND_UP(sizeof(struct rw_aux_tree) * t->size, 8);
335 static unsigned bset_aux_tree_buf_start(const struct btree *b,
336 const struct bset_tree *t)
339 ? DIV_ROUND_UP(b->unpack_fn_len, 8)
340 : bset_aux_tree_buf_end(t - 1);
343 static void *__aux_tree_base(const struct btree *b,
344 const struct bset_tree *t)
346 return b->aux_data + t->aux_data_offset * 8;
349 static struct ro_aux_tree *ro_aux_tree_base(const struct btree *b,
350 const struct bset_tree *t)
352 EBUG_ON(bset_aux_tree_type(t) != BSET_RO_AUX_TREE);
354 return __aux_tree_base(b, t);
357 static u8 *ro_aux_tree_prev(const struct btree *b,
358 const struct bset_tree *t)
360 EBUG_ON(bset_aux_tree_type(t) != BSET_RO_AUX_TREE);
362 return __aux_tree_base(b, t) + bkey_float_byte_offset(t->size);
365 static struct bkey_float *bkey_float(const struct btree *b,
366 const struct bset_tree *t,
369 return ro_aux_tree_base(b, t)->f + idx;
372 static void bset_aux_tree_verify(struct btree *b)
374 #ifdef CONFIG_BCACHEFS_DEBUG
377 for_each_bset(b, t) {
378 if (t->aux_data_offset == U16_MAX)
381 BUG_ON(t != b->set &&
382 t[-1].aux_data_offset == U16_MAX);
384 BUG_ON(t->aux_data_offset < bset_aux_tree_buf_start(b, t));
385 BUG_ON(t->aux_data_offset > btree_aux_data_u64s(b));
386 BUG_ON(bset_aux_tree_buf_end(t) > btree_aux_data_u64s(b));
391 void bch2_btree_keys_init(struct btree *b, bool *expensive_debug_checks)
396 memset(&b->nr, 0, sizeof(b->nr));
397 #ifdef CONFIG_BCACHEFS_DEBUG
398 b->expensive_debug_checks = expensive_debug_checks;
400 for (i = 0; i < MAX_BSETS; i++)
401 b->set[i].data_offset = U16_MAX;
403 bch2_bset_set_no_aux_tree(b, b->set);
406 /* Binary tree stuff for auxiliary search trees */
409 * Cacheline/offset <-> bkey pointer arithmetic:
411 * t->tree is a binary search tree in an array; each node corresponds to a key
412 * in one cacheline in t->set (BSET_CACHELINE bytes).
414 * This means we don't have to store the full index of the key that a node in
415 * the binary tree points to; eytzinger1_to_inorder() gives us the cacheline, and
416 * then bkey_float->m gives us the offset within that cacheline, in units of 8
419 * cacheline_to_bkey() and friends abstract out all the pointer arithmetic to
422 * To construct the bfloat for an arbitrary key we need to know what the key
423 * immediately preceding it is: we have to check if the two keys differ in the
424 * bits we're going to store in bkey_float->mantissa. t->prev[j] stores the size
425 * of the previous key so we can walk backwards to it from t->tree[j]'s key.
428 static inline void *bset_cacheline(const struct btree *b,
429 const struct bset_tree *t,
432 return (void *) round_down((unsigned long) btree_bkey_first(b, t),
434 cacheline * BSET_CACHELINE;
437 static struct bkey_packed *cacheline_to_bkey(const struct btree *b,
438 const struct bset_tree *t,
442 return bset_cacheline(b, t, cacheline) + offset * 8;
445 static unsigned bkey_to_cacheline(const struct btree *b,
446 const struct bset_tree *t,
447 const struct bkey_packed *k)
449 return ((void *) k - bset_cacheline(b, t, 0)) / BSET_CACHELINE;
452 static ssize_t __bkey_to_cacheline_offset(const struct btree *b,
453 const struct bset_tree *t,
455 const struct bkey_packed *k)
457 return (u64 *) k - (u64 *) bset_cacheline(b, t, cacheline);
460 static unsigned bkey_to_cacheline_offset(const struct btree *b,
461 const struct bset_tree *t,
463 const struct bkey_packed *k)
465 size_t m = __bkey_to_cacheline_offset(b, t, cacheline, k);
471 static inline struct bkey_packed *tree_to_bkey(const struct btree *b,
472 const struct bset_tree *t,
475 return cacheline_to_bkey(b, t,
476 __eytzinger1_to_inorder(j, t->size, t->extra),
477 bkey_float(b, t, j)->key_offset);
480 static struct bkey_packed *tree_to_prev_bkey(const struct btree *b,
481 const struct bset_tree *t,
484 unsigned prev_u64s = ro_aux_tree_prev(b, t)[j];
486 return (void *) (tree_to_bkey(b, t, j)->_data - prev_u64s);
489 static struct rw_aux_tree *rw_aux_tree(const struct btree *b,
490 const struct bset_tree *t)
492 EBUG_ON(bset_aux_tree_type(t) != BSET_RW_AUX_TREE);
494 return __aux_tree_base(b, t);
498 * For the write set - the one we're currently inserting keys into - we don't
499 * maintain a full search tree, we just keep a simple lookup table in t->prev.
501 static struct bkey_packed *rw_aux_to_bkey(const struct btree *b,
505 return __btree_node_offset_to_key(b, rw_aux_tree(b, t)[j].offset);
508 static void rw_aux_tree_set(const struct btree *b, struct bset_tree *t,
509 unsigned j, struct bkey_packed *k)
511 EBUG_ON(k >= btree_bkey_last(b, t));
513 rw_aux_tree(b, t)[j] = (struct rw_aux_tree) {
514 .offset = __btree_node_key_to_offset(b, k),
515 .k = bkey_unpack_pos(b, k),
519 static void bch2_bset_verify_rw_aux_tree(struct btree *b,
522 struct bkey_packed *k = btree_bkey_first(b, t);
525 if (!btree_keys_expensive_checks(b))
528 BUG_ON(bset_has_ro_aux_tree(t));
530 if (!bset_has_rw_aux_tree(t))
534 BUG_ON(rw_aux_to_bkey(b, t, j) != k);
538 if (rw_aux_to_bkey(b, t, j) == k) {
539 BUG_ON(bkey_cmp(rw_aux_tree(b, t)[j].k,
540 bkey_unpack_pos(b, k)));
545 BUG_ON(rw_aux_tree(b, t)[j].offset <=
546 rw_aux_tree(b, t)[j - 1].offset);
549 k = bkey_next_skip_noops(k, btree_bkey_last(b, t));
550 BUG_ON(k >= btree_bkey_last(b, t));
554 /* returns idx of first entry >= offset: */
555 static unsigned rw_aux_tree_bsearch(struct btree *b,
559 unsigned bset_offs = offset - btree_bkey_first_offset(t);
560 unsigned bset_u64s = t->end_offset - btree_bkey_first_offset(t);
561 unsigned idx = bset_u64s ? bset_offs * t->size / bset_u64s : 0;
563 EBUG_ON(bset_aux_tree_type(t) != BSET_RW_AUX_TREE);
565 EBUG_ON(idx > t->size);
567 while (idx < t->size &&
568 rw_aux_tree(b, t)[idx].offset < offset)
572 rw_aux_tree(b, t)[idx - 1].offset >= offset)
575 EBUG_ON(idx < t->size &&
576 rw_aux_tree(b, t)[idx].offset < offset);
577 EBUG_ON(idx && rw_aux_tree(b, t)[idx - 1].offset >= offset);
578 EBUG_ON(idx + 1 < t->size &&
579 rw_aux_tree(b, t)[idx].offset ==
580 rw_aux_tree(b, t)[idx + 1].offset);
585 static inline unsigned bkey_mantissa(const struct bkey_packed *k,
586 const struct bkey_float *f,
591 EBUG_ON(!bkey_packed(k));
593 v = get_unaligned((u64 *) (((u8 *) k->_data) + (f->exponent >> 3)));
596 * In little endian, we're shifting off low bits (and then the bits we
597 * want are at the low end), in big endian we're shifting off high bits
598 * (and then the bits we want are at the high end, so we shift them
601 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
602 v >>= f->exponent & 7;
604 v >>= 64 - (f->exponent & 7) - BKEY_MANTISSA_BITS;
609 static void make_bfloat(struct btree *b, struct bset_tree *t,
611 struct bkey_packed *min_key,
612 struct bkey_packed *max_key)
614 struct bkey_float *f = bkey_float(b, t, j);
615 struct bkey_packed *m = tree_to_bkey(b, t, j);
616 struct bkey_packed *l, *r;
618 int shift, exponent, high_bit;
620 if (is_power_of_2(j)) {
624 if (!bkey_pack_pos(l, b->data->min_key, b)) {
628 tmp.k.p = b->data->min_key;
633 l = tree_to_prev_bkey(b, t, j >> ffs(j));
638 if (is_power_of_2(j + 1)) {
642 if (!bkey_pack_pos(r, t->max_key, b)) {
646 tmp.k.p = t->max_key;
651 r = tree_to_bkey(b, t, j >> (ffz(j) + 1));
657 * for failed bfloats, the lookup code falls back to comparing against
661 if (!bkey_packed(l) || !bkey_packed(r) || !bkey_packed(m) ||
663 f->exponent = BFLOAT_FAILED_UNPACKED;
668 * The greatest differing bit of l and r is the first bit we must
669 * include in the bfloat mantissa we're creating in order to do
670 * comparisons - that bit always becomes the high bit of
671 * bfloat->mantissa, and thus the exponent we're calculating here is
672 * the position of what will become the low bit in bfloat->mantissa:
674 * Note that this may be negative - we may be running off the low end
675 * of the key: we handle this later:
677 high_bit = max(bch2_bkey_greatest_differing_bit(b, l, r),
678 min_t(unsigned, BKEY_MANTISSA_BITS, b->nr_key_bits) - 1);
679 exponent = high_bit - (BKEY_MANTISSA_BITS - 1);
682 * Then we calculate the actual shift value, from the start of the key
683 * (k->_data), to get the key bits starting at exponent:
685 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
686 shift = (int) (b->format.key_u64s * 64 - b->nr_key_bits) + exponent;
688 EBUG_ON(shift + BKEY_MANTISSA_BITS > b->format.key_u64s * 64);
690 shift = high_bit_offset +
695 EBUG_ON(shift < KEY_PACKED_BITS_START);
697 EBUG_ON(shift < 0 || shift >= BFLOAT_FAILED);
700 mantissa = bkey_mantissa(m, f, j);
703 * If we've got garbage bits, set them to all 1s - it's legal for the
704 * bfloat to compare larger than the original key, but not smaller:
707 mantissa |= ~(~0U << -exponent);
709 f->mantissa = mantissa;
712 /* bytes remaining - only valid for last bset: */
713 static unsigned __bset_tree_capacity(struct btree *b, struct bset_tree *t)
715 bset_aux_tree_verify(b);
717 return btree_aux_data_bytes(b) - t->aux_data_offset * sizeof(u64);
720 static unsigned bset_ro_tree_capacity(struct btree *b, struct bset_tree *t)
722 return __bset_tree_capacity(b, t) /
723 (sizeof(struct bkey_float) + sizeof(u8));
726 static unsigned bset_rw_tree_capacity(struct btree *b, struct bset_tree *t)
728 return __bset_tree_capacity(b, t) / sizeof(struct rw_aux_tree);
731 static void __build_rw_aux_tree(struct btree *b, struct bset_tree *t)
733 struct bkey_packed *k;
736 t->extra = BSET_RW_AUX_TREE_VAL;
737 rw_aux_tree(b, t)[0].offset =
738 __btree_node_key_to_offset(b, btree_bkey_first(b, t));
740 bset_tree_for_each_key(b, t, k) {
741 if (t->size == bset_rw_tree_capacity(b, t))
744 if ((void *) k - (void *) rw_aux_to_bkey(b, t, t->size - 1) >
746 rw_aux_tree_set(b, t, t->size++, k);
750 static void __build_ro_aux_tree(struct btree *b, struct bset_tree *t)
752 struct bkey_packed *prev = NULL, *k = btree_bkey_first(b, t);
753 struct bkey_packed min_key, max_key;
754 unsigned j, cacheline = 1;
756 /* signal to make_bfloat() that they're uninitialized: */
757 min_key.u64s = max_key.u64s = 0;
759 t->size = min(bkey_to_cacheline(b, t, btree_bkey_last(b, t)),
760 bset_ro_tree_capacity(b, t));
764 t->extra = BSET_NO_AUX_TREE_VAL;
768 t->extra = (t->size - rounddown_pow_of_two(t->size - 1)) << 1;
770 /* First we figure out where the first key in each cacheline is */
771 eytzinger1_for_each(j, t->size) {
772 while (bkey_to_cacheline(b, t, k) < cacheline)
773 prev = k, k = bkey_next_skip_noops(k, btree_bkey_last(b, t));
775 if (k >= btree_bkey_last(b, t)) {
776 /* XXX: this path sucks */
781 ro_aux_tree_prev(b, t)[j] = prev->u64s;
782 bkey_float(b, t, j)->key_offset =
783 bkey_to_cacheline_offset(b, t, cacheline++, k);
785 EBUG_ON(tree_to_prev_bkey(b, t, j) != prev);
786 EBUG_ON(tree_to_bkey(b, t, j) != k);
789 while (k != btree_bkey_last(b, t))
790 prev = k, k = bkey_next_skip_noops(k, btree_bkey_last(b, t));
792 t->max_key = bkey_unpack_pos(b, prev);
794 /* Then we build the tree */
795 eytzinger1_for_each(j, t->size)
796 make_bfloat(b, t, j, &min_key, &max_key);
799 static void bset_alloc_tree(struct btree *b, struct bset_tree *t)
803 for (i = b->set; i != t; i++)
804 BUG_ON(bset_has_rw_aux_tree(i));
806 bch2_bset_set_no_aux_tree(b, t);
808 /* round up to next cacheline: */
809 t->aux_data_offset = round_up(bset_aux_tree_buf_start(b, t),
810 SMP_CACHE_BYTES / sizeof(u64));
812 bset_aux_tree_verify(b);
815 void bch2_bset_build_aux_tree(struct btree *b, struct bset_tree *t,
819 ? bset_has_rw_aux_tree(t)
820 : bset_has_ro_aux_tree(t))
823 bset_alloc_tree(b, t);
825 if (!__bset_tree_capacity(b, t))
829 __build_rw_aux_tree(b, t);
831 __build_ro_aux_tree(b, t);
833 bset_aux_tree_verify(b);
836 void bch2_bset_init_first(struct btree *b, struct bset *i)
842 memset(i, 0, sizeof(*i));
843 get_random_bytes(&i->seq, sizeof(i->seq));
844 SET_BSET_BIG_ENDIAN(i, CPU_BIG_ENDIAN);
846 t = &b->set[b->nsets++];
847 set_btree_bset(b, t, i);
850 void bch2_bset_init_next(struct bch_fs *c, struct btree *b,
851 struct btree_node_entry *bne)
853 struct bset *i = &bne->keys;
856 BUG_ON(bset_byte_offset(b, bne) >= btree_bytes(c));
857 BUG_ON((void *) bne < (void *) btree_bkey_last(b, bset_tree_last(b)));
858 BUG_ON(b->nsets >= MAX_BSETS);
860 memset(i, 0, sizeof(*i));
861 i->seq = btree_bset_first(b)->seq;
862 SET_BSET_BIG_ENDIAN(i, CPU_BIG_ENDIAN);
864 t = &b->set[b->nsets++];
865 set_btree_bset(b, t, i);
869 * find _some_ key in the same bset as @k that precedes @k - not necessarily the
870 * immediate predecessor:
872 static struct bkey_packed *__bkey_prev(struct btree *b, struct bset_tree *t,
873 struct bkey_packed *k)
875 struct bkey_packed *p;
879 EBUG_ON(k < btree_bkey_first(b, t) ||
880 k > btree_bkey_last(b, t));
882 if (k == btree_bkey_first(b, t))
885 switch (bset_aux_tree_type(t)) {
886 case BSET_NO_AUX_TREE:
887 p = btree_bkey_first(b, t);
889 case BSET_RO_AUX_TREE:
890 j = min_t(unsigned, t->size - 1, bkey_to_cacheline(b, t, k));
893 p = j ? tree_to_bkey(b, t,
894 __inorder_to_eytzinger1(j--,
896 : btree_bkey_first(b, t);
899 case BSET_RW_AUX_TREE:
900 offset = __btree_node_key_to_offset(b, k);
901 j = rw_aux_tree_bsearch(b, t, offset);
902 p = j ? rw_aux_to_bkey(b, t, j - 1)
903 : btree_bkey_first(b, t);
910 struct bkey_packed *bch2_bkey_prev_filter(struct btree *b,
912 struct bkey_packed *k,
913 unsigned min_key_type)
915 struct bkey_packed *p, *i, *ret = NULL, *orig_k = k;
917 while ((p = __bkey_prev(b, t, k)) && !ret) {
918 for (i = p; i != k; i = bkey_next_skip_noops(i, k))
919 if (i->type >= min_key_type)
925 if (btree_keys_expensive_checks(b)) {
926 BUG_ON(ret >= orig_k);
929 ? bkey_next_skip_noops(ret, orig_k)
930 : btree_bkey_first(b, t);
932 i = bkey_next_skip_noops(i, orig_k))
933 BUG_ON(i->type >= min_key_type);
941 static void rw_aux_tree_fix_invalidated_key(struct btree *b,
943 struct bkey_packed *k)
945 unsigned offset = __btree_node_key_to_offset(b, k);
946 unsigned j = rw_aux_tree_bsearch(b, t, offset);
949 rw_aux_tree(b, t)[j].offset == offset)
950 rw_aux_tree_set(b, t, j, k);
952 bch2_bset_verify_rw_aux_tree(b, t);
955 static void ro_aux_tree_fix_invalidated_key(struct btree *b,
957 struct bkey_packed *k)
959 struct bkey_packed min_key, max_key;
962 EBUG_ON(bset_aux_tree_type(t) != BSET_RO_AUX_TREE);
964 /* signal to make_bfloat() that they're uninitialized: */
965 min_key.u64s = max_key.u64s = 0;
967 if (bkey_next_skip_noops(k, btree_bkey_last(b, t)) == btree_bkey_last(b, t)) {
968 t->max_key = bkey_unpack_pos(b, k);
970 for (j = 1; j < t->size; j = j * 2 + 1)
971 make_bfloat(b, t, j, &min_key, &max_key);
974 inorder = bkey_to_cacheline(b, t, k);
978 j = __inorder_to_eytzinger1(inorder, t->size, t->extra);
980 if (k == tree_to_bkey(b, t, j)) {
981 /* Fix the node this key corresponds to */
982 make_bfloat(b, t, j, &min_key, &max_key);
984 /* Children for which this key is the right boundary */
985 for (j = eytzinger1_left_child(j);
987 j = eytzinger1_right_child(j))
988 make_bfloat(b, t, j, &min_key, &max_key);
992 if (inorder + 1 < t->size) {
993 j = __inorder_to_eytzinger1(inorder + 1, t->size, t->extra);
995 if (k == tree_to_prev_bkey(b, t, j)) {
996 make_bfloat(b, t, j, &min_key, &max_key);
998 /* Children for which this key is the left boundary */
999 for (j = eytzinger1_right_child(j);
1001 j = eytzinger1_left_child(j))
1002 make_bfloat(b, t, j, &min_key, &max_key);
1008 * bch2_bset_fix_invalidated_key() - given an existing key @k that has been
1009 * modified, fix any auxiliary search tree by remaking all the nodes in the
1010 * auxiliary search tree that @k corresponds to
1012 void bch2_bset_fix_invalidated_key(struct btree *b, struct bkey_packed *k)
1014 struct bset_tree *t = bch2_bkey_to_bset(b, k);
1016 switch (bset_aux_tree_type(t)) {
1017 case BSET_NO_AUX_TREE:
1019 case BSET_RO_AUX_TREE:
1020 ro_aux_tree_fix_invalidated_key(b, t, k);
1022 case BSET_RW_AUX_TREE:
1023 rw_aux_tree_fix_invalidated_key(b, t, k);
1028 static void bch2_bset_fix_lookup_table(struct btree *b,
1029 struct bset_tree *t,
1030 struct bkey_packed *_where,
1031 unsigned clobber_u64s,
1034 int shift = new_u64s - clobber_u64s;
1035 unsigned l, j, where = __btree_node_key_to_offset(b, _where);
1037 EBUG_ON(bset_has_ro_aux_tree(t));
1039 if (!bset_has_rw_aux_tree(t))
1042 /* returns first entry >= where */
1043 l = rw_aux_tree_bsearch(b, t, where);
1045 if (!l) /* never delete first entry */
1047 else if (l < t->size &&
1048 where < t->end_offset &&
1049 rw_aux_tree(b, t)[l].offset == where)
1050 rw_aux_tree_set(b, t, l++, _where);
1056 rw_aux_tree(b, t)[j].offset < where + clobber_u64s;
1061 rw_aux_tree(b, t)[j].offset + shift ==
1062 rw_aux_tree(b, t)[l - 1].offset)
1065 memmove(&rw_aux_tree(b, t)[l],
1066 &rw_aux_tree(b, t)[j],
1067 (void *) &rw_aux_tree(b, t)[t->size] -
1068 (void *) &rw_aux_tree(b, t)[j]);
1071 for (j = l; j < t->size; j++)
1072 rw_aux_tree(b, t)[j].offset += shift;
1074 EBUG_ON(l < t->size &&
1075 rw_aux_tree(b, t)[l].offset ==
1076 rw_aux_tree(b, t)[l - 1].offset);
1078 if (t->size < bset_rw_tree_capacity(b, t) &&
1080 ? rw_aux_tree(b, t)[l].offset
1082 rw_aux_tree(b, t)[l - 1].offset >
1083 L1_CACHE_BYTES / sizeof(u64)) {
1084 struct bkey_packed *start = rw_aux_to_bkey(b, t, l - 1);
1085 struct bkey_packed *end = l < t->size
1086 ? rw_aux_to_bkey(b, t, l)
1087 : btree_bkey_last(b, t);
1088 struct bkey_packed *k = start;
1091 k = bkey_next_skip_noops(k, end);
1095 if ((void *) k - (void *) start >= L1_CACHE_BYTES) {
1096 memmove(&rw_aux_tree(b, t)[l + 1],
1097 &rw_aux_tree(b, t)[l],
1098 (void *) &rw_aux_tree(b, t)[t->size] -
1099 (void *) &rw_aux_tree(b, t)[l]);
1101 rw_aux_tree_set(b, t, l, k);
1107 bch2_bset_verify_rw_aux_tree(b, t);
1108 bset_aux_tree_verify(b);
1111 void bch2_bset_insert(struct btree *b,
1112 struct btree_node_iter *iter,
1113 struct bkey_packed *where,
1114 struct bkey_i *insert,
1115 unsigned clobber_u64s)
1117 struct bkey_format *f = &b->format;
1118 struct bset_tree *t = bset_tree_last(b);
1119 struct bkey_packed packed, *src = bkey_to_packed(insert);
1121 bch2_bset_verify_rw_aux_tree(b, t);
1122 bch2_verify_insert_pos(b, where, bkey_to_packed(insert), clobber_u64s);
1124 if (bch2_bkey_pack_key(&packed, &insert->k, f))
1127 if (!bkey_whiteout(&insert->k))
1128 btree_keys_account_key_add(&b->nr, t - b->set, src);
1130 if (src->u64s != clobber_u64s) {
1131 u64 *src_p = where->_data + clobber_u64s;
1132 u64 *dst_p = where->_data + src->u64s;
1134 EBUG_ON((int) le16_to_cpu(bset(b, t)->u64s) <
1135 (int) clobber_u64s - src->u64s);
1137 memmove_u64s(dst_p, src_p, btree_bkey_last(b, t)->_data - src_p);
1138 le16_add_cpu(&bset(b, t)->u64s, src->u64s - clobber_u64s);
1139 set_btree_bset_end(b, t);
1142 memcpy_u64s(where, src,
1143 bkeyp_key_u64s(f, src));
1144 memcpy_u64s(bkeyp_val(f, where), &insert->v,
1145 bkeyp_val_u64s(f, src));
1147 if (src->u64s != clobber_u64s)
1148 bch2_bset_fix_lookup_table(b, t, where, clobber_u64s, src->u64s);
1150 bch2_verify_btree_nr_keys(b);
1153 void bch2_bset_delete(struct btree *b,
1154 struct bkey_packed *where,
1155 unsigned clobber_u64s)
1157 struct bset_tree *t = bset_tree_last(b);
1158 u64 *src_p = where->_data + clobber_u64s;
1159 u64 *dst_p = where->_data;
1161 bch2_bset_verify_rw_aux_tree(b, t);
1163 EBUG_ON(le16_to_cpu(bset(b, t)->u64s) < clobber_u64s);
1165 memmove_u64s_down(dst_p, src_p, btree_bkey_last(b, t)->_data - src_p);
1166 le16_add_cpu(&bset(b, t)->u64s, -clobber_u64s);
1167 set_btree_bset_end(b, t);
1169 bch2_bset_fix_lookup_table(b, t, where, clobber_u64s, 0);
1175 static struct bkey_packed *bset_search_write_set(const struct btree *b,
1176 struct bset_tree *t,
1177 struct bpos *search,
1178 const struct bkey_packed *packed_search)
1180 unsigned l = 0, r = t->size;
1182 while (l + 1 != r) {
1183 unsigned m = (l + r) >> 1;
1185 if (bkey_cmp(rw_aux_tree(b, t)[m].k, *search) < 0)
1191 return rw_aux_to_bkey(b, t, l);
1194 static inline void prefetch_four_cachelines(void *p)
1196 #ifdef CONFIG_X86_64
1197 asm(".intel_syntax noprefix;"
1198 "prefetcht0 [%0 - 127 + 64 * 0];"
1199 "prefetcht0 [%0 - 127 + 64 * 1];"
1200 "prefetcht0 [%0 - 127 + 64 * 2];"
1201 "prefetcht0 [%0 - 127 + 64 * 3];"
1202 ".att_syntax prefix;"
1206 prefetch(p + L1_CACHE_BYTES * 0);
1207 prefetch(p + L1_CACHE_BYTES * 1);
1208 prefetch(p + L1_CACHE_BYTES * 2);
1209 prefetch(p + L1_CACHE_BYTES * 3);
1213 static inline bool bkey_mantissa_bits_dropped(const struct btree *b,
1214 const struct bkey_float *f,
1217 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
1218 unsigned key_bits_start = b->format.key_u64s * 64 - b->nr_key_bits;
1220 return f->exponent > key_bits_start;
1222 unsigned key_bits_end = high_bit_offset + b->nr_key_bits;
1224 return f->exponent + BKEY_MANTISSA_BITS < key_bits_end;
1229 static struct bkey_packed *bset_search_tree(const struct btree *b,
1230 struct bset_tree *t,
1231 struct bpos *search,
1232 const struct bkey_packed *packed_search)
1234 struct ro_aux_tree *base = ro_aux_tree_base(b, t);
1235 struct bkey_float *f;
1236 struct bkey_packed *k;
1237 unsigned inorder, n = 1, l, r;
1241 if (likely(n << 4 < t->size))
1242 prefetch(&base->f[n << 4]);
1246 if (!unlikely(packed_search))
1248 if (unlikely(f->exponent >= BFLOAT_FAILED))
1252 r = bkey_mantissa(packed_search, f, n);
1254 if (unlikely(l == r) && bkey_mantissa_bits_dropped(b, f, n))
1257 n = n * 2 + (l < r);
1260 k = tree_to_bkey(b, t, n);
1261 cmp = bkey_cmp_p_or_unp(b, k, packed_search, search);
1265 n = n * 2 + (cmp < 0);
1266 } while (n < t->size);
1268 inorder = __eytzinger1_to_inorder(n >> 1, t->size, t->extra);
1271 * n would have been the node we recursed to - the low bit tells us if
1272 * we recursed left or recursed right.
1274 if (likely(!(n & 1))) {
1276 if (unlikely(!inorder))
1277 return btree_bkey_first(b, t);
1279 f = &base->f[eytzinger1_prev(n >> 1, t->size)];
1282 return cacheline_to_bkey(b, t, inorder, f->key_offset);
1285 static __always_inline __flatten
1286 struct bkey_packed *__bch2_bset_search(struct btree *b,
1287 struct bset_tree *t,
1288 struct bpos *search,
1289 const struct bkey_packed *lossy_packed_search)
1293 * First, we search for a cacheline, then lastly we do a linear search
1294 * within that cacheline.
1296 * To search for the cacheline, there's three different possibilities:
1297 * * The set is too small to have a search tree, so we just do a linear
1298 * search over the whole set.
1299 * * The set is the one we're currently inserting into; keeping a full
1300 * auxiliary search tree up to date would be too expensive, so we
1301 * use a much simpler lookup table to do a binary search -
1302 * bset_search_write_set().
1303 * * Or we use the auxiliary search tree we constructed earlier -
1304 * bset_search_tree()
1307 switch (bset_aux_tree_type(t)) {
1308 case BSET_NO_AUX_TREE:
1309 return btree_bkey_first(b, t);
1310 case BSET_RW_AUX_TREE:
1311 return bset_search_write_set(b, t, search, lossy_packed_search);
1312 case BSET_RO_AUX_TREE:
1314 * Each node in the auxiliary search tree covers a certain range
1315 * of bits, and keys above and below the set it covers might
1316 * differ outside those bits - so we have to special case the
1317 * start and end - handle that here:
1320 if (bkey_cmp(*search, t->max_key) > 0)
1321 return btree_bkey_last(b, t);
1323 return bset_search_tree(b, t, search, lossy_packed_search);
1329 static __always_inline __flatten
1330 struct bkey_packed *bch2_bset_search_linear(struct btree *b,
1331 struct bset_tree *t,
1332 struct bpos *search,
1333 struct bkey_packed *packed_search,
1334 const struct bkey_packed *lossy_packed_search,
1335 struct bkey_packed *m)
1337 if (lossy_packed_search)
1338 while (m != btree_bkey_last(b, t) &&
1339 bkey_iter_cmp_p_or_unp(b, m,
1340 lossy_packed_search, search) < 0)
1341 m = bkey_next_skip_noops(m, btree_bkey_last(b, t));
1344 while (m != btree_bkey_last(b, t) &&
1345 bkey_iter_pos_cmp(b, m, search) < 0)
1346 m = bkey_next_skip_noops(m, btree_bkey_last(b, t));
1348 if (btree_keys_expensive_checks(b)) {
1349 struct bkey_packed *prev = bch2_bkey_prev_all(b, t, m);
1352 bkey_iter_cmp_p_or_unp(b, prev,
1353 packed_search, search) >= 0);
1360 * Returns the first key greater than or equal to @search
1362 static __always_inline __flatten
1363 struct bkey_packed *bch2_bset_search(struct btree *b,
1364 struct bset_tree *t,
1365 struct bpos *search,
1366 struct bkey_packed *packed_search,
1367 const struct bkey_packed *lossy_packed_search)
1369 struct bkey_packed *m = __bch2_bset_search(b, t, search,
1370 lossy_packed_search);
1372 return bch2_bset_search_linear(b, t, search,
1373 packed_search, lossy_packed_search, m);
1376 /* Btree node iterator */
1378 static inline void __bch2_btree_node_iter_push(struct btree_node_iter *iter,
1380 const struct bkey_packed *k,
1381 const struct bkey_packed *end)
1384 struct btree_node_iter_set *pos;
1386 btree_node_iter_for_each(iter, pos)
1389 BUG_ON(pos >= iter->data + ARRAY_SIZE(iter->data));
1390 *pos = (struct btree_node_iter_set) {
1391 __btree_node_key_to_offset(b, k),
1392 __btree_node_key_to_offset(b, end)
1397 void bch2_btree_node_iter_push(struct btree_node_iter *iter,
1399 const struct bkey_packed *k,
1400 const struct bkey_packed *end)
1402 __bch2_btree_node_iter_push(iter, b, k, end);
1403 bch2_btree_node_iter_sort(iter, b);
1406 noinline __flatten __attribute__((cold))
1407 static void btree_node_iter_init_pack_failed(struct btree_node_iter *iter,
1408 struct btree *b, struct bpos *search)
1410 struct bset_tree *t;
1412 trace_bkey_pack_pos_fail(search);
1415 __bch2_btree_node_iter_push(iter, b,
1416 bch2_bset_search(b, t, search, NULL, NULL),
1417 btree_bkey_last(b, t));
1419 bch2_btree_node_iter_sort(iter, b);
1423 * bch_btree_node_iter_init - initialize a btree node iterator, starting from a
1426 * Main entry point to the lookup code for individual btree nodes:
1430 * When you don't filter out deleted keys, btree nodes _do_ contain duplicate
1431 * keys. This doesn't matter for most code, but it does matter for lookups.
1433 * Some adjacent keys with a string of equal keys:
1436 * If you search for k, the lookup code isn't guaranteed to return you any
1437 * specific k. The lookup code is conceptually doing a binary search and
1438 * iterating backwards is very expensive so if the pivot happens to land at the
1439 * last k that's what you'll get.
1441 * This works out ok, but it's something to be aware of:
1443 * - For non extents, we guarantee that the live key comes last - see
1444 * btree_node_iter_cmp(), keys_out_of_order(). So the duplicates you don't
1445 * see will only be deleted keys you don't care about.
1447 * - For extents, deleted keys sort last (see the comment at the top of this
1448 * file). But when you're searching for extents, you actually want the first
1449 * key strictly greater than your search key - an extent that compares equal
1450 * to the search key is going to have 0 sectors after the search key.
1452 * But this does mean that we can't just search for
1453 * bkey_successor(start_of_range) to get the first extent that overlaps with
1454 * the range we want - if we're unlucky and there's an extent that ends
1455 * exactly where we searched, then there could be a deleted key at the same
1456 * position and we'd get that when we search instead of the preceding extent
1459 * So we've got to search for start_of_range, then after the lookup iterate
1460 * past any extents that compare equal to the position we searched for.
1463 void bch2_btree_node_iter_init(struct btree_node_iter *iter,
1464 struct btree *b, struct bpos *search)
1466 struct bkey_packed p, *packed_search = NULL;
1467 struct btree_node_iter_set *pos = iter->data;
1468 struct bkey_packed *k[MAX_BSETS];
1471 EBUG_ON(bkey_cmp(*search, b->data->min_key) < 0);
1472 bset_aux_tree_verify(b);
1474 memset(iter, 0, sizeof(*iter));
1476 switch (bch2_bkey_pack_pos_lossy(&p, *search, b)) {
1477 case BKEY_PACK_POS_EXACT:
1480 case BKEY_PACK_POS_SMALLER:
1481 packed_search = NULL;
1483 case BKEY_PACK_POS_FAIL:
1484 btree_node_iter_init_pack_failed(iter, b, search);
1488 for (i = 0; i < b->nsets; i++) {
1489 k[i] = __bch2_bset_search(b, b->set + i, search, &p);
1490 prefetch_four_cachelines(k[i]);
1493 for (i = 0; i < b->nsets; i++) {
1494 struct bset_tree *t = b->set + i;
1495 struct bkey_packed *end = btree_bkey_last(b, t);
1497 k[i] = bch2_bset_search_linear(b, t, search,
1498 packed_search, &p, k[i]);
1500 *pos++ = (struct btree_node_iter_set) {
1501 __btree_node_key_to_offset(b, k[i]),
1502 __btree_node_key_to_offset(b, end)
1506 bch2_btree_node_iter_sort(iter, b);
1509 void bch2_btree_node_iter_init_from_start(struct btree_node_iter *iter,
1512 struct bset_tree *t;
1514 memset(iter, 0, sizeof(*iter));
1517 __bch2_btree_node_iter_push(iter, b,
1518 btree_bkey_first(b, t),
1519 btree_bkey_last(b, t));
1520 bch2_btree_node_iter_sort(iter, b);
1523 struct bkey_packed *bch2_btree_node_iter_bset_pos(struct btree_node_iter *iter,
1525 struct bset_tree *t)
1527 struct btree_node_iter_set *set;
1529 btree_node_iter_for_each(iter, set)
1530 if (set->end == t->end_offset)
1531 return __btree_node_offset_to_key(b, set->k);
1533 return btree_bkey_last(b, t);
1536 static inline bool btree_node_iter_sort_two(struct btree_node_iter *iter,
1542 if ((ret = (btree_node_iter_cmp(b,
1544 iter->data[first + 1]) > 0)))
1545 swap(iter->data[first], iter->data[first + 1]);
1549 void bch2_btree_node_iter_sort(struct btree_node_iter *iter,
1552 /* unrolled bubble sort: */
1554 if (!__btree_node_iter_set_end(iter, 2)) {
1555 btree_node_iter_sort_two(iter, b, 0);
1556 btree_node_iter_sort_two(iter, b, 1);
1559 if (!__btree_node_iter_set_end(iter, 1))
1560 btree_node_iter_sort_two(iter, b, 0);
1563 void bch2_btree_node_iter_set_drop(struct btree_node_iter *iter,
1564 struct btree_node_iter_set *set)
1566 struct btree_node_iter_set *last =
1567 iter->data + ARRAY_SIZE(iter->data) - 1;
1569 memmove(&set[0], &set[1], (void *) last - (void *) set);
1570 *last = (struct btree_node_iter_set) { 0, 0 };
1573 static inline void __bch2_btree_node_iter_advance(struct btree_node_iter *iter,
1576 iter->data->k += __bch2_btree_node_iter_peek_all(iter, b)->u64s;
1578 EBUG_ON(iter->data->k > iter->data->end);
1580 while (!__btree_node_iter_set_end(iter, 0) &&
1581 !__bch2_btree_node_iter_peek_all(iter, b)->u64s)
1584 if (unlikely(__btree_node_iter_set_end(iter, 0))) {
1585 bch2_btree_node_iter_set_drop(iter, iter->data);
1589 if (__btree_node_iter_set_end(iter, 1))
1592 if (!btree_node_iter_sort_two(iter, b, 0))
1595 if (__btree_node_iter_set_end(iter, 2))
1598 btree_node_iter_sort_two(iter, b, 1);
1601 void bch2_btree_node_iter_advance(struct btree_node_iter *iter,
1604 if (btree_keys_expensive_checks(b)) {
1605 bch2_btree_node_iter_verify(iter, b);
1606 bch2_btree_node_iter_next_check(iter, b);
1609 __bch2_btree_node_iter_advance(iter, b);
1615 struct bkey_packed *bch2_btree_node_iter_prev_all(struct btree_node_iter *iter,
1618 struct bkey_packed *k, *prev = NULL;
1619 struct btree_node_iter_set *set;
1620 struct bset_tree *t;
1623 if (btree_keys_expensive_checks(b))
1624 bch2_btree_node_iter_verify(iter, b);
1626 for_each_bset(b, t) {
1627 k = bch2_bkey_prev_all(b, t,
1628 bch2_btree_node_iter_bset_pos(iter, b, t));
1630 (!prev || bkey_iter_cmp(b, k, prev) > 0)) {
1632 end = t->end_offset;
1640 * We're manually memmoving instead of just calling sort() to ensure the
1641 * prev we picked ends up in slot 0 - sort won't necessarily put it
1642 * there because of duplicate deleted keys:
1644 btree_node_iter_for_each(iter, set)
1645 if (set->end == end)
1648 BUG_ON(set != &iter->data[__btree_node_iter_used(iter)]);
1650 BUG_ON(set >= iter->data + ARRAY_SIZE(iter->data));
1652 memmove(&iter->data[1],
1654 (void *) set - (void *) &iter->data[0]);
1656 iter->data[0].k = __btree_node_key_to_offset(b, prev);
1657 iter->data[0].end = end;
1659 if (btree_keys_expensive_checks(b))
1660 bch2_btree_node_iter_verify(iter, b);
1664 struct bkey_packed *bch2_btree_node_iter_prev_filter(struct btree_node_iter *iter,
1666 unsigned min_key_type)
1668 struct bkey_packed *prev;
1671 prev = bch2_btree_node_iter_prev_all(iter, b);
1672 } while (prev && prev->type < min_key_type);
1677 struct bkey_s_c bch2_btree_node_iter_peek_unpack(struct btree_node_iter *iter,
1681 struct bkey_packed *k = bch2_btree_node_iter_peek(iter, b);
1683 return k ? bkey_disassemble(b, k, u) : bkey_s_c_null;
1688 void bch2_btree_keys_stats(struct btree *b, struct bset_stats *stats)
1690 struct bset_tree *t;
1692 for_each_bset(b, t) {
1693 enum bset_aux_tree_type type = bset_aux_tree_type(t);
1696 stats->sets[type].nr++;
1697 stats->sets[type].bytes += le16_to_cpu(bset(b, t)->u64s) *
1700 if (bset_has_ro_aux_tree(t)) {
1701 stats->floats += t->size - 1;
1703 for (j = 1; j < t->size; j++)
1705 bkey_float(b, t, j)->exponent ==
1711 void bch2_bfloat_to_text(struct printbuf *out, struct btree *b,
1712 struct bkey_packed *k)
1714 struct bset_tree *t = bch2_bkey_to_bset(b, k);
1716 unsigned j, inorder;
1718 if (out->pos != out->end)
1721 if (!bset_has_ro_aux_tree(t))
1724 inorder = bkey_to_cacheline(b, t, k);
1725 if (!inorder || inorder >= t->size)
1728 j = __inorder_to_eytzinger1(inorder, t->size, t->extra);
1729 if (k != tree_to_bkey(b, t, j))
1732 switch (bkey_float(b, t, j)->exponent) {
1734 uk = bkey_unpack_key(b, k);
1736 " failed unpacked at depth %u\n"
1739 uk.p.inode, uk.p.offset);