A stack is a memory area used to store and retrieve information in LIFO (last in, first out) order. It is very commonly used in basically any computer system and any program.
There are basically only 2 operation which can be performed on a stack:
- Push - Adding information to the stack
- Pop - Removing information from stack
A stack needs a stack pointer (SP), which typically points to the last item pushed onto the stack. Hardware stacks, used for program execution (that contain return addresses and activation frames,) typically grow downward from high memory to low memory. Pushing a 32-bit value onto a stack will decrement the stack pointer by 4, whereas popping a 32-bit value does the opposite and increments the stack pointer by 4.
One problem that is hard to control and avoid is stack overflow. It happens when the application has pushed more data onto the stack than actually fit, thereby overwriting other data areas or writing into areas that are not data. In any case, the effects will usually create problem when program execution continues, very likely a crash of the program. This is a problem especially in smaller Embedded Systems, which do not have a memory management unit (MMU) or memory protection unit (MPU) to control the access to the stack.