165 	struct xfs_iext_node	*node = ifp->if_u1.if_root;  in xfs_iext_find_first_leaf()
183 	struct xfs_iext_node	*node = ifp->if_u1.if_root;  in xfs_iext_find_last_leaf()
313 	struct xfs_iext_node	*node = ifp->if_u1.if_root;  in xfs_iext_find_level()
409 		struct xfs_iext_leaf *prev = ifp->if_u1.if_root;  in xfs_iext_grow()
414 		struct xfs_iext_node *prev = ifp->if_u1.if_root;  in xfs_iext_grow()
425 	ifp->if_u1.if_root = node;  in xfs_iext_grow()
437 	struct xfs_iext_node	*node = ifp->if_u1.if_root;  in xfs_iext_update_node()
590 	ifp->if_u1.if_root = kmem_zalloc(sizeof(struct xfs_iext_rec), KM_NOFS);  in xfs_iext_alloc_root()
594 	cur->leaf = ifp->if_u1.if_root;  in xfs_iext_alloc_root()
610 	new = kmem_realloc(ifp->if_u1.if_root, new_size, KM_NOFS);  in xfs_iext_realloc_root()
612 	ifp->if_u1.if_root = new;  in xfs_iext_realloc_root()
785 		ASSERT(node == ifp->if_u1.if_root);  in xfs_iext_remove_node()
786 		ifp->if_u1.if_root = node->ptrs[0];  in xfs_iext_remove_node()
862 	kmem_free(ifp->if_u1.if_root);  in xfs_iext_free_last_leaf()
863 	ifp->if_u1.if_root = NULL;  in xfs_iext_free_last_leaf()
880 	ASSERT(ifp->if_u1.if_root != NULL);  in xfs_iext_remove()
1050 	xfs_iext_destroy_node(ifp->if_u1.if_root, ifp->if_height);  in xfs_iext_destroy()
1054 	ifp->if_u1.if_root = NULL;  in xfs_iext_destroy()