System Calls. Chapter 9 TRAP Routines and Subroutines

Similar documents
Chapter 9 TRAP Routines and Subroutines

Chapter 9 TRAP Routines and Subroutines

TRAPs and Subroutines. University of Texas at Austin CS310H - Computer Organization Spring 2010 Don Fussell

Chapter 9 TRAP Routines and Subroutines

Subroutines & Traps. Announcements. New due date for assignment 2 5pm Wednesday, 5May

LC-3 Subroutines and Traps. (Textbook Chapter 9)"

LC-3 TRAP Routines. Textbook Chapter 9

Introduction to Computer Engineering. CS/ECE 252, Fall 2012 Prof. Guri Sohi Computer Sciences Department University of Wisconsin Madison

Introduction to Computer Engineering. CS/ECE 252, Spring 2017 Rahul Nayar Computer Sciences Department University of Wisconsin Madison

Midterm 2 Review Chapters 4-16 LC-3

Introduction to Computer Engineering. CS/ECE 252, Fall 2016 Prof. Guri Sohi Computer Sciences Department University of Wisconsin Madison

CS 2461: Computer Architecture I

Introduction to Computer Engineering. CS/ECE 252, Spring 2017 Rahul Nayar Computer Sciences Department University of Wisconsin Madison

Chapter 10 And, Finally... The Stack. ACKNOWLEDGEMENT: This lecture uses slides prepared by Gregory T. Byrd, North Carolina State University

Implementing Functions at the Machine Level

appendix a The LC-3 ISA A.1 Overview

Computing Layers. Chapter 5 The LC-3

LC-3 Instruction Set Architecture. Textbook Chapter 5

CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON

Computing Layers. Chapter 7 Assembly Language

Homework 06. Push Z Push Y Pop Y Push X Pop X Push W Push V Pop V Push U Pop U Pop W Pop Z Push T Push S

Chapter 7 Assembly Language. ACKNOWLEDGEMENT: This lecture uses slides prepared by Gregory T. Byrd, North Carolina State University

Trap Vector Table. Interrupt Vector Table. Operating System and Supervisor Stack. Available for User Programs. Device Register Addresses

Ch. 5: The LC-3. PC-Relative Addressing Mode. Data Movement Instructions. James Goodman!

20/08/14. Computer Systems 1. Instruction Processing: FETCH. Instruction Processing: DECODE

Chapter 5 The LC-3. ACKNOWLEDGEMENT: This lecture uses slides prepared by Gregory T. Byrd, North Carolina State University 5-2

Memory Usage in Programs

Instruction Set Architecture

Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Computing Layers

LC-3 Instruction Set Architecture

CS 135: Computer Architecture I

Load -- read data from memory to register. Store -- write data from register to memory. Load effective address -- compute address, save in register

Register Files. Single Bus Architecture. Register Files. Single Bus Processor. Term Project: using VHDL. Accumulator based architecture

Assembly Language. University of Texas at Austin CS310H - Computer Organization Spring 2010 Don Fussell

Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Review Topics

CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON

That is, we branch to JUMP_HERE, do whatever we need to do, and then branch to JUMP_BACK, which is where we started.

11/10/2016. Review the Problem to Be Solved. ECE 120: Introduction to Computing. What Shall We Keep in the Registers? Where Are the Pieces in Memory?

LC-2 Programmer s Reference and User Guide

Introduction to Computer Engineering. CS/ECE 252, Fall 2016 Prof. Guri Sohi Computer Sciences Department University of Wisconsin Madison

Introduction to Computer. Chapter 5 The LC-3. Instruction Set Architecture

Introduction to Computer Engineering. Chapter 5 The LC-3. Instruction Set Architecture

Input & Output. Lecture 16. James Goodman (revised by Robert Sheehan) Computer Science 210 s1c Computer Systems 1 Lecture Notes

Chapter 8 I/O. Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. But where does data in memory come from?

ECE 206, Fall 2001: Lab 3

UNIVERSITY OF WISCONSIN MADISON

Introduction to Computer Engineering. CS/ECE 252, Spring 2017 Rahul Nayar Computer Sciences Department University of Wisconsin Madison

Chapter 7 Assembly Language

Routines and Subroutines

EEL 5722C Field-Programmable Gate Array Design

Chapter 6 Programming the LC-3

The LC-3 Instruction Set Architecture. ISA Overview Operate instructions Data Movement instructions Control Instructions LC-3 data path

CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON

CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON

CS 2461: Computer Architecture I

COSC121: Computer Systems: Review

University of Illinois at Urbana-Champaign First Midterm Exam, ECE 220 Honors Section

LC-3 ISA - II. Lecture Topics. Lecture materials. Homework. Machine problem. Announcements. ECE 190 Lecture 10 February 17, 2011

10/31/2016. The LC-3 ISA Has Three Kinds of Opcodes. ECE 120: Introduction to Computing. ADD and AND Have Two Addressing Modes

CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON. Instructor: Rahul Nayar TAs: Mohit Verma, Annie Lin

11/6/2016. Let s Solve a Problem. ECE 120: Introduction to Computing. Overview of Our Task. Programs are Finite State Machines

Chapter 8 I/O. Computing Layers. I/O: Connecting to Outside World. I/O: Connecting to the Outside World

CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON

2/6/2018. Let s Act Like Compilers! ECE 220: Computer Systems & Programming. Decompose Finding Absolute Value

COSC121: Computer Systems: Review

Intro. to Computer Architecture Homework 4 CSE 240 Autumn 2005 DUE: Mon. 10 October 2005

Chapter 5 - ISA. 1.The Von Neumann Model. The Stored Program Computer. Von Neumann Model. Memory

Lec-memMapIOtrapJSR SYS_BUS

ECE/CS 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON

Problem Solving in C. Stepwise Refinement. ...but can stop refining at a higher level of abstraction. Same basic constructs. as covered in Chapter 6

Chapter 10 And, Finally... The Stack

ECE Homework 8

컴퓨터개념및실습. 기말고사 review

CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING COMPUTER SCIENCES DEPARTMENT UNIVERSITY OF WISCONSIN-MADISON

Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Computing Layers

1/30/2018. Conventions Provide Implicit Information. ECE 220: Computer Systems & Programming. Arithmetic with Trees is Unambiguous

CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING COMPUTER SCIENCES DEPARTMENT UNIVERSITY OF WISCONSIN-MADISON

Chapter 10 Memory Model for Program Execution. Problem

11/16/2016. Review Our Process for Programming. ECE 120: Introduction to Computing. A Typical Programming Process. Can a Computer Help Us Program?

Our Simulation Equivalent: -- readmemb( "os.bin" ) -- PC <== x0200

Chapter 14 Functions. Function. Example of High-Level Structure. Functions in C

LC-3. 3 bits for condition codes (more later) Fixed-length instructions, with 4-bit opcodes. IIT CS 350 S 18- Hale

Binghamton University. CS-120 Summer Stacking Up. Text: Introduction to Computer Systems : Chapter 10

CIT 593: Intro to Computer Systems Homework #4: Assembly Language Due October 18, 2012, 4:30pm. Name

1/17/2018. Task: Print a Number in Binary. ECE 220: Computer Systems & Programming. First Step: Break the Task into a Sequence of Two

Syntax of LC-3 assembly: Language elements. Instructions

CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING COMPUTER SCIENCES DEPARTMENT UNIVERSITY OF WISCONSIN-MADISON

Review Topics. Final Exam Review Slides

Scope: Global and Local. Concept of Scope of Variable

! What do we care about? n Fast program execution. n Efficient memory usage. n Avoid memory fragmentation. n Maintain data locality

ECE/CS 252 Fall 2011 Homework 7 (25 points) // Due in Lecture on Nov. 30, 2011 (Wed)

CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING COMPUTER SCIENCES DEPARTMENT UNIVERSITY OF WISCONSIN-MADISON

Review Topics. Midterm Exam Review Slides

Department of Electrical and Computer Engineering The University of Texas at Austin

What is Recursion? Chapter 17 Recursion. Executing RunningSum. High-Level Example: Binary Search

Review Topics. Midterm Exam Review Slides

Lecture 5: Procedure Calls

Lab 1. Warm-up : discovering the target machine, LC-3

Copyright The McGraw-Hill Companies, Inc. Persion required for reproduction or display. What is Recursion?

And. Fin a l l i... The Slack

Transcription:

System Calls Chapter 9 TRAP Routines and Subroutines Original slides from Gregory Byrd, North Carolina State University Modified slides by Chris Wilcox, Colorado State University Certain operations require specialized knowledge and protection: specific knowledge of I/O device registers and the sequence of operations needed to use them I/O resources shared among multiple users/programs; a mistake could affect lots of other users! Not every programmer knows (or wants to know) this level of detail Solution: provide service routines or system calls (in operating system) to safely and conveniently perform low-level, privileged operations System Call 1. User program invokes system call. 2. Operating system code performs operation. 3. Returns control to user program. In LC-3, this is done through the TRAP mechanism. LC-3 TRAP Mechanism 1. A set of service routines. part of operating system -- routines start at arbitrary addresses (convention is that system code is below x3000) up to 256 routines 2. Table of starting addresses. stored at x0000 through x00ff in memory called System Control Block in some architectures 3. TRAP instruction. used by program to transfer control to operating system 8-bit trap vector names one of the 256 service routines 4. A linkage back to the user program. want execution to resume immediately after the TRAP instruction 1

TRAP Instruction TRAP Trap vector identifies which system call to invoke 8-bit index into table of service routine addresses in LC-3, this table is stored in memory at 0x0000 0x00FF 8-bit trap vector is zero-extended into 16-bit memory address Where to go lookup starting address from table; place in PC How to get back save address of next instruction (current PC) in R7 NOTE: PC has already been incremented during instruction fetch stage. RET (JMP R7) TRAP Mechanism Operation How do we transfer control back to instruction following the TRAP? We saved old PC in R7. JMP R7 gets us back to the user program at the right spot. LC-3 assembly language lets us use RET (return) in place of JMP R7. Must make sure that service routine does not change R7, or we won t know where to return. 1. Lookup starting address. 2. Transfer to service routine. 3. Return (JMP R7). 2

Example: Using the TRAP Instruction.ORIG x3000 LD R2, TERM ; Load negative ASCII 7 LD R3, ASCII ; Load ASCII difference AGAIN TRAP x23 ; input character ADD R1, R2, R0 ; Test for terminate BRz EXIT ; Exit if done ADD R0, R0, R3 ; Change to lowercase TRAP x21 ; Output to monitor... BRnzp AGAIN ;... again and again... TERM.FILL xffc9 ; - 7 ASCII.FILL x0020 ; lowercase bit EXIT TRAP x25 ; halt.end Example: Output Service Routine.ORIG x0430 ; syscall address ST R7, SaveR7 ; save R7 & R1 ST R1, SaveR1 ; ----- Write character TryWrite LDI R1, CRTSR ; get status BRzp TryWrite ; look for bit 15 on WriteIt STI R0, CRTDR ; write char ; ----- Return from TRAP Return LD R1, SaveR1 ; restore R1 & R7 LD R7, SaveR7 RET ; back to user CRTSR.FILL xf3fc CRTDR.FILL xf3ff stored in table, location x21 SaveR1.FILL 0 SaveR7.FILL 0.END TRAP Routines and their Assembler Names vector symbol routine x20 GETC read a single character (no echo) x21 OUT output a character to the monitor x22 PUTS write a string to the console x23 IN print prompt to console, read and echo character from keyboard x25 HALT halt the program Saving and Restoring Registers Must save the value of a register if: Its value will be destroyed by service routine and We will need to use the value after that action. Who saves? caller of service routine? knows what it needs later, but may not know what gets altered by called routine called service routine? knows what it alters, but does not know what will be needed later by calling routine 3

Example LEA R3, Binary ; load pointer LD R6, ASCII; char to digit LD R7, COUNT; initialize to 10 AGAIN TRAP x23 ; get character ADD R0, R0, R6 ; convert to number STR R0, R3, #0 ; store number ADD R3, R3, #1 ; increment pointer ADD R7, R7, -1 ; decrement counter BRp AGAIN ; more? BRnzp NEXT ASCII.FILL xffd0 COUNT.FILL #10 What s wrong with this routine? What happens to R7? Binary.BLKW #10 Saving and Restoring Registers Called routine -- callee-save Before start, save any registers that will be altered (unless altered value is desired by calling program!) Before return, restore those same registers Calling routine -- caller-save Save registers destroyed by own instructions or by called routines (if known), if values needed later save R7 before TRAP save R0 before TRAP x23 (input character) Or avoid using those registers altogether Values are saved by storing them in memory. Question Can a service routine call another service routine? If so, is there anything special the calling service routine must do? What about User Code? Service routines provide three main functions: 1. Shield programmers from system-specific details. 2. Write frequently-used code just once. 3. Protect system resources from malicious/clumsy programmers. 4

Subroutines A subroutine is a program fragment that: lives in user space performs a well-defined task is invoked (called) by another user program returns control to the calling program when finished Like a service routine, but not part of the OS not concerned with protecting hardware resources no special privilege required Reasons for subroutines: reuse useful (and debugged!) code without having to keep typing it in divide task among multiple programmers use vendor-supplied library of useful routines JSR Instruction Jumps to a location (like a branch but unconditional), and saves current PC (addr of next instruction) in R7. saving the return address is called linking target address is PC-relative (PC + Sext(IR[10:0])) bit 11 specifies addressing mode if =1, PC-relative: target address = PC + Sext(IR[10:0]) if =0, register: target address = contents of register IR[8:6] JSR JSRR Instruction Just like JSR, except Register addressing mode. target address is Base Register bit 11 specifies addressing mode What important feature does JSRR provide that JSR does not? NOTE: PC has already been incremented during instruction fetch stage. 5

JSRR Returning from a Subroutine RET (JMP R7) gets us back to the calling routine. just like TRAP NOTE: PC has already been incremented during instruction fetch stage. Example: Negate the value in R0 2sComp NOT R0, R0 ; flip bits ADD R0, R0, #1 ; add one RET ; return to caller To call from a program (within 1024 instructions): ; need to compute R4 = R1 - R3 ADD R0, R3, #0 ; copy R3 to R0 JSR 2sComp ; negate ADD R4, R1, R0 ; add to R1... Note: Caller should save R0 if we ll need it later! Passing Information to/from Subroutines Arguments A value passed in to a subroutine is an argument. This is a value needed by the subroutine to do its job. Examples: In 2sComp routine, R0 is the number to be negated In OUT service routine, R0 is the character to be printed. In PUTS routine, R0 is address of string to be printed. Return Values A value passed out of a subroutine is a return value. You called the subroutine to compute this value! Examples: In 2sComp routine, negated value is returned in R0. GETC service routine returns char from the keyboard in R0. 6

Using Subroutines In order to use a subroutine, a programmer must know: its address (or at least a label that will be bound to its address) its function (what does it do?) NOTE: The programmer does not need to know how the subroutine works, but what changes are visible in the machine s state after the routine has run. its arguments (where to pass data in, if any) its return values (where to get computed data, if any) Saving and Restore Registers Since subroutines are just like service routines, we also need to save and restore registers, if needed. Generally use callee-save strategy, except for return values. Save anything that the subroutine will alter internally that shouldn t be visible when the subroutine returns. It s good practice to restore incoming arguments to their original values (unless overwritten by return value). Remember: You MUST save R7 if you call any other subroutine or service routine (TRAP). Otherwise, you won t be able to return to caller. Example (1) Write a subroutine FirstChar to: find the first occurrence of a particular character (in R0) in a string (pointed to by R1); return pointer to character or to end of string (NULL) in R2. (2) Use FirstChar to write CountChar, which: counts the number of occurrences of a particular character (in R0) in a string (pointed to by R1); return count in R2. Can write the second subroutine first, without knowing the implementation of FirstChar! CountChar Algorithm (using FirstChar) save regs call FirstChar R3 <- M(R2) R3=0 yes no R1 <- R2 + 1 save R7, since we re using JSR restore regs return 7

CountChar Implementation ; subroutine to count occurrences of a char CountChar ST R3, CCR3 ; save registers ST R4, CCR4 ST R7, CCR7 ; JSR alters R7 ST R1, CCR1 ; save original pointer AND R4, R4, #0 ; count = 0 CC1 JSR FirstChar ; find next occurrence LDR R3, R2, #0 ; null? BRz CC2 ; done if null ADD R4, R4, #1 ; increment count ADD R1, R2, #1 ; increment pointer BRnzp CC1 CC2 ADD R2, R4, #0 ; return value to R2 LD R3, CCR3 ; restore regs LD LD LD RET R4, CCR4 R1, CCR1 R7, CCR7 save regs R2 <- R1 R3 <- M(R2) R3=0 FirstChar Algorithm yes no R3=R0 no R2 <- R2 + 1 restore regs return yes FirstChar Implementation ; subroutine to find first occurrence of a char FirstChar ST R3, FCR3 ; save registers ST R4, FCR4 ; save original char NOT R4, R0 ; negate for comparisons ADD R4, R4, #1 ADD R2, R1, #0 ; initialize pointer FC1 LDR R3, R2, #0 ; read character BRz FC2 ; if null, we re done ADD R3, R3, R4 ; see if matches input BRz FC2 ; if yes, we re done ADD R2, R2, #1 ; increment pointer BRnzp FC1 FC2 LD R3, FCR3 ; restore registers LD R4, FCR4 RET Library Routines Vendor may provide object files containing useful subroutines don t want to provide source code -- intellectual property assembler/linker must support EXTERNAL symbols (or starting address of routine must be supplied to user).external SQRT... LD R2, SQAddr ; load SQRT addr JSRR R2... SQAddr.FILL SQRT Using JSRR, because we don t know whether SQRT is within 1024 CS270 instructions. - Fall Semester 2016 8