Searched refs:btree_path_node (Results 1 – 6 of 6) sorted by relevance
| /fs/bcachefs/ |
| A D | btree_locking.c | 465 if (!btree_path_node(path, l)) in btree_path_get_locks()
519 struct btree *b = btree_path_node(path, level); in __bch2_btree_node_relock()
595 l < path->locks_want && btree_path_node(path, l); in bch2_btree_path_relock_intent()
887 if (!path->nodes_locked && btree_path_node(path, path->level)) { in __bch2_btree_path_verify_locks()
|
| A D | btree_iter.c | 159 if (!btree_path_node(path, level)) in __bch2_btree_path_verify_level()
1116 while (btree_path_node(path, l) && in __btree_path_up_until_good_node()
1191 EBUG_ON(btree_path_node(path, path->level) && in bch2_btree_path_traverse_one()
1201 ret = btree_path_node(path, path->level) in bch2_btree_path_traverse_one()
1310 if (btree_path_node(path, level)) { in __bch2_btree_path_set_pos()
1385 if (!btree_path_node(path, l)) in bch2_btree_path_can_relock()
1903 if (btree_path_node(path, path->level)) in bch2_btree_iter_traverse()
1924 b = btree_path_node(path, path->level); in bch2_btree_iter_peek_node()
1977 if (!btree_path_node(path, path->level)) in bch2_btree_iter_next_node()
1981 if (!btree_path_node(path, path->level + 1)) { in bch2_btree_iter_next_node()
[all …]
|
| A D | btree_iter.h | 57 static inline struct btree *btree_path_node(struct btree_path *path, in btree_path_node() function
72 return btree_path_node(path, b->c.level + 1); in btree_node_parent()
|
| A D | recovery.c | 276 if (unlikely(!btree_path_node(path, k->level))) { in bch2_journal_replay_key()
|
| A D | btree_update_interior.c | 1193 if (!btree_path_node(path, level_end)) { in bch2_btree_update_start()
1242 struct btree *b = btree_path_node(path, path->level); in bch2_btree_update_start()
|
| A D | trace.h | 669 struct btree *b = btree_path_node(path, level);
|
Completed in 26 milliseconds