143A: Principles of Operating Systems. Lecture 5: Calling conventions. Anton Burtsev January, 2017

Similar documents
143A: Principles of Operating Systems. Lecture 4: Calling conventions. Anton Burtsev October, 2017

238P: Operating Systems. Lecture 3: Calling conventions. Anton Burtsev October, 2018

Stack -- Memory which holds register contents. Will keep the EIP of the next address after the call

Lecture 4 CIS 341: COMPILERS

An Introduction to x86 ASM

CSC 8400: Computer Systems. Using the Stack for Function Calls

Machine Program: Procedure. Zhaoguo Wang

CSC 2400: Computer Systems. Using the Stack for Function Calls

Systems I. Machine-Level Programming V: Procedures

Subprograms: Local Variables

Assembly Language: Function Calls

ICS143A: Principles of Operating Systems. Midterm recap, sample questions. Anton Burtsev February, 2017

Assembly Language: Function Calls

Princeton University Computer Science 217: Introduction to Programming Systems. Assembly Language: Function Calls

Computer Systems C S Cynthia Lee

Assembly Language: Function Calls" Goals of this Lecture"

Assembly Language: Function Calls" Goals of this Lecture"

Assembly Language: Function Calls. Goals of this Lecture. Function Call Problems

CSC 2400: Computing Systems. X86 Assembly: Function Calls"

How Software Executes

EECE.3170: Microprocessor Systems Design I Summer 2017 Homework 4 Solution

CSC 2400: Computing Systems. X86 Assembly: Function Calls

CMSC 313 Lecture 12. Project 3 Questions. How C functions pass parameters. UMBC, CMSC313, Richard Chang

Procedure-Calling Conventions October 30

Function Call Convention

Machine Programming 3: Procedures

CSC 2400: Computer Systems. Using the Stack for Function Calls

Functions and Procedures

Practical Malware Analysis

Function Calls COS 217. Reading: Chapter 4 of Programming From the Ground Up (available online from the course Web site)

CS 480 Fall Runtime Environments. Mike Lam, Professor. (a.k.a. procedure calls and heap management)

x86 assembly CS449 Fall 2017

See P&H 2.8 and 2.12, and A.5-6. Prof. Hakim Weatherspoon CS 3410, Spring 2015 Computer Science Cornell University

CS 31: Intro to Systems Functions and the Stack. Martin Gagne Swarthmore College February 23, 2016

CS356: Discussion #6 Assembly Procedures and Arrays. Marco Paolieri

CSE351 Spring 2018, Midterm Exam April 27, 2018

Procedure Calls. Young W. Lim Sat. Young W. Lim Procedure Calls Sat 1 / 27

System Software Assignment 1 Runtime Support for Procedures

Program Exploitation Intro

Procedure Calls. Young W. Lim Mon. Young W. Lim Procedure Calls Mon 1 / 29

Registers. Ray Seyfarth. September 8, Bit Intel Assembly Language c 2011 Ray Seyfarth

Where We Are. Optimizations. Assembly code. generation. Lexical, Syntax, and Semantic Analysis IR Generation. Low-level IR code.

Machine-level Programs Procedure

Computer Systems Lecture 9

CS429: Computer Organization and Architecture

%r8 %r8d. %r9 %r9d. %r10 %r10d. %r11 %r11d. %r12 %r12d. %r13 %r13d. %r14 %r14d %rbp. %r15 %r15d. Sean Barker

W4118: PC Hardware and x86. Junfeng Yang

Buffer Overflow Attack (AskCypert CLaaS)

AS08-C++ and Assembly Calling and Returning. CS220 Logic Design AS08-C++ and Assembly. AS08-C++ and Assembly Calling Conventions

Assembly Language Programming: Procedures. EECE416 uc. Charles Kim Howard University. Fall

Bryant and O Hallaron, Computer Systems: A Programmer s Perspective, Third Edition. Carnegie Mellon

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

Anne Bracy CS 3410 Computer Science Cornell University

Winter Compiler Construction T11 Activation records + Introduction to x86 assembly. Today. Tips for PA4. Today:

Sungkyunkwan University

Functions. Ray Seyfarth. August 4, Bit Intel Assembly Language c 2011 Ray Seyfarth

Anne Bracy CS 3410 Computer Science Cornell University

Subprograms: Arguments

X86 Stack Calling Function POV

Machine-Level Programming III: Procedures

Run-time Environment

CS24: INTRODUCTION TO COMPUTING SYSTEMS. Spring 2018 Lecture 4

CSE 351: Week 4. Tom Bergan, TA

Anne Bracy CS 3410 Computer Science Cornell University

Millions of instructions per second [MIPS] executed by a single chip microprocessor

CIT Week13 Lecture

Implementing Threads. Operating Systems In Depth II 1 Copyright 2018 Thomas W. Doeppner. All rights reserved.

THEORY OF COMPILATION

Machine-level Programming (3)

Mechanisms in Procedures. CS429: Computer Organization and Architecture. x86-64 Stack. x86-64 Stack Pushing

16.317: Microprocessor Systems Design I Fall 2014

Machine- Level Programming III: Switch Statements and IA32 Procedures

The IA-32 Stack and Function Calls. CS4379/5375 Software Reverse Engineering Dr. Jaime C. Acosta

18-600: Recitation #4 Exploits

CMSC 313 Lecture 12 [draft] How C functions pass parameters

ASSEMBLY III: PROCEDURES. Jo, Heeseung

CMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING

Assembly III: Procedures. Jo, Heeseung

Procedures and the Call Stack

CNIT 127: Exploit Development. Ch 1: Before you begin. Updated

administrivia today start assembly probably won t finish all these slides Assignment 4 due tomorrow any questions?

ANITA S SUPER AWESOME RECITATION SLIDES

How Software Executes

Subroutines. int main() { int i, j; i = 5; j = celtokel(i); i = j; return 0;}

Memory Usage 0x7fffffff. stack. dynamic data. static data 0x Code Reserved 0x x A software convention

CS213. Machine-Level Programming III: Procedures

Assembly III: Procedures. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

Assembly III: Procedures. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

The Activation Record (AR)

Question 4.2 2: (Solution, p 5) Suppose that the HYMN CPU begins with the following in memory. addr data (translation) LOAD 11110

University of Washington

Instruction Set Architectures

Winter Compiler Construction T10 IR part 3 + Activation records. Today. LIR language

Functions in C. Memory Allocation in C. C to LC3 Code generation. Next.. Complete and submit C to LC3 code generation. How to handle function calls?

Part 7. Stacks. Stack. Stack. Examples of Stacks. Stack Operation: Push. Piles of Data. The Stack

What the CPU Sees Basic Flow Control Conditional Flow Control Structured Flow Control Functions and Scope. C Flow Control.

Basics. Crash Dump Analysis 2015/2016. CHARLES UNIVERSITY IN PRAGUE faculty of mathematics and physics.

CS24: INTRODUCTION TO COMPUTING SYSTEMS. Spring 2017 Lecture 7

Machine-Level Programming (2)

Processor state. Information about currently executing program. %rax, %rdi, ... %r14 %r15. %rsp. %rip CF ZF SF OF. Temporary data

Transcription:

143A: Principles of Operating Systems Lecture 5: Calling conventions Anton Burtsev January, 2017

Stack and procedure calls

Stack Main purpose: Store the return address for the current procedure Caller pushes return address on the stack Callee pops it and jumps Other uses: Local data storage Parameter passing Evaluation stack Register spill

Manipulating stack ESP register Contains the memory address of the topmost element in the stack PUSH/POP instructions Insert/remove data on the stack Subtract/add 4 to ESP

Example: PUSH

Example: POP

Call/return CALL instruction Makes an unconditional jump to a subprogram and pushes the address of the next instruction on the stack push eip + 2 ; save return address jmp _my_function RET instruction Pops off an address and jumps to that address

Calling conventions Goal: reentrant programs How to pass arguments On the stack? In registers? How to return values On the stack? In registers? Conventions differ from compiler, optimizations, etc.

Stack consists of frames Each function has a new frame Use dedicated register EBP (frame pointer) Points to the base of the frame

Prologue/epilogue Each function maintains the frame Uses prologue (blue), and epilogue (yellow) my_function: push ebp mov ebp, esp. pop ebp ret ; save original EBP value on stack ; new EBP = ESP ; function body ; restore original EBP value

How to allocate local variables void my_function() { int a, b, c; }

Allocating local variables On the stack! Each function has a private instance Can call recursively foo(int x) { int a, b, c; a = x + 1; if ( a < 100 ) foo(a); return; }

Allocating local variables Stored right after the saved EBP value in the stack Allocated by subtracting the number of bytes required from ESP _my_function: push ebp ; save original EBP value on stack mov ebp, esp ; new EBP = ESP sub esp, LOCAL_BYTES ; = # bytes needed by locals ; function body mov esp, ebp ; deallocate locals pop ebp ; restore original EBP value ret

Example void my_function() { int a, b, c; _my_function: push ebp ; save the value of ebp mov ebp, esp ; set ebp to be top of the stack (esp) sub esp, 12 ; move esp down to allocate space for the ; local variables on the stack With frames local variables can be accessed by dereferencing EBP mov [ebp - 4], 10 ; location of variable a mov [ebp - 8], 5 ; location of b mov [ebp - 12], 2 ; location of c

How to pass arguments? Options Registers On the stack

How to pass arguments? x86 32 bit Pass arguments on the stack Return value is in EAX and EDX x86 64 bit more registers! Pass first 6 arguments in registers RDI, RSI, RDX, RCX, R8, and R9 The rest on the stack Return value is in RAX and RDX

x86_32: passing arguments on the stack Example function void my_function(int x, int y, int z) { } Example invocation my_function(2, 5, 10); Generated code push 10 push 5 push 2 call _my_function

Example stack : : 10 [ebp + 16] (3rd function argument) 5 [ebp + 12] (2nd argument) 2 [ebp + 8] (1st argument) RA [ebp + 4] (return address) FP [ebp] (old ebp value) [ebp - 4] (1st local variable) : : : : [ebp - X] (esp - the current stack pointer)

Example: calle side code _my_function: push ebp mov ebp, esp void my_function(int x, int y, int z) { int a, b, c; return; } sub esp, 12 ; allocate local varaibles ; sizeof(a) + sizeof(b) + sizeof(c) ; x = [ebp + 8], y = [ebp + 12], z = [ebp + 16] ; a=[ebp-4]=[esp+8], ; b=[ebp-8]=[esp+4], c=[ebp-12] = [esp] mov esp, ebp ; deallocate local variables pop ebp ret

Example: caller side code int callee(int, int, int); int caller(void) { int ret; } ret = callee(1, 2, 3); ret += 5; return ret; caller: ; make new call frame push ebp mov ebp, esp ; push call arguments push 3 push 2 push 1 ; call subroutine 'callee' call callee ; remove arguments from frame add esp, 12 ; use subroutine result add eax, 5 ; restore old call frame pop ebp ; return ret

Back to stack frames, so why do we need them? They are not strictly required GCC compiler option -fomit-frame-pointer can disable them Don't keep the frame pointer in a register for functions that don't need one. This avoids the instructions to save, set up and restore frame pointers; it also makes an extra register available in many functions. It also makes debugging impossible on some machines.

Stack frames Initially parameter is [ESP + 4] Later as the function pushes things on the stack it changes, e.g. [ESP + 8]

Debugging becomes hard As ESP changes one has to manually keep track where local variables are relative to ESP (ESP + 4 or +8) Compiler can do this! But it's hard for a human It's hard to unwind the stack in case of a crash To print out a backtrace

And you only save... A couple instructions required to maintain the stack frame And 1 register (EBP) x32 has 8 registers (and one is ESP) So taking another one is 12.5% of register space Sometimes its worse it! x64 has 16 registers, so it doesn't really matter That said GCC sets -fomit-frame-pointer to on At -O, -O1, -O2 Don't get surprised

Saving register state across invocations Processor doesn't save registers General purpose, segment, flags Again, a calling convention is needed Agreement on what gets saved by a callee and caller

Saving register state across invocations Registers EAX, ECX, and EDX are caller-saved The function is free to use them... the rest are callee-saved If the function uses them it has to restore them to the original values

In general there multiple calling conventions We described cdecl Make sure you know what you're doing https://en.wikipedia.org/wiki/x86_calling_convention s#list_of_x86_calling_conventions It's easy as long as you know how to read the table

Questions?

References https://en.wikibooks.org/wiki/x86_disassembly/ Functions_and_Stack_Frames https://en.wikipedia.org/wiki/calling_convention https://en.wikipedia.org/wiki/x86_calling_conve ntions http://stackoverflow.com/questions/14666665/tr ying-to-understand-gcc-option-fomit-framepointer