This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

Re: [tree-ssa] Tail recursion improvement


In message <1078253447.4371.12.camel@localhost.localdomain>, Diego Novillo writ
es:
 >On Tue, 2004-03-02 at 13:37, law@redhat.com wrote:
 >
 >> You've moved tail recursion to a point before we've got aliasing informatio
 >n,
 >> which means that we haven't computed virtual uses/defs.  This ultimately le
 >ad
 >> to transforming tail recursive calls that ought to be left alone.
 >> 
 >Perhaps the operand scanner may offer help here by marking CALL_EXPRs
 >with has_volatile_ops if aliases haven't been computed yet.
But it would seem to me that would, in effect, prevent any tail recursion
optimization from happening at all.  Really the tail recursion stuff needs
to run after we've computed aliasing information.

Your patch may still be a wise idea, but I don't think it's really the
solution to the problem.

jeff


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]