Searched refs:btree_ptr_hash_val (Results 1 – 3 of 3) sorted by relevance
275 b->hash_val = btree_ptr_hash_val(&b->key); in __bch2_btree_node_hash_insert()338 u64 v = btree_ptr_hash_val(k); in btree_cache_find()1079 if (unlikely(b->hash_val != btree_ptr_hash_val(k) || in __bch2_btree_node_get()1183 b->hash_val != btree_ptr_hash_val(k))) in bch2_btree_node_get()1195 if (unlikely(b->hash_val != btree_ptr_hash_val(k) || in bch2_btree_node_get()1282 if (unlikely(b->hash_val != btree_ptr_hash_val(k) || in bch2_btree_node_get_noiter()1368 if (unlikely(b->hash_val != btree_ptr_hash_val(k))) in bch2_btree_node_evict()
53 static inline u64 btree_ptr_hash_val(const struct bkey_i *k) in btree_ptr_hash_val() function
2310 bool found = b && btree_ptr_hash_val(&b->key) == btree_ptr_hash_val(k); in bch2_btree_node_rewrite_key()2583 if (btree_ptr_hash_val(new_key) != b->hash_val) { in bch2_btree_node_update_key()
Completed in 13 milliseconds