Home
last modified time | relevance | path

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

/linux/fs/bcachefs/
H A Dbtree_locking.h44 return BTREE_NODE_UNLOCKED + ((path->nodes_locked >> (level << 1)) & 3); in btree_node_locked_type()
75 path->nodes_locked &= ~(3U << (level << 1)); in mark_btree_node_locked_noreset()
76 path->nodes_locked |= (type + 1) << (level << 1); in mark_btree_node_locked_noreset()
144 return __ffs(path->nodes_locked) >> 1; in btree_path_lowest_level_locked()
149 return __fls(path->nodes_locked) >> 1; in btree_path_highest_level_locked()
157 while (path->nodes_locked) in __bch2_btree_path_unlock()
399 : path->nodes_locked) in bch2_btree_path_upgrade()
H A Dtrace.h1750 __field(u8, nodes_locked )
1768 __entry->nodes_locked = path->nodes_locked;
1803 (__entry->nodes_locked >> 6) & 3,
1804 (__entry->nodes_locked >> 4) & 3,
1805 (__entry->nodes_locked >> 2) & 3,
1806 (__entry->nodes_locked >> 0) & 3,
1838 __field(u8, nodes_locked )
1853 __entry->nodes_locked = path->nodes_locked;
1888 (__entry->nodes_locked >> 6) & 3,
1889 (__entry->nodes_locked >> 4) & 3,
[all …]
H A Dbtree_locking.c326 if (!path->nodes_locked) in bch2_check_for_deadlock()
687 while (path->nodes_locked && in __bch2_btree_path_downgrade()
854 !path->nodes_locked); in bch2_btree_path_verify_locks()
856 if (!path->nodes_locked) in bch2_btree_path_verify_locks()
881 if (path->nodes_locked) in bch2_trans_locked()
H A Dbtree_types.h333 u8 nodes_locked; member
H A Dbtree_iter.c743 EBUG_ON(path->nodes_locked); in btree_path_lock_root()
1737 path->nodes_locked = 0; in btree_path_alloc()
1792 path->nodes_locked = 0; in bch2_path_get()
3566 if (!path->nodes_locked) in bch2_btree_trans_to_text()