namespace GL {
namespace SL {
-void NodeVisitor::visit(Assignment &assign)
-{
- visit(static_cast<BinaryExpression &>(assign));
-}
-
-
void TraversingVisitor::visit(Block &block)
{
+ if(&block!=current_block)
+ enter(block);
+ SetForScope<Block *> set_block(current_block, &block);
for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
(*i)->visit(*this);
}
binary.right->visit(*this);
}
+void TraversingVisitor::visit(Assignment &assign)
+{
+ visit(static_cast<BinaryExpression &>(assign));
+}
+
void TraversingVisitor::visit(FunctionCall &call)
{
for(NodeArray<Expression>::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
void TraversingVisitor::visit(FunctionDeclaration &func)
{
+ enter(func.body);
+ SetForScope<Block *> set_block(current_block, &func.body);
for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
(*i)->visit(*this);
func.body.visit(*this);
void TraversingVisitor::visit(Iteration &iter)
{
+ enter(iter.body);
+ SetForScope<Block *> set_block(current_block, &iter.body);
if(iter.init_statement)
iter.init_statement->visit(*this);
if(iter.condition)
iter.condition->visit(*this);
+ iter.body.visit(*this);
if(iter.loop_expression)
iter.loop_expression->visit(*this);
- iter.body.visit(*this);
}
void TraversingVisitor::visit(Passthrough &pass)
NodeRemover::NodeRemover():
stage(0),
to_remove(0),
- anonymous(false),
recursive_remove(false)
{ }
{
stage = &s;
to_remove = &tr;
- visit(s.content);
+ s.content.visit(*this);
}
-void NodeRemover::remove_variable(map<string, VariableDeclaration *> &vars, VariableDeclaration &decl)
+template<typename T>
+void NodeRemover::remove_from_map(map<string, T *> &vars, const string &key, T &node)
{
- map<string, VariableDeclaration *>::iterator i = vars.find(decl.name);
- if(i!=vars.end() && i->second==&decl)
+ typename map<string, T *>::iterator i = vars.find(key);
+ if(i!=vars.end() && i->second==&node)
vars.erase(i);
}
void NodeRemover::visit(Block &block)
{
- blocks.push_back(&block);
+ SetForScope<Block *> set_block(current_block, &block);
for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
{
(*i)->visit(*this);
else
++i;
}
- blocks.pop_back();
}
-void NodeRemover::visit(StructDeclaration &strct)
+void NodeRemover::visit(TypeDeclaration &type)
{
- if(to_remove->count(&strct))
- blocks.back()->types.erase(strct.name);
+ if(to_remove->count(&type))
+ remove_from_map(stage->types, type.name, type);
}
void NodeRemover::visit(VariableDeclaration &var)
{
if(recursive_remove || to_remove->count(&var))
{
- remove_variable(blocks.back()->variables, var);
- if(anonymous && blocks.size()>1)
- remove_variable(blocks[blocks.size()-2]->variables, var);
- remove_variable(stage->in_variables, var);
- remove_variable(stage->out_variables, var);
+ remove_from_map(current_block->variables, var.name, var);
stage->locations.erase(var.name);
if(var.linked_declaration)
var.linked_declaration->linked_declaration = 0;
void NodeRemover::visit(InterfaceBlock &iface)
{
- SetFlag set_anon(anonymous);
+ if(to_remove->count(&iface))
+ {
+ remove_from_map(stage->interface_blocks, iface.interface+iface.name, iface);
+ if(!iface.instance_name.empty())
+ remove_from_map(stage->interface_blocks, "_"+iface.instance_name, iface);
+ }
SetFlag set_recursive(recursive_remove, recursive_remove || to_remove->count(&iface));
TraversingVisitor::visit(iface);
}
+void NodeRemover::visit(FunctionDeclaration &func)
+{
+ if(to_remove->count(&func))
+ remove_from_map(stage->functions, func.name, func);
+ TraversingVisitor::visit(func);
+}
+
void NodeRemover::visit(Iteration &iter)
{
if(to_remove->count(iter.init_statement.get()))
TraversingVisitor::visit(iter);
}
+
+NodeReorderer::NodeReorderer():
+ reorder_before(0),
+ to_reorder(0)
+{ }
+
+void NodeReorderer::apply(Stage &stage, Node &before, const set<Node *> &tr)
+{
+ reorder_before = &before;
+ to_reorder = &tr;
+ stage.content.visit(*this);
+}
+
+void NodeReorderer::visit(Block &block)
+{
+ NodeList<Statement>::iterator insert_point = block.body.end();
+ for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
+ {
+ (*i)->visit(*this);
+ if(insert_point!=block.body.end() && to_reorder->count(i->get()))
+ {
+ NodeList<Statement>::iterator j = i++;
+ block.body.splice(insert_point, block.body, j);
+ }
+ else
+ {
+ if(i->get()==reorder_before)
+ insert_point = i;
+ ++i;
+ }
+ }
+}
+
} // namespace SL
} // namespace GL
} // namespace Msp