1 #include <msp/core/raii.h>
10 void NodeVisitor::visit(Assignment &assign)
12 visit(static_cast<BinaryExpression &>(assign));
16 void TraversingVisitor::visit(Block &block)
18 SetForScope<Block *> set_block(current_block, &block);
19 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
23 void TraversingVisitor::visit(ParenthesizedExpression &parexpr)
25 parexpr.expression->visit(*this);
28 void TraversingVisitor::visit(MemberAccess &memacc)
30 memacc.left->visit(*this);
33 void TraversingVisitor::visit(UnaryExpression &unary)
35 unary.expression->visit(*this);
38 void TraversingVisitor::visit(BinaryExpression &binary)
40 binary.left->visit(*this);
41 binary.right->visit(*this);
44 void TraversingVisitor::visit(FunctionCall &call)
46 for(NodeArray<Expression>::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
50 void TraversingVisitor::visit(ExpressionStatement &expr)
52 expr.expression->visit(*this);
55 void TraversingVisitor::visit(InterfaceLayout &layout)
57 layout.layout.visit(*this);
60 void TraversingVisitor::visit(StructDeclaration &strct)
62 strct.members.visit(*this);
65 void TraversingVisitor::visit(VariableDeclaration &var)
68 var.layout->visit(*this);
69 if(var.init_expression)
70 var.init_expression->visit(*this);
72 var.array_size->visit(*this);
75 void TraversingVisitor::visit(InterfaceBlock &iface)
77 iface.members.visit(*this);
80 void TraversingVisitor::visit(FunctionDeclaration &func)
82 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
84 func.body.visit(*this);
87 void TraversingVisitor::visit(Conditional &cond)
89 cond.condition->visit(*this);
90 cond.body.visit(*this);
91 cond.else_body.visit(*this);
94 void TraversingVisitor::visit(Iteration &iter)
96 if(iter.init_statement)
97 iter.init_statement->visit(*this);
99 iter.condition->visit(*this);
100 if(iter.loop_expression)
101 iter.loop_expression->visit(*this);
102 iter.body.visit(*this);
105 void TraversingVisitor::visit(Passthrough &pass)
108 pass.subscript->visit(*this);
111 void TraversingVisitor::visit(Return &ret)
114 ret.expression->visit(*this);
118 NodeRemover::NodeRemover():
122 recursive_remove(false)
125 void NodeRemover::apply(Stage &s, const set<Node *> &tr)
132 void NodeRemover::remove_variable(map<string, VariableDeclaration *> &vars, VariableDeclaration &decl)
134 map<string, VariableDeclaration *>::iterator i = vars.find(decl.name);
135 if(i!=vars.end() && i->second==&decl)
139 void NodeRemover::visit(Block &block)
141 blocks.push_back(&block);
142 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
145 if(to_remove->count(i->get()))
146 block.body.erase(i++);
153 void NodeRemover::visit(StructDeclaration &strct)
155 if(to_remove->count(&strct))
156 blocks.back()->types.erase(strct.name);
159 void NodeRemover::visit(VariableDeclaration &var)
161 if(recursive_remove || to_remove->count(&var))
163 remove_variable(blocks.back()->variables, var);
164 if(anonymous && blocks.size()>1)
165 remove_variable(blocks[blocks.size()-2]->variables, var);
166 remove_variable(stage->in_variables, var);
167 remove_variable(stage->out_variables, var);
168 stage->locations.erase(var.name);
169 if(var.linked_declaration)
170 var.linked_declaration->linked_declaration = 0;
172 else if(var.init_expression && to_remove->count(var.init_expression.get()))
173 var.init_expression = 0;
176 void NodeRemover::visit(InterfaceBlock &iface)
178 SetFlag set_anon(anonymous);
179 SetFlag set_recursive(recursive_remove, recursive_remove || to_remove->count(&iface));
180 TraversingVisitor::visit(iface);
183 void NodeRemover::visit(Iteration &iter)
185 if(to_remove->count(iter.init_statement.get()))
186 iter.init_statement = 0;
187 TraversingVisitor::visit(iter);