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::BlockModifier::BlockModifier():
654 void ProgramCompiler::BlockModifier::flatten_block(Block &block)
656 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
657 insert_nodes.push_back((*i)->clone());
661 void ProgramCompiler::BlockModifier::apply_and_increment(Block &block, list<NodePtr<Node> >::iterator &i)
663 for(list<Node *>::iterator j=insert_nodes.begin(); j!=insert_nodes.end(); ++j)
664 block.body.insert(i, *j);
665 insert_nodes.clear();
668 block.body.erase(i++);
674 void ProgramCompiler::BlockModifier::visit(Block &block)
676 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
679 apply_and_increment(block, i);
684 ProgramCompiler::InterfaceGenerator::InterfaceGenerator():
688 string ProgramCompiler::InterfaceGenerator::get_out_prefix(StageType type)
692 else if(type==GEOMETRY)
698 void ProgramCompiler::InterfaceGenerator::apply(Stage &s)
700 SetForScope<Stage *> set(stage, &s);
702 in_prefix = get_out_prefix(stage->previous->type);
703 out_prefix = get_out_prefix(stage->type);
704 stage->content.visit(*this);
707 void ProgramCompiler::InterfaceGenerator::visit(Block &block)
709 SetForScope<unsigned> set(scope_level, scope_level+1);
710 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
716 for(map<string, VariableDeclaration *>::iterator j=iface_declarations.begin(); j!=iface_declarations.end(); ++j)
718 list<NodePtr<Node> >::iterator k = block.body.insert(i, j->second);
721 iface_declarations.clear();
724 apply_and_increment(block, i);
728 string ProgramCompiler::InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
730 unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
731 return prefix+name.substr(offset);
734 bool ProgramCompiler::InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
736 const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
737 if(stage_vars.count(name) || iface_declarations.count(name))
740 VariableDeclaration* iface_var = new VariableDeclaration;
741 iface_var->sampling = var.sampling;
742 iface_var->interface = iface;
743 iface_var->type = var.type;
744 iface_var->type_declaration = var.type_declaration;
745 iface_var->name = name;
746 if(stage->type==GEOMETRY)
747 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
749 iface_var->array = var.array;
751 iface_var->array_size = var.array_size;
753 iface_var->linked_declaration = &var;
754 iface_declarations[name] = iface_var;
759 void ProgramCompiler::InterfaceGenerator::insert_assignment(const string &left, ProgramSyntax::Expression *right)
761 Assignment *assign = new Assignment;
762 VariableReference *ref = new VariableReference;
766 assign->right = right;
768 ExpressionStatement *stmt = new ExpressionStatement;
769 stmt->expression = assign;
770 insert_nodes.push_back(stmt);
773 void ProgramCompiler::InterfaceGenerator::visit(VariableReference &var)
775 if(var.declaration || !stage->previous)
777 if(iface_declarations.count(var.name))
780 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
781 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
782 if(i==prev_out.end())
783 i = prev_out.find(in_prefix+var.name);
784 if(i!=prev_out.end())
785 generate_interface(*i->second, "in", var.name);
788 void ProgramCompiler::InterfaceGenerator::visit(VariableDeclaration &var)
790 if(var.interface=="out")
793 stage->out_variables[var.name] = &var;
794 else if(generate_interface(var, "out", change_prefix(var.name, string())))
797 if(var.init_expression)
798 insert_assignment(var.name, var.init_expression->clone());
801 else if(var.interface=="in")
803 stage->in_variables[var.name] = &var;
804 if(var.linked_declaration)
805 var.linked_declaration->linked_declaration = &var;
806 else if(stage->previous)
808 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
809 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
810 if(i!=prev_out.end())
812 var.linked_declaration = i->second;
813 i->second->linked_declaration = &var;
818 TraversingVisitor::visit(var);
821 void ProgramCompiler::InterfaceGenerator::visit(Passthrough &pass)
823 vector<VariableDeclaration *> pass_vars;
825 for(map<string, VariableDeclaration *>::const_iterator i=stage->in_variables.begin(); i!=stage->in_variables.end(); ++i)
826 pass_vars.push_back(i->second);
827 for(map<string, VariableDeclaration *>::const_iterator i=iface_declarations.begin(); i!=iface_declarations.end(); ++i)
828 if(i->second->interface=="in")
829 pass_vars.push_back(i->second);
833 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
834 for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
837 for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
838 linked = ((*j)->linked_declaration==i->second);
840 if(!linked && generate_interface(*i->second, "in", i->second->name))
841 pass_vars.push_back(i->second);
845 if(stage->type==GEOMETRY)
847 VariableReference *ref = new VariableReference;
850 BinaryExpression *subscript = new BinaryExpression;
851 subscript->left = ref;
852 subscript->oper = "[";
853 subscript->right = pass.subscript;
854 subscript->after = "]";
856 MemberAccess *memacc = new MemberAccess;
857 memacc->left = subscript;
858 memacc->member = "gl_Position";
860 insert_assignment("gl_Position", memacc);
863 for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
865 string out_name = change_prefix((*i)->name, out_prefix);
866 generate_interface(**i, "out", out_name);
868 VariableReference *ref = new VariableReference;
869 ref->name = (*i)->name;
872 BinaryExpression *subscript = new BinaryExpression;
873 subscript->left = ref;
874 subscript->oper = "[";
875 subscript->right = pass.subscript;
876 subscript->after = "]";
877 insert_assignment(out_name, subscript);
880 insert_assignment(out_name, ref);
887 void ProgramCompiler::VariableRenamer::visit(VariableReference &var)
890 var.name = var.declaration->name;
893 void ProgramCompiler::VariableRenamer::visit(VariableDeclaration &var)
895 if(var.linked_declaration)
896 var.name = var.linked_declaration->name;
897 TraversingVisitor::visit(var);
901 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator():
907 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator(const ValueMap &v):
913 void ProgramCompiler::ExpressionEvaluator::visit(Literal &literal)
915 if(literal.token=="true")
917 else if(literal.token=="false")
920 result = lexical_cast<float>(literal.token);
924 void ProgramCompiler::ExpressionEvaluator::visit(VariableReference &var)
931 ValueMap::const_iterator i = variable_values->find(var.declaration);
932 if(i!=variable_values->end())
933 i->second->visit(*this);
935 else if(var.declaration->init_expression)
936 var.declaration->init_expression->visit(*this);
939 void ProgramCompiler::ExpressionEvaluator::visit(UnaryExpression &unary)
941 result_valid = false;
942 unary.expression->visit(*this);
949 result_valid = false;
952 void ProgramCompiler::ExpressionEvaluator::visit(BinaryExpression &binary)
954 result_valid = false;
955 binary.left->visit(*this);
959 float left_result = result;
960 result_valid = false;
961 binary.right->visit(*this);
966 result = (left_result<result);
967 else if(binary.oper=="<=")
968 result = (left_result<=result);
969 else if(binary.oper==">")
970 result = (left_result>result);
971 else if(binary.oper==">=")
972 result = (left_result>=result);
973 else if(binary.oper=="==")
974 result = (left_result==result);
975 else if(binary.oper=="!=")
976 result = (left_result!=result);
977 else if(binary.oper=="&&")
978 result = (left_result && result);
979 else if(binary.oper=="||")
980 result = (left_result || result);
982 result_valid = false;
986 ProgramCompiler::ConstantConditionEliminator::ConstantConditionEliminator():
990 void ProgramCompiler::ConstantConditionEliminator::visit(Block &block)
992 SetForScope<unsigned> set(scope_level, scope_level+1);
993 BlockModifier::visit(block);
995 for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
996 variable_values.erase(i->second);
999 void ProgramCompiler::ConstantConditionEliminator::visit(Assignment &assign)
1001 variable_values.erase(assign.target_declaration);
1004 void ProgramCompiler::ConstantConditionEliminator::visit(VariableDeclaration &var)
1006 if(var.constant || scope_level>1)
1007 variable_values[&var] = &*var.init_expression;
1010 void ProgramCompiler::ConstantConditionEliminator::visit(Conditional &cond)
1012 ExpressionEvaluator eval(variable_values);
1013 cond.condition->visit(eval);
1014 if(eval.result_valid)
1015 flatten_block(eval.result ? cond.body : cond.else_body);
1017 TraversingVisitor::visit(cond);
1020 void ProgramCompiler::ConstantConditionEliminator::visit(Iteration &iter)
1024 ExpressionEvaluator eval;
1025 iter.condition->visit(eval);
1026 if(eval.result_valid && !eval.result)
1033 TraversingVisitor::visit(iter);
1037 ProgramCompiler::UnusedVariableLocator::UnusedVariableLocator():
1040 assignment_target(false)
1043 void ProgramCompiler::UnusedVariableLocator::apply(Stage &s)
1045 assignments.push_back(BlockAssignmentMap());
1047 assignments.pop_back();
1050 void ProgramCompiler::UnusedVariableLocator::visit(VariableReference &var)
1052 unused_nodes.erase(var.declaration);
1054 map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
1055 if(i!=aggregates.end())
1056 unused_nodes.erase(i->second);
1058 if(assignment_target)
1061 for(vector<BlockAssignmentMap>::iterator j=assignments.end(); j!=assignments.begin(); )
1064 BlockAssignmentMap::iterator k = j->find(var.declaration);
1067 for(vector<Node *>::iterator l=k->second.nodes.begin(); l!=k->second.nodes.end(); ++l)
1068 unused_nodes.erase(*l);
1075 void ProgramCompiler::UnusedVariableLocator::visit(MemberAccess &memacc)
1077 TraversingVisitor::visit(memacc);
1078 unused_nodes.erase(memacc.declaration);
1081 void ProgramCompiler::UnusedVariableLocator::visit(BinaryExpression &binary)
1083 if(binary.oper=="[")
1085 binary.left->visit(*this);
1086 SetForScope<bool> set(assignment_target, false);
1087 binary.right->visit(*this);
1090 TraversingVisitor::visit(binary);
1093 void ProgramCompiler::UnusedVariableLocator::visit(Assignment &assign)
1096 SetForScope<bool> set(assignment_target, !assign.self_referencing);
1097 assign.left->visit(*this);
1099 assign.right->visit(*this);
1100 assignment = &assign;
1103 void ProgramCompiler::UnusedVariableLocator::record_assignment(VariableDeclaration &var, Node &node, bool self_ref)
1105 unused_nodes.insert(&node);
1106 BlockAssignmentMap &block_assignments = assignments.back();
1107 AssignmentList &var_assignments = block_assignments[&var];
1109 var_assignments.nodes.clear();
1110 var_assignments.nodes.push_back(&node);
1111 var_assignments.conditional = false;
1112 var_assignments.self_referencing = self_ref;
1115 void ProgramCompiler::UnusedVariableLocator::visit(ExpressionStatement &expr)
1118 TraversingVisitor::visit(expr);
1119 if(assignment && assignment->target_declaration)
1120 record_assignment(*assignment->target_declaration, expr, assignment->self_referencing);
1123 void ProgramCompiler::UnusedVariableLocator::visit(StructDeclaration &strct)
1125 SetForScope<Node *> set(aggregate, &strct);
1126 unused_nodes.insert(&strct);
1127 TraversingVisitor::visit(strct);
1130 void ProgramCompiler::UnusedVariableLocator::visit(VariableDeclaration &var)
1133 aggregates[&var] = aggregate;
1136 unused_nodes.insert(&var);
1137 if(var.init_expression)
1138 record_assignment(var, *var.init_expression, false);
1140 unused_nodes.erase(var.type_declaration);
1141 TraversingVisitor::visit(var);
1144 void ProgramCompiler::UnusedVariableLocator::visit(InterfaceBlock &iface)
1146 SetForScope<Node *> set(aggregate, &iface);
1147 unused_nodes.insert(&iface);
1148 TraversingVisitor::visit(iface);
1151 void ProgramCompiler::UnusedVariableLocator::visit(FunctionDeclaration &func)
1153 assignments.push_back(BlockAssignmentMap());
1155 for(vector<NodePtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1157 func.body.visit(*this);
1159 BlockAssignmentMap &block_assignments = assignments.back();
1160 for(map<string, VariableDeclaration *>::iterator i=func.body.variables.begin(); i!=func.body.variables.end(); ++i)
1161 block_assignments.erase(i->second);
1162 for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
1164 if(i->first->interface=="out" && stage->type!=FRAGMENT && !i->first->linked_declaration)
1167 for(vector<Node *>::iterator j=i->second.nodes.begin(); j!=i->second.nodes.end(); ++j)
1168 unused_nodes.erase(*j);
1171 assignments.pop_back();
1174 void ProgramCompiler::UnusedVariableLocator::merge_down_assignments()
1176 BlockAssignmentMap &parent_assignments = assignments[assignments.size()-2];
1177 BlockAssignmentMap &block_assignments = assignments.back();
1178 for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
1180 BlockAssignmentMap::iterator j = parent_assignments.find(i->first);
1181 if(j==parent_assignments.end())
1182 parent_assignments.insert(*i);
1183 else if(i->second.self_referencing || i->second.conditional)
1185 j->second.nodes.insert(j->second.nodes.end(), i->second.nodes.begin(), i->second.nodes.end());
1186 j->second.conditional |= i->second.conditional;
1187 j->second.self_referencing |= i->second.self_referencing;
1190 j->second = i->second;
1192 assignments.pop_back();
1195 void ProgramCompiler::UnusedVariableLocator::visit(Conditional &cond)
1197 cond.condition->visit(*this);
1198 assignments.push_back(BlockAssignmentMap());
1199 cond.body.visit(*this);
1201 BlockAssignmentMap if_assignments;
1202 swap(assignments.back(), if_assignments);
1203 cond.else_body.visit(*this);
1205 BlockAssignmentMap &else_assignments = assignments.back();
1206 for(BlockAssignmentMap::iterator i=else_assignments.begin(); i!=else_assignments.end(); ++i)
1208 BlockAssignmentMap::iterator j = if_assignments.find(i->first);
1209 if(j!=if_assignments.end())
1211 i->second.nodes.insert(i->second.nodes.end(), j->second.nodes.begin(), j->second.nodes.end());
1212 i->second.conditional |= j->second.conditional;
1213 i->second.self_referencing |= j->second.self_referencing;
1214 if_assignments.erase(j);
1217 i->second.conditional = true;
1220 for(BlockAssignmentMap::iterator i=if_assignments.begin(); i!=if_assignments.end(); ++i)
1222 i->second.conditional = true;
1223 else_assignments.insert(*i);
1226 merge_down_assignments();
1229 void ProgramCompiler::UnusedVariableLocator::visit(Iteration &iter)
1231 assignments.push_back(BlockAssignmentMap());
1232 TraversingVisitor::visit(iter);
1233 merge_down_assignments();
1237 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionCall &call)
1239 TraversingVisitor::visit(call);
1241 unused_nodes.erase(call.declaration);
1242 if(call.declaration && call.declaration->definition!=call.declaration)
1243 used_definitions.insert(call.declaration->definition);
1246 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionDeclaration &func)
1248 TraversingVisitor::visit(func);
1250 if(func.name!="main" && !used_definitions.count(&func))
1251 unused_nodes.insert(&func);
1255 ProgramCompiler::NodeRemover::NodeRemover(const set<Node *> &r):
1259 void ProgramCompiler::NodeRemover::visit(Block &block)
1261 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
1264 if(to_remove.count(&**i))
1265 block.body.erase(i++);
1271 void ProgramCompiler::NodeRemover::visit(VariableDeclaration &var)
1273 if(to_remove.count(&var))
1275 stage->in_variables.erase(var.name);
1276 stage->out_variables.erase(var.name);
1277 if(var.linked_declaration)
1278 var.linked_declaration->linked_declaration = 0;
1280 else if(var.init_expression && to_remove.count(&*var.init_expression))
1281 var.init_expression = 0;