2024-04-16 07:50:04 +01:00
|
|
|
---
|
|
|
|
|
id: 1fig
|
|
|
|
|
title: Stack_memory
|
|
|
|
|
tags: [memory]
|
|
|
|
|
created: Tuesday, April 16, 2024
|
|
|
|
|
---
|
|
|
|
|
|
|
|
|
|
# Stack memory
|
|
|
|
|
|
|
|
|
|
Along with heap memory, programs make use of _stack memory_ during the runtime
|
|
|
|
|
of programs.
|
|
|
|
|
|
|
|
|
|
## Stack memory
|
|
|
|
|
|
2024-04-20 12:50:05 +01:00
|
|
|
Similarly to the [[Stacks|stacks]], it works on the basis of LIFO: the last item
|
|
|
|
|
put on the stack is the first item to be withdrawn.
|
2024-04-16 07:50:04 +01:00
|
|
|
|
|
|
|
|
Note, this doesn't mean that the data at the memory addresses that comprise the
|
|
|
|
|
stack can _only_ be accessed in a LIFO manner. Any item currently on the stack
|
|
|
|
|
can be accessed (be read or modified) at any time. LIFO applies when it is is
|
|
|
|
|
time to clear memory from the stack: the most recent addition is cleared first.
|
|
|
|
|
|
|
|
|
|
### Stack pointer
|
|
|
|
|
|
|
|
|
|
A **stack pointer** is used to manage the items in the stack. This value is
|
|
|
|
|
stored in a [[processor register]] and its value is the memory address of the
|
|
|
|
|
item currently on the top of the stack.
|
|
|
|
|
|
|
|
|
|
## Related notes
|
