CS61C : Machine Structures
|
|
|
- Eunice Cobb
- 6 years ago
- Views:
Transcription
1 inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 17 Instruction Representation III ! Hello to Sherif Kandel listening from Egypt!!!Lecturer SOE Dan Garcia!!! Handling a mountain of data! Microsoft Live Labs has released a tool to make it easier to interact with massive amounts of data in ways that are powerful, informative and fun. Imagine being able to look at all of wikipedia or flickr and filter/query very easily.! getpivot.com CS61C L17 MIPS Instruction Format III (1)!
2 Review! MIPS Machine Language Instruction: 32 bits representing a single instruction R" opcode" rs" rt" rd" shamt" funct" I! opcode" rs" rt" immediate" J! opcode! target address! Branches use PC-relative addressing, Jumps use absolute addressing.! CS61C L17 MIPS Instruction Format III (2)!
3 Outline! Disassembly! Pseudoinstructions! True Assembly Language (TAL) vs. MIPS Assembly Language (MAL)! CS61C L17 MIPS Instruction Format III (3)!
4 Decoding Machine Language! How do we convert 1s and 0s to assembly language and to C code?! Machine language assembly C?! For each 32 bits:! 1. Look at opcode to distinquish between R- Format, J-Format, and I-Format.! 2. Use instruction format to determine which fields exist.! 3. Write out MIPS assembly code, converting each field to name, register number/name, or decimal/hex number.! 4. Logically convert this MIPS code into valid C code. Always possible? Unique?! CS61C L17 MIPS Instruction Format III (4)!
5 Decoding Example (1/7)! Here are six machine language instructions in hexadecimal:! hex A hex hex hex 20A5FFFF hex hex Let the first instruction be at address 4,194,304 ten (0x hex ).! Next step: convert hex to binary! CS61C L17 MIPS Instruction Format III (5)!
6 Decoding Example (2/7)! R" The six machine language instructions in binary: ! Next step: identify opcode and format 0" rs" rt" rd" shamt" funct" I! 1, 4-62" rs" rt" immediate" J! 2 or 3! target address! CS61C L17 MIPS Instruction Format III (6)!
7 Decoding Example (3/7)! Select the opcode (first 6 bits) Format:! R! R! I! R! I! J! to determine the format: Look at opcode: 0 means R-Format, 2 or 3 mean J-Format, otherwise I-Format.! Next step: separation of fields! CS61C L17 MIPS Instruction Format III (7)!
8 Decoding Example (4/7)! Fields separated based on format/opcode:! Format:! R! R! I! R! I! J! 0" 0" 0" 2" 0" 37" 0" 0" 5" 8" 0" 42" 4" 8" 0" +3" 0" 2" 4" 2" 0" 32" 8" 5" 5" -1" 2" 1,048,577" Next step: translate ( disassemble ) to MIPS assembly instructions! CS61C L17 MIPS Instruction Format III (8)!
9 Decoding Example (5/7)! MIPS Assembly (Part 1):! Address: Assembly instructions:! 0x or $2,$0,$0 0x slt $8,$0,$5 0x beq $8,$0,3 0x c add $2,$2,$4 0x addi $5,$5,-1 0x j 0x100001! Better solution: translate to more meaningful MIPS instructions (fix the branch/jump and add labels, registers)! CS61C L17 MIPS Instruction Format III (9)!
10 Decoding Example (6/7)! MIPS Assembly (Part 2):! or $v0,$0,$0 Loop: slt $t0,$0,$a1 beq $t0,$0,exit add $v0,$v0,$a0 addi $a1,$a1,-1 j Loop Exit: Next step: translate to C code (must be creative!)! CS61C L17 MIPS Instruction Format III (10)!
11 Decoding Example (7/7)! Before Hex: hex A hex hex hex 20A5FFFF hex hex or $v0,$0,$0 Loop: slt $t0,$0,$a1 beq $t0,$0,exit add $v0,$v0,$a0 addi $a1,$a1,-1 j Loop Exit: CS61C L17 MIPS Instruction Format III (11)! After C code (Mapping below)!$v0: product!!!!$a0: multiplicand!!!$a1: multiplier! product = 0; while (multiplier > 0) { product += multiplicand; multiplier -= 1; } Demonstrated Big 61C Idea: Instructions are just numbers, code is treated like data!
12 Administrivia! Midterm is in one week! 7-10pm in 1 Pimintel! Old midterms online (link at top of page)! Lectures and reading materials fair game! Open book!! Review session in! CS61C L17 MIPS Instruction Format III (12)!
13 Review from before: lui! So how does lui help us?! Example:!!!addi $t0,$t0, 0xABABCDCD becomes:! lui ori add $at, 0xABAB $at, $at, 0xCDCD $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?! If number too big, then just automatically replace addi with lui, ori, add! CS61C L17 MIPS Instruction Format III (13)!
14 True Assembly Language (1/3)! Pseudoinstruction: A MIPS instruction that doesnʼt turn directly into a machine language instruction, but into other MIPS instructions! What happens with pseudo-instructions?! Theyʼre broken up by the assembler into several real MIPS instructions.! Some examples follow! CS61C L17 MIPS Instruction Format III (14)!
15 Example Pseudoinstructions! Register Move move reg2,reg1! Expands to:! add reg2,$zero,reg1 Load Immediate! li reg,value If value fits in 16 bits:! addi reg,$zero,value else:! lui reg,upper 16 bits of value ori reg,$zero,lower 16 bits! CS61C L17 MIPS Instruction Format III (15)!
16 Example Pseudoinstructions! Load Address: How do we get the address of an instruction or global variable into a register? la reg,label! Again if value fits in 16 bits:! addi reg,$zero,label_value else:! lui reg,upper 16 bits of value ori reg,$zero,lower 16 bits! CS61C L17 MIPS Instruction Format III (16)!
17 True Assembly Language (2/3)! Problem:! When breaking up a pseudo-instruction, the assembler may need to use an extra register! If it uses any regular register, itʼll overwrite whatever the program has put into it.! Solution:! Reserve a register ($1, called $at for assembler temporary ) that assembler will use to break up pseudo-instructions.! Since the assembler may use this at any time, itʼs not safe to code with it.! CS61C L17 MIPS Instruction Format III (17)!
18 Example Pseudoinstructions! Rotate Right Instruction ror reg, value! Expands to:! srl $at, reg, value sll reg, reg, 32-value or reg, reg, $at No OPeration instruction! nop Expands to instruction = 0 ten,! sll $0, $0, 0! 0! 0! CS61C L17 MIPS Instruction Format III (18)!
19 Example Pseudoinstructions! Wrong operation for operand addu reg,reg,value # should be addiu If value fits in 16 bits, addu is changed to:! addiu reg,reg,value else:! lui $at,upper 16 bits of value ori $at,$at,lower 16 bits addu reg,reg,$at How do we avoid confusion about whether we are talking about MIPS assembler with or without pseudoinstructions?! CS61C L17 MIPS Instruction Format III (19)!
20 True Assembly Language (3/3)! MAL (MIPS Assembly Language): the set of instructions that a programmer may use to code in MIPS; this includes pseudoinstructions! TAL (True Assembly Language): set of instructions that can actually get translated into a single machine language instruction (32-bit binary string)! A program must be converted from MAL into TAL before translation into 1s & 0s.! CS61C L17 MIPS Instruction Format III (20)!
21 Questions on Pseudoinstructions! Question:! How does MIPS assembler / SPIM recognize pseudo-instructions?! Answer:! It looks for officially defined pseudoinstructions, such as ror and move! It looks for special cases where the operand is incorrect for the operation and tries to handle it gracefully! CS61C L17 MIPS Instruction Format III (21)!
22 Rewrite TAL as MAL! TAL:!!!!!or $v0,$0,$0 Loop: slt $t0,$0,$a1 beq $t0,$0,exit add $v0,$v0,$a0 addi $a1,$a1,-1 j Loop Exit:! This time convert to MAL! Itʼs OK for this exercise to make up MAL instructions! CS61C L17 MIPS Instruction Format III (22)!
23 Rewrite TAL as MAL (Answer)! TAL:!!or $v0,$0,$0 MAL:! Loop: slt $t0,$0,$a1 beq $t0,$0,exit add $v0,$v0,$a0 addi $a1,$a1,-1 j Loop Exit:!!!li $v0,0 Loop: ble $a1,$zero,exit add $v0,$v0,$a0 sub $a1,$a1,1 j Loop Exit:! CS61C L17 MIPS Instruction Format III (23)!
24 Peer Instruction! Which of the instructions below are MAL and which are TAL? 1. addi $t0, $t1, 40000! 2. beq $s0, 10, Exit! 12 a) MM b) MT c) TM d) TT CS61C L17 MIPS Instruction Format III (24)!
25 Peer Instruction Answer! Which of the instructions below are MAL and which are TAL? 1. addi $t0, $t1, 40000! 2. beq $s0, 10, Exit! 12 a) MM b) MT c) TM d) TT 40,000 > +32,767 =>lui,ori Beq: both must be registers Exit: if > 2 15, then MAL! CS61C L17 MIPS Instruction Format III (25)!
26 In Conclusion! Disassembly is simple and starts by decoding opcode field.! Be creative, efficient when authoring C! Assembler expands real instruction set (TAL) with pseudoinstructions (MAL)! Only TAL can be converted to raw binary! Assemblerʼs job to do conversion! Assembler uses reserved register $at! MAL makes it much easier to write MIPS! CS61C L17 MIPS Instruction Format III (26)!
UCB CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Instructor Paul Pearce Lecture 12 Instruction Format III and Compilation 2010-07-12 This week UCB will begin mailing genetic testing kits to
Lecture 9: Disassembly
Lecture 9: Disassembly CSE 30: Computer Organization and Systems Programming Winter 2010 Rajesh Gupta / Ryan Kastner Dept. of Computer Science and Engineering University of California, San Diego Instruction
CS61C L12 MIPS Instruction Rep III, Running a Program I (6) Integer mult, div uses hi, lo regs mfhi and mflo copies out.
CS61C L12 MPS nstruction ep, unning a Program (1) inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #12 MPS nstruction ep, unning a Program aka Compiling, Assembling, Linking, Loading (CALL)
CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #12 MIPS Instruction Rep III, Running a Program I aka Compiling, Assembling, Linking, Loading (CALL) 2005-0xA Lecturer PSOE, new dad Dan
Review Reserve exponents, significands: Exponent Significand Object nonzero Denorm anything +/- fl. pt. # /- 255 nonzero NaN
CS61C L11 MPS nstruction ep, unning a Program (1) inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #12 MPS nstruction ep, unning a Program aka Compiling, Assembling, Linking, Loading (CALL)
Review of Last Lecture. CS 61C: Great Ideas in Computer Architecture. MIPS Instruction Representation II. Agenda. Dealing With Large Immediates
CS 61C: Great Ideas in Computer Architecture MIPS Instruction Representation II Guest Lecturer: Justin Hsia 2/11/2013 Spring 2013 Lecture #9 1 Review of Last Lecture Simplifying MIPS: Define instructions
CS61CL : Machine Structures
inst.eecs.berkeley.edu/~cs61c CS61CL : Machine Structures Lecture #4 MIPS I: Registers, Memory, Decisions 2009-06-30! Jeremy Huddleston CS61CL L03 MIPS II: Procedures, Representation (1)! Huddleston, Summer
Final 9am instead of 9:30! Your grade will be ed by autograder! Jeremy Huddleston sb $t1 0($s2)!
inst.eecs.berkeley.edu/~cs61c Review! Administrivia! CS61CL : Machine Structures Lecture #4 MIPS I: Registers, Memory, Decisions Final exam @ 9am instead of 9:30! R-type instructions! Flow Control! add
I-Format Instructions (3/4) Define fields of the following number of bits each: = 32 bits
CS61C L10 MIPS Instruction Representation II (1) inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #10 Instruction Representation II 2007-7-8 Review There are register calling conventions!
CS 61C: Great Ideas in Computer Architecture. MIPS Instruc,on Representa,on II. Dan Garcia
CS 61C: Great Ideas in Computer Architecture MIPS Instruc,on Representa,on II Dan Garcia 1 Review of Last Lecture Simplifying MIPS: Define instruc?ons to be same size as data word (one word) so that they
CS 61C: Great Ideas in Computer Architecture. MIPS Instruction Formats
CS 61C: Great Ideas in Computer Architecture MIPS Instruction Formats Instructor: Justin Hsia 6/27/2012 Summer 2012 Lecture #7 1 Review of Last Lecture New registers: $a0-$a3, $v0-$v1, $ra, $sp Also: $at,
CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 14 Introduction to MIPS Instruction Representation II Lecturer PSOE Dan Garcia www.cs.berkeley.edu/~ddgarcia Are you P2P sharing fans? Two
Review. Lecture 18 Running a Program I aka Compiling, Assembling, Linking, Loading
CS61C L18 Running a Program I (1) inst.eecs.berkeley.edu/~cs61c UC Berkeley CS61C : Machine Structures Lecture 18 Running a Program I aka Compiling, Assembling, Linking, Loading 2006-10-09 Lecturer SOE
CS 61c: Great Ideas in Computer Architecture
MIPS Instruction Formats July 2, 2014 Review New registers: $a0-$a3, $v0-$v1, $ra, $sp New instructions: slt, la, li, jal, jr Saved registers: $s0-$s7, $sp, $ra Volatile registers: $t0-$t9, $v0-$v1, $a0-$a3
CS61C - Machine Structures. Lecture 6 - Instruction Representation. September 15, 2000 David Patterson.
CS61C - Machine Structures Lecture 6 - Instruction Representation September 15, 2000 David Patterson http://www-inst.eecs.berkeley.edu/~cs61c/ 1 Review Instructions: add, addi, sub, lw, sw beq, bne, j
UC Berkeley CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c UC Berkeley CS61C : Machine Structures Lecture 18 Running a Program I aka Compiling, Assembling, Linking, Loading Berkeley beat-down #10 Cal bears ate the OU ducks 45-24.
CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 14 Introduction to MIPS Instruction Representation II 2004-02-23 Lecturer PSOE Dan Garcia www.cs.berkeley.edu/~ddgarcia In the US, who is
Outline. Homework. Assembly Language. Instructions. Instruction Set Architectures. Csci 136 Computer Architecture II MIPS Instruction Set Architecture
Outline Csci 136 Computer Architecture II MIPS Instruction Set Architecture Xiuzhen Cheng cheng@gwu.edu Variables vs. Registers MIPS Instruction Set MIPS Addressing Modes MIPS Instruction Format R-Type
Computer Science 61C Spring Friedland and Weaver. Instruction Encoding
Instruction Encoding 1 Instruction Formats I-format: used for instructions with immediates, lw and sw (since offset counts as an immediate), and branches (beq and bne) since branches are "relative" to
UCB CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 18 Running a Program I (Compiling, Assembling, Linking, Loading) Lecturer SOE Dan Garcia 2008-03-04 Researchers at the University of
CS 61C: Great Ideas in Computer Architecture MIPS Instruction Formats
CS 61C: Great Ideas in Computer Architecture MIPS Instruction Formats Instructors: Vladimir Stojanovic and Nicholas Weaver http://inst.eecs.berkeley.edu/~cs61c/sp16 1 Machine Interpretation Levels of Representation/Interpretation
EEM 486: Computer Architecture. Lecture 2. MIPS Instruction Set Architecture
EEM 486: Computer Architecture Lecture 2 MIPS Instruction Set Architecture EEM 486 Overview Instruction Representation Big idea: stored program consequences of stored program Instructions as numbers Instruction
MIPS Assembly: More about Memory and Instructions CS 64: Computer Organization and Design Logic Lecture #7
MIPS Assembly: More about Memory and Instructions CS 64: Computer Organization and Design Logic Lecture #7 Ziad Matni Dept. of Computer Science, UCSB Lecture Outline Global variables and memory Arrays
EEM 486: Computer Architecture. Lecture 2. MIPS Instruction Set Architecture
EEM 486: Computer Architecture Lecture 2 MIPS Instruction Set Architecture EEM 486 C functions main() { int i,j,k,m;... i = mult(j,k);... m = mult(i,i);... } What information must compiler/programmer keep
CS61C L10 MIPS Instruction Representation II, Floating Point I (6)
CS61C L1 MIPS Instruction Representation II, Floating Point I (1) inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #1 Instruction Representation II, Floating Point I 25-1-3 There is one
Review. Disassembly is simple and starts by decoding opcode field. Lecture #13 Compiling, Assembly, Linking, Loader I
CS61C L13 CALL I (1) inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #13 Compiling, Assembly, Linking, Loader I 2008-7-14 Albert Chae, Instructor Review Disassembly is simple and starts
CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #10 Instruction Representation II, Floating Point I 2005-10-03 Lecturer PSOE, new dad Dan Garcia www.cs.berkeley.edu/~ddgarcia #9 bears
CS 61C: Great Ideas in Computer Architecture MIPS Instruction Formats
CS 61C: Great Ideas in Computer Architecture MIPS Instruction Formats Instructors: Bernhard Boser and Randy H. Katz http://inst.eecs.berkeley.edu/~cs61c/fa16 9/15/16 Fall 2016 - Lecture #7 1 Review: Basic
MIPS Coding Continued
MIPS Coding Continued Exercise 1 Suppose we have three arrays, A, B, C, all of size 10. Now we want to set C[i] = min(a[i], B[i]) for all 0
UCB CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Guest Lecturer Alan Christopher Lecture 08 MIPS Instruction Representation I 2014-02-07 BOINC MORE THAN JUST SETI@HOME BOINC (developed here
COMP MIPS instructions 2 Feb. 8, f = g + h i;
Register names (save, temporary, zero) From what I have said up to now, you will have the impression that you are free to use any of the 32 registers ($0,..., $31) in any instruction. This is not so, however.
CS61C Machine Structures. Lecture 18 - Running a Program I. 3/1/2006 John Wawrzynek. www-inst.eecs.berkeley.edu/~cs61c/
CS61C Machine Structures Lecture 18 - Running a Program I aka Compiling, Assembling, Linking, Loading 3/1/2006 John Wawrzynek (www.cs.berkeley.edu/~johnw) www-inst.eecs.berkeley.edu/~cs61c/ CS 61C L18
COMPSCI 313 S Computer Organization. 7 MIPS Instruction Set
COMPSCI 313 S2 2018 Computer Organization 7 MIPS Instruction Set Agenda & Reading MIPS instruction set MIPS I-format instructions MIPS R-format instructions 2 7.1 MIPS Instruction Set MIPS Instruction
Unsigned Binary Integers
Unsigned Binary Integers Given an n-bit number x x n 1 n 2 1 0 n 12 xn 22 x12 x02 Range: 0 to +2 n 1 Example 2.4 Signed and Unsigned Numbers 0000 0000 0000 0000 0000 0000 0000 1011 2 = 0 + + 1 2 3 + 0
Unsigned Binary Integers
Unsigned Binary Integers Given an n-bit number x x n 1 n 2 1 0 n 12 xn 22 x12 x02 Range: 0 to +2 n 1 Example 2.4 Signed and Unsigned Numbers 0000 0000 0000 0000 0000 0000 0000 1011 2 = 0 + + 1 2 3 + 0
Lecture 4: MIPS Instruction Set
Lecture 4: MIPS Instruction Set No class on Tuesday Today s topic: MIPS instructions Code examples 1 Instruction Set Understanding the language of the hardware is key to understanding the hardware/software
Topic Notes: MIPS Instruction Set Architecture
Computer Science 220 Assembly Language & Comp. Architecture Siena College Fall 2011 Topic Notes: MIPS Instruction Set Architecture vonneumann Architecture Modern computers use the vonneumann architecture.
MIPS Instruc,ons CS 64: Computer Organiza,on and Design Logic Lecture #8
MIPS Instruc,ons CS 64: Computer Organiza,on and Design Logic Lecture #8 Ziad Matni Dept. of Computer Science, UCSB Administra:ve Your midterm exam is next week on Thurs. 2/15 2/8/18 Matni, CS64, Wi18
Instructions: MIPS ISA. Chapter 2 Instructions: Language of the Computer 1
Instructions: MIPS ISA Chapter 2 Instructions: Language of the Computer 1 PH Chapter 2 Pt A Instructions: MIPS ISA Based on Text: Patterson Henessey Publisher: Morgan Kaufmann Edited by Y.K. Malaiya for
Review. Lecture #9 MIPS Logical & Shift Ops, and Instruction Representation I Logical Operators (1/3) Bitwise Operations
CS6C L9 MIPS Logical & Shift Ops, and Instruction Representation I () inst.eecs.berkeley.edu/~cs6c CS6C : Machine Structures Lecture #9 MIPS Logical & Shift Ops, and Instruction Representation I 25-9-28
ECE232: Hardware Organization and Design. Computer Organization - Previously covered
ECE232: Hardware Organization and Design Part 6: MIPS Instructions II http://www.ecs.umass.edu/ece/ece232/ Adapted from Computer Organization and Design, Patterson & Hennessy, UCB Computer Organization
Review 1/2 MIPS assembly language instructions mapped to numbers in 3 formats. CS61C Negative Numbers and Logical Operations R I J.
CS61C Negative Numbers and Logical Operations cs 61C L7 Number.1 Lecture 7 February 10, 1999 Dave Patterson (http.cs.berkeley.edu/~patterson) www-inst.eecs.berkeley.edu/~cs61c/schedule.html Review 1/2
Computer Science and Engineering 331. Midterm Examination #1. Fall Name: Solutions S.S.#:
Computer Science and Engineering 331 Midterm Examination #1 Fall 2000 Name: Solutions S.S.#: 1 41 2 13 3 18 4 28 Total 100 Instructions: This exam contains 4 questions. It is closed book and notes. Calculators
Administrivia. Midterm Exam - You get to bring. What you don t need to bring. Conflicts? DSP accomodations? Head TA
inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 16 Running a Program (Compiling, Assembling, Linking, Loading) Sr Lecturer SOE Dan Garcia Research shows laptops and tablets in class
Lecture 5: Procedure Calls
Lecture 5: Procedure Calls Today s topics: Memory layout, numbers, control instructions Procedure calls 1 Memory Organization The space allocated on stack by a procedure is termed the activation record
Review (1/2) IEEE 754 Floating Point Standard: Kahan pack as much in as could get away with. CS61C - Machine Structures
Review (1/2) CS61C - Machine Structures Lecture 11 - Starting a Program October 4, 2000 David Patterson http://www-inst.eecs.berkeley.edu/~cs61c/ IEEE 754 Floating Point Standard: Kahan pack as much in
Grading: 3 pts each part. If answer is correct but uses more instructions, 1 pt off. Wrong answer 3pts off.
Department of Electrical and Computer Engineering University of Wisconsin Madison ECE 552 Introductions to Computer Architecture Homework #2 (Suggested Solution) 1. (10 points) MIPS and C program translations
Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: MIPS Instruction Set Architecture
Computer Science 324 Computer Architecture Mount Holyoke College Fall 2009 Topic Notes: MIPS Instruction Set Architecture vonneumann Architecture Modern computers use the vonneumann architecture. Idea:
CISC 662 Graduate Computer Architecture. Lecture 4 - ISA MIPS ISA. In a CPU. (vonneumann) Processor Organization
CISC 662 Graduate Computer Architecture Lecture 4 - ISA MIPS ISA Michela Taufer http://www.cis.udel.edu/~taufer/courses Powerpoint Lecture Notes from John Hennessy and David Patterson s: Computer Architecture,
CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 13 Introduction to MIPS Instruction Representation I Lecturer PSOE Dan Garcia www.cs.berkeley.edu/~ddgarcia Anyone seen Terminator? Military
CISC 662 Graduate Computer Architecture. Lecture 4 - ISA
CISC 662 Graduate Computer Architecture Lecture 4 - ISA Michela Taufer http://www.cis.udel.edu/~taufer/courses Powerpoint Lecture Notes from John Hennessy and David Patterson s: Computer Architecture,
ECE 473 Computer Architecture and Organization Project: Design of a Five Stage Pipelined MIPS-like Processor Project Team TWO Objectives
ECE 473 Computer Architecture and Organization Project: Design of a Five Stage Pipelined MIPS-like Processor Due: December 8, 2011 Instructor: Dr. Yifeng Zhu Project Team This is a team project. All teams
CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 13 MIPS Instruction Representation I New 160 Megapixel camera!! The Seitz 6 x 17 panorama camera sells for $36K, and produces a 21,250 x
CSSE232 Computer Architecture. Logic and Decision Opera:ons
CSSE232 Computer Architecture Logic and Decision Opera:ons Class status Reading for today: Sec:ons 2.6-2.7 Due today HW0 Lab 0 status? Outline Logical opera:ons ShiI operators Pseudo instruc:ons Immediates
CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #7 MIPS Decisions 2007-7-5 Scott Beamer, Instructor takes on with www.sfgate.com CS61C L7 MIPS Decisions (1) Review In MIPS Assembly Language:
The plot thickens. Some MIPS instructions you can write cannot be translated to a 32-bit number
The plot thickens Some MIPS instructions you can write cannot be translated to a 32-bit number some reasons why 1) constants are too big 2) relative addresses are too big 3) absolute addresses are outside
CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures $2M 3D camera Lecture 8 MIPS Instruction Representation I Instructor: Miki Lustig 2014-09-17 August 25: The final ISA showdown: Is ARM, x86, or
ECE260: Fundamentals of Computer Engineering
MIPS Instruction Set James Moscola Dept. of Engineering & Computer Science York College of Pennsylvania Based on Computer Organization and Design, 5th Edition by Patterson & Hennessy MIPS Registers MIPS
CS 61C: Great Ideas in Computer Architecture MIPS Instruction Formats
CS 61C: Great Ideas in Computer Architecture MIPS Instruction Formats Instructors: John Wawrzynek & Vladimir Stojanovic http://inst.eecs.berkeley.edu/~cs61c/fa15 1 Machine Interpretation Levels of Representation/Interpretation
Examples of branch instructions
Examples of branch instructions Beq rs,rt,target #go to target if rs = rt Beqz rs, target #go to target if rs = 0 Bne rs,rt,target #go to target if rs!= rt Bltz rs, target #go to target if rs < 0 etc.
ELEC / Computer Architecture and Design Fall 2013 Instruction Set Architecture (Chapter 2)
ELEC 5200-001/6200-001 Computer Architecture and Design Fall 2013 Instruction Set Architecture (Chapter 2) Victor P. Nelson, Professor & Asst. Chair Vishwani D. Agrawal, James J. Danaher Professor Department
ECE260: Fundamentals of Computer Engineering
MIPS Instruction Set James Moscola Dept. of Engineering & Computer Science York College of Pennsylvania Based on Computer Organization and Design, 5th Edition by Patterson & Hennessy MIPS Registers MIPS
CS 110 Computer Architecture MIPS Instruction Formats
CS 110 Computer Architecture MIPS Instruction Formats Instructor: Sören Schwertfeger http://shtech.org/courses/ca/ School of Information Science and Technology SIST ShanghaiTech University Slides based
CS 61c: Great Ideas in Computer Architecture
MIPS Functions July 1, 2014 Review I RISC Design Principles Smaller is faster: 32 registers, fewer instructions Keep it simple: rigid syntax, fixed instruction length MIPS Registers: $s0-$s7,$t0-$t9, $0
CS 61c: Great Ideas in Computer Architecture
C.A.L.L. July 7, 2014 Review Three different instruction formats designed to be as similar as possible, while still handling all instructions: R: opcode rs rt rd shamt funct I: opcode rs rt immediate J:
UCB CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 07 Introduction to MIPS : Decisions II Lecturer SOE Dan Garcia 2011-09-12 Hello to Dr Mauro Sgarzi from Italy!! Researchers at Microsoft
UC Berkeley CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c UC Berkeley CS61C : Machine Structures Lecture 24 Introduction to CPU Design 2007-03-14 CS61C L24 Introduction to CPU Design (1) Lecturer SOE Dan Garcia www.cs.berkeley.edu/~ddgarcia
Introduction to the MIPS. Lecture for CPSC 5155 Edward Bosworth, Ph.D. Computer Science Department Columbus State University
Introduction to the MIPS Lecture for CPSC 5155 Edward Bosworth, Ph.D. Computer Science Department Columbus State University Introduction to the MIPS The Microprocessor without Interlocked Pipeline Stages
Telematics group University of Göttingen, Germany
Computer Science II Part 3 Assembly Language Prof. Dr. Dieter Hogrefe Dr. Xiaoming Fu Kevin Scott, M.A. Telematics group University of Göttingen, Germany Table of Content Introduction MIPS architecture
Midterm. Sticker winners: if you got >= 50 / 67
CSC258 Week 8 Midterm Class average: 4.2 / 67 (6%) Highest mark: 64.5 / 67 Tests will be return in office hours. Make sure your midterm mark is correct on MarkUs Solution posted on the course website.
CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 18 Running a Program I 2004-03-03 Wannabe Lecturer Alexandre Joly inst.eecs.berkeley.edu/~cs61c-te Overview Interpretation vs Translation
The plot thickens. Some MIPS instructions you can write cannot be translated to a 32-bit number
The plot thickens Some MIPS instructions you can write cannot be translated to a 32-bit number some reasons why 1) constants are too big 2) relative addresses are too big 3) absolute addresses are outside
CS2630: Computer Organization Project 1 MiniMa: (mini) assembler written in Java Due Jun 30, 2017, 11:59pm
CS2630: Computer Organization Project 1 MiniMa: (mini) assembler written in Java Due Jun 30, 2017, 11:59pm Goals for this assignment Translate MAL instructions to TAL, and TAL to binary Resolve the addresses
Review. Lecture #7 MIPS Decisions So Far...
CS61C L7 MIPS Decisions (1) inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #7 MIPS Decisions 2005-09-21 There is one handout today at the front and back of the room! Lecturer PSOE, new
Instructors: Randy H. Katz David A. PaHerson hhp://inst.eecs.berkeley.edu/~cs61c/fa10. Fall Lecture #6. Agenda
CS 61C: Great Ideas in Computer Architecture (Machine Structures) Instructors: Randy H. Katz David A. PaHerson hhp://inst.eecs.berkeley.edu/~cs61c/fa10 Fall 2010 - - Lecture #6 1 Agenda Review Overflow
Review C program: foo.c Compiler Assembly program: foo.s Assembler Object(mach lang module): foo.o
CS61C L18 Running a Program I (1) inst.eecs.berkeley.edu/~cs61c UC Berkeley CS61C : Machine Structures Lecture 19 Running a Program II aka Compiling, Assembling, Linking, Loading 2006-10-11 (aka 2006-0xB)
Flow of Control -- Conditional branch instructions
Flow of Control -- Conditional branch instructions You can compare directly Equality or inequality of two registers One register with 0 (>,
ECE 15B Computer Organization Spring 2011
ECE 15B Computer Organization Spring 2011 Dmitri Strukov Partially adapted from Computer Organization and Design, 4 th edition, Patterson and Hennessy, Agenda Instruction formats Addressing modes Advanced
Assembly Language Programming. CPSC 252 Computer Organization Ellen Walker, Hiram College
Assembly Language Programming CPSC 252 Computer Organization Ellen Walker, Hiram College Instruction Set Design Complex and powerful enough to enable any computation Simplicity of equipment MIPS Microprocessor
ECE232: Hardware Organization and Design
ECE232: Hardware Organization and Design Lecture 4: Logic Operations and Introduction to Conditionals Adapted from Computer Organization and Design, Patterson & Hennessy, UCB Overview Previously examined
8*4 + 4 = 36 each int is 4 bytes
CS 61CL (Clancy) Solutions and grading standards for exam 1 Spring 2009 169 students took the exam. The average score was 43.6; the median was 46. Scores ranged from 1 to 59. There were 89 scores between
Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: MIPS Instruction Set Architecture
Computer Science 324 Computer Architecture Mount Holyoke College Fall 2007 Topic Notes: MIPS Instruction Set Architecture vonneumann Architecture Modern computers use the vonneumann architecture. Idea:
ecture 12 From Code to Program: CALL (Compiling, Assembling, Linking, and Loading) Friedland and Weaver Computer Science 61C Spring 2017
ecture 12 Computer Science 61C Spring 2017 February 13th, 2017 From Code to Program: CALL (Compiling, Assembling, Linking, and Loading) 1 Administrivia My office hours: Monday 1pm-2pm, 424 SDH. We know
EEC 581 Computer Architecture Lecture 1 Review MIPS
EEC 581 Computer Architecture Lecture 1 Review MIPS 1 Supercomputing: Suddenly Fancy 2 1 Instructions: Language of the Machine More primitive than higher level languages e.g., no sophisticated control
Chapter 2. Instructions: Language of the Computer. Adapted by Paulo Lopes
Chapter 2 Instructions: Language of the Computer Adapted by Paulo Lopes Instruction Set The repertoire of instructions of a computer Different computers have different instruction sets But with many aspects
101 Assembly. ENGR 3410 Computer Architecture Mark L. Chang Fall 2009
101 Assembly ENGR 3410 Computer Architecture Mark L. Chang Fall 2009 What is assembly? 79 Why are we learning assembly now? 80 Assembly Language Readings: Chapter 2 (2.1-2.6, 2.8, 2.9, 2.13, 2.15), Appendix
Today s topics. MIPS operations and operands. MIPS arithmetic. CS/COE1541: Introduction to Computer Architecture. A Review of MIPS ISA.
Today s topics CS/COE1541: Introduction to Computer Architecture MIPS operations and operands MIPS registers Memory view Instruction encoding A Review of MIPS ISA Sangyeun Cho Arithmetic operations Logic
CS3350B Computer Architecture MIPS Instruction Representation
CS3350B Computer Architecture MIPS Instruction Representation Marc Moreno Maza http://www.csd.uwo.ca/~moreno/cs3350_moreno/index.html Department of Computer Science University of Western Ontario, Canada
MIPS Assembly: More about MIPS Instructions Using Functions in MIPS CS 64: Computer Organization and Design Logic Lecture #8
MIPS Assembly: More about MIPS Instructions Using Functions in MIPS CS 64: Computer Organization and Design Logic Lecture #8 Ziad Matni Dept. of Computer Science, UCSB CS 64, Spring 18, Midterm#1 Exam
Midterm. CS64 Spring Midterm Exam
Midterm LAST NAME FIRST NAME PERM Number Instructions Please turn off all pagers, cell phones and beepers. Remove all hats & headphones. Place your backpacks, laptops and jackets at the front. Sit in every
Computer Organization and Structure. Bing-Yu Chen National Taiwan University
Computer Organization and Structure Bing-Yu Chen National Taiwan University Instructions: Language of the Computer Operations and Operands of the Computer Hardware Signed and Unsigned Numbers Representing
Chapter 2. Instruction Set Architecture (ISA)
Chapter 2 Instruction Set Architecture (ISA) MIPS arithmetic Design Principle: simplicity favors regularity. Why? Of course this complicates some things... C code: A = B + C + D; E = F - A; MIPS code:
Problem maximum score 1 35pts 2 22pts 3 23pts 4 15pts Total 95pts
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences CS61c Summer 2001 Woojin Yu Midterm Exam This is a closed-book exam. No calculators
CSE 378 Midterm 2/12/10 Sample Solution
Question 1. (6 points) (a) Rewrite the instruction sub $v0,$t8,$a2 using absolute register numbers instead of symbolic names (i.e., if the instruction contained $at, you would rewrite that as $1.) sub
Lecture 6 Decision + Shift + I/O
Lecture 6 Decision + Shift + I/O Instructions so far MIPS C Program add, sub, addi, multi, div lw $t0,12($s0) sw $t0, 12($s0) beq $s0, $s1, L1 bne $s0, $s1, L1 j L1 (unconditional branch) slt reg1,reg2,reg3
CS 110 Computer Architecture MIPS Instruction Formats
CS 110 Computer Architecture MIPS Instruction Formats Instructor: Sören Schwertfeger http://shtech.org/courses/ca/ School of Information Science and Technology SIST ShanghaiTech University Slides based
Chapter 2A Instructions: Language of the Computer
Chapter 2A Instructions: Language of the Computer Copyright 2009 Elsevier, Inc. All rights reserved. Instruction Set The repertoire of instructions of a computer Different computers have different instruction
UCB CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 10 Introduction to MIPS Decisions II Lecturer SOE Dan Garcia Obama sweeps 8 th state in a row; it s getting tight! 2008 02 13 In what
Rui Wang, Assistant professor Dept. of Information and Communication Tongji University.
Instructions: ti Language of the Computer Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Computer Hierarchy Levels Language understood
COMPUTER ORGANIZATION AND DESIGN
COMPUTER ORGANIZATION AND DESIGN 5 th The Hardware/Software Interface Edition Chapter 2 Instructions: Language of the Computer 2.1 Introduction Instruction Set The repertoire of instructions of a computer