X-Git-Url: http://git.tdb.fi/?a=blobdiff_plain;f=source%2Fglsl%2Fvisitor.cpp;h=bee312fd187d333fd94ef529d81d5fa489898f58;hb=4c805f55d89919d6971d600102ab4d6d65d56dc3;hp=58d323ab540fc3be3a02c70a7c0a81dd333977b8;hpb=696a97bd7411d69953c1a9e4b5f3dfb4c1d848f1;p=libs%2Fgl.git

diff --git a/source/glsl/visitor.cpp b/source/glsl/visitor.cpp
index 58d323ab..bee312fd 100644
--- a/source/glsl/visitor.cpp
+++ b/source/glsl/visitor.cpp
@@ -7,14 +7,11 @@ namespace Msp {
 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);
 }
@@ -40,6 +37,11 @@ void TraversingVisitor::visit(BinaryExpression &binary)
 	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)
@@ -78,6 +80,8 @@ void TraversingVisitor::visit(InterfaceBlock &iface)
 
 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);
@@ -92,13 +96,15 @@ void TraversingVisitor::visit(Conditional &cond)
 
 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)
@@ -114,86 +120,118 @@ void TraversingVisitor::visit(Return &ret)
 }
 
 
-StageVisitor::StageVisitor():
-	stage(0)
+NodeRemover::NodeRemover():
+	stage(0),
+	to_remove(0),
+	recursive_remove(false)
 { }
 
-void StageVisitor::apply(Stage &s)
+void NodeRemover::apply(Stage &s, const set<Node *> &tr)
 {
-	SetForScope<Stage *> set(stage, &s);
-	stage->content.visit(*this);
+	stage = &s;
+	to_remove = &tr;
+	s.content.visit(*this);
 }
 
-
-BlockModifier::BlockModifier():
-	remove_node(false)
-{ }
-
-void BlockModifier::flatten_block(Block &block)
+template<typename T>
+void NodeRemover::remove_from_map(map<string, T *> &vars, const string &key, T &node)
 {
-	insert_nodes.insert(insert_nodes.end(), block.body.begin(), block.body.end());
-	remove_node = true;
+	typename map<string, T *>::iterator i = vars.find(key);
+	if(i!=vars.end() && i->second==&node)
+		vars.erase(i);
 }
 
-void BlockModifier::apply_and_increment(Block &block, NodeList<Statement>::iterator &i)
-{
-	block.body.insert(i, insert_nodes.begin(), insert_nodes.end());
-	insert_nodes.clear();
-
-	if(remove_node)
-		block.body.erase(i++);
-	else
-		++i;
-	remove_node = false;
-}
-
-void BlockModifier::visit(Block &block)
-{
-	for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
-	{
-		(*i)->visit(*this);
-		apply_and_increment(block, i);
-	}
-}
-
-
-NodeRemover::NodeRemover(const set<Node *> &r):
-	to_remove(r)
-{ }
-
 void NodeRemover::visit(Block &block)
 {
+	SetForScope<Block *> set_block(current_block, &block);
 	for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
 	{
 		(*i)->visit(*this);
-		if(to_remove.count(i->get()))
+		if(to_remove->count(i->get()))
 			block.body.erase(i++);
 		else
 			++i;
 	}
 }
 
+void NodeRemover::visit(TypeDeclaration &type)
+{
+	if(to_remove->count(&type))
+		remove_from_map(stage->types, type.name, type);
+}
+
 void NodeRemover::visit(VariableDeclaration &var)
 {
-	if(to_remove.count(&var))
+	if(recursive_remove || to_remove->count(&var))
 	{
-		stage->in_variables.erase(var.name);
-		stage->out_variables.erase(var.name);
+		remove_from_map(current_block->variables, var.name, var);
 		stage->locations.erase(var.name);
 		if(var.linked_declaration)
 			var.linked_declaration->linked_declaration = 0;
 	}
-	else if(var.init_expression && to_remove.count(var.init_expression.get()))
+	else if(var.init_expression && to_remove->count(var.init_expression.get()))
 		var.init_expression = 0;
 }
 
+void NodeRemover::visit(InterfaceBlock &iface)
+{
+	if(to_remove->count(&iface))
+	{
+		remove_from_map(stage->interface_blocks, 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()))
+	if(to_remove->count(iter.init_statement.get()))
 		iter.init_statement = 0;
 	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