Annotation of gforth/prims2x.fs, revision 1.107
1.16 anton 1: \ converts primitives to, e.g., C code
2:
1.47 anton 3: \ Copyright (C) 1995,1996,1997,1998,2000 Free Software Foundation, Inc.
1.16 anton 4:
5: \ This file is part of Gforth.
6:
7: \ Gforth is free software; you can redistribute it and/or
8: \ modify it under the terms of the GNU General Public License
9: \ as published by the Free Software Foundation; either version 2
10: \ of the License, or (at your option) any later version.
11:
12: \ This program is distributed in the hope that it will be useful,
13: \ but WITHOUT ANY WARRANTY; without even the implied warranty of
14: \ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15: \ GNU General Public License for more details.
16:
17: \ You should have received a copy of the GNU General Public License
18: \ along with this program; if not, write to the Free Software
1.48 anton 19: \ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
1.16 anton 20:
21:
1.71 anton 22: \ This is not very nice (hard limits, no checking, assumes 1 chars = 1).
23: \ And it grew even worse when it aged.
1.1 anton 24:
25: \ Optimizations:
26: \ superfluous stores are removed. GCC removes the superfluous loads by itself
27: \ TOS and FTOS can be kept in register( variable)s.
28: \
29: \ Problems:
30: \ The TOS optimization is somewhat hairy. The problems by example:
31: \ 1) dup ( w -- w w ): w=TOS; sp-=1; sp[1]=w; TOS=w;
32: \ The store is not superfluous although the earlier opt. would think so
33: \ Alternatively: sp[0]=TOS; w=TOS; sp-=1; TOS=w;
34: \ 2) ( -- .. ): sp[0] = TOS; ... /* This additional store is necessary */
35: \ 3) ( .. -- ): ... TOS = sp[0]; /* as well as this load */
36: \ 4) ( -- ): /* but here they are unnecessary */
37: \ 5) Words that call NEXT themselves have to be done very carefully.
38: \
39: \ To do:
1.8 pazsan 40: \ add the store optimization for doubles
1.1 anton 41: \ regarding problem 1 above: It would be better (for over) to implement
42: \ the alternative
1.80 anton 43: \ store optimization for combined instructions.
44:
45: \ Design Uglyness:
46:
47: \ - global state (values, variables) in connection with combined instructions.
48:
49: \ - index computation is different for instruction-stream and the
50: \ stacks; there are two mechanisms for dealing with that
51: \ (stack-in-index-xt and a test for stack==instruction-stream); there
52: \ should be only one.
1.1 anton 53:
1.3 pazsan 54: warnings off
55:
1.97 jwilke 56: [IFUNDEF] try
57: include startup.fs
58: [THEN]
59:
1.49 anton 60: : struct% struct ; \ struct is redefined in gray
61:
1.98 pazsan 62: warnings off
63:
1.39 jwilke 64: include ./gray.fs
1.1 anton 65:
1.69 anton 66: 32 constant max-effect \ number of things on one side of a stack effect
1.71 anton 67: 4 constant max-stacks \ the max. number of stacks (including inst-stream).
1.1 anton 68: 255 constant maxchar
69: maxchar 1+ constant eof-char
1.17 anton 70: #tab constant tab-char
71: #lf constant nl-char
1.1 anton 72:
1.18 anton 73: variable rawinput \ pointer to next character to be scanned
74: variable endrawinput \ pointer to the end of the input (the char after the last)
75: variable cookedinput \ pointer to the next char to be parsed
1.17 anton 76: variable line \ line number of char pointed to by input
1.65 anton 77: variable line-start \ pointer to start of current line (for error messages)
78: 0 line !
1.17 anton 79: 2variable filename \ filename of original input file
80: 0 0 filename 2!
1.25 pazsan 81: 2variable f-comment
82: 0 0 f-comment 2!
1.17 anton 83: variable skipsynclines \ are sync lines ("#line ...") invisible to the parser?
84: skipsynclines on
1.1 anton 85:
1.72 anton 86: : th ( addr1 n -- addr2 )
87: cells + ;
88:
89: : holds ( addr u -- )
90: \ like HOLD, but for a string
91: tuck + swap 0 +do
92: 1- dup c@ hold
93: loop
94: drop ;
1.71 anton 95:
1.82 anton 96: : insert-wordlist { c-addr u wordlist xt -- }
1.81 anton 97: \ adds name "addr u" to wordlist using defining word xt
98: \ xt may cause additional stack effects
99: get-current >r wordlist set-current
100: c-addr u nextname xt execute
101: r> set-current ;
102:
1.1 anton 103: : start ( -- addr )
1.18 anton 104: cookedinput @ ;
1.1 anton 105:
106: : end ( addr -- addr u )
1.18 anton 107: cookedinput @ over - ;
1.1 anton 108:
1.71 anton 109: : print-error-line ( -- )
110: \ print the current line and position
111: line-start @ endrawinput @ over - 2dup nl-char scan drop nip ( start end )
112: over - type cr
113: line-start @ rawinput @ over - typewhite ." ^" cr ;
114:
115: : ?print-error { f addr u -- }
116: f ?not? if
117: outfile-id >r try
118: stderr to outfile-id
119: filename 2@ type ." :" line @ 0 .r ." : " addr u type cr
120: print-error-line
121: 0
122: recover endtry
123: r> to outfile-id throw
124: abort
125: endif ;
126:
1.63 anton 127: : quote ( -- )
128: [char] " emit ;
129:
1.72 anton 130: variable output \ xt ( -- ) of output word for simple primitives
131: variable output-combined \ xt ( -- ) of output word for combined primitives
1.1 anton 132:
1.49 anton 133: struct%
1.71 anton 134: cell% field stack-number \ the number of this stack
1.49 anton 135: cell% 2* field stack-pointer \ stackpointer name
1.74 anton 136: cell% field stack-type \ name for default type of stack items
1.53 anton 137: cell% field stack-in-index-xt \ ( in-size item -- in-index )
1.49 anton 138: end-struct stack%
139:
1.53 anton 140: struct%
141: cell% 2* field item-name \ name, excluding stack prefixes
142: cell% field item-stack \ descriptor for the stack used, 0 is default
143: cell% field item-type \ descriptor for the item type
144: cell% field item-offset \ offset in stack items, 0 for the deepest element
1.66 anton 145: cell% field item-first \ true if this is the first occurence of the item
1.53 anton 146: end-struct item%
147:
148: struct%
149: cell% 2* field type-c-name
150: cell% field type-stack \ default stack
151: cell% field type-size \ size of type in stack items
152: cell% field type-fetch \ xt of fetch code generator ( item -- )
153: cell% field type-store \ xt of store code generator ( item -- )
154: end-struct type%
155:
1.72 anton 156: variable next-stack-number 0 next-stack-number !
157: create stacks max-stacks cells allot \ array of stacks
158:
1.53 anton 159: : stack-in-index ( in-size item -- in-index )
160: item-offset @ - 1- ;
161:
162: : inst-in-index ( in-size item -- in-index )
163: nip dup item-offset @ swap item-type @ type-size @ + 1- ;
164:
1.92 anton 165: : make-stack ( addr-ptr u1 type "stack-name" -- )
166: next-stack-number @ max-stacks < s" too many stacks" ?print-error
1.49 anton 167: create stack% %allot >r
1.72 anton 168: r@ stacks next-stack-number @ th !
1.92 anton 169: next-stack-number @ r@ stack-number !
170: 1 next-stack-number +!
1.74 anton 171: r@ stack-type !
1.53 anton 172: save-mem r@ stack-pointer 2!
173: ['] stack-in-index r> stack-in-index-xt ! ;
1.49 anton 174:
1.92 anton 175: : map-stacks { xt -- }
176: \ perform xt for all stacks except inst-stream
177: next-stack-number @ 1 +do
178: stacks i th @ xt execute
179: loop ;
180:
1.49 anton 181: \ stack items
182:
183: : init-item ( addr u addr1 -- )
184: \ initialize item at addr1 with name addr u
185: \ !! remove stack prefix
186: dup item% %size erase
187: item-name 2! ;
188:
1.64 anton 189: : map-items { addr end xt -- }
190: \ perform xt for all items in array addr...end
191: end addr ?do
192: i xt execute
193: item% %size +loop ;
194:
1.77 anton 195: \ types
196:
197: : print-type-prefix ( type -- )
198: body> >head name>string type ;
199:
1.49 anton 200: \ various variables for storing stuff of one primitive
1.1 anton 201:
1.69 anton 202: struct%
203: cell% 2* field prim-name
204: cell% 2* field prim-wordset
205: cell% 2* field prim-c-name
206: cell% 2* field prim-doc
207: cell% 2* field prim-c-code
208: cell% 2* field prim-forth-code
209: cell% 2* field prim-stack-string
1.82 anton 210: cell% field prim-num \ ordinal number
1.75 anton 211: cell% field prim-items-wordlist \ unique items
1.69 anton 212: item% max-effect * field prim-effect-in
213: item% max-effect * field prim-effect-out
214: cell% field prim-effect-in-end
215: cell% field prim-effect-out-end
1.71 anton 216: cell% max-stacks * field prim-stacks-in \ number of in items per stack
217: cell% max-stacks * field prim-stacks-out \ number of out items per stack
1.69 anton 218: end-struct prim%
219:
1.70 anton 220: : make-prim ( -- prim )
221: prim% %alloc { p }
222: s" " p prim-doc 2! s" " p prim-forth-code 2! s" " p prim-wordset 2!
223: p ;
224:
1.79 anton 225: 0 value prim \ in combined prims either combined or a part
226: 0 value combined \ in combined prims the combined prim
227: variable in-part \ true if processing a part
228: in-part off
229:
230: 1000 constant max-combined
231: create combined-prims max-combined cells allot
232: variable num-combined
233:
1.81 anton 234: table constant combinations
235: \ the keys are the sequences of pointers to primitives
236:
1.79 anton 237: create current-depth max-stacks cells allot
238: create max-depth max-stacks cells allot
239: create min-depth max-stacks cells allot
1.69 anton 240:
1.71 anton 241: wordlist constant primitives
242:
243: : create-prim ( prim -- )
1.82 anton 244: dup prim-name 2@ primitives ['] constant insert-wordlist ;
1.71 anton 245:
246: : stack-in ( stack -- addr )
247: \ address of number of stack items in effect in
248: stack-number @ cells prim prim-stacks-in + ;
249:
250: : stack-out ( stack -- addr )
251: \ address of number of stack items in effect out
252: stack-number @ cells prim prim-stacks-out + ;
253:
1.69 anton 254: \ global vars
1.17 anton 255: variable c-line
256: 2variable c-filename
257: variable name-line
258: 2variable name-filename
259: 2variable last-name-filename
1.30 pazsan 260: Variable function-number 0 function-number !
1.1 anton 261:
262: \ a few more set ops
263:
264: : bit-equivalent ( w1 w2 -- w3 )
265: xor invert ;
266:
267: : complement ( set1 -- set2 )
268: empty ['] bit-equivalent binary-set-operation ;
269:
1.80 anton 270: \ stack access stuff
1.79 anton 271:
272: : normal-stack-access ( n stack -- )
1.49 anton 273: stack-pointer 2@ type
274: dup
275: if
276: ." [" 0 .r ." ]"
277: else
278: drop ." TOS"
279: endif ;
1.1 anton 280:
1.80 anton 281: \ forward declaration for inst-stream (breaks cycle in definitions)
282: defer inst-stream-f ( -- stack )
283:
1.79 anton 284: : part-stack-access { n stack -- }
1.80 anton 285: \ print _<stack><x>, x=inst-stream? n : maxdepth-currentdepth-n-1
1.79 anton 286: ." _" stack stack-pointer 2@ type
287: stack stack-number @ { stack# }
1.80 anton 288: current-depth stack# th @ n + { access-depth }
289: stack inst-stream-f = if
290: access-depth
291: else
292: combined prim-stacks-in stack# th @
293: assert( dup max-depth stack# th @ = )
294: access-depth - 1-
295: endif
1.79 anton 296: 0 .r ;
297:
298: : stack-access ( n stack -- )
299: \ print a stack access at index n of stack
300: in-part @ if
301: part-stack-access
302: else
303: normal-stack-access
304: endif ;
305:
1.53 anton 306: : item-in-index { item -- n }
1.49 anton 307: \ n is the index of item (in the in-effect)
1.53 anton 308: item item-stack @ dup >r stack-in @ ( in-size r:stack )
309: item r> stack-in-index-xt @ execute ;
1.1 anton 310:
1.78 anton 311: : item-stack-type-name ( item -- addr u )
312: item-stack @ stack-type @ type-c-name 2@ ;
313:
1.1 anton 314: : fetch-single ( item -- )
1.106 anton 315: \ fetch a single stack item from its stack
316: >r
317: ." vm_" r@ item-stack-type-name type
318: ." 2" r@ item-type @ print-type-prefix ." ("
319: r@ item-in-index r@ item-stack @ stack-access ." ,"
320: r@ item-name 2@ type
321: ." );" cr
322: rdrop ;
1.1 anton 323:
324: : fetch-double ( item -- )
1.106 anton 325: \ fetch a double stack item from its stack
326: >r
327: ." vm_two"
328: r@ item-stack-type-name type ." 2"
329: r@ item-type @ print-type-prefix ." ("
330: r@ item-in-index r@ item-stack @ 2dup ." (Cell)" stack-access
331: ." , " -1 under+ ." (Cell)" stack-access
332: ." , " r@ item-name 2@ type
333: ." )" cr
334: rdrop ;
1.1 anton 335:
1.49 anton 336: : same-as-in? ( item -- f )
337: \ f is true iff the offset and stack of item is the same as on input
1.1 anton 338: >r
1.74 anton 339: r@ item-first @ if
340: rdrop false exit
341: endif
1.75 anton 342: r@ item-name 2@ prim prim-items-wordlist @ search-wordlist 0= abort" bug"
1.1 anton 343: execute @
344: dup r@ =
345: if \ item first appeared in output
346: drop false
347: else
1.49 anton 348: dup item-stack @ r@ item-stack @ =
349: swap item-offset @ r@ item-offset @ = and
1.1 anton 350: endif
351: rdrop ;
352:
1.49 anton 353: : item-out-index ( item -- n )
354: \ n is the index of item (in the in-effect)
355: >r r@ item-stack @ stack-out @ r> item-offset @ - 1- ;
1.31 pazsan 356:
1.1 anton 357: : really-store-single ( item -- )
1.106 anton 358: >r
359: ." vm_"
360: r@ item-type @ print-type-prefix ." 2"
361: r@ item-stack-type-name type ." ("
362: r@ item-name 2@ type ." ,"
363: r@ item-out-index r@ item-stack @ stack-access ." );"
364: rdrop ;
1.1 anton 365:
366: : store-single ( item -- )
367: >r
1.49 anton 368: r@ same-as-in?
1.1 anton 369: if
1.49 anton 370: r@ item-in-index 0= r@ item-out-index 0= xor
1.1 anton 371: if
1.49 anton 372: ." IF_" r@ item-stack @ stack-pointer 2@ type
373: ." TOS(" r@ really-store-single ." );" cr
1.1 anton 374: endif
375: else
376: r@ really-store-single cr
377: endif
378: rdrop ;
379:
380: : store-double ( item -- )
381: \ !! store optimization is not performed, because it is not yet needed
382: >r
1.78 anton 383: ." vm_"
384: r@ item-type @ print-type-prefix ." 2two"
385: r@ item-stack-type-name type ." ("
386: r@ item-name 2@ type ." , "
1.49 anton 387: r@ item-out-index r@ item-stack @ 2dup stack-access
388: ." , " -1 under+ stack-access
1.106 anton 389: ." )" cr
1.1 anton 390: rdrop ;
391:
1.54 anton 392: : single ( -- xt1 xt2 n )
393: ['] fetch-single ['] store-single 1 ;
1.1 anton 394:
1.54 anton 395: : double ( -- xt1 xt2 n )
396: ['] fetch-double ['] store-double 2 ;
1.1 anton 397:
398: : s, ( addr u -- )
399: \ allocate a string
400: here swap dup allot move ;
401:
1.50 anton 402: wordlist constant prefixes
403:
404: : declare ( addr "name" -- )
405: \ remember that there is a stack item at addr called name
406: create , ;
407:
408: : !default ( w addr -- )
409: dup @ if
410: 2drop \ leave nonzero alone
411: else
412: !
413: endif ;
414:
415: : create-type { addr u xt1 xt2 n stack -- } ( "prefix" -- )
1.49 anton 416: \ describes a type
417: \ addr u specifies the C type name
418: \ stack effect entries of the type start with prefix
419: create type% %allot >r
420: addr u save-mem r@ type-c-name 2!
421: xt1 r@ type-fetch !
422: xt2 r@ type-store !
423: n r@ type-size !
424: stack r@ type-stack !
425: rdrop ;
1.1 anton 426:
1.105 anton 427: : type-prefix ( addr u xt1 xt2 n stack "prefix" -- )
1.94 anton 428: get-current >r prefixes set-current
429: create-type r> set-current
1.50 anton 430: does> ( item -- )
431: \ initialize item
432: { item typ }
433: typ item item-type !
434: typ type-stack @ item item-stack !default
1.75 anton 435: item item-name 2@ prim prim-items-wordlist @ search-wordlist 0= if
1.66 anton 436: item item-name 2@ nextname item declare
437: item item-first on
438: \ typ type-c-name 2@ type space type ." ;" cr
1.50 anton 439: else
440: drop
1.66 anton 441: item item-first off
1.50 anton 442: endif ;
443:
444: : execute-prefix ( item addr1 u1 -- )
445: \ execute the word ( item -- ) associated with the longest prefix
446: \ of addr1 u1
447: 0 swap ?do
448: dup i prefixes search-wordlist
449: if \ ok, we have the type ( item addr1 xt )
450: nip execute
451: UNLOOP EXIT
452: endif
453: -1 s+loop
454: \ we did not find a type, abort
1.81 anton 455: false s" unknown prefix" ?print-error ;
1.1 anton 456:
457: : declaration ( item -- )
1.50 anton 458: dup item-name 2@ execute-prefix ;
1.1 anton 459:
1.64 anton 460: : declaration-list ( addr1 addr2 -- )
461: ['] declaration map-items ;
462:
463: : declarations ( -- )
1.75 anton 464: wordlist dup prim prim-items-wordlist ! set-current
1.69 anton 465: prim prim-effect-in prim prim-effect-in-end @ declaration-list
466: prim prim-effect-out prim prim-effect-out-end @ declaration-list ;
1.64 anton 467:
1.66 anton 468: : print-declaration { item -- }
469: item item-first @ if
470: item item-type @ type-c-name 2@ type space
471: item item-name 2@ type ." ;" cr
472: endif ;
473:
474: : print-declarations ( -- )
1.69 anton 475: prim prim-effect-in prim prim-effect-in-end @ ['] print-declaration map-items
476: prim prim-effect-out prim prim-effect-out-end @ ['] print-declaration map-items ;
1.66 anton 477:
1.51 anton 478: : stack-prefix ( stack "prefix" -- )
1.94 anton 479: get-current >r prefixes set-current
1.51 anton 480: name tuck nextname create ( stack length ) 2,
1.94 anton 481: r> set-current
1.51 anton 482: does> ( item -- )
483: 2@ { item stack prefix-length }
484: item item-name 2@ prefix-length /string item item-name 2!
485: stack item item-stack !
486: item declaration ;
1.73 anton 487:
1.74 anton 488: \ types pointed to by stacks for use in combined prims
1.83 anton 489: \ !! output-c-combined shouldn't use these names!
1.92 anton 490: : stack-type-name ( addr u "name" -- )
491: single 0 create-type ;
492:
1.93 anton 493: wordlist constant type-names \ this is here just to meet the requirement
494: \ that a type be a word; it is never used for lookup
1.83 anton 495:
1.93 anton 496: : stack ( "name" "stack-pointer" "type" -- )
497: \ define stack
498: name { d: stack-name }
499: name { d: stack-pointer }
500: name { d: stack-type }
501: get-current type-names set-current
502: stack-type 2dup nextname stack-type-name
503: set-current
504: stack-pointer lastxt >body stack-name nextname make-stack ;
505:
506: stack inst-stream IP Cell
1.73 anton 507: ' inst-in-index inst-stream stack-in-index-xt !
1.80 anton 508: ' inst-stream <is> inst-stream-f
1.73 anton 509: \ !! initialize stack-in and stack-out
1.1 anton 510:
511: \ offset computation
512: \ the leftmost (i.e. deepest) item has offset 0
513: \ the rightmost item has the highest offset
514:
1.49 anton 515: : compute-offset { item xt -- }
516: \ xt specifies in/out; update stack-in/out and set item-offset
517: item item-type @ type-size @
518: item item-stack @ xt execute dup @ >r +!
519: r> item item-offset ! ;
520:
1.64 anton 521: : compute-offset-in ( addr1 addr2 -- )
522: ['] stack-in compute-offset ;
523:
524: : compute-offset-out ( addr1 addr2 -- )
525: ['] stack-out compute-offset ;
1.49 anton 526:
527: : clear-stack { -- }
528: dup stack-in off stack-out off ;
1.1 anton 529:
530: : compute-offsets ( -- )
1.92 anton 531: ['] clear-stack map-stacks
1.53 anton 532: inst-stream clear-stack
1.69 anton 533: prim prim-effect-in prim prim-effect-in-end @ ['] compute-offset-in map-items
534: prim prim-effect-out prim prim-effect-out-end @ ['] compute-offset-out map-items
1.81 anton 535: inst-stream stack-out @ 0= s" # can only be on the input side" ?print-error ;
536:
537: : process-simple ( -- )
538: prim prim { W^ key } key cell
1.82 anton 539: combinations ['] constant insert-wordlist
1.81 anton 540: declarations compute-offsets
1.82 anton 541: output @ execute ;
1.49 anton 542:
543: : flush-a-tos { stack -- }
544: stack stack-out @ 0<> stack stack-in @ 0= and
545: if
546: ." IF_" stack stack-pointer 2@ 2dup type ." TOS("
547: 2dup type ." [0] = " type ." TOS);" cr
548: endif ;
1.1 anton 549:
550: : flush-tos ( -- )
1.92 anton 551: ['] flush-a-tos map-stacks ;
1.49 anton 552:
553: : fill-a-tos { stack -- }
554: stack stack-out @ 0= stack stack-in @ 0<> and
555: if
556: ." IF_" stack stack-pointer 2@ 2dup type ." TOS("
557: 2dup type ." TOS = " type ." [0]);" cr
558: endif ;
1.1 anton 559:
560: : fill-tos ( -- )
1.53 anton 561: \ !! inst-stream for prefetching?
1.92 anton 562: ['] fill-a-tos map-stacks ;
1.49 anton 563:
564: : fetch ( addr -- )
1.72 anton 565: dup item-type @ type-fetch @ execute ;
1.1 anton 566:
567: : fetches ( -- )
1.69 anton 568: prim prim-effect-in prim prim-effect-in-end @ ['] fetch map-items ;
1.49 anton 569:
570: : stack-pointer-update { stack -- }
571: \ stack grow downwards
572: stack stack-in @ stack stack-out @ -
573: ?dup-if \ this check is not necessary, gcc would do this for us
574: stack stack-pointer 2@ type ." += " 0 .r ." ;" cr
575: endif ;
1.1 anton 576:
1.55 anton 577: : inst-pointer-update ( -- )
578: inst-stream stack-in @ ?dup-if
579: ." INC_IP(" 0 .r ." );" cr
580: endif ;
581:
1.1 anton 582: : stack-pointer-updates ( -- )
1.55 anton 583: inst-pointer-update
1.92 anton 584: ['] stack-pointer-update map-stacks ;
1.1 anton 585:
586: : store ( item -- )
587: \ f is true if the item should be stored
588: \ f is false if the store is probably not necessary
1.49 anton 589: dup item-type @ type-store @ execute ;
1.1 anton 590:
591: : stores ( -- )
1.69 anton 592: prim prim-effect-out prim prim-effect-out-end @ ['] store map-items ;
1.8 pazsan 593:
1.91 anton 594: : print-debug-arg { item -- }
595: ." fputs(" quote space item item-name 2@ type ." =" quote ." , vm_out); "
596: ." printarg_" item item-type @ print-type-prefix
597: ." (" item item-name 2@ type ." );" cr ;
598:
599: : print-debug-args ( -- )
600: ." #ifdef VM_DEBUG" cr
601: ." if (vm_debug) {" cr
602: prim prim-effect-in prim prim-effect-in-end @ ['] print-debug-arg map-items
603: \ ." fputc('\n', vm_out);" cr
604: ." }" cr
605: ." #endif" cr ;
606:
607: : print-debug-result { item -- }
608: item item-first @ if
609: item print-debug-arg
610: endif ;
611:
612: : print-debug-results ( -- )
613: cr
614: ." #ifdef VM_DEBUG" cr
615: ." if (vm_debug) {" cr
616: ." fputs(" quote ." -- " quote ." , vm_out); "
617: prim prim-effect-out prim prim-effect-out-end @ ['] print-debug-result map-items
618: ." fputc('\n', vm_out);" cr
619: ." }" cr
620: ." #endif" cr ;
621:
1.86 anton 622: : output-super-end ( -- )
623: prim prim-c-code 2@ s" SET_IP" search if
624: ." SUPER_END;" cr
625: endif
626: 2drop ;
627:
1.52 anton 628: : output-c-tail ( -- )
629: \ the final part of the generated C code
1.86 anton 630: output-super-end
1.91 anton 631: print-debug-results
1.52 anton 632: ." NEXT_P1;" cr
633: stores
634: fill-tos
1.85 anton 635: ." NEXT_P2;" ;
1.52 anton 636:
1.85 anton 637: : type-c-code ( c-addr u xt -- )
638: \ like TYPE, but replaces "TAIL;" with tail code produced by xt
639: { xt }
1.52 anton 640: begin ( c-addr1 u1 )
641: 2dup s" TAIL;" search
642: while ( c-addr1 u1 c-addr3 u3 )
643: 2dup 2>r drop nip over - type
1.85 anton 644: xt execute
1.52 anton 645: 2r> 5 /string
646: \ !! resync #line missing
647: repeat
648: 2drop type ;
1.63 anton 649:
1.72 anton 650: : print-entry ( -- )
1.101 anton 651: ." LABEL(" prim prim-c-name 2@ type ." ):" ;
1.63 anton 652:
1.43 jwilke 653: : output-c ( -- )
1.72 anton 654: print-entry ." /* " prim prim-name 2@ type ." ( " prim prim-stack-string 2@ type ." ) */" cr
1.69 anton 655: ." /* " prim prim-doc 2@ type ." */" cr
656: ." NAME(" quote prim prim-name 2@ type quote ." )" cr \ debugging
1.1 anton 657: ." {" cr
658: ." DEF_CA" cr
1.66 anton 659: print-declarations
1.13 anton 660: ." NEXT_P0;" cr
661: flush-tos
1.1 anton 662: fetches
1.63 anton 663: print-debug-args
1.13 anton 664: stack-pointer-updates
1.1 anton 665: ." {" cr
1.63 anton 666: ." #line " c-line @ . quote c-filename 2@ type quote cr
1.85 anton 667: prim prim-c-code 2@ ['] output-c-tail type-c-code
1.1 anton 668: ." }" cr
1.52 anton 669: output-c-tail
1.1 anton 670: ." }" cr
671: cr
672: ;
673:
1.56 anton 674: : disasm-arg { item -- }
675: item item-stack @ inst-stream = if
1.107 ! anton 676: ." {" cr
! 677: item print-declaration
! 678: item fetch
! 679: item print-debug-arg
! 680: ." }" cr
1.56 anton 681: endif ;
682:
683: : disasm-args ( -- )
1.69 anton 684: prim prim-effect-in prim prim-effect-in-end @ ['] disasm-arg map-items ;
1.56 anton 685:
686: : output-disasm ( -- )
687: \ generate code for disassembling VM instructions
1.106 anton 688: ." if (VM_IS_INST(*ip, " function-number @ 0 .r ." )) {" cr
1.69 anton 689: ." fputs(" quote prim prim-name 2@ type quote ." , vm_out);" cr
1.56 anton 690: disasm-args
691: ." ip += " inst-stream stack-in @ 1+ 0 .r ." ;" cr
1.91 anton 692: ." goto _endif_;" cr
693: ." }" cr ;
1.56 anton 694:
1.86 anton 695: : output-profile ( -- )
696: \ generate code for postprocessing the VM block profile stuff
1.87 anton 697: ." if (VM_IS_INST(*ip, " function-number @ 0 .r ." )) {" cr
1.104 anton 698: ." add_inst(b, " quote prim prim-name 2@ type quote ." );" cr
1.86 anton 699: ." ip += " inst-stream stack-in @ 1+ 0 .r ." ;" cr
700: prim prim-c-code 2@ s" SET_IP" search nip nip
701: prim prim-c-code 2@ s" SUPER_END" search nip nip or if
702: ." return;" cr
1.91 anton 703: else
704: ." goto _endif_;" cr
1.86 anton 705: endif
1.91 anton 706: ." }" cr ;
1.86 anton 707:
1.104 anton 708: : output-profile-combined ( -- )
709: \ generate code for postprocessing the VM block profile stuff
710: ." if (VM_IS_INST(*ip, " function-number @ 0 .r ." )) {" cr
711: num-combined @ 0 +do
712: ." add_inst(b, " quote
713: combined-prims i th @ prim-name 2@ type
714: quote ." );" cr
715: loop
716: ." ip += " inst-stream stack-in @ 1+ 0 .r ." ;" cr
717: combined-prims num-combined @ 1- th @ prim-c-code 2@ s" SET_IP" search nip nip
718: combined-prims num-combined @ 1- th @ prim-c-code 2@ s" SUPER_END" search nip nip or if
719: ." return;" cr
720: else
721: ." goto _endif_;" cr
722: endif
723: ." }" cr ;
724:
1.103 anton 725: : output-superend ( -- )
726: \ output flag specifying whether the current word ends a dynamic superinst
727: prim prim-c-code 2@ s" SET_IP" search nip nip
728: prim prim-c-code 2@ s" SUPER_END" search nip nip or 0<>
729: prim prim-c-code 2@ s" SUPER_CONTINUE" search nip nip 0= and
730: negate 0 .r ." , /* " prim prim-name 2@ type ." */" cr ;
731:
1.60 anton 732: : gen-arg-parm { item -- }
733: item item-stack @ inst-stream = if
734: ." , " item item-type @ type-c-name 2@ type space
735: item item-name 2@ type
736: endif ;
737:
738: : gen-args-parm ( -- )
1.69 anton 739: prim prim-effect-in prim prim-effect-in-end @ ['] gen-arg-parm map-items ;
1.60 anton 740:
741: : gen-arg-gen { item -- }
742: item item-stack @ inst-stream = if
743: ." genarg_" item item-type @ print-type-prefix
744: ." (ctp, " item item-name 2@ type ." );" cr
745: endif ;
746:
747: : gen-args-gen ( -- )
1.69 anton 748: prim prim-effect-in prim prim-effect-in-end @ ['] gen-arg-gen map-items ;
1.60 anton 749:
750: : output-gen ( -- )
751: \ generate C code for generating VM instructions
1.69 anton 752: ." void gen_" prim prim-c-name 2@ type ." (Inst **ctp" gen-args-parm ." )" cr
1.60 anton 753: ." {" cr
754: ." gen_inst(ctp, vm_prim[" function-number @ 0 .r ." ]);" cr
755: gen-args-gen
1.68 anton 756: ." }" cr ;
1.60 anton 757:
1.49 anton 758: : stack-used? { stack -- f }
759: stack stack-in @ stack stack-out @ or 0<> ;
1.44 jwilke 760:
1.30 pazsan 761: : output-funclabel ( -- )
1.69 anton 762: ." &I_" prim prim-c-name 2@ type ." ," cr ;
1.30 pazsan 763:
764: : output-forthname ( -- )
1.69 anton 765: '" emit prim prim-name 2@ type '" emit ." ," cr ;
1.30 pazsan 766:
1.92 anton 767: \ : output-c-func ( -- )
768: \ \ used for word libraries
769: \ ." Cell * I_" prim prim-c-name 2@ type ." (Cell *SP, Cell **FP) /* " prim prim-name 2@ type
770: \ ." ( " prim prim-stack-string 2@ type ." ) */" cr
771: \ ." /* " prim prim-doc 2@ type ." */" cr
772: \ ." NAME(" quote prim prim-name 2@ type quote ." )" cr
773: \ \ debugging
774: \ ." {" cr
775: \ print-declarations
776: \ \ !! don't know what to do about that
777: \ inst-stream stack-used? IF ." Cell *ip=IP;" cr THEN
778: \ data-stack stack-used? IF ." Cell *sp=SP;" cr THEN
779: \ fp-stack stack-used? IF ." Cell *fp=*FP;" cr THEN
780: \ return-stack stack-used? IF ." Cell *rp=*RP;" cr THEN
781: \ flush-tos
782: \ fetches
783: \ stack-pointer-updates
784: \ fp-stack stack-used? IF ." *FP=fp;" cr THEN
785: \ ." {" cr
786: \ ." #line " c-line @ . quote c-filename 2@ type quote cr
787: \ prim prim-c-code 2@ type
788: \ ." }" cr
789: \ stores
790: \ fill-tos
791: \ ." return (sp);" cr
792: \ ." }" cr
793: \ cr ;
1.30 pazsan 794:
1.43 jwilke 795: : output-label ( -- )
1.102 anton 796: ." INST_ADDR(" prim prim-c-name 2@ type ." )," cr ;
1.1 anton 797:
1.43 jwilke 798: : output-alias ( -- )
1.69 anton 799: ( primitive-number @ . ." alias " ) ." Primitive " prim prim-name 2@ type cr ;
1.1 anton 800:
1.43 jwilke 801: : output-forth ( -- )
1.69 anton 802: prim prim-forth-code @ 0=
1.30 pazsan 803: IF \ output-alias
1.28 jwilke 804: \ this is bad for ec: an alias is compiled if tho word does not exist!
805: \ JAW
1.69 anton 806: ELSE ." : " prim prim-name 2@ type ." ( "
807: prim prim-stack-string 2@ type ." )" cr
808: prim prim-forth-code 2@ type cr
1.30 pazsan 809: THEN ;
1.10 anton 810:
1.17 anton 811: : output-tag-file ( -- )
812: name-filename 2@ last-name-filename 2@ compare if
813: name-filename 2@ last-name-filename 2!
814: #ff emit cr
815: name-filename 2@ type
816: ." ,0" cr
817: endif ;
818:
819: : output-tag ( -- )
820: output-tag-file
1.69 anton 821: prim prim-name 2@ 1+ type
1.17 anton 822: 127 emit
1.69 anton 823: space prim prim-name 2@ type space
1.17 anton 824: 1 emit
825: name-line @ 0 .r
826: ." ,0" cr ;
827:
1.100 pazsan 828: : output-vi-tag ( -- )
829: name-filename 2@ type #tab emit
830: prim prim-name 2@ type #tab emit
831: ." /^" prim prim-name 2@ type ." *(/" cr ;
832:
1.10 anton 833: [IFDEF] documentation
834: : register-doc ( -- )
1.82 anton 835: prim prim-name 2@ documentation ['] create insert-wordlist
1.69 anton 836: prim prim-name 2@ 2,
837: prim prim-stack-string 2@ condition-stack-effect 2,
838: prim prim-wordset 2@ 2,
839: prim prim-c-name 2@ condition-pronounciation 2,
1.82 anton 840: prim prim-doc 2@ 2, ;
1.10 anton 841: [THEN]
1.67 anton 842:
843:
1.69 anton 844: \ combining instructions
845:
846: \ The input should look like this:
847:
848: \ lit_+ = lit +
849:
850: \ The output should look like this:
851:
852: \ I_lit_+:
853: \ {
854: \ DEF_CA
855: \ Cell _x_ip0;
856: \ Cell _x_sp0;
857: \ Cell _x_sp1;
858: \ NEXT_P0;
859: \ _x_ip0 = (Cell) IPTOS;
860: \ _x_sp0 = (Cell) spTOS;
861: \ INC_IP(1);
862: \ /* sp += 0; */
863: \ /* lit ( #w -- w ) */
864: \ /* */
865: \ NAME("lit")
866: \ {
867: \ Cell w;
868: \ w = (Cell) _x_ip0;
869: \ #ifdef VM_DEBUG
870: \ if (vm_debug) {
871: \ fputs(" w=", vm_out); printarg_w (w);
872: \ fputc('\n', vm_out);
873: \ }
874: \ #endif
875: \ {
876: \ #line 136 "./prim"
877: \ }
878: \ _x_sp1 = (Cell)w;
879: \ }
880: \ I_plus: /* + ( n1 n2 -- n ) */
881: \ /* */
882: \ NAME("+")
883: \ {
884: \ DEF_CA
885: \ Cell n1;
886: \ Cell n2;
887: \ Cell n;
888: \ NEXT_P0;
889: \ n1 = (Cell) _x_sp0;
890: \ n2 = (Cell) _x_sp1;
891: \ #ifdef VM_DEBUG
892: \ if (vm_debug) {
893: \ fputs(" n1=", vm_out); printarg_n (n1);
894: \ fputs(" n2=", vm_out); printarg_n (n2);
895: \ fputc('\n', vm_out);
896: \ }
897: \ #endif
898: \ {
899: \ #line 516 "./prim"
900: \ n = n1+n2;
901: \ }
902: \ NEXT_P1;
903: \ _x_sp0 = (Cell)n;
904: \ NEXT_P2;
905: \ }
906: \ NEXT_P1;
907: \ spTOS = (Cell)_x_sp0;
908: \ NEXT_P2;
909:
1.71 anton 910: : init-combined ( -- )
1.79 anton 911: prim to combined
1.71 anton 912: 0 num-combined !
913: current-depth max-stacks cells erase
1.72 anton 914: max-depth max-stacks cells erase
915: min-depth max-stacks cells erase
916: prim prim-effect-in prim prim-effect-in-end !
917: prim prim-effect-out prim prim-effect-out-end ! ;
1.71 anton 918:
919: : max! ( n addr -- )
920: tuck @ max swap ! ;
921:
1.72 anton 922: : min! ( n addr -- )
923: tuck @ min swap ! ;
924:
1.71 anton 925: : add-depths { p -- }
926: \ combine stack effect of p with *-depths
927: max-stacks 0 ?do
1.72 anton 928: current-depth i th @
929: p prim-stacks-in i th @ +
930: dup max-depth i th max!
931: p prim-stacks-out i th @ -
932: dup min-depth i th min!
933: current-depth i th !
1.71 anton 934: loop ;
935:
936: : add-prim ( addr u -- )
937: \ add primitive given by "addr u" to combined-prims
938: primitives search-wordlist s" unknown primitive" ?print-error
939: execute { p }
1.72 anton 940: p combined-prims num-combined @ th !
1.71 anton 941: 1 num-combined +!
942: p add-depths ;
943:
944: : compute-effects { q -- }
945: \ compute the stack effects of q from the depths
946: max-stacks 0 ?do
1.72 anton 947: max-depth i th @ dup
948: q prim-stacks-in i th !
949: current-depth i th @ -
950: q prim-stacks-out i th !
951: loop ;
952:
953: : make-effect-items { stack# items effect-endp -- }
954: \ effect-endp points to a pointer to the end of the current item-array
955: \ and has to be updated
956: stacks stack# th @ { stack }
957: items 0 +do
958: effect-endp @ { item }
959: i 0 <# #s stack stack-pointer 2@ holds [char] _ hold #> save-mem
960: item item-name 2!
961: stack item item-stack !
1.74 anton 962: stack stack-type @ item item-type !
1.72 anton 963: i item item-offset !
964: item item-first on
965: item% %size effect-endp +!
966: loop ;
967:
968: : init-effects { q -- }
969: \ initialize effects field for FETCHES and STORES
970: max-stacks 0 ?do
971: i q prim-stacks-in i th @ q prim-effect-in-end make-effect-items
972: i q prim-stacks-out i th @ q prim-effect-out-end make-effect-items
1.71 anton 973: loop ;
974:
975: : process-combined ( -- )
1.81 anton 976: combined combined-prims num-combined @ cells
1.82 anton 977: combinations ['] constant insert-wordlist
1.86 anton 978: combined-prims num-combined @ 1- th ( last-part )
979: @ prim-c-code 2@ prim prim-c-code 2! \ used by output-super-end
1.72 anton 980: prim compute-effects
981: prim init-effects
982: output-combined perform ;
983:
984: \ C output
985:
986: : print-item { n stack -- }
987: \ print nth stack item name
1.79 anton 988: stack stack-type @ type-c-name 2@ type space
989: ." _" stack stack-pointer 2@ type n 0 .r ;
1.72 anton 990:
991: : print-declarations-combined ( -- )
992: max-stacks 0 ?do
993: max-depth i th @ min-depth i th @ - 0 +do
994: i stacks j th @ print-item ." ;" cr
995: loop
996: loop ;
1.79 anton 997:
998: : part-fetches ( -- )
999: fetches ;
1000:
1001: : part-output-c-tail ( -- )
1.91 anton 1002: print-debug-results
1.85 anton 1003: stores ;
1004:
1005: : output-combined-tail ( -- )
1006: part-output-c-tail
1007: prim >r combined to prim
1008: in-part @ >r in-part off
1009: output-c-tail
1010: r> in-part ! r> to prim ;
1.79 anton 1011:
1012: : output-part ( p -- )
1013: to prim
1014: ." /* " prim prim-name 2@ type ." ( " prim prim-stack-string 2@ type ." ) */" cr
1015: ." NAME(" quote prim prim-name 2@ type quote ." )" cr \ debugging
1016: ." {" cr
1017: print-declarations
1018: part-fetches
1019: print-debug-args
1020: prim add-depths \ !! right place?
1021: ." {" cr
1022: ." #line " c-line @ . quote c-filename 2@ type quote cr
1.85 anton 1023: prim prim-c-code 2@ ['] output-combined-tail type-c-code
1.79 anton 1024: ." }" cr
1025: part-output-c-tail
1026: ." }" cr ;
1027:
1.74 anton 1028: : output-parts ( -- )
1.79 anton 1029: prim >r in-part on
1030: current-depth max-stacks cells erase
1.74 anton 1031: num-combined @ 0 +do
1.79 anton 1032: combined-prims i th @ output-part
1.74 anton 1033: loop
1.79 anton 1034: in-part off
1.74 anton 1035: r> to prim ;
1036:
1.72 anton 1037: : output-c-combined ( -- )
1038: print-entry cr
1.74 anton 1039: \ debugging messages just in parts
1.72 anton 1040: ." {" cr
1041: ." DEF_CA" cr
1042: print-declarations-combined
1043: ." NEXT_P0;" cr
1044: flush-tos
1045: fetches
1.74 anton 1046: \ print-debug-args
1047: stack-pointer-updates
1048: output-parts
1049: output-c-tail
1050: ." }" cr
1051: cr ;
1.72 anton 1052:
1053: : output-forth-combined ( -- )
1.81 anton 1054: ;
1055:
1056:
1.83 anton 1057: \ peephole optimization rules
1.81 anton 1058:
1059: \ in order for this to work as intended, shorter combinations for each
1060: \ length must be present, and the longer combinations must follow
1061: \ shorter ones (this restriction may go away in the future).
1062:
1.83 anton 1063: : output-peephole ( -- )
1.81 anton 1064: combined-prims num-combined @ 1- cells combinations search-wordlist
1065: s" the prefix for this combination must be defined earlier" ?print-error
1.82 anton 1066: ." {"
1067: execute prim-num @ 5 .r ." ,"
1068: combined-prims num-combined @ 1- th @ prim-num @ 5 .r ." ,"
1069: combined prim-num @ 5 .r ." }, /* "
1070: combined prim-c-name 2@ type ." */"
1071: cr ;
1072:
1.90 pazsan 1073: : output-forth-peephole ( -- )
1074: combined-prims num-combined @ 1- cells combinations search-wordlist
1075: s" the prefix for this combination must be defined earlier" ?print-error
1076: execute prim-num @ 5 .r
1077: combined-prims num-combined @ 1- th @ prim-num @ 5 .r
1078: combined prim-num @ 5 .r ." prim, \ "
1079: combined prim-c-name 2@ type
1080: cr ;
1081:
1.69 anton 1082:
1.67 anton 1083: \ the parser
1084:
1085: eof-char max-member \ the whole character set + EOF
1086:
1087: : getinput ( -- n )
1088: rawinput @ endrawinput @ =
1089: if
1090: eof-char
1091: else
1092: cookedinput @ c@
1093: endif ;
1094:
1095: :noname ( n -- )
1096: dup bl > if
1097: emit space
1098: else
1099: .
1100: endif ;
1101: print-token !
1102:
1103: : testchar? ( set -- f )
1104: getinput member? ;
1105: ' testchar? test-vector !
1106:
1107: : checksyncline ( -- )
1108: \ when input points to a newline, check if the next line is a
1109: \ sync line. If it is, perform the appropriate actions.
1110: rawinput @ >r
1111: s" #line " r@ over compare 0<> if
1112: rdrop 1 line +! EXIT
1113: endif
1114: 0. r> 6 chars + 20 >number drop >r drop line ! r> ( c-addr )
1115: dup c@ bl = if
1.81 anton 1116: char+ dup c@ [char] " <> 0= s" sync line syntax" ?print-error
1.67 anton 1117: char+ dup 100 [char] " scan drop swap 2dup - save-mem filename 2!
1118: char+
1119: endif
1.81 anton 1120: dup c@ nl-char <> 0= s" sync line syntax" ?print-error
1.67 anton 1121: skipsynclines @ if
1122: dup char+ rawinput !
1123: rawinput @ c@ cookedinput @ c!
1124: endif
1125: drop ;
1126:
1127: : ?nextchar ( f -- )
1.71 anton 1128: s" syntax error, wrong char" ?print-error
1.67 anton 1129: rawinput @ endrawinput @ <> if
1130: rawinput @ c@
1131: 1 chars rawinput +!
1132: 1 chars cookedinput +!
1133: nl-char = if
1134: checksyncline
1135: rawinput @ line-start !
1136: endif
1137: rawinput @ c@ cookedinput @ c!
1138: endif ;
1139:
1140: : charclass ( set "name" -- )
1141: ['] ?nextchar terminal ;
1142:
1143: : .. ( c1 c2 -- set )
1144: ( creates a set that includes the characters c, c1<=c<=c2 )
1145: empty copy-set
1146: swap 1+ rot do
1147: i over add-member
1148: loop ;
1149:
1150: : ` ( -- terminal ) ( use: ` c )
1151: ( creates anonymous terminal for the character c )
1152: char singleton ['] ?nextchar make-terminal ;
1153:
1154: char a char z .. char A char Z .. union char _ singleton union charclass letter
1155: char 0 char 9 .. charclass digit
1156: bl singleton tab-char over add-member charclass white
1157: nl-char singleton eof-char over add-member complement charclass nonl
1158: nl-char singleton eof-char over add-member
1159: char : over add-member complement charclass nocolonnl
1160: bl 1+ maxchar .. char \ singleton complement intersection
1161: charclass nowhitebq
1162: bl 1+ maxchar .. charclass nowhite
1163: char " singleton eof-char over add-member complement charclass noquote
1164: nl-char singleton charclass nl
1165: eof-char singleton charclass eof
1.79 anton 1166: nl-char singleton eof-char over add-member charclass nleof
1.67 anton 1167:
1168: (( letter (( letter || digit )) **
1169: )) <- c-ident ( -- )
1170:
1171: (( ` # ?? (( letter || digit || ` : )) **
1172: )) <- stack-ident ( -- )
1173:
1174: (( nowhitebq nowhite ** ))
1175: <- forth-ident ( -- )
1176:
1177: Variable forth-flag
1178: Variable c-flag
1179:
1180: (( (( ` e || ` E )) {{ start }} nonl **
1181: {{ end evaluate }}
1182: )) <- eval-comment ( ... -- ... )
1183:
1184: (( (( ` f || ` F )) {{ start }} nonl **
1185: {{ end forth-flag @ IF type cr ELSE 2drop THEN }}
1186: )) <- forth-comment ( -- )
1187:
1188: (( (( ` c || ` C )) {{ start }} nonl **
1189: {{ end c-flag @ IF type cr ELSE 2drop THEN }}
1190: )) <- c-comment ( -- )
1191:
1192: (( ` - nonl ** {{
1193: forth-flag @ IF ." [ELSE]" cr THEN
1194: c-flag @ IF ." #else" cr THEN }}
1195: )) <- else-comment
1196:
1197: (( ` + {{ start }} nonl ** {{ end
1198: dup
1199: IF c-flag @
1200: IF ." #ifdef HAS_" bounds ?DO I c@ toupper emit LOOP cr
1201: THEN
1202: forth-flag @
1203: IF ." has? " type ." [IF]" cr THEN
1204: ELSE 2drop
1205: c-flag @ IF ." #endif" cr THEN
1206: forth-flag @ IF ." [THEN]" cr THEN
1207: THEN }}
1208: )) <- if-comment
1209:
1.98 pazsan 1210: (( (( ` g || ` G )) {{ start }} nonl **
1211: {{ end
1212: forth-flag @ IF ." group " type cr THEN
1213: c-flag @ IF ." GROUP(" type ." )" cr THEN }}
1214: )) <- group-comment
1215:
1216: (( (( eval-comment || forth-comment || c-comment || else-comment || if-comment || group-comment )) ?? nonl ** )) <- comment-body
1.67 anton 1217:
1.79 anton 1218: (( ` \ comment-body nleof )) <- comment ( -- )
1.67 anton 1219:
1220: (( {{ start }} stack-ident {{ end 2 pick init-item item% %size + }} white ** )) **
1221: <- stack-items
1222:
1.69 anton 1223: (( {{ prim prim-effect-in }} stack-items {{ prim prim-effect-in-end ! }}
1.67 anton 1224: ` - ` - white **
1.69 anton 1225: {{ prim prim-effect-out }} stack-items {{ prim prim-effect-out-end ! }}
1.67 anton 1226: )) <- stack-effect ( -- )
1227:
1.71 anton 1228: (( {{ prim create-prim }}
1.69 anton 1229: ` ( white ** {{ start }} stack-effect {{ end prim prim-stack-string 2! }} ` ) white **
1230: (( {{ start }} forth-ident {{ end prim prim-wordset 2! }} white **
1231: (( {{ start }} c-ident {{ end prim prim-c-name 2! }} )) ??
1.79 anton 1232: )) ?? nleof
1233: (( ` " ` " {{ start }} (( noquote ++ ` " )) ++ {{ end 1- prim prim-doc 2! }} ` " white ** nleof )) ??
1234: {{ skipsynclines off line @ c-line ! filename 2@ c-filename 2! start }} (( nocolonnl nonl ** nleof white ** )) ** {{ end prim prim-c-code 2! skipsynclines on }}
1235: (( ` : white ** nleof
1236: {{ start }} (( nonl ++ nleof white ** )) ++ {{ end prim prim-forth-code 2! }}
1.81 anton 1237: )) ?? {{ process-simple }}
1.79 anton 1238: nleof
1.69 anton 1239: )) <- simple-primitive ( -- )
1240:
1.71 anton 1241: (( {{ init-combined }}
1.89 anton 1242: ` = white ** (( {{ start }} forth-ident {{ end add-prim }} white ** )) ++
1.79 anton 1243: nleof {{ process-combined }}
1.69 anton 1244: )) <- combined-primitive
1245:
1.79 anton 1246: (( {{ make-prim to prim 0 to combined
1.69 anton 1247: line @ name-line ! filename 2@ name-filename 2!
1.82 anton 1248: function-number @ prim prim-num !
1.69 anton 1249: start }} forth-ident {{ end 2dup prim prim-name 2! prim prim-c-name 2! }} white ++
1.104 anton 1250: (( ` / white ** {{ start }} c-ident {{ end prim prim-c-name 2! }} white ** )) ??
1.82 anton 1251: (( simple-primitive || combined-primitive )) {{ 1 function-number +! }}
1.67 anton 1252: )) <- primitive ( -- )
1253:
1254: (( (( comment || primitive || nl white ** )) ** eof ))
1255: parser primitives2something
1256: warnings @ [IF]
1257: .( parser generated ok ) cr
1258: [THEN]
1259:
1.95 jwilke 1260:
1.97 jwilke 1261: \ run with gforth-0.5.0 (slurp-file is missing)
1.95 jwilke 1262: [IFUNDEF] slurp-file
1263: : slurp-file ( c-addr1 u1 -- c-addr2 u2 )
1264: \ c-addr1 u1 is the filename, c-addr2 u2 is the file's contents
1265: r/o bin open-file throw >r
1266: r@ file-size throw abort" file too large"
1267: dup allocate throw swap
1268: 2dup r@ read-file throw over <> abort" could not read whole file"
1269: r> close-file throw ;
1270: [THEN]
1271:
1.69 anton 1272: : primfilter ( addr u -- )
1273: \ process the string at addr u
1274: over dup rawinput ! dup line-start ! cookedinput !
1275: + endrawinput !
1276: checksyncline
1277: primitives2something ;
1.8 pazsan 1278:
1.72 anton 1279: : process-file ( addr u xt-simple x-combined -- )
1280: output-combined ! output !
1.61 anton 1281: save-mem 2dup filename 2!
1.69 anton 1282: slurp-file
1.17 anton 1283: warnings @ if
1284: ." ------------ CUT HERE -------------" cr endif
1.69 anton 1285: primfilter ;
1.30 pazsan 1286:
1.72 anton 1287: \ : process ( xt -- )
1288: \ bl word count rot
1289: \ process-file ;
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>