Re: Stack Overflow Detection
- From: Niklas Holsti <niklas.holsti@xxxxxxxxxxxxxxx>
- Date: Fri, 30 May 2008 22:28:53 +0300
Tomás Ó hÉilidhe wrote:
On May 30, 4:37 pm, Vladimir Vassilevsky <antispam_bo...@xxxxxxxxxxx>
wrote:
The main problem with it is that you
never know for sure what is the maximum stack usage.
Are you sure about that? Would it not just be a case of determining
how much stack space each of the function's use, and then looking at
the logic of the program to see what could possibly be the deepest
level?
There are static-analysis tools that can do that. Some compilers/linkers do it and there are stand-alone tools like GnatStack, StackAnalyzer from AbsInt, and Bound-T from my company. Of course, these tools are not available for all processors, and may have difficulty with recursion and stack frames of dynamic (run-time-computed) size.
--
Niklas Holsti
Tidorum Ltd
niklas holsti tidorum fi
. @ .
.
- References:
- Stack Overflow Detection
- From: Richard Phillips
- Re: Stack Overflow Detection
- From: Vladimir Vassilevsky
- Re: Stack Overflow Detection
- From: Tomás Ó hÉilidhe
- Stack Overflow Detection
- Prev by Date: Re: Driving tri-state LED matrix
- Next by Date: Re: Driving tri-state LED matrix
- Previous by thread: Re: Stack Overflow Detection
- Next by thread: Re: Stack Overflow Detection
- Index(es):
Relevant Pages
|