1 Homework Reading –PAL, pp 201-216, 297-312 Machine Projects –Finish mp2warmup Questions? –Start mp2 as soon as possible Labs –Continue labs with your.

Slides:



Advertisements
Similar presentations
CS 4284 Systems Capstone Godmar Back Processes and Threads.
Advertisements

University of Washington Procedures and Stacks II The Hardware/Software Interface CSE351 Winter 2013.
Copyright 2014 – Noah Mendelsohn UM Macro Assembler Functions Noah Mendelsohn Tufts University Web:
Gnu Debugger (GDB) Topics Overview Quick Reference Card Readings: Quick Reference Card February 7, 2012 CSCE 212Honors Computer Organization.
1 Homework / Exam Turn in mp2 at start of class today Reading –PAL, pp 3-6, Exam #1 next class –Open Book / Open Notes –NO calculators or other.
University of Washington Last Time For loops  for loop → while loop → do-while loop → goto version  for loop → while loop → goto “jump to middle” version.
Machine-Level Programming III: Procedures Apr. 17, 2006 Topics IA32 stack discipline Register saving conventions Creating pointers to local variables CS213.
PC hardware and x86 3/3/08 Frans Kaashoek MIT
1 Function Calls Professor Jennifer Rexford COS 217 Reading: Chapter 4 of “Programming From the Ground Up” (available online from the course Web site)
Accessing parameters from the stack and calling functions.
Practical Session 3. The Stack The stack is an area in memory that its purpose is to provide a space for temporary storage of addresses and data items.
– 1 – , F’02 ICS05 Instructor: Peter A. Dinda TA: Bin Lin Recitation 4.
Chapter 12: High-Level Language Interface. Chapter Overview Introduction Inline Assembly Code C calls assembly procedures Assembly calls C procedures.
Assembly תרגול 8 פונקציות והתקפת buffer.. Procedures (Functions) A procedure call involves passing both data and control from one part of the code to.
1 Homework Reading –Professional Assembly Language, pp –Also, study website references: “Using gas” and “gas i386 Assembly Language Guide” Machine.
September 22, 2014 Pengju (Jimmy) Jin Section E
Stack Activation Records Topics IA32 stack discipline Register saving conventions Creating pointers to local variables February 6, 2003 CSCE 212H Computer.
Stacks and Frames Demystified CSCI 3753 Operating Systems Spring 2005 Prof. Rick Han.
6.828: PC hardware and x86 Frans Kaashoek
Fall 2008CS 334: Computer SecuritySlide #1 Smashing The Stack A detailed look at buffer overflows as described in Smashing the Stack for Fun and Profit.
Carnegie Mellon Introduction to Computer Systems /18-243, spring 2009 Recitation, Jan. 14 th.
1 Carnegie Mellon Stacks : Introduction to Computer Systems Recitation 5: September 24, 2012 Joon-Sup Han Section F.
Ithaca College Machine-Level Programming IV: IA32 Procedures Comp 21000: Introduction to Computer Systems & Assembly Lang Spring 2013 * Modified slides.
University of Washington Today More on procedures, stack etc. Lab 2 due today!  We hope it was fun! What is a stack?  And how about a stack frame? 1.
Practical Session 4. Labels Definition - advanced label: (pseudo) instruction operands ; comment valid characters in labels are: letters, numbers, _,
Fabián E. Bustamante, Spring 2007 Machine-Level Programming III - Procedures Today IA32 stack discipline Register saving conventions Creating pointers.
Derived from "x86 Assembly Registers and the Stack" by Rodney BeedeRodney Beede x86 Assembly Registers and the Stack Nov 2009.
Overflows & Exploits. In the beginning 11/02/1988 Robert Morris, Jr., a graduate student in Computer Science at Cornell, wrote an experimental, self-replicating,
Low Level Programming Lecturer: Duncan Smeed The Interface Between High-Level and Low-Level Languages.
Machine-level Programming III: Procedures Topics –IA32 stack discipline –Register saving conventions –Creating pointers to local variables.
Functions/Methods in Assembly
Compiler Construction Code Generation Activation Records
University of Amsterdam Computer Systems – the instruction set architecture Arnoud Visser 1 Computer Systems The instruction set architecture.
1 Assembly Language: Function Calls Jennifer Rexford.
Calling Procedures C calling conventions. Outline Procedures Procedure call mechanism Passing parameters Local variable storage C-Style procedures Recursion.
Overview of Back-end for CComp Zhaopeng Li Software Security Lab. June 8, 2009.
7-Nov Fall 2001: copyright ©T. Pearce, D. Hutchinson, L. Marshall Oct lecture23-24-hll-interrupts 1 High Level Language vs. Assembly.
Section 5: Procedures & Stacks
Programs – Calling Conventions
CS 177 Computer Security Lecture 9
Reading Condition Codes (Cont.)
Homework / Exam Return and Review Exam #1 Reading Machine Projects
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.
Homework Reading Machine Projects Labs
C function call conventions and the stack
Computer Architecture and Assembly Language
Homework Reading Machine Projects Labs PAL, pp ,
Exploiting & Defense Day 2 Recap
Homework Reading Machine Projects Labs
Homework In-line Assembly Code Machine Language
High-Level Language Interface
Assembly Language Programming V: In-line Assembly Code
Machine-Level Programming 4 Procedures
Condition Codes Single Bit Registers
Assembly Language Programming I: Introduction
C Prog. To Object Code text text binary binary Code in files p1.c p2.c
Assembly Language Programming II: C Compiler Calling Sequences
Machine-Level Programming III: Procedures Sept 18, 2001
Discussions on HW2 Objectives
MIPS Procedure Calls CSE 378 – Section 3.
Practical Session 4.
Multi-modules programming
System Calls David Ferry CSCI 3500 – Operating Systems
Discussions on HW2 Objectives
“Way easier than when we were students”
Computer Architecture and System Programming Laboratory
Computer Architecture and System Programming Laboratory
Return-to-libc Attacks
Presentation transcript:

1 Homework Reading –PAL, pp , Machine Projects –Finish mp2warmup Questions? –Start mp2 as soon as possible Labs –Continue labs with your assigned section

2 Coding and Calling Functions An assembly language programmer handles a lot of details to coordinate the code for calling a function and the code in the function itself There are two mechanisms in the instruction set for calling and returning from functions: Linux system calls and returns int $0x80 and iret C library style function calls and returns call and ret

3 Coding and Calling Functions A really “old school” way to pass data back and forth between assembly language functions is to leave all data in “global memory” This was really very efficient back when CPU’s were not very powerful and some did not have hardware supported stack mechanisms Today we understand the software maintenance problem that this choice creates and the CPU’s are powerful enough for us to not need to do it

4 Coding and Calling Functions A somewhat “old school” way to call functions: –Load up registers with input values before call –Unload return values from registers after return (if any) This is still in use in Linux system calls, such as: # write as a Linux system call movl $4, %eax# system call value movl $1, %ebx# file descriptor movl $output, %ecx# *buffer movl $len, %edx# length int $0x80# call to system

5 Coding and Calling Functions We won’t use the Linux system call and return mechanism in this course, but: –I feel that you should be aware of it and recognize it when the textbook uses it in an example –We’ll use the iret instruction later with hardware interrupts We will use the call and ret mechanism as is typically used for C library function calls

6 Call/Return to/from our C Function # C compiler generated code for: # static int z = mycode(x, y);.text... pushl y# put arg y on stack pushl x# put arg x on stack call_mycode# call function mycode addl $8, %esp # purge args from stack movl %eax, z# save return value....data z:.long 0# location for variable z

7 C Library Coding Conventions Use same function name as used in the calling C program except add a leading underscore ‘_’ Setup C compiler stack frame (optional) Use only %eax, %ecx, and %edx to not affect registers the C compiler expects to be preserved Save/restore any other registers on stack if used Put return value in %eax Remove C compiler stack frame (optional) Return

8 C Library Coding Conventions Example of Assembly code for C function: int mycode(int x, int y) { /* automatic variables */ int i; int j;... return result; }

9 C Library Coding Conventions Start with basic calling sequence discussed earlier.text.globl _mycode _mycode: # entry point label...# code as needed movl xxx, %eax# set return value ret# return to caller.end

10 C Library Coding Conventions If function has arguments or automatic variables (that require n bytes), include this optional code Assembly language after entry point label (enter): pushl %ebp # set up stack frame movl %esp,%ebp# save %esp in %ebp subl $n,%esp# automatic variables Assembly language before ret (leave): movl %ebp, %esp # restore %esp from %ebp popl %ebp# restore %ebp

11 C Compiler Reserved Registers The C compiler assumes it can keep data in certain registers (%ebx, %ebp) when it generates code If assembly code uses compiler’s reserved registers, it must save and restore the values for the calling C code Example:...# we can’t use %ebx yet pushl%ebx# save register contents...# we can use %ebx now popl%ebx# restore %ebx...# we can’t use %ebx any more ret Matching pair

12 C Library Coding Conventions State of the stack during function execution: yx%eip%ebpij %esp Argument Variables Automatic Variables i = -4(%ebp) j = -8(%ebp) Lower level Function Calls Lower Level Function Returns x = 8(%ebp) y = 12(%ebp) Return Address Points to previous stack frame %ebx

13 Turning It Around Calling a C function from Assembly Language –Can use printf to help debug assembly code (although it’s better to use either tutor or gdb as a debugger ) –Assume C functions “clobber” the contents of the %eax, %ecx, and %edx registers –If you need to save them across a C function call: Push them on the stack before the call Pop them off the stack after the return

14 Printing From Assembler The C calling routine (helloc.c according to our convention) to get things going is: extern void hello(); int main(int argc, char ** argv) { hello(); return 0; }

15 Printing From Assembler Assembly code to print Hello:.globl _hello.text _hello: pushl $hellostr # pass string argument call _printf # print the string addl $4, %esp # restore stack ret.data hellostr:.asciz “Hello\n” # printf format string.end

16 Printing from Assembler Assembly code to use a format statement and variable:... pushl x # x is a 32-bit integer pushl $format # pointer to format call _ printf # call C printf routine addl $8, %esp # purge the arguments... x:.long 0x format:.asciz “x is: %d”

17 Preserving Compiler Scratch Registers C compiler assumes that it can use certain registers when it generates code (%eax, %ecx, and %edx) A C function may or may not clobber the value of these registers If assembly code needs to preserve the values of these registers across a C function call, it must save/restore their:...# if ecx is in use pushl%ecx# save %ecx call_cFunction # may clobber ecx popl%ecx# restore %ecx...# ecx is OK again

18 Function Calling Summary Passing information to functions in assembly –In global memory (Horrors!) –In registers (“old school” for assembly calling assembly) –On the stack (for C compatible functions) For C compatible functions, the stack is used to hold: –Arguments –Return address –Previous frame’s %ebp value –Automatic variables –Saved values for other compiler used registers (if needed) Passing information from function back to caller –In registers (%eax is C compiler return value convention)