-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLab6-Assignment1.asm
38 lines (38 loc) · 1011 Bytes
/
Lab6-Assignment1.asm
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#Laboratory Exercise 6, Assignment 1
.data
A: .word -2, 6, -1, 3, -2
.text
main:
la $a0, A
li $a1, 5
j mspfx
nop
continue:
lock:
j lock
nop
end_of_main:
mspfx:
addi $v0, $zero, 0 # initialize length in $v0 to 0
addi $v1, $zero, 0 # initialize max sum in $v1 to 0
addi $t0, $zero, 0 # initialize index i in $t0 to 0
addi $t1, $zero, 0 # initialize running sum in $t1 to 0
loop:
add $t2, $t0, $t0 # put 2i in $t2
add $t2, $t2, $t2 # put 4i in $t2
add $t3, $t2, $a0 # put 4i+A (Address of A[i]) in $t3
lw $t4, 0($t3) # load A[i] from mem(t3) into $t4
add $t1, $t1, $t4 # add A[i] to running sum in $t1
slt $t5, $v1, $t1 # set $t5 to 1 if max sum < new sum
bne $t5, $zero, mdfy # if max sum is less, modify results
j test # done?
mdfy:
addi $v0, $t0, 1 # new max-sum prefix has length i+1
addi $v1, $t1, 0 # new max-sum id the running sum
test:
addi $t0, $t0, 1 # advance the index i
slt $t5, $t0, $a1 # set $t5 to 1 if i<n
bne $t5, $zero, loop # repeat if i<n
done:
j continue
mspfx_end: