1 #include <msp/core/raii.h>
2 #include <msp/strings/format.h>
3 #include <msp/strings/utils.h>
6 #include "programcompiler.h"
14 const char builtins_src[] =
16 "out gl_PerVertex {\n"
17 " vec4 gl_Position;\n"
18 " float gl_ClipDistance[];\n"
22 " vec4 gl_Position;\n"
23 " float gl_ClipDistance[];\n"
25 "out gl_PerVertex {\n"
26 " vec4 gl_Position;\n"
27 " float gl_ClipDistance[];\n"
35 using namespace ProgramSyntax;
37 ProgramCompiler::ProgramCompiler():
42 void ProgramCompiler::compile(const string &source)
45 module = &parser.parse(source);
49 void ProgramCompiler::compile(IO::Base &io, Resources *res)
52 module = &parser.parse(io);
56 void ProgramCompiler::add_shaders(Program &program)
59 throw invalid_operation("ProgramCompiler::add_shaders");
61 string head = "#version 150\n";
62 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
65 program.attach_shader_owned(new VertexShader(head+apply<Formatter>(*i)));
66 else if(i->type==GEOMETRY)
67 program.attach_shader_owned(new GeometryShader(head+apply<Formatter>(*i)));
68 else if(i->type==FRAGMENT)
69 program.attach_shader_owned(new FragmentShader(head+apply<Formatter>(*i)));
72 program.bind_attribute(VERTEX4, "vertex");
73 program.bind_attribute(NORMAL3, "normal");
74 program.bind_attribute(COLOR4_FLOAT, "color");
75 program.bind_attribute(TEXCOORD4, "texcoord");
78 Module *ProgramCompiler::create_builtins_module()
81 Module *module = new Module(parser.parse(builtins_src));
82 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
84 VariableResolver resolver;
85 i->content.visit(resolver);
86 for(map<string, VariableDeclaration *>::iterator j=i->content.variables.begin(); j!=i->content.variables.end(); ++j)
87 j->second->linked_declaration = j->second;
92 Module &ProgramCompiler::get_builtins_module()
94 static RefPtr<Module> builtins_module = create_builtins_module();
95 return *builtins_module;
98 Stage *ProgramCompiler::get_builtins(StageType type)
100 Module &module = get_builtins_module();
101 for(list<Stage>::iterator i=module.stages.begin(); i!=module.stages.end(); ++i)
107 void ProgramCompiler::process()
109 list<Import *> imports = apply<NodeGatherer<Import> >(module->shared);
110 for(list<Import *>::iterator i=imports.end(); i!=imports.begin(); )
111 import((*--i)->module);
112 apply<NodeRemover>(module->shared, set<Node *>(imports.begin(), imports.end()));
114 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
116 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); )
119 i = module->stages.begin();
125 void ProgramCompiler::import(const string &name)
128 throw runtime_error("no resources");
129 RefPtr<IO::Seekable> io = resources->open_raw(name+".glsl");
131 throw runtime_error(format("module %s not found", name));
132 ProgramParser import_parser;
133 Module &imported_module = import_parser.parse(*io);
135 inject_block(module->shared.content, imported_module.shared.content);
136 apply<DeclarationCombiner>(module->shared);
137 for(list<Stage>::iterator i=imported_module.stages.begin(); i!=imported_module.stages.end(); ++i)
139 list<Stage>::iterator j;
140 for(j=module->stages.begin(); (j!=module->stages.end() && j->type<i->type); ++j) ;
141 if(j==module->stages.end() || j->type>i->type)
143 j = module->stages.insert(j, *i);
144 list<Stage>::iterator k = j;
145 if(++k!=module->stages.end())
147 if(j!=module->stages.begin())
148 j->previous = &*--(k=j);
152 inject_block(j->content, i->content);
153 apply<DeclarationCombiner>(*j);
158 void ProgramCompiler::generate(Stage &stage)
160 inject_block(stage.content, module->shared.content);
162 apply<VariableResolver>(stage);
163 apply<InterfaceGenerator>(stage);
164 apply<VariableResolver>(stage);
165 apply<VariableRenamer>(stage);
168 bool ProgramCompiler::optimize(Stage &stage)
170 apply<ConstantConditionEliminator>(stage);
171 apply<VariableResolver>(stage);
173 set<Node *> unused = apply<UnusedVariableLocator>(stage);
174 apply<NodeRemover>(stage, unused);
176 return !unused.empty();
179 void ProgramCompiler::inject_block(Block &target, const Block &source)
181 list<NodePtr<Node> >::iterator insert_point = target.body.begin();
182 for(list<NodePtr<Node> >::const_iterator i=source.body.begin(); i!=source.body.end(); ++i)
183 target.body.insert(insert_point, (*i)->clone());
187 typename T::ResultType ProgramCompiler::apply(Stage &stage)
190 visitor.apply(stage);
191 return visitor.get_result();
194 template<typename T, typename A>
195 typename T::ResultType ProgramCompiler::apply(Stage &stage, const A &arg)
198 visitor.apply(stage);
199 return visitor.get_result();
203 ProgramCompiler::Visitor::Visitor():
207 void ProgramCompiler::Visitor::apply(Stage &s)
209 SetForScope<Stage *> set(stage, &s);
210 stage->content.visit(*this);
214 ProgramCompiler::Formatter::Formatter():
216 parameter_list(false),
220 void ProgramCompiler::Formatter::visit(Literal &literal)
222 formatted += literal.token;
225 void ProgramCompiler::Formatter::visit(ParenthesizedExpression &parexpr)
228 parexpr.expression->visit(*this);
232 void ProgramCompiler::Formatter::visit(VariableReference &var)
234 formatted += var.name;
237 void ProgramCompiler::Formatter::visit(MemberAccess &memacc)
239 memacc.left->visit(*this);
240 formatted += format(".%s", memacc.member);
243 void ProgramCompiler::Formatter::visit(UnaryExpression &unary)
246 formatted += unary.oper;
247 unary.expression->visit(*this);
249 formatted += unary.oper;
252 void ProgramCompiler::Formatter::visit(BinaryExpression &binary)
254 binary.left->visit(*this);
255 formatted += binary.oper;
256 binary.right->visit(*this);
257 formatted += binary.after;
260 void ProgramCompiler::Formatter::visit(Assignment &assign)
262 assign.left->visit(*this);
263 formatted += format(" %s ", assign.oper);
264 assign.right->visit(*this);
267 void ProgramCompiler::Formatter::visit(FunctionCall &call)
269 formatted += format("%s(", call.name);
270 for(vector<NodePtr<Expression> >::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
272 if(i!=call.arguments.begin())
279 void ProgramCompiler::Formatter::visit(ExpressionStatement &expr)
281 expr.expression->visit(*this);
285 void ProgramCompiler::Formatter::visit(Block &block)
290 unsigned brace_indent = indent;
291 bool use_braces = (block.use_braces || (indent && block.body.size()!=1));
293 formatted += format("%s{\n", string(brace_indent*2, ' '));
295 SetForScope<unsigned> set(indent, indent+!formatted.empty());
296 string spaces(indent*2, ' ');
297 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
299 if(i!=block.body.begin())
307 formatted += format("\n%s}", string(brace_indent*2, ' '));
310 void ProgramCompiler::Formatter::visit(Import &import)
312 formatted += format("import %s;", import.module);
315 void ProgramCompiler::Formatter::visit(Layout &layout)
317 formatted += "layout(";
318 for(vector<Layout::Qualifier>::const_iterator i=layout.qualifiers.begin(); i!=layout.qualifiers.end(); ++i)
320 if(i!=layout.qualifiers.begin())
322 formatted += i->identifier;
323 if(!i->value.empty())
324 formatted += format("=%s", i->value);
326 formatted += format(") %s;", layout.interface);
329 void ProgramCompiler::Formatter::visit(StructDeclaration &strct)
331 formatted += format("struct %s\n", strct.name);
332 strct.members.visit(*this);
336 void ProgramCompiler::Formatter::visit(VariableDeclaration &var)
339 formatted += "const ";
340 if(!var.sampling.empty())
341 formatted += format("%s ", var.sampling);
342 if(!var.interface.empty() && var.interface!=block_interface)
343 formatted += format("%s ", var.interface);
344 formatted += format("%s %s", var.type, var.name);
349 var.array_size->visit(*this);
352 if(var.init_expression)
355 var.init_expression->visit(*this);
361 void ProgramCompiler::Formatter::visit(InterfaceBlock &iface)
363 SetForScope<string> set(block_interface, iface.interface);
364 formatted += format("%s %s\n", iface.interface, iface.name);
365 iface.members.visit(*this);
369 void ProgramCompiler::Formatter::visit(FunctionDeclaration &func)
371 formatted += format("%s %s(", func.return_type, func.name);
372 for(vector<NodePtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
374 if(i!=func.parameters.begin())
376 SetFlag set(parameter_list);
380 if(func.definition==&func)
383 func.body.visit(*this);
389 void ProgramCompiler::Formatter::visit(Conditional &cond)
392 formatted.replace(formatted.rfind('\n'), string::npos, 1, ' ');
397 cond.condition->visit(*this);
400 cond.body.visit(*this);
401 if(!cond.else_body.body.empty())
403 formatted += format("\n%selse\n", string(indent*2, ' '));
404 SetForScope<unsigned> set(else_if, 2);
405 cond.else_body.visit(*this);
409 void ProgramCompiler::Formatter::visit(Iteration &iter)
412 iter.init_statement->visit(*this);
414 iter.condition->visit(*this);
416 iter.loop_expression->visit(*this);
418 iter.body.visit(*this);
421 void ProgramCompiler::Formatter::visit(Return &ret)
423 formatted += "return ";
424 ret.expression->visit(*this);
429 ProgramCompiler::DeclarationCombiner::DeclarationCombiner():
434 void ProgramCompiler::DeclarationCombiner::visit(Block &block)
439 SetForScope<bool> set(toplevel, false);
440 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
445 block.body.erase(i++);
451 void ProgramCompiler::DeclarationCombiner::visit(FunctionDeclaration &func)
453 vector<FunctionDeclaration *> &decls = functions[func.name];
456 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
458 (*i)->definition = func.definition;
459 (*i)->body.body.clear();
462 decls.push_back(&func);
465 void ProgramCompiler::DeclarationCombiner::visit(VariableDeclaration &var)
467 VariableDeclaration *&ptr = variables[var.name];
470 if(var.init_expression)
471 ptr->init_expression = var.init_expression;
479 ProgramCompiler::VariableResolver::VariableResolver():
481 record_target(false),
482 assignment_target(0),
483 self_referencing(false)
486 void ProgramCompiler::VariableResolver::apply(Stage &s)
488 SetForScope<Stage *> set(stage, &s);
489 Stage *builtins = get_builtins(stage->type);
491 blocks.push_back(&builtins->content);
492 stage->content.visit(*this);
497 void ProgramCompiler::VariableResolver::visit(Block &block)
499 blocks.push_back(&block);
500 block.variables.clear();
501 TraversingVisitor::visit(block);
505 void ProgramCompiler::VariableResolver::visit(VariableReference &var)
509 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
512 map<string, VariableDeclaration *>::iterator j = (*i)->variables.find(var.name);
513 if(j!=(*i)->variables.end())
515 var.declaration = j->second;
516 type = j->second->type_declaration;
523 if(assignment_target)
525 record_target = false;
526 assignment_target = 0;
529 assignment_target = var.declaration;
531 else if(var.declaration && var.declaration==assignment_target)
532 self_referencing = true;
535 void ProgramCompiler::VariableResolver::visit(MemberAccess &memacc)
538 TraversingVisitor::visit(memacc);
539 memacc.declaration = 0;
542 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
543 if(i!=type->members.variables.end())
545 memacc.declaration = i->second;
546 type = i->second->type_declaration;
553 void ProgramCompiler::VariableResolver::visit(BinaryExpression &binary)
558 SetForScope<bool> set(record_target, false);
559 binary.right->visit(*this);
562 binary.left->visit(*this);
566 TraversingVisitor::visit(binary);
571 void ProgramCompiler::VariableResolver::visit(Assignment &assign)
574 SetFlag set(record_target);
575 assignment_target = 0;
576 assign.left->visit(*this);
579 self_referencing = false;
580 assign.right->visit(*this);
582 assign.self_referencing = (self_referencing || assign.oper!="=");
583 assign.target_declaration = assignment_target;
586 void ProgramCompiler::VariableResolver::visit(StructDeclaration &strct)
588 TraversingVisitor::visit(strct);
589 blocks.back()->types[strct.name] = &strct;
592 void ProgramCompiler::VariableResolver::visit(VariableDeclaration &var)
594 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
597 map<string, StructDeclaration *>::iterator j = (*i)->types.find(var.type);
598 if(j!=(*i)->types.end())
599 var.type_declaration = j->second;
602 if(!block_interface.empty() && var.interface.empty())
603 var.interface = block_interface;
605 TraversingVisitor::visit(var);
606 blocks.back()->variables[var.name] = &var;
607 if(anonymous && blocks.size()>1)
608 blocks[blocks.size()-2]->variables[var.name] = &var;
611 void ProgramCompiler::VariableResolver::visit(InterfaceBlock &iface)
613 SetFlag set(anonymous);
614 SetForScope<string> set2(block_interface, iface.interface);
615 TraversingVisitor::visit(iface);
619 ProgramCompiler::InterfaceGenerator::InterfaceGenerator():
624 string ProgramCompiler::InterfaceGenerator::get_out_prefix(StageType type)
628 else if(type==GEOMETRY)
634 void ProgramCompiler::InterfaceGenerator::apply(Stage &s)
636 SetForScope<Stage *> set(stage, &s);
638 in_prefix = get_out_prefix(stage->previous->type);
639 out_prefix = get_out_prefix(stage->type);
640 stage->content.visit(*this);
643 void ProgramCompiler::InterfaceGenerator::visit(Block &block)
645 SetForScope<unsigned> set(scope_level, scope_level+1);
646 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
652 for(map<string, VariableDeclaration *>::iterator j=iface_declarations.begin(); j!=iface_declarations.end(); ++j)
654 list<NodePtr<Node> >::iterator k = block.body.insert(i, j->second);
657 iface_declarations.clear();
660 for(list<Node *>::iterator j=insert_nodes.begin(); j!=insert_nodes.end(); ++j)
661 block.body.insert(i, *j);
662 insert_nodes.clear();
665 block.body.erase(i++);
672 string ProgramCompiler::InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
674 unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
675 return prefix+name.substr(offset);
678 bool ProgramCompiler::InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
680 const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
681 if(stage_vars.count(name) || iface_declarations.count(name))
684 VariableDeclaration* iface_var = new VariableDeclaration;
685 iface_var->sampling = var.sampling;
686 iface_var->interface = iface;
687 iface_var->type = var.type;
688 iface_var->type_declaration = var.type_declaration;
689 iface_var->name = name;
690 if(stage->type==GEOMETRY)
691 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
693 iface_var->array = var.array;
695 iface_var->array_size = var.array_size;
697 iface_var->linked_declaration = &var;
698 iface_declarations[name] = iface_var;
703 void ProgramCompiler::InterfaceGenerator::insert_assignment(const string &left, ProgramSyntax::Expression *right)
705 Assignment *assign = new Assignment;
706 VariableReference *ref = new VariableReference;
710 assign->right = right;
712 ExpressionStatement *stmt = new ExpressionStatement;
713 stmt->expression = assign;
714 insert_nodes.push_back(stmt);
717 void ProgramCompiler::InterfaceGenerator::visit(VariableReference &var)
719 if(var.declaration || !stage->previous)
721 if(iface_declarations.count(var.name))
724 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
725 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
726 if(i==prev_out.end())
727 i = prev_out.find(in_prefix+var.name);
728 if(i!=prev_out.end())
729 generate_interface(*i->second, "in", var.name);
732 void ProgramCompiler::InterfaceGenerator::visit(VariableDeclaration &var)
734 if(var.interface=="out")
737 stage->out_variables[var.name] = &var;
738 else if(generate_interface(var, "out", change_prefix(var.name, string())))
741 if(var.init_expression)
742 insert_assignment(var.name, var.init_expression->clone());
745 else if(var.interface=="in")
747 stage->in_variables[var.name] = &var;
748 if(var.linked_declaration)
749 var.linked_declaration->linked_declaration = &var;
750 else if(stage->previous)
752 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
753 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
754 if(i!=prev_out.end())
756 var.linked_declaration = i->second;
757 i->second->linked_declaration = &var;
762 TraversingVisitor::visit(var);
765 void ProgramCompiler::InterfaceGenerator::visit(Passthrough &pass)
767 vector<VariableDeclaration *> pass_vars;
769 for(map<string, VariableDeclaration *>::const_iterator i=stage->in_variables.begin(); i!=stage->in_variables.end(); ++i)
770 pass_vars.push_back(i->second);
771 for(map<string, VariableDeclaration *>::const_iterator i=iface_declarations.begin(); i!=iface_declarations.end(); ++i)
772 if(i->second->interface=="in")
773 pass_vars.push_back(i->second);
777 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
778 for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
781 for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
782 linked = ((*j)->linked_declaration==i->second);
784 if(!linked && generate_interface(*i->second, "in", i->second->name))
785 pass_vars.push_back(i->second);
789 if(stage->type==GEOMETRY)
791 VariableReference *ref = new VariableReference;
794 BinaryExpression *subscript = new BinaryExpression;
795 subscript->left = ref;
796 subscript->oper = "[";
797 subscript->right = pass.subscript;
798 subscript->after = "]";
800 MemberAccess *memacc = new MemberAccess;
801 memacc->left = subscript;
802 memacc->member = "gl_Position";
804 insert_assignment("gl_Position", memacc);
807 for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
809 string out_name = change_prefix((*i)->name, out_prefix);
810 generate_interface(**i, "out", out_name);
812 VariableReference *ref = new VariableReference;
813 ref->name = (*i)->name;
816 BinaryExpression *subscript = new BinaryExpression;
817 subscript->left = ref;
818 subscript->oper = "[";
819 subscript->right = pass.subscript;
820 subscript->after = "]";
821 insert_assignment(out_name, subscript);
824 insert_assignment(out_name, ref);
831 void ProgramCompiler::VariableRenamer::visit(VariableReference &var)
834 var.name = var.declaration->name;
837 void ProgramCompiler::VariableRenamer::visit(VariableDeclaration &var)
839 if(var.linked_declaration)
840 var.name = var.linked_declaration->name;
841 TraversingVisitor::visit(var);
845 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator():
851 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator(const ValueMap &v):
857 void ProgramCompiler::ExpressionEvaluator::visit(Literal &literal)
859 if(literal.token=="true")
861 else if(literal.token=="false")
864 result = lexical_cast<float>(literal.token);
868 void ProgramCompiler::ExpressionEvaluator::visit(VariableReference &var)
875 ValueMap::const_iterator i = variable_values->find(var.declaration);
876 if(i!=variable_values->end())
877 i->second->visit(*this);
879 else if(var.declaration->init_expression)
880 var.declaration->init_expression->visit(*this);
883 void ProgramCompiler::ExpressionEvaluator::visit(UnaryExpression &unary)
885 result_valid = false;
886 unary.expression->visit(*this);
893 result_valid = false;
896 void ProgramCompiler::ExpressionEvaluator::visit(BinaryExpression &binary)
898 result_valid = false;
899 binary.left->visit(*this);
903 float left_result = result;
904 result_valid = false;
905 binary.right->visit(*this);
910 result = (left_result<result);
911 else if(binary.oper=="<=")
912 result = (left_result<=result);
913 else if(binary.oper==">")
914 result = (left_result>result);
915 else if(binary.oper==">=")
916 result = (left_result>=result);
917 else if(binary.oper=="==")
918 result = (left_result==result);
919 else if(binary.oper=="!=")
920 result = (left_result!=result);
921 else if(binary.oper=="&&")
922 result = (left_result && result);
923 else if(binary.oper=="||")
924 result = (left_result || result);
926 result_valid = false;
930 ProgramCompiler::ConstantConditionEliminator::ConstantConditionEliminator():
936 void ProgramCompiler::ConstantConditionEliminator::visit(Block &block)
938 SetForScope<unsigned> set(scope_level, scope_level+1);
939 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
942 if(replacement_block)
944 for(list<NodePtr<Node> >::iterator j=replacement_block->body.begin(); j!=replacement_block->body.end(); ++j)
945 block.body.insert(i, *j);
946 replacement_block = 0;
950 block.body.erase(i++);
956 for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
957 variable_values.erase(i->second);
960 void ProgramCompiler::ConstantConditionEliminator::visit(Assignment &assign)
962 variable_values.erase(assign.target_declaration);
965 void ProgramCompiler::ConstantConditionEliminator::visit(VariableDeclaration &var)
967 if(var.constant || scope_level>1)
968 variable_values[&var] = &*var.init_expression;
971 void ProgramCompiler::ConstantConditionEliminator::visit(Conditional &cond)
973 ExpressionEvaluator eval(variable_values);
974 cond.condition->visit(eval);
975 if(eval.result_valid)
978 replacement_block = (eval.result ? &cond.body : &cond.else_body);
981 TraversingVisitor::visit(cond);
984 void ProgramCompiler::ConstantConditionEliminator::visit(Iteration &iter)
988 ExpressionEvaluator eval;
989 iter.condition->visit(eval);
990 if(eval.result_valid && !eval.result)
997 TraversingVisitor::visit(iter);
1001 ProgramCompiler::UnusedVariableLocator::UnusedVariableLocator():
1004 assignment_target(false)
1007 void ProgramCompiler::UnusedVariableLocator::apply(Stage &s)
1009 assignments.push_back(BlockAssignmentMap());
1011 assignments.pop_back();
1014 void ProgramCompiler::UnusedVariableLocator::visit(VariableReference &var)
1016 unused_nodes.erase(var.declaration);
1018 map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
1019 if(i!=aggregates.end())
1020 unused_nodes.erase(i->second);
1022 if(assignment_target)
1025 for(vector<BlockAssignmentMap>::iterator j=assignments.end(); j!=assignments.begin(); )
1028 BlockAssignmentMap::iterator k = j->find(var.declaration);
1031 for(vector<Node *>::iterator l=k->second.nodes.begin(); l!=k->second.nodes.end(); ++l)
1032 unused_nodes.erase(*l);
1039 void ProgramCompiler::UnusedVariableLocator::visit(MemberAccess &memacc)
1041 TraversingVisitor::visit(memacc);
1042 unused_nodes.erase(memacc.declaration);
1045 void ProgramCompiler::UnusedVariableLocator::visit(BinaryExpression &binary)
1047 if(binary.oper=="[")
1049 binary.left->visit(*this);
1050 SetForScope<bool> set(assignment_target, false);
1051 binary.right->visit(*this);
1054 TraversingVisitor::visit(binary);
1057 void ProgramCompiler::UnusedVariableLocator::visit(Assignment &assign)
1060 SetForScope<bool> set(assignment_target, !assign.self_referencing);
1061 assign.left->visit(*this);
1063 assign.right->visit(*this);
1064 assignment = &assign;
1067 void ProgramCompiler::UnusedVariableLocator::record_assignment(VariableDeclaration &var, Node &node, bool self_ref)
1069 unused_nodes.insert(&node);
1070 BlockAssignmentMap &block_assignments = assignments.back();
1071 AssignmentList &var_assignments = block_assignments[&var];
1073 var_assignments.nodes.clear();
1074 var_assignments.nodes.push_back(&node);
1075 var_assignments.conditional = false;
1076 var_assignments.self_referencing = self_ref;
1079 void ProgramCompiler::UnusedVariableLocator::visit(ExpressionStatement &expr)
1082 TraversingVisitor::visit(expr);
1083 if(assignment && assignment->target_declaration)
1084 record_assignment(*assignment->target_declaration, expr, assignment->self_referencing);
1087 void ProgramCompiler::UnusedVariableLocator::visit(StructDeclaration &strct)
1089 SetForScope<Node *> set(aggregate, &strct);
1090 unused_nodes.insert(&strct);
1091 TraversingVisitor::visit(strct);
1094 void ProgramCompiler::UnusedVariableLocator::visit(VariableDeclaration &var)
1097 aggregates[&var] = aggregate;
1100 unused_nodes.insert(&var);
1101 if(var.init_expression)
1102 record_assignment(var, *var.init_expression, false);
1104 unused_nodes.erase(var.type_declaration);
1105 TraversingVisitor::visit(var);
1108 void ProgramCompiler::UnusedVariableLocator::visit(InterfaceBlock &iface)
1110 SetForScope<Node *> set(aggregate, &iface);
1111 unused_nodes.insert(&iface);
1112 TraversingVisitor::visit(iface);
1115 void ProgramCompiler::UnusedVariableLocator::visit(FunctionDeclaration &func)
1117 assignments.push_back(BlockAssignmentMap());
1119 for(vector<NodePtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1121 func.body.visit(*this);
1123 BlockAssignmentMap &block_assignments = assignments.back();
1124 for(map<string, VariableDeclaration *>::iterator i=func.body.variables.begin(); i!=func.body.variables.end(); ++i)
1125 block_assignments.erase(i->second);
1126 for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
1128 if(i->first->interface=="out" && stage->type!=FRAGMENT && !i->first->linked_declaration)
1131 for(vector<Node *>::iterator j=i->second.nodes.begin(); j!=i->second.nodes.end(); ++j)
1132 unused_nodes.erase(*j);
1135 assignments.pop_back();
1138 void ProgramCompiler::UnusedVariableLocator::merge_down_assignments()
1140 BlockAssignmentMap &parent_assignments = assignments[assignments.size()-2];
1141 BlockAssignmentMap &block_assignments = assignments.back();
1142 for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
1144 BlockAssignmentMap::iterator j = parent_assignments.find(i->first);
1145 if(j==parent_assignments.end())
1146 parent_assignments.insert(*i);
1147 else if(i->second.self_referencing || i->second.conditional)
1149 j->second.nodes.insert(j->second.nodes.end(), i->second.nodes.begin(), i->second.nodes.end());
1150 j->second.conditional |= i->second.conditional;
1151 j->second.self_referencing |= i->second.self_referencing;
1154 j->second = i->second;
1156 assignments.pop_back();
1159 void ProgramCompiler::UnusedVariableLocator::visit(Conditional &cond)
1161 cond.condition->visit(*this);
1162 assignments.push_back(BlockAssignmentMap());
1163 cond.body.visit(*this);
1165 BlockAssignmentMap if_assignments;
1166 swap(assignments.back(), if_assignments);
1167 cond.else_body.visit(*this);
1169 BlockAssignmentMap &else_assignments = assignments.back();
1170 for(BlockAssignmentMap::iterator i=else_assignments.begin(); i!=else_assignments.end(); ++i)
1172 BlockAssignmentMap::iterator j = if_assignments.find(i->first);
1173 if(j!=if_assignments.end())
1175 i->second.nodes.insert(i->second.nodes.end(), j->second.nodes.begin(), j->second.nodes.end());
1176 i->second.conditional |= j->second.conditional;
1177 i->second.self_referencing |= j->second.self_referencing;
1178 if_assignments.erase(j);
1181 i->second.conditional = true;
1184 for(BlockAssignmentMap::iterator i=if_assignments.begin(); i!=if_assignments.end(); ++i)
1186 i->second.conditional = true;
1187 else_assignments.insert(*i);
1190 merge_down_assignments();
1193 void ProgramCompiler::UnusedVariableLocator::visit(Iteration &iter)
1195 assignments.push_back(BlockAssignmentMap());
1196 TraversingVisitor::visit(iter);
1197 merge_down_assignments();
1201 ProgramCompiler::NodeRemover::NodeRemover(const set<Node *> &r):
1205 void ProgramCompiler::NodeRemover::visit(Block &block)
1207 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
1210 if(to_remove.count(&**i))
1211 block.body.erase(i++);
1217 void ProgramCompiler::NodeRemover::visit(VariableDeclaration &var)
1219 if(to_remove.count(&var))
1221 stage->in_variables.erase(var.name);
1222 stage->out_variables.erase(var.name);
1223 if(var.linked_declaration)
1224 var.linked_declaration->linked_declaration = 0;
1226 else if(var.init_expression && to_remove.count(&*var.init_expression))
1227 var.init_expression = 0;