-
Notifications
You must be signed in to change notification settings - Fork 0
/
g1.cpp
1560 lines (1528 loc) · 44.7 KB
/
g1.cpp
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
/*
* g1.cpp
*
* Created on: Sep 18, 2019
* Author: menright
*/
#include <iostream>
#include <fstream>
#include <list>
#include <map>
#include <stack>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <stddef.h> // official home of ptrdiff_t
#include <assert.h>
#include <sstream>
#include "Token.h"
#include "Expr.h"
#include "util.h"
using namespace std;
void f() {
list<int> ints;
fold(ints, 0, [](int a,int b){ return a+b; });
}
struct Definition {
string name;
list<string> args;
Expr* body;
};
list<string> parse_names(void) {
list<string> names;
while (token.type == T_NAME) {
names.push_back(token.s);
next();
}
return names;
}
Expr* parse_let();
Expr *parse_expr();
Expr* E(int);
Definition parse_def(void) {
Definition r;
if (token.type != T_NAME)
return r;
r.name = token.s;
next();
r.args = parse_names();
assert(token.type == T_EQUALS);
next();
if (token.type == T_LET)
r.body = parse_let();
else
r.body = parse_expr();
assert(token.type == T_SEMI || token.type == T_EOF);
next();
return r;
}
list<Definition> parse_defs()
{
list<Definition> defs;
while (token.type != T_EOF) {
defs.push_back(parse_def());
}
return defs;
}
void pprint_def(int col, const Definition& def)
{
cerr << def.name;
if (def.args.size())
cerr << ' ' << join(def.args, ' ');
cerr << " :=" << endl;
indent(col+2);
cerr << def.body->to_string(col+2) << endl;
}
void pprint_defs(int col, const list<Definition>& defs)
{
for (auto def : defs)
pprint_def(col, def);
}
enum InstructionType {
ADD,
ALLOC,
CONS,
DIV,
EQ,
EVAL,
GE,
GET,
GT,
HD,
JFALSE,
JMP,
LABEL,
LE,
LT,
MKAP,
MKBOOL,
MKINT,
MOD,
MUL,
NE,
NEG,
NOT,
NULLinst,
PRINT,
PUSH,
PUSHBASIC,
PUSHBOOL,
PUSHFUN,
PUSHINT,
PUSHNIL,
RET,
SLIDE,
SUB,
TL,
UNWIND,
UPDATE,
STOP,
zzzmaxInstr
};
/*
*
1. <0,PRINT.c, n.s, v, G[n=INT i], E, D> => <o;i, c, s, v, G[n=INT i], E, D>
2. <0,PRINT.c, n.s, v, G[n=BOOL b], E, D> => <o;b, c, s, v, G[n=BOOL b], E, D>
3. <o,PRINT.c, n.s, v, GIn=CONS nln2] , E, D> =>
<o, EVAL.PRINT.EVAL.PRINT.c, n..n^.s, v, GIn=CONS n.n^], E, D>
4. <o,PRINT.c, n.s, v, GIn=NIL], E, D> => <o, c, s, v, G[n=NILJ, E, D>
5. <o,EVAL.c, n.s, v; G[n=AP n.n^],1 z E, D> => <o, UNWIND.(), n.(), v, G[n=AP nln2] , E, (c,s).D>
6. <o,EVAL.c, n.s, v, G[n=INT i], E, D> => <o, c, n.s, v, G[n=INT i], E, D>,
similarly for nodes BOOL b, NIL, CONS nln 2 and FUN f.
7.<O,UNWIND.(), n.s, v, G[n=AP nln~] , E, D> => <o, U~IND~(), nl.n.s, G[n=AP nlne], E, D>
8.<O,UNWIND.()[ no.n1[ :.nk.s , v, GLno=FUN f, nI=AP n I n I ,...nk=AP,n k[,~''], E[f=(k,c)], D> =>
<0, C, n .... n k .s, v, G[no=FUN f, nI=AP n 1'n1'',...nk=AP h nk ']' E[f=(k'c )]' D>
9.<O,UNWIND.(1, no.nl...nk.() , v, G[no=FUN f], E[f=(a,c')], (c ,s').D> and k < a =>
<o, c , nk.s , V, G[no=FUN f], E[f=(k,c')], D>
10.<O,RET m.c, v, n I ... nm.n.() , G[n=INT i], E, (c',s').D> =>
<o, c', n.s', v, G[n=INT i], E, D>, similarly for nodes BOOL b, NIL and CONS nln 2.
11.<0,RET m.c, n I .. nm.n.s, ,v, G[n=AP nln2] , E, D> =>
<O, UNWIND. i)I n.s, v, G[n=AP n I n2] , E, D>, similarly for n = FUN f.
12.<O,PUSHINT i.c, s, v, G, E, D> => <o, c, n'.s, v, G[n'=INT i], E, D>
13.<o,PUSHBOOL b.c, s, v, G, E, D> => <o, c, n'.s, v, G[n'=BOOL b], E, D>
14.<o,PUSHNIL.c, s, v, G, E, D> => <o, c, n'.s, v, GIn'=NIL], E, D>
15.<o,PUSHFUN f.c, s, v, G, E, D> => <o, c, n'.s, v, G[n'=FUN f], E, D>
16.<o,PUSH m.c, n O ..... nm.S, v, G, E, D> => <o, c, nm.n 0 .... nm.S, v, G, E, D>
17.<o,MKINT.c, s, i.v, G, E, D> => <o, c, n'.s, v, G[n'=INT i], E, D>
18.<o,MKBOOL.c, s, b.v, G, E, D> => <o, c, n'.s, v, G[n'=BOOL b], E, D>
19.<o,MKAP.c, nl.n2.s , G, E, D> => <o, c, n'.s, v, G[n'=AP n2nl] , E, D>
20.<o,CONS.c, nl.n2.s , G, E, D> => <o, c, n'.s, v, G[n'=CONS n2nl] , E, D>
21.<o,ALLOC m.c, s, v, G, E, D> => <o, c, n 1'...n '.s, v, Gin I '= HOLE, ... n ': HOLE], E, D>
22.<o,UPDATE m.c, n O . • n .s, v, Gin O" No, n m" Nm] , E, D> => <o, c, s, v, n I. .. nm.S, G[no: NO, nm: NO] , E, D>
"" m _" _ _" _
m m
23.<O,SLIDE m.c, n O ..... nm.S , v, G, E, D> => <o, c, nO.s , v, G, E, D>
24.<O,GET. c, n.s, v, G[n=INT i], E, D> => <o, c, s, i.v, G[n=INT i], E, D>
25.<o,GET.c, n.s, v, G[n=BOOL b], E, D> => <o, c, s, b.v, G[n=BOOL b], E, D>
26.<O,PUSHBASIC i.c, s, v, G, E, D> --> <o, c, s, i.v, G, E, D>
27.<o,ADD.c, s, i2.i 1.v, G, E, D> => <o, c, s, (i1+i2).v , G, E, D>, similarly for SUB, MUL, DIV,
EQ, NE, LT, GT, LE and GE, the last six putting boolean values on V
28.<O,NEG.c, s, i.v, G, E, D> => <o, c, s, (-i).v, G, E, D>
29.<o,NOT.c, s, b.v, G, E, D> => <o, c, s, (not b).v, G, E, D>
30.<o,JFALSE 1.c, s, true.v, G, E, D> => <o, c, s, G, E, D>
31.<o,JFALSE 1.c, s, false.v, G, E, D> => <o, JMP 1.c, s, v, G, E, D>
32.<o,JMP 1 .... LABEL 1.c, s, v, G, E, D> => <o, c, s, v, G, E, D>
33.<o,LABEL 1.c, s, G, E, D> => <o, c, s, G, E, D>
34.<o,HD.c, n.s, v, G[n=CONS nln2] , E, D> => <o, c, nl.s, v, GIn=CONS nln2] , E, D>,
similarly for TL
35.<O,NULL.c, n.s, v, G[n=CONS nln2] , E, D> => <o, c, s, false.v, GIn=CONS nln2] , E, D>
36.<O,NULL.c, n.s, v, G[n=NIL], E, D> => <o, c, s, true.v, GIn=NIL], E, D>
*/
const char* insNames[] = {
"ADD",
"ALLOC",
"CONS",
"DIV",
"EQ",
"EVAL",
"GE",
"GET",
"GT",
"HD",
"JFALSE",
"JMP",
"LABEL",
"LE",
"LT",
"MKAP",
"MKBOOL",
"MKINT",
"MOD",
"MUL",
"NE",
"NEG",
"NOT",
"NULL",
"PRINT",
"PUSH",
"PUSHBASIC",
"PUSHBOOL",
"PUSHFUN",
"PUSHINT",
"PUSHNIL",
"RET",
"SLIDE",
"SUB",
"TL",
"UNWIND",
"UPDATE",
"STOP"
};
const char* insToString(InstructionType ins) {
if (0<=ins && ins<zzzmaxInstr)
return insNames[ins];
return "inxxx";
}
struct NFun;
struct NInt;
struct NBool;
struct NAp;
struct NCons;
struct NNil;
struct NHole;
struct NodeVisitor {
virtual ~NodeVisitor() {}
virtual void visitNFun(NFun* n) = 0;
virtual void visitNInt(NInt* n) = 0;
virtual void visitNBool(NBool* n) = 0;
virtual void visitNAp(NAp* n) = 0;
virtual void visitNCons(NCons* n) = 0;
virtual void visitNNil(NNil* n) = 0;
virtual void visitNHole(NHole* n) = 0;
};
struct Node {
virtual ~Node() {}
virtual string to_string() const = 0;
virtual void visit(NodeVisitor* v) = 0;
};
struct NHole : public Node {
NHole() {}
string to_string() const { return "NHole"; }
void visit(NodeVisitor* v) { v->visitNHole(this); }
};
struct NFun : public Node {
NFun(ptrdiff_t address, unsigned args) : address(address), args(args) {}
string to_string() const {
return "NFun " + ::to_string(address);
}
void visit(NodeVisitor* v) { v->visitNFun(this); }
ptrdiff_t address;
unsigned args;
};
struct NInt : public Node {
NInt(ptrdiff_t i) : i(i) {}
string to_string() const {
return "NInt " + ::to_string(i);
}
void visit(NodeVisitor* v) { v->visitNInt(this); }
ptrdiff_t i;
};
struct NBool : public Node {
NBool(bool b) : b(b) {}
string to_string() const {
return "NBool " + ::to_string(b);
}
void visit(NodeVisitor* v) { v->visitNBool(this); }
bool b;
};
struct NAp : public Node {
NAp(Node* a1, Node* a2) : a1(a1), a2(a2) {}
string to_string() const {
std::ostringstream os;
os << "NAp (" << a1->to_string() << " " << a2->to_string() << ")";
return os.str();
}
void visit(NodeVisitor* v) { v->visitNAp(this); }
Node* a1;
Node* a2;
};
struct NCons: public Node {
NCons(Node* hd, Node* tl) : hd(hd), tl(tl) {}
string to_string() const {
return "("+hd->to_string()+":" + tl->to_string() +")";
}
void visit(NodeVisitor* v) { v->visitNCons(this); }
Node* hd;
Node* tl;
};
struct NNil: public Node {
NNil() {}
string to_string() const {
return "nil";
}
void visit(NodeVisitor* v) { v->visitNNil(this); }
};
struct Instruction {
Instruction():ins(STOP),dest(0),node(nullptr) {}
Instruction(InstructionType ins) : ins(ins),dest(0),node(nullptr) {}
Instruction(InstructionType ins, bool b) : ins(ins),dest(0),node(nullptr),b(b) {}
Instruction(InstructionType ins, unsigned n) : ins(ins),dest(0),node(nullptr),n(n) {}
Instruction(InstructionType ins, size_t n) : ins(ins),dest(0),node(nullptr),n(n) {}
Instruction(InstructionType ins, ptrdiff_t dest) : ins(ins),dest(dest),node(nullptr) {}
Instruction(InstructionType ins, NFun* node) : ins(ins),dest(0),node(node) {}
InstructionType ins;
ptrdiff_t dest;
NFun* node;
union {
unsigned n;
int i;
bool b;
};
};
struct CodeArray {
vector<Instruction> code;
void add(const Instruction& i) {
code.push_back(i);
}
void add(InstructionType ins) { add(Instruction(ins)); }
void add(InstructionType ins, bool b) { add(Instruction(ins,b)); }
void add(InstructionType ins, unsigned n) { add(Instruction(ins,n)); }
void add(InstructionType ins, size_t n) { add(Instruction(ins,n)); }
void add(InstructionType ins, ptrdiff_t dest) { add(Instruction(ins,dest)); }
void add(InstructionType ins, NFun* node) { add(Instruction(ins,node)); }
};
struct AddressMode {
enum Mode { Local, Global };
Mode mode;
union { unsigned localIndex; /*ptrdiff_t address;*/ NFun* node; };
AddressMode(NFun* node) : mode(Global), node(node) {}
AddressMode() : mode(Local) {}
};
string instructionToString(const Instruction& ins) {
string rv = insToString(ins.ins);
switch (ins.ins) {
case JFALSE:
case JMP:
case PUSHBASIC: rv += " " + ::to_string(ins.dest); break;
case PUSHBOOL: rv += " " + ::to_string(ins.b); break;
case PUSHINT: rv += " " + ::to_string(ins.dest); break;
case PUSHFUN: rv += " " + ins.node->to_string(); break;
case ALLOC:
case PUSH:
case UPDATE:
case SLIDE:
case RET:
rv += " " + ::to_string(ins.n); break;
case UNWIND:
case STOP:
break;
default:
break;
}
return rv;
}
string instructionToString(const Instruction* ins) {
return instructionToString(*ins);
}
struct EnvItem {
EnvItem() : args(), mode() {}
int args;
AddressMode mode;
};
typedef map<string,EnvItem> Env;
string amToString(AddressMode m) {
switch (m.mode) {
case AddressMode::Local: return "local "+::to_string(m.localIndex);
case AddressMode::Global: return "global "+::to_string(m.node->address);
}
return "--";
}
static
void pprint_env(const Env& env) {
for (auto i: env) {
//cerr << "env "<<i.first <<" entry "<<i.second << flush;/*, env, entry); fflush(stdout);*/
//printf(" %s args %d mode %s\n", entry->name, entry->args, amToString(entry->mode.mode));
cerr << i.first << " args " << i.second.args << ' ' << amToString(i.second.mode) << endl;
}
}
typedef list<Node*> GmStack;
GmStack nodeStack;
typedef list<ptrdiff_t> ValueStack;
ValueStack valueStack;
struct DumpItem {
GmStack nodeStack;
ptrdiff_t code;
};
typedef list<DumpItem> Dump;
Dump dump;
void showStack(const string& label) {
cerr << label << endl;
for (auto s : nodeStack) {
cerr << /*s << ' ' <<*/ '[' << s->to_string() << "] ";
}
cerr << endl;
}
void showValues(const string& label) {
cerr << label << endl;
for (auto s : valueStack) {
cerr << /*s << ' ' <<*/ '[' << ::to_string(s) << "] ";
}
cerr << endl;
}
void stepPushBool(const Instruction& ins) {
showStack("Stack before pushBool");
nodeStack.push_front(new NBool(ins.b));
showStack("Stack after pushBool");
}
void stepPushFun(NFun* sc) {
showStack("Stack before pushFun");
nodeStack.push_front(sc);
showStack("Stack after pushFun");
}
void stepPushInt(ptrdiff_t i) {
showStack("Stack before pushInt");
nodeStack.push_front(new NInt(i));
showStack("Stack after pushInt");
}
void stepPushNil() {
showStack("Stack before pushNil");
nodeStack.push_front(new NNil());
showStack("Stack after pushNil");
}
void stepMkAp() {
showStack("Stack before mkap");
Node* a2 = nodeStack.front(); nodeStack.pop_front();
Node* a1 = nodeStack.front(); nodeStack.pop_front();
nodeStack.push_front(new NAp(a1, a2));
showStack("Stack after mkap");
}
void stepPush(unsigned n) {
showStack("Stack before push");
unsigned i=0;
for (const auto& se : nodeStack) {
cerr << i << ": " << se << ' ' << se->to_string() << endl;
++i;
}
auto p = nodeStack.begin();
#if 1
advance(p,n);
Node* node = *p;
//auto ap = dynamic_cast<NAp*>(node);
//assert(ap);
//auto arg = ap->a2;
//nodeStack.push_front(arg);
nodeStack.push_front(node);
#else
advance(p,n);
Node* node = *p;
cerr << "Push: About to pull " << node->to_string() << " up to top " << endl;
auto ap = dynamic_cast<NAp*>(node);
assert(ap);
auto arg = ap->a2;
nodeStack.push_front(arg);
#endif
cerr << "Stack after push " << endl;
i=0;
for (const auto& se : nodeStack) {
cerr << i << ": " << se << ' ' << se->to_string() << endl;
++i;
}
}
void stepSlide(int n) {
throw __PRETTY_FUNCTION__ + string(" rewrite for G");
showStack("stack before slide "+::to_string(n));
auto a0 = nodeStack.front();
nodeStack.pop_front();
for (int i=1; i<=n; ++i)
nodeStack.pop_front();
nodeStack.push_front(a0);
showStack("Stack after slide");
}
void stepUpdate(unsigned m) {
// <o, UPDATE m.c, n0 n1 ... nm.s, v, G[n0:N0, nm:Nm], E, D>
// => <o, c, n1 ... nm.s, v, G[n0:N0, nm:N0], E, D>
// Meaning,
// Take the node from the top of the stack and put it at the mth position on the stack
// Drop the top node from the stack
// The instruction is done.
//
// This means that there must be m+1 stack entries available.
// The dump does not save you.
showStack("stack before update "+::to_string(m));
if (nodeStack.size()<(m+1)) {
cerr << "Judgment " << nodeStack.size() << " vs " << (m+1) << " is " << (nodeStack.size()>(m+1)) << " Stack size " << nodeStack.size() << " not big enough for update " << m << endl;
throw "Bad Update";
}
Node* tos = nodeStack.front(); nodeStack.pop_front();
showStack("stack during update "+::to_string(m));
auto p = nodeStack.begin();
advance(p, m-1);
//cerr << "distance(gmStack.begin(),p) " << distance(nodeStack.begin(),p)
// << " gmStack.size() " << nodeStack.size() << endl;
//assert((unsigned)distance(gmStack.begin(),p) < gmStack.size());
*p = tos;//new NInd(tos);
showStack("Stack after update");
}
list<Node*> tl(list<Node*> x) {
auto r = x;
r.pop_front();
return r;
}
list<Node*> take(unsigned t, list<Node*> x) {
list<Node*> r;
list<Node*>::const_iterator px = x.begin();
for (unsigned i=0; i<t; i++)
{
r.push_back(*px++);
}
return r;
}
list<Node*> drop(unsigned d, list<Node*> x) {
list<Node*> r = x;
auto px = next(r.begin(),d);
r.erase(r.begin(), px);
return r;
}
list<Node*> concat(list<Node*> a, list<Node*> b) {
list<Node*> r = a;
r.insert(r.end(), b.begin(), b.end());
return r;
}
list<Node*> rearrange(unsigned n, list<Node*> as) {
auto asp = mapf(tl(as), [](Node* el) {
auto ap=dynamic_cast<NAp*>(el);
if (ap) {
return ap->a2;
}
return el;
});
return concat(take(n, asp), drop(n, as));
}
struct UnwindNodeVisitor : public NodeVisitor {
UnwindNodeVisitor(ptrdiff_t& pc) : pc(pc),done(false) {}
ptrdiff_t& pc;
bool done;
void visitNFun(NFun* gtop) {
if (nodeStack.size() < gtop->args) {
cerr << __PRETTY_FUNCTION__ << ": stack " << nodeStack.size() << " not enough for " << gtop->args << " arguments" << endl;
}
// <o, UNWIND.(), n0...nk.s, v, G[n0=FUN f,n1...nk=AP], E[f=(k,c)], D> ;; i.e. there are k+1 stack nodes at least.
// => <o, c, arg1...argk.s,v, G, E, D>
// Enough args:
// Drop all the nodes n0..nk, push the arguments and jump to the function code.
//
// <o, UNWIND.(), n0...nk.(), v, G[n0=FUN f,n1...nk=AP], E[f=(a,c)], (c,s').D> ;; k<a not enough
// => <o, c, nk.s', v, G, E, D>
// NOT enough args:
// Pop a dump item.
// Switch to dump item stack
// push nk from previous stack.
// Execute code from dump item.
if (nodeStack.size() >= (gtop->args+1)) {
showStack("Stack before fun unwind");
GmStack spine;
GmStack::const_iterator p=nodeStack.begin(); // where NFun is.
++p; // first argument;
for (unsigned i=0; i<gtop->args; ++i) {
Node* a = *p++;
NAp* c = dynamic_cast<NAp*>(a);
if (c == nullptr) {
cerr << "argument should be NAp but isn't" << endl;
throw "Bad arg";
}
spine.push_back(c->a2);
}
cerr << __PRETTY_FUNCTION__<< " Spine [";
for (const auto& se : spine) {
cerr << ' ' << se->to_string();
}
cerr << "] " << spine.size() << " elements. We need " << gtop->args << " of these." << endl;
cerr << __PRETTY_FUNCTION__ << " Fun " << gtop->to_string() << endl;
cerr << __PRETTY_FUNCTION__ << " "; showStack("original stack before rearranging");
nodeStack = concat(take(gtop->args, spine), drop(gtop->args,nodeStack));
showStack("Stack during fun unwind");
pc = gtop->address;
} else {
showStack("Stack before fun unwind given "+::to_string(nodeStack.size())+" needing "+::to_string(gtop->args));
DumpItem d = dump.front(); dump.pop_front();
auto nodeK = nodeStack.back();
nodeStack = d.nodeStack;
nodeStack.push_back(nodeK);
//throw "Unwind needs to use dump";
pc = d.code;
showStack("Stack during fun unwind with grab from dump");
}
done = true;
}
void visitNAp(NAp* aptop) {
// <o, UNWIND.(), n.s, v, G[n=Ap n1,n2], E, D>
// => <o, UNWIND.(), n1.n.s, v, G[n=Ap n1,n2], E, D>
// That is, Take the fun graph from the Nap and push it to the node stack.
// Then repeat UNWIND
//cerr << "aptop " << aptop->to_string() << endl;
//cerr << "aptop.a1 " << aptop->a1->to_string() << " aptop.a2 " << aptop->a2->to_string() << endl;
nodeStack.push_front(aptop->a1);
showStack("Stack during ap unwind");
//pc--; // instead of backing up, we reiterate directly.
}
void visitNInt(NInt*) { throw "don't unwind INT"; }
void visitNBool(NBool*) { throw "don't unwind BOOL"; }
void visitNCons(NCons*) { throw "don't unwind Cons"; }
void visitNNil(NNil*) { throw "don't unwind Nil"; }
void visitNHole(NHole*) { throw "Don't unwind a hole";}
};
void stepEval(/*const Instruction& instr,*/ ptrdiff_t& pc);
void stepPrint(const Instruction& ins, ptrdiff_t& pc);
struct PrintNodeVisitor : public NodeVisitor {
PrintNodeVisitor() : done(false) {}
bool done;
void visitNInt(NInt* n) {
cout << n->i;//n->to_string();
nodeStack.pop_front();
done = true;
}
void visitNBool(NBool* n) {
cout << (n->b?"true":"false");//n->to_string();
nodeStack.pop_front();
done = true;
}
void visitNCons(NCons* n) {
#if 1
nodeStack.push_front(n->tl);
nodeStack.push_front(n->hd);
ptrdiff_t pc = 0;
Instruction p(PRINT);
stepEval(pc);
stepPrint(p, pc);
stepEval(pc);
stepPrint(p,pc);
nodeStack.pop_front();
done = true;
#endif
//throw "don't print Cons yet";
}
void visitNNil(NNil*) { /*cerr << n->to_string();*/ nodeStack.pop_front(); done=true;}
void visitNFun(NFun*) {
throw "Don't print a fun";
}
void visitNAp(NAp*) {
throw "Don't print an apply";
}
void visitNHole(NHole*) {
throw "Don't print a hole";
}
};
// Unwind will cause a jump if the top node is an NFun.
void stepUnwind(ptrdiff_t& pc) {
showStack("Stack before unwind");
UnwindNodeVisitor visitor(pc);
while (!visitor.done) {
Node* top = nodeStack.front();
cerr << "Unwind viewing " << top->to_string() << " from top of stack of size " << nodeStack.size() << endl;
top->visit(&visitor);
}
showStack("Stack after unwind");
}
void stepPrint(const Instruction& ins, ptrdiff_t& pc) {
showStack("Stack before print");
PrintNodeVisitor visitor;
while (!visitor.done) {
nodeStack.front()->visit(&visitor);
}
showStack("Stack after print");
}
void stepPushBasic(const Instruction& ins) {
showValues("Stack before pushbasic");
valueStack.push_front(ins.dest);
showValues("Stack after pushbasic");
}
void stepUnop(const Instruction& ins){
showValues("Stack before "+instructionToString(ins));
if (valueStack.size() < 1)
throw string(insToString(ins.ins))+" Value stack doesn't have an operand";
switch (ins.ins) {
case NEG: valueStack.front() = -valueStack.front(); break;
case NOT: valueStack.front() = !valueStack.front(); break;
case NULLinst: {
auto nilp = dynamic_cast<NNil*>(nodeStack.front());
auto res = (nilp != NULL);
nodeStack.pop_front();
valueStack.push_front(res);
break;
}
case HD: {
auto cons = dynamic_cast<NCons*>(nodeStack.front());
nodeStack.front() = cons->hd;
break;
}
case TL: {
auto cons = dynamic_cast<NCons*>(nodeStack.front());
nodeStack.front() = cons->tl;
break;
}
default: throw "Unimplemented math in stepBinop";
}
showValues("Stack after "+instructionToString(ins));
}
void stepBinop(const Instruction& ins) {
showValues("Stack before "+instructionToString(ins));
if (valueStack.size() < 2)
throw string(insToString(ins.ins))+" Value stack doesn't have two operands";
auto right = valueStack.front(); valueStack.pop_front();
auto left = valueStack.front();
switch (ins.ins) {
case ADD: valueStack.front() = left+right; break;
case SUB: valueStack.front() = left-right; break;
case MUL: valueStack.front() = left*right; break;
case DIV: valueStack.front() = left/right; break;
case MOD: valueStack.front() = left%right; break;
case LT: valueStack.front() = (left<right); break;
case GT: valueStack.front() = (left>right); break;
case LE: valueStack.front() = (left<=right); break;
case GE: valueStack.front() = (left>=right); break;
case NE: valueStack.front() = (left!=right); break;
case EQ: valueStack.front() = (left==right); break;
default: throw "Unimplemented math in stepBinop";
}
showValues("Stack after "+instructionToString(ins));
}
void stepMkBool() {
showValues("Stack before MKBOOL");
nodeStack.push_front(new NBool(!!valueStack.front()));
valueStack.pop_front();
showStack("Stack after MKBOOL");
}
void stepMkInt() {
showValues("Stack before MKINT");
nodeStack.push_front(new NInt(valueStack.front()));
valueStack.pop_front();
showStack("Stack after MKINT");
}
void stepRet(const Instruction& ins, ptrdiff_t& pc) {
showStack("Before RET "+::to_string(ins.n));
if (nodeStack.size() < ins.n)
throw "Stack underflow";
for (unsigned n=0; n<ins.n; n++)
nodeStack.pop_front();
showStack("RET after popping "+::to_string(ins.n));
if (nodeStack.size()<1)
throw "No whnf node left on stack";
while (true) {
auto ap = dynamic_cast<NAp*>(nodeStack.front());
if (ap) {
pc = 1;
break;
}
auto fn = dynamic_cast<NFun*>(nodeStack.front());
if (fn) {
pc = 1;
break;
}
// New way: Assume that nodes that arent FUN, IND or AP are
// whnf already
if (dump.size()==0)
{
pc = 0; // halt when there's no dump.
break;
}
// Pop the dump and push the whnf node onto that stack.
// Then continue from PC saved in dump.
auto n = nodeStack.front();
auto d = dump.front(); dump.pop_front();
nodeStack = d.nodeStack;
pc = d.code;
nodeStack.push_front(n);
break;
// Old way
auto i = dynamic_cast<NInt*>(nodeStack.front());
if (i) {
// If the DUMP is empty we stop
pc = 0;
break;
}
auto b = dynamic_cast<NBool*>(nodeStack.front());
if (b) {
pc = 0;
break;
}
break;
};
showStack("After RET");
}
void stepEval(/*const Instruction& instr,*/ ptrdiff_t& pc) {
while (true) {
showStack("Before iteration of EVAL");
auto ap = dynamic_cast<NAp*>(nodeStack.front());
if (ap) {
//throw "Eval of apply needs to add to dump";
DumpItem e;
e.code = pc; // instruction after Eval.
e.nodeStack = nodeStack;
e.nodeStack.pop_front();
dump.push_front(e);
if (nodeStack.size()>1) {
nodeStack.erase(next(nodeStack.begin()),nodeStack.end());
}
pc = 1; // Go to unwind
break;
}
// All other nodes are whnf and need no further effort.
break;
}
showStack("After EVAL");
}
void stepGet(/*const Instruction& instr*/) {
showStack("Before GET");
while (true)
{
auto i = dynamic_cast<NInt*>(nodeStack.front());
if (i) {
// If the DUMP is empty we stop
nodeStack.pop_front();
valueStack.push_front(i->i);
break;
}
auto b = dynamic_cast<NBool*>(nodeStack.front());
if (b) {
nodeStack.pop_front();
valueStack.push_front(b->b);
break;
}
throw "GET wrong node type";
}
showValues("After GET");
}
void stepJFalse(const Instruction& ins, ptrdiff_t& pc) {
auto truth = valueStack.front(); valueStack.pop_front();
if (!truth)
pc = ins.dest;
}
void stepJmp(const Instruction& ins, ptrdiff_t& pc) {
pc = ins.dest;
}
void stepCons(const Instruction& ins) {
showStack("Before CONS");
auto tl = nodeStack.front(); nodeStack.pop_front();
auto hd = nodeStack.front(); nodeStack.pop_front();
nodeStack.push_front(new NCons(hd, tl));
showStack("After CONS");
}
void stepAlloc(const Instruction& ins) {
cerr << __PRETTY_FUNCTION__ << " Allocating local vars " << ins.n << endl;
for (unsigned i=0; i<ins.n; i++) {
nodeStack.push_back(new NHole());
}
}
bool step(CodeArray& code, ptrdiff_t& pc) {
Instruction instr = code.code[pc++];
switch (instr.ins) {
/* Label is for over-completeness. It's used in the paper but not here */
case LABEL: throw "Unknown instruction in step"; break;
case ALLOC: stepAlloc(instr); break;
case ADD: stepBinop(instr); break;
case CONS: stepCons(instr); break;
case DIV:
case EQ: stepBinop(instr); break;
case EVAL: stepEval(/*instr,*/ pc); break;
case GE: stepBinop(instr); break;
case GET: stepGet(/*instr*/); break;
case GT: stepBinop(instr); break;
case HD: stepUnop((instr)); break;
case JFALSE: stepJFalse(instr, pc); break;
case JMP: stepJmp(instr, pc); break;
case LE:
case LT: stepBinop(instr); break;
case MKAP: stepMkAp(); break;
case MKBOOL: stepMkBool(); break;
case MKINT: stepMkInt(); break;
case MOD:
case MUL:
case NE: stepBinop(instr); break;
case NEG: stepUnop(instr); break;
case NOT: stepUnop(instr); break;
case NULLinst: stepUnop(instr); break;
case PRINT: stepPrint(instr,pc); break;
case PUSH: stepPush(instr.n); break;
case PUSHBASIC: stepPushBasic(instr); break;
case PUSHBOOL: stepPushBool(instr); break;
case PUSHFUN: stepPushFun(instr.node); break;
case PUSHINT: stepPushInt(instr.dest); break;
case PUSHNIL: stepPushNil(); break;
case RET: stepRet(instr, pc); break;
case SLIDE: stepSlide(instr.n); break;
case SUB: stepBinop(instr); break;
case TL: stepUnop(instr); break;
case UPDATE: stepUpdate(instr.n); break;
case UNWIND: stepUnwind(pc); break;
case STOP: break;
case zzzmaxInstr: break; // dummy value
}
return instr.ins != STOP;
}
static
void envAddArgs(Env& env, const list<string> args) {
int kArg = args.size()+1;
for (auto arg : args) {
EnvItem entry;
//entry.name = arg;
entry.mode.mode = AddressMode::Local;
entry.mode.localIndex = kArg;
kArg--;
env[arg] = entry;
}
}
static
bool find_mode(const Env& env, const string& var, AddressMode* mode) {
auto p = env.find(var);
if (p != env.end()) {
*mode = p->second.mode;
return true;
}
return false;
}
//F[f x1 ... xm = e] = E[e] r (m+1); UPDATE (m+1); RET m;
// r = [x1=m+1, x2=m, ..., xm = 2]
unsigned r(unsigned i, unsigned m) {
return m+1-i;
}
void compileC(CodeArray& code, Expr* expr, const Env& env, unsigned depth);
void compileE(CodeArray& code, Expr* expr, Env& env, unsigned depth);
void compileB(CodeArray& code, Expr* expr, Env& env, unsigned depth);
struct CompileCVisitor : public ExprVisitor {
CompileCVisitor(CodeArray& code, const Env& env, unsigned depth) : code(code), env(env), depth(depth) {}
CodeArray& code;
const Env& env;
unsigned depth;
void visitExprNum(ExprNum* eint) {
code.add(Instruction(PUSHINT,eint->value));
}
void visitExprVar(ExprVar* evar) {
auto pm = env.find(evar->var);
if (pm != env.end()) {
switch (pm->second.mode.mode) {
case AddressMode::Local: {
code.add(Instruction(PUSH,depth-pm->second.mode.localIndex+1));
break;
}
case AddressMode::Global: code.add(Instruction(PUSHFUN,pm->second.mode.node)); break;
}
return;
}
cerr << __PRETTY_FUNCTION__ << " Can't find " << evar->var << " in "; pprint_env(env);
}
void visitExprApp(ExprApp* eapp) {
/*
* C[e1 e2] r n = C[e1] r n; C[e2] r n+1; MKAP
*/
#ifdef BIG_LIST_AP
int shiftCount = 0;
compileC(code, eapp->fun, env, depth);
shiftCount++;
auto pArg = eapp->args.begin();
while (pArg != eapp->args.end()) {
compileC(code, *pArg++, env, depth+shiftCount); shiftCount++;
code.add(Instruction(MKAP));
}
#else
compileC(code, eapp->fun, env, depth);
compileC(code, eapp->arg, env, depth+1);
code.add(Instruction(MKAP));
#endif
}
pair<Env,unsigned> compileXr(list<ExprLet::Binding>& d, const Env& env, unsigned depth) {
Env env2 = env;
unsigned a = 1;
for (auto binding: d) {
EnvItem e; e.args = 0; e.mode.mode = AddressMode::Local; e.mode.localIndex = a++;
env2[binding.name] = e;
}
auto m = d.size()+depth;
return make_pair(env2,m);
}
void compileCletrec(list<ExprLet::Binding>& d, const Env& env, unsigned n, unsigned m) {