Asm program... something goes wrong - debugging

I load two arrays. I have to return a third array that contain the sum of the two and has the dimension of the smaller. Print the last one.
Example:
INPUT: Array1: [1 2 3 4 5] Array2: [2 6 1]
OUTPUT: Array3: [3 8 4]
Program runs... it give me the exact number of elements but every element is 0.
.data
vett1: .word 0:100
vett2: .word 0:100
vett3: .word 0:100
x: .word 0
space: .asciiz " "
.text
.globl main
main:
la $a0, vett1
la $a1, vett2
la $a2, vett3
la $a3, x
li $t0, 0
li $t1, 0
li $t2, 0
jal loadA1 #mi salvo 26 salto a caricavettore1
jal loadA2 #mi salvo 27 salto a caricavettore2
jal lenght #mi salvo 28 salto a controllalunghezza
lw $t2, ($a3)
lw $t3, ($a3)
la $a0, vett1
la $a1, vett2
la $a2, vett3
jal summ
jal print
li $v0, 10
syscall
loadA1:
li $v0, 5
syscall
beq $v0, -1, exit
sw $v0, ($a0)
addi $t0, $t0, 1
addi $a0, $a0, 4
j loadA1
exit: jr $ra
loadA2:
li $v0, 5
syscall
beq $v0, -1, exit2
addi $t1, $t1, 1
sw $v0, ($a1)
addi $a1, $a1, 4
j loadA2
exit2: jr $ra
lenght:
blt $t0, $t1, cond1
sw $t1, ($a3)
jr $ra
cond1: sw $t0, ($a3)
jr $ra
summ:
subi $sp, $sp, 4
sw $ra, 0($sp)
bnez $t2, rec
j exit3
rec: lw $s0, ($a0)
lw $s1, ($a1)
add $v0, $s0, $s1
sw $v0, ($a2)
addi $a0, $a0, 4
addi $a1, $a1, 4
addi $a2, $a2, 4
subi $t2, $t2, 1
jal summ
exit3:
lw $ra, 0($sp)
addi $sp, $sp, 4
jr $ra
print:
beqz $t3, exit4
lw $a0, ($a2)
li $v0, 1
syscall
la $a0, space
li $v0, 4
syscall
addi $a2, $a2, 4
subi $t3, $t3, 1
j print
exit4: jr $ra

When you sum the two arrays you add 4 to $a2 at the end of each iteration to point it to the next element of vett3. So after the summing is complete $a2 will point to the first memory location after the end of vett3.
Then you call print but don't reset $a2 to point at the start of vett3, so you end up printing garbage data (which could happen to be all zeroes - or mostly zeroes at least, since x and space will be there).

Related

Runtime exception at 0x0040002c: address out of range 0x00000001 in MIPS Assembler for ceasar encryption

The Programm compiles just fine but as soon as i give input this error is thrown:
"Error in line 28: Runtime exception at 0x0040002c: address out of range 0x00000001
Processing terminated due to errors."
Here ist the code for my programm:
.data
line: .space 80
.text
main:
# read line from stdin
li $v0, 8
la $a0, line
li $a1, 80
syscall
# call caesar_line
li $a0, 1
jal caesar_line
# return 0
li $v0, 0
jr $ra
caesar_line:
# save start of line
move $t0, $a0
# loop through line
loop:
# load the character from memory
move $t1, $a0
lb $a0, 0($t1)
beqz $a0, end_loop
jal caesar_char
sb $v0, 0($t1)
addi $t1, $t1, 1
move $a0, $t1
j loop
end_loop:
# print line
li $v0, 4
move $a0, $t0
syscall
jr $ra
caesar_char:
# check if c is lowercase
blt $a0, 'a', upper
bgt $a0, 'z', not_alpha
addi $a1, $a1, 'a'
jal caesar_helper
j done
upper:
# check if c is uppercase
blt $a0, 'A', not_alpha
bgt $a0, 'Z', not_alpha
addi $a1, $a1, 'A'
jal caesar_helper
j done
not_alpha:
# not an alphabetical character
move $v0, $a0
j done
caesar_helper:
# subtract base from c
sub $t0, $a0, $a2 # $t0 = c - base
# add distance + 26 to c
addi $t0, $t0, 26 # $t0 += 26
add $t0, $t0, $a1 # $t0 += distance
# calculate c % 26
li $t1, 26 # $t1 = 26
div $t0, $t1 , $t1 # $lo = c % 26
mflo $t0
# add base to c
add $v0, $t0, $a2 # $v0 = c + base
done:
jr $ra
Not even ChatGBT could find an error.
The code should shift all chars of an string by a certain amount, but as soon as it is run the error above is thrown.

MIPS Selection Sort Not Working

I am trying to write a selection sort algorithm in MIPS but am having problems. I have tested my swap and findSmallest functions individually and they appear to be working but when I run the code I get some addresses (I'm assuming) in the output.
.data
.align 2
values: .word 12, 15, 13, 2, 25, 3, 5
valueCount: .word 7
initialPrint: .asciiz "\Unsorted Array: \n"
donePrint: .asciiz "\n Sorted Array: \n"
comma: .asciiz ", "
.text
.globl main
main: # Beginning stuff
la $a0, initialPrint # load initialPrint string into a0
li $v0, 4 # set code (4) to print string
syscall # print initialPrint
la $s6, values
la $s7, valueCount
lw $s7, 0($s7) # extract valueCount word from s7
move $a0, $s6 # move values into $a0 for function call
move $a1, $s7 # move valueCount into $a1 for function call
jal printList # print initial array
li $s1, 0 # index = 1
selectionSort: # Middle stuff
bge $s1, $s7, endPrint
move $a0, $s6 # move values into $a0 for function call
move $a1, $s7 # move valueCount into $a1 for function call
move $a2, $s1 # move index into $a2 for function call
jal findSmallest # Let's get this show on the road
move $a0, $v0 # move smallestIndex into a0
move $a1, $s1 # move currentndex into $a1
move $a2, $s6 # move values into $a2
jal swap # swap
move $s6, $v0 # move swapped array into $s6
addi $s6, $s6, 4 # next position in array
addi $s1, $s1, 1 # index++
j selectionSort
# Ending stuff
endPrint: la $a0, donePrint # load donePrint string into a0
li $v0, 4 # set code (4) to print string
syscall # print donePrint
move $a0, $s6 # move values into $a0 for function call
move $a1, $s7 # move valueCount into $a1 for function call
jal printList # print initial array
li $v0, 10 # load end call
syscall # end
##########################################################################################
############# findSmallest Function ##################################################
##########################################################################################
## takes in array, current index, and valueCount
## examines all elements from n-index through n
## outputs index of lowest value
findSmallest: ## Begin Function
addi $sp, $sp, -24 # preserve state before function call
sw $ra, 0($sp)
sw $s0, 4($sp)
sw $s1, 8($sp)
sw $s2, 12($sp)
sw $s3, 16($sp)
sw $s4, 20($sp)
sw $t1, 24($sp)
## s0 = values
## s1 = valueCount
## s2 = index
## s3 = smallestIndex
## s4 = smallestValue
## t1 = currentValue
## Function Body
move $s0, $a0 # move values into s0
move $s1, $a1 # move valueCount into s1
move $s2, $a2 # move index into s2
lw $s4, 0($s0) # load first word
addi $s0, $s0, 4 # move to next word
addi $s2, $s2, 1
floop: bge $s2, $s1, endLoop # if index >= valueCount then done
lw $t1, 0($s0) # load currentValue
ble $s4, $t1, skip # if smallestValue < currentValue then skip
move $s4, $t1 # set smallestValue = currentValue
move $s3, $s2 # set smallestIndex = currentIndex
skip:
addi $s0, $s0, 4 # iterate to next word in values
addi $s2, $s2, 1 # index++
j floop # repeat loop
endLoop: move $v0, $s3
# End Function Stuff
lw $ra, 0($sp) # restore state before function call
lw $s0, 4($sp)
lw $s1, 8($sp)
lw $s2, 12($sp)
lw $s3, 16($sp)
lw $s4, 20($sp)
lw $t1, 24($sp)
addi $sp, $sp, 24
jr $ra
##########################################################################################
############# swap Function ##########################################################
##########################################################################################
swap: # Begin Function
addi $sp, $sp, -32 # preserve state before function call
sw $ra, 0($sp)
sw $s0, 4($sp)
sw $s1, 8($sp)
sw $t1, 12($sp)
sw $t2, 16($sp)
sw $t3, 20($sp)
sw $t4, 24($sp)
sw $s6, 28($sp)
# main function
move $s0, $a0 # move smallestIndex into function
move $s1, $a1 # move targetIndex into function
move $s6, $a2
sll $s0, $s0, 2
add $t1, $s0, $s6
lw $t2, 0($t1) # get the value from the array cell
sll $s1, $s1, 2
add $t3, $s1, $s6
lw $t4, 0($t3) # get the value from the array cell
sw $t2, 0($t3)
sw $t4, 0($t1)
move $v0, $s6
# End Function # restore state before function call
lw $ra, 0($sp)
lw $s0, 4($sp)
lw $s1, 8($sp)
lw $t1, 12($sp)
lw $t2, 16($sp)
lw $t3, 20($sp)
lw $t4, 24($sp)
lw $s6, 28($sp)
addi $sp, $sp, 32
jr $ra
##########################################################################################
############# printList Function #####################################################
##########################################################################################
# a0 - values array (address)
# a1 - valueCount (word)
# s6 - values
# s7 - valueCount (word)
printList:
## Setup
## Begin Function
addi $sp, $sp, -16 # allocate stack space for 3 values
sw $ra, 0($sp) # store return adder
sw $s6, 4($sp)
sw $s7, 8($sp)
sw $s0, 12($sp)
move $s6, $a0
move $s7, $a1
li $s0, 1 # index = 1
print:
lw $a0, 0($s6)
li $v0, 1 # load output call
syscall # output value
la $a0, comma # load comma string into a0
li $v0, 4 # set code (4) to print string
syscall # print initialPrint
addi $s6, $s6, 4
addi $s0, $s0, 1
ble $s0, $s7, print
# End Function Stuff
lw $ra, 0($sp) # store return adder
lw $s6, 4($sp)
lw $s7, 8($sp)
lw $s0, 12($sp)
addi $sp, $sp, 16
jr $ra
My output:
Unsorted Array:
12, 15, 13, 2, 25, 3, 5, soSorted Array:
25, 1684370546, 13, 3, 540703073, 1869835861, 1953656659,
It has to be something with the way the array is being stored because there are memory addresses in the output.
I found a number of issues in your code:
move $a0, $v0 # move smallestIndex into a0
move $a1, $s1 # move currentndex into $a1
move $a2, $s6 # move values into $a2
jal swap # swap
Here you're passing a couple of indices that are relative to the beginning of the array, but $s6 is incremented at the end of each iteration, so it will only point to the beginning of the array during the very first iteration. Instead of move $a2, $s6 you should use la $a2, values.
move $s6, $v0 # move swapped array into $s6
This should be removed altogether.
move $a0, $s6 # move values into $a0 for function call
move $a1, $s7 # move valueCount into $a1 for function call
jal printList
Here you should place the base address of the array in $a0, so it should be la $a0, values instead of move $a0, $s6.
And in findSmallest you don't seem to initialize $s3 for the case where the first element is the smallest one.

MIPS/MARS Runtime exception at 0x00400018: address out of range 0x00000000

Im trying to run some code in MARS, but i get a runtime error
the error happens at line 9
lb $t1, ($t0)
my code is:
MAIN: addi $sp, $sp, -4
sw $ra, ($sp)
add $t6, $0, 0x30 # '0'
add $t7, $0, 0x39 # '9'
add $s0, $0, $0
add $t0, $a0, $0
LOOP:
lb $t1, ($t0)
slt $t2, $t1, $t6
bne $t2, $0, DONE
slt $t2, $t7, $t1
bne $t2, $0, DONE
sub $t1, $t1, $t6
beq $s0, $0, FIRST
mul $s0, $s0, 10
FIRST:
add $s0, $s0, $t1
addi $t0, $t0, 1
j LOOP
DONE:
add $v0, $s0, $0
lw $ra, ($sp)
addi $sp, $sp, 4
jr $ra
im fairly new to mips so i would love an explonation whats happening or is it just an syntax error ?

Assembly MIPS Stack, keep .data

Hello I'm trying to make a Quicksort, sorting algorithm using assembly (MIPS). I'm fairly new to assembly and I'm having some problems with how to use the stack in my program.
What I am trying to do is to use the stack in order to make the quicksort subroutine recursive. The problem I get when doing this is that the array that I'm trying to sort when moving the stack pointer.
Here's the code:
main:
li $s4, 0 # Min value of the range inside the array you want to sort
li $s5, 15 # Max value of the range inside the array that you want to sort
add $t6, $zero, $s4 # left-value
add $t7, $zero, $s5 # right-value
addiu $sp, $sp, -12 # We need space for the register $ra and register $a0
sw $ra, 0($sp) # A must have, if you wanna come back and avoid strange behaviour
sw $s4, 4($sp)
sw $s5, 8($sp)
jal quickSort
nop
ori $v0,$zero,10 # Prepare syscall to exit program cleanly
syscall
quickSort:
move $a0, $zero
add $a0, $zero, $t6 # Min value of the range inside the array you want to sort
move $a1, $zero
add $a1, $zero, $t7 # Max value of the range inside the array that you want to sort
li $t5, 4 # Temp to mult with
move $t3, $zero
add $t3, $a0, $a1
div $t3, $t3, 2
mult $t3, $t5
mflo $t3
lw $s0, data($t3) # Pivot = (min size + max size) / 2
mult $a1, $t5 # offset for min value
mflo $s1, # offset for array min
mult $a2, $t5 # offset for max value
mflo $s2 # offset for array max
sortLoop:
bgt $a0, $a1, endLoop # While min value is less or equal to max value
nop
leftLoop:
lw $t4, data($s1)
bge $t4, $s0, rightLoop
nop
add $s1, $s1, 4
add $a0, $a0, 1
j leftLoop
nop
rightLoop:
lw $t5, data($s2)
ble $t5, $s0, switchValue
nop
add $s2, $s2, -4
add $a1, $a1, -1
j rightLoop
nop
switchValue:
bgt $a0, $a1, repeat
nop
sw $t5, data($s1)
sw $t4, data($s2)
add $s1, $s1, 4
add $a0, $a0, 1
add $s2, $s2, -4
add $a1, $a1, -1
repeat:
j sortLoop
endLoop:
recursion:
bge $s4, $a1, recursion2
nop
addiu $sp, $sp, -12
sw $ra, 0($sp)
sw $a0, 4($sp)
sw $a1, 8($sp)
move $t6, $zero
add $t6, $t6, $s4 # left-value
move $t7, $zero
add $t7, $t7, $a1
jal quickSort
nop
recursion2:
bge $a0, $s5,endSorting
nop
addiu $sp, $sp, -12
sw $ra, 0($sp)
sw $a0, 4($sp)
sw $a1, 8($sp)
move $t6, $zero
add $t6, $zero, $a0
move $t7, $zero
add $t7, $zero, $s5
jal quickSort
nop
endSorting:
lw $ra, 0($sp)
lw $s4, 4($sp)
lw $s5, 8($sp)
addi $sp, $sp, 12
jr $ra
nop
My questions are as following:
Does the .data values also go to the stack?
Is this the proper use of the stack?
If not is there any good tutorials or something that can help me learn it better?

Bubble Sort in MIPS

I am trying to sort an array of integers in MIPS using bubble sort but every time that I run bubble sort I get an address out of range error. I have been staring at the code for hours and have no idea why this is happening. Hopefully' it is something really obvious that someone with more experience can see and help me fix.
The point of the program is simply to read in integers and symbols (price of stock, and stock symbol) and then sort those based on the prices. Here is the code:
.data
welcome: .asciiz "Welcome!\n"
prompt1: .asciiz "Enter how many stocks you have.\n >"
prompt2: .asciiz "Enter the four character NASDAQ abbrevation and price for each stock.\n"
prompt3p1: .asciiz "You have entered "
prompt3p2: .asciiz " stock abbreviations and prices. How many stocks do you want to buy:\n"
prompt4: .asciiz "How many stocks do you want to sell:\n"
InfoPrompt: .asciiz "Here are the symbols and the corresponding numbers that were entered: \n"
numStocks: .word 0
stockPrice: .space 40 # this will be the list of the stock prices
stockSymbol: .word 0:20 # this will be for the lit of stock abbrevs
symbols: .space 12 #this should be used for a 40 character array
inputFormat: .asciiz "\n> "
length: .word 0
buffer: .space 4
.globl main
.text
main: # display all of the propts
li $v0, 4 # get ready to print welcome
la $a0, welcome
syscall # print welcome
li $v0, 4 # not sure this is necessary since it was already loaded into v0 before
la $a0, prompt1
syscall # print("enter how many stocks you have.")
li $v0, 5 # this will get ready to accept the number of stocks
syscall # this should store the number into the $v0 register
sw $v0, numStocks # store in memory so we dont lose it
move $t0, $v0 # this will hold the num of stocks
#before we go into the procedure we need to declare and move the stack for the $t registers.
la $t1, symbols
la $t2, stockPrice
sub $sp, $sp, 8
sw $t1, 0($sp)
sw $t2, 4($sp)
jal getInfo
# now that we have all the information lets run a test to see how successful we were
# jal printInfo
li $v0, 4 #get ready to ask how many items you want to buy
la $a0, prompt3p1
syscall
li $v0, 1
lw $a0, numStocks # prints the number of stocks in the portfolio
syscall
li $v0, 4
la $a0, prompt3p2
syscall
# we need to now get the number of stocks the person wants to buy
li $v0, 4
la $a0, inputFormat
syscall #format the next input
li $v0, 5
syscall
move $t3, $v0 # the number of stocks we want to buy is now stored as $t3
#we need to get how many they want to buy
li $v0, 4
la $a0, prompt4
syscall
li $v0, 4
la $a0, inputFormat
syscall #format the next input
li $v0, 5
syscall
move $t4, $v0 # the number of stocks that you want to sell
# now we have to sort the list to figure out what elements we are going to sell and buy
la $a2, stockPrice
la $a0, stockPrice
la $a1, numStocks
jal buble_sort
jal printInfo
# end program
li $v0,10 #load the syscall number for terminating
syscall #terminate
####################################################################
# This will iterate for the number of stocks
# Only accepts the number of stocks
####################################################################
getInfo:
sub $sp, $sp, 8
sw $ra, 0($sp) # store the return value
sw $t0, 4($sp) # Save the t registers that we will be using
li $v0, 4 # set up the first call to initialize the calls for the abbreviations and numbers
la $a0, prompt2
syscall
# we want to have a place to store the symbols
la $t1, symbols
la $t2, stockPrice
GI_loop:
beq $t0, $zero, GI_loop_done # if the counter == 0 then we are done
li $v0, 4
la $a0, inputFormat
syscall #format the next input
# ask for the string input
li $v0, 8
la $a0, 0($t1)
li $a1, 6
syscall
#store the value in the array
addi $t1, $t1, 6 #increment our "array"
# ask for the integer input
li $v0, 4
la $a0, inputFormat
syscall #format the next input
li $v0, 5
syscall # get the integer value that we require
sw $v0, 0($t2) #store the value
addi $t2, $t2,4 #increment our counter
addi $t0, $t0, -1 # decrement our counter
j GI_loop
GI_loop_done:
lw $ra, 0($sp)
lw $t0, 4($sp)
lw $t1, 8($sp)
lw $t2, 12($sp)
add $sp, $sp, 8
jr $ra
####################################################################
# This will go through the lists and print out what was stored
# will go through the symbols then the numbers
####################################################################
printInfo:
sub $sp, $sp, 12
sw $ra, 0($sp)
sw $t0, 4($sp) # this will store the number of stocks that were entered
sw $t1, 8($sp)
li $v0, 4
la $a0, InfoPrompt
syscall
# we know that $t0 stores the correct number that was originally enetered so we need to loop through and print all the integers
InfoLoop:
beq $t0, $zero, InfoLoopDone # a basic counter check
#li $v0, 4
#la $a0, 0($t1)
#syscall
#addi $t1, $t1, 6
#addi $t0, $t0, -1
#j InfoLoop
################################### INTEGER PRINT WORKING
li $v0, 1 # this will print out the integers
lw $a0, 0($t2) # we have to load the world that is found in the address of $t2
syscall
addi $t2,$t2, 4 # this will increment the array
addi $t0, $t0, -1 ## this will fix our counter
j InfoLoop
InfoLoopDone:
lw $ra, 0($sp)
lw $t0, 4($sp)
add $sp, $sp, 8
jr $ra
################################
# BUBBLE SORT
################################
buble_sort:
#a0=address of table
#a1=sizeof table
add $t0,$zero,$zero #counter1( i )=0
loop1:
addi $t0,$t0,1 #i++
bgt $t0,$a1,endloop1 #if t0 > a1 break;
add $t1,$a1,$zero #counter2=size=6
loop2:
bge $t0,$t1,loop1 #j < = i
#slt $t3,$t1,$t0
#bne $t3,$zero,loop1
addi $t1,$t1,-1 #j--
mul $t4,$t1,4 #t4+a0=table[j]
addi $t3,$t4,-4 #t3+a0=table[j-1]
add $t7,$t4,$a2 #t7=table[j]
add $t8,$t3,$a2 #t8=table[j-1]
lw $t5,0($t7)
lw $t6,0($t8)
bgt $t5,$t6,loop2
#switch t5,t6
sw $t5,0($t8)
sw $t6,0($t7)
j loop2
endloop1:
jr $ra
Your problem is in the statement before calling your bubble sort routine:
la $a1, numStocks
It will load the address where the number of stocks are saved, not the number of stocks itself.
You should change it with
lw $a1, numStocks

Resources