Calling Conventions Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University See P&H 2.8 and 2.12.

Slides:



Advertisements
Similar presentations
1 Lecture 3: MIPS Instruction Set Today’s topic:  More MIPS instructions  Procedure call/return Reminder: Assignment 1 is on the class web-page (due.
Advertisements

The University of Adelaide, School of Computer Science
10/6: Lecture Topics Procedure call Calling conventions The stack
Procedures in more detail. CMPE12cGabriel Hugh Elkaim 2 Why use procedures? –Code reuse –More readable code –Less code Microprocessors (and assembly languages)
Procedure Calls Prof. Sirer CS 316 Cornell University.
MIPS Calling Convention Chapter 2.7 Appendix A.6.
Lecture 6: MIPS Instruction Set Today’s topic –Control instructions –Procedure call/return 1.
Computer Architecture CSCE 350
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /17/2013 Lecture 12: Procedures Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE CENTRAL.
Procedures II (1) Fall 2005 Lecture 07: Procedure Calls (Part 2)
The University of Adelaide, School of Computer Science
Procedure call frame: Hold values passed to a procedure as arguments
 Procedures (subroutines) allow the programmer to structure programs making them : › easier to understand and debug and › allowing code to be reused.
Prof. Hakim Weatherspoon CS 3410, Spring 2015 Computer Science Cornell University See P&H 2.8 and 2.12.
Kevin Walsh CS 3410, Spring 2010 Computer Science Cornell University Calling Conventions See: P&H 2.8, 2.12.
Calling Conventions Hakim Weatherspoon CS 3410, Spring 2011 Computer Science Cornell University See P&H 2.8 and 2.12.
Kevin Walsh CS 3410, Spring 2010 Computer Science Cornell University Prelim Review.
Calling Conventions Hakim Weatherspoon CS 3410, Spring 2011 Computer Science Cornell University See P&H 2.8 and 2.12.
Procedures in more detail. CMPE12cCyrus Bazeghi 2 Procedures Why use procedures? Reuse of code More readable Less code Microprocessors (and assembly languages)
1 Function Calls Professor Jennifer Rexford COS 217 Reading: Chapter 4 of “Programming From the Ground Up” (available online from the course Web site)
Intro to Computer Architecture
Calling Conventions Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University See P&H 2.8 and 2.12.
Chapter 8 :: Subroutines and Control Abstraction
Memory/Storage Architecture Lab Computer Architecture MIPS Instruction Set Architecture ( Supporting Procedures )
The Stack Pointer and the Frame Pointer (Lecture #19) ECE 445 – Computer Organization The slides included herein were taken from the materials accompanying.
CSc 453 Runtime Environments Saumya Debray The University of Arizona Tucson.
Functions and Procedures. Function or Procedure u A separate piece of code u Possibly separately compiled u Located at some address in the memory used.
Copyright © 2005 Elsevier Chapter 8 :: Subroutines and Control Abstraction Programming Language Pragmatics Michael L. Scott.
Lecture 18: 11/5/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Procedures. Why use procedures? ? Microprocessors (and assembly languages) provide only minimal support for procedures Must build a standard form for.
Adapted from Computer Organization and Design, Patterson & Hennessy, UCB ECE232: Hardware Organization and Design Part 7: MIPS Instructions III
Activation Records (in Tiger) CS 471 October 24, 2007.
Lecture 19: 11/7/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Calling Conventions Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University See P&H 2.8 and 2.12.
Calling Conventions Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University See P&H 2.8 and 2.12.
Lecture 4: MIPS Instruction Set
Calling Conventions Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University See P&H 2.8 and 2.12.
Compiler Construction Code Generation Activation Records
© G. Drew Kessler and William M. Pottenger1 Subroutines, Part 2 CSE 262, Spring 2003.
1 Assembly Language: Function Calls Jennifer Rexford.
Assemblers, Linkers, and Loaders Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University See: P&H Appendix B.3-4 and 2.12.
DR. SIMING LIU SPRING 2016 COMPUTER SCIENCE AND ENGINEERING UNIVERSITY OF NEVADA, RENO Session 12 Procedure Calling.
Computer Architecture & Operations I
Storage Classes There are three places in memory where data may be placed: In Data section declared with .data in assembly language in C - Static) On the.
Computer Science 210 Computer Organization
Computer structure: Procedure Calls
MIPS Assembly Language Programming
C function call conventions and the stack
© Craig Zilles (adapted from slides by Howard Huang)
Introduction to Compilers Tim Teitelbaum
Procedures (Functions)
Calling Conventions Hakim Weatherspoon CS 3410, Spring 2013
Functions and Procedures
Prof. Kavita Bala and Prof. Hakim Weatherspoon
Prof. Hakim Weatherspoon
Prof. Kavita Bala and Prof. Hakim Weatherspoon
Calling Conventions Hakim Weatherspoon CS 3410, Spring 2012
Prof. Hakim Weatherspoon
Stack Frame Linkage.
Hakim Weatherspoon CS 3410 Computer Science Cornell University
The University of Adelaide, School of Computer Science
Calling Conventions Hakim Weatherspoon CS 3410, Spring 2013
Lecture 5: Procedure Calls
Procedures and Calling Conventions
Hakim Weatherspoon CS 3410 Computer Science Cornell University
Computer Architecture
© Craig Zilles (adapted from slides by Howard Huang)
Calling Conventions Hakim Weatherspoon CS 3410 Computer Science
Topic 2b ISA Support for High-Level Languages
Runtime Stack Activation record for hanoi;
Presentation transcript:

Calling Conventions Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University See P&H 2.8 and 2.12

Goals for Today Review: Calling Conventions call a routine (i.e. transfer control to procedure) pass arguments fixed length, variable length, recursively return to the caller Putting results in a place where caller can find them Manage register Today More on Calling Conventions globals vs local accessible data callee vs caller saved registers Calling Convention examples and debugging

Goals for Today Review: Calling Conventions call a routine (i.e. transfer control to procedure) pass arguments fixed length, variable length, recursively return to the caller Putting results in a place where caller can find them Manage register Today More on Calling Conventions globals vs local accessible data callee vs caller saved registers Calling Convention examples and debugging Warning: There is no one true MIPS calling convention. lecture != book != gcc != spim != web

Recap: Conventions so far first four arg words passed in $a0, $a1, $a2, $a3 remaining arg words passed in parent’s stack frame return value (if any) in $v0, $v1 stack frame at $sp –contains $ra (clobbered on JAL to sub-functions) – contains $fp –contains local vars (possibly clobbered by sub-functions) –contains extra arguments to sub-functions (i.e. argument “spilling) –contains space for first 4 arguments to sub-functions callee save regs are preserved caller save regs are not Global data accessed via $gp saved ra saved fp saved regs ($s0... $s7) locals outgoing args $fp  $sp  Bottom of current stack frame Top of the stack

MIPS Register Conventions r0$zerozero r1$atassembler temp r2$v0 function return values r3$v1 r4$a0 function arguments r5$a1 r6$a2 r7$a3 r8$t0 temps (caller save) r9$t1 r10$t2 r11$t3 r12$t4 r13$t5 r14$t6 r15$t7 r16$s0 saved (callee save) r17$s1 r18$s2 r19$s3 r20$s4 r21$s5 r22$s6 r23$s7 r24$t8more temps (caller save) r25$t9 r26$k0reserved for kernel r27$k1 r28$gpglobal data pointer r29$spstack pointer r30$fpframe pointer r31$rareturn address

Globals and Locals Global variables in data segment Exist for all time, accessible to all routines Dynamic variables in heap segment Exist between malloc() and free() Local variables in stack frame Exist solely for the duration of the stack frame Dangling pointers into freed heap mem are bad Dangling pointers into old stack frames are bad C lets you create these, Java does not int *foo() { int a; return &a; }

Caller-saved vs. Callee-saved Caller-save: If necessary… ($t0.. $t9) save before calling anything; restore after it returns Callee-save: Always… ($s0.. $s7) save before modifying; restore before returning Caller-save registers are responsibility of the caller Caller-save register values saved only if used after call/return The callee function can use caller-saved registers Callee-save register are the responsibility of the callee Values must be saved by callee before they can be used Caller can assume that these registers will be restored Save if want to use after a call Save before use

Caller-saved vs. Callee-saved Caller-save: If necessary… ($t0.. $t9) save before calling anything; restore after it returns Callee-save: Always… ($s0.. $s7) save before modifying; restore before returning MIPS ($t0-$t9), x86 (eax, ecx, and edx) are caller-save… … a function can freely modify these registers … but must assume that their contents have been destroyed if it in turns calls a function. MIPS ($s0 - $s7), x86 (ebx, esi, edi, ebp, esp) are callee-save A function may call another function and know that the callee-save registers have not been modified However, if it modifies these registers itself, it must restore them to their original values before returning.

Caller-saved vs. Callee-saved Caller-save: If necessary… ($t0.. $t9) save before calling anything; restore after it returns Callee-save: Always… ($s0.. $s7) save before modifying; restore before returning A caller-save register must be saved and restored around any call to a subroutine. In contrast, for a callee-save register, a caller need do no extra work at a call site (the callee saves and restores the register if it is used).

Caller-saved vs. Callee-saved Caller-save: If necessary… ($t0.. $t9) save before calling anything; restore after it returns Callee-save: Always… ($s0.. $s7) save before modifying; restore before returning CALLER SAVED: MIPS calls these temporary registers, $t0-t9 the calling routine saves the registers that it does not want a called procedure to overwrite register values are NOT preserved across procedure calls CALLEE SAVED: MIPS calls these saved registers, $s0-s8 register values are preserved across procedure calls the called procedure saves register values in its Activation Record (AR), uses the registers for local variables, restores register values before it returns.

Caller-saved vs. Callee-saved Caller-save: If necessary… ($t0.. $t9) save before calling anything; restore after it returns Callee-save: Always… ($s0.. $s7) save before modifying; restore before returning Registers $t0-$t9 are caller-saved registers … that are used to hold temporary quantities … that need not be preserved across calls Registers $s0-s8 are callee-saved registers … that hold long-lived values … that should be preserved across calls

Activity #1: Calling Convention Example int test(int a, int b) { int tmp = (a&b)+(a|b); int s = sum(tmp,1,2,3,4,5); int u = sum(s,tmp,b,a,b,a); return u + a + b; }

Activity #2: Calling Convention Example: Prolog, Epilog # allocate frame # save $ra # save old $fp # callee save... # set new frame pointer... # restore … # restore old $fp # restore $ra # dealloc frame test:

Activity #3: Calling Convention Example int test(int a, int b) { int tmp = (a&b)+(a|b); int s = sum(tmp,1,2,3,4,5); int u = sum(s,tmp,b,a,b,a); return u + a + b; } How can we optimize the assembly code?

# allocate frame # save $ra # save old $fp # callee save... # set new frame pointer... # restore … # restore old $fp # restore $ra # dealloc frame test: Activity #3: Calling Convention Example: Prolog, Epilog

Minimum stack size for a standard function? saved ra saved fp saved regs ($s0... $s7) locals outgoing args $fp  $sp 

Leaf Functions Leaf function does not invoke any other functions int f(int x, int y) { return (x+y); } Optimizations? saved ra saved fp saved regs ($s0... $s7) locals outgoing args $fp  $sp 

Anatomy of an executing program 0xfffffffc 0x top bottom 0x7ffffffc 0x x x system reserved stack system reserved code (text) static data dynamic data (heap).data.text PC

Activity #4: Debugging init(): 0x printf(s, …): 0x4002B4 vnorm(a,b): 0x40107C main(a,b):0x4010A0 pi:0x str1:0x x x004010c4 0x x7FFFFFF4 0x x c 0x x x x CPU: $pc=0x004003C0 $sp=0x7FFFFFAC $ra=0x x7FFFFFB0 What func is running? Who called it? Has it called anything? Will it? Args? Stack depth? Call trace? 0x7FFFFFDC

Administrivia Upcoming agenda Schedule PA2 Design Doc Mtg for next Monday, Mar 11 th HW3 due next Wednesday, March 13 th PA2 Work-in-Progress circuit due before spring break Spring break: Saturday, March 16 th to Sunday, March 24 th Prelim2 Thursday, March 28 th, right after spring break PA2 due Thursday, April 4 th

Recap How to write and Debug a MIPS program using calling convention first four arg words passed in $a0, $a1, $a2, $a3 remaining arg words passed in parent’s stack frame return value (if any) in $v0, $v1 stack frame at $sp –contains $ra (clobbered on JAL to sub-functions) – contains $fp –contains local vars (possibly clobbered by sub-functions) –contains extra arguments to sub-functions (i.e. argument “spilling) –contains space for first 4 arguments to sub-functions callee save regs are preserved caller save regs are not Global data accessed via $gp saved ra saved fp saved regs ($s0... $s7) locals outgoing args $fp  $sp 