Home
last modified time | relevance | path

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

/linux-6.15/fs/bcachefs/
H A Dbtree_locking.c462 if (!btree_path_node(path, l)) in btree_path_get_locks()
506 struct btree *b = btree_path_node(path, level); in __bch2_btree_node_relock()
582 l < path->locks_want && btree_path_node(path, l); in bch2_btree_path_relock_intent()
855 btree_path_node(path, path->level) && in bch2_btree_path_verify_locks()
H A Dbtree_iter.c163 if (!btree_path_node(path, level)) in bch2_btree_path_verify_level()
1102 while (btree_path_node(path, l) && in __btree_path_up_until_good_node()
1177 EBUG_ON(btree_path_node(path, path->level) && in bch2_btree_path_traverse_one()
1187 ret = btree_path_node(path, path->level) in bch2_btree_path_traverse_one()
1296 if (btree_path_node(path, level)) { in __bch2_btree_path_set_pos()
1371 if (!btree_path_node(path, l)) in bch2_btree_path_can_relock()
1891 if (btree_path_node(path, path->level)) in bch2_btree_iter_traverse()
1912 b = btree_path_node(path, path->level); in bch2_btree_iter_peek_node()
1965 if (!btree_path_node(path, path->level)) in bch2_btree_iter_next_node()
1969 if (!btree_path_node(path, path->level + 1)) { in bch2_btree_iter_next_node()
[all …]
H A Dbtree_iter.h55 static inline struct btree *btree_path_node(struct btree_path *path, in btree_path_node() function
70 return btree_path_node(path, b->c.level + 1); in btree_node_parent()
H A Drecovery.c270 if (unlikely(!btree_path_node(path, k->level))) { in bch2_journal_replay_key()
H A Dtrace.h620 struct btree *b = btree_path_node(path, level);
H A Dbtree_update_interior.c1161 if (!btree_path_node(path, level_end)) { in bch2_btree_update_start()