Home
last modified time | relevance | path

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

/fs/bcachefs/
A 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()
164 bkey_unpack_key(b, k); in __bch2_btree_node_iter_next_check()
169 struct bkey ku = bkey_unpack_key(b, k); in __bch2_btree_node_iter_next_check()
170 struct bkey nu = bkey_unpack_key(b, n); in __bch2_btree_node_iter_next_check()
252 struct bkey k1 = bkey_unpack_key(b, prev); in __bch2_verify_insert_pos()
253 struct bkey k2 = bkey_unpack_key(b, insert); in __bch2_verify_insert_pos()
271 struct bkey k1 = bkey_unpack_key(b, insert); in __bch2_verify_insert_pos()
272 struct bkey k2 = bkey_unpack_key(b, next); in __bch2_verify_insert_pos()
1567 uk = bkey_unpack_key(b, k); in bch2_bfloat_to_text()
A Dbkey.h434 static inline struct bkey bkey_unpack_key(const struct btree *b, in bkey_unpack_key() function
A Dbtree_io.c93 struct bkey l = bkey_unpack_key(b, p); in verify_no_dups()
94 struct bkey r = bkey_unpack_key(b, k); in verify_no_dups()
997 struct bkey up = bkey_unpack_key(b, prev); in validate_bset_keys()
A Dbtree_update_interior.c160 uk = bkey_unpack_key(b, k); in __bch2_btree_calc_format()
1525 uk = bkey_unpack_key(b, k); in __btree_split_node()
A Dbtree_iter.c194 struct bkey uk = bkey_unpack_key(l->b, p); in __bch2_btree_path_verify_level()
202 struct bkey uk = bkey_unpack_key(l->b, k); in __bch2_btree_path_verify_level()

Completed in 24 milliseconds