Machine-Level Programming 1 Introduction Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic operations.

Slides:



Advertisements
Similar presentations
Fabián E. Bustamante, Spring 2007 Machine-Level Programming – Introduction Today Assembly programmer’s exec model Accessing information Arithmetic operations.
Advertisements

Machine Programming I: Basics
Machine-Level Programming I: Basics
Machine Programming – Procedures and IA32 Stack CENG334: Introduction to Operating Systems Instructor: Erol Sahin Acknowledgement: Most of the slides are.
University of Washington Instruction Set Architectures ISAs Brief history of processors and architectures C, assembly, machine code Assembly basics: registers,
Carnegie Mellon 1 Machine-Level Programming I: Basics /18-243: Introduction to Computer Systems 4 th Lecture, Sep. 2, 2010 Instructors: Randy Bryant.
Instruction Set Architectures
Carnegie Mellon 1 Machine-Level Programming I: Basics /18-213: Introduction to Computer Systems 5 th Lecture, Tue. May 27, 2015 Instructors: Nathaniel.
Machine-Level Programming I: Introduction Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic operations CS.
Machine-Level Programming I: Introduction January 29, 2002 Topics Assembly Programmer’s Execution Model Accessing Information –Registers –Memory Arithmetic.
– 1 – ISAs and Microarchitectures Instruction Set Architecture The interface between hardware and software “Language” + programmer visible state + I/O.
Machine-Level Programming I: Introduction Sept. 10, 2002 Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic.
Machine-Level Programming I: Introduction
– 1 – ISAs and Microarchitectures Instruction Set Architecture The interface between hardware and software “Language” + programmer visible state + I/O.
Machine-Level Programming I: Introduction Jan 27, 2004 Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic operations.
Machine-Level Programming I: Introduction Apr. 10, 2006 Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic.
Machine-Level Programming I: Introduction Jan. 22, 2008 Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic.
Machine-Level Programming I: Introduction Apr. 14, 2008 Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic.
Machine-Level Programming I: Introduction Sept. 14, 2004 Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic.
C Prog. To Object Code text text binary binary Code in files p1.c p2.c
Machine-Level Programming I: Introduction Sept. 10, 2007 Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic.
Machine-Level Programming I: Introduction Sept. 10, 2002 Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic.
Carnegie Mellon 1 Machine-Level Programming I: Basics /18-213: Introduction to Computer Systems 5 th Lecture, Sep. 11, 2012 Instructors: Dave O’Hallaron,
1 Machine-Level Programming I: Basics Computer Systems Organization Andrew Case Slides adapted from Jinyang Li, Randy Bryant and Dave O’Hallaron.
Carnegie Mellon 1 Machine-Level Programming I: Basics /18-213: Introduction to Computer Systems 5 th Lecture, Jan 28, 2014 Instructors: Seth Copen.
Machine-Level Programming I: Topics History of Intel Processors – short...incomplete Assembly Programmer’s Execution Model Accessing Information Registers.
II:1 X86 Assembly - Data. II:2 Admin Quiz?  What happened?  Make-up options? Several missing from lab Attendance at lab is required Passing grade without.
Machine-Level Programming I: Introduction Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic operations.
Machine-Level Programming I: Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic operations X86.1.ppt CS 105.
Machine-Level Programming 1 Introduction Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic operations.
Machine-Level Programming I: Introduction Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic operations CS.
Carnegie Mellon 1 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Machine-Level Programming I: Basics Sep. 15, 2015.
Fabián E. Bustamante, Spring 2007 Machine-Level Programming III - Procedures Today IA32 stack discipline Register saving conventions Creating pointers.
Machine-Level Programming I: Introduction Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic operations.
Carnegie Mellon 1 Machine-Level Programming I: Basics Slides based on from those of Bryant and O’Hallaron.
Lec 4Systems Architecture1 Systems Architecture Lecture 4: Compilers, Assemblers, Linkers & Loaders Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan.
Machine-Level Programming I: Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic operations CS 105 “Tour of.
Machine-Level Programming I: Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic operations CS 105 “Tour of.
Machine-Level Programming I: Introduction Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic operations.
University of Washington x86 Programming I The Hardware/Software Interface CSE351 Winter 2013.
Carnegie Mellon 1 Machine-Level Programming I: Basics Lecture, Feb. 21, 2013 These slides are from website which accompanies the.
Lecture 4 Assembly Language Topics Finish IEEE Floating Point multiplication, addition Lab 1 comments Assembly Language Intro January 25, 2011 CSCE 212.
– 1 – IEEE Floating Point IEEE Standard 754 Established in 1985 as uniform standard for floating point arithmetic Before that, many idiosyncratic.
IA32 Stack –Region of memory managed with stack discipline –Grows toward lower addresses –Register %esp indicates lowest stack address address of top element.
Machine-Level Programming I: Introduction Jan. 30, 2001 Topics Assembly Programmer’s Execution Model Accessing Information –Registers –Memory Arithmetic.
Machine-Level Programming I: IA32 Assembly Language Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic operations.
X86 Machine-Level Programming I: Introduction Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic operations.
1 Binghamton University Machine-Level Programming I: Basics CS220: Computer Systems II.
X86 Assembly - Data.
CS 3214 Computer Systems Lecture 2 Godmar Back.
ISAs and Microarchitectures
Reading Condition Codes (Cont.)
Instruction Set Architecture
Machine-Level Programming I:
Machine-Level Programming I:
IA32 Processors Evolutionary Design
Machine-Level Programming 1 Introduction
Machine-Level Programming 4 Procedures
C Prog. To Object Code text text binary binary Code in files p1.c p2.c
Machine-Level Programming III: Procedures Sept 18, 2001
Machine-Level Programming I: Introduction Feb. 1, 2000
Machine-Level Programming I: Introduction
X86 Assembly - Data.
Machine-Level Programming: Introduction
Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan
Machine-Level Programming I:
Machine-Level Programming I:
Machine-Level Programming I: Introduction Sept. 10, 2002
Presentation transcript:

Machine-Level Programming 1 Introduction Topics Assembly Programmer’s Execution Model Accessing Information Registers Memory Arithmetic operations

– 2 – CMSC 313, F’09 Assembly Programmer’s View Programmer-Visible State PCProgram Counter Address of next instruction Called “EIP” (IA32) Register File Heavily used program data Condition Codes Store status information about most recent arithmetic operation Used for conditional branching PCPC Registers CPU Memory Object Code Program Data OS Data Addresses Data Instructions Stack Condition Codes Memory Byte addressable array Code, user data, (some) OS data Includes stack used to support procedures

– 3 – CMSC 313, F’09 text binary Compiler ( gcc -S ) Assembler ( gcc or as ) Linker ( gcc or ld ) C program ( p1.c p2.c ) Asm program ( p1.s p2.s ) Object program ( p1.o p2.o ) Executable program ( p ) Static libraries (.a ) Turning C into Object Code Code in files p1.c p2.c Compile with command: gcc –O2 p1.c p2.c -o p Use optimizations ( -O2 ) Put resulting binary in file p

– 4 – CMSC 313, F’09 Compiling Into Assembly C Code int sum(int x, int y) { int t = x + y; return t; } Generated IA32 Assembly sum: pushl %ebp movl %esp,%ebp movl 12(%ebp),%eax addl 8(%ebp),%eax movl %ebp,%esp popl %ebp ret Obtain with command gcc –O2 -S code.c Produces file code.s Gnu ASssembler (GAS) format Some compilers use single instruction “ leave ”

– 5 – CMSC 313, F’09 Assembly Characteristics Minimal Data Types “Integer” data of 1, 2, or 4 bytes Data values Addresses (untyped pointers) Floating point data of 4, 8, or 10 bytes No aggregate types such as arrays or structures Just contiguously allocated bytes in memory Primitive Operations Perform arithmetic function on register or memory data Transfer data between memory and register Load data from memory into register Store register data into memory Transfer control Unconditional jumps to/from procedures Conditional branches

– 6 – CMSC 313, F’09 Code for sum 0x : 0x55 0x89 0xe5 0x8b 0x45 0x0c 0x03 0x45 0x08 0x89 0xec 0x5d 0xc3 Object Code Assembler Translates.s into.o Binary encoding of each instruction Nearly-complete image of executable code Missing linkages between code in different files Linker Resolves references between files Combines with static run-time libraries E.g., code for malloc, printf Some libraries are dynamically linked Linking occurs when program begins execution Total of 13 bytes Each instruction 1, 2, or 3 bytes Starts at address 0x401040

– 7 – CMSC 313, F’09 Machine Instruction Example C Code Add two signed integers Assembly Add two 4-byte integers “Long” words in GCC parlance Same instruction whether signed or unsigned Operands: x :Register %eax y :MemoryM[ %ebp+8] t :Register %eax »Return function value in %eax Object Code 3-byte instruction Stored at address 0x int t = x + y; addl 8(%ebp),%eax 0x401046: Similar to expression: x += y Or int eax; int *ebp; eax += ebp[2]

– 8 – CMSC 313, F’09 Disassembled : 0:55 push %ebp 1:89 e5 mov %esp,%ebp 3:8b 45 0c mov 0xc(%ebp),%eax 6: add 0x8(%ebp),%eax 9:89 ec mov %ebp,%esp b:5d pop %ebp c:c3 ret d:8d lea 0x0(%esi),%esi Disassembling Object Code Disassembler: objdump -d p Useful tool for examining object code Analyzes bit pattern of series of instructions Produces approximate rendition of assembly code Slightly different than GAS format in.s file Can be run on either a.out (complete executable) or.o file

– 9 – CMSC 313, F’09 Disassembled 0x :push %ebp 0x :mov %esp,%ebp 0x :mov 0xc(%ebp),%eax 0x :add 0x8(%ebp),%eax 0x :mov %ebp,%esp 0x40104b :pop %ebp 0x40104c :ret 0x40104d :lea 0x0(%esi),%esi Alternate Disassembly Within gdb Debugger unix> gdb p (gdb) disassemble sum Disassemble procedure (gdb) x/13b sum Examine the 13 bytes starting at sum Object 0x401040: 0x55 0x89 0xe5 0x8b 0x45 0x0c 0x03 0x45 0x08 0x89 0xec 0x5d 0xc3

– 10 – CMSC 313, F’09 What Can be Disassembled? Anything that can be interpreted as executable code Disassembler examines bytes and reconstructs assembly source % objdump -d WINWORD.EXE WINWORD.EXE: file format pei-i386 No symbols in "WINWORD.EXE". Disassembly of section.text: : :55 push %ebp :8b ec mov %esp,%ebp :6a ff push $0xffffffff : push $0x a:68 91 dc 4c 30 push $0x304cdc91

– 11 – CMSC 313, F’09 Moving Data: IA32 Moving Data movl Source, Dest Move 4-byte (“long”) word Lots of these in typical code Operand Types Immediate: Constant integer data Like C constant, but prefixed with ‘ $ ’ E.g., $0x400, $-533 Encoded with 1, 2, or 4 bytes Register: One of 8 integer registers But %esp and %ebp reserved for special use Others have special uses for particular instructions Memory: 4 consecutive bytes of memory Various “address modes” %eax %edx %ecx %ebx %esi %edi %esp %ebp

– 12 – CMSC 313, F’09 movl Operand Combinations Cannot do memory-memory transfer with a single instruction movl Imm Reg Mem Reg Mem Reg Mem Reg SourceDestC Analog movl $0x4,%eaxtemp = 0x4; movl $-147,(%eax)*p = -147; movl %eax,%edxtemp2 = temp1; movl %eax,(%edx)*p = temp; movl (%eax),%edxtemp = *p; Src, Dest

– 13 – CMSC 313, F’09 Simple Addressing Modes Normal(R)Mem[Reg[R]] Register R specifies memory address movl (%ecx),%eax DisplacementD(R)Mem[Reg[R]+D] Register R specifies start of memory region Constant displacement D specifies offset movl 8(%ebp),%edx

– 14 – CMSC 313, F’09 Using Simple Addressing Modes void swap(int *xp, int *yp) { int t0 = *xp; int t1 = *yp; *xp = t1; *yp = t0; } swap: pushl %ebp movl %esp,%ebp pushl %ebx movl 12(%ebp),%ecx movl 8(%ebp),%edx movl (%ecx),%eax movl (%edx),%ebx movl %eax,(%edx) movl %ebx,(%ecx) movl -4(%ebp),%ebx movl %ebp,%esp popl %ebp ret Body Set Up Finish

– 15 – CMSC 313, F’09 Using Simple Addressing Modes void swap(int *xp, int *yp) { int t0 = *xp; int t1 = *yp; *xp = t1; *yp = t0; } swap: pushl %ebp movl %esp,%ebp pushl %ebx movl 12(%ebp),%ecx movl 8(%ebp),%edx movl (%ecx),%eax movl (%edx),%ebx movl %eax,(%edx) movl %ebx,(%ecx) movl -4(%ebp),%ebx movl %ebp,%esp popl %ebp ret Body Set Up Finish

– 16 – CMSC 313, F’09 Understanding Swap void swap(int *xp, int *yp) { int t0 = *xp; int t1 = *yp; *xp = t1; *yp = t0; } movl 12(%ebp),%ecx# ecx = yp movl 8(%ebp),%edx# edx = xp movl (%ecx),%eax# eax = *yp (t1) movl (%edx),%ebx# ebx = *xp (t0) movl %eax,(%edx)# *xp = eax movl %ebx,(%ecx)# *yp = ebx Stack RegisterVariable %ecxyp %edxxp %eaxt1 %ebxt0 yp xp Rtn addr Old % ebp %ebp Offset Old % ebx -4

– 17 – CMSC 313, F’09 Understanding Swap movl 12(%ebp),%ecx# ecx = yp movl 8(%ebp),%edx# edx = xp movl (%ecx),%eax# eax = *yp (t1) movl (%edx),%ebx# ebx = *xp (t0) movl %eax,(%edx)# *xp = eax movl %ebx,(%ecx)# *yp = ebx 0x120 0x124 Rtn addr %ebp Offset Address 0x124 0x120 0x11c 0x118 0x114 0x110 0x10c 0x108 0x104 0x100 yp xp %eax %edx %ecx %ebx %esi %edi %esp %ebp0x104

– 18 – CMSC 313, F’09 movl 12(%ebp),%ecx# ecx = yp movl 8(%ebp),%edx# edx = xp movl (%ecx),%eax# eax = *yp (t1) movl (%edx),%ebx# ebx = *xp (t0) movl %eax,(%edx)# *xp = eax movl %ebx,(%ecx)# *yp = ebx Understanding Swap 0x120 0x124 Rtn addr %ebp Offset Address 0x124 0x120 0x11c 0x118 0x114 0x110 0x10c 0x108 0x104 0x100 yp xp %eax %edx %ecx %ebx %esi %edi %esp %ebp0x104 0x120

– 19 – CMSC 313, F’09 Understanding Swap 0x120 0x124 Rtn addr %ebp Offset Address 0x124 0x120 0x11c 0x118 0x114 0x110 0x10c 0x108 0x104 0x100 yp xp %eax %edx %ecx %ebx %esi %edi %esp %ebp 0x120 0x104 movl 12(%ebp),%ecx# ecx = yp movl 8(%ebp),%edx# edx = xp movl (%ecx),%eax# eax = *yp (t1) movl (%edx),%ebx# ebx = *xp (t0) movl %eax,(%edx)# *xp = eax movl %ebx,(%ecx)# *yp = ebx 0x124

– 20 – CMSC 313, F’09 Understanding Swap 0x120 0x124 Rtn addr %ebp Offset Address 0x124 0x120 0x11c 0x118 0x114 0x110 0x10c 0x108 0x104 0x100 yp xp %eax %edx %ecx %ebx %esi %edi %esp %ebp 0x124 0x120 0x104 movl 12(%ebp),%ecx# ecx = yp movl 8(%ebp),%edx# edx = xp movl (%ecx),%eax# eax = *yp (t1) movl (%edx),%ebx# ebx = *xp (t0) movl %eax,(%edx)# *xp = eax movl %ebx,(%ecx)# *yp = ebx 456

– 21 – CMSC 313, F’09 Understanding Swap 0x120 0x124 Rtn addr %ebp Offset Address 0x124 0x120 0x11c 0x118 0x114 0x110 0x10c 0x108 0x104 0x100 yp xp %eax %edx %ecx %ebx %esi %edi %esp %ebp 456 0x124 0x120 0x104 movl 12(%ebp),%ecx# ecx = yp movl 8(%ebp),%edx# edx = xp movl (%ecx),%eax# eax = *yp (t1) movl (%edx),%ebx# ebx = *xp (t0) movl %eax,(%edx)# *xp = eax movl %ebx,(%ecx)# *yp = ebx 123

– 22 – CMSC 313, F’ Understanding Swap 0x120 0x124 Rtn addr %ebp Offset -4 Address 0x124 0x120 0x11c 0x118 0x114 0x110 0x10c 0x108 0x104 0x100 yp xp %eax %edx %ecx %ebx %esi %edi %esp %ebp 456 0x124 0x x104 movl 12(%ebp),%ecx# ecx = yp movl 8(%ebp),%edx# edx = xp movl (%ecx),%eax# eax = *yp (t1) movl (%edx),%ebx# ebx = *xp (t0) movl %eax,(%edx)# *xp = eax movl %ebx,(%ecx)# *yp = ebx

– 23 – CMSC 313, F’09 Understanding Swap 0x120 0x124 Rtn addr %ebp Offset Address 0x124 0x120 0x11c 0x118 0x114 0x110 0x10c 0x108 0x104 0x100 yp xp %eax %edx %ecx %ebx %esi %edi %esp %ebp 456 0x124 0x120 0x104 movl 12(%ebp),%ecx# ecx = yp movl 8(%ebp),%edx# edx = xp movl (%ecx),%eax# eax = *yp (t1) movl (%edx),%ebx# ebx = *xp (t0) movl %eax,(%edx)# *xp = eax movl %ebx,(%ecx)# *yp = ebx 123

– 24 – CMSC 313, F’09 Indexed Addressing Modes Most General Form D(Rb,Ri,S)Mem[Reg[Rb]+S*Reg[Ri]+ D] D: Constant “displacement” 1, 2, or 4 bytes Rb: Base register: Any of 8 integer registers Ri:Index register: Any, except for %esp Unlikely you’d use %ebp, either S: Scale: 1, 2, 4, or 8 Special Cases (Rb,Ri)Mem[Reg[Rb]+Reg[Ri]] D(Rb,Ri)Mem[Reg[Rb]+Reg[Ri]+D] (Rb,Ri,S)Mem[Reg[Rb]+S*Reg[Ri]]

– 25 – CMSC 313, F’09 Address Computation Examples %edx %ecx 0xf000 0x100 ExpressionComputationAddress 0x8(%edx)0xf x80xf008 (%edx,%ecx)0xf x1000xf100 (%edx,%ecx,4)0xf *0x1000xf400 0x80(,%edx,2)2*0xf x800x1e080

– 26 – CMSC 313, F’09 Some Arithmetic Operations FormatComputation Two Operand Instructions addl Src,DestDest = Dest + Src subl Src,DestDest = Dest - Src imull Src,DestDest = Dest * Src sall Src,DestDest = Dest << SrcAlso called shll sarl Src,DestDest = Dest >> SrcArithmetic shrl Src,DestDest = Dest >> SrcLogical xorl Src,DestDest = Dest ^ Src andl Src,DestDest = Dest & Src orl Src,DestDest = Dest | Src

– 27 – CMSC 313, F’09 Some Arithmetic Operations FormatComputation One Operand Instructions incl DestDest = Dest + 1 decl DestDest = Dest - 1 negl DestDest = - Dest notl DestDest = ~ Dest

– 28 – CMSC 313, F’09 Address Computation Instruction leal Src,Dest Src is address mode expression Set Dest to address denoted by expression Uses Computing addresses without a memory reference E.g., translation of p = &x[i]; Computing arithmetic expressions of the form x + k*y k = 1, 2, 4, or 8.

– 29 – CMSC 313, F’09 Using leal for Arithmetic Expressions int arith (int x, int y, int z) { int t1 = x+y; int t2 = z+t1; int t3 = x+4; int t4 = y * 48; int t5 = t3 + t4; int rval = t2 * t5; return rval; } arith: pushl %ebp movl %esp,%ebp movl 8(%ebp),%eax movl 12(%ebp),%edx leal (%edx,%eax),%ecx leal (%edx,%edx,2),%edx sall $4,%edx addl 16(%ebp),%ecx leal 4(%edx,%eax),%eax imull %ecx,%eax movl %ebp,%esp popl %ebp ret Body Set Up Finish

– 30 – CMSC 313, F’09 Understanding arith int arith (int x, int y, int z) { int t1 = x+y; int t2 = z+t1; int t3 = x+4; int t4 = y * 48; int t5 = t3 + t4; int rval = t2 * t5; return rval; } movl 8(%ebp),%eax# eax = x movl 12(%ebp),%edx# edx = y leal (%edx,%eax),%ecx# ecx = x+y (t1) leal (%edx,%edx,2),%edx# edx = 3*y sall $4,%edx# edx = 48*y (t4) addl 16(%ebp),%ecx# ecx = z+t1 (t2) leal 4(%edx,%eax),%eax# eax = 4+t4+x (t5) imull %ecx,%eax# eax = t5*t2 (rval) y x Rtn addr Old % ebp %ebp Offset Stack z 16

– 31 – CMSC 313, F’09 int arith (int x, int y, int z) { int t1 = x+y; int t2 = z+t1; int t3 = x+4; int t4 = y * 48; int t5 = t3 + t4; int rval = t2 * t5; return rval; } movl 8(%ebp),%eax# eax = x movl 12(%ebp),%edx# edx = y leal (%edx,%eax),%ecx# ecx = x+y (t1) leal (%edx,%edx,2),%edx# edx = 3*y sall $4,%edx# edx = 48*y (t4) addl 16(%ebp),%ecx# ecx = z+t1 (t2) leal 4(%edx,%eax),%eax# eax = 4+t4+x (t5) imull %ecx,%eax # eax = t5*t2 (rval) Understanding arith y x Rtn addr Old % ebp %ebp Offset Stack z 16

– 32 – CMSC 313, F’09 int arith (int x, int y, int z) { int t1 = x+y; int t2 = z+t1; int t3 = x+4; int t4 = y * 48; int t5 = t3 + t4; int rval = t2 * t5; return rval; } movl 8(%ebp),%eax# eax = x movl 12(%ebp),%edx# edx = y leal (%edx,%eax),%ecx# ecx = x+y (t1) leal (%edx,%edx,2),%edx# edx = 3*y sall $4,%edx# edx = 48*y (t4) addl 16(%ebp),%ecx# ecx = z+t1 (t2) leal 4(%edx,%eax),%eax# eax = 4+t4+x (t5) imull %ecx,%eax # eax = t5*t2 (rval) Understanding arith y x Rtn addr Old % ebp %ebp Offset Stack z 16

– 33 – CMSC 313, F’09 int arith (int x, int y, int z) { int t1 = x+y; int t2 = z+t1; int t3 = x+4; int t4 = y * 48; int t5 = t3 + t4; int rval = t2 * t5; return rval; } movl 8(%ebp),%eax# eax = x movl 12(%ebp),%edx# edx = y leal (%edx,%eax),%ecx# ecx = x+y (t1) leal (%edx,%edx,2),%edx# edx = 3*y sall $4,%edx# edx = 48*y (t4) addl 16(%ebp),%ecx# ecx = z+t1 (t2) leal 4(%edx,%eax),%eax# eax = 4+t4+x (t5) imull %ecx,%eax # eax = t5*t2 (rval) Understanding arith y x Rtn addr Old % ebp %ebp Offset Stack z 16

– 34 – CMSC 313, F’09 int arith (int x, int y, int z) { int t1 = x+y; int t2 = z+t1; int t3 = x+4; int t4 = y * 48; int t5 = t3 + t4; int rval = t2 * t5; return rval; } movl 8(%ebp),%eax# eax = x movl 12(%ebp),%edx# edx = y leal (%edx,%eax),%ecx# ecx = x+y (t1) leal (%edx,%edx,2),%edx# edx = 3*y sall $4,%edx# edx = 48*y (t4) addl 16(%ebp),%ecx# ecx = z+t1 (t2) leal 4(%edx,%eax),%eax# eax = 4+t4+x (t5) imull %ecx,%eax # eax = t5*t2 (rval) Understanding arith y x Rtn addr Old % ebp %ebp Offset Stack z 16

– 35 – CMSC 313, F’09 int arith (int x, int y, int z) { int t1 = x+y; int t2 = z+t1; int t3 = x+4; int t4 = y * 48; int t5 = t3 + t4; int rval = t2 * t5; return rval; } movl 8(%ebp),%eax# eax = x movl 12(%ebp),%edx# edx = y leal (%edx,%eax),%ecx# ecx = x+y (t1) leal (%edx,%edx,2),%edx# edx = 3*y sall $4,%edx# edx = 48*y (t4) addl 16(%ebp),%ecx# ecx = z+t1 (t2) leal 4(%edx,%eax),%eax# eax = 4+t4+x (t5) imull %ecx,%eax # eax = t5*t2 (rval) Understanding arith y x Rtn addr Old % ebp %ebp Offset Stack z 16

– 36 – CMSC 313, F’09 Another Example int logical(int x, int y) { int t1 = x^y; int t2 = t1 >> 17; int mask = (1<<13) - 7; int rval = t2 & mask; return rval; } logical: pushl %ebp movl %esp,%ebp movl 8(%ebp),%eax xorl 12(%ebp),%eax sarl $17,%eax andl $8185,%eax movl %ebp,%esp popl %ebp ret Body Set Up Finish movl 8(%ebp),%eaxeax = x xorl 12(%ebp),%eaxeax = x^y sarl $17,%eaxeax = t1>>17 andl $8185,%eaxeax = t2 & 8185

– 37 – CMSC 313, F’09 Another Example int logical(int x, int y) { int t1 = x^y; int t2 = t1 >> 17; int mask = (1<<13) - 7; int rval = t2 & mask; return rval; } logical: pushl %ebp movl %esp,%ebp movl 8(%ebp),%eax xorl 12(%ebp),%eax sarl $17,%eax andl $8185,%eax movl %ebp,%esp popl %ebp ret Body Set Up Finish movl 8(%ebp),%eaxeax = x xorl 12(%ebp),%eaxeax = x^y(t1) sarl $17,%eaxeax = t1>>17(t2) andl $8185,%eaxeax = t2 & 8185

– 38 – CMSC 313, F’09 Another Example int logical(int x, int y) { int t1 = x^y; int t2 = t1 >> 17; int mask = (1<<13) - 7; int rval = t2 & mask; return rval; } logical: pushl %ebp movl %esp,%ebp movl 8(%ebp),%eax xorl 12(%ebp),%eax sarl $17,%eax andl $8185,%eax movl %ebp,%esp popl %ebp ret Body Set Up Finish movl 8(%ebp),%eaxeax = x xorl 12(%ebp),%eaxeax = x^y(t1) sarl $17,%eaxeax = t1>>17(t2) andl $8185,%eaxeax = t2 & 8185

– 39 – CMSC 313, F’09 Another Example int logical(int x, int y) { int t1 = x^y; int t2 = t1 >> 17; int mask = (1<<13) - 7; int rval = t2 & mask; return rval; } logical: pushl %ebp movl %esp,%ebp movl 8(%ebp),%eax xorl 12(%ebp),%eax sarl $17,%eax andl $8185,%eax movl %ebp,%esp popl %ebp ret Body Set Up Finish movl 8(%ebp),%eaxeax = x xorl 12(%ebp),%eaxeax = x^y(t1) sarl $17,%eaxeax = t1>>17(t2) andl $8185,%eaxeax = t2 & 8185 (rval) 2 13 = 8192, 2 13 – 7 = 8185

– 40 – CMSC 313, F’09 Summary Machine Level Programming Assembly code is textual form of binary object code Low-level representation of program Explicit manipulation of registers Simple and explicit instructions Minimal concept of data types Many C control constructs must be implemented with multiple instructions