gcc - Run Time Memory Capture

[Toon Moene]

"Palmer.Chris" wrote:

>         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?

      READ*,N,L,M
      CALL MAIN(N,L,M)
      END
      SUBROUTINE MAIN(N,L,M)
      DIMENSION A(N,L,M), B(N,L,M), C(N,L), D(L,M) ! Etc., ...
      ...
      END

Mutatis mutandis with C99's VLA's.

-- 
Toon Moene - mailto:toon@moene.indiv.nluug.nl - phoneto: +31 346 214290
Saturnushof 14, 3738 XG  Maartensdijk, The Netherlands
Maintainer, GNU Fortran 77: http://gcc.gnu.org/onlinedocs/g77_news.html
Join GNU Fortran 95: http://g95.sourceforge.net/ (under construction)