This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [tree-ssa] Tail recursion improvement
- From: Richard Henderson <rth at redhat dot com>
- To: Diego Novillo <dnovillo at redhat dot com>
- Cc: Jeff Law <law at redhat dot com>, Zdenek Dvorak <rakdver at atrey dot karlin dot mff dot cuni dot cz>, "gcc-patches at gcc dot gnu dot org" <gcc-patches at gcc dot gnu dot org>, Jan Hubicka <jh at suse dot cz>
- Date: Tue, 2 Mar 2004 11:04:03 -0800
- Subject: Re: [tree-ssa] Tail recursion improvement
- References: <200403021837.i22IbbvO027457@speedy.slc.redhat.com> <1078253447.4371.12.camel@localhost.localdomain>
On Tue, Mar 02, 2004 at 01:50:48PM -0500, Diego Novillo wrote:
> Perhaps the operand scanner may offer help here by marking CALL_EXPRs
> with has_volatile_ops if aliases haven't been computed yet.
This might be reasonable independent of tail calls, but really
I think there's absolutely no point to moving the pass up from
the very last thing we do before unssa.
Note that tail *recursion* is handled separately and earlier,
just before loop optimization. But even that is after aliases
have been computed.
r~