135 	if (ifp->if_height == 1)  in xfs_iext_max_recs()
164 	if (!ifp->if_height)  in xfs_iext_find_first_leaf()
167 	for (height = ifp->if_height; height > 1; height--) {  in xfs_iext_find_first_leaf()
182 	if (!ifp->if_height)  in xfs_iext_find_last_leaf()
185 	for (height = ifp->if_height; height > 1; height--) {  in xfs_iext_find_last_leaf()
240 	if (ifp->if_height > 1 && !xfs_iext_valid(ifp, cur) &&  in xfs_iext_next()
268 	if (ifp->if_height > 1 && cur->leaf->prev) {  in xfs_iext_prev()
312 	if (!ifp->if_height)  in xfs_iext_find_level()
315 	for (height = ifp->if_height; height > level; height--) {  in xfs_iext_find_level()
404 	if (ifp->if_height == 1) {  in xfs_iext_grow()
412 		ASSERT(ifp->if_height > 1);  in xfs_iext_grow()
422 	ifp->if_height++;  in xfs_iext_grow()
436 	for (height = ifp->if_height; height > level; height--) {  in xfs_iext_update_node()
503 	if (ifp->if_height < level)  in xfs_iext_insert_node()
587 	ifp->if_height = 1;  in xfs_iext_alloc_root()
638 	if (ifp->if_height == 0)  in xfs_iext_insert()
640 	else if (ifp->if_height == 1)  in xfs_iext_insert()
731 	ASSERT(level <= ifp->if_height);  in xfs_iext_remove_node()
756 	if (level < ifp->if_height) {  in xfs_iext_remove_node()
782 		ifp->if_height--;  in xfs_iext_remove_node()
856 	ifp->if_height--;  in xfs_iext_free_last_leaf()
874 	ASSERT(ifp->if_height > 0);  in xfs_iext_remove()
891 		if (ifp->if_height > 1 && leaf->next)  in xfs_iext_remove()
901 	if (ifp->if_height > 1)  in xfs_iext_remove()
944 	if (ifp->if_height == 1 || !cur->leaf->next)  in xfs_iext_lookup_extent()
1045 	xfs_iext_destroy_node(ifp->if_u1.if_root, ifp->if_height);  in xfs_iext_destroy()
1048 	ifp->if_height = 0;  in xfs_iext_destroy()