This repository was archived by the owner on Jan 11, 2026. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathf56
More file actions
2135 lines (1766 loc) · 47.8 KB
/
Copy pathf56
File metadata and controls
2135 lines (1766 loc) · 47.8 KB
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
// header file for the PDP 11 code-generator NOV 77
GET "LIBHDR"
MANIFEST
$(
//relocatable object blocks
T.HUNK=1000
T.RELOC=1001
T.END=1002
$)
MANIFEST $( SECWORD=12345 $)
MANIFEST
$(
// OCODE keywords
S.TRUE=4; S.FALSE=5
S.RV=8; S.FNAP=10
S.MULT=11; S.DIV=12; S.REM=13
S.PLUS=14; S.MINUS=15; S.QUERY=16; S.NEG=17; S.ABS=19
S.EQ=20; S.NE=21; S.LS=22; S.GR=23; S.LE=24; S.GE=25
S.NOT=30; S.LSHIFT=31; S.RSHIFT=32; S.LOGAND=33
S.LOGOR=34; S.EQV=35; S.NEQV=36
S.LP=40; S.LG=41; S.LN=42; S.LSTR=43; S.LL=44
S.LLP=45; S.LLG=46; S.LLL=47
S.NEEDS=48; S.SECTION=49
S.RTAP=51; S.GOTO=52
S.RETURN=67; S.FINISH=68
S.SWITCHON=70
S.GLOBAL=76
S.SP=80; S.SG=81; S.SL=82; S.STIND=83
S.JUMP=85; S.JT=86; S.JF=87; S.ENDFOR=88
S.LAB=90; S.STACK=91; S.STORE=92; S.RSTACK=93; S.ENTRY=94
S.SAVE=95; S.FNRN=96; S.RTRN=97; S.RES=98
S.DATALAB=100; S.ITEML=101; S.ITEMN=102
S.ENDPROC=103
S.DEBUG=109; S.NONE=111
S.GETBYTE=120; S.PUTBYTE=121
$)
// selectors
MANIFEST $( H1=0; H2=1; H3=2; H4=3 $)
GLOBAL $(
// global routines
CGSECTS:100
RDN:101
RDL:102
RDGN:103
NEXTPARAM:104
CHECKPARAM:105
CGERROR:106
INITSTACK:107
STACK:108
STORE:109
SCAN:110
CGPENDINGOP:111
CGGLOBCALL:112
NUMBERIS:113
GETVALUE:114
MOVETOANYRSH:115
MOVETOANYR:116
MOVETOR:117
LOOKINREGS:118
LOOKINFREEREGS:119
NEXTR:120
REGUSEDBY:121
ISFREE:122
FREEREG:123
STORET:124
LOADT:125
LOSE1:126
CGBYTEAP:127
CGSTIND:128
STOREIN:129
CGRV:130
CGSHIFTK:131
CGADDK:132
CGPLUS:133
CGMINUS:134
CGLOGAND:135
CGGLOBAL:136
CGENTRY:137
CGSAVE:138
CGAPPLY:139
CGRETURN:140
CGJUMP:141
CGCMP:142
CGSWITCH:143
BSWITCH:144
LSWITCH:145
CHECKBREFS:146
GENBREFJUMPS:147
BRLABREF:148
CONDBRFN:149
GENBRANCH:150
GENMOV:151
GENSD:152
GENRS:153
GENRD:154
GEND:155
GEN:156
GENJ:157
FORMSADDR:158
FORMDADDR:159
FORMADDR:160
REMEM:161
SETINFO:162
FORGET:163
FORGETVARS:164
FORGETALL:165
CODE:166
CODERAND:167
CODED:168
CODERS:169
CODESD:170
INSERTCOUNT:171
SETLAB:172
CGLAB:173
CGNAME:174
RAD50:175
CGSTRING:176
LABREF:177
CGDATA:178
CGSTATICS:179
INITDATALISTS:180
CHECKSPACE:181
OUTPUTSECTION:182
OBJWORD:183
RSXWORD:184
ENDRECORD:185
DBOUTPUT:186
WRKN:187
// global variables
ARG1:190
ARG2:191
PENDINGOP:192
OP:193
TEMPV:194
TEMPT:195
SSP:196
DLIST:197
DLISTE:198
REFLIST:199
REFLISTE:200
NEEDSLIST:201
NEEDSLISTE:202
STVP:203
STV:204
DP:205
PROGSIZE:206
REG.K:207
REG.N:208
MOVED:209
ADDR.M:210
ADDR.V:211
CASEK:212
CASEL:213
PARAMNUMBER:214
BREFV:215
BREFP:216
BREFT:217
LABV:218
INCODE:219
MAXGN:220
MAXLAB:221
MAXSSP:222
STKCHKING:223
PROCSTK:224
PROCSTKP:225
MAPPING:226
NAMING:227
CALLCOUNTING:228
PROFILE:229
COUNTFLAG:230
RESTRICTED:231
LISTING:232
BINING:233
RSXOBJ:234
OVERLAYING:235
DEBUGGING:236
GOSTREAM:237
OCODE:238
BINV:239
BINP:240
$)
MANIFEST
$(
// registers
R0=0; R1=1; R2=2; R3=3; R.G=4; R.P=5; R.SP=6; R.PC=7
// items in simulated stack, in registers, or
// arguments to GEN routines
K.NONE=1
K.NUMB=2
K.LOC=3; K.GLOB=4; K.LAB=5
K.MLOC=6; K.MGLOB=7; K.MLAB=8
K.LVLOC=9; K.LVGLOB=10; K.LVLAB=11
K.REG=12
K.X0=13; K.X1=14; K.X2=15; K.X3=16
// global routine numbers
GN.STOP=2
GN.CHECKSTK=3
GN.MULT=4
GN.DIV =5
GN.REM =6
GN.LSHIFT=7
GN.RSHIFT=8
// PDP addressing modes
M.V=#100; M.L=#200 // operand and label flags
M.10=#10 // indirect bit
M.20=#20; M.V27=#127; M.L27=#227; M.2P=#25; M.2S=#26
M.4P=#45
M.V60=#160; M.V6G=#164; M.V6P=#165; M.V67=#167; M.L67=#267
M.V70=#170; M.V7S=#176; M.L77=#277
$)
MANIFEST
$(
// single operand instructions
// compiled by GEND(F,K,N)
F.CLR = #05000
F.CLRB=#105000
F.DEC = #05300
F.INC = #05200
F.NEG = #05400
F.ADC = #05500
F.TST = #05700
F.COM = #05100
F.ASR = #06200
F.ASL = #06300
F.SXT = #06700
F.ROR = #06000
F.SWAB= #00300
// register source instructions
// compiled by GENRS(F,K,N)
F.ASH = #72000
F.ASHC= #73000
F.MUL = #70000
F.DIV = #71000
// register destination instructions
// compiled by GENRD(F,K,N)
F.XOR = #74000
// jump instructions
// compiled by GENJ(F,R,K,N)
F.JMP = #00100
F.JSR = #04000
// double operand instructions
// compiled by GENSD(F,K1,N1,K2,N2)
F.MOV = #10000
F.MOVB=#110000
F.ADD = #60000
F.SUB =#160000
F.CMP = #20000
F.BIS = #50000
F.BISB=#150000
F.BIT = #30000
F.BIC = #40000
// branch and condition code instructions
// compiled by GENBRANCH(F,L), GEN(F)
F.BR = #00400 // this bit reverses a cond branch
F.BEQ = #01400
F.BNE = #01000
F.BLT = #02400
F.BGE = #02000
F.BLE = #03400
F.BGT = #03000
F.CLC = #00241
$)
.
SECTION "CGPDP1"
GET "TCG.BPL"
LET START() BE
$(1 LET WORKSPACESIZE = 10000
$( LET CMDSTR = FINDINPUT("TEMP.CMD")
LET CH,I = 0,0
LET FLV = VEC 40
WRITES("DOS CG V01*N")
LISTING, BINING, RSXOBJ := FALSE, FALSE, FALSE
PROFILE,CALLCOUNTING,RESTRICTED:=FALSE,FALSE,FALSE
MAPPING,STKCHKING,DEBUGGING := FALSE,FALSE,FALSE
OVERLAYING, NAMING := FALSE, TRUE
IF CMDSTR<0 DO
$( CGERROR("FILE TEMP.CMD")
STOP(1) $)
SELECTINPUT(CMDSTR)
UNTIL CH='.' ²/ CH='¡' ²/ CH='*N' DO
$( PUTBYTE(FLV,I,CH)
I := I+1
CH := RDCH() $)
FOR J=1 TO 4 DO
$( PUTBYTE(FLV,I,GETBYTE(".OBJ",J))
I := I+1 $)
UNTIL CH='¡' ²/ CH='*N' DO
CH := RDCH()
UNTIL CH='*N' DO
$( PUTBYTE(FLV,I,CH)
I := I+1
CH := RDCH() $)
FOR J=1 TO 5 DO
$( PUTBYTE(FLV,I,GETBYTE("/DD:B",J))
I := I+1 $)
PUTBYTE(FLV,0,I-1)
$(2 CH := RDCH()
NXT: SWITCHON CH INTO
$(SW DEFAULT: LOOP
CASE '*N':BREAK
CASE 'W': WORKSPACESIZE := READN()
CH := TERMINATOR
GOTO NXT
CASE 'N': NAMING := FALSE
LOOP
CASE 'M': MAPPING:=TRUE
LOOP
CASE 'P': PROFILE:=TRUE
CASE 'K': CALLCOUNTING:=TRUE
LOOP
CASE 'R': RESTRICTED := TRUE
LOOP
CASE 'B': BINING := TRUE
LOOP
CASE 'V': OVERLAYING := TRUE
CASE 'O': RSXOBJ := TRUE
LOOP
CASE 'D': DEBUGGING := TRUE
LOOP
CASE 'L': LISTING := TRUE
LOOP
CASE 'S': STKCHKING := TRUE
LOOP
$)SW
$)2 REPEAT
ENDREAD()
OCODE := FINDINPUT("TEMP.OCD")
IF OCODE<0 DO
$( CGERROR("FILE TEMP.OCD")
STOP(1) $)
IF BINING ²/ RSXOBJ DO
$( GOSTREAM := FINDOUTPUT(FLV)
IF GOSTREAM<0 DO
$( CGERROR("FILE %S",FLV)
STOP(1) $)
$)
$)
SELECTINPUT(OCODE)
PROGSIZE := 0
OP := RDN()
IF WORKSPACESIZE<2000 DO
$( CGERROR("TOO LITTLE WORKSPACE")
STOP(1) $)
APTOVEC(CGSECTS,WORKSPACESIZE)
WRITEF("PROGRAM SIZE = %N WORDS*N", PROGSIZE)
DELETEFILE("TEMP.CMD")
DELETEFILE("TEMP.OCD")
IF MAPPING DO MAPSTORE()
$)1
AND CGSECTS(WORKVEC, VECSIZE) BE
$(1 LET P = WORKVEC
TEMPV := P
P := P+300
TEMPT := P
BREFV, BREFP := P, P
P := P+128
PROCSTK, PROCSTKP := P, 0
P := P+20
REG.K := P
P := P+4
REG.N := P
P := P+4
DP := WORKVEC+VECSIZE
LABV := P
PARAMNUMBER := (DP-P)/10+10
P := P+PARAMNUMBER
FOR LP = LABV TO P-1 DO ]LP := -1
STV := P
STVP := 0
INITDATALISTS()
INCODE := FALSE
COUNTFLAG := FALSE
MAXGN := 0
MAXLAB := 0
MAXSSP := 0
IF OP=0 RETURN
INITSTACK(2)
CODE(0, 0)
TEST OP=S.SECTION
THEN $( CGNAME(S.SECTION,RDN())
OP := RDN() $)
ELSE CGNAME(S.SECTION,0)
SCAN()
OP := RDN()
STV]0 := STVP
OUTPUTSECTION(OP=0)
PROGSIZE := PROGSIZE + STVP
$)1 REPEAT
// read in OCODE operator or argument
// argument may be of form Ln
AND RDN() = VALOF
$( LET A, SIGN = 0, '+'
LET CH = 0
CH := RDCH() REPEATWHILE
CH='*S' ²/ CH='*N' ²/ CH='L'
IF CH=ENDSTREAMCH RESULTIS 0
IF CH='-' DO $( SIGN := '-'
CH := RDCH() $)
WHILE '0'<=CH<='9' DO $( A := 10*A + CH - '0'
CH := RDCH() $)
IF SIGN='-' DO A := -A
RESULTIS A
$)
// read in an OCODE label
AND RDL() = VALOF
$( LET L = RDN()
IF MAXLAB<L DO
$( MAXLAB := L
CHECKPARAM() $)
RESULTIS L $)
// read in a global number
AND RDGN() = VALOF
$( LET G = RDN()
IF MAXGN<G DO MAXGN := G
RESULTIS G $)
// generate next label parameter
AND NEXTPARAM() = VALOF
$( PARAMNUMBER := PARAMNUMBER-1
CHECKPARAM()
RESULTIS PARAMNUMBER $)
AND CHECKPARAM() BE
IF MAXLAB>=PARAMNUMBER DO
$( CGERROR("TOO MANY LABELS - INCREASE WORKSPACE")
STOP(1) $)
AND CGERROR(N,A) BE
$( WRITES("*NERROR: ")
WRITEF(N,A)
NEWLINE() $)
.
SECTION "CGPDP2"
GET "TCG.BPL"
// initialise the simulated stack (SS)
LET INITSTACK(N) BE
$( ARG2, ARG1 := TEMPV, TEMPV+3
SSP := N
PENDINGOP := S.NONE
H1]ARG2, H2]ARG2, H3]ARG2 := K.LOC, SSP-2, SSP-2
H1]ARG1, H2]ARG1, H3]ARG1 := K.LOC, SSP-1, SSP-1
IF MAXSSP<SSP DO MAXSSP := SSP $)
// move simulated stack (SS) pointer to N
AND STACK(N) BE
$(1 IF MAXSSP<N DO MAXSSP := N
IF N>=SSP+4 DO
$( STORE(0,SSP-1)
INITSTACK(N)
RETURN $)
WHILE N>SSP DO LOADT(K.LOC, SSP)
UNTIL N=SSP DO
$( IF ARG2=TEMPV DO
$( TEST N=SSP-1
THEN $( SSP := N
H1]ARG1,H2]ARG1 := H1]ARG2,H2]ARG2
H3]ARG1 := SSP-1
H1]ARG2,H2]ARG2 := K.LOC,SSP-2
H3]ARG2 := SSP-2 $)
ELSE INITSTACK(N)
RETURN $)
ARG1, ARG2 := ARG1-3, ARG2-3
SSP := SSP-1 $)
$)1
// store all SS items from A to B in their true
// locations on the stack
AND STORE(A,B) BE FOR P = TEMPV TO ARG1 BY 3 DO
$( LET S = H3]P
IF S>B RETURN
IF S>=A DO STORET(P) $)
AND SCAN() BE
$(1 SWITCHON OP INTO
$(SW DEFAULT: CGERROR("BAD OP %N", OP)
ENDCASE
CASE 0: RETURN
CASE S.DEBUG:DEBUGGING := NOT DEBUGGING
ENDCASE
CASE S.LP: LOADT(K.LOC, RDN()); ENDCASE
CASE S.LG: LOADT(K.GLOB, RDGN()); ENDCASE
CASE S.LL: LOADT(K.LAB, RDL()); ENDCASE
CASE S.LN: LOADT(K.NUMB, RDN()); ENDCASE
CASE S.LSTR: CGSTRING(RDN()); ENDCASE
CASE S.TRUE: LOADT(K.NUMB, #177777); ENDCASE
CASE S.FALSE:LOADT(K.NUMB, 0); ENDCASE
CASE S.LLP: LOADT(K.LVLOC, RDN()); ENDCASE
CASE S.LLG: LOADT(K.LVGLOB, RDGN()); ENDCASE
CASE S.LLL: LOADT(K.LVLAB, RDL()); ENDCASE
CASE S.SP: STOREIN(K.LOC, RDN()); ENDCASE
CASE S.SG: STOREIN(K.GLOB, RDGN()); ENDCASE
CASE S.SL: STOREIN(K.LAB, RDL()); ENDCASE
CASE S.STIND:CGSTIND(); ENDCASE
CASE S.RV: CGRV(); ENDCASE
CASE S.MULT:CASE S.DIV:CASE S.REM:
CASE S.PLUS:CASE S.MINUS:
CASE S.EQ: CASE S.NE:
CASE S.LS:CASE S.GR:CASE S.LE:CASE S.GE:
CASE S.LSHIFT:CASE S.RSHIFT:
CASE S.LOGAND:CASE S.LOGOR:CASE S.EQV:CASE S.NEQV:
CASE S.NOT:CASE S.NEG:CASE S.ABS:
CGPENDINGOP()
PENDINGOP := OP
ENDCASE
CASE S.JUMP: CGPENDINGOP()
STORE(0, SSP-1)
GENBRANCH(F.BR, RDL())
ENDCASE
CASE S.ENDFOR:
CGPENDINGOP()
PENDINGOP := S.LE
CASE S.JT: CGJUMP(TRUE, RDL())
ENDCASE
CASE S.JF: CGJUMP(FALSE, RDL())
ENDCASE
CASE S.GOTO: CGPENDINGOP()
STORE(0, SSP-2)
GENJ(F.JMP,0,H1]ARG1,H2]ARG1)
STACK(SSP-1)
ENDCASE
CASE S.LAB: CGPENDINGOP()
STORE(0, SSP-1)
CGLAB(RDL())
ENDCASE
CASE S.QUERY:CGPENDINGOP()
STACK(SSP+1)
ENDCASE
CASE S.STACK:CGPENDINGOP()
STACK(RDN())
ENDCASE
CASE S.STORE:CGPENDINGOP()
STORE(0, SSP-1)
ENDCASE
CASE S.ENTRY:
$( LET N = RDN()
LET L = RDL()
CGENTRY(N, L)
ENDCASE $)
CASE S.SAVE: CGSAVE(RDN())
IF STKCHKING DO
$( IF PROCSTKP>=20 DO
$( CGERROR("PROC STACK OVF")
STOP(1) $)
PROCSTK]PROCSTKP := MAXSSP
GENJ(F.JSR,R.PC,K.GLOB,GN.CHECKSTK)
PROCSTK](PROCSTKP+1) := STVP
CODE(0,0)
MAXSSP := SSP $)
PROCSTKP := PROCSTKP+2
ENDCASE
CASE S.FNAP:
CASE S.RTAP: CGAPPLY(OP, RDN())
ENDCASE
CASE S.RTRN:
CASE S.FNRN: CGRETURN(OP)
ENDCASE
CASE S.ENDPROC:
$( LET N = RDN()
PROCSTKP := PROCSTKP-2
IF STKCHKING DO
$( STV](PROCSTK](PROCSTKP+1)) :=
2*MAXSSP-2
MAXSSP := PROCSTK]PROCSTKP $)
ENDCASE $)
CASE S.RES: CGPENDINGOP()
STORE(0, SSP-2)
MOVETOR(ARG1,R0)
GENBRANCH(F.BR, RDL())
STACK(SSP-1)
ENDCASE
CASE S.RSTACK:
INITSTACK(RDN())
LOADT(K.REG, R0)
ENDCASE
CASE S.FINISH:
LOADT(K.NUMB, 0)
LOADT(K.NUMB, 0)
CGGLOBCALL(GN.STOP)
ENDCASE
CASE S.SWITCHON:
APTOVEC(CGSWITCH,2*RDN()+1)
ENDCASE
CASE S.GETBYTE:
CASE S.PUTBYTE:
CGBYTEAP(OP)
ENDCASE
CASE S.NEEDS:CGNAME(S.NEEDS,RDN())
ENDCASE
CASE S.GLOBAL:
CGGLOBAL(RDN())
RETURN
CASE S.DATALAB:
CASE S.ITEML:CGDATA(OP, RDL()); ENDCASE
CASE S.ITEMN:CGDATA(OP, RDN()); ENDCASE
$)SW
IF DEBUGGING DO DBOUTPUT()
OP := RDN()
$)1 REPEAT
.
SECTION "CGPDP3"
GET "TCG.BPL"
// compiles code to deal with any pending op
LET CGPENDINGOP() BE
$(1 LET R = 0
LET SW = FALSE
LET PENDOP = PENDINGOP
LET NUM1 = H1]ARG1=K.NUMB
LET KK = H2]ARG1
LET RAND1,RAND2 = ARG1,ARG2
PENDINGOP := S.NONE
SWITCHON PENDOP INTO
$(SW CASE S.ABS:
R := MOVETOANYR(ARG1)
UNLESS MOVED DO GEND(F.TST,K.REG,R)
CHECKBREFS(3)
CODE(F.BGE+1,0)
CASE S.NEG:
SW := TRUE
CASE S.NOT:
R := MOVETOANYR(ARG1)
GEND(SW->F.NEG,F.COM, K.REG, R)
CASE S.NONE:
RETURN
$)SW
GETVALUE(ARG1)
GETVALUE(ARG2)
IF H1]ARG2=K.NUMB ²/ H1]ARG1=K.REG ²/
LOOKINFREEREGS(ARG1)>=0 DO
// swop operands for symetric ops
RAND1,RAND2 := ARG2,ARG1
SWITCHON PENDOP INTO
$(SW DEFAULT:CGERROR("BAD PNDOP %N",PENDOP)
RETURN
CASE S.EQ: CASE S.NE:
CASE S.LS: CASE S.GR:
CASE S.LE: CASE S.GE:
// comparisons are ARG2 <op> ARG1
$( LET F = CONDBRFN(PENDOP)
R := NEXTR()
GEND(F.CLR,K.REG,R)
F := CGCMP(FALSE,F)
CHECKBREFS(3)
CODE(F+1,0)
GEND(F.COM,K.REG,R)
ENDCASE $)
CASE S.EQV:
SW := TRUE
CASE S.NEQV:
$( LET RS = MOVETOANYR(ARG1)
R := MOVETOANYR(ARG2)
TEST RESTRICTED
THEN $( LET W = NEXTR()
GENSD(F.MOV,K.REG,RS,K.REG,W)
GENSD(F.BIC,K.REG,R,K.REG,W)
GENSD(F.BIC,K.REG,RS,K.REG,R)
GENSD(F.BIS,K.REG,W,K.REG,R) $)
ELSE GENRD(F.XOR, RS, K.REG, R)
IF SW DO GEND(F.COM, K.REG, R)
ENDCASE $)
CASE S.PLUS:
IF NUM1 & H1]ARG2=K.NUMB DO
$( LOSE1(K.NUMB, KK+H2]ARG2)
RETURN $)
R := MOVETOANYR(RAND2)
CGPLUS(RAND1,K.REG,R)
ENDCASE
CASE S.MINUS:
R := MOVETOANYR(ARG2)
CGMINUS(ARG1,K.REG,R)
ENDCASE
CASE S.MULT:
IF NUMBERIS(2,RAND1) DO
$( R := MOVETOANYR(RAND2)
GEND(F.ASL, K.REG, R)
ENDCASE $)
IF RESTRICTED DO
$( CGGLOBCALL(GN.MULT)
LOADT(K.REG, R0)
RETURN $)
R := H1]RAND2=K.REG -> H2]RAND2,
ISFREE(1) -> 1,3
MOVETOR(RAND2,R)
IF (R&1)=0 DO FREEREG(R²/1,RAND1)
GENRS(F.MUL,R,H1]RAND1,H2]RAND1)
R := R²/1
ENDCASE
CASE S.DIV:
SW := TRUE
CASE S.REM:
TEST RESTRICTED
THEN $( CGGLOBCALL(SW->GN.DIV,GN.REM)
LOADT(K.REG,R0)
RETURN $)
ELSE $( LET N = REGUSEDBY(ARG2)
R := ISFREE(0) & ISFREE(1) -> 0,
ISFREE(2) & ISFREE(3) -> 2,
N>=0 -> N&2, NEXTR()&2
FREEREG(R,ARG2)
MOVETOR(ARG2, R+1)
UNLESS MOVED DO
GEND(F.TST,K.REG,R+1)
GEND(F.SXT, K.REG, R)
GENRS(F.DIV,R,H1]ARG1,H2]ARG1)
UNLESS SW DO R := R+1 $)
ENDCASE
CASE S.LOGOR:
R := MOVETOANYR(RAND2)
GENSD(F.BIS,H1]RAND1,H2]RAND1,K.REG,R)
ENDCASE
CASE S.LOGAND:
R := MOVETOANYR(RAND2)
CGLOGAND(RAND1,K.REG,R)
ENDCASE
CASE S.LSHIFT:
SW := TRUE
CASE S.RSHIFT:
IF NUM1 DO
$( IF KK=1 ²/ KK=2 ²/ KK=8 DO
$( R := MOVETOANYR(ARG2)
CGSHIFTK(SW,KK,K.REG,R)
ENDCASE
$)
UNLESS RESTRICTED DO
$( R := MOVETOANYR(ARG2)
TEST SW
THEN GENRS(F.ASH,R,K.NUMB,KK)
ELSE $( GEN(F.CLC)
GEND(F.ROR,K.REG,R)
GENRS(F.ASH,R,K.NUMB,1-KK)
$)
ENDCASE
$)
$)
IF RESTRICTED DO
$( CGGLOBCALL(SW->GN.LSHIFT,GN.RSHIFT)
LOADT(K.REG,R0)
RETURN $)
TEST SW
THEN $( R := MOVETOANYR(ARG2)
GENRS(F.ASH,R,H1]ARG1,H2]ARG1) $)
ELSE $( LET N = REGUSEDBY(ARG2)
LET S = NEXTR()
R := S=0 ²/ S=1 -> 2,0
GENMOV(K.NUMB,16,K.REG,S)
GENSD(F.SUB,H1]ARG1,H2]ARG1,K.REG,S)
H1]ARG1, H2]ARG1 := K.REG, S
MOVETOR(ARG2, R+1)
FREEREG(R,0)
GEND(F.CLR, K.REG, R)
GENRS(F.ASHC, R, K.REG, S) $)
ENDCASE
$)SW
LOSE1(K.REG, R)
$)1
// compiles a global call for out of
// line functions
AND CGGLOBCALL(GN) BE
$( CGPENDINGOP()
STORE(0,SSP-3)
MOVETOR(ARG2, R0)
MOVETOR(ARG1, R1)
STACK(SSP-2)
GENJ(F.JSR,R.PC,K.GLOB,GN)
CODE(2*SSP,0)
FORGETALL()
IF GN=GN.STOP DO INCODE := FALSE
$)
AND NUMBERIS(N,A) =
H1]A=K.NUMB & H2]A=N -> TRUE, FALSE
.
SECTION "CGPDP4"
GET "TCG.BPL"
// make any Lvalues addressable - ie get them
// into a register
LET GETVALUE(A) BE
IF H1]A=K.LVLOC ²/ H1]A=K.LVGLOB ²/ H1]A=K.LVLAB DO
MOVETOANYR(A)
// move a SS item into any register and shift
// it left for use with CGRV
AND MOVETOANYRSH(A) = VALOF
$( LET K,N,R = H1]A,H2]A,-1
LET KM = K=K.LOC -> K.MLOC,
K=K.LAB -> K.MLAB,
K=K.GLOB -> K.MGLOB, K.NONE
UNLESS KM=K.NONE DO
$( R := LOOKINREGS(KM,N)
IF R>=0 RESULTIS R $)
R := MOVETOANYR(A)
GEND(F.ASL,K.REG,R)
SETINFO(R,KM,N)
RESULTIS R
$)
// move a SS item into any register
AND MOVETOANYR(A) = VALOF
$( LET K,N,R = H1]A,H2]A,0
MOVED := FALSE
IF K=K.REG RESULTIS N
R := LOOKINFREEREGS(K,N)
IF R>=0 DO
$( H1]A,H2]A := K.REG,R
RESULTIS R $)
RESULTIS MOVETOR(A,NEXTR())
$)
// move a SS item into a given register
AND MOVETOR(A,R) = VALOF
$( FREEREG(R,A)
MOVED := FALSE
GENMOV(H1]A,H2]A,K.REG,R)
H1]A,H2]A := K.REG,R
RESULTIS R
$)
// look for the value of an item (K,N) in the
// registers; the register will not be modified
AND LOOKINREGS(K,N) = VALOF
$( FOR R=R0 TO R3 DO
IF REG.K]R=K & REG.N]R=N RESULTIS R
RESULTIS -1
$)
// look for the value of an item (K,N) in the
// free registers; the register may be modified
AND LOOKINFREEREGS(K,N) = VALOF
$( FOR R=R0 TO R3 DO
IF REG.K]R=K & REG.N]R=N & ISFREE(R) RESULTIS R
RESULTIS -1
$)
// allocate the next register;
// free it if required
AND NEXTR() = VALOF
$( FOR R=R0 TO R3 DO
IF REG.K]R=K.NONE & ISFREE(R) RESULTIS R
FOR R=R0 TO R3 DO
IF ISFREE(R) RESULTIS R
FOR T=TEMPV TO ARG1 BY 3 DO
$( LET R=REGUSEDBY(T)
IF R>=0 DO
$( FREEREG(R,0)
RESULTIS R $)
$)
$)
// find which register, if any, is used by
// a SS item
AND REGUSEDBY(A) = VALOF
$( LET K=H1]A