Home
last modified time | relevance | path

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

/linux-6.15/fs/bcachefs/
H A Dbtree_locking.h62 static inline bool btree_node_locked(struct btree_path *path, unsigned level) in btree_node_locked() function
347 return btree_node_locked(path, path->level) in bch2_btree_path_relock()
357 EBUG_ON(btree_node_locked(path, level) && in bch2_btree_node_relock()
361 return likely(btree_node_locked(path, level)) || in bch2_btree_node_relock()
369 EBUG_ON(btree_node_locked(path, level) && in bch2_btree_node_relock_notrace()
373 return likely(btree_node_locked(path, level)) || in bch2_btree_node_relock_notrace()
411 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()
860 bool locked = btree_node_locked(path, plevel); in btree_node_mem_ptr_set()
928 EBUG_ON(!btree_node_locked(path, path->level)); in btree_path_down()
1123 return likely(btree_node_locked(path, path->level) && in btree_path_up_until_good_node()
1178 !btree_node_locked(path, path->level)); in bch2_btree_path_traverse_one()
1299 BUG_ON(!btree_node_locked(path, level)); in __bch2_btree_path_set_pos()
1829 EBUG_ON(!btree_node_locked(path, path->level)); in bch2_btree_path_peek_slot()
3196 if (path->cached && !btree_node_locked(path, 0)) in bch2_trans_srcu_unlock()
[all …]
H A Dbtree_locking.c536 BUG_ON(btree_node_locked(path, level)); in bch2_btree_node_upgrade()
553 if (btree_node_locked(path, level) in bch2_btree_node_upgrade()
872 BUG_ON(btree_node_locked(path, l) && in bch2_btree_path_verify_locks()
H A Dbtree_update_interior.h145 EBUG_ON(!btree_node_locked(path, level)); in bch2_foreground_maybe_merge_sibling()
H A Dbtree_update_interior.c1660 BUG_ON(btree_node_locked(trans->paths + path2, n3->c.level)); in btree_split()
1908 BUG_ON(!btree_node_locked(path, b->c.level)); in __btree_increase_depth()
1916 BUG_ON(btree_node_locked(path, n->c.level)); in __btree_increase_depth()
1981 BUG_ON(!btree_node_locked(&trans->paths[path], level)); in __bch2_foreground_maybe_merge()
H A Dbtree_key_cache.c490 BUG_ON(!btree_node_locked(path, 0)); in btree_key_cache_flush_pos()
H A Dtrace.h698 __entry->locked = btree_node_locked(path, level);
1892 __entry->dup_locked = dup ? btree_node_locked(dup, dup->level) : 0;
H A Dbtree_cache.c1329 BUG_ON(path && !btree_node_locked(path, level + 1)); in bch2_btree_node_prefetch()