Chapter 10 And, Finally... The Stack

Slides:



Advertisements
Similar presentations
Chapter 10 And, Finally... The Stack. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Stack: An Abstract.
Advertisements

Chapter 10 And, Finally.... Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display A Final Collection of ISA-related.
Interrupts Chapter 8 – pp Chapter 10 – pp Appendix A – pp 537 &
A look at interrupts What are interrupts and why are they needed.
Chapter 6 Limited Direct Execution
A look at interrupts What are interrupts and why are they needed in an embedded system? Equally as important – how are these ideas handled on the Blackfin.
CSS 372 Lecture 1 Course Overview: CSS 372 Web page Syllabus Lab Ettiquette Lab Report Format Review of CSS 371: Simple Computer Architecture Traps Interrupts.
S. Barua – CPSC 240 CHAPTER 10 THE STACK Stack - A LIFO (last-in first-out) storage structure. The.
Chapter 7 Interupts DMA Channels Context Switching.
RapUp Dynamic Allocation of Memory in C Last HW Exercise Review for Final Final Exam Next Thursday – Same Time / Same Place.
Computer System Organization S H Srinivasan
A look at interrupts What are interrupts and why are they needed.
Chapter 9 & 10 Subroutines and Interrupts. JSR Instruction: JSR offset (11 bit) xxxxxxxxxxx [PC ]  R7, JMP Offset Jump to Subroutine at offset.
Midterm Tuesday October 23 Covers Chapters 3 through 6 - Buses, Clocks, Timing, Edge Triggering, Level Triggering - Cache Memory Systems - Internal Memory.
Chapters 9 & 10 Midterm next Wednesday (11/19) Trap Routines & RET Subroutines (or Functions) & JSR & JSRR & RET The Stack SSP & USP Interrupts RTI.
Computer System Structures memory memory controller disk controller disk controller printer controller printer controller tape-drive controller tape-drive.
Chapter 9 Trap Routines TRAP number (go to service routine) & RET (return from service routine) Subroutines (or Functions) JSR offset or JSRR rn (go to.
Midterm Wednesday 11/19 Overview: 25% First Midterm material - Number/character representation and conversion, number arithmetic - DeMorgan’s Law, Combinational.
Chapter 10 The Stack l Stack data structure l Interrupt I/O l Arithmetic using a stack.
What are Exception and Interrupts? MIPS terminology Exception: any unexpected change in the internal control flow – Invoking an operating system service.
Embedded Systems 7763B Mt Druitt College of TAFE
Interrupts. What Are Interrupts? Interrupts alter a program’s flow of control  Behavior is similar to a procedure call »Some significant differences.
Chapter 10 And, Finally... The Stack. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Stacks A LIFO.
Chapter 10 The Stack Stack: An Abstract Data Type An important abstraction that you will encounter in many applications. We will describe two uses:
Chapter 10 And, Finally... The Stack Stack: An Abstract Data Type An important abstraction that you will encounter in many applications. We will.
The Stack This is a special data structure: –The first item to be placed into the stack will be the last item taken out. Two basic operations: –Push: Places.
Introduction to Computing Systems from bits & gates to C & beyond Chapter 10 The Stack Stack data structure Activation records and function invocation.
13-Nov-15 (1) CSC Computer Organization Lecture 7: Input/Output Organization.
Interrupt driven I/O. MIPS RISC Exception Mechanism The processor operates in The processor operates in user mode user mode kernel mode kernel mode Access.
ITCS 3181 Logic and Computer Systems 2015 B. Wilkinson Slides4-2.ppt Modification date: March 23, Procedures Essential ingredient of high level.
Interrupt driven I/O Computer Organization and Assembly Language: Module 12.
Introduction to Computing Systems from bits & gates to C & beyond Chapter 10 The Stack Stack data structure Interrupt I/O (again!) Arithmetic using a stack.
Interrupts and Exception Handling. Execution We are quite aware of the Fetch, Execute process of the control unit of the CPU –Fetch and instruction as.
The Stack An Hong 2015 Fall School of Computer Science and Technology Lecture on Introduction to Computing Systems.
Chapter 10 And, Finally... The Stack
Architectures of Digital Information Systems Part 1: Interrupts and DMA dr.ir. A.C. Verschueren Eindhoven University of Technology Section of Digital.
Interrupts and exceptions
Chapter 9 TRAP Routines and Subroutines
Lesson Objectives Aims Key Words Interrupt, Buffer, Priority, Stack
Timer and Interrupts.
The Stack.
HKN ECE 220: Fall 2017 Midterm 1 AJ Schroeder, Evan Lissoos, Utsav Kawrani 23rd September, 2017.
Computer Architecture
Day 08 Processes.
Day 09 Processes.
CS 3305 System Calls Lecture 7.
Chapter 10 The Stack.
Arithmetic using a stack
Computer System Overview
Chapter 9 TRAP Routines and Subroutines
HKN ECE 220: Spring 2018 Midterm 1
Processor Fundamentals
Chapter 9 TRAP Routines and Subroutines
BIC 10503: COMPUTER ARCHITECTURE
Chapter 10 And, Finally... The Stack
Chapter 9 TRAP Routines and Subroutines
Chapter 9 TRAP Routines and Subroutines
Interrupt handling Explain how interrupts are used to obtain processor time and how processing of interrupted jobs may later be resumed, (typical.
Computer System Overview
Chapter 8 I/O.
Chapter 1 Computer System Overview
Computer System Overview
HKN ECE 220: Fall 2018 Midterm 1 Andrew Fortunat, Jeff Chang, Srijan Chakraborty, Kanad Sarkar February 16, 2019.
CPU Structure and Function
Chapter 11 Processor Structure and function
Chapter 9 TRAP Routines and Subroutines
Chapter 9 TRAP Routines and Subroutines
Chapter 9 TRAP Routines and Subroutines
Presentation transcript:

Chapter 10 And, Finally... The Stack

Stacks: An Abstract Data Type A LIFO (last-in first-out) storage structure. The first thing you put in is the last thing you take out. The last thing you put in is the first thing you take out. This means of access is what defines a stack, not the specific implementation. Two main operations: PUSH: add an item to the stack POP: remove an item from the stack

A Physical Stack Coin rest in the arm of an automobile First quarter out is the last quarter in. 1995 1996 1998 1998 1982 1982 1995 1995 Initial State After One Push After Three More Pushes After One Pop

A Hardware Implementation Data items move between registers Empty: Yes Empty: No Empty: No Empty: No / / / / / / TOP #18 TOP #12 TOP #31 TOP / / / / / / / / / / / / #5 #18 / / / / / / / / / / / / #31 / / / / / / / / / / / / / / / / / / #18 / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / Initial State After One Push After Three More Pushes After Two Pops

A Software Implementation Data items don't move in memory, just our idea about there the TOP of the stack is. / / / / / / / / / / / / #12 TOP #12 / / / / / / / / / / / / #5 #5 / / / / / / / / / / / / #31 #31 TOP / / / / / / #18 TOP #18 #18 / / / / / / TOP / / / / / / / / / / / / / / / / / / x4000 R6 x3FFF R6 x3FFC R6 x3FFE R6 Initial State After One Push After Three More Pushes After Two Pops By convention, R6 holds the Top of Stack (TOS) pointer.

Basic Push and Pop Code For our implementation, stack grows downward (when item added, TOS moves closer to 0) Push ADD R6, R6, #-1 ; decrement stack ptr STR R0, R6, #0 ; store data (R0) Pop LDR R0, R6, #0 ; load data from TOS ADD R6, R6, #1 ; increment stack ptr

Pop with Underflow Detection If we try to pop too many items off the stack, an underflow condition occurs. Check for underflow by checking TOS before removing data. Return status code in R5 (0 for success, 1 for underflow) POP LD R1, EMPTY ; EMPTY = -x4000 ADD R2, R6, R1 ; Compare stack pointer BRz FAIL ; with xC000 (= -x4000) LDR R0, R6, #0 ADD R6, R6, #1 AND R5, R5, #0 ; SUCCESS: R5 = 0 RET FAIL AND R5, R5, #0 ; FAIL: R5 = 1 ADD R5, R5, #1 RET EMPTY .FILL xC000

Push with Overflow Detection If we try to push too many items onto the stack, an overflow condition occurs. Check for underflow by checking TOS before adding data. Return status code in R5 (0 for success, 1 for overflow) PUSH LD R1, MAX ; MAX = -x3FFB ADD R2, R6, R1 ; Compare stack pointer BRz FAIL ; with xC005 (=-x3FFB) ADD R6, R6, #-1 STR R0, R6, #0 AND R5, R5, #0 ; SUCCESS: R5 = 0 RET FAIL AND R5, R5, #0 ; FAIL: R5 = 1 ADD R5, R5, #1 RET MAX .FILL xC005

Interrupt-Driven I/O (Part 2) Interrupts were introduced in Chapter 8. External device signals need to be serviced. Processor saves state and starts service routine. When finished, processor restores state and resumes program. Chapter 8 didn’t explain how (2) and (3) occur, because it involves a stack. Now, we’re ready… Interrupt is an mysterious subroutine call, triggered by an external event.

Processor State What state is needed to completely capture the state of a running process? Memory Program Counter Pointer to next instruction to be executed. General-Purpose Registers (R0~R7) Processor Status Register Privilege [15], Priority Level [10:8], Condition Codes [2:0] P = 0: User Mode P = 1: Supervisor Mode Miscellaneous Registers: Saved.SSP, Saved.USP (will see next), etc

Where to Save Processor State? Can’t use registers. Programmer doesn’t know when interrupt might occur, so she can’t prepare by saving critical registers. When resuming, need to restore state exactly as it was. Memory allocated by service routine? Must save state before invoking routine, so we wouldn’t know where. Also, interrupts may be nested – that is, an interrupt service routine might also get interrupted! Use a stack! Location of stack “fixed”. Push state to save, pop to restore.

Supervisor Stack A special region of memory used as the stack for interrupt service routines. Initial Supervisor Stack Pointer (SSP) stored in Saved.SSP. Another register for storing User Stack Pointer (USP): Saved.USP. Want to use R6 as stack pointer. So that our PUSH/POP routines still work. When switching from User mode to Supervisor mode (as result of interrupt), save R6 to Saved.USP.

Invoking the Service Routine – The Details If Priv = 1 (user), Saved.USP = R6, then R6 = Saved.SSP. Push PSR and PC to Supervisor Stack. Set PSR[15] = 0 (supervisor mode). Set PSR[10:8] = priority of interrupt being serviced. Set PSR[2:0] = 0. Set MAR = x01vv, where vv = 8-bit interrupt vector provided by interrupting device (e.g., keyboard = x80). Load memory location (M[x01vv]) into MDR. Set PC = MDR; now first instruction of ISR will be fetched. Note: This all happens between the STORE RESULT of the last user instruction and the FETCH of the first ISR instruction (i.e., atomic)

Returning from Interrupt Special instruction – RTI – that restores state. Pop PC from supervisor stack. (PC = M[R6]; R6 = R6 + 1) Pop PSR from supervisor stack. (PSR = M[R6]; R6 = R6 + 1) If PSR[15] = 1, R6 = Saved.USP. (If going back to user mode, need to restore User Stack Pointer.) RTI is a privileged instruction. Can only be executed in Supervisor Mode. If executed in User Mode, causes an exception. (More about that later.)

Example (1) S-SSP ???? S-SSP / / / / / / / / / / / / ADD / / / / / / Saved.SSP: S-SSP Saved.USP: ???? Program A S-SSP / / / / / / / / / / / / x3006 ADD / / / / / / / / / / / / / / / / / / PC x3006 Executing ADD at location x3006 when Device B interrupts.

Example (2) S-SSP R6-Saved / / / / / / / / / / / / ADD R6 x3007 RTI Saved.SSP: S-SSP Saved.USP: R6-Saved Program A ISR for Device B x6200 / / / / / / / / / / / / x3006 ADD R6 x3007 PSR for A x6210 RTI / / / / / / PC x6200 Saved.USP = R6. R6 = Saved.SSP. Push PSR and PC onto stack, then transfer to Device B service routine (at x6200).

Example (3) S-SSP R6-Saved / / / / / / AND / / / / / / ADD R6 x3007 Saved.SSP: S-SSP Saved.USP: R6-Saved Program A ISR for Device B x6200 / / / / / / x6202 AND / / / / / / x3006 ADD R6 x3007 PSR for A x6210 RTI / / / / / / PC x6203 Executing AND at x6202 when Device C interrupts.

Example (4) S-SSP R6-Saved R6 x6203 AND ADD x3007 RTI / / / / / / PC Saved.SSP: S-SSP Saved.USP: R6-Saved Program A ISR for Device B x6200 R6 x6203 x6202 AND PSR for B x3006 ADD ISR for Device C x3007 PSR for A x6210 RTI x6300 / / / / / / PC x6300 x6315 RTI Push PSR and PC onto stack, then transfer to Device C service routine (at x6300).

Example (5) S-SSP R6-Saved x6203 AND ADD R6 x3007 RTI / / / / / / PC Saved.SSP: S-SSP Saved.USP: R6-Saved Program A ISR for Device B x6200 x6203 x6202 AND PSR for B x3006 ADD ISR for Device C R6 x3007 PSR for A x6210 RTI x6300 / / / / / / PC x6203 x6315 RTI Execute RTI at x6315; pop PC and PSR from stack.

Example (6) S-SSP R6-Saved S-SSP x6203 AND ADD x3007 RTI / / / / / / Saved.SSP: S-SSP Saved.USP: R6-Saved Program A ISR for Device B S-SSP x6200 x6203 x6202 AND PSR for B x3006 ADD ISR for Device C x3007 PSR for A x6210 RTI x6300 / / / / / / PC x3007 x6315 RTI Execute RTI at x6210; pop PSR and PC from stack. Restore R6. Continue Program A as if nothing happened.

Exception: Internal Interrupt When something unexpected happens inside the processor, it may cause an exception. Examples: Executing an illegal opcode Divide by zero Accessing an illegal address Executing RTI in the User mode Handled just like an interrupt Vector is determined internally by type of exception Priority is the same as running program

꼭 기억해야 할 것 Stack: An Abstract Data Type Interrupt Service Routine Push Pop IsEmpty Interrupt Service Routine Invoked in response to an interrupt States of the program being interrupted are saved to / restored from the Supervisor Mode Stack We will see the use of the User Mode Stack soon