DOC PREVIEW
Berkeley COMPSCI 61C - Lecture 14 MIPS Instruction Representation II

This preview shows page 1-2-23-24 out of 24 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 24 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 24 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 24 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 24 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 24 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

inst.eecs.berkeley.edu/~cs61c !UCB CS61C : Machine Structures Lecture 14 MIPS Instruction Representation II 2010-02-22 High school students have sued a HS near Philly for spying on them using their school-issued Apple laptops. The school said the “security” feature was to curb a rash of stolen laptops, but other students noticed the webcam light going on and off. Scary stuff! Lecturer SOE Dan Garcia thelede.blogs.nytimes.com/2010/02/19/school-accused-of-using-webcam-to-photograph-student-at-home/CS61C L14 : MIPS Instruction Representation II (2) Garcia, Spring 2010 © UCB Review  Simplifying MIPS: Define instructions to be same size as data word (one word) so that they can use the same memory (compiler can use lw and sw).  Computer actually stores programs as a series of these 32-bit numbers.  MIPS Machine Language Instruction: 32 bits representing a single instruction opcode" rs" rt" immediate"opcode" rs" rt" rd" funct"shamt"R"I"CS61C L14 : MIPS Instruction Representation II (3) Garcia, Spring 2010 © UCB  Problem 0: Unsigned # sign-extended?  addiu, sltiu, sign-extends immediates to 32 bits. Thus, # is a “signed” integer.  Rationale  addiu so that can add w/out overflow  See K&R pp. 230, 305  sltiu suffers so that we can have easy HW  Does this mean we’ll get wrong answers?  Nope, it means assembler has to handle any unsigned immediate 215 ≤ n < 216 (I.e., with a 1 in the 15th bit and 0s in the upper 2 bytes) as it does for numbers that are too large. ⇒"I-Format Problems (0/3)CS61C L14 : MIPS Instruction Representation II (4) Garcia, Spring 2010 © UCB  Problem:  Chances are that addi, lw, sw and slti will use immediates small enough to fit in the immediate field.  …but what if it’s too big?  We need a way to deal with a 32-bit immediate in any I-format instruction. I-Format Problem (1/3)CS61C L14 : MIPS Instruction Representation II (5) Garcia, Spring 2010 © UCB  Solution to Problem:  Handle it in software + new instruction  Don’t change the current instructions: instead, add a new instruction to help out  New instruction: lui register, immediate  stands for Load Upper Immediate  takes 16-bit immediate and puts these bits in the upper half (high order half) of the register  sets lower half to 0s I-Format Problem (2/3)CS61C L14 : MIPS Instruction Representation II (6) Garcia, Spring 2010 © UCB  Solution to Problem (continued):  So how does lui help us?  Example: addiu $t0,$t0, 0xABABCDCD …becomes lui $at 0xABAB ori $at, $at, 0xCDCD addu $t0,$t0,$at  Now each I-format instruction has only a 16-bit immediate.  Wouldn’t it be nice if the assembler would this for us automatically? (later) I-Format Problems (3/3)CS61C L14 : MIPS Instruction Representation II (7) Garcia, Spring 2010 © UCB Branches: PC-Relative Addressing (1/5)  Use I-Format  opcode specifies beq versus bne  rs and rt specify registers to compare  What can immediate specify?  immediate is only 16 bits  PC (Program Counter) has byte address of current instruction being executed; 32-bit pointer to memory  So immediate cannot specify entire address to branch to. opcode" rs" rt" immediate"CS61C L14 : MIPS Instruction Representation II (8) Garcia, Spring 2010 © UCB  How do we typically use branches?  Answer: if-else, while, for  Loops are generally small: usually up to 50 instructions  Function calls and unconditional jumps are done using jump instructions (j and jal), not the branches.  Conclusion: may want to branch to anywhere in memory, but a branch often changes PC by a small amount Branches: PC-Relative Addressing (2/5)CS61C L14 : MIPS Instruction Representation II (9) Garcia, Spring 2010 © UCB  Solution to branches in a 32-bit instruction: PC-Relative Addressing  Let the 16-bit immediate field be a signed two’s complement integer to be added to the PC if we take the branch.  Now we can branch ± 215 bytes from the PC, which should be enough to cover almost any loop.  Any ideas to further optimize this? Branches: PC-Relative Addressing (3/5)CS61C L14 : MIPS Instruction Representation II (10) Garcia, Spring 2010 © UCB  Note: Instructions are words, so they’re word aligned (byte address is always a multiple of 4, which means it ends with 00 in binary).  So the number of bytes to add to the PC will always be a multiple of 4.  So specify the immediate in words.  Now, we can branch ± 215 words from the PC (or ± 217 bytes), so we can handle loops 4 times as large. Branches: PC-Relative Addressing (4/5)CS61C L14 : MIPS Instruction Representation II (11) Garcia, Spring 2010 © UCB  Branch Calculation:  If we don’t take the branch: PC = PC + 4 = byte address of next instruction  If we do take the branch: PC = (PC + 4) + (immediate * 4)  Observations  Immediate field specifies the number of words to jump, which is simply the number of instructions to jump.  Immediate field can be positive or negative.  Due to hardware, add immediate to (PC+4), not to PC; will be clearer why later in course Branches: PC-Relative Addressing (5/5)CS61C L14 : MIPS Instruction Representation II (12) Garcia, Spring 2010 © UCB  MIPS Code: Loop: beq $9,$0,End addu $8,$8,$10 addiu $9,$9,-1 j Loop End:  beq branch is I-Format: opcode = 4 (look up in table) rs = 9 (first operand) rt = 0 (second operand) immediate = ??? Branch Example (1/3)CS61C L14 : MIPS Instruction Representation II (13) Garcia, Spring 2010 © UCB  MIPS Code: Loop: beq $9,$0,End addu $8,$8,$10 addiu $9,$9,-1 j Loop End:  immediate Field:  Number of instructions to add to (or subtract from) the PC, starting at the instruction following the branch.  In beq case, immediate = 3 Branch Example (2/3)CS61C L14 : MIPS Instruction Representation II (14) Garcia, Spring 2010 © UCB  MIPS Code: Loop: beq $9,$0,End addu $8,$8,$10 addiu $9,$9,-1 j Loop End: 4" 9" 0" 3"decimal representation: binary representation: 000100" 01001" 00000" 0000000000000011"Branch Example (3/3)CS61C L14 : MIPS Instruction Representation II (15) Garcia, Spring 2010 © UCB Questions on PC-addressing  Does the value in branch field change


View Full Document

Berkeley COMPSCI 61C - Lecture 14 MIPS Instruction Representation II

Documents in this Course
SIMD II

SIMD II

8 pages

Midterm

Midterm

7 pages

Lecture 7

Lecture 7

31 pages

Caches

Caches

7 pages

Lecture 9

Lecture 9

24 pages

Lecture 1

Lecture 1

28 pages

Lecture 2

Lecture 2

25 pages

VM II

VM II

4 pages

Midterm

Midterm

10 pages

Load more
Download Lecture 14 MIPS Instruction Representation II
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Lecture 14 MIPS Instruction Representation II and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Lecture 14 MIPS Instruction Representation II 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?