Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 14 MIPS Instruction Representation II 2008-02-25 IBM wants to use “self-assembling”

Slides:



Advertisements
Similar presentations
Goal: Write Programs in Assembly
Advertisements

CS1104 – Computer Organization PART 2: Computer Architecture Lecture 5 MIPS ISA & Assembly Language Programming.
Krste Asanovic & Vladimir Stojanovic
CS 61C L13Introduction to MIPS: Instruction Representation I (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
Chapter 2 Instructions: Language of the Computer Part III.
CS 61C L17Introduction to MIPS: Instruction Representation III (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS2100 Computer Organisation MIPS Part III: Instruction Formats (AY2014/2015) Semester 2.
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 08 MIPS Instruction Representation I Lecturer SOE Dan Garcia
CS61C L10 : MIPS Instruction Representation II (1) Pearce, Summer 2010 © UCB inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 10 MIPS.
CS61C L14 Introduction to MIPS: Instruction Representation II (1) Garcia © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 13 MIPS Instruction Representation I Shanghai Jiaotong University and Lanxiang.
CS 61C L09 Instruction Format (1) A Carle, Summer 2005 © UCB inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #9: MIPS Instruction.
Instruction Representation III (1) Fall 2007 Lecture 11: Disassembly and Pseudo-instructions.
CS61C L14 MIPS Instruction Representation II (1) Garcia, Spring 2007 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
releases HotSpotAtHome
CS61C L13 MIPS Instruction Representation I (1) Garcia, Spring 2007 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS61C L18 Introduction to CPU Design (1) Beamer, Summer 2007 © UCB Scott Beamer, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture.
Instruction Representation II (1) Fall 2007 Lecture 10: Instruction Representation II.
CS 61C L14Introduction to MIPS: Instruction Representation II (1) Garcia, Fall 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
Computer Structure - The Instruction Set (2) Goal: Implement Functions in Assembly  When executing a procedure (function in C) the program must follow.
Chap Instruction Representation Jen-Chang Liu, Spring 2006 Adapted from
CS61C L13 Introduction to MIPS: Instruction Representation I (1) Garcia © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS61C L16 Floating Point II (1) Garcia, Fall 2006 © UCB Search your code!  Google just released new /* Code Search */, which allows you to specify regular.
Lecture 5 Sept 14 Goals: Chapter 2 continued MIPS assembly language instruction formats translating c into MIPS - examples.
Instruction Representation II (1) Fall 2005 Lecture 10: Instruction Representation II.
CS61C L9 MIPS Logical & Shift Ops, and Instruction Representation I (1) Beamer, Summer 2007 © UCB Scott Beamer, Instructor inst.eecs.berkeley.edu/~cs61c.
Instruction Representation I (1) Fall 2005 Lecture 05: INSTRUCTION REPRESENTATION.
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 13 MIPS Instruction Representation I The National Science Foundation (NSF)
CS61C L14 MIPS Instruction Representation II (1) Garcia, Fall 2006 © UCB Intel: 80 cores/chip in 5 yrs!  At their developer’s forum in SF on Tuesday,
ISA-2 CSCE430/830 MIPS: Case Study of Instruction Set Architecture CSCE430/830 Computer Architecture Instructor: Hong Jiang Courtesy of Prof. Yifeng Zhu.
CSCI-365 Computer Organization Lecture Note: Some slides and/or pictures in the following are adapted from: Computer Organization and Design, Patterson.
Topic 10: Instruction Representation CSE 30: Computer Organization and Systems Programming Winter 2011 Prof. Ryan Kastner Dept. of Computer Science and.
Lecture 8. MIPS Instructions #3 – Branch Instructions #1 Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System Education.
Chapter 10 The Assembly Process. What Assemblers Do Translates assembly language into machine code. Assigns addresses to all symbolic labels (variables.
April 23, 2001Systems Architecture I1 Systems Architecture I (CS ) Lecture 9: Assemblers, Linkers, and Loaders * Jeremy R. Johnson Mon. April 23,
Instructor: Justin Hsia 7/03/2013Summer Lecture #71 CS 61C: Great Ideas in Computer Architecture MIPS Instruction Formats.
CS61C L17 MIPS Instruction Format III (1) Spring 2010 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C :
Chapter 2 Decision-Making Instructions (Instructions: Language of the Computer Part V)
Chapter 2 CSF 2009 The MIPS Assembly Language. Stored Program Computers Instructions represented in binary, just like data Instructions and data stored.
CS 61C: Great Ideas in Computer Architecture MIPS Instruction Formats 1 Instructors: John Wawrzynek & Vladimir Stojanovic
CENG 311 Instruction Representation
Chapter 2 — Instructions: Language of the Computer — 1 Memory Operands Main memory used for composite data – Arrays, structures, dynamic data To apply.
Dan Garcia 1 CS 61C: Great Ideas in Computer Architecture MIPS Instruction Representation II.
Lecture 17: 10/31/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
CS 61C: Great Ideas in Computer Architecture MIPS Instruction Formats 1 Instructors: Vladimir Stojanovic and Nicholas Weaver
Instruction Representation. Levels of Representation (abstractions) High Level Language Program (e.g., C) Assembly Language Program (e.g.,MIPS) Machine.
CSCI-365 Computer Organization Lecture Note: Some slides and/or pictures in the following are adapted from: Computer Organization and Design, Patterson.
Instructor: Dr. Mike Turi Department of Computer Science and Computer Engineering Pacific Lutheran University Lecture slides adapted from Part 8, EE 334.
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 08 MIPS Instruction Representation I Guest Lecturer Alan Christopher
Inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 14 – Introduction to MIPS Instruction Representation II Lecturer PSOE.
There is one handout today at the front and back of the room!
IT 251 Computer Organization and Architecture
Rocky K. C. Chang Version 0.1, 14 September 2017
Lecturer PSOE Dan Garcia
IT 251 Computer Organization and Architecture
youtube.com/watch?v=hy0ptZisr70
Lecturer PSOE Dan Garcia
“Full Throttled” TA Brian Nguyen inst.eecs.berkeley.edu/~cs61c-tc
“so many gadgets, so many aches” - NYT
Inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 17 – Introduction to MIPS Instruction Representation III Lecturer PSOE.
MIPS Instruction Encoding
ECE232: Hardware Organization and Design
MIPS Instruction Encoding
Instruction encoding The ISA defines Format = Encoding
The University of Adelaide, School of Computer Science
Part II Instruction-Set Architecture
Instructions and Conditional Execution
CS61C : Machine Structures Lecture 3. 1
Lecturer SOE Dan Garcia
Inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 13 – Introduction to MIPS Instruction Representation I Lecturer PSOE.
Presentation transcript:

inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 14 MIPS Instruction Representation II IBM wants to use “self-assembling” nanotechnology to improve their insulators, using airgaps instead of insulating material at the nanoscale. No more photolithography, which could save $50 million on the cost of fab… Lecturer SOE Dan Garcia

CS61C L14 MIPS Instruction Representation II (2) Garcia, Spring 2008 © 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 opcodersrtimmediate opcodersrtrdfunctshamt R I

CS61C L14 MIPS Instruction Representation II (3) Garcia, Spring 2008 © 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 2 15 ≤ n < 2 16 (I.e., with a 1 in the 15th bit and 0 s 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 2008 © 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 2008 © 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 0 s I-Format Problem (2/3)

CS61C L14 MIPS Instruction Representation II (6) Garcia, Spring 2008 © 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 2008 © 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. opcodersrtimmediate

CS61C L14 MIPS Instruction Representation II (8) Garcia, Spring 2008 © 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 2008 © 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 ± 2 15 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 2008 © 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 ± 2 15 words from the PC (or ± 2 17 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 2008 © 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 2008 © 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 2008 © 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 2008 © UCB  MIPS Code: Loop:beq $9,$0,End addu $8,$8,$10 addiu $9,$9,-1 j Loop End: 4903 decimal representation: binary representation: Branch Example (3/3)

CS61C L14 MIPS Instruction Representation II (15) Garcia, Spring 2008 © UCB Questions on PC-addressing  Does the value in branch field change if we move the code?  What do we do if destination is > 2 15 instructions away from branch?  Why do we need different addressing modes (different ways of forming a memory address)? Why not just one?

CS61C L14 MIPS Instruction Representation II (16) Garcia, Spring 2008 © UCB Administrivia  HW4 due Thu  Project 2 out soon – due next friday

CS61C L14 MIPS Instruction Representation II (17) Garcia, Spring 2008 © UCB Week #MonWedThu LabFri #6 This week MIPS Inst Format II Floating Pt I Floating Pt Floating Pt II (TA Keaton) #7 Next week MIPS Inst Format III Running Program I Running Program Running Program II #8 Midterm week SDS I Midterm Tonight SDS II (Scott Beamer) SDSSDS III (Scott Beamer) Upcoming Calendar

CS61C L14 MIPS Instruction Representation II (18) Garcia, Spring 2008 © UCB  For branches, we assumed that we won’t want to branch too far, so we can specify change in PC.  For general jumps ( j and jal ), we may jump to anywhere in memory.  Ideally, we could specify a 32-bit memory address to jump to.  Unfortunately, we can’t fit both a 6-bit opcode and a 32-bit address into a single 32-bit word, so we compromise. J-Format Instructions (1/5)

CS61C L14 MIPS Instruction Representation II (19) Garcia, Spring 2008 © UCB J-Format Instructions (2/5)  Define two “fields” of these bit widths:  As usual, each field has a name:  Key Concepts  Keep opcode field identical to R-format and I- format for consistency.  Collapse all other fields to make room for large target address. 6 bits26 bits opcodetarget address

CS61C L14 MIPS Instruction Representation II (20) Garcia, Spring 2008 © UCB J-Format Instructions (3/5)  For now, we can specify 26 bits of the 32- bit bit address.  Optimization:  Note that, just like with branches, jumps will only jump to word aligned addresses, so last two bits are always 00 (in binary).  So let’s just take this for granted and not even specify them.

CS61C L14 MIPS Instruction Representation II (21) Garcia, Spring 2008 © UCB  Now specify 28 bits of a 32-bit address  Where do we get the other 4 bits?  By definition, take the 4 highest order bits from the PC.  Technically, this means that we cannot jump to anywhere in memory, but it’s adequate …% of the time, since programs aren’t that long  only if straddle a 256 MB boundary  If we absolutely need to specify a 32-bit address, we can always put it in a register and use the jr instruction. J-Format Instructions (4/5)

CS61C L14 MIPS Instruction Representation II (22) Garcia, Spring 2008 © UCB  Summary:  New PC = { PC[31..28], target address, 00 }  Understand where each part came from!  Note: {,, } means concatenation { 4 bits, 26 bits, 2 bits } = 32 bit address  { 1010, , 00 } =  Note: Book uses || J-Format Instructions (5/5)

CS61C L14 MIPS Instruction Representation II (23) Garcia, Spring 2008 © UCB (for A,B) When combining two C files into one executable, recall we can compile them independently & then merge them together. A. Jump insts don’t require any changes. B. Branch insts don’t require any changes. C. You now have all the tools to be able to “decompile” a stream of 1s and 0s into C! ABC 0: FFF 1: FFT 2: FTF 3: FTT 4: TFF 5: TFT 6: TTF 7: TTT Peer Instruction Question

CS61C L14 MIPS Instruction Representation II (24) Garcia, Spring 2008 © UCB  MIPS Machine Language Instruction: 32 bits representing a single instruction  Branches use PC-relative addressing, Jumps use absolute addressing.  Disassembly is simple and starts by decoding opcode field. (more in a week) opcodersrtimmediate opcodersrtrdfunctshamt R I J target address opcode In conclusion