Chapter 6
Digital Design and Computer Architecture, 2nd Edition
David Money Harris and Sarah L. Harris
Chapter 6 <1>
Review: The Stored Program
Assembly Code Machine Code
lw $t2, 32($0) 0x8C0A0020
add $s0, $s1, $s2 0x02328020
addi $t0, $s3, -12 0x2268FFF4
sub $t0, $t3, $t5 0x016D4022
Stored Program
Address Instructions
0040000C 0 1 6 D 4 0 2 2
00400008 2 2 6 8 F F F 4
00400004 0 2 3 2 8 0 2 0
00400000 8 C0 A0 0 2 0 PC
Main Memory
Chapter 6 <2>
Branching
• Execute instructions out of sequence
• Types of branches:
– Conditional
• branch if equal (beq)
• branch if not equal (bne)
– Unconditional
• jump (j)
• jump register (jr)
• jump and link (jal)
Chapter 6 <3>
Conditional Branching (beq)
# MIPS assembly
addi $s0, $0, 4 # $s0 = 0 + 4 = 4
addi $s1, $0, 1 # $s1 = 0 + 1 = 1
sll $s1, $s1, 2 # $s1 = 1 << 2 = 4
beq $s0, $s1, target # branch is taken
addi $s1, $s1, 1 # not executed
sub $s1, $s1, $s0 # not executed
target: # label
add $s1, $s1, $s0 # $s1 = 4 + 4 = 8
Labels indicate instruction location. They can’t be reserved words and
must be followed by colon (:)
Chapter 6 <4>
The Branch Not Taken (bne)
# MIPS assembly
addi $s0, $0, 4 # $s0 = 0 + 4 = 4
addi $s1, $0, 1 # $s1 = 0 + 1 = 1
sll $s1, $s1, 2 # $s1 = 1 << 2 = 4
bne $s0, $s1, target # branch not taken
addi $s1, $s1, 1 # $s1 = 4 + 1 = 5
sub $s1, $s1, $s0 # $s1 = 5 – 4 = 1
target:
add $s1, $s1, $s0 # $s1 = 1 + 4 = 5
Chapter 6 <5>
Branching
• Execute instructions out of sequence
• Types of branches:
– Conditional
• branch if equal (beq)
• branch if not equal (bne)
– Unconditional
• jump (j)
• jump register (jr)
• jump and link (jal)
Chapter 6 <6>
Unconditional Branching (j)
# MIPS assembly
addi $s0, $0, 4 # $s0 = 4
addi $s1, $0, 1 # $s1 = 1
j target # jump to target
sra $s1, $s1, 2 # not executed
addi $s1, $s1, 1 # not executed
sub $s1, $s1, $s0 # not executed
target:
add $s1, $s1, $s0 # $s1 = 1 + 4 = 5
Chapter 6 <7>
Unconditional Branching (jr)
# MIPS assembly
0x00002000 addi $s0, $0, 0x2010
0x00002004 jr $s0
0x00002008 addi $s1, $0, 1
0x0000200C sra $s1, $s1, 2
0x00002010 lw $s3, 44($s1)
jr is an R-type instruction.
Chapter 6 <8>
High-Level Code Constructs
• if statements
• if/else statements
• while loops
• for loops
Chapter 6 <9>
If Statement
C Code MIPS assembly code
# $s0 = f, $s1 = g, $s2 = h
# $s3 = i, $s4 = j
if (i == j)
f = g + h;
f = f – i;
Chapter 6 <10>
If Statement
C Code MIPS assembly code
# $s0 = f, $s1 = g, $s2 = h
# $s3 = i, $s4 = j
if (i == j) bne $s3, $s4, L1
f = g + h; add $s0, $s1, $s2
f = f – i; L1: sub $s0, $s0, $s3
Assembly tests opposite case (i != j) of high-level code (i == j)
Chapter 6 <11>
If/Else Statement
C Code MIPS assembly code
if (i == j)
f = g + h;
else
f = f – i;
Chapter 6 <12>
If/Else Statement
C Code MIPS assembly code
# $s0 = f, $s1 = g, $s2 = h
# $s3 = i, $s4 = j
if (i == j) bne $s3, $s4, L1
f = g + h; add $s0, $s1, $s2
else j done
f = f – i; L1: sub $s0, $s0, $s3
done:
Chapter 6 <13>
While Loops
C Code MIPS assembly code
// determines the power
// of x such that 2x = 128
int pow = 1;
int x = 0;
while (pow != 128) {
pow = pow * 2;
x = x + 1;
}
Assembly tests for the opposite case (pow == 128) of the C
code (pow != 128).
Chapter 6 <14>
While Loops
C Code MIPS assembly code
// determines the power # $s0 = pow, $s1 = x
// of x such that 2x = 128
int pow = 1; addi $s0, $0, 1
int x = 0; add $s1, $0, $0
addi $t0, $0, 128
while (pow != 128) { while: beq $s0, $t0, done
pow = pow * 2; sll $s0, $s0, 1
x = x + 1; addi $s1, $s1, 1
} j while
done:
Assembly tests for the opposite case (pow == 128) of the C
code (pow != 128).
Chapter 6 <15>
For Loops
for (initialization; condition; loop operation)
statement
• initialization: executes before the loop begins
• condition: is tested at the beginning of each iteration
• loop operation: executes at the end of each iteration
• statement: executes each time the condition is met
Chapter 6 <16>
For Loops
C Code MIPS assembly code
// add the numbers from 0 to 9
int sum = 0;
int i;
for (i=0; i!=10; i = i+1) {
sum = sum + i;
}
Chapter 6 <17>
For Loops
C Code MIPS assembly code
// add the numbers from 0 to 9 # $s0 = i, $s1 = sum
int sum = 0; addi $s1, $0, 0
int i; add $s0, $0, $0
addi $t0, $0, 10
for (i=0; i!=10; i = i+1) { for: beq $s0, $t0, done
sum = sum + i; add $s1, $s1, $s0
} addi $s0, $s0, 1
j for
done:
Chapter 6 <18>
Less Than Comparison
C Code MIPS assembly code
// add the powers of 2 from 1
// to 100
int sum = 0;
int i;
for (i=1; i < 101; i = i*2) {
sum = sum + i;
}
Chapter 6 <19>
Less Than Comparison
C Code MIPS assembly code
// add the powers of 2 from 1 # $s0 = i, $s1 = sum
// to 100 addi $s1, $0, 0
int sum = 0; addi $s0, $0, 1
int i; addi $t0, $0, 101
loop: slt $t1, $s0, $t0
for (i=1; i < 101; i = i*2) { beq $t1, $0, done
sum = sum + i; add $s1, $s1, $s0
} sll $s0, $s0, 1
j loop
done:
$t1 = 1 if i < 101
Chapter 6 <20>
