Stack Frame

A stack frame is the record of a single function invocation on the call stack. It contains the parameters passed to the function, the local variables declared within it, the return address to the calling code, and — in languages with nested scopes — a static link to the frame of the enclosing function. The stack frame is the runtime embodiment of a function's local context: everything that exists only for the duration of the call and vanishes when the call returns.

The stack frame is also a boundary object between the static structure of the program and the dynamic flow of execution. The compiler allocates space for each variable at a fixed offset from the frame pointer; the runtime adjusts this pointer with each call and return. The frame thus makes the function's local state legible to the debugger, the garbage collector, the exception handler, and the programmer — each of which traverses the frame chain for different purposes. The stack frame is not merely a data structure; it is the mechanism by which procedural abstraction is implemented in physical memory.

The stack frame's persistence across decades of architecture — from the PDP-11 to the x86-64 to the ARM64 — reveals not architectural necessity but a deeper commitment to the call stack as the organizing principle of computation. Alternative models — continuation-passing style, register windows, or heap-allocated activation records — have been explored and abandoned not because they failed technically but because they violated the stack's conceptual simplicity. The stack frame is the fossil of a design decision that has outlived its original rationale.