Searched refs:btree_node_locked (Results 1 – 8 of 8) sorted by relevance
| /linux/fs/bcachefs/ |
| A D | btree_locking.h | 61 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()
|
| A D | btree_iter.c | 125 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()
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()
1817 EBUG_ON(!btree_node_locked(path, path->level)); in bch2_btree_path_peek_slot()
3041 if (path->cached && !btree_node_locked(path, 0)) in bch2_trans_srcu_unlock()
[all …]
|
| A D | btree_update_interior.h | 145 EBUG_ON(!btree_node_locked(path, level)); in bch2_foreground_maybe_merge_sibling()
|
| A D | btree_locking.c | 522 BUG_ON(btree_node_locked(path, level)); in bch2_btree_node_upgrade()
539 if (btree_node_locked(path, level)) { in bch2_btree_node_upgrade()
|
| A D | btree_update_interior.c | 1654 BUG_ON(btree_node_locked(trans->paths + path2, n3->c.level)); in btree_split()
1885 BUG_ON(!btree_node_locked(path, b->c.level)); in __btree_increase_depth()
1893 BUG_ON(btree_node_locked(path, n->c.level)); in __btree_increase_depth()
1959 BUG_ON(!btree_node_locked(&trans->paths[path], level)); in __bch2_foreground_maybe_merge()
|
| A D | btree_key_cache.c | 448 BUG_ON(!btree_node_locked(path, 0)); in btree_key_cache_flush_pos()
|
| A D | trace.h | 650 __entry->locked = btree_node_locked(path, level);
1848 __entry->dup_locked = dup ? btree_node_locked(dup, dup->level) : 0;
|
| A D | btree_cache.c | 1328 BUG_ON(path && !btree_node_locked(path, level + 1)); in bch2_btree_node_prefetch()
|
Completed in 28 milliseconds