1. Chapter 2: Instruction Set Principles and Examples
Adapted from “ “
Copyright 1998 UCB
Chapter 2: Instruction Set Principles and Examples
순천향대학교 컴퓨터학부
이 상 정

2. Review, #1 Designing to Last through Trends Time to run the task
Capacity Speed
Logic 2x in 3 years 2x in 3 years
DRAM 4x in 3 years 2x in 10 years
Disk 4x in 3 years 2x in 10 years
Processor ( n.a.) 2x in 1.5 years
Time to run the task
Execution time, response time, latency
Tasks per day, hour, week, sec, ns,
Throughput, bandwidth
“X is n times faster than Y” means
ExTime(Y) Performance(X) =
ExTime(X) Performance(Y)

3. Review, #2 Amdahl’s Law: CPI Law:
Execution time is the REAL measure of computer performance!
Good products created when have:
Good benchmarks
Good ways to summarize performance
Die Cost goes roughly with die area4
Speedupoverall =
ExTimeold
ExTimenew = 1
(1 - Fractionenhanced) + Fractionenhanced
Speedupenhanced
CPU time = Seconds = Instructions x Cycles x Seconds
Program Program Instruction Cycle

4. Review, #3: Price vs. Cost

5. Introduction What Must be Specified? Instruction Format or Encoding
Fetch
What Must be Specified?
Instruction Format or Encoding
how is it decoded?
Location of operands and result
where other than memory?
how many explicit operands?
how are memory operands located?
which can or cannot be in memory?
Data type and Size
Operations
what are supported
Successor instruction
jumps, conditions, branches
Instruction
Decode
Operand
Fetch
Execute
Result
Store
Next
Instruction

6. Evolution of Instruction Sets
Single Accumulator (EDSAC 1950)
Accumulator + Index Registers
(Manchester Mark I, IBM 700 series 1953)
Separation of Programming Model
from Implementation
High-level Language Based
Concept of a Family
(B )
(IBM )
General Purpose Register Machines
Complex Instruction Sets
Load/Store Architecture
(CDC 6600, Cray )
(Vax, Intel )
RISC
(Mips,Sparc,HP-PA,IBM RS6000,PowerPC )
LIW/”EPIC”?
(IA )

7. Classifying Instruction Set Architectures
Accumulator (1 register):
1 address add A acc acc + mem[A]
1+x address addx A acc acc + mem[A + x]
Stack:
0 address add tos tos + next
General Purpose Register:
2 address add A B EA(A) EA(A) + EA(B)
3 address add A B C EA(A) EA(B) + EA(C)
Load/Store:
3 address add Ra Rb Rc Ra Rb + Rc
load Ra Rb Ra mem[Rb]
store Ra Rb mem[Rb] Ra
Comparison:
Bytes per instruction?
Number of Instructions?
Cycles per instruction?
Invented index register
Reverse polish stack = HP calculator
GPR = last 20 years
L/S variant = last 10 years

8. Comparing Number of Instructions
Code sequence for C = A + B for four classes of instruction sets:
Stack
Accumulator
Register
(register-memory)
(load-store)
Push A
Load A
Load R1,A
Push B
Add B
Add R1,B
Load R2,B
Add
Store C
Store C, R1
Add R3,R1,R2
Pop C
Store C,R3

9. General Purpose Registers Dominate
all machines use general purpose registers
Advantages of registers
registers are faster than memory
registers are easier for a compiler to use -
e.g., (A*B) -(C*D)-(E*F) can do multiplies in any order
vs. stack
registers can hold variables -
memory traffic is reduced, so program is sped up
(since registers are faster than memory) -
code density improves (since register named with fewer bits
than memory location)

10. Memory Addressing
Since 1980 almost every machine uses addresses to level of 8-bits
(byte)
2 questions for design of ISA:
Since could read a 32-bit word as four loads of bytes from
sequential byte addresses or as one load word from a single byte
address, how do byte addresses map onto words?
Can a word be placed on any byte boundary?

11. Addressing Objects: Endianess and Alignment
Big Endian: address of most significant
IBM 360/370, Motorola 68k, MIPS, Sparc, HP PA
Little Endian: address of least significant
Intel 80x86, DEC Vax, DEC Alpha (Windows NT)
little endian byte 0
msb
lsb
Aligned
big endian byte 0
Alignment: require that objects fall on address that is multiple of their size.
Not
Aligned

12. Addressing Modes Why Auto-increment/decrement? Scaled? Addressing mode
Example
Meaning
Register
Add R4,R3 R4 
R4+R3
Immediate
Add R4,#3 R4 
R4+3
Displacement
Add R4,100(R1) R4 
R4+Mem[100+R1]
Register indirect
Add R4,(R1) R4 
R4+Mem[R1]
Indexed / Base
Add R3,(R1+R2) R3 
R3+Mem[R1+R2]
Autoinc/dec change source register!
Why auto inc/dec
Why reverse order of inc/dec?
Scaled multiples by d, a small constant
Why? Hint: byte addressing
Direct or absolute
Add R1,(1001) R1 
R1+Mem[1001]
Memory indirect
Add R1 
R1+Mem[Mem[R3]]
Auto-increment
Add R1,(R2)+ R1 
R1+Mem[R2]; R2 
R2+d
Auto-decrement
Add R1,-(R2) R2 
R2-d; R1 
R1+Mem[R2]
Scaled
Add R1,100(R2)[R3] R1 
R1+Mem[100+R2+R3*d]
Why Auto-increment/decrement? Scaled?

13. Addressing Mode Usage? (ignore register mode)
SPEC89 3 programs
--- Displacement: 42% avg, 32% to 55% 75%
--- Immediate: 33% avg, 17% to 43% %
--- Register deferred (indirect): 13% avg, 3% to 24%
--- Scaled: 7% avg, 0% to 16%
--- Memory indirect: 3% avg, 1% to 6%
--- Misc: 2% avg, 0% to 3%
75% displacement & immediate
88% displacement, immediate & register indirect

14. Displacement Address Size?
Address Bits
Avg. of 5 SPECint92 programs v. avg. 5 SPECfp92 programs 3 4
X-axis is in powers of 2: 4 => addresses > 2
(8) and  2
(16)
1% of addresses > 16-bits
bits of displacement needed

15. Immediate Size? 50% to 60% fit within 8 bits

16. Operations in the Instruction Set
Data Movement
Load (from memory)
Store (to memory)
memory-to-memory move
register-to-register move
input (from I/O device)
output (to I/O device)
push, pop (to/from stack)
Arithmetic
integer (binary + decimal) or FP
Add, Subtract, Multiply, Divide
Shift
shift left/right, rotate left/right
Logical
not, and, or, set, clear
Control (Jump/Branch)
unconditional, conditional
Subroutine Linkage
call, return
Interrupt
trap, return
Synchronization
test & set (atomic r-m-w)
String
search, translate
Graphics (MMX)
parallel subword ops (4 16bit add)

17. Top 10 80x86 Instructions

18. Methods of Testing Condition
Condition Codes
Processor status bits are set as a side-effect of arithmetic instructions (possibly on Moves) or explicitly by compare or test instructions. ex: add r1, r2, r bz label
Condition Register
Ex: cmp r1, r2, r3
bgt r1, label
Compare and Branch
Ex: bgt r1, r2, label

19. Conditional Branch Distance

20. Conditional Branch Addressing
PC-relative since most branches to
the current PC address
At least 8 bits suggested (128 instructions)
Compare Equal/Not Equal most important for integer programs (86%)

21. Data Types
Bit: 0, 1
Bit String: sequence of bits of a particular length
4 bits is a nibble
8 bits is a byte
16 bits is a half-word
32 bits is a word
64 bits is a double-word
Character:
ASCII 7 bit code
Decimal:
digits 0-9 encoded as 0000b thru 1001b
two decimal digits packed per 8 bit byte
Integers:
2's Complement
Floating Point:
Single Precision
Double Precision
Extended Precision
exponent
How many +/- #'s?
Where is decimal pt?
How are +/- exponents
represented? E
M x R
base
mantissa

22. Operand Size Usage
Support these data sizes and types: 8-bit, 16-bit, 32-bit integers and 32-bit and 64-bit IEEE 754 floating point numbers

23. Generic Examples of Instruction Format Widths
Variable:
Fixed:
Hybrid:

24. Summary of Instruction Formats
If code size is most important, use variable length instructions
If performance is over is most important, use fixed length instructions
Recent embedded machines (ARM, MIPS) added optional mode to execute subset of 16-bit wide instructions (Thumb, MIPS16); per procedure decide performance or density

25. Compilers and Instruction Set Architectures
Ease of compilation
orthogonality: no special registers, few special cases, all operand modes available with any data type or instruction type
completeness: support for a wide range of operations and target applications
regularity: no overloading for the meanings of instruction fields
streamlined: resource needs easily determined
Register Assignment is critical too
Easier if lots of registers

26. Summary of Compiler Considerations
Provide at least 16 general purpose registers plus separate floating-point registers,
Be sure all addressing modes apply to all
data transfer instructions,
Aim for a minimalist instruction set.

27. A "Typical" RISC 32-bit fixed format instruction (3 formats)
32 32-bit GPR (R0 contains zero, DP take pair)
3-address, reg-reg arithmetic instruction
Single address mode for load/store: base + displacement
no indirection
Simple branch conditions
Delayed branch
see: SPARC, MIPS, HP PA-Risc, DEC Alpha, IBM PowerPC,
CDC 6600, CDC 7600, Cray-1, Cray-2, Cray-3

28. DLX Architecture Simple load-store architecture
Based on observations about instruction set architecture
Emphasizes:
Simple load-store instruction set
Design for pipeline efficiency
Design for compiler target
DLX registers
32 32-bit GPRS named R0, R1, ..., R31
32 32-bit FPRs named F0, F2, ..., F30
Accessed independently for 32-bit data
Accessed in pairs for 64-bit (double-precision) data
R0 is always 0
Other status registers, e.g., floating-point status register
Byte addressable in big-endian with 32-bit address

29. DLX Addressing Modes All instructions 32 bits wide Register (direct)op rs rt rd
register
Immediate op rs rt
immed
Base+index op rs rt
immed
Memory
register +
PC-relative op rs rt
immed
Memory PC +

30. DLX Instruction Format
R-type instruction 31 26 25 21 20 16 15 11 10 Op
rs1
rs2 rd
func
I-type instruction 31 26 25 21 20 16 15
immediate Op
rs1 rd
J-type instruction 31 26 25 Op
Offset added to PC

31. DLX Operation Overview
Data transfers
LB,LBU,SB, LH,LHU,SH, LW,SW
LF,LD,SF,SD
MOVI2S,MOVS2I, MOVF,MOVD, MOVFP2I,MOVI2FP
Arithmetic logical
ADD, ADDI, ADDU, ADDUI,SUB,SUBI, SUBU,SUBUI, MULT,MULTU,DIV,DIVU
AND,ANDI, OR, ORI, XOR,XORI
LHI
SLL,SRL,SRA,SLLI,SRLI,SRAI
S__, S__I => “__” may be LT,GT,LE,GE,EQ,NE
Control
BEQZ,BNEZ, BFPT,BFPF
J,JR, TRAP, RFE
Floating point
ADDD,ADDF,SUBD,SUBF,MULTD,MULTF,DIVD,DIVF
CVTF2D,CVTF2I,CVTD2F,CTD2I,CVTI2F,CVTI2D
__D,__F => “__” may be LT,GT,LE,GE,EQ,NE

32. Examples of DLX load and store instructions
Instruction Example Meaning
load word LW R1, 30(R2) R1 =32 Mem[30+R2]
load word LW R1, 1000(R0) R1 =32 Mem[1000+0]
load byte LB R1, 40(R3) R1 =32 (Mem[40+R3]0)24 ## Mem[40+R3]
load byte unsigned LBU R1, 40(R3) R1 = ## Mem[40+R3]
load half word LH R1, 40(R3) R1 =32 (Mem[40+R3]0)16 ## Mem[40+R3]
## Mem[41+R3]
load float LF F0, 50(R3) F0 =32 Mem[50+R3]
load double LD F0, 50(R3) F0 ## F1 =64 Mem[50+R3]
store word SW 500(R4), R Mem[500+R4] =32 R3
store float SF 40(R3), F Mem[40+R3] =32 F0
store double SD 40(R3), F Mem[40+R3] =32 F0; Mem[44+R3] =32 F1
store half SH 502(R2), R Mem[502+R2] =16 R
store byte SB 41(R3), R Mem[41+R3] =8 R

33. Examples of DLX arithmetic/logical instructions
Instruction Example Meaning
add ADD R1,R2,R R1 = R2 + R3
add immediate ADDI R1,R2,# R1 = R2 + 3
load high immediate LHI R1,# R1 = 42##016
shift left logical immediate SLLI R1,R2,# R1 = R2 << 5
set less than SLT R1,R2,R if (R2<R3) R1 = 1
else R1 = 0

34. Examples of control-flow instructions
Instruction Example Meaning
jump J name PC = name;
( (PC+4)-225) <= name < ( (PC+4)+225)
jump and link JAL name R31 = PC+4; PC = name;
jump and link JALR R R31 = PC+4; PC = R2;
register
jump register JR R PC = R3
branch equal zero BEQZ R4, name if (R4 == 0) PC = name;
( (PC+4)-215) <= name < ( (PC+4)+215)
branch not equal BNEZ R4, name if (R4 != 0) PC = name;
zero ( (PC+4)-215) <= name < ( (PC+4)+215)

35. Summary, #1 Classifying Instruction Set Architectures
Accumulator (1 register):1 address
Stack:0 address
General Purpose Register:2 address, 3 address
Load/Store: 3 address
General Purpose Registers Dorminate
Data Addressing modes that are important:
Displacement, Immediate, Register Indirect
Displacement size should be 12 to 16 bits
Immediate size should be 8 to 16 bits

36. Summary, #2 Operations in the Instruction Set :
Data Movement, Arithmetic, Shift, Logical, Control
subroutine linkage, interrupt
synchronization, string, graphics(MMX)
Methods of Testing Condition
condition codes
condition register
compare and branch

37. Summary, #3 DLX Architecture Simple load-store architecture
DLX registers
32 32-bit GPRS named R0, R1, ..., R31
32 32-bit FPRs named F0, F2, ..., F30
Byte addressable in big-endian with 32-bit address