Home
last modified time | relevance | path

Searched refs:bch2_btree_node_relock (Results 1 – 4 of 4) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dbtree_locking.c467 : bch2_btree_node_relock(trans, path, l))) { in btree_path_get_locks()
540 return bch2_btree_node_relock(trans, path, level); in bch2_btree_node_upgrade()
584 if (!bch2_btree_node_relock(trans, path, l)) { in bch2_btree_path_relock_intent()
H A Dbtree_locking.h354 static inline bool bch2_btree_node_relock(struct btree_trans *trans, in bch2_btree_node_relock() function
H A Dbtree_cache.c937 if (path && !bch2_btree_node_relock(trans, path, level + 1)) { in bch2_btree_node_fill()
1083 if (bch2_btree_node_relock(trans, path, level + 1)) in __bch2_btree_node_get()
1199 if (bch2_btree_node_relock(trans, path, level + 1)) in bch2_btree_node_get()
H A Dbtree_iter.c127 if (!bch2_btree_node_relock(trans, path, 0)) in bch2_btree_path_verify_cached()
798 if (!bch2_btree_node_relock(trans, path, path->level)) in btree_path_prefetch()
835 if (!bch2_btree_node_relock(trans, path, path->level)) in btree_path_prefetch_j()
864 if (!bch2_btree_node_relock(trans, path, plevel)) in btree_node_mem_ptr_set()
1076 bch2_btree_node_relock(trans, path, l) && in btree_path_good_node()
1110 if (!bch2_btree_node_relock(trans, path, i)) { in __btree_path_up_until_good_node()
1980 if (!bch2_btree_node_relock(trans, path, path->level + 1)) { in bch2_btree_iter_next_node()