Home
last modified time | relevance | path

Searched refs:btree_node_locked (Results 1 – 6 of 6) sorted by relevance

/linux/fs/bcachefs/
H A Dbtree_locking.h61 static inline bool btree_node_locked(struct btree_path *path, unsigned level) in btree_node_locked() function
343 return btree_node_locked(path, path->level) in bch2_btree_path_relock()
353 EBUG_ON(btree_node_locked(path, level) && in bch2_btree_node_relock()
357 return likely(btree_node_locked(path, level)) || in bch2_btree_node_relock()
365 EBUG_ON(btree_node_locked(path, level) && in bch2_btree_node_relock_notrace()
369 return likely(btree_node_locked(path, level)) || in bch2_btree_node_relock_notrace()
407 EBUG_ON(!btree_node_locked(path, path->level)); in btree_path_set_should_be_locked()
H A Dbtree_iter.c125 bool locked = btree_node_locked(path, 0); in bch2_btree_path_verify_cached()
155 locked = btree_node_locked(path, level); in bch2_btree_path_verify_level()
340 !btree_node_locked(path, 0) || in bch2_assert_pos_locked()
788 bool was_locked = btree_node_locked(path, path->level); in btree_path_prefetch()
823 bool was_locked = btree_node_locked(path, path->level); in btree_path_prefetch_j()
854 bool locked = btree_node_locked(path, plevel); in btree_node_mem_ptr_set()
922 EBUG_ON(!btree_node_locked(path, path->level)); in btree_path_down()
1117 return likely(btree_node_locked(path, path->level) && in btree_path_up_until_good_node()
1172 !btree_node_locked(path, path->level)); in bch2_btree_path_traverse_one()
1293 BUG_ON(!btree_node_locked(path, level)); in __bch2_btree_path_set_pos()
[all …]
H A Dbtree_update_interior.h145 EBUG_ON(!btree_node_locked(path, level)); in bch2_foreground_maybe_merge_sibling()
H A Dbtree_locking.c522 BUG_ON(btree_node_locked(path, level)); in bch2_btree_node_upgrade()
539 if (btree_node_locked(path, level)) { in bch2_btree_node_upgrade()
H A Dbtree_key_cache.c448 BUG_ON(!btree_node_locked(path, 0)); in btree_key_cache_flush_pos()
H A Dtrace.h650 __entry->locked = btree_node_locked(path, level);
1848 __entry->dup_locked = dup ? btree_node_locked(dup, dup->level) : 0;