CMPSC 64 Lecture 8: Lecture 7
Document Summary
"j": unconditional jump n = 3; sum = 0; while (n != 0) { sum += n; n--; li , 3 li , 0 beq , , loop_exit addu , , addi , , -1 j loop. 19 li , 1 move , syscall li , 10 syscall. More branching examples int y; if (x == 5) { y = 8; } else if (x < 7) { y = x + x; # initialize our value of x li , 7. # check equality with 5 li , 5 beq , , equal_five. # check if less than 7 li , 7 slt , , bne , , less_than_seven. # fall through to else li , -1 j after_branches. 40 li , 8 j after_branches add , , . # could jump to after_branches, but this is what we will fall. # print out the value li , 1 move , syscall.
