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)
65 program.attach_shader_owned(new VertexShader(apply<Formatter>(*i)));
66 for(map<string, unsigned>::iterator j=i->locations.begin(); j!=i->locations.end(); ++j)
67 program.bind_attribute(j->second, j->first);
69 else if(i->type==GEOMETRY)
70 program.attach_shader_owned(new GeometryShader(apply<Formatter>(*i)));
71 else if(i->type==FRAGMENT)
73 program.attach_shader_owned(new FragmentShader(apply<Formatter>(*i)));
74 for(map<string, unsigned>::iterator j=i->locations.begin(); j!=i->locations.end(); ++j)
75 program.bind_fragment_data(j->second, j->first);
80 Module *ProgramCompiler::create_builtins_module()
83 Module *module = new Module(parser.parse(builtins_src));
84 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
86 VariableResolver resolver;
87 i->content.visit(resolver);
88 for(map<string, VariableDeclaration *>::iterator j=i->content.variables.begin(); j!=i->content.variables.end(); ++j)
89 j->second->linked_declaration = j->second;
94 Module &ProgramCompiler::get_builtins_module()
96 static RefPtr<Module> builtins_module = create_builtins_module();
97 return *builtins_module;
100 Stage *ProgramCompiler::get_builtins(StageType type)
102 Module &module = get_builtins_module();
103 for(list<Stage>::iterator i=module.stages.begin(); i!=module.stages.end(); ++i)
109 void ProgramCompiler::process()
111 list<Import *> imports = apply<NodeGatherer<Import> >(module->shared);
112 for(list<Import *>::iterator i=imports.end(); i!=imports.begin(); )
113 import((*--i)->module);
114 apply<NodeRemover>(module->shared, set<Node *>(imports.begin(), imports.end()));
116 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
118 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); )
121 i = module->stages.begin();
127 void ProgramCompiler::import(const string &name)
129 string fn = name+".glsl";
130 RefPtr<IO::Seekable> io = (resources ? resources->open_raw(fn) : Resources::get_builtins().open(fn));
132 throw runtime_error(format("module %s not found", name));
133 ProgramParser import_parser;
134 Module &imported_module = import_parser.parse(*io);
136 inject_block(module->shared.content, imported_module.shared.content);
137 apply<DeclarationCombiner>(module->shared);
138 for(list<Stage>::iterator i=imported_module.stages.begin(); i!=imported_module.stages.end(); ++i)
140 list<Stage>::iterator j;
141 for(j=module->stages.begin(); (j!=module->stages.end() && j->type<i->type); ++j) ;
142 if(j==module->stages.end() || j->type>i->type)
144 j = module->stages.insert(j, *i);
145 list<Stage>::iterator k = j;
146 if(++k!=module->stages.end())
148 if(j!=module->stages.begin())
149 j->previous = &*--(k=j);
153 inject_block(j->content, i->content);
154 apply<DeclarationCombiner>(*j);
159 void ProgramCompiler::generate(Stage &stage)
161 inject_block(stage.content, module->shared.content);
163 apply<FunctionResolver>(stage);
164 apply<VariableResolver>(stage);
165 apply<InterfaceGenerator>(stage);
166 apply<VariableResolver>(stage);
167 apply<VariableRenamer>(stage);
168 apply<DeclarationReorderer>(stage);
169 apply<LegacyConverter>(stage);
172 bool ProgramCompiler::optimize(Stage &stage)
174 apply<ConstantConditionEliminator>(stage);
176 set<FunctionDeclaration *> inlineable = apply<InlineableFunctionLocator>(stage);
177 apply<FunctionInliner>(stage, inlineable);
179 set<Node *> unused = apply<UnusedVariableLocator>(stage);
180 set<Node *> unused2 = apply<UnusedFunctionLocator>(stage);
181 unused.insert(unused2.begin(), unused2.end());
182 apply<NodeRemover>(stage, unused);
184 return !unused.empty();
187 void ProgramCompiler::inject_block(Block &target, const Block &source)
189 list<RefPtr<Node> >::iterator insert_point = target.body.begin();
190 for(list<RefPtr<Node> >::const_iterator i=source.body.begin(); i!=source.body.end(); ++i)
191 target.body.insert(insert_point, (*i)->clone());
195 typename T::ResultType ProgramCompiler::apply(Stage &stage)
198 visitor.apply(stage);
199 return visitor.get_result();
202 template<typename T, typename A>
203 typename T::ResultType ProgramCompiler::apply(Stage &stage, const A &arg)
206 visitor.apply(stage);
207 return visitor.get_result();
211 ProgramCompiler::Visitor::Visitor():
215 void ProgramCompiler::Visitor::apply(Stage &s)
217 SetForScope<Stage *> set(stage, &s);
218 stage->content.visit(*this);
222 ProgramCompiler::Formatter::Formatter():
224 parameter_list(false),
228 void ProgramCompiler::Formatter::apply(ProgramSyntax::Stage &s)
230 const Version &ver = s.required_version;
232 formatted += format("#version %d%d\n", ver.major, ver.minor);
236 void ProgramCompiler::Formatter::visit(Literal &literal)
238 formatted += literal.token;
241 void ProgramCompiler::Formatter::visit(ParenthesizedExpression &parexpr)
244 parexpr.expression->visit(*this);
248 void ProgramCompiler::Formatter::visit(VariableReference &var)
250 formatted += var.name;
253 void ProgramCompiler::Formatter::visit(MemberAccess &memacc)
255 memacc.left->visit(*this);
256 formatted += format(".%s", memacc.member);
259 void ProgramCompiler::Formatter::visit(UnaryExpression &unary)
262 formatted += unary.oper;
263 unary.expression->visit(*this);
265 formatted += unary.oper;
268 void ProgramCompiler::Formatter::visit(BinaryExpression &binary)
270 binary.left->visit(*this);
271 formatted += binary.oper;
272 binary.right->visit(*this);
273 formatted += binary.after;
276 void ProgramCompiler::Formatter::visit(Assignment &assign)
278 assign.left->visit(*this);
279 formatted += format(" %s ", assign.oper);
280 assign.right->visit(*this);
283 void ProgramCompiler::Formatter::visit(FunctionCall &call)
285 formatted += format("%s(", call.name);
286 for(vector<RefPtr<Expression> >::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
288 if(i!=call.arguments.begin())
295 void ProgramCompiler::Formatter::visit(ExpressionStatement &expr)
297 expr.expression->visit(*this);
301 void ProgramCompiler::Formatter::visit(Block &block)
306 unsigned brace_indent = indent;
307 bool use_braces = (block.use_braces || (indent && block.body.size()!=1));
309 formatted += format("%s{\n", string(brace_indent*2, ' '));
311 SetForScope<unsigned> set(indent, indent+(indent>0 || use_braces));
312 string spaces(indent*2, ' ');
313 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
315 if(i!=block.body.begin())
323 formatted += format("\n%s}", string(brace_indent*2, ' '));
326 void ProgramCompiler::Formatter::visit(Import &import)
328 formatted += format("import %s;", import.module);
331 void ProgramCompiler::Formatter::visit(Layout &layout)
333 formatted += "layout(";
334 for(vector<Layout::Qualifier>::const_iterator i=layout.qualifiers.begin(); i!=layout.qualifiers.end(); ++i)
336 if(i!=layout.qualifiers.begin())
338 formatted += i->identifier;
339 if(!i->value.empty())
340 formatted += format("=%s", i->value);
345 void ProgramCompiler::Formatter::visit(InterfaceLayout &layout)
347 layout.layout.visit(*this);
348 formatted += format(" %s;", layout.interface);
351 void ProgramCompiler::Formatter::visit(StructDeclaration &strct)
353 formatted += format("struct %s\n", strct.name);
354 strct.members.visit(*this);
358 void ProgramCompiler::Formatter::visit(VariableDeclaration &var)
362 var.layout->visit(*this);
366 formatted += "const ";
367 if(!var.sampling.empty())
368 formatted += format("%s ", var.sampling);
369 if(!var.interface.empty() && var.interface!=block_interface)
370 formatted += format("%s ", var.interface);
371 formatted += format("%s %s", var.type, var.name);
376 var.array_size->visit(*this);
379 if(var.init_expression)
382 var.init_expression->visit(*this);
388 void ProgramCompiler::Formatter::visit(InterfaceBlock &iface)
390 SetForScope<string> set(block_interface, iface.interface);
391 formatted += format("%s %s\n", iface.interface, iface.name);
392 iface.members.visit(*this);
396 void ProgramCompiler::Formatter::visit(FunctionDeclaration &func)
398 formatted += format("%s %s(", func.return_type, func.name);
399 for(vector<RefPtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
401 if(i!=func.parameters.begin())
403 SetFlag set(parameter_list);
407 if(func.definition==&func)
410 func.body.visit(*this);
416 void ProgramCompiler::Formatter::visit(Conditional &cond)
419 formatted.replace(formatted.rfind('\n'), string::npos, 1, ' ');
424 cond.condition->visit(*this);
427 cond.body.visit(*this);
428 if(!cond.else_body.body.empty())
430 formatted += format("\n%selse\n", string(indent*2, ' '));
431 SetForScope<unsigned> set(else_if, 2);
432 cond.else_body.visit(*this);
436 void ProgramCompiler::Formatter::visit(Iteration &iter)
439 iter.init_statement->visit(*this);
441 iter.condition->visit(*this);
443 iter.loop_expression->visit(*this);
445 iter.body.visit(*this);
448 void ProgramCompiler::Formatter::visit(Return &ret)
450 formatted += "return ";
451 ret.expression->visit(*this);
455 void ProgramCompiler::Formatter::visit(Jump &jump)
457 formatted += jump.keyword;
462 ProgramCompiler::DeclarationCombiner::DeclarationCombiner():
467 void ProgramCompiler::DeclarationCombiner::visit(Block &block)
472 SetForScope<bool> set(toplevel, false);
473 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
478 block.body.erase(i++);
484 void ProgramCompiler::DeclarationCombiner::visit(FunctionDeclaration &func)
486 vector<FunctionDeclaration *> &decls = functions[func.name];
489 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
491 (*i)->definition = func.definition;
492 (*i)->body.body.clear();
495 decls.push_back(&func);
498 void ProgramCompiler::DeclarationCombiner::visit(VariableDeclaration &var)
500 VariableDeclaration *&ptr = variables[var.name];
503 ptr->type = var.type;
504 if(var.init_expression)
505 ptr->init_expression = var.init_expression;
513 ProgramCompiler::VariableResolver::VariableResolver():
515 record_target(false),
516 assignment_target(0),
517 self_referencing(false)
520 void ProgramCompiler::VariableResolver::apply(Stage &s)
522 SetForScope<Stage *> set(stage, &s);
523 Stage *builtins = get_builtins(stage->type);
525 blocks.push_back(&builtins->content);
526 stage->content.visit(*this);
531 void ProgramCompiler::VariableResolver::visit(Block &block)
533 blocks.push_back(&block);
534 block.variables.clear();
535 TraversingVisitor::visit(block);
539 void ProgramCompiler::VariableResolver::visit(VariableReference &var)
543 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
546 map<string, VariableDeclaration *>::iterator j = (*i)->variables.find(var.name);
547 if(j!=(*i)->variables.end())
549 var.declaration = j->second;
550 type = j->second->type_declaration;
557 if(assignment_target)
559 record_target = false;
560 assignment_target = 0;
563 assignment_target = var.declaration;
565 else if(var.declaration && var.declaration==assignment_target)
566 self_referencing = true;
569 void ProgramCompiler::VariableResolver::visit(MemberAccess &memacc)
572 TraversingVisitor::visit(memacc);
573 memacc.declaration = 0;
576 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
577 if(i!=type->members.variables.end())
579 memacc.declaration = i->second;
580 type = i->second->type_declaration;
587 void ProgramCompiler::VariableResolver::visit(BinaryExpression &binary)
592 SetForScope<bool> set(record_target, false);
593 binary.right->visit(*this);
596 binary.left->visit(*this);
600 TraversingVisitor::visit(binary);
605 void ProgramCompiler::VariableResolver::visit(Assignment &assign)
608 SetFlag set(record_target);
609 assignment_target = 0;
610 assign.left->visit(*this);
613 self_referencing = false;
614 assign.right->visit(*this);
616 assign.self_referencing = (self_referencing || assign.oper!="=");
617 assign.target_declaration = assignment_target;
620 void ProgramCompiler::VariableResolver::visit(StructDeclaration &strct)
622 TraversingVisitor::visit(strct);
623 blocks.back()->types[strct.name] = &strct;
626 void ProgramCompiler::VariableResolver::visit(VariableDeclaration &var)
628 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
631 map<string, StructDeclaration *>::iterator j = (*i)->types.find(var.type);
632 if(j!=(*i)->types.end())
633 var.type_declaration = j->second;
636 if(!block_interface.empty() && var.interface.empty())
637 var.interface = block_interface;
639 TraversingVisitor::visit(var);
640 blocks.back()->variables[var.name] = &var;
641 if(anonymous && blocks.size()>1)
642 blocks[blocks.size()-2]->variables[var.name] = &var;
645 void ProgramCompiler::VariableResolver::visit(InterfaceBlock &iface)
647 SetFlag set(anonymous);
648 SetForScope<string> set2(block_interface, iface.interface);
649 TraversingVisitor::visit(iface);
653 void ProgramCompiler::FunctionResolver::visit(FunctionCall &call)
655 map<string, vector<FunctionDeclaration *> >::iterator i = functions.find(call.name);
656 if(i!=functions.end())
657 call.declaration = i->second.back();
659 TraversingVisitor::visit(call);
662 void ProgramCompiler::FunctionResolver::visit(FunctionDeclaration &func)
664 vector<FunctionDeclaration *> &decls = functions[func.name];
667 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
668 (*i)->definition = func.definition;
670 decls.push_back(&func);
672 else if(!decls.empty() && decls.back()->definition)
673 func.definition = decls.back()->definition;
675 decls.push_back(&func);
677 TraversingVisitor::visit(func);
681 ProgramCompiler::BlockModifier::BlockModifier():
685 void ProgramCompiler::BlockModifier::flatten_block(Block &block)
687 insert_nodes.insert(insert_nodes.end(), block.body.begin(), block.body.end());
691 void ProgramCompiler::BlockModifier::apply_and_increment(Block &block, list<RefPtr<Node> >::iterator &i)
693 block.body.insert(i, insert_nodes.begin(), insert_nodes.end());
694 insert_nodes.clear();
697 block.body.erase(i++);
703 void ProgramCompiler::BlockModifier::visit(Block &block)
705 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
708 apply_and_increment(block, i);
713 ProgramCompiler::InterfaceGenerator::InterfaceGenerator():
717 string ProgramCompiler::InterfaceGenerator::get_out_prefix(StageType type)
721 else if(type==GEOMETRY)
727 void ProgramCompiler::InterfaceGenerator::apply(Stage &s)
729 SetForScope<Stage *> set(stage, &s);
731 in_prefix = get_out_prefix(stage->previous->type);
732 out_prefix = get_out_prefix(stage->type);
733 stage->content.visit(*this);
736 void ProgramCompiler::InterfaceGenerator::visit(Block &block)
738 SetForScope<unsigned> set(scope_level, scope_level+1);
739 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
745 for(map<string, RefPtr<VariableDeclaration> >::iterator j=iface_declarations.begin(); j!=iface_declarations.end(); ++j)
747 list<RefPtr<Node> >::iterator k = block.body.insert(i, j->second);
750 iface_declarations.clear();
753 apply_and_increment(block, i);
757 string ProgramCompiler::InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
759 unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
760 return prefix+name.substr(offset);
763 bool ProgramCompiler::InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
765 const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
766 if(stage_vars.count(name) || iface_declarations.count(name))
769 VariableDeclaration* iface_var = new VariableDeclaration;
770 iface_var->sampling = var.sampling;
771 iface_var->interface = iface;
772 iface_var->type = var.type;
773 iface_var->type_declaration = var.type_declaration;
774 iface_var->name = name;
775 if(stage->type==GEOMETRY)
776 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
778 iface_var->array = var.array;
780 iface_var->array_size = var.array_size;
782 iface_var->linked_declaration = &var;
783 iface_declarations[name] = iface_var;
788 void ProgramCompiler::InterfaceGenerator::insert_assignment(const string &left, ProgramSyntax::Expression *right)
790 Assignment *assign = new Assignment;
791 VariableReference *ref = new VariableReference;
795 assign->right = right;
797 ExpressionStatement *stmt = new ExpressionStatement;
798 stmt->expression = assign;
799 insert_nodes.push_back(stmt);
802 void ProgramCompiler::InterfaceGenerator::visit(VariableReference &var)
804 if(var.declaration || !stage->previous)
806 if(iface_declarations.count(var.name))
809 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
810 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
811 if(i==prev_out.end())
812 i = prev_out.find(in_prefix+var.name);
813 if(i!=prev_out.end())
814 generate_interface(*i->second, "in", var.name);
817 void ProgramCompiler::InterfaceGenerator::visit(VariableDeclaration &var)
819 if(var.interface=="out")
822 stage->out_variables[var.name] = &var;
823 else if(generate_interface(var, "out", change_prefix(var.name, string())))
826 if(var.init_expression)
827 insert_assignment(var.name, var.init_expression->clone());
830 else if(var.interface=="in")
832 stage->in_variables[var.name] = &var;
833 if(var.linked_declaration)
834 var.linked_declaration->linked_declaration = &var;
835 else if(stage->previous)
837 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
838 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
839 if(i!=prev_out.end())
841 var.linked_declaration = i->second;
842 i->second->linked_declaration = &var;
847 TraversingVisitor::visit(var);
850 void ProgramCompiler::InterfaceGenerator::visit(Passthrough &pass)
852 vector<VariableDeclaration *> pass_vars;
854 for(map<string, VariableDeclaration *>::const_iterator i=stage->in_variables.begin(); i!=stage->in_variables.end(); ++i)
855 pass_vars.push_back(i->second);
856 for(map<string, RefPtr<VariableDeclaration> >::const_iterator i=iface_declarations.begin(); i!=iface_declarations.end(); ++i)
857 if(i->second->interface=="in")
858 pass_vars.push_back(i->second.get());
862 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
863 for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
866 for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
867 linked = ((*j)->linked_declaration==i->second);
869 if(!linked && generate_interface(*i->second, "in", i->second->name))
870 pass_vars.push_back(i->second);
874 if(stage->type==GEOMETRY)
876 VariableReference *ref = new VariableReference;
879 BinaryExpression *subscript = new BinaryExpression;
880 subscript->left = ref;
881 subscript->oper = "[";
882 subscript->right = pass.subscript;
883 subscript->after = "]";
885 MemberAccess *memacc = new MemberAccess;
886 memacc->left = subscript;
887 memacc->member = "gl_Position";
889 insert_assignment("gl_Position", memacc);
892 for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
894 string out_name = change_prefix((*i)->name, out_prefix);
895 generate_interface(**i, "out", out_name);
897 VariableReference *ref = new VariableReference;
898 ref->name = (*i)->name;
901 BinaryExpression *subscript = new BinaryExpression;
902 subscript->left = ref;
903 subscript->oper = "[";
904 subscript->right = pass.subscript;
905 subscript->after = "]";
906 insert_assignment(out_name, subscript);
909 insert_assignment(out_name, ref);
916 void ProgramCompiler::VariableRenamer::visit(VariableReference &var)
919 var.name = var.declaration->name;
922 void ProgramCompiler::VariableRenamer::visit(VariableDeclaration &var)
924 if(var.linked_declaration)
925 var.name = var.linked_declaration->name;
926 TraversingVisitor::visit(var);
930 ProgramCompiler::DeclarationReorderer::DeclarationReorderer():
934 void ProgramCompiler::DeclarationReorderer::visit(Block &block)
936 list<RefPtr<Node> >::iterator struct_insert_point = block.body.end();
937 list<RefPtr<Node> >::iterator variable_insert_point = block.body.end();
939 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
941 kind = NO_DECLARATION;
945 if(kind==STRUCT && struct_insert_point!=block.body.end())
947 block.body.insert(struct_insert_point, *i);
950 else if(kind>STRUCT && struct_insert_point==block.body.end())
951 struct_insert_point = i;
953 if(kind==VARIABLE && variable_insert_point!=block.body.end())
955 block.body.insert(variable_insert_point, *i);
958 else if(kind>VARIABLE && variable_insert_point==block.body.end())
959 variable_insert_point = i;
962 block.body.erase(i++);
969 ProgramCompiler::InlineableFunctionLocator::InlineableFunctionLocator():
973 void ProgramCompiler::InlineableFunctionLocator::visit(FunctionCall &call)
975 FunctionDeclaration *def = call.declaration;
976 if(def && def->definition!=def)
977 def = def->definition;
981 unsigned &count = refcounts[def];
983 if(count>1 || def==in_function)
984 inlineable.erase(def);
987 TraversingVisitor::visit(call);
990 void ProgramCompiler::InlineableFunctionLocator::visit(FunctionDeclaration &func)
992 unsigned &count = refcounts[func.definition];
993 if(!count && func.parameters.empty())
994 inlineable.insert(func.definition);
996 SetForScope<FunctionDeclaration *> set(in_function, &func);
997 TraversingVisitor::visit(func);
1001 ProgramCompiler::FunctionInliner::FunctionInliner():
1005 ProgramCompiler::FunctionInliner::FunctionInliner(const set<FunctionDeclaration *> &in):
1010 void ProgramCompiler::FunctionInliner::visit_and_inline(RefPtr<Expression> &ptr)
1015 ptr = inline_result;
1018 void ProgramCompiler::FunctionInliner::visit(Block &block)
1023 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
1031 void ProgramCompiler::FunctionInliner::visit(UnaryExpression &unary)
1033 visit_and_inline(unary.expression);
1037 void ProgramCompiler::FunctionInliner::visit(BinaryExpression &binary)
1039 visit_and_inline(binary.left);
1040 visit_and_inline(binary.right);
1044 void ProgramCompiler::FunctionInliner::visit(FunctionCall &call)
1046 for(vector<RefPtr<Expression> >::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
1047 visit_and_inline(*i);
1049 FunctionDeclaration *def = call.declaration;
1050 if(def && def->definition!=def)
1051 def = def->definition;
1053 if(def && inlineable.count(def))
1062 void ProgramCompiler::FunctionInliner::visit(Return &ret)
1064 TraversingVisitor::visit(ret);
1067 inline_result = ret.expression->clone();
1071 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator():
1077 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator(const ValueMap &v):
1078 variable_values(&v),
1083 void ProgramCompiler::ExpressionEvaluator::visit(Literal &literal)
1085 if(literal.token=="true")
1087 else if(literal.token=="false")
1090 result = lexical_cast<float>(literal.token);
1091 result_valid = true;
1094 void ProgramCompiler::ExpressionEvaluator::visit(ParenthesizedExpression &parexp)
1096 parexp.expression->visit(*this);
1099 void ProgramCompiler::ExpressionEvaluator::visit(VariableReference &var)
1101 if(!var.declaration)
1106 ValueMap::const_iterator i = variable_values->find(var.declaration);
1107 if(i!=variable_values->end())
1108 i->second->visit(*this);
1110 else if(var.declaration->init_expression)
1111 var.declaration->init_expression->visit(*this);
1114 void ProgramCompiler::ExpressionEvaluator::visit(UnaryExpression &unary)
1116 result_valid = false;
1117 unary.expression->visit(*this);
1124 result_valid = false;
1127 void ProgramCompiler::ExpressionEvaluator::visit(BinaryExpression &binary)
1129 result_valid = false;
1130 binary.left->visit(*this);
1134 float left_result = result;
1135 result_valid = false;
1136 binary.right->visit(*this);
1140 if(binary.oper=="<")
1141 result = (left_result<result);
1142 else if(binary.oper=="<=")
1143 result = (left_result<=result);
1144 else if(binary.oper==">")
1145 result = (left_result>result);
1146 else if(binary.oper==">=")
1147 result = (left_result>=result);
1148 else if(binary.oper=="==")
1149 result = (left_result==result);
1150 else if(binary.oper=="!=")
1151 result = (left_result!=result);
1152 else if(binary.oper=="&&")
1153 result = (left_result && result);
1154 else if(binary.oper=="||")
1155 result = (left_result || result);
1157 result_valid = false;
1161 ProgramCompiler::ConstantConditionEliminator::ConstantConditionEliminator():
1165 void ProgramCompiler::ConstantConditionEliminator::visit(Block &block)
1167 SetForScope<unsigned> set(scope_level, scope_level+1);
1168 BlockModifier::visit(block);
1170 for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
1171 variable_values.erase(i->second);
1174 void ProgramCompiler::ConstantConditionEliminator::visit(Assignment &assign)
1176 variable_values.erase(assign.target_declaration);
1179 void ProgramCompiler::ConstantConditionEliminator::visit(VariableDeclaration &var)
1181 if(var.constant || scope_level>1)
1182 variable_values[&var] = var.init_expression.get();
1185 void ProgramCompiler::ConstantConditionEliminator::visit(Conditional &cond)
1187 ExpressionEvaluator eval(variable_values);
1188 cond.condition->visit(eval);
1189 if(eval.result_valid)
1190 flatten_block(eval.result ? cond.body : cond.else_body);
1192 TraversingVisitor::visit(cond);
1195 void ProgramCompiler::ConstantConditionEliminator::visit(Iteration &iter)
1199 ExpressionEvaluator eval;
1200 iter.condition->visit(eval);
1201 if(eval.result_valid && !eval.result)
1208 TraversingVisitor::visit(iter);
1212 ProgramCompiler::UnusedVariableLocator::UnusedVariableLocator():
1215 assignment_target(false)
1218 void ProgramCompiler::UnusedVariableLocator::apply(Stage &s)
1220 assignments.push_back(BlockAssignmentMap());
1222 assignments.pop_back();
1225 void ProgramCompiler::UnusedVariableLocator::visit(VariableReference &var)
1227 unused_nodes.erase(var.declaration);
1229 map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
1230 if(i!=aggregates.end())
1231 unused_nodes.erase(i->second);
1233 if(assignment_target)
1236 for(vector<BlockAssignmentMap>::iterator j=assignments.end(); j!=assignments.begin(); )
1239 BlockAssignmentMap::iterator k = j->find(var.declaration);
1242 for(vector<Node *>::iterator l=k->second.nodes.begin(); l!=k->second.nodes.end(); ++l)
1243 unused_nodes.erase(*l);
1250 void ProgramCompiler::UnusedVariableLocator::visit(MemberAccess &memacc)
1252 TraversingVisitor::visit(memacc);
1253 unused_nodes.erase(memacc.declaration);
1256 void ProgramCompiler::UnusedVariableLocator::visit(BinaryExpression &binary)
1258 if(binary.oper=="[")
1260 binary.left->visit(*this);
1261 SetForScope<bool> set(assignment_target, false);
1262 binary.right->visit(*this);
1265 TraversingVisitor::visit(binary);
1268 void ProgramCompiler::UnusedVariableLocator::visit(Assignment &assign)
1271 SetForScope<bool> set(assignment_target, !assign.self_referencing);
1272 assign.left->visit(*this);
1274 assign.right->visit(*this);
1275 assignment = &assign;
1278 void ProgramCompiler::UnusedVariableLocator::record_assignment(VariableDeclaration &var, Node &node, bool self_ref)
1280 unused_nodes.insert(&node);
1281 BlockAssignmentMap &block_assignments = assignments.back();
1282 AssignmentList &var_assignments = block_assignments[&var];
1284 var_assignments.nodes.clear();
1285 var_assignments.nodes.push_back(&node);
1286 var_assignments.conditional = false;
1287 var_assignments.self_referencing = self_ref;
1290 void ProgramCompiler::UnusedVariableLocator::visit(ExpressionStatement &expr)
1293 TraversingVisitor::visit(expr);
1294 if(assignment && assignment->target_declaration)
1295 record_assignment(*assignment->target_declaration, expr, assignment->self_referencing);
1298 void ProgramCompiler::UnusedVariableLocator::visit(StructDeclaration &strct)
1300 SetForScope<Node *> set(aggregate, &strct);
1301 unused_nodes.insert(&strct);
1302 TraversingVisitor::visit(strct);
1305 void ProgramCompiler::UnusedVariableLocator::visit(VariableDeclaration &var)
1308 aggregates[&var] = aggregate;
1311 unused_nodes.insert(&var);
1312 if(var.init_expression)
1313 record_assignment(var, *var.init_expression, false);
1315 unused_nodes.erase(var.type_declaration);
1316 TraversingVisitor::visit(var);
1319 void ProgramCompiler::UnusedVariableLocator::visit(InterfaceBlock &iface)
1321 SetForScope<Node *> set(aggregate, &iface);
1322 unused_nodes.insert(&iface);
1323 TraversingVisitor::visit(iface);
1326 void ProgramCompiler::UnusedVariableLocator::visit(FunctionDeclaration &func)
1328 assignments.push_back(BlockAssignmentMap());
1330 for(vector<RefPtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1332 func.body.visit(*this);
1334 BlockAssignmentMap &block_assignments = assignments.back();
1335 for(map<string, VariableDeclaration *>::iterator i=func.body.variables.begin(); i!=func.body.variables.end(); ++i)
1336 block_assignments.erase(i->second);
1337 for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
1339 if(i->first->interface=="out" && stage->type!=FRAGMENT && !i->first->linked_declaration)
1342 for(vector<Node *>::iterator j=i->second.nodes.begin(); j!=i->second.nodes.end(); ++j)
1343 unused_nodes.erase(*j);
1346 assignments.pop_back();
1349 void ProgramCompiler::UnusedVariableLocator::merge_down_assignments()
1351 BlockAssignmentMap &parent_assignments = assignments[assignments.size()-2];
1352 BlockAssignmentMap &block_assignments = assignments.back();
1353 for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
1355 BlockAssignmentMap::iterator j = parent_assignments.find(i->first);
1356 if(j==parent_assignments.end())
1357 parent_assignments.insert(*i);
1358 else if(i->second.self_referencing || i->second.conditional)
1360 j->second.nodes.insert(j->second.nodes.end(), i->second.nodes.begin(), i->second.nodes.end());
1361 j->second.conditional |= i->second.conditional;
1362 j->second.self_referencing |= i->second.self_referencing;
1365 j->second = i->second;
1367 assignments.pop_back();
1370 void ProgramCompiler::UnusedVariableLocator::visit(Conditional &cond)
1372 cond.condition->visit(*this);
1373 assignments.push_back(BlockAssignmentMap());
1374 cond.body.visit(*this);
1376 BlockAssignmentMap if_assignments;
1377 swap(assignments.back(), if_assignments);
1378 cond.else_body.visit(*this);
1380 BlockAssignmentMap &else_assignments = assignments.back();
1381 for(BlockAssignmentMap::iterator i=else_assignments.begin(); i!=else_assignments.end(); ++i)
1383 BlockAssignmentMap::iterator j = if_assignments.find(i->first);
1384 if(j!=if_assignments.end())
1386 i->second.nodes.insert(i->second.nodes.end(), j->second.nodes.begin(), j->second.nodes.end());
1387 i->second.conditional |= j->second.conditional;
1388 i->second.self_referencing |= j->second.self_referencing;
1389 if_assignments.erase(j);
1392 i->second.conditional = true;
1395 for(BlockAssignmentMap::iterator i=if_assignments.begin(); i!=if_assignments.end(); ++i)
1397 i->second.conditional = true;
1398 else_assignments.insert(*i);
1401 merge_down_assignments();
1404 void ProgramCompiler::UnusedVariableLocator::visit(Iteration &iter)
1406 assignments.push_back(BlockAssignmentMap());
1407 TraversingVisitor::visit(iter);
1408 merge_down_assignments();
1412 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionCall &call)
1414 TraversingVisitor::visit(call);
1416 unused_nodes.erase(call.declaration);
1417 if(call.declaration && call.declaration->definition!=call.declaration)
1418 used_definitions.insert(call.declaration->definition);
1421 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionDeclaration &func)
1423 TraversingVisitor::visit(func);
1425 if(func.name!="main" && !used_definitions.count(&func))
1426 unused_nodes.insert(&func);
1430 ProgramCompiler::NodeRemover::NodeRemover(const set<Node *> &r):
1434 void ProgramCompiler::NodeRemover::visit(Block &block)
1436 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
1439 if(to_remove.count(i->get()))
1440 block.body.erase(i++);
1446 void ProgramCompiler::NodeRemover::visit(VariableDeclaration &var)
1448 if(to_remove.count(&var))
1450 stage->in_variables.erase(var.name);
1451 stage->out_variables.erase(var.name);
1452 stage->locations.erase(var.name);
1453 if(var.linked_declaration)
1454 var.linked_declaration->linked_declaration = 0;
1456 else if(var.init_expression && to_remove.count(var.init_expression.get()))
1457 var.init_expression = 0;
1461 ProgramCompiler::LegacyConverter::LegacyConverter():
1462 target_version(get_glsl_version())
1465 ProgramCompiler::LegacyConverter::LegacyConverter(const Version &v):
1469 bool ProgramCompiler::LegacyConverter::check_version(const Version &feature_version)
1471 if(target_version<feature_version)
1473 else if(stage->required_version<feature_version)
1474 stage->required_version = feature_version;
1479 void ProgramCompiler::LegacyConverter::visit(VariableReference &var)
1481 if(var.name==frag_out_name && !check_version(Version(1, 30)))
1483 var.name = "gl_FragColor";
1484 var.declaration = 0;
1487 else if(var.declaration)
1488 type = var.declaration->type;
1493 void ProgramCompiler::LegacyConverter::visit(FunctionCall &call)
1495 if(call.name=="texture" && !call.declaration && !check_version(Version(1, 30)))
1497 vector<RefPtr<Expression> >::iterator i = call.arguments.begin();
1498 if(i!=call.arguments.end())
1501 if(type=="sampler1D")
1502 call.name = "texture1D";
1503 else if(type=="sampler2D")
1504 call.name = "texture2D";
1505 else if(type=="sampler3D")
1506 call.name = "texture3D";
1507 else if(type=="sampler1DShadow")
1508 call.name = "shadow1D";
1509 else if(type=="sampler2DShadow")
1510 call.name = "shadow2D";
1512 for(; i!=call.arguments.end(); ++i)
1517 TraversingVisitor::visit(call);
1520 void ProgramCompiler::LegacyConverter::visit(VariableDeclaration &var)
1522 if(var.layout && !check_version(Version(3, 30)))
1524 vector<Layout::Qualifier>::iterator i;
1525 for(i=var.layout->qualifiers.begin(); (i!=var.layout->qualifiers.end() && i->identifier!="location"); ++i) ;
1526 if(i!=var.layout->qualifiers.end())
1528 unsigned location = lexical_cast<unsigned>(i->value);
1529 if(stage->type==VERTEX && var.interface=="in")
1531 stage->locations[var.name] = location;
1532 var.layout->qualifiers.erase(i);
1534 else if(stage->type==FRAGMENT && var.interface=="out")
1536 stage->locations[var.name] = location;
1537 var.layout->qualifiers.erase(i);
1540 if(var.layout->qualifiers.empty())
1545 if((var.interface=="in" || var.interface=="out") && !check_version(Version(1, 30)))
1547 if(stage->type==VERTEX && var.interface=="in")
1548 var.interface = "attribute";
1549 else if((stage->type==VERTEX && var.interface=="out") || (stage->type==FRAGMENT && var.interface=="in"))
1550 var.interface = "varying";
1551 else if(stage->type==FRAGMENT && var.interface=="out")
1553 frag_out_name = var.name;
1558 TraversingVisitor::visit(var);
1561 void ProgramCompiler::LegacyConverter::visit(InterfaceBlock &iface)
1563 if(!check_version(Version(1, 50)))
1564 flatten_block(iface.members);