Lines Matching defs:path
97 static inline bool btree_path_pos_before_node(struct btree_path *path, in btree_path_pos_before_node()
103 static inline bool btree_path_pos_after_node(struct btree_path *path, in btree_path_pos_after_node()
109 static inline bool btree_path_pos_in_node(struct btree_path *path, in btree_path_pos_in_node()
122 struct btree_path *path) in bch2_btree_path_verify_cached()
139 struct btree_path *path, unsigned level) in bch2_btree_path_verify_level()
221 struct btree_path *path) in bch2_btree_path_verify()
240 struct btree_path *path; in bch2_trans_verify_paths() local
332 struct btree_path *path; in bch2_assert_pos_locked() local
363 struct btree_path *path, unsigned l) {} in bch2_btree_path_verify_level()
365 struct btree_path *path) {} in bch2_btree_path_verify()
391 static void __bch2_btree_path_fix_key_modified(struct btree_path *path, in __bch2_btree_path_fix_key_modified()
408 struct btree_path *path; in bch2_btree_path_fix_key_modified() local
417 static void __bch2_btree_node_iter_fix(struct btree_path *path, in __bch2_btree_node_iter_fix()
509 struct btree_path *path, in bch2_btree_node_iter_fix()
564 struct btree_path *path, in btree_path_level_peek()
578 struct btree_path *path, in btree_path_level_prev()
591 static inline bool btree_path_advance_to_pos(struct btree_path *path, in btree_path_advance_to_pos()
610 static inline void __btree_path_level_init(struct btree_path *path, in __btree_path_level_init()
626 struct btree_path *path, in bch2_btree_path_level_init()
670 struct btree_path *path, in bch2_trans_node_add()
706 struct btree_path *path; in bch2_trans_node_reinit_iter() local
718 struct btree_path *path, in btree_path_lock_root()
778 static int btree_path_prefetch(struct btree_trans *trans, struct btree_path *path) in btree_path_prefetch()
814 static int btree_path_prefetch_j(struct btree_trans *trans, struct btree_path *path, in btree_path_prefetch_j()
850 struct btree_path *path, in btree_node_mem_ptr_set()
872 struct btree_path *path, in btree_node_iter_and_journal_peek()
910 struct btree_path *path, in btree_path_down()
983 struct btree_path *path; in bch2_btree_path_traverse_all() local
1055 static inline bool btree_path_check_pos_in_node(struct btree_path *path, in btree_path_check_pos_in_node()
1066 struct btree_path *path, in btree_path_good_node()
1075 struct btree_path *path, in btree_path_set_level_down()
1091 struct btree_path *path, in __btree_path_up_until_good_node()
1114 struct btree_path *path, in btree_path_up_until_good_node()
1137 struct btree_path *path = &trans->paths[path_idx]; in bch2_btree_path_traverse_one() local
1253 btree_path_idx_t path, bool intent, unsigned long ip) in __bch2_btree_path_make_mut()
1277 struct btree_path *path = trans->paths + path_idx; in __bch2_btree_path_set_pos() local
1323 static struct btree_path *have_path_at_pos(struct btree_trans *trans, struct btree_path *path) in have_path_at_pos()
1338 static struct btree_path *have_node_at_pos(struct btree_trans *trans, struct btree_path *path) in have_node_at_pos()
1353 static inline void __bch2_path_free(struct btree_trans *trans, btree_path_idx_t path) in __bch2_path_free()
1360 static bool bch2_btree_path_can_relock(struct btree_trans *trans, struct btree_path *path) in bch2_btree_path_can_relock()
1382 struct btree_path *path = trans->paths + path_idx, *dup; in bch2_path_put() local
1414 static void bch2_path_put_nokeep(struct btree_trans *trans, btree_path_idx_t path, in bch2_path_put_nokeep()
1487 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_to_text_short() local
1531 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_to_text() local
1699 struct btree_path *path = &trans->paths[idx]; in btree_path_alloc() local
1714 struct btree_path *path; in bch2_path_get() local
1800 struct btree_path *path = trans->paths + path_idx; in bch2_path_get_unlocked_mut() local
1806 struct bkey_s_c bch2_btree_path_peek_slot(struct btree_path *path, struct bkey *u) in bch2_btree_path_peek_slot()
1854 struct btree_path *path = btree_iter_path(trans, iter); in bch2_set_btree_iter_dontneed() local
1884 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_traverse() local
1905 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_peek_node() local
1956 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_next_node() local
2072 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_trans_peek_updates() local
2102 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_journal_peek() local
2115 struct btree_path *path = btree_iter_path(trans, iter); in btree_trans_peek_slot_journal() local
2131 struct btree_path *path = btree_iter_path(trans, iter); in btree_trans_peek_journal() local
2218 struct btree_path *path = btree_iter_path(trans, iter); in __bch2_btree_iter_peek() local
2497 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_peek_prev() local
2760 struct btree_path *path; in btree_trans_verify_sorted_refs() local
2780 struct btree_path *path, *prev = NULL; in btree_trans_verify_sorted() local
2841 struct btree_path *path) in btree_path_list_remove()
2861 struct btree_path *path = trans->paths + path_idx; in btree_path_list_add() local
2927 struct btree_path *path = btree_iter_path(trans, iter); in bch2_trans_node_iter_init() local
3037 struct btree_path *path; in bch2_trans_srcu_unlock() local
3071 struct btree_path *path; in bch2_trans_begin() local
3241 struct btree_path *path; in check_btree_paths_leaked() local
3377 struct btree_path *path = paths + idx; in bch2_btree_trans_to_text() local