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(MemberAccess &memacc)
29 void TraversingVisitor::visit(Swizzle &swizzle)
34 void TraversingVisitor::visit(UnaryExpression &unary)
36 visit(unary.expression);
39 void TraversingVisitor::visit(BinaryExpression &binary)
45 void TraversingVisitor::visit(Assignment &assign)
51 void TraversingVisitor::visit(TernaryExpression &ternary)
53 visit(ternary.condition);
54 visit(ternary.true_expr);
55 visit(ternary.false_expr);
58 void TraversingVisitor::visit(FunctionCall &call)
60 for(NodeArray<Expression>::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
64 void TraversingVisitor::visit(ExpressionStatement &expr)
66 visit(expr.expression);
69 void TraversingVisitor::visit(InterfaceLayout &layout)
71 layout.layout.visit(*this);
74 void TraversingVisitor::visit(StructDeclaration &strct)
76 strct.members.visit(*this);
79 void TraversingVisitor::visit(VariableDeclaration &var)
82 var.layout->visit(*this);
83 if(var.init_expression)
84 visit(var.init_expression);
86 visit(var.array_size);
89 void TraversingVisitor::visit(InterfaceBlock &iface)
92 iface.layout->visit(*this);
94 iface.members->visit(*this);
97 void TraversingVisitor::visit(FunctionDeclaration &func)
100 SetForScope<Block *> set_block(current_block, &func.body);
101 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
103 func.body.visit(*this);
106 void TraversingVisitor::visit(Conditional &cond)
108 visit(cond.condition);
109 cond.body.visit(*this);
110 cond.else_body.visit(*this);
113 void TraversingVisitor::visit(Iteration &iter)
116 SetForScope<Block *> set_block(current_block, &iter.body);
117 if(iter.init_statement)
118 iter.init_statement->visit(*this);
120 visit(iter.condition);
121 iter.body.visit(*this);
122 if(iter.loop_expression)
123 visit(iter.loop_expression);
126 void TraversingVisitor::visit(Passthrough &pass)
129 visit(pass.subscript);
132 void TraversingVisitor::visit(Return &ret)
135 visit(ret.expression);
139 NodeRemover::NodeRemover():
142 recursive_remove(false)
145 void NodeRemover::apply(Stage &s, const set<Node *> &tr)
149 s.content.visit(*this);
153 void NodeRemover::remove_from_map(map<string, T *> &vars, const string &key, T &node)
155 typename map<string, T *>::iterator i = vars.find(key);
156 if(i!=vars.end() && i->second==&node)
160 void NodeRemover::visit(Block &block)
162 SetForScope<Block *> set_block(current_block, &block);
163 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
166 if(to_remove->count(i->get()))
167 block.body.erase(i++);
173 void NodeRemover::visit(TypeDeclaration &type)
175 if(to_remove->count(&type))
176 remove_from_map(stage->types, type.name, type);
179 void NodeRemover::visit(VariableDeclaration &var)
181 if(recursive_remove || to_remove->count(&var))
183 remove_from_map(current_block->variables, var.name, var);
184 stage->locations.erase(var.name);
185 if(var.linked_declaration)
186 var.linked_declaration->linked_declaration = 0;
188 else if(var.init_expression && to_remove->count(var.init_expression.get()))
189 var.init_expression = 0;
192 void NodeRemover::visit(InterfaceBlock &iface)
194 if(to_remove->count(&iface))
196 remove_from_map(stage->interface_blocks, format("%s %s", iface.interface, iface.block_name), iface);
197 if(!iface.instance_name.empty())
198 remove_from_map(stage->interface_blocks, iface.instance_name, iface);
200 SetFlag set_recursive(recursive_remove, recursive_remove || to_remove->count(&iface));
201 TraversingVisitor::visit(iface);
204 void NodeRemover::visit(FunctionDeclaration &func)
206 if(to_remove->count(&func))
208 remove_from_map(stage->functions, func.name, func);
209 if(!func.signature.empty())
210 remove_from_map(stage->functions, func.name+func.signature, func);
212 TraversingVisitor::visit(func);
215 void NodeRemover::visit(Iteration &iter)
217 if(to_remove->count(iter.init_statement.get()))
218 iter.init_statement = 0;
219 TraversingVisitor::visit(iter);
223 NodeReorderer::NodeReorderer():
228 void NodeReorderer::apply(Stage &stage, Node &before, const set<Node *> &tr)
230 reorder_before = &before;
232 stage.content.visit(*this);
235 void NodeReorderer::visit(Block &block)
237 NodeList<Statement>::iterator insert_point = block.body.end();
238 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
241 if(insert_point!=block.body.end() && to_reorder->count(i->get()))
243 NodeList<Statement>::iterator j = i++;
244 block.body.splice(insert_point, block.body, j);
248 if(i->get()==reorder_before)