92 #define PTR_HASH(c, k)							\  argument
177 void bkey_put(struct cache_set *c, struct bkey *k)  in bkey_put()
576 static unsigned btree_order(struct bkey *k)  in btree_order()
581 static void mca_data_alloc(struct btree *b, struct bkey *k, gfp_t gfp)  in mca_data_alloc()
596 				      struct bkey *k, gfp_t gfp)  in mca_bucket_alloc()
816 static struct hlist_head *mca_hash(struct cache_set *c, struct bkey *k)  in mca_hash()
821 static struct btree *mca_find(struct cache_set *c, struct bkey *k)  in mca_find()
851 				     struct bkey *k)  in mca_cannibalize()
887 			       struct bkey *k, int level)  in mca_alloc()
967 				 struct bkey *k, int level, bool write,  in bch_btree_node_get()
1024 static void btree_node_prefetch(struct btree *parent, struct bkey *k)  in btree_node_prefetch()
1126 static void make_btree_freeing_key(struct btree *b, struct bkey *k)  in make_btree_freeing_key()
1170 				    struct bkey *k)  in __bch_btree_mark_key()
1221 #define btree_mark_key(b, k)	__bch_btree_mark_key(b->c, b->level, k)  argument
1223 void bch_initial_mark_key(struct cache_set *c, int level, struct bkey *k)  in bch_initial_mark_key()
1247 	struct bkey *k;  in btree_gc_mark_node()  local
1302 	struct bkey *k;  in btree_gc_coalesce()  local
1343 		struct bkey *k, *last = NULL;  in btree_gc_coalesce()  local
1500 	struct bkey *k;  in btree_gc_count_keys()  local
1515 	struct bkey *k;  in btree_gc_recurse()  local
1810 	struct bkey *k, *p = NULL;  in bch_btree_check_recurse()  local
1884 static bool btree_insert_key(struct btree *b, struct bkey *k,  in btree_insert_key()
1924 		struct bkey *k = insert_keys->keys;  in bch_btree_insert_keys()  local
2228 		struct bkey *k;  in bch_btree_insert()  local
2273 		struct bkey *k;  in bch_btree_map_nodes_recurse()  local
2306 	struct bkey *k;  in bch_btree_map_keys_recurse()  local
2361 			    struct bkey *k)  in refill_keybuf_fn()