Home
last modified time | relevance | path

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

/fs/bcachefs/
A Dbtree_locking.c680 struct btree_path *linked; in __bch2_btree_path_upgrade() local
683 trans_for_each_path(trans, linked, i) in __bch2_btree_path_upgrade()
684 if (linked != path && in __bch2_btree_path_upgrade()
685 linked->cached == path->cached && in __bch2_btree_path_upgrade()
686 linked->btree_id == path->btree_id && in __bch2_btree_path_upgrade()
687 linked->locks_want < new_locks_want) { in __bch2_btree_path_upgrade()
688 linked->locks_want = new_locks_want; in __bch2_btree_path_upgrade()
689 btree_path_get_locks(trans, linked, true, NULL, 0); in __bch2_btree_path_upgrade()
A Dbtree_locking.h177 struct btree_path *linked; in __bch2_btree_node_unlock_write() local
180 trans_for_each_path_with_node(trans, b, linked, i) in __bch2_btree_node_unlock_write()
181 linked->l[b->c.level].lock_seq++; in __bch2_btree_node_unlock_write()
A Dbtree_iter.c533 struct btree_path *linked; in bch2_btree_node_iter_fix() local
544 trans_for_each_path_with_node(trans, b, linked, i) { in bch2_btree_node_iter_fix()
545 __bch2_btree_node_iter_fix(linked, b, in bch2_btree_node_iter_fix()
546 &linked->l[b->c.level].iter, t, in bch2_btree_node_iter_fix()
548 bch2_btree_path_verify_level(trans, linked, b->c.level); in bch2_btree_node_iter_fix()
1222 struct btree_path *linked; in bch2_btree_path_traverse_one() local
1225 trans_for_each_path_with_node(trans, path_l(path)->b, linked, iter) in bch2_btree_path_traverse_one()
1227 linked->l[j] = path->l[j]; in bch2_btree_path_traverse_one()
A Dbtree_update_interior.c1832 struct btree_path *path = trans->paths + path_idx, *linked; in bch2_btree_insert_node() local
1878 trans_for_each_path_with_node(trans, b, linked, i) in bch2_btree_insert_node()
1879 bch2_btree_node_iter_peek(&linked->l[b->c.level].iter, b); in bch2_btree_insert_node()
/fs/jffs2/
A DREADME.Locking23 have been properly linked into the data structures for the inode to
45 including the linked list of node fragments (but see the notes below on

Completed in 18 milliseconds