Basics of MIPS Assembly

We have a fairly dense post in front of us, in which we will see the basics of programming in MIPS assembly. By the end of the guide we will be able to do quite a bit (such as operating on vectors and matrices), and also ready to tackle recursion.

This post has been originally written in Italian and then automatically translated, after attending the Computer Architectures course by prof. Andrea Sterbini at Sapienza University of Rome, thus contents are heavily based on that course.

Here is a roadmap of what we will see today:

  • Specialized and non-specialized registers;
  • Syscalls;
  • Directives to the assembler;
  • Instruction formats;
  • Conditional and non-conditional jumps;
  • Cycles;
  • Vectors and arrays.

Programming in assembly is a totally different experience than programming with any high-level language. We have direct access to registers, and we can optimize (or make worse) code with a high level of precision.

In this post we will use MARS: a MIPS IDE that also integrates a simulator.

Without wasting any more time on small talk, let’s get started.


In assembly we have direct access to registers. In particular, we have 31 registers (plus those about floating-point data), which conventionally are used to do specific things.

Here are the standard MIPS registers:

#NameDescription or conventional useNotes
$0$zeroContains only the value 0
$1$atReserved for pseudo-instructions
$2-$3$v0-$v1Function return values
$4-$7$a0-$a3Arguments of functions, not preserved between functions
$8-$15$t0-$t7Temporary data, not preserved between functions
$16-$23$s0-$s7Saved data, preserved between functions
$24-$25$t8-$t9Temporary data, not preserved between functions
$26-$27$k0-$k1Preserved for kernel
$28$gpGlobal Area Pointer (data segment base)
$29$spStack Pointer
$30$fpFrame Pointer
$31$raReturn address
$f0-$f3-Floating point return values
$f4-$f10-Temporary floating-point registers, not preserved between functions
$f12-$f14-First two floating-point arguments, not preserved between functions
$f16-$f18-Temporary floating-point data, not preserved between functions
$f20-$f31-Saved floating-point data, preserved between functions

A couple of notes:

  • In the code we can use either register number (e.g. $0) or name (e.g. $zero);
  • The difference between preserved and non-preserved data between functions is only conventional, and does not concern behavior that happens automatically. To give an example, it means that by convention you should not use temporary registers to save or pass data between functions;
  • The register with the constant $zero exists because it is very useful.


Before we get on with the formats, let’s see some examples of instructions in ASM MIPS involving registers:

# $t0 = $t0 + $t1
add $t0, $t0, $t1

# $t0 = $t0 + 1
add $t0, $t0, 1

# $s0 = $t2
move $s0, $t2

# $t1 = read_mem($sp + 4)
lw $t1, 4($sp)

A few words about these examples:

  • We found that the comments begin with #;
  • We found that the syntax is quite simple: it may or may not always be in the style instruction_code op1, op2 [, op3];
  • To use constant values there is an i at the end of the instructions (we will see why);
  • The last instruction (load word) reads from memory at the address given by $sp + 4 bytes (offset 4), and saves it in $t1; we can also see the situation as accessing an array that starts at the address contained in $sp, and our vector is 32-bit word (4 bytes), accessing byte 4 means logically accessing index 1.

Nice huh?


Syscalls are literally calls to the operating system, which are primarily for input and output operations. An example might be reading characters from the keyboard, and writing something on the screen.

There are several types of syscalls, identified by a number, and they work like this:

  1. We load the syscall code into an appropriate register;
  2. We load any values into appropriate argument registers;
  3. We call the syscall;
  4. We retrieve any return values from the appropriate result registers.

A very quiet example for printing a number:

addi $a0, $0, 42 # alternative to move $a0, 42
li $v0, 1 # load service "print integer"
syscall # call syscall 1
# result: print 42

So, I understand that at this instant the situation may be a little confusing, but it is intended. We will now put the pieces back together with a nice list of syscalls that MARS provides, along with their descriptions and registers involved.

print integer1$a0 = integer to print
print float2$f12 = float to print
print double3$f12 = double to print
print string4$a0 = string address (NULL-terminated) to print
read integer5$v0 ← integer read
read float6$f0 ← float read
read double7$f0 ← double read
read string8$a0 = input buffer address$a1 = max characters to read
print character11$a0 = character to print
read character12

This list is incomplete, because it includes only the syscalls that we will use most frequently in this series of articles. You can read the complete list in the MARS documentation (press F1), or in the online documentation.

Examples of other syscalls are those to generate random numbers, manage files, ask for the date, make windows appear, and cast spells.


Before trying this example, disable popup windows for keyboard input; find the option under Settings.

Let’s pretend we want to take two numbers from the keyboard, add them up, and spit out the result. In doing so, we also want to facilitate the user with guidance messages, such as “Enter number:” and “The result is:”.

We could do something like this (also available also on GitHub):

.globl main

  prompt1: .asciiz "Integer 1: "
  prompt2: .asciiz "Integer 2: "
  resultDescr: .asciiz "The result is "


  # prompt1
  the $a0, prompt1
  li $v0, 4

  # read number 1
  li $v0, 5
  # move it to $t0
  move $t0, $v0
  # prompt number 2
  la $a0, prompt2
  li $v0, 4
  # read number 2
  li $v0, 5

  # sum the two numbers
  addu $a1, $v0, $t0
  # save result text
  the $a0, resultDescr
  li $v0, 4
  # load result where needed
  move $a0, $a1
  # print integer
  li $v0, 1
  # terminate program
  li $v0, 10

In this example we also introduced some new little things. Let’s see.

  • Directives:
    • .globl main tells the assembler that the main symbol can also be accessed from another file;
    • .data delimits the beginning of the data segment, which is the container of static data in the object file:
      • .asciiz indicates that the string in quotes is ASCII and terminated by NULL (byte 0).
    • .text delimits the beginning of the text segment, that is, the container of the instructions in the object file.
  • Symbols:
    • main is in this case our entry point.

When executed, the program does this:

  1. With load address (la) we load into $a0 the string address of the first prompt;
  2. We load the print string (4) service with the load immediate (li);
  3. We execute the syscall to bring up the string;
  4. We load the read integer (4) service and run the syscall;
  5. Now the read number is available in $v0, but for convenience we copy it to $t0;
  6. We repeat steps 1-4 for the second prompt and number;
  7. We sum the numbers with an addu (add unsigned) to avoid having to handle any overflow. In case we want to, we can use a simple add;

The rest is quite understandable having analyzed what happens before. We end execution with the 10 syscall.

Directives to the assembler

We saw a couple of these a little while ago, and now we explain them in general. With directives we tell the assembler:

  • How to handle certain things (e.g., alignment of values to byte);
  • How to prepare the object file (e.g., start of segments);
  • What to put in it (e.g., static data);
  • Whether to use more human names for registers;
  • Whether to group a sequence of instructions in macro.

Directives begin with a period, and the ones we will use are:

.textBeginning of the instruction block
.globl xIndicates that label x is accessible from another file
.dataStart of static data block
.eqv $name, $regAllows us to use $name to refer to $reg
.macro and .end_macroDefines a macro

Within the .data block we can define static data in these ways:

label: .type val1, val2, ..., valn # n comma separated values
label: .type val:n # n repeated values 

Where .directive can be any of these:

.align kAlign the next data to the power k^2.align 2
.spaceReserve n bytess: .space 255
.wordAllocates space for some wordsn: .word 1,2,3
.halfAllocates space for some half-wordh: .half 0:10
.asciizAllocates an ASCII text terminated by 0txt: .asciiz "Hello"
.asciiAllocates an ASCII texttxt: ascii "Hello"

We need to say a few words about the .align directive. If we use it, the assembler will cause all data to be aligned by a certain number of bytes, given by 2^k. In other words, the start positions of the data will be aligned to an accuracy of 2^k.

Usually .align 2 is used to align data at multiples of 4. The reason is simple: since the hardware is optimized to transfer words (4 bytes), we make it easier to retrieve them (the start position of the data is easily computed, because it has precision of one word).

The downside of this directive is that it inevitably creates holes in memory.

The macros allow us to define blocks of code as if they were functions. During assembly, they are replaced by the code they contain.

An example of a macro might be:

.macro takeInt (%regDst)
	li $v0, 5
	move %regDst, $v0

This macro generalizes the behavior of taking an integer as input, as we saw earlier. The macros are called in the code as if they were high-level functions, so:

# ...
takeInt ($s0)
# ...


Let’s stop for a moment

Before we move on to jumps (which are super cute), we have to deal with something boring and ugly, but we need it to understand why in MIPS we can’t do virtuous things like lw $t0($t1), and also to understand what that i means in instructions like adds, subs, mules, etc.

So I would say take a break, where you do some exercises to consolidate these few bits of knowledge we’ve seen. Some ideas:

  • Create any variation of the example seen earlier;
  • Take as input two integers and a separator character, and print these things separated by the given character:
    • Number 1;
    • Number 2;
    • Their product;
    • Their sum + 42.

Instructions format

Here we go again.

This part goes hand in hand with the single-clock-cycle MIPS CPU scheme, so if you haven’t seen it yet I suggest you do it about now.

We should know that the instructions we use in ASM MIPS are an abstraction that masks us writing sequences of bits; at a low level, in fact, an instruction is a sequence of bits that is fed to the CPU.

At appropriate stages of execution, equally appropriate functional units of the CPU take the bits of the instruction they need (based on the active control signals).

I have spoken in a rather obfuscated way here, because these are things we see more clearly in the theory article I linked to a few lines ago.

We can also see that MIPS instructions can be divided into 4 groups, based on how they work. In fact, we have instructions that:

  • Operate only on registers;
  • Operate on registers, and constants;
  • Make jumps:
    • Under certain conditions;
    • In any case.

Hence the existence of 3 encodings of MIPS instructions. I true: the numbers do not add up; the reason is that we can summarize those 4 behaviors in only 3 encodings.

Encoding R (Register)

These instructions operate only on registers (e.g. add, move), and their format is this:


Some instructions of type R are add, sub, and, xor, sra, jal.

Encoding I (Immediate)

Here is finally the meaning of that i. In MIPS, instructions that have a space for a numeric constant are called immediate.


In this category also fall instructions that execute conditional jumps, i.e. those of the branch family (we will see them in a moment).

Some examples of instructions of type I are addi, andi, slt, bne, lui, lw, sw, lb.

Encoding J (Jump)

Here we have unconditional jumps, i.e., those that are always executed, without the need to satisfy a condition.


We have only two such instructions: j and jal.

Well, we got that part out of the way.


We have just introduced them, and now we talk more about them.

As mentioned earlier, we have two types of jumps:

  • Conditional: branch;
  • Unconditioned: jump.

Unconditioned jumps

This type of jump is very simple. Basically, whenever an instruction of this type is encountered, we jump to the indicated destination.

The syntax is:

type_jump label

Where label is the label denoting the instruction to jump to. See:

Jump typeTo voiceUsage
jJumpj label
jalJump and Linkjal label

The jal saves the contents of the program counter (PC) in $ra, and is used to call functions by saving the address from which to resume execution when finished. We will see more in the next article.


Branches are those that in a high-level language correspond to if.

In MIPS we do not have the same flexibility of that type of construct, but it is much more rudimentary. The syntax here is:

type_branch $reg1, $reg2, label

In which the two registers are compared based on the type of branch operation, and if positive, execution jumps to the instruction denoted by label.

There are branches in which 0 is compared, and they have a more compact syntax.

Branch typeTo itemUsageJump if op1 ? op2
beqBranch if equalbeq $t0, $t1, label==
bneBranch if not equalbne $t0, $t1, label!=
bltBranch if less thanblt $t0, $t1, label<
bleBranch if less or equalble $t0, $t1, label<=
bgtBranch if greater thanbgt $t0, $t1, label>
bgeBranch if greater or equalbge $t0, $t1, label>=
beqzBranch if equal to zerobeqz $t0, label
bnezBranch if not equal to zerobne $t0, label
  • Can you think of a way to use a branch to always jump?

PRO TIP: Save the MIPS Reference Card.


In MIPS we do not have instructions that allow us purely to create loops, but we can make them combining banch and jump.

Depending on the type of loop we want, we have patterns.

Some notes:

  • I use branch as a placeholder for beq, bne, etc.;
  • I use dummy labels (such as do, while, for) to show similarities, but you can use unique, context-appropriate labels.


If at a high level we want:

do {
  // stuff
} while (cond)

In MIPS we have:

  # stuff
  branch $a, $b, do


High level:

while (cond) {
  // stuff


  branch (not_cond), endWhile.
  # stuff
  j while
# rest of program

Note that we need to negate the condition.


High level:

for (i; i<n, i++) {
  // stuff


  branch not_cond endFor.
  # stuff
  addi $i, $i, 1
  j for
# rest of program

Also here from the conceptual point of view we have to negate the initial condition.

Let’s (again) take a break

Before killing ourselves with vectors, it pays to pause and do some exercises. Again, here are some ideas:

  • Calculator: given as input two integers and an operation encoded as an integer, print the result of the calculation. Then compare with this example;
  • Cumulative Sum:
    • Take as input a number n;
    • Take as input n integers, and as you go add them to register $s0;
    • Print the result.
  • strlen: Print the length of a string taken as input;
  • str2int:
    • Take a string and iterate over it;
    • For each character, prints its integer value (hint: ASCII table);
    • If the character is uppercase (same hint), add its integer value to a comulative sum;
    • When finished, print the comulative sum.

Vectors and Matrices

A vector is a data structure in which there is contiguous data of the same length. They are easily imagined in memory as a chopped segment.

What you need to know is that access to a vector is direct: it means that given a starting address (base) and an offset (offset), we access the position we are interested in directly, without going through the previous ones (which happens, for example, in lists).

For example, reasoning in C-like:

type vector[2] <=> vector + 2*sizeof(type)

In MIPS assembly, then, we need only replicate the reasoning just seen: to access an element we must:

  1. Get the current index i;
  2. Multiply it by the size of the type;
  3. Add it to the starting address of the vector.

As an example, suppose we want to access the position 2 of a vector of integers V:

.eqv $i, $t0 # index
.eqv $offs, $t1 # offset
.eqv $data, $t2 # data read

addi $i, $0, 2 # i=2
sll $offs, $i, 2 # offset=i*4
lw $data, V($offs) # data=read_mem(V+offset)

Note the sll line: we do the shift left logical by 2 positions because it is equivalent to multiplying the index by 4, which is the size in bytes of an integer (word).

If, on the other hand, we operate on a vector of bytes (a string, for example), there is no need to multiply.

The situation is a bit more complicated for matrices, because we have to forget about the very convenient access with rows and columns, because they do not exist. We have to imagine that we have a very long row that contains all the “rows” of the matrix.

We realize that to access an element we have to:

  1. Take the base;
  2. Calculate the vertical offset (row offset): row*dimRow;
  3. Calculate the offset horizontally (column offset): column*sizeof(type);
  4. Sum the two offsets to the base.

Thus we have that:

int M[X][Y];

M[x][y] <=> M + y*Y + x*sizeof(int)

You have some examples available for both vectors and matrices.


MIPS is nice, isn’t it?

If you want to be cool, try doing some branch reduction if needed: restructure your code to avoid unnecessary branches.

Related Posts