This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: [tree-ssa] New regressions as of 2003-11-04
- From: Diego Novillo <dnovillo at redhat dot com>
- To: Jeff Law <law at redhat dot com>
- Cc: Andrew Macleod <amacleod at redhat dot com>, Zdenek Dvorak <rakdver at atrey dot karlin dot mff dot cuni dot cz>, Daniel Berlin <dberlin at dberlin dot org>, Jan Hubicka <jh at suse dot cz>, gcc mailing list <gcc at gcc dot gnu dot org>
- Date: Tue, 04 Nov 2003 20:52:01 -0500
- Subject: Re: [tree-ssa] New regressions as of 2003-11-04
- Organization: Red Hat Canada
- References: <200311042151.hA4LpHjB017544@speedy.slc.redhat.com>
On Tue, 2003-11-04 at 16:51, law@redhat.com wrote:
> if (set != -1)
> goto lab1;
> else
> goto lab2;
>
> lab1:
> set = 0;
> goto lab3;
> lab2:
> set = -1;
> lab3:
> [ ... ]
>
> Which looks precisely like what we've got now.
>
Yes, but what I had in mind is to go out of SSA in DOM order. Andrew
was thinking of doing some post-processing in the out-of-ssa pass.
Maybe we could add this as well.
Andrew, does that sound too gross for the out-of-ssa pass?
Diego.