Lines Matching full:t
107 for_each_bset(b, t) in bch2_dump_btree_node()
108 bch2_dump_bset(c, b, bset(b, t), t - b->set); in bch2_dump_btree_node()
123 struct bset_tree *t = bch2_bkey_to_bset(b, k); in bch2_dump_btree_node_iter() local
129 t - b->set, set->k, buf.buf); in bch2_dump_btree_node_iter()
140 for_each_bset(b, t) in bch2_btree_node_count_keys()
141 bset_tree_for_each_key(b, t, k) in bch2_btree_node_count_keys()
143 btree_keys_account_key_add(&nr, t - b->set, k); in bch2_btree_node_count_keys()
185 struct bset_tree *t = bch2_bkey_to_bset(b, k2); in bch2_btree_node_iter_next_check() local
186 printk(" [%zi %zi]", t - b->set, in bch2_btree_node_iter_next_check()
187 k2->_data - bset(b, t)->_data); in bch2_btree_node_iter_next_check()
211 for_each_bset(b, t) in bch2_btree_node_iter_verify()
212 if (set->end == t->end_offset) { in bch2_btree_node_iter_verify()
213 BUG_ON(set->k < btree_bkey_first_offset(t) || in bch2_btree_node_iter_verify()
214 set->k >= t->end_offset); in bch2_btree_node_iter_verify()
229 for_each_bset(b, t) { in bch2_btree_node_iter_verify()
230 if (iter->data[0].end == t->end_offset) in bch2_btree_node_iter_verify()
233 p = bch2_bkey_prev_all(b, t, in bch2_btree_node_iter_verify()
234 bch2_btree_node_iter_bset_pos(iter, b, t)); in bch2_btree_node_iter_verify()
243 struct bset_tree *t = bch2_bkey_to_bset(b, where); in bch2_verify_insert_pos() local
244 struct bkey_packed *prev = bch2_bkey_prev_all(b, t, where); in bch2_verify_insert_pos()
268 BUG_ON(next != btree_bkey_last(b, t) && in bch2_verify_insert_pos()
271 if (next != btree_bkey_last(b, t) && in bch2_verify_insert_pos()
317 static unsigned bset_aux_tree_buf_end(const struct bset_tree *t) in bset_aux_tree_buf_end() argument
319 BUG_ON(t->aux_data_offset == U16_MAX); in bset_aux_tree_buf_end()
321 switch (bset_aux_tree_type(t)) { in bset_aux_tree_buf_end()
323 return t->aux_data_offset; in bset_aux_tree_buf_end()
325 return t->aux_data_offset + in bset_aux_tree_buf_end()
326 DIV_ROUND_UP(t->size * sizeof(struct bkey_float), 8); in bset_aux_tree_buf_end()
328 return t->aux_data_offset + in bset_aux_tree_buf_end()
329 DIV_ROUND_UP(sizeof(struct rw_aux_tree) * t->size, 8); in bset_aux_tree_buf_end()
336 const struct bset_tree *t) in bset_aux_tree_buf_start() argument
338 return t == b->set in bset_aux_tree_buf_start()
340 : bset_aux_tree_buf_end(t - 1); in bset_aux_tree_buf_start()
344 const struct bset_tree *t) in __aux_tree_base() argument
346 return b->aux_data + t->aux_data_offset * 8; in __aux_tree_base()
350 const struct bset_tree *t) in ro_aux_tree_base() argument
352 EBUG_ON(bset_aux_tree_type(t) != BSET_RO_AUX_TREE); in ro_aux_tree_base()
354 return __aux_tree_base(b, t); in ro_aux_tree_base()
358 const struct bset_tree *t, in bkey_float() argument
361 return ro_aux_tree_base(b, t)->f + idx; in bkey_float()
367 for_each_bset(b, t) { in bset_aux_tree_verify()
368 if (t->aux_data_offset == U16_MAX) in bset_aux_tree_verify()
371 BUG_ON(t != b->set && in bset_aux_tree_verify()
372 t[-1].aux_data_offset == U16_MAX); in bset_aux_tree_verify()
374 BUG_ON(t->aux_data_offset < bset_aux_tree_buf_start(b, t)); in bset_aux_tree_verify()
375 BUG_ON(t->aux_data_offset > btree_aux_data_u64s(b)); in bset_aux_tree_verify()
376 BUG_ON(bset_aux_tree_buf_end(t) > btree_aux_data_u64s(b)); in bset_aux_tree_verify()
399 * t->tree is a binary search tree in an array; each node corresponds to a key
400 * in one cacheline in t->set (BSET_CACHELINE bytes).
402 * This means we don't have to store the full index of the key that a node in
412 * bits we're going to store in bkey_float->mantissa. t->prev[j] stores the size
413 * of the previous key so we can walk backwards to it from t->tree[j]'s key.
417 const struct bset_tree *t, in bset_cacheline() argument
420 return (void *) round_down((unsigned long) btree_bkey_first(b, t), in bset_cacheline()
426 const struct bset_tree *t, in cacheline_to_bkey() argument
430 return bset_cacheline(b, t, cacheline) + offset * 8; in cacheline_to_bkey()
434 const struct bset_tree *t, in bkey_to_cacheline() argument
437 return ((void *) k - bset_cacheline(b, t, 0)) / BSET_CACHELINE; in bkey_to_cacheline()
441 const struct bset_tree *t, in __bkey_to_cacheline_offset() argument
445 return (u64 *) k - (u64 *) bset_cacheline(b, t, cacheline); in __bkey_to_cacheline_offset()
449 const struct bset_tree *t, in bkey_to_cacheline_offset() argument
453 size_t m = __bkey_to_cacheline_offset(b, t, cacheline, k); in bkey_to_cacheline_offset()
460 const struct bset_tree *t, in tree_to_bkey() argument
463 return cacheline_to_bkey(b, t, in tree_to_bkey()
464 __eytzinger1_to_inorder(j, t->size - 1, t->extra), in tree_to_bkey()
465 bkey_float(b, t, j)->key_offset); in tree_to_bkey()
469 const struct bset_tree *t) in rw_aux_tree() argument
471 EBUG_ON(bset_aux_tree_type(t) != BSET_RW_AUX_TREE); in rw_aux_tree()
473 return __aux_tree_base(b, t); in rw_aux_tree()
477 * For the write set - the one we're currently inserting keys into - we don't
478 * maintain a full search tree, we just keep a simple lookup table in t->prev.
481 struct bset_tree *t, in rw_aux_to_bkey() argument
484 return __btree_node_offset_to_key(b, rw_aux_tree(b, t)[j].offset); in rw_aux_to_bkey()
487 static void rw_aux_tree_set(const struct btree *b, struct bset_tree *t, in rw_aux_tree_set() argument
490 EBUG_ON(k >= btree_bkey_last(b, t)); in rw_aux_tree_set()
492 rw_aux_tree(b, t)[j] = (struct rw_aux_tree) { in rw_aux_tree_set()
499 struct bset_tree *t) in bch2_bset_verify_rw_aux_tree() argument
501 struct bkey_packed *k = btree_bkey_first(b, t); in bch2_bset_verify_rw_aux_tree()
507 BUG_ON(bset_has_ro_aux_tree(t)); in bch2_bset_verify_rw_aux_tree()
509 if (!bset_has_rw_aux_tree(t)) in bch2_bset_verify_rw_aux_tree()
512 BUG_ON(t->size < 1); in bch2_bset_verify_rw_aux_tree()
513 BUG_ON(rw_aux_to_bkey(b, t, j) != k); in bch2_bset_verify_rw_aux_tree()
517 if (rw_aux_to_bkey(b, t, j) == k) { in bch2_bset_verify_rw_aux_tree()
518 BUG_ON(!bpos_eq(rw_aux_tree(b, t)[j].k, in bch2_bset_verify_rw_aux_tree()
521 if (++j == t->size) in bch2_bset_verify_rw_aux_tree()
524 BUG_ON(rw_aux_tree(b, t)[j].offset <= in bch2_bset_verify_rw_aux_tree()
525 rw_aux_tree(b, t)[j - 1].offset); in bch2_bset_verify_rw_aux_tree()
529 BUG_ON(k >= btree_bkey_last(b, t)); in bch2_bset_verify_rw_aux_tree()
535 struct bset_tree *t, in rw_aux_tree_bsearch() argument
538 unsigned bset_offs = offset - btree_bkey_first_offset(t); in rw_aux_tree_bsearch()
539 unsigned bset_u64s = t->end_offset - btree_bkey_first_offset(t); in rw_aux_tree_bsearch()
540 unsigned idx = bset_u64s ? bset_offs * t->size / bset_u64s : 0; in rw_aux_tree_bsearch()
542 EBUG_ON(bset_aux_tree_type(t) != BSET_RW_AUX_TREE); in rw_aux_tree_bsearch()
543 EBUG_ON(!t->size); in rw_aux_tree_bsearch()
544 EBUG_ON(idx > t->size); in rw_aux_tree_bsearch()
546 while (idx < t->size && in rw_aux_tree_bsearch()
547 rw_aux_tree(b, t)[idx].offset < offset) in rw_aux_tree_bsearch()
551 rw_aux_tree(b, t)[idx - 1].offset >= offset) in rw_aux_tree_bsearch()
554 EBUG_ON(idx < t->size && in rw_aux_tree_bsearch()
555 rw_aux_tree(b, t)[idx].offset < offset); in rw_aux_tree_bsearch()
556 EBUG_ON(idx && rw_aux_tree(b, t)[idx - 1].offset >= offset); in rw_aux_tree_bsearch()
557 EBUG_ON(idx + 1 < t->size && in rw_aux_tree_bsearch()
558 rw_aux_tree(b, t)[idx].offset == in rw_aux_tree_bsearch()
559 rw_aux_tree(b, t)[idx + 1].offset); in rw_aux_tree_bsearch()
587 static __always_inline void make_bfloat(struct btree *b, struct bset_tree *t, in make_bfloat() argument
592 struct bkey_float *f = bkey_float(b, t, j); in make_bfloat()
593 struct bkey_packed *m = tree_to_bkey(b, t, j); in make_bfloat()
596 : tree_to_bkey(b, t, j >> ffs(j)); in make_bfloat()
599 : tree_to_bkey(b, t, j >> (ffz(j) + 1)); in make_bfloat()
660 static unsigned __bset_tree_capacity(struct btree *b, const struct bset_tree *t) in __bset_tree_capacity() argument
664 return btree_aux_data_bytes(b) - t->aux_data_offset * sizeof(u64); in __bset_tree_capacity()
667 static unsigned bset_ro_tree_capacity(struct btree *b, const struct bset_tree *t) in bset_ro_tree_capacity() argument
669 return __bset_tree_capacity(b, t) / sizeof(struct bkey_float); in bset_ro_tree_capacity()
672 static unsigned bset_rw_tree_capacity(struct btree *b, const struct bset_tree *t) in bset_rw_tree_capacity() argument
674 return __bset_tree_capacity(b, t) / sizeof(struct rw_aux_tree); in bset_rw_tree_capacity()
677 static noinline void __build_rw_aux_tree(struct btree *b, struct bset_tree *t) in __build_rw_aux_tree() argument
681 t->size = 1; in __build_rw_aux_tree()
682 t->extra = BSET_RW_AUX_TREE_VAL; in __build_rw_aux_tree()
683 rw_aux_tree(b, t)[0].offset = in __build_rw_aux_tree()
684 __btree_node_key_to_offset(b, btree_bkey_first(b, t)); in __build_rw_aux_tree()
686 bset_tree_for_each_key(b, t, k) { in __build_rw_aux_tree()
687 if (t->size == bset_rw_tree_capacity(b, t)) in __build_rw_aux_tree()
690 if ((void *) k - (void *) rw_aux_to_bkey(b, t, t->size - 1) > in __build_rw_aux_tree()
692 rw_aux_tree_set(b, t, t->size++, k); in __build_rw_aux_tree()
696 static noinline void __build_ro_aux_tree(struct btree *b, struct bset_tree *t) in __build_ro_aux_tree() argument
698 struct bkey_packed *k = btree_bkey_first(b, t); in __build_ro_aux_tree()
702 t->size = min(bkey_to_cacheline(b, t, btree_bkey_last(b, t)), in __build_ro_aux_tree()
703 bset_ro_tree_capacity(b, t)); in __build_ro_aux_tree()
705 if (t->size < 2) { in __build_ro_aux_tree()
706 t->size = 0; in __build_ro_aux_tree()
707 t->extra = BSET_NO_AUX_TREE_VAL; in __build_ro_aux_tree()
711 t->extra = eytzinger1_extra(t->size - 1); in __build_ro_aux_tree()
714 eytzinger1_for_each(j, t->size - 1) { in __build_ro_aux_tree()
715 while (bkey_to_cacheline(b, t, k) < cacheline) in __build_ro_aux_tree()
718 if (k >= btree_bkey_last(b, t)) { in __build_ro_aux_tree()
720 t->size--; in __build_ro_aux_tree()
724 bkey_float(b, t, j)->key_offset = in __build_ro_aux_tree()
725 bkey_to_cacheline_offset(b, t, cacheline++, k); in __build_ro_aux_tree()
727 EBUG_ON(tree_to_bkey(b, t, j) != k); in __build_ro_aux_tree()
741 eytzinger1_for_each(j, t->size - 1) in __build_ro_aux_tree()
742 make_bfloat(b, t, j, in __build_ro_aux_tree()
747 static void bset_alloc_tree(struct btree *b, struct bset_tree *t) in bset_alloc_tree() argument
751 for (i = b->set; i != t; i++) in bset_alloc_tree()
754 bch2_bset_set_no_aux_tree(b, t); in bset_alloc_tree()
757 t->aux_data_offset = round_up(bset_aux_tree_buf_start(b, t), in bset_alloc_tree()
763 void bch2_bset_build_aux_tree(struct btree *b, struct bset_tree *t, in bch2_bset_build_aux_tree() argument
767 ? bset_has_rw_aux_tree(t) in bch2_bset_build_aux_tree()
768 : bset_has_ro_aux_tree(t)) in bch2_bset_build_aux_tree()
771 bset_alloc_tree(b, t); in bch2_bset_build_aux_tree()
773 if (!__bset_tree_capacity(b, t)) in bch2_bset_build_aux_tree()
777 __build_rw_aux_tree(b, t); in bch2_bset_build_aux_tree()
779 __build_ro_aux_tree(b, t); in bch2_bset_build_aux_tree()
786 struct bset_tree *t; in bch2_bset_init_first() local
794 t = &b->set[b->nsets++]; in bch2_bset_init_first()
795 set_btree_bset(b, t, i); in bch2_bset_init_first()
801 struct bset_tree *t; in bch2_bset_init_next() local
811 t = &b->set[b->nsets++]; in bch2_bset_init_next()
812 set_btree_bset(b, t, i); in bch2_bset_init_next()
819 static struct bkey_packed *__bkey_prev(struct btree *b, struct bset_tree *t, in __bkey_prev() argument
826 EBUG_ON(k < btree_bkey_first(b, t) || in __bkey_prev()
827 k > btree_bkey_last(b, t)); in __bkey_prev()
829 if (k == btree_bkey_first(b, t)) in __bkey_prev()
832 switch (bset_aux_tree_type(t)) { in __bkey_prev()
834 p = btree_bkey_first(b, t); in __bkey_prev()
837 j = min_t(unsigned, t->size - 1, bkey_to_cacheline(b, t, k)); in __bkey_prev()
840 p = j ? tree_to_bkey(b, t, in __bkey_prev()
842 t->size - 1, t->extra)) in __bkey_prev()
843 : btree_bkey_first(b, t); in __bkey_prev()
848 j = rw_aux_tree_bsearch(b, t, offset); in __bkey_prev()
849 p = j ? rw_aux_to_bkey(b, t, j - 1) in __bkey_prev()
850 : btree_bkey_first(b, t); in __bkey_prev()
858 struct bset_tree *t, in bch2_bkey_prev_filter() argument
864 while ((p = __bkey_prev(b, t, k)) && !ret) { in bch2_bkey_prev_filter()
877 : btree_bkey_first(b, t); in bch2_bkey_prev_filter()
889 struct bset_tree *t, in rw_aux_tree_insert_entry() argument
892 EBUG_ON(!idx || idx > t->size); in rw_aux_tree_insert_entry()
893 struct bkey_packed *start = rw_aux_to_bkey(b, t, idx - 1); in rw_aux_tree_insert_entry()
894 struct bkey_packed *end = idx < t->size in rw_aux_tree_insert_entry()
895 ? rw_aux_to_bkey(b, t, idx) in rw_aux_tree_insert_entry()
896 : btree_bkey_last(b, t); in rw_aux_tree_insert_entry()
898 if (t->size < bset_rw_tree_capacity(b, t) && in rw_aux_tree_insert_entry()
908 memmove(&rw_aux_tree(b, t)[idx + 1], in rw_aux_tree_insert_entry()
909 &rw_aux_tree(b, t)[idx], in rw_aux_tree_insert_entry()
910 (void *) &rw_aux_tree(b, t)[t->size] - in rw_aux_tree_insert_entry()
911 (void *) &rw_aux_tree(b, t)[idx]); in rw_aux_tree_insert_entry()
912 t->size++; in rw_aux_tree_insert_entry()
913 rw_aux_tree_set(b, t, idx, k); in rw_aux_tree_insert_entry()
921 struct bset_tree *t, in bch2_bset_fix_lookup_table() argument
929 EBUG_ON(bset_has_ro_aux_tree(t)); in bch2_bset_fix_lookup_table()
931 if (!bset_has_rw_aux_tree(t)) in bch2_bset_fix_lookup_table()
934 if (where > rw_aux_tree(b, t)[t->size - 1].offset) { in bch2_bset_fix_lookup_table()
935 rw_aux_tree_insert_entry(b, t, t->size); in bch2_bset_fix_lookup_table()
940 idx = rw_aux_tree_bsearch(b, t, where); in bch2_bset_fix_lookup_table()
942 if (rw_aux_tree(b, t)[idx].offset == where) { in bch2_bset_fix_lookup_table()
945 } else if (where < t->end_offset) { in bch2_bset_fix_lookup_table()
946 rw_aux_tree_set(b, t, idx++, _where); in bch2_bset_fix_lookup_table()
948 EBUG_ON(where != t->end_offset); in bch2_bset_fix_lookup_table()
949 rw_aux_tree_insert_entry(b, t, --t->size); in bch2_bset_fix_lookup_table()
954 EBUG_ON(idx < t->size && rw_aux_tree(b, t)[idx].offset <= where); in bch2_bset_fix_lookup_table()
955 if (idx < t->size && in bch2_bset_fix_lookup_table()
956 rw_aux_tree(b, t)[idx].offset + shift == in bch2_bset_fix_lookup_table()
957 rw_aux_tree(b, t)[idx - 1].offset) { in bch2_bset_fix_lookup_table()
958 memmove(&rw_aux_tree(b, t)[idx], in bch2_bset_fix_lookup_table()
959 &rw_aux_tree(b, t)[idx + 1], in bch2_bset_fix_lookup_table()
960 (void *) &rw_aux_tree(b, t)[t->size] - in bch2_bset_fix_lookup_table()
961 (void *) &rw_aux_tree(b, t)[idx + 1]); in bch2_bset_fix_lookup_table()
962 t->size -= 1; in bch2_bset_fix_lookup_table()
965 for (j = idx; j < t->size; j++) in bch2_bset_fix_lookup_table()
966 rw_aux_tree(b, t)[j].offset += shift; in bch2_bset_fix_lookup_table()
968 EBUG_ON(idx < t->size && in bch2_bset_fix_lookup_table()
969 rw_aux_tree(b, t)[idx].offset == in bch2_bset_fix_lookup_table()
970 rw_aux_tree(b, t)[idx - 1].offset); in bch2_bset_fix_lookup_table()
972 rw_aux_tree_insert_entry(b, t, idx); in bch2_bset_fix_lookup_table()
975 bch2_bset_verify_rw_aux_tree(b, t); in bch2_bset_fix_lookup_table()
985 struct bset_tree *t = bset_tree_last(b); in bch2_bset_insert() local
988 bch2_bset_verify_rw_aux_tree(b, t); in bch2_bset_insert()
995 btree_keys_account_key_add(&b->nr, t - b->set, src); in bch2_bset_insert()
1001 EBUG_ON((int) le16_to_cpu(bset(b, t)->u64s) < in bch2_bset_insert()
1004 memmove_u64s(dst_p, src_p, btree_bkey_last(b, t)->_data - src_p); in bch2_bset_insert()
1005 le16_add_cpu(&bset(b, t)->u64s, src->u64s - clobber_u64s); in bch2_bset_insert()
1006 set_btree_bset_end(b, t); in bch2_bset_insert()
1015 bch2_bset_fix_lookup_table(b, t, where, clobber_u64s, src->u64s); in bch2_bset_insert()
1024 struct bset_tree *t = bset_tree_last(b); in bch2_bset_delete() local
1028 bch2_bset_verify_rw_aux_tree(b, t); in bch2_bset_delete()
1030 EBUG_ON(le16_to_cpu(bset(b, t)->u64s) < clobber_u64s); in bch2_bset_delete()
1032 memmove_u64s_down(dst_p, src_p, btree_bkey_last(b, t)->_data - src_p); in bch2_bset_delete()
1033 le16_add_cpu(&bset(b, t)->u64s, -clobber_u64s); in bch2_bset_delete()
1034 set_btree_bset_end(b, t); in bch2_bset_delete()
1036 bch2_bset_fix_lookup_table(b, t, where, clobber_u64s, 0); in bch2_bset_delete()
1043 struct bset_tree *t, in bset_search_write_set() argument
1046 unsigned l = 0, r = t->size; in bset_search_write_set()
1051 if (bpos_lt(rw_aux_tree(b, t)[m].k, *search)) in bset_search_write_set()
1057 return rw_aux_to_bkey(b, t, l); in bset_search_write_set()
1093 const struct bset_tree *t, in bset_search_tree() argument
1097 struct ro_aux_tree *base = ro_aux_tree_base(b, t); in bset_search_tree()
1104 if (likely(n << 4 < t->size)) in bset_search_tree()
1120 k = tree_to_bkey(b, t, n); in bset_search_tree()
1126 } while (n < t->size); in bset_search_tree()
1128 inorder = __eytzinger1_to_inorder(n >> 1, t->size - 1, t->extra); in bset_search_tree()
1137 return btree_bkey_first(b, t); in bset_search_tree()
1139 f = &base->f[eytzinger1_prev(n >> 1, t->size - 1)]; in bset_search_tree()
1142 return cacheline_to_bkey(b, t, inorder, f->key_offset); in bset_search_tree()
1147 struct bset_tree *t, in __bch2_bset_search() argument
1167 switch (bset_aux_tree_type(t)) { in __bch2_bset_search()
1169 return btree_bkey_first(b, t); in __bch2_bset_search()
1171 return bset_search_write_set(b, t, search); in __bch2_bset_search()
1173 return bset_search_tree(b, t, search, lossy_packed_search); in __bch2_bset_search()
1181 struct bset_tree *t, in bch2_bset_search_linear() argument
1188 while (m != btree_bkey_last(b, t) && in bch2_bset_search_linear()
1194 while (m != btree_bkey_last(b, t) && in bch2_bset_search_linear()
1199 struct bkey_packed *prev = bch2_bkey_prev_all(b, t, m); in bch2_bset_search_linear()
1266 * When you don't filter out deleted keys, btree nodes _do_ contain duplicate
1267 * keys. This doesn't matter for most code, but it does matter for lookups.
1272 * If you search for k, the lookup code isn't guaranteed to return you any
1280 * btree_node_iter_cmp(), keys_out_of_order(). So the duplicates you don't
1281 * see will only be deleted keys you don't care about.
1288 * But this does mean that we can't just search for
1331 struct bset_tree *t = b->set + i; in bch2_btree_node_iter_init() local
1332 struct bkey_packed *end = btree_bkey_last(b, t); in bch2_btree_node_iter_init()
1334 k[i] = bch2_bset_search_linear(b, t, search, in bch2_btree_node_iter_init()
1351 for_each_bset(b, t) in bch2_btree_node_iter_init_from_start()
1353 btree_bkey_first(b, t), in bch2_btree_node_iter_init_from_start()
1354 btree_bkey_last(b, t)); in bch2_btree_node_iter_init_from_start()
1360 struct bset_tree *t) in bch2_btree_node_iter_bset_pos() argument
1365 if (set->end == t->end_offset) in bch2_btree_node_iter_bset_pos()
1368 return btree_bkey_last(b, t); in bch2_btree_node_iter_bset_pos()
1459 for_each_bset(b, t) { in bch2_btree_node_iter_prev_all()
1460 k = bch2_bkey_prev_all(b, t, in bch2_btree_node_iter_prev_all()
1461 bch2_btree_node_iter_bset_pos(iter, b, t)); in bch2_btree_node_iter_prev_all()
1465 end = t->end_offset; in bch2_btree_node_iter_prev_all()
1474 * prev we picked ends up in slot 0 - sort won't necessarily put it in bch2_btree_node_iter_prev_all()
1522 for_each_bset_c(b, t) { in bch2_btree_keys_stats()
1523 enum bset_aux_tree_type type = bset_aux_tree_type(t); in bch2_btree_keys_stats()
1527 stats->sets[type].bytes += le16_to_cpu(bset(b, t)->u64s) * in bch2_btree_keys_stats()
1530 if (bset_has_ro_aux_tree(t)) { in bch2_btree_keys_stats()
1531 stats->floats += t->size - 1; in bch2_btree_keys_stats()
1533 for (j = 1; j < t->size; j++) in bch2_btree_keys_stats()
1535 bkey_float(b, t, j)->exponent == in bch2_btree_keys_stats()
1544 struct bset_tree *t = bch2_bkey_to_bset(b, k); in bch2_bfloat_to_text() local
1548 if (!bset_has_ro_aux_tree(t)) in bch2_bfloat_to_text()
1551 inorder = bkey_to_cacheline(b, t, k); in bch2_bfloat_to_text()
1552 if (!inorder || inorder >= t->size) in bch2_bfloat_to_text()
1555 j = __inorder_to_eytzinger1(inorder, t->size - 1, t->extra); in bch2_bfloat_to_text()
1556 if (k != tree_to_bkey(b, t, j)) in bch2_bfloat_to_text()
1559 switch (bkey_float(b, t, j)->exponent) { in bch2_bfloat_to_text()
1564 "\t", in bch2_bfloat_to_text()