Searched refs:path_l (Results 1 – 6 of 6) sorted by relevance
781 struct btree_path_level *l = path_l(path); in btree_path_prefetch()877 struct btree_path_level *l = path_l(path); in btree_node_iter_and_journal_peek()915 struct btree_path_level *l = path_l(path); in btree_path_down()1205 trans_for_each_path_with_node(trans, path_l(path)->b, linked, iter) in bch2_btree_path_traverse_one()1343 if (sib && sib->level == path->level && path_l(sib)->b == path_l(path)->b) in have_node_at_pos()1347 if (sib && sib->level == path->level && path_l(sib)->b == path_l(path)->b) in have_node_at_pos()1500 struct btree *b = path_l(path)->b; in bch2_btree_path_to_text_short()1809 struct btree_path_level *l = path_l(path); in bch2_btree_path_peek_slot()2073 struct bpos end = path_l(path)->b->key.k.p; in bch2_btree_trans_peek_updates()2134 k.k ? k.k->p : path_l(path)->b->key.k.p); in btree_trans_peek_journal()[all …]
293 struct btree *b = path_l(path)->b; in bch2_btree_insert_key_leaf()301 &path_l(path)->iter, insert))) in bch2_btree_insert_key_leaf()
348 static inline struct btree_path_level *path_l(struct btree_path *path) in path_l() function
839 struct btree *b = path_l(btree_iter_path(trans, iter))->b; in progress_update_iter()
585 struct btree *b = path_l(path)->b; in bch2_gc_mark_key()
1851 struct btree *b = path_l(trans->paths + path)->b; in bch2_btree_split_leaf()
Completed in 23 milliseconds