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()
158 struct bkey *bch_keylist_pop(struct keylist *l)  in bch_keylist_pop()
160 	struct bkey *k = l->keys;  in bch_keylist_pop()
182 void bch_bkey_copy_single_ptr(struct bkey *dest, const struct bkey *src,  in bch_bkey_copy_single_ptr()
195 bool __bch_cut_front(const struct bkey *where, struct bkey *k)  in __bch_cut_front()
215 bool __bch_cut_back(const struct bkey *where, struct bkey *k)  in __bch_cut_back()
526 static struct bkey *cacheline_to_bkey(struct bset_tree *t,  in cacheline_to_bkey()
533 static unsigned int bkey_to_cacheline(struct bset_tree *t, struct bkey *k)  in bkey_to_cacheline()
540 					 struct bkey *k)  in bkey_to_cacheline_offset()
545 static struct bkey *tree_to_bkey(struct bset_tree *t, unsigned int j)  in tree_to_bkey()
550 static struct bkey *tree_to_prev_bkey(struct bset_tree *t, unsigned int j)  in tree_to_prev_bkey()
559 static struct bkey *table_to_bkey(struct bset_tree *t, unsigned int cacheline)  in table_to_bkey()
585 static inline unsigned int bfloat_mantissa(const struct bkey *k,  in bfloat_mantissa()
596 	struct bkey *m = tree_to_bkey(t, j);  in make_bfloat()
597 	struct bkey *p = tree_to_prev_bkey(t, j);  in make_bfloat()
599 	struct bkey *l = is_power_of_2(j)  in make_bfloat()
603 	struct bkey *r = is_power_of_2(j + 1)  in make_bfloat()
695 	struct bkey *prev = NULL, *k = t->data->start;  in bch_bset_build_written_tree()
739 void bch_bset_fix_invalidated_key(struct btree_keys *b, struct bkey *k)  in bch_bset_fix_invalidated_key()
787 				      struct bkey *k)  in bch_bset_fix_lookup_table()
842 bool bch_bkey_try_merge(struct btree_keys *b, struct bkey *l, struct bkey *r)  in bch_bkey_try_merge()
860 void bch_bset_insert(struct btree_keys *b, struct bkey *where,  in bch_bset_insert()
861 		     struct bkey *insert)  in bch_bset_insert()
880 unsigned int bch_btree_insert_key(struct btree_keys *b, struct bkey *k,  in bch_btree_insert_key()
881 			      struct bkey *replace_key)  in bch_btree_insert_key()
885 	struct bkey *m, *prev = NULL;  in bch_btree_insert_key()
887 	struct bkey preceding_key_on_stack = ZERO_KEY;  in bch_btree_insert_key()
888 	struct bkey *preceding_key_p = &preceding_key_on_stack;  in bch_btree_insert_key()
939 	struct bkey *l, *r;
943 						     const struct bkey *search)  in bset_search_write_set()
963 						const struct bkey *search)  in bset_search_tree()
965 	struct bkey *l, *r;  in bset_search_tree()
1018 struct bkey *__bch_bset_search(struct btree_keys *b, struct bset_tree *t,  in __bch_bset_search()
1019 			       const struct bkey *search)  in __bch_bset_search()
1098 void bch_btree_iter_push(struct btree_iter *iter, struct bkey *k,  in bch_btree_iter_push()
1099 			 struct bkey *end)  in bch_btree_iter_push()
1107 static struct bkey *__bch_btree_iter_init(struct btree_keys *b,  in __bch_btree_iter_init()
1109 					  struct bkey *search,  in __bch_btree_iter_init()
1112 	struct bkey *ret = NULL;  in __bch_btree_iter_init()
1129 struct bkey *bch_btree_iter_init(struct btree_keys *b,  in bch_btree_iter_init()
1131 				 struct bkey *search)  in bch_btree_iter_init()
1137 static inline struct bkey *__bch_btree_iter_next(struct btree_iter *iter,  in __bch_btree_iter_next()
1141 	struct bkey *ret = NULL;  in __bch_btree_iter_next()
1163 struct bkey *bch_btree_iter_next(struct btree_iter *iter)  in bch_btree_iter_next()
1170 struct bkey *bch_btree_iter_next_filter(struct btree_iter *iter,  in bch_btree_iter_next_filter()
1173 	struct bkey *ret;  in bch_btree_iter_next_filter()
1206 	struct bkey *k, *last = NULL;  in btree_mergesort()
1208 	bool (*bad)(struct btree_keys *, const struct bkey *) = remove_stale  in btree_mergesort()