THMMY.gr

Void mm ( double a[][]), double b[][], double c[][])
{
    int i, j, k;
    for (i=0; i! = 3; i = i+1)
        for (j = 0; j! = 3; j = j+1)
            for (k = 0; k! = 3; k = k+1)
                d[i][j] = a[i][j] + b[i][k] * c[k][j];
}

Void mm ( double a[][]), double b[][], double c[][])
{
    int i, j, k;
    for (i=0; i! = 3; i = i+1)
        for (j = 0; j! = 3; j = j+1)
            for (k = 0; k! = 3; k = k+1)
                d[i][j] = a[i][j] + b[i][k] * c[k][j];
}

Void mm ( double a[][]), double b[][], double c[][])
{
    int i, j, k;
    for (i=0; i! = 3; i = i+1){
        for (j = 0; j! = 3; j = j+1){
            d[i][j] = a[i][j] ;
            for (k = 0; k! = 3; k = k+1){
               d[i][j] = d[i][j] + b[i][k] * c[k][j];
            }
        }
     }
}

main:
	add $a0,$gp,$zero
	addi $a1,$a0,72
	addi $a2,$a1,72

main:
        lui $a0,0x1000
	ori $a0,0x9000
	addi $a1,$a0,72
	addi $a2,$a1,72

mul $t1,$s0,3#diavasma
addu $t1,$t1,$s1
sll $t1,$t1,2
addu $t1,$a1,$t1
li $v0,6
syscall
swc1 $v0,0($t1)

       
        li $v0, 7
        syscall

sw $f0, $t3

Α: .space 36

        li $t1, 3 				# $t1 = 3 (row size/loop end)
	li $s0, 0 				# i = 0;initialize1st for loop
L1:    li $s1, 0 				# j = 0; restart 2nd for loop
L2:    li $s2, 0 				# k = 0; restart 3rd for loop
	
	mul	$t2,$s0,$t1 		# t2=i*3 
	addu $t2, $t2, $s1		# $t2 = (i*3) + j
	sll  $t2, $t2, 2		        # $t2 = [(i*3)+j]*4 
	addu $t2, $a1, $t2 		# $t2 = byte address of A[i][j]
	l.s $f4, 0($t2) 		        # $f4 = 4 bytes of A[i][j]
L3: mul $t0, $s2, $t1 		        # $t0 = k * 3 
	addu $t0, $t0, $s1 		# $t0 = (k * 3)+j
	sll $t0, $t0, 2 		        # $t0 = [(k * 3)+j]*4
	addu $t0, $a2, $t0 		# $t0 = byte address of B[k][j]
	l.s $f16, 0($t0) 		        # $f16 = 4 bytes of B[k][j]	
	mul $t0, $s0, $t1 		# $t0 = i* 3
	addu $t0, $t0, $s2 		# $t0 = (i * 3)+k
	sll $t0, $t0, 2 		        # $t0 = [(i * 3)+k]*4
	addu $t0, $a3, $t0 		# $t0 = byte address of C[i][k]
	l.s $f18, 0($t0) 		        # $f18 = 4 bytes of C[i][k]
	mul.s $f16, $f18, $f16 	# $f16 = B[i][k] * C[k][j]
	add.s $f4, $f4, $f16 	        # $f4=A[i][j] + B[i][k]*C[k][j]
	addiu $s2, $s2, 1 		#$k=k + 1
	bne $s2, $t1, L3 		# if (k != 3) go to L3
	
	#####################################################
	mul	$t4,$s0,$t1 		# t4=i*3                   
	addu $t4, $t4, $s1		# $t4 = (i*3) + j			
	sll  $t4, $t4, 2		# $t4 = [(i*3)+j]*4 		
	addu $t4, $t5, $t4 		# $t4 = byte address of D[i][j]	
	s.s $f4, 0($t4) 		# $f4 = 4 bytes of D[i][j]	
	#######s.s	$f4,($t5)  ##########################################
	#######addi $t5,$t5,4 
	
	
	s.s $f4, 0($t2) 		        # A[i][j] = $f4 
	addiu $s1, $s1, 1 		#$j= j + 1
	bne $s1, $t1, L2 		# if (j != 3) go to L2
	addiu $s0, $s0, 1 		#$i= i + 1
	bne $s0, $t1, L1 		# if (i != 3) go to L1
	li $s0,1				#epanafora arxikis timis deiktwn i,j
	li $s1,1 
	########addi $t5,$t5,-36		#epanafora arxikis 8esis $t5

mul.s $f16, $f18, $f16 	# $f16 = B[i][k] * C[k][j]
	##########
	s.s $f16,($t5)
	addi $t5,$t5,4 
	addiu $s2, $s2, 1 		#$k=k + 1
	bne $s2, $t1, L3 		# if (k != 3) go to L3
	addi $t5,$t5,-12		#restore $t5 address
	l.s $f19,0($t5)			# $f19=0($t5) (k=0)
	l.s $f20,4($t5)			# $f20=4($t5) (k=1)
	add.s $f20,$f20,$f19	# $f20=$f20+$f19
	l.s $f21,8($t5)			# $f21=8($t5) (k=2)
	add.s $f21,$f21,$f20	# $f21=$f21+$f20
		
	add.s $f4, $f4, $f21 	# $f4=A[i][j] + B[i][k]*C[k][j] (k=0,1,2)
	s.s	$f4,($t6)  
	addi $t6,$t6,4
###############
        s.s $f4, 0($t2) 		# A[i][j] = $f4 
	addiu $s1, $s1, 1 		#$j= j + 1