blob: 0a9e969b3c24c8302b1d3ad0325921a83928e650 (
plain)
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
|
;;; fib.asm: A program that generates the fibonacci numbers up to a
;;; very large bound (~UINT64_MAX). Using the registers to store the
;;; pairs of fibonacci numbers, we ensure only a finite amount of
;;; memory is necessary for this program to function, unlike a pure
;;; stack version.
;; Constants
%const(limit) 93 %end
%const(increment_i)
push.reg.word 2
push.word 1
plus.word
mov.word 2
%end
%const(print_i)
push.reg.word 2
print.word
%end
%const(print_reg_0)
push.reg.word 0
print.word
%end
%const(print_reg_1)
push.reg.word 1
print.word
%end
;; Setup entrypoint
global main
main:
;; Setup iterator I
push.word 1
mov.word 2
;; Setup initial A -> W[0] = 1 and B -> W[1] = 1
push.word 1
mov.word 0
push.word 1
mov.word 1
;; Print "$I: $A" and "($I + 1): $B"
loopback:
call print_pair
;; $A += $B
push.reg.word 0
push.reg.word 1
plus.word
mov.word 0
;; $B += $A
push.reg.word 0
push.reg.word 1
plus.word
mov.word 1
;; IF $I < $LIMIT ...
push.reg.word 2
push.word $limit
lt.word
;; THEN jump to `loopback`
jump.if.byte loopback
;; ELSE halt
halt
print_pair:
push.byte '\t'
print.char
$print_i
push.byte ':'
print.char
push.byte ' '
print.char
$print_reg_0
push.byte '\n'
print.char
$increment_i
push.byte '\t'
print.char
$print_i
push.byte ':'
print.char
push.byte ' '
print.char
$print_reg_1
push.byte '\n'
print.char
$increment_i
ret
|
