Question

Write a MIPS assembly code that corresponds to the following C code. Note: use the stack to store all register values that you use in the procedures.

int aver(int * array, int N){

int i, sum = 0;

for ( i=0;i i<N; i++)

sum += array[i];

return sum/N;}

int Max( int * array, int N){

int i, Maximum = array[i];

for ( i = 1; i< N; i++)

if ( array[i] > Maximum)

Maximum = array[i];

return Maximum; }

int main ( ){

int average=0, max =0;

int A[10]; // suppose A is initialized

average = aver(A);

max = max(A);

return 0; }

Answer 1

PROGRAM:

.data
   A: .word 2, 8, 64, 57, 29, 75, 61, 97, 34, 20
   out1: .asciiz "Average of array elements is: "
   out2: .asciiz "\nMaximum number in array is: "
.text
.globl main
main:
   li $v0,4       # 4 is the print string syscall
   la $a0,out1       # Load the address of string to be printed
   syscall           # Print the string
  
   la $a0,A       # Load the address of array
   li $a1,10       # Load the size of array
   jal aver       # Call the function aver
   # store the return value from function
   move $a0,$v0       # Load $a0 with integer to be printed
   li $v0,1       # 1 is the print integer syscall
   syscall           # Print the integer
  
   li $v0,4       # 4 is the print string syscall
   la $a0,out2       # Load the address of string to be printed
   syscall           # Print the string
  
   la $a0,A       # Load the address of array
   li $a1,10       # Load the size of array
   jal max           # Call the function max
   # store the return value from function
   move $a0,$v0       # Load $a0 with integer to be printed
   li $v0,1       # 1 is the print integer syscall
   syscall           # Print the integer
  
   li $v0,10       # 10 is the exit program syscall
   syscall           # Exit the program

# Definition of average function
aver:
   # Adjust the stack pointer
   addi $sp,$sp,-8
   sw $s1,4($sp)       # Store $s1 on stack
   sw $ra,0($sp)       # Store return address on stack
  
   li $t0,0       # Loop counter (i = 0)
   li $t3,0       # Accumulator (sum = 0)
for1:   bge $t0,$a1,end1   # If loop counter >= size of array, jump to label end1
   mul $t1,$t0,4       # Calculate the offset index i
   add $t1,$a0,$t1       # $t1 = &A[i]
   lw $t2,0($t1)       # $t2 = A[i]
   add $t3,$t3,$t2       # sum = sum + A[i]
   addi $t0,$t0,1       # Increment loop counter
   b for1           # Repeat the loop
end1:   div $v0,$t3,$a1       # $v0 = sum/N
   lw $s1,4($sp)       # Restore $s1 from stack
   lw $ra,0($sp)       # Restore $ra from stack
   addi $sp,$sp,-8       # Readjust stack pointer to its original position
   jr $ra           # Jump to return address (i.e., to calling function, main)

# Definition of max function
max:
   # Adjust the stack pointer
   addi $sp,$sp,-8
   sw $s1,4($sp)       # Store $s1 on stack
   sw $ra,0($sp)       # Store return address on stack
  
   li $t0,1       # Loop counter (i = 0)
   lw $t1,0($a0)       # $t1(max) = A[0]
for2:   bge $t0,$a1,end2   # If loop counter >= size of array, jump to label end1
   mul $t2,$t0,4       # Calculate the offset index i
   add $t2,$a0,$t2       # $t2 = &A[i]
   lw $t3,0($t2)       # $t3 = A[i]
   ble $t3,$t1,next   # If A[i] <= max, jump to label next
   move $t1,$t3       # Else max = A[i]
next:   addi $t0,$t0,1       # Increment loop counter
   b for2           # Repeat the loop
end2:   move $v0,$t1       # return the value of max
   lw $s1,4($sp)       # Restore $s1 from stack
   lw $ra,0($sp)       # Restore $ra from stack
   addi $sp,$sp,-8       # Readjust stack pointer to its original position
   jr $ra           # Jump to return address (i.e., to calling function, main)

Please refer to the following screenshot of the program for indentation of the code:

OUTPUT: