-
Notifications
You must be signed in to change notification settings - Fork 1
/
code_ast.cpp
1294 lines (1010 loc) · 43.2 KB
/
code_ast.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
#include <cstdio>
#include <iostream>
#include "code_ast.hpp"
using namespace llvm;
using namespace std;
/*
g++ -fPIC -g -I/usr/lib/llvm-2.8/lib -I/usr/lib/llvm-2.8/include -I/usr/lib/llvm/lib -I/usr/lib/llvm/include `/usr/lib/llvm-2.8/bin/llvm-config --cppflags --ldflags --libs core native` -c -Wl,export-dynamic -Wall code_generator.cpp
g++ -shared -Wl,-soname,libstruct.so -o libstruct.so structSize.o -I/usr/lib/llvm-2.8/lib -I/usr/lib/llvm-2.8/include `/usr/lib/llvm-2.8/bin/llvm-config --cppflags --ldflags --libs core native` -lc
*/
static llvm::Module * theModule;
#define DEBUG false
//SimpleNode
SimpleNode::SimpleNode(){}
SimpleNode::SimpleNode( node_struct& s ){
if(DEBUG) cout << s.type << " " << s.value << " " << s.id << "\n";
uniqueId = s.id;
value = string(s.value);
position = s.position;
numberOfChildren = s.numberOfChildren;
if( string(s.type).compare( "OPERATOR" ) == 0 ){
this -> type = OP;
} else if( string(s.type).compare( "VARIABLE" ) == 0 ){
this -> type = VAR;
} else if( string(s.type).compare( "CONSTANT" ) == 0 ){
this -> type = CONST;
} else if( string(s.type).compare( "TYPE" ) == 0 ){
this -> type = TYPE;
} else if( string(s.type).compare( "RETURN" ) == 0 ){
this -> type = RET;
} else if( string(s.type).compare( "IF" ) == 0 ){
this -> type = IF;
} else if( string(s.type).compare( "ELSE_IF" ) == 0 ){
this -> type = IF;
} else if( string(s.type).compare( "ELSE" ) == 0 ){
this -> type = ELSE;
} else if( string(s.type).compare( "END_IF" ) == 0 ){
this -> type = END_IF;
} else if( string(s.type).compare( "WHILE" ) == 0 ){
this -> type = WHILE;
} else if( string(s.type).compare( "ARRAY" ) == 0 ){
this -> type = ARRAY;
} else if( string(s.type).compare( "ARRAY_ELEM" ) == 0 ){
this -> type = ARRAY_ELEM;
} else if( string(s.type).compare( "FUNCTION" ) == 0 ){
this -> type = FUNC;
} else if( string(s.type).compare( "FUNCTION_DEFINITION" ) == 0 ){
this -> type = FUNC_DEF;
} else if( string(s.type).compare( "FUNCTION_CALL" ) == 0 ){
this -> type = FUNC_CALL;
} else if( string(s.type).compare( "LOOKING_GLASS" ) == 0 ){
this -> type = LOOK_DEF;
} else if( string(s.type).compare( "IO" ) == 0 ){
this -> type = IO;
} else if( string(s.type).compare( "ROOT" ) == 0 ){
this -> type = ROOT;
} else if( string(s.type).compare( "THOUGHT" ) == 0 ){
this -> type = COMMENT;
}
SimpleNode * child;
for(int i = 0; i < numberOfChildren; i++){
child = new SimpleNode( *s.children[i]);
children.push_back(child);
}
}
SimpleNode::SimpleNode(std::string uniqueId, std::string type, std::string op, std::string args ){
this -> uniqueId = atoi( uniqueId.c_str() );
if( type.compare( "OP" ) == 0 ){
this -> type = OP;
} else if( type.compare( "VAR" ) == 0 ){
this -> type = VAR;
} else if( type.compare( "CONST" ) == 0 ){
this -> type = CONST;
} else if( type.compare( "TYPE" ) == 0 ){
this -> type = TYPE;
} else if( type.compare( "RET" ) == 0 ){
this -> type = RET;
} else if( type.compare( "IF" ) == 0 ){
this -> type = IF;
} else if( type.compare( "WHILE" ) == 0 ){
this -> type = WHILE;
}
if( op.compare( "NONE" ) == 0 ){
this -> op = NONE;
} else if( op.compare( "ADD" ) == 0 ){
this -> op = ADD;
} else if( op.compare( "OR" ) == 0 ){
this -> op = OR;
} else if( op.compare( "XOR" ) == 0 ){
this -> op = XOR;
} else if( op.compare( "AND" ) == 0 ){
this -> op = AND;
} else if( op.compare( "SUB" ) == 0 ){
this -> op = SUB;
} else if( op.compare( "MUL" ) == 0 ){
this -> op = MUL;
} else if( op.compare( "DIV" ) == 0 ){
this -> op = DIV;
} else if( op.compare( "MOD" ) == 0 ){
this -> op = MOD;
} else if( op.compare( "UNR" ) == 0 ){
this -> op = UNR;
} else if( op.compare( "NOT" ) == 0 ){
this -> op = NEG;
} else if( op.compare( "EQUAL" ) == 0 ){
this -> op = E;
} else if( op.compare( "G" ) == 0 ){
this -> op = G;
} else if( op.compare( "S" ) == 0 ){
this -> op = S;
} else if( op.compare( "GOE" ) == 0 ){
this -> op = GOE;
} else if( op.compare( "SOE" ) == 0 ){
this -> op = SOE;
}
this -> data = args;
}
void SimpleNode::debug(){
if(DEBUG) printf( "#%d - %d - %d\n", uniqueId, type, op );
}
NodeType SimpleNode::getType(){
return type;
}
OPType SimpleNode::getOP(){
return op;
}
int SimpleNode::getId(){
return uniqueId;
}
string SimpleNode::getData(){
return data;
}
//Node
Node::Node( SimpleNode& s ){
uniqueId = s.getId();
if(DEBUG)cout << "UI" << uniqueId << "\n";
type = s.getType();
op = s.getOP();
data = s.getData();
generated = false;
}
bool Node::wasGenerated(){
//if( type == RET) return true;
return generated;
}
Node * Node::createNode( SimpleNode& node){
if(DEBUG)cout << "CreateFrom:" << node.uniqueId << "\n";
Node* newNode;
std::map<int, Node*> nodes;
std::list<std::pair<int, int> > connectionsQueue;
switch( node.getType() ){
case OP: newNode = Node::createOPNode( node, connectionsQueue ); nodes[ newNode -> getId() ] = newNode; break;
case VAR: newNode = Node::createVARNode( node, connectionsQueue ); nodes[ newNode -> getId() ] = newNode; break;
case CONST: newNode = Node::createCONSTNode( node, connectionsQueue ); nodes[ newNode -> getId() ] = newNode; break;
case TYPE: newNode = Node::createTYPENode( node, connectionsQueue ); nodes[ newNode -> getId() ] = newNode; break;
case RET: newNode = Node::createRETNode( node, connectionsQueue ); nodes[ newNode -> getId() ] = newNode; break;
case IF: newNode = Node::createIFNode( node, connectionsQueue ); nodes[ newNode -> getId() ] = newNode; break;
case WHILE: newNode = Node::createWHILENode( node, connectionsQueue ); nodes[ newNode -> getId() ] = newNode; break;
case ROOT: newNode = new ROOTNode( node ); nodes[ newNode -> getId() ] = newNode; break;
case ARRAY_ELEM: newNode = Node::createARRAYELNode( node, connectionsQueue ); nodes[ newNode -> getId() ] = newNode; break;
case ELSE: newNode = Node::createELSENode( node, connectionsQueue ); nodes[ newNode -> getId() ] = newNode; break;
case END_IF: newNode = Node::createENDIFNode( node, connectionsQueue ); nodes[ newNode -> getId() ] = newNode; break;
case IO: newNode = new IONode( node ); nodes[ newNode -> getId() ] = newNode; break;
case FUNC_CALL: newNode = new FUNCTIONCALLNode( node ); nodes[ newNode -> getId() ] = newNode; break;
case FUNC_DEF: newNode = new FUNCTIONDEFNode( node ); break;
case FUNC: newNode = new FUNCTIONNode( node ); break;
default: newNode = new COMMENTNode( node ); ; break;
}
Node * child;
if(DEBUG)if(node.numberOfChildren>0)cout << "Generating children\n"<<"NOC:"<<node.numberOfChildren<<"\n";
for(int i = 0; i < node.numberOfChildren; i++){
if(DEBUG)cout << "Child:" << ( *node.children[i] ).uniqueId << "\n";
child = Node::createNode( *node.children[i] );
newNode -> children.push_back(child);
child -> debug();
}
return newNode;
}
Node * Node::createAST( node_struct &node ){
if(DEBUG)cout << "CreateAST\n";
SimpleNode * root = new SimpleNode( node );
Node * rootN = Node::createNode( *root );
return rootN;
}
Node * Node::createOPNode( SimpleNode& simpleNode, std::list<std::pair<int, int> >& connections ){
Node * node = new OPNode( simpleNode );
return node;
}
Node * Node::createCONSTNode( SimpleNode& simpleNode, std::list<std::pair<int, int> >& connections){
Node * node = new CONSTNode( simpleNode );
return node;
}
Node * Node::createTYPENode( SimpleNode& simpleNode, std::list<std::pair<int, int> >& connections){
Node * node = new TYPENode( simpleNode );
node -> allocated = false;
return node;
}
Node * Node::createVARNode( SimpleNode& simpleNode, std::list<std::pair<int, int> >& connections){
Node * node = new VARNode( simpleNode );
return node;
}
Node * Node::createRETNode( SimpleNode& simpleNode, std::list<std::pair<int, int> >& connections){
Node * node = new RETNode( simpleNode );
return node;
}
Node * Node::createIFNode( SimpleNode& simpleNode, std::list<std::pair<int, int> >& connections){
Node * node = new IFNode( simpleNode );
return node;
}
Node * Node::createWHILENode( SimpleNode& simpleNode, std::list<std::pair<int, int> >& connections){
Node * node = new WHILENode( simpleNode );
return node;
}
Node * Node::createARRAYELNode( SimpleNode& simpleNode, std::list<std::pair<int, int> >& connections){
Node * node = new ARRAYELNode( simpleNode );
return node;
}
Node * Node::createELSENode( SimpleNode& simpleNode, std::list<std::pair<int, int> >& connections){
Node * node = new ELSENode( simpleNode );
return node;
}
Node * Node::createENDIFNode( SimpleNode& simpleNode, std::list<std::pair<int, int> >& connections){
Node * node = new ENDIFNode( simpleNode );
return node;
}
void Node::addChild( Node* n ){
children.push_back(n);
//printf("Add child %d\n", n -> getId() );
}
VarType Node::getVarType(){
return varType;
}
void Node::setVarType( VarType v ){
varType = v;
}
string Node::getVarId(){
return varId;
}
void Node::setVarId( string s ){
varId = s;
}
Value * Node::getValue(){
return valueLlvm;
}
void Node::setValue( Value * v ){
valueLlvm = v;
}
string Node::getValueString(){
return valueString;
}
void Node::setValueString( string v ){
valueString = v;
}
int Node::getValueNumber(){
return valueNumber;
}
void Node::setValueNumber( int v ){
valueNumber = v;
}
char Node::getValueLetter(){
return valueLetter;
}
void Node::setValueLetter( char l ){
valueLetter = l;
}
//VARNode
VARNode::VARNode( SimpleNode& s) : Node( s ){
setVarId(s.value);
}
//Sets pointer to memory allocated for this variable
void VARNode::setAlloca( AllocaInst * a){
alloca = a;
}
//Loads variable from memory location
Value * VARNode::codeGen(IRBuilder<> & Builder, Environment<Node>& env, llvm::Module * theModule){
//Check if variable has been allocated
if( env.get( getVarId() ) -> getType() == ARG){
return env.get( getVarId() ) -> codeGen( Builder, env, theModule );
} else if( env.is( getVarId() ) ){
//Get memory location
alloca = env.get( getVarId() ) -> alloca;
//Load data
Value * V = Builder.CreateLoad( alloca );
return V;
} else return ConstantInt::get( Type::getInt32Ty( getGlobalContext() ), 0 );
}
ROOTNode::ROOTNode( SimpleNode& s) : Node(s){};
//CONSTNode
CONSTNode::CONSTNode( SimpleNode& s) : Node( s ){
VarType v;
//Determine type of CONSTNode
if( s.children[0] -> value.compare( "number" ) == 0 ){
v = NUMBER ;
} else if( s.children[0] -> value.compare( "letter" ) == 0 ){
v = LETTER ;
} else if( s.children[0] -> value.compare( "sentence" ) == 0 ){
v = STRING ;
} else if( s.children[0] -> value.compare( "argument" ) == 0 ){
v = T_NONE ;
}
//Set its value
switch( v ){
case STRING: setValueString( s.value ); break;
case NUMBER: setValueNumber( atoi(s.value.c_str()) ); break;
case LETTER: setValueLetter( s.value[0] ); break;
}
}
//Returns Value of the constant
Value* CONSTNode::codeGen(IRBuilder<> & Builder, Environment<Node>& env, llvm::Module * theModule){
generated = true;
typeNode = (TYPENode*)children[0];
if(DEBUG) printf("CONSTNode::codeGen %d\n", uniqueId );
//Check type and generate corresponding code
switch( typeNode -> getVarType() ){
case STRING: return val = CONSTNode::codeGenSTRING( *this ); break;
case NUMBER: return val = CONSTNode::codeGenNUMBER( *this ); break;
case LETTER: return val = CONSTNode::codeGenLETTER( *this ); break;
}
}
//Generates code for a letter - 8 bit integer
Value* CONSTNode::codeGenLETTER( CONSTNode& n ){
if(DEBUG) printf("CONSTNode::codeGenLETTER CG\n");
return ConstantInt::get( Type::getInt8Ty( getGlobalContext() ), n.getValueLetter() );
}
//Generates code for a string - constant array of 8 bit integers
Value* CONSTNode::codeGenSTRING( CONSTNode& n ){
if(DEBUG) printf("CONSTNode::codeGenSTRING CG\n");
return ConstantArray::get( getGlobalContext(), n.getValueString(), true);
}
//Generates code for a number - 32 bit integer
Value* CONSTNode::codeGenNUMBER( CONSTNode& n ){
if(DEBUG) printf("CONSTNode::codeGenNUMBER %d\n", n.getValueNumber());
return ConstantInt::get( Type::getInt32Ty( getGlobalContext() ), n.getValueNumber() );
}
TYPENode::TYPENode( SimpleNode& s) : Node( s ){
//Sets type of the node
if( s.value.compare( "number" ) == 0 ){
setVarType( NUMBER );
} else if( s.value.compare( "letter" ) == 0 ){
setVarType( LETTER );
} else if( s.value.compare( "sentence" ) == 0 ){
setVarType( STRING );
} else if( s.value.compare( "argument" ) == 0 ){
setVarType( T_NONE );
}
if(DEBUG) cout << "TYPE" << s.value << "\n";
arrayLength = 1;
}
//sets the length of an array represented by this type
void TYPENode::setArrayLength( int l ){
arrayLength = l;
}
//Allocates memory for a given type, and returns address of the momory
Value * TYPENode::codeGen(IRBuilder<> & Builder, Environment<Node>& env, llvm::Module * theModule){
generated = true;
if(DEBUG) printf("TYPENode::codeGen %d\n", uniqueId );
switch( this -> varType ){
case STRING: return TYPENode::codeGenSTRING( *this, Builder ); break;
case NUMBER: return TYPENode::codeGenNUMBER( *this, Builder ); break;
case LETTER: return TYPENode::codeGenLETTER( *this, Builder ); break;
case T_NONE: { //argument of a function
//call codeGen for type node of the argument
AllocaInst * alloca = (AllocaInst *) children[1] -> codeGen( Builder, env, theModule );
//set Alloca
((VARNode*)children[0]) -> setAlloca( alloca );
//create argument in the scope
children[0] -> codeGen( Builder, env, theModule );
return alloca;
}; break;
}
}
//Allocates memory for a string
Value * TYPENode::codeGenSTRING(TYPENode & node, IRBuilder<> & Builder){
Function *TheFunction = Builder.GetInsertBlock() -> getParent();
IRBuilder<> TmpB( &TheFunction -> getEntryBlock(), TheFunction -> getEntryBlock().begin() );
//Define string type
ArrayType* StringTy = ArrayType::get(IntegerType::get(getGlobalContext(), 8), node.arrayLength);
//Allocate memory
AllocaInst * Alloca = TmpB.CreateAlloca(StringTy, 0);
node.alloca = Alloca;
if(DEBUG) printf("Memory allocated\n");
node.allocated = true;
return node.alloca;
}
//Allocate memory for a number
Value * TYPENode::codeGenNUMBER(TYPENode & node, IRBuilder<> & Builder){
Function *TheFunction = Builder.GetInsertBlock() -> getParent();
IRBuilder<> TmpB( &TheFunction -> getEntryBlock(), TheFunction -> getEntryBlock().begin() );
AllocaInst * Alloca = TmpB.CreateAlloca(Type::getInt32Ty(getGlobalContext()), 0);
node.alloca = Alloca;
if(DEBUG) printf("Memory allocated\n");
node.allocated = true;
return node.alloca;
}
//Allocate memory for a letter
Value * TYPENode::codeGenLETTER(TYPENode & node, IRBuilder<> & Builder){
Function *TheFunction = Builder.GetInsertBlock() -> getParent();
IRBuilder<> TmpB( &TheFunction -> getEntryBlock(), TheFunction -> getEntryBlock().begin() );
AllocaInst * Alloca = TmpB.CreateAlloca(Type::getInt8Ty(getGlobalContext()), 0);
node.alloca = Alloca;
if(DEBUG) printf("Memory allocated\n");
node.allocated = true;
return node.alloca;
}
//Returns type of the node in its llvm representation
Type * TYPENode::getLlvmType(){
switch( getVarType() ){
case STRING: return (Type*)ArrayType::get(IntegerType::get(getGlobalContext(), 8), arrayLength); break;
case NUMBER: return (Type*)Type::getInt32Ty(getGlobalContext()); break;
case LETTER: return (Type*)Type::getInt8Ty(getGlobalContext()); break;
}
}
Type * TYPENode::getLlvmArgType(){
return ((TYPENode*)children[1]) -> getLlvmType();
}
string TYPENode::getArgName(){
return ((VARNode*)children[0]) -> getVarId();
}
RETNode::RETNode( SimpleNode& s) : Node( s ){
}
//Generates code for the value it's supposed to return and creates a Ret statement
Value * RETNode::codeGen(IRBuilder<> & Builder, Environment<Node>& env, llvm::Module * theModule){
generated = true;
if(DEBUG) printf("RETNode::codeGen %d\n", uniqueId);
Value * v = children[0] -> codeGen( Builder, env, theModule );
env.add("return", this);
//Builder.CreateRet( v );
return v;
}
ARGNode::ARGNode( SimpleNode& s) : Node( s ){
}
//Generates code for the value it's supposed to return and creates a Ret statement
Value * ARGNode::codeGen(IRBuilder<> & Builder, Environment<Node>& env, llvm::Module * theModule){
return valueLlvm;
}
IFNode::IFNode( SimpleNode& s) : Node( s ){
}
//Generates code for if blocks
Value * IFNode::codeGen(IRBuilder<> & Builder, Environment<Node>& env, llvm::Module * theModule){
if(DEBUG) printf("IFNode::codeGen %d\n", uniqueId);
generated = true;
//Extract condition, instructions and possible else node
Node * condition = children[0];
vector<Node *> body (children.begin() + 1, children.end() - 1 );
Node * else_node = children[children.size() - 1];
//Generate code for the condition
Value * condV = condition -> codeGen( Builder, env, theModule );
//Convert condition to bool
/*condV = Builder.CreateICmpEQ( condV,
ConstantInt::get( Type::getInt32Ty( getGlobalContext() ), APInt( 32, 0 ) ),
"ifcond" );*/
//theModule -> dump();
//Get overlaying function
Function *theFunction = Builder.GetInsertBlock() -> getParent();
//Generate blocks for each branch, and a merging branch
BasicBlock *thenBB = BasicBlock::Create( getGlobalContext(), "then", theFunction );
BasicBlock *elseBB = BasicBlock::Create( getGlobalContext(), "else" );
BasicBlock *mergeBB = BasicBlock::Create( getGlobalContext(), "ifcont" );
//Create condition jump
Builder.CreateCondBr(condV, thenBB, elseBB);
//Start inserting code into BasicBlock thenBB
Builder.SetInsertPoint( thenBB );
Value *thenV;
//Generate instructions' code
for(std::vector< Node * >::iterator it = body.begin(); it != body.end(); ++it) {
thenV = (*it) -> codeGen( Builder, env, theModule );
}
//Create jump to merge block
Builder.CreateBr( mergeBB );
thenBB = Builder.GetInsertBlock();
//Insert elseBB BacicBlock, and start inserting into it
theFunction -> getBasicBlockList().push_back( elseBB );
Builder.SetInsertPoint( elseBB );
//Generate code of else node - which is either Else, Else If or End If
Value *elseV = else_node -> codeGen( Builder, env, theModule );
//Create jump from else branch to the merging block
Builder.CreateBr( mergeBB );
// Codegen of 'Else' can change the current block, update ElseBB for the PHI.
elseBB = Builder.GetInsertBlock();
theFunction -> getBasicBlockList().push_back( mergeBB );
//Start inserting into merge Block, generate PhiNode
Builder.SetInsertPoint( mergeBB );
PHINode *PN = Builder.CreatePHI( Type::getInt32Ty( getGlobalContext() ) );
PN -> addIncoming( thenV, thenBB );
PN -> addIncoming( elseV, elseBB );
return PN;
}
ELSENode::ELSENode( SimpleNode& s) : Node( s ){
}
// Generates code for else{} element
Value * ELSENode::codeGen(IRBuilder<> & Builder, Environment<Node>& env, llvm::Module * theModule){
if(DEBUG) printf("ELSENode::codeGen %d\n", uniqueId);
generated = true;
// get instructions and generate them
vector<Node *> body (children.begin(), children.end() - 1 );
Value * v;
for(std::vector< Node * >::iterator it = body.begin(); it != body.end(); ++it) {
v = (*it) -> codeGen( Builder, env, theModule );
}
return v;
}
ENDIFNode::ENDIFNode( SimpleNode& s) : Node( s ){
}
// Responsible for finishing generation of if else statement
Value * ENDIFNode::codeGen(IRBuilder<> & Builder, Environment<Node>& env, llvm::Module * theModule){
if(DEBUG) printf("ENDIFNode::codeGen %d\n", uniqueId);
return ConstantInt::get( Type::getInt32Ty( getGlobalContext() ), 0 );
}
COMMENTNode::COMMENTNode( SimpleNode& s) : Node( s ){
}
Value * COMMENTNode::codeGen(IRBuilder<> & Builder, Environment<Node>& env, llvm::Module * theModule){
return ConstantInt::get( Type::getInt32Ty( getGlobalContext() ), 0 );
}
WHILENode::WHILENode( SimpleNode& s) : Node( s ){
}
//Generates code for Looops
Value * WHILENode::codeGen(IRBuilder<> & Builder, Environment<Node>& env, llvm::Module * theModule){
generated = true;
//Get condition, and instructions which will be executed if it's true
Node * condition = children[0];
vector<Node *> body (children.begin() + 1, children.end());
if(DEBUG) printf("WHILENode::codeGen %d\n", uniqueId);
//Get necessary code building structures
Function *theFunction = Builder.GetInsertBlock() -> getParent();
BasicBlock *whileBB = BasicBlock::Create( getGlobalContext(), "while", theFunction );
BasicBlock *bodyBB = BasicBlock::Create( getGlobalContext(), "body" );
BasicBlock *endBB = BasicBlock::Create( getGlobalContext(), "end" );
//Create jump to while branch (condition), and start insertion into it
Builder.CreateBr( whileBB );
Builder.SetInsertPoint( whileBB );
//Generate condition, and convert its value to bool
Value * condV = condition -> codeGen( Builder, env, theModule );
condV = Builder.CreateICmpEQ( condV,
ConstantInt::get( Type::getInt32Ty( getGlobalContext() ), APInt( 32, 0 ) ),
"loopcond" );
//Create conditional jump, if condition is true execute instructions, otherwise terminate
Builder.CreateCondBr(condV, bodyBB, endBB);
theFunction -> getBasicBlockList().push_back( bodyBB );
Builder.SetInsertPoint( bodyBB );
//Generate code of instructions
for(std::vector< Node * >::iterator it = body.begin(); it != body.end(); ++it) {
(*it) -> codeGen( Builder, env, theModule );
}
//Jump back to while branch (loop)
Builder.CreateBr( whileBB );
bodyBB = Builder.GetInsertBlock();
//Create terminating block
theFunction -> getBasicBlockList().push_back( endBB );
Builder.SetInsertPoint( endBB );
Value * ret = ConstantInt::get( Type::getInt32Ty( getGlobalContext() ), APInt( 32, 0 ) );
//theFunction -> dump();
return ret;
}
OPNode::OPNode( SimpleNode& s) : Node( s ){
//Set type of operation
if( s.value.compare( "NO_OP" ) == 0 ){
this -> op = NONE;
} else if( s.value.compare( "ADD" ) == 0 ){
this -> op = ADD;
} else if( s.value.compare( "OR" ) == 0 ){
this -> op = OR;
} else if( s.value.compare( "XOR" ) == 0 ){
this -> op = XOR;
} else if( s.value.compare( "AND" ) == 0 ){
this -> op = AND;
} else if( s.value.compare( "SUBTRACT" ) == 0 ){
this -> op = SUB;
} else if( s.value.compare( "MULTIPLY" ) == 0 ){
this -> op = MUL;
} else if( s.value.compare( "DIVIDE" ) == 0 ){
this -> op = DIV;
} else if( s.value.compare( "MOD" ) == 0 ){
this -> op = MOD;
} else if( s.value.compare( "NOT" ) == 0 ){
this -> op = NEG;
} else if( s.value.compare( "NEGATE" ) == 0 ){
this -> op = NOT;
} else if( s.value.compare( "LOGICAL_OR" ) == 0 ){
this -> op = BOOL_OR;
} else if( s.value.compare( "LOGICAL_AND" ) == 0 ){
this -> op = BOOL_AND;
} else if( s.value.compare( "EQUAL" ) == 0 ){
this -> op = E;
} else if( s.value.compare( "NOT_EQUAL" ) == 0 ){
this -> op = NE;
} else if( s.value.compare( "GREATER_THAN" ) == 0 ){
this -> op = G;
} else if( s.value.compare( "LESS_THAN" ) == 0 ){
this -> op = S;
} else if( s.value.compare( "LESS_THAN_EQUAL" ) == 0 ){
this -> op = SOE;
} else if( s.value.compare( "GREATER_THAN_EQUAL" ) == 0 ){
this -> op = GOE;
}
}
//Generate code specific for each operation
Value* OPNode::codeGen(IRBuilder<> & Builder, Environment<Node>& env, llvm::Module * theModule){
generated = true;
if(DEBUG) printf("OPNode::codeGen %d\n", uniqueId);
//Generate code for left hand side of the operation
lhs = children[0] -> codeGen( Builder, env, theModule );
//Generate code for right hand side of the operation, if the operation has two arguments
if(this -> op != UNR && this -> op != NEG && this -> op != NOT)
rhs = children[1] -> codeGen( Builder, env, theModule );
switch( this -> op ){
case ADD: return OPNode::codeGenADD( Builder, *this ); break;
case OR: return OPNode::codeGenOR( Builder, *this ); break;
case XOR: return OPNode::codeGenXOR( Builder, *this ); break;
case AND: return OPNode::codeGenAND( Builder, *this ); break;
case SUB: return OPNode::codeGenSUB( Builder, *this ); break;
case MUL: return OPNode::codeGenMUL( Builder, *this ); break;
case DIV: return OPNode::codeGenDIV( Builder, *this ); break;
case MOD: return OPNode::codeGenMOD( Builder, *this ); break;
case NEG: return OPNode::codeGenNEG( Builder, *this ); break;
case S: return OPNode::codeGenS( Builder, *this ); break;
case G: return OPNode::codeGenG( Builder, *this ); break;
case E: return OPNode::codeGenE( Builder, *this ); break;
case NE: return OPNode::codeGenNE( Builder, *this ); break;
case BOOL_OR: return OPNode::codeGenBOR( Builder, *this ); break;
case BOOL_AND: return OPNode::codeGenBAND( Builder, *this ); break;
case GOE: return OPNode::codeGenGOE( Builder, *this ); break;
case SOE: return OPNode::codeGenSOE( Builder, *this ); break;
}
}
Value* OPNode::codeGenADD( llvm::IRBuilder<> & Builder, OPNode & n ){
return Builder.CreateAdd( n.lhs, n.rhs );
}
Value* OPNode::codeGenOR( llvm::IRBuilder<> & Builder, OPNode & n ){
return Builder.CreateOr( n.lhs, n.rhs );
}
Value* OPNode::codeGenBAND( llvm::IRBuilder<> & Builder, OPNode & n ){
return Builder.CreateAnd( n.lhs, n.rhs );
}
Value* OPNode::codeGenNOT( llvm::IRBuilder<> & Builder, OPNode & n ){
return Builder.CreateNeg( n.lhs );
}
Value* OPNode::codeGenBOR( llvm::IRBuilder<> & Builder, OPNode & n ){
return Builder.CreateOr( n.lhs, n.rhs );
}
Value* OPNode::codeGenXOR(llvm::IRBuilder<> & Builder, OPNode & n ){
return Builder.CreateXor( n.lhs, n.rhs );
}
Value* OPNode::codeGenAND( llvm::IRBuilder<> & Builder, OPNode & n ){
return Builder.CreateAnd( n.lhs, n.rhs );
}
Value* OPNode::codeGenSUB( llvm::IRBuilder<> & Builder, OPNode & n ){
return Builder.CreateSub( n.lhs, n.rhs );
}
Value* OPNode::codeGenMUL( llvm::IRBuilder<> & Builder, OPNode & n ){
return Builder.CreateMul( n.lhs, n.rhs );
}
Value* OPNode::codeGenDIV( llvm::IRBuilder<> & Builder, OPNode & n ){
return Builder.CreateUDiv( n.lhs, n.rhs );
}
Value* OPNode::codeGenMOD( llvm::IRBuilder<> & Builder, OPNode & n ){
return Builder.CreateURem( n.lhs, n.rhs );
}
Value* OPNode::codeGenNEG( llvm::IRBuilder<> & Builder, OPNode & n ){
return Builder.CreateNot( n.lhs );
}
Value* OPNode::codeGenS( IRBuilder<> & Builder, OPNode & n ){
Value * b = Builder.CreateICmpULT( n.lhs, n.rhs );
return b;
//return Builder.CreateIntCast( b, Type::getInt32Ty(getGlobalContext()), false );
}
Value* OPNode::codeGenG( IRBuilder<> & Builder, OPNode & n ){
Value * b = Builder.CreateICmpUGT( n.lhs, n.rhs );
return b;
//return Builder.CreateIntCast( b, Type::getInt32Ty(getGlobalContext()), false );
}
Value* OPNode::codeGenE( IRBuilder<> & Builder, OPNode & n ){
Value * b = Builder.CreateICmpEQ( n.lhs, n.rhs );
return b;
//return Builder.CreateIntCast( b, Type::getInt32Ty(getGlobalContext()), false );
}
Value* OPNode::codeGenNE( IRBuilder<> & Builder, OPNode & n ){
Value * b = Builder.CreateICmpNE( n.lhs, n.rhs );
return b;
//return Builder.CreateIntCast( b, Type::getInt32Ty(getGlobalContext()), false );
}
Value* OPNode::codeGenGOE( IRBuilder<> & Builder, OPNode & n ){
Value * b = Builder.CreateICmpUGE( n.lhs, n.rhs );
return b;
//return Builder.CreateIntCast( b, Type::getInt32Ty(getGlobalContext()), false );
}
Value* OPNode::codeGenSOE( IRBuilder<> & Builder, OPNode & n ){
Value * b = Builder.CreateICmpULE( n.lhs, n.rhs );
return b;
//return Builder.CreateIntCast( b, Type::getInt32Ty(getGlobalContext()), false );
}
FUNCTIONNode::FUNCTIONNode( SimpleNode& s) : Node( s ){
//Set name of the function
funName = s.value;
argsAdded = false;
}
string FUNCTIONNode::getFunName(){
return funName;
}
//Returns llvm types of arguments
vector<const Type*> FUNCTIONNode::getArgsTypes(){
return args;
}
//Returns names of the arguments
vector<string> FUNCTIONNode::getArgs(){
return argsNames;
}
//Generates code for arguments of a function
Value * FUNCTIONNode::codeGen(IRBuilder<> & Builder, Environment<Node>& env, llvm::Module * theModule){
args.clear();
argsNames.clear();
Value * V;
for(int i = 0; i < children.size(); i++){
//children[i] -> codeGen(Builder, env, theModule);
//collect types of arguments
args.push_back( ((TYPENode*)children[i]) -> getLlvmArgType());
argsNames.push_back( ((TYPENode*)children[i]) -> getArgName());
//if(argsAdded){
// env.add( ((TYPENode*)children[i]) -> getArgName(), children[i] -> children[0]);
//}
}
return ConstantInt::get( Type::getInt32Ty( getGlobalContext() ), 0 );
}
FUNCTIONDEFNode::FUNCTIONDEFNode( SimpleNode& s) : Node( s ){
if(DEBUG) cout << "FUNCTIONDEFNode()\n";
}
Function * FUNCTIONDEFNode::codeGen(IRBuilder<> & Builder, Environment<Node>& env, llvm::Module * theModule){
//Set node responsible for definition of arguments
Fn = (FUNCTIONNode*)children[1];
//Set function name
funName = Fn -> getFunName();
if(DEBUG) cout << "FUNCTIONDEFNode::codeGen " << Fn -> getFunName() << "\n";
//Create new scope
env.add( Fn -> getFunName(), this);
env.addScope( Fn -> getFunName() );
Environment<Node> * env2 = env.getScope( Fn -> getFunName() );
//Generate arguments
Fn -> codeGen(Builder, *env2, theModule);
//Declare function type
FT = FunctionType::get(((TYPENode*)children[0]) -> getLlvmType(), Fn -> getArgsTypes(), false);
//Define function
F = Function::Create(FT, Function::ExternalLinkage, Fn -> getFunName(), theModule);
//Create new insertion block
BasicBlock *CBB = Builder.GetInsertBlock();
BasicBlock *BB = BasicBlock::Create(getGlobalContext(), "entry", F);
Builder.SetInsertPoint(BB);
unsigned Idx = 0;
for (Function::arg_iterator AI = F -> arg_begin(); Idx != Fn -> argsNames.size(); ++AI, ++Idx) {
AI -> setName(Fn -> argsNames[Idx]);
Fn -> argsValues.push_back(AI);
ARGNode * argN = new ARGNode();
argN -> valueLlvm = AI;
env2 -> add( Fn -> argsNames[Idx], argN );
}
Fn -> argsAdded = true;
Fn -> codeGen(Builder, *env2, theModule);
Value * v;
//Generate body
for(int i = 2; i < children.size(); i++){
//cout << i << "\n";
v = children[i] -> codeGen(Builder, *env2, theModule);
}
if( Builder.GetInsertBlock() -> getTerminator() == 0 ){
/*if(env2 -> get("return") != 0){
v = env2 -> get("return") -> valueLlvm;
}*/
Builder.CreateRet( v );
}
Builder.SetInsertPoint(CBB);
verifyFunction(*F);
return F;
}
FUNCTIONCALLNode::FUNCTIONCALLNode( SimpleNode& s) : Node( s ){
funName = s.value;
if(DEBUG) cout << "Call FName: " << funName << "\n";
}
Value * FUNCTIONCALLNode::codeGen(IRBuilder<> & Builder, Environment<Node>& env, llvm::Module * theModule){
if(DEBUG) cout << "FName: " << funName << "\n";
if( funName.compare( "became" ) == 0 ){
Node * x = env.get( children[0] -> getVarId() );
if( children[0] -> getType() == ARRAY_ELEM){
x = env.get( children[0] -> children[0] -> getVarId() );
Value * val = children[1] -> codeGen( Builder, env, theModule );
Value * elNumber = children[0] -> children[1] -> codeGen(Builder, env, theModule);
BasicBlock* label_13 = Builder.GetInsertBlock();
Value * ptr = Builder.CreateInBoundsGEP(x->alloca, elNumber);
StoreInst* void_33 = Builder.CrateStore(val, ptr);
} else if( x -> getVarType() == STRING){
//Get variable from environment
VARNode * x = (VARNode*)env.get( children[0] -> getVarId() );