Home
last modified time | relevance | path

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

/linux/fs/bcachefs/
H A Dbtree_iter.c799 struct btree_path_level *l = path_l(path); in btree_path_prefetch()
897 struct btree_path_level *l = path_l(path); in btree_node_iter_and_journal_peek()
935 struct btree_path_level *l = path_l(path); in btree_path_down()
1225 trans_for_each_path_with_node(trans, path_l(path)->b, linked, iter) in bch2_btree_path_traverse_one()
1363 if (sib && sib->level == path->level && path_l(sib)->b == path_l(path)->b) in have_node_at_pos()
1367 if (sib && sib->level == path->level && path_l(sib)->b == path_l(path)->b) in have_node_at_pos()
1535 struct btree *b = path_l(path)->b; in bch2_btree_path_to_text_short()
1843 struct btree_path_level *l = path_l(path); in bch2_btree_path_peek_slot()
2089 struct bpos end = path_l(btree_iter_path(trans, iter))->b->data->min_key; in bch2_btree_trans_peek_prev_updates()
2106 struct bpos end = path_l(path)->b->key.k.p; in bch2_btree_trans_peek_updates()
[all …]
H A Dbtree_key_cache.c263 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()
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 Dbtree_gc.c590 struct btree *b = path_l(path)->b; in bch2_gc_mark_key()
H A Dbackpointers.c763 struct btree *b = path_l(btree_iter_path(trans, iter))->b; in progress_update_iter()
H A Dbtree_update_interior.c1848 struct btree *b = path_l(trans->paths + path)->b; in bch2_btree_split_leaf()