Lines Matching defs:k
99 #define PTR_HASH(c, k) \ argument
128 void bkey_put(struct cache_set *c, struct bkey *k) in bkey_put()
543 static unsigned int btree_order(struct bkey *k) in btree_order()
548 static void mca_data_alloc(struct btree *b, struct bkey *k, gfp_t gfp) in mca_data_alloc()
584 struct bkey *k, gfp_t gfp) in mca_bucket_alloc()
850 static struct hlist_head *mca_hash(struct cache_set *c, struct bkey *k) in mca_hash()
855 static struct btree *mca_find(struct cache_set *c, struct bkey *k) in mca_find()
887 struct bkey *k) in mca_cannibalize()
925 struct bkey *k, int level) in mca_alloc()
1008 struct bkey *k, int level, bool write, in bch_btree_node_get()
1064 static void btree_node_prefetch(struct btree *parent, struct bkey *k) in btree_node_prefetch()
1186 static void make_btree_freeing_key(struct btree *b, struct bkey *k) in make_btree_freeing_key()
1229 struct bkey *k) in __bch_btree_mark_key()
1280 #define btree_mark_key(b, k) __bch_btree_mark_key(b->c, b->level, k) argument
1282 void bch_initial_mark_key(struct cache_set *c, int level, struct bkey *k) in bch_initial_mark_key()
1311 struct bkey *k; in btree_gc_mark_node() local
1370 struct bkey *k; in btree_gc_coalesce() local
1411 struct bkey *k, *last = NULL; in btree_gc_coalesce() local
1574 struct bkey *k; in btree_gc_count_keys() local
1617 struct bkey *k; in btree_gc_recurse() local
1770 uint64_t *k; in bch_btree_gc_finish() local
1923 struct bkey *k, *p = NULL; in bch_btree_check_recurse() local
1966 struct bkey *k, *p; in bch_btree_check_thread() local
2067 struct bkey *k = NULL; in bch_btree_check() local
2176 static bool btree_insert_key(struct btree *b, struct bkey *k, in btree_insert_key()
2216 struct bkey *k = insert_keys->keys; in bch_btree_insert_keys() local
2520 struct bkey *k; in bch_btree_insert() local
2565 struct bkey *k; in bch_btree_map_nodes_recurse() local
2599 struct bkey *k; in bch_btree_map_keys_recurse() local
2656 struct bkey *k) in refill_keybuf_fn()