/
board.fs
198 lines (170 loc) · 4.56 KB
/
board.fs
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
#include utils/tester.fs
\ expected vocabulary (including tester.fs)
T{e WORDS e-> 930 -5044 }T
\ core: string with capured EMIT
: test-."" ." abc123" ;
: test-$"" $" abc123" ;
T{e test-."" e-> 6 444 }T
T{e test-$"" COUNT TYPE e-> 6 444 }T
T{e .( abc123) e-> 6 444 }T
\ core: numver output with capured EMIT
T{e -11 . e-> 4 175 }T
T{e -11 U. e-> 6 295 }T
T{e -11 5 .R e-> 5 207 }T
T{e -11 4 U.R e-> 5 263 }T
T{e 11 4 U.R e-> 4 162 }T
\ core: stack manipulation
T{ 1 2 OVER -> 1 2 1 }T
T{ 1 2 SWAP -> 2 1 }T
T{ 1 2 3 ROT -> 2 3 1 }T
T{ 1 2 3 NIP -> 1 3 }T
T{ 1 2 3 0 PICK -> 1 2 3 3 }T
T{ 1 2 3 2 PICK -> 1 2 3 1 }T
T{ 1 2 2DUP -> 1 2 1 2 }T
T{ 1 2 3 4 2DROP -> 1 2 }T
\ core: compare operations
T{ 10 -500 = -> 0 }T
T{ -500 -500 = -> -1 }T
T{ -500 0= -> 0 }T
T{ 0 0= -> -1 }T
T{ 10 -500 U< -> -1 }T
T{ -500 10 U< -> 0 }T
T{ 10 -500 < -> 0 }T
T{ -500 10 < -> -1 }T
T{ -500 0< -> -1 }T
T{ 0 0< -> 0 }T
\ core: 16 bit unary operations
T{ 32767 NEGATE -> -32767 }T
T{ -32767 ABS -> 32767 }T
T{ -1 1+ -> 0 }T
T{ 0 1- -> -1 }T
T{ -1 2+ -> 1 }T
T{ 1 2- -> -1 }T
T{ -1 2/ -> -1 }T
T{ 500 2/ -> 250 }T
T{ -1 2* -> -2 }T
T{ 500 2* -> 1000 }T
\ core: 16 bit binary operations
T{ 2 3 + -> 5 }T
T{ 255 -3 - -> 258 }T
T{ 255 -3 * -> -765 }T
T{ 767 3 / -> 255 }T
T{ 767 3 mod -> 2 }T
T{ 511 -5 /MOD -> -4 -103 }T
T{ -511 -5 /MOD -> -1 102 }T
T{ -511 5 /MOD -> 4 -103 }T
\ core: bit opperations
T{ 32767 NOT -> -32768 }T
T{ -1 $AA55 AND -1 XOR -> $55AA }T
T{ $55AA $0A05 OR -> $5FAF }T
\ core: double arithmetics
T{ 1 -1 UM+ -> 0 1 }T
T{ 1 -1 -2 M/MOD -> -1 32767 }T
T{ 1 -1 -2 UM/MOD -> 0 -1 }T
T{ 1000 -100 500 */ -> -200 }T
T{ -1000 55 101 */MOD -> 45 -545 }T
T{ -1 -1 UM* -> 1 -2 }T
T{ 31 -3010 M* -> -27774 -2 }T
\ NVM features, 'BOOT vector, and COLD
NVM
VARIABLE varNVM
: startNVM ( -- ) \ make cold respond with OK
.OK ;
' startNVM 'BOOT !
RAM
\ extended: bit operations
T{ -511 EXG -> 510 }T
T{ 0 varNVM ! 1 varNVM 6 B! varNVM @ -> 16384 }T
T{ 258 varNVM ! 0 varNVM 1+ 1 B! varNVM @ -> 256 }T
\ extended: do leave +loop
T{ : GD2 DO I -1 +LOOP ; -> }T
T{ 1 4 GD2 -> 4 3 2 1 }T
T{ -1 2 GD2 -> 2 1 0 -1 }T
VARIABLE gditerations
VARIABLE gdincrement
: gd7 ( limit start increment -- )
gdincrement !
0 gditerations !
DO
1 gditerations +!
I
gditerations @ 6 = IF LEAVE THEN
gdincrement @
+LOOP gditerations @ ;
T{ 4 4 -1 gd7 -> 4 1 }T
T{ 1 4 -1 gd7 -> 4 3 2 1 4 }T
\ 1 1 (limit) T{ 4 1 -1 gd7 -> 1 0 -1 -2 -3 -4 6 }T
T{ 4 1 0 gd7 -> 1 1 1 1 1 1 6 }T
\ 0 1 (limit) T{ 0 0 0 gd7 -> 0 0 0 0 0 0 6 }T
\ 4 1 (limit) T{ 1 4 0 gd7 -> 4 4 4 4 4 4 6 }T
\ 4 1 (limit) T{ 1 4 1 gd7 -> 4 5 6 7 8 9 6 }T
T{ 4 1 1 gd7 -> 1 2 3 3 }T
\ 4 1 (limit) T{ 4 4 1 gd7 -> 4 5 6 7 8 9 6 }T
\ 4 1 (limit) T{ 2 -1 -1 gd7 -> -1 -2 -3 -4 -5 -6 6 }T
T{ -1 2 -1 gd7 -> 2 1 0 -1 4 }T
T{ 2 -1 0 gd7 -> -1 -1 -1 -1 -1 -1 6 }T
\ 4 1 (limit) T{ -1 2 0 gd7 -> 2 2 2 2 2 2 6 }T
\ 4 1 (limit) T{ -1 2 1 gd7 -> 2 3 4 5 6 7 6 }T
T{ 2 -1 1 gd7 -> -1 0 1 3 }T
T{ -20 30 -10 gd7 -> 30 20 10 0 -10 -20 6 }T
T{ -20 31 -10 gd7 -> 31 21 11 1 -9 -19 6 }T
T{ -20 29 -10 gd7 -> 29 19 9 -1 -11 5 }T
\ start over - we'll need some RAM
COLD
#include utils/tester.fs
#require 2ROT
T{ 11 1 22 2 33 3 2ROT -> 22 2 33 3 11 1 }T
#require 2OVER
T{ 11 1 22 2 2OVER -> 11 1 22 2 11 1 }T
#require 2SWAP
T{ 11 1 22 2 2SWAP -> 22 2 11 1 }T
#require DNEGATE
#require DABS
#require D+
#require D-
#require D<
#require D=
T{ 27774 1 DNEGATE -> -27774 -2 }T
T{ -27774 -2 DABS -> 27774 1 }T
T{ -27774 1 DABS -> -27774 1 }T
T{ 1 -1 1 2 D+ -> 2 1 }T
T{ 2 1 1 2 D- -> 1 -1 }T
T{ 1 -1 2 -1 D< -> -1 }T
T{ 2 -1 1 -1 D< -> 0 }T
T{ 1 1 1 1 D< -> 0 }T
T{ 2 1 1 1 D< -> 0 }T
T{ 1 1 2 1 D< -> -1 }T
T{ 1 1 1 1 D= -> -1 }T
\ start over - we'll need some RAM
COLD
#include utils/tester.fs
#require DSQRT
T{ 16960 15 DSQRT -> 1000 }T
\ start over and check if words were persisted
COLD
#include utils/tester.fs
T{e startNVM e-> 4 260 }T
T{ varNVM -> 128 }T
\ test adding new words to NVM
NVM
\ extended: CREATE DOES>
T{ : CD>TEST CREATE 2* , DOES> @ ; -> }T
T{ -20 CD>TEST cdnvm -> }T
T{ cdnvm -> -40 }T
RAM
T{ 400 CD>TEST cdram -> }T
T{ cdram -> 800 }T
T{e WORDS e-> 966 -1943 }T
\ compile CURRENT and VOC as a test
#require CURRENT
#require VOC
#include utils/tester.fs
T{ : a 1 ; -> }T
T{ : b 11 ; -> }T
T{ VOC abc -> }T
T{ abc DEFINITIONS -> }T
T{ : a 2 ; -> }T
T{ : b 22 ; -> }T
T{ FORTH DEFINITIONS -> }T
T{ a b -> 1 11 }T
T{ abc a abc b -> 2 22 }T