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.members->visit(*this);
95 void TraversingVisitor::visit(FunctionDeclaration &func)
98 SetForScope<Block *> set_block(current_block, &func.body);
99 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
101 func.body.visit(*this);
104 void TraversingVisitor::visit(Conditional &cond)
106 visit(cond.condition);
107 cond.body.visit(*this);
108 cond.else_body.visit(*this);
111 void TraversingVisitor::visit(Iteration &iter)
114 SetForScope<Block *> set_block(current_block, &iter.body);
115 if(iter.init_statement)
116 iter.init_statement->visit(*this);
118 visit(iter.condition);
119 iter.body.visit(*this);
120 if(iter.loop_expression)
121 visit(iter.loop_expression);
124 void TraversingVisitor::visit(Passthrough &pass)
127 visit(pass.subscript);
130 void TraversingVisitor::visit(Return &ret)
133 visit(ret.expression);
137 NodeRemover::NodeRemover():
140 recursive_remove(false)
143 void NodeRemover::apply(Stage &s, const set<Node *> &tr)
147 s.content.visit(*this);
151 void NodeRemover::remove_from_map(map<string, T *> &vars, const string &key, T &node)
153 typename map<string, T *>::iterator i = vars.find(key);
154 if(i!=vars.end() && i->second==&node)
158 void NodeRemover::visit(Block &block)
160 SetForScope<Block *> set_block(current_block, &block);
161 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
164 if(to_remove->count(i->get()))
165 block.body.erase(i++);
171 void NodeRemover::visit(TypeDeclaration &type)
173 if(to_remove->count(&type))
174 remove_from_map(stage->types, type.name, type);
177 void NodeRemover::visit(VariableDeclaration &var)
179 if(recursive_remove || to_remove->count(&var))
181 remove_from_map(current_block->variables, var.name, var);
182 stage->locations.erase(var.name);
183 if(var.linked_declaration)
184 var.linked_declaration->linked_declaration = 0;
186 else if(var.init_expression && to_remove->count(var.init_expression.get()))
187 var.init_expression = 0;
190 void NodeRemover::visit(InterfaceBlock &iface)
192 if(to_remove->count(&iface))
194 remove_from_map(stage->interface_blocks, iface.interface+iface.name, iface);
195 if(!iface.instance_name.empty())
196 remove_from_map(stage->interface_blocks, "_"+iface.instance_name, iface);
198 SetFlag set_recursive(recursive_remove, recursive_remove || to_remove->count(&iface));
199 TraversingVisitor::visit(iface);
202 void NodeRemover::visit(FunctionDeclaration &func)
204 if(to_remove->count(&func))
206 remove_from_map(stage->functions, func.name, func);
207 if(!func.signature.empty())
208 remove_from_map(stage->functions, func.name+func.signature, func);
210 TraversingVisitor::visit(func);
213 void NodeRemover::visit(Iteration &iter)
215 if(to_remove->count(iter.init_statement.get()))
216 iter.init_statement = 0;
217 TraversingVisitor::visit(iter);
221 NodeReorderer::NodeReorderer():
226 void NodeReorderer::apply(Stage &stage, Node &before, const set<Node *> &tr)
228 reorder_before = &before;
230 stage.content.visit(*this);
233 void NodeReorderer::visit(Block &block)
235 NodeList<Statement>::iterator insert_point = block.body.end();
236 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
239 if(insert_point!=block.body.end() && to_reorder->count(i->get()))
241 NodeList<Statement>::iterator j = i++;
242 block.body.splice(insert_point, block.body, j);
246 if(i->get()==reorder_before)