Home
last modified time | relevance | path

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

/linux-6.15/fs/bcachefs/
H A Dbtree_locking.h35 BTREE_NODE_UNLOCKED = -1, enumerator
44 return BTREE_NODE_UNLOCKED + ((path->nodes_locked >> (level << 1)) & 3); in btree_node_locked_type()
64 return btree_node_locked_type(path, level) != BTREE_NODE_UNLOCKED; in btree_node_locked()
101 return BTREE_NODE_UNLOCKED; in btree_lock_want()
106 return BTREE_NODE_UNLOCKED; in btree_lock_want()
131 if (lock_type != BTREE_NODE_UNLOCKED) { in btree_node_unlock()
138 mark_btree_node_locked_noreset(path, level, BTREE_NODE_UNLOCKED); in btree_node_unlock()
H A Dbtree_locking.c37 if (t != BTREE_NODE_UNLOCKED) in bch2_btree_node_lock_counts()
342 if (lock_held == BTREE_NODE_UNLOCKED) in bch2_check_for_deadlock()
535 case BTREE_NODE_UNLOCKED: in bch2_btree_node_upgrade()
865 BUG_ON(!is_btree_node(path, l) && have != BTREE_NODE_UNLOCKED); in bch2_btree_path_verify_locks()
868 (want == BTREE_NODE_UNLOCKED || in bch2_btree_path_verify_locks()
H A Dbtree_key_cache.c243 mark_btree_node_locked_noreset(ck_path, 0, BTREE_NODE_UNLOCKED); in btree_key_cache_create()
285 mark_btree_node_locked_noreset(ck_path, 0, BTREE_NODE_UNLOCKED); in btree_key_cache_create()
512 mark_btree_node_locked_noreset(path, 0, BTREE_NODE_UNLOCKED); in btree_key_cache_flush_pos()
630 mark_btree_node_locked(trans, path, 0, BTREE_NODE_UNLOCKED); in bch2_btree_key_cache_drop()
H A Dbtree_iter.c676 if (t != BTREE_NODE_UNLOCKED) { in bch2_trans_node_add()
1089 if (btree_lock_want(path, l) == BTREE_NODE_UNLOCKED) in btree_path_set_level_down()
1240 if (t != BTREE_NODE_UNLOCKED) in btree_path_copy()
1527 case BTREE_NODE_UNLOCKED: in btree_node_locked_str()
1995 if (btree_lock_want(path, path->level + 1) == BTREE_NODE_UNLOCKED) in bch2_btree_iter_next_node()