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: 'Alexandre Oliva' <aoliva at redhat dot com>, "Palmer.Chris" <Chris dot Palmer at IGT dot com>
- Subject: RE: gcc - Run Time Memory Capture
- From: "Palmer.Chris" <Chris dot Palmer at IGT dot com>
- Date: Mon, 23 Apr 2001 09:39:12 -0700
- Cc: "'raman dot govindan at wipro dot com'" <raman dot govindan at wipro dot com>, bug-gcc at gnu dot org
Alexandre,
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, or am I missing something?
Regards, Chris
> -----Original Message-----
> From: Alexandre Oliva [mailto:aoliva@redhat.com]
> Sent: 23 April 2001 16:51
> To: Palmer.Chris
> Cc: 'raman.govindan@wipro.com'; bug-gcc@gnu.org
> Subject: Re: gcc - Run Time Memory Capture
>
>
> On Apr 23, 2001, "Palmer.Chris" <Chris.Palmer@IGT.com> wrote:
>
> > A more useful addition to the gcc suite would be a program that can
> > work out the maximum possible stack depth without having to run the
> > program.
>
> Err... Isn't this as non-computable as telling whether a program
> terminates, in the general case?
>
> --
> 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
>