version 1.46, 2000/08/14 19:15:53
|
version 1.125, 2002/12/28 17:18:27
|
Line 1
|
Line 1
|
\ converts primitives to, e.g., C code |
\ converts primitives to, e.g., C code |
|
|
\ Copyright (C) 1995,1996,1997,1998 Free Software Foundation, Inc. |
\ Copyright (C) 1995,1996,1997,1998,2000 Free Software Foundation, Inc. |
|
|
\ This file is part of Gforth. |
\ This file is part of Gforth. |
|
|
Line 16
|
Line 16
|
|
|
\ You should have received a copy of the GNU General Public License |
\ You should have received a copy of the GNU General Public License |
\ along with this program; if not, write to the Free Software |
\ along with this program; if not, write to the Free Software |
\ Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
\ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA. |
|
|
|
|
\ This is not very nice (hard limits, no checking, assumes 1 chars = 1) |
\ This is not very nice (hard limits, no checking, assumes 1 chars = 1). |
|
\ And it grew even worse when it aged. |
|
|
\ Optimizations: |
\ Optimizations: |
\ superfluous stores are removed. GCC removes the superfluous loads by itself |
\ superfluous stores are removed. GCC removes the superfluous loads by itself |
Line 39
|
Line 40
|
\ add the store optimization for doubles |
\ add the store optimization for doubles |
\ regarding problem 1 above: It would be better (for over) to implement |
\ regarding problem 1 above: It would be better (for over) to implement |
\ the alternative |
\ the alternative |
|
\ store optimization for combined instructions. |
|
|
|
\ Design Uglyness: |
|
|
|
\ - global state (values, variables) in connection with combined instructions. |
|
|
|
\ - index computation is different for instruction-stream and the |
|
\ stacks; there are two mechanisms for dealing with that |
|
\ (stack-in-index-xt and a test for stack==instruction-stream); there |
|
\ should be only one. |
|
|
warnings off |
warnings off |
|
|
[IFUNDEF] vocabulary \ we are executed just with kernel image |
[IFUNDEF] try |
\ load the rest that is needed |
include startup.fs |
\ (require fails because this file is needed from a |
|
\ different directory with the wordlibraries) |
|
include ./search.fs |
|
include ./extend.fs |
|
[THEN] |
[THEN] |
|
|
[IFUNDEF] environment? |
: struct% struct ; \ struct is redefined in gray |
include ./environ.fs |
|
[THEN] |
|
|
|
include ./gray.fs |
warnings off |
|
\ warnings on |
|
|
100 constant max-effect \ number of things on one side of a stack effect |
include ./gray.fs |
|
32 constant max-effect \ number of things on one side of a stack effect |
|
4 constant max-stacks \ the max. number of stacks (including inst-stream). |
255 constant maxchar |
255 constant maxchar |
maxchar 1+ constant eof-char |
maxchar 1+ constant eof-char |
#tab constant tab-char |
#tab constant tab-char |
Line 66 variable rawinput \ pointer to next char
|
Line 74 variable rawinput \ pointer to next char
|
variable endrawinput \ pointer to the end of the input (the char after the last) |
variable endrawinput \ pointer to the end of the input (the char after the last) |
variable cookedinput \ pointer to the next char to be parsed |
variable cookedinput \ pointer to the next char to be parsed |
variable line \ line number of char pointed to by input |
variable line \ line number of char pointed to by input |
1 line ! |
variable line-start \ pointer to start of current line (for error messages) |
|
0 line ! |
2variable filename \ filename of original input file |
2variable filename \ filename of original input file |
0 0 filename 2! |
0 0 filename 2! |
|
2variable out-filename \ filename of the output file (for sync lines) |
|
0 0 out-filename 2! |
2variable f-comment |
2variable f-comment |
0 0 f-comment 2! |
0 0 f-comment 2! |
variable skipsynclines \ are sync lines ("#line ...") invisible to the parser? |
variable skipsynclines \ are sync lines ("#line ...") invisible to the parser? |
skipsynclines on |
skipsynclines on |
|
variable out-nls \ newlines in output (for output sync lines) |
|
0 out-nls ! |
|
variable store-optimization \ use store optimization? |
|
store-optimization off |
|
|
|
variable include-skipped-insts |
|
\ does the threaded code for a combined instruction include the cells |
|
\ for the component instructions (true) or only the cells for the |
|
\ inline arguments (false) |
|
include-skipped-insts off |
|
|
|
variable immarg \ values for immediate arguments (to be used in IMM_ARG macros) |
|
$12340000 immarg ! |
|
|
|
: th ( addr1 n -- addr2 ) |
|
cells + ; |
|
|
|
: holds ( addr u -- ) |
|
\ like HOLD, but for a string |
|
tuck + swap 0 +do |
|
1- dup c@ hold |
|
loop |
|
drop ; |
|
|
|
: insert-wordlist { c-addr u wordlist xt -- } |
|
\ adds name "addr u" to wordlist using defining word xt |
|
\ xt may cause additional stack effects |
|
get-current >r wordlist set-current |
|
c-addr u nextname xt execute |
|
r> set-current ; |
|
|
: start ( -- addr ) |
: start ( -- addr ) |
cookedinput @ ; |
cookedinput @ ; |
Line 80 skipsynclines on
|
Line 121 skipsynclines on
|
: end ( addr -- addr u ) |
: end ( addr -- addr u ) |
cookedinput @ over - ; |
cookedinput @ over - ; |
|
|
variable output \ xt ( -- ) of output word |
: print-error-line ( -- ) |
|
\ print the current line and position |
|
line-start @ endrawinput @ over - 2dup nl-char scan drop nip ( start end ) |
|
over - type cr |
|
line-start @ rawinput @ over - typewhite ." ^" cr ; |
|
|
|
: ?print-error { f addr u -- } |
|
f ?not? if |
|
outfile-id >r try |
|
stderr to outfile-id |
|
filename 2@ type ." :" line @ 0 .r ." : " addr u type cr |
|
print-error-line |
|
0 |
|
recover endtry |
|
r> to outfile-id throw |
|
1 (bye) \ abort |
|
endif ; |
|
|
|
: quote ( -- ) |
|
[char] " emit ; |
|
|
|
\ count output lines to generate sync lines for output |
|
|
: printprim ( -- ) |
: count-nls ( addr u -- ) |
output @ execute ; |
bounds u+do |
|
i c@ nl-char = negate out-nls +! |
|
loop ; |
|
|
|
:noname ( addr u -- ) |
|
2dup count-nls |
|
defers type ; |
|
is type |
|
|
|
variable output \ xt ( -- ) of output word for simple primitives |
|
variable output-combined \ xt ( -- ) of output word for combined primitives |
|
|
|
struct% |
|
cell% field stack-number \ the number of this stack |
|
cell% 2* field stack-pointer \ stackpointer name |
|
cell% field stack-type \ name for default type of stack items |
|
cell% field stack-in-index-xt \ ( in-size item -- in-index ) |
|
end-struct stack% |
|
|
|
struct% |
|
cell% 2* field item-name \ name, excluding stack prefixes |
|
cell% field item-stack \ descriptor for the stack used, 0 is default |
|
cell% field item-type \ descriptor for the item type |
|
cell% field item-offset \ offset in stack items, 0 for the deepest element |
|
cell% field item-first \ true if this is the first occurence of the item |
|
end-struct item% |
|
|
|
struct% |
|
cell% 2* field type-c-name |
|
cell% field type-stack \ default stack |
|
cell% field type-size \ size of type in stack items |
|
cell% field type-fetch \ xt of fetch code generator ( item -- ) |
|
cell% field type-store \ xt of store code generator ( item -- ) |
|
end-struct type% |
|
|
|
variable next-stack-number 0 next-stack-number ! |
|
create stacks max-stacks cells allot \ array of stacks |
|
|
|
: stack-in-index ( in-size item -- in-index ) |
|
item-offset @ - 1- ; |
|
|
|
: inst-in-index ( in-size item -- in-index ) |
|
nip dup item-offset @ swap item-type @ type-size @ + 1- ; |
|
|
|
: make-stack ( addr-ptr u1 type "stack-name" -- ) |
|
next-stack-number @ max-stacks < s" too many stacks" ?print-error |
|
create stack% %allot >r |
|
r@ stacks next-stack-number @ th ! |
|
next-stack-number @ r@ stack-number ! |
|
1 next-stack-number +! |
|
r@ stack-type ! |
|
save-mem r@ stack-pointer 2! |
|
['] stack-in-index r> stack-in-index-xt ! ; |
|
|
|
: map-stacks { xt -- } |
|
\ perform xt for all stacks |
|
next-stack-number @ 0 +do |
|
stacks i th @ xt execute |
|
loop ; |
|
|
|
: map-stacks1 { xt -- } |
|
\ perform xt for all stacks except inst-stream |
|
next-stack-number @ 1 +do |
|
stacks i th @ xt execute |
|
loop ; |
|
|
|
\ stack items |
|
|
|
: init-item ( addr u addr1 -- ) |
|
\ initialize item at addr1 with name addr u |
|
\ !! remove stack prefix |
|
dup item% %size erase |
|
item-name 2! ; |
|
|
|
: map-items { addr end xt -- } |
|
\ perform xt for all items in array addr...end |
|
end addr ?do |
|
i xt execute |
|
item% %size +loop ; |
|
|
: field |
\ types |
<builds-field ( n1 n2 -- n3 ) |
|
does> ( addr1 -- addr2 ) |
: print-type-prefix ( type -- ) |
@ + ; |
body> >head name>string type ; |
|
|
: const-field |
\ various variables for storing stuff of one primitive |
<builds-field ( n1 n2 -- n3 ) |
|
does> ( addr -- w ) |
struct% |
@ + @ ; |
cell% 2* field prim-name |
|
cell% 2* field prim-wordset |
struct |
cell% 2* field prim-c-name |
2 cells field item-name |
cell% 2* field prim-doc |
cell field item-d-offset |
cell% 2* field prim-c-code |
cell field item-f-offset |
cell% 2* field prim-forth-code |
cell field item-type |
cell% 2* field prim-stack-string |
constant item-descr |
cell% field prim-num \ ordinal number |
|
cell% field prim-items-wordlist \ unique items |
2variable forth-name |
item% max-effect * field prim-effect-in |
2variable wordset |
item% max-effect * field prim-effect-out |
2variable c-name |
cell% field prim-effect-in-end |
2variable doc |
cell% field prim-effect-out-end |
2variable c-code |
cell% max-stacks * field prim-stacks-in \ number of in items per stack |
2variable forth-code |
cell% max-stacks * field prim-stacks-out \ number of out items per stack |
2variable stack-string |
end-struct prim% |
create effect-in max-effect item-descr * allot |
|
create effect-out max-effect item-descr * allot |
: make-prim ( -- prim ) |
variable effect-in-end ( pointer ) |
prim% %alloc { p } |
variable effect-out-end ( pointer ) |
s" " p prim-doc 2! s" " p prim-forth-code 2! s" " p prim-wordset 2! |
2variable effect-in-size |
p ; |
2variable effect-out-size |
|
|
0 value prim \ in combined prims either combined or a part |
|
0 value combined \ in combined prims the combined prim |
|
variable in-part \ true if processing a part |
|
in-part off |
|
|
|
: prim-context ( ... p xt -- ... ) |
|
\ execute xt with prim set to p |
|
prim >r |
|
swap to prim |
|
catch |
|
r> to prim |
|
throw ; |
|
|
|
1000 constant max-combined |
|
create combined-prims max-combined cells allot |
|
variable num-combined |
|
variable part-num \ current part number during process-combined |
|
|
|
: map-combined { xt -- } |
|
\ perform xt for all components of the current combined instruction |
|
num-combined @ 0 +do |
|
combined-prims i th @ xt execute |
|
loop ; |
|
|
|
table constant combinations |
|
\ the keys are the sequences of pointers to primitives |
|
|
|
create current-depth max-stacks cells allot |
|
create max-depth max-stacks cells allot |
|
create min-depth max-stacks cells allot |
|
|
|
create sp-update-in max-stacks cells allot |
|
\ where max-depth occured the first time |
|
create max-depths max-stacks max-combined 1+ * cells allot |
|
\ maximum depth at start of each part: array[parts] of array[stack] |
|
create max-back-depths max-stacks max-combined 1+ * cells allot |
|
\ maximun depth from end of the combination to the start of the each part |
|
|
|
: s-c-max-depth ( nstack ncomponent -- addr ) |
|
max-stacks * + cells max-depths + ; |
|
|
|
: s-c-max-back-depth ( nstack ncomponent -- addr ) |
|
max-stacks * + cells max-back-depths + ; |
|
|
|
wordlist constant primitives |
|
|
|
: create-prim ( prim -- ) |
|
dup prim-name 2@ primitives ['] constant insert-wordlist ; |
|
|
|
: stack-in ( stack -- addr ) |
|
\ address of number of stack items in effect in |
|
stack-number @ cells prim prim-stacks-in + ; |
|
|
|
: stack-out ( stack -- addr ) |
|
\ address of number of stack items in effect out |
|
stack-number @ cells prim prim-stacks-out + ; |
|
|
|
\ global vars |
variable c-line |
variable c-line |
2variable c-filename |
2variable c-filename |
variable name-line |
variable name-line |
2variable name-filename |
2variable name-filename |
2variable last-name-filename |
2variable last-name-filename |
|
|
variable primitive-number -10 primitive-number ! |
|
Variable function-number 0 function-number ! |
Variable function-number 0 function-number ! |
|
|
\ for several reasons stack items of a word are stored in a wordlist |
|
\ since neither forget nor marker are implemented yet, we make a new |
|
\ wordlist for every word and store it in the variable items |
|
variable items |
|
|
|
\ a few more set ops |
\ a few more set ops |
|
|
: bit-equivalent ( w1 w2 -- w3 ) |
: bit-equivalent ( w1 w2 -- w3 ) |
Line 137 variable items
|
Line 328 variable items
|
: complement ( set1 -- set2 ) |
: complement ( set1 -- set2 ) |
empty ['] bit-equivalent binary-set-operation ; |
empty ['] bit-equivalent binary-set-operation ; |
|
|
|
\ forward declaration for inst-stream (breaks cycle in definitions) |
|
defer inst-stream-f ( -- stack ) |
|
|
|
\ stack access stuff |
|
|
|
: normal-stack-access1 ( n stack -- ) |
|
stack-pointer 2@ type |
|
dup |
|
if |
|
." [" 0 .r ." ]" |
|
else |
|
drop ." TOS" |
|
endif ; |
|
|
|
: normal-stack-access ( n stack -- ) |
|
dup inst-stream-f = if |
|
." IMM_ARG(" normal-stack-access1 ." ," immarg ? ." )" |
|
1 immarg +! |
|
else |
|
normal-stack-access1 |
|
endif ; |
|
|
|
: stack-depth { stack -- n } |
|
current-depth stack stack-number @ th @ ; |
|
|
|
: part-stack-access { n stack -- } |
|
\ print _<stack><x>, x=inst-stream? n : maxdepth-currentdepth-n-1 |
|
." _" stack stack-pointer 2@ type |
|
stack stack-number @ { stack# } |
|
stack stack-depth n + { access-depth } |
|
stack inst-stream-f = if |
|
access-depth |
|
else |
|
combined prim-stacks-in stack# th @ |
|
assert( dup max-depth stack# th @ = ) |
|
access-depth - 1- |
|
endif |
|
0 .r ; |
|
|
|
: part-stack-read { n stack -- } |
|
stack stack-depth n + ( ndepth ) |
|
stack stack-number @ part-num @ s-c-max-depth @ |
|
\ max-depth stack stack-number @ th @ ( ndepth nmaxdepth ) |
|
over <= if ( ndepth ) \ load from memory |
|
stack normal-stack-access |
|
else |
|
drop n stack part-stack-access |
|
endif ; |
|
|
|
: stack-diff ( stack -- n ) |
|
\ in-out |
|
dup stack-in @ swap stack-out @ - ; |
|
|
|
: part-stack-write { n stack -- } |
|
stack stack-depth n + |
|
stack stack-number @ part-num @ s-c-max-back-depth @ |
|
over <= if ( ndepth ) |
|
stack combined ['] stack-diff prim-context - |
|
stack normal-stack-access |
|
else |
|
drop n stack part-stack-access |
|
endif ; |
|
|
|
: stack-read ( n stack -- ) |
|
\ print a stack access at index n of stack |
|
in-part @ if |
|
part-stack-read |
|
else |
|
normal-stack-access |
|
endif ; |
|
|
|
: stack-write ( n stack -- ) |
|
\ print a stack access at index n of stack |
|
in-part @ if |
|
part-stack-write |
|
else |
|
normal-stack-access |
|
endif ; |
|
|
|
: item-in-index { item -- n } |
|
\ n is the index of item (in the in-effect) |
|
item item-stack @ dup >r stack-in @ ( in-size r:stack ) |
|
item r> stack-in-index-xt @ execute ; |
|
|
|
: item-stack-type-name ( item -- addr u ) |
|
item-stack @ stack-type @ type-c-name 2@ ; |
|
|
|
: fetch-single ( item -- ) |
|
\ fetch a single stack item from its stack |
|
>r |
|
." vm_" r@ item-stack-type-name type |
|
." 2" r@ item-type @ print-type-prefix ." (" |
|
r@ item-in-index r@ item-stack @ stack-read ." ," |
|
r@ item-name 2@ type |
|
." );" cr |
|
rdrop ; |
|
|
|
: fetch-double ( item -- ) |
|
\ fetch a double stack item from its stack |
|
>r |
|
." vm_two" |
|
r@ item-stack-type-name type ." 2" |
|
r@ item-type @ print-type-prefix ." (" |
|
r@ item-in-index r@ item-stack @ 2dup ." (Cell)" stack-read |
|
." , " -1 under+ ." (Cell)" stack-read |
|
." , " r@ item-name 2@ type |
|
." )" cr |
|
rdrop ; |
|
|
|
: same-as-in? ( item -- f ) |
|
\ f is true iff the offset and stack of item is the same as on input |
|
>r |
|
r@ item-first @ if |
|
rdrop false exit |
|
endif |
|
r@ item-name 2@ prim prim-items-wordlist @ search-wordlist 0= abort" bug" |
|
execute @ |
|
dup r@ = |
|
if \ item first appeared in output |
|
drop false |
|
else |
|
dup item-stack @ r@ item-stack @ = |
|
swap item-offset @ r@ item-offset @ = and |
|
endif |
|
rdrop ; |
|
|
|
: item-out-index ( item -- n ) |
|
\ n is the index of item (in the in-effect) |
|
>r r@ item-stack @ stack-out @ r> item-offset @ - 1- ; |
|
|
|
: really-store-single ( item -- ) |
|
>r |
|
." vm_" |
|
r@ item-type @ print-type-prefix ." 2" |
|
r@ item-stack-type-name type ." (" |
|
r@ item-name 2@ type ." ," |
|
r@ item-out-index r@ item-stack @ stack-write ." );" |
|
rdrop ; |
|
|
|
: store-single ( item -- ) |
|
>r |
|
store-optimization @ in-part @ 0= and r@ same-as-in? and if |
|
r@ item-in-index 0= r@ item-out-index 0= xor if |
|
." IF_" r@ item-stack @ stack-pointer 2@ type |
|
." TOS(" r@ really-store-single ." );" cr |
|
endif |
|
else |
|
r@ really-store-single cr |
|
endif |
|
rdrop ; |
|
|
|
: store-double ( item -- ) |
|
\ !! store optimization is not performed, because it is not yet needed |
|
>r |
|
." vm_" |
|
r@ item-type @ print-type-prefix ." 2two" |
|
r@ item-stack-type-name type ." (" |
|
r@ item-name 2@ type ." , " |
|
r@ item-out-index r@ item-stack @ 2dup stack-write |
|
." , " -1 under+ stack-write |
|
." )" cr |
|
rdrop ; |
|
|
|
: single ( -- xt1 xt2 n ) |
|
['] fetch-single ['] store-single 1 ; |
|
|
|
: double ( -- xt1 xt2 n ) |
|
['] fetch-double ['] store-double 2 ; |
|
|
|
: s, ( addr u -- ) |
|
\ allocate a string |
|
here swap dup allot move ; |
|
|
|
wordlist constant prefixes |
|
|
|
: declare ( addr "name" -- ) |
|
\ remember that there is a stack item at addr called name |
|
create , ; |
|
|
|
: !default ( w addr -- ) |
|
dup @ if |
|
2drop \ leave nonzero alone |
|
else |
|
! |
|
endif ; |
|
|
|
: create-type { addr u xt1 xt2 n stack -- } ( "prefix" -- ) |
|
\ describes a type |
|
\ addr u specifies the C type name |
|
\ stack effect entries of the type start with prefix |
|
create type% %allot >r |
|
addr u save-mem r@ type-c-name 2! |
|
xt1 r@ type-fetch ! |
|
xt2 r@ type-store ! |
|
n r@ type-size ! |
|
stack r@ type-stack ! |
|
rdrop ; |
|
|
|
: type-prefix ( addr u xt1 xt2 n stack "prefix" -- ) |
|
get-current >r prefixes set-current |
|
create-type r> set-current |
|
does> ( item -- ) |
|
\ initialize item |
|
{ item typ } |
|
typ item item-type ! |
|
typ type-stack @ item item-stack !default |
|
item item-name 2@ prim prim-items-wordlist @ search-wordlist 0= if |
|
item item-name 2@ nextname item declare |
|
item item-first on |
|
\ typ type-c-name 2@ type space type ." ;" cr |
|
else |
|
drop |
|
item item-first off |
|
endif ; |
|
|
|
: execute-prefix ( item addr1 u1 -- ) |
|
\ execute the word ( item -- ) associated with the longest prefix |
|
\ of addr1 u1 |
|
0 swap ?do |
|
dup i prefixes search-wordlist |
|
if \ ok, we have the type ( item addr1 xt ) |
|
nip execute |
|
UNLOOP EXIT |
|
endif |
|
-1 s+loop |
|
\ we did not find a type, abort |
|
false s" unknown prefix" ?print-error ; |
|
|
|
: declaration ( item -- ) |
|
dup item-name 2@ execute-prefix ; |
|
|
|
: declaration-list ( addr1 addr2 -- ) |
|
['] declaration map-items ; |
|
|
|
: declarations ( -- ) |
|
wordlist dup prim prim-items-wordlist ! set-current |
|
prim prim-effect-in prim prim-effect-in-end @ declaration-list |
|
prim prim-effect-out prim prim-effect-out-end @ declaration-list ; |
|
|
|
: print-declaration { item -- } |
|
item item-first @ if |
|
item item-type @ type-c-name 2@ type space |
|
item item-name 2@ type ." ;" cr |
|
endif ; |
|
|
|
: print-declarations ( -- ) |
|
prim prim-effect-in prim prim-effect-in-end @ ['] print-declaration map-items |
|
prim prim-effect-out prim prim-effect-out-end @ ['] print-declaration map-items ; |
|
|
|
: stack-prefix ( stack "prefix" -- ) |
|
get-current >r prefixes set-current |
|
name tuck nextname create ( stack length ) 2, |
|
r> set-current |
|
does> ( item -- ) |
|
2@ { item stack prefix-length } |
|
item item-name 2@ prefix-length /string item item-name 2! |
|
stack item item-stack ! |
|
item declaration ; |
|
|
|
\ types pointed to by stacks for use in combined prims |
|
\ !! output-c-combined shouldn't use these names! |
|
: stack-type-name ( addr u "name" -- ) |
|
single 0 create-type ; |
|
|
|
wordlist constant type-names \ this is here just to meet the requirement |
|
\ that a type be a word; it is never used for lookup |
|
|
|
: stack ( "name" "stack-pointer" "type" -- ) |
|
\ define stack |
|
name { d: stack-name } |
|
name { d: stack-pointer } |
|
name { d: stack-type } |
|
get-current type-names set-current |
|
stack-type 2dup nextname stack-type-name |
|
set-current |
|
stack-pointer lastxt >body stack-name nextname make-stack ; |
|
|
|
stack inst-stream IP Cell |
|
' inst-in-index inst-stream stack-in-index-xt ! |
|
' inst-stream <is> inst-stream-f |
|
\ !! initialize stack-in and stack-out |
|
|
|
\ offset computation |
|
\ the leftmost (i.e. deepest) item has offset 0 |
|
\ the rightmost item has the highest offset |
|
|
|
: compute-offset { item xt -- } |
|
\ xt specifies in/out; update stack-in/out and set item-offset |
|
item item-type @ type-size @ |
|
item item-stack @ xt execute dup @ >r +! |
|
r> item item-offset ! ; |
|
|
|
: compute-offset-in ( addr1 addr2 -- ) |
|
['] stack-in compute-offset ; |
|
|
|
: compute-offset-out ( addr1 addr2 -- ) |
|
['] stack-out compute-offset ; |
|
|
|
: clear-stack ( stack -- ) |
|
dup stack-in off stack-out off ; |
|
|
|
: compute-offsets ( -- ) |
|
['] clear-stack map-stacks |
|
prim prim-effect-in prim prim-effect-in-end @ ['] compute-offset-in map-items |
|
prim prim-effect-out prim prim-effect-out-end @ ['] compute-offset-out map-items |
|
inst-stream stack-out @ 0= s" # can only be on the input side" ?print-error ; |
|
|
|
: process-simple ( -- ) |
|
prim prim { W^ key } key cell |
|
combinations ['] constant insert-wordlist |
|
declarations compute-offsets |
|
output @ execute ; |
|
|
|
: flush-a-tos { stack -- } |
|
stack stack-out @ 0<> stack stack-in @ 0= and |
|
if |
|
." IF_" stack stack-pointer 2@ 2dup type ." TOS(" |
|
2dup type ." [0] = " type ." TOS);" cr |
|
endif ; |
|
|
|
: flush-tos ( -- ) |
|
['] flush-a-tos map-stacks1 ; |
|
|
|
: fill-a-tos { stack -- } |
|
stack stack-out @ 0= stack stack-in @ 0<> and |
|
if |
|
." IF_" stack stack-pointer 2@ 2dup type ." TOS(" |
|
2dup type ." TOS = " type ." [0]);" cr |
|
endif ; |
|
|
|
: fill-tos ( -- ) |
|
\ !! inst-stream for prefetching? |
|
['] fill-a-tos map-stacks1 ; |
|
|
|
: fetch ( addr -- ) |
|
dup item-type @ type-fetch @ execute ; |
|
|
|
: fetches ( -- ) |
|
prim prim-effect-in prim prim-effect-in-end @ ['] fetch map-items ; |
|
|
|
: stack-pointer-update { stack -- } |
|
\ stacks grow downwards |
|
stack stack-diff |
|
?dup-if \ this check is not necessary, gcc would do this for us |
|
stack inst-stream = if |
|
." INC_IP(" 0 .r ." );" cr |
|
else |
|
stack stack-pointer 2@ type ." += " 0 .r ." ;" cr |
|
endif |
|
endif ; |
|
|
|
: stack-pointer-updates ( -- ) |
|
['] stack-pointer-update map-stacks ; |
|
|
|
: store ( item -- ) |
|
\ f is true if the item should be stored |
|
\ f is false if the store is probably not necessary |
|
dup item-type @ type-store @ execute ; |
|
|
|
: stores ( -- ) |
|
prim prim-effect-out prim prim-effect-out-end @ ['] store map-items ; |
|
|
|
: print-debug-arg { item -- } |
|
." fputs(" quote space item item-name 2@ type ." =" quote ." , vm_out); " |
|
." printarg_" item item-type @ print-type-prefix |
|
." (" item item-name 2@ type ." );" cr ; |
|
|
|
: print-debug-args ( -- ) |
|
." #ifdef VM_DEBUG" cr |
|
." if (vm_debug) {" cr |
|
prim prim-effect-in prim prim-effect-in-end @ ['] print-debug-arg map-items |
|
\ ." fputc('\n', vm_out);" cr |
|
." }" cr |
|
." #endif" cr ; |
|
|
|
: print-debug-result { item -- } |
|
item item-first @ if |
|
item print-debug-arg |
|
endif ; |
|
|
|
: print-debug-results ( -- ) |
|
cr |
|
." #ifdef VM_DEBUG" cr |
|
." if (vm_debug) {" cr |
|
." fputs(" quote ." -- " quote ." , vm_out); " |
|
prim prim-effect-out prim prim-effect-out-end @ ['] print-debug-result map-items |
|
." fputc('\n', vm_out);" cr |
|
." }" cr |
|
." #endif" cr ; |
|
|
|
: output-super-end ( -- ) |
|
prim prim-c-code 2@ s" SET_IP" search if |
|
." SUPER_END;" cr |
|
endif |
|
2drop ; |
|
|
|
: output-nextp2 ( -- ) |
|
." NEXT_P2;" cr ; |
|
|
|
variable tail-nextp2 \ xt to execute for printing NEXT_P2 in INST_TAIL |
|
' output-nextp2 tail-nextp2 ! |
|
|
|
: output-label2 ( -- ) |
|
." LABEL2(" prim prim-c-name 2@ type ." )" cr |
|
." NEXT_P2;" cr ; |
|
|
|
: output-c-tail1 { xt -- } |
|
\ the final part of the generated C code, with xt printing LABEL2 or not. |
|
output-super-end |
|
print-debug-results |
|
." NEXT_P1;" cr |
|
stores |
|
fill-tos |
|
xt execute ; |
|
|
|
: output-c-tail1-no-stores { xt -- } |
|
\ the final part of the generated C code for combinations |
|
output-super-end |
|
." NEXT_P1;" cr |
|
fill-tos |
|
xt execute ; |
|
|
|
: output-c-tail ( -- ) |
|
tail-nextp2 @ output-c-tail1 ; |
|
|
|
: output-c-tail2 ( -- ) |
|
['] output-label2 output-c-tail1 ; |
|
|
|
: output-c-tail-no-stores ( -- ) |
|
tail-nextp2 @ output-c-tail1-no-stores ; |
|
|
|
: output-c-tail2-no-stores ( -- ) |
|
['] output-label2 output-c-tail1-no-stores ; |
|
|
|
: type-c-code ( c-addr u xt -- ) |
|
\ like TYPE, but replaces "INST_TAIL;" with tail code produced by xt |
|
{ xt } |
|
." {" cr |
|
." #line " c-line @ . quote c-filename 2@ type quote cr |
|
begin ( c-addr1 u1 ) |
|
2dup s" INST_TAIL;" search |
|
while ( c-addr1 u1 c-addr3 u3 ) |
|
2dup 2>r drop nip over - type |
|
xt execute |
|
2r> 10 /string |
|
\ !! resync #line missing |
|
repeat |
|
2drop type |
|
." #line " out-nls @ 2 + . quote out-filename 2@ type quote cr |
|
." }" cr ; |
|
|
|
: print-entry ( -- ) |
|
." LABEL(" prim prim-c-name 2@ type ." )" ; |
|
|
|
: output-c ( -- ) |
|
print-entry ." /* " prim prim-name 2@ type ." ( " prim prim-stack-string 2@ type ." ) */" cr |
|
." /* " prim prim-doc 2@ type ." */" cr |
|
." NAME(" quote prim prim-name 2@ type quote ." )" cr \ debugging |
|
." {" cr |
|
." DEF_CA" cr |
|
print-declarations |
|
." NEXT_P0;" cr |
|
flush-tos |
|
fetches |
|
print-debug-args |
|
stack-pointer-updates |
|
prim prim-c-code 2@ ['] output-c-tail type-c-code |
|
output-c-tail2 |
|
." }" cr |
|
cr |
|
; |
|
|
|
: disasm-arg { item -- } |
|
item item-stack @ inst-stream = if |
|
." {" cr |
|
item print-declaration |
|
item fetch |
|
item print-debug-arg |
|
." }" cr |
|
endif ; |
|
|
|
: disasm-args ( -- ) |
|
prim prim-effect-in prim prim-effect-in-end @ ['] disasm-arg map-items ; |
|
|
|
: output-disasm ( -- ) |
|
\ generate code for disassembling VM instructions |
|
." if (VM_IS_INST(*ip, " function-number @ 0 .r ." )) {" cr |
|
." fputs(" quote prim prim-name 2@ type quote ." , vm_out);" cr |
|
disasm-args |
|
." ip += " inst-stream stack-in @ 1+ 0 .r ." ;" cr |
|
." goto _endif_;" cr |
|
." }" cr ; |
|
|
|
: output-profile ( -- ) |
|
\ generate code for postprocessing the VM block profile stuff |
|
." if (VM_IS_INST(*ip, " function-number @ 0 .r ." )) {" cr |
|
." add_inst(b, " quote prim prim-name 2@ type quote ." );" cr |
|
." ip += " inst-stream stack-in @ 1+ 0 .r ." ;" cr |
|
prim prim-c-code 2@ s" SET_IP" search nip nip |
|
prim prim-c-code 2@ s" SUPER_END" search nip nip or if |
|
." return;" cr |
|
else |
|
." goto _endif_;" cr |
|
endif |
|
." }" cr ; |
|
|
|
: output-profile-part ( p ) |
|
." add_inst(b, " quote |
|
prim-name 2@ type |
|
quote ." );" cr ; |
|
|
|
: output-profile-combined ( -- ) |
|
\ generate code for postprocessing the VM block profile stuff |
|
." if (VM_IS_INST(*ip, " function-number @ 0 .r ." )) {" cr |
|
['] output-profile-part map-combined |
|
." ip += " inst-stream stack-in @ 1+ 0 .r ." ;" cr |
|
combined-prims num-combined @ 1- th @ prim-c-code 2@ s" SET_IP" search nip nip |
|
combined-prims num-combined @ 1- th @ prim-c-code 2@ s" SUPER_END" search nip nip or if |
|
." return;" cr |
|
else |
|
." goto _endif_;" cr |
|
endif |
|
." }" cr ; |
|
|
|
: output-superend ( -- ) |
|
\ output flag specifying whether the current word ends a dynamic superinst |
|
prim prim-c-code 2@ s" SET_IP" search nip nip |
|
prim prim-c-code 2@ s" SUPER_END" search nip nip or 0<> |
|
prim prim-c-code 2@ s" SUPER_CONTINUE" search nip nip 0= and |
|
negate 0 .r ." , /* " prim prim-name 2@ type ." */" cr ; |
|
|
|
: gen-arg-parm { item -- } |
|
item item-stack @ inst-stream = if |
|
." , " item item-type @ type-c-name 2@ type space |
|
item item-name 2@ type |
|
endif ; |
|
|
|
: gen-args-parm ( -- ) |
|
prim prim-effect-in prim prim-effect-in-end @ ['] gen-arg-parm map-items ; |
|
|
|
: gen-arg-gen { item -- } |
|
item item-stack @ inst-stream = if |
|
." genarg_" item item-type @ print-type-prefix |
|
." (ctp, " item item-name 2@ type ." );" cr |
|
endif ; |
|
|
|
: gen-args-gen ( -- ) |
|
prim prim-effect-in prim prim-effect-in-end @ ['] gen-arg-gen map-items ; |
|
|
|
: output-gen ( -- ) |
|
\ generate C code for generating VM instructions |
|
." void gen_" prim prim-c-name 2@ type ." (Inst **ctp" gen-args-parm ." )" cr |
|
." {" cr |
|
." gen_inst(ctp, vm_prim[" function-number @ 0 .r ." ]);" cr |
|
gen-args-gen |
|
." }" cr ; |
|
|
|
: stack-used? { stack -- f } |
|
stack stack-in @ stack stack-out @ or 0<> ; |
|
|
|
: output-funclabel ( -- ) |
|
." &I_" prim prim-c-name 2@ type ." ," cr ; |
|
|
|
: output-forthname ( -- ) |
|
'" emit prim prim-name 2@ type '" emit ." ," cr ; |
|
|
|
\ : output-c-func ( -- ) |
|
\ \ used for word libraries |
|
\ ." Cell * I_" prim prim-c-name 2@ type ." (Cell *SP, Cell **FP) /* " prim prim-name 2@ type |
|
\ ." ( " prim prim-stack-string 2@ type ." ) */" cr |
|
\ ." /* " prim prim-doc 2@ type ." */" cr |
|
\ ." NAME(" quote prim prim-name 2@ type quote ." )" cr |
|
\ \ debugging |
|
\ ." {" cr |
|
\ print-declarations |
|
\ \ !! don't know what to do about that |
|
\ inst-stream stack-used? IF ." Cell *ip=IP;" cr THEN |
|
\ data-stack stack-used? IF ." Cell *sp=SP;" cr THEN |
|
\ fp-stack stack-used? IF ." Cell *fp=*FP;" cr THEN |
|
\ return-stack stack-used? IF ." Cell *rp=*RP;" cr THEN |
|
\ flush-tos |
|
\ fetches |
|
\ stack-pointer-updates |
|
\ fp-stack stack-used? IF ." *FP=fp;" cr THEN |
|
\ ." {" cr |
|
\ ." #line " c-line @ . quote c-filename 2@ type quote cr |
|
\ prim prim-c-code 2@ type |
|
\ ." }" cr |
|
\ stores |
|
\ fill-tos |
|
\ ." return (sp);" cr |
|
\ ." }" cr |
|
\ cr ; |
|
|
|
: output-label ( -- ) |
|
." INST_ADDR(" prim prim-c-name 2@ type ." )" cr ; |
|
|
|
: output-alias ( -- ) |
|
( primitive-number @ . ." alias " ) ." Primitive " prim prim-name 2@ type cr ; |
|
|
|
: output-c-prim-num ( -- ) |
|
." #define N_" prim prim-c-name 2@ type prim prim-num @ 8 + 4 .r cr ; |
|
|
|
: output-forth ( -- ) |
|
prim prim-forth-code @ 0= |
|
IF \ output-alias |
|
\ this is bad for ec: an alias is compiled if tho word does not exist! |
|
\ JAW |
|
ELSE ." : " prim prim-name 2@ type ." ( " |
|
prim prim-stack-string 2@ type ." )" cr |
|
prim prim-forth-code 2@ type cr |
|
THEN ; |
|
|
|
: output-tag-file ( -- ) |
|
name-filename 2@ last-name-filename 2@ compare if |
|
name-filename 2@ last-name-filename 2! |
|
#ff emit cr |
|
name-filename 2@ type |
|
." ,0" cr |
|
endif ; |
|
|
|
: output-tag ( -- ) |
|
output-tag-file |
|
prim prim-name 2@ 1+ type |
|
127 emit |
|
space prim prim-name 2@ type space |
|
1 emit |
|
name-line @ 0 .r |
|
." ,0" cr ; |
|
|
|
: output-vi-tag ( -- ) |
|
name-filename 2@ type #tab emit |
|
prim prim-name 2@ type #tab emit |
|
." /^" prim prim-name 2@ type ." *(/" cr ; |
|
|
|
[IFDEF] documentation |
|
: register-doc ( -- ) |
|
prim prim-name 2@ documentation ['] create insert-wordlist |
|
prim prim-name 2@ 2, |
|
prim prim-stack-string 2@ condition-stack-effect 2, |
|
prim prim-wordset 2@ 2, |
|
prim prim-c-name 2@ condition-pronounciation 2, |
|
prim prim-doc 2@ 2, ; |
|
[THEN] |
|
|
|
|
|
\ combining instructions |
|
|
|
\ The input should look like this: |
|
|
|
\ lit_+ = lit + |
|
|
|
\ The output should look like this: |
|
|
|
\ I_lit_+: |
|
\ { |
|
\ DEF_CA |
|
\ Cell _x_ip0; |
|
\ Cell _x_sp0; |
|
\ Cell _x_sp1; |
|
\ NEXT_P0; |
|
\ _x_ip0 = (Cell) IPTOS; |
|
\ _x_sp0 = (Cell) spTOS; |
|
\ INC_IP(1); |
|
\ /* sp += 0; */ |
|
\ /* lit ( #w -- w ) */ |
|
\ /* */ |
|
\ NAME("lit") |
|
\ { |
|
\ Cell w; |
|
\ w = (Cell) _x_ip0; |
|
\ #ifdef VM_DEBUG |
|
\ if (vm_debug) { |
|
\ fputs(" w=", vm_out); printarg_w (w); |
|
\ fputc('\n', vm_out); |
|
\ } |
|
\ #endif |
|
\ { |
|
\ #line 136 "./prim" |
|
\ } |
|
\ _x_sp1 = (Cell)w; |
|
\ } |
|
\ I_plus: /* + ( n1 n2 -- n ) */ |
|
\ /* */ |
|
\ NAME("+") |
|
\ { |
|
\ DEF_CA |
|
\ Cell n1; |
|
\ Cell n2; |
|
\ Cell n; |
|
\ NEXT_P0; |
|
\ n1 = (Cell) _x_sp0; |
|
\ n2 = (Cell) _x_sp1; |
|
\ #ifdef VM_DEBUG |
|
\ if (vm_debug) { |
|
\ fputs(" n1=", vm_out); printarg_n (n1); |
|
\ fputs(" n2=", vm_out); printarg_n (n2); |
|
\ fputc('\n', vm_out); |
|
\ } |
|
\ #endif |
|
\ { |
|
\ #line 516 "./prim" |
|
\ n = n1+n2; |
|
\ } |
|
\ _x_sp0 = (Cell)n; |
|
\ } |
|
\ NEXT_P1; |
|
\ spTOS = (Cell)_x_sp0; |
|
\ NEXT_P2; |
|
|
|
: init-combined ( -- ) |
|
prim to combined |
|
0 num-combined ! |
|
current-depth max-stacks cells erase |
|
include-skipped-insts @ current-depth 0 th ! |
|
max-depth max-stacks cells erase |
|
min-depth max-stacks cells erase |
|
prim prim-effect-in prim prim-effect-in-end ! |
|
prim prim-effect-out prim prim-effect-out-end ! ; |
|
|
|
: max! ( n addr -- ) |
|
tuck @ max swap ! ; |
|
|
|
: min! ( n addr -- ) |
|
tuck @ min swap ! ; |
|
|
|
: inst-stream-adjustment ( nstack -- n ) |
|
\ number of stack items to add for each part |
|
0= include-skipped-insts @ and negate ; |
|
|
|
: add-depths { p -- } |
|
\ combine stack effect of p with *-depths |
|
max-stacks 0 ?do |
|
current-depth i th @ |
|
p prim-stacks-in i th @ + i inst-stream-adjustment + |
|
dup max-depth i th max! |
|
p prim-stacks-out i th @ - |
|
dup min-depth i th min! |
|
current-depth i th ! |
|
loop ; |
|
|
|
: copy-maxdepths ( n -- ) |
|
max-depth max-depths rot max-stacks * th max-stacks cells move ; |
|
|
|
: add-prim ( addr u -- ) |
|
\ add primitive given by "addr u" to combined-prims |
|
primitives search-wordlist s" unknown primitive" ?print-error |
|
execute { p } |
|
p combined-prims num-combined @ th ! |
|
num-combined @ copy-maxdepths |
|
1 num-combined +! |
|
p add-depths |
|
num-combined @ copy-maxdepths ; |
|
|
|
: compute-effects { q -- } |
|
\ compute the stack effects of q from the depths |
|
max-stacks 0 ?do |
|
max-depth i th @ dup |
|
q prim-stacks-in i th ! |
|
current-depth i th @ - |
|
q prim-stacks-out i th ! |
|
loop ; |
|
|
|
: make-effect-items { stack# items effect-endp -- } |
|
\ effect-endp points to a pointer to the end of the current item-array |
|
\ and has to be updated |
|
stacks stack# th @ { stack } |
|
items 0 +do |
|
effect-endp @ { item } |
|
i 0 <# #s stack stack-pointer 2@ holds [char] _ hold #> save-mem |
|
item item-name 2! |
|
stack item item-stack ! |
|
stack stack-type @ item item-type ! |
|
i item item-offset ! |
|
item item-first on |
|
item% %size effect-endp +! |
|
loop ; |
|
|
|
: init-effects { q -- } |
|
\ initialize effects field for FETCHES and STORES |
|
max-stacks 0 ?do |
|
i q prim-stacks-in i th @ q prim-effect-in-end make-effect-items |
|
i q prim-stacks-out i th @ q prim-effect-out-end make-effect-items |
|
loop ; |
|
|
|
: compute-stack-max-back-depths ( stack -- ) |
|
stack-number @ { stack# } |
|
current-depth stack# th @ dup |
|
dup stack# num-combined @ s-c-max-back-depth ! |
|
-1 num-combined @ 1- -do ( max-depth current-depth ) |
|
combined-prims i th @ { p } |
|
p prim-stacks-out stack# th @ + |
|
dup >r max r> |
|
over stack# i s-c-max-back-depth ! |
|
p prim-stacks-in stack# th @ - |
|
stack# inst-stream-adjustment - |
|
1 -loop |
|
assert( dup stack# inst-stream-adjustment negate = ) |
|
assert( over max-depth stack# th @ = ) |
|
2drop ; |
|
|
|
: compute-max-back-depths ( -- ) |
|
\ compute max-back-depths. |
|
\ assumes that current-depths is correct for the end of the combination |
|
['] compute-stack-max-back-depths map-stacks ; |
|
|
|
: process-combined ( -- ) |
|
combined combined-prims num-combined @ cells |
|
combinations ['] constant insert-wordlist |
|
combined-prims num-combined @ 1- th ( last-part ) |
|
@ prim-c-code 2@ prim prim-c-code 2! \ used by output-super-end |
|
prim compute-effects |
|
prim init-effects |
|
compute-max-back-depths |
|
output-combined perform ; |
|
|
|
\ C output |
|
|
|
: print-item { n stack -- } |
|
\ print nth stack item name |
|
stack stack-type @ type-c-name 2@ type space |
|
." _" stack stack-pointer 2@ type n 0 .r ; |
|
|
|
: print-declarations-combined ( -- ) |
|
max-stacks 0 ?do |
|
max-depth i th @ min-depth i th @ - 0 +do |
|
i stacks j th @ print-item ." ;" cr |
|
loop |
|
loop ; |
|
|
|
: part-fetches ( -- ) |
|
fetches ; |
|
|
|
: part-output-c-tail ( -- ) |
|
print-debug-results |
|
stores ; |
|
|
|
: output-combined-tail ( -- ) |
|
part-output-c-tail |
|
in-part @ >r in-part off |
|
combined ['] output-c-tail-no-stores prim-context |
|
r> in-part ! ; |
|
|
|
: part-stack-pointer-updates ( -- ) |
|
next-stack-number @ 0 +do |
|
i part-num @ 1+ s-c-max-depth @ dup |
|
i num-combined @ s-c-max-depth @ = \ final depth |
|
swap i part-num @ s-c-max-depth @ <> \ just reached now |
|
part-num @ 0= \ first part |
|
or and if |
|
stacks i th @ stack-pointer-update |
|
endif |
|
loop ; |
|
|
|
: output-part ( p -- ) |
|
to prim |
|
." /* " prim prim-name 2@ type ." ( " prim prim-stack-string 2@ type ." ) */" cr |
|
." NAME(" quote prim prim-name 2@ type quote ." )" cr \ debugging |
|
." {" cr |
|
print-declarations |
|
part-fetches |
|
print-debug-args |
|
combined ['] part-stack-pointer-updates prim-context |
|
1 part-num +! |
|
prim add-depths \ !! right place? |
|
prim prim-c-code 2@ ['] output-combined-tail type-c-code |
|
part-output-c-tail |
|
." }" cr ; |
|
|
|
: output-parts ( -- ) |
|
prim >r in-part on |
|
current-depth max-stacks cells erase |
|
0 part-num ! |
|
['] output-part map-combined |
|
in-part off |
|
r> to prim ; |
|
|
|
: output-c-combined ( -- ) |
|
print-entry cr |
|
\ debugging messages just in parts |
|
." {" cr |
|
." DEF_CA" cr |
|
print-declarations-combined |
|
." NEXT_P0;" cr |
|
flush-tos |
|
\ fetches \ now in parts |
|
\ print-debug-args |
|
\ stack-pointer-updates now in parts |
|
output-parts |
|
output-c-tail2-no-stores |
|
." }" cr |
|
cr ; |
|
|
|
: output-forth-combined ( -- ) |
|
; |
|
|
|
|
|
\ peephole optimization rules |
|
|
|
\ data for a simple peephole optimizer that always tries to combine |
|
\ the currently compiled instruction with the last one. |
|
|
|
\ in order for this to work as intended, shorter combinations for each |
|
\ length must be present, and the longer combinations must follow |
|
\ shorter ones (this restriction may go away in the future). |
|
|
|
: output-peephole ( -- ) |
|
combined-prims num-combined @ 1- cells combinations search-wordlist |
|
s" the prefix for this superinstruction must be defined earlier" ?print-error |
|
." {" |
|
execute prim-num @ 5 .r ." ," |
|
combined-prims num-combined @ 1- th @ prim-num @ 5 .r ." ," |
|
combined prim-num @ 5 .r ." }, /* " |
|
combined prim-c-name 2@ type ." */" |
|
cr ; |
|
|
|
|
|
\ cost and superinstruction data for a sophisticated combiner (e.g., |
|
\ shortest path) |
|
|
|
\ This is intended as initializer for a structure like this |
|
|
|
\ struct cost { |
|
\ int loads; /* number of stack loads */ |
|
\ int stores; /* number of stack stores */ |
|
\ int updates; /* number of stack pointer updates */ |
|
\ int length; /* number of components */ |
|
\ int *components; /* array of vm_prim indexes of components */ |
|
\ }; |
|
|
|
\ How do you know which primitive or combined instruction this |
|
\ structure refers to? By the order of cost structures, as in most |
|
\ other cases. |
|
|
|
: compute-costs { p -- nloads nstores nupdates } |
|
\ compute the number of loads, stores, and stack pointer updates |
|
\ of a primitive or combined instruction; does not take TOS |
|
\ caching into account, nor that IP updates are combined with |
|
\ other stuff |
|
0 max-stacks 0 +do |
|
p prim-stacks-in i th @ + |
|
loop |
|
0 max-stacks 0 +do |
|
p prim-stacks-out i th @ + |
|
loop |
|
0 max-stacks 0 +do |
|
p prim-stacks-in i th @ p prim-stacks-out i th @ <> - |
|
loop ; |
|
|
|
: output-num-part ( p -- ) |
|
prim-num @ 4 .r ." ," ; |
|
|
|
: output-costs ( -- ) |
|
." {" prim compute-costs |
|
rot 2 .r ." ," swap 2 .r ." ," 2 .r ." ," |
|
combined if |
|
num-combined @ 2 .r |
|
." , ((int []){" ['] output-num-part map-combined ." })}, /* " |
|
else |
|
." 1, ((int []){" prim prim-num @ 4 .r ." })}, /* " |
|
endif |
|
prim prim-name 2@ type ." */" |
|
cr ; |
|
|
\ the parser |
\ the parser |
|
|
eof-char max-member \ the whole character set + EOF |
eof-char max-member \ the whole character set + EOF |
Line 165 print-token !
|
Line 1320 print-token !
|
\ when input points to a newline, check if the next line is a |
\ when input points to a newline, check if the next line is a |
\ sync line. If it is, perform the appropriate actions. |
\ sync line. If it is, perform the appropriate actions. |
rawinput @ >r |
rawinput @ >r |
s" #line " r@ over compare 0<> if |
s" #line " r@ over compare if |
rdrop 1 line +! EXIT |
rdrop 1 line +! EXIT |
endif |
endif |
0. r> 6 chars + 20 >number drop >r drop line ! r> ( c-addr ) |
0. r> 6 chars + 20 >number drop >r drop line ! r> ( c-addr ) |
dup c@ bl = if |
dup c@ bl = if |
char+ dup c@ [char] " <> abort" sync line syntax" |
char+ dup c@ [char] " <> 0= s" sync line syntax" ?print-error |
char+ dup 100 [char] " scan drop swap 2dup - save-mem filename 2! |
char+ dup 100 [char] " scan drop swap 2dup - save-mem filename 2! |
char+ |
char+ |
endif |
endif |
dup c@ nl-char <> abort" sync line syntax" |
dup c@ nl-char <> 0= s" sync line syntax" ?print-error |
skipsynclines @ if |
skipsynclines @ if |
dup char+ rawinput ! |
dup char+ rawinput ! |
rawinput @ c@ cookedinput @ c! |
rawinput @ c@ cookedinput @ c! |
Line 182 print-token !
|
Line 1337 print-token !
|
drop ; |
drop ; |
|
|
: ?nextchar ( f -- ) |
: ?nextchar ( f -- ) |
?not? if |
s" syntax error, wrong char" ?print-error |
filename 2@ type ." :" line @ 0 .r ." : syntax error, wrong char:" |
|
getinput . cr |
|
rawinput @ endrawinput @ over - 100 min type cr |
|
abort |
|
endif |
|
rawinput @ endrawinput @ <> if |
rawinput @ endrawinput @ <> if |
rawinput @ c@ |
rawinput @ c@ |
1 chars rawinput +! |
1 chars rawinput +! |
1 chars cookedinput +! |
1 chars cookedinput +! |
nl-char = if |
nl-char = if |
checksyncline |
checksyncline |
|
rawinput @ line-start ! |
endif |
endif |
rawinput @ c@ cookedinput @ c! |
rawinput @ c@ cookedinput @ c! |
endif ; |
endif ; |
Line 218 bl singleton tab-char over add-member
|
Line 1369 bl singleton tab-char over add-member
|
nl-char singleton eof-char over add-member complement charclass nonl |
nl-char singleton eof-char over add-member complement charclass nonl |
nl-char singleton eof-char over add-member |
nl-char singleton eof-char over add-member |
char : over add-member complement charclass nocolonnl |
char : over add-member complement charclass nocolonnl |
|
nl-char singleton eof-char over add-member |
|
char } over add-member complement charclass nobracenl |
bl 1+ maxchar .. char \ singleton complement intersection |
bl 1+ maxchar .. char \ singleton complement intersection |
charclass nowhitebq |
charclass nowhitebq |
bl 1+ maxchar .. charclass nowhite |
bl 1+ maxchar .. charclass nowhite |
char " singleton eof-char over add-member complement charclass noquote |
char " singleton eof-char over add-member complement charclass noquote |
nl-char singleton charclass nl |
nl-char singleton charclass nl |
eof-char singleton charclass eof |
eof-char singleton charclass eof |
|
nl-char singleton eof-char over add-member charclass nleof |
|
|
(( letter (( letter || digit )) ** |
(( letter (( letter || digit )) ** |
)) <- c-name ( -- ) |
)) <- c-ident ( -- ) |
|
|
|
(( ` # ?? (( letter || digit || ` : )) ++ |
|
)) <- stack-ident ( -- ) |
|
|
(( nowhitebq nowhite ** )) |
(( nowhitebq nowhite ** )) |
<- name ( -- ) |
<- forth-ident ( -- ) |
|
|
Variable forth-flag |
Variable forth-flag |
Variable c-flag |
Variable c-flag |
|
|
|
(( (( ` e || ` E )) {{ start }} nonl ** |
|
{{ end evaluate }} |
|
)) <- eval-comment ( ... -- ... ) |
|
|
(( (( ` f || ` F )) {{ start }} nonl ** |
(( (( ` f || ` F )) {{ start }} nonl ** |
{{ end forth-flag @ IF type cr ELSE 2drop THEN }} |
{{ end forth-flag @ IF type cr ELSE 2drop THEN }} |
)) <- forth-comment ( -- ) |
)) <- forth-comment ( -- ) |
Line 261 Variable c-flag
|
Line 1421 Variable c-flag
|
THEN }} |
THEN }} |
)) <- if-comment |
)) <- if-comment |
|
|
(( (( forth-comment || c-comment || else-comment || if-comment )) ?? nonl ** )) <- comment-body |
(( (( ` g || ` G )) {{ start }} nonl ** |
|
{{ end |
|
forth-flag @ IF ." group " type cr THEN |
|
c-flag @ IF ." GROUP(" type ." , " function-number @ 0 .r ." )" cr THEN }} |
|
)) <- group-comment |
|
|
(( ` \ comment-body nl )) <- comment ( -- ) |
(( (( eval-comment || forth-comment || c-comment || else-comment || if-comment || group-comment )) ?? nonl ** )) <- comment-body |
|
|
(( {{ effect-in }} (( {{ start }} c-name {{ end 2 pick item-name 2! item-descr + }} white ** )) ** {{ effect-in-end ! }} |
(( ` \ comment-body nleof )) <- comment ( -- ) |
|
|
|
(( {{ start }} stack-ident {{ end 2 pick init-item item% %size + }} white ** )) ** |
|
<- stack-items |
|
|
|
(( {{ prim prim-effect-in }} stack-items {{ prim prim-effect-in-end ! }} |
` - ` - white ** |
` - ` - white ** |
{{ effect-out }} (( {{ start }} c-name {{ end 2 pick item-name 2! item-descr + }} white ** )) ** {{ effect-out-end ! }} |
{{ prim prim-effect-out }} stack-items {{ prim prim-effect-out-end ! }} |
)) <- stack-effect ( -- ) |
)) <- stack-effect ( -- ) |
|
|
(( {{ s" " doc 2! s" " forth-code 2! }} |
(( {{ prim create-prim }} |
(( {{ line @ name-line ! filename 2@ name-filename 2! }} |
` ( white ** {{ start }} stack-effect {{ end prim prim-stack-string 2! }} ` ) white ** |
{{ start }} name {{ end 2dup forth-name 2! c-name 2! }} white ++ |
(( {{ start }} forth-ident {{ end prim prim-wordset 2! }} white ** |
` ( white ** {{ start }} stack-effect {{ end stack-string 2! }} ` ) white ** |
(( {{ start }} c-ident {{ end prim prim-c-name 2! }} )) ?? |
{{ start }} name {{ end wordset 2! }} white ** |
)) ?? nleof |
(( {{ start }} c-name {{ end c-name 2! }} )) ?? nl |
(( ` " ` " {{ start }} (( noquote ++ ` " )) ++ {{ end 1- prim prim-doc 2! }} ` " white ** nleof )) ?? |
)) |
{{ skipsynclines off line @ c-line ! filename 2@ c-filename 2! start }} |
(( ` " ` " {{ start }} (( noquote ++ ` " )) ++ {{ end 1- doc 2! }} ` " nl )) ?? |
(( (( ` { nonl ** nleof (( (( nobracenl {{ line @ drop }} nonl ** )) ?? nleof )) ** ` } white ** nleof white ** )) |
{{ skipsynclines off line @ c-line ! filename 2@ c-filename 2! start }} (( nocolonnl nonl ** nl )) ** {{ end c-code 2! skipsynclines on }} |
|| (( nocolonnl nonl ** nleof white ** )) ** )) |
(( ` : nl |
{{ end prim prim-c-code 2! skipsynclines on }} |
{{ start }} (( nonl ++ nl )) ++ {{ end forth-code 2! }} |
(( ` : white ** nleof |
)) ?? {{ printprim }} |
{{ start }} (( nonl ++ nleof white ** )) ++ {{ end prim prim-forth-code 2! }} |
(( nl || eof )) |
)) ?? {{ process-simple }} |
|
nleof |
|
)) <- simple-primitive ( -- ) |
|
|
|
(( {{ init-combined }} |
|
` = white ** (( {{ start }} forth-ident {{ end add-prim }} white ** )) ++ |
|
nleof {{ process-combined }} |
|
)) <- combined-primitive |
|
|
|
(( {{ make-prim to prim 0 to combined |
|
line @ name-line ! filename 2@ name-filename 2! |
|
function-number @ prim prim-num ! |
|
start }} [ifdef] vmgen c-ident [else] forth-ident [then] {{ end |
|
2dup prim prim-name 2! prim prim-c-name 2! }} white ** |
|
(( ` / white ** {{ start }} c-ident {{ end prim prim-c-name 2! }} white ** )) ?? |
|
(( simple-primitive || combined-primitive )) {{ 1 function-number +! }} |
)) <- primitive ( -- ) |
)) <- primitive ( -- ) |
|
|
(( (( comment || primitive || nl )) ** eof )) |
(( (( comment || primitive || nl white ** )) ** eof )) |
parser primitives2something |
parser primitives2something |
warnings @ [IF] |
warnings @ [IF] |
.( parser generated ok ) cr |
.( parser generated ok ) cr |
[THEN] |
[THEN] |
|
|
: primfilter ( file-id xt -- ) |
|
\ fileid is for the input file, xt ( -- ) is for the output word |
|
output ! |
|
here dup rawinput ! cookedinput ! |
|
here unused rot read-file throw |
|
dup here + endrawinput ! |
|
allot |
|
align |
|
checksyncline |
|
\ begin |
|
\ getinput dup eof-char = ?EXIT emit true ?nextchar |
|
\ again ; |
|
primitives2something ; |
|
|
|
\ types |
|
|
|
struct |
|
2 cells field type-c-name |
|
cell const-field type-d-size |
|
cell const-field type-f-size |
|
cell const-field type-fetch-handler |
|
cell const-field type-store-handler |
|
constant type-description |
|
|
|
: data-stack-access ( n1 n2 n3 -- ) |
|
\ n1 is the offset of the accessed item, n2, n3 are effect-*-size |
|
drop swap - 1- dup |
|
if |
|
." sp[" 0 .r ." ]" |
|
else |
|
drop ." TOS" |
|
endif ; |
|
|
|
: fp-stack-access ( n1 n2 n3 -- ) |
|
\ n1 is the offset of the accessed item, n2, n3 are effect-*-size |
|
nip swap - 1- dup |
|
if |
|
." fp[" 0 .r ." ]" |
|
else |
|
drop ." FTOS" |
|
endif ; |
|
|
|
: fetch-single ( item -- ) |
|
>r |
|
r@ item-name 2@ type |
|
." = (" |
|
r@ item-type @ type-c-name 2@ type ." ) " |
|
r@ item-d-offset @ effect-in-size 2@ data-stack-access ." ;" cr |
|
rdrop ; |
|
|
|
: fetch-double ( item -- ) |
|
>r |
|
." FETCH_DCELL(" |
|
r@ item-name 2@ type ." , " |
|
r@ item-d-offset @ dup effect-in-size 2@ data-stack-access |
|
." , " 1+ effect-in-size 2@ data-stack-access |
|
." );" cr |
|
rdrop ; |
|
|
|
: fetch-float ( item -- ) |
|
>r |
|
r@ item-name 2@ type |
|
." = " |
|
\ ." (" r@ item-type @ type-c-name 2@ type ." ) " |
|
r@ item-f-offset @ effect-in-size 2@ fp-stack-access ." ;" cr |
|
rdrop ; |
|
|
|
: d-same-as-in? ( item -- f ) |
|
\ f is true iff the offset of item is the same as on input |
|
>r |
|
r@ item-name 2@ items @ search-wordlist 0= |
|
abort" bug" |
|
execute @ |
|
dup r@ = |
|
if \ item first appeared in output |
|
drop false |
|
else |
|
item-d-offset @ r@ item-d-offset @ = |
|
endif |
|
rdrop ; |
|
|
|
: is-in-tos? ( item -- f ) |
|
\ true if item has the same offset as the input TOS |
|
item-d-offset @ 1+ effect-in-size 2@ drop = ; |
|
|
|
: is-out-tos? ( item -- f ) |
|
\ true if item has the same offset as the input TOS |
|
item-d-offset @ 1+ effect-out-size 2@ drop = ; |
|
|
|
: really-store-single ( item -- ) |
|
>r |
|
r@ item-d-offset @ effect-out-size 2@ data-stack-access ." = (Cell)" |
|
r@ item-name 2@ type ." ;" |
|
rdrop ; |
|
|
|
: store-single ( item -- ) |
|
>r |
|
r@ d-same-as-in? |
|
if |
|
r@ is-in-tos? r@ is-out-tos? xor |
|
if |
|
." IF_TOS(" r@ really-store-single ." );" cr |
|
endif |
|
else |
|
r@ really-store-single cr |
|
endif |
|
rdrop ; |
|
|
|
: store-double ( item -- ) |
|
\ !! store optimization is not performed, because it is not yet needed |
|
>r |
|
." STORE_DCELL(" r@ item-name 2@ type ." , " |
|
r@ item-d-offset @ dup effect-out-size 2@ data-stack-access |
|
." , " 1+ effect-out-size 2@ data-stack-access |
|
." );" cr |
|
rdrop ; |
|
|
|
: f-same-as-in? ( item -- f ) |
|
\ f is true iff the offset of item is the same as on input |
|
>r |
|
r@ item-name 2@ items @ search-wordlist 0= |
|
abort" bug" |
|
execute @ |
|
dup r@ = |
|
if \ item first appeared in output |
|
drop false |
|
else |
|
item-f-offset @ r@ item-f-offset @ = |
|
endif |
|
rdrop ; |
|
|
|
: is-in-ftos? ( item -- f ) |
|
\ true if item has the same offset as the input TOS |
|
item-f-offset @ 1+ effect-in-size 2@ nip = ; |
|
|
|
: really-store-float ( item -- ) |
|
>r |
|
r@ item-f-offset @ effect-out-size 2@ fp-stack-access ." = " |
|
r@ item-name 2@ type ." ;" |
|
rdrop ; |
|
|
|
: store-float ( item -- ) |
|
>r |
|
r@ f-same-as-in? |
|
if |
|
r@ is-in-ftos? |
|
if |
|
." IF_FTOS(" r@ really-store-float ." );" cr |
|
endif |
|
else |
|
r@ really-store-float cr |
|
endif |
|
rdrop ; |
|
|
|
: single-type ( -- xt1 xt2 n1 n2 ) |
|
['] fetch-single ['] store-single 1 0 ; |
|
|
|
: double-type ( -- xt1 xt2 n1 n2 ) |
|
['] fetch-double ['] store-double 2 0 ; |
|
|
|
: float-type ( -- xt1 xt2 n1 n2 ) |
|
['] fetch-float ['] store-float 0 1 ; |
|
|
|
: s, ( addr u -- ) |
|
\ allocate a string |
|
here swap dup allot move ; |
|
|
|
: starts-with ( addr u xt1 xt2 n1 n2 "prefix" -- ) |
|
\ describes a type |
|
\ addr u specifies the C type name |
|
\ n1 is the size of the type on the data stack |
|
\ n2 is the size of the type on the FP stack |
|
\ stack effect entries of the type start with prefix |
|
>r >r >r >r |
|
dup >r here >r s, |
|
create |
|
r> r> 2, |
|
r> r> r> , r> , swap , , ; |
|
|
|
wordlist constant types |
|
get-current |
|
types set-current |
|
|
|
s" Bool" single-type starts-with f |
|
s" Char" single-type starts-with c |
|
s" Cell" single-type starts-with n |
|
s" Cell" single-type starts-with w |
|
s" UCell" single-type starts-with u |
|
s" DCell" double-type starts-with d |
|
s" UDCell" double-type starts-with ud |
|
s" Float" float-type starts-with r |
|
s" Cell *" single-type starts-with a_ |
|
s" Char *" single-type starts-with c_ |
|
s" Float *" single-type starts-with f_ |
|
s" DFloat *" single-type starts-with df_ |
|
s" SFloat *" single-type starts-with sf_ |
|
s" Xt" single-type starts-with xt |
|
s" WID" single-type starts-with wid |
|
s" struct F83Name *" single-type starts-with f83name |
|
|
|
set-current |
|
|
|
: get-type ( addr1 u1 -- type-descr ) |
|
\ get the type of the name in addr1 u1 |
|
\ type-descr is a pointer to a type-descriptor |
|
0 swap ?do |
|
dup i types search-wordlist |
|
if \ ok, we have the type ( addr1 xt ) |
|
execute nip |
|
UNLOOP EXIT |
|
endif |
|
-1 s+loop |
|
\ we did not find a type, abort |
|
true abort" unknown type prefix" ; |
|
|
|
: declare ( addr "name" -- ) |
|
\ remember that there is a stack item at addr called name |
|
create , ; |
|
|
|
: declaration ( item -- ) |
|
dup item-name 2@ items @ search-wordlist |
|
if \ already declared ( item xt ) |
|
execute @ item-type @ swap item-type ! |
|
else ( addr ) |
|
dup item-name 2@ nextname dup declare ( addr ) |
|
dup >r item-name 2@ 2dup get-type ( addr1 u type-descr ) |
|
dup r> item-type ! ( addr1 u type-descr ) |
|
type-c-name 2@ type space type ." ;" cr |
|
endif ; |
|
|
|
: declaration-list ( addr1 addr2 -- ) |
|
swap ?do |
|
i declaration |
|
item-descr +loop ; |
|
|
|
: fetch ( addr -- ) |
|
dup item-type @ type-fetch-handler execute ; |
|
|
|
: declarations ( -- ) |
|
wordlist dup items ! set-current |
|
effect-in effect-in-end @ declaration-list |
|
effect-out effect-out-end @ declaration-list ; |
|
|
|
\ offset computation |
|
\ the leftmost (i.e. deepest) item has offset 0 |
|
\ the rightmost item has the highest offset |
|
|
|
: compute-offset ( n1 n2 item -- n3 n4 ) |
|
\ n1, n3 are data-stack-offsets |
|
\ n2, n4 are the fp-stack-offsets |
|
>r |
|
swap dup r@ item-d-offset ! |
|
r@ item-type @ type-d-size + |
|
swap dup r@ item-f-offset ! |
|
r@ item-type @ type-f-size + |
|
rdrop ; |
|
|
|
: compute-list ( addr1 addr2 -- n1 n2 ) |
|
\ n1, n2 are the final offsets |
|
0 0 2swap swap ?do |
|
i compute-offset |
|
item-descr +loop ; |
|
|
|
: compute-offsets ( -- ) |
\ run with gforth-0.5.0 (slurp-file is missing) |
effect-in effect-in-end @ compute-list effect-in-size 2! |
[IFUNDEF] slurp-file |
effect-out effect-out-end @ compute-list effect-out-size 2! ; |
: slurp-file ( c-addr1 u1 -- c-addr2 u2 ) |
|
\ c-addr1 u1 is the filename, c-addr2 u2 is the file's contents |
: flush-tos ( -- ) |
r/o bin open-file throw >r |
effect-in-size 2@ effect-out-size 2@ |
r@ file-size throw abort" file too large" |
0<> rot 0= and |
dup allocate throw swap |
if |
2dup r@ read-file throw over <> abort" could not read whole file" |
." IF_FTOS(fp[0] = FTOS);" cr |
r> close-file throw ; |
endif |
|
0<> swap 0= and |
|
if |
|
." IF_TOS(sp[0] = TOS);" cr |
|
endif ; |
|
|
|
: fill-tos ( -- ) |
|
effect-in-size 2@ effect-out-size 2@ |
|
0= rot 0<> and |
|
if |
|
." IF_FTOS(FTOS = fp[0]);" cr |
|
endif |
|
0= swap 0<> and |
|
if |
|
." IF_TOS(TOS = sp[0]);" cr |
|
endif ; |
|
|
|
: fetches ( -- ) |
|
effect-in-end @ effect-in ?do |
|
i fetch |
|
item-descr +loop ; |
|
|
|
: stack-pointer-updates ( -- ) |
|
\ we need not check if an update is a noop; gcc does this for us |
|
effect-in-size 2@ |
|
effect-out-size 2@ |
|
rot swap - ( d-in d-out f-diff ) |
|
rot rot - ( f-diff d-diff ) |
|
?dup IF ." sp += " 0 .r ." ;" cr THEN |
|
?dup IF ." fp += " 0 .r ." ;" cr THEN ; |
|
|
|
: store ( item -- ) |
|
\ f is true if the item should be stored |
|
\ f is false if the store is probably not necessary |
|
dup item-type @ type-store-handler execute ; |
|
|
|
: stores ( -- ) |
|
effect-out-end @ effect-out ?do |
|
i store |
|
item-descr +loop ; |
|
|
|
: .stack-list ( start end -- ) |
|
swap ?do |
|
i item-name 2@ type space |
|
item-descr +loop ; |
|
|
|
: output-c ( -- ) |
|
." I_" c-name 2@ type ." : /* " forth-name 2@ type ." ( " stack-string 2@ type ." ) */" cr |
|
." /* " doc 2@ type ." */" cr |
|
." NAME(" [char] " emit forth-name 2@ type [char] " emit ." )" cr \ debugging |
|
." {" cr |
|
." DEF_CA" cr |
|
declarations |
|
compute-offsets \ for everything else |
|
." NEXT_P0;" cr |
|
flush-tos |
|
fetches |
|
stack-pointer-updates |
|
." {" cr |
|
." #line " c-line @ . [char] " emit c-filename 2@ type [char] " emit cr |
|
c-code 2@ type |
|
." }" cr |
|
." NEXT_P1;" cr |
|
stores |
|
fill-tos |
|
." NEXT_P2;" cr |
|
." }" cr |
|
cr |
|
; |
|
|
|
: dstack-used? |
|
effect-in-size 2@ drop |
|
effect-out-size 2@ drop max 0<> ; |
|
|
|
: fstack-used? |
|
effect-in-size 2@ nip |
|
effect-out-size 2@ nip max 0<> ; |
|
|
|
: output-funclabel ( -- ) |
|
1 function-number +! |
|
." &I_" c-name 2@ type ." ," cr ; |
|
|
|
: output-forthname ( -- ) |
|
1 function-number +! |
|
'" emit forth-name 2@ type '" emit ." ," cr ; |
|
|
|
: output-c-func ( -- ) |
|
\ used for word libraries |
|
1 function-number +! |
|
." Cell * I_" c-name 2@ type ." (Cell *SP, Cell **FP) /* " forth-name 2@ type |
|
." ( " stack-string 2@ type ." ) */" cr |
|
." /* " doc 2@ type ." */" cr |
|
." NAME(" [char] " emit forth-name 2@ type [char] " emit ." )" cr |
|
\ debugging |
|
." {" cr |
|
declarations |
|
compute-offsets \ for everything else |
|
dstack-used? IF ." Cell *sp=SP;" cr THEN |
|
fstack-used? IF ." Cell *fp=*FP;" cr THEN |
|
flush-tos |
|
fetches |
|
stack-pointer-updates |
|
fstack-used? IF ." *FP=fp;" cr THEN |
|
." {" cr |
|
." #line " c-line @ . [char] " emit c-filename 2@ type [char] " emit cr |
|
c-code 2@ type |
|
." }" cr |
|
stores |
|
fill-tos |
|
." return (sp);" cr |
|
." }" cr |
|
cr ; |
|
|
|
: output-label ( -- ) |
|
." (Label)&&I_" c-name 2@ type ." ," cr |
|
-1 primitive-number +! ; |
|
|
|
: output-alias ( -- ) |
|
( primitive-number @ . ." alias " ) ." Primitive " forth-name 2@ type cr |
|
-1 primitive-number +! ; |
|
|
|
: output-forth ( -- ) |
|
forth-code @ 0= |
|
IF \ output-alias |
|
\ this is bad for ec: an alias is compiled if tho word does not exist! |
|
\ JAW |
|
ELSE ." : " forth-name 2@ type ." ( " |
|
effect-in effect-in-end @ .stack-list ." -- " |
|
effect-out effect-out-end @ .stack-list ." )" cr |
|
forth-code 2@ type cr |
|
-1 primitive-number +! |
|
THEN ; |
|
|
|
: output-tag-file ( -- ) |
|
name-filename 2@ last-name-filename 2@ compare if |
|
name-filename 2@ last-name-filename 2! |
|
#ff emit cr |
|
name-filename 2@ type |
|
." ,0" cr |
|
endif ; |
|
|
|
: output-tag ( -- ) |
|
output-tag-file |
|
forth-name 2@ 1+ type |
|
127 emit |
|
space forth-name 2@ type space |
|
1 emit |
|
name-line @ 0 .r |
|
." ,0" cr ; |
|
|
|
[IFDEF] documentation |
|
: register-doc ( -- ) |
|
get-current documentation set-current |
|
forth-name 2@ nextname create |
|
forth-name 2@ 2, |
|
stack-string 2@ condition-stack-effect 2, |
|
wordset 2@ 2, |
|
c-name 2@ condition-pronounciation 2, |
|
doc 2@ 2, |
|
set-current ; |
|
[THEN] |
[THEN] |
|
|
: process-file ( addr u xt -- ) |
: primfilter ( addr u -- ) |
>r |
\ process the string at addr u |
2dup filename 2! |
over dup rawinput ! dup line-start ! cookedinput ! |
0 function-number ! |
+ endrawinput ! |
r/o open-file abort" cannot open file" |
checksyncline |
|
primitives2something ; |
|
|
|
: process-file ( addr u xt-simple x-combined -- ) |
|
output-combined ! output ! |
|
save-mem 2dup filename 2! |
|
slurp-file |
warnings @ if |
warnings @ if |
." ------------ CUT HERE -------------" cr endif |
." ------------ CUT HERE -------------" cr endif |
r> primfilter ; |
primfilter ; |
|
|
: process ( xt -- ) |
\ : process ( xt -- ) |
bl word count rot |
\ bl word count rot |
process-file ; |
\ process-file ; |