Home
last modified time | relevance | path

Searched refs:path_l (Results 1 – 5 of 5) sorted by relevance

/linux/fs/bcachefs/
H A Dbtree_iter.c781 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()
2056 struct bpos end = path_l(btree_iter_path(trans, iter))->b->data->min_key; in bch2_btree_trans_peek_prev_updates()
2073 struct bpos end = path_l(path)->b->key.k.p; in bch2_btree_trans_peek_updates()
[all …]
H A Dbtree_trans_commit.c293 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()
H A Dbtree_types.h348 static inline struct btree_path_level *path_l(struct btree_path *path) in path_l() function
H A Dbackpointers.c834 struct btree *b = path_l(btree_iter_path(trans, iter))->b; in progress_update_iter()
H A Dbtree_gc.c585 struct btree *b = path_l(path)->b; in bch2_gc_mark_key()