178 void bkey_put(struct cache_set *c, struct bkey *k)  in bkey_put()
581 static unsigned btree_order(struct bkey *k)  in btree_order()
586 static void mca_data_alloc(struct btree *b, struct bkey *k, gfp_t gfp)  in mca_data_alloc()
601 				      struct bkey *k, gfp_t gfp)  in mca_bucket_alloc()
818 static struct hlist_head *mca_hash(struct cache_set *c, struct bkey *k)  in mca_hash()
823 static struct btree *mca_find(struct cache_set *c, struct bkey *k)  in mca_find()
853 				     struct bkey *k)  in mca_cannibalize()
889 			       struct bkey *k, int level)  in mca_alloc()
969 				 struct bkey *k, int level, bool write,  in bch_btree_node_get()
1026 static void btree_node_prefetch(struct btree *parent, struct bkey *k)  in btree_node_prefetch()
1128 static void make_btree_freeing_key(struct btree *b, struct bkey *k)  in make_btree_freeing_key()
1172 				    struct bkey *k)  in __bch_btree_mark_key()
1225 void bch_initial_mark_key(struct cache_set *c, int level, struct bkey *k)  in bch_initial_mark_key()
1249 	struct bkey *k;  in btree_gc_mark_node()
1295 				 struct keylist *, atomic_t *, struct bkey *);
1304 	struct bkey *k;  in btree_gc_coalesce()
1345 		struct bkey *k, *last = NULL;  in btree_gc_coalesce()
1502 	struct bkey *k;  in btree_gc_count_keys()
1517 	struct bkey *k;  in btree_gc_recurse()
1812 	struct bkey *k, *p = NULL;  in bch_btree_check_recurse()
1886 static bool btree_insert_key(struct btree *b, struct bkey *k,  in btree_insert_key()
1887 			     struct bkey *replace_key)  in btree_insert_key()
1920 				  struct bkey *replace_key)  in bch_btree_insert_keys()
1926 		struct bkey *k = insert_keys->keys;  in bch_btree_insert_keys()
1962 		       struct bkey *replace_key)  in btree_split()
2097 				 struct bkey *replace_key)  in bch_btree_insert_node()
2151 			       struct bkey *check_key)  in bch_btree_insert_check_key()
2192 	struct bkey	*replace_key;
2209 		     atomic_t *journal_ref, struct bkey *replace_key)  in bch_btree_insert()
2230 		struct bkey *k;  in bch_btree_insert()
2269 				       struct bkey *from,  in bch_btree_map_nodes_recurse()
2275 		struct bkey *k;  in bch_btree_map_nodes_recurse()
2298 			  struct bkey *from, btree_map_nodes_fn *fn, int flags)  in __bch_btree_map_nodes()
2304 				      struct bkey *from, btree_map_keys_fn *fn,  in bch_btree_map_keys_recurse()
2308 	struct bkey *k;  in bch_btree_map_keys_recurse()
2331 		       struct bkey *from, btree_map_keys_fn *fn, int flags)  in bch_btree_map_keys()
2358 	struct bkey	*end;
2363 			    struct bkey *k)  in refill_keybuf_fn()
2407 		       struct bkey *end, keybuf_pred_fn *pred)  in bch_refill_keybuf()
2409 	struct bkey start = buf->last_scanned;  in bch_refill_keybuf()
2458 bool bch_keybuf_check_overlapping(struct keybuf *buf, struct bkey *start,  in bch_keybuf_check_overlapping()
2459 				  struct bkey *end)  in bch_keybuf_check_overlapping()
2505 					  struct bkey *end,  in bch_keybuf_next_rescan()