Home
last modified time | relevance | path

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

/linux-6.12.1/fs/bcachefs/
Dbtree_locking.h34 BTREE_NODE_UNLOCKED = -1, enumerator
43 return BTREE_NODE_UNLOCKED + ((path->nodes_locked >> (level << 1)) & 3); in btree_node_locked_type()
63 return btree_node_locked_type(path, level) != BTREE_NODE_UNLOCKED; in btree_node_locked()
82 mark_btree_node_locked_noreset(path, level, BTREE_NODE_UNLOCKED); in mark_btree_node_unlocked()
107 return BTREE_NODE_UNLOCKED; in btree_lock_want()
112 return BTREE_NODE_UNLOCKED; in btree_lock_want()
135 if (lock_type != BTREE_NODE_UNLOCKED) { in btree_node_unlock()
Dbtree_locking.c36 if (t != BTREE_NODE_UNLOCKED) in bch2_btree_node_lock_counts()
327 if (lock_held == BTREE_NODE_UNLOCKED) in bch2_check_for_deadlock()
521 case BTREE_NODE_UNLOCKED: in bch2_btree_node_upgrade()
853 BUG_ON(!is_btree_node(path, l) && have != BTREE_NODE_UNLOCKED); in bch2_btree_path_verify_locks()
856 (want == BTREE_NODE_UNLOCKED || in bch2_btree_path_verify_locks()
Dbtree_key_cache.c241 mark_btree_node_locked_noreset(path, 0, BTREE_NODE_UNLOCKED); in btree_key_cache_create()
276 mark_btree_node_locked_noreset(path, 0, BTREE_NODE_UNLOCKED); in btree_key_cache_create()
470 mark_btree_node_locked_noreset(path, 0, BTREE_NODE_UNLOCKED); in btree_key_cache_flush_pos()
588 mark_btree_node_locked(trans, path, 0, BTREE_NODE_UNLOCKED); in bch2_btree_key_cache_drop()
Dbtree_iter.c688 if (t != BTREE_NODE_UNLOCKED) { in bch2_trans_node_add()
1083 if (btree_lock_want(path, l) == BTREE_NODE_UNLOCKED) in btree_path_set_level_down()
1234 if (t != BTREE_NODE_UNLOCKED) in btree_path_copy()
1514 case BTREE_NODE_UNLOCKED: in btree_node_locked_str()
1983 if (btree_lock_want(path, path->level + 1) == BTREE_NODE_UNLOCKED) in bch2_btree_iter_next_node()