Searched refs:path_l (Results 1 – 7 of 7) sorted by relevance
43 struct btree *b = path_l(btree_iter_path(trans, iter))->b; in bch2_progress_update_iter()
785 struct btree_path_level *l = path_l(path); in btree_path_prefetch()883 struct btree_path_level *l = path_l(path); in btree_node_iter_and_journal_peek()921 struct btree_path_level *l = path_l(path); in btree_path_down()1349 if (sib && sib->level == path->level && path_l(sib)->b == path_l(path)->b) in have_node_at_pos()1353 if (sib && sib->level == path->level && path_l(sib)->b == path_l(path)->b) in have_node_at_pos()1513 struct btree *b = path_l(path)->b; in bch2_btree_path_to_text_short()1821 struct btree_path_level *l = path_l(path); in bch2_btree_path_peek_slot()2085 struct bpos end = path_l(path)->b->key.k.p; in bch2_btree_trans_peek_updates()2146 k->k ? k->k->p : path_l(path)->b->key.k.p); in btree_trans_peek_journal()2258 struct btree_path_level *l = path_l(path); in __bch2_btree_iter_peek()[all …]
263 ret = bch2_btree_node_lock_write(trans, path, &path_l(path)->b->c); in btree_key_cache_create()269 bch2_btree_node_unlock_write(trans, path, path_l(path)->b); in btree_key_cache_create()
294 struct btree *b = path_l(path)->b; in bch2_btree_insert_key_leaf()302 &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
613 struct btree *b = path_l(path)->b; in bch2_gc_mark_key()
1874 struct btree *b = path_l(trans->paths + path)->b; in bch2_btree_split_leaf()