Home
last modified time | relevance | path

Searched refs:bkey_unpack_key (Results 1 – 5 of 5) sorted by relevance

/linux-6.12.1/fs/bcachefs/
Dbset.c90 n = bkey_unpack_key(b, _n); in bch2_dump_bset()
124 struct bkey uk = bkey_unpack_key(b, k); in bch2_dump_btree_node_iter()
166 bkey_unpack_key(b, k); in bch2_btree_node_iter_next_check()
171 struct bkey ku = bkey_unpack_key(b, k); in bch2_btree_node_iter_next_check()
172 struct bkey nu = bkey_unpack_key(b, n); in bch2_btree_node_iter_next_check()
254 struct bkey k1 = bkey_unpack_key(b, prev); in bch2_verify_insert_pos()
255 struct bkey k2 = bkey_unpack_key(b, insert); in bch2_verify_insert_pos()
273 struct bkey k1 = bkey_unpack_key(b, insert); in bch2_verify_insert_pos()
274 struct bkey k2 = bkey_unpack_key(b, next); in bch2_verify_insert_pos()
1561 uk = bkey_unpack_key(b, k); in bch2_bfloat_to_text()
Dbkey.h441 static inline struct bkey bkey_unpack_key(const struct btree *b, in bkey_unpack_key() function
Dbtree_io.c90 struct bkey l = bkey_unpack_key(b, p); in verify_no_dups()
91 struct bkey r = bkey_unpack_key(b, k); in verify_no_dups()
922 struct bkey up = bkey_unpack_key(b, prev); in validate_bset_keys()
Dbtree_update_interior.c169 uk = bkey_unpack_key(b, k); in __bch2_btree_calc_format()
1479 uk = bkey_unpack_key(b, k); in __btree_split_node()
Dbtree_iter.c198 struct bkey uk = bkey_unpack_key(l->b, p); in bch2_btree_path_verify_level()
206 struct bkey uk = bkey_unpack_key(l->b, k); in bch2_btree_path_verify_level()