version 1.156, 2005/07/27 19:44:20
|
version 1.174, 2011/11/13 00:45:20
|
Line 1
|
Line 1
|
\ converts primitives to, e.g., C code |
\ converts primitives to, e.g., C code |
|
|
\ Copyright (C) 1995,1996,1997,1998,2000,2003,2004 Free Software Foundation, Inc. |
\ Copyright (C) 1995,1996,1997,1998,2000,2003,2004,2005,2006,2007,2009,2010 Free Software Foundation, Inc. |
|
|
\ This file is part of Gforth. |
\ This file is part of Gforth. |
|
|
\ Gforth is free software; you can redistribute it and/or |
\ Gforth is free software; you can redistribute it and/or |
\ modify it under the terms of the GNU General Public License |
\ modify it under the terms of the GNU General Public License |
\ as published by the Free Software Foundation; either version 2 |
\ as published by the Free Software Foundation, either version 3 |
\ of the License, or (at your option) any later version. |
\ of the License, or (at your option) any later version. |
|
|
\ This program is distributed in the hope that it will be useful, |
\ This program is distributed in the hope that it will be useful, |
Line 15
|
Line 15
|
\ GNU General Public License for more details. |
\ GNU General Public License for more details. |
|
|
\ 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, see http://www.gnu.org/licenses/. |
\ 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). |
Line 51
|
Line 50
|
\ (stack-in-index-xt and a test for stack==instruction-stream); there |
\ (stack-in-index-xt and a test for stack==instruction-stream); there |
\ should be only one. |
\ should be only one. |
|
|
|
|
\ for backwards compatibility, jaw |
\ for backwards compatibility, jaw |
require compat/strcomp.fs |
require compat/strcomp.fs |
|
|
|
[undefined] outfile-execute [if] |
|
: outfile-execute ( ... xt file-id -- ... ) |
|
\ unsafe replacement |
|
outfile-id >r to outfile-id execute r> to outfile-id ; |
|
[then] |
|
|
warnings off |
warnings off |
|
|
\ redefinitions of kernel words not present in gforth-0.6.1 |
\ redefinitions of kernel words not present in gforth-0.6.1 |
Line 102 variable include-skipped-insts
|
Line 108 variable include-skipped-insts
|
\ inline arguments (false) |
\ inline arguments (false) |
include-skipped-insts off |
include-skipped-insts off |
|
|
|
2variable threaded-code-pointer-type \ type used for geninst etc. |
|
s" Inst **" threaded-code-pointer-type 2! |
|
|
variable immarg \ values for immediate arguments (to be used in IMM_ARG macros) |
variable immarg \ values for immediate arguments (to be used in IMM_ARG macros) |
$12340000 immarg ! |
$12340000 immarg ! |
|
|
Line 134 $12340000 immarg !
|
Line 143 $12340000 immarg !
|
over - type cr |
over - type cr |
line-start @ rawinput @ over - typewhite ." ^" cr ; |
line-start @ rawinput @ over - typewhite ." ^" cr ; |
|
|
|
: print-error { addr u -- } |
|
filename 2@ type ." :" line @ 0 .r ." : " addr u type cr |
|
print-error-line ; |
|
|
: ?print-error { f addr u -- } |
: ?print-error { f addr u -- } |
f ?not? if |
f ?not? if |
outfile-id >r try |
addr u ['] print-error stderr outfile-execute |
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 |
1 (bye) \ abort |
endif ; |
endif ; |
|
|
Line 201 struct%
|
Line 208 struct%
|
end-struct ss% \ stack-state |
end-struct ss% \ stack-state |
|
|
struct% |
struct% |
|
cell% field state-enabled |
cell% field state-number |
cell% field state-number |
cell% max-stacks * field state-sss |
cell% max-stacks * field state-sss |
end-struct state% |
end-struct state% |
Line 231 variable next-state-number 0 next-state-
|
Line 239 variable next-state-number 0 next-state-
|
rdrop ; |
rdrop ; |
|
|
: map-stacks { xt -- } |
: map-stacks { xt -- } |
\ perform xt for all stacks |
\ perform xt ( stack -- ) for all stacks |
next-stack-number @ 0 +do |
next-stack-number @ 0 +do |
stacks i th @ xt execute |
stacks i th @ xt execute |
loop ; |
loop ; |
|
|
: map-stacks1 { xt -- } |
: map-stacks1 { xt -- } |
\ perform xt for all stacks except inst-stream |
\ perform xt ( stack -- ) for all stacks except inst-stream |
next-stack-number @ 1 +do |
next-stack-number @ 1 +do |
stacks i th @ xt execute |
stacks i th @ xt execute |
loop ; |
loop ; |
Line 351 wordlist constant primitives
|
Line 359 wordlist constant primitives
|
\ address of number of stack items in effect out |
\ address of number of stack items in effect out |
stack-number @ cells prim prim-stacks-out + ; |
stack-number @ cells prim prim-stacks-out + ; |
|
|
|
: stack-prim-stacks-sync ( stack -- addr ) |
|
prim prim-stacks-sync swap stack-number @ th ; |
|
|
\ global vars |
\ global vars |
variable c-line |
variable c-line |
2variable c-filename |
2variable c-filename |
Line 359 variable name-line
|
Line 370 variable name-line
|
2variable last-name-filename |
2variable last-name-filename |
Variable function-number 0 function-number ! |
Variable function-number 0 function-number ! |
Variable function-old 0 function-old ! |
Variable function-old 0 function-old ! |
: function-diff ( n -- ) |
: function-diff ( -- ) |
." GROUPADD(" function-number @ function-old @ - 0 .r ." )" cr |
." GROUPADD(" function-number @ function-old @ - 0 .r ." )" cr |
function-number @ function-old ! ; |
function-number @ function-old ! ; |
: forth-fdiff ( -- ) |
: forth-fdiff ( -- ) |
Line 497 defer inst-stream-f ( -- stack )
|
Line 508 defer inst-stream-f ( -- stack )
|
." vm_two" |
." vm_two" |
r@ item-stack-type-name type ." 2" |
r@ item-stack-type-name type ." 2" |
r@ item-type @ print-type-prefix ." (" |
r@ item-type @ print-type-prefix ." (" |
r@ item-in-index r@ item-stack @ 2dup ." (Cell)" stack-read |
r@ item-in-index r@ item-stack @ 2dup stack-read |
." , " -1 under+ ." (Cell)" stack-read |
." , " -1 under+ stack-read |
." , " r@ item-name 2@ type |
." , " r@ item-name 2@ type |
." )" cr |
." )" cr |
rdrop ; |
rdrop ; |
|
|
: same-as-in? ( item -- f ) |
: same-as-in? ( item -- f ) |
\ f is true iff the offset and stack of item is the same as on input |
\ f is true iff the offset and stack of item is the same as on input |
>r |
>r |
r@ item-first @ if |
r@ item-stack @ stack-prim-stacks-sync @ if |
rdrop false exit |
rdrop false exit |
endif |
endif |
r@ item-name 2@ prim prim-items-wordlist @ search-wordlist 0= abort" bug" |
r@ item-first @ if |
execute @ |
rdrop false exit |
dup r@ = |
endif |
if \ item first appeared in output |
r@ item-name 2@ prim prim-items-wordlist @ search-wordlist 0= abort" bug" |
drop false |
execute @ |
else |
dup r@ = |
dup item-stack @ r@ item-stack @ = |
if \ item first appeared in output |
swap item-offset @ r@ item-offset @ = and |
drop false |
endif |
else |
rdrop ; |
dup item-stack @ r@ item-stack @ = |
|
swap item-offset @ r@ item-offset @ = and |
|
endif |
|
rdrop ; |
|
|
: item-out-index ( item -- n ) |
: item-out-index ( item -- n ) |
\ n is the index of item (in the out-effect) |
\ n is the index of item (in the out-effect) |
Line 616 does> ( item -- )
|
Line 630 does> ( item -- )
|
UNLOOP EXIT |
UNLOOP EXIT |
endif |
endif |
-1 s+loop |
-1 s+loop |
\ we did not find a type, abort |
\ we did not find a type, abort |
|
abort |
false s" unknown prefix" ?print-error ; |
false s" unknown prefix" ?print-error ; |
|
|
: declaration ( item -- ) |
: declaration ( item -- ) |
Line 650 does> ( item -- )
|
Line 665 does> ( item -- )
|
stack item item-stack ! |
stack item item-stack ! |
item declaration ; |
item declaration ; |
|
|
|
: set-prim-stacks-sync ( stack -- ) |
|
stack-prim-stacks-sync on ; |
|
|
|
: clear-prim-stacks-sync ( stack -- ) |
|
stack-prim-stacks-sync off ; |
|
|
|
|
get-current prefixes set-current |
get-current prefixes set-current |
: ... ( item -- ) |
: ... ( item -- ) |
\ this "prefix" ensures that the appropriate stack is synced with memory |
\ this "prefix" ensures that the appropriate stack is synced with memory |
dup item-name 2@ s" ..." str= 0= abort" '...' must end the item name" |
dup item-name 2@ s" ..." str= 0= abort" '...' must end the item name" |
item-stack @ dup if |
item-stack @ dup if |
stack-number @ prim prim-stacks-sync swap th on |
set-prim-stacks-sync |
else \ prefixless "..." syncs all stacks |
else \ prefixless "..." syncs all stacks |
max-stacks 0 +do |
drop ['] set-prim-stacks-sync map-stacks1 |
prim prim-stacks-sync i th on |
|
loop |
|
endif ; |
endif ; |
set-current |
set-current |
|
|
create ...-item ( -- addr ) \ just used for letting stack-prefixes work on it |
create ...-item ( -- addr ) \ just used for letting stack-prefixes work on it |
item% %allot \ stores the stack temporarily until used by ... |
item% %allot drop \ stores the stack temporarily until used by ... |
|
|
: init-item1 ( addr1 addr u -- addr2 ) |
: init-item1 ( addr1 addr u -- addr2 ) |
\ initialize item at addr1 with name addr u, next item is at addr2 |
\ initialize item at addr1 with name addr u, next item is at addr2 |
Line 739 stack inst-stream IP Cell
|
Line 759 stack inst-stream IP Cell
|
: state ( "name" -- ) |
: state ( "name" -- ) |
\ create a state initialized with default-sss |
\ create a state initialized with default-sss |
create state% %allot { s } |
create state% %allot { s } |
|
s state-enabled on |
next-state-number @ s state-number ! 1 next-state-number +! |
next-state-number @ s state-number ! 1 next-state-number +! |
max-stacks 0 ?do |
max-stacks 0 ?do |
default-ss s state-sss i th ! |
default-ss s state-sss i th ! |
loop ; |
loop ; |
|
|
|
: state-disable ( state -- ) |
|
state-enabled off ; |
|
|
|
: state-enabled? ( state -- f ) |
|
state-enabled @ ; |
|
|
: .state ( state -- ) |
: .state ( state -- ) |
0 >body - >name .name ; |
0 >body - >name .name ; |
|
|
Line 775 stack inst-stream IP Cell
|
Line 802 stack inst-stream IP Cell
|
|
|
: init-simple { prim -- } |
: init-simple { prim -- } |
\ much of the initialization is elsewhere |
\ much of the initialization is elsewhere |
max-stacks 0 +do |
['] clear-prim-stacks-sync map-stacks ; |
prim prim-stacks-sync i th off |
|
loop ; |
|
|
|
: process-simple ( -- ) |
: process-simple ( -- ) |
prim init-simple |
|
prim prim { W^ key } key cell |
prim prim { W^ key } key cell |
combinations ['] constant insert-wordlist |
combinations ['] constant insert-wordlist |
declarations compute-offsets |
declarations compute-offsets |
Line 795 stack inst-stream IP Cell
|
Line 819 stack inst-stream IP Cell
|
stack state-in stack-state-items stack stack-in @ - 0 max |
stack state-in stack-state-items stack stack-in @ - 0 max |
stack state-out stack-state-items stack stack-out @ - 0 max ; |
stack state-out stack-state-items stack stack-out @ - 0 max ; |
|
|
|
: spill-stack-items { stack -- u } |
|
\ there are u items to spill in stack |
|
stack unused-stack-items |
|
stack stack-prim-stacks-sync @ if |
|
drop 0 |
|
endif |
|
swap - ; |
|
|
: spill-stack { stack -- } |
: spill-stack { stack -- } |
\ spill regs of state-in that are not used by prim and are not in state-out |
\ spill regs of state-in that are not used by prim and are not in state-out |
stack state-in stack-offset { offset } |
stack state-in stack-offset { offset } |
stack state-in stack-state-items ( items ) |
stack state-in stack-state-items ( items ) |
dup stack unused-stack-items - - +do |
dup stack spill-stack-items + +do |
\ loop through the bottom items |
\ loop through the bottom items |
stack stack-pointer 2@ type |
stack stack-pointer 2@ type |
i offset - stack normal-stack-access0 ." = " |
i offset - stack normal-stack-access0 ." = " |
Line 809 stack inst-stream IP Cell
|
Line 841 stack inst-stream IP Cell
|
: spill-state ( -- ) |
: spill-state ( -- ) |
['] spill-stack map-stacks1 ; |
['] spill-stack map-stacks1 ; |
|
|
|
: fill-stack-items { stack -- u } |
|
\ there are u items to fill in stack |
|
stack unused-stack-items |
|
stack stack-prim-stacks-sync @ if |
|
swap drop 0 swap |
|
endif |
|
- ; |
|
|
: fill-stack { stack -- } |
: fill-stack { stack -- } |
stack state-out stack-offset { offset } |
stack state-out stack-offset { offset } |
stack state-out stack-state-items ( items ) |
stack state-out stack-state-items ( items ) |
dup stack unused-stack-items - + +do |
dup stack fill-stack-items + +do |
\ loop through the bottom items |
\ loop through the bottom items |
i stack state-out normal-stack-access1 ." = " |
i stack state-out normal-stack-access1 ." = " |
stack stack-pointer 2@ type |
stack stack-pointer 2@ type |
Line 868 stack inst-stream IP Cell
|
Line 908 stack inst-stream IP Cell
|
stack-access-transform @ dup >r execute |
stack-access-transform @ dup >r execute |
0 r> execute - ; |
0 r> execute - ; |
|
|
: stack-pointer-update { stack -- } |
: update-stack-pointer { stack n -- } |
\ and moves |
n if \ this check is not necessary, gcc would do this for us |
\ stacks grow downwards |
|
stack stack-diff ( in-out ) |
|
stack state-in stack-offset - |
|
stack state-out stack-offset + ( [in-in_offset]-[out-out_offset] ) |
|
?dup-if \ this check is not necessary, gcc would do this for us |
|
stack inst-stream = if |
stack inst-stream = if |
." INC_IP(" 0 .r ." );" cr |
." INC_IP(" n 0 .r ." );" cr |
else |
else |
stack stack-pointer 2@ type ." += " |
stack stack-pointer 2@ type ." += " |
stack stack-update-transform 0 .r ." ;" cr |
n stack stack-update-transform 0 .r ." ;" cr |
endif |
endif |
endif |
endif ; |
stack stack-moves ; |
|
|
: stack-pointer-update { stack -- } |
|
\ and moves |
|
\ stacks grow downwards |
|
\ ." /* stack pointer update " stack stack-pointer 2@ type ." */" cr |
|
stack stack-prim-stacks-sync @ if |
|
\ ." /* synced " stack stack-in ? stack stack-out ? stack state-in stack-offset . ." */" cr |
|
stack stack-in @ |
|
stack state-in stack-offset - |
|
stack swap update-stack-pointer |
|
else |
|
\ ." /* unsynced " stack stack-in ? stack stack-out ? ." */" cr |
|
stack stack-diff ( in-out ) |
|
stack state-in stack-offset - |
|
stack state-out stack-offset + ( [in-in_offset]-[out-out_offset] ) |
|
stack swap update-stack-pointer |
|
stack stack-moves |
|
endif ; |
|
|
: stack-pointer-updates ( -- ) |
: stack-pointer-updates ( -- ) |
['] stack-pointer-update map-stacks ; |
['] stack-pointer-update map-stacks ; |
|
|
|
: stack-pointer-update2 { stack -- } |
|
\ ." /* stack pointer update2 " stack stack-pointer 2@ type ." */" cr |
|
stack stack-prim-stacks-sync @ if |
|
stack state-out stack-offset |
|
stack stack-out @ - |
|
stack swap update-stack-pointer |
|
endif ; |
|
|
|
: stack-pointer-updates2 ( -- ) |
|
\ update stack pointers after C code, where necessary |
|
['] stack-pointer-update2 map-stacks ; |
|
|
: store ( item -- ) |
: store ( item -- ) |
\ f is true if the item should be stored |
\ f is true if the item should be stored |
\ f is false if the store is probably not necessary |
\ f is false if the store is probably not necessary |
Line 957 variable tail-nextp2 \ xt to execute for
|
Line 1021 variable tail-nextp2 \ xt to execute for
|
output-super-end |
output-super-end |
print-debug-results |
print-debug-results |
output-nextp1 |
output-nextp1 |
|
stack-pointer-updates2 |
stores |
stores |
fill-state |
fill-state |
xt execute ; |
xt execute ; |
Line 992 variable tail-nextp2 \ xt to execute for
|
Line 1057 variable tail-nextp2 \ xt to execute for
|
tail-nextp2 @ output-c-tail1-no-stores ; |
tail-nextp2 @ output-c-tail1-no-stores ; |
|
|
: output-c-tail2-no-stores ( -- ) |
: output-c-tail2-no-stores ( -- ) |
|
prim prim-c-code 2@ s" VM_JUMP(" search nip nip abort" Currently VM_JUMP is not supported in static superinstructions" |
['] output-label2 output-c-tail1-no-stores ; |
['] output-label2 output-c-tail1-no-stores ; |
|
|
: type-c-code ( c-addr u xt -- ) |
: type-c-code ( c-addr u xt -- ) |
Line 1020 variable tail-nextp2 \ xt to execute for
|
Line 1086 variable tail-nextp2 \ xt to execute for
|
bounds ?DO I c@ dup '* = IF drop 'x THEN emit LOOP |
bounds ?DO I c@ dup '* = IF drop 'x THEN emit LOOP |
ELSE type THEN ; |
ELSE type THEN ; |
|
|
: output-c ( -- ) |
: output-c ( -- ) |
print-entry ." /* " prim prim-name 2@ prim-type |
print-entry ." /* " prim prim-name 2@ prim-type |
." ( " prim prim-stack-string 2@ type ." ) " |
." ( " prim prim-stack-string 2@ type ." ) " |
state-in .state ." -- " state-out .state ." */" cr |
state-in .state ." -- " state-out .state ." */" cr |
Line 1123 variable tail-nextp2 \ xt to execute for
|
Line 1189 variable tail-nextp2 \ xt to execute for
|
|
|
: output-gen ( -- ) |
: output-gen ( -- ) |
\ generate C code for generating VM instructions |
\ generate C code for generating VM instructions |
." void gen_" prim prim-c-name 2@ type ." (Inst **ctp" gen-args-parm ." )" cr |
." void gen_" prim prim-c-name 2@ type ." (" |
|
threaded-code-pointer-type 2@ type ." ctp" gen-args-parm ." )" cr |
." {" cr |
." {" cr |
." gen_inst(ctp, vm_prim[" function-number @ 0 .r ." ]);" cr |
." gen_inst(ctp, " function-number @ 0 .r ." );" cr |
gen-args-gen |
gen-args-gen |
." }" cr ; |
." }" cr ; |
|
|
Line 1286 is output-c-prim-num
|
Line 1353 is output-c-prim-num
|
\ NEXT_P2; |
\ NEXT_P2; |
|
|
: init-combined ( -- ) |
: init-combined ( -- ) |
|
['] clear-prim-stacks-sync map-stacks |
prim to combined |
prim to combined |
0 num-combined ! |
0 num-combined ! |
current-depth max-stacks cells erase |
current-depth max-stacks cells erase |
Line 1411 variable reprocessed-num 0 reprocessed-n
|
Line 1479 variable reprocessed-num 0 reprocessed-n
|
|
|
: state-prim1 { in-state out-state prim -- } |
: state-prim1 { in-state out-state prim -- } |
in-state out-state state-default dup d= ?EXIT |
in-state out-state state-default dup d= ?EXIT |
|
in-state state-enabled? out-state state-enabled? and 0= ?EXIT |
in-state to state-in |
in-state to state-in |
out-state to state-out |
out-state to state-out |
prim reprocess-simple ; |
prim reprocess-simple ; |
Line 1429 variable reprocessed-num 0 reprocessed-n
|
Line 1498 variable reprocessed-num 0 reprocessed-n
|
: compute-default-state-out ( n-in -- n-out ) |
: compute-default-state-out ( n-in -- n-out ) |
\ for the current prim |
\ for the current prim |
cache-stack stack-in @ - 0 max |
cache-stack stack-in @ - 0 max |
|
cache-stack stack-prim-stacks-sync @ if |
|
drop 0 |
|
endif |
cache-stack stack-out @ + cache-states 2@ nip 1- min ; |
cache-stack stack-out @ + cache-states 2@ nip 1- min ; |
|
|
: gen-prim-states ( prim -- ) |
: gen-prim-states ( prim -- ) |
Line 1489 variable reprocessed-num 0 reprocessed-n
|
Line 1561 variable reprocessed-num 0 reprocessed-n
|
stores ; |
stores ; |
|
|
: output-combined-tail ( -- ) |
: output-combined-tail ( -- ) |
part-output-c-tail |
|
in-part @ >r in-part off |
in-part @ >r in-part off |
|
part-output-c-tail |
combined ['] output-c-tail-no-stores prim-context |
combined ['] output-c-tail-no-stores prim-context |
r> in-part ! ; |
r> in-part ! ; |
|
|
Line 1755 nl-char singleton eof-char over add-memb
|
Line 1827 nl-char singleton eof-char over add-memb
|
(( letter (( letter || digit )) ** |
(( letter (( letter || digit )) ** |
)) <- c-ident ( -- ) |
)) <- c-ident ( -- ) |
|
|
(( ` # ?? (( letter || digit || ` : )) ++ (( ` . ` . ` . )) ?? |
(( ` . ` . ` . |
|
)) <- sync-stack ( -- ) |
|
|
|
(( ` # ?? (( letter || digit || ` : )) ++ sync-stack ?? |
|
|| sync-stack |
)) <- stack-ident ( -- ) |
)) <- stack-ident ( -- ) |
|
|
(( nowhitebq nowhite ** )) |
(( nowhitebq nowhite ** )) |
Line 1784 Variable c-flag
|
Line 1860 Variable c-flag
|
)) <- else-comment |
)) <- else-comment |
|
|
(( ` + {{ start }} nonl ** {{ end |
(( ` + {{ start }} nonl ** {{ end |
dup |
dup |
IF c-flag @ |
IF |
IF |
c-flag @ IF |
function-diff |
function-diff |
." #ifdef HAS_" bounds ?DO I c@ toupper emit LOOP cr |
." #ifdef HAS_" 2dup bounds ?DO I c@ toupper emit LOOP cr |
THEN |
THEN |
forth-flag @ |
forth-flag @ IF |
IF forth-fdiff ." has? " type ." [IF]" cr THEN |
forth-fdiff ." has? " 2dup type ." [IF]" cr |
ELSE 2drop |
THEN |
|
2drop |
|
ELSE |
|
2drop |
c-flag @ IF |
c-flag @ IF |
function-diff ." #endif" cr THEN |
function-diff ." #endif" cr THEN |
forth-flag @ IF forth-fdiff ." [THEN]" cr THEN |
forth-flag @ IF forth-fdiff ." [THEN]" cr THEN |
Line 1801 Variable c-flag
|
Line 1880 Variable c-flag
|
|
|
(( (( ` g || ` G )) {{ start }} nonl ** |
(( (( ` g || ` G )) {{ start }} nonl ** |
{{ end |
{{ end |
forth-flag @ IF forth-fdiff ." group " type cr THEN |
forth-flag @ IF forth-fdiff ." group " 2dup type cr THEN |
c-flag @ IF function-diff |
c-flag @ IF function-diff |
." GROUP(" type ." , " function-number @ 0 .r ." )" cr THEN }} |
." GROUP(" 2dup type ." , " function-number @ 0 .r ." )" cr THEN |
|
2drop }} |
)) <- group-comment |
)) <- group-comment |
|
|
(( (( eval-comment || forth-comment || c-comment || else-comment || if-comment || group-comment )) ?? nonl ** )) <- comment-body |
(( (( eval-comment || forth-comment || c-comment || else-comment || if-comment || group-comment )) ?? nonl ** )) <- comment-body |
Line 1818 Variable c-flag
|
Line 1898 Variable c-flag
|
{{ prim prim-effect-out }} stack-items {{ prim prim-effect-out-end ! }} |
{{ prim prim-effect-out }} stack-items {{ prim prim-effect-out-end ! }} |
)) <- stack-effect ( -- ) |
)) <- stack-effect ( -- ) |
|
|
(( {{ prim create-prim }} |
(( {{ prim create-prim prim init-simple }} |
` ( white ** {{ start }} stack-effect {{ end prim prim-stack-string 2! }} ` ) white ** |
` ( white ** {{ start }} stack-effect {{ end prim prim-stack-string 2! }} ` ) white ** |
(( {{ start }} forth-ident {{ end prim prim-wordset 2! }} white ** |
(( {{ start }} forth-ident {{ end prim prim-wordset 2! }} white ** |
(( {{ start }} c-ident {{ end 2dup prim-c-name-2! }} )) ?? |
(( {{ start }} c-ident {{ end prim-c-name-2! }} )) ?? |
)) ?? nleof |
)) ?? nleof |
(( ` " ` " {{ start }} (( noquote ++ ` " )) ++ {{ end 1- prim prim-doc 2! }} ` " white ** nleof )) ?? |
(( ` " ` " {{ start }} (( noquote ++ ` " )) ++ {{ end 1- prim prim-doc 2! }} ` " white ** nleof )) ?? |
{{ skipsynclines off line @ c-line ! filename 2@ c-filename 2! start }} |
{{ skipsynclines off line @ c-line ! filename 2@ c-filename 2! start }} |