Repository navigation
Expand file tree
/
Copy pathprograms.rs
More file actions
224 lines (219 loc) · 5.63 KB
/
Copy pathprograms.rs
File metadata and controls
224 lines (219 loc) · 5.63 KB
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
//! Example programs.
use crate::bytes::*;
use crate::state::*;
use crate::ops::*;
use crate::asm;
/// Sum natural numbers using a stack.
pub type SumNumbersManual = InitState::<asm! {
IncA, PushA,
IncA, PushA,
IncA, PushA,
IncA, PushA,
IncA, PushA,
IncA, PushA,
IncA, PushA,
IncA, PushA,
SwapAB,
PopB, AddAB,
PopB, AddAB,
PopB, AddAB,
PopB, AddAB,
PopB, AddAB,
PopB, AddAB,
PopB, AddAB,
PopB, AddAB,
}>;
// A B stack
// start
// 00 00 <>
// init
// PushA N 00 <Sm>
// SetA N, PushA N 00 <N, Sm>
// head
// PopA, PushA, SetB 00 N 00 <N, Sm>
// EqAB end 00 <N, Sm>
// JumpIfA end
// body 00 00 <N, Sm>
// PopA, PopB N Sm <>
// DecA, PushA, IncA N Sm <N'>
// AddAB Sm' Sm <N'>
// PushA Sm' Sm <Sm', N'>
// SwapTop Sm' Sm <N', Sm'>
// JumpBack head
// end 01 00 <N, Sm>
// PopA, PopA Sm 00 <>
/// Sum natural numbers using a loop.
pub type SumNumbersLoopy = InitState::<asm! {
PushA,
SetA<B08>, PushA,
// loop head
PopA, PushA, SetB<B00>,
EqAB,
JumpForwardIfA<B09 /* to end */>,
// loop body
PopA, PopB,
DecA, PushA, IncA,
AddAB,
PushA,
SwapTop,
JumpBackward<B0D /* to loop head */>,
// end
PopA, PopA,
}>;
/// Same as [SumNumbersLoopy], but manually unrolled to avoid using a backward
/// jump. Was used for debugging.
pub type SumNumbersUnrolled = InitState::<asm! {
PushA,
SetA<B08>, PushA,
// loop head
PopA, PushA, SetB<B00>,
EqAB,
JumpForwardIfA<B09 /* to end */>,
// loop body
PopA, PopB,
DecA, PushA, IncA,
AddAB,
PushA,
SwapTop,
Nop, // JumpBackward<B0D /* to loop head */>,
// loop head
PopA, PushA, SetB<B00>,
EqAB,
JumpForwardIfA<B09 /* to end */>,
// loop body
PopA, PopB,
DecA, PushA, IncA,
AddAB,
PushA,
SwapTop,
Nop, // JumpBackward<B0D /* to loop head */>,
// loop head
PopA, PushA, SetB<B00>,
EqAB,
JumpForwardIfA<B09 /* to end */>,
// loop body
PopA, PopB,
DecA, PushA, IncA,
AddAB,
PushA,
SwapTop,
Nop, // JumpBackward<B0D /* to loop head */>,
// loop head
PopA, PushA, SetB<B00>,
EqAB,
JumpForwardIfA<B09 /* to end */>,
// loop body
PopA, PopB,
DecA, PushA, IncA,
AddAB,
PushA,
SwapTop,
Nop, // JumpBackward<B0D /* to loop head */>,
// loop head
PopA, PushA, SetB<B00>,
EqAB,
JumpForwardIfA<B09 /* to end */>,
// loop body
PopA, PopB,
DecA, PushA, IncA,
AddAB,
PushA,
SwapTop,
Nop, // JumpBackward<B0D /* to loop head */>,
// loop head
PopA, PushA, SetB<B00>,
EqAB,
JumpForwardIfA<B09 /* to end */>,
// loop body
PopA, PopB,
DecA, PushA, IncA,
AddAB,
PushA,
SwapTop,
Nop, // JumpBackward<B0D /* to loop head */>,
// loop head
PopA, PushA, SetB<B00>,
EqAB,
JumpForwardIfA<B09 /* to end */>,
// loop body
PopA, PopB,
DecA, PushA, IncA,
AddAB,
PushA,
SwapTop,
Nop, // JumpBackward<B0D /* to loop head */>,
// loop head
PopA, PushA, SetB<B00>,
EqAB,
JumpForwardIfA<B09 /* to end */>,
// loop body
PopA, PopB,
DecA, PushA, IncA,
AddAB,
PushA,
SwapTop,
Nop, // JumpBackward<B0D /* to loop head */>,
// end
PopA, PopA,
}>;
// A B stack
// start
// SetB N 0 R <>
// PushA 0 R <0>
// IncA 1 R <0>
// PushA 1 R <1, 0>
// iter
// R <f(n), ..., f(1), f(0)>
// PopA f(n) R <f(n - 1), ..., f(1), f(0)>
// PushB f(n) R <R, f(n - 1), ..., f(1), f(0)>
// SwapTop f(n) R <f(n - 1), R, f(n - -2), ..., f(1), f(0)>
// PopB f(n) f(n-1) <R, f(n - 2), ..., f(1), f(0)>
// PushB f(n) f(n-1) <f(n - 1), R, ..., f(1), f(0)>
// SwapTop f(n) f(n-1) <R, f(n - 1), ..., f(1), f(0)>
// PushA f(n) f(n-1) <f(n), R, ..., f(1), f(0)>
// SwapTop f(n) f(n-1) <R, f(n), ..., f(1), f(0)>
// AddAB f(n+1) <R, f(n), ..., f(1), f(0)>
// PushA <f(n + 1), R, f(n), ..., f(1), f(0)>
// SwapTop <R, f(n + 1), f(n), ..., f(1), f(0)>
// PopB R <f(n + 1), f(n), ..., f(1), f(0)>
// check
// SetA 0 0 R <..>
// EqAB end R <..>
// JumpIfA end R <..>
// SwapAB R <..>
// DecA R' <..>
// SwapAB R' <..>
// JumpBack iter R <..>
// end 0 <f(n), ..., f(1), f(0)>
// PopA f(n) 0 <...>
/// Compute the Nth fibonacci number.
pub type Fibonacci<N> = InitState::<asm! {
// start
SetB<N>,
PushA,
IncA,
PushA,
// iter
PopA,
PushB,
SwapTop,
PopB,
PushB,
SwapTop,
PushA,
SwapTop,
AddAB,
PushA,
SwapTop,
PopB,
// check
SetA<B00>,
EqAB,
JumpForwardIfA<B04 /* to end */>,
SwapAB,
DecA,
SwapAB,
JumpBackward<B12 /* to iter */>,
// end
PopA,
}>;