767 		struct btree_path *path = trans->paths + path_idx;  in btree_update_nodes_written()
1569 	struct btree_path *path = trans->paths + path_idx;  in btree_split_insert_keys()
1588 	struct btree *parent = btree_node_parent(trans->paths + path, b);  in btree_split()
1596 	BUG_ON(parent && !btree_node_intent_locked(trans->paths + path, b->c.level + 1));  in btree_split()
1630 		mark_btree_node_locked(trans, trans->paths + path1, n1->c.level, BTREE_NODE_INTENT_LOCKED);  in btree_split()
1631 		bch2_btree_path_level_init(trans, trans->paths + path1, n1);  in btree_split()
1635 		mark_btree_node_locked(trans, trans->paths + path2, n2->c.level, BTREE_NODE_INTENT_LOCKED);  in btree_split()
1636 		bch2_btree_path_level_init(trans, trans->paths + path2, n2);  in btree_split()
1653 			trans->paths[path2].locks_want++;  in btree_split()
1654 			BUG_ON(btree_node_locked(trans->paths + path2, n3->c.level));  in btree_split()
1656 			mark_btree_node_locked(trans, trans->paths + path2, n3->c.level, BTREE_NODE_INTENT_LOCKED);  in btree_split()
1657 			bch2_btree_path_level_init(trans, trans->paths + path2, n3);  in btree_split()
1680 		mark_btree_node_locked(trans, trans->paths + path1, n1->c.level, BTREE_NODE_INTENT_LOCKED);  in btree_split()
1681 		bch2_btree_path_level_init(trans, trans->paths + path1, n1);  in btree_split()
1693 		ret = bch2_btree_set_root(as, trans, trans->paths + path, n3, false);  in btree_split()
1696 		ret = bch2_btree_set_root(as, trans, trans->paths + path, n1, false);  in btree_split()
1719 	bch2_btree_node_free_inmem(trans, trans->paths + path, b);  in btree_split()
1722 		bch2_trans_node_add(trans, trans->paths + path, n3);  in btree_split()
1724 		bch2_trans_node_add(trans, trans->paths + path2, n2);  in btree_split()
1725 	bch2_trans_node_add(trans, trans->paths + path1, n1);  in btree_split()
1734 		__bch2_btree_path_unlock(trans, trans->paths + path2);  in btree_split()
1738 		__bch2_btree_path_unlock(trans, trans->paths + path1);  in btree_split()
1778 	struct btree_path *path = trans->paths + path_idx, *linked;  in bch2_btree_insert_node()
1850 	/* btree_split & merge may both cause paths array to be reallocated */  in bch2_btree_split_leaf()
1851 	struct btree *b = path_l(trans->paths + path)->b;  in bch2_btree_split_leaf()
1856 	as = bch2_btree_update_start(trans, trans->paths + path,  in bch2_btree_split_leaf()
1857 				     trans->paths[path].level,  in bch2_btree_split_leaf()
1870 	for (l = trans->paths[path].level + 1;  in bch2_btree_split_leaf()
1871 	     btree_node_intent_locked(&trans->paths[path], l) && !ret;  in bch2_btree_split_leaf()
1882 	struct btree_path *path = trans->paths + path_idx;  in __btree_increase_depth()
1922 	struct btree *b = bch2_btree_id_root(c, trans->paths[path].btree_id)->b;  in bch2_btree_increase_depth()
1928 		bch2_btree_update_start(trans, trans->paths + path, b->c.level, true, flags);  in bch2_btree_increase_depth()
1951 	enum btree_id btree = trans->paths[path].btree_id;  in __bch2_foreground_maybe_merge()
1958 	BUG_ON(!trans->paths[path].should_be_locked);  in __bch2_foreground_maybe_merge()
1959 	BUG_ON(!btree_node_locked(&trans->paths[path], level));  in __bch2_foreground_maybe_merge()
1977 	b = trans->paths[path].l[level].b;  in __bch2_foreground_maybe_merge()
1995 	btree_path_set_should_be_locked(trans, trans->paths + sib_path);  in __bch2_foreground_maybe_merge()
1997 	m = trans->paths[sib_path].l[level].b;  in __bch2_foreground_maybe_merge()
1999 	if (btree_node_parent(trans->paths + path, b) !=  in __bch2_foreground_maybe_merge()
2000 	    btree_node_parent(trans->paths + sib_path, m)) {  in __bch2_foreground_maybe_merge()
2052 	parent = btree_node_parent(trans->paths + path, b);  in __bch2_foreground_maybe_merge()
2053 	as = bch2_btree_update_start(trans, trans->paths + path, level, false,  in __bch2_foreground_maybe_merge()
2085 	mark_btree_node_locked(trans, trans->paths + new_path, n->c.level, BTREE_NODE_INTENT_LOCKED);  in __bch2_foreground_maybe_merge()
2086 	bch2_btree_path_level_init(trans, trans->paths + new_path, n);  in __bch2_foreground_maybe_merge()
2104 	bch2_btree_node_free_inmem(trans, trans->paths + path, b);  in __bch2_foreground_maybe_merge()
2105 	bch2_btree_node_free_inmem(trans, trans->paths + sib_path, m);  in __bch2_foreground_maybe_merge()
2107 	bch2_trans_node_add(trans, trans->paths + path, n);  in __bch2_foreground_maybe_merge()
2163 	mark_btree_node_locked(trans, trans->paths + new_path, n->c.level, BTREE_NODE_INTENT_LOCKED);  in bch2_btree_node_rewrite()
2164 	bch2_btree_path_level_init(trans, trans->paths + new_path, n);  in bch2_btree_node_rewrite()
2183 	bch2_trans_node_add(trans, trans->paths + iter->path, n);  in bch2_btree_node_rewrite()