1 / 23

CPS3340 Computer Architecture Fall Semester, 2013

Lecture 11: MIPS- Conditional Instructions Instructor: Ashraf Yaseen. CPS3340 Computer Architecture Fall Semester, 2013. Department of Math & Computer Science Central State University, Wilberforce, OH. 10/15/2013. Review. Last Class Binary Integers Unsigned, Signed, Signed Extension

idra
Download Presentation

CPS3340 Computer Architecture Fall Semester, 2013

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 11: MIPS-Conditional Instructions • Instructor: Ashraf Yaseen CPS3340 Computer ArchitectureFall Semester, 2013 Department of Math & Computer Science Central State University, Wilberforce, OH 10/15/2013

  2. Review • Last Class • Binary Integers • Unsigned, Signed, Signed Extension • Representation of MIPS Instructions • R-format • I-format • This Class • Conditional Instructions • slt • Branch Addressing • Next Class • Procedure

  3. Instructions for Making Decisions • High-level programming language C/C++: if … else … (conditional) goto (unconditional) for, while, until (loops) • Assembly Languages MIPS: beq (branch if equal) bne (branch if not equal) j (unconditional jump)

  4. Conditional Operations • Branch to a labeled instruction if a condition is true • Otherwise, continue sequentially • beq rs, rt, L1 • if (rs == rt) branch to instruction labeled L1; • bne rs, rt, L1 • if (rs != rt) branch to instruction labeled L1; • j L1 • unconditional jump to instruction labeled L1

  5. Compiling If Statements • C code: if (i==j) f = g+h;else f = g-h;

  6. Compiling If Statements • C code: if (i==j) f = g+h;else f = g-h; • f ($s0), g ($s1), h($s2), i($s3), j($s4) • Compiled MIPS code: bne $s3, $s4, Else add $s0, $s1, $s2 j ExitElse: sub $s0, $s1, $s2Exit: … Assembler calculates addresses

  7. Compiling Loop Statements • C code: while (save[i] == k) i = i+1; • i in $s3, k in $s5, address of save in $s6 • Flowchart?

  8. Compiling Loop Statements • C code: while (save[i] == k) i = i+1; • i in $s3, k in $s5, address of save in $s6 • Compiled MIPS code: Loop: sll $t1, $s3, 2 add $t1, $t1, $s6 lw $t0, 0($t1) bne $t0, $s5, Exit addi $s3, $s3, 1 j LoopExit: …

  9. Basic Blocks • A basic block is a sequence of instructions with • No embedded branches (except at end) • No branch targets (except at beginning) • A compiler identifies basic blocks for optimization • An advanced processor can accelerate execution of basic blocks

  10. More Conditional Operations • Less than • Greater than • Combination of logical operations

  11. More Conditional Operations • Set result to 1 if a condition is true • Otherwise, set to 0 • slt rd, rs, rt • if (rs < rt) rd = 1; else rd = 0; • slti rt, rs, constant • if (rs < constant) rt = 1; else rt = 0; • Use in combination with beq, bne slt $t0, $s1, $s2 # if ($s1 < $s2)bne $t0, $zero, L # branch to L

  12. Exercise • Convert the following C++ statement into MIPS if (i>j and i<k) { a++; } Assume i in $s0, j in $s1, k in $s2, a in $s3

  13. Exercise if (i>j and i<k) { a++; } Assume i in $s0, j in $s1, k in $s2, a in $s3 slt $t0, $s1, $s0 slt $t1, $s0, $s2 and $t0, $t0, $t1 beq $t0, $zero, L addi $s3, $s3, 1 L: …

  14. Better Solution if (i>j and i<k) { a++; } Assume i in $s0, j in $s1, k in $s2, a in $s3 slt $t0, $s1, $s0 beq $t0, $zero, L slt $t0, $s0, $s2 beq $t0, $zero, L addi $s3, $s3, 1 L: …

  15. Branch Instruction Design • Why not blt, bge, etc? • Hardware for <, ≥, … slower than =, ≠ • Combining with branch involves more work per instruction, requiring a slower clock • All instructions penalized! • beq and bne are the common case • This is a good design compromise

  16. Signed vs. Unsigned • Signed comparison: slt, slti • Unsigned comparison: sltu, sltui • Example • $s0 = 1111 1111 1111 1111 1111 1111 1111 1111 • $s1 = 0000 0000 0000 0000 0000 0000 0000 0001 • slt $t0, $s0, $s1 # signed • –1 < +1  $t0 = 1 • sltu $t0, $s0, $s1 # unsigned • +4,294,967,295 > +1  $t0 = 0

  17. op rs rt constant or address 6 bits 5 bits 5 bits 16 bits Branch Addressing • Branch instructions specify • Opcode, two registers, target address • Most branch targets are near branch • Forward or backward • PC-relative addressing • Target address = PC + offset × 4 • PC already incremented by 4 by this time

  18. op address 26 bits 6 bits Jump Addressing • Jump (j and jal) targets could be anywhere in text segment • Encode full address in instruction • (Pseudo)Direct jump addressing • Target address = PC31…28 : (address × 4)

  19. Target Addressing Example • Loop code from earlier example • Assume Loop at location 80000

  20. Branching Far Away • If branch target is too far to encode with 16-bit offset, assembler rewrites the code • Example beq $s0,$s1, L1 ↓ bne $s0,$s1, L2 j L1L2: …

  21. Addressing Mode Summary

  22. Summary • Conditional Instructions • beq • bne • j • slt, slti • sltu, sltui • Converting a C Program to MIPS • Branch Addressing

  23. What I want you to do • Review Chapter 2 • Prepare for assignment 4

More Related