Presentation is loading. Please wait.

Presentation is loading. Please wait.

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

Similar presentations


Presentation on theme: "Computer Architecture Lecture 13 – part 1 by Engineer A. Lecturer Aymen Hasan AlAwady 31/3/2014 University of Kufa - Information Technology Research and."— Presentation transcript:

1 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

2 1. Stack and Subroutines The stack is 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 grows up into reducing address range. So, the stack normally grows backwards into memory. 2

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). 3

4 1.3 Saving Information on the Stack Information is saved on the stack by PUSHing it on. Information is retrieved from the stack by POPing it off. The 8085 provides two instructions: PUSH and POP for storing information on the stack and retrieving it back. Both PUSH and POP work with register pairs ONLY. 4

5 1.3.1 The PUSH Instruction LXI SP, FFFFH ; To indicate the starting of the stack. PUSH B 1.Decrement SP. 2.Copy the contents of register B to the memory location pointed to by SP. 3.Decrement SP. 4.Copy the contents of register C to the memory location pointed to by SP. 5 12F3 FFFB FFFC FFFDF3 FFFE12 FFFF SP B C

6 1.3.2 The POP Instruction POP D 1.Copy the contents of the memory location pointed to by the SP to register E. 2.Increment SP. 3.Copy the contents of the memory location pointed to by the SP to register D. 4.Increment SP. 6 12F3 FFFB FFFC FFFDF3 FFFE12 FFFF SP D E

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

8 1.5 LIFO (Last In First Out) order The order of PUSHs and POPs must be opposite of each other in order to retrieve information back into its original location. PUSH B PUSH D... POP D POP B 8

9 9 End of lecture 13 Part 1


Download ppt "Computer Architecture Lecture 13 – part 1 by Engineer A. Lecturer Aymen Hasan AlAwady 31/3/2014 University of Kufa - Information Technology Research and."

Similar presentations


Ads by Google