F. Appendix 6 MIPS Instruction Reference

Similar documents
MIPS Instruction Reference

MIPS Reference Guide

EEM 486: Computer Architecture. Lecture 2. MIPS Instruction Set Architecture

The MIPS Instruction Set Architecture

MIPS Instruction Format

Computer Architecture. The Language of the Machine

MIPS Instruction Set

ECE 2035 Programming HW/SW Systems Spring problems, 6 pages Exam One 4 February Your Name (please print clearly)

ECE 2035 Programming HW/SW Systems Fall problems, 7 pages Exam Two 23 October 2013

Q1: /30 Q2: /25 Q3: /45. Total: /100

ECE 2035 Programming HW/SW Systems Fall problems, 6 pages Exam One 22 September Your Name (please print clearly) Signed.

Week 10: Assembly Programming

MIPS ISA. 1. Data and Address Size 8-, 16-, 32-, 64-bit 2. Which instructions does the processor support

CSc 256 Midterm 2 Fall 2011

CSc 256 Midterm 2 Spring 2012

Question 0. Do not turn this page until you have received the signal to start. (Please fill out the identification section above) Good Luck!

M2 Instruction Set Architecture

SPIM Instruction Set

TSK3000A - Generic Instructions

Reduced Instruction Set Computer (RISC)

Assembly Programming

ECE 2035 Programming HW/SW Systems Spring problems, 6 pages Exam Two 11 March Your Name (please print) total

ECE232: Hardware Organization and Design. Computer Organization - Previously covered

Arithmetic for Computers

ECE 2035 Programming HW/SW Systems Fall problems, 6 pages Exam One 19 September 2012

Mark Redekopp, All rights reserved. EE 357 Unit 11 MIPS ISA

Examples of branch instructions

CSc 256 Midterm (green) Fall 2018

Reduced Instruction Set Computer (RISC)

Flow of Control -- Conditional branch instructions

ECE 2035 Programming HW/SW Systems Fall problems, 6 pages Exam Two 23 October Your Name (please print clearly) Signed.

MIPS Assembly Language. Today s Lecture

Mips Code Examples Peter Rounce

ECE 2035 Programming HW/SW Systems Fall problems, 6 pages Exam Two 21 October 2016

Today s Lecture. MIPS Assembly Language. Review: What Must be Specified? Review: A Program. Review: MIPS Instruction Formats

101 Assembly. ENGR 3410 Computer Architecture Mark L. Chang Fall 2009

ECE Exam I February 19 th, :00 pm 4:25pm

Overview. Introduction to the MIPS ISA. MIPS ISA Overview. Overview (2)

Computer Architecture. MIPS Instruction Set Architecture

ECE 2035 A Programming Hw/Sw Systems Fall problems, 8 pages Final Exam 8 December 2014

ECE 2035 Programming HW/SW Systems Spring problems, 6 pages Exam Three 10 April 2013

CSc 256 Final Fall 2016

CISC 662 Graduate Computer Architecture. Lecture 4 - ISA MIPS ISA. In a CPU. (vonneumann) Processor Organization

The MIPS R2000 Instruction Set

RTL Model of a Two-Stage MIPS Processor

CS 4200/5200 Computer Architecture I

ECE 2035 A Programming Hw/Sw Systems Spring problems, 8 pages Final Exam 29 April 2015

CISC 662 Graduate Computer Architecture. Lecture 4 - ISA

Outline. EEL-4713 Computer Architecture Multipliers and shifters. Deriving requirements of ALU. MIPS arithmetic instructions

Recap from Last Time. CSE 2021: Computer Organization. Levels of Programming. The RISC Philosophy 5/19/2011

CPS311 - COMPUTER ORGANIZATION. A bit of history

Number Systems and Their Representations

5/17/2012. Recap from Last Time. CSE 2021: Computer Organization. The RISC Philosophy. Levels of Programming. Stored Program Computers

ece4750-parc-isa.txt

MIPS Assembly Language

Review. Lecture #9 MIPS Logical & Shift Ops, and Instruction Representation I Logical Operators (1/3) Bitwise Operations

A Processor. Kevin Walsh CS 3410, Spring 2010 Computer Science Cornell University. See: P&H Chapter , 4.1-3

CSc 256 Final Spring 2011

ECE 2035 A Programming Hw/Sw Systems Fall problems, 8 pages Final Exam 9 December 2015

Final Project: MIPS-like Microprocessor

Exam in Computer Engineering

Instruction Set Architecture of. MIPS Processor. MIPS Processor. MIPS Registers (continued) MIPS Registers

Programming the processor

ECE 2035 A Programming Hw/Sw Systems Fall problems, 10 pages Final Exam 14 December 2016

ENCM 369 Winter 2013: Reference Material for Midterm #2 page 1 of 5

Concocting an Instruction Set

EE 109 Unit 13 MIPS Instruction Set. Instruction Set Architecture (ISA) Components of an ISA INSTRUCTION SET OVERVIEW

MIPS Assembly Language Programming

Midterm. Sticker winners: if you got >= 50 / 67

ECE260: Fundamentals of Computer Engineering

Computer Organization & Design

ECE 2035 Programming Hw/Sw Systems Fall problems, 10 pages Final Exam 9 December 2013

Project Part A: Single Cycle Processor

Anne Bracy CS 3410 Computer Science Cornell University. [K. Bala, A. Bracy, E. Sirer, and H. Weatherspoon]

Computer Architecture Experiment

Lec 10: Assembler. Announcements

EE108B Lecture 3. MIPS Assembly Language II

INSTRUCTION SET COMPARISONS

ICS 233 COMPUTER ARCHITECTURE. MIPS Processor Design Multicycle Implementation

EE 109 Unit 8 MIPS Instruction Set

Mark Redekopp, All rights reserved. EE 352 Unit 3 MIPS ISA

A General-Purpose Computer The von Neumann Model. Concocting an Instruction Set. Meaning of an Instruction. Anatomy of an Instruction

Review: MIPS Organization

MACHINE LANGUAGE. To work with the machine, we need a translator.

ECE260: Fundamentals of Computer Engineering

software hardware Which is easier to change/design???

Processor. Han Wang CS3410, Spring 2012 Computer Science Cornell University. See P&H Chapter , 4.1 4

Kernel Registers 0 1. Global Data Pointer. Stack Pointer. Frame Pointer. Return Address.

Concocting an Instruction Set

MIPS%Assembly% E155%

Digital System Design II

Introduction to MIPS Processor

Assembly Language. Prof. Dr. Antônio Augusto Fröhlich. Sep 2006

Computer Science 61C Spring Friedland and Weaver. Instruction Encoding

Adventures in Assembly Land

UCB CS61C : Machine Structures

ECE 15B Computer Organization Spring 2010

CS 61c: Great Ideas in Computer Architecture

HW2 solutions You did this for Lab sbn temp, temp,.+1 # temp = 0; sbn temp, b,.+1 # temp = -b; sbn a, temp,.+1 # a = a (-b) = a + b;

Review: Organization. CS152 Computer Architecture and Engineering Lecture 2. Review of MIPS ISA and Design Concepts

Transcription:

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 as signed or unsigned 32-bit numbers. For the non-immediate instructions, the only difference between signed and unsigned instructions (ex ADD vs. ADDU) is that signed instructions can generate an overflow. The instruction formats are given, you can figure out the binary instruction codes. The instruction descriptions are given below. Additional details can be found here: MIPS Single Cycle Processor, John Alexander, Barret Schloerke, Daniel Sedam, Iowa State University ADD Add Adds two registers and stores the result in a register Operation: $d $s + $t; advance_pc (4); Syntax: add $d, $s, $t Encoding: 0000 00ss ssst tttt dddd d000 0010 0000 ADDI Add immediate Adds a register and a signed immediate value and stores the result in a register Operation: $t $s + imm; advance_pc (4); Syntax: addi $t, $s, imm Encoding: 0010 00ss ssst tttt iiii iiii iiii iiii ADDIU Add immediate unsigned Adds a register and an unsigned immediate value and stores the result in a register Operation: $t $s + imm; advance_pc (4); Syntax: addiu $t, $s, imm Encoding: 0010 01ss ssst tttt iiii iiii iiii iiii ADDU Add unsigned Adds two registers and stores the result in a register Operation: $d $s + $t; advance_pc (4); Syntax: addu $d, $s, $t Encoding: 0000 00ss ssst tttt dddd d000 0010 0001 98

AND Bitwise and Bitwise ands two registers and stores the result in a register Operation: $d $s & $t; advance_pc (4); Syntax: and $d, $s, $t Encoding: 0000 00ss ssst tttt dddd d000 0010 0100 ANDI Bitwise and immediate Bitwise ands a register and an immediate value and stores the result in a register Operation: $t $s & imm; advance_pc (4); Syntax: andi $t, $s, imm Encoding: 0011 00ss ssst tttt iiii iiii iiii iiii BEQ Branch on equal Branches if the two registers are equal Operation: if $s == $t advance_pc (offset << 2); else advance_pc (4); Syntax: beq $s, $t, offset Encoding: 0001 00ss ssst tttt iiii iiii iiii iiii BGEZ Branch on greater than or equal to zero Branches if the register is greater than or equal to zero Operation: if $s >= 0 advance_pc (offset << 2); else advance_pc (4); Syntax: bgez $s, offset Encoding: 0000 01ss sss0 0001 iiii iiii iiii iiii BGEZAL Branch on greater than or equal to zero and link Branches if the register is greater than or equal to zero and saves the return address in $31 Operation: if $s >= 0 $31 = PC + 8 (or npc + 4); advance_pc (offset << 2); else advance_pc (4); Syntax: bgezal $s, offset Encoding: 0000 01ss sss1 0001 iiii iiii iiii iiii BGTZ Branch on greater than zero Branches if the register is greater than zero Operation: if $s > 0 advance_pc (offset << 2); else advance_pc (4); Syntax: bgtz $s, offset Encoding: 0001 11ss sss0 0000 iiii iiii iiii iiii BLEZ Branch on less than or equal to zero Branches if the register is less than or equal to zero Operation: if $s <= 0 advance_pc (offset << 2)); else advance_pc (4); Syntax: blez $s, offset Encoding: 0001 10ss sss0 0000 iiii iiii iiii iiii 99

BLTZ Branch on less than zero Branches if the register is less than zero Operation: if $s < 0 advance_pc (offset << 2)); else advance_pc (4); Syntax: bltz $s, offset Encoding: 0000 01ss sss0 0000 iiii iiii iiii iiii BLTZAL Branch on less than zero and link Branches if the register is less than zero and saves the return address in $31 Operation: if $s < 0 $31 = PC + 8 (or npc + 4); advance_pc (offset << 2)); else advance_pc (4); Syntax: bltzal $s, offset Encoding: 0000 01ss sss1 0000 iiii iiii iiii iiii BNE Branch on not equal Branches if the two registers are not equal Operation: if $s!= $t advance_pc (offset << 2)); else advance_pc (4); Syntax: bne $s, $t, offset Encoding: 0001 01ss ssst tttt iiii iiii iiii iiii DIV Divide Divides $s by $t and stores the quotient in $LO and the remainder in $HI Operation: $LO $s / $t; $HI $s % $t; advance_pc (4); Syntax: div $s, $t Encoding: 0000 00ss ssst tttt 0000 0000 0001 1010 DIVU Divide unsigned Divides $s by $t and stores the quotient in $LO and the remainder in $HI Operation: $LO $s / $t; $HI $s % $t; advance_pc (4); Syntax: divu $s, $t Encoding: 0000 00ss ssst tttt 0000 0000 0001 1011 J Jump Jumps to the calculated address Operation: PC npc; npc = (PC & 0xf0000000) (target << 2); Syntax: j target Encoding: 0000 10ii iiii iiii iiii iiii iiii iiii 100

JAL Jump and link Jumps to the calculated address and stores the return address in $31 Operation: $31 PC + 8 (or npc + 4); PC = npc; npc = (PC & 0xf0000000) (target << 2); Syntax: jal target Encoding: 0000 11ii iiii iiii iiii iiii iiii iiii JR Jump register Jump to the address contained in register $s Operation: PC npc; npc = $s; Syntax: jr $s Encoding: 0000 00ss sss0 0000 0000 0000 0000 1000 LB Load byte A byte is loaded into a register from the specified address. Operation: $t MEM[$s + offset]; advance_pc (4); Syntax: lb $t, offset($s) Encoding: 1000 00ss ssst tttt iiii iiii iiii iiii LUI Load upper immediate The immediate value is shifted left 16 bits and stored in the register. The lower 16 bits are zeroes. Operation: $t (imm << 16); advance_pc (4); Syntax: lui $t, imm Encoding: 0011 11-- ---t tttt iiii iiii iiii iiii LW Load word A word is loaded into a register from the specified address. Operation: $t MEM[$s + offset]; advance_pc (4); Syntax: lw $t, offset($s) Encoding: 1000 11ss ssst tttt iiii iiii iiii iiii MFHI Move from HI The contents of register HI are moved to the specified register. Operation: $d $HI; advance_pc (4); Syntax: mfhi $d Encoding: 0000 0000 0000 0000 dddd d000 0001 0000 MFLO Move from LO The contents of register LO are moved to the specified register. Operation: $d $LO; advance_pc (4); Syntax: mflo $d Encoding: 0000 0000 0000 0000 dddd d000 0001 0010 101

MULT Multiply Multiplies $s by $t and stores the result in $Hi and $LO. Operation: $Hi, $LO $s * $t; advance_pc (4); Syntax: mult $s, $t Encoding: 0000 00ss ssst tttt 0000 0000 0001 1000 MULTU Multiply unsigned Multiplies $s by $t and stores the result in $Hi and $LO. Operation: $Hi, $LO $s * $t; advance_pc (4); Syntax: multu $s, $t Encoding: 0000 00ss ssst tttt 0000 0000 0001 1001 NOOP no operation Performs no operation. Operation: advance_pc (4); Syntax: noop Encoding: 0000 0000 0000 0000 0000 0000 0000 0000 Note: The encoding for a NOOP represents the instruction SLL $0, $0, 0 which has no side effects. In fact, nearly every instruction that has $0 as its destination register will have no side effect and can thus be considered a NoOP instruction. OR Bitwise or Bitwise logical ors two registers and stores the result in a register Operation: $d $s $t; advance_pc (4); Syntax: or $d, $s, $t Encoding: 0000 00ss ssst tttt dddd d000 0010 0101 ORI Bitwise or immediate Bitwise ors a register and an immediate value and stores the result in a register Operation: $t $s imm; advance_pc (4); Syntax: ori $t, $s, imm Encoding: 0011 01ss ssst tttt iiii iiii iiii iiii SB Store byte The least significant byte of $t is stored at the specified address. Operation: MEM[$s + offset] (0xff & $t); advance_pc (4); Syntax: sb $t, offset($s) Encoding: 1010 00ss ssst tttt iiii iiii iiii iiii 102

SLL Shift left logical Shifts a register value left by the shift amount listed in the instruction and places the result in a third register. Zeroes are shifted in. Operation: $d $t << h; advance_pc (4); Syntax: sll $d, $t, h Encoding: 0000 00ss ssst tttt dddd dhhh hh00 0000 SLLV Shift left logical variable Shifts a register value left by the value in a second register and places the result in a third register. Zeroes are shifted in. Operation: $d $t << $s; advance_pc (4); Syntax: sllv $d, $t, $s Encoding: 0000 00ss ssst tttt dddd d--- --00 0100 SLT Set on less than (signed) If $s is less than $t, $d is set to one. It gets zero otherwise. Operation: if $s < $t $d 1; advance_pc (4); else $d 0; advance_pc (4); Syntax: slt $d, $s, $t Encoding: 0000 00ss ssst tttt dddd d000 0010 1010 SLTI Set on less than immediate (signed) If $s is less than immediate, $t is set to one. It gets zero otherwise. Operation: if $s < imm $t 1; advance_pc (4); else $t 0; advance_pc (4); Syntax: slti $t, $s, imm Encoding: 0010 10ss ssst tttt iiii iiii iiii iiii SLTIU Set on less than immediate unsigned If $s is less than the unsigned immediate, $t is set to one. It gets zero otherwise. Operation: if $s < imm $t 1; advance_pc (4); else $t 0; advance_pc (4); Syntax: sltiu $t, $s, imm Encoding: 0010 11ss ssst tttt iiii iiii iiii iiii SLTU Set on less than unsigned If $s is less than $t, $d is set to one. It gets zero otherwise. Operation: if $s < $t $d 1; advance_pc (4); else $d 0; advance_pc (4); Syntax: sltu $d, $s, $t Encoding: 0000 00ss ssst tttt dddd d000 0010 1011 103

SRA Shift right arithmetic Shifts a register value right by the shift amount (shamt) and places the value in the destination register. The sign bit is shifted in. Operation: $d $t >> h; advance_pc (4); Syntax: sra $d, $t, h Encoding: 0000 00-- ---t tttt dddd dhhh hh00 0011 SRL Shift right logical Shifts a register value right by the shift amount (shamt) and places the value in the destination register. Zeroes are shifted in. Operation: $d $t >> h; advance_pc (4); Syntax: srl $d, $t, h Encoding: 0000 00-- ---t tttt dddd dhhh hh00 0010 SRLV Shift right logical variable Shifts a register value right by the amount specified in $s and places the value in the destination register. Zeroes are shifted in. Operation: $d $t >> $s; advance_pc (4); Syntax: srlv $d, $t, $s Encoding: 0000 00ss ssst tttt dddd d000 0000 0110 SUB Subtract Subtracts two registers and stores the result in a register Operation: $d $s - $t; advance_pc (4); Syntax: sub $d, $s, $t Encoding: 0000 00ss ssst tttt dddd d000 0010 0010 SUBU Subtract unsigned Subtracts two registers and stores the result in a register Operation: $d $s - $t; advance_pc (4); Syntax: subu $d, $s, $t Encoding: 0000 00ss ssst tttt dddd d000 0010 0011 SW Store word The contents of $t is stored at the specified address. Operation: MEM[$s + offset] $t; advance_pc (4); Syntax: sw $t, offset($s) Encoding: 1010 11ss ssst tttt iiii iiii iiii iiii SYSCALL System call Generates a software interrupt. Operation: advance_pc (4); Syntax: syscall Encoding: 0000 00-- ---- ---- ---- ---- --00 1100 104

XOR Bitwise exclusive or Exclusive ors two registers and stores the result in a register Operation: $d $s ^ $t; advance_pc (4); Syntax: xor $d, $s, $t Encoding: 0000 00ss ssst tttt dddd d--- --10 0110 XORI Bitwise exclusive or immediate Bitwise exclusive ors a register and an immediate value and stores the result in a register Operation: $t $s ^ imm; advance_pc (4); Syntax: xori $t, $s, imm Encoding: 0011 10ss ssst tttt iiii iiii iiii iiii 105