SSA implementation
Mark Mitchell
mark@codesourcery.com
Thu Jun 29 12:11:00 GMT 2000
>>>>> "Geoff" == Geoff Keating <geoffk@cygnus.com> writes:
Geoff> It does turn the code into SSA form. That's close to
Geoff> everything we want it to do. In the future there will be
Geoff> other things done while the code is in SSA form, but they
Geoff> will be separate passes.
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)
;
}
Jeffrey Oldham has a mostly working implementation of this algorithm.
--
Mark Mitchell mark@codesourcery.com
CodeSourcery, LLC http://www.codesourcery.com
More information about the Gcc
mailing list