Stack: Difference between revisions
(LIFO) |
(why pulling is slower) |
||
Line 22: | Line 22: | ||
* [[BRK]] | * [[BRK]] | ||
PL* instructions take one cycle more than their PH* counterparts. These instructions pull things from the stack: | PL* instructions take one cycle more than their PH* counterparts because they have to increment the stack pointer to point to the top element before it can be pulled, whereas push instructions pipeline the decrement of SP so that it overlaps the opcode fetch of the next instruction. These instructions pull things from the stack: | ||
* [[PLA]] | * [[PLA]] |
Latest revision as of 22:38, 12 November 2024
The Stack is a LIFO (last-in, first-out) buffer which remembers the state of subroutines that are currently executing.
On the 65c816, the stack is always in bank zero.[3] It can be thousands of bytes deep.[1]
In emulation mode it wraps within page one.[2]
The stack grows towards zero, but the most recently pushed byte is nontheless called the top of the stack.[4] These instructions push things to the stack:
PL* instructions take one cycle more than their PH* counterparts because they have to increment the stack pointer to point to the top element before it can be pulled, whereas push instructions pipeline the decrement of SP so that it overlaps the opcode fetch of the next instruction. These instructions pull things from the stack:
Note the lack of PLK. PHS and PLS similarly do not exist, nor do any instructions performing the inverse of PEA, PEI, or PER.
See Also
References
- Wilson, Garth. https://wilsonminesco.com/816myths
- Clark, Bruce. http://www.6502.org/tutorials/65c816opcodes.html#5.1.1
- section 2.11 of 65c816 datasheet: https://www.westerndesigncenter.com/wdc/documentation/w65c816s.pdf
- Eyes & Lichty, page 33