-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAstVisitor.hpp
More file actions
437 lines (434 loc) · 19.3 KB
/
AstVisitor.hpp
File metadata and controls
437 lines (434 loc) · 19.3 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
#pragma once
#include "AstNode.hpp"
class AstVisitor {
public:
virtual void visitSource(Source *source) = 0;
virtual void visitExpression(AstNode *expr) = 0;
virtual void visitStatement(AstNode *expr) = 0;
virtual void visitAttribute(Attribute *attribute) = 0;
virtual void visitOut(Out *out) = 0;
virtual void visitIn(In *in) = 0;
virtual void visitUniform(Uniform *uniform) = 0;
virtual void visitBlock(Block *block) = 0;
virtual void visitArgDecl(ArgDecl *argDecl) = 0;
virtual void visitFunction(Function *function) = 0;
virtual void visitReturn(Return *returnNode) = 0;
virtual void visitPrePostFix(PrePostFix *prePostFix) = 0;
virtual void visitPrePostFixStm(PrePostFixStm *prePostFix) = 0;
virtual void visitIf(If *ifNode) = 0;
virtual void visitForLoop(ForLoop *forLoop) = 0;
virtual void visitIntConst(IntConst *intConst) = 0;
virtual void visitFloatConst(FloatConst *floatConst) = 0;
virtual void visitReference(Reference *reference) = 0;
virtual void visitFieldReference(FieldReference *ref) = 0;
virtual void visitBracedExpr(BracedExpr *bracedExpr) = 0;
virtual void visitComparison(Comparison *comparison) = 0;
virtual void visitMultiplyExpr(MultiplyExpr *expr) = 0;
virtual void visitDivideExpr(DivideExpr *expr) = 0;
virtual void visitPlusExpr(PlusExpr *expr) = 0;
virtual void visitMinusExpr(MinusExpr *expr) = 0;
virtual void visitFunctionCall(FunctionCall *call) = 0;
virtual void visitFunctionCallStm(FunctionCallStm *call) = 0;
virtual void visitTypeConstructor(TypeConstructor *constructor) = 0;
virtual void visitAssignment(Assignment *assignment) = 0;
virtual void visitOpAssignment(OpAssignment *assignment) = 0;
virtual void visitTypedAssignment(TypedAssignment *assignment) = 0;
virtual void visitStructMember(StructMember *member) = 0;
virtual void visitStructDecl(StructDecl *decl) = 0;
virtual void visitVersion(Version *version) = 0;
virtual void visitPrecision(Precision *precision) = 0;
virtual void visitUnaryMinus(UnaryMinus *expr) = 0;
};
class AstVisitorBase : public AstVisitor {
public:
virtual void visitSource(Source *source) {
for (AstNode *node : *source->nodes) {
switch (node->nodeType) {
case FunctionNode: visitFunction(static_cast<Function*>(node)); break;
case AttributeNode: visitAttribute(static_cast<Attribute*>(node)); break;
case InNode: visitIn(static_cast<In*>(node)); break;
case OutNode: visitOut(static_cast<Out*>(node)); break;
case UniformNode: visitUniform(static_cast<Uniform*>(node)); break;
case TypedAssignmentNode: visitTypedAssignment(static_cast<TypedAssignment*>(node)); break;
case StructDeclNode: visitStructDecl(static_cast<StructDecl*>(node)); break;
case VersionNode: visitVersion(static_cast<Version*>(node)); break;
case PrecisionNode: visitPrecision(static_cast<Precision*>(node)); break;
default: {}
}
}
}
virtual void visitStatement(AstNode *node) {
switch (node->nodeType) {
case TypedAssignmentNode: visitTypedAssignment(static_cast<TypedAssignment*>(node)); break;
case AssignmentNode: visitAssignment(static_cast<Assignment*>(node)); break;
case OpAssignmentNode: visitOpAssignment(static_cast<OpAssignment*>(node)); break;
case FunctionCallStmNode: visitFunctionCallStm(static_cast<FunctionCallStm*>(node)); break;
case PrePostFixStmNode: visitPrePostFixStm(static_cast<PrePostFixStm*>(node)); break;
case ReturnNode: visitReturn(static_cast<Return*>(node)); break;
default: {}
}
}
virtual void visitExpression(AstNode *node) {
switch (node->nodeType) {
case FloatConstNode: visitFloatConst(static_cast<FloatConst*>(node)); break;
case IntConstNode: visitIntConst(static_cast<IntConst*>(node)); break;
case TypeConstructorNode: visitTypeConstructor(static_cast<TypeConstructor*>(node)); break;
case FunctionCallNode: visitFunctionCall(static_cast<FunctionCall*>(node)); break;
case ReferenceNode: visitReference(static_cast<Reference*>(node)); break;
case FieldReferenceNode: visitFieldReference(static_cast<FieldReference*>(node)); break;
case MultiplyExprNode: visitMultiplyExpr(static_cast<MultiplyExpr*>(node)); break;
case DivideExprNode: visitDivideExpr(static_cast<DivideExpr*>(node)); break;
case PlusExprNode: visitPlusExpr(static_cast<PlusExpr*>(node)); break;
case MinusExprNode: visitMinusExpr(static_cast<MinusExpr*>(node)); break;
case BracedExprNode: visitBracedExpr(static_cast<BracedExpr*>(node)); break;
case ComparisonNode: visitComparison(static_cast<Comparison*>(node)); break;
case UnaryMinusNode: visitUnaryMinus(static_cast<UnaryMinus*>(node)); break;
default: {}
}
}
virtual void visitAttribute(Attribute *attribute) {}
virtual void visitOut(Out *out) {}
virtual void visitIn(In *in) {}
virtual void visitUniform(Uniform *uniform) {}
virtual void visitBlock(Block *block) {
for (Statement *node : *block->statements) {
visitStatement(node);
}
}
virtual void visitArgDecl(ArgDecl *argDecl) {}
virtual void visitFunction(Function *function) {
for (ArgDecl *arg : *function->args) {
visitArgDecl(arg);
}
visitBlock(function->block);
}
virtual void visitReturn(Return *returnNode) {
visitExpression(returnNode->expr);
}
virtual void visitPrePostFix(PrePostFix *prePostFix) {}
virtual void visitPrePostFixStm(PrePostFixStm *prePostFix) {}
virtual void visitIf(If *ifNode) {
visitExpression(ifNode->expr);
visitBlock(ifNode->ifBlock);
if (ifNode->elseBlock != NULL) {
visitBlock(ifNode->elseBlock);
}
}
virtual void visitForLoop(ForLoop *forLoop) {
visitStatement(forLoop->init);
visitExpression(forLoop->test);
visitStatement(forLoop->iter);
visitBlock(forLoop->block);
}
virtual void visitIntConst(IntConst *intConst) {}
virtual void visitFloatConst(FloatConst *floatConst) {}
virtual void visitReference(Reference *reference) {}
virtual void visitFieldReference(FieldReference *ref) {}
virtual void visitBracedExpr(BracedExpr *bracedExpr) {
visitExpression(bracedExpr->expr);
}
virtual void visitComparison(Comparison *comparison) {
visitExpression(comparison->expr1);
visitExpression(comparison->expr2);
}
virtual void visitMultiplyExpr(MultiplyExpr *expr) {
visitExpression(expr->op1);
visitExpression(expr->op2);
}
virtual void visitDivideExpr(DivideExpr *expr) {
visitExpression(expr->op1);
visitExpression(expr->op2);
}
virtual void visitPlusExpr(PlusExpr *expr) {
visitExpression(expr->op1);
visitExpression(expr->op2);
}
virtual void visitMinusExpr(MinusExpr *expr) {
visitExpression(expr->op1);
visitExpression(expr->op2);
}
virtual void visitFunctionCall(FunctionCall *call) {
for (Expression *arg : *call->args) {
visitExpression(arg);
}
}
virtual void visitFunctionCallStm(FunctionCallStm *call) {
for (Expression *arg : *call->args) {
visitExpression(arg);
}
}
virtual void visitTypeConstructor(TypeConstructor *constructor) {
for (Expression *arg : *constructor->args) {
visitExpression(arg);
}
}
virtual void visitAssignment(Assignment *assignment) {
visitExpression(assignment->expr);
}
virtual void visitOpAssignment(OpAssignment *assignment) {
visitExpression(assignment->expr);
}
virtual void visitTypedAssignment(TypedAssignment *assignment) {
visitExpression(assignment->expr);
}
virtual void visitStructMember(StructMember *member) {}
virtual void visitStructDecl(StructDecl *decl) {
for (StructMember *member : *decl->members) {
visitStructMember(member);
}
}
virtual void visitVersion(Version *version) {}
virtual void visitPrecision(Precision *precision) {}
virtual void visitUnaryMinus(UnaryMinus *expr) {}
};
// If you transform a node, then clean up/delete the previous one
// the same place. This allows better control in reusing parts of the node.
class AstVisitorTransform {
private:
// Allows passing in NULL to delete objects
template<typename T>
static void toVec(std::vector<T*>* nodes, T *node) {
if (node != NULL) {
nodes->push_back(node);
}
}
template<typename T>
static std::vector<T*>* checkNodes(std::vector<T*>* newNodes, std::vector<T*>* curNodes) {
// Check if equal, in which case return the current
if (newNodes->size() == curNodes->size()) {
bool isEqual = true;
for (size_t i = 0; i < curNodes->size(); ++i) {
if ((*newNodes)[i] != (*curNodes)[i]) {
isEqual = false;
break;
}
}
if (isEqual) {
delete newNodes;
return curNodes;
}
}
// Not equal, check for each curNode in newNodes and delete those not present
// Could be optimized to assume more similarity
for (T* node : *curNodes) {
bool isFound = false;
for (T* newNode : *newNodes) {
if (node == newNode) {
isFound = true;
break;
}
}
if (!isFound) {
delete node;
}
}
// Only delete the pointer addresses and vector
delete curNodes;
return newNodes;
}
public:
virtual Source* visitSource(Source *source) {
std::vector<AstNode*> *newNodes = new std::vector<AstNode*>();
for (AstNode *node : *source->nodes) {
switch (node->nodeType) {
case FunctionNode: toVec<AstNode>(newNodes, visitFunction(static_cast<Function*>(node))); break;
case AttributeNode: toVec<AstNode>(newNodes, visitAttribute(static_cast<Attribute*>(node))); break;
case InNode: toVec<AstNode>(newNodes, visitIn(static_cast<In*>(node))); break;
case OutNode: toVec<AstNode>(newNodes, visitOut(static_cast<Out*>(node))); break;
case UniformNode: toVec<AstNode>(newNodes, visitUniform(static_cast<Uniform*>(node))); break;
case TypedAssignmentNode: toVec<AstNode>(newNodes, visitTypedAssignment(static_cast<TypedAssignment*>(node))); break;
case StructDeclNode: toVec<AstNode>(newNodes, visitStructDecl(static_cast<StructDecl*>(node))); break;
case VersionNode: toVec<AstNode>(newNodes, visitVersion(static_cast<Version*>(node))); break;
case PrecisionNode: toVec<AstNode>(newNodes, visitPrecision(static_cast<Precision*>(node))); break;
default: { toVec<AstNode>(newNodes, node); }
}
}
source->nodes = checkNodes<AstNode>(newNodes, source->nodes);
return source;
}
virtual Statement* visitStatement(Statement *node) {
switch (node->nodeType) {
case TypedAssignmentNode: return visitTypedAssignment(static_cast<TypedAssignment*>(node));
case AssignmentNode: return visitAssignment(static_cast<Assignment*>(node));
case OpAssignmentNode: return visitOpAssignment(static_cast<OpAssignment*>(node));
case FunctionCallStmNode: return visitFunctionCallStm(static_cast<FunctionCallStm*>(node));
case PrePostFixStmNode: return visitPrePostFixStm(static_cast<PrePostFixStm*>(node));
case ReturnNode: return visitReturn(static_cast<Return*>(node));
case IfNode: return visitIf(static_cast<If*>(node));
case ForLoopNode: return visitForLoop(static_cast<ForLoop*>(node));
default: { return NULL; }
}
}
virtual Expression* visitExpression(Expression *node) {
switch (node->nodeType) {
case FloatConstNode: return visitFloatConst(static_cast<FloatConst*>(node));
case IntConstNode: return visitIntConst(static_cast<IntConst*>(node));
case TypeConstructorNode: return visitTypeConstructor(static_cast<TypeConstructor*>(node));
case FunctionCallNode: return visitFunctionCall(static_cast<FunctionCall*>(node));
case ReferenceNode: return visitReference(static_cast<Reference*>(node));
case FieldReferenceNode: return visitFieldReference(static_cast<FieldReference*>(node));
case MultiplyExprNode: return visitMultiplyExpr(static_cast<MultiplyExpr*>(node));
case DivideExprNode: return visitDivideExpr(static_cast<DivideExpr*>(node));
case PlusExprNode: return visitPlusExpr(static_cast<PlusExpr*>(node));
case MinusExprNode: return visitMinusExpr(static_cast<MinusExpr*>(node));
case BracedExprNode: return visitBracedExpr(static_cast<BracedExpr*>(node));
case ComparisonNode: return visitComparison(static_cast<Comparison*>(node));
case UnaryMinusNode: return visitUnaryMinus(static_cast<UnaryMinus*>(node));
default: { return NULL; }
}
}
virtual Attribute* visitAttribute(Attribute *attribute) {
return attribute;
}
virtual Out* visitOut(Out *out) {
return out;
}
virtual In* visitIn(In *in) {
return in;
}
virtual Uniform* visitUniform(Uniform *uniform) {
return uniform;
}
virtual Block* visitBlock(Block *block) {
std::vector<Statement*> *newNodes = new std::vector<Statement*>();
for (Statement *node : *block->statements) {
toVec<Statement>(newNodes, visitStatement(node));
}
block->statements = checkNodes<Statement>(newNodes, block->statements);
return block;
}
virtual ArgDecl* visitArgDecl(ArgDecl *argDecl) {
return argDecl;
}
virtual Function* visitFunction(Function *function) {
std::vector<ArgDecl*> *newNodes = new std::vector<ArgDecl*>();
for (ArgDecl *arg : *function->args) {
toVec<ArgDecl>(newNodes, visitArgDecl(arg));
}
function->args = checkNodes<ArgDecl>(newNodes, function->args);
function->block = visitBlock(function->block);
return function;
}
virtual Return* visitReturn(Return *returnNode) {
returnNode->expr = visitExpression(returnNode->expr);
return returnNode;
}
virtual Expression* visitPrePostFix(PrePostFix *prePostFix) {
return prePostFix;
}
virtual Statement* visitPrePostFixStm(PrePostFixStm *prePostFix) {
return prePostFix;
}
virtual If* visitIf(If *ifNode) {
ifNode->expr = visitExpression(ifNode->expr);
ifNode->ifBlock = visitBlock(ifNode->ifBlock);
if (ifNode->elseBlock != NULL) {
ifNode->elseBlock = visitBlock(ifNode->elseBlock);
}
return ifNode;
}
virtual ForLoop* visitForLoop(ForLoop *forLoop) {
forLoop->init = visitStatement(forLoop->init);
forLoop->test = visitExpression(forLoop->test);
forLoop->iter = visitStatement(forLoop->iter);
forLoop->block = visitBlock(forLoop->block);
return forLoop;
}
virtual Expression* visitIntConst(IntConst *intConst) {
return intConst;
}
virtual Expression* visitFloatConst(FloatConst *floatConst) {
return floatConst;
}
virtual Expression* visitReference(Reference *reference) {
return reference;
}
virtual Expression* visitFieldReference(FieldReference *ref) {
return ref;
}
virtual Expression* visitBracedExpr(BracedExpr *bracedExpr) {
bracedExpr->expr = visitExpression(bracedExpr->expr);
return bracedExpr;
}
virtual Expression* visitComparison(Comparison *comparison) {
comparison->expr1 = visitExpression(comparison->expr1);
comparison->expr2 = visitExpression(comparison->expr2);
return comparison;
}
virtual Expression* visitMultiplyExpr(MultiplyExpr *expr) {
expr->op1 = visitExpression(expr->op1);
expr->op2 = visitExpression(expr->op2);
return expr;
}
virtual Expression* visitDivideExpr(DivideExpr *expr) {
expr->op1 = visitExpression(expr->op1);
expr->op2 = visitExpression(expr->op2);
return expr;
}
virtual Expression* visitPlusExpr(PlusExpr *expr) {
expr->op1 = visitExpression(expr->op1);
expr->op2 = visitExpression(expr->op2);
return expr;
}
virtual Expression* visitMinusExpr(MinusExpr *expr) {
expr->op1 = visitExpression(expr->op1);
expr->op2 = visitExpression(expr->op2);
return expr;
}
virtual Expression* visitFunctionCall(FunctionCall *call) {
std::vector<Expression*> *newNodes = new std::vector<Expression*>();
for (Expression *arg : *call->args) {
toVec<Expression>(newNodes, visitExpression(arg));
}
call->args = checkNodes<Expression>(newNodes, call->args);
return call;
}
virtual Statement* visitFunctionCallStm(FunctionCallStm *call) {
std::vector<Expression*> *newNodes = new std::vector<Expression*>();
for (Expression *arg : *call->args) {
toVec<Expression>(newNodes, visitExpression(arg));
}
call->args = checkNodes<Expression>(newNodes, call->args);
return call;
}
virtual TypeConstructor* visitTypeConstructor(TypeConstructor *constructor) {
std::vector<Expression*> *newNodes = new std::vector<Expression*>();
for (Expression *arg : *constructor->args) {
toVec<Expression>(newNodes, visitExpression(arg));
}
constructor->args = checkNodes<Expression>(newNodes, constructor->args);
return constructor;
}
virtual Assignment* visitAssignment(Assignment *assignment) {
assignment->expr = visitExpression(assignment->expr);
return assignment;
}
virtual OpAssignment* visitOpAssignment(OpAssignment *assignment) {
assignment->expr = visitExpression(assignment->expr);
return assignment;
}
virtual TypedAssignment* visitTypedAssignment(TypedAssignment *assignment) {
assignment->expr = visitExpression(assignment->expr);
return assignment;
}
virtual StructMember* visitStructMember(StructMember *member) {
return member;
}
virtual StructDecl* visitStructDecl(StructDecl *decl) {
std::vector<StructMember*> *newNodes = new std::vector<StructMember*>();
for (StructMember *member : *decl->members) {
toVec<StructMember>(newNodes, visitStructMember(member));
}
decl->members = checkNodes<StructMember>(newNodes, decl->members);
return decl;
}
virtual Version* visitVersion(Version *version) {
return version;
}
virtual Precision* visitPrecision(Precision *precision) {
return precision;
}
virtual UnaryMinus* visitUnaryMinus(UnaryMinus *expr) {
return expr;
}
};