+
+ProgramCompiler::VariableResolver::VariableResolver():
+ anonymous(false)
+{ }
+
+void ProgramCompiler::VariableResolver::visit(Block &block)
+{
+ blocks.push_back(&block);
+ block.variables.clear();
+ TraversingVisitor::visit(block);
+ blocks.pop_back();
+}
+
+void ProgramCompiler::VariableResolver::visit(VariableReference &var)
+{
+ var.declaration = 0;
+ type = 0;
+ for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
+ {
+ --i;
+ map<string, VariableDeclaration *>::iterator j = (*i)->variables.find(var.name);
+ if(j!=(*i)->variables.end())
+ {
+ var.declaration = j->second;
+ type = j->second->type_declaration;
+ break;
+ }
+ }
+}
+
+void ProgramCompiler::VariableResolver::visit(MemberAccess &memacc)
+{
+ type = 0;
+ TraversingVisitor::visit(memacc);
+ memacc.declaration = 0;
+ if(type)
+ {
+ map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
+ if(i!=type->members.variables.end())
+ {
+ memacc.declaration = i->second;
+ type = i->second->type_declaration;
+ }
+ else
+ type = 0;
+ }
+}
+
+void ProgramCompiler::VariableResolver::visit(BinaryExpression &binary)
+{
+ if(binary.oper=="[")
+ {
+ binary.right->visit(*this);
+ type = 0;
+ binary.left->visit(*this);
+ }
+ else
+ {
+ TraversingVisitor::visit(binary);
+ type = 0;
+ }
+}
+
+void ProgramCompiler::VariableResolver::visit(StructDeclaration &strct)
+{
+ TraversingVisitor::visit(strct);
+ blocks.back()->types[strct.name] = &strct;
+}
+
+void ProgramCompiler::VariableResolver::visit(VariableDeclaration &var)
+{
+ for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
+ {
+ --i;
+ map<string, StructDeclaration *>::iterator j = (*i)->types.find(var.type);
+ if(j!=(*i)->types.end())
+ var.type_declaration = j->second;
+ }
+
+ TraversingVisitor::visit(var);
+ blocks.back()->variables[var.name] = &var;
+ if(anonymous && blocks.size()>1)
+ blocks[blocks.size()-2]->variables[var.name] = &var;
+}
+
+void ProgramCompiler::VariableResolver::visit(InterfaceBlock &iface)
+{
+ SetFlag set(anonymous);
+ TraversingVisitor::visit(iface);
+}
+
+
+ProgramCompiler::InterfaceGenerator::InterfaceGenerator():
+ stage(0),
+ scope_level(0),
+ remove_node(false)
+{ }
+
+string ProgramCompiler::InterfaceGenerator::get_out_prefix(StageType type)
+{
+ if(type==VERTEX)
+ return "_vs_out_";
+ else if(type==GEOMETRY)
+ return "_gs_out_";
+ else
+ return string();
+}
+
+void ProgramCompiler::InterfaceGenerator::visit(Stage &s)
+{
+ SetForScope<Stage *> set(stage, &s);
+ if(stage->previous)
+ in_prefix = get_out_prefix(stage->previous->type);
+ out_prefix = get_out_prefix(stage->type);
+ stage->content.visit(*this);
+}
+
+void ProgramCompiler::InterfaceGenerator::visit(Block &block)
+{
+ SetForScope<unsigned> set(scope_level, scope_level+1);
+ for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
+ {
+ (*i)->visit(*this);
+
+ if(scope_level==1)
+ {
+ for(map<string, NodePtr<Node> >::iterator j=iface_declarations.begin(); j!=iface_declarations.end(); ++j)
+ {
+ list<NodePtr<Node> >::iterator k = block.body.insert(i, j->second);
+ (*k)->visit(*this);
+ }
+ iface_declarations.clear();
+ }
+
+ for(list<NodePtr<Node> >::iterator j=insert_nodes.begin(); j!=insert_nodes.end(); ++j)
+ block.body.insert(i, *j);
+ insert_nodes.clear();
+
+ if(remove_node)
+ block.body.erase(i++);
+ else
+ ++i;
+ remove_node = false;
+ }
+}
+
+string ProgramCompiler::InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
+{
+ unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
+ return prefix+name.substr(offset);
+}
+
+bool ProgramCompiler::InterfaceGenerator::generate_interface(VariableDeclaration &out, const string &iface, const string &name)
+{
+ const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
+ if(stage_vars.count(name) || iface_declarations.count(name))
+ return false;
+
+ VariableDeclaration* iface_var = new VariableDeclaration;
+ iface_var->sampling = out.sampling;
+ iface_var->interface = iface;
+ iface_var->type = out.type;
+ iface_var->type_declaration = out.type_declaration;
+ iface_var->name = name;
+ iface_var->array = (out.array || (stage->type==GEOMETRY && iface=="in"));
+ iface_var->array_size = out.array_size;
+ if(iface=="in")
+ iface_var->linked_declaration = &out;
+ iface_declarations[iface_var->name] = iface_var;
+
+ return true;
+}
+
+void ProgramCompiler::InterfaceGenerator::insert_assignment(const string &left, ProgramSyntax::Expression *right)
+{
+ BinaryExpression *assign = new BinaryExpression;
+ VariableReference *ref = new VariableReference;
+ ref->name = left;
+ assign->left = ref;
+ assign->oper = "=";
+ assign->right = right;
+ assign->assignment = true;
+
+ ExpressionStatement *stmt = new ExpressionStatement;
+ stmt->expression = assign;
+ insert_nodes.push_back(stmt);
+}
+
+void ProgramCompiler::InterfaceGenerator::visit(VariableReference &var)
+{
+ if(var.declaration || !stage->previous)
+ return;
+ if(iface_declarations.count(var.name))
+ return;
+
+ const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
+ map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
+ if(i==prev_out.end())
+ i = prev_out.find(in_prefix+var.name);
+ if(i!=prev_out.end())
+ generate_interface(*i->second, "in", var.name);
+}
+
+void ProgramCompiler::InterfaceGenerator::visit(VariableDeclaration &var)
+{
+ if(var.interface=="out")
+ {
+ if(scope_level==1)
+ stage->out_variables[var.name] = &var;
+ else if(generate_interface(var, "out", change_prefix(var.name, string())))
+ {
+ remove_node = true;
+ if(var.init_expression)
+ insert_assignment(var.name, var.init_expression->clone());
+ }
+ }
+ else if(var.interface=="in")
+ {
+ stage->in_variables[var.name] = &var;
+ if(var.linked_declaration)
+ var.linked_declaration->linked_declaration = &var;
+ else if(stage->previous)
+ {
+ const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
+ map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
+ if(i!=prev_out.end())
+ {
+ var.linked_declaration = i->second;
+ i->second->linked_declaration = &var;
+ }
+ }
+ }
+
+ TraversingVisitor::visit(var);
+}
+
+void ProgramCompiler::InterfaceGenerator::visit(Passthrough &pass)
+{
+ if(stage->previous)
+ {
+ const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
+ for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
+ {
+ string out_name = change_prefix(i->second->name, out_prefix);
+ generate_interface(*i->second, "in", i->second->name);
+ generate_interface(*i->second, "out", out_name);
+
+ VariableReference *ref = new VariableReference;
+ ref->name = i->first;
+ if(pass.subscript)
+ {
+ BinaryExpression *subscript = new BinaryExpression;
+ subscript->left = ref;
+ subscript->oper = "[";
+ subscript->right = pass.subscript;
+ subscript->after = "]";
+ insert_assignment(out_name, subscript);
+ }
+ else
+ insert_assignment(out_name, ref);
+ }
+ }
+
+ remove_node = true;
+}
+
+
+void ProgramCompiler::VariableRenamer::visit(VariableReference &var)
+{
+ if(var.declaration)
+ var.name = var.declaration->name;
+}
+
+void ProgramCompiler::VariableRenamer::visit(VariableDeclaration &var)
+{
+ if(var.linked_declaration)
+ var.name = var.linked_declaration->name;
+ TraversingVisitor::visit(var);
+}
+
+
+ProgramCompiler::UnusedVariableLocator::UnusedVariableLocator():
+ stage(0),
+ assignment(false),
+ assignment_target(0)
+{ }
+
+void ProgramCompiler::UnusedVariableLocator::visit(Stage &s)
+{
+ stage = &s;
+ stage->content.visit(*this);
+}
+
+void ProgramCompiler::UnusedVariableLocator::visit(VariableReference &var)
+{
+ if(assignment)
+ assignment_target = var.declaration;
+ else
+ {
+ unused_nodes.erase(var.declaration);
+ map<VariableDeclaration *, Node *>::iterator i = assignments.find(var.declaration);
+ if(i!=assignments.end())
+ unused_nodes.erase(i->second);
+ }
+}
+
+void ProgramCompiler::UnusedVariableLocator::visit(MemberAccess &memacc)
+{
+ TraversingVisitor::visit(memacc);
+ unused_nodes.erase(memacc.declaration);
+}
+
+void ProgramCompiler::UnusedVariableLocator::visit(BinaryExpression &binary)
+{
+ if(binary.assignment)
+ {
+ binary.right->visit(*this);
+ assignment = true;
+ binary.left->visit(*this);
+ }
+ else
+ TraversingVisitor::visit(binary);
+}
+
+void ProgramCompiler::UnusedVariableLocator::visit(ExpressionStatement &expr)
+{
+ assignment = false;
+ assignment_target = 0;
+ TraversingVisitor::visit(expr);
+ if(assignment && assignment_target)
+ {
+ if(assignment_target->interface!="out" || (stage->type!=FRAGMENT && !assignment_target->linked_declaration))
+ {
+ unused_nodes.insert(&expr);
+ assignments[assignment_target] = &expr;
+ }
+ else
+ unused_nodes.erase(assignment_target);
+ }
+ assignment = false;
+}
+
+void ProgramCompiler::UnusedVariableLocator::visit(VariableDeclaration &var)
+{
+ unused_nodes.insert(&var);
+ TraversingVisitor::visit(var);
+}
+
+
+ProgramCompiler::NodeRemover::NodeRemover():
+ stage(0),
+ n_removed(0),
+ immutable_block(false),
+ remove_block(false)
+{ }
+
+void ProgramCompiler::NodeRemover::visit(Stage &s)
+{
+ stage = &s;
+ stage->content.visit(*this);
+}
+
+void ProgramCompiler::NodeRemover::visit(Block &block)
+{
+ remove_block = immutable_block;
+ for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
+ {
+ bool remove = to_remove.count(&**i);
+ if(!remove)
+ remove_block = false;
+ (*i)->visit(*this);
+
+ if(remove ? !immutable_block : remove_block)
+ {
+ block.body.erase(i++);
+ ++n_removed;
+ }
+ else
+ ++i;
+ }
+}
+
+void ProgramCompiler::NodeRemover::visit(StructDeclaration &strct)
+{
+ SetFlag set(immutable_block);
+ TraversingVisitor::visit(strct);
+}
+
+void ProgramCompiler::NodeRemover::visit(VariableDeclaration &var)
+{
+ if(to_remove.count(&var))
+ {
+ stage->in_variables.erase(var.name);
+ stage->out_variables.erase(var.name);
+ if(var.linked_declaration)
+ var.linked_declaration->linked_declaration = 0;
+ }
+}
+
+void ProgramCompiler::NodeRemover::visit(InterfaceBlock &iface)
+{
+ SetFlag set(immutable_block);
+ TraversingVisitor::visit(iface);
+}
+