1 / 9

Computer Architecture

Computer Architecture. Lecture 13 – part 1 by Engineer A. Lecturer Aymen Hasan AlAwady 31/3/2014 University of Kufa - Information Technology Research and Development Center. 1. 1. Stack and Subroutines.

bdonohue
Download Presentation

Computer Architecture

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Computer Architecture Lecture 13 – part 1by Engineer A. Lecturer AymenHasanAlAwady 31/3/2014 University of Kufa - Information Technology Research and Development Center 1

  2. 1. Stack and Subroutines The stackis an area of memory identified by the programmer for temporary storage of information. • The stack is a LIFO(Last In First Out) structure. • The programmer defines the bottom of the stack and the stack growsup into reducing address range. So, the stack normally grows backwardsinto memory.

  3. 1.2 The Stack • Given that the stack grows backwards into memory, it is customary to place the bottom of the stack at the end of memory to keep it as far away from user programs as possible. • In the 8085, the stack is defined by setting the SP(Stack Pointer) register. LXI SP, FFFFH • This sets the Stack Pointer to location FFFFH (end of memory for the 8085).

  4. 1.3 Saving Information on the Stack • Information is saved on the stack by PUSHingit on. • Information is retrieved from the stack by POPingit off. • The 8085 provides two instructions: PUSHand POPfor storing information on the stack and retrieving it back. • Both PUSHand POPwork with register pairs ONLY.

  5. 1.3.1 The PUSH Instruction LXI SP, FFFFH ; To indicate the starting of the stack. PUSH B • Decrement SP. • Copy the contents of register B to the memory location pointed to by SP. • Decrement SP. • Copy the contents of register C to the memory location pointed to by SP. B C SP

  6. 1.3.2 The POP Instruction POP D • Copy the contents of the memory location pointed to by the SP to register E. • Increment SP. • Copy the contents of the memory location pointed to by the SP to register D. • Increment SP. D E SP

  7. 1.4 Operation of the Stack 1. During pushing, the stack operates in a “decrement then store” style. • The stack pointer is decrementedfirst, then the information is placed on the stack. 2. During poping, the stack operates in a “use then increment” style. • The informationis retrieved from the top of the stack and then the pointer is incremented. • The SP pointer always points to “the top of the stack”.

  8. 1.5 LIFO (Last In First Out) order • The order of PUSHsand POPsmust be oppositeof each other in order to retrieve information back into its original location. PUSH B PUSH D ... POP D POP B

  9. End of lecture 13 Part 1

More Related