1 #include <msp/core/raii.h>
10 void TraversingVisitor::visit(Block &block)
12 if(&block!=current_block)
14 SetForScope<Block *> set_block(current_block, &block);
15 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
19 void TraversingVisitor::visit(RefPtr<Expression> &expr)
24 void TraversingVisitor::visit(ParenthesizedExpression &parexpr)
26 visit(parexpr.expression);
29 void TraversingVisitor::visit(MemberAccess &memacc)
34 void TraversingVisitor::visit(Swizzle &swizzle)
39 void TraversingVisitor::visit(UnaryExpression &unary)
41 visit(unary.expression);
44 void TraversingVisitor::visit(BinaryExpression &binary)
50 void TraversingVisitor::visit(Assignment &assign)
56 void TraversingVisitor::visit(FunctionCall &call)
58 for(NodeArray<Expression>::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
62 void TraversingVisitor::visit(ExpressionStatement &expr)
64 visit(expr.expression);
67 void TraversingVisitor::visit(InterfaceLayout &layout)
69 layout.layout.visit(*this);
72 void TraversingVisitor::visit(StructDeclaration &strct)
74 strct.members.visit(*this);
77 void TraversingVisitor::visit(VariableDeclaration &var)
80 var.layout->visit(*this);
81 if(var.init_expression)
82 visit(var.init_expression);
84 visit(var.array_size);
87 void TraversingVisitor::visit(InterfaceBlock &iface)
90 iface.members->visit(*this);
93 void TraversingVisitor::visit(FunctionDeclaration &func)
96 SetForScope<Block *> set_block(current_block, &func.body);
97 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
99 func.body.visit(*this);
102 void TraversingVisitor::visit(Conditional &cond)
104 visit(cond.condition);
105 cond.body.visit(*this);
106 cond.else_body.visit(*this);
109 void TraversingVisitor::visit(Iteration &iter)
112 SetForScope<Block *> set_block(current_block, &iter.body);
113 if(iter.init_statement)
114 iter.init_statement->visit(*this);
116 visit(iter.condition);
117 iter.body.visit(*this);
118 if(iter.loop_expression)
119 visit(iter.loop_expression);
122 void TraversingVisitor::visit(Passthrough &pass)
125 visit(pass.subscript);
128 void TraversingVisitor::visit(Return &ret)
131 visit(ret.expression);
135 NodeRemover::NodeRemover():
138 recursive_remove(false)
141 void NodeRemover::apply(Stage &s, const set<Node *> &tr)
145 s.content.visit(*this);
149 void NodeRemover::remove_from_map(map<string, T *> &vars, const string &key, T &node)
151 typename map<string, T *>::iterator i = vars.find(key);
152 if(i!=vars.end() && i->second==&node)
156 void NodeRemover::visit(Block &block)
158 SetForScope<Block *> set_block(current_block, &block);
159 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
162 if(to_remove->count(i->get()))
163 block.body.erase(i++);
169 void NodeRemover::visit(TypeDeclaration &type)
171 if(to_remove->count(&type))
172 remove_from_map(stage->types, type.name, type);
175 void NodeRemover::visit(VariableDeclaration &var)
177 if(recursive_remove || to_remove->count(&var))
179 remove_from_map(current_block->variables, var.name, var);
180 stage->locations.erase(var.name);
181 if(var.linked_declaration)
182 var.linked_declaration->linked_declaration = 0;
184 else if(var.init_expression && to_remove->count(var.init_expression.get()))
185 var.init_expression = 0;
188 void NodeRemover::visit(InterfaceBlock &iface)
190 if(to_remove->count(&iface))
192 remove_from_map(stage->interface_blocks, iface.interface+iface.name, iface);
193 if(!iface.instance_name.empty())
194 remove_from_map(stage->interface_blocks, "_"+iface.instance_name, iface);
196 SetFlag set_recursive(recursive_remove, recursive_remove || to_remove->count(&iface));
197 TraversingVisitor::visit(iface);
200 void NodeRemover::visit(FunctionDeclaration &func)
202 if(to_remove->count(&func))
204 remove_from_map(stage->functions, func.name, func);
205 if(!func.signature.empty())
206 remove_from_map(stage->functions, func.name+func.signature, func);
208 TraversingVisitor::visit(func);
211 void NodeRemover::visit(Iteration &iter)
213 if(to_remove->count(iter.init_statement.get()))
214 iter.init_statement = 0;
215 TraversingVisitor::visit(iter);
219 NodeReorderer::NodeReorderer():
224 void NodeReorderer::apply(Stage &stage, Node &before, const set<Node *> &tr)
226 reorder_before = &before;
228 stage.content.visit(*this);
231 void NodeReorderer::visit(Block &block)
233 NodeList<Statement>::iterator insert_point = block.body.end();
234 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
237 if(insert_point!=block.body.end() && to_reorder->count(i->get()))
239 NodeList<Statement>::iterator j = i++;
240 block.body.splice(insert_point, block.body, j);
244 if(i->get()==reorder_before)