version 1.113, 2002/09/14 08:20:19
|
version 1.140, 2003/08/04 20:32:35
|
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 Free Software Foundation, Inc. |
\ Copyright (C) 1995,1996,1997,1998,2000,2003 Free Software Foundation, Inc. |
|
|
\ This file is part of Gforth. |
\ This file is part of Gforth. |
|
|
Line 51
|
Line 51
|
\ (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 |
|
require compat/strcomp.fs |
|
|
warnings off |
warnings off |
|
|
|
\ redefinitions of kernel words not present in gforth-0.6.1 |
|
: latestxt lastcfa @ ; |
|
: latest last @ ; |
|
|
[IFUNDEF] try |
[IFUNDEF] try |
include startup.fs |
include startup.fs |
[THEN] |
[THEN] |
Line 63 warnings off
|
Line 70 warnings off
|
\ warnings on |
\ warnings on |
|
|
include ./gray.fs |
include ./gray.fs |
32 constant max-effect \ number of things on one side of a stack effect |
128 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). |
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 |
Line 89 variable out-nls \ newlines in output (f
|
Line 96 variable out-nls \ newlines in output (f
|
variable store-optimization \ use store optimization? |
variable store-optimization \ use store optimization? |
store-optimization off |
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 ) |
: th ( addr1 n -- addr2 ) |
cells + ; |
cells + ; |
Line 154 struct%
|
Line 169 struct%
|
cell% 2* field stack-pointer \ stackpointer name |
cell% 2* field stack-pointer \ stackpointer name |
cell% field stack-type \ name for default type of stack items |
cell% field stack-type \ name for default type of stack items |
cell% field stack-in-index-xt \ ( in-size item -- in-index ) |
cell% field stack-in-index-xt \ ( in-size item -- in-index ) |
|
cell% field stack-access-transform \ ( nitem -- index ) |
end-struct stack% |
end-struct stack% |
|
|
struct% |
struct% |
Line 189 create stacks max-stacks cells allot \ a
|
Line 205 create stacks max-stacks cells allot \ a
|
1 next-stack-number +! |
1 next-stack-number +! |
r@ stack-type ! |
r@ stack-type ! |
save-mem r@ stack-pointer 2! |
save-mem r@ stack-pointer 2! |
['] stack-in-index r> stack-in-index-xt ! ; |
['] stack-in-index r@ stack-in-index-xt ! |
|
['] noop r@ stack-access-transform ! |
|
rdrop ; |
|
|
: map-stacks { 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 |
\ perform xt 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 |
Line 246 end-struct prim%
|
Line 270 end-struct prim%
|
variable in-part \ true if processing a part |
variable in-part \ true if processing a part |
in-part off |
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 |
1000 constant max-combined |
create combined-prims max-combined cells allot |
create combined-prims max-combined cells allot |
variable num-combined |
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 |
table constant combinations |
\ the keys are the sequences of pointers to primitives |
\ the keys are the sequences of pointers to primitives |
Line 257 create current-depth max-stacks cells al
|
Line 296 create current-depth max-stacks cells al
|
create max-depth max-stacks cells allot |
create max-depth max-stacks cells allot |
create min-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 |
wordlist constant primitives |
|
|
: create-prim ( prim -- ) |
: create-prim ( prim -- ) |
Line 277 variable name-line
|
Line 329 variable name-line
|
2variable name-filename |
2variable name-filename |
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 ! |
|
: function-diff ( n -- ) |
|
." GROUPADD(" function-number @ function-old @ - 0 .r ." )" cr |
|
function-number @ function-old ! ; |
|
: forth-fdiff ( -- ) |
|
function-number @ function-old @ - 0 .r ." groupadd" cr |
|
function-number @ function-old ! ; |
|
|
\ a few more set ops |
\ a few more set ops |
|
|
Line 286 Variable function-number 0 function-numb
|
Line 345 Variable function-number 0 function-numb
|
: 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 |
\ stack access stuff |
|
|
|
: normal-stack-access0 { n stack -- } |
|
n stack stack-access-transform @ execute ." [" 0 .r ." ]" ; |
|
|
|
: normal-stack-access1 { n stack -- } |
|
stack stack-pointer 2@ type |
|
n if |
|
n stack normal-stack-access0 |
|
else |
|
." TOS" |
|
endif ; |
|
|
: normal-stack-access ( n stack -- ) |
: normal-stack-access ( n stack -- ) |
stack-pointer 2@ type |
dup inst-stream-f = if |
dup |
." IMM_ARG(" normal-stack-access1 ." ," immarg ? ." )" |
if |
1 immarg +! |
." [" 0 .r ." ]" |
|
else |
else |
drop ." TOS" |
normal-stack-access1 |
endif ; |
endif ; |
|
|
\ forward declaration for inst-stream (breaks cycle in definitions) |
: stack-depth { stack -- n } |
defer inst-stream-f ( -- stack ) |
current-depth stack stack-number @ th @ ; |
|
|
: part-stack-access { n stack -- } |
: part-stack-access { n stack -- } |
\ print _<stack><x>, x=inst-stream? n : maxdepth-currentdepth-n-1 |
\ print _<stack><x>, x=inst-stream? n : maxdepth-currentdepth-n-1 |
." _" stack stack-pointer 2@ type |
." _" stack stack-pointer 2@ type |
stack stack-number @ { stack# } |
stack stack-number @ { stack# } |
current-depth stack# th @ n + { access-depth } |
stack stack-depth n + { access-depth } |
stack inst-stream-f = if |
stack inst-stream-f = if |
access-depth |
access-depth |
else |
else |
Line 314 defer inst-stream-f ( -- stack )
|
Line 386 defer inst-stream-f ( -- stack )
|
endif |
endif |
0 .r ; |
0 .r ; |
|
|
: stack-access ( n stack -- ) |
: 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 |
\ print a stack access at index n of stack |
in-part @ if |
in-part @ if |
part-stack-access |
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 |
else |
normal-stack-access |
normal-stack-access |
endif ; |
endif ; |
Line 335 defer inst-stream-f ( -- stack )
|
Line 439 defer inst-stream-f ( -- stack )
|
>r |
>r |
." vm_" r@ item-stack-type-name type |
." vm_" r@ item-stack-type-name type |
." 2" r@ item-type @ print-type-prefix ." (" |
." 2" r@ item-type @ print-type-prefix ." (" |
r@ item-in-index r@ item-stack @ stack-access ." ," |
r@ item-in-index r@ item-stack @ stack-read ." ," |
r@ item-name 2@ type |
r@ item-name 2@ type |
." );" cr |
." );" cr |
rdrop ; |
rdrop ; |
Line 346 defer inst-stream-f ( -- stack )
|
Line 450 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-access |
r@ item-in-index r@ item-stack @ 2dup ." (Cell)" stack-read |
." , " -1 under+ ." (Cell)" stack-access |
." , " -1 under+ ." (Cell)" stack-read |
." , " r@ item-name 2@ type |
." , " r@ item-name 2@ type |
." )" cr |
." )" cr |
rdrop ; |
rdrop ; |
Line 379 defer inst-stream-f ( -- stack )
|
Line 483 defer inst-stream-f ( -- stack )
|
r@ item-type @ print-type-prefix ." 2" |
r@ item-type @ print-type-prefix ." 2" |
r@ item-stack-type-name type ." (" |
r@ item-stack-type-name type ." (" |
r@ item-name 2@ type ." ," |
r@ item-name 2@ type ." ," |
r@ item-out-index r@ item-stack @ stack-access ." );" |
r@ item-out-index r@ item-stack @ stack-write ." );" |
rdrop ; |
rdrop ; |
|
|
: store-single ( item -- ) |
: store-single ( item -- ) |
>r |
>r |
store-optimization @ r@ same-as-in? and if |
store-optimization @ in-part @ 0= and r@ same-as-in? and if |
r@ item-in-index 0= r@ item-out-index 0= xor if |
r@ item-in-index 0= r@ item-out-index 0= xor if |
." IF_" r@ item-stack @ stack-pointer 2@ type |
." IF_" r@ item-stack @ stack-pointer 2@ type |
." TOS(" r@ really-store-single ." );" cr |
." TOS(" r@ really-store-single ." );" cr |
Line 401 defer inst-stream-f ( -- stack )
|
Line 505 defer inst-stream-f ( -- stack )
|
r@ item-type @ print-type-prefix ." 2two" |
r@ item-type @ print-type-prefix ." 2two" |
r@ item-stack-type-name type ." (" |
r@ item-stack-type-name type ." (" |
r@ item-name 2@ type ." , " |
r@ item-name 2@ type ." , " |
r@ item-out-index r@ item-stack @ 2dup stack-access |
r@ item-out-index r@ item-stack @ 2dup stack-write |
." , " -1 under+ stack-access |
." , " -1 under+ stack-write |
." )" cr |
." )" cr |
rdrop ; |
rdrop ; |
|
|
Line 518 wordlist constant type-names \ this is h
|
Line 622 wordlist constant type-names \ this is h
|
get-current type-names set-current |
get-current type-names set-current |
stack-type 2dup nextname stack-type-name |
stack-type 2dup nextname stack-type-name |
set-current |
set-current |
stack-pointer lastxt >body stack-name nextname make-stack ; |
stack-pointer latestxt >body stack-name nextname make-stack ; |
|
|
stack inst-stream IP Cell |
stack inst-stream IP Cell |
' inst-in-index inst-stream stack-in-index-xt ! |
' inst-in-index inst-stream stack-in-index-xt ! |
Line 541 stack inst-stream IP Cell
|
Line 645 stack inst-stream IP Cell
|
: compute-offset-out ( addr1 addr2 -- ) |
: compute-offset-out ( addr1 addr2 -- ) |
['] stack-out compute-offset ; |
['] stack-out compute-offset ; |
|
|
: clear-stack { -- } |
|
dup stack-in off stack-out off ; |
|
|
|
: compute-offsets ( -- ) |
: compute-offsets ( -- ) |
['] clear-stack map-stacks |
prim prim-stacks-in max-stacks cells erase |
inst-stream clear-stack |
prim prim-stacks-out max-stacks cells erase |
prim prim-effect-in prim prim-effect-in-end @ ['] compute-offset-in map-items |
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 |
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 ; |
inst-stream stack-out @ 0= s" # can only be on the input side" ?print-error ; |
Line 561 stack inst-stream IP Cell
|
Line 662 stack inst-stream IP Cell
|
stack stack-out @ 0<> stack stack-in @ 0= and |
stack stack-out @ 0<> stack stack-in @ 0= and |
if |
if |
." IF_" stack stack-pointer 2@ 2dup type ." TOS(" |
." IF_" stack stack-pointer 2@ 2dup type ." TOS(" |
2dup type ." [0] = " type ." TOS);" cr |
2dup type 0 stack normal-stack-access0 ." = " type ." TOS);" cr |
endif ; |
endif ; |
|
|
: flush-tos ( -- ) |
: flush-tos ( -- ) |
['] flush-a-tos map-stacks ; |
['] flush-a-tos map-stacks1 ; |
|
|
: fill-a-tos { stack -- } |
: fill-a-tos { stack -- } |
stack stack-out @ 0= stack stack-in @ 0<> and |
stack stack-out @ 0= stack stack-in @ 0<> and |
if |
if |
." IF_" stack stack-pointer 2@ 2dup type ." TOS(" |
." IF_" stack stack-pointer 2@ 2dup type ." TOS(" |
2dup type ." TOS = " type ." [0]);" cr |
2dup type ." TOS = " type 0 stack normal-stack-access0 ." );" cr |
endif ; |
endif ; |
|
|
: fill-tos ( -- ) |
: fill-tos ( -- ) |
\ !! inst-stream for prefetching? |
\ !! inst-stream for prefetching? |
['] fill-a-tos map-stacks ; |
['] fill-a-tos map-stacks1 ; |
|
|
: fetch ( addr -- ) |
: fetch ( addr -- ) |
dup item-type @ type-fetch @ execute ; |
dup item-type @ type-fetch @ execute ; |
Line 584 stack inst-stream IP Cell
|
Line 685 stack inst-stream IP Cell
|
: fetches ( -- ) |
: fetches ( -- ) |
prim prim-effect-in prim prim-effect-in-end @ ['] fetch map-items ; |
prim prim-effect-in prim prim-effect-in-end @ ['] fetch map-items ; |
|
|
|
: stack-update-transform ( n1 stack -- n2 ) |
|
\ n2 is the number by which the stack pointer should be |
|
\ incremented to pop n1 items |
|
stack-access-transform @ dup >r execute |
|
0 r> execute - ; |
|
|
: stack-pointer-update { stack -- } |
: stack-pointer-update { stack -- } |
\ stack grow downwards |
\ stacks grow downwards |
stack stack-in @ stack stack-out @ - |
stack stack-diff |
?dup-if \ this check is not necessary, gcc would do this for us |
?dup-if \ this check is not necessary, gcc would do this for us |
stack stack-pointer 2@ type ." += " 0 .r ." ;" cr |
stack inst-stream = if |
endif ; |
." INC_IP(" 0 .r ." );" cr |
|
else |
: inst-pointer-update ( -- ) |
stack stack-pointer 2@ type ." += " |
inst-stream stack-in @ ?dup-if |
stack stack-update-transform 0 .r ." ;" cr |
." INC_IP(" 0 .r ." );" cr |
endif |
endif ; |
endif ; |
|
|
: stack-pointer-updates ( -- ) |
: stack-pointer-updates ( -- ) |
inst-pointer-update |
|
['] stack-pointer-update map-stacks ; |
['] stack-pointer-update map-stacks ; |
|
|
: store ( item -- ) |
: store ( item -- ) |
Line 642 stack inst-stream IP Cell
|
Line 748 stack inst-stream IP Cell
|
endif |
endif |
2drop ; |
2drop ; |
|
|
: output-c-tail1 ( -- ) |
: output-nextp2 ( -- ) |
\ the final part of the generated C code except LABEL2 and NEXT_P2 |
." 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 |
output-super-end |
print-debug-results |
print-debug-results |
." NEXT_P1;" cr |
." NEXT_P1;" cr |
stores |
stores |
fill-tos ; |
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 ( -- ) |
: output-c-tail ( -- ) |
\ the final part of the generated C code, without LABEL2 |
tail-nextp2 @ output-c-tail1 ; |
output-c-tail1 |
|
." NEXT_P2;" ; |
|
|
|
: output-c-tail2 ( -- ) |
: output-c-tail2 ( -- ) |
\ the final part of the generated C code, including LABEL2 |
['] output-label2 output-c-tail1 ; |
output-c-tail1 |
|
." LABEL2(" prim prim-c-name 2@ type ." )" cr |
: output-c-tail-no-stores ( -- ) |
." NEXT_P2;" cr ; |
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 -- ) |
: type-c-code ( c-addr u xt -- ) |
\ like TYPE, but replaces "INST_TAIL;" with tail code produced by xt |
\ like TYPE, but replaces "INST_TAIL;" with tail code produced by xt |
Line 733 stack inst-stream IP Cell
|
Line 858 stack inst-stream IP Cell
|
endif |
endif |
." }" cr ; |
." }" cr ; |
|
|
|
: output-profile-part ( p ) |
|
." add_inst(b, " quote |
|
prim-name 2@ type |
|
quote ." );" cr ; |
|
|
: output-profile-combined ( -- ) |
: output-profile-combined ( -- ) |
\ generate code for postprocessing the VM block profile stuff |
\ generate code for postprocessing the VM block profile stuff |
." if (VM_IS_INST(*ip, " function-number @ 0 .r ." )) {" cr |
." if (VM_IS_INST(*ip, " function-number @ 0 .r ." )) {" cr |
num-combined @ 0 +do |
['] output-profile-part map-combined |
." add_inst(b, " quote |
|
combined-prims i th @ prim-name 2@ type |
|
quote ." );" cr |
|
loop |
|
." ip += " inst-stream stack-in @ 1+ 0 .r ." ;" cr |
." 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" SET_IP" search nip nip |
combined-prims num-combined @ 1- th @ prim-c-code 2@ s" SUPER_END" search nip nip or if |
combined-prims num-combined @ 1- th @ prim-c-code 2@ s" SUPER_END" search nip nip or if |
Line 826 stack inst-stream IP Cell
|
Line 952 stack inst-stream IP Cell
|
: output-alias ( -- ) |
: output-alias ( -- ) |
( primitive-number @ . ." alias " ) ." Primitive " prim prim-name 2@ type cr ; |
( 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 ( -- ) |
: output-forth ( -- ) |
prim prim-forth-code @ 0= |
prim prim-forth-code @ 0= |
IF \ output-alias |
IF \ output-alias |
Line 837 stack inst-stream IP Cell
|
Line 966 stack inst-stream IP Cell
|
THEN ; |
THEN ; |
|
|
: output-tag-file ( -- ) |
: output-tag-file ( -- ) |
name-filename 2@ last-name-filename 2@ str= 0= if |
name-filename 2@ last-name-filename 2@ compare if |
name-filename 2@ last-name-filename 2! |
name-filename 2@ last-name-filename 2! |
#ff emit cr |
#ff emit cr |
name-filename 2@ type |
name-filename 2@ type |
Line 937 stack inst-stream IP Cell
|
Line 1066 stack inst-stream IP Cell
|
prim to combined |
prim to combined |
0 num-combined ! |
0 num-combined ! |
current-depth max-stacks cells erase |
current-depth max-stacks cells erase |
|
include-skipped-insts @ current-depth 0 th ! |
max-depth max-stacks cells erase |
max-depth max-stacks cells erase |
min-depth max-stacks cells erase |
min-depth max-stacks cells erase |
prim prim-effect-in prim prim-effect-in-end ! |
prim prim-effect-in prim prim-effect-in-end ! |
Line 948 stack inst-stream IP Cell
|
Line 1078 stack inst-stream IP Cell
|
: min! ( n addr -- ) |
: min! ( n addr -- ) |
tuck @ min swap ! ; |
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 -- } |
: add-depths { p -- } |
\ combine stack effect of p with *-depths |
\ combine stack effect of p with *-depths |
max-stacks 0 ?do |
max-stacks 0 ?do |
current-depth i th @ |
current-depth i th @ |
p prim-stacks-in i th @ + |
p prim-stacks-in i th @ + i inst-stream-adjustment + |
dup max-depth i th max! |
dup max-depth i th max! |
p prim-stacks-out i th @ - |
p prim-stacks-out i th @ - |
dup min-depth i th min! |
dup min-depth i th min! |
current-depth i th ! |
current-depth i th ! |
loop ; |
loop ; |
|
|
|
: copy-maxdepths ( n -- ) |
|
max-depth max-depths rot max-stacks * th max-stacks cells move ; |
|
|
: add-prim ( addr u -- ) |
: add-prim ( addr u -- ) |
\ add primitive given by "addr u" to combined-prims |
\ add primitive given by "addr u" to combined-prims |
primitives search-wordlist s" unknown primitive" ?print-error |
primitives search-wordlist s" unknown primitive" ?print-error |
execute { p } |
execute { p } |
p combined-prims num-combined @ th ! |
p combined-prims num-combined @ th ! |
|
num-combined @ copy-maxdepths |
1 num-combined +! |
1 num-combined +! |
p add-depths ; |
p add-depths |
|
num-combined @ copy-maxdepths ; |
|
|
: compute-effects { q -- } |
: compute-effects { q -- } |
\ compute the stack effects of q from the depths |
\ compute the stack effects of q from the depths |
Line 998 stack inst-stream IP Cell
|
Line 1137 stack inst-stream IP Cell
|
i q prim-stacks-out i th @ q prim-effect-out-end make-effect-items |
i q prim-stacks-out i th @ q prim-effect-out-end make-effect-items |
loop ; |
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 ( -- ) |
: process-combined ( -- ) |
combined combined-prims num-combined @ cells |
combined combined-prims num-combined @ cells |
combinations ['] constant insert-wordlist |
combinations ['] constant insert-wordlist |
Line 1005 stack inst-stream IP Cell
|
Line 1165 stack inst-stream IP Cell
|
@ prim-c-code 2@ prim prim-c-code 2! \ used by output-super-end |
@ prim-c-code 2@ prim prim-c-code 2! \ used by output-super-end |
prim compute-effects |
prim compute-effects |
prim init-effects |
prim init-effects |
|
compute-max-back-depths |
output-combined perform ; |
output-combined perform ; |
|
|
\ C output |
\ C output |
Line 1030 stack inst-stream IP Cell
|
Line 1191 stack inst-stream IP Cell
|
|
|
: output-combined-tail ( -- ) |
: output-combined-tail ( -- ) |
part-output-c-tail |
part-output-c-tail |
prim >r combined to prim |
|
in-part @ >r in-part off |
in-part @ >r in-part off |
output-c-tail |
combined ['] output-c-tail-no-stores prim-context |
r> in-part ! r> to prim ; |
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 -- ) |
: output-part ( p -- ) |
to prim |
to prim |
Line 1043 stack inst-stream IP Cell
|
Line 1214 stack inst-stream IP Cell
|
print-declarations |
print-declarations |
part-fetches |
part-fetches |
print-debug-args |
print-debug-args |
|
combined ['] part-stack-pointer-updates prim-context |
|
1 part-num +! |
prim add-depths \ !! right place? |
prim add-depths \ !! right place? |
prim prim-c-code 2@ ['] output-combined-tail type-c-code |
prim prim-c-code 2@ ['] output-combined-tail type-c-code |
part-output-c-tail |
part-output-c-tail |
Line 1051 stack inst-stream IP Cell
|
Line 1224 stack inst-stream IP Cell
|
: output-parts ( -- ) |
: output-parts ( -- ) |
prim >r in-part on |
prim >r in-part on |
current-depth max-stacks cells erase |
current-depth max-stacks cells erase |
num-combined @ 0 +do |
0 part-num ! |
combined-prims i th @ output-part |
['] output-part map-combined |
loop |
|
in-part off |
in-part off |
r> to prim ; |
r> to prim ; |
|
|
Line 1065 stack inst-stream IP Cell
|
Line 1237 stack inst-stream IP Cell
|
print-declarations-combined |
print-declarations-combined |
." NEXT_P0;" cr |
." NEXT_P0;" cr |
flush-tos |
flush-tos |
fetches |
\ fetches \ now in parts |
\ print-debug-args |
\ print-debug-args |
stack-pointer-updates |
\ stack-pointer-updates now in parts |
output-parts |
output-parts |
output-c-tail2 |
output-c-tail2-no-stores |
." }" cr |
." }" cr |
cr ; |
cr ; |
|
|
Line 1079 stack inst-stream IP Cell
|
Line 1251 stack inst-stream IP Cell
|
|
|
\ peephole optimization rules |
\ 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 |
\ in order for this to work as intended, shorter combinations for each |
\ length must be present, and the longer combinations must follow |
\ length must be present, and the longer combinations must follow |
\ shorter ones (this restriction may go away in the future). |
\ shorter ones (this restriction may go away in the future). |
|
|
: output-peephole ( -- ) |
: output-peephole ( -- ) |
combined-prims num-combined @ 1- cells combinations search-wordlist |
combined-prims num-combined @ 1- cells combinations search-wordlist |
s" the prefix for this combination must be defined earlier" ?print-error |
s" the prefix for this superinstruction must be defined earlier" ?print-error |
." {" |
." {" |
execute prim-num @ 5 .r ." ," |
execute prim-num @ 5 .r ." ," |
combined-prims num-combined @ 1- th @ prim-num @ 5 .r ." ," |
combined-prims num-combined @ 1- th @ prim-num @ 5 .r ." ," |
Line 1093 stack inst-stream IP Cell
|
Line 1268 stack inst-stream IP Cell
|
combined prim-c-name 2@ type ." */" |
combined prim-c-name 2@ type ." */" |
cr ; |
cr ; |
|
|
: output-forth-peephole ( -- ) |
|
combined-prims num-combined @ 1- cells combinations search-wordlist |
\ cost and superinstruction data for a sophisticated combiner (e.g., |
s" the prefix for this combination must be defined earlier" ?print-error |
\ shortest path) |
execute prim-num @ 5 .r |
|
combined-prims num-combined @ 1- th @ prim-num @ 5 .r |
\ This is intended as initializer for a structure like this |
combined prim-num @ 5 .r ." prim, \ " |
|
combined prim-c-name 2@ type |
\ struct cost { |
|
\ int loads; /* number of stack loads */ |
|
\ int stores; /* number of stack stores */ |
|
\ int updates; /* number of stack pointer updates */ |
|
\ int offset; /* offset into super2 table */ |
|
\ int length; /* number 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. |
|
|
|
: super2-length ( -- n ) |
|
combined if |
|
num-combined @ |
|
else |
|
1 |
|
endif ; |
|
|
|
: 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 |
|
0 max-stacks 0 +do |
|
p prim-stacks-in i th @ + |
|
loop |
|
super2-length 1- - \ don't count instruction fetches of subsumed insts |
|
0 max-stacks 0 +do |
|
p prim-stacks-out i th @ + |
|
loop |
|
0 max-stacks 1 +do \ don't count ip updates, therefore "1 +do" |
|
p prim-stacks-in i th @ p prim-stacks-out i th @ <> - |
|
loop ; |
|
|
|
: output-num-part ( p -- ) |
|
prim-num @ 4 .r ." ," ; |
|
|
|
: output-name-comment ( -- ) |
|
." /* " prim prim-name 2@ type ." */" ; |
|
|
|
variable offset-super2 0 offset-super2 ! \ offset into the super2 table |
|
|
|
: output-costs ( -- ) |
|
\ description of superinstructions and simple instructions |
|
." {" prim compute-costs |
|
rot 2 .r ." ," swap 2 .r ." ," 2 .r ." ," |
|
offset-super2 @ 5 .r ." ," |
|
super2-length dup 2 .r ." }," offset-super2 +! |
|
output-name-comment |
cr ; |
cr ; |
|
|
|
: output-super2 ( -- ) |
|
\ table of superinstructions without requirement for existing prefixes |
|
combined if |
|
['] output-num-part map-combined |
|
else |
|
prim output-num-part |
|
endif |
|
output-name-comment |
|
cr ; |
|
|
\ the parser |
\ the parser |
|
|
Line 1127 print-token !
|
Line 1359 print-token !
|
getinput member? ; |
getinput member? ; |
' testchar? test-vector ! |
' testchar? test-vector ! |
|
|
: checksyncline ( -- ) |
: checksynclines ( -- ) |
\ 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 @ begin >r |
s" #line " r@ over str= 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] " <> 0= s" sync line syntax" ?print-error |
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 <> 0= s" sync line syntax" ?print-error |
dup c@ nl-char <> 0= s" sync line syntax" ?print-error |
skipsynclines @ if |
skipsynclines @ if |
dup char+ rawinput ! |
char+ dup rawinput ! |
rawinput @ c@ cookedinput @ c! |
rawinput @ c@ cookedinput @ c! |
endif |
endif |
drop ; |
again ; |
|
|
: ?nextchar ( f -- ) |
: ?nextchar ( f -- ) |
s" syntax error, wrong char" ?print-error |
s" syntax error, wrong char" ?print-error |
Line 1154 print-token !
|
Line 1386 print-token !
|
1 chars rawinput +! |
1 chars rawinput +! |
1 chars cookedinput +! |
1 chars cookedinput +! |
nl-char = if |
nl-char = if |
checksyncline |
checksynclines |
rawinput @ line-start ! |
rawinput @ line-start ! |
endif |
endif |
rawinput @ c@ cookedinput @ c! |
rawinput @ c@ |
|
cookedinput @ c! |
endif ; |
endif ; |
|
|
: charclass ( set "name" -- ) |
: charclass ( set "name" -- ) |
Line 1215 Variable c-flag
|
Line 1448 Variable c-flag
|
)) <- c-comment ( -- ) |
)) <- c-comment ( -- ) |
|
|
(( ` - nonl ** {{ |
(( ` - nonl ** {{ |
forth-flag @ IF ." [ELSE]" cr THEN |
forth-flag @ IF forth-fdiff ." [ELSE]" cr THEN |
c-flag @ IF ." #else" cr THEN }} |
c-flag @ IF |
|
function-diff |
|
." #else /* " function-number @ 0 .r ." */" cr THEN }} |
)) <- else-comment |
)) <- else-comment |
|
|
(( ` + {{ start }} nonl ** {{ end |
(( ` + {{ start }} nonl ** {{ end |
dup |
dup |
IF c-flag @ |
IF c-flag @ |
IF ." #ifdef HAS_" bounds ?DO I c@ toupper emit LOOP cr |
IF |
|
function-diff |
|
." #ifdef HAS_" bounds ?DO I c@ toupper emit LOOP cr |
THEN |
THEN |
forth-flag @ |
forth-flag @ |
IF ." has? " type ." [IF]" cr THEN |
IF forth-fdiff ." has? " type ." [IF]" cr THEN |
ELSE 2drop |
ELSE 2drop |
c-flag @ IF ." #endif" cr THEN |
c-flag @ IF |
forth-flag @ IF ." [THEN]" cr THEN |
function-diff ." #endif" cr THEN |
|
forth-flag @ IF forth-fdiff ." [THEN]" cr THEN |
THEN }} |
THEN }} |
)) <- if-comment |
)) <- if-comment |
|
|
(( (( ` g || ` G )) {{ start }} nonl ** |
(( (( ` g || ` G )) {{ start }} nonl ** |
{{ end |
{{ end |
forth-flag @ IF ." group " type cr THEN |
forth-flag @ IF forth-fdiff ." group " type cr THEN |
c-flag @ IF ." GROUP(" type ." )" cr THEN }} |
c-flag @ IF function-diff |
|
." GROUP(" type ." , " function-number @ 0 .r ." )" cr THEN }} |
)) <- 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 1277 Variable c-flag
|
Line 1516 Variable c-flag
|
start }} [ifdef] vmgen c-ident [else] forth-ident [then] {{ end |
start }} [ifdef] vmgen c-ident [else] forth-ident [then] {{ end |
2dup prim prim-name 2! prim prim-c-name 2! }} white ** |
2dup prim prim-name 2! prim prim-c-name 2! }} white ** |
(( ` / white ** {{ start }} c-ident {{ end prim prim-c-name 2! }} white ** )) ?? |
(( ` / white ** {{ start }} c-ident {{ end prim prim-c-name 2! }} white ** )) ?? |
(( simple-primitive || combined-primitive )) {{ 1 function-number +! }} |
(( simple-primitive || combined-primitive )) |
|
{{ 1 function-number +! }} |
)) <- primitive ( -- ) |
)) <- primitive ( -- ) |
|
|
(( (( comment || primitive || nl white ** )) ** eof )) |
(( (( comment || primitive || nl white ** )) ** eof )) |
Line 1302 warnings @ [IF]
|
Line 1542 warnings @ [IF]
|
\ process the string at addr u |
\ process the string at addr u |
over dup rawinput ! dup line-start ! cookedinput ! |
over dup rawinput ! dup line-start ! cookedinput ! |
+ endrawinput ! |
+ endrawinput ! |
checksyncline |
checksynclines |
primitives2something ; |
primitives2something ; |
|
|
|
: unixify ( c-addr u1 -- c-addr u2 ) |
|
\ delete crs from the string |
|
bounds tuck tuck ?do ( c-addr1 ) |
|
i c@ dup #cr <> if |
|
over c! char+ |
|
else |
|
drop |
|
endif |
|
loop |
|
over - ; |
|
|
: process-file ( addr u xt-simple x-combined -- ) |
: process-file ( addr u xt-simple x-combined -- ) |
output-combined ! output ! |
output-combined ! output ! |
save-mem 2dup filename 2! |
save-mem 2dup filename 2! |
slurp-file |
slurp-file unixify |
warnings @ if |
warnings @ if |
." ------------ CUT HERE -------------" cr endif |
." ------------ CUT HERE -------------" cr endif |
primfilter ; |
primfilter ; |