Stack-based memory allocation

<a href="/facts/Stack_(abstract_data_type)/bj7l94v1">Stacks</a> in computing architectures are regions of <a href="/facts/Memory_(computers)/hQKVQ51J">memory</a> where data is added or removed in a <a href="/facts/LIFO_(computing)/bj7l94v1">last-in-first-out (LIFO)</a> manner.
In most modern computer systems, each <a href="/facts/Thread_(computer_science)/hh8WHyPd">thread</a> has a reserved region of memory referred to as its stack. When a function executes, it may add some of its local state data to the top of the stack; when the function exits it is responsible for removing that data from the stack. At a minimum, a thread's stack is used to store the location of a return address provided by the caller in order to allow return statements to return to the correct location.
The stack is often used to store variables of fixed length local to the currently active functions. Programmers may further choose to explicitly use the stack to store local data of variable length. If a region of memory lies on the thread's stack, that memory is said to have been allocated on the stack, i.e. stack-based memory allocation (SBMA). This is contrasted with a <a href="/facts/Heap-based_memory_allocation/vthLkUpz">heap-based memory allocation</a> (HBMA). The SBMA is often closely coupled with a <a href="/facts/Call_stack/1sMt713v">function call stack</a>.

Stack-based memory allocation open-in-new

Stack-based memory allocation