127 void bkey_put(struct cache_set *c, struct bkey *k)  in bkey_put()
542 static unsigned int btree_order(struct bkey *k)  in btree_order()
547 static void mca_data_alloc(struct btree *b, struct bkey *k, gfp_t gfp)  in mca_data_alloc()
581 				      struct bkey *k, gfp_t gfp)  in mca_bucket_alloc()
847 static struct hlist_head *mca_hash(struct cache_set *c, struct bkey *k)  in mca_hash()
852 static struct btree *mca_find(struct cache_set *c, struct bkey *k)  in mca_find()
884 				     struct bkey *k)  in mca_cannibalize()
922 			       struct bkey *k, int level)  in mca_alloc()
1005 				 struct bkey *k, int level, bool write,  in bch_btree_node_get()
1061 static void btree_node_prefetch(struct btree *parent, struct bkey *k)  in btree_node_prefetch()
1183 static void make_btree_freeing_key(struct btree *b, struct bkey *k)  in make_btree_freeing_key()
1226 				    struct bkey *k)  in __bch_btree_mark_key()
1279 void bch_initial_mark_key(struct cache_set *c, int level, struct bkey *k)  in bch_initial_mark_key()
1308 	struct bkey *k;  in btree_gc_mark_node()
1356 				 struct bkey *replace_key);
1365 	struct bkey *k;  in btree_gc_coalesce()
1406 		struct bkey *k, *last = NULL;  in btree_gc_coalesce()
1569 	struct bkey *k;  in btree_gc_count_keys()
1610 	struct bkey *k;  in btree_gc_recurse()
1916 	struct bkey *k, *p = NULL;  in bch_btree_check_recurse()
1957 	struct bkey *k, *p;  in bch_btree_check_thread()
2056 	struct bkey *k = NULL;  in bch_btree_check()
2163 static bool btree_insert_key(struct btree *b, struct bkey *k,  in btree_insert_key()
2164 			     struct bkey *replace_key)  in btree_insert_key()
2197 				  struct bkey *replace_key)  in bch_btree_insert_keys()
2203 		struct bkey *k = insert_keys->keys;  in bch_btree_insert_keys()
2239 		       struct bkey *replace_key)  in btree_split()
2374 				 struct bkey *replace_key)  in bch_btree_insert_node()
2428 			       struct bkey *check_key)  in bch_btree_insert_check_key()
2469 	struct bkey	*replace_key;
2486 		     atomic_t *journal_ref, struct bkey *replace_key)  in bch_btree_insert()
2507 		struct bkey *k;  in bch_btree_insert()
2546 				       struct bkey *from,  in bch_btree_map_nodes_recurse()
2552 		struct bkey *k;  in bch_btree_map_nodes_recurse()
2575 			  struct bkey *from, btree_map_nodes_fn *fn, int flags)  in __bch_btree_map_nodes()
2581 				      struct bkey *from, btree_map_keys_fn *fn,  in bch_btree_map_keys_recurse()
2585 	struct bkey *k;  in bch_btree_map_keys_recurse()
2610 		       struct bkey *from, btree_map_keys_fn *fn, int flags)  in bch_btree_map_keys()
2637 	struct bkey	*end;
2642 			    struct bkey *k)  in refill_keybuf_fn()
2686 		       struct bkey *end, keybuf_pred_fn *pred)  in bch_refill_keybuf()
2688 	struct bkey start = buf->last_scanned;  in bch_refill_keybuf()
2738 bool bch_keybuf_check_overlapping(struct keybuf *buf, struct bkey *start,  in bch_keybuf_check_overlapping()
2739 				  struct bkey *end)  in bch_keybuf_check_overlapping()
2787 					  struct bkey *end,  in bch_keybuf_next_rescan()