125 	struct xfs_iext_leaf	*next;  member
241 	    cur->leaf->next) {  in xfs_iext_next()
242 		cur->leaf = cur->leaf->next;  in xfs_iext_next()
571 	if (leaf->next)  in xfs_iext_split_leaf()
572 		leaf->next->prev = new;  in xfs_iext_split_leaf()
573 	new->next = leaf->next;  in xfs_iext_split_leaf()
575 	leaf->next = new;  in xfs_iext_split_leaf()
700 		struct xfs_iext_node *next = parent->ptrs[*pos + 1];  in xfs_iext_rebalance_node()  local
701 		int nr_next = xfs_iext_node_nr_entries(next, 0), i;  in xfs_iext_rebalance_node()
710 				node->keys[nr_entries + i] = next->keys[i];  in xfs_iext_rebalance_node()
711 				node->ptrs[nr_entries + i] = next->ptrs[i];  in xfs_iext_rebalance_node()
715 			return next;  in xfs_iext_rebalance_node()
818 	if (leaf->next) {  in xfs_iext_rebalance_leaf()
819 		int nr_next = xfs_iext_leaf_nr_entries(ifp, leaf->next, 0), i;  in xfs_iext_rebalance_leaf()
829 					leaf->next->recs[i];  in xfs_iext_rebalance_leaf()
832 			if (cur->leaf == leaf->next) {  in xfs_iext_rebalance_leaf()
837 			offset = xfs_iext_leaf_key(leaf->next, 0);  in xfs_iext_rebalance_leaf()
838 			leaf = leaf->next;  in xfs_iext_rebalance_leaf()
846 		leaf->prev->next = leaf->next;  in xfs_iext_rebalance_leaf()
847 	if (leaf->next)  in xfs_iext_rebalance_leaf()
848 		leaf->next->prev = leaf->prev;  in xfs_iext_rebalance_leaf()
891 		if (ifp->if_height > 1 && leaf->next)  in xfs_iext_remove()
892 			cur->leaf = leaf->next;  in xfs_iext_remove()
944 	if (ifp->if_height == 1 || !cur->leaf->next)  in xfs_iext_lookup_extent()
946 	cur->leaf = cur->leaf->next;  in xfs_iext_lookup_extent()