Lines Matching refs:bkey
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()
563 struct bkey *k, gfp_t gfp) in mca_bucket_alloc()
824 static struct hlist_head *mca_hash(struct cache_set *c, struct bkey *k) in mca_hash()
829 static struct btree *mca_find(struct cache_set *c, struct bkey *k) in mca_find()
861 struct bkey *k) in mca_cannibalize()
899 struct bkey *k, int level) in mca_alloc()
979 struct bkey *k, int level, bool write, in bch_btree_node_get()
1035 static void btree_node_prefetch(struct btree *parent, struct bkey *k) in btree_node_prefetch()
1151 static void make_btree_freeing_key(struct btree *b, struct bkey *k) in make_btree_freeing_key()
1194 struct bkey *k) in __bch_btree_mark_key()
1247 void bch_initial_mark_key(struct cache_set *c, int level, struct bkey *k) in bch_initial_mark_key()
1276 struct bkey *k; in btree_gc_mark_node()
1324 struct bkey *replace_key);
1333 struct bkey *k; in btree_gc_coalesce()
1374 struct bkey *k, *last = NULL; in btree_gc_coalesce()
1535 struct bkey *k; in btree_gc_count_keys()
1576 struct bkey *k; in btree_gc_recurse()
1876 struct bkey *k, *p = NULL; in bch_btree_check_recurse()
1917 struct bkey *k, *p; in bch_btree_check_thread()
2007 struct bkey *k = NULL; in bch_btree_check()
2117 static bool btree_insert_key(struct btree *b, struct bkey *k, in btree_insert_key()
2118 struct bkey *replace_key) in btree_insert_key()
2151 struct bkey *replace_key) in bch_btree_insert_keys()
2157 struct bkey *k = insert_keys->keys; in bch_btree_insert_keys()
2193 struct bkey *replace_key) in btree_split()
2328 struct bkey *replace_key) in bch_btree_insert_node()
2382 struct bkey *check_key) in bch_btree_insert_check_key()
2423 struct bkey *replace_key;
2440 atomic_t *journal_ref, struct bkey *replace_key) in bch_btree_insert()
2461 struct bkey *k; in bch_btree_insert()
2500 struct bkey *from, in bch_btree_map_nodes_recurse()
2506 struct bkey *k; in bch_btree_map_nodes_recurse()
2529 struct bkey *from, btree_map_nodes_fn *fn, int flags) in __bch_btree_map_nodes()
2535 struct bkey *from, btree_map_keys_fn *fn, in bch_btree_map_keys_recurse()
2539 struct bkey *k; in bch_btree_map_keys_recurse()
2563 struct bkey *from, btree_map_keys_fn *fn, int flags) in bch_btree_map_keys()
2590 struct bkey *end;
2595 struct bkey *k) in refill_keybuf_fn()
2639 struct bkey *end, keybuf_pred_fn *pred) in bch_refill_keybuf()
2641 struct bkey start = buf->last_scanned; in bch_refill_keybuf()
2691 bool bch_keybuf_check_overlapping(struct keybuf *buf, struct bkey *start, in bch_keybuf_check_overlapping()
2692 struct bkey *end) in bch_keybuf_check_overlapping()
2740 struct bkey *end, in bch_keybuf_next_rescan()