Implement a MIPS assembly language program that defines main, readArray and remo
ID: 3876460 • Letter: I
Question
Implement a MIPS assembly language program that defines main, readArray and removeEvenOdd procedures.
The readArray takes an array of integers as its parameter, reads in integers from a user to fill the array and also print each value as long as it is with the number of elements specified by the parameter "howMany" and "length".
The removeEvenOdd procedure takes parameters of an array of integers, its length, and even value, an asks a user how many integers to read in and calls the readyArray procedure. Then it should go through the array to see if each number is even (divisible by 2) if the parameter even is 0. In that case, such even integer in the array is changed to 0. If the parameter even is 1, then it changes every odd integer in the array to 0. Then it prints out the updated content of the array.
The main procedure asks a user to specify whether to remove even or odd numbers by asking them to enter an integer. Then it calls the removeEvenOdd procedure. It repeats these two steps twice.
Please see the following C program to understand how it should work.
If your program causes an infinite loop, press Control and 'C' keys at the same time to stop it.
Name your source code file assignment6.s.
The following shows how it looks like in a C program:
The following is a sample output (user input is in bold):
Enter zero to remove even numbers or non-zero to remove odd numbers
0
Specify how many numbers should be stored in the array (at most 8):
8
Enter an integer:
1
Enter an integer:
-12
Enter an integer:
53
Enter an integer:
-4
Enter an integer:
5
Enter an integer:
32
Enter an integer:
1
Enter an integer:
7
The array content:
1
-12
53
-4
5
32
1
7
After removing even integers
1
1
53
1
5
1
1
7
Enter zero to remove even numbers or non-zero to remove odd numbers
1
Specify how many numbers should be stored in the array (at most 8):
5
Enter an integer:
1
Enter an integer:
-5
Enter an integer:
-2
Enter an integer:
3
Enter an integer:
2
The array content:
1
-5
-2
3
2
After removing odd integers
0
0
-2
0
2
--------------------------------------------------
What to turn in:
programs should be well commented.
Each procedure needs to have a header using the following format:
############################################################################
# Procedure readArray
# Description: -----
# parameters: $a0 = address of array
# return value: $v0 = length
# registers to be used: $s3 and $s4 will be used.
############################################################################
Explanation / Answer
MIPS program -
$LFB0 = .
readArray(int*, int, int):
addiu $sp,$sp,-40
sw $31,36($sp)
sw $fp,32($sp)
move $fp,$sp
sw $4,40($fp)
sw $5,44($fp)
sw $6,48($fp)
sw $0,24($fp)
lui $2,%hi($LC0)
addiu $4,$2,%lo($LC0)
jal puts
nop
lw $3,24($fp)
lw $2,48($fp)
nop
slt $2,$3,$2
beq $2,$0,$L5
nop
lw $3,24($fp)
lw $2,44($fp)
nop
slt $2,$3,$2
beq $2,$0,$L5
nop
lui $2,%hi($LC1)
addiu $4,$2,%lo($LC1)
jal puts
nop
addiu $2,$fp,28
move $5,$2
lui $2,%hi($LC2)
addiu $4,$2,%lo($LC2)
jal scanf
nop
lw $2,24($fp)
nop
sll $2,$2,2
lw $3,40($fp)
nop
addu $2,$3,$2
lw $3,28($fp)
nop
sw $3,0($2)
lw $2,24($fp)
nop
sll $2,$2,2
lw $3,40($fp)
nop
addu $2,$3,$2
lw $2,0($2)
nop
move $5,$2
lui $2,%hi($LC3)
addiu $4,$2,%lo($LC3)
jal printf
nop
lw $2,24($fp)
nop
addiu $2,$2,1
sw $2,24($fp)
b $L3
nop
nop
move $sp,$fp
lw $31,36($sp)
lw $fp,32($sp)
addiu $sp,$sp,40
j $31
nop
$LFB1 = .
removeEvenOdd(int*, int, int):
addiu $sp,$sp,-40
sw $31,36($sp)
sw $fp,32($sp)
move $fp,$sp
sw $4,40($fp)
sw $5,44($fp)
sw $6,48($fp)
sw $0,24($fp)
sw $0,28($fp)
lui $2,%hi($LC4)
addiu $4,$2,%lo($LC4)
jal puts
nop
addiu $2,$fp,28
move $5,$2
lui $2,%hi($LC2)
addiu $4,$2,%lo($LC2)
jal scanf
nop
lw $2,28($fp)
nop
move $6,$2
lw $5,44($fp)
lw $4,40($fp)
jal readArray(int*, int, int)
nop
lw $2,28($fp)
lw $3,24($fp)
nop
slt $2,$3,$2
beq $2,$0,$L7
nop
lw $3,24($fp)
lw $2,44($fp)
nop
slt $2,$3,$2
beq $2,$0,$L7
nop
lw $2,48($fp)
nop
bne $2,$0,$L8
nop
lw $2,24($fp)
nop
sll $2,$2,2
lw $3,40($fp)
nop
addu $2,$3,$2
lw $2,0($2)
nop
andi $2,$2,0x1
bne $2,$0,$L8
nop
lw $2,24($fp)
nop
sll $2,$2,2
lw $3,40($fp)
nop
addu $2,$3,$2
li $3,1 # 0x1
sw $3,0($2)
b $L9
nop
lw $2,48($fp)
nop
beq $2,$0,$L9
nop
lw $2,24($fp)
nop
sll $2,$2,2
lw $3,40($fp)
nop
addu $2,$3,$2
lw $2,0($2)
nop
andi $2,$2,0x1
beq $2,$0,$L9
nop
lw $2,24($fp)
nop
sll $2,$2,2
lw $3,40($fp)
nop
addu $2,$3,$2
sw $0,0($2)
lw $2,24($fp)
nop
addiu $2,$2,1
sw $2,24($fp)
b $L10
nop
lw $2,48($fp)
nop
bne $2,$0,$L11
nop
lui $2,%hi($LC5)
addiu $4,$2,%lo($LC5)
jal puts
nop
b $L12
nop
lui $2,%hi($LC6)
addiu $4,$2,%lo($LC6)
jal puts
nop
sw $0,24($fp)
lw $2,28($fp)
lw $3,24($fp)
nop
slt $2,$3,$2
beq $2,$0,$L15
nop
lw $3,24($fp)
lw $2,44($fp)
nop
slt $2,$3,$2
beq $2,$0,$L15
nop
lw $2,24($fp)
nop
sll $2,$2,2
lw $3,40($fp)
nop
addu $2,$3,$2
lw $2,0($2)
nop
move $5,$2
lui $2,%hi($LC3)
addiu $4,$2,%lo($LC3)
jal printf
nop
lw $2,24($fp)
nop
addiu $2,$2,1
sw $2,24($fp)
b $L14
nop
nop
move $sp,$fp
lw $31,36($sp)
lw $fp,32($sp)
addiu $sp,$sp,40
j $31
nop
$LFB2 = .
main:
addiu $sp,$sp,-56
sw $31,52($sp)
sw $fp,48($sp)
sw $16,44($sp)
move $fp,$sp
move $10,$sp
move $16,$10
li $10,8 # 0x8
sw $10,24($fp)
lw $10,24($fp)
nop
addiu $10,$10,-1
sw $10,28($fp)
move $11,$10
addiu $11,$11,1
move $8,$11
move $9,$0
srl $11,$8,27
sll $5,$9,5
or $5,$11,$5
sll $4,$8,5
move $4,$10
addiu $4,$4,1
move $6,$4
move $7,$0
srl $4,$6,27
sll $3,$7,5
or $3,$4,$3
sll $2,$6,5
move $2,$10
addiu $2,$2,1
sll $2,$2,2
addiu $2,$2,3
addiu $2,$2,7
srl $2,$2,3
sll $2,$2,3
subu $sp,$sp,$2
addiu $2,$sp,16
addiu $2,$2,3
srl $2,$2,2
sll $2,$2,2
sw $2,32($fp)
lui $2,%hi($LC7)
addiu $4,$2,%lo($LC7)
jal puts
nop
addiu $2,$fp,36
move $5,$2
lui $2,%hi($LC2)
addiu $4,$2,%lo($LC2)
jal scanf
nop
lw $2,32($fp)
lw $3,36($fp)
nop
move $6,$3
lw $5,24($fp)
move $4,$2
jal removeEvenOdd(int*, int, int)
nop
lui $2,%hi($LC7)
addiu $4,$2,%lo($LC7)
jal puts
nop
addiu $2,$fp,36
move $5,$2
lui $2,%hi($LC2)
addiu $4,$2,%lo($LC2)
jal scanf
nop
lw $2,32($fp)
lw $3,36($fp)
nop
move $6,$3
lw $5,24($fp)
move $4,$2
jal removeEvenOdd(int*, int, int)
nop
move $sp,$16
move $2,$0
move $sp,$fp
lw $31,52($sp)
lw $fp,48($sp)
lw $16,44($sp)
addiu $sp,$sp,56
j $31
nop
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.