1 #include <msp/core/algorithm.h>
2 #include <msp/core/raii.h>
3 #include <msp/gl/extensions/arb_explicit_attrib_location.h>
4 #include <msp/gl/extensions/arb_gpu_shader5.h>
5 #include <msp/gl/extensions/arb_uniform_buffer_object.h>
6 #include <msp/gl/extensions/ext_gpu_shader4.h>
7 #include <msp/strings/format.h>
8 #include <msp/strings/utils.h>
11 #include "programcompiler.h"
12 #include "resources.h"
21 const char builtins_src[] =
22 "#pragma MSP stage(vertex)\n"
23 "out gl_PerVertex {\n"
24 " vec4 gl_Position;\n"
25 " float gl_ClipDistance[];\n"
27 "#pragma MSP stage(geometry)\n"
29 " vec4 gl_Position;\n"
30 " float gl_ClipDistance[];\n"
32 "out gl_PerVertex {\n"
33 " vec4 gl_Position;\n"
34 " float gl_ClipDistance[];\n"
42 using namespace ProgramSyntax;
44 ProgramCompiler::ProgramCompiler():
49 ProgramCompiler::~ProgramCompiler()
54 void ProgramCompiler::compile(const string &source, const string &src_name)
58 module = new Module();
60 imported_names.insert(src_name);
61 append_module(parser.parse(source, src_name));
65 void ProgramCompiler::compile(IO::Base &io, Resources *res, const string &src_name)
69 module = new Module();
71 imported_names.insert(src_name);
72 append_module(parser.parse(io, src_name));
76 void ProgramCompiler::compile(IO::Base &io, const string &src_name)
78 compile(io, 0, src_name);
81 void ProgramCompiler::add_shaders(Program &program)
84 throw invalid_operation("ProgramCompiler::add_shaders");
86 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
90 program.attach_shader_owned(new VertexShader(apply<Formatter>(*i)));
91 for(map<string, unsigned>::iterator j=i->locations.begin(); j!=i->locations.end(); ++j)
92 program.bind_attribute(j->second, j->first);
94 else if(i->type==GEOMETRY)
95 program.attach_shader_owned(new GeometryShader(apply<Formatter>(*i)));
96 else if(i->type==FRAGMENT)
98 program.attach_shader_owned(new FragmentShader(apply<Formatter>(*i)));
101 for(map<string, unsigned>::iterator j=i->locations.begin(); j!=i->locations.end(); ++j)
102 program.bind_fragment_data(j->second, j->first);
108 Module *ProgramCompiler::create_builtins_module()
110 ProgramParser parser;
111 Module *module = new Module(parser.parse(builtins_src, "<builtin>"));
112 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
114 VariableResolver resolver;
115 i->content.visit(resolver);
116 for(map<string, VariableDeclaration *>::iterator j=i->content.variables.begin(); j!=i->content.variables.end(); ++j)
117 j->second->linked_declaration = j->second;
122 Module &ProgramCompiler::get_builtins_module()
124 static RefPtr<Module> builtins_module = create_builtins_module();
125 return *builtins_module;
128 Stage *ProgramCompiler::get_builtins(StageType type)
130 Module &module = get_builtins_module();
131 for(list<Stage>::iterator i=module.stages.begin(); i!=module.stages.end(); ++i)
137 void ProgramCompiler::append_module(ProgramSyntax::Module &mod)
139 vector<Import *> imports = apply<NodeGatherer<Import> >(mod.shared);
140 for(vector<Import *>::iterator i=imports.begin(); i!=imports.end(); ++i)
141 import((*i)->module);
142 apply<NodeRemover>(mod.shared, set<Node *>(imports.begin(), imports.end()));
144 append_stage(mod.shared);
145 for(list<Stage>::iterator i=mod.stages.begin(); i!=mod.stages.end(); ++i)
149 void ProgramCompiler::append_stage(Stage &stage)
152 if(stage.type==SHARED)
153 target = &module->shared;
156 list<Stage>::iterator i;
157 for(i=module->stages.begin(); (i!=module->stages.end() && i->type<stage.type); ++i) ;
158 if(i==module->stages.end() || i->type>stage.type)
160 list<Stage>::iterator j = module->stages.insert(i, stage.type);
161 if(i!=module->stages.end())
164 if(i!=module->stages.begin())
171 for(NodeList<Statement>::iterator i=stage.content.body.begin(); i!=stage.content.body.end(); ++i)
172 target->content.body.push_back(*i);
173 apply<DeclarationCombiner>(*target);
176 void ProgramCompiler::process()
178 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
180 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); )
183 i = module->stages.begin();
187 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
191 void ProgramCompiler::import(const string &name)
193 string fn = name+".glsl";
194 if(imported_names.count(fn))
196 imported_names.insert(fn);
198 RefPtr<IO::Seekable> io = (resources ? resources->open_raw(fn) : Resources::get_builtins().open(fn));
200 throw runtime_error(format("module %s not found", name));
201 ProgramParser import_parser;
202 append_module(import_parser.parse(*io, fn));
205 void ProgramCompiler::generate(Stage &stage)
207 inject_block(stage.content, module->shared.content);
209 apply<DeclarationReorderer>(stage);
210 apply<FunctionResolver>(stage);
211 apply<VariableResolver>(stage);
212 apply<InterfaceGenerator>(stage);
213 apply<VariableResolver>(stage);
214 apply<DeclarationReorderer>(stage);
215 apply<FunctionResolver>(stage);
216 apply<LegacyConverter>(stage);
219 bool ProgramCompiler::optimize(Stage &stage)
221 apply<ConstantConditionEliminator>(stage);
223 set<FunctionDeclaration *> inlineable = apply<InlineableFunctionLocator>(stage);
224 apply<FunctionInliner>(stage, inlineable);
226 set<Node *> unused = apply<UnusedVariableLocator>(stage);
227 set<Node *> unused2 = apply<UnusedFunctionLocator>(stage);
228 unused.insert(unused2.begin(), unused2.end());
229 apply<NodeRemover>(stage, unused);
231 return !unused.empty();
234 void ProgramCompiler::finalize(Stage &stage)
236 if(get_gl_api()==OPENGL_ES2)
237 apply<DefaultPrecisionGenerator>(stage);
239 apply<PrecisionRemover>(stage);
242 void ProgramCompiler::inject_block(Block &target, const Block &source)
244 NodeList<Statement>::iterator insert_point = target.body.begin();
245 for(NodeList<Statement>::const_iterator i=source.body.begin(); i!=source.body.end(); ++i)
246 target.body.insert(insert_point, (*i)->clone());
250 typename T::ResultType ProgramCompiler::apply(Stage &stage)
253 visitor.apply(stage);
254 return visitor.get_result();
257 template<typename T, typename A>
258 typename T::ResultType ProgramCompiler::apply(Stage &stage, const A &arg)
261 visitor.apply(stage);
262 return visitor.get_result();
266 ProgramCompiler::Visitor::Visitor():
270 void ProgramCompiler::Visitor::apply(Stage &s)
272 SetForScope<Stage *> set(stage, &s);
273 stage->content.visit(*this);
277 ProgramCompiler::BlockModifier::BlockModifier():
281 void ProgramCompiler::BlockModifier::flatten_block(Block &block)
283 insert_nodes.insert(insert_nodes.end(), block.body.begin(), block.body.end());
287 void ProgramCompiler::BlockModifier::apply_and_increment(Block &block, NodeList<Statement>::iterator &i)
289 block.body.insert(i, insert_nodes.begin(), insert_nodes.end());
290 insert_nodes.clear();
293 block.body.erase(i++);
299 void ProgramCompiler::BlockModifier::visit(Block &block)
301 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
304 apply_and_increment(block, i);
309 ProgramCompiler::Formatter::Formatter():
311 parameter_list(false)
314 void ProgramCompiler::Formatter::apply(ProgramSyntax::Stage &s)
316 GLApi api = get_gl_api();
317 const Version &ver = s.required_version;
321 append(format("#version %d%02d", ver.major, ver.minor));
322 if(api==OPENGL_ES2 && ver>=Version(3, 0))
327 for(vector<const Extension *>::const_iterator i=s.required_extensions.begin(); i!=s.required_extensions.end(); ++i)
328 append(format("#extension %s: require\n", (*i)->get_name()));
329 if(!s.required_extensions.empty())
335 void ProgramCompiler::Formatter::append(const string &text)
340 void ProgramCompiler::Formatter::append(char c)
345 void ProgramCompiler::Formatter::visit(Literal &literal)
347 append(literal.token);
350 void ProgramCompiler::Formatter::visit(ParenthesizedExpression &parexpr)
353 parexpr.expression->visit(*this);
357 void ProgramCompiler::Formatter::visit(VariableReference &var)
362 void ProgramCompiler::Formatter::visit(MemberAccess &memacc)
364 memacc.left->visit(*this);
365 append(format(".%s", memacc.member));
368 void ProgramCompiler::Formatter::visit(UnaryExpression &unary)
372 unary.expression->visit(*this);
377 void ProgramCompiler::Formatter::visit(BinaryExpression &binary)
379 binary.left->visit(*this);
381 binary.right->visit(*this);
382 append(binary.after);
385 void ProgramCompiler::Formatter::visit(Assignment &assign)
387 assign.left->visit(*this);
388 append(format(" %s ", assign.oper));
389 assign.right->visit(*this);
392 void ProgramCompiler::Formatter::visit(FunctionCall &call)
394 append(format("%s(", call.name));
395 for(NodeArray<Expression>::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
397 if(i!=call.arguments.begin())
404 void ProgramCompiler::Formatter::visit(ExpressionStatement &expr)
406 expr.expression->visit(*this);
410 void ProgramCompiler::Formatter::visit(Block &block)
412 unsigned brace_indent = indent;
413 bool use_braces = (block.use_braces || (indent && block.body.size()!=1));
415 append(format("%s{\n", string(brace_indent*2, ' ')));
417 SetForScope<unsigned> set(indent, indent+(indent>0 || use_braces));
418 string spaces(indent*2, ' ');
419 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
421 if(i!=block.body.begin())
428 append(format("\n%s}", string(brace_indent*2, ' ')));
431 void ProgramCompiler::Formatter::visit(Import &import)
433 append(format("import %s;", import.module));
436 void ProgramCompiler::Formatter::visit(Precision &prec)
438 append(format("precision %s %s;", prec.precision, prec.type));
441 void ProgramCompiler::Formatter::visit(Layout &layout)
444 for(vector<Layout::Qualifier>::const_iterator i=layout.qualifiers.begin(); i!=layout.qualifiers.end(); ++i)
446 if(i!=layout.qualifiers.begin())
448 append(i->identifier);
449 if(!i->value.empty())
450 append(format("=%s", i->value));
455 void ProgramCompiler::Formatter::visit(InterfaceLayout &layout)
457 layout.layout.visit(*this);
458 append(format(" %s;", layout.interface));
461 void ProgramCompiler::Formatter::visit(StructDeclaration &strct)
463 append(format("struct %s\n", strct.name));
464 strct.members.visit(*this);
468 void ProgramCompiler::Formatter::visit(VariableDeclaration &var)
472 var.layout->visit(*this);
477 if(!var.interpolation.empty())
478 append(format("%s ", var.interpolation));
479 if(!var.sampling.empty())
480 append(format("%s ", var.sampling));
481 if(!var.interface.empty() && var.interface!=block_interface)
483 string interface = var.interface;
484 if(stage->required_version<Version(1, 30))
486 if(stage->type==VERTEX && var.interface=="in")
487 interface = "attribute";
488 else if((stage->type==VERTEX && var.interface=="out") || (stage->type==FRAGMENT && var.interface=="in"))
489 interface = "varying";
491 append(format("%s ", interface));
493 if(!var.precision.empty())
494 append(format("%s ", var.precision));
495 append(format("%s %s", var.type, var.name));
500 var.array_size->visit(*this);
503 if(var.init_expression)
506 var.init_expression->visit(*this);
512 void ProgramCompiler::Formatter::visit(InterfaceBlock &iface)
514 SetForScope<string> set(block_interface, iface.interface);
515 append(format("%s %s\n", iface.interface, iface.name));
516 iface.members.visit(*this);
520 void ProgramCompiler::Formatter::visit(FunctionDeclaration &func)
522 append(format("%s %s(", func.return_type, func.name));
523 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
525 if(i!=func.parameters.begin())
527 SetFlag set(parameter_list);
531 if(func.definition==&func)
534 func.body.visit(*this);
540 void ProgramCompiler::Formatter::visit(Conditional &cond)
543 cond.condition->visit(*this);
546 cond.body.visit(*this);
547 if(!cond.else_body.body.empty())
549 Conditional *else_cond = dynamic_cast<Conditional *>(cond.else_body.body.front().get());
550 if(cond.else_body.body.size()==1 && else_cond)
552 append(format("\n%selse ", string(indent*2, ' ')));
553 else_cond->visit(*this);
557 append(format("\n%selse\n", string(indent*2, ' ')));
558 cond.else_body.visit(*this);
563 void ProgramCompiler::Formatter::visit(Iteration &iter)
565 if(!iter.init_statement && iter.condition && !iter.loop_expression)
568 iter.condition->visit(*this);
574 if(iter.init_statement)
575 iter.init_statement->visit(*this);
581 iter.condition->visit(*this);
584 if(iter.loop_expression)
587 iter.loop_expression->visit(*this);
592 if(iter.body.body.empty())
597 iter.body.visit(*this);
601 void ProgramCompiler::Formatter::visit(Return &ret)
607 ret.expression->visit(*this);
612 void ProgramCompiler::Formatter::visit(Jump &jump)
614 append(jump.keyword);
619 ProgramCompiler::DeclarationCombiner::DeclarationCombiner():
623 void ProgramCompiler::DeclarationCombiner::visit(Block &block)
628 SetForScope<bool> set(toplevel, false);
629 BlockModifier::visit(block);
632 void ProgramCompiler::DeclarationCombiner::visit(FunctionDeclaration &func)
634 vector<FunctionDeclaration *> &decls = functions[func.name];
637 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
639 (*i)->definition = func.definition;
640 (*i)->body.body.clear();
643 decls.push_back(&func);
646 void ProgramCompiler::DeclarationCombiner::visit(VariableDeclaration &var)
648 VariableDeclaration *&ptr = variables[var.name];
651 ptr->type = var.type;
652 if(var.init_expression)
653 ptr->init_expression = var.init_expression;
658 for(vector<Layout::Qualifier>::iterator i=var.layout->qualifiers.begin(); i!=var.layout->qualifiers.end(); ++i)
661 for(vector<Layout::Qualifier>::iterator j=ptr->layout->qualifiers.begin(); (!found && j!=ptr->layout->qualifiers.end()); ++j)
662 if(j->identifier==i->identifier)
669 ptr->layout->qualifiers.push_back(*i);
673 ptr->layout = var.layout;
682 ProgramCompiler::VariableResolver::VariableResolver():
684 record_target(false),
685 assignment_target(0),
686 self_referencing(false)
689 void ProgramCompiler::VariableResolver::apply(Stage &s)
691 SetForScope<Stage *> set(stage, &s);
692 Stage *builtins = get_builtins(stage->type);
694 blocks.push_back(&builtins->content);
695 stage->content.visit(*this);
700 void ProgramCompiler::VariableResolver::visit(Block &block)
702 blocks.push_back(&block);
703 block.variables.clear();
704 TraversingVisitor::visit(block);
708 void ProgramCompiler::VariableResolver::visit(VariableReference &var)
712 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
715 map<string, VariableDeclaration *>::iterator j = (*i)->variables.find(var.name);
716 if(j!=(*i)->variables.end())
718 var.declaration = j->second;
719 type = j->second->type_declaration;
726 if(assignment_target)
728 record_target = false;
729 assignment_target = 0;
732 assignment_target = var.declaration;
734 else if(var.declaration && var.declaration==assignment_target)
735 self_referencing = true;
738 void ProgramCompiler::VariableResolver::visit(MemberAccess &memacc)
741 TraversingVisitor::visit(memacc);
742 memacc.declaration = 0;
745 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
746 if(i!=type->members.variables.end())
748 memacc.declaration = i->second;
749 type = i->second->type_declaration;
756 void ProgramCompiler::VariableResolver::visit(BinaryExpression &binary)
761 SetForScope<bool> set(record_target, false);
762 binary.right->visit(*this);
765 binary.left->visit(*this);
769 TraversingVisitor::visit(binary);
774 void ProgramCompiler::VariableResolver::visit(Assignment &assign)
777 SetFlag set(record_target);
778 assignment_target = 0;
779 assign.left->visit(*this);
782 self_referencing = false;
783 assign.right->visit(*this);
785 assign.self_referencing = (self_referencing || assign.oper!="=");
786 assign.target_declaration = assignment_target;
789 void ProgramCompiler::VariableResolver::visit(StructDeclaration &strct)
791 TraversingVisitor::visit(strct);
792 blocks.back()->types[strct.name] = &strct;
795 void ProgramCompiler::VariableResolver::visit(VariableDeclaration &var)
797 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
800 map<string, StructDeclaration *>::iterator j = (*i)->types.find(var.type);
801 if(j!=(*i)->types.end())
802 var.type_declaration = j->second;
805 if(!block_interface.empty() && var.interface.empty())
806 var.interface = block_interface;
808 TraversingVisitor::visit(var);
809 blocks.back()->variables[var.name] = &var;
810 if(anonymous && blocks.size()>1)
811 blocks[blocks.size()-2]->variables[var.name] = &var;
814 void ProgramCompiler::VariableResolver::visit(InterfaceBlock &iface)
816 SetFlag set(anonymous);
817 SetForScope<string> set2(block_interface, iface.interface);
818 TraversingVisitor::visit(iface);
822 void ProgramCompiler::FunctionResolver::visit(FunctionCall &call)
824 map<string, vector<FunctionDeclaration *> >::iterator i = functions.find(call.name);
825 if(i!=functions.end())
826 call.declaration = i->second.back();
828 TraversingVisitor::visit(call);
831 void ProgramCompiler::FunctionResolver::visit(FunctionDeclaration &func)
833 vector<FunctionDeclaration *> &decls = functions[func.name];
836 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
837 (*i)->definition = func.definition;
839 decls.push_back(&func);
841 else if(!decls.empty() && decls.back()->definition)
842 func.definition = decls.back()->definition;
844 decls.push_back(&func);
846 TraversingVisitor::visit(func);
850 ProgramCompiler::InterfaceGenerator::InterfaceGenerator():
854 string ProgramCompiler::InterfaceGenerator::get_out_prefix(StageType type)
858 else if(type==GEOMETRY)
864 void ProgramCompiler::InterfaceGenerator::apply(Stage &s)
866 SetForScope<Stage *> set(stage, &s);
868 in_prefix = get_out_prefix(stage->previous->type);
869 out_prefix = get_out_prefix(stage->type);
870 stage->content.visit(*this);
873 void ProgramCompiler::InterfaceGenerator::visit(Block &block)
875 SetForScope<unsigned> set(scope_level, scope_level+1);
876 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
882 for(map<string, RefPtr<VariableDeclaration> >::iterator j=iface_declarations.begin(); j!=iface_declarations.end(); ++j)
884 NodeList<Statement>::iterator k = block.body.insert(i, j->second);
887 iface_declarations.clear();
890 apply_and_increment(block, i);
894 string ProgramCompiler::InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
896 unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
897 return prefix+name.substr(offset);
900 bool ProgramCompiler::InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
902 const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
903 if(stage_vars.count(name) || iface_declarations.count(name))
906 VariableDeclaration* iface_var = new VariableDeclaration;
907 iface_var->sampling = var.sampling;
908 iface_var->interface = iface;
909 iface_var->type = var.type;
910 iface_var->type_declaration = var.type_declaration;
911 iface_var->name = name;
912 if(stage->type==GEOMETRY)
913 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
915 iface_var->array = var.array;
917 iface_var->array_size = var.array_size;
919 iface_var->linked_declaration = &var;
920 iface_declarations[name] = iface_var;
925 void ProgramCompiler::InterfaceGenerator::insert_assignment(const string &left, ProgramSyntax::Expression *right)
927 Assignment *assign = new Assignment;
928 VariableReference *ref = new VariableReference;
932 assign->right = right;
934 ExpressionStatement *stmt = new ExpressionStatement;
935 stmt->expression = assign;
937 insert_nodes.push_back(stmt);
940 void ProgramCompiler::InterfaceGenerator::visit(VariableReference &var)
942 if(var.declaration || !stage->previous)
944 if(iface_declarations.count(var.name))
947 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
948 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
949 if(i==prev_out.end())
950 i = prev_out.find(in_prefix+var.name);
951 if(i!=prev_out.end())
953 generate_interface(*i->second, "in", i->second->name);
954 var.name = i->second->name;
958 void ProgramCompiler::InterfaceGenerator::visit(VariableDeclaration &var)
960 if(var.interface=="out")
963 stage->out_variables[var.name] = &var;
964 else if(generate_interface(var, "out", change_prefix(var.name, string())))
967 if(var.init_expression)
969 insert_assignment(var.name, var.init_expression->clone());
974 else if(var.interface=="in")
976 stage->in_variables[var.name] = &var;
977 if(var.linked_declaration)
978 var.linked_declaration->linked_declaration = &var;
979 else if(stage->previous)
981 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
982 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
983 if(i!=prev_out.end())
985 var.linked_declaration = i->second;
986 i->second->linked_declaration = &var;
991 TraversingVisitor::visit(var);
994 void ProgramCompiler::InterfaceGenerator::visit(Passthrough &pass)
996 vector<VariableDeclaration *> pass_vars;
998 for(map<string, VariableDeclaration *>::const_iterator i=stage->in_variables.begin(); i!=stage->in_variables.end(); ++i)
999 pass_vars.push_back(i->second);
1000 for(map<string, RefPtr<VariableDeclaration> >::const_iterator i=iface_declarations.begin(); i!=iface_declarations.end(); ++i)
1001 if(i->second->interface=="in")
1002 pass_vars.push_back(i->second.get());
1006 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
1007 for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
1009 bool linked = false;
1010 for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
1011 linked = ((*j)->linked_declaration==i->second);
1013 if(!linked && generate_interface(*i->second, "in", i->second->name))
1014 pass_vars.push_back(i->second);
1018 if(stage->type==GEOMETRY)
1020 VariableReference *ref = new VariableReference;
1021 ref->name = "gl_in";
1023 BinaryExpression *subscript = new BinaryExpression;
1024 subscript->left = ref;
1025 subscript->oper = "[";
1026 subscript->right = pass.subscript;
1027 subscript->after = "]";
1029 MemberAccess *memacc = new MemberAccess;
1030 memacc->left = subscript;
1031 memacc->member = "gl_Position";
1033 insert_assignment("gl_Position", memacc);
1036 for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
1038 string out_name = change_prefix((*i)->name, out_prefix);
1039 generate_interface(**i, "out", out_name);
1041 VariableReference *ref = new VariableReference;
1042 ref->name = (*i)->name;
1045 BinaryExpression *subscript = new BinaryExpression;
1046 subscript->left = ref;
1047 subscript->oper = "[";
1048 subscript->right = pass.subscript;
1049 subscript->after = "]";
1050 insert_assignment(out_name, subscript);
1053 insert_assignment(out_name, ref);
1060 ProgramCompiler::DeclarationReorderer::DeclarationReorderer():
1062 kind(NO_DECLARATION)
1065 void ProgramCompiler::DeclarationReorderer::visit(FunctionCall &call)
1067 FunctionDeclaration *def = call.declaration;
1069 def = def->definition;
1070 if(def && !ordered_funcs.count(def))
1071 needed_funcs.insert(def);
1074 void ProgramCompiler::DeclarationReorderer::visit(Block &block)
1076 SetForScope<unsigned> set(scope_level, scope_level+1);
1078 return Visitor::visit(block);
1080 NodeList<Statement>::iterator struct_insert_point = block.body.end();
1081 NodeList<Statement>::iterator variable_insert_point = block.body.end();
1082 NodeList<Statement>::iterator function_insert_point = block.body.end();
1083 unsigned unordered_func_count = 0;
1084 bool ordered_any_funcs = false;
1086 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
1088 kind = NO_DECLARATION;
1092 if(kind==STRUCT && struct_insert_point!=block.body.end())
1094 block.body.insert(struct_insert_point, *i);
1097 else if(kind>STRUCT && struct_insert_point==block.body.end())
1098 struct_insert_point = i;
1100 if(kind==VARIABLE && variable_insert_point!=block.body.end())
1102 block.body.insert(variable_insert_point, *i);
1105 else if(kind>VARIABLE && variable_insert_point==block.body.end())
1106 variable_insert_point = i;
1110 if(function_insert_point==block.body.end())
1111 function_insert_point = i;
1113 if(needed_funcs.empty())
1115 ordered_funcs.insert(i->get());
1116 if(i!=function_insert_point)
1118 block.body.insert(function_insert_point, *i);
1122 ++function_insert_point;
1123 ordered_any_funcs = true;
1126 ++unordered_func_count;
1131 if(function_insert_point==i)
1132 ++function_insert_point;
1133 block.body.erase(i++);
1138 if(i==block.body.end() && unordered_func_count)
1140 if(!ordered_any_funcs)
1141 // A subset of the remaining functions forms a recursive loop
1142 /* TODO pick a function and move it up, adding any necessary
1146 i = function_insert_point;
1147 unordered_func_count = 0;
1152 void ProgramCompiler::DeclarationReorderer::visit(ProgramSyntax::VariableDeclaration &var)
1154 Visitor::visit(var);
1158 void ProgramCompiler::DeclarationReorderer::visit(FunctionDeclaration &func)
1160 needed_funcs.clear();
1161 func.body.visit(*this);
1162 needed_funcs.erase(&func);
1167 ProgramCompiler::InlineableFunctionLocator::InlineableFunctionLocator():
1171 void ProgramCompiler::InlineableFunctionLocator::visit(FunctionCall &call)
1173 FunctionDeclaration *def = call.declaration;
1174 if(def && def->definition!=def)
1175 def = def->definition;
1179 unsigned &count = refcounts[def];
1181 if(count>1 || def==in_function)
1182 inlineable.erase(def);
1185 TraversingVisitor::visit(call);
1188 void ProgramCompiler::InlineableFunctionLocator::visit(FunctionDeclaration &func)
1190 unsigned &count = refcounts[func.definition];
1191 if(!count && func.parameters.empty())
1192 inlineable.insert(func.definition);
1194 SetForScope<FunctionDeclaration *> set(in_function, &func);
1195 TraversingVisitor::visit(func);
1199 ProgramCompiler::FunctionInliner::FunctionInliner():
1203 ProgramCompiler::FunctionInliner::FunctionInliner(const set<FunctionDeclaration *> &in):
1208 void ProgramCompiler::FunctionInliner::visit_and_inline(RefPtr<Expression> &ptr)
1213 ptr = inline_result;
1216 void ProgramCompiler::FunctionInliner::visit(Block &block)
1221 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
1229 void ProgramCompiler::FunctionInliner::visit(UnaryExpression &unary)
1231 visit_and_inline(unary.expression);
1235 void ProgramCompiler::FunctionInliner::visit(BinaryExpression &binary)
1237 visit_and_inline(binary.left);
1238 visit_and_inline(binary.right);
1242 void ProgramCompiler::FunctionInliner::visit(MemberAccess &memacc)
1244 visit_and_inline(memacc.left);
1248 void ProgramCompiler::FunctionInliner::visit(FunctionCall &call)
1250 for(NodeArray<Expression>::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
1251 visit_and_inline(*i);
1253 FunctionDeclaration *def = call.declaration;
1254 if(def && def->definition!=def)
1255 def = def->definition;
1257 if(def && inlineable.count(def))
1266 void ProgramCompiler::FunctionInliner::visit(VariableDeclaration &var)
1268 if(var.init_expression)
1269 visit_and_inline(var.init_expression);
1273 void ProgramCompiler::FunctionInliner::visit(Return &ret)
1275 TraversingVisitor::visit(ret);
1278 inline_result = ret.expression->clone();
1282 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator():
1288 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator(const ValueMap &v):
1289 variable_values(&v),
1294 void ProgramCompiler::ExpressionEvaluator::visit(Literal &literal)
1296 if(literal.token=="true")
1298 else if(literal.token=="false")
1301 result = lexical_cast<float>(literal.token);
1302 result_valid = true;
1305 void ProgramCompiler::ExpressionEvaluator::visit(ParenthesizedExpression &parexp)
1307 parexp.expression->visit(*this);
1310 void ProgramCompiler::ExpressionEvaluator::visit(VariableReference &var)
1312 if(!var.declaration)
1317 ValueMap::const_iterator i = variable_values->find(var.declaration);
1318 if(i!=variable_values->end())
1319 i->second->visit(*this);
1321 else if(var.declaration->init_expression)
1322 var.declaration->init_expression->visit(*this);
1325 void ProgramCompiler::ExpressionEvaluator::visit(UnaryExpression &unary)
1327 result_valid = false;
1328 unary.expression->visit(*this);
1335 result_valid = false;
1338 void ProgramCompiler::ExpressionEvaluator::visit(BinaryExpression &binary)
1340 result_valid = false;
1341 binary.left->visit(*this);
1345 float left_result = result;
1346 result_valid = false;
1347 binary.right->visit(*this);
1351 if(binary.oper=="<")
1352 result = (left_result<result);
1353 else if(binary.oper=="<=")
1354 result = (left_result<=result);
1355 else if(binary.oper==">")
1356 result = (left_result>result);
1357 else if(binary.oper==">=")
1358 result = (left_result>=result);
1359 else if(binary.oper=="==")
1360 result = (left_result==result);
1361 else if(binary.oper=="!=")
1362 result = (left_result!=result);
1363 else if(binary.oper=="&&")
1364 result = (left_result && result);
1365 else if(binary.oper=="||")
1366 result = (left_result || result);
1368 result_valid = false;
1372 ProgramCompiler::ConstantConditionEliminator::ConstantConditionEliminator():
1377 void ProgramCompiler::ConstantConditionEliminator::visit(Block &block)
1379 SetForScope<unsigned> set(scope_level, scope_level+1);
1380 BlockModifier::visit(block);
1382 for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
1383 variable_values.erase(i->second);
1386 void ProgramCompiler::ConstantConditionEliminator::visit(UnaryExpression &unary)
1388 if(VariableReference *var = dynamic_cast<VariableReference *>(unary.expression.get()))
1389 if(unary.oper=="++" || unary.oper=="--")
1390 variable_values.erase(var->declaration);
1393 void ProgramCompiler::ConstantConditionEliminator::visit(Assignment &assign)
1395 variable_values.erase(assign.target_declaration);
1398 void ProgramCompiler::ConstantConditionEliminator::visit(VariableDeclaration &var)
1400 if(var.constant || scope_level>1)
1401 variable_values[&var] = var.init_expression.get();
1404 void ProgramCompiler::ConstantConditionEliminator::visit(Conditional &cond)
1408 ExpressionEvaluator eval(variable_values);
1409 cond.condition->visit(eval);
1410 if(eval.result_valid)
1412 flatten_block(eval.result ? cond.body : cond.else_body);
1417 TraversingVisitor::visit(cond);
1420 void ProgramCompiler::ConstantConditionEliminator::visit(Iteration &iter)
1426 /* If the loop condition is always false on the first iteration, the
1427 entire loop can be removed */
1428 if(iter.init_statement)
1429 iter.init_statement->visit(*this);
1430 ExpressionEvaluator eval(variable_values);
1431 iter.condition->visit(eval);
1432 if(eval.result_valid && !eval.result)
1439 /* Record all assignments that occur inside the loop body so those
1440 variables won't be considered as constant */
1441 SetFlag set_record(record_only);
1442 TraversingVisitor::visit(iter);
1445 TraversingVisitor::visit(iter);
1447 if(VariableDeclaration *init_decl = dynamic_cast<VariableDeclaration *>(iter.init_statement.get()))
1448 variable_values.erase(init_decl);
1452 ProgramCompiler::UnusedVariableLocator::UnusedVariableLocator():
1455 assignment_target(false),
1456 assign_to_subscript(false),
1460 void ProgramCompiler::UnusedVariableLocator::apply(Stage &s)
1462 variables.push_back(BlockVariableMap());
1464 BlockVariableMap &global_variables = variables.back();
1465 for(BlockVariableMap::iterator i=global_variables.begin(); i!=global_variables.end(); ++i)
1467 if(i->first->interface=="out" && (s.type==FRAGMENT || i->first->linked_declaration || !i->first->name.compare(0, 3, "gl_")))
1469 if(!i->second.referenced)
1471 unused_nodes.insert(i->first);
1472 clear_assignments(i->second, true);
1475 variables.pop_back();
1478 void ProgramCompiler::UnusedVariableLocator::visit(VariableReference &var)
1480 map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
1481 if(i!=aggregates.end())
1482 unused_nodes.erase(i->second);
1484 if(var.declaration && !assignment_target)
1486 VariableInfo &var_info = variables.back()[var.declaration];
1487 var_info.assignments.clear();
1488 var_info.referenced = true;
1492 void ProgramCompiler::UnusedVariableLocator::visit(MemberAccess &memacc)
1494 TraversingVisitor::visit(memacc);
1495 unused_nodes.erase(memacc.declaration);
1498 void ProgramCompiler::UnusedVariableLocator::visit(BinaryExpression &binary)
1500 if(binary.oper=="[")
1502 if(assignment_target)
1503 assign_to_subscript = true;
1504 binary.left->visit(*this);
1505 SetForScope<bool> set(assignment_target, false);
1506 binary.right->visit(*this);
1509 TraversingVisitor::visit(binary);
1512 void ProgramCompiler::UnusedVariableLocator::visit(Assignment &assign)
1515 assign_to_subscript = false;
1516 SetForScope<bool> set(assignment_target, !assign.self_referencing);
1517 assign.left->visit(*this);
1519 assign.right->visit(*this);
1520 assignment = &assign;
1523 void ProgramCompiler::UnusedVariableLocator::record_assignment(VariableDeclaration &var, Node &node, bool chained)
1525 VariableInfo &var_info = variables.back()[&var];
1527 clear_assignments(var_info, true);
1528 var_info.assignments.push_back(&node);
1529 var_info.conditionally_assigned = false;
1532 void ProgramCompiler::UnusedVariableLocator::clear_assignments(VariableInfo &var_info, bool mark_unused)
1536 for(vector<Node *>::iterator i=var_info.assignments.begin(); i!=var_info.assignments.end(); ++i)
1537 unused_nodes.insert(*i);
1539 var_info.assignments.clear();
1542 void ProgramCompiler::UnusedVariableLocator::visit(ExpressionStatement &expr)
1545 TraversingVisitor::visit(expr);
1546 if(assignment && assignment->target_declaration)
1547 record_assignment(*assignment->target_declaration, expr, (assignment->self_referencing || assign_to_subscript));
1550 void ProgramCompiler::UnusedVariableLocator::visit(StructDeclaration &strct)
1552 SetForScope<Node *> set(aggregate, &strct);
1553 unused_nodes.insert(&strct);
1554 TraversingVisitor::visit(strct);
1557 void ProgramCompiler::UnusedVariableLocator::visit(VariableDeclaration &var)
1560 aggregates[&var] = aggregate;
1563 variables.back()[&var].local = true;
1564 if(var.init_expression)
1565 record_assignment(var, *var.init_expression, false);
1567 unused_nodes.erase(var.type_declaration);
1568 TraversingVisitor::visit(var);
1571 void ProgramCompiler::UnusedVariableLocator::visit(InterfaceBlock &iface)
1573 SetForScope<Node *> set(aggregate, &iface);
1574 unused_nodes.insert(&iface);
1575 TraversingVisitor::visit(iface);
1578 void ProgramCompiler::UnusedVariableLocator::visit(FunctionDeclaration &func)
1580 variables.push_back(BlockVariableMap());
1583 SetForScope<bool> set(global_scope, false);
1584 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1586 func.body.visit(*this);
1589 BlockVariableMap &block_variables = variables.back();
1590 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1591 i->second.conditionally_assigned = true;
1592 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1593 block_variables[i->get()].referenced = true;
1594 merge_down_variables();
1597 void ProgramCompiler::UnusedVariableLocator::merge_down_variables()
1599 BlockVariableMap &parent_variables = variables[variables.size()-2];
1600 BlockVariableMap &block_variables = variables.back();
1601 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1605 if(!i->second.referenced)
1606 unused_nodes.insert(i->first);
1607 clear_assignments(i->second, true);
1611 BlockVariableMap::iterator j = parent_variables.find(i->first);
1612 if(j==parent_variables.end())
1613 parent_variables.insert(*i);
1616 if(i->second.referenced || !i->second.conditionally_assigned)
1617 clear_assignments(j->second, !i->second.referenced);
1618 j->second.conditionally_assigned = i->second.conditionally_assigned;
1619 j->second.referenced |= i->second.referenced;
1620 j->second.assignments.insert(j->second.assignments.end(), i->second.assignments.begin(), i->second.assignments.end());
1623 variables.pop_back();
1626 void ProgramCompiler::UnusedVariableLocator::visit(Conditional &cond)
1628 cond.condition->visit(*this);
1629 variables.push_back(BlockVariableMap());
1630 cond.body.visit(*this);
1632 BlockVariableMap if_variables;
1633 swap(variables.back(), if_variables);
1634 cond.else_body.visit(*this);
1636 BlockVariableMap &else_variables = variables.back();
1637 for(BlockVariableMap::iterator i=else_variables.begin(); i!=else_variables.end(); ++i)
1639 BlockVariableMap::iterator j = if_variables.find(i->first);
1640 if(j!=if_variables.end())
1642 i->second.assignments.insert(i->second.assignments.end(), j->second.assignments.begin(), j->second.assignments.end());
1643 i->second.conditionally_assigned |= j->second.conditionally_assigned;
1644 if_variables.erase(j);
1647 i->second.conditionally_assigned = true;
1650 for(BlockVariableMap::iterator i=if_variables.begin(); i!=if_variables.end(); ++i)
1652 i->second.conditionally_assigned = true;
1653 else_variables.insert(*i);
1656 merge_down_variables();
1659 void ProgramCompiler::UnusedVariableLocator::visit(Iteration &iter)
1661 variables.push_back(BlockVariableMap());
1662 TraversingVisitor::visit(iter);
1664 BlockVariableMap &block_variables = variables.back();
1665 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1666 if(!i->second.local && i->second.referenced)
1667 i->second.assignments.clear();
1669 merge_down_variables();
1673 ProgramCompiler::UnusedVariableLocator::VariableInfo::VariableInfo():
1675 conditionally_assigned(false),
1680 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionCall &call)
1682 TraversingVisitor::visit(call);
1684 unused_nodes.erase(call.declaration);
1685 if(call.declaration && call.declaration->definition!=call.declaration)
1686 used_definitions.insert(call.declaration->definition);
1689 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionDeclaration &func)
1691 TraversingVisitor::visit(func);
1693 if((func.name!="main" || func.body.body.empty()) && !used_definitions.count(&func))
1694 unused_nodes.insert(&func);
1698 ProgramCompiler::NodeRemover::NodeRemover(const set<Node *> &r):
1702 void ProgramCompiler::NodeRemover::visit(Block &block)
1704 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
1707 if(to_remove.count(i->get()))
1708 block.body.erase(i++);
1714 void ProgramCompiler::NodeRemover::visit(VariableDeclaration &var)
1716 if(to_remove.count(&var))
1718 stage->in_variables.erase(var.name);
1719 stage->out_variables.erase(var.name);
1720 stage->locations.erase(var.name);
1721 if(var.linked_declaration)
1722 var.linked_declaration->linked_declaration = 0;
1724 else if(var.init_expression && to_remove.count(var.init_expression.get()))
1725 var.init_expression = 0;
1728 void ProgramCompiler::NodeRemover::visit(Iteration &iter)
1730 if(to_remove.count(iter.init_statement.get()))
1731 iter.init_statement = 0;
1732 TraversingVisitor::visit(iter);
1736 void ProgramCompiler::PrecisionRemover::visit(Precision &)
1741 void ProgramCompiler::PrecisionRemover::visit(VariableDeclaration &var)
1743 var.precision.clear();
1747 ProgramCompiler::DefaultPrecisionGenerator::DefaultPrecisionGenerator():
1751 void ProgramCompiler::DefaultPrecisionGenerator::visit(Block &block)
1755 SetForScope<bool> set(toplevel, false);
1756 BlockModifier::visit(block);
1759 Visitor::visit(block);
1762 void ProgramCompiler::DefaultPrecisionGenerator::visit(Precision &prec)
1764 have_default.insert(prec.type);
1767 void ProgramCompiler::DefaultPrecisionGenerator::visit(VariableDeclaration &var)
1769 if(var.type_declaration)
1772 string type = var.type;
1773 if(!type.compare(0, 3, "vec") || !type.compare(0, 3, "mat"))
1775 else if(!type.compare(0, 3, "ivec") || type=="uint")
1778 if(!have_default.count(type))
1780 Precision *prec = new Precision;
1781 if(!type.compare(0, 7, "sampler"))
1782 prec->precision = "lowp";
1783 else if(stage->type==FRAGMENT)
1784 prec->precision = "mediump";
1786 prec->precision = "highp";
1788 insert_nodes.push_back(prec);
1790 have_default.insert(type);
1795 ProgramCompiler::LegacyConverter::LegacyConverter():
1796 target_api(get_gl_api()),
1797 target_version(get_glsl_version()),
1801 ProgramCompiler::LegacyConverter::LegacyConverter(const Version &v):
1802 target_api(get_gl_api()),
1807 bool ProgramCompiler::LegacyConverter::check_version(const Version &feature_version) const
1809 if(target_version<feature_version)
1811 else if(stage->required_version<feature_version)
1812 stage->required_version = feature_version;
1817 bool ProgramCompiler::LegacyConverter::check_extension(const Extension &extension) const
1822 vector<const Extension *>::iterator i = find(stage->required_extensions, &extension);
1823 if(i==stage->required_extensions.end())
1824 stage->required_extensions.push_back(&extension);
1829 bool ProgramCompiler::LegacyConverter::supports_unified_interface_syntax() const
1831 if(target_api==OPENGL_ES2)
1832 return check_version(Version(3, 0));
1834 return check_version(Version(1, 30));
1837 void ProgramCompiler::LegacyConverter::visit(VariableReference &var)
1839 if(var.declaration==frag_out && !supports_unified_interface_syntax())
1841 var.name = "gl_FragColor";
1842 var.declaration = 0;
1845 else if(var.declaration)
1846 type = var.declaration->type;
1851 void ProgramCompiler::LegacyConverter::visit(Assignment &assign)
1853 TraversingVisitor::visit(assign);
1854 if(assign.target_declaration==frag_out && !supports_unified_interface_syntax())
1855 assign.target_declaration = 0;
1858 bool ProgramCompiler::LegacyConverter::supports_unified_sampling_functions() const
1860 if(target_api==OPENGL_ES2)
1861 return check_version(Version(3, 0));
1863 return check_version(Version(1, 30));
1866 void ProgramCompiler::LegacyConverter::visit(FunctionCall &call)
1868 if(call.name=="texture" && !call.declaration && !supports_unified_sampling_functions())
1870 NodeArray<Expression>::iterator i = call.arguments.begin();
1871 if(i!=call.arguments.end())
1874 if(type=="sampler1D")
1875 call.name = "texture1D";
1876 else if(type=="sampler2D")
1877 call.name = "texture2D";
1878 else if(type=="sampler3D")
1879 call.name = "texture3D";
1880 else if(type=="sampler1DShadow")
1881 call.name = "shadow1D";
1882 else if(type=="sampler2DShadow")
1883 call.name = "shadow2D";
1885 for(; i!=call.arguments.end(); ++i)
1890 TraversingVisitor::visit(call);
1893 bool ProgramCompiler::LegacyConverter::supports_interface_layouts() const
1895 if(target_api==OPENGL_ES2)
1896 return check_version(Version(3, 0));
1897 else if(check_version(Version(3, 30)))
1900 return check_extension(ARB_explicit_attrib_location);
1903 bool ProgramCompiler::LegacyConverter::supports_centroid_sampling() const
1905 if(target_api==OPENGL_ES2)
1906 return check_version(Version(3, 0));
1907 else if(check_version(Version(1, 20)))
1910 return check_extension(EXT_gpu_shader4);
1913 bool ProgramCompiler::LegacyConverter::supports_sample_sampling() const
1915 if(target_api==OPENGL_ES2)
1916 return check_version(Version(3, 20));
1917 else if(check_version(Version(4, 0)))
1920 return check_extension(ARB_gpu_shader5);
1923 void ProgramCompiler::LegacyConverter::visit(VariableDeclaration &var)
1925 if(var.layout && !supports_interface_layouts())
1927 vector<Layout::Qualifier>::iterator i;
1928 for(i=var.layout->qualifiers.begin(); (i!=var.layout->qualifiers.end() && i->identifier!="location"); ++i) ;
1929 if(i!=var.layout->qualifiers.end())
1931 unsigned location = lexical_cast<unsigned>(i->value);
1932 if(stage->type==VERTEX && var.interface=="in")
1934 stage->locations[var.name] = location;
1935 var.layout->qualifiers.erase(i);
1937 else if(stage->type==FRAGMENT && var.interface=="out")
1940 static Require _req(EXT_gpu_shader4);
1941 stage->locations[var.name] = location;
1942 var.layout->qualifiers.erase(i);
1945 if(var.layout->qualifiers.empty())
1950 if(var.sampling=="centroid")
1952 if(!supports_centroid_sampling())
1953 var.sampling = string();
1955 else if(var.sampling=="sample")
1957 if(!supports_sample_sampling())
1958 var.sampling = string();
1961 if((var.interface=="in" || var.interface=="out") && !supports_unified_interface_syntax())
1963 if(stage->type==FRAGMENT && var.interface=="out")
1970 TraversingVisitor::visit(var);
1973 bool ProgramCompiler::LegacyConverter::supports_interface_blocks(const string &iface) const
1975 if(target_api==OPENGL_ES2)
1977 if(iface=="uniform")
1978 return check_version(Version(3, 0));
1980 return check_version(Version(3, 20));
1982 else if(check_version(Version(1, 50)))
1984 else if(iface=="uniform")
1985 return check_extension(ARB_uniform_buffer_object);
1990 void ProgramCompiler::LegacyConverter::visit(InterfaceBlock &iface)
1992 if(!supports_interface_blocks(iface.interface))
1993 flatten_block(iface.members);