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] Make some tree-walking functions tail recursive

From: Zdenek Dvorak <rakdver at atrey dot karlin dot mff dot cuni dot cz>
To: Steven Bosscher <s dot bosscher at student dot tudelft dot nl>
Cc: gcc-patches at gcc dot gnu dot org
Date: Sat, 1 Nov 2003 22:37:20 +0100
Subject: Re: [tree-ssa] Make some tree-walking functions tail recursive
References: <20031101194019.GA31265@atrey.karlin.mff.cuni.cz> <1067722392.3628.3.camel@steven.lr-s.tudelft.nl>

Hello,

> > I keep running out of stack when compiling some huge functions (like
> > 20001226-1.c).  This patch fixes it by making walk_tree and
> > record_in_finally_tree to use tail recursion.  Bootstrapped and
> > regtested on i686.
> 
> Why doesn't your tail recursion elimination stuff eliminate them?

the first one (walk_tree), because there is no way how compiler could
know about the possibility to do tail recursion.  The second one because
I compile it without optimizations.

Zdenek

References:
- [tree-ssa] Make some tree-walking functions tail recursive
  - From: Zdenek Dvorak
- Re: [tree-ssa] Make some tree-walking functions tail recursive
  - From: Steven Bosscher

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