search for: gnat_ugn_unw

...pe="text/x-adatree"> <comment>Ada tree</comment> <comment xml:lang="no">Ada-tre</comment> <glob pattern="*.adt"/> </mime-type> Regards, Preben Randhol Reference: <URL: http://gcc.gnu.org/onlinedocs/gcc-4.0.0/gnat_ugn_unw/File-Naming-Rules.html#File-Naming-Rules> <URL: http://gcc.gnu.org/onlinedocs/gcc-4.0.0/gnat_ugn_unw/The-Ada-Library-Information-Files.html#The-Ada-Library-Information-Files> <URL: http://lgl.epfl.ch/teaching/programming01_02/doc/gnat_ug.html#SEC142>

Hi I was wondering if someone knows about any effort within the LLVM community to perform stack usage analysis per function similar to GCC's "-fstack-usage<http://gcc.gnu.org/onlinedocs/gnat_ugn_unw/Static-Stack-Usage-Analysis.html>" option? In short, with fstack-usage, gcc prints out the maximum stack usage per function (in bytes) which it can determine as a) static (no calls to alloca in source) b) bounded (calls to alloca with constants) c) unbounded (calls to alloca with variables...

On 9/3/13 1:27 PM, Snehasish Kumar wrote: > Hi > > I was wondering if someone knows about any effort within the LLVM > community to perform stack usage analysis per function similar to > GCC's "-fstack-usage > <http://gcc.gnu.org/onlinedocs/gnat_ugn_unw/Static-Stack-Usage-Analysis.html>" > option? I am not familiar with the -fstack-usage option in GCC, but as far as I know, LLVM does not have a FunctionPass or MachineFunctionPass which performs the calculations described below. You could, of course, quickly test this by running th...