21 	struct bkey *k, *next;  in bch_dump_bset()
56 	struct bkey *k;  in __bch_count_data()
67 	struct bkey *k, *p = NULL;  in __bch_check_keys()
111 	struct bkey *k = iter->data->k, *next = bkey_next(k);  in bch_btree_iter_next_check()
156 struct bkey *bch_keylist_pop(struct keylist *l)  in bch_keylist_pop()
158 	struct bkey *k = l->keys;  in bch_keylist_pop()
180 void bch_bkey_copy_single_ptr(struct bkey *dest, const struct bkey *src,  in bch_bkey_copy_single_ptr()
193 bool __bch_cut_front(const struct bkey *where, struct bkey *k)  in __bch_cut_front()
213 bool __bch_cut_back(const struct bkey *where, struct bkey *k)  in __bch_cut_back()
503 static struct bkey *cacheline_to_bkey(struct bset_tree *t, unsigned cacheline,  in cacheline_to_bkey()
509 static unsigned bkey_to_cacheline(struct bset_tree *t, struct bkey *k)  in bkey_to_cacheline()
516 					 struct bkey *k)  in bkey_to_cacheline_offset()
521 static struct bkey *tree_to_bkey(struct bset_tree *t, unsigned j)  in tree_to_bkey()
526 static struct bkey *tree_to_prev_bkey(struct bset_tree *t, unsigned j)  in tree_to_prev_bkey()
535 static struct bkey *table_to_bkey(struct bset_tree *t, unsigned cacheline)  in table_to_bkey()
547 static inline unsigned bfloat_mantissa(const struct bkey *k,  in bfloat_mantissa()
557 	struct bkey *m = tree_to_bkey(t, j);  in make_bfloat()
558 	struct bkey *p = tree_to_prev_bkey(t, j);  in make_bfloat()
560 	struct bkey *l = is_power_of_2(j)  in make_bfloat()
564 	struct bkey *r = is_power_of_2(j + 1)  in make_bfloat()
637 	struct bkey *prev = NULL, *k = t->data->start;  in bch_bset_build_written_tree()
681 void bch_bset_fix_invalidated_key(struct btree_keys *b, struct bkey *k)  in bch_bset_fix_invalidated_key()
729 				      struct bkey *k)  in bch_bset_fix_lookup_table()
781 bool bch_bkey_try_merge(struct btree_keys *b, struct bkey *l, struct bkey *r)  in bch_bkey_try_merge()
799 void bch_bset_insert(struct btree_keys *b, struct bkey *where,  in bch_bset_insert()
800 		     struct bkey *insert)  in bch_bset_insert()
819 unsigned bch_btree_insert_key(struct btree_keys *b, struct bkey *k,  in bch_btree_insert_key()
820 			      struct bkey *replace_key)  in bch_btree_insert_key()
824 	struct bkey *m, *prev = NULL;  in bch_btree_insert_key()
868 	struct bkey *l, *r;
872 						     const struct bkey *search)  in bset_search_write_set()
892 						const struct bkey *search)  in bset_search_tree()
894 	struct bkey *l, *r;  in bset_search_tree()
952 struct bkey *__bch_bset_search(struct btree_keys *b, struct bset_tree *t,  in __bch_bset_search()
953 			       const struct bkey *search)  in __bch_bset_search()
1032 void bch_btree_iter_push(struct btree_iter *iter, struct bkey *k,  in bch_btree_iter_push()
1033 			 struct bkey *end)  in bch_btree_iter_push()
1041 static struct bkey *__bch_btree_iter_init(struct btree_keys *b,  in __bch_btree_iter_init()
1043 					  struct bkey *search,  in __bch_btree_iter_init()
1046 	struct bkey *ret = NULL;  in __bch_btree_iter_init()
1062 struct bkey *bch_btree_iter_init(struct btree_keys *b,  in bch_btree_iter_init()
1064 				 struct bkey *search)  in bch_btree_iter_init()
1070 static inline struct bkey *__bch_btree_iter_next(struct btree_iter *iter,  in __bch_btree_iter_next()
1074 	struct bkey *ret = NULL;  in __bch_btree_iter_next()
1096 struct bkey *bch_btree_iter_next(struct btree_iter *iter)  in bch_btree_iter_next()
1103 struct bkey *bch_btree_iter_next_filter(struct btree_iter *iter,  in bch_btree_iter_next_filter()
1106 	struct bkey *ret;  in bch_btree_iter_next_filter()
1143 	struct bkey *k, *last = NULL;  in btree_mergesort()
1145 	bool (*bad)(struct btree_keys *, const struct bkey *) = remove_stale  in btree_mergesort()