SSA implementation

[Gerald Pfeifer]

On Thu, 29 Jun 2000, Mark Mitchell wrote:
> We will be contributing a dead-code elimination pass in the very near
> future that operates on the SSA form.  One big improvement is that
> this algorithm is a) very fast and b) can eliminate loops in things
> like:
> 
>   void f () { 
>     int i;
>     for (i = 0; i < 100; ++i)
>       ;
>   }

When you do so, please don't also update the "Deleting ``empty'' loops"
section in the GCC manual.

Some time ago I added a note that in the future the behavior described
there will change which apparently is going to happen now. :-)

Gerald
-- 
Gerald "Jerry" pfeifer@dbai.tuwien.ac.at http://www.dbai.tuwien.ac.at/~pfeifer/
Have a look at http://petition.eurolinux.org -- it's not about Linux, btw!