namespace GL {
namespace SL {
-void NodeVisitor::visit(Assignment &assign)
+void TraversingVisitor::visit(Block &block)
{
- visit(static_cast<BinaryExpression &>(assign));
+ if(&block!=current_block)
+ enter(block);
+ SetForScope<Block *> set_block(current_block, &block);
+ for(const RefPtr<Statement> &s: block.body)
+ s->visit(*this);
}
-
-void TraversingVisitor::visit(Block &block)
+void TraversingVisitor::visit(RefPtr<Expression> &expr)
{
- for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
- (*i)->visit(*this);
+ expr->visit(*this);
}
-void TraversingVisitor::visit(ParenthesizedExpression &parexpr)
+void TraversingVisitor::visit(MemberAccess &memacc)
{
- parexpr.expression->visit(*this);
+ visit(memacc.left);
}
-void TraversingVisitor::visit(MemberAccess &memacc)
+void TraversingVisitor::visit(Swizzle &swizzle)
{
- memacc.left->visit(*this);
+ visit(swizzle.left);
}
void TraversingVisitor::visit(UnaryExpression &unary)
{
- unary.expression->visit(*this);
+ visit(unary.expression);
}
void TraversingVisitor::visit(BinaryExpression &binary)
{
- binary.left->visit(*this);
- binary.right->visit(*this);
+ visit(binary.left);
+ visit(binary.right);
+}
+
+void TraversingVisitor::visit(Assignment &assign)
+{
+ visit(assign.left);
+ visit(assign.right);
+}
+
+void TraversingVisitor::visit(TernaryExpression &ternary)
+{
+ visit(ternary.condition);
+ visit(ternary.true_expr);
+ visit(ternary.false_expr);
}
void TraversingVisitor::visit(FunctionCall &call)
{
- for(NodeArray<Expression>::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
- (*i)->visit(*this);
+ for(RefPtr<Expression> &a: call.arguments)
+ visit(a);
}
void TraversingVisitor::visit(ExpressionStatement &expr)
{
- expr.expression->visit(*this);
+ visit(expr.expression);
}
void TraversingVisitor::visit(InterfaceLayout &layout)
if(var.layout)
var.layout->visit(*this);
if(var.init_expression)
- var.init_expression->visit(*this);
+ visit(var.init_expression);
if(var.array_size)
- var.array_size->visit(*this);
+ visit(var.array_size);
}
void TraversingVisitor::visit(InterfaceBlock &iface)
{
- iface.members.visit(*this);
+ if(iface.layout)
+ iface.layout->visit(*this);
+ if(iface.members)
+ iface.members->visit(*this);
}
void TraversingVisitor::visit(FunctionDeclaration &func)
{
- for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
- (*i)->visit(*this);
+ enter(func.body);
+ SetForScope<Block *> set_block(current_block, &func.body);
+ for(const RefPtr<VariableDeclaration> &p: func.parameters)
+ p->visit(*this);
func.body.visit(*this);
}
void TraversingVisitor::visit(Conditional &cond)
{
- cond.condition->visit(*this);
+ visit(cond.condition);
cond.body.visit(*this);
cond.else_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);
- if(iter.loop_expression)
- iter.loop_expression->visit(*this);
+ visit(iter.condition);
iter.body.visit(*this);
+ if(iter.loop_expression)
+ visit(iter.loop_expression);
}
void TraversingVisitor::visit(Passthrough &pass)
{
if(pass.subscript)
- pass.subscript->visit(*this);
+ visit(pass.subscript);
}
void TraversingVisitor::visit(Return &ret)
{
if(ret.expression)
- ret.expression->visit(*this);
+ visit(ret.expression);
}
-NodeRemover::NodeRemover():
- stage(0),
- to_remove(0),
- anonymous(false),
- recursive_remove(false)
-{ }
-
void NodeRemover::apply(Stage &s, const set<Node *> &tr)
{
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)
+ auto i = vars.find(key);
+ if(i!=vars.end() && i->second==&node)
vars.erase(i);
}
void NodeRemover::visit(Block &block)
{
- blocks.push_back(&block);
- for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
+ SetForScope<Block *> set_block(current_block, &block);
+ for(auto i=block.body.begin(); i!=block.body.end(); )
{
(*i)->visit(*this);
if(to_remove->count(i->get()))
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, format("%s %s", iface.interface, iface.block_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);
+ if(!func.signature.empty())
+ remove_from_map(stage->functions, func.name+func.signature, func);
+ }
+ TraversingVisitor::visit(func);
+}
+
void NodeRemover::visit(Iteration &iter)
{
if(to_remove->count(iter.init_statement.get()))
TraversingVisitor::visit(iter);
}
+
+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)
+{
+ auto insert_point = block.body.end();
+ for(auto i=block.body.begin(); i!=block.body.end(); )
+ {
+ (*i)->visit(*this);
+ if(insert_point!=block.body.end() && to_reorder->count(i->get()))
+ block.body.splice(insert_point, block.body, i++);
+ else
+ {
+ if(i->get()==reorder_before)
+ insert_point = i;
+ ++i;
+ }
+ }
+}
+
} // namespace SL
} // namespace GL
} // namespace Msp
projects / libs / gl.git / blobdiff