/
prims2x0.6.2.fs
1683 lines (1418 loc) · 48.1 KB
/
prims2x0.6.2.fs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
\ converts primitives to, e.g., C code
\ Authors: Anton Ertl, Bernd Paysan
\ Copyright (C) 1995,1996,1997,1998,2000,2003,2008,2009,2013,2019,2021,2022 Free Software Foundation, Inc.
\ This file is part of Gforth.
\ Gforth is free software; you can redistribute it and/or
\ modify it under the terms of the GNU General Public License
\ as published by the Free Software Foundation; either version 2
\ of the License, or (at your option) any later version.
\ This program is distributed in the hope that it will be useful,
\ but WITHOUT ANY WARRANTY; without even the implied warranty of
\ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
\ GNU General Public License for more details.
\ You should have received a copy of the GNU General Public License
\ along with this program. If not, see http://www.gnu.org/licenses/.
\ This is not very nice (hard limits, no checking, assumes 1 chars = 1).
\ And it grew even worse when it aged.
\ Optimizations:
\ superfluous stores are removed. GCC removes the superfluous loads by itself
\ TOS and FTOS can be kept in register( variable)s.
\
\ Problems:
\ The TOS optimization is somewhat hairy. The problems by example:
\ 1) dup ( w -- w w ): w=TOS; sp-=1; sp[1]=w; TOS=w;
\ The store is not superfluous although the earlier opt. would think so
\ Alternatively: sp[0]=TOS; w=TOS; sp-=1; TOS=w;
\ 2) ( -- .. ): sp[0] = TOS; ... /* This additional store is necessary */
\ 3) ( .. -- ): ... TOS = sp[0]; /* as well as this load */
\ 4) ( -- ): /* but here they are unnecessary */
\ 5) Words that call NEXT themselves have to be done very carefully.
\
\ To do:
\ add the store optimization for doubles
\ regarding problem 1 above: It would be better (for over) to implement
\ 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.
\ for backwards compatibility, jaw
require compat/strcomp.fs
[undefined] endtry-iferror [if]
: endtry-iferror postpone recover ; immediate compile-only
[then]
warnings off
[undefined] latestxt [if]
\ redefinitions of kernel words not present in gforth-0.6.1
: latestxt lastcfa @ ;
: latest last @ ;
[then]
[IFUNDEF] try
include startup.fs
[THEN]
: struct% struct ; \ struct is redefined in gray
warnings off
\ warnings on
include ./gray.fs
128 constant max-effect \ number of things on one side of a stack effect
9 constant max-stacks \ the max. number of stacks (including inst-stream).
255 constant maxchar
maxchar 1+ constant eof-char
#tab constant tab-char
#lf constant nl-char
variable rawinput \ pointer to next character to be scanned
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 line \ line number of char pointed to by input
variable line-start \ pointer to start of current line (for error messages)
0 line !
2variable filename \ filename of original input file
0 0 filename 2!
2variable out-filename \ filename of the output file (for sync lines)
0 0 out-filename 2!
2variable f-comment
0 0 f-comment 2!
variable skipsynclines \ are sync lines ("#line ...") invisible to the parser?
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 )
cookedinput @ ;
: end ( addr -- addr u )
cookedinput @ over - ;
: 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
endtry-iferror
then
r> to outfile-id throw
1 (bye) \ abort
endif ;
: quote ( -- )
[char] " emit ;
\ count output lines to generate sync lines for output
: count-nls ( addr u -- )
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 )
cell% field stack-access-transform \ ( nitem -- 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 dup
>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 !
['] noop r@ stack-access-transform !
rdrop ;
: 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 ;
\ types
: print-type-prefix ( type -- )
body> >head name>string type ;
\ various variables for storing stuff of one primitive
struct%
cell% 2* field prim-name
cell% 2* field prim-wordset
cell% 2* field prim-c-name
cell% 2* field prim-doc
cell% 2* field prim-c-code
cell% 2* field prim-forth-code
cell% 2* field prim-stack-string
cell% field prim-num \ ordinal number
cell% field prim-items-wordlist \ unique items
item% max-effect * field prim-effect-in
item% max-effect * field prim-effect-out
cell% field prim-effect-in-end
cell% field prim-effect-out-end
cell% max-stacks * field prim-stacks-in \ number of in items per stack
cell% max-stacks * field prim-stacks-out \ number of out items per stack
end-struct prim%
: make-prim ( -- prim )
prim% %alloc { p }
s" " p prim-doc 2! s" " p prim-forth-code 2! s" " p prim-wordset 2!
p ;
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
\ maximum depth from end of the combination to the start of the each part
create depths max-stacks max-combined 1+ * cells allot
\ depth at the start of each part: array[parts] of array[stack]
: 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 + ;
: s-c-depth ( nstack ncomponent -- addr )
max-stacks * + cells depths + ;
: print-depths1 { stack# xt -- }
num-combined @ 1+ 0 +do
stack# i xt execute @ 3 .r
loop ;
: print-depths { stack# -- }
\ for debugging
cr ." depths: " stack# ['] s-c-depth print-depths1
cr ." max-depths: " stack# ['] s-c-max-depth print-depths1
cr ." max-back-depths: " stack# ['] s-c-max-back-depth print-depths1 ;
: final-max-depth? { nstack ncomponent -- flag }
\ does the stack reach its final maxdepth before the component?
nstack ncomponent s-c-max-depth @
nstack num-combined @ s-c-max-depth @ = ;
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
2variable c-filename
variable name-line
2variable name-filename
2variable last-name-filename
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
: bit-equivalent ( w1 w2 -- w3 )
xor invert ;
: complement ( set1 -- set2 )
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-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 -- )
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
dup
>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)
dup >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 latestxt >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 ;
: compute-offsets ( -- )
prim prim-stacks-in max-stacks cells erase
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-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 stack normal-stack-access0 ." = " type ." TOS);" cr
endif ;
: flush-tos ( -- )
['] flush-a-tos map-stacks1 ;
: ?really-fill-a-tos { f stack -- }
f if
." IF_" stack stack-pointer 2@ 2dup type ." TOS("
2dup type ." TOS = " type 0 stack normal-stack-access0 ." );" cr
endif ;
: fill-a-tos { stack -- }
stack stack-out @ 0= stack stack-in @ 0<> and stack ?really-fill-a-tos ;
: 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-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 - ;
: n-stack-pointer-update { n stack -- }
\ stack pointer update by n
n if \ this check is not necessary, gcc would do this for us
stack inst-stream = if
." INC_IP(" n 0 .r ." );" cr
else
stack stack-pointer 2@ type ." += "
n stack stack-update-transform 0 .r ." ;" cr
endif
endif ;
: stack-pointer-update { stack -- }
\ stacks grow downwards
stack stack-diff stack n-stack-pointer-update ;
: 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-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 ( -- )
." N_" prim prim-c-name 2@ type ." ," 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!