1 #include <msp/core/raii.h>
2 #include <msp/gl/extensions/ext_gpu_shader4.h>
3 #include <msp/strings/format.h>
4 #include <msp/strings/utils.h>
7 #include "programcompiler.h"
15 const char builtins_src[] =
16 "#pragma MSP stage(vertex)\n"
17 "out gl_PerVertex {\n"
18 " vec4 gl_Position;\n"
19 " float gl_ClipDistance[];\n"
21 "#pragma MSP stage(geometry)\n"
23 " vec4 gl_Position;\n"
24 " float gl_ClipDistance[];\n"
26 "out gl_PerVertex {\n"
27 " vec4 gl_Position;\n"
28 " float gl_ClipDistance[];\n"
36 using namespace ProgramSyntax;
38 ProgramCompiler::ProgramCompiler():
43 ProgramCompiler::~ProgramCompiler()
48 void ProgramCompiler::compile(const string &source, const string &src_name)
52 module = new Module();
54 imported_names.insert(src_name);
55 append_module(parser.parse(source, src_name));
59 void ProgramCompiler::compile(IO::Base &io, Resources *res, const string &src_name)
63 module = new Module();
65 imported_names.insert(src_name);
66 append_module(parser.parse(io, src_name));
70 void ProgramCompiler::compile(IO::Base &io, const string &src_name)
72 compile(io, 0, src_name);
75 void ProgramCompiler::add_shaders(Program &program)
78 throw invalid_operation("ProgramCompiler::add_shaders");
80 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
84 program.attach_shader_owned(new VertexShader(apply<Formatter>(*i)));
85 for(map<string, unsigned>::iterator j=i->locations.begin(); j!=i->locations.end(); ++j)
86 program.bind_attribute(j->second, j->first);
88 else if(i->type==GEOMETRY)
89 program.attach_shader_owned(new GeometryShader(apply<Formatter>(*i)));
90 else if(i->type==FRAGMENT)
92 program.attach_shader_owned(new FragmentShader(apply<Formatter>(*i)));
95 for(map<string, unsigned>::iterator j=i->locations.begin(); j!=i->locations.end(); ++j)
96 program.bind_fragment_data(j->second, j->first);
102 Module *ProgramCompiler::create_builtins_module()
104 ProgramParser parser;
105 Module *module = new Module(parser.parse(builtins_src, "<builtin>"));
106 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
108 VariableResolver resolver;
109 i->content.visit(resolver);
110 for(map<string, VariableDeclaration *>::iterator j=i->content.variables.begin(); j!=i->content.variables.end(); ++j)
111 j->second->linked_declaration = j->second;
116 Module &ProgramCompiler::get_builtins_module()
118 static RefPtr<Module> builtins_module = create_builtins_module();
119 return *builtins_module;
122 Stage *ProgramCompiler::get_builtins(StageType type)
124 Module &module = get_builtins_module();
125 for(list<Stage>::iterator i=module.stages.begin(); i!=module.stages.end(); ++i)
131 void ProgramCompiler::append_module(ProgramSyntax::Module &mod)
133 vector<Import *> imports = apply<NodeGatherer<Import> >(mod.shared);
134 for(vector<Import *>::iterator i=imports.begin(); i!=imports.end(); ++i)
135 import((*i)->module);
136 apply<NodeRemover>(mod.shared, set<Node *>(imports.begin(), imports.end()));
138 append_stage(mod.shared);
139 for(list<Stage>::iterator i=mod.stages.begin(); i!=mod.stages.end(); ++i)
143 void ProgramCompiler::append_stage(Stage &stage)
146 if(stage.type==SHARED)
147 target = &module->shared;
150 list<Stage>::iterator i;
151 for(i=module->stages.begin(); (i!=module->stages.end() && i->type<stage.type); ++i) ;
152 if(i==module->stages.end() || i->type>stage.type)
154 list<Stage>::iterator j = module->stages.insert(i, stage.type);
155 if(i!=module->stages.end())
158 if(i!=module->stages.begin())
165 for(NodeList<Node>::iterator i=stage.content.body.begin(); i!=stage.content.body.end(); ++i)
166 target->content.body.push_back(*i);
167 apply<DeclarationCombiner>(*target);
170 void ProgramCompiler::process()
172 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
174 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); )
177 i = module->stages.begin();
181 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
185 void ProgramCompiler::import(const string &name)
187 string fn = name+".glsl";
188 if(imported_names.count(fn))
190 imported_names.insert(fn);
192 RefPtr<IO::Seekable> io = (resources ? resources->open_raw(fn) : Resources::get_builtins().open(fn));
194 throw runtime_error(format("module %s not found", name));
195 ProgramParser import_parser;
196 append_module(import_parser.parse(*io, fn));
199 void ProgramCompiler::generate(Stage &stage)
201 inject_block(stage.content, module->shared.content);
203 apply<DeclarationReorderer>(stage);
204 apply<FunctionResolver>(stage);
205 apply<VariableResolver>(stage);
206 apply<InterfaceGenerator>(stage);
207 apply<VariableResolver>(stage);
208 apply<DeclarationReorderer>(stage);
209 apply<FunctionResolver>(stage);
210 apply<LegacyConverter>(stage);
213 bool ProgramCompiler::optimize(Stage &stage)
215 apply<ConstantConditionEliminator>(stage);
217 set<FunctionDeclaration *> inlineable = apply<InlineableFunctionLocator>(stage);
218 apply<FunctionInliner>(stage, inlineable);
220 set<Node *> unused = apply<UnusedVariableLocator>(stage);
221 set<Node *> unused2 = apply<UnusedFunctionLocator>(stage);
222 unused.insert(unused2.begin(), unused2.end());
223 apply<NodeRemover>(stage, unused);
225 return !unused.empty();
228 void ProgramCompiler::finalize(Stage &stage)
230 if(get_gl_api()==OPENGL_ES2)
231 apply<DefaultPrecisionGenerator>(stage);
233 apply<PrecisionRemover>(stage);
236 void ProgramCompiler::inject_block(Block &target, const Block &source)
238 list<RefPtr<Node> >::iterator insert_point = target.body.begin();
239 for(list<RefPtr<Node> >::const_iterator i=source.body.begin(); i!=source.body.end(); ++i)
240 target.body.insert(insert_point, (*i)->clone());
244 typename T::ResultType ProgramCompiler::apply(Stage &stage)
247 visitor.apply(stage);
248 return visitor.get_result();
251 template<typename T, typename A>
252 typename T::ResultType ProgramCompiler::apply(Stage &stage, const A &arg)
255 visitor.apply(stage);
256 return visitor.get_result();
260 ProgramCompiler::Visitor::Visitor():
264 void ProgramCompiler::Visitor::apply(Stage &s)
266 SetForScope<Stage *> set(stage, &s);
267 stage->content.visit(*this);
271 ProgramCompiler::BlockModifier::BlockModifier():
275 void ProgramCompiler::BlockModifier::flatten_block(Block &block)
277 insert_nodes.insert(insert_nodes.end(), block.body.begin(), block.body.end());
281 void ProgramCompiler::BlockModifier::apply_and_increment(Block &block, list<RefPtr<Node> >::iterator &i)
283 block.body.insert(i, insert_nodes.begin(), insert_nodes.end());
284 insert_nodes.clear();
287 block.body.erase(i++);
293 void ProgramCompiler::BlockModifier::visit(Block &block)
295 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
298 apply_and_increment(block, i);
303 ProgramCompiler::Formatter::Formatter():
305 parameter_list(false),
309 void ProgramCompiler::Formatter::apply(ProgramSyntax::Stage &s)
311 GLApi api = get_gl_api();
312 const Version &ver = s.required_version;
316 formatted += format("#version %d%02d", ver.major, ver.minor);
317 if(api==OPENGL_ES2 && ver>=Version(3, 0))
325 void ProgramCompiler::Formatter::visit(Literal &literal)
327 formatted += literal.token;
330 void ProgramCompiler::Formatter::visit(ParenthesizedExpression &parexpr)
333 parexpr.expression->visit(*this);
337 void ProgramCompiler::Formatter::visit(VariableReference &var)
339 formatted += var.name;
342 void ProgramCompiler::Formatter::visit(MemberAccess &memacc)
344 memacc.left->visit(*this);
345 formatted += format(".%s", memacc.member);
348 void ProgramCompiler::Formatter::visit(UnaryExpression &unary)
351 formatted += unary.oper;
352 unary.expression->visit(*this);
354 formatted += unary.oper;
357 void ProgramCompiler::Formatter::visit(BinaryExpression &binary)
359 binary.left->visit(*this);
360 formatted += binary.oper;
361 binary.right->visit(*this);
362 formatted += binary.after;
365 void ProgramCompiler::Formatter::visit(Assignment &assign)
367 assign.left->visit(*this);
368 formatted += format(" %s ", assign.oper);
369 assign.right->visit(*this);
372 void ProgramCompiler::Formatter::visit(FunctionCall &call)
374 formatted += format("%s(", call.name);
375 for(vector<RefPtr<Expression> >::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
377 if(i!=call.arguments.begin())
384 void ProgramCompiler::Formatter::visit(ExpressionStatement &expr)
386 expr.expression->visit(*this);
390 void ProgramCompiler::Formatter::visit(Block &block)
395 unsigned brace_indent = indent;
396 bool use_braces = (block.use_braces || (indent && block.body.size()!=1));
398 formatted += format("%s{\n", string(brace_indent*2, ' '));
400 SetForScope<unsigned> set(indent, indent+(indent>0 || use_braces));
401 string spaces(indent*2, ' ');
402 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
404 if(i!=block.body.begin())
412 formatted += format("\n%s}", string(brace_indent*2, ' '));
415 void ProgramCompiler::Formatter::visit(Import &import)
417 formatted += format("import %s;", import.module);
420 void ProgramCompiler::Formatter::visit(Precision &prec)
422 formatted += format("precision %s %s;", prec.precision, prec.type);
425 void ProgramCompiler::Formatter::visit(Layout &layout)
427 formatted += "layout(";
428 for(vector<Layout::Qualifier>::const_iterator i=layout.qualifiers.begin(); i!=layout.qualifiers.end(); ++i)
430 if(i!=layout.qualifiers.begin())
432 formatted += i->identifier;
433 if(!i->value.empty())
434 formatted += format("=%s", i->value);
439 void ProgramCompiler::Formatter::visit(InterfaceLayout &layout)
441 layout.layout.visit(*this);
442 formatted += format(" %s;", layout.interface);
445 void ProgramCompiler::Formatter::visit(StructDeclaration &strct)
447 formatted += format("struct %s\n", strct.name);
448 strct.members.visit(*this);
452 void ProgramCompiler::Formatter::visit(VariableDeclaration &var)
456 var.layout->visit(*this);
460 formatted += "const ";
461 if(!var.interpolation.empty())
462 formatted += format("%s ", var.interpolation);
463 if(!var.sampling.empty())
464 formatted += format("%s ", var.sampling);
465 if(!var.interface.empty() && var.interface!=block_interface)
467 string interface = var.interface;
468 if(stage->required_version<Version(1, 30))
470 if(stage->type==VERTEX && var.interface=="in")
471 interface = "attribute";
472 else if((stage->type==VERTEX && var.interface=="out") || (stage->type==FRAGMENT && var.interface=="in"))
473 interface = "varying";
475 formatted += format("%s ", interface);
477 if(!var.precision.empty())
478 formatted += format("%s ", var.precision);
479 formatted += format("%s %s", var.type, var.name);
484 var.array_size->visit(*this);
487 if(var.init_expression)
490 var.init_expression->visit(*this);
496 void ProgramCompiler::Formatter::visit(InterfaceBlock &iface)
498 SetForScope<string> set(block_interface, iface.interface);
499 formatted += format("%s %s\n", iface.interface, iface.name);
500 iface.members.visit(*this);
504 void ProgramCompiler::Formatter::visit(FunctionDeclaration &func)
506 formatted += format("%s %s(", func.return_type, func.name);
507 for(vector<RefPtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
509 if(i!=func.parameters.begin())
511 SetFlag set(parameter_list);
515 if(func.definition==&func)
518 func.body.visit(*this);
524 void ProgramCompiler::Formatter::visit(Conditional &cond)
527 formatted.replace(formatted.rfind('\n'), string::npos, 1, ' ');
532 cond.condition->visit(*this);
535 cond.body.visit(*this);
536 if(!cond.else_body.body.empty())
538 formatted += format("\n%selse\n", string(indent*2, ' '));
539 SetForScope<unsigned> set(else_if, 2);
540 cond.else_body.visit(*this);
544 void ProgramCompiler::Formatter::visit(Iteration &iter)
546 if(!iter.init_statement && iter.condition && !iter.loop_expression)
548 formatted += "while(";
549 iter.condition->visit(*this);
555 if(iter.init_statement)
556 iter.init_statement->visit(*this);
562 iter.condition->visit(*this);
565 if(iter.loop_expression)
568 iter.loop_expression->visit(*this);
573 if(iter.body.body.empty())
578 iter.body.visit(*this);
582 void ProgramCompiler::Formatter::visit(Return &ret)
584 formatted += "return";
588 ret.expression->visit(*this);
593 void ProgramCompiler::Formatter::visit(Jump &jump)
595 formatted += jump.keyword;
600 ProgramCompiler::DeclarationCombiner::DeclarationCombiner():
604 void ProgramCompiler::DeclarationCombiner::visit(Block &block)
609 SetForScope<bool> set(toplevel, false);
610 BlockModifier::visit(block);
613 void ProgramCompiler::DeclarationCombiner::visit(FunctionDeclaration &func)
615 vector<FunctionDeclaration *> &decls = functions[func.name];
618 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
620 (*i)->definition = func.definition;
621 (*i)->body.body.clear();
624 decls.push_back(&func);
627 void ProgramCompiler::DeclarationCombiner::visit(VariableDeclaration &var)
629 VariableDeclaration *&ptr = variables[var.name];
632 ptr->type = var.type;
633 if(var.init_expression)
634 ptr->init_expression = var.init_expression;
642 ProgramCompiler::VariableResolver::VariableResolver():
644 record_target(false),
645 assignment_target(0),
646 self_referencing(false)
649 void ProgramCompiler::VariableResolver::apply(Stage &s)
651 SetForScope<Stage *> set(stage, &s);
652 Stage *builtins = get_builtins(stage->type);
654 blocks.push_back(&builtins->content);
655 stage->content.visit(*this);
660 void ProgramCompiler::VariableResolver::visit(Block &block)
662 blocks.push_back(&block);
663 block.variables.clear();
664 TraversingVisitor::visit(block);
668 void ProgramCompiler::VariableResolver::visit(VariableReference &var)
672 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
675 map<string, VariableDeclaration *>::iterator j = (*i)->variables.find(var.name);
676 if(j!=(*i)->variables.end())
678 var.declaration = j->second;
679 type = j->second->type_declaration;
686 if(assignment_target)
688 record_target = false;
689 assignment_target = 0;
692 assignment_target = var.declaration;
694 else if(var.declaration && var.declaration==assignment_target)
695 self_referencing = true;
698 void ProgramCompiler::VariableResolver::visit(MemberAccess &memacc)
701 TraversingVisitor::visit(memacc);
702 memacc.declaration = 0;
705 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
706 if(i!=type->members.variables.end())
708 memacc.declaration = i->second;
709 type = i->second->type_declaration;
716 void ProgramCompiler::VariableResolver::visit(BinaryExpression &binary)
721 SetForScope<bool> set(record_target, false);
722 binary.right->visit(*this);
725 binary.left->visit(*this);
729 TraversingVisitor::visit(binary);
734 void ProgramCompiler::VariableResolver::visit(Assignment &assign)
737 SetFlag set(record_target);
738 assignment_target = 0;
739 assign.left->visit(*this);
742 self_referencing = false;
743 assign.right->visit(*this);
745 assign.self_referencing = (self_referencing || assign.oper!="=");
746 assign.target_declaration = assignment_target;
749 void ProgramCompiler::VariableResolver::visit(StructDeclaration &strct)
751 TraversingVisitor::visit(strct);
752 blocks.back()->types[strct.name] = &strct;
755 void ProgramCompiler::VariableResolver::visit(VariableDeclaration &var)
757 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
760 map<string, StructDeclaration *>::iterator j = (*i)->types.find(var.type);
761 if(j!=(*i)->types.end())
762 var.type_declaration = j->second;
765 if(!block_interface.empty() && var.interface.empty())
766 var.interface = block_interface;
768 TraversingVisitor::visit(var);
769 blocks.back()->variables[var.name] = &var;
770 if(anonymous && blocks.size()>1)
771 blocks[blocks.size()-2]->variables[var.name] = &var;
774 void ProgramCompiler::VariableResolver::visit(InterfaceBlock &iface)
776 SetFlag set(anonymous);
777 SetForScope<string> set2(block_interface, iface.interface);
778 TraversingVisitor::visit(iface);
782 void ProgramCompiler::FunctionResolver::visit(FunctionCall &call)
784 map<string, vector<FunctionDeclaration *> >::iterator i = functions.find(call.name);
785 if(i!=functions.end())
786 call.declaration = i->second.back();
788 TraversingVisitor::visit(call);
791 void ProgramCompiler::FunctionResolver::visit(FunctionDeclaration &func)
793 vector<FunctionDeclaration *> &decls = functions[func.name];
796 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
797 (*i)->definition = func.definition;
799 decls.push_back(&func);
801 else if(!decls.empty() && decls.back()->definition)
802 func.definition = decls.back()->definition;
804 decls.push_back(&func);
806 TraversingVisitor::visit(func);
810 ProgramCompiler::InterfaceGenerator::InterfaceGenerator():
814 string ProgramCompiler::InterfaceGenerator::get_out_prefix(StageType type)
818 else if(type==GEOMETRY)
824 void ProgramCompiler::InterfaceGenerator::apply(Stage &s)
826 SetForScope<Stage *> set(stage, &s);
828 in_prefix = get_out_prefix(stage->previous->type);
829 out_prefix = get_out_prefix(stage->type);
830 stage->content.visit(*this);
833 void ProgramCompiler::InterfaceGenerator::visit(Block &block)
835 SetForScope<unsigned> set(scope_level, scope_level+1);
836 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
842 for(map<string, RefPtr<VariableDeclaration> >::iterator j=iface_declarations.begin(); j!=iface_declarations.end(); ++j)
844 list<RefPtr<Node> >::iterator k = block.body.insert(i, j->second);
847 iface_declarations.clear();
850 apply_and_increment(block, i);
854 string ProgramCompiler::InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
856 unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
857 return prefix+name.substr(offset);
860 bool ProgramCompiler::InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
862 const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
863 if(stage_vars.count(name) || iface_declarations.count(name))
866 VariableDeclaration* iface_var = new VariableDeclaration;
867 iface_var->sampling = var.sampling;
868 iface_var->interface = iface;
869 iface_var->type = var.type;
870 iface_var->type_declaration = var.type_declaration;
871 iface_var->name = name;
872 if(stage->type==GEOMETRY)
873 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
875 iface_var->array = var.array;
877 iface_var->array_size = var.array_size;
879 iface_var->linked_declaration = &var;
880 iface_declarations[name] = iface_var;
885 void ProgramCompiler::InterfaceGenerator::insert_assignment(const string &left, ProgramSyntax::Expression *right)
887 Assignment *assign = new Assignment;
888 VariableReference *ref = new VariableReference;
892 assign->right = right;
894 ExpressionStatement *stmt = new ExpressionStatement;
895 stmt->expression = assign;
897 insert_nodes.push_back(stmt);
900 void ProgramCompiler::InterfaceGenerator::visit(VariableReference &var)
902 if(var.declaration || !stage->previous)
904 if(iface_declarations.count(var.name))
907 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
908 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
909 if(i==prev_out.end())
910 i = prev_out.find(in_prefix+var.name);
911 if(i!=prev_out.end())
913 generate_interface(*i->second, "in", i->second->name);
914 var.name = i->second->name;
918 void ProgramCompiler::InterfaceGenerator::visit(VariableDeclaration &var)
920 if(var.interface=="out")
923 stage->out_variables[var.name] = &var;
924 else if(generate_interface(var, "out", change_prefix(var.name, string())))
927 if(var.init_expression)
929 insert_assignment(var.name, var.init_expression->clone());
934 else if(var.interface=="in")
936 stage->in_variables[var.name] = &var;
937 if(var.linked_declaration)
938 var.linked_declaration->linked_declaration = &var;
939 else if(stage->previous)
941 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
942 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
943 if(i!=prev_out.end())
945 var.linked_declaration = i->second;
946 i->second->linked_declaration = &var;
951 TraversingVisitor::visit(var);
954 void ProgramCompiler::InterfaceGenerator::visit(Passthrough &pass)
956 vector<VariableDeclaration *> pass_vars;
958 for(map<string, VariableDeclaration *>::const_iterator i=stage->in_variables.begin(); i!=stage->in_variables.end(); ++i)
959 pass_vars.push_back(i->second);
960 for(map<string, RefPtr<VariableDeclaration> >::const_iterator i=iface_declarations.begin(); i!=iface_declarations.end(); ++i)
961 if(i->second->interface=="in")
962 pass_vars.push_back(i->second.get());
966 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
967 for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
970 for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
971 linked = ((*j)->linked_declaration==i->second);
973 if(!linked && generate_interface(*i->second, "in", i->second->name))
974 pass_vars.push_back(i->second);
978 if(stage->type==GEOMETRY)
980 VariableReference *ref = new VariableReference;
983 BinaryExpression *subscript = new BinaryExpression;
984 subscript->left = ref;
985 subscript->oper = "[";
986 subscript->right = pass.subscript;
987 subscript->after = "]";
989 MemberAccess *memacc = new MemberAccess;
990 memacc->left = subscript;
991 memacc->member = "gl_Position";
993 insert_assignment("gl_Position", memacc);
996 for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
998 string out_name = change_prefix((*i)->name, out_prefix);
999 generate_interface(**i, "out", out_name);
1001 VariableReference *ref = new VariableReference;
1002 ref->name = (*i)->name;
1005 BinaryExpression *subscript = new BinaryExpression;
1006 subscript->left = ref;
1007 subscript->oper = "[";
1008 subscript->right = pass.subscript;
1009 subscript->after = "]";
1010 insert_assignment(out_name, subscript);
1013 insert_assignment(out_name, ref);
1020 ProgramCompiler::DeclarationReorderer::DeclarationReorderer():
1022 kind(NO_DECLARATION)
1025 void ProgramCompiler::DeclarationReorderer::visit(FunctionCall &call)
1027 FunctionDeclaration *def = call.declaration;
1029 def = def->definition;
1030 if(def && !ordered_funcs.count(def))
1031 needed_funcs.insert(def);
1034 void ProgramCompiler::DeclarationReorderer::visit(Block &block)
1036 SetForScope<unsigned> set(scope_level, scope_level+1);
1038 return Visitor::visit(block);
1040 list<RefPtr<Node> >::iterator struct_insert_point = block.body.end();
1041 list<RefPtr<Node> >::iterator variable_insert_point = block.body.end();
1042 list<RefPtr<Node> >::iterator function_insert_point = block.body.end();
1043 unsigned unordered_func_count = 0;
1044 bool ordered_any_funcs = false;
1046 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
1048 kind = NO_DECLARATION;
1052 if(kind==STRUCT && struct_insert_point!=block.body.end())
1054 block.body.insert(struct_insert_point, *i);
1057 else if(kind>STRUCT && struct_insert_point==block.body.end())
1058 struct_insert_point = i;
1060 if(kind==VARIABLE && variable_insert_point!=block.body.end())
1062 block.body.insert(variable_insert_point, *i);
1065 else if(kind>VARIABLE && variable_insert_point==block.body.end())
1066 variable_insert_point = i;
1070 if(function_insert_point==block.body.end())
1071 function_insert_point = i;
1073 if(needed_funcs.empty())
1075 ordered_funcs.insert(i->get());
1076 if(i!=function_insert_point)
1078 block.body.insert(function_insert_point, *i);
1082 ++function_insert_point;
1083 ordered_any_funcs = true;
1086 ++unordered_func_count;
1091 if(function_insert_point==i)
1092 ++function_insert_point;
1093 block.body.erase(i++);
1098 if(i==block.body.end() && unordered_func_count)
1100 if(!ordered_any_funcs)
1101 // A subset of the remaining functions forms a recursive loop
1102 /* TODO pick a function and move it up, adding any necessary
1106 i = function_insert_point;
1107 unordered_func_count = 0;
1112 void ProgramCompiler::DeclarationReorderer::visit(ProgramSyntax::VariableDeclaration &var)
1114 Visitor::visit(var);
1118 void ProgramCompiler::DeclarationReorderer::visit(FunctionDeclaration &func)
1120 needed_funcs.clear();
1121 func.body.visit(*this);
1122 needed_funcs.erase(&func);
1127 ProgramCompiler::InlineableFunctionLocator::InlineableFunctionLocator():
1131 void ProgramCompiler::InlineableFunctionLocator::visit(FunctionCall &call)
1133 FunctionDeclaration *def = call.declaration;
1134 if(def && def->definition!=def)
1135 def = def->definition;
1139 unsigned &count = refcounts[def];
1141 if(count>1 || def==in_function)
1142 inlineable.erase(def);
1145 TraversingVisitor::visit(call);
1148 void ProgramCompiler::InlineableFunctionLocator::visit(FunctionDeclaration &func)
1150 unsigned &count = refcounts[func.definition];
1151 if(!count && func.parameters.empty())
1152 inlineable.insert(func.definition);
1154 SetForScope<FunctionDeclaration *> set(in_function, &func);
1155 TraversingVisitor::visit(func);
1159 ProgramCompiler::FunctionInliner::FunctionInliner():
1163 ProgramCompiler::FunctionInliner::FunctionInliner(const set<FunctionDeclaration *> &in):
1168 void ProgramCompiler::FunctionInliner::visit_and_inline(RefPtr<Expression> &ptr)
1173 ptr = inline_result;
1176 void ProgramCompiler::FunctionInliner::visit(Block &block)
1181 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
1189 void ProgramCompiler::FunctionInliner::visit(UnaryExpression &unary)
1191 visit_and_inline(unary.expression);
1195 void ProgramCompiler::FunctionInliner::visit(BinaryExpression &binary)
1197 visit_and_inline(binary.left);
1198 visit_and_inline(binary.right);
1202 void ProgramCompiler::FunctionInliner::visit(MemberAccess &memacc)
1204 visit_and_inline(memacc.left);
1208 void ProgramCompiler::FunctionInliner::visit(FunctionCall &call)
1210 for(vector<RefPtr<Expression> >::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
1211 visit_and_inline(*i);
1213 FunctionDeclaration *def = call.declaration;
1214 if(def && def->definition!=def)
1215 def = def->definition;
1217 if(def && inlineable.count(def))
1226 void ProgramCompiler::FunctionInliner::visit(VariableDeclaration &var)
1228 if(var.init_expression)
1229 visit_and_inline(var.init_expression);
1233 void ProgramCompiler::FunctionInliner::visit(Return &ret)
1235 TraversingVisitor::visit(ret);
1238 inline_result = ret.expression->clone();
1242 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator():
1248 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator(const ValueMap &v):
1249 variable_values(&v),
1254 void ProgramCompiler::ExpressionEvaluator::visit(Literal &literal)
1256 if(literal.token=="true")
1258 else if(literal.token=="false")
1261 result = lexical_cast<float>(literal.token);
1262 result_valid = true;
1265 void ProgramCompiler::ExpressionEvaluator::visit(ParenthesizedExpression &parexp)
1267 parexp.expression->visit(*this);
1270 void ProgramCompiler::ExpressionEvaluator::visit(VariableReference &var)
1272 if(!var.declaration)
1277 ValueMap::const_iterator i = variable_values->find(var.declaration);
1278 if(i!=variable_values->end())
1279 i->second->visit(*this);
1281 else if(var.declaration->init_expression)
1282 var.declaration->init_expression->visit(*this);
1285 void ProgramCompiler::ExpressionEvaluator::visit(UnaryExpression &unary)
1287 result_valid = false;
1288 unary.expression->visit(*this);
1295 result_valid = false;
1298 void ProgramCompiler::ExpressionEvaluator::visit(BinaryExpression &binary)
1300 result_valid = false;
1301 binary.left->visit(*this);
1305 float left_result = result;
1306 result_valid = false;
1307 binary.right->visit(*this);
1311 if(binary.oper=="<")
1312 result = (left_result<result);
1313 else if(binary.oper=="<=")
1314 result = (left_result<=result);
1315 else if(binary.oper==">")
1316 result = (left_result>result);
1317 else if(binary.oper==">=")
1318 result = (left_result>=result);
1319 else if(binary.oper=="==")
1320 result = (left_result==result);
1321 else if(binary.oper=="!=")
1322 result = (left_result!=result);
1323 else if(binary.oper=="&&")
1324 result = (left_result && result);
1325 else if(binary.oper=="||")
1326 result = (left_result || result);
1328 result_valid = false;
1332 ProgramCompiler::ConstantConditionEliminator::ConstantConditionEliminator():
1337 void ProgramCompiler::ConstantConditionEliminator::visit(Block &block)
1339 SetForScope<unsigned> set(scope_level, scope_level+1);
1340 BlockModifier::visit(block);
1342 for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
1343 variable_values.erase(i->second);
1346 void ProgramCompiler::ConstantConditionEliminator::visit(UnaryExpression &unary)
1348 if(VariableReference *var = dynamic_cast<VariableReference *>(unary.expression.get()))
1349 if(unary.oper=="++" || unary.oper=="--")
1350 variable_values.erase(var->declaration);
1353 void ProgramCompiler::ConstantConditionEliminator::visit(Assignment &assign)
1355 variable_values.erase(assign.target_declaration);
1358 void ProgramCompiler::ConstantConditionEliminator::visit(VariableDeclaration &var)
1360 if(var.constant || scope_level>1)
1361 variable_values[&var] = var.init_expression.get();
1364 void ProgramCompiler::ConstantConditionEliminator::visit(Conditional &cond)
1368 ExpressionEvaluator eval(variable_values);
1369 cond.condition->visit(eval);
1370 if(eval.result_valid)
1372 flatten_block(eval.result ? cond.body : cond.else_body);
1377 TraversingVisitor::visit(cond);
1380 void ProgramCompiler::ConstantConditionEliminator::visit(Iteration &iter)
1386 /* If the loop condition is always false on the first iteration, the
1387 entire loop can be removed */
1388 if(iter.init_statement)
1389 iter.init_statement->visit(*this);
1390 ExpressionEvaluator eval(variable_values);
1391 iter.condition->visit(eval);
1392 if(eval.result_valid && !eval.result)
1399 /* Record all assignments that occur inside the loop body so those
1400 variables won't be considered as constant */
1401 SetFlag set_record(record_only);
1402 TraversingVisitor::visit(iter);
1405 TraversingVisitor::visit(iter);
1407 if(VariableDeclaration *init_decl = dynamic_cast<VariableDeclaration *>(iter.init_statement.get()))
1408 variable_values.erase(init_decl);
1412 ProgramCompiler::UnusedVariableLocator::UnusedVariableLocator():
1415 assignment_target(false),
1419 void ProgramCompiler::UnusedVariableLocator::apply(Stage &s)
1421 variables.push_back(BlockVariableMap());
1423 BlockVariableMap &global_variables = variables.back();
1424 for(BlockVariableMap::iterator i=global_variables.begin(); i!=global_variables.end(); ++i)
1426 if(i->first->interface=="out" && (s.type==FRAGMENT || i->first->linked_declaration || !i->first->name.compare(0, 3, "gl_")))
1428 if(!i->second.referenced)
1430 unused_nodes.insert(i->first);
1431 clear_assignments(i->second, true);
1434 variables.pop_back();
1437 void ProgramCompiler::UnusedVariableLocator::visit(VariableReference &var)
1439 map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
1440 if(i!=aggregates.end())
1441 unused_nodes.erase(i->second);
1443 if(var.declaration && !assignment_target)
1445 VariableInfo &var_info = variables.back()[var.declaration];
1446 var_info.assignments.clear();
1447 var_info.referenced = true;
1451 void ProgramCompiler::UnusedVariableLocator::visit(MemberAccess &memacc)
1453 TraversingVisitor::visit(memacc);
1454 unused_nodes.erase(memacc.declaration);
1457 void ProgramCompiler::UnusedVariableLocator::visit(BinaryExpression &binary)
1459 if(binary.oper=="[")
1461 binary.left->visit(*this);
1462 SetForScope<bool> set(assignment_target, false);
1463 binary.right->visit(*this);
1466 TraversingVisitor::visit(binary);
1469 void ProgramCompiler::UnusedVariableLocator::visit(Assignment &assign)
1472 SetForScope<bool> set(assignment_target, !assign.self_referencing);
1473 assign.left->visit(*this);
1475 assign.right->visit(*this);
1476 assignment = &assign;
1479 void ProgramCompiler::UnusedVariableLocator::record_assignment(VariableDeclaration &var, Node &node, bool self_ref)
1481 VariableInfo &var_info = variables.back()[&var];
1483 clear_assignments(var_info, true);
1484 var_info.assignments.push_back(&node);
1485 var_info.conditionally_assigned = false;
1488 void ProgramCompiler::UnusedVariableLocator::clear_assignments(VariableInfo &var_info, bool mark_unused)
1492 for(vector<Node *>::iterator i=var_info.assignments.begin(); i!=var_info.assignments.end(); ++i)
1493 unused_nodes.insert(*i);
1495 var_info.assignments.clear();
1498 void ProgramCompiler::UnusedVariableLocator::visit(ExpressionStatement &expr)
1501 TraversingVisitor::visit(expr);
1502 if(assignment && assignment->target_declaration)
1503 record_assignment(*assignment->target_declaration, expr, assignment->self_referencing);
1506 void ProgramCompiler::UnusedVariableLocator::visit(StructDeclaration &strct)
1508 SetForScope<Node *> set(aggregate, &strct);
1509 unused_nodes.insert(&strct);
1510 TraversingVisitor::visit(strct);
1513 void ProgramCompiler::UnusedVariableLocator::visit(VariableDeclaration &var)
1516 aggregates[&var] = aggregate;
1519 variables.back()[&var].local = true;
1520 if(var.init_expression)
1521 record_assignment(var, *var.init_expression, false);
1523 unused_nodes.erase(var.type_declaration);
1524 TraversingVisitor::visit(var);
1527 void ProgramCompiler::UnusedVariableLocator::visit(InterfaceBlock &iface)
1529 SetForScope<Node *> set(aggregate, &iface);
1530 unused_nodes.insert(&iface);
1531 TraversingVisitor::visit(iface);
1534 void ProgramCompiler::UnusedVariableLocator::visit(FunctionDeclaration &func)
1536 variables.push_back(BlockVariableMap());
1539 SetForScope<bool> set(global_scope, false);
1540 for(vector<RefPtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1542 func.body.visit(*this);
1545 BlockVariableMap &block_variables = variables.back();
1546 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1547 i->second.conditionally_assigned = true;
1548 for(vector<RefPtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1549 block_variables[i->get()].referenced = true;
1550 merge_down_variables();
1553 void ProgramCompiler::UnusedVariableLocator::merge_down_variables()
1555 BlockVariableMap &parent_variables = variables[variables.size()-2];
1556 BlockVariableMap &block_variables = variables.back();
1557 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1561 if(!i->second.referenced)
1562 unused_nodes.insert(i->first);
1563 clear_assignments(i->second, true);
1567 BlockVariableMap::iterator j = parent_variables.find(i->first);
1568 if(j==parent_variables.end())
1569 parent_variables.insert(*i);
1572 if(i->second.referenced || !i->second.conditionally_assigned)
1573 clear_assignments(j->second, !i->second.referenced);
1574 j->second.conditionally_assigned = i->second.conditionally_assigned;
1575 j->second.referenced |= i->second.referenced;
1576 j->second.assignments.insert(j->second.assignments.end(), i->second.assignments.begin(), i->second.assignments.end());
1579 variables.pop_back();
1582 void ProgramCompiler::UnusedVariableLocator::visit(Conditional &cond)
1584 cond.condition->visit(*this);
1585 variables.push_back(BlockVariableMap());
1586 cond.body.visit(*this);
1588 BlockVariableMap if_variables;
1589 swap(variables.back(), if_variables);
1590 cond.else_body.visit(*this);
1592 BlockVariableMap &else_variables = variables.back();
1593 for(BlockVariableMap::iterator i=else_variables.begin(); i!=else_variables.end(); ++i)
1595 BlockVariableMap::iterator j = if_variables.find(i->first);
1596 if(j!=if_variables.end())
1598 i->second.assignments.insert(i->second.assignments.end(), j->second.assignments.begin(), j->second.assignments.end());
1599 i->second.conditionally_assigned |= j->second.conditionally_assigned;
1600 if_variables.erase(j);
1603 i->second.conditionally_assigned = true;
1606 for(BlockVariableMap::iterator i=if_variables.begin(); i!=if_variables.end(); ++i)
1608 i->second.conditionally_assigned = true;
1609 else_variables.insert(*i);
1612 merge_down_variables();
1615 void ProgramCompiler::UnusedVariableLocator::visit(Iteration &iter)
1617 variables.push_back(BlockVariableMap());
1618 TraversingVisitor::visit(iter);
1620 BlockVariableMap &block_variables = variables.back();
1621 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1622 if(!i->second.local && i->second.referenced)
1623 i->second.assignments.clear();
1625 merge_down_variables();
1629 ProgramCompiler::UnusedVariableLocator::VariableInfo::VariableInfo():
1631 conditionally_assigned(false),
1636 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionCall &call)
1638 TraversingVisitor::visit(call);
1640 unused_nodes.erase(call.declaration);
1641 if(call.declaration && call.declaration->definition!=call.declaration)
1642 used_definitions.insert(call.declaration->definition);
1645 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionDeclaration &func)
1647 TraversingVisitor::visit(func);
1649 if((func.name!="main" || func.body.body.empty()) && !used_definitions.count(&func))
1650 unused_nodes.insert(&func);
1654 ProgramCompiler::NodeRemover::NodeRemover(const set<Node *> &r):
1658 void ProgramCompiler::NodeRemover::visit(Block &block)
1660 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
1663 if(to_remove.count(i->get()))
1664 block.body.erase(i++);
1670 void ProgramCompiler::NodeRemover::visit(VariableDeclaration &var)
1672 if(to_remove.count(&var))
1674 stage->in_variables.erase(var.name);
1675 stage->out_variables.erase(var.name);
1676 stage->locations.erase(var.name);
1677 if(var.linked_declaration)
1678 var.linked_declaration->linked_declaration = 0;
1680 else if(var.init_expression && to_remove.count(var.init_expression.get()))
1681 var.init_expression = 0;
1684 void ProgramCompiler::NodeRemover::visit(Iteration &iter)
1686 if(to_remove.count(iter.init_statement.get()))
1687 iter.init_statement = 0;
1691 void ProgramCompiler::PrecisionRemover::visit(Precision &)
1696 void ProgramCompiler::PrecisionRemover::visit(VariableDeclaration &var)
1698 var.precision.clear();
1702 ProgramCompiler::DefaultPrecisionGenerator::DefaultPrecisionGenerator():
1706 void ProgramCompiler::DefaultPrecisionGenerator::visit(Block &block)
1710 SetForScope<bool> set(toplevel, false);
1711 BlockModifier::visit(block);
1714 Visitor::visit(block);
1717 void ProgramCompiler::DefaultPrecisionGenerator::visit(Precision &prec)
1719 have_default.insert(prec.type);
1722 void ProgramCompiler::DefaultPrecisionGenerator::visit(VariableDeclaration &var)
1724 if(var.type_declaration)
1727 string type = var.type;
1728 if(!type.compare(0, 3, "vec") || !type.compare(0, 3, "mat"))
1730 else if(!type.compare(0, 3, "ivec") || type=="uint")
1733 if(!have_default.count(type))
1735 Precision *prec = new Precision;
1736 if(!type.compare(0, 7, "sampler"))
1737 prec->precision = "lowp";
1738 else if(stage->type==FRAGMENT)
1739 prec->precision = "mediump";
1741 prec->precision = "highp";
1743 insert_nodes.push_back(prec);
1745 have_default.insert(type);
1750 ProgramCompiler::LegacyConverter::LegacyConverter():
1751 target_api(get_gl_api()),
1752 target_version(get_glsl_version()),
1756 ProgramCompiler::LegacyConverter::LegacyConverter(const Version &v):
1757 target_api(get_gl_api()),
1762 bool ProgramCompiler::LegacyConverter::check_version(const Version &feature_version) const
1764 if(target_version<feature_version)
1766 else if(stage->required_version<feature_version)
1767 stage->required_version = feature_version;
1772 bool ProgramCompiler::LegacyConverter::supports_unified_interface_syntax() const
1774 if(target_api==OPENGL_ES2)
1775 return check_version(Version(3, 0));
1777 return check_version(Version(1, 30));
1780 void ProgramCompiler::LegacyConverter::visit(VariableReference &var)
1782 if(var.declaration==frag_out && !supports_unified_interface_syntax())
1784 var.name = "gl_FragColor";
1785 var.declaration = 0;
1788 else if(var.declaration)
1789 type = var.declaration->type;
1794 void ProgramCompiler::LegacyConverter::visit(Assignment &assign)
1796 TraversingVisitor::visit(assign);
1797 if(assign.target_declaration==frag_out && !supports_unified_interface_syntax())
1798 assign.target_declaration = 0;
1801 bool ProgramCompiler::LegacyConverter::supports_unified_sampling_functions() const
1803 if(target_api==OPENGL_ES2)
1804 return check_version(Version(3, 0));
1806 return check_version(Version(1, 30));
1809 void ProgramCompiler::LegacyConverter::visit(FunctionCall &call)
1811 if(call.name=="texture" && !call.declaration && !supports_unified_sampling_functions())
1813 vector<RefPtr<Expression> >::iterator i = call.arguments.begin();
1814 if(i!=call.arguments.end())
1817 if(type=="sampler1D")
1818 call.name = "texture1D";
1819 else if(type=="sampler2D")
1820 call.name = "texture2D";
1821 else if(type=="sampler3D")
1822 call.name = "texture3D";
1823 else if(type=="sampler1DShadow")
1824 call.name = "shadow1D";
1825 else if(type=="sampler2DShadow")
1826 call.name = "shadow2D";
1828 for(; i!=call.arguments.end(); ++i)
1833 TraversingVisitor::visit(call);
1836 bool ProgramCompiler::LegacyConverter::supports_interface_layouts() const
1838 if(target_api==OPENGL_ES2)
1839 return check_version(Version(3, 0));
1841 return check_version(Version(3, 30));
1844 bool ProgramCompiler::LegacyConverter::supports_centroid_sampling() const
1846 if(target_api==OPENGL_ES2)
1847 return check_version(Version(3, 0));
1849 return check_version(Version(1, 20));
1852 bool ProgramCompiler::LegacyConverter::supports_sample_sampling() const
1854 if(target_api==OPENGL_ES2)
1855 return check_version(Version(3, 20));
1857 return check_version(Version(4, 0));
1860 void ProgramCompiler::LegacyConverter::visit(VariableDeclaration &var)
1862 if(var.layout && !supports_interface_layouts())
1864 vector<Layout::Qualifier>::iterator i;
1865 for(i=var.layout->qualifiers.begin(); (i!=var.layout->qualifiers.end() && i->identifier!="location"); ++i) ;
1866 if(i!=var.layout->qualifiers.end())
1868 unsigned location = lexical_cast<unsigned>(i->value);
1869 if(stage->type==VERTEX && var.interface=="in")
1871 stage->locations[var.name] = location;
1872 var.layout->qualifiers.erase(i);
1874 else if(stage->type==FRAGMENT && var.interface=="out")
1877 static Require _req(EXT_gpu_shader4);
1878 stage->locations[var.name] = location;
1879 var.layout->qualifiers.erase(i);
1882 if(var.layout->qualifiers.empty())
1887 if(var.sampling=="centroid")
1889 if(!supports_centroid_sampling())
1890 var.sampling = string();
1892 else if(var.sampling=="sample")
1894 if(!supports_sample_sampling())
1895 var.sampling = string();
1898 if((var.interface=="in" || var.interface=="out") && !supports_unified_interface_syntax())
1900 if(stage->type==FRAGMENT && var.interface=="out")
1907 TraversingVisitor::visit(var);
1910 bool ProgramCompiler::LegacyConverter::supports_interface_blocks(const string &iface) const
1912 if(target_api==OPENGL_ES2)
1914 if(iface=="uniform")
1915 return check_version(Version(3, 0));
1917 return check_version(Version(3, 20));
1920 return check_version(Version(1, 50));
1923 void ProgramCompiler::LegacyConverter::visit(InterfaceBlock &iface)
1925 if(!supports_interface_blocks(iface.interface))
1926 flatten_block(iface.members);