-
Notifications
You must be signed in to change notification settings - Fork 9
/
Copy pathprint_fibonacci.asm
96 lines (79 loc) · 1.38 KB
/
print_fibonacci.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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
# Write a recursive MIPS assembly program to print the nth number of Fibonacci sequence
# Input: Single Integer (6)
# Output : Single Integer (8)
# int fib(int n)
# {
# if (n == 0) return 0;
# else if (n == 1) return 1;
# return fib(n - 1) + fib(n – 2);
# }
# void main()
# {
# int n;
# printf(“Please enter a non negative integer :”);
# scanf(“%d”,&n);
# ans=fib(n);
# printf(“The %dth fibonacii number is %d.”,n,ans);
# exit(0);
# }
.data
msg: .asciiz "Enter a number: "
fibNum: .asciiz "\nFibonacci number is: "
.text
main:
# print message
li $v0, 4
la $a0, msg
syscall
# take input and print to screen
li $v0, 5
syscall
move $a0, $v0
li $v0, 1
syscall
jal fib
move $a1, $v0
li $v0, 4
la $a0, fibNum
syscall
li $v0, 1
move $a0, $a1
syscall
# exit
li $v0, 10
syscall
fib: # variables modified: $a0, $t0, $v0
addi $sp, $sp, -4
sw $ra, ($sp)
beq $a0, $zero, return_zero
li $t0, 1
beq $a0, $t0, return_one
addi $a0, $a0, -1
addi $sp, $sp, -8
sw $a0, ($sp)
sw $t0, 4($sp)
jal fib
lw $a0, ($sp)
lw $t0, 4($sp)
addi $sp, $sp, 8
move $t0, $v0
addi $a0, $a0, -1
addi $sp, $sp, -8
sw $a0, ($sp)
sw $t0, 4($sp)
jal fib
lw $a0, ($sp)
lw $t0, 4($sp)
addi $sp, $sp, 8
add $v0, $v0, $t0
exit:
lw $ra, ($sp)
addi $sp, $sp, 4
jr $ra
return_zero:
move $v0, $zero
j exit
return_one:
move $v0, $zero
addi $v0, $v0, 1
j exit