-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmul_recursive_optimized.s
executable file
·81 lines (81 loc) · 2.07 KB
/
mul_recursive_optimized.s
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
mul:
addi sp, sp, -32
sw ra, 28(sp)
sw s0, 24(sp)
addi s0, sp, 32
sw a0, -16(s0)
sw a1, -20(s0)
lw a0, -16(s0)
mv a1, zero
beq a0, a1, .LBB0_2
j .LBB0_1
.LBB0_1:
lw a0, -20(s0)
mv a1, zero
bne a0, a1, .LBB0_3
j .LBB0_2
.LBB0_2:
mv a0, zero
sw a0, -12(s0)
j .LBB0_6
# compute modulus by 2 and see if it equals to zero
.LBB0_3:
lw a0, -20(s0)
srli a1, a0, 31
add a1, a1, a0
andi a1, a1, -2
sub a0, a0, a1
mv a1, zero
bne a0, a1, .LBB0_5
j .LBB0_4
# left shift operand 1 by 2 and operand 2 is right shifted by 1 , with a recursive
# call to multiply at end
.LBB0_4:
lw a0, -16(s0)
slli a0, a0, 1
lw a1, -20(s0)
srai a1, a1, 1
call mul
sw a0, -12(s0)
j .LBB0_6
.LBB0_5:
lw a0, -16(s0)
lw a1, -20(s0)
addi a1, a1, -1
sw a0, -24(s0)
call mul
lw a1, -24(s0)
add a0, a0, a1
sw a0, -12(s0)
j .LBB0_6
.LBB0_6:
lw a0, -12(s0)
lw s0, 24(sp)
lw ra, 28(sp)
addi sp, sp, 32
ret
main:
addi sp, sp, -32
sw ra, 28(sp)
sw s0, 24(sp)
addi s0, sp, 32
mv a0, zero
sw a0, -12(s0)
#operand 1
addi a1, zero, 10
sw a1, -16(s0)
#operand 2
addi a1, zero, 20
sw a1, -20(s0)
lw a1, -16(s0)
lw a2, -20(s0)
sw a0, -28(s0)
add a0, zero, a1
add a1, zero, a2
call mul
# output value
sw a0, -24(s0)
lw s0, 24(sp)
lw ra, 28(sp)
addi sp, sp, 32
ret