CS61C L13 Introduction to MIPS: Instruction Representation I (1) Garcia © UCB Lecturer PSOE Dan Garcia www.cs.berkeley.edu/~ddgarcia inst.eecs.berkeley.edu/~cs61c.

Slides:



Advertisements
Similar presentations
1 Lecture 3: MIPS Instruction Set Today’s topic:  More MIPS instructions  Procedure call/return Reminder: Assignment 1 is on the class web-page (due.
Advertisements

Goal: Write Programs in Assembly
Lecture 5: MIPS Instruction Set
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.
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.
CS61C L14 MIPS Instruction Representation II (1) Garcia, Spring 2007 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS61C L13 MIPS Instruction Representation I (1) Garcia, Spring 2007 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
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.
Chap Instruction Representation Jen-Chang Liu, Spring 2006 Adapted from
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.
CS61C L9 MIPS Proc II, Logical & Shift Ops, and Instruction Representation I (1) Chae, Summer 2008 © UCB Albert Chae, 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)
CS 300 – Lecture 6 Intro to Computer Architecture / Assembly Language Instructions.
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,
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 14 MIPS Instruction Representation II IBM wants to use “self-assembling”
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.
CS 61C: Great Ideas in Computer Architecture Lecture 7: MIPS Instruction Formats Instructor: Sagar Karandikar
Lecture Objectives: 1)Define the terms least significant bit and most significant bit. 2)Explain how unsigned integer numbers are represented in memory.
1 CS/COE0447 Computer Organization & Assembly Language Chapter 2 Part 1 In-Class Lab Session (Lab 2)
Instructor: Justin Hsia 7/03/2013Summer Lecture #71 CS 61C: Great Ideas in Computer Architecture MIPS Instruction Formats.
Lecture 4: MIPS Instruction Set
IFT 201: Unit 1 Lecture 1.3: Processor Architecture-3
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /08/2013 Lecture 10: MIPS Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE CENTRAL STATE.
CS 61C: Great Ideas in Computer Architecture MIPS Instruction Formats 1 Instructors: John Wawrzynek & Vladimir Stojanovic
CENG 311 Instruction Representation
EET 4250 Instruction Representation & Formats Acknowledgements: Some slides and lecture notes for this course adapted from Prof. Mary Jane Penn.
Chapter 2 — Instructions: Language of the Computer — 1 Memory Operands Main memory used for composite data – Arrays, structures, dynamic data To apply.
DR. SIMING LIU SPRING 2016 COMPUTER SCIENCE AND ENGINEERING UNIVERSITY OF NEVADA, RENO Session 9 Binary Representation and Logical Operations.
CS 61C: Great Ideas in Computer Architecture MIPS Functions, Instruction Formats 1 Instructors: Vladimir Stojanovic and Nicholas Weaver
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
CS 110 Computer Architecture Lecture 6: MIPS Instruction Formats Instructor: Sören Schwertfeger School of Information Science.
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.
COMPUTER ARCHITECTURE & OPERATIONS I
IT 251 Computer Organization and Architecture
Rocky K. C. Chang Version 0.1, 14 September 2017
MIPS Coding Continued.
Lecture 4: MIPS Instruction Set
Lecturer PSOE Dan Garcia
IT 251 Computer Organization and Architecture
Lecturer PSOE Dan Garcia
Lecture 4: MIPS Instruction Set
“so many gadgets, so many aches” - NYT
Computer Architecture & Operations I
MIPS Instruction Encoding
ECE232: Hardware Organization and Design
There is one handout today at the front and back of the room!
MIPS Instruction Encoding
Instructions and Conditional Execution
CS61C : Machine Structures Lecture 3. 1
Lecturer SOE Dan Garcia
Instructions in Machine Language
MIPS Coding Continued.
Inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 13 – Introduction to MIPS Instruction Representation I Lecturer PSOE.
Presentation transcript:

CS61C L13 Introduction to MIPS: Instruction Representation I (1) Garcia © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 13 – Introduction to MIPS Instruction Representation I Anyone seen Terminator?   Military wants robot soldiers. Let’s see, they get to grow their budgets, and they intent to (years from now) use Berkeley’s smart dust. Be very afraid.

CS61C L13 Introduction to MIPS: Instruction Representation I (2) Garcia © UCB Overview – Instruction Representation Big idea: stored program consequences of stored program Instructions as numbers Instruction encoding MIPS instruction format for Add instructions MIPS instruction format for Immediate, Data transfer instructions

CS61C L13 Introduction to MIPS: Instruction Representation I (3) Garcia © UCB Big Idea: Stored-Program Concept Computers built on 2 key principles: 1) Instructions are represented as numbers. 2) Therefore, entire programs can be stored in memory to be read or written just like numbers (data). Simplifies SW/HW of computer systems: Memory technology for data also used for programs

CS61C L13 Introduction to MIPS: Instruction Representation I (4) Garcia © UCB Consequence #1: Everything Addressed Since all instructions and data are stored in memory as numbers, everything has a memory address: instructions, data words both branches and jumps use these C pointers are just memory addresses: they can point to anything in memory Unconstrained use of addresses can lead to nasty bugs; up to you in C; limits in Java One register keeps address of instruction being executed: “Program Counter” (PC) Basically a pointer to memory: Intel calls it Instruction Address Pointer, a better name

CS61C L13 Introduction to MIPS: Instruction Representation I (5) Garcia © UCB Consequence #2: Binary Compatibility Programs are distributed in binary form Programs bound to specific instruction set Different version for Macintoshes and PCs New machines want to run old programs (“binaries”) as well as programs compiled to new instructions Leads to instruction set evolving over time Selection of Intel 8086 in 1981 for 1st IBM PC is major reason latest PCs still use 80x86 instruction set (Pentium 4); could still run program from 1981 PC today

CS61C L13 Introduction to MIPS: Instruction Representation I (6) Garcia © UCB Instructions as Numbers (1/2) Currently all data we work with is in words (32-bit blocks): Each register is a word. lw and sw both access memory one word at a time. So how do we represent instructions? Remember: Computer only understands 1s and 0s, so “ add $t0,$0,$0 ” is meaningless. MIPS wants simplicity: since data is in words, make instructions be words too

CS61C L13 Introduction to MIPS: Instruction Representation I (7) Garcia © UCB Instructions as Numbers (2/2) One word is 32 bits, so divide instruction word into “fields”. Each field tells computer something about instruction. We could define different fields for each instruction, but MIPS is based on simplicity, so define 3 basic types of instruction formats: R-format I-format J-format

CS61C L13 Introduction to MIPS: Instruction Representation I (8) Garcia © UCB Instruction Formats I-format: used for instructions with immediates, lw and sw (since the offset counts as an immediate), and the branches ( beq and bne ), (but not the shift instructions; later) J-format: used for j and jal R-format: used for all other instructions It will soon become clear why the instructions have been partitioned in this way.

CS61C L13 Introduction to MIPS: Instruction Representation I (9) Garcia © UCB R-Format Instructions (1/5) Define “fields” of the following number of bits each: = opcodersrtrdfunctshamt For simplicity, each field has a name: Important: On these slides and in book, each field is viewed as a 5- or 6- bit unsigned integer, not as part of a 32-bit integer. Consequence: 5-bit fields can represent any number 0-31, while 6-bit fields can represent any number 0-63.

CS61C L13 Introduction to MIPS: Instruction Representation I (10) Garcia © UCB R-Format Instructions (2/5) What do these field integer values tell us? opcode : partially specifies what instruction it is -Note: This number is equal to 0 for all R-Format instructions. funct : combined with opcode, this number exactly specifies the instruction Question: Why aren’t opcode and funct a single 12-bit field? -Answer: We’ll answer this later.

CS61C L13 Introduction to MIPS: Instruction Representation I (11) Garcia © UCB R-Format Instructions (3/5) More fields: rs (Source Register): generally used to specify register containing first operand rt (Target Register): generally used to specify register containing second operand (note that name is misleading) rd (Destination Register): generally used to specify register which will receive result of computation

CS61C L13 Introduction to MIPS: Instruction Representation I (12) Garcia © UCB R-Format Instructions (4/5) Notes about register fields: Each register field is exactly 5 bits, which means that it can specify any unsigned integer in the range Each of these fields specifies one of the 32 registers by number. The word “generally” was used because there are exceptions that we’ll see later. E.g., -mult and div have nothing important in the rd field since the dest registers are hi and lo -mfhi and mflo have nothing important in the rs and rt fields since the source is determined by the instruction (p. 264 P&H)

CS61C L13 Introduction to MIPS: Instruction Representation I (13) Garcia © UCB R-Format Instructions (5/5) Final field: shamt : This field contains the amount a shift instruction will shift by. Shifting a 32-bit word by more than 31 is useless, so this field is only 5 bits (so it can represent the numbers 0-31). This field is set to 0 in all but the shift instructions. For a detailed description of field usage for each instruction, see green insert in COD 3/e (You can bring with you to all exams)

CS61C L13 Introduction to MIPS: Instruction Representation I (14) Garcia © UCB R-Format Example (1/2) MIPS Instruction: add $8,$9,$10 opcode = 0 (look up in table in book) funct = 32 (look up in table in book) rd = 8 (destination) rs = 9 (first operand) rt = 10 (second operand) shamt = 0 (not a shift)

CS61C L13 Introduction to MIPS: Instruction Representation I (15) Garcia © UCB R-Format Example (2/2) MIPS Instruction: add $8,$9,$ Binary number per field representation: Called a Machine Language Instruction Decimal number per field representation: hex representation: 012A 4020 hex decimal representation: 19,546,144 ten hex

CS61C L13 Introduction to MIPS: Instruction Representation I (16) Garcia © UCB Administrivia Project 1 due Friday Homework 4 online soon Andy is the TA in charge It’s only book exercises Dan’s OH cancelled next week He’ll be presenting at SIGCSE

CS61C L13 Introduction to MIPS: Instruction Representation I (17) Garcia © UCB I-Format Instructions (1/4) What about instructions with immediates? 5-bit field only represents numbers up to the value 31: immediates may be much larger than this Ideally, MIPS would have only one instruction format (for simplicity): unfortunately, we need to compromise Define new instruction format that is partially consistent with R-format: First notice that, if instruction has immediate, then it uses at most 2 registers.

CS61C L13 Introduction to MIPS: Instruction Representation I (18) Garcia © UCB I-Format Instructions (2/4) Define “fields” of the following number of bits each: = 32 bits opcodersrtimmediate Again, each field has a name: Key Concept: Only one field is inconsistent with R-format. Most importantly, opcode is still in same location.

CS61C L13 Introduction to MIPS: Instruction Representation I (19) Garcia © UCB I-Format Instructions (3/4) What do these fields mean? opcode : same as before except that, since there’s no funct field, opcode uniquely specifies an instruction in I-format This also answers question of why R-format has two 6-bit fields to identify instruction instead of a single 12-bit field: in order to be consistent with other formats. rs : specifies the only register operand (if there is one) rt : specifies register which will receive result of computation (this is why it’s called the target register “rt”)

CS61C L13 Introduction to MIPS: Instruction Representation I (20) Garcia © UCB I-Format Instructions (4/4) The Immediate Field: addi, slti, sltiu, the immediate is sign-extended to 32 bits. Thus, it’s treated as a signed integer. 16 bits  can be used to represent immediate up to 2 16 different values This is large enough to handle the offset in a typical lw or sw, plus a vast majority of values that will be used in the slti instruction. We’ll see what to do when the number is too big in our next lecture…

CS61C L13 Introduction to MIPS: Instruction Representation I (21) Garcia © UCB I-Format Example (1/2) MIPS Instruction: addi $21,$22,-50 opcode = 8 (look up in table in book) rs = 22 (register containing operand) rt = 21 (target register) immediate = -50 (by default, this is decimal)

CS61C L13 Introduction to MIPS: Instruction Representation I (22) Garcia © UCB I-Format Example (2/2) MIPS Instruction: addi $21,$22, Decimal/field representation: Binary/field representation: hexadecimal representation: 22D5 FFCE hex decimal representation: 584,449,998 ten

CS61C L13 Introduction to MIPS: Instruction Representation I (23) Garcia © UCB Peer Instruction Which instruction has same representation as 35 ten ? 1. add $0, $0, $0 2. subu $s0,$s0,$s0 3. lw $0, 0($0) 4. addi $0, $0, subu $0, $0, $0 6. Trick question! Instructions are not numbers Registers numbers and names: 0: $0,.. 8: $t0, 9:$t1,..15: $t7, 16: $s0, 17: $s1,.. 23: $s7 Opcodes and function fields (if necessary) add : opcode = 0, funct = 32 subu : opcode = 0, funct = 35 addi : opcode = 8 lw : opcode = 35 opcodersrtoffset rdfunctshamt opcodersrt opcodersrtimmediate rdfunctshamt opcodersrt rdfunctshamt opcodersrt

CS61C L13 Introduction to MIPS: Instruction Representation I (24) Garcia © UCB Peer Instruction Answer Which instruction bit pattern = number 35? 1. add $0, $0, $0 2. subu $s0,$s0,$s0 3. lw $0, 0($0) 4. addi $0, $0, subu $0, $0, $0 6. Trick question! Instructions != numbers Registers numbers and names: 0: $0, …, 8: $t0, 9:$t1, …,16: $s0, 17: $s1, …, Opcodes and function fields add : opcode = 0, function field = 32 subu : opcode = 0, function field = 35 addi : opcode = 8 lw : opcode =

CS61C L13 Introduction to MIPS: Instruction Representation I (25) Garcia © UCB In conclusion… 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 J target address opcode