Procedures Procedures are very important for writing reusable and maintainable code in assembly and high-level languages. How are they implemented? Application.

Slides:



Advertisements
Similar presentations
The University of Adelaide, School of Computer Science
Advertisements

MIPS ISA-II: Procedure Calls & Program Assembly. (2) Module Outline Review ISA and understand instruction encodings Arithmetic and Logical Instructions.
Slides revised 3/25/2014 by Patrick Kelley. 2 Procedures Unlike other branching structures (loops, etc.) a Procedure has to return to where it was called.
Procedures Procedures are very important for writing reusable and maintainable code in assembly and high-level languages. How are they implemented? Application.
UEE072HM Linking HLL and ALP An example on ARM. Embedded and Real-Time Systems We will mainly look at embedded systems –Systems which have the computer.
MIPS ISA-II: Procedure Calls & Program Assembly. (2) Module Outline Review ISA and understand instruction encodings Arithmetic and Logical Instructions.
1 Lecture 4: Procedure Calls Today’s topics:  Procedure calls  Large constants  The compilation process Reminder: Assignment 1 is due on Thursday.
Procedure Calls Prof. Sirer CS 316 Cornell University.
MIPS Calling Convention Chapter 2.7 Appendix A.6.
Computer Architecture CSCE 350
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /17/2013 Lecture 12: Procedures Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE CENTRAL.
CS1104 – Computer Organization PART 2: Computer Architecture Lecture 4 Assembly Language Programming 2.
The University of Adelaide, School of Computer Science
1 Storage Registers vs. memory Access to registers is much faster than access to memory Goal: store as much data as possible in registers Limitations/considerations:
Procedures in more detail. CMPE12cCyrus Bazeghi 2 Procedures Why use procedures? Reuse of code More readable Less code Microprocessors (and assembly languages)
CS 536 Spring Code generation I Lecture 20.
Run time vs. Compile time
28/06/2015CMPUT Functions (2)  Function calling convention  Various conventions available  One is specified by CMPUT229  Recursive functions.
Chapter 10 Implementing Subprograms. Copyright © 2007 Addison-Wesley. All rights reserved. 1–2 Semantics of Call and Return The subprogram call and return.
Chapter 8 :: Subroutines and Control Abstraction
13/02/2009CA&O Lecture 04 by Engr. Umbreen Sabir Computer Architecture & Organization Instructions: Language of Computer Engr. Umbreen Sabir Computer Engineering.
Compiler Construction
CSc 453 Runtime Environments Saumya Debray The University of Arizona Tucson.
Computer Architecture Instruction Set Architecture Lynn Choi Korea University.
Topic 9: Procedures CSE 30: Computer Organization and Systems Programming Winter 2011 Prof. Ryan Kastner Dept. of Computer Science and Engineering University.
LECTURE 19 Subroutines and Parameter Passing. ABSTRACTION Recall: Abstraction is the process by which we can hide larger or more complex code fragments.
Code Generation Instruction Selection Higher level instruction -> Low level instruction Register Allocation Which register to assign to hold which items?
Implementing Subprograms
Lecture 3 Translation.
Section 5: Procedures & Stacks
Chapter 14 Functions.
Lecture 7 Macro Review Stack Frames
Writing Functions in Assembly
Chapter 10 : Implementing Subprograms
Implementing Subprograms
Computer Science 210 Computer Organization
Computer structure: Procedure Calls
Implementing Subprograms
Computer Architecture Instruction Set Architecture
Computer Architecture Instruction Set Architecture
Procedures 101: There and Back Again
COMPILERS Activation Records
Implementing Subprograms
Introduction to Compilers Tim Teitelbaum
Procedures (Functions)
Procedures (Functions)
Writing Functions in Assembly
Functions and Procedures
The HP OpenVMS Itanium® Calling Standard
Chapter 10: Implementing Subprograms Sangho Ha
Chapter 9 :: Subroutines and Control Abstraction
Machine-Level Programming III: Procedures /18-213/14-513/15-513: Introduction to Computer Systems 7th Lecture, September 18, 2018.
Implementing Subprograms
ARM Assembly Programming
Application Binary Interface (ABI)
Chap. 8 :: Subroutines and Control Abstraction
Stack Frame Linkage.
MIPS Instructions.
The University of Adelaide, School of Computer Science
Procedures and Calling Conventions
Computer Architecture
10/6: Lecture Topics C Brainteaser More on Procedure Call
Where is all the knowledge we lost with information? T. S. Eliot
Program and memory layout
Lecture 4: Instruction Set Design/Pipelining
Procedure Support From previous study of high-level languages, we know the basic issues: - declaration: header, body, local variables - call and return.
Implementing Subprograms
Topic 2b ISA Support for High-Level Languages
Runtime Stack Activation record for hanoi;
Presentation transcript:

Procedures Procedures are very important for writing reusable and maintainable code in assembly and high-level languages. How are they implemented? Application Binary Interfaces Calling Conventions Recursive Calls Examples Reference: PowerPC Embedded ABI

General Concepts Caller: The calling procedure Callee: The procedure called by the caller … int mult(x, y) prod = mult (a, b) … … return (x * y) Caller and callee must agree on: How to pass parameters How to return the return value(s), if any How to maintain relevant information across calls PowerPC architecture does not define “agreement”. Instead, common policies are defined by convention.

PowerPC Features The PowerPC ISA provides the following features to support procedure/function calls: link register (p. 2-11) bl: branch and link (p. 4-41) blr: branch to link register (Table F-4)

A Very Simple Calling Convention Passing arguments Use GPRs r3 to r10 in order Use stack in main memory if more than 8 arguments Passing return value Leave result in r3

Example int func(int a, int b) { return (a + b); } main … func(5,6);

Another Example int func2(int a, int b) { return func(a , b); } main …

The Stack Information for each function invocation (e.g. link register) is saved on the call stack or simply stack. Each function invocation has its own stack frame (a.k.a. activation record ). high address stack frame func2 func stack frame stack pointer low address

Using the Stack Describe the stack and LR contents main … bl func2 func2 … bl func ?? func … Describe the stack and LR contents right before the first bl right after the first bl right after the second bl after each procedure returns

What Goes into Stack Frame? link register passing parameters (optional) return value (optional) what else? stack pointer

Application Binary Interface (ABI) Application Binary Interface (ABI): Defines everything needed for a binary object file to run on a system (CPU and operating system), so that it can call system library routines call (and be called by) code generated by other people and other compilers The ABI specifies: file format rules for linker operation procedure calling conventions register usage conventions PowerPC has different but very similar ABIs for MacOS, AIX, embedded systems (EABI), Unix, Windows.

PowerPC Conventions Stack pointer is r1 Stack pointer is double-word aligned (8 bytes) Stack “grows” down, toward address 0 r1 points to lowest stack address (bottom of current stack frame) First item in stack frame (offset 0 from r1) is address of previous stack frame (a.k.a. frame pointer ) Second item (offset 4) is saved link register Minimum stack frame is 8 bytes Stack frame optional for leaf functions Always use update addressing mode to allocate stack frame automatically

Register Usage Convention Rules about who gets to use/save which registers Caller-save: r0, r3-r12, LR, CTR, CR0, CR1, CR5-7 Callee-save: r14-r31, CR2-4 (non-volatile registers whose values must be preserved across calls and must thus be restored by callee before returning to caller) Dedicated: r1, r2, r13

EABI Stack Frame highest address FPRs (optional, var size) GPRs (optional, var size) CR (optional, 1 word) local variables (optional, var size) function param’s (optional, var size) Padding (make size mult of 8 bytes) frame header Link Register lowest address Back Chain