Home
last modified time | relevance | path

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

/fs/bcachefs/
A Dbtree_iter.c799 struct btree_path_level *l = path_l(path); in btree_path_prefetch()
896 struct btree_path_level *l = path_l(path); in btree_node_iter_and_journal_peek()
950 struct btree_path_level *l = path_l(path); in btree_path_down()
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()
1527 struct btree *b = path_l(path)->b; in bch2_btree_path_to_text_short()
1833 struct btree_path_level *l = path_l(path); in bch2_btree_path_peek_slot()
2099 struct bpos end = path_l(path)->b->key.k.p; in bch2_btree_trans_peek_updates()
2162 k->k ? k->k->p : path_l(path)->b->key.k.p); in btree_trans_peek_journal()
2276 struct btree_path_level *l = path_l(path); in __bch2_btree_iter_peek()
[all …]
A Dprogress.c43 struct btree *b = path_l(btree_iter_path(trans, iter))->b; in bch2_progress_update_iter()
A Dbtree_key_cache.c272 ret = bch2_btree_node_lock_write(trans, path, &path_l(path)->b->c); in btree_key_cache_create()
278 bch2_btree_node_unlock_write(trans, path, path_l(path)->b); in btree_key_cache_create()
A Dbtree_trans_commit.c296 struct btree *b = path_l(path)->b; in bch2_btree_insert_key_leaf()
304 &path_l(path)->iter, insert))) in bch2_btree_insert_key_leaf()
A Dbtree_types.h345 static inline struct btree_path_level *path_l(struct btree_path *path) in path_l() function
A Dbtree_gc.c642 struct btree *b = path_l(path)->b; in bch2_gc_mark_key()
A Dbtree_update_interior.c1916 struct btree *b = path_l(trans->paths + path)->b; in bch2_btree_split_leaf()

Completed in 26 milliseconds