161 	struct xfs_iext_node	*node = ifp->if_u1.if_root;  in xfs_iext_find_first_leaf()
179 	struct xfs_iext_node	*node = ifp->if_u1.if_root;  in xfs_iext_find_last_leaf()
309 	struct xfs_iext_node	*node = ifp->if_u1.if_root;  in xfs_iext_find_level()
405 		struct xfs_iext_leaf *prev = ifp->if_u1.if_root;  in xfs_iext_grow()
410 		struct xfs_iext_node *prev = ifp->if_u1.if_root;  in xfs_iext_grow()
421 	ifp->if_u1.if_root = node;  in xfs_iext_grow()
433 	struct xfs_iext_node	*node = ifp->if_u1.if_root;  in xfs_iext_update_node()
586 	ifp->if_u1.if_root = kmem_zalloc(sizeof(struct xfs_iext_rec), KM_NOFS);  in xfs_iext_alloc_root()
590 	cur->leaf = ifp->if_u1.if_root;  in xfs_iext_alloc_root()
606 	new = krealloc(ifp->if_u1.if_root, new_size, GFP_NOFS | __GFP_NOFAIL);  in xfs_iext_realloc_root()
608 	ifp->if_u1.if_root = new;  in xfs_iext_realloc_root()
780 		ASSERT(node == ifp->if_u1.if_root);  in xfs_iext_remove_node()
781 		ifp->if_u1.if_root = node->ptrs[0];  in xfs_iext_remove_node()
857 	kmem_free(ifp->if_u1.if_root);  in xfs_iext_free_last_leaf()
858 	ifp->if_u1.if_root = NULL;  in xfs_iext_free_last_leaf()
875 	ASSERT(ifp->if_u1.if_root != NULL);  in xfs_iext_remove()
1045 	xfs_iext_destroy_node(ifp->if_u1.if_root, ifp->if_height);  in xfs_iext_destroy()
1049 	ifp->if_u1.if_root = NULL;  in xfs_iext_destroy()