Related articles |
---|
stack overflow at compile time jatin.bhateja@conexant.com (Jatin Bhateja) (2006-04-27) |
Re: stack overflow at compile time NOSPAMrszeflerNOSPAM@murator.com.pl (RobertSzefler) (2006-04-27) |
Re: stack overflow at compile time vb@compilers.de (Volker Barthelmann) (2006-04-27) |
Re: stack overflow at compile time nitin@CoWare.com (Nitin Gupta) (2006-04-27) |
Re: stack overflow at compile time henry@spsystems.net (2006-04-27) |
Re: stack overflow at compile time gah@ugcs.caltech.edu (glen herrmannsfeldt) (2006-04-28) |
Re: stack overflow at compile time jvorbrueggen@mediasec.de (=?ISO-8859-1?Q?Jan_Vorbr=FCggen?=) (2006-04-28) |
Re: stack overflow at compile time jatin.bhateja@conexant.com (Jatin Bhateja) (2006-04-28) |
Re: stack overflow at compile time emailamit@gmail.com (Amit Gupta) (2006-04-29) |
Re: stack overflow at compile time bobduff@shell01.TheWorld.com (Robert A Duff) (2006-04-29) |
[5 later articles] |
From: | Nitin Gupta <nitin@CoWare.com> |
Newsgroups: | comp.compilers |
Date: | 27 Apr 2006 23:33:18 -0400 |
Organization: | CoWare, Inc |
References: | 06-04-157 |
Keywords: | storage, analysis |
Posted-Date: | 27 Apr 2006 23:33:18 EDT |
Hi Jatin,
One of the important scenario that you left is indirect function call
through function pointer.
There are tools like the Infineon TriCore SDA (Stack Depth Analyzer) and
others from Absint (www.absint.com/stackanalyzer)(I am sure there will be
others too)
I know about the Infineon tool, which identifies recursion, indirect
recursions and indirect function calls.
It calculates the stack requirement of an application statically by
getting user inputs.
Hope this helps.
Best Regards,
Nitin Gupta
Jatin Bhateja wrote:
Hi,
Is it possible at compile time to know whether there is a possibility of
stack overflow at run time? I feel that to some extent it is possible.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.