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 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
64 program.attach_shader_owned(new VertexShader(apply<Formatter>(*i)));
65 else if(i->type==GEOMETRY)
66 program.attach_shader_owned(new GeometryShader(apply<Formatter>(*i)));
67 else if(i->type==FRAGMENT)
68 program.attach_shader_owned(new FragmentShader(apply<Formatter>(*i)));
71 program.bind_attribute(VERTEX4, "vertex");
72 program.bind_attribute(NORMAL3, "normal");
73 program.bind_attribute(COLOR4_FLOAT, "color");
74 program.bind_attribute(TEXCOORD4, "texcoord");
77 Module *ProgramCompiler::create_builtins_module()
80 Module *module = new Module(parser.parse(builtins_src));
81 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
83 VariableResolver resolver;
84 i->content.visit(resolver);
85 for(map<string, VariableDeclaration *>::iterator j=i->content.variables.begin(); j!=i->content.variables.end(); ++j)
86 j->second->linked_declaration = j->second;
91 Module &ProgramCompiler::get_builtins_module()
93 static RefPtr<Module> builtins_module = create_builtins_module();
94 return *builtins_module;
97 Stage *ProgramCompiler::get_builtins(StageType type)
99 Module &module = get_builtins_module();
100 for(list<Stage>::iterator i=module.stages.begin(); i!=module.stages.end(); ++i)
106 void ProgramCompiler::process()
108 list<Import *> imports = apply<NodeGatherer<Import> >(module->shared);
109 for(list<Import *>::iterator i=imports.end(); i!=imports.begin(); )
110 import((*--i)->module);
111 apply<NodeRemover>(module->shared, set<Node *>(imports.begin(), imports.end()));
113 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
115 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); )
118 i = module->stages.begin();
124 void ProgramCompiler::import(const string &name)
127 throw runtime_error("no resources");
128 RefPtr<IO::Seekable> io = resources->open_raw(name+".glsl");
130 throw runtime_error(format("module %s not found", name));
131 ProgramParser import_parser;
132 Module &imported_module = import_parser.parse(*io);
134 inject_block(module->shared.content, imported_module.shared.content);
135 apply<DeclarationCombiner>(module->shared);
136 for(list<Stage>::iterator i=imported_module.stages.begin(); i!=imported_module.stages.end(); ++i)
138 list<Stage>::iterator j;
139 for(j=module->stages.begin(); (j!=module->stages.end() && j->type<i->type); ++j) ;
140 if(j==module->stages.end() || j->type>i->type)
142 j = module->stages.insert(j, *i);
143 list<Stage>::iterator k = j;
144 if(++k!=module->stages.end())
146 if(j!=module->stages.begin())
147 j->previous = &*--(k=j);
151 inject_block(j->content, i->content);
152 apply<DeclarationCombiner>(*j);
157 void ProgramCompiler::generate(Stage &stage)
159 inject_block(stage.content, module->shared.content);
161 apply<FunctionResolver>(stage);
162 apply<VariableResolver>(stage);
163 apply<InterfaceGenerator>(stage);
164 apply<VariableResolver>(stage);
165 apply<VariableRenamer>(stage);
166 apply<LegacyConverter>(stage);
167 apply<VariableResolver>(stage);
170 bool ProgramCompiler::optimize(Stage &stage)
172 apply<ConstantConditionEliminator>(stage);
173 apply<VariableResolver>(stage);
175 set<Node *> unused = apply<UnusedVariableLocator>(stage);
176 set<Node *> unused2 = apply<UnusedFunctionLocator>(stage);
177 unused.insert(unused2.begin(), unused2.end());
178 apply<NodeRemover>(stage, unused);
180 return !unused.empty();
183 void ProgramCompiler::inject_block(Block &target, const Block &source)
185 list<NodePtr<Node> >::iterator insert_point = target.body.begin();
186 for(list<NodePtr<Node> >::const_iterator i=source.body.begin(); i!=source.body.end(); ++i)
187 target.body.insert(insert_point, (*i)->clone());
191 typename T::ResultType ProgramCompiler::apply(Stage &stage)
194 visitor.apply(stage);
195 return visitor.get_result();
198 template<typename T, typename A>
199 typename T::ResultType ProgramCompiler::apply(Stage &stage, const A &arg)
202 visitor.apply(stage);
203 return visitor.get_result();
207 ProgramCompiler::Visitor::Visitor():
211 void ProgramCompiler::Visitor::apply(Stage &s)
213 SetForScope<Stage *> set(stage, &s);
214 stage->content.visit(*this);
218 ProgramCompiler::Formatter::Formatter():
220 parameter_list(false),
224 void ProgramCompiler::Formatter::apply(ProgramSyntax::Stage &s)
226 const Version &ver = s.required_version;
228 formatted += format("#version %d%d\n", ver.major, ver.minor);
232 void ProgramCompiler::Formatter::visit(Literal &literal)
234 formatted += literal.token;
237 void ProgramCompiler::Formatter::visit(ParenthesizedExpression &parexpr)
240 parexpr.expression->visit(*this);
244 void ProgramCompiler::Formatter::visit(VariableReference &var)
246 formatted += var.name;
249 void ProgramCompiler::Formatter::visit(MemberAccess &memacc)
251 memacc.left->visit(*this);
252 formatted += format(".%s", memacc.member);
255 void ProgramCompiler::Formatter::visit(UnaryExpression &unary)
258 formatted += unary.oper;
259 unary.expression->visit(*this);
261 formatted += unary.oper;
264 void ProgramCompiler::Formatter::visit(BinaryExpression &binary)
266 binary.left->visit(*this);
267 formatted += binary.oper;
268 binary.right->visit(*this);
269 formatted += binary.after;
272 void ProgramCompiler::Formatter::visit(Assignment &assign)
274 assign.left->visit(*this);
275 formatted += format(" %s ", assign.oper);
276 assign.right->visit(*this);
279 void ProgramCompiler::Formatter::visit(FunctionCall &call)
281 formatted += format("%s(", call.name);
282 for(vector<NodePtr<Expression> >::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
284 if(i!=call.arguments.begin())
291 void ProgramCompiler::Formatter::visit(ExpressionStatement &expr)
293 expr.expression->visit(*this);
297 void ProgramCompiler::Formatter::visit(Block &block)
302 unsigned brace_indent = indent;
303 bool use_braces = (block.use_braces || (indent && block.body.size()!=1));
305 formatted += format("%s{\n", string(brace_indent*2, ' '));
307 SetForScope<unsigned> set(indent, indent+(indent>0 || use_braces));
308 string spaces(indent*2, ' ');
309 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
311 if(i!=block.body.begin())
319 formatted += format("\n%s}", string(brace_indent*2, ' '));
322 void ProgramCompiler::Formatter::visit(Import &import)
324 formatted += format("import %s;", import.module);
327 void ProgramCompiler::Formatter::visit(Layout &layout)
329 formatted += "layout(";
330 for(vector<Layout::Qualifier>::const_iterator i=layout.qualifiers.begin(); i!=layout.qualifiers.end(); ++i)
332 if(i!=layout.qualifiers.begin())
334 formatted += i->identifier;
335 if(!i->value.empty())
336 formatted += format("=%s", i->value);
338 formatted += format(") %s;", layout.interface);
341 void ProgramCompiler::Formatter::visit(StructDeclaration &strct)
343 formatted += format("struct %s\n", strct.name);
344 strct.members.visit(*this);
348 void ProgramCompiler::Formatter::visit(VariableDeclaration &var)
351 formatted += "const ";
352 if(!var.sampling.empty())
353 formatted += format("%s ", var.sampling);
354 if(!var.interface.empty() && var.interface!=block_interface)
355 formatted += format("%s ", var.interface);
356 formatted += format("%s %s", var.type, var.name);
361 var.array_size->visit(*this);
364 if(var.init_expression)
367 var.init_expression->visit(*this);
373 void ProgramCompiler::Formatter::visit(InterfaceBlock &iface)
375 SetForScope<string> set(block_interface, iface.interface);
376 formatted += format("%s %s\n", iface.interface, iface.name);
377 iface.members.visit(*this);
381 void ProgramCompiler::Formatter::visit(FunctionDeclaration &func)
383 formatted += format("%s %s(", func.return_type, func.name);
384 for(vector<NodePtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
386 if(i!=func.parameters.begin())
388 SetFlag set(parameter_list);
392 if(func.definition==&func)
395 func.body.visit(*this);
401 void ProgramCompiler::Formatter::visit(Conditional &cond)
404 formatted.replace(formatted.rfind('\n'), string::npos, 1, ' ');
409 cond.condition->visit(*this);
412 cond.body.visit(*this);
413 if(!cond.else_body.body.empty())
415 formatted += format("\n%selse\n", string(indent*2, ' '));
416 SetForScope<unsigned> set(else_if, 2);
417 cond.else_body.visit(*this);
421 void ProgramCompiler::Formatter::visit(Iteration &iter)
424 iter.init_statement->visit(*this);
426 iter.condition->visit(*this);
428 iter.loop_expression->visit(*this);
430 iter.body.visit(*this);
433 void ProgramCompiler::Formatter::visit(Return &ret)
435 formatted += "return ";
436 ret.expression->visit(*this);
441 ProgramCompiler::DeclarationCombiner::DeclarationCombiner():
446 void ProgramCompiler::DeclarationCombiner::visit(Block &block)
451 SetForScope<bool> set(toplevel, false);
452 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
457 block.body.erase(i++);
463 void ProgramCompiler::DeclarationCombiner::visit(FunctionDeclaration &func)
465 vector<FunctionDeclaration *> &decls = functions[func.name];
468 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
470 (*i)->definition = func.definition;
471 (*i)->body.body.clear();
474 decls.push_back(&func);
477 void ProgramCompiler::DeclarationCombiner::visit(VariableDeclaration &var)
479 VariableDeclaration *&ptr = variables[var.name];
482 if(var.init_expression)
483 ptr->init_expression = var.init_expression;
491 ProgramCompiler::VariableResolver::VariableResolver():
493 record_target(false),
494 assignment_target(0),
495 self_referencing(false)
498 void ProgramCompiler::VariableResolver::apply(Stage &s)
500 SetForScope<Stage *> set(stage, &s);
501 Stage *builtins = get_builtins(stage->type);
503 blocks.push_back(&builtins->content);
504 stage->content.visit(*this);
509 void ProgramCompiler::VariableResolver::visit(Block &block)
511 blocks.push_back(&block);
512 block.variables.clear();
513 TraversingVisitor::visit(block);
517 void ProgramCompiler::VariableResolver::visit(VariableReference &var)
521 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
524 map<string, VariableDeclaration *>::iterator j = (*i)->variables.find(var.name);
525 if(j!=(*i)->variables.end())
527 var.declaration = j->second;
528 type = j->second->type_declaration;
535 if(assignment_target)
537 record_target = false;
538 assignment_target = 0;
541 assignment_target = var.declaration;
543 else if(var.declaration && var.declaration==assignment_target)
544 self_referencing = true;
547 void ProgramCompiler::VariableResolver::visit(MemberAccess &memacc)
550 TraversingVisitor::visit(memacc);
551 memacc.declaration = 0;
554 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
555 if(i!=type->members.variables.end())
557 memacc.declaration = i->second;
558 type = i->second->type_declaration;
565 void ProgramCompiler::VariableResolver::visit(BinaryExpression &binary)
570 SetForScope<bool> set(record_target, false);
571 binary.right->visit(*this);
574 binary.left->visit(*this);
578 TraversingVisitor::visit(binary);
583 void ProgramCompiler::VariableResolver::visit(Assignment &assign)
586 SetFlag set(record_target);
587 assignment_target = 0;
588 assign.left->visit(*this);
591 self_referencing = false;
592 assign.right->visit(*this);
594 assign.self_referencing = (self_referencing || assign.oper!="=");
595 assign.target_declaration = assignment_target;
598 void ProgramCompiler::VariableResolver::visit(StructDeclaration &strct)
600 TraversingVisitor::visit(strct);
601 blocks.back()->types[strct.name] = &strct;
604 void ProgramCompiler::VariableResolver::visit(VariableDeclaration &var)
606 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
609 map<string, StructDeclaration *>::iterator j = (*i)->types.find(var.type);
610 if(j!=(*i)->types.end())
611 var.type_declaration = j->second;
614 if(!block_interface.empty() && var.interface.empty())
615 var.interface = block_interface;
617 TraversingVisitor::visit(var);
618 blocks.back()->variables[var.name] = &var;
619 if(anonymous && blocks.size()>1)
620 blocks[blocks.size()-2]->variables[var.name] = &var;
623 void ProgramCompiler::VariableResolver::visit(InterfaceBlock &iface)
625 SetFlag set(anonymous);
626 SetForScope<string> set2(block_interface, iface.interface);
627 TraversingVisitor::visit(iface);
631 void ProgramCompiler::FunctionResolver::visit(FunctionCall &call)
633 map<string, vector<FunctionDeclaration *> >::iterator i = functions.find(call.name);
634 if(i!=functions.end())
635 call.declaration = i->second.back();
637 TraversingVisitor::visit(call);
640 void ProgramCompiler::FunctionResolver::visit(FunctionDeclaration &func)
642 vector<FunctionDeclaration *> &decls = functions[func.name];
645 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
646 (*i)->definition = func.definition;
648 decls.push_back(&func);
650 else if(!decls.empty() && decls.back()->definition)
651 func.definition = decls.back()->definition;
653 decls.push_back(&func);
655 TraversingVisitor::visit(func);
659 ProgramCompiler::BlockModifier::BlockModifier():
663 void ProgramCompiler::BlockModifier::flatten_block(Block &block)
665 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
666 insert_nodes.push_back((*i)->clone());
670 void ProgramCompiler::BlockModifier::apply_and_increment(Block &block, list<NodePtr<Node> >::iterator &i)
672 for(list<Node *>::iterator j=insert_nodes.begin(); j!=insert_nodes.end(); ++j)
673 block.body.insert(i, *j);
674 insert_nodes.clear();
677 block.body.erase(i++);
683 void ProgramCompiler::BlockModifier::visit(Block &block)
685 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
688 apply_and_increment(block, i);
693 ProgramCompiler::InterfaceGenerator::InterfaceGenerator():
697 string ProgramCompiler::InterfaceGenerator::get_out_prefix(StageType type)
701 else if(type==GEOMETRY)
707 void ProgramCompiler::InterfaceGenerator::apply(Stage &s)
709 SetForScope<Stage *> set(stage, &s);
711 in_prefix = get_out_prefix(stage->previous->type);
712 out_prefix = get_out_prefix(stage->type);
713 stage->content.visit(*this);
716 void ProgramCompiler::InterfaceGenerator::visit(Block &block)
718 SetForScope<unsigned> set(scope_level, scope_level+1);
719 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
725 for(map<string, VariableDeclaration *>::iterator j=iface_declarations.begin(); j!=iface_declarations.end(); ++j)
727 list<NodePtr<Node> >::iterator k = block.body.insert(i, j->second);
730 iface_declarations.clear();
733 apply_and_increment(block, i);
737 string ProgramCompiler::InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
739 unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
740 return prefix+name.substr(offset);
743 bool ProgramCompiler::InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
745 const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
746 if(stage_vars.count(name) || iface_declarations.count(name))
749 VariableDeclaration* iface_var = new VariableDeclaration;
750 iface_var->sampling = var.sampling;
751 iface_var->interface = iface;
752 iface_var->type = var.type;
753 iface_var->type_declaration = var.type_declaration;
754 iface_var->name = name;
755 if(stage->type==GEOMETRY)
756 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
758 iface_var->array = var.array;
760 iface_var->array_size = var.array_size;
762 iface_var->linked_declaration = &var;
763 iface_declarations[name] = iface_var;
768 void ProgramCompiler::InterfaceGenerator::insert_assignment(const string &left, ProgramSyntax::Expression *right)
770 Assignment *assign = new Assignment;
771 VariableReference *ref = new VariableReference;
775 assign->right = right;
777 ExpressionStatement *stmt = new ExpressionStatement;
778 stmt->expression = assign;
779 insert_nodes.push_back(stmt);
782 void ProgramCompiler::InterfaceGenerator::visit(VariableReference &var)
784 if(var.declaration || !stage->previous)
786 if(iface_declarations.count(var.name))
789 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
790 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
791 if(i==prev_out.end())
792 i = prev_out.find(in_prefix+var.name);
793 if(i!=prev_out.end())
794 generate_interface(*i->second, "in", var.name);
797 void ProgramCompiler::InterfaceGenerator::visit(VariableDeclaration &var)
799 if(var.interface=="out")
802 stage->out_variables[var.name] = &var;
803 else if(generate_interface(var, "out", change_prefix(var.name, string())))
806 if(var.init_expression)
807 insert_assignment(var.name, var.init_expression->clone());
810 else if(var.interface=="in")
812 stage->in_variables[var.name] = &var;
813 if(var.linked_declaration)
814 var.linked_declaration->linked_declaration = &var;
815 else if(stage->previous)
817 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
818 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
819 if(i!=prev_out.end())
821 var.linked_declaration = i->second;
822 i->second->linked_declaration = &var;
827 TraversingVisitor::visit(var);
830 void ProgramCompiler::InterfaceGenerator::visit(Passthrough &pass)
832 vector<VariableDeclaration *> pass_vars;
834 for(map<string, VariableDeclaration *>::const_iterator i=stage->in_variables.begin(); i!=stage->in_variables.end(); ++i)
835 pass_vars.push_back(i->second);
836 for(map<string, VariableDeclaration *>::const_iterator i=iface_declarations.begin(); i!=iface_declarations.end(); ++i)
837 if(i->second->interface=="in")
838 pass_vars.push_back(i->second);
842 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
843 for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
846 for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
847 linked = ((*j)->linked_declaration==i->second);
849 if(!linked && generate_interface(*i->second, "in", i->second->name))
850 pass_vars.push_back(i->second);
854 if(stage->type==GEOMETRY)
856 VariableReference *ref = new VariableReference;
859 BinaryExpression *subscript = new BinaryExpression;
860 subscript->left = ref;
861 subscript->oper = "[";
862 subscript->right = pass.subscript;
863 subscript->after = "]";
865 MemberAccess *memacc = new MemberAccess;
866 memacc->left = subscript;
867 memacc->member = "gl_Position";
869 insert_assignment("gl_Position", memacc);
872 for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
874 string out_name = change_prefix((*i)->name, out_prefix);
875 generate_interface(**i, "out", out_name);
877 VariableReference *ref = new VariableReference;
878 ref->name = (*i)->name;
881 BinaryExpression *subscript = new BinaryExpression;
882 subscript->left = ref;
883 subscript->oper = "[";
884 subscript->right = pass.subscript;
885 subscript->after = "]";
886 insert_assignment(out_name, subscript);
889 insert_assignment(out_name, ref);
896 void ProgramCompiler::VariableRenamer::visit(VariableReference &var)
899 var.name = var.declaration->name;
902 void ProgramCompiler::VariableRenamer::visit(VariableDeclaration &var)
904 if(var.linked_declaration)
905 var.name = var.linked_declaration->name;
906 TraversingVisitor::visit(var);
910 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator():
916 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator(const ValueMap &v):
922 void ProgramCompiler::ExpressionEvaluator::visit(Literal &literal)
924 if(literal.token=="true")
926 else if(literal.token=="false")
929 result = lexical_cast<float>(literal.token);
933 void ProgramCompiler::ExpressionEvaluator::visit(VariableReference &var)
940 ValueMap::const_iterator i = variable_values->find(var.declaration);
941 if(i!=variable_values->end())
942 i->second->visit(*this);
944 else if(var.declaration->init_expression)
945 var.declaration->init_expression->visit(*this);
948 void ProgramCompiler::ExpressionEvaluator::visit(UnaryExpression &unary)
950 result_valid = false;
951 unary.expression->visit(*this);
958 result_valid = false;
961 void ProgramCompiler::ExpressionEvaluator::visit(BinaryExpression &binary)
963 result_valid = false;
964 binary.left->visit(*this);
968 float left_result = result;
969 result_valid = false;
970 binary.right->visit(*this);
975 result = (left_result<result);
976 else if(binary.oper=="<=")
977 result = (left_result<=result);
978 else if(binary.oper==">")
979 result = (left_result>result);
980 else if(binary.oper==">=")
981 result = (left_result>=result);
982 else if(binary.oper=="==")
983 result = (left_result==result);
984 else if(binary.oper=="!=")
985 result = (left_result!=result);
986 else if(binary.oper=="&&")
987 result = (left_result && result);
988 else if(binary.oper=="||")
989 result = (left_result || result);
991 result_valid = false;
995 ProgramCompiler::ConstantConditionEliminator::ConstantConditionEliminator():
999 void ProgramCompiler::ConstantConditionEliminator::visit(Block &block)
1001 SetForScope<unsigned> set(scope_level, scope_level+1);
1002 BlockModifier::visit(block);
1004 for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
1005 variable_values.erase(i->second);
1008 void ProgramCompiler::ConstantConditionEliminator::visit(Assignment &assign)
1010 variable_values.erase(assign.target_declaration);
1013 void ProgramCompiler::ConstantConditionEliminator::visit(VariableDeclaration &var)
1015 if(var.constant || scope_level>1)
1016 variable_values[&var] = &*var.init_expression;
1019 void ProgramCompiler::ConstantConditionEliminator::visit(Conditional &cond)
1021 ExpressionEvaluator eval(variable_values);
1022 cond.condition->visit(eval);
1023 if(eval.result_valid)
1024 flatten_block(eval.result ? cond.body : cond.else_body);
1026 TraversingVisitor::visit(cond);
1029 void ProgramCompiler::ConstantConditionEliminator::visit(Iteration &iter)
1033 ExpressionEvaluator eval;
1034 iter.condition->visit(eval);
1035 if(eval.result_valid && !eval.result)
1042 TraversingVisitor::visit(iter);
1046 ProgramCompiler::UnusedVariableLocator::UnusedVariableLocator():
1049 assignment_target(false)
1052 void ProgramCompiler::UnusedVariableLocator::apply(Stage &s)
1054 assignments.push_back(BlockAssignmentMap());
1056 assignments.pop_back();
1059 void ProgramCompiler::UnusedVariableLocator::visit(VariableReference &var)
1061 unused_nodes.erase(var.declaration);
1063 map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
1064 if(i!=aggregates.end())
1065 unused_nodes.erase(i->second);
1067 if(assignment_target)
1070 for(vector<BlockAssignmentMap>::iterator j=assignments.end(); j!=assignments.begin(); )
1073 BlockAssignmentMap::iterator k = j->find(var.declaration);
1076 for(vector<Node *>::iterator l=k->second.nodes.begin(); l!=k->second.nodes.end(); ++l)
1077 unused_nodes.erase(*l);
1084 void ProgramCompiler::UnusedVariableLocator::visit(MemberAccess &memacc)
1086 TraversingVisitor::visit(memacc);
1087 unused_nodes.erase(memacc.declaration);
1090 void ProgramCompiler::UnusedVariableLocator::visit(BinaryExpression &binary)
1092 if(binary.oper=="[")
1094 binary.left->visit(*this);
1095 SetForScope<bool> set(assignment_target, false);
1096 binary.right->visit(*this);
1099 TraversingVisitor::visit(binary);
1102 void ProgramCompiler::UnusedVariableLocator::visit(Assignment &assign)
1105 SetForScope<bool> set(assignment_target, !assign.self_referencing);
1106 assign.left->visit(*this);
1108 assign.right->visit(*this);
1109 assignment = &assign;
1112 void ProgramCompiler::UnusedVariableLocator::record_assignment(VariableDeclaration &var, Node &node, bool self_ref)
1114 unused_nodes.insert(&node);
1115 BlockAssignmentMap &block_assignments = assignments.back();
1116 AssignmentList &var_assignments = block_assignments[&var];
1118 var_assignments.nodes.clear();
1119 var_assignments.nodes.push_back(&node);
1120 var_assignments.conditional = false;
1121 var_assignments.self_referencing = self_ref;
1124 void ProgramCompiler::UnusedVariableLocator::visit(ExpressionStatement &expr)
1127 TraversingVisitor::visit(expr);
1128 if(assignment && assignment->target_declaration)
1129 record_assignment(*assignment->target_declaration, expr, assignment->self_referencing);
1132 void ProgramCompiler::UnusedVariableLocator::visit(StructDeclaration &strct)
1134 SetForScope<Node *> set(aggregate, &strct);
1135 unused_nodes.insert(&strct);
1136 TraversingVisitor::visit(strct);
1139 void ProgramCompiler::UnusedVariableLocator::visit(VariableDeclaration &var)
1142 aggregates[&var] = aggregate;
1145 unused_nodes.insert(&var);
1146 if(var.init_expression)
1147 record_assignment(var, *var.init_expression, false);
1149 unused_nodes.erase(var.type_declaration);
1150 TraversingVisitor::visit(var);
1153 void ProgramCompiler::UnusedVariableLocator::visit(InterfaceBlock &iface)
1155 SetForScope<Node *> set(aggregate, &iface);
1156 unused_nodes.insert(&iface);
1157 TraversingVisitor::visit(iface);
1160 void ProgramCompiler::UnusedVariableLocator::visit(FunctionDeclaration &func)
1162 assignments.push_back(BlockAssignmentMap());
1164 for(vector<NodePtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1166 func.body.visit(*this);
1168 BlockAssignmentMap &block_assignments = assignments.back();
1169 for(map<string, VariableDeclaration *>::iterator i=func.body.variables.begin(); i!=func.body.variables.end(); ++i)
1170 block_assignments.erase(i->second);
1171 for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
1173 if(i->first->interface=="out" && stage->type!=FRAGMENT && !i->first->linked_declaration)
1176 for(vector<Node *>::iterator j=i->second.nodes.begin(); j!=i->second.nodes.end(); ++j)
1177 unused_nodes.erase(*j);
1180 assignments.pop_back();
1183 void ProgramCompiler::UnusedVariableLocator::merge_down_assignments()
1185 BlockAssignmentMap &parent_assignments = assignments[assignments.size()-2];
1186 BlockAssignmentMap &block_assignments = assignments.back();
1187 for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
1189 BlockAssignmentMap::iterator j = parent_assignments.find(i->first);
1190 if(j==parent_assignments.end())
1191 parent_assignments.insert(*i);
1192 else if(i->second.self_referencing || i->second.conditional)
1194 j->second.nodes.insert(j->second.nodes.end(), i->second.nodes.begin(), i->second.nodes.end());
1195 j->second.conditional |= i->second.conditional;
1196 j->second.self_referencing |= i->second.self_referencing;
1199 j->second = i->second;
1201 assignments.pop_back();
1204 void ProgramCompiler::UnusedVariableLocator::visit(Conditional &cond)
1206 cond.condition->visit(*this);
1207 assignments.push_back(BlockAssignmentMap());
1208 cond.body.visit(*this);
1210 BlockAssignmentMap if_assignments;
1211 swap(assignments.back(), if_assignments);
1212 cond.else_body.visit(*this);
1214 BlockAssignmentMap &else_assignments = assignments.back();
1215 for(BlockAssignmentMap::iterator i=else_assignments.begin(); i!=else_assignments.end(); ++i)
1217 BlockAssignmentMap::iterator j = if_assignments.find(i->first);
1218 if(j!=if_assignments.end())
1220 i->second.nodes.insert(i->second.nodes.end(), j->second.nodes.begin(), j->second.nodes.end());
1221 i->second.conditional |= j->second.conditional;
1222 i->second.self_referencing |= j->second.self_referencing;
1223 if_assignments.erase(j);
1226 i->second.conditional = true;
1229 for(BlockAssignmentMap::iterator i=if_assignments.begin(); i!=if_assignments.end(); ++i)
1231 i->second.conditional = true;
1232 else_assignments.insert(*i);
1235 merge_down_assignments();
1238 void ProgramCompiler::UnusedVariableLocator::visit(Iteration &iter)
1240 assignments.push_back(BlockAssignmentMap());
1241 TraversingVisitor::visit(iter);
1242 merge_down_assignments();
1246 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionCall &call)
1248 TraversingVisitor::visit(call);
1250 unused_nodes.erase(call.declaration);
1251 if(call.declaration && call.declaration->definition!=call.declaration)
1252 used_definitions.insert(call.declaration->definition);
1255 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionDeclaration &func)
1257 TraversingVisitor::visit(func);
1259 if(func.name!="main" && !used_definitions.count(&func))
1260 unused_nodes.insert(&func);
1264 ProgramCompiler::NodeRemover::NodeRemover(const set<Node *> &r):
1268 void ProgramCompiler::NodeRemover::visit(Block &block)
1270 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
1273 if(to_remove.count(&**i))
1274 block.body.erase(i++);
1280 void ProgramCompiler::NodeRemover::visit(VariableDeclaration &var)
1282 if(to_remove.count(&var))
1284 stage->in_variables.erase(var.name);
1285 stage->out_variables.erase(var.name);
1286 if(var.linked_declaration)
1287 var.linked_declaration->linked_declaration = 0;
1289 else if(var.init_expression && to_remove.count(&*var.init_expression))
1290 var.init_expression = 0;
1294 ProgramCompiler::LegacyConverter::LegacyConverter():
1295 target_version(get_glsl_version())
1298 ProgramCompiler::LegacyConverter::LegacyConverter(const Version &v):
1302 bool ProgramCompiler::LegacyConverter::check_version(const Version &feature_version)
1304 if(target_version<feature_version)
1306 else if(stage->required_version<feature_version)
1307 stage->required_version = feature_version;
1312 void ProgramCompiler::LegacyConverter::visit(VariableReference &var)
1314 if(var.name==frag_out_name && !check_version(Version(1, 30)))
1316 var.name = "gl_FragColor";
1317 var.declaration = 0;
1320 else if(var.declaration)
1321 type = var.declaration->type;
1326 void ProgramCompiler::LegacyConverter::visit(FunctionCall &call)
1328 if(call.name=="texture" && !call.declaration && !check_version(Version(1, 30)))
1330 vector<NodePtr<Expression> >::iterator i = call.arguments.begin();
1331 if(i!=call.arguments.end())
1334 if(type=="sampler1D")
1335 call.name = "texture1D";
1336 else if(type=="sampler2D")
1337 call.name = "texture2D";
1338 else if(type=="sampler3D")
1339 call.name = "texture3D";
1340 else if(type=="sampler1DShadow")
1341 call.name = "shadow1D";
1342 else if(type=="sampler2DShadow")
1343 call.name = "shadow2D";
1345 for(; i!=call.arguments.end(); ++i)
1350 TraversingVisitor::visit(call);
1353 void ProgramCompiler::LegacyConverter::visit(VariableDeclaration &var)
1355 if(var.interface=="in" || var.interface=="out")
1356 if(!check_version(Version(1, 30)))
1358 if(stage->type==VERTEX && var.interface=="in")
1359 var.interface = "attribute";
1360 else if((stage->type==VERTEX && var.interface=="out") || (stage->type==FRAGMENT && var.interface=="in"))
1361 var.interface = "varying";
1362 else if(stage->type==FRAGMENT && var.interface=="out")
1364 frag_out_name = var.name;
1369 TraversingVisitor::visit(var);
1372 void ProgramCompiler::LegacyConverter::visit(InterfaceBlock &iface)
1374 if(!check_version(Version(1, 50)))
1375 flatten_block(iface.members);