Lines Matching refs:bkey
23 struct bkey *k, *next; in bch_dump_bset()
58 struct bkey *k; in __bch_count_data()
69 struct bkey *k, *p = NULL; in __bch_check_keys()
113 struct bkey *k = iter->data->k, *next = bkey_next(k); in bch_btree_iter_next_check()
159 struct bkey *bch_keylist_pop(struct keylist *l) in bch_keylist_pop()
161 struct bkey *k = l->keys; in bch_keylist_pop()
184 void bch_bkey_copy_single_ptr(struct bkey *dest, const struct bkey *src, in bch_bkey_copy_single_ptr()
197 bool __bch_cut_front(const struct bkey *where, struct bkey *k) in __bch_cut_front()
217 bool __bch_cut_back(const struct bkey *where, struct bkey *k) in __bch_cut_back()
525 static struct bkey *cacheline_to_bkey(struct bset_tree *t, in cacheline_to_bkey()
532 static unsigned int bkey_to_cacheline(struct bset_tree *t, struct bkey *k) in bkey_to_cacheline()
539 struct bkey *k) in bkey_to_cacheline_offset()
544 static struct bkey *tree_to_bkey(struct bset_tree *t, unsigned int j) in tree_to_bkey()
549 static struct bkey *tree_to_prev_bkey(struct bset_tree *t, unsigned int j) in tree_to_prev_bkey()
558 static struct bkey *table_to_bkey(struct bset_tree *t, unsigned int cacheline) in table_to_bkey()
584 static inline unsigned int bfloat_mantissa(const struct bkey *k, in bfloat_mantissa()
595 struct bkey *m = tree_to_bkey(t, j); in make_bfloat()
596 struct bkey *p = tree_to_prev_bkey(t, j); in make_bfloat()
598 struct bkey *l = is_power_of_2(j) in make_bfloat()
602 struct bkey *r = is_power_of_2(j + 1) in make_bfloat()
693 struct bkey *prev = NULL, *k = t->data->start; in bch_bset_build_written_tree()
738 void bch_bset_fix_invalidated_key(struct btree_keys *b, struct bkey *k) in bch_bset_fix_invalidated_key()
785 struct bkey *k) in bch_bset_fix_lookup_table()
840 bool bch_bkey_try_merge(struct btree_keys *b, struct bkey *l, struct bkey *r) in bch_bkey_try_merge()
857 void bch_bset_insert(struct btree_keys *b, struct bkey *where, in bch_bset_insert()
858 struct bkey *insert) in bch_bset_insert()
876 unsigned int bch_btree_insert_key(struct btree_keys *b, struct bkey *k, in bch_btree_insert_key()
877 struct bkey *replace_key) in bch_btree_insert_key()
881 struct bkey *m, *prev = NULL; in bch_btree_insert_key()
883 struct bkey preceding_key_on_stack = ZERO_KEY; in bch_btree_insert_key()
884 struct bkey *preceding_key_p = &preceding_key_on_stack; in bch_btree_insert_key()
936 struct bkey *l, *r;
940 const struct bkey *search) in bset_search_write_set()
960 const struct bkey *search) in bset_search_tree()
962 struct bkey *l, *r; in bset_search_tree()
1015 struct bkey *__bch_bset_search(struct btree_keys *b, struct bset_tree *t, in __bch_bset_search()
1016 const struct bkey *search) in __bch_bset_search()
1094 void bch_btree_iter_push(struct btree_iter *iter, struct bkey *k, in bch_btree_iter_push()
1095 struct bkey *end) in bch_btree_iter_push()
1103 static struct bkey *__bch_btree_iter_init(struct btree_keys *b, in __bch_btree_iter_init()
1105 struct bkey *search, in __bch_btree_iter_init()
1108 struct bkey *ret = NULL; in __bch_btree_iter_init()
1125 struct bkey *bch_btree_iter_init(struct btree_keys *b, in bch_btree_iter_init()
1127 struct bkey *search) in bch_btree_iter_init()
1132 static inline struct bkey *__bch_btree_iter_next(struct btree_iter *iter, in __bch_btree_iter_next()
1136 struct bkey *ret = NULL; in __bch_btree_iter_next()
1158 struct bkey *bch_btree_iter_next(struct btree_iter *iter) in bch_btree_iter_next()
1164 struct bkey *bch_btree_iter_next_filter(struct btree_iter *iter, in bch_btree_iter_next_filter()
1167 struct bkey *ret; in bch_btree_iter_next_filter()
1199 struct bkey *k, *last = NULL; in btree_mergesort()
1201 bool (*bad)(struct btree_keys *, const struct bkey *) = remove_stale in btree_mergesort()