This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: SSA implementation
- To: mark at codesourcery dot com
- Subject: Re: SSA implementation
- From: kenner at vlsi1 dot ultra dot nyu dot edu (Richard Kenner)
- Date: Fri, 30 Jun 00 06:52:01 EDT
- Cc: gcc at gcc dot gnu dot org
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)
;
}
We could always have eliminated such loops, but as I understood it, we
chose not to under the assumption they were there for timing delay
purposes. Has this policy chaged?