fs/bcachefs/btree_update_interior.c

765 		struct btree_path *path = trans->paths + path_idx;
1564 	struct btree_path *path = trans->paths + path_idx;
1583 	struct btree *parent = btree_node_parent(trans->paths + path, b);
1591 	BUG_ON(parent && !btree_node_intent_locked(trans->paths + path, b->c.level + 1));
1625 		mark_btree_node_locked(trans, trans->paths + path1, n1->c.level, BTREE_NODE_INTENT_LOCKED);
1626 		bch2_btree_path_level_init(trans, trans->paths + path1, n1);
1630 		mark_btree_node_locked(trans, trans->paths + path2, n2->c.level, BTREE_NODE_INTENT_LOCKED);
1631 		bch2_btree_path_level_init(trans, trans->paths + path2, n2);
1648 			trans->paths[path2].locks_want++;
1649 			BUG_ON(btree_node_locked(trans->paths + path2, n3->c.level));
1651 			mark_btree_node_locked(trans, trans->paths + path2, n3->c.level, BTREE_NODE_INTENT_LOCKED);
1652 			bch2_btree_path_level_init(trans, trans->paths + path2, n3);
1675 		mark_btree_node_locked(trans, trans->paths + path1, n1->c.level, BTREE_NODE_INTENT_LOCKED);
1676 		bch2_btree_path_level_init(trans, trans->paths + path1, n1);
1688 		ret = bch2_btree_set_root(as, trans, trans->paths + path, n3, false);
1691 		ret = bch2_btree_set_root(as, trans, trans->paths + path, n1, false);
1714 	bch2_btree_node_free_inmem(trans, trans->paths + path, b);
1717 		bch2_trans_node_add(trans, trans->paths + path, n3);
1719 		bch2_trans_node_add(trans, trans->paths + path2, n2);
1720 	bch2_trans_node_add(trans, trans->paths + path1, n1);
1729 		__bch2_btree_path_unlock(trans, trans->paths + path2);
1733 		__bch2_btree_path_unlock(trans, trans->paths + path1);
1773 	struct btree_path *path = trans->paths + path_idx, *linked;
1845 	/* btree_split & merge may both cause paths array to be reallocated */
1846 	struct btree *b = path_l(trans->paths + path)->b;
1851 	as = bch2_btree_update_start(trans, trans->paths + path,
1852 				     trans->paths[path].level,
1865 	for (l = trans->paths[path].level + 1;
1866 	     btree_node_intent_locked(&trans->paths[path], l) && !ret;
1877 	struct btree_path *path = trans->paths + path_idx;
1917 	struct btree *b = bch2_btree_id_root(c, trans->paths[path].btree_id)->b;
1923 		bch2_btree_update_start(trans, trans->paths + path, b->c.level, true, flags);
1946 	enum btree_id btree = trans->paths[path].btree_id;
1953 	BUG_ON(!trans->paths[path].should_be_locked);
1954 	BUG_ON(!btree_node_locked(&trans->paths[path], level));
1972 	b = trans->paths[path].l[level].b;
1990 	btree_path_set_should_be_locked(trans->paths + sib_path);
1992 	m = trans->paths[sib_path].l[level].b;
1994 	if (btree_node_parent(trans->paths + path, b) !=
1995 	    btree_node_parent(trans->paths + sib_path, m)) {
2047 	parent = btree_node_parent(trans->paths + path, b);
2048 	as = bch2_btree_update_start(trans, trans->paths + path, level, false,
2080 	mark_btree_node_locked(trans, trans->paths + new_path, n->c.level, BTREE_NODE_INTENT_LOCKED);
2081 	bch2_btree_path_level_init(trans, trans->paths + new_path, n);
2099 	bch2_btree_node_free_inmem(trans, trans->paths + path, b);
2100 	bch2_btree_node_free_inmem(trans, trans->paths + sib_path, m);
2102 	bch2_trans_node_add(trans, trans->paths + path, n);
2158 	mark_btree_node_locked(trans, trans->paths + new_path, n->c.level, BTREE_NODE_INTENT_LOCKED);
2159 	bch2_btree_path_level_init(trans, trans->paths + new_path, n);
2178 	bch2_trans_node_add(trans, trans->paths + iter->path, n);