From Fedora Project Wiki
(Created page with "== Stack space needed == For each function, record the worst-case stack space use, or “unbounded” if recursion, unbounded <code>alloca</code>, or unbounded variable-lengt...") |
No edit summary |
||
| Line 3: | Line 3: | ||
For each function, record the worst-case stack space use, or “unbounded” if recursion, unbounded <code>alloca</code>, or unbounded variable-length arrays (VLAs) are involved. (Merging information from multiple DSOs is hard once cross-translation-unit function calls are involved.) | For each function, record the worst-case stack space use, or “unbounded” if recursion, unbounded <code>alloca</code>, or unbounded variable-length arrays (VLAs) are involved. (Merging information from multiple DSOs is hard once cross-translation-unit function calls are involved.) | ||
This is probably not | This is probably not that important to Fedora, but could help embedded use cases. It may also be relevant to [[Toolchain/Watermark/HardeningStackCheck|stack overflow checking]]. | ||
[[Category:Toolchain/Watermark/Provisional]] | [[Category:Toolchain/Watermark/Provisional]] | ||
Latest revision as of 10:59, 24 October 2016
Stack space needed
For each function, record the worst-case stack space use, or “unbounded” if recursion, unbounded alloca, or unbounded variable-length arrays (VLAs) are involved. (Merging information from multiple DSOs is hard once cross-translation-unit function calls are involved.)
This is probably not that important to Fedora, but could help embedded use cases. It may also be relevant to stack overflow checking.