-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmetaz80.4th
338 lines (271 loc) · 11.2 KB
/
metaz80.4th
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
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
\ CROSS COMPILER FOR THE ZILOG Z80 PROCESSOR
\ created 1995 by L.C. Benschop.
\ copyleft (c) 1995-2014 by the sbc09 team, see AUTHORS for more details.
\ copyleft (c) 2022 L.C. Benschop for Cerberus 2080.
\ license: GNU General Public License version 3, see LICENSE for more details.
\
\ This serves as an introduction to Forth cross compiling, so it is extensively
\ commented.
\
\ This cross compiler can be run on any ANS Forth with the necessary
\ extension wordset that is at least 16-bit, including Z80 Forth.
\
\ It creates the memory image of a new Forth system that is to be run
\ by the Zilog Z80 processor.
\
\ The cross compiler (or meta compiler or target compiler) is similar
\ to a regular Forth compiler, except that it builds definitions in
\ a dictionary in the memory image of a different Forth system.
\ We call this the target dictionary in the target space of the
\ target system.
\
\ As the new definitions are for a different Forth system, the cross
\ compiler cannot EXECUTE them. Neither can it easily find the new
\ definitions in the target dictionary. Hence a shadow definition
\ for each target definition is made in the normal Forth dictionary.
\
\ The names of the new definitions overlap with the names of existing
\ elementary. Forth words. Therefore they need to be in a wordlist
\ different from the normal Forth wordlist.
\ PART 1: THE VOCABULARIES.
VOCABULARY TARGET
\ This vocabulary will hold shadow definitions for all words that are in
\ the target dictionary. When a shadow definition is executed, it
\ performs the compile action in the target dictionary.
VOCABULARY TRANSIENT
\ This vocabulary will hold definitions that must be executed by the
\ host system ( the system on which the cross compiler runs) and that
\ compile to the target system.
\ Expl: The word IF occurs in all three vocabularies. The word IF in the
\ FORTH vocabulary is run by the host system and is used when
\ compiling host definitions. A different version is in the
\ TRANSIENT vocabulary. This one runs on the host system and
\ is used when compiling target definitions. The version in the
\ TARGET vocabulary is the version that will run on the target
\ system.
\ : \D ; \ Uncomment one of these. If uncommented, display debug info.
: \D POSTPONE \ ; IMMEDIATE
\ PART 2: THE TARGET DICTIONARY SPACE.
\ Next we need to define the target space and the words to access it.
517 CONSTANT ORIGIN \ Start address of Forth image.
8192 CONSTANT IMAGE_SIZE
CREATE IMAGE IMAGE_SIZE CHARS ALLOT \ This space contains the target image.
IMAGE IMAGE_SIZE 0 FILL \ Initialize it to zero.
\ Fetch and store characters in the target space.
: C@-T ( t-addr --- c) ORIGIN - CHARS IMAGE + C@ ;
: C!-T ( c t-addr ---) ORIGIN - CHARS IMAGE + C! ;
\ Fetch and store cells in the target space.
\ Z80 is little endian 16 bit so store explicitly little-endian.
: @-T ( t-addr --- x)
ORIGIN - CHARS IMAGE + DUP C@ SWAP 1 CHARS + C@ 8 LSHIFT + ;
: !-T ( x t-addr ---)
ORIGIN - CHARS IMAGE + OVER OVER C! SWAP 8 RSHIFT SWAP 1 CHARS + C! ;
\ A dictionary is constructed in the target space. Here are the primitives
\ to maintain the dictionary pointer and to reserve space.
VARIABLE DP-T \ Dictionary pointer for target dictionary.
ORIGIN DP-T ! \ Initialize it to origin.
: THERE ( --- t-addr) DP-T @ ; \ Equivalent of HERE in target space.
: ALLOT-T ( n --- ) DP-T +! ; \ Reserve n bytes in the dictionary.
: CHARS-T ( n1 --- n2 ) ;
: CELLS-T ( n1 --- n2 ) 1 LSHIFT ; \ Cells are 2 chars.
: ALIGN-T ; \ No alignment used.
: ALIGNED-T ( n1 --- n2 ) ;
: C,-T ( c --- ) THERE C!-T 1 CHARS ALLOT-T ;
: ,-T ( x --- ) THERE !-T 1 CELLS-T ALLOT-T ;
: PLACE-T ( c-addr len t-addr --- ) \ Move counted string to target space.
OVER OVER C!-T 1+ CHARS ORIGIN - IMAGE + SWAP CHARS CMOVE ;
\ Z80 cross assembler already loaded, configure it for cross assembly.
FORTH ' ,-T ASSEMBLER IS ,
FORTH ' C,-T ASSEMBLER IS C_
FORTH ' !-T ASSEMBLER IS V!
FORTH ' @-T ASSEMBLER IS V@
FORTH ' C!-T ASSEMBLER IS VC!
FORTH ' C@-T ASSEMBLER IS VC@
FORTH ' THERE ASSEMBLER IS HERE
FORTH
\ PART 3: CREATING NEW DEFINITIONS IN THE TARGET SYSTEM.
\ These words create new target definitions, both the shadow definition
\ and the header in the target dictionary. The layout of target headers
\ can be changed but FIND in the target system must be changed accordingly.
\ All definitions are linked together in a number of threads. Each word
\ is linked in only one thread. Which thread the word is linked to, can be
\ determined from the name by a 'hash' code. To find a word, one can compute
\ the hash code and then one can search just one thread that contains a
\ small fraction of the words.
4 CONSTANT #THREADS \ Number of threads
CREATE TLINKS #THREADS CELLS ALLOT \ This array points to the names
\ of the last definition in each thread.
TLINKS #THREADS CELLS 0 FILL
VARIABLE LAST-T \ Address of last definition.
: HASH ( c-addr u #threads --- n)
>R OVER C@ 1 LSHIFT OVER 1 > IF ROT CHAR+ C@ 2 LSHIFT XOR ELSE ROT DROP
THEN XOR
R> 1- AND
;
: "HEADER >IN @ CREATE >IN ! \ Create the shadow definition.
BL WORD
DUP COUNT #THREADS HASH >R \ Compute the hash code.
ALIGN-T TLINKS R@ CELLS + @ ,-T \ Lay out the link field.
\D DUP COUNT CR ." Creating: " TYPE ." Hash:" R@ .
COUNT DUP >R THERE PLACE-T \ Place name in target dictionary.
THERE TLINKS R> R> SWAP >R CELLS + !
THERE LAST-T !
THERE C@-T 128 OR THERE C!-T R> 1+ ALLOT-T ALIGN-T ;
\ Set bit 7 of count byte as a marker.
\ : "HEADER CREATE ALIGN-T ; \ Alternative for "HEADER in case the target system
\ is just an application without headers.
ALSO TRANSIENT DEFINITIONS
: IMMEDIATE LAST-T @ DUP C@-T 64 OR SWAP C!-T ;
\ Set the IMMEDIATE bit of last name.
PREVIOUS DEFINITIONS
\ PART 4: FORWARD REFERENCES
\ Some definitions are referenced before they are defined. A definition
\ in the TRANSIENT voc is created for each forward referenced definition.
\ This links all addresses together where the forward reference is used.
\ The word RESOLVE stores the real address everywhere it is needed.
: FORWARD
CREATE 0 , \ Store head of list in the definition.
DOES>
DUP @ ,-T THERE 1 CELLS-T - SWAP ! \ Reserve a cell in the dictionary
\ where the call to the forward definition must come.
\ As the call address is unknown, store link to next
\ reference instead.
;
: RESOLVE
ALSO TARGET >IN @ ' >BODY @ >R >IN ! \ Find the resolving word in the
\ target voc. and take the CFA out of the definition.
\D >IN @ BL WORD COUNT CR ." Resolving: " TYPE >IN !
TRANSIENT ' >BODY @ \ Find the forward ref word in the
\ TRANSIENT VOC and take list head.
BEGIN
DUP \ Traverse all the links until end.
WHILE
DUP @-T \ Take address of next link from dict.
R@ ROT !-T \ Set resolved address in dict.
REPEAT DROP R> DROP PREVIOUS
;
\ PART 5: CODE GENERATION
\ Zilog Z80 Forth is a direct threaded Forth. It uses the following
\ registers: SP for stack pointer, IX for return stack pointer, DE for
\ BC for TOS
\ The code field of a definition contains a CALL instruction.
: CALL, [ HEX ] CD C,-T [ DECIMAL ] ;
VARIABLE STATE-T 0 STATE-T ! \ State variable for cross compiler.
: T] 1 STATE-T ! ;
: T[ 0 STATE-T ! ;
VARIABLE CSP \ Stack pointer checking between : and ;
: !CSP DEPTH CSP ! ;
: ?CSP DEPTH CSP @ - ABORT" Incomplete control structure" ;
TRANSIENT DEFINITIONS FORTH
FORWARD LIT
FORWARD DOCOL
FORWARD DOCON
FORWARD DOVAR
FORWARD UNNEST
FORWARD BRANCH
FORWARD ?BRANCH
FORWARD DODOES
FORTH DEFINITIONS
: LITERAL-T ( n --- )
\D DUP ." Literal:" . CR
[ TRANSIENT ] LIT [ FORTH ] ,-T ;
TRANSIENT DEFINITIONS FORTH
\ Now define the words that do compile code.
: : !CSP "HEADER THERE , CALL, [ TRANSIENT ] DOCOL [ FORTH ] T]
DOES> @ ,-T ;
: ; [ TRANSIENT ] UNNEST [ FORTH ] \ Compile the unnest primitive.
T[ ?CSP \ Quit compilation state.
;
: CODE "HEADER ASSEMBLE THERE ,
DOES> @ ,-T ;
: END-CODE [ ASSEMBLER ] ENDASM [ FORTH ] ;
: LABEL THERE CONSTANT ASSEMBLE ;
FORTH DEFINITIONS
\ PART 6: DEFINING WORDS.
TRANSIENT DEFINITIONS FORTH
: VARIABLE "HEADER THERE , CALL, [ TRANSIENT ] DOVAR [ FORTH ] 0 ,-T
\ Create a variable.
DOES> @ ,-T ;
: CONSTANT "HEADER THERE , CALL, [ TRANSIENT ] DOCON [ FORTH ]
,-T
DOES> @ ,-T ;
FORTH DEFINITIONS
: T' ( --- t-addr) \ Find the execution token of a target definition.
ALSO TARGET '
\D ." T' shadow address, target address " DUP . DUP >BODY @ .
>BODY @ \ Get the address from the shadow definition.
PREVIOUS
;
: >BODY-T ( t-addr1 --- t-addr2 ) \ Convert executing token to param address.
3 + ;
\ PART 7: COMPILING WORDS
TRANSIENT DEFINITIONS FORTH
\ The TRANSIENT definitions for IF, THEN etc. compile the
\ branch primitives BRAMCH and ?BRANCH.
: BEGIN THERE ;
: UNTIL [ TRANSIENT ] ?BRANCH [ FORTH ] ,-T ;
: IF [ TRANSIENT ] ?BRANCH [ FORTH ] THERE 1 CELLS-T ALLOT-T ;
: THEN THERE SWAP !-T ; TARGET
: ELSE [ TRANSIENT ] BRANCH THERE 1 CELLS-T ALLOT-T SWAP THEN [ FORTH ] ;
: WHILE [ TRANSIENT ] IF [ FORTH ] SWAP ; TARGET
: REPEAT [ TRANSIENT ] BRANCH ,-T THEN [ FORTH ] ;
FORWARD (DO)
FORWARD (LOOP)
FORWARD (.")
FORWARD (POSTPONE)
: DO [ TRANSIENT ] (DO) [ FORTH ] THERE ;
: LOOP [ TRANSIENT ] (LOOP) [ FORTH ] ,-T ;
: ." [ TRANSIENT ] (.") [ FORTH ] 34 WORD COUNT DUP 1+ >R
THERE PLACE-T R> ALLOT-T ALIGN-T ;
: POSTPONE [ TRANSIENT ] (POSTPONE) [ FORTH ] T' ,-T ;
: \ POSTPONE \ ; IMMEDIATE
: \G POSTPONE \ ; IMMEDIATE
: ( POSTPONE ( ; IMMEDIATE \ Move duplicates of comment words to TRANSIENT
: CHARS-T CHARS-T ; \ Also words that must be executed while cross compiling.
: CELLS-T CELLS-T ;
: ALLOT-T ALLOT-T ;
: ['] T' LITERAL-T ;
FORTH DEFINITIONS
\ PART 8: THE CROSS COMPILER ITSELF.
VARIABLE DPL
: NUMBER? ( c-addr ---- d f)
-1 DPL !
BASE @ >R
COUNT
OVER C@ 45 = DUP >R IF 1 - SWAP 1 + SWAP THEN \ Get any - sign
OVER C@ 36 = IF 16 BASE ! 1 - SWAP 1 + SWAP THEN \ $ sign for hex.
OVER C@ 35 = IF 10 BASE ! 1 - SWAP 1 + SWAP THEN \ # sign for decimal
DUP 0 > 0= IF R> DROP R> BASE ! 0 EXIT THEN \ Length 0 or less?
>R >R 0 0 R> R>
BEGIN
>NUMBER
DUP IF OVER C@ 46 = IF 1 - DUP DPL ! SWAP 1 + SWAP ELSE \ handle point.
R> DROP R> BASE ! 0 EXIT THEN \ Error if anything but point
THEN
DUP 0= UNTIL DROP DROP R> IF DNEGATE THEN
R> BASE ! -1
;
: CROSS-COMPILE
ONLY TARGET DEFINITIONS ALSO TRANSIENT \ Restrict search order.
BEGIN
BL WORD
\D CR DUP COUNT TYPE
DUP C@ 0= IF \ Get new word
DROP REFILL DROP \ If empty, get new line.
ELSE
DUP COUNT S" END-CROSS" COMPARE 0= \ Exit cross compiler on END-CROSS
IF
ONLY FORTH ALSO DEFINITIONS \ Normal search order again.
DROP EXIT
THEN
FIND IF \ Execute if found.
EXECUTE
ELSE
NUMBER? 0= ABORT" Undefined word" DROP
STATE-T @ IF \ Parse it as a number.
LITERAL-T \ If compiling then compile as a literal.
THEN
THEN
THEN
0 UNTIL
;