Home
last modified time | relevance | path

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

/linux-6.12.1/fs/bcachefs/
Dbtree_locking.c447 if (!btree_path_node(path, l)) in btree_path_get_locks()
491 struct btree *b = btree_path_node(path, level); in __bch2_btree_node_relock()
581 l < path->locks_want && btree_path_node(path, l); in bch2_btree_path_relock_intent()
843 btree_path_node(path, path->level) && in bch2_btree_path_verify_locks()
Dbtree_iter.c163 if (!btree_path_node(path, level)) in bch2_btree_path_verify_level()
1096 while (btree_path_node(path, l) && in __btree_path_up_until_good_node()
1102 i < path->locks_want && btree_path_node(path, i); in __btree_path_up_until_good_node()
1171 EBUG_ON(btree_path_node(path, path->level) && in bch2_btree_path_traverse_one()
1181 ret = btree_path_node(path, path->level) in bch2_btree_path_traverse_one()
1290 if (btree_path_node(path, level)) { in __bch2_btree_path_set_pos()
1365 if (!btree_path_node(path, l)) in bch2_btree_path_can_relock()
1885 if (btree_path_node(path, path->level)) in bch2_btree_iter_traverse()
1906 b = btree_path_node(path, path->level); in bch2_btree_iter_peek_node()
1959 if (!btree_path_node(path, path->level)) in bch2_btree_iter_next_node()
[all …]
Dbtree_iter.h54 static inline struct btree *btree_path_node(struct btree_path *path, in btree_path_node() function
69 return btree_path_node(path, b->c.level + 1); in btree_node_parent()
Drecovery.c213 if (unlikely(!btree_path_node(path, k->level))) { in bch2_journal_replay_key()
Dtrace.h572 struct btree *b = btree_path_node(path, level);
Dbtree_update_interior.c1179 if (!btree_path_node(path, level_end)) { in bch2_btree_update_start()