MIPS Instruction Format
|
|
|
- Gerard Blankenship
- 6 years ago
- Views:
Transcription
1 MIPS Instruction Format MIPS uses a 32-bit fixed-length instruction format. only three different instruction word formats: There are Register format Op-code Rs Rt Rd Function code sssss ttttt ddddd ffffff Immediate format Op-code Rs Rt Immediate ffffff sssss ttttt iiiiiiiiiiiiiiii Jump format Op-code Target tttttttttttttttttttttttttt The CPU examines the 6-bit op-code field to determine the type of instruction. Depending on the op-code, the remaining 26 bits are interpreted in three possible ways.
2 MIPS Instruction Categories Arithmetic Addition, subtraction, etc. Data Transfer Moving data between memory and registers. Logical And, or, etc. Shift Left and right shifts. Conditional Branch Make decisions based on current state. Unconditional Jump Change the flow of control.
3 MIPS Arithmetic Instructions Register Format Add sssss ttttt ddddd add Rd,Rs,Rt Add Rs to Rt placing result in Rd, trap if overflow. Add unsigned sssss ttttt ddddd addu Rd,Rs,Rt Add Rs to Rt placing result in Rd, ignore overflow. Subtract sssss ttttt ddddd sub Rd,Rs,Rt Subtract Rt from Rs placing result in Rd, trap if overflow. Subtract unsigned sssss ttttt ddddd subu Rd,Rs,Rt Subtract Rt from Rs placing result in Rd, ignore overflow.
4 Multiply sssss ttttt mult Rs,Rt Two s complement multiply Rs by Rt placing 64-bit result in (Hi, Lo). Multiply Unsigned sssss ttttt multu Rs,Rt Unsigned multiply Rs by Rt placing 64-bit result in (Hi, Lo). Divide sssss ttttt div Rs,Rt Two s complement divide Rs by Rt placing quotient in Lo and remainder in Hi. Divide unsigned sssss ttttt divu Rs,Rt Unsigned divide Rs by Rt placing quotient in Lo and remainder in Hi.
5 Immediate Format Add immediate sssss ttttt iiiiiiiiiiiiiiii addi Rt,Rs,Imm Add Rs to sign-extended immediate value, placing result in Rt, trap if overflow. Add immediate unsigned sssss ttttt iiiiiiiiiiiiiiii addiu Rt,Rs,Imm Add Rs to sign-extended immediate value, placing result in Rt, ignore overflow.
6 MIPS Data Transfer Instructions
7 Pseudo Instructions Load Immediate li Rd,immed Move the immediate value imm into register Rd. Load Address la Rd, address Load computed address - not the contents of the locationinto register Rd. Immediate Format Load byte sssss ttttt iiiiiiiiiiiiiiii lb Rt,Imm(Rs) Add Rs to sign-extended immediate value to obtain effective address. Read 8-bit byte from memory at effective address, sign-extend, and place result in Rt.
8 Load halfword sssss ttttt iiiiiiiiiiiiiiii lh Rt,Imm(Rs) Add Rs to sign-extended immediate value to obtain effective address (trap if odd). Read 16-bit half word from memory at effective address, sign-extend, and place result in Rt.
9 Load word left sssss ttttt iiiiiiiiiiiiiiii lwl Rt,Imm(Rs) Add Rs to sign-extended immediate value to obtain effective address. Read 8-bit bytes from memory starting at effective address and decreasing to first byte of word. Store bytes left-justified in Rt. Load word sssss ttttt iiiiiiiiiiiiiiii lw Rt,Imm(Rs) Add Rs to sign-extended immediate value to obtain effective address (trap if not multiple of 4). Read 32-bit word from memory at effective address and place result in Rt. Load byte unsigned sssss ttttt iiiiiiiiiiiiiiii lbu Rt,Imm(Rs) Add Rs to sign-extended immediate value to obtain effective address. Read 8-bit byte from memory at effective address, zero-extend, and place result in Rt.
10 Load halfword unsigned sssss ttttt iiiiiiiiiiiiiiii lhu Rt,Imm(Rs) Add Rs to sign-extended immediate value to obtain effective address (trap if odd). Read 16-bit half word from memory at effective address, zero-extend, and place result in Rt. Load word right sssss ttttt iiiiiiiiiiiiiiii lwr Rt,Imm(Rs) Add Rs to sign-extended immediate value to obtain effective address. Read 8-bit bytes from memory starting at effective address and increasing to last byte of word. Store bytes right-justified in Rt. Store byte sssss ttttt iiiiiiiiiiiiiiii sb Rt,Imm(Rs) Add Rs to sign-extended immediate value to obtain effective address. Store least-significant 8-bit byte from Rt in memory at effective address.
11 Store halfword sssss ttttt iiiiiiiiiiiiiiii sh Rt,Imm(Rs) Add Rs to sign-extended immediate value to obtain effective address (trap if odd). Write least-significant two bytes of Rt in memory at effective address. Store word left sssss ttttt iiiiiiiiiiiiiiii swl Rt,Imm(Rs) Add Rs to sign-extended immediate value to obtain effective address. Write bytes from Rt left-justified into memory, starting with the most significant byte and continuing to a word boundary. Store word sssss ttttt iiiiiiiiiiiiiiii sw Rt,Imm(Rs) Add Rs to sign-extended immediate value to obtain effective address (trap if not multiple of 4). Store 32-bit contents of Rt in memory at effective address.
12 Store word right sssss ttttt iiiiiiiiiiiiiiii swr Rt,Imm(Rs) Add Rs to sign-extended immediate value to obtain effective address. Write bytes from Rt right-justified into memory, starting with the least significant byte and continuing to a word boundary. Load upper immediate ttttt iiiiiiiiiiiiiiii lui Rt,Imm The 16-bit immediate value is shifted left 16-bits (zero-filled) and the result is stored in Rt.
13 Register Format Move from high ddddd mfhi Rd The contents of the special register Hi are copied into Rd. Move to high sssss mthi Rd The contents of Rs are copied into the special register Hi. Move from low ddddd mflo Rd The contents of the special register Lo are copied into Rd. Move to low sssss mtlo Rd The contents of Rs are copied into the special register Lo.
14 Move from control register ttttt ddddd mfc0 Rt,Cd The contents of coprocessor 0 control register Cd are copied into register Rt. Move to control register ttttt ddddd mtc0 Rt,Cd The contents of register Rt are copied to coprocessor 0 control register Cd. Pseudo Instruction Move move Rd,Rs Move register Rs to register Rd.
15 MIPS Logical Instructions Register Format And sssss ttttt ddddd and Rd,Rs,Rt The contents of Rs are bitwise AND-ed with the contents of Rt and the results are placed in Rd. Or sssss ttttt ddddd or Rd,Rs,Rt The contents of Rs are bitwise OR-ed with the contents of Rt and the results are placed in Rd. Exclusive or sssss ttttt ddddd xor Rd,Rs,Rt The contents of Rs are bitwise XOR-ed with the contents of Rt and the results are placed in Rd.
16 Nor sssss ttttt ddddd nor Rd,Rs,Rt The contents of Rs are bitwise NOR-ed with the contents of Rt and the results are placed in Rd. Set on less than sssss ttttt ddddd slt Rd,Rs,Rt The contents of Rs are two s-complement compared with the contents of Rt. If Rs is less than Rt, then Rd is set to one, otherwise Rd is set to zero. Set on less than unsigned sssss ttttt ddddd sltu Rd,Rs,Rt The contents of Rs are compared in an unsigned manner with the contents of Rt. If Rs is less than Rt, then Rd is set to one, otherwise Rd is set to zero.
17 Immediate Format Set on less than immediate sssss ttttt iiiiiiiiiiiiiiii slti Rt,Rs,Imm The contents of Rs are two s-complement compared with the sign-extended immediate value. If Rs is less than the immediate value, then Rt is set to one, otherwise Rt is set to zero. Set on less than immediate unsigned sssss ttttt iiiiiiiiiiiiiiii sltiu Rt,Rs,Imm The contents of Rs are compared in an unsigned manner with the zero-extended immediate value. If Rs is less than the immediate value, then Rt is set to one, otherwise Rt is set to zero.
18 And immediate sssss ttttt iiiiiiiiiiiiiiii andi Rt,Rs,Imm The contents of Rs are bitwise AND-ed with the the zeroextended immediate value and the results are placed in Rt. Or immediate sssss ttttt iiiiiiiiiiiiiiii ori Rt,Rs,Imm The contents of Rs are bitwise OR-ed with the the zeroextended immediate value and the results are placed in Rt. Xor immediate sssss ttttt iiiiiiiiiiiiiiii xori Rt,Rs,Imm The contents of Rs are bitwise XOR-ed with the the zeroextended immediate value and the results are placed in Rt.
19 Pseudo Instructions Negate neg Rd,Rs Put the negative value of register Rs in register Rd. Absolute Value abs Rd,Rs Put the absolute value of register Rs in register Rd. Bitwise NOT not Rd,Rs Put the bitwise logical negation of register Rs in register Rd. Negate neg Rd,Rs Put the negative value of register Rs in register Rd. Set on Equal seq Rd,Rs,Rt
20 Set register Rd to 1 if register Rs equals register Rt, and to 0 otherwise. Set on Greater than Equal sge Rd,Rs,Rt Set register Rd to 1 if register Rs greater than or equal to register Rt, and to 0 otherwise. Set on Greater Than sgt Rd,Rs,Rt Set register Rd to 1 if register Rs greater than register Rt, and to 0 otherwise. Set on Less Than Equal sle Rd,Rs,Rt Set register Rd to 1 if register Rs less than or equal to register Rt, and to 0 otherwise. Set Not Equal sne Rd,Rs,Rt Set register Rd to 1 if register Rs not equal to register Rt, and to 0 otherwise.
21 MIPS Shift Instructions Register Format Shift left logical ttttt ddddd iiiii sll Rd,Rt,i The contents of Rt are shifted left i bits and the result is placed in Rd. Shift right logical ttttt ddddd iiiii srl Rd,Rt,i The contents of Rt are shifted right i bits (zero-filled) and the result is placed in Rd. Shift right arithmetic ttttt ddddd iiiii sra Rd,Rt,i The contents of Rt are shifted right i bits (sign-filled) and the result is placed in Rd.
22 Shift left logical variable sssss ttttt ddddd sllv Rd,Rt,Rs The contents of Rt are shifted left by a number of bits specified by the low-order five bits of Rs and the result is placed in Rd. Shift right logical variable sssss ttttt ddddd srlv Rd,Rt,Rs The contents of Rt are shifted right (zero-filled) by a number of bits specified by the low-order five bits of Rs and the result is placed in Rd. Shift right arithmetic variable sssss ttttt ddddd srav Rd,Rt,Rs The contents of Rt are shifted right (sign-filled) by a number of bits specified by the low-order five bits of Rs and the result is placed in Rd.
23 Pseudo Instructions Rotate Right ror Rd,Rs,Rt Rotate register Rs right by the number of bits indicated by Rt and put the result in register Rd. Rotate Left rol Rd,Rs,Rt Rotate register Rs left by the number of bits indicated by Rt and put the result in register Rd.
24 MIPS Conditional Branch Instructions These instructions modify the program counter to effect a change in the flow of control. The immediate operand specifies a word offset from the current program counter value. Thus, the new program counter is computed by taking the sign-extended immediate operand, shifting it left by two bits, and adding it to the current program counter value, which has already been incremented at the time the calculation occurs. Immediate Format Branch on equal sssss ttttt iiiiiiiiiiiiiiii beq Rs,Rt,addr The program counter receives the new value if the contents of Rs and Rt are equal.
25 Branch on not equal sssss ttttt iiiiiiiiiiiiiiii bne Rs,Rt,addr The program counter receives the new value if the contents of Rs and Rt are not equal. Branch on less than or equal to zero sssss iiiiiiiiiiiiiiii blez Rs,addr The program counter receives the new value if the content of Rs is less than or equal to zero. Branch on greater than zero sssss iiiiiiiiiiiiiiii bgtz Rs,addr The program counter receives the new value if the content of Rs is greater than zero. Branch on less than zero sssss iiiiiiiiiiiiiiii bltz Rs,addr The program counter receives the new value if the content of Rs is less than zero.
26 Branch on greater than or equal to zero sssss iiiiiiiiiiiiiiii bgez Rs,addr The program counter receives the new value if the content of Rs is greater than or equal to zero. Branch on less than zero and link sssss iiiiiiiiiiiiiiii bltzal Rs,addr The program counter receives the new value if the content of Rs is less than zero. The old program counter is saved in $ra. Branch on greater than or equal to zero and link sssss iiiiiiiiiiiiiiii bgezal Rs,addr The program counter receives the new value if the content of Rs is greater than or equal to zero. The old program counter is saved in $ra.
27 Pseudo Instruction Branch on equal to zero beqz Rs,addr The program counter receives the new value if the content of register Rs is zero. Branch on greater than or equal bge Rs,Rt,addr The program counter receives the new value if the content of register Rs is greater than or equal to register Rt. Branch on greater than bgt Rs,Rt,addr The program counter receives the new value if the content of register Rs is greater than to register Rt. Branch on less than or equal ble Rs,Rt,addr
28 The program counter receives the new value if the content of register Rs is less than or equal to register Rt. Branch on less than or equal blt Rs,Rt,addr The program counter receives the new value if the content of register Rs is less than register Rt. Branch on equal to zero bnez Rs,addr The program counter receives the new value if the content of register Rs is not equal to zero.
29 MIPS Unconditional Jump Instructions Register Format Jump register sssss jr Rs The program counter is replaced by the contents of Rs. Jump and link register sssss ddddd jalr Rd,Rs The program counter is replaced by the contents of Rs. The old program counter is saved in Rd. System call syscall A user program exception is generated, which causes a trap to the operating system.
30 Jump Format These instructions replace the low-order 28-bits of the program counter with a value obtained by shifting the 26-bit immediate operand left by two bits. This can be used to effect transfer of control to anywhere within the same 256MB region in which execution is currently taking place. Jump tttttttttttttttttttttttttt j addr The program counter is unconditionally modified as described above. Jump and link tttttttttttttttttttttttttt jal addr The program counter is unconditionally modified as described above. The old program counter is saved in $ra.
MIPS Reference Guide
MIPS Reference Guide Free at PushingButtons.net 2 Table of Contents I. Data Registers 3 II. Instruction Register Formats 4 III. MIPS Instruction Set 5 IV. MIPS Instruction Set (Extended) 6 V. SPIM Programming
TSK3000A - Generic Instructions
TSK3000A - Generic Instructions Frozen Content Modified by Admin on Sep 13, 2017 Using the core set of assembly language instructions for the TSK3000A as building blocks, a number of generic instructions
CSc 256 Midterm 2 Spring 2012
CSc 256 Midterm 2 Spring 2012 NAME: 1a) You are given this MIPS assembly language instruction (i.e., pseudo- instruction): ble $12, 0x20004880, there Translate this MIPS instruction to an efficient sequence
Computer Architecture. The Language of the Machine
Computer Architecture The Language of the Machine Instruction Sets Basic ISA Classes, Addressing, Format Administrative Matters Operations, Branching, Calling conventions Break Organization All computers
CSc 256 Midterm 2 Fall 2011
CSc 256 Midterm 2 Fall 2011 NAME: 1a) You are given a MIPS branch instruction: x: beq $12, $0, y The address of the label "y" is 0x400468. The memory location at "x" contains: address contents 0x40049c
The MIPS R2000 Instruction Set
The MIPS R2000 Instruction Set Arithmetic and Logical Instructions In all instructions below, Src2 can either be a register or an immediate value (a 16 bit integer). The immediate forms of the instructions
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 Instruction Set
MIPS Instruction Set Prof. James L. Frankel Harvard University Version of 7:12 PM 3-Apr-2018 Copyright 2018, 2017, 2016, 201 James L. Frankel. All rights reserved. CPU Overview CPU is an acronym for Central
MIPS Instruction Reference
Page 1 of 9 MIPS Instruction Reference This is a description of the MIPS instruction set, their meanings, syntax, semantics, and bit encodings. The syntax given for each instruction refers to the assembly
F. Appendix 6 MIPS Instruction Reference
F. Appendix 6 MIPS Instruction Reference Note: ALL immediate values should be sign extended. Exception: For logical operations immediate values should be zero extended. After extensions, you treat them
CSc 256 Midterm (green) Fall 2018
CSc 256 Midterm (green) Fall 2018 NAME: Problem 1 (5 points): Suppose we are tracing a C/C++ program using a debugger such as gdb. The code showing all function calls looks like this: main() { bat(5);
SPIM Instruction Set
SPIM Instruction Set This document gives an overview of the more common instructions used in the SPIM simulator. Overview The SPIM simulator implements the full MIPS instruction set, as well as a large
Kernel Registers 0 1. Global Data Pointer. Stack Pointer. Frame Pointer. Return Address.
The MIPS Register Set The MIPS R2000 CPU has 32 registers. 31 of these are general-purpose registers that can be used in any of the instructions. The last one, denoted register zero, is defined to contain
The MIPS Instruction Set Architecture
The MIPS Set Architecture CPS 14 Lecture 5 Today s Lecture Admin HW #1 is due HW #2 assigned Outline Review A specific ISA, we ll use it throughout semester, very similar to the NiosII ISA (we will use
M2 Instruction Set Architecture
M2 Instruction Set Architecture Module Outline Addressing modes. Instruction classes. MIPS-I ISA. High level languages, Assembly languages and object code. Translating and starting a program. Subroutine
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.
MIPS Assembly Language
MIPS Assembly Language Chapter 15 S. Dandamudi Outline MIPS architecture Registers Addressing modes MIPS instruction set Instruction format Data transfer instructions Arithmetic instructions Logical/shift/rotate/compare
CSc 256 Final Fall 2016
CSc 256 Final Fall 2016 NAME: Problem 1 (25 points) Translate the C/C++ function func() into MIPS assembly language. The prototype is: void func(int arg0, int *arg1); arg0-arg1 are in $a0- $a1 respectively.
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 (>,
Question 0. Do not turn this page until you have received the signal to start. (Please fill out the identification section above) Good Luck!
CSC B58 Winter 2017 Final Examination Duration 2 hours and 50 minutes Aids allowed: none Last Name: Student Number: UTORid: First Name: Question 0. [1 mark] Read and follow all instructions on this page,
Mark Redekopp, All rights reserved. EE 357 Unit 11 MIPS ISA
EE 357 Unit 11 MIPS ISA Components of an ISA 1. Data and Address Size 8-, 16-, 32-, 64-bit 2. Which instructions does the processor support SUBtract instruc. vs. NEGate + ADD instrucs. 3. Registers accessible
MIPS ISA. 1. Data and Address Size 8-, 16-, 32-, 64-bit 2. Which instructions does the processor support
Components of an ISA EE 357 Unit 11 MIPS ISA 1. Data and Address Size 8-, 16-, 32-, 64-bit 2. Which instructions does the processor support SUBtract instruc. vs. NEGate + ADD instrucs. 3. Registers accessible
INSTRUCTION SET COMPARISONS
INSTRUCTION SET COMPARISONS MIPS SPARC MOTOROLA REGISTERS: INTEGER 32 FIXED WINDOWS 32 FIXED FP SEPARATE SEPARATE SHARED BRANCHES: CONDITION CODES NO YES NO COMPARE & BR. YES NO YES A=B COMP. & BR. YES
Overview. Introduction to the MIPS ISA. MIPS ISA Overview. Overview (2)
Introduction to the MIPS ISA Overview Remember that the machine only understands very basic instructions (machine instructions) It is the compiler s job to translate your high-level (e.g. C program) into
ece4750-parc-isa.txt
========================================================================== PARC Instruction Set Architecture ========================================================================== # Author : Christopher
Computer Architecture. MIPS Instruction Set Architecture
Computer Architecture MIPS Instruction Set Architecture Instruction Set Architecture An Abstract Data Type Objects Registers & Memory Operations Instructions Goal of Instruction Set Architecture Design
MIPS Assembly Language Programming
MIPS Assembly Language Programming Bob Britton Chapter 1 The MIPS Architecture My objective in teaching assembly language is to introduce students to the fundamental concepts of contemporary computer architecture.
Adventures in Assembly Land
Adventures in Assembly Land What is an Assembler ASM Directives ASM Syntax Intro to SPIM Simple examples L6 Simulator 1 A Simple Programming Task Add the numbers 0 to 4 10 = 0 + 1 + 2 + 3 + 4 In C : int
ECE 2035 Programming HW/SW Systems Fall problems, 7 pages Exam Two 23 October 2013
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
Reduced Instruction Set Computer (RISC)
Reduced Instruction Set Computer (RISC) Reduced Instruction Set Computer (RISC) Focuses on reducing the number and complexity of instructions of the machine. Reduced number of cycles needed per instruction.
CPS311 - COMPUTER ORGANIZATION. A bit of history
CPS311 - COMPUTER ORGANIZATION A Brief Introduction to the MIPS Architecture A bit of history The MIPS architecture grows out of an early 1980's research project at Stanford University. In 1984, MIPS computer
Week 10: Assembly Programming
Week 10: Assembly Programming Arithmetic instructions Instruction Opcode/Function Syntax Operation add 100000 $d, $s, $t $d = $s + $t addu 100001 $d, $s, $t $d = $s + $t addi 001000 $t, $s, i $t = $s +
Exam in Computer Engineering
Exam in Computer Engineering Kurskod D0013E/SMD137/SMD082/SMD066 Tentamensdatum 2010-10-29 Skrivtid 14.00-18.00 Maximalt resultat 50 poäng Godkänt resultat 25 poäng Jourhavande lärare Andrey Kruglyak Tel
MIPS Assembly Language. Today s Lecture
MIPS Assembly Language Computer Science 104 Lecture 6 Homework #2 Midterm I Feb 22 (in class closed book) Outline Assembly Programming Reading Chapter 2, Appendix B Today s Lecture 2 Review: A Program
Today s Lecture. MIPS Assembly Language. Review: What Must be Specified? Review: A Program. Review: MIPS Instruction Formats
Today s Lecture Homework #2 Midterm I Feb 22 (in class closed book) MIPS Assembly Language Computer Science 14 Lecture 6 Outline Assembly Programming Reading Chapter 2, Appendix B 2 Review: A Program Review:
ECE Exam I February 19 th, :00 pm 4:25pm
ECE 3056 Exam I February 19 th, 2015 3:00 pm 4:25pm 1. The exam is closed, notes, closed text, and no calculators. 2. The Georgia Tech Honor Code governs this examination. 3. There are 4 questions and
Q1: /30 Q2: /25 Q3: /45. Total: /100
ECE 2035(A) Programming for Hardware/Software Systems Fall 2013 Exam One September 19 th 2013 This is a closed book, closed note texam. Calculators are not permitted. Please work the exam in pencil and
ECE 2035 Programming HW/SW Systems Spring problems, 6 pages Exam One 4 February Your Name (please print clearly)
Your Name (please print clearly) This exam will be conducted according to the Georgia Tech Honor Code. I pledge to neither give nor receive unauthorized assistance on this exam and to abide by all provisions
Instruction Set Architecture of. MIPS Processor. MIPS Processor. MIPS Registers (continued) MIPS Registers
CSE 675.02: Introduction to Computer Architecture MIPS Processor Memory Instruction Set Architecture of MIPS Processor CPU Arithmetic Logic unit Registers $0 $31 Multiply divide Coprocessor 1 (FPU) Registers
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
Mips Code Examples Peter Rounce
Mips Code Examples Peter Rounce P.Rounce@cs.ucl.ac.uk Some C Examples Assignment : int j = 10 ; // space must be allocated to variable j Possibility 1: j is stored in a register, i.e. register $2 then
Reduced Instruction Set Computer (RISC)
Reduced Instruction Set Computer (RISC) Focuses on reducing the number and complexity of instructions of the ISA. RISC Goals RISC: Simplify ISA Simplify CPU Design Better CPU Performance Motivated by simplifying
Introduction to MIPS Processor
Introduction to MIPS Processor The processor we will be considering in this tutorial is the MIPS processor. The MIPS processor, designed in 1984 by researchers at Stanford University, is a RISC (Reduced
ECE 2035 Programming HW/SW Systems Fall problems, 6 pages Exam One 22 September Your Name (please print clearly) Signed.
Your Name (please print clearly) This exam will be conducted according to the Georgia Tech Honor Code. I pledge to neither give nor receive unauthorized assistance on this exam and to abide by all provisions
CS 4200/5200 Computer Architecture I
CS 4200/5200 Computer Architecture I MIPS Instruction Set Architecture Dr. Xiaobo Zhou Department of Computer Science CS420/520 Lec3.1 UC. Colorado Springs Adapted from UCB97 & UCB03 Review: Organizational
Arithmetic for Computers
MIPS Arithmetic Instructions Cptr280 Dr Curtis Nelson Arithmetic for Computers Operations on integers Addition and subtraction; Multiplication and division; Dealing with overflow; Signed vs. unsigned numbers.
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,
CSc 256 Final Spring 2011
CSc 256 Final Spring 2011 NAME: Problem1: Convertthedecimalfloatingpointnumber 4.3toa32 bitfloat(inbinary)inieee 754standardrepresentation.Showworkforpartialcredit.10points Hint:IEEE754formatfor32 bitfloatsconsistsofs
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
ECE 2035 Programming HW/SW Systems Fall problems, 6 pages Exam Two 23 October Your Name (please print clearly) Signed.
Your Name (please print clearly) This exam will be conducted according to the Georgia Tech Honor Code. I pledge to neither give nor receive unauthorized assistance on this exam and to abide by all provisions
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,
Assembly Language. Prof. Dr. Antônio Augusto Fröhlich. Sep 2006
Sep 2006 Prof. Antônio Augusto Fröhlich (http://www.lisha.ufsc.br) 33 Assembly Language Prof. Dr. Antônio Augusto Fröhlich guto@lisha.ufsc.br http://www.lisha.ufsc.br/~guto Sep 2006 Sep 2006 Prof. Antônio
software hardware Which is easier to change/design???
CS152 Computer Architecture and Engineering Lecture 2 Review of MIPS ISA and Performance January 27, 2003 John Kubiatowicz (http.cs.berkeley.edu/~kubitron) lecture slides: http://inst.eecs.berkeley.edu/~cs152/
RTL Model of a Two-Stage MIPS Processor
RTL Model of a Two-Stage MIPS Processor 6.884 Laboratory February 4, 5 - Version 45 Introduction For the first lab assignment, you are to write an RTL model of a two-stage pipelined MIPS processor using
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.
A Processor. Kevin Walsh CS 3410, Spring 2010 Computer Science Cornell University. See: P&H Chapter , 4.1-3
A Processor Kevin Walsh CS 3410, Spring 2010 Computer Science Cornell University See: P&H Chapter 2.16-20, 4.1-3 Let s build a MIPS CPU but using Harvard architecture Basic Computer System Registers ALU
ECE 2035 Programming HW/SW Systems Fall problems, 6 pages Exam One 19 September 2012
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
ECE 2035 Programming HW/SW Systems Spring problems, 6 pages Exam Two 11 March Your Name (please print) total
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
Mark Redekopp, All rights reserved. EE 352 Unit 3 MIPS ISA
EE 352 Unit 3 MIPS ISA Instruction Set Architecture (ISA) Defines the software interface of the processor and memory system Instruction set is the vocabulary the HW can understand and the SW is composed
Project Part A: Single Cycle Processor
Curtis Mayberry Andrew Kies Mark Monat Iowa State University CprE 381 Professor Joseph Zambreno Project Part A: Single Cycle Processor Introduction The second part in the three part MIPS Processor design
Review: Organization. CS152 Computer Architecture and Engineering Lecture 2. Review of MIPS ISA and Design Concepts
Review: Organization Processor Input CS52 Computer Architecture and Engineering Lecture 2 Control Review of MIPS ISA and Design Concepts path Output January 26, 24 John Kubiatowicz (http.cs.berkeley.edu/~kubitron)
Part II Instruction-Set Architecture. Jan Computer Architecture, Instruction-Set Architecture Slide 1
Part II Instruction-Set Architecture Jan. 211 Computer Architecture, Instruction-Set Architecture Slide 1 MiniMIPS Instruction Formats op rs rt 31 25 2 15 1 5 R 6 bits 5 bits 5 bits 5 bits I J Opcode Source
Assembly Programming
Designing Computer Systems Assembly Programming 08:34:48 PM 23 August 2016 AP-1 Scott & Linda Wills Designing Computer Systems Assembly Programming In the early days of computers, assembly programming
EE 109 Unit 13 MIPS Instruction Set. Instruction Set Architecture (ISA) Components of an ISA INSTRUCTION SET OVERVIEW
1 2 EE 109 Unit 13 MIPS Instruction Set Architecting a vocabulary for the HW INSTRUCTION SET OVERVIEW 3 4 Instruction Set Architecture (ISA) Defines the of the processor and memory system Instruction set
MIPS Instructions: 64-bit Core Subset
MIPS Instructions: 64-bit Core Subset Spring 2008 General notes: a. R s, R t, and R d specify 64-bit general purpose registers b. F s, F t, and F d specify 64-bit floating point registers c. C d specifies
Outline. EEL-4713 Computer Architecture Multipliers and shifters. Deriving requirements of ALU. MIPS arithmetic instructions
Outline EEL-4713 Computer Architecture Multipliers and shifters Multiplication and shift registers Chapter 3, section 3.4 Next lecture Division, floating-point 3.5 3.6 EEL-4713 Ann Gordon-Ross.1 EEL-4713
Computer Organization & Design
Computer Organization & Design Peng Liu ( 刘鹏 ) College of Information Science & Electronic Engineering Zhejiang University, Hangzhou 310027, China liupeng@zju.edu.cn Lecture 2 MIPS Instruction Set Architecture
EE 109 Unit 8 MIPS Instruction Set
1 EE 109 Unit 8 MIPS Instruction Set 2 Architecting a vocabulary for the HW INSTRUCTION SET OVERVIEW 3 Instruction Set Architecture (ISA) Defines the software interface of the processor and memory system
ECE 2035 Programming HW/SW Systems Fall problems, 6 pages Exam Two 21 October 2016
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
SPIM S20: A MIPS R2000 Simulator
SPIM S20: A MIPS R2000 Simulator 1 th 25 the performance at none of the cost James R. Larus Copyright c 1990 2004 by James R. Larus (This document may be copied without royalties, so long as this copyright
EE108B Lecture 3. MIPS Assembly Language II
EE108B Lecture 3 MIPS Assembly Language II Christos Kozyrakis Stanford University http://eeclass.stanford.edu/ee108b 1 Announcements Urgent: sign up at EEclass and say if you are taking 3 or 4 units Homework
Computer Architecture
CS3350B Computer Architecture Winter 2015 Lecture 4.2: MIPS ISA -- Instruction Representation Marc Moreno Maza www.csd.uwo.ca/courses/cs3350b [Adapted from lectures on Computer Organization and Design,
MIPS%Assembly% E155%
MIPS%Assembly% E155% Outline MIPS Architecture ISA Instruction types Machine codes Procedure call Stack 2 The MIPS Register Set Name Register Number Usage $0 0 the constant value 0 $at 1 assembler temporary
Anne Bracy CS 3410 Computer Science Cornell University. [K. Bala, A. Bracy, E. Sirer, and H. Weatherspoon]
![Anne Bracy CS 3410 Computer Science Cornell University. [K. Bala, A. Bracy, E. Sirer, and H. Weatherspoon]](/thumbs/92/108186036.jpg "Anne Bracy CS 3410 Computer Science Cornell University. [K. Bala, A. Bracy, E. Sirer, and H. Weatherspoon]")
Anne Bracy CS 3410 Computer Science Cornell University [K. Bala, A. Bracy, E. Sirer, and H. Weatherspoon] Understanding the basics of a processor We now have the technology to build a CPU! Putting it all
Recap from Last Time. CSE 2021: Computer Organization. Levels of Programming. The RISC Philosophy 5/19/2011
CSE 2021: Computer Organization Recap from Last Time load from disk High-Level Program Lecture-3 Code Translation-1 Registers, Arithmetic, logical, jump, and branch instructions MIPS to machine language
5/17/2012. Recap from Last Time. CSE 2021: Computer Organization. The RISC Philosophy. Levels of Programming. Stored Program Computers
CSE 2021: Computer Organization Recap from Last Time load from disk High-Level Program Lecture-2 Code Translation-1 Registers, Arithmetic, logical, jump, and branch instructions MIPS to machine language
Review: MIPS Organization
1 MIPS Arithmetic Review: MIPS Organization Processor Memory src1 addr 5 src2 addr 5 dst addr 5 write data Register File registers ($zero - $ra) bits src1 data src2 data read/write addr 1 1100 2 30 words
Processor. Han Wang CS3410, Spring 2012 Computer Science Cornell University. See P&H Chapter , 4.1 4
Processor Han Wang CS3410, Spring 2012 Computer Science Cornell University See P&H Chapter 2.16 20, 4.1 4 Announcements Project 1 Available Design Document due in one week. Final Design due in three weeks.
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
Digital System Design II
Digital System Design II 数字系统设计 II Peng Liu ( 刘鹏 ) Dept. of Info. Sci. & Elec. Engg. Zhejiang University liupeng@zju.edu.cn Lecture 2 MIPS Instruction Set Architecture 2 Textbook reading MIPS ISA 2.1-2.4
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
Lecture 2. Instructions: Language of the Computer (Chapter 2 of the textbook)
Lecture 2 Instructions: Language of the Computer (Chapter 2 of the textbook) Instructions: tell computers what to do Chapter 2 Instructions: Language of the Computer 2 Introduction Chapter 2.1 Chapter
Lec 10: Assembler. Announcements
Lec 10: Assembler Kavita Bala CS 3410, Fall 2008 Computer Science Cornell University Announcements HW 2 is out Due Wed after Fall Break Robot-wide paths PA 1 is due next Wed Don t use incrementor 4 times
Computer Architecture Experiment
Computer Architecture Experiment Jiang Xiaohong College of Computer Science & Engineering Zhejiang University Architecture Lab_jxh 1 Topics 0 Basic Knowledge 1 Warm up 2 simple 5-stage of pipeline CPU
Integer Multiplication and Division
Integer Multiplication and Division COE 301 Computer Organization Prof. Muhamed Mudawar College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals Presentation Outline
Number Systems and Their Representations
Number Representations Cptr280 Dr Curtis Nelson Number Systems and Their Representations In this presentation you will learn about: Representation of numbers in computers; Signed vs. unsigned numbers;
ECE468 Computer Organization & Architecture. MIPS Instruction Set Architecture
ECE468 Computer Organization & Architecture MIPS Instruction Set Architecture ECE468 Lec4.1 MIPS R2000 / R3000 Registers 32-bit machine --> Programmable storage 2^32 x bytes 31 x 32-bit GPRs (R0 = 0) 32
MACHINE LANGUAGE. To work with the machine, we need a translator.
LECTURE 2 Assembly MACHINE LANGUAGE As humans, communicating with a machine is a tedious task. We can t, for example, just say add this number and that number and store the result here. Computers have
Anne Bracy CS 3410 Computer Science Cornell University. See P&H Chapter: , , Appendix B
Anne Bracy CS 3410 Computer Science Cornell University The slides are the product of many rounds of teaching CS 3410 by Professors Weatherspoon, Bala, Bracy, and Sirer. See P&H Chapter: 2.16-2.20, 4.1-4.4,
Programming the processor
CSC258 Week 9 Logistics This week: Lab 7 is the last Logisim DE2 lab. Next week: Lab 8 will be assembly. For assembly labs you can work individually or in pairs. No matter how you do it, the important
Character Is a byte quantity (00~FF or 0~255) ASCII (American Standard Code for Information Interchange) Page 91, Fig. 2.21
2.9 Communication with People: Byte Data & Constants Character Is a byte quantity (00~FF or 0~255) ASCII (American Standard Code for Information Interchange) Page 91, Fig. 2.21 32: space 33:! 34: 35: #...
ECE 2035 A Programming Hw/Sw Systems Fall problems, 8 pages Final Exam 8 December 2014
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
ECE 2035 Programming HW/SW Systems Spring problems, 6 pages Exam Three 10 April 2013
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
MIPS ISA and MIPS Assembly. CS301 Prof. Szajda
MIPS ISA and MIPS Assembly CS301 Prof. Szajda Administrative HW #2 due Wednesday (9/11) at 5pm Lab #2 due Friday (9/13) 1:30pm Read Appendix B5, B6, B.9 and Chapter 2.5-2.9 (if you have not already done
MIPS Coding Snippets. Prof. James L. Frankel Harvard University. Version of 9:32 PM 14-Feb-2016 Copyright 2016 James L. Frankel. All rights reserved.
MIPS Coding Snippets Prof. James L. Frankel Harvard University Version of 9:32 PM 14-Feb-2016 Copyright 2016 James L. Frankel. All rights reserved. Loading a 32-bit constant into a register # Example loading
Fundamentals of Computer Systems
Fundamentals of Computer Systems The MIPS Instruction Set Martha A. Kim Columbia University Fall 2015 1 / 67 Instruction Set Architectures MIPS The GCD Algorithm MIPS Registers Types of Instructions Computational
REGISTERS INSTRUCTION SET DIRECTIVES SYSCALLS
MARS REGISTERS INSTRUCTION SET DIRECTIVES SYSCALLS ΗΥ 134: ΕΙΣΑΓΩΓΗ ΣΤΗΝ ΟΡΓΑΝΩΣΗ ΚΑΙ ΣΧΕΔΙΑΣΗ Η/Υ Ι Registers MIPS has 32 integer registers. The hardware architecture specifies that: General purpose register
LAB B Translating Code to Assembly
LAB B Translating Code to Assembly Perform the following groups of tasks: LabB1.s 1. Create a directory to hold the files for this lab. 2. Create and run the Java app below. We seek to translate it to
ECE 2035 A Programming Hw/Sw Systems Spring problems, 8 pages Final Exam 29 April 2015
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
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