# Stack register > Mediated Wiki article. Canonical URL: https://mediated.wiki/source/Stack_register > Markdown URL: https://mediated.wiki/source/Stack_register.md > Source: https://en.wikipedia.org/wiki/Stack_register > Source revision: 1336518714 > License: Creative Commons Attribution-ShareAlike 4.0 International (https://creativecommons.org/licenses/by-sa/4.0/) {{Short description|Component of a computer's processor}} {{Use dmy dates|date=March 2020|cs1-dates=y}} {{Broader|Stack (abstract data type)#Basic architecture of a stack|Call stack#Structure|topic=stack pointers}} A '''stack register''', also known as a '''stack pointer''', is a computer central [processor register](/source/processor_register) whose purpose is to keep track of a [call stack](/source/call_stack). On an [accumulator-based architecture](/source/accumulator-based_architecture) machine, this may be a dedicated register. On a machine with multiple [general-purpose registers](/source/general-purpose_registers), it may be a register that is reserved by convention, such as on the [IBM System/360](/source/IBM_System%2F360) through [z/Architecture](/source/z%2FArchitecture) architecture and [RISC](/source/RISC) architectures, or it may be a register that procedure call and return instructions are hardwired to use, such as on the [PDP-11](/source/PDP-11), [VAX](/source/VAX), and [Intel x86](/source/Intel_x86) architectures. Some designs such as the [Data General Eclipse](/source/Data_General_Eclipse) had no dedicated register, but used a reserved hardware memory address for this function. Machines before the late 1960s—such as the [PDP-8](/source/PDP-8) and [HP 2100](/source/HP_2100)—did not have compilers which supported [recursion](/source/Recursion_(computer_science)). Their subroutine instructions typically would save the current location in the jump address, and then set the program counter to the ''next'' address. While this is simpler than maintaining a stack, since there is only one return location per subroutine code section, there cannot be recursion without considerable effort on the part of the programmer. A [stack machine](/source/stack_machine) may have 2 or more stack registers — one of them keeps track of a [call stack](/source/call_stack), the other(s) keep track of other [stack](/source/stack_(data_structure))(s). == Stack engine == Simpler processors store the stack pointer in a regular [hardware register](/source/hardware_register) and use the [arithmetic logic unit](/source/arithmetic_logic_unit) (ALU) to manipulate its value. In processors with instructions that push items onto the stack and pop items from the stack, those instructions are either executed with multiple hardwired CPU cycles or [microinstructions](/source/microinstructions) or are translated into multiple [micro-op](/source/micro-op)s, to separately add/subtract the stack pointer, and perform the load/store in memory. Newer processors of that type contain a dedicated '''stack engine''' to optimize stack operations. [Pentium M](/source/Pentium_M) was the first x86 processor to introduce a stack engine. In its implementation, the stack pointer is split among two registers: ESPO, which is a 32-bit register, and ESPd, an 8-bit delta value that is updated directly by stack operations. PUSH, POP, CALL and RET opcodes operate directly with the ESPd register. If ESPd is near overflow or the ESP register is referenced from other instructions (when ESPd ≠ 0), a synchronisation micro-op is inserted that updates the ESPO using the ALU and resets ESPd to 0. This design has remained largely unmodified in later Intel processors, although ESPO has been expanded to 64 bits. A stack engine similar to Intel's was also adopted in the [AMD K8](/source/AMD_K8) microarchitecture. In [Bulldozer](/source/Bulldozer_(microarchitecture)), the need for synchronization micro-ops was removed, but the internal design of the stack engine is not known. == References == {{cite book |author-first=David |author-last=Salomon |editor-first=Ian D. |editor-last=Chivers |title=Assemblers and Loaders |date=February 1993 |orig-year=1992 |edition=1 |series=Ellis Horwood Series In Computers And Their Applications |publisher=[Ellis Horwood Limited](/source/Ellis_Horwood_Limited) / [Simon & Schuster International Group](/source/Simon_%26_Schuster_International_Group) |location=California State University, Northridge, California, USA |publication-place=Chicester, West Sussex, UK |isbn=0-13-052564-2 |url=http://www.davidsalomon.name/assem.advertis/asl.pdf |access-date=2008-10-01 |url-status=live |archive-url=https://web.archive.org/web/20200323010358/http://www.davidsalomon.name/assem.advertis/asl.pdf |archive-date=2020-03-23 |quote=Most computers save the return address in either the stack, in one of the registers, or in the first word of the procedure (in which case the first executable instruction of the procedure should be stored in the second word). If the latter method is used, a return from the procedure is a jump to the memory location whose address is contained in the first word of the procedure.}} (xiv+294+4 pages) {{Cite web |url=http://archive.arstechnica.com/cpu/004/pentium-m/m-pentium-m-5.html |title=A Look at Centrino's Core: The Pentium M |author-first=Jon "Hannibal" |author-last=Stokes |date=2004-02-25 |website=archive.arstechnica.com |page=5}} {{Cite web |url=http://www.agner.org/optimize/microarchitecture.pdf |title=The microarchitecture of Intel, AMD and VIA CPUs |author-last=Fog |author-first=Agner |publisher=Technical University of Denmark }} {{CPU technologies}} Category:Control flow Category:Central processing unit Category:Digital registers --- Adapted from the Wikipedia article [Stack register](https://en.wikipedia.org/wiki/Stack_register) by Wikipedia contributors ([contributor history](https://en.wikipedia.org/wiki/Stack_register?action=history)). Available under [Creative Commons Attribution-ShareAlike 4.0 International](https://creativecommons.org/licenses/by-sa/4.0/). Changes may have been made.