CSC 252: Computer Organization Spring 2018: Lecture 5

Transcription

1 CSC 252: Computer Organization Spring 2018: Lecture 5 Instructor: Yuhao Zhu Department of Computer Science University of Rochester Action Items: Assignment 1 is due tomorrow, midnight Assignment 2 is out Trivia 2 is due on the coming Tues, noon

2 Carnegie Mellon Announcement 2

3 Carnegie Mellon Announcement Programming Assignment 2 is out Due on Feb 16, 11:59 PM Trivia due Feb 6, noon You have 3 slip days Trivia Due 2

4 Carnegie Mellon Announcement Programming Assignment 2 is out Due on Feb 16, 11:59 PM Trivia due Feb 6, noon You have 3 slip days Read the instructions before getting started!!! You get 1/4 point off for every wrong answer Maxed out at 10 2

5 Carnegie Mellon Floating Point Review v = ( 1) s x 1.frac x 2 E s exp frac 3

6 Carnegie Mellon Floating Point Review v = ( 1) s x 1.frac x 2 E s exp frac Denormalized s exp frac Value Value x x 2-2 3/16 Denormalized E = (exp + 1) bias M = 0.frac 3

7 Carnegie Mellon Floating Point Review v = ( 1) s x 1.frac x 2 E s exp frac Denormalized E = (exp + 1) bias M = 0.frac Normalized E = exp bias M = 1.frac Denormalized Normalized s exp frac Value Value x x 2-2 3/ x 2-2 1/ x 2-2 7/ x 2-1 1/ x 2-1 7/ x x / x x / x x

8 Carnegie Mellon Floating Point Review v = ( 1) s x 1.frac x 2 E s exp frac Denormalized E = (exp + 1) bias M = 0.frac Normalized E = exp bias M = 1.frac Denormalized Normalized Special Value s exp frac Value Value x x 2-2 3/ x 2-2 1/ x 2-2 7/ x 2-1 1/ x 2-1 7/ x x / x x / x x infinite infinite NaN NaN 3

9 Carnegie Mellon Floating Point Review Denormalized Normalized Special Value s exp frac Value Value x x 2-2 3/ x 2-2 1/ x 2-2 7/ x 2-1 1/ x 2-1 7/ x x / x x / x x infinite infinite NaN NaN 4

10 Carnegie Mellon Floating Point Review If you do an integer increment on a positive FP number, you get the next larger FP number. Denormalized Normalized Special Value s exp frac Value Value x x 2-2 3/ x 2-2 1/ x 2-2 7/ x 2-1 1/ x 2-1 7/ x x / x x / x x infinite infinite NaN NaN 4

11 Carnegie Mellon Floating Point Review If you do an integer increment on a positive FP number, you get the next larger FP number. Bit patterns representing nonnegative numbers are ordered the same way as integers, so could use regular integer comparison. Denormalized Normalized Special Value s exp frac Value Value x x 2-2 3/ x 2-2 1/ x 2-2 7/ x 2-1 1/ x 2-1 7/ x x / x x / x x infinite infinite NaN NaN 4

12 Carnegie Mellon Floating Point Review If you do an integer increment on a positive FP number, you get the next larger FP number. Bit patterns representing nonnegative numbers are ordered the same way as integers, so could use regular integer comparison. You don t get this property if: exp is interpreted as signed exp and frac are swapped Denormalized Normalized Special Value s exp frac Value Value x x 2-2 3/ x 2-2 1/ x 2-2 7/ x 2-1 1/ x 2-1 7/ x x / x x / x x infinite infinite NaN NaN 4

13 Carnegie Mellon Floating Point in C Fixed point (implicit binary point){ SP floating point DP floating point C Data Type Bits Max Value Max Value (Decimal) char short int long ~ float 32 ( ) ~ double 64 ( ) ~

14 Carnegie Mellon Floating Point in C Fixed point (implicit binary point){ SP floating point DP floating point C Data Type Bits Max Value Max Value (Decimal) char short int long ~ float 32 ( ) ~ double 64 ( ) ~ To represent 2 31 in fixed-point, you need at least 32 bits Because fixed-point is a weighted positional representation In floating-point, we directly encode the exponent Floating point is based on scientific notation Encoding 31 only needs 7 bits in the exp field 5

15 Carnegie Mellon Floating Point Conversions/Casting in C double/float int Truncates fractional part Like rounding toward zero Not defined when out of range or NaN: Generally sets to TMin 6

16 Carnegie Mellon Floating Point Conversions/Casting in C double/float int Truncates fractional part Like rounding toward zero Not defined when out of range or NaN: Generally sets to TMin int float Can t guarantee exact casting. Will round according to rounding mode s exp frac 1 8-bit 23-bit 6

17 Carnegie Mellon Floating Point Conversions/Casting in C double/float int Truncates fractional part Like rounding toward zero Not defined when out of range or NaN: Generally sets to TMin int float Can t guarantee exact casting. Will round according to rounding mode s exp frac int double 1 8-bit 23-bit Exact conversion s exp frac 1 11-bit 52-bit 6

18 Carnegie Mellon So far in 252 C Program int, float if, else +, -, >> 7

19 Carnegie Mellon So far in 252 C Program int, float if, else +, -, >> Machine Code

20 Carnegie Mellon So far in 252 C Program int, float if, else +, -, >> Machine Code Processor Ripple-carry Adder 7

21 Carnegie Mellon So far in 252 C Program int, float if, else +, -, >> Machine Code Processor Ripple-carry Adder Transistor NAND Gate NOR Gate 7

22 Carnegie Mellon So far in 252 Compiler C Program Assembly Program int, float if, else +, -, >> ret, call movq, addq jmp, jne Machine Code Processor Ripple-carry Adder Transistor NAND Gate NOR Gate 7

23 Carnegie Mellon So far in 252 Compiler C Program Assembly Program Semantically Equivalent int, float if, else +, -, >> ret, call movq, addq jmp, jne Machine Code Processor Ripple-carry Adder Transistor NAND Gate NOR Gate 7

24 Carnegie Mellon So far in 252 Compiler Assembler C Program Assembly Program Machine Code Semantically Equivalent int, float if, else +, -, >> ret, call movq, addq jmp, jne Processor Ripple-carry Adder Transistor NAND Gate NOR Gate 7

25 Carnegie Mellon So far in 252 Compiler Assembler C Program Assembly Program Machine Code Semantically Equivalent Semantically Equivalent int, float if, else +, -, >> ret, call movq, addq jmp, jne Processor Ripple-carry Adder Transistor NAND Gate NOR Gate 7

26 Carnegie Mellon So far in 252 High-Level Language C Program Assembly Program Machine Code Processor Transistor 8

27 Carnegie Mellon So far in 252 High-Level Language Instruction Set Architecture (ISA) C Program Assembly Program Machine Code ISA: Assembly programmers view of a computer Provide all info for someone wants to write assembly/machine code Contract between assembly/ machine code and processor Processor Transistor 8

28 Carnegie Mellon So far in 252 High-Level Language Instruction Set Architecture (ISA) C Program Assembly Program Machine Code Processor ISA: Assembly programmers view of a computer Provide all info for someone wants to write assembly/machine code Contract between assembly/ machine code and processor Processors execute machine code (binary). Assembly program is merely a text representation of machine code Transistor 8

29 Carnegie Mellon So far in 252 High-Level Language Instruction Set Architecture (ISA) Microarchitecture Circuit C Program Assembly Program Machine Code Processor Transistor ISA: Assembly programmers view of a computer Provide all info for someone wants to write assembly/machine code Contract between assembly/ machine code and processor Processors execute machine code (binary). Assembly program is merely a text representation of machine code Microarchitecture: Hardware implementation of the ISA (with the help of circuit technologies) 8

30 Carnegie Mellon This Module (4 Lectures) High-Level Language Instruction Set Architecture (ISA) Microarchitecture Circuit C Program Assembly Program Machine Code Processor Transistor Assembly Programming Explain how various C constructs are implemented in assembly code Effectively translating from C to assembly program manually Helps us understand how compilers work Helps us understand how assemblers work Microarchitecture is the topic of the next module 9

31 Today: Assembly Programming I: Basics Different ISAs and history behind them C, assembly, machine code Move operations (and addressing modes) 10

32 Instruction Set Architecture 11

33 Instruction Set Architecture There used to be many ISAs x86, ARM, Power/PowerPC, Sparc, MIPS, IA64, z Very consolidated today: ARM for mobile, x86 for others 11

34 Instruction Set Architecture There used to be many ISAs x86, ARM, Power/PowerPC, Sparc, MIPS, IA64, z Very consolidated today: ARM for mobile, x86 for others There are even more microarchitectures Apple/Samsung/Qualcomm have their own microarchitecture (implementation) of the ARM ISA Intel and AMD have different microarchitectures for x86 11

35 Instruction Set Architecture There used to be many ISAs x86, ARM, Power/PowerPC, Sparc, MIPS, IA64, z Very consolidated today: ARM for mobile, x86 for others There are even more microarchitectures Apple/Samsung/Qualcomm have their own microarchitecture (implementation) of the ARM ISA Intel and AMD have different microarchitectures for x86 ISA is lucrative business: ARM s Business Model Patent the ISA, and then license the ISA Every implementer pays a royalty to ARM Apple/Samsung pays ARM whenever they sell a smartphone The ARM Diaries, Part 1: How ARM s Business Model Works: the-arm-diaries-part-1-how-arms-business-model-works 11

36 Intel x86 ISA Dominate laptop/desktop/cloud market 12

37 Intel x86 ISA Dominate laptop/desktop/cloud market 12

38 Intel x86 ISA Dominate laptop/desktop/cloud market 12

39 Intel x86 ISA Evolution (Milestones) Evolutionary design: Added more features as time goes on 13

40 Intel x86 ISA Evolution (Milestones) Evolutionary design: Added more features as time goes on Date Feature Notable Implementation bit ISA bit ISA (Basis for IBM PC & DOS) Add Floating Point instructions bit ISA (Refer to as IA32) Add Multi-Media extension (MMX) Pentium/MMX 1999 Add Streaming SIMD Extension (SSE) Pentium III 2001 Intel s first attempt at 64-bit ISA (IA64, failed) Itanium 2004 Implement AMD s 64-bit ISA (x86-64, AMD64) Pentium 4E 2008 Add Advanced Vector Extension (AVE) Core i7 Sandy Bridge 13

41 Intel x86 ISA Evolution (Milestones) Evolutionary design: Added more features as time goes on Date Feature Notable Implementation bit ISA bit ISA (Basis for IBM PC & DOS) Add Floating Point instructions bit ISA (Refer to as IA32) Add Multi-Media extension (MMX) Pentium/MMX 1999 Add Streaming SIMD Extension (SSE) Pentium III 2001 Intel s first attempt at 64-bit ISA (IA64, failed) Itanium 2004 Implement AMD s 64-bit ISA (x86-64, AMD64) Pentium 4E 2008 Add Advanced Vector Extension (AVE) Core i7 Sandy Bridge 13

42 Backward Compatibility Binary executable generated for an older processor can execute on a newer processor Allows legacy code to be executed on newer machines Buy new machines without changing the software x86 is backward compatible up until 8086 (16-bit ISA) i.e., an 8086 binary executable can be executed on any of today s x86 machines Great for users, nasty for processor implementers Every instruction you put into the ISA, you are stuck with it FOREVER 14

43 x86 Clones: Advanced Micro Devices (AMD) Historically AMD build processors for x86 ISA A little bit slower, a lot cheaper Then Recruited top circuit designers from Digital Equipment Corp. and other downward trending companies Developed x86-64, their own 64-bit x86 extension to IA32 Built first 1 GHz CPU Intel felt hard to admit mistake or that AMD was better 2004: Intel Announces EM64T extension to IA32 Almost identical to x86-64! Today s 64-bit x86 ISA is basically AMD s original proposal 15

44 x86 Clones: Advanced Micro Devices (AMD) Today: Holding up not too badly 16

45 x86 Clones: Advanced Micro Devices (AMD) Today: Holding up not too badly 16

46 x86 Clones: Advanced Micro Devices (AMD) Today: Holding up not too badly 16

47 Our Coverage IA32 The traditional x86 2 nd edition of the textbook x86-64 The standard CSUG machine 3 rd edition of the textbook Our focus 17

48 Aside: Moore s Law More instructions require more transistors to implement 18

49 Aside: Moore s Law More instructions require more transistors to implement 18

50 Aside: Moore s Law More instructions require more transistors to implement 18

51 Aside: Moore s Law More instructions require more transistors to implement 19

52 Aside: Moore s Law More instructions require more transistors to implement Gordon Moore in 1965 predicted that the number of transistors doubles every year 19

53 Aside: Moore s Law More instructions require more transistors to implement Gordon Moore in 1965 predicted that the number of transistors doubles every year 19

54 Aside: Moore s Law More instructions require more transistors to implement Gordon Moore in 1965 predicted that the number of transistors doubles every year 19

55 Aside: Moore s Law More instructions require more transistors to implement Gordon Moore in 1965 predicted that the number of transistors doubles every year 19

56 Aside: Moore s Law More instructions require more transistors to implement Gordon Moore in 1965 predicted that the number of transistors doubles every year In 1975 he revised the prediction to doubling every 2 years 19

57 Aside: Moore s Law More instructions require more transistors to implement Gordon Moore in 1965 predicted that the number of transistors doubles every year In 1975 he revised the prediction to doubling every 2 years Today s widely-known Moore s Law: number of transistors double about every 18 months Moore never used the number 18 19

58 Aside: Moore s Law 20

59 Aside: Moore s Law Question: why is transistor count increasing but computers are becoming smaller? 20

60 Aside: Moore s Law Question: why is transistor count increasing but computers are becoming smaller? Because transistors are becoming smaller 20

61 Aside: Moore s Law Question: why is transistor count increasing but computers are becoming smaller? Because transistors are becoming smaller ~1.4x smaller each dimension(1.4 2 ~ 2) 20

62 Aside: Moore s Law Question: why is transistor count increasing but computers are becoming smaller? Because transistors are becoming smaller ~1.4x smaller each dimension(1.4 2 ~ 2) Moore s Law is: 20

63 Aside: Moore s Law Question: why is transistor count increasing but computers are becoming smaller? Because transistors are becoming smaller ~1.4x smaller each dimension(1.4 2 ~ 2) Moore s Law is: A law of physics? 20

64 Aside: Moore s Law Question: why is transistor count increasing but computers are becoming smaller? Because transistors are becoming smaller ~1.4x smaller each dimension(1.4 2 ~ 2) Moore s Law is: A law of physics? No 20

65 Aside: Moore s Law Question: why is transistor count increasing but computers are becoming smaller? Because transistors are becoming smaller ~1.4x smaller each dimension(1.4 2 ~ 2) Moore s Law is: A law of physics? A law of circuits? No 20

66 Aside: Moore s Law Question: why is transistor count increasing but computers are becoming smaller? Because transistors are becoming smaller ~1.4x smaller each dimension(1.4 2 ~ 2) Moore s Law is: A law of physics? A law of circuits? No No 20

67 Aside: Moore s Law Question: why is transistor count increasing but computers are becoming smaller? Because transistors are becoming smaller ~1.4x smaller each dimension(1.4 2 ~ 2) Moore s Law is: A law of physics? A law of circuits? A law of economy? No No 20

68 Aside: Moore s Law Question: why is transistor count increasing but computers are becoming smaller? Because transistors are becoming smaller ~1.4x smaller each dimension(1.4 2 ~ 2) Moore s Law is: A law of physics? A law of circuits? A law of economy? No No Yes 20

69 Aside: Moore s Law Question: why is transistor count increasing but computers are becoming smaller? Because transistors are becoming smaller ~1.4x smaller each dimension(1.4 2 ~ 2) Moore s Law is: A law of physics? A law of circuits? A law of economy? No No Yes 20

70 Aside: Moore s Law Question: why is transistor count increasing but computers are becoming smaller? Because transistors are becoming smaller ~1.4x smaller each dimension(1.4 2 ~ 2) Moore s Law is: A law of physics? A law of circuits? A law of economy? No No Yes 20

71 Aside: Moore s Law Question: why is transistor count increasing but computers are becoming smaller? Because transistors are becoming smaller ~1.4x smaller each dimension(1.4 2 ~ 2) Moore s Law is: A law of physics? A law of circuits? A law of economy? A law of psychology? No No Yes 20

72 Aside: Moore s Law Question: why is transistor count increasing but computers are becoming smaller? Because transistors are becoming smaller ~1.4x smaller each dimension(1.4 2 ~ 2) Moore s Law is: A law of physics? A law of circuits? A law of economy? A law of psychology? No No Yes Yes 20

73 Aside: Moore s Law Question: why is transistor count increasing but computers are becoming smaller? Because transistors are becoming smaller ~1.4x smaller each dimension(1.4 2 ~ 2) Moore s Law is: A law of physics? A law of circuits? A law of economy? A law of psychology? No No Yes Yes Questions? 20

74 Today: Assembly Programming I: Basics Different ISAs and history behind them C, assembly, machine code Move operations (and addressing modes) 21

75 Assembly Code s View of Computer: ISA 22

76 Assembly Code s View of Computer: ISA Assembly Programmer s Perspective of a Computer CPU Memory 22

77 Assembly Code s View of Computer: ISA Assembly Programmer s Perspective of a Computer CPU Memory Code Data Stack (Byte Addressable) Memory Code: instructions Data Stack to support function call 22

78 Assembly Code s View of Computer: ISA Assembly Programmer s Perspective of a Computer CPU Memory Code Data Stack (Byte Addressable) Memory Code: instructions Data Stack to support function call Data 22

79 Assembly Code s View of Computer: ISA Assembly Programmer s Perspective of a Computer CPU Memory Code Data Stack (Byte Addressable) Memory Code: instructions Data Stack to support function call Data 0x53 0x48 0x89 0xd3 22

80 Assembly Code s View of Computer: ISA Assembly Programmer s Perspective of a Computer CPU Memory Code Data Stack (Byte Addressable) Memory Code: instructions Data Stack to support function call Code (Instructions) Data Instruction is the fundamental unit of work. All instructions are coded as bits (just like data!) 0x78 0xfe 0xe3 0x05 22

81 Assembly Code s View of Computer: ISA Assembly Programmer s Perspective of a Computer CPU Memory Code Data Stack (Byte Addressable) Memory Code: instructions Data Stack to support function call Code (Instructions) Data Stack 0x53 0x48 0x89 0xd3 22

82 Assembly Code s View of Computer: ISA Assembly Programmer s Perspective of a Computer CPU Register File Memory Code Data Stack (Byte Addressable) Memory Code: instructions Data Stack to support function call Register file Faster memory (e.g., 0.5 ns vs. 15 ns) Small memory (e.g., 128 B vs. 16 GB) Heavily used program data 22

83 x86-64 Integer Register File 8 Bytes %rax %r8 %rbx %rcx %rdx %rsi %rdi %rsp %rbp %r9 %r10 %r11 %r12 %r13 %r14 %r15 23

84 x86-64 Integer Register File Lower-half of each register can be independently addressed (until 8 bytes) 24

85 x86-64 Integer Register File Lower-half of each register can be independently addressed (until 8 bytes) %rax 8 Bytes 24

86 x86-64 Integer Register File Lower-half of each register can be independently addressed (until 8 bytes) %rax %eax 8 Bytes 4 Bytes 24

87 x86-64 Integer Register File Lower-half of each register can be independently addressed (until 8 bytes) %rax %eax 8 Bytes %ax 4 Bytes 2 Bytes 24

88 x86-64 Integer Register File Lower-half of each register can be independently addressed (until 8 bytes) %rax %eax %ax %al 8 Bytes 4 Bytes 2 Bytes 1 B 24

89 x86-64 Integer Register File Lower-half of each register can be independently addressed (until 8 bytes) %rax %eax %ax %al C Data Type Size (Bytes) char 1 short 2 int 4 long 8 Pointer 8 8 Bytes 4 Bytes 2 Bytes 1 B 24

90 x86-64 Integer Register File Lower-half of each register can be independently addressed (until 8 bytes) %rax %eax %ax %al C Data Type Size (Bytes) char 1 short 2 8 Bytes 4 Bytes 2 Bytes 1 B int 4 long 8 Pointer 8 Floating point data is stored in a separate set of register file (in 3 lectures ) 24

91 Assembly Code s View of Computer: ISA Assembly Programmer s Perspective of a Computer CPU Register File Memory Code Data Stack (Byte Addressable) Memory Code: instructions Data Stack to support function call Register file Faster memory (e.g., 0.5 ns vs. 15 ns) Small memory (e.g., 128 B vs. 16 GB) Heavily used program data 25

92 Assembly Code s View of Computer: ISA Assembly Programmer s Perspective of a Computer CPU PC Register File Memory Code Data Stack (Byte Addressable) Memory Code: instructions Data Stack to support function call Register file Faster memory (e.g., 0.5 ns vs. 15 ns) Small memory (e.g., 128 B vs. 16 GB) PC: Program counter A special register containing address of next instruction Called RIP in x86-64 Heavily used program data 25

93 Assembly Code s View of Computer: ISA Assembly Programmer s Perspective of a Computer CPU PC Register File Addresses Memory Code Data Stack (Byte Addressable) Memory Code: instructions Data Stack to support function call Register file Faster memory (e.g., 0.5 ns vs. 15 ns) Small memory (e.g., 128 B vs. 16 GB) PC: Program counter A special register containing address of next instruction Called RIP in x86-64 Heavily used program data 25

94 Assembly Code s View of Computer: ISA Assembly Programmer s Perspective of a Computer CPU PC Register File Addresses Instructions Memory Code Data Stack (Byte Addressable) Memory Code: instructions Data Stack to support function call Register file Faster memory (e.g., 0.5 ns vs. 15 ns) Small memory (e.g., 128 B vs. 16 GB) PC: Program counter A special register containing address of next instruction Called RIP in x86-64 Heavily used program data 25

95 Assembly Code s View of Computer: ISA Assembly Programmer s Perspective of a Computer CPU PC Register File Addresses Data Instructions Memory Code Data Stack (Byte Addressable) Memory Code: instructions Data Stack to support function call Register file Faster memory (e.g., 0.5 ns vs. 15 ns) Small memory (e.g., 128 B vs. 16 GB) PC: Program counter A special register containing address of next instruction Called RIP in x86-64 Heavily used program data 25

96 Assembly Code s View of Computer: ISA Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Addresses Data Instructions Memory Code Data Stack (Byte Addressable) Memory Code: instructions Data Stack to support function call Register file Faster memory (e.g., 0.5 ns vs. 15 ns) Small memory (e.g., 128 B vs. 16 GB) PC: Program counter A special register containing address of next instruction Called RIP in x86-64 Arithmetic logic unit (ALU) Where computation happens Heavily used program data 25

97 Assembly Code s View of Computer: ISA Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Condition Codes Addresses Data Instructions Memory Code Data Stack (Byte Addressable) Memory Code: instructions Data Stack to support function call Register file Faster memory (e.g., 0.5 ns vs. 15 ns) Small memory (e.g., 128 B vs. 16 GB) Heavily used program data PC: Program counter A special register containing address of next instruction Called RIP in x86-64 Arithmetic logic unit (ALU) Where computation happens Condition codes Store status information about most recent arithmetic or logical operation Used for conditional branch 25

98 Assembly Program Instructions Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Condition Codes Addresses Data Instructions Memory Code Data Stack Heap 26

99 Assembly Program Instructions Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Condition Codes Addresses Data Instructions Memory Code Data Stack Heap Compute Instruction: Perform arithmetics on register or memory data addq %eax, %ebx C constructs: +, -, >>, etc. 26

100 Assembly Program Instructions Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Condition Codes Addresses Data Instructions Memory Code Data Stack Heap Compute Instruction: Perform arithmetics on register or memory data addq %eax, %ebx C constructs: +, -, >>, etc. Data Movement Instruction: Transfer data between memory and register movq %eax, (%ebx) 26

101 Assembly Program Instructions Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Condition Codes Addresses Data Instructions Memory Code Data Stack Heap Compute Instruction: Perform arithmetics on register or memory data addq %eax, %ebx C constructs: +, -, >>, etc. Data Movement Instruction: Transfer data between memory and register movq %eax, (%ebx) Control Instruction: Alter the sequence of instructions (by changing PC) jmp, call C constructs: if-else, do-while, function call, etc. 26

102 Turning C into Object Code C Code (sum.c) long plus(long x, long y); void sumstore(long x, long y, long *dest) { long t = plus(x, y); *dest = t; } 27

103 Turning C into Object Code C Code (sum.c) long plus(long x, long y); void sumstore(long x, long y, long *dest) { long t = plus(x, y); *dest = t; } Generated x86-64 Assembly sumstore: pushq movq call movq popq ret %rbx %rdx, %rbx plus %rax, (%rbx) %rbx 27

104 Turning C into Object Code C Code (sum.c) long plus(long x, long y); void sumstore(long x, long y, long *dest) { long t = plus(x, y); *dest = t; } Generated x86-64 Assembly sumstore: pushq movq call movq popq ret %rbx %rdx, %rbx plus %rax, (%rbx) %rbx Obtain (on CSUG machine) with command gcc Og S sum.c -o sum.s 27

105 Turning C into Object Code Generated x86-64 Assembly sumstore: pushq movq call movq popq ret %rbx %rdx, %rbx plus %rax, (%rbx) %rbx 28

106 Turning C into Object Code Generated x86-64 Assembly Binary Code for sumstore sumstore: pushq movq call movq popq ret %rbx %rdx, %rbx plus %rax, (%rbx) %rbx Memory 0x53 0x48 0x89 0xd3 0xe8 0xf2 0xff 0xff 0xff 0x48 0x89 0x03 0x5b 0xc3 28

107 Turning C into Object Code Generated x86-64 Assembly Binary Code for sumstore sumstore: pushq movq call movq popq ret %rbx %rdx, %rbx plus %rax, (%rbx) %rbx Address 0x Memory 0x53 0x48 0x89 0xd3 0xe8 0xf2 0xff 0xff 0xff 0x48 0x89 0x03 0x5b 0xc3 28

108 Turning C into Object Code Generated x86-64 Assembly Binary Code for sumstore sumstore: pushq movq call movq popq ret %rbx %rdx, %rbx plus %rax, (%rbx) %rbx Obtain (on CSUG machine) with command gcc c sum.s -o sum.o Address 0x Memory 0x53 0x48 0x89 0xd3 0xe8 0xf2 0xff 0xff 0xff 0x48 0x89 0x03 0x5b 0xc3 28

109 Turning C into Object Code Generated x86-64 Assembly Binary Code for sumstore sumstore: pushq movq call movq popq ret Obtain (on CSUG machine) with command gcc c sum.s -o sum.o Total of 14 bytes %rbx %rdx, %rbx plus %rax, (%rbx) %rbx Instructions have variable lengths: e.g., 1, 3, or 5 bytes Code starts at memory address 0x Address 0x Memory 0x53 0x48 0x89 0xd3 0xe8 0xf2 0xff 0xff 0xff 0x48 0x89 0x03 0x5b 0xc3 28

110 Machine Instruction Example 29

111 Machine Instruction Example long t; long *dest; t += *dest; C Code Add value t with value in memory location whose address is dest and store the result back to t 29

112 Machine Instruction Example long t; long *dest; t += *dest; addq %rax, (%rbx) C Code Add value t with value in memory location whose address is dest and store the result back to t Assembly Instruction Operator: Add two 8-byte values Quad words in x86-64 parlance Operands: t: Register %rax dest: Register %rbx *dest: Memory M[%rbx] 29

113 Machine Instruction Example long t; long *dest; t += *dest; Operator addq %rax, (%rbx) C Code Add value t with value in memory location whose address is dest and store the result back to t Assembly Instruction Operator: Add two 8-byte values Quad words in x86-64 parlance Operands: t: Register %rax dest: Register %rbx *dest: Memory M[%rbx] 29

114 Machine Instruction Example long t; long *dest; t += *dest; Operand(s) addq %rax, (%rbx) C Code Add value t with value in memory location whose address is dest and store the result back to t Assembly Instruction Operator: Add two 8-byte values Quad words in x86-64 parlance Operands: t: Register %rax dest: Register %rbx *dest: Memory M[%rbx] 29

115 Machine Instruction Example long t; long *dest; t += *dest; addq %rax, (%rbx) t C Code Add value t with value in memory location whose address is dest and store the result back to t Assembly Instruction Operator: Add two 8-byte values Quad words in x86-64 parlance Operands: t: Register %rax dest: Register %rbx *dest: Memory M[%rbx] 29

116 Machine Instruction Example long t; long *dest; t += *dest; addq %rax, (%rbx) t dest C Code Add value t with value in memory location whose address is dest and store the result back to t Assembly Instruction Operator: Add two 8-byte values Quad words in x86-64 parlance Operands: t: Register %rax dest: Register %rbx *dest: Memory M[%rbx] 29

117 Machine Instruction Example long t; long *dest; t += *dest; addq %rax, (%rbx) t *dest dest C Code Add value t with value in memory location whose address is dest and store the result back to t Assembly Instruction Operator: Add two 8-byte values Quad words in x86-64 parlance Operands: t: Register %rax dest: Register %rbx *dest: Memory M[%rbx] 29

118 Machine Instruction Example long t; long *dest; t += *dest; addq %rax, (%rbx) t 0xf0059e: 0x d8 *dest dest C Code Add value t with value in memory location whose address is dest and store the result back to t Assembly Instruction Operator: Add two 8-byte values Quad words in x86-64 parlance Operands: t: Register %rax dest: Register %rbx *dest: Memory M[%rbx] Object Code 3-byte instruction Stored at address 0xf0059e 29

119 Instruction Processing Sequence Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Condition Codes Addresses Data Instructions Memory Code Data Stack Fetch Instruction (According to PC) 30

120 Instruction Processing Sequence Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Condition Codes Addresses Data Instructions Memory Code Data Stack Fetch Instruction (According to PC) 0x4801d8 30

121 Instruction Processing Sequence Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Condition Codes Addresses Data Instructions Memory Code Data Stack Fetch Instruction (According to PC) Decode Instruction addq %rax,(%rbx) 30

122 Instruction Processing Sequence Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Condition Codes Addresses Data Instructions Memory Code Data Stack Fetch Instruction (According to PC) Decode Instruction Fetch Operands 30

123 Instruction Processing Sequence Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Condition Codes Addresses Data Instructions Memory Code Data Stack Fetch Instruction (According to PC) Decode Instruction Fetch Operands Execute Instruction 30

124 Instruction Processing Sequence Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Condition Codes Addresses Data Instructions Memory Code Data Stack Fetch Instruction (According to PC) Decode Instruction Fetch Operands Execute Instruction Update Condition Codes 30

125 Instruction Processing Sequence Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Condition Codes Addresses Data Instructions Memory Code Data Stack Fetch Instruction (According to PC) Decode Instruction Fetch Operands Execute Instruction Store Results Update Condition Codes 30

126 Instruction Processing Sequence Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Condition Codes Addresses Data Instructions Memory Code Data Stack Fetch Instruction (According to PC) Decode Instruction Fetch Operands Execute Instruction Store Results Update Condition Codes Adjust PC 30

127 Instruction Processing Sequence Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Condition Codes Addresses Data Instructions Memory Code Data Stack Fetch Instruction (According to PC) Decode Instruction Fetch Operands Execute Instruction Store Results Update Condition Codes Adjust PC 30

128 Instruction Processing Sequence Assembly Programmer s Perspective of a Computer CPU PC ALU Register File Condition Codes Addresses Data Instructions Memory Code Data Stack Fetch Instruction (According to PC) Decode Instruction Fetch Operands Execute Instruction Store Results Questions? Update Condition Codes Adjust PC 30

129 Today: Assembly Programming I: Basics Different ISAs and history behind them C, assembly, machine code Move operations (and addressing modes) 31

130 Data Movement Instructions movq Source, Dest 32

131 Data Movement Instructions movq Source, Dest Operator Operands 32

132 Data Movement Instructions movq Source, Dest Operator Operands Register: One of 16 integer registers Example: %rax, %r13 But %rsp reserved for special use 32

133 Data Movement Instructions movq Source, Dest Operator Operands Register: One of 16 integer registers Example: %rax, %r13 But %rsp reserved for special use Immediate: Constant integer data Example: $0x400, $-533; like C constant, but prefixed with $ Encoded with 1, 2, or 4 bytes; can only be source 32

134 Data Movement Instructions movq Source, Dest Operator Operands Register: One of 16 integer registers Example: %rax, %r13 But %rsp reserved for special use Immediate: Constant integer data Example: $0x400, $-533; like C constant, but prefixed with $ Encoded with 1, 2, or 4 bytes; can only be source Memory: 8 consecutive bytes in memory at given address Simplest example: (%rax) How to obtain the address is called addressing mode (later ) 32

135 movq Operand Combinations Source Dest Src,Dest C Analog movq Imm Reg Reg Mem Reg Mem Mem Reg Cannot do memory-memory transfer with a single instruction in x86. 33

136 movq Operand Combinations Source Dest Src,Dest C Analog Imm Reg Mem movq $0x4,%rax movq Reg Reg Mem Mem Reg Cannot do memory-memory transfer with a single instruction in x86. 33

137 movq Operand Combinations Source Dest Src,Dest C Analog Imm Reg Mem movq $0x4,%rax temp = 0x4; movq Reg Reg Mem Mem Reg Cannot do memory-memory transfer with a single instruction in x86. 33

138 movq Operand Combinations Source Dest Src,Dest C Analog Imm Reg Mem movq $0x4,%rax temp = 0x4; movq $-147,(%rax) movq Reg Reg Mem Mem Reg Cannot do memory-memory transfer with a single instruction in x86. 33

139 movq Operand Combinations Source Dest Src,Dest C Analog Imm Reg Mem movq $0x4,%rax temp = 0x4; movq $-147,(%rax) *p = -147; movq Reg Reg Mem Mem Reg Cannot do memory-memory transfer with a single instruction in x86. 33

140 movq Operand Combinations Source Dest Src,Dest C Analog Imm Reg Mem movq $0x4,%rax temp = 0x4; movq $-147,(%rax) *p = -147; movq Reg Reg Mem movq %rax,%rdx Mem Reg Cannot do memory-memory transfer with a single instruction in x86. 33

141 movq Operand Combinations Source Dest Src,Dest C Analog Imm Reg Mem movq $0x4,%rax temp = 0x4; movq $-147,(%rax) *p = -147; movq Reg Reg Mem movq %rax,%rdx temp2 = temp1; Mem Reg Cannot do memory-memory transfer with a single instruction in x86. 33

142 movq Operand Combinations Source Dest Src,Dest C Analog Imm Reg Mem movq $0x4,%rax temp = 0x4; movq $-147,(%rax) *p = -147; movq Reg Reg Mem movq %rax,%rdx movq %rax,(%rdx) temp2 = temp1; Mem Reg Cannot do memory-memory transfer with a single instruction in x86. 33

143 movq Operand Combinations Source Dest Src,Dest C Analog Imm Reg Mem movq $0x4,%rax temp = 0x4; movq $-147,(%rax) *p = -147; movq Reg Reg Mem movq %rax,%rdx movq %rax,(%rdx) temp2 = temp1; *p = temp; Mem Reg Cannot do memory-memory transfer with a single instruction in x86. 33

144 movq Operand Combinations Source Dest Src,Dest C Analog Imm Reg Mem movq $0x4,%rax temp = 0x4; movq $-147,(%rax) *p = -147; movq Reg Reg Mem movq %rax,%rdx movq %rax,(%rdx) temp2 = temp1; *p = temp; Mem Reg movq (%rax),%rdx Cannot do memory-memory transfer with a single instruction in x86. 33

145 movq Operand Combinations Source Dest Src,Dest C Analog Imm Reg Mem movq $0x4,%rax temp = 0x4; movq $-147,(%rax) *p = -147; movq Reg Reg Mem movq %rax,%rdx movq %rax,(%rdx) temp2 = temp1; *p = temp; Mem Reg movq (%rax),%rdx temp = *p; Cannot do memory-memory transfer with a single instruction in x86. 33

146 Memory Addressing Modes An addressing mode specifies: how to calculate the effective memory address of an operand by using information held in registers and/or constants 34

147 Memory Addressing Modes An addressing mode specifies: how to calculate the effective memory address of an operand by using information held in registers and/or constants Normal: (R) Memory address: content of Register R (Reg[R]) Pointer dereferencing in C movq (%rcx),%rax; // address = %rcx 34

148 Memory Addressing Modes An addressing mode specifies: how to calculate the effective memory address of an operand by using information held in registers and/or constants Normal: (R) Memory address: content of Register R (Reg[R]) Pointer dereferencing in C movq (%rcx),%rax; // address = %rcx Displacement: D(R) Memory address: Reg[R]+D Register R specifies start of memory region Constant displacement D specifies offset movq 8(%rbp),%rdx; // address = %rbp

149 Example of Simple Addressing Modes void swap (long *xp, long *yp) { long t0 = *xp; long t1 = *yp; *xp = t1; *yp = t0; } 35

150 Example of Simple Addressing Modes void swap (long *xp, long *yp) { long t0 = *xp; long t1 = *yp; *xp = t1; *yp = t0; } Memory 35

151 Example of Simple Addressing Modes void swap (long *xp, long *yp) { long t0 = *xp; long t1 = *yp; *xp = t1; *yp = t0; } Memory *xp Addr xp 35

152 Example of Simple Addressing Modes void swap (long *xp, long *yp) { long t0 = *xp; long t1 = *yp; *xp = t1; *yp = t0; } Memory *xp *yp Addr xp yp 35

153 Example of Simple Addressing Modes void swap (long *xp, long *yp) { long t0 = *xp; long t1 = *yp; *xp = t1; *yp = t0; } Registers %rdi %rsi %rax %rdx xp yp Memory *xp *yp Addr xp yp 35

154 Example of Simple Addressing Modes void swap (long *xp, long *yp) { long t0 = *xp; long t1 = *yp; *xp = t1; *yp = t0; } Registers %rdi %rsi %rax %rdx xp yp Memory *xp *yp Addr xp yp swap: movq movq movq movq ret (%rdi), %rax # t0 = *xp (%rsi), %rdx # t1 = *yp %rdx, (%rdi) # *xp = t1 %rax, (%rsi) # *yp = t0 35

155 Example of Simple Addressing Modes void swap (long *xp, long *yp) { long t0 = *xp; long t1 = *yp; *xp = t1; *yp = t0; } swap: movq movq movq movq ret Registers %rdi %rsi %rax %rdx xp yp How Does This Work? Memory *xp *yp (%rdi), %rax # t0 = *xp (%rsi), %rdx # t1 = *yp %rdx, (%rdi) # *xp = t1 %rax, (%rsi) # *yp = t0 Addr xp yp 35

156 Understanding Swap() Registers Memory Addr %rdi %rsi %rax %rdx 0x120 0x x120 0x118 0x110 0x108 0x100 xp yp swap: movq movq movq movq ret (%rdi), %rax # t0 = *xp (%rsi), %rdx # t1 = *yp %rdx, (%rdi) # *xp = t1 %rax, (%rsi) # *yp = t0 36

157 Understanding Swap() Registers Memory Addr %rdi %rsi %rax %rdx 0x120 0x x120 0x118 0x110 0x108 0x100 xp yp swap: movq movq movq movq ret (%rdi), %rax # t0 = *xp (%rsi), %rdx # t1 = *yp %rdx, (%rdi) # *xp = t1 %rax, (%rsi) # *yp = t0 36

158 Understanding Swap() Registers Memory Addr %rdi %rsi %rax %rdx 0x120 0x x120 0x118 0x110 0x108 0x100 xp yp swap: movq movq movq movq ret (%rdi), %rax # t0 = *xp (%rsi), %rdx # t1 = *yp %rdx, (%rdi) # *xp = t1 %rax, (%rsi) # *yp = t0 36

159 Understanding Swap() Registers Memory Addr %rdi %rsi %rax %rdx 0x120 0x x120 0x118 0x110 0x108 0x100 xp yp swap: movq movq movq movq ret (%rdi), %rax # t0 = *xp (%rsi), %rdx # t1 = *yp %rdx, (%rdi) # *xp = t1 %rax, (%rsi) # *yp = t0 36

160 Understanding Swap() Registers Memory Addr %rdi %rsi %rax %rdx 0x120 0x x120 0x118 0x110 0x108 0x100 xp yp swap: movq movq movq movq ret (%rdi), %rax # t0 = *xp (%rsi), %rdx # t1 = *yp %rdx, (%rdi) # *xp = t1 %rax, (%rsi) # *yp = t0 36

161 Understanding Swap() Registers Memory Addr %rdi %rsi %rax %rdx 0x120 0x x120 0x118 0x110 0x108 0x100 xp yp swap: movq movq movq movq ret (%rdi), %rax # t0 = *xp (%rsi), %rdx # t1 = *yp %rdx, (%rdi) # *xp = t1 %rax, (%rsi) # *yp = t0 36

162 Understanding Swap() Registers Memory Addr %rdi %rsi %rax %rdx 0x120 0x x120 0x118 0x110 0x108 0x100 xp yp swap: movq movq movq movq ret (%rdi), %rax # t0 = *xp (%rsi), %rdx # t1 = *yp %rdx, (%rdi) # *xp = t1 %rax, (%rsi) # *yp = t0 36

163 Understanding Swap() Registers Memory Addr %rdi %rsi %rax %rdx 0x120 0x x120 0x118 0x110 0x108 0x100 xp yp swap: movq movq movq movq ret (%rdi), %rax # t0 = *xp (%rsi), %rdx # t1 = *yp %rdx, (%rdi) # *xp = t1 %rax, (%rsi) # *yp = t0 36

164 Understanding Swap() Registers Memory Addr %rdi %rsi %rax %rdx 0x120 0x x120 0x118 0x110 0x108 0x100 xp yp swap: movq movq movq movq ret (%rdi), %rax # t0 = *xp (%rsi), %rdx # t1 = *yp %rdx, (%rdi) # *xp = t1 %rax, (%rsi) # *yp = t0 36