139 	if (ifp->if_height == 1)  in xfs_iext_max_recs()
168 	if (!ifp->if_height)  in xfs_iext_find_first_leaf()
171 	for (height = ifp->if_height; height > 1; height--) {  in xfs_iext_find_first_leaf()
186 	if (!ifp->if_height)  in xfs_iext_find_last_leaf()
189 	for (height = ifp->if_height; height > 1; height--) {  in xfs_iext_find_last_leaf()
244 	if (ifp->if_height > 1 && !xfs_iext_valid(ifp, cur) &&  in xfs_iext_next()
272 	if (ifp->if_height > 1 && cur->leaf->prev) {  in xfs_iext_prev()
316 	if (!ifp->if_height)  in xfs_iext_find_level()
319 	for (height = ifp->if_height; height > level; height--) {  in xfs_iext_find_level()
408 	if (ifp->if_height == 1) {  in xfs_iext_grow()
416 		ASSERT(ifp->if_height > 1);  in xfs_iext_grow()
426 	ifp->if_height++;  in xfs_iext_grow()
440 	for (height = ifp->if_height; height > level; height--) {  in xfs_iext_update_node()
507 	if (ifp->if_height < level)  in xfs_iext_insert_node()
591 	ifp->if_height = 1;  in xfs_iext_alloc_root()
643 	if (ifp->if_height == 0)  in xfs_iext_insert()
645 	else if (ifp->if_height == 1)  in xfs_iext_insert()
736 	ASSERT(level <= ifp->if_height);  in xfs_iext_remove_node()
761 	if (level < ifp->if_height) {  in xfs_iext_remove_node()
787 		ifp->if_height--;  in xfs_iext_remove_node()
861 	ifp->if_height--;  in xfs_iext_free_last_leaf()
879 	ASSERT(ifp->if_height > 0);  in xfs_iext_remove()
896 		if (ifp->if_height > 1 && leaf->next)  in xfs_iext_remove()
906 	if (ifp->if_height > 1)  in xfs_iext_remove()
949 	if (ifp->if_height == 1 || !cur->leaf->next)  in xfs_iext_lookup_extent()
1050 	xfs_iext_destroy_node(ifp->if_u1.if_root, ifp->if_height);  in xfs_iext_destroy()
1053 	ifp->if_height = 0;  in xfs_iext_destroy()