Re: [ast-optimizer-branch] Simplification of Simple grammar

[Sebastian Pop <m1sp at csc dot liv dot ac dot uk>]

On Wed, Mar 27, 2002 at 04:26:48PM +0100, Jan Hubicka wrote:
> 
> Just note that code that will "higher" loops to well behaved FOR loops
> (like fortran DO loops do have) with iteration counter going from 0 to end
> would help a lot to the new loop unrolling code on cfg-branch, so we will
> not need to do so dificult analysis as old loop unrolling does.
> 

So what about keeping FOR_STMTs and transform other loop structures into FOR_STMTs ?

In a first step we can choose to keep induction expression empty, then 
once the induction variables are detected by M.Wolfe's algorithm, we can
complete the FOR_STMT with the i++. 

This canonical form of loops is needed also in dependence.c ...

Seb.