MIPS main: lui $a0,0x8000 jal first1pos jal printv0 lui $a0,0x0001 jal first1pos

Question

MIPS

main:
   lui   $a0,0x8000
   jal   first1pos
   jal   printv0
   lui   $a0,0x0001
   jal   first1pos
   jal   printv0
   li   $a0,1
   jal   first1pos
   jal   printv0
   add   $a0,$0,$0
   jal   first1pos
   jal   printv0
   li   $v0,10
   syscall

first1pos:   # your code goes here

printv0:
   addi   $sp,$sp,-4
   sw   $ra,0($sp)
   add   $a0,$v0,$0
   li   $v0,1
   syscall
   li   $v0,11
   li   $a0,' '
   syscall
   lw   $ra,0($sp)
   addi   $sp,$sp,4
   jr   $ra

MIPS programs.

Once again start from first1pos.v to find the exact same bit as first However, this version should start a mask at 0x8 0000000 and repeatedly shift the mask to the right to check each bit in sao (Without modifying the original value in $ad). You should make sure the output in version 1 and 2 are matching

Explanation / Answer

main: lui $a0,0x8000 # should be 31 jal first1pos jal printv0 lui $a0,0x0001 # should be 16 jal first1pos jal printv0 li $a0,1 # should be 0 jal first1pos jal printv0 add $a0,$0,$0 jal first1pos jal printv0 li $v0,10 syscall first1pos: # placeholder to call different versions: first1posshift of first1posmask addiu $sp, $sp, -4 sw $ra, 0($sp) jal first1posshift lw $ra, 0($sp) addiu $sp, $sp, 4 jr $ra first1posshift: beq $a0, 0, endNone # if a0 == 0, return -1 li $t0, 0 # counter for the position loop: sll $a0, $a0, 1 # shift by one slti $t1, $a0, 0 # if a0 < 0 beq $t1, 1, endPos # return position addi $t0, $t0, 1 # increment the counter j loop endPos: move $v0, $t0 jr $ra endNone: li $v0, -1 jr $ra first1posmask: printv0: addi $sp,$sp,-4 sw $ra,0($sp) add $a0,$v0,$0 li $v0,1 syscall li $v0,11 li $a0,' ' syscall lw $ra,0($sp) addi $sp,$sp,4 jr $ra

Related Questions

Navigate

• Browse (All)
• Browse M
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.