File:
[gforth] /
gforth /
prims2x.fs
Revision
1.110:
download - view:
text,
annotated -
select for diffs
Tue Aug 20 07:59:01 2002 UTC (21 years, 8 months ago) by
anton
Branches:
MAIN
CVS tags:
HEAD
prims2x.fs changes: now supports C code delimited by braces;
Forth or C names for primitives depending on [ifdef] vmgen
Documentation changes
adapted vmgen-ex* to earlier prims2x.fs changes
1: \ converts primitives to, e.g., C code
2:
3: \ Copyright (C) 1995,1996,1997,1998,2000 Free Software Foundation, Inc.
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
19: \ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
20:
21:
22: \ This is not very nice (hard limits, no checking, assumes 1 chars = 1).
23: \ And it grew even worse when it aged.
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:
40: \ add the store optimization for doubles
41: \ regarding problem 1 above: It would be better (for over) to implement
42: \ the alternative
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.
53:
54: warnings off
55:
56: [IFUNDEF] try
57: include startup.fs
58: [THEN]
59:
60: : struct% struct ; \ struct is redefined in gray
61:
62: warnings off
63: \ warnings on
64:
65: include ./gray.fs
66: 32 constant max-effect \ number of things on one side of a stack effect
67: 4 constant max-stacks \ the max. number of stacks (including inst-stream).
68: 255 constant maxchar
69: maxchar 1+ constant eof-char
70: #tab constant tab-char
71: #lf constant nl-char
72:
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
76: variable line \ line number of char pointed to by input
77: variable line-start \ pointer to start of current line (for error messages)
78: 0 line !
79: 2variable filename \ filename of original input file
80: 0 0 filename 2!
81: 2variable f-comment
82: 0 0 f-comment 2!
83: variable skipsynclines \ are sync lines ("#line ...") invisible to the parser?
84: skipsynclines on
85:
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 ;
95:
96: : insert-wordlist { c-addr u wordlist xt -- }
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:
103: : start ( -- addr )
104: cookedinput @ ;
105:
106: : end ( addr -- addr u )
107: cookedinput @ over - ;
108:
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:
127: : quote ( -- )
128: [char] " emit ;
129:
130: variable output \ xt ( -- ) of output word for simple primitives
131: variable output-combined \ xt ( -- ) of output word for combined primitives
132:
133: struct%
134: cell% field stack-number \ the number of this stack
135: cell% 2* field stack-pointer \ stackpointer name
136: cell% field stack-type \ name for default type of stack items
137: cell% field stack-in-index-xt \ ( in-size item -- in-index )
138: end-struct stack%
139:
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
145: cell% field item-first \ true if this is the first occurence of the item
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:
156: variable next-stack-number 0 next-stack-number !
157: create stacks max-stacks cells allot \ array of stacks
158:
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:
165: : make-stack ( addr-ptr u1 type "stack-name" -- )
166: next-stack-number @ max-stacks < s" too many stacks" ?print-error
167: create stack% %allot >r
168: r@ stacks next-stack-number @ th !
169: next-stack-number @ r@ stack-number !
170: 1 next-stack-number +!
171: r@ stack-type !
172: save-mem r@ stack-pointer 2!
173: ['] stack-in-index r> stack-in-index-xt ! ;
174:
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:
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:
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:
195: \ types
196:
197: : print-type-prefix ( type -- )
198: body> >head name>string type ;
199:
200: \ various variables for storing stuff of one primitive
201:
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
210: cell% field prim-num \ ordinal number
211: cell% field prim-items-wordlist \ unique items
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
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
218: end-struct prim%
219:
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:
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:
234: table constant combinations
235: \ the keys are the sequences of pointers to primitives
236:
237: create current-depth max-stacks cells allot
238: create max-depth max-stacks cells allot
239: create min-depth max-stacks cells allot
240:
241: wordlist constant primitives
242:
243: : create-prim ( prim -- )
244: dup prim-name 2@ primitives ['] constant insert-wordlist ;
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:
254: \ global vars
255: variable c-line
256: 2variable c-filename
257: variable name-line
258: 2variable name-filename
259: 2variable last-name-filename
260: Variable function-number 0 function-number !
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:
270: \ stack access stuff
271:
272: : normal-stack-access ( n stack -- )
273: stack-pointer 2@ type
274: dup
275: if
276: ." [" 0 .r ." ]"
277: else
278: drop ." TOS"
279: endif ;
280:
281: \ forward declaration for inst-stream (breaks cycle in definitions)
282: defer inst-stream-f ( -- stack )
283:
284: : part-stack-access { n stack -- }
285: \ print _<stack><x>, x=inst-stream? n : maxdepth-currentdepth-n-1
286: ." _" stack stack-pointer 2@ type
287: stack stack-number @ { stack# }
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
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:
306: : item-in-index { item -- n }
307: \ n is the index of item (in the in-effect)
308: item item-stack @ dup >r stack-in @ ( in-size r:stack )
309: item r> stack-in-index-xt @ execute ;
310:
311: : item-stack-type-name ( item -- addr u )
312: item-stack @ stack-type @ type-c-name 2@ ;
313:
314: : fetch-single ( item -- )
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 ;
323:
324: : fetch-double ( item -- )
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 ;
335:
336: : same-as-in? ( item -- f )
337: \ f is true iff the offset and stack of item is the same as on input
338: >r
339: r@ item-first @ if
340: rdrop false exit
341: endif
342: r@ item-name 2@ prim prim-items-wordlist @ search-wordlist 0= abort" bug"
343: execute @
344: dup r@ =
345: if \ item first appeared in output
346: drop false
347: else
348: dup item-stack @ r@ item-stack @ =
349: swap item-offset @ r@ item-offset @ = and
350: endif
351: rdrop ;
352:
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- ;
356:
357: : really-store-single ( item -- )
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 ;
365:
366: : store-single ( item -- )
367: >r
368: r@ same-as-in?
369: if
370: r@ item-in-index 0= r@ item-out-index 0= xor
371: if
372: ." IF_" r@ item-stack @ stack-pointer 2@ type
373: ." TOS(" r@ really-store-single ." );" cr
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
383: ." vm_"
384: r@ item-type @ print-type-prefix ." 2two"
385: r@ item-stack-type-name type ." ("
386: r@ item-name 2@ type ." , "
387: r@ item-out-index r@ item-stack @ 2dup stack-access
388: ." , " -1 under+ stack-access
389: ." )" cr
390: rdrop ;
391:
392: : single ( -- xt1 xt2 n )
393: ['] fetch-single ['] store-single 1 ;
394:
395: : double ( -- xt1 xt2 n )
396: ['] fetch-double ['] store-double 2 ;
397:
398: : s, ( addr u -- )
399: \ allocate a string
400: here swap dup allot move ;
401:
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" -- )
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 ;
426:
427: : type-prefix ( addr u xt1 xt2 n stack "prefix" -- )
428: get-current >r prefixes set-current
429: create-type r> set-current
430: does> ( item -- )
431: \ initialize item
432: { item typ }
433: typ item item-type !
434: typ type-stack @ item item-stack !default
435: item item-name 2@ prim prim-items-wordlist @ search-wordlist 0= if
436: item item-name 2@ nextname item declare
437: item item-first on
438: \ typ type-c-name 2@ type space type ." ;" cr
439: else
440: drop
441: item item-first off
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
455: false s" unknown prefix" ?print-error ;
456:
457: : declaration ( item -- )
458: dup item-name 2@ execute-prefix ;
459:
460: : declaration-list ( addr1 addr2 -- )
461: ['] declaration map-items ;
462:
463: : declarations ( -- )
464: wordlist dup prim prim-items-wordlist ! set-current
465: prim prim-effect-in prim prim-effect-in-end @ declaration-list
466: prim prim-effect-out prim prim-effect-out-end @ declaration-list ;
467:
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 ( -- )
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 ;
477:
478: : stack-prefix ( stack "prefix" -- )
479: get-current >r prefixes set-current
480: name tuck nextname create ( stack length ) 2,
481: r> set-current
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 ;
487:
488: \ types pointed to by stacks for use in combined prims
489: \ !! output-c-combined shouldn't use these names!
490: : stack-type-name ( addr u "name" -- )
491: single 0 create-type ;
492:
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
495:
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
507: ' inst-in-index inst-stream stack-in-index-xt !
508: ' inst-stream <is> inst-stream-f
509: \ !! initialize stack-in and stack-out
510:
511: \ offset computation
512: \ the leftmost (i.e. deepest) item has offset 0
513: \ the rightmost item has the highest offset
514:
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:
521: : compute-offset-in ( addr1 addr2 -- )
522: ['] stack-in compute-offset ;
523:
524: : compute-offset-out ( addr1 addr2 -- )
525: ['] stack-out compute-offset ;
526:
527: : clear-stack { -- }
528: dup stack-in off stack-out off ;
529:
530: : compute-offsets ( -- )
531: ['] clear-stack map-stacks
532: inst-stream clear-stack
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
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
539: combinations ['] constant insert-wordlist
540: declarations compute-offsets
541: output @ execute ;
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 ;
549:
550: : flush-tos ( -- )
551: ['] flush-a-tos map-stacks ;
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 ;
559:
560: : fill-tos ( -- )
561: \ !! inst-stream for prefetching?
562: ['] fill-a-tos map-stacks ;
563:
564: : fetch ( addr -- )
565: dup item-type @ type-fetch @ execute ;
566:
567: : fetches ( -- )
568: prim prim-effect-in prim prim-effect-in-end @ ['] fetch map-items ;
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 ;
576:
577: : inst-pointer-update ( -- )
578: inst-stream stack-in @ ?dup-if
579: ." INC_IP(" 0 .r ." );" cr
580: endif ;
581:
582: : stack-pointer-updates ( -- )
583: inst-pointer-update
584: ['] stack-pointer-update map-stacks ;
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
589: dup item-type @ type-store @ execute ;
590:
591: : stores ( -- )
592: prim prim-effect-out prim prim-effect-out-end @ ['] store map-items ;
593:
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:
622: : output-super-end ( -- )
623: prim prim-c-code 2@ s" SET_IP" search if
624: ." SUPER_END;" cr
625: endif
626: 2drop ;
627:
628: : output-c-tail1 ( -- )
629: \ the final part of the generated C code except LABEL2 and NEXT_P2
630: output-super-end
631: print-debug-results
632: ." NEXT_P1;" cr
633: stores
634: fill-tos ;
635:
636: : output-c-tail ( -- )
637: \ the final part of the generated C code, without LABEL2
638: output-c-tail1
639: ." NEXT_P2;" ;
640:
641: : output-c-tail2 ( -- )
642: \ the final part of the generated C code, including LABEL2
643: output-c-tail1
644: ." LABEL2(" prim prim-c-name 2@ type ." )" cr
645: ." NEXT_P2;" cr ;
646:
647: : type-c-code ( c-addr u xt -- )
648: \ like TYPE, but replaces "INST_TAIL;" with tail code produced by xt
649: { xt }
650: begin ( c-addr1 u1 )
651: 2dup s" INST_TAIL;" search
652: while ( c-addr1 u1 c-addr3 u3 )
653: 2dup 2>r drop nip over - type
654: xt execute
655: 2r> 10 /string
656: \ !! resync #line missing
657: repeat
658: 2drop type ;
659:
660: : print-entry ( -- )
661: ." LABEL(" prim prim-c-name 2@ type ." )" ;
662:
663: : output-c ( -- )
664: print-entry ." /* " prim prim-name 2@ type ." ( " prim prim-stack-string 2@ type ." ) */" cr
665: ." /* " prim prim-doc 2@ type ." */" cr
666: ." NAME(" quote prim prim-name 2@ type quote ." )" cr \ debugging
667: ." {" cr
668: ." DEF_CA" cr
669: print-declarations
670: ." NEXT_P0;" cr
671: flush-tos
672: fetches
673: print-debug-args
674: stack-pointer-updates
675: ." {" cr
676: ." #line " c-line @ . quote c-filename 2@ type quote cr
677: prim prim-c-code 2@ ['] output-c-tail type-c-code
678: ." }" cr
679: output-c-tail2
680: ." }" cr
681: cr
682: ;
683:
684: : disasm-arg { item -- }
685: item item-stack @ inst-stream = if
686: ." {" cr
687: item print-declaration
688: item fetch
689: item print-debug-arg
690: ." }" cr
691: endif ;
692:
693: : disasm-args ( -- )
694: prim prim-effect-in prim prim-effect-in-end @ ['] disasm-arg map-items ;
695:
696: : output-disasm ( -- )
697: \ generate code for disassembling VM instructions
698: ." if (VM_IS_INST(*ip, " function-number @ 0 .r ." )) {" cr
699: ." fputs(" quote prim prim-name 2@ type quote ." , vm_out);" cr
700: disasm-args
701: ." ip += " inst-stream stack-in @ 1+ 0 .r ." ;" cr
702: ." goto _endif_;" cr
703: ." }" cr ;
704:
705: : output-profile ( -- )
706: \ generate code for postprocessing the VM block profile stuff
707: ." if (VM_IS_INST(*ip, " function-number @ 0 .r ." )) {" cr
708: ." add_inst(b, " quote prim prim-name 2@ type quote ." );" cr
709: ." ip += " inst-stream stack-in @ 1+ 0 .r ." ;" cr
710: prim prim-c-code 2@ s" SET_IP" search nip nip
711: prim prim-c-code 2@ s" SUPER_END" search nip nip or if
712: ." return;" cr
713: else
714: ." goto _endif_;" cr
715: endif
716: ." }" cr ;
717:
718: : output-profile-combined ( -- )
719: \ generate code for postprocessing the VM block profile stuff
720: ." if (VM_IS_INST(*ip, " function-number @ 0 .r ." )) {" cr
721: num-combined @ 0 +do
722: ." add_inst(b, " quote
723: combined-prims i th @ prim-name 2@ type
724: quote ." );" cr
725: loop
726: ." ip += " inst-stream stack-in @ 1+ 0 .r ." ;" cr
727: combined-prims num-combined @ 1- th @ prim-c-code 2@ s" SET_IP" search nip nip
728: combined-prims num-combined @ 1- th @ prim-c-code 2@ s" SUPER_END" search nip nip or if
729: ." return;" cr
730: else
731: ." goto _endif_;" cr
732: endif
733: ." }" cr ;
734:
735: : output-superend ( -- )
736: \ output flag specifying whether the current word ends a dynamic superinst
737: prim prim-c-code 2@ s" SET_IP" search nip nip
738: prim prim-c-code 2@ s" SUPER_END" search nip nip or 0<>
739: prim prim-c-code 2@ s" SUPER_CONTINUE" search nip nip 0= and
740: negate 0 .r ." , /* " prim prim-name 2@ type ." */" cr ;
741:
742: : gen-arg-parm { item -- }
743: item item-stack @ inst-stream = if
744: ." , " item item-type @ type-c-name 2@ type space
745: item item-name 2@ type
746: endif ;
747:
748: : gen-args-parm ( -- )
749: prim prim-effect-in prim prim-effect-in-end @ ['] gen-arg-parm map-items ;
750:
751: : gen-arg-gen { item -- }
752: item item-stack @ inst-stream = if
753: ." genarg_" item item-type @ print-type-prefix
754: ." (ctp, " item item-name 2@ type ." );" cr
755: endif ;
756:
757: : gen-args-gen ( -- )
758: prim prim-effect-in prim prim-effect-in-end @ ['] gen-arg-gen map-items ;
759:
760: : output-gen ( -- )
761: \ generate C code for generating VM instructions
762: ." void gen_" prim prim-c-name 2@ type ." (Inst **ctp" gen-args-parm ." )" cr
763: ." {" cr
764: ." gen_inst(ctp, vm_prim[" function-number @ 0 .r ." ]);" cr
765: gen-args-gen
766: ." }" cr ;
767:
768: : stack-used? { stack -- f }
769: stack stack-in @ stack stack-out @ or 0<> ;
770:
771: : output-funclabel ( -- )
772: ." &I_" prim prim-c-name 2@ type ." ," cr ;
773:
774: : output-forthname ( -- )
775: '" emit prim prim-name 2@ type '" emit ." ," cr ;
776:
777: \ : output-c-func ( -- )
778: \ \ used for word libraries
779: \ ." Cell * I_" prim prim-c-name 2@ type ." (Cell *SP, Cell **FP) /* " prim prim-name 2@ type
780: \ ." ( " prim prim-stack-string 2@ type ." ) */" cr
781: \ ." /* " prim prim-doc 2@ type ." */" cr
782: \ ." NAME(" quote prim prim-name 2@ type quote ." )" cr
783: \ \ debugging
784: \ ." {" cr
785: \ print-declarations
786: \ \ !! don't know what to do about that
787: \ inst-stream stack-used? IF ." Cell *ip=IP;" cr THEN
788: \ data-stack stack-used? IF ." Cell *sp=SP;" cr THEN
789: \ fp-stack stack-used? IF ." Cell *fp=*FP;" cr THEN
790: \ return-stack stack-used? IF ." Cell *rp=*RP;" cr THEN
791: \ flush-tos
792: \ fetches
793: \ stack-pointer-updates
794: \ fp-stack stack-used? IF ." *FP=fp;" cr THEN
795: \ ." {" cr
796: \ ." #line " c-line @ . quote c-filename 2@ type quote cr
797: \ prim prim-c-code 2@ type
798: \ ." }" cr
799: \ stores
800: \ fill-tos
801: \ ." return (sp);" cr
802: \ ." }" cr
803: \ cr ;
804:
805: : output-label ( -- )
806: ." INST_ADDR(" prim prim-c-name 2@ type ." )," cr ;
807:
808: : output-alias ( -- )
809: ( primitive-number @ . ." alias " ) ." Primitive " prim prim-name 2@ type cr ;
810:
811: : output-forth ( -- )
812: prim prim-forth-code @ 0=
813: IF \ output-alias
814: \ this is bad for ec: an alias is compiled if tho word does not exist!
815: \ JAW
816: ELSE ." : " prim prim-name 2@ type ." ( "
817: prim prim-stack-string 2@ type ." )" cr
818: prim prim-forth-code 2@ type cr
819: THEN ;
820:
821: : output-tag-file ( -- )
822: name-filename 2@ last-name-filename 2@ compare if
823: name-filename 2@ last-name-filename 2!
824: #ff emit cr
825: name-filename 2@ type
826: ." ,0" cr
827: endif ;
828:
829: : output-tag ( -- )
830: output-tag-file
831: prim prim-name 2@ 1+ type
832: 127 emit
833: space prim prim-name 2@ type space
834: 1 emit
835: name-line @ 0 .r
836: ." ,0" cr ;
837:
838: : output-vi-tag ( -- )
839: name-filename 2@ type #tab emit
840: prim prim-name 2@ type #tab emit
841: ." /^" prim prim-name 2@ type ." *(/" cr ;
842:
843: [IFDEF] documentation
844: : register-doc ( -- )
845: prim prim-name 2@ documentation ['] create insert-wordlist
846: prim prim-name 2@ 2,
847: prim prim-stack-string 2@ condition-stack-effect 2,
848: prim prim-wordset 2@ 2,
849: prim prim-c-name 2@ condition-pronounciation 2,
850: prim prim-doc 2@ 2, ;
851: [THEN]
852:
853:
854: \ combining instructions
855:
856: \ The input should look like this:
857:
858: \ lit_+ = lit +
859:
860: \ The output should look like this:
861:
862: \ I_lit_+:
863: \ {
864: \ DEF_CA
865: \ Cell _x_ip0;
866: \ Cell _x_sp0;
867: \ Cell _x_sp1;
868: \ NEXT_P0;
869: \ _x_ip0 = (Cell) IPTOS;
870: \ _x_sp0 = (Cell) spTOS;
871: \ INC_IP(1);
872: \ /* sp += 0; */
873: \ /* lit ( #w -- w ) */
874: \ /* */
875: \ NAME("lit")
876: \ {
877: \ Cell w;
878: \ w = (Cell) _x_ip0;
879: \ #ifdef VM_DEBUG
880: \ if (vm_debug) {
881: \ fputs(" w=", vm_out); printarg_w (w);
882: \ fputc('\n', vm_out);
883: \ }
884: \ #endif
885: \ {
886: \ #line 136 "./prim"
887: \ }
888: \ _x_sp1 = (Cell)w;
889: \ }
890: \ I_plus: /* + ( n1 n2 -- n ) */
891: \ /* */
892: \ NAME("+")
893: \ {
894: \ DEF_CA
895: \ Cell n1;
896: \ Cell n2;
897: \ Cell n;
898: \ NEXT_P0;
899: \ n1 = (Cell) _x_sp0;
900: \ n2 = (Cell) _x_sp1;
901: \ #ifdef VM_DEBUG
902: \ if (vm_debug) {
903: \ fputs(" n1=", vm_out); printarg_n (n1);
904: \ fputs(" n2=", vm_out); printarg_n (n2);
905: \ fputc('\n', vm_out);
906: \ }
907: \ #endif
908: \ {
909: \ #line 516 "./prim"
910: \ n = n1+n2;
911: \ }
912: \ _x_sp0 = (Cell)n;
913: \ }
914: \ NEXT_P1;
915: \ spTOS = (Cell)_x_sp0;
916: \ NEXT_P2;
917:
918: : init-combined ( -- )
919: prim to combined
920: 0 num-combined !
921: current-depth max-stacks cells erase
922: max-depth max-stacks cells erase
923: min-depth max-stacks cells erase
924: prim prim-effect-in prim prim-effect-in-end !
925: prim prim-effect-out prim prim-effect-out-end ! ;
926:
927: : max! ( n addr -- )
928: tuck @ max swap ! ;
929:
930: : min! ( n addr -- )
931: tuck @ min swap ! ;
932:
933: : add-depths { p -- }
934: \ combine stack effect of p with *-depths
935: max-stacks 0 ?do
936: current-depth i th @
937: p prim-stacks-in i th @ +
938: dup max-depth i th max!
939: p prim-stacks-out i th @ -
940: dup min-depth i th min!
941: current-depth i th !
942: loop ;
943:
944: : add-prim ( addr u -- )
945: \ add primitive given by "addr u" to combined-prims
946: primitives search-wordlist s" unknown primitive" ?print-error
947: execute { p }
948: p combined-prims num-combined @ th !
949: 1 num-combined +!
950: p add-depths ;
951:
952: : compute-effects { q -- }
953: \ compute the stack effects of q from the depths
954: max-stacks 0 ?do
955: max-depth i th @ dup
956: q prim-stacks-in i th !
957: current-depth i th @ -
958: q prim-stacks-out i th !
959: loop ;
960:
961: : make-effect-items { stack# items effect-endp -- }
962: \ effect-endp points to a pointer to the end of the current item-array
963: \ and has to be updated
964: stacks stack# th @ { stack }
965: items 0 +do
966: effect-endp @ { item }
967: i 0 <# #s stack stack-pointer 2@ holds [char] _ hold #> save-mem
968: item item-name 2!
969: stack item item-stack !
970: stack stack-type @ item item-type !
971: i item item-offset !
972: item item-first on
973: item% %size effect-endp +!
974: loop ;
975:
976: : init-effects { q -- }
977: \ initialize effects field for FETCHES and STORES
978: max-stacks 0 ?do
979: i q prim-stacks-in i th @ q prim-effect-in-end make-effect-items
980: i q prim-stacks-out i th @ q prim-effect-out-end make-effect-items
981: loop ;
982:
983: : process-combined ( -- )
984: combined combined-prims num-combined @ cells
985: combinations ['] constant insert-wordlist
986: combined-prims num-combined @ 1- th ( last-part )
987: @ prim-c-code 2@ prim prim-c-code 2! \ used by output-super-end
988: prim compute-effects
989: prim init-effects
990: output-combined perform ;
991:
992: \ C output
993:
994: : print-item { n stack -- }
995: \ print nth stack item name
996: stack stack-type @ type-c-name 2@ type space
997: ." _" stack stack-pointer 2@ type n 0 .r ;
998:
999: : print-declarations-combined ( -- )
1000: max-stacks 0 ?do
1001: max-depth i th @ min-depth i th @ - 0 +do
1002: i stacks j th @ print-item ." ;" cr
1003: loop
1004: loop ;
1005:
1006: : part-fetches ( -- )
1007: fetches ;
1008:
1009: : part-output-c-tail ( -- )
1010: print-debug-results
1011: stores ;
1012:
1013: : output-combined-tail ( -- )
1014: part-output-c-tail
1015: prim >r combined to prim
1016: in-part @ >r in-part off
1017: output-c-tail
1018: r> in-part ! r> to prim ;
1019:
1020: : output-part ( p -- )
1021: to prim
1022: ." /* " prim prim-name 2@ type ." ( " prim prim-stack-string 2@ type ." ) */" cr
1023: ." NAME(" quote prim prim-name 2@ type quote ." )" cr \ debugging
1024: ." {" cr
1025: print-declarations
1026: part-fetches
1027: print-debug-args
1028: prim add-depths \ !! right place?
1029: ." {" cr
1030: ." #line " c-line @ . quote c-filename 2@ type quote cr
1031: prim prim-c-code 2@ ['] output-combined-tail type-c-code
1032: ." }" cr
1033: part-output-c-tail
1034: ." }" cr ;
1035:
1036: : output-parts ( -- )
1037: prim >r in-part on
1038: current-depth max-stacks cells erase
1039: num-combined @ 0 +do
1040: combined-prims i th @ output-part
1041: loop
1042: in-part off
1043: r> to prim ;
1044:
1045: : output-c-combined ( -- )
1046: print-entry cr
1047: \ debugging messages just in parts
1048: ." {" cr
1049: ." DEF_CA" cr
1050: print-declarations-combined
1051: ." NEXT_P0;" cr
1052: flush-tos
1053: fetches
1054: \ print-debug-args
1055: stack-pointer-updates
1056: output-parts
1057: output-c-tail2
1058: ." }" cr
1059: cr ;
1060:
1061: : output-forth-combined ( -- )
1062: ;
1063:
1064:
1065: \ peephole optimization rules
1066:
1067: \ in order for this to work as intended, shorter combinations for each
1068: \ length must be present, and the longer combinations must follow
1069: \ shorter ones (this restriction may go away in the future).
1070:
1071: : output-peephole ( -- )
1072: combined-prims num-combined @ 1- cells combinations search-wordlist
1073: s" the prefix for this combination must be defined earlier" ?print-error
1074: ." {"
1075: execute prim-num @ 5 .r ." ,"
1076: combined-prims num-combined @ 1- th @ prim-num @ 5 .r ." ,"
1077: combined prim-num @ 5 .r ." }, /* "
1078: combined prim-c-name 2@ type ." */"
1079: cr ;
1080:
1081: : output-forth-peephole ( -- )
1082: combined-prims num-combined @ 1- cells combinations search-wordlist
1083: s" the prefix for this combination must be defined earlier" ?print-error
1084: execute prim-num @ 5 .r
1085: combined-prims num-combined @ 1- th @ prim-num @ 5 .r
1086: combined prim-num @ 5 .r ." prim, \ "
1087: combined prim-c-name 2@ type
1088: cr ;
1089:
1090:
1091: \ the parser
1092:
1093: eof-char max-member \ the whole character set + EOF
1094:
1095: : getinput ( -- n )
1096: rawinput @ endrawinput @ =
1097: if
1098: eof-char
1099: else
1100: cookedinput @ c@
1101: endif ;
1102:
1103: :noname ( n -- )
1104: dup bl > if
1105: emit space
1106: else
1107: .
1108: endif ;
1109: print-token !
1110:
1111: : testchar? ( set -- f )
1112: getinput member? ;
1113: ' testchar? test-vector !
1114:
1115: : checksyncline ( -- )
1116: \ when input points to a newline, check if the next line is a
1117: \ sync line. If it is, perform the appropriate actions.
1118: rawinput @ >r
1119: s" #line " r@ over compare 0<> if
1120: rdrop 1 line +! EXIT
1121: endif
1122: 0. r> 6 chars + 20 >number drop >r drop line ! r> ( c-addr )
1123: dup c@ bl = if
1124: char+ dup c@ [char] " <> 0= s" sync line syntax" ?print-error
1125: char+ dup 100 [char] " scan drop swap 2dup - save-mem filename 2!
1126: char+
1127: endif
1128: dup c@ nl-char <> 0= s" sync line syntax" ?print-error
1129: skipsynclines @ if
1130: dup char+ rawinput !
1131: rawinput @ c@ cookedinput @ c!
1132: endif
1133: drop ;
1134:
1135: : ?nextchar ( f -- )
1136: s" syntax error, wrong char" ?print-error
1137: rawinput @ endrawinput @ <> if
1138: rawinput @ c@
1139: 1 chars rawinput +!
1140: 1 chars cookedinput +!
1141: nl-char = if
1142: checksyncline
1143: rawinput @ line-start !
1144: endif
1145: rawinput @ c@ cookedinput @ c!
1146: endif ;
1147:
1148: : charclass ( set "name" -- )
1149: ['] ?nextchar terminal ;
1150:
1151: : .. ( c1 c2 -- set )
1152: ( creates a set that includes the characters c, c1<=c<=c2 )
1153: empty copy-set
1154: swap 1+ rot do
1155: i over add-member
1156: loop ;
1157:
1158: : ` ( -- terminal ) ( use: ` c )
1159: ( creates anonymous terminal for the character c )
1160: char singleton ['] ?nextchar make-terminal ;
1161:
1162: char a char z .. char A char Z .. union char _ singleton union charclass letter
1163: char 0 char 9 .. charclass digit
1164: bl singleton tab-char over add-member charclass white
1165: nl-char singleton eof-char over add-member complement charclass nonl
1166: nl-char singleton eof-char over add-member
1167: char : over add-member complement charclass nocolonnl
1168: nl-char singleton eof-char over add-member
1169: char } over add-member complement charclass nobracenl
1170: bl 1+ maxchar .. char \ singleton complement intersection
1171: charclass nowhitebq
1172: bl 1+ maxchar .. charclass nowhite
1173: char " singleton eof-char over add-member complement charclass noquote
1174: nl-char singleton charclass nl
1175: eof-char singleton charclass eof
1176: nl-char singleton eof-char over add-member charclass nleof
1177:
1178: (( letter (( letter || digit )) **
1179: )) <- c-ident ( -- )
1180:
1181: (( ` # ?? (( letter || digit || ` : )) ++
1182: )) <- stack-ident ( -- )
1183:
1184: (( nowhitebq nowhite ** ))
1185: <- forth-ident ( -- )
1186:
1187: Variable forth-flag
1188: Variable c-flag
1189:
1190: (( (( ` e || ` E )) {{ start }} nonl **
1191: {{ end evaluate }}
1192: )) <- eval-comment ( ... -- ... )
1193:
1194: (( (( ` f || ` F )) {{ start }} nonl **
1195: {{ end forth-flag @ IF type cr ELSE 2drop THEN }}
1196: )) <- forth-comment ( -- )
1197:
1198: (( (( ` c || ` C )) {{ start }} nonl **
1199: {{ end c-flag @ IF type cr ELSE 2drop THEN }}
1200: )) <- c-comment ( -- )
1201:
1202: (( ` - nonl ** {{
1203: forth-flag @ IF ." [ELSE]" cr THEN
1204: c-flag @ IF ." #else" cr THEN }}
1205: )) <- else-comment
1206:
1207: (( ` + {{ start }} nonl ** {{ end
1208: dup
1209: IF c-flag @
1210: IF ." #ifdef HAS_" bounds ?DO I c@ toupper emit LOOP cr
1211: THEN
1212: forth-flag @
1213: IF ." has? " type ." [IF]" cr THEN
1214: ELSE 2drop
1215: c-flag @ IF ." #endif" cr THEN
1216: forth-flag @ IF ." [THEN]" cr THEN
1217: THEN }}
1218: )) <- if-comment
1219:
1220: (( (( ` g || ` G )) {{ start }} nonl **
1221: {{ end
1222: forth-flag @ IF ." group " type cr THEN
1223: c-flag @ IF ." GROUP(" type ." )" cr THEN }}
1224: )) <- group-comment
1225:
1226: (( (( eval-comment || forth-comment || c-comment || else-comment || if-comment || group-comment )) ?? nonl ** )) <- comment-body
1227:
1228: (( ` \ comment-body nleof )) <- comment ( -- )
1229:
1230: (( {{ start }} stack-ident {{ end 2 pick init-item item% %size + }} white ** )) **
1231: <- stack-items
1232:
1233: (( {{ prim prim-effect-in }} stack-items {{ prim prim-effect-in-end ! }}
1234: ` - ` - white **
1235: {{ prim prim-effect-out }} stack-items {{ prim prim-effect-out-end ! }}
1236: )) <- stack-effect ( -- )
1237:
1238: (( {{ prim create-prim }}
1239: ` ( white ** {{ start }} stack-effect {{ end prim prim-stack-string 2! }} ` ) white **
1240: (( {{ start }} forth-ident {{ end prim prim-wordset 2! }} white **
1241: (( {{ start }} c-ident {{ end prim prim-c-name 2! }} )) ??
1242: )) ?? nleof
1243: (( ` " ` " {{ start }} (( noquote ++ ` " )) ++ {{ end 1- prim prim-doc 2! }} ` " white ** nleof )) ??
1244: {{ skipsynclines off line @ c-line ! filename 2@ c-filename 2! start }}
1245: (( (( ` { nonl ** nleof (( (( nobracenl {{ line @ drop }} nonl ** )) ?? nleof )) ** ` } white ** nleof white ** ))
1246: || (( nocolonnl nonl ** nleof white ** )) ** ))
1247: {{ end prim prim-c-code 2! skipsynclines on }}
1248: (( ` : white ** nleof
1249: {{ start }} (( nonl ++ nleof white ** )) ++ {{ end prim prim-forth-code 2! }}
1250: )) ?? {{ process-simple }}
1251: nleof
1252: )) <- simple-primitive ( -- )
1253:
1254: (( {{ init-combined }}
1255: ` = white ** (( {{ start }} forth-ident {{ end add-prim }} white ** )) ++
1256: nleof {{ process-combined }}
1257: )) <- combined-primitive
1258:
1259: (( {{ make-prim to prim 0 to combined
1260: line @ name-line ! filename 2@ name-filename 2!
1261: function-number @ prim prim-num !
1262: start }} [ifdef] vmgen c-ident [else] forth-ident [then] {{ end
1263: 2dup prim prim-name 2! prim prim-c-name 2! }} white **
1264: (( ` / white ** {{ start }} c-ident {{ end prim prim-c-name 2! }} white ** )) ??
1265: (( simple-primitive || combined-primitive )) {{ 1 function-number +! }}
1266: )) <- primitive ( -- )
1267:
1268: (( (( comment || primitive || nl white ** )) ** eof ))
1269: parser primitives2something
1270: warnings @ [IF]
1271: .( parser generated ok ) cr
1272: [THEN]
1273:
1274:
1275: \ run with gforth-0.5.0 (slurp-file is missing)
1276: [IFUNDEF] slurp-file
1277: : slurp-file ( c-addr1 u1 -- c-addr2 u2 )
1278: \ c-addr1 u1 is the filename, c-addr2 u2 is the file's contents
1279: r/o bin open-file throw >r
1280: r@ file-size throw abort" file too large"
1281: dup allocate throw swap
1282: 2dup r@ read-file throw over <> abort" could not read whole file"
1283: r> close-file throw ;
1284: [THEN]
1285:
1286: : primfilter ( addr u -- )
1287: \ process the string at addr u
1288: over dup rawinput ! dup line-start ! cookedinput !
1289: + endrawinput !
1290: checksyncline
1291: primitives2something ;
1292:
1293: : process-file ( addr u xt-simple x-combined -- )
1294: output-combined ! output !
1295: save-mem 2dup filename 2!
1296: slurp-file
1297: warnings @ if
1298: ." ------------ CUT HERE -------------" cr endif
1299: primfilter ;
1300:
1301: \ : process ( xt -- )
1302: \ bl word count rot
1303: \ process-file ;
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>