23 	struct bkey *k, *next;  in bch_dump_bset()  local
58 	struct bkey *k;  in __bch_count_data()  local
71 	struct bkey *k, *p = NULL;  in __bch_check_keys()  local
117 	struct bkey *k = iter->heap.data->k, *next = bkey_next(k);  in bch_btree_iter_next_check()  local
165 	struct bkey *k = l->keys;  in bch_keylist_pop()  local
201 bool __bch_cut_front(const struct bkey *where, struct bkey *k)  in __bch_cut_front()
221 bool __bch_cut_back(const struct bkey *where, struct bkey *k)  in __bch_cut_back()
536 static unsigned int bkey_to_cacheline(struct bset_tree *t, struct bkey *k)  in bkey_to_cacheline()
543 					 struct bkey *k)  in bkey_to_cacheline_offset()
588 static inline unsigned int bfloat_mantissa(const struct bkey *k,  in bfloat_mantissa()
697 	struct bkey *prev = NULL, *k = t->data->start;  in bch_bset_build_written_tree()  local
742 void bch_bset_fix_invalidated_key(struct btree_keys *b, struct bkey *k)  in bch_bset_fix_invalidated_key()
789 				      struct bkey *k)  in bch_bset_fix_lookup_table()
880 unsigned int bch_btree_insert_key(struct btree_keys *b, struct bkey *k,  in bch_btree_insert_key()
1101 void bch_btree_iter_push(struct btree_iter *iter, struct bkey *k,  in bch_btree_iter_push()
1219 	struct bkey *k, *last = NULL;  in btree_mergesort()  local