Understanding stack frame of function call in C/C++? [closed]

by

Your question is borderline here. programmers could be a better place.

A good book to understand the concepts of stack etc might be Queinnec’s Lisp In Small Pieces (it explains quite well what a stack is for Lisp). Also, SICP
is a good book to read.

D.Knuth‘s books and MMIX is also a good read.

Read carefully Wikipedia Call stack page.

In theory, no call stack is needed, and some languages and implementations (e.g. old SML/NJ) did not use any stack (but allocated the call frame in the garbage collected heap). See A.Appel’s old paper Garbage Collection Can be Faster than Stack Allocation (and learn more about garbage collection in general).

Usually C and C++ implementations have a stack (and often use the hardware stack). Some C local variables might not have any stack location (because they have been optimized, or are kept in a register). Sometimes, the stack location of a C local variable may change (the compiler would use one call stack slot for some occurrences, and another call stack slot for other occurrences of the same local variable). And of course some temporary values may be compiled like your local variables (so stay in a register, on in one stack slot then another one, etc….). When optimizing the compiler could do weird tricks with variables.

On some old machines IBM/360 or IBM z/series, there is no hardware stack; the stack used by the C compiler is a software convention (e.g. some register is dedicated to that usage, without specific hardware support)

Think about the execution (or interpretation) of a recursively defined function (like the good old factorial naively coded). Read about recursion (in general, in computer science), primitive recursive functions, lambda calculus, denotational semantics, stack automaton, register allocation, tail calls, continuations, ABI, interrupts, Posix signals, sigaltstack(2), getcontext(2), longjmp(3)etc…. etc…

Read also books about Computer Architecture. In practice, the call stack is so important that several hardware resources (including the stack pointer register, often the call frame base pointer register, and perhaps hidden machinery e.g. cache related) are dedicated to it on common processors.

You could also look at the intermediate representations used by the GCC compiler. Then use -fdump-tree-all or the GCC MELT probe. If looking at the generated assembly be sure to pass -S -fverbose-asm to your gcc command.

See also the linux assembly howto.

I gave a lot of links. It is difficult to answer better, because I have no idea of your background.

More Related Contents:

  1. Compiler issue or some bug in code block of c [duplicate]
  2. Calling delete on variable allocated on the stack
  3. Global memory management in C++ in stack or heap?
  4. Constants and compiler optimization in C++
  5. Proper stack and heap usage in C++?
  6. Can placement new for arrays be used in a portable way?
  7. What does it mean when a numeric constant in C/C++ is prefixed with a 0?
  8. Qt: can’t find -lGL error
  9. How to create a static library with g++?
  10. Unexpected order of evaluation (compiler bug?) [duplicate]
  11. Stack-buffer based STL allocator?
  12. Atomic operations, std::atomic and ordering of writes
  13. Compile-time assertion?
  14. Why don’t the C or C++ standards explicitly define char as signed or unsigned?
  15. What do C and Assembler actually compile to? [closed]
  16. Understanding return value optimization and returning temporaries – C++
  17. what is/are the purpose(s) of inline?
  18. Declaring and initializing a variable in a Conditional or Control statement in C++
  19. Portability of #warning preprocessor directive
  20. Automatically adding Enter/Exit Function Logs to a Project
  21. When do compilers inline C++ code?
  22. Does std::stack expose iterators?
  23. What issues can I expect compiling C code with a C++ compiler?
  24. Why include guards?
  25. Looking for 16-bit x86 compiler
  26. x86 MUL Instruction from VS 2008/2010
  27. How are GCC and g++ bootstrapped?
  28. Store results of std::stack .pop() method into a variable
  29. How to clone object in C++ ? Or Is there another solution?
  30. How to prevent an object being created on the heap?

Leave a Comment