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<FunctionResolver>(stage);
163 apply<VariableResolver>(stage);
164 apply<InterfaceGenerator>(stage);
165 apply<VariableResolver>(stage);
166 apply<VariableRenamer>(stage);
169 bool ProgramCompiler::optimize(Stage &stage)
171 apply<ConstantConditionEliminator>(stage);
172 apply<VariableResolver>(stage);
174 set<Node *> unused = apply<UnusedVariableLocator>(stage);
175 set<Node *> unused2 = apply<UnusedFunctionLocator>(stage);
176 unused.insert(unused2.begin(), unused2.end());
177 apply<NodeRemover>(stage, unused);
179 return !unused.empty();
182 void ProgramCompiler::inject_block(Block &target, const Block &source)
184 list<NodePtr<Node> >::iterator insert_point = target.body.begin();
185 for(list<NodePtr<Node> >::const_iterator i=source.body.begin(); i!=source.body.end(); ++i)
186 target.body.insert(insert_point, (*i)->clone());
190 typename T::ResultType ProgramCompiler::apply(Stage &stage)
193 visitor.apply(stage);
194 return visitor.get_result();
197 template<typename T, typename A>
198 typename T::ResultType ProgramCompiler::apply(Stage &stage, const A &arg)
201 visitor.apply(stage);
202 return visitor.get_result();
206 ProgramCompiler::Visitor::Visitor():
210 void ProgramCompiler::Visitor::apply(Stage &s)
212 SetForScope<Stage *> set(stage, &s);
213 stage->content.visit(*this);
217 ProgramCompiler::Formatter::Formatter():
219 parameter_list(false),
223 void ProgramCompiler::Formatter::visit(Literal &literal)
225 formatted += literal.token;
228 void ProgramCompiler::Formatter::visit(ParenthesizedExpression &parexpr)
231 parexpr.expression->visit(*this);
235 void ProgramCompiler::Formatter::visit(VariableReference &var)
237 formatted += var.name;
240 void ProgramCompiler::Formatter::visit(MemberAccess &memacc)
242 memacc.left->visit(*this);
243 formatted += format(".%s", memacc.member);
246 void ProgramCompiler::Formatter::visit(UnaryExpression &unary)
249 formatted += unary.oper;
250 unary.expression->visit(*this);
252 formatted += unary.oper;
255 void ProgramCompiler::Formatter::visit(BinaryExpression &binary)
257 binary.left->visit(*this);
258 formatted += binary.oper;
259 binary.right->visit(*this);
260 formatted += binary.after;
263 void ProgramCompiler::Formatter::visit(Assignment &assign)
265 assign.left->visit(*this);
266 formatted += format(" %s ", assign.oper);
267 assign.right->visit(*this);
270 void ProgramCompiler::Formatter::visit(FunctionCall &call)
272 formatted += format("%s(", call.name);
273 for(vector<NodePtr<Expression> >::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
275 if(i!=call.arguments.begin())
282 void ProgramCompiler::Formatter::visit(ExpressionStatement &expr)
284 expr.expression->visit(*this);
288 void ProgramCompiler::Formatter::visit(Block &block)
293 unsigned brace_indent = indent;
294 bool use_braces = (block.use_braces || (indent && block.body.size()!=1));
296 formatted += format("%s{\n", string(brace_indent*2, ' '));
298 SetForScope<unsigned> set(indent, indent+!formatted.empty());
299 string spaces(indent*2, ' ');
300 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
302 if(i!=block.body.begin())
310 formatted += format("\n%s}", string(brace_indent*2, ' '));
313 void ProgramCompiler::Formatter::visit(Import &import)
315 formatted += format("import %s;", import.module);
318 void ProgramCompiler::Formatter::visit(Layout &layout)
320 formatted += "layout(";
321 for(vector<Layout::Qualifier>::const_iterator i=layout.qualifiers.begin(); i!=layout.qualifiers.end(); ++i)
323 if(i!=layout.qualifiers.begin())
325 formatted += i->identifier;
326 if(!i->value.empty())
327 formatted += format("=%s", i->value);
329 formatted += format(") %s;", layout.interface);
332 void ProgramCompiler::Formatter::visit(StructDeclaration &strct)
334 formatted += format("struct %s\n", strct.name);
335 strct.members.visit(*this);
339 void ProgramCompiler::Formatter::visit(VariableDeclaration &var)
342 formatted += "const ";
343 if(!var.sampling.empty())
344 formatted += format("%s ", var.sampling);
345 if(!var.interface.empty() && var.interface!=block_interface)
346 formatted += format("%s ", var.interface);
347 formatted += format("%s %s", var.type, var.name);
352 var.array_size->visit(*this);
355 if(var.init_expression)
358 var.init_expression->visit(*this);
364 void ProgramCompiler::Formatter::visit(InterfaceBlock &iface)
366 SetForScope<string> set(block_interface, iface.interface);
367 formatted += format("%s %s\n", iface.interface, iface.name);
368 iface.members.visit(*this);
372 void ProgramCompiler::Formatter::visit(FunctionDeclaration &func)
374 formatted += format("%s %s(", func.return_type, func.name);
375 for(vector<NodePtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
377 if(i!=func.parameters.begin())
379 SetFlag set(parameter_list);
383 if(func.definition==&func)
386 func.body.visit(*this);
392 void ProgramCompiler::Formatter::visit(Conditional &cond)
395 formatted.replace(formatted.rfind('\n'), string::npos, 1, ' ');
400 cond.condition->visit(*this);
403 cond.body.visit(*this);
404 if(!cond.else_body.body.empty())
406 formatted += format("\n%selse\n", string(indent*2, ' '));
407 SetForScope<unsigned> set(else_if, 2);
408 cond.else_body.visit(*this);
412 void ProgramCompiler::Formatter::visit(Iteration &iter)
415 iter.init_statement->visit(*this);
417 iter.condition->visit(*this);
419 iter.loop_expression->visit(*this);
421 iter.body.visit(*this);
424 void ProgramCompiler::Formatter::visit(Return &ret)
426 formatted += "return ";
427 ret.expression->visit(*this);
432 ProgramCompiler::DeclarationCombiner::DeclarationCombiner():
437 void ProgramCompiler::DeclarationCombiner::visit(Block &block)
442 SetForScope<bool> set(toplevel, false);
443 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
448 block.body.erase(i++);
454 void ProgramCompiler::DeclarationCombiner::visit(FunctionDeclaration &func)
456 vector<FunctionDeclaration *> &decls = functions[func.name];
459 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
461 (*i)->definition = func.definition;
462 (*i)->body.body.clear();
465 decls.push_back(&func);
468 void ProgramCompiler::DeclarationCombiner::visit(VariableDeclaration &var)
470 VariableDeclaration *&ptr = variables[var.name];
473 if(var.init_expression)
474 ptr->init_expression = var.init_expression;
482 ProgramCompiler::VariableResolver::VariableResolver():
484 record_target(false),
485 assignment_target(0),
486 self_referencing(false)
489 void ProgramCompiler::VariableResolver::apply(Stage &s)
491 SetForScope<Stage *> set(stage, &s);
492 Stage *builtins = get_builtins(stage->type);
494 blocks.push_back(&builtins->content);
495 stage->content.visit(*this);
500 void ProgramCompiler::VariableResolver::visit(Block &block)
502 blocks.push_back(&block);
503 block.variables.clear();
504 TraversingVisitor::visit(block);
508 void ProgramCompiler::VariableResolver::visit(VariableReference &var)
512 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
515 map<string, VariableDeclaration *>::iterator j = (*i)->variables.find(var.name);
516 if(j!=(*i)->variables.end())
518 var.declaration = j->second;
519 type = j->second->type_declaration;
526 if(assignment_target)
528 record_target = false;
529 assignment_target = 0;
532 assignment_target = var.declaration;
534 else if(var.declaration && var.declaration==assignment_target)
535 self_referencing = true;
538 void ProgramCompiler::VariableResolver::visit(MemberAccess &memacc)
541 TraversingVisitor::visit(memacc);
542 memacc.declaration = 0;
545 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
546 if(i!=type->members.variables.end())
548 memacc.declaration = i->second;
549 type = i->second->type_declaration;
556 void ProgramCompiler::VariableResolver::visit(BinaryExpression &binary)
561 SetForScope<bool> set(record_target, false);
562 binary.right->visit(*this);
565 binary.left->visit(*this);
569 TraversingVisitor::visit(binary);
574 void ProgramCompiler::VariableResolver::visit(Assignment &assign)
577 SetFlag set(record_target);
578 assignment_target = 0;
579 assign.left->visit(*this);
582 self_referencing = false;
583 assign.right->visit(*this);
585 assign.self_referencing = (self_referencing || assign.oper!="=");
586 assign.target_declaration = assignment_target;
589 void ProgramCompiler::VariableResolver::visit(StructDeclaration &strct)
591 TraversingVisitor::visit(strct);
592 blocks.back()->types[strct.name] = &strct;
595 void ProgramCompiler::VariableResolver::visit(VariableDeclaration &var)
597 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
600 map<string, StructDeclaration *>::iterator j = (*i)->types.find(var.type);
601 if(j!=(*i)->types.end())
602 var.type_declaration = j->second;
605 if(!block_interface.empty() && var.interface.empty())
606 var.interface = block_interface;
608 TraversingVisitor::visit(var);
609 blocks.back()->variables[var.name] = &var;
610 if(anonymous && blocks.size()>1)
611 blocks[blocks.size()-2]->variables[var.name] = &var;
614 void ProgramCompiler::VariableResolver::visit(InterfaceBlock &iface)
616 SetFlag set(anonymous);
617 SetForScope<string> set2(block_interface, iface.interface);
618 TraversingVisitor::visit(iface);
622 void ProgramCompiler::FunctionResolver::visit(FunctionCall &call)
624 map<string, vector<FunctionDeclaration *> >::iterator i = functions.find(call.name);
625 if(i!=functions.end())
626 call.declaration = i->second.back();
628 TraversingVisitor::visit(call);
631 void ProgramCompiler::FunctionResolver::visit(FunctionDeclaration &func)
633 vector<FunctionDeclaration *> &decls = functions[func.name];
636 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
637 (*i)->definition = func.definition;
639 decls.push_back(&func);
641 else if(!decls.empty() && decls.back()->definition)
642 func.definition = decls.back()->definition;
644 decls.push_back(&func);
646 TraversingVisitor::visit(func);
650 ProgramCompiler::InterfaceGenerator::InterfaceGenerator():
655 string ProgramCompiler::InterfaceGenerator::get_out_prefix(StageType type)
659 else if(type==GEOMETRY)
665 void ProgramCompiler::InterfaceGenerator::apply(Stage &s)
667 SetForScope<Stage *> set(stage, &s);
669 in_prefix = get_out_prefix(stage->previous->type);
670 out_prefix = get_out_prefix(stage->type);
671 stage->content.visit(*this);
674 void ProgramCompiler::InterfaceGenerator::visit(Block &block)
676 SetForScope<unsigned> set(scope_level, scope_level+1);
677 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
683 for(map<string, VariableDeclaration *>::iterator j=iface_declarations.begin(); j!=iface_declarations.end(); ++j)
685 list<NodePtr<Node> >::iterator k = block.body.insert(i, j->second);
688 iface_declarations.clear();
691 for(list<Node *>::iterator j=insert_nodes.begin(); j!=insert_nodes.end(); ++j)
692 block.body.insert(i, *j);
693 insert_nodes.clear();
696 block.body.erase(i++);
703 string ProgramCompiler::InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
705 unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
706 return prefix+name.substr(offset);
709 bool ProgramCompiler::InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
711 const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
712 if(stage_vars.count(name) || iface_declarations.count(name))
715 VariableDeclaration* iface_var = new VariableDeclaration;
716 iface_var->sampling = var.sampling;
717 iface_var->interface = iface;
718 iface_var->type = var.type;
719 iface_var->type_declaration = var.type_declaration;
720 iface_var->name = name;
721 if(stage->type==GEOMETRY)
722 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
724 iface_var->array = var.array;
726 iface_var->array_size = var.array_size;
728 iface_var->linked_declaration = &var;
729 iface_declarations[name] = iface_var;
734 void ProgramCompiler::InterfaceGenerator::insert_assignment(const string &left, ProgramSyntax::Expression *right)
736 Assignment *assign = new Assignment;
737 VariableReference *ref = new VariableReference;
741 assign->right = right;
743 ExpressionStatement *stmt = new ExpressionStatement;
744 stmt->expression = assign;
745 insert_nodes.push_back(stmt);
748 void ProgramCompiler::InterfaceGenerator::visit(VariableReference &var)
750 if(var.declaration || !stage->previous)
752 if(iface_declarations.count(var.name))
755 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
756 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
757 if(i==prev_out.end())
758 i = prev_out.find(in_prefix+var.name);
759 if(i!=prev_out.end())
760 generate_interface(*i->second, "in", var.name);
763 void ProgramCompiler::InterfaceGenerator::visit(VariableDeclaration &var)
765 if(var.interface=="out")
768 stage->out_variables[var.name] = &var;
769 else if(generate_interface(var, "out", change_prefix(var.name, string())))
772 if(var.init_expression)
773 insert_assignment(var.name, var.init_expression->clone());
776 else if(var.interface=="in")
778 stage->in_variables[var.name] = &var;
779 if(var.linked_declaration)
780 var.linked_declaration->linked_declaration = &var;
781 else if(stage->previous)
783 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
784 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
785 if(i!=prev_out.end())
787 var.linked_declaration = i->second;
788 i->second->linked_declaration = &var;
793 TraversingVisitor::visit(var);
796 void ProgramCompiler::InterfaceGenerator::visit(Passthrough &pass)
798 vector<VariableDeclaration *> pass_vars;
800 for(map<string, VariableDeclaration *>::const_iterator i=stage->in_variables.begin(); i!=stage->in_variables.end(); ++i)
801 pass_vars.push_back(i->second);
802 for(map<string, VariableDeclaration *>::const_iterator i=iface_declarations.begin(); i!=iface_declarations.end(); ++i)
803 if(i->second->interface=="in")
804 pass_vars.push_back(i->second);
808 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
809 for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
812 for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
813 linked = ((*j)->linked_declaration==i->second);
815 if(!linked && generate_interface(*i->second, "in", i->second->name))
816 pass_vars.push_back(i->second);
820 if(stage->type==GEOMETRY)
822 VariableReference *ref = new VariableReference;
825 BinaryExpression *subscript = new BinaryExpression;
826 subscript->left = ref;
827 subscript->oper = "[";
828 subscript->right = pass.subscript;
829 subscript->after = "]";
831 MemberAccess *memacc = new MemberAccess;
832 memacc->left = subscript;
833 memacc->member = "gl_Position";
835 insert_assignment("gl_Position", memacc);
838 for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
840 string out_name = change_prefix((*i)->name, out_prefix);
841 generate_interface(**i, "out", out_name);
843 VariableReference *ref = new VariableReference;
844 ref->name = (*i)->name;
847 BinaryExpression *subscript = new BinaryExpression;
848 subscript->left = ref;
849 subscript->oper = "[";
850 subscript->right = pass.subscript;
851 subscript->after = "]";
852 insert_assignment(out_name, subscript);
855 insert_assignment(out_name, ref);
862 void ProgramCompiler::VariableRenamer::visit(VariableReference &var)
865 var.name = var.declaration->name;
868 void ProgramCompiler::VariableRenamer::visit(VariableDeclaration &var)
870 if(var.linked_declaration)
871 var.name = var.linked_declaration->name;
872 TraversingVisitor::visit(var);
876 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator():
882 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator(const ValueMap &v):
888 void ProgramCompiler::ExpressionEvaluator::visit(Literal &literal)
890 if(literal.token=="true")
892 else if(literal.token=="false")
895 result = lexical_cast<float>(literal.token);
899 void ProgramCompiler::ExpressionEvaluator::visit(VariableReference &var)
906 ValueMap::const_iterator i = variable_values->find(var.declaration);
907 if(i!=variable_values->end())
908 i->second->visit(*this);
910 else if(var.declaration->init_expression)
911 var.declaration->init_expression->visit(*this);
914 void ProgramCompiler::ExpressionEvaluator::visit(UnaryExpression &unary)
916 result_valid = false;
917 unary.expression->visit(*this);
924 result_valid = false;
927 void ProgramCompiler::ExpressionEvaluator::visit(BinaryExpression &binary)
929 result_valid = false;
930 binary.left->visit(*this);
934 float left_result = result;
935 result_valid = false;
936 binary.right->visit(*this);
941 result = (left_result<result);
942 else if(binary.oper=="<=")
943 result = (left_result<=result);
944 else if(binary.oper==">")
945 result = (left_result>result);
946 else if(binary.oper==">=")
947 result = (left_result>=result);
948 else if(binary.oper=="==")
949 result = (left_result==result);
950 else if(binary.oper=="!=")
951 result = (left_result!=result);
952 else if(binary.oper=="&&")
953 result = (left_result && result);
954 else if(binary.oper=="||")
955 result = (left_result || result);
957 result_valid = false;
961 ProgramCompiler::ConstantConditionEliminator::ConstantConditionEliminator():
967 void ProgramCompiler::ConstantConditionEliminator::visit(Block &block)
969 SetForScope<unsigned> set(scope_level, scope_level+1);
970 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
973 if(replacement_block)
975 for(list<NodePtr<Node> >::iterator j=replacement_block->body.begin(); j!=replacement_block->body.end(); ++j)
976 block.body.insert(i, *j);
977 replacement_block = 0;
981 block.body.erase(i++);
987 for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
988 variable_values.erase(i->second);
991 void ProgramCompiler::ConstantConditionEliminator::visit(Assignment &assign)
993 variable_values.erase(assign.target_declaration);
996 void ProgramCompiler::ConstantConditionEliminator::visit(VariableDeclaration &var)
998 if(var.constant || scope_level>1)
999 variable_values[&var] = &*var.init_expression;
1002 void ProgramCompiler::ConstantConditionEliminator::visit(Conditional &cond)
1004 ExpressionEvaluator eval(variable_values);
1005 cond.condition->visit(eval);
1006 if(eval.result_valid)
1009 replacement_block = (eval.result ? &cond.body : &cond.else_body);
1012 TraversingVisitor::visit(cond);
1015 void ProgramCompiler::ConstantConditionEliminator::visit(Iteration &iter)
1019 ExpressionEvaluator eval;
1020 iter.condition->visit(eval);
1021 if(eval.result_valid && !eval.result)
1028 TraversingVisitor::visit(iter);
1032 ProgramCompiler::UnusedVariableLocator::UnusedVariableLocator():
1035 assignment_target(false)
1038 void ProgramCompiler::UnusedVariableLocator::apply(Stage &s)
1040 assignments.push_back(BlockAssignmentMap());
1042 assignments.pop_back();
1045 void ProgramCompiler::UnusedVariableLocator::visit(VariableReference &var)
1047 unused_nodes.erase(var.declaration);
1049 map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
1050 if(i!=aggregates.end())
1051 unused_nodes.erase(i->second);
1053 if(assignment_target)
1056 for(vector<BlockAssignmentMap>::iterator j=assignments.end(); j!=assignments.begin(); )
1059 BlockAssignmentMap::iterator k = j->find(var.declaration);
1062 for(vector<Node *>::iterator l=k->second.nodes.begin(); l!=k->second.nodes.end(); ++l)
1063 unused_nodes.erase(*l);
1070 void ProgramCompiler::UnusedVariableLocator::visit(MemberAccess &memacc)
1072 TraversingVisitor::visit(memacc);
1073 unused_nodes.erase(memacc.declaration);
1076 void ProgramCompiler::UnusedVariableLocator::visit(BinaryExpression &binary)
1078 if(binary.oper=="[")
1080 binary.left->visit(*this);
1081 SetForScope<bool> set(assignment_target, false);
1082 binary.right->visit(*this);
1085 TraversingVisitor::visit(binary);
1088 void ProgramCompiler::UnusedVariableLocator::visit(Assignment &assign)
1091 SetForScope<bool> set(assignment_target, !assign.self_referencing);
1092 assign.left->visit(*this);
1094 assign.right->visit(*this);
1095 assignment = &assign;
1098 void ProgramCompiler::UnusedVariableLocator::record_assignment(VariableDeclaration &var, Node &node, bool self_ref)
1100 unused_nodes.insert(&node);
1101 BlockAssignmentMap &block_assignments = assignments.back();
1102 AssignmentList &var_assignments = block_assignments[&var];
1104 var_assignments.nodes.clear();
1105 var_assignments.nodes.push_back(&node);
1106 var_assignments.conditional = false;
1107 var_assignments.self_referencing = self_ref;
1110 void ProgramCompiler::UnusedVariableLocator::visit(ExpressionStatement &expr)
1113 TraversingVisitor::visit(expr);
1114 if(assignment && assignment->target_declaration)
1115 record_assignment(*assignment->target_declaration, expr, assignment->self_referencing);
1118 void ProgramCompiler::UnusedVariableLocator::visit(StructDeclaration &strct)
1120 SetForScope<Node *> set(aggregate, &strct);
1121 unused_nodes.insert(&strct);
1122 TraversingVisitor::visit(strct);
1125 void ProgramCompiler::UnusedVariableLocator::visit(VariableDeclaration &var)
1128 aggregates[&var] = aggregate;
1131 unused_nodes.insert(&var);
1132 if(var.init_expression)
1133 record_assignment(var, *var.init_expression, false);
1135 unused_nodes.erase(var.type_declaration);
1136 TraversingVisitor::visit(var);
1139 void ProgramCompiler::UnusedVariableLocator::visit(InterfaceBlock &iface)
1141 SetForScope<Node *> set(aggregate, &iface);
1142 unused_nodes.insert(&iface);
1143 TraversingVisitor::visit(iface);
1146 void ProgramCompiler::UnusedVariableLocator::visit(FunctionDeclaration &func)
1148 assignments.push_back(BlockAssignmentMap());
1150 for(vector<NodePtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1152 func.body.visit(*this);
1154 BlockAssignmentMap &block_assignments = assignments.back();
1155 for(map<string, VariableDeclaration *>::iterator i=func.body.variables.begin(); i!=func.body.variables.end(); ++i)
1156 block_assignments.erase(i->second);
1157 for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
1159 if(i->first->interface=="out" && stage->type!=FRAGMENT && !i->first->linked_declaration)
1162 for(vector<Node *>::iterator j=i->second.nodes.begin(); j!=i->second.nodes.end(); ++j)
1163 unused_nodes.erase(*j);
1166 assignments.pop_back();
1169 void ProgramCompiler::UnusedVariableLocator::merge_down_assignments()
1171 BlockAssignmentMap &parent_assignments = assignments[assignments.size()-2];
1172 BlockAssignmentMap &block_assignments = assignments.back();
1173 for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
1175 BlockAssignmentMap::iterator j = parent_assignments.find(i->first);
1176 if(j==parent_assignments.end())
1177 parent_assignments.insert(*i);
1178 else if(i->second.self_referencing || i->second.conditional)
1180 j->second.nodes.insert(j->second.nodes.end(), i->second.nodes.begin(), i->second.nodes.end());
1181 j->second.conditional |= i->second.conditional;
1182 j->second.self_referencing |= i->second.self_referencing;
1185 j->second = i->second;
1187 assignments.pop_back();
1190 void ProgramCompiler::UnusedVariableLocator::visit(Conditional &cond)
1192 cond.condition->visit(*this);
1193 assignments.push_back(BlockAssignmentMap());
1194 cond.body.visit(*this);
1196 BlockAssignmentMap if_assignments;
1197 swap(assignments.back(), if_assignments);
1198 cond.else_body.visit(*this);
1200 BlockAssignmentMap &else_assignments = assignments.back();
1201 for(BlockAssignmentMap::iterator i=else_assignments.begin(); i!=else_assignments.end(); ++i)
1203 BlockAssignmentMap::iterator j = if_assignments.find(i->first);
1204 if(j!=if_assignments.end())
1206 i->second.nodes.insert(i->second.nodes.end(), j->second.nodes.begin(), j->second.nodes.end());
1207 i->second.conditional |= j->second.conditional;
1208 i->second.self_referencing |= j->second.self_referencing;
1209 if_assignments.erase(j);
1212 i->second.conditional = true;
1215 for(BlockAssignmentMap::iterator i=if_assignments.begin(); i!=if_assignments.end(); ++i)
1217 i->second.conditional = true;
1218 else_assignments.insert(*i);
1221 merge_down_assignments();
1224 void ProgramCompiler::UnusedVariableLocator::visit(Iteration &iter)
1226 assignments.push_back(BlockAssignmentMap());
1227 TraversingVisitor::visit(iter);
1228 merge_down_assignments();
1232 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionCall &call)
1234 TraversingVisitor::visit(call);
1236 unused_nodes.erase(call.declaration);
1237 if(call.declaration && call.declaration->definition!=call.declaration)
1238 used_definitions.insert(call.declaration->definition);
1241 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionDeclaration &func)
1243 TraversingVisitor::visit(func);
1245 if(func.name!="main" && !used_definitions.count(&func))
1246 unused_nodes.insert(&func);
1250 ProgramCompiler::NodeRemover::NodeRemover(const set<Node *> &r):
1254 void ProgramCompiler::NodeRemover::visit(Block &block)
1256 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
1259 if(to_remove.count(&**i))
1260 block.body.erase(i++);
1266 void ProgramCompiler::NodeRemover::visit(VariableDeclaration &var)
1268 if(to_remove.count(&var))
1270 stage->in_variables.erase(var.name);
1271 stage->out_variables.erase(var.name);
1272 if(var.linked_declaration)
1273 var.linked_declaration->linked_declaration = 0;
1275 else if(var.init_expression && to_remove.count(&*var.init_expression))
1276 var.init_expression = 0;