Annotation of gforth/prims2x.fs, revision 1.87

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

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>