Lines Matching full:b
34 struct bset_tree *bch2_bkey_to_bset(struct btree *b, struct bkey_packed *k) in bch2_bkey_to_bset() argument
36 return bch2_bkey_to_bset_inlined(b, k); in bch2_bkey_to_bset()
55 void bch2_dump_bset(struct bch_fs *c, struct btree *b, in bch2_dump_bset() argument
77 k = bkey_disassemble(b, _k, &uk); in bch2_dump_bset()
90 n = bkey_unpack_key(b, _n); in bch2_dump_bset()
104 void bch2_dump_btree_node(struct bch_fs *c, struct btree *b) in bch2_dump_btree_node() argument
109 for_each_bset(b, t) in bch2_dump_btree_node()
110 bch2_dump_bset(c, b, bset(b, t), t - b->set); in bch2_dump_btree_node()
114 void bch2_dump_btree_node_iter(struct btree *b, in bch2_dump_btree_node_iter() argument
121 __btree_node_iter_used(iter), b->nsets); in bch2_dump_btree_node_iter()
124 struct bkey_packed *k = __btree_node_offset_to_key(b, set->k); in bch2_dump_btree_node_iter()
125 struct bset_tree *t = bch2_bkey_to_bset(b, k); in bch2_dump_btree_node_iter()
126 struct bkey uk = bkey_unpack_key(b, k); in bch2_dump_btree_node_iter()
131 t - b->set, set->k, buf.buf); in bch2_dump_btree_node_iter()
139 void __bch2_verify_btree_nr_keys(struct btree *b) in __bch2_verify_btree_nr_keys() argument
145 for_each_bset(b, t) in __bch2_verify_btree_nr_keys()
146 bset_tree_for_each_key(b, t, k) in __bch2_verify_btree_nr_keys()
148 btree_keys_account_key_add(&nr, t - b->set, k); in __bch2_verify_btree_nr_keys()
150 BUG_ON(memcmp(&nr, &b->nr, sizeof(nr))); in __bch2_verify_btree_nr_keys()
154 struct btree *b) in bch2_btree_node_iter_next_check() argument
159 k = bch2_btree_node_iter_peek_all(&iter, b); in bch2_btree_node_iter_next_check()
160 __bch2_btree_node_iter_advance(&iter, b); in bch2_btree_node_iter_next_check()
161 n = bch2_btree_node_iter_peek_all(&iter, b); in bch2_btree_node_iter_next_check()
163 bkey_unpack_key(b, k); in bch2_btree_node_iter_next_check()
166 bkey_iter_cmp(b, k, n) > 0) { in bch2_btree_node_iter_next_check()
168 struct bkey ku = bkey_unpack_key(b, k); in bch2_btree_node_iter_next_check()
169 struct bkey nu = bkey_unpack_key(b, n); in bch2_btree_node_iter_next_check()
173 bch2_dump_btree_node(NULL, b); in bch2_btree_node_iter_next_check()
181 struct bkey_packed *k2 = __btree_node_offset_to_key(b, set->k); in bch2_btree_node_iter_next_check()
182 struct bset_tree *t = bch2_bkey_to_bset(b, k2); in bch2_btree_node_iter_next_check()
183 printk(" [%zi %zi]", t - b->set, in bch2_btree_node_iter_next_check()
184 k2->_data - bset(b, t)->_data); in bch2_btree_node_iter_next_check()
191 struct btree *b) in bch2_btree_node_iter_verify() argument
209 for_each_bset(b, t) in bch2_btree_node_iter_verify()
221 btree_node_iter_cmp(b, set[-1], set[0]) > 0); in bch2_btree_node_iter_verify()
223 k = bch2_btree_node_iter_peek_all(iter, b); in bch2_btree_node_iter_verify()
225 for_each_bset(b, t) { in bch2_btree_node_iter_verify()
229 p = bch2_bkey_prev_all(b, t, in bch2_btree_node_iter_verify()
230 bch2_btree_node_iter_bset_pos(iter, b, t)); in bch2_btree_node_iter_verify()
232 BUG_ON(p && bkey_iter_cmp(b, k, p) < 0); in bch2_btree_node_iter_verify()
236 void bch2_verify_insert_pos(struct btree *b, struct bkey_packed *where, in bch2_verify_insert_pos() argument
239 struct bset_tree *t = bch2_bkey_to_bset(b, where); in bch2_verify_insert_pos()
240 struct bkey_packed *prev = bch2_bkey_prev_all(b, t, where); in bch2_verify_insert_pos()
246 bkey_iter_cmp(b, prev, insert) > 0); in bch2_verify_insert_pos()
249 bkey_iter_cmp(b, prev, insert) > 0) { in bch2_verify_insert_pos()
250 struct bkey k1 = bkey_unpack_key(b, prev); in bch2_verify_insert_pos()
251 struct bkey k2 = bkey_unpack_key(b, insert); in bch2_verify_insert_pos()
253 bch2_dump_btree_node(NULL, b); in bch2_verify_insert_pos()
264 BUG_ON(next != btree_bkey_last(b, t) && in bch2_verify_insert_pos()
265 bkey_iter_cmp(b, insert, next) > 0); in bch2_verify_insert_pos()
267 if (next != btree_bkey_last(b, t) && in bch2_verify_insert_pos()
268 bkey_iter_cmp(b, insert, next) > 0) { in bch2_verify_insert_pos()
269 struct bkey k1 = bkey_unpack_key(b, insert); in bch2_verify_insert_pos()
270 struct bkey k2 = bkey_unpack_key(b, next); in bch2_verify_insert_pos()
272 bch2_dump_btree_node(NULL, b); in bch2_verify_insert_pos()
287 struct btree *b) {} in bch2_btree_node_iter_next_check() argument
337 static unsigned bset_aux_tree_buf_start(const struct btree *b, in bset_aux_tree_buf_start() argument
340 return t == b->set in bset_aux_tree_buf_start()
341 ? DIV_ROUND_UP(b->unpack_fn_len, 8) in bset_aux_tree_buf_start()
345 static void *__aux_tree_base(const struct btree *b, in __aux_tree_base() argument
348 return b->aux_data + t->aux_data_offset * 8; in __aux_tree_base()
351 static struct ro_aux_tree *ro_aux_tree_base(const struct btree *b, in ro_aux_tree_base() argument
356 return __aux_tree_base(b, t); in ro_aux_tree_base()
359 static u8 *ro_aux_tree_prev(const struct btree *b, in ro_aux_tree_prev() argument
364 return __aux_tree_base(b, t) + bkey_float_byte_offset(t->size); in ro_aux_tree_prev()
367 static struct bkey_float *bkey_float(const struct btree *b, in bkey_float() argument
371 return ro_aux_tree_base(b, t)->f + idx; in bkey_float()
374 static void bset_aux_tree_verify(const struct btree *b) in bset_aux_tree_verify() argument
379 for_each_bset(b, t) { in bset_aux_tree_verify()
383 BUG_ON(t != b->set && in bset_aux_tree_verify()
386 BUG_ON(t->aux_data_offset < bset_aux_tree_buf_start(b, t)); in bset_aux_tree_verify()
387 BUG_ON(t->aux_data_offset > btree_aux_data_u64s(b)); in bset_aux_tree_verify()
388 BUG_ON(bset_aux_tree_buf_end(t) > btree_aux_data_u64s(b)); in bset_aux_tree_verify()
393 void bch2_btree_keys_init(struct btree *b) in bch2_btree_keys_init() argument
397 b->nsets = 0; in bch2_btree_keys_init()
398 memset(&b->nr, 0, sizeof(b->nr)); in bch2_btree_keys_init()
401 b->set[i].data_offset = U16_MAX; in bch2_btree_keys_init()
403 bch2_bset_set_no_aux_tree(b, b->set); in bch2_btree_keys_init()
428 static inline void *bset_cacheline(const struct btree *b, in bset_cacheline() argument
432 return (void *) round_down((unsigned long) btree_bkey_first(b, t), in bset_cacheline()
437 static struct bkey_packed *cacheline_to_bkey(const struct btree *b, in cacheline_to_bkey() argument
442 return bset_cacheline(b, t, cacheline) + offset * 8; in cacheline_to_bkey()
445 static unsigned bkey_to_cacheline(const struct btree *b, in bkey_to_cacheline() argument
449 return ((void *) k - bset_cacheline(b, t, 0)) / BSET_CACHELINE; in bkey_to_cacheline()
452 static ssize_t __bkey_to_cacheline_offset(const struct btree *b, in __bkey_to_cacheline_offset() argument
457 return (u64 *) k - (u64 *) bset_cacheline(b, t, cacheline); in __bkey_to_cacheline_offset()
460 static unsigned bkey_to_cacheline_offset(const struct btree *b, in bkey_to_cacheline_offset() argument
465 size_t m = __bkey_to_cacheline_offset(b, t, cacheline, k); in bkey_to_cacheline_offset()
471 static inline struct bkey_packed *tree_to_bkey(const struct btree *b, in tree_to_bkey() argument
475 return cacheline_to_bkey(b, t, in tree_to_bkey()
477 bkey_float(b, t, j)->key_offset); in tree_to_bkey()
480 static struct bkey_packed *tree_to_prev_bkey(const struct btree *b, in tree_to_prev_bkey() argument
484 unsigned prev_u64s = ro_aux_tree_prev(b, t)[j]; in tree_to_prev_bkey()
486 return (void *) ((u64 *) tree_to_bkey(b, t, j)->_data - prev_u64s); in tree_to_prev_bkey()
489 static struct rw_aux_tree *rw_aux_tree(const struct btree *b, in rw_aux_tree() argument
494 return __aux_tree_base(b, t); in rw_aux_tree()
501 static struct bkey_packed *rw_aux_to_bkey(const struct btree *b, in rw_aux_to_bkey() argument
505 return __btree_node_offset_to_key(b, rw_aux_tree(b, t)[j].offset); in rw_aux_to_bkey()
508 static void rw_aux_tree_set(const struct btree *b, struct bset_tree *t, in rw_aux_tree_set() argument
511 EBUG_ON(k >= btree_bkey_last(b, t)); in rw_aux_tree_set()
513 rw_aux_tree(b, t)[j] = (struct rw_aux_tree) { in rw_aux_tree_set()
514 .offset = __btree_node_key_to_offset(b, k), in rw_aux_tree_set()
515 .k = bkey_unpack_pos(b, k), in rw_aux_tree_set()
519 static void bch2_bset_verify_rw_aux_tree(struct btree *b, in bch2_bset_verify_rw_aux_tree() argument
522 struct bkey_packed *k = btree_bkey_first(b, t); in bch2_bset_verify_rw_aux_tree()
534 BUG_ON(rw_aux_to_bkey(b, t, j) != k); in bch2_bset_verify_rw_aux_tree()
538 if (rw_aux_to_bkey(b, t, j) == k) { in bch2_bset_verify_rw_aux_tree()
539 BUG_ON(!bpos_eq(rw_aux_tree(b, t)[j].k, in bch2_bset_verify_rw_aux_tree()
540 bkey_unpack_pos(b, k))); in bch2_bset_verify_rw_aux_tree()
545 BUG_ON(rw_aux_tree(b, t)[j].offset <= in bch2_bset_verify_rw_aux_tree()
546 rw_aux_tree(b, t)[j - 1].offset); in bch2_bset_verify_rw_aux_tree()
550 BUG_ON(k >= btree_bkey_last(b, t)); in bch2_bset_verify_rw_aux_tree()
555 static unsigned rw_aux_tree_bsearch(struct btree *b, in rw_aux_tree_bsearch() argument
568 rw_aux_tree(b, t)[idx].offset < offset) in rw_aux_tree_bsearch()
572 rw_aux_tree(b, t)[idx - 1].offset >= offset) in rw_aux_tree_bsearch()
576 rw_aux_tree(b, t)[idx].offset < offset); in rw_aux_tree_bsearch()
577 EBUG_ON(idx && rw_aux_tree(b, t)[idx - 1].offset >= offset); in rw_aux_tree_bsearch()
579 rw_aux_tree(b, t)[idx].offset == in rw_aux_tree_bsearch()
580 rw_aux_tree(b, t)[idx + 1].offset); in rw_aux_tree_bsearch()
609 static __always_inline void make_bfloat(struct btree *b, struct bset_tree *t, in make_bfloat() argument
614 struct bkey_float *f = bkey_float(b, t, j); in make_bfloat()
615 struct bkey_packed *m = tree_to_bkey(b, t, j); in make_bfloat()
618 : tree_to_prev_bkey(b, t, j >> ffs(j)); in make_bfloat()
621 : tree_to_bkey(b, t, j >> (ffz(j) + 1)); in make_bfloat()
631 !b->nr_key_bits) { in make_bfloat()
646 high_bit = max(bch2_bkey_greatest_differing_bit(b, l, r), in make_bfloat()
647 min_t(unsigned, BKEY_MANTISSA_BITS, b->nr_key_bits) - 1); in make_bfloat()
655 shift = (int) (b->format.key_u64s * 64 - b->nr_key_bits) + exponent; in make_bfloat()
657 EBUG_ON(shift + BKEY_MANTISSA_BITS > b->format.key_u64s * 64); in make_bfloat()
660 b->nr_key_bits - in make_bfloat()
682 static unsigned __bset_tree_capacity(const struct btree *b, const struct bset_tree *t) in __bset_tree_capacity() argument
684 bset_aux_tree_verify(b); in __bset_tree_capacity()
686 return btree_aux_data_bytes(b) - t->aux_data_offset * sizeof(u64); in __bset_tree_capacity()
689 static unsigned bset_ro_tree_capacity(const struct btree *b, const struct bset_tree *t) in bset_ro_tree_capacity() argument
691 return __bset_tree_capacity(b, t) / in bset_ro_tree_capacity()
695 static unsigned bset_rw_tree_capacity(const struct btree *b, const struct bset_tree *t) in bset_rw_tree_capacity() argument
697 return __bset_tree_capacity(b, t) / sizeof(struct rw_aux_tree); in bset_rw_tree_capacity()
700 static noinline void __build_rw_aux_tree(struct btree *b, struct bset_tree *t) in __build_rw_aux_tree() argument
706 rw_aux_tree(b, t)[0].offset = in __build_rw_aux_tree() local
707 __btree_node_key_to_offset(b, btree_bkey_first(b, t)); in __build_rw_aux_tree()
709 bset_tree_for_each_key(b, t, k) { in __build_rw_aux_tree()
710 if (t->size == bset_rw_tree_capacity(b, t)) in __build_rw_aux_tree()
713 if ((void *) k - (void *) rw_aux_to_bkey(b, t, t->size - 1) > in __build_rw_aux_tree()
715 rw_aux_tree_set(b, t, t->size++, k); in __build_rw_aux_tree()
719 static noinline void __build_ro_aux_tree(struct btree *b, struct bset_tree *t) in __build_ro_aux_tree() argument
721 struct bkey_packed *prev = NULL, *k = btree_bkey_first(b, t); in __build_ro_aux_tree()
725 t->size = min(bkey_to_cacheline(b, t, btree_bkey_last(b, t)), in __build_ro_aux_tree()
726 bset_ro_tree_capacity(b, t)); in __build_ro_aux_tree()
738 while (bkey_to_cacheline(b, t, k) < cacheline) in __build_ro_aux_tree()
741 if (k >= btree_bkey_last(b, t)) { in __build_ro_aux_tree()
747 ro_aux_tree_prev(b, t)[j] = prev->u64s; in __build_ro_aux_tree() local
748 bkey_float(b, t, j)->key_offset = in __build_ro_aux_tree()
749 bkey_to_cacheline_offset(b, t, cacheline++, k); in __build_ro_aux_tree()
751 EBUG_ON(tree_to_prev_bkey(b, t, j) != prev); in __build_ro_aux_tree()
752 EBUG_ON(tree_to_bkey(b, t, j) != k); in __build_ro_aux_tree()
755 while (k != btree_bkey_last(b, t)) in __build_ro_aux_tree()
758 if (!bkey_pack_pos(bkey_to_packed(&min_key), b->data->min_key, b)) { in __build_ro_aux_tree()
760 min_key.k.p = b->data->min_key; in __build_ro_aux_tree()
763 if (!bkey_pack_pos(bkey_to_packed(&max_key), b->data->max_key, b)) { in __build_ro_aux_tree()
765 max_key.k.p = b->data->max_key; in __build_ro_aux_tree()
770 make_bfloat(b, t, j, in __build_ro_aux_tree()
775 static void bset_alloc_tree(struct btree *b, struct bset_tree *t) in bset_alloc_tree() argument
779 for (i = b->set; i != t; i++) in bset_alloc_tree()
782 bch2_bset_set_no_aux_tree(b, t); in bset_alloc_tree()
785 t->aux_data_offset = round_up(bset_aux_tree_buf_start(b, t), in bset_alloc_tree()
788 bset_aux_tree_verify(b); in bset_alloc_tree()
791 void bch2_bset_build_aux_tree(struct btree *b, struct bset_tree *t, in bch2_bset_build_aux_tree() argument
799 bset_alloc_tree(b, t); in bch2_bset_build_aux_tree()
801 if (!__bset_tree_capacity(b, t)) in bch2_bset_build_aux_tree()
805 __build_rw_aux_tree(b, t); in bch2_bset_build_aux_tree()
807 __build_ro_aux_tree(b, t); in bch2_bset_build_aux_tree()
809 bset_aux_tree_verify(b); in bch2_bset_build_aux_tree()
812 void bch2_bset_init_first(struct btree *b, struct bset *i) in bch2_bset_init_first() argument
816 BUG_ON(b->nsets); in bch2_bset_init_first()
822 t = &b->set[b->nsets++]; in bch2_bset_init_first()
823 set_btree_bset(b, t, i); in bch2_bset_init_first()
826 void bch2_bset_init_next(struct btree *b, struct btree_node_entry *bne) in bch2_bset_init_next() argument
831 BUG_ON(bset_byte_offset(b, bne) >= btree_buf_bytes(b)); in bch2_bset_init_next()
832 BUG_ON((void *) bne < (void *) btree_bkey_last(b, bset_tree_last(b))); in bch2_bset_init_next()
833 BUG_ON(b->nsets >= MAX_BSETS); in bch2_bset_init_next()
836 i->seq = btree_bset_first(b)->seq; in bch2_bset_init_next()
839 t = &b->set[b->nsets++]; in bch2_bset_init_next()
840 set_btree_bset(b, t, i); in bch2_bset_init_next()
847 static struct bkey_packed *__bkey_prev(struct btree *b, struct bset_tree *t, in __bkey_prev() argument
854 EBUG_ON(k < btree_bkey_first(b, t) || in __bkey_prev()
855 k > btree_bkey_last(b, t)); in __bkey_prev()
857 if (k == btree_bkey_first(b, t)) in __bkey_prev()
862 p = btree_bkey_first(b, t); in __bkey_prev()
865 j = min_t(unsigned, t->size - 1, bkey_to_cacheline(b, t, k)); in __bkey_prev()
868 p = j ? tree_to_bkey(b, t, in __bkey_prev()
871 : btree_bkey_first(b, t); in __bkey_prev()
875 offset = __btree_node_key_to_offset(b, k); in __bkey_prev()
876 j = rw_aux_tree_bsearch(b, t, offset); in __bkey_prev()
877 p = j ? rw_aux_to_bkey(b, t, j - 1) in __bkey_prev()
878 : btree_bkey_first(b, t); in __bkey_prev()
885 struct bkey_packed *bch2_bkey_prev_filter(struct btree *b, in bch2_bkey_prev_filter() argument
892 while ((p = __bkey_prev(b, t, k)) && !ret) { in bch2_bkey_prev_filter()
905 : btree_bkey_first(b, t); in bch2_bkey_prev_filter()
916 static void bch2_bset_fix_lookup_table(struct btree *b, in bch2_bset_fix_lookup_table() argument
923 unsigned l, j, where = __btree_node_key_to_offset(b, _where); in bch2_bset_fix_lookup_table()
931 l = rw_aux_tree_bsearch(b, t, where); in bch2_bset_fix_lookup_table()
937 rw_aux_tree(b, t)[l].offset == where) in bch2_bset_fix_lookup_table()
938 rw_aux_tree_set(b, t, l++, _where); in bch2_bset_fix_lookup_table()
944 rw_aux_tree(b, t)[j].offset < where + clobber_u64s; in bch2_bset_fix_lookup_table()
949 rw_aux_tree(b, t)[j].offset + shift == in bch2_bset_fix_lookup_table()
950 rw_aux_tree(b, t)[l - 1].offset) in bch2_bset_fix_lookup_table()
953 memmove(&rw_aux_tree(b, t)[l], in bch2_bset_fix_lookup_table()
954 &rw_aux_tree(b, t)[j], in bch2_bset_fix_lookup_table()
955 (void *) &rw_aux_tree(b, t)[t->size] - in bch2_bset_fix_lookup_table()
956 (void *) &rw_aux_tree(b, t)[j]); in bch2_bset_fix_lookup_table()
960 rw_aux_tree(b, t)[j].offset += shift; in bch2_bset_fix_lookup_table() local
963 rw_aux_tree(b, t)[l].offset == in bch2_bset_fix_lookup_table()
964 rw_aux_tree(b, t)[l - 1].offset); in bch2_bset_fix_lookup_table()
966 if (t->size < bset_rw_tree_capacity(b, t) && in bch2_bset_fix_lookup_table()
968 ? rw_aux_tree(b, t)[l].offset in bch2_bset_fix_lookup_table()
970 rw_aux_tree(b, t)[l - 1].offset > in bch2_bset_fix_lookup_table()
972 struct bkey_packed *start = rw_aux_to_bkey(b, t, l - 1); in bch2_bset_fix_lookup_table()
974 ? rw_aux_to_bkey(b, t, l) in bch2_bset_fix_lookup_table()
975 : btree_bkey_last(b, t); in bch2_bset_fix_lookup_table()
984 memmove(&rw_aux_tree(b, t)[l + 1], in bch2_bset_fix_lookup_table()
985 &rw_aux_tree(b, t)[l], in bch2_bset_fix_lookup_table()
986 (void *) &rw_aux_tree(b, t)[t->size] - in bch2_bset_fix_lookup_table()
987 (void *) &rw_aux_tree(b, t)[l]); in bch2_bset_fix_lookup_table()
989 rw_aux_tree_set(b, t, l, k); in bch2_bset_fix_lookup_table()
995 bch2_bset_verify_rw_aux_tree(b, t); in bch2_bset_fix_lookup_table()
996 bset_aux_tree_verify(b); in bch2_bset_fix_lookup_table()
999 void bch2_bset_insert(struct btree *b, in bch2_bset_insert() argument
1005 struct bkey_format *f = &b->format; in bch2_bset_insert()
1006 struct bset_tree *t = bset_tree_last(b); in bch2_bset_insert()
1009 bch2_bset_verify_rw_aux_tree(b, t); in bch2_bset_insert()
1010 bch2_verify_insert_pos(b, where, bkey_to_packed(insert), clobber_u64s); in bch2_bset_insert()
1016 btree_keys_account_key_add(&b->nr, t - b->set, src); in bch2_bset_insert()
1022 EBUG_ON((int) le16_to_cpu(bset(b, t)->u64s) < in bch2_bset_insert()
1025 memmove_u64s(dst_p, src_p, btree_bkey_last(b, t)->_data - src_p); in bch2_bset_insert()
1026 le16_add_cpu(&bset(b, t)->u64s, src->u64s - clobber_u64s); in bch2_bset_insert()
1027 set_btree_bset_end(b, t); in bch2_bset_insert()
1036 bch2_bset_fix_lookup_table(b, t, where, clobber_u64s, src->u64s); in bch2_bset_insert()
1038 bch2_verify_btree_nr_keys(b); in bch2_bset_insert()
1041 void bch2_bset_delete(struct btree *b, in bch2_bset_delete() argument
1045 struct bset_tree *t = bset_tree_last(b); in bch2_bset_delete()
1049 bch2_bset_verify_rw_aux_tree(b, t); in bch2_bset_delete()
1051 EBUG_ON(le16_to_cpu(bset(b, t)->u64s) < clobber_u64s); in bch2_bset_delete()
1053 memmove_u64s_down(dst_p, src_p, btree_bkey_last(b, t)->_data - src_p); in bch2_bset_delete()
1054 le16_add_cpu(&bset(b, t)->u64s, -clobber_u64s); in bch2_bset_delete()
1055 set_btree_bset_end(b, t); in bch2_bset_delete()
1057 bch2_bset_fix_lookup_table(b, t, where, clobber_u64s, 0); in bch2_bset_delete()
1063 static struct bkey_packed *bset_search_write_set(const struct btree *b, in bset_search_write_set() argument
1072 if (bpos_lt(rw_aux_tree(b, t)[m].k, *search)) in bset_search_write_set()
1078 return rw_aux_to_bkey(b, t, l); in bset_search_write_set()
1098 static inline bool bkey_mantissa_bits_dropped(const struct btree *b, in bkey_mantissa_bits_dropped() argument
1103 unsigned key_bits_start = b->format.key_u64s * 64 - b->nr_key_bits; in bkey_mantissa_bits_dropped()
1107 unsigned key_bits_end = high_bit_offset + b->nr_key_bits; in bkey_mantissa_bits_dropped()
1114 static struct bkey_packed *bset_search_tree(const struct btree *b, in bset_search_tree() argument
1119 struct ro_aux_tree *base = ro_aux_tree_base(b, t); in bset_search_tree()
1136 if (unlikely(l == r) && bkey_mantissa_bits_dropped(b, f, n)) in bset_search_tree()
1142 k = tree_to_bkey(b, t, n); in bset_search_tree()
1143 cmp = bkey_cmp_p_or_unp(b, k, packed_search, search); in bset_search_tree()
1159 return btree_bkey_first(b, t); in bset_search_tree()
1164 return cacheline_to_bkey(b, t, inorder, f->key_offset); in bset_search_tree()
1168 struct bkey_packed *__bch2_bset_search(struct btree *b, in __bch2_bset_search() argument
1191 return btree_bkey_first(b, t); in __bch2_bset_search()
1193 return bset_search_write_set(b, t, search); in __bch2_bset_search()
1195 return bset_search_tree(b, t, search, lossy_packed_search); in __bch2_bset_search()
1202 struct bkey_packed *bch2_bset_search_linear(struct btree *b, in bch2_bset_search_linear() argument
1210 while (m != btree_bkey_last(b, t) && in bch2_bset_search_linear()
1211 bkey_iter_cmp_p_or_unp(b, m, in bch2_bset_search_linear()
1216 while (m != btree_bkey_last(b, t) && in bch2_bset_search_linear()
1217 bkey_iter_pos_cmp(b, m, search) < 0) in bch2_bset_search_linear()
1221 struct bkey_packed *prev = bch2_bkey_prev_all(b, t, m); in bch2_bset_search_linear()
1224 bkey_iter_cmp_p_or_unp(b, prev, in bch2_bset_search_linear()
1234 struct btree *b, in __bch2_btree_node_iter_push() argument
1246 __btree_node_key_to_offset(b, k), in __bch2_btree_node_iter_push()
1247 __btree_node_key_to_offset(b, end) in __bch2_btree_node_iter_push()
1253 struct btree *b, in bch2_btree_node_iter_push() argument
1257 __bch2_btree_node_iter_push(iter, b, k, end); in bch2_btree_node_iter_push()
1258 bch2_btree_node_iter_sort(iter, b); in bch2_btree_node_iter_push()
1263 struct btree *b, struct bpos *search) in btree_node_iter_init_pack_failed() argument
1269 bch2_btree_node_iter_init_from_start(iter, b); in btree_node_iter_init_pack_failed()
1271 while ((k = bch2_btree_node_iter_peek(iter, b)) && in btree_node_iter_init_pack_failed()
1272 bkey_iter_pos_cmp(b, k, search) < 0) in btree_node_iter_init_pack_failed()
1273 bch2_btree_node_iter_advance(iter, b); in btree_node_iter_init_pack_failed()
1281 * @b: btree node to search
1322 struct btree *b, struct bpos *search) in bch2_btree_node_iter_init() argument
1329 EBUG_ON(bpos_lt(*search, b->data->min_key)); in bch2_btree_node_iter_init()
1330 EBUG_ON(bpos_gt(*search, b->data->max_key)); in bch2_btree_node_iter_init()
1331 bset_aux_tree_verify(b); in bch2_btree_node_iter_init()
1335 switch (bch2_bkey_pack_pos_lossy(&p, *search, b)) { in bch2_btree_node_iter_init()
1343 btree_node_iter_init_pack_failed(iter, b, search); in bch2_btree_node_iter_init()
1347 for (i = 0; i < b->nsets; i++) { in bch2_btree_node_iter_init()
1348 k[i] = __bch2_bset_search(b, b->set + i, search, &p); in bch2_btree_node_iter_init()
1352 for (i = 0; i < b->nsets; i++) { in bch2_btree_node_iter_init()
1353 struct bset_tree *t = b->set + i; in bch2_btree_node_iter_init()
1354 struct bkey_packed *end = btree_bkey_last(b, t); in bch2_btree_node_iter_init()
1356 k[i] = bch2_bset_search_linear(b, t, search, in bch2_btree_node_iter_init()
1360 __btree_node_key_to_offset(b, k[i]), in bch2_btree_node_iter_init()
1361 __btree_node_key_to_offset(b, end) in bch2_btree_node_iter_init()
1365 bch2_btree_node_iter_sort(iter, b); in bch2_btree_node_iter_init()
1369 struct btree *b) in bch2_btree_node_iter_init_from_start() argument
1375 for_each_bset(b, t) in bch2_btree_node_iter_init_from_start()
1376 __bch2_btree_node_iter_push(iter, b, in bch2_btree_node_iter_init_from_start()
1377 btree_bkey_first(b, t), in bch2_btree_node_iter_init_from_start()
1378 btree_bkey_last(b, t)); in bch2_btree_node_iter_init_from_start()
1379 bch2_btree_node_iter_sort(iter, b); in bch2_btree_node_iter_init_from_start()
1383 struct btree *b, in bch2_btree_node_iter_bset_pos() argument
1390 return __btree_node_offset_to_key(b, set->k); in bch2_btree_node_iter_bset_pos()
1392 return btree_bkey_last(b, t); in bch2_btree_node_iter_bset_pos()
1396 struct btree *b, in btree_node_iter_sort_two() argument
1401 if ((ret = (btree_node_iter_cmp(b, in btree_node_iter_sort_two()
1409 struct btree *b) in bch2_btree_node_iter_sort() argument
1414 btree_node_iter_sort_two(iter, b, 0); in bch2_btree_node_iter_sort()
1415 btree_node_iter_sort_two(iter, b, 1); in bch2_btree_node_iter_sort()
1419 btree_node_iter_sort_two(iter, b, 0); in bch2_btree_node_iter_sort()
1433 struct btree *b) in __bch2_btree_node_iter_advance() argument
1435 iter->data->k += __bch2_btree_node_iter_peek_all(iter, b)->u64s; in __bch2_btree_node_iter_advance()
1450 if (!btree_node_iter_sort_two(iter, b, 0)) in __bch2_btree_node_iter_advance()
1456 btree_node_iter_sort_two(iter, b, 1); in __bch2_btree_node_iter_advance()
1460 struct btree *b) in bch2_btree_node_iter_advance() argument
1463 bch2_btree_node_iter_verify(iter, b); in bch2_btree_node_iter_advance()
1464 bch2_btree_node_iter_next_check(iter, b); in bch2_btree_node_iter_advance()
1467 __bch2_btree_node_iter_advance(iter, b); in bch2_btree_node_iter_advance()
1474 struct btree *b) in bch2_btree_node_iter_prev_all() argument
1482 bch2_btree_node_iter_verify(iter, b); in bch2_btree_node_iter_prev_all()
1484 for_each_bset(b, t) { in bch2_btree_node_iter_prev_all()
1485 k = bch2_bkey_prev_all(b, t, in bch2_btree_node_iter_prev_all()
1486 bch2_btree_node_iter_bset_pos(iter, b, t)); in bch2_btree_node_iter_prev_all()
1488 (!prev || bkey_iter_cmp(b, k, prev) > 0)) { in bch2_btree_node_iter_prev_all()
1514 iter->data[0].k = __btree_node_key_to_offset(b, prev); in bch2_btree_node_iter_prev_all()
1518 bch2_btree_node_iter_verify(iter, b); in bch2_btree_node_iter_prev_all()
1523 struct btree *b) in bch2_btree_node_iter_prev() argument
1528 prev = bch2_btree_node_iter_prev_all(iter, b); in bch2_btree_node_iter_prev()
1535 struct btree *b, in bch2_btree_node_iter_peek_unpack() argument
1538 struct bkey_packed *k = bch2_btree_node_iter_peek(iter, b); in bch2_btree_node_iter_peek_unpack()
1540 return k ? bkey_disassemble(b, k, u) : bkey_s_c_null; in bch2_btree_node_iter_peek_unpack()
1545 void bch2_btree_keys_stats(const struct btree *b, struct bset_stats *stats) in bch2_btree_keys_stats() argument
1549 for_each_bset(b, t) { in bch2_btree_keys_stats()
1554 stats->sets[type].bytes += le16_to_cpu(bset(b, t)->u64s) * in bch2_btree_keys_stats()
1562 bkey_float(b, t, j)->exponent == in bch2_btree_keys_stats()
1568 void bch2_bfloat_to_text(struct printbuf *out, struct btree *b, in bch2_bfloat_to_text() argument
1571 struct bset_tree *t = bch2_bkey_to_bset(b, k); in bch2_bfloat_to_text()
1578 inorder = bkey_to_cacheline(b, t, k); in bch2_bfloat_to_text()
1583 if (k != tree_to_bkey(b, t, j)) in bch2_bfloat_to_text()
1586 switch (bkey_float(b, t, j)->exponent) { in bch2_bfloat_to_text()
1588 uk = bkey_unpack_key(b, k); in bch2_bfloat_to_text()