This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
Re: gcc - Run Time Memory Capture
- To: "Palmer.Chris" <Chris dot Palmer at IGT dot com>
- Subject: Re: gcc - Run Time Memory Capture
- From: Alexandre Oliva <aoliva at redhat dot com>
- Date: 23 Apr 2001 13:48:04 -0300
- Cc: "'raman dot govindan at wipro dot com'" <raman dot govindan at wipro dot com>, bug-gcc at gnu dot org
- Organization: GCC Team, Red Hat
- References: <C901658C9B18D51187ED00306E065C6E095271@man945nts001.intgame.com>
On Apr 23, 2001, "Palmer.Chris" <Chris.Palmer@IGT.com> wrote:
> If the program includes recursion it is, but if it does not then the
> worst case stack depth for a function would be the amount it uses itself
> plus the maximum of any functions it calls
Add in alloca() and deferred pops, and yes, you're probably right.
--
Alexandre Oliva Enjoy Guarana', see http://www.ic.unicamp.br/~oliva/
Red Hat GCC Developer aoliva@{cygnus.com, redhat.com}
CS PhD student at IC-Unicamp oliva@{lsd.ic.unicamp.br, gnu.org}
Free Software Evangelist *Please* write to mailing lists, not to me