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/regex.h>
9 #include <msp/strings/utils.h>
12 #include "programcompiler.h"
13 #include "resources.h"
22 const char builtins_src[] =
23 "#pragma MSP stage(vertex)\n"
24 "out gl_PerVertex {\n"
25 " vec4 gl_Position;\n"
26 " float gl_ClipDistance[];\n"
28 "#pragma MSP stage(geometry)\n"
30 " vec4 gl_Position;\n"
31 " float gl_ClipDistance[];\n"
33 "out gl_PerVertex {\n"
34 " vec4 gl_Position;\n"
35 " float gl_ClipDistance[];\n"
43 using namespace ProgramSyntax;
45 ProgramCompiler::ProgramCompiler():
50 ProgramCompiler::~ProgramCompiler()
55 void ProgramCompiler::compile(const string &source, const string &src_name)
59 module = new Module();
61 imported_names.push_back(src_name);
62 append_module(parser.parse(source, src_name, 1));
66 void ProgramCompiler::compile(IO::Base &io, Resources *res, const string &src_name)
70 module = new Module();
72 imported_names.push_back(src_name);
73 append_module(parser.parse(io, src_name, 1));
77 void ProgramCompiler::compile(IO::Base &io, const string &src_name)
79 compile(io, 0, src_name);
82 void ProgramCompiler::add_shaders(Program &program)
85 throw invalid_operation("ProgramCompiler::add_shaders");
89 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
93 program.attach_shader_owned(new VertexShader(apply<Formatter>(*i)));
94 for(map<string, unsigned>::iterator j=i->locations.begin(); j!=i->locations.end(); ++j)
95 program.bind_attribute(j->second, j->first);
97 else if(i->type==GEOMETRY)
98 program.attach_shader_owned(new GeometryShader(apply<Formatter>(*i)));
99 else if(i->type==FRAGMENT)
101 program.attach_shader_owned(new FragmentShader(apply<Formatter>(*i)));
104 for(map<string, unsigned>::iterator j=i->locations.begin(); j!=i->locations.end(); ++j)
105 program.bind_fragment_data(j->second, j->first);
110 catch(const compile_error &e)
112 static const Regex r_message("^(([0-9]+)\\(([0-9]+)\\) :|ERROR: ([0-9]+):([0-9]+):) (.*)$");
113 vector<string> lines = split(e.what(), '\n');
115 for(vector<string>::const_iterator i=lines.begin(); i!=lines.end(); ++i)
117 RegMatch m = r_message.match(*i);
124 index = lexical_cast<unsigned>(m[2].str);
125 line = lexical_cast<unsigned>(m[3].str);
129 index = lexical_cast<unsigned>(m[4].str);
130 line = lexical_cast<unsigned>(m[5].str);
132 const char *src = "<unknown>";
135 else if(index-1<imported_names.size())
136 src = imported_names[index-1].c_str();
137 translated += format("%s:%d: %s", src, line, m[6].str);
144 throw compile_error(translated);
148 Module *ProgramCompiler::create_builtins_module()
150 ProgramParser parser;
151 Module *module = new Module(parser.parse(builtins_src, "<builtin>"));
152 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
154 VariableResolver resolver;
155 i->content.visit(resolver);
156 for(map<string, VariableDeclaration *>::iterator j=i->content.variables.begin(); j!=i->content.variables.end(); ++j)
157 j->second->linked_declaration = j->second;
162 Module &ProgramCompiler::get_builtins_module()
164 static RefPtr<Module> builtins_module = create_builtins_module();
165 return *builtins_module;
168 Stage *ProgramCompiler::get_builtins(StageType type)
170 Module &module = get_builtins_module();
171 for(list<Stage>::iterator i=module.stages.begin(); i!=module.stages.end(); ++i)
177 void ProgramCompiler::append_module(ProgramSyntax::Module &mod)
179 vector<Import *> imports = apply<NodeGatherer<Import> >(mod.shared);
180 for(vector<Import *>::iterator i=imports.begin(); i!=imports.end(); ++i)
181 import((*i)->module);
182 apply<NodeRemover>(mod.shared, set<Node *>(imports.begin(), imports.end()));
184 append_stage(mod.shared);
185 for(list<Stage>::iterator i=mod.stages.begin(); i!=mod.stages.end(); ++i)
189 void ProgramCompiler::append_stage(Stage &stage)
192 if(stage.type==SHARED)
193 target = &module->shared;
196 list<Stage>::iterator i;
197 for(i=module->stages.begin(); (i!=module->stages.end() && i->type<stage.type); ++i) ;
198 if(i==module->stages.end() || i->type>stage.type)
200 list<Stage>::iterator j = module->stages.insert(i, stage.type);
201 if(i!=module->stages.end())
204 if(i!=module->stages.begin())
211 for(NodeList<Statement>::iterator i=stage.content.body.begin(); i!=stage.content.body.end(); ++i)
212 target->content.body.push_back(*i);
213 apply<DeclarationCombiner>(*target);
216 void ProgramCompiler::process()
218 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
220 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); )
223 i = module->stages.begin();
227 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
231 void ProgramCompiler::import(const string &name)
233 string fn = name+".glsl";
234 if(find(imported_names, fn)!=imported_names.end())
236 imported_names.push_back(fn);
238 RefPtr<IO::Seekable> io = (resources ? resources->open_raw(fn) : Resources::get_builtins().open(fn));
240 throw runtime_error(format("module %s not found", name));
241 ProgramParser import_parser;
242 append_module(import_parser.parse(*io, fn, imported_names.size()));
245 void ProgramCompiler::generate(Stage &stage)
247 inject_block(stage.content, module->shared.content);
249 apply<DeclarationReorderer>(stage);
250 apply<FunctionResolver>(stage);
251 apply<VariableResolver>(stage);
252 apply<InterfaceGenerator>(stage);
253 apply<VariableResolver>(stage);
254 apply<DeclarationReorderer>(stage);
255 apply<FunctionResolver>(stage);
256 apply<LegacyConverter>(stage);
259 bool ProgramCompiler::optimize(Stage &stage)
261 apply<ConstantConditionEliminator>(stage);
263 set<FunctionDeclaration *> inlineable = apply<InlineableFunctionLocator>(stage);
264 apply<FunctionInliner>(stage, inlineable);
266 set<Node *> unused = apply<UnusedVariableLocator>(stage);
267 set<Node *> unused2 = apply<UnusedFunctionLocator>(stage);
268 unused.insert(unused2.begin(), unused2.end());
269 apply<NodeRemover>(stage, unused);
271 return !unused.empty();
274 void ProgramCompiler::finalize(Stage &stage)
276 if(get_gl_api()==OPENGL_ES2)
277 apply<DefaultPrecisionGenerator>(stage);
279 apply<PrecisionRemover>(stage);
282 void ProgramCompiler::inject_block(Block &target, const Block &source)
284 NodeList<Statement>::iterator insert_point = target.body.begin();
285 for(NodeList<Statement>::const_iterator i=source.body.begin(); i!=source.body.end(); ++i)
286 target.body.insert(insert_point, (*i)->clone());
290 typename T::ResultType ProgramCompiler::apply(Stage &stage)
293 visitor.apply(stage);
294 return visitor.get_result();
297 template<typename T, typename A>
298 typename T::ResultType ProgramCompiler::apply(Stage &stage, const A &arg)
301 visitor.apply(stage);
302 return visitor.get_result();
306 ProgramCompiler::Visitor::Visitor():
310 void ProgramCompiler::Visitor::apply(Stage &s)
312 SetForScope<Stage *> set(stage, &s);
313 stage->content.visit(*this);
317 ProgramCompiler::BlockModifier::BlockModifier():
321 void ProgramCompiler::BlockModifier::flatten_block(Block &block)
323 insert_nodes.insert(insert_nodes.end(), block.body.begin(), block.body.end());
327 void ProgramCompiler::BlockModifier::apply_and_increment(Block &block, NodeList<Statement>::iterator &i)
329 block.body.insert(i, insert_nodes.begin(), insert_nodes.end());
330 insert_nodes.clear();
333 block.body.erase(i++);
339 void ProgramCompiler::BlockModifier::visit(Block &block)
341 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
344 apply_and_increment(block, i);
349 ProgramCompiler::Formatter::Formatter():
352 parameter_list(false)
355 void ProgramCompiler::Formatter::apply(ProgramSyntax::Stage &s)
357 GLApi api = get_gl_api();
358 const Version &ver = s.required_version;
362 append(format("#version %d%02d", ver.major, ver.minor));
363 if(api==OPENGL_ES2 && ver>=Version(3, 0))
368 for(vector<const Extension *>::const_iterator i=s.required_extensions.begin(); i!=s.required_extensions.end(); ++i)
369 append(format("#extension %s: require\n", (*i)->get_name()));
370 if(!s.required_extensions.empty())
376 void ProgramCompiler::Formatter::append(const string &text)
379 for(string::const_iterator i=text.begin(); i!=text.end(); ++i)
384 void ProgramCompiler::Formatter::append(char c)
391 void ProgramCompiler::Formatter::set_source(unsigned index, unsigned line)
393 if(index!=source_index || (index && line!=source_line))
395 if(index==source_index && line==source_line+1)
400 if(stage->required_version<Version(3, 30))
402 formatted += format("#line %d %d\n", l, index);
405 source_index = index;
409 void ProgramCompiler::Formatter::visit(Literal &literal)
411 append(literal.token);
414 void ProgramCompiler::Formatter::visit(ParenthesizedExpression &parexpr)
417 parexpr.expression->visit(*this);
421 void ProgramCompiler::Formatter::visit(VariableReference &var)
426 void ProgramCompiler::Formatter::visit(MemberAccess &memacc)
428 memacc.left->visit(*this);
429 append(format(".%s", memacc.member));
432 void ProgramCompiler::Formatter::visit(UnaryExpression &unary)
436 unary.expression->visit(*this);
441 void ProgramCompiler::Formatter::visit(BinaryExpression &binary)
443 binary.left->visit(*this);
445 binary.right->visit(*this);
446 append(binary.after);
449 void ProgramCompiler::Formatter::visit(Assignment &assign)
451 assign.left->visit(*this);
452 append(format(" %s ", assign.oper));
453 assign.right->visit(*this);
456 void ProgramCompiler::Formatter::visit(FunctionCall &call)
458 append(format("%s(", call.name));
459 for(NodeArray<Expression>::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
461 if(i!=call.arguments.begin())
468 void ProgramCompiler::Formatter::visit(ExpressionStatement &expr)
470 expr.expression->visit(*this);
474 void ProgramCompiler::Formatter::visit(Block &block)
476 unsigned brace_indent = indent;
477 bool use_braces = (block.use_braces || (indent && block.body.size()!=1));
479 append(format("%s{\n", string(brace_indent*2, ' ')));
481 SetForScope<unsigned> set(indent, indent+(indent>0 || use_braces));
482 string spaces(indent*2, ' ');
483 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
485 if(i!=block.body.begin())
487 set_source((*i)->source, (*i)->line);
493 append(format("\n%s}", string(brace_indent*2, ' ')));
496 void ProgramCompiler::Formatter::visit(Import &import)
498 append(format("import %s;", import.module));
501 void ProgramCompiler::Formatter::visit(Precision &prec)
503 append(format("precision %s %s;", prec.precision, prec.type));
506 void ProgramCompiler::Formatter::visit(Layout &layout)
509 for(vector<Layout::Qualifier>::const_iterator i=layout.qualifiers.begin(); i!=layout.qualifiers.end(); ++i)
511 if(i!=layout.qualifiers.begin())
513 append(i->identifier);
514 if(!i->value.empty())
515 append(format("=%s", i->value));
520 void ProgramCompiler::Formatter::visit(InterfaceLayout &layout)
522 layout.layout.visit(*this);
523 append(format(" %s;", layout.interface));
526 void ProgramCompiler::Formatter::visit(StructDeclaration &strct)
528 append(format("struct %s\n", strct.name));
529 strct.members.visit(*this);
533 void ProgramCompiler::Formatter::visit(VariableDeclaration &var)
537 var.layout->visit(*this);
542 if(!var.interpolation.empty())
543 append(format("%s ", var.interpolation));
544 if(!var.sampling.empty())
545 append(format("%s ", var.sampling));
546 if(!var.interface.empty() && var.interface!=block_interface)
548 string interface = var.interface;
549 if(stage->required_version<Version(1, 30))
551 if(stage->type==VERTEX && var.interface=="in")
552 interface = "attribute";
553 else if((stage->type==VERTEX && var.interface=="out") || (stage->type==FRAGMENT && var.interface=="in"))
554 interface = "varying";
556 append(format("%s ", interface));
558 if(!var.precision.empty())
559 append(format("%s ", var.precision));
560 append(format("%s %s", var.type, var.name));
565 var.array_size->visit(*this);
568 if(var.init_expression)
571 var.init_expression->visit(*this);
577 void ProgramCompiler::Formatter::visit(InterfaceBlock &iface)
579 SetForScope<string> set(block_interface, iface.interface);
580 append(format("%s %s\n", iface.interface, iface.name));
581 iface.members.visit(*this);
585 void ProgramCompiler::Formatter::visit(FunctionDeclaration &func)
587 append(format("%s %s(", func.return_type, func.name));
588 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
590 if(i!=func.parameters.begin())
592 SetFlag set(parameter_list);
596 if(func.definition==&func)
599 func.body.visit(*this);
605 void ProgramCompiler::Formatter::visit(Conditional &cond)
608 cond.condition->visit(*this);
611 cond.body.visit(*this);
612 if(!cond.else_body.body.empty())
614 Conditional *else_cond = dynamic_cast<Conditional *>(cond.else_body.body.front().get());
615 if(cond.else_body.body.size()==1 && else_cond)
618 set_source(else_cond->source, else_cond->line);
619 append(format("%selse ", string(indent*2, ' ')));
620 else_cond->visit(*this);
624 append(format("\n%selse\n", string(indent*2, ' ')));
625 cond.else_body.visit(*this);
630 void ProgramCompiler::Formatter::visit(Iteration &iter)
632 if(!iter.init_statement && iter.condition && !iter.loop_expression)
635 iter.condition->visit(*this);
641 if(iter.init_statement)
642 iter.init_statement->visit(*this);
648 iter.condition->visit(*this);
651 if(iter.loop_expression)
654 iter.loop_expression->visit(*this);
659 if(iter.body.body.empty())
664 iter.body.visit(*this);
668 void ProgramCompiler::Formatter::visit(Return &ret)
674 ret.expression->visit(*this);
679 void ProgramCompiler::Formatter::visit(Jump &jump)
681 append(jump.keyword);
686 ProgramCompiler::DeclarationCombiner::DeclarationCombiner():
690 void ProgramCompiler::DeclarationCombiner::visit(Block &block)
695 SetForScope<bool> set(toplevel, false);
696 BlockModifier::visit(block);
699 void ProgramCompiler::DeclarationCombiner::visit(FunctionDeclaration &func)
701 vector<FunctionDeclaration *> &decls = functions[func.name];
704 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
706 (*i)->definition = func.definition;
707 (*i)->body.body.clear();
710 decls.push_back(&func);
713 void ProgramCompiler::DeclarationCombiner::visit(VariableDeclaration &var)
715 VariableDeclaration *&ptr = variables[var.name];
718 ptr->type = var.type;
719 if(var.init_expression)
720 ptr->init_expression = var.init_expression;
725 for(vector<Layout::Qualifier>::iterator i=var.layout->qualifiers.begin(); i!=var.layout->qualifiers.end(); ++i)
728 for(vector<Layout::Qualifier>::iterator j=ptr->layout->qualifiers.begin(); (!found && j!=ptr->layout->qualifiers.end()); ++j)
729 if(j->identifier==i->identifier)
736 ptr->layout->qualifiers.push_back(*i);
740 ptr->layout = var.layout;
749 ProgramCompiler::VariableResolver::VariableResolver():
751 record_target(false),
752 assignment_target(0),
753 self_referencing(false)
756 void ProgramCompiler::VariableResolver::apply(Stage &s)
758 SetForScope<Stage *> set(stage, &s);
759 Stage *builtins = get_builtins(stage->type);
761 blocks.push_back(&builtins->content);
762 stage->content.visit(*this);
767 void ProgramCompiler::VariableResolver::visit(Block &block)
769 blocks.push_back(&block);
770 block.variables.clear();
771 TraversingVisitor::visit(block);
775 void ProgramCompiler::VariableResolver::visit(VariableReference &var)
779 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
782 map<string, VariableDeclaration *>::iterator j = (*i)->variables.find(var.name);
783 if(j!=(*i)->variables.end())
785 var.declaration = j->second;
786 type = j->second->type_declaration;
793 if(assignment_target)
795 record_target = false;
796 assignment_target = 0;
799 assignment_target = var.declaration;
801 else if(var.declaration && var.declaration==assignment_target)
802 self_referencing = true;
805 void ProgramCompiler::VariableResolver::visit(MemberAccess &memacc)
808 TraversingVisitor::visit(memacc);
809 memacc.declaration = 0;
812 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
813 if(i!=type->members.variables.end())
815 memacc.declaration = i->second;
816 type = i->second->type_declaration;
823 void ProgramCompiler::VariableResolver::visit(BinaryExpression &binary)
828 SetForScope<bool> set(record_target, false);
829 binary.right->visit(*this);
832 binary.left->visit(*this);
836 TraversingVisitor::visit(binary);
841 void ProgramCompiler::VariableResolver::visit(Assignment &assign)
844 SetFlag set(record_target);
845 assignment_target = 0;
846 assign.left->visit(*this);
849 self_referencing = false;
850 assign.right->visit(*this);
852 assign.self_referencing = (self_referencing || assign.oper!="=");
853 assign.target_declaration = assignment_target;
856 void ProgramCompiler::VariableResolver::visit(StructDeclaration &strct)
858 TraversingVisitor::visit(strct);
859 blocks.back()->types[strct.name] = &strct;
862 void ProgramCompiler::VariableResolver::visit(VariableDeclaration &var)
864 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
867 map<string, StructDeclaration *>::iterator j = (*i)->types.find(var.type);
868 if(j!=(*i)->types.end())
869 var.type_declaration = j->second;
872 if(!block_interface.empty() && var.interface.empty())
873 var.interface = block_interface;
875 TraversingVisitor::visit(var);
876 blocks.back()->variables[var.name] = &var;
877 if(anonymous && blocks.size()>1)
878 blocks[blocks.size()-2]->variables[var.name] = &var;
881 void ProgramCompiler::VariableResolver::visit(InterfaceBlock &iface)
883 SetFlag set(anonymous);
884 SetForScope<string> set2(block_interface, iface.interface);
885 TraversingVisitor::visit(iface);
889 void ProgramCompiler::FunctionResolver::visit(FunctionCall &call)
891 map<string, vector<FunctionDeclaration *> >::iterator i = functions.find(call.name);
892 if(i!=functions.end())
893 call.declaration = i->second.back();
895 TraversingVisitor::visit(call);
898 void ProgramCompiler::FunctionResolver::visit(FunctionDeclaration &func)
900 vector<FunctionDeclaration *> &decls = functions[func.name];
903 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
904 (*i)->definition = func.definition;
906 decls.push_back(&func);
908 else if(!decls.empty() && decls.back()->definition)
909 func.definition = decls.back()->definition;
911 decls.push_back(&func);
913 TraversingVisitor::visit(func);
917 ProgramCompiler::InterfaceGenerator::InterfaceGenerator():
921 string ProgramCompiler::InterfaceGenerator::get_out_prefix(StageType type)
925 else if(type==GEOMETRY)
931 void ProgramCompiler::InterfaceGenerator::apply(Stage &s)
933 SetForScope<Stage *> set(stage, &s);
935 in_prefix = get_out_prefix(stage->previous->type);
936 out_prefix = get_out_prefix(stage->type);
937 stage->content.visit(*this);
940 void ProgramCompiler::InterfaceGenerator::visit(Block &block)
942 SetForScope<unsigned> set(scope_level, scope_level+1);
943 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
949 for(map<string, RefPtr<VariableDeclaration> >::iterator j=iface_declarations.begin(); j!=iface_declarations.end(); ++j)
951 NodeList<Statement>::iterator k = block.body.insert(i, j->second);
954 iface_declarations.clear();
957 apply_and_increment(block, i);
961 string ProgramCompiler::InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
963 unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
964 return prefix+name.substr(offset);
967 bool ProgramCompiler::InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
969 const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
970 if(stage_vars.count(name) || iface_declarations.count(name))
973 VariableDeclaration* iface_var = new VariableDeclaration;
974 iface_var->sampling = var.sampling;
975 iface_var->interface = iface;
976 iface_var->type = var.type;
977 iface_var->type_declaration = var.type_declaration;
978 iface_var->name = name;
979 if(stage->type==GEOMETRY)
980 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
982 iface_var->array = var.array;
984 iface_var->array_size = var.array_size;
986 iface_var->linked_declaration = &var;
987 iface_declarations[name] = iface_var;
992 ExpressionStatement &ProgramCompiler::InterfaceGenerator::insert_assignment(const string &left, ProgramSyntax::Expression *right)
994 Assignment *assign = new Assignment;
995 VariableReference *ref = new VariableReference;
999 assign->right = right;
1001 ExpressionStatement *stmt = new ExpressionStatement;
1002 stmt->expression = assign;
1004 insert_nodes.push_back(stmt);
1009 void ProgramCompiler::InterfaceGenerator::visit(VariableReference &var)
1011 if(var.declaration || !stage->previous)
1013 if(iface_declarations.count(var.name))
1016 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
1017 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
1018 if(i==prev_out.end())
1019 i = prev_out.find(in_prefix+var.name);
1020 if(i!=prev_out.end())
1022 generate_interface(*i->second, "in", i->second->name);
1023 var.name = i->second->name;
1027 void ProgramCompiler::InterfaceGenerator::visit(VariableDeclaration &var)
1029 if(var.interface=="out")
1032 stage->out_variables[var.name] = &var;
1033 else if(generate_interface(var, "out", change_prefix(var.name, string())))
1036 if(var.init_expression)
1038 ExpressionStatement &stmt = insert_assignment(var.name, var.init_expression->clone());
1039 stmt.source = var.source;
1040 stmt.line = var.line;
1045 else if(var.interface=="in")
1047 stage->in_variables[var.name] = &var;
1048 if(var.linked_declaration)
1049 var.linked_declaration->linked_declaration = &var;
1050 else if(stage->previous)
1052 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
1053 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
1054 if(i!=prev_out.end())
1056 var.linked_declaration = i->second;
1057 i->second->linked_declaration = &var;
1062 TraversingVisitor::visit(var);
1065 void ProgramCompiler::InterfaceGenerator::visit(Passthrough &pass)
1067 vector<VariableDeclaration *> pass_vars;
1069 for(map<string, VariableDeclaration *>::const_iterator i=stage->in_variables.begin(); i!=stage->in_variables.end(); ++i)
1070 pass_vars.push_back(i->second);
1071 for(map<string, RefPtr<VariableDeclaration> >::const_iterator i=iface_declarations.begin(); i!=iface_declarations.end(); ++i)
1072 if(i->second->interface=="in")
1073 pass_vars.push_back(i->second.get());
1077 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
1078 for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
1080 bool linked = false;
1081 for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
1082 linked = ((*j)->linked_declaration==i->second);
1084 if(!linked && generate_interface(*i->second, "in", i->second->name))
1085 pass_vars.push_back(i->second);
1089 if(stage->type==GEOMETRY)
1091 VariableReference *ref = new VariableReference;
1092 ref->name = "gl_in";
1094 BinaryExpression *subscript = new BinaryExpression;
1095 subscript->left = ref;
1096 subscript->oper = "[";
1097 subscript->right = pass.subscript;
1098 subscript->after = "]";
1100 MemberAccess *memacc = new MemberAccess;
1101 memacc->left = subscript;
1102 memacc->member = "gl_Position";
1104 insert_assignment("gl_Position", memacc);
1107 for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
1109 string out_name = change_prefix((*i)->name, out_prefix);
1110 generate_interface(**i, "out", out_name);
1112 VariableReference *ref = new VariableReference;
1113 ref->name = (*i)->name;
1116 BinaryExpression *subscript = new BinaryExpression;
1117 subscript->left = ref;
1118 subscript->oper = "[";
1119 subscript->right = pass.subscript;
1120 subscript->after = "]";
1121 insert_assignment(out_name, subscript);
1124 insert_assignment(out_name, ref);
1131 ProgramCompiler::DeclarationReorderer::DeclarationReorderer():
1133 kind(NO_DECLARATION)
1136 void ProgramCompiler::DeclarationReorderer::visit(FunctionCall &call)
1138 FunctionDeclaration *def = call.declaration;
1140 def = def->definition;
1141 if(def && !ordered_funcs.count(def))
1142 needed_funcs.insert(def);
1145 void ProgramCompiler::DeclarationReorderer::visit(Block &block)
1147 SetForScope<unsigned> set(scope_level, scope_level+1);
1149 return Visitor::visit(block);
1151 NodeList<Statement>::iterator struct_insert_point = block.body.end();
1152 NodeList<Statement>::iterator variable_insert_point = block.body.end();
1153 NodeList<Statement>::iterator function_insert_point = block.body.end();
1154 unsigned unordered_func_count = 0;
1155 bool ordered_any_funcs = false;
1157 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
1159 kind = NO_DECLARATION;
1163 if(kind==STRUCT && struct_insert_point!=block.body.end())
1165 block.body.insert(struct_insert_point, *i);
1168 else if(kind>STRUCT && struct_insert_point==block.body.end())
1169 struct_insert_point = i;
1171 if(kind==VARIABLE && variable_insert_point!=block.body.end())
1173 block.body.insert(variable_insert_point, *i);
1176 else if(kind>VARIABLE && variable_insert_point==block.body.end())
1177 variable_insert_point = i;
1181 if(function_insert_point==block.body.end())
1182 function_insert_point = i;
1184 if(needed_funcs.empty())
1186 ordered_funcs.insert(i->get());
1187 if(i!=function_insert_point)
1189 block.body.insert(function_insert_point, *i);
1193 ++function_insert_point;
1194 ordered_any_funcs = true;
1197 ++unordered_func_count;
1202 if(function_insert_point==i)
1203 ++function_insert_point;
1204 block.body.erase(i++);
1209 if(i==block.body.end() && unordered_func_count)
1211 if(!ordered_any_funcs)
1212 // A subset of the remaining functions forms a recursive loop
1213 /* TODO pick a function and move it up, adding any necessary
1217 i = function_insert_point;
1218 unordered_func_count = 0;
1223 void ProgramCompiler::DeclarationReorderer::visit(ProgramSyntax::VariableDeclaration &var)
1225 Visitor::visit(var);
1229 void ProgramCompiler::DeclarationReorderer::visit(FunctionDeclaration &func)
1231 needed_funcs.clear();
1232 func.body.visit(*this);
1233 needed_funcs.erase(&func);
1238 ProgramCompiler::InlineableFunctionLocator::InlineableFunctionLocator():
1242 void ProgramCompiler::InlineableFunctionLocator::visit(FunctionCall &call)
1244 FunctionDeclaration *def = call.declaration;
1245 if(def && def->definition!=def)
1246 def = def->definition;
1250 unsigned &count = refcounts[def];
1252 if(count>1 || def==in_function)
1253 inlineable.erase(def);
1256 TraversingVisitor::visit(call);
1259 void ProgramCompiler::InlineableFunctionLocator::visit(FunctionDeclaration &func)
1261 unsigned &count = refcounts[func.definition];
1262 if(!count && func.parameters.empty())
1263 inlineable.insert(func.definition);
1265 SetForScope<FunctionDeclaration *> set(in_function, &func);
1266 TraversingVisitor::visit(func);
1270 ProgramCompiler::FunctionInliner::FunctionInliner():
1274 ProgramCompiler::FunctionInliner::FunctionInliner(const set<FunctionDeclaration *> &in):
1279 void ProgramCompiler::FunctionInliner::visit_and_inline(RefPtr<Expression> &ptr)
1284 ptr = inline_result;
1287 void ProgramCompiler::FunctionInliner::visit(Block &block)
1292 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
1300 void ProgramCompiler::FunctionInliner::visit(UnaryExpression &unary)
1302 visit_and_inline(unary.expression);
1306 void ProgramCompiler::FunctionInliner::visit(BinaryExpression &binary)
1308 visit_and_inline(binary.left);
1309 visit_and_inline(binary.right);
1313 void ProgramCompiler::FunctionInliner::visit(MemberAccess &memacc)
1315 visit_and_inline(memacc.left);
1319 void ProgramCompiler::FunctionInliner::visit(FunctionCall &call)
1321 for(NodeArray<Expression>::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
1322 visit_and_inline(*i);
1324 FunctionDeclaration *def = call.declaration;
1325 if(def && def->definition!=def)
1326 def = def->definition;
1328 if(def && inlineable.count(def))
1337 void ProgramCompiler::FunctionInliner::visit(VariableDeclaration &var)
1339 if(var.init_expression)
1340 visit_and_inline(var.init_expression);
1344 void ProgramCompiler::FunctionInliner::visit(Return &ret)
1346 TraversingVisitor::visit(ret);
1349 inline_result = ret.expression->clone();
1353 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator():
1359 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator(const ValueMap &v):
1360 variable_values(&v),
1365 void ProgramCompiler::ExpressionEvaluator::visit(Literal &literal)
1367 if(literal.token=="true")
1369 else if(literal.token=="false")
1372 result = lexical_cast<float>(literal.token);
1373 result_valid = true;
1376 void ProgramCompiler::ExpressionEvaluator::visit(ParenthesizedExpression &parexp)
1378 parexp.expression->visit(*this);
1381 void ProgramCompiler::ExpressionEvaluator::visit(VariableReference &var)
1383 if(!var.declaration)
1388 ValueMap::const_iterator i = variable_values->find(var.declaration);
1389 if(i!=variable_values->end())
1390 i->second->visit(*this);
1392 else if(var.declaration->init_expression)
1393 var.declaration->init_expression->visit(*this);
1396 void ProgramCompiler::ExpressionEvaluator::visit(UnaryExpression &unary)
1398 result_valid = false;
1399 unary.expression->visit(*this);
1406 result_valid = false;
1409 void ProgramCompiler::ExpressionEvaluator::visit(BinaryExpression &binary)
1411 result_valid = false;
1412 binary.left->visit(*this);
1416 float left_result = result;
1417 result_valid = false;
1418 binary.right->visit(*this);
1422 if(binary.oper=="<")
1423 result = (left_result<result);
1424 else if(binary.oper=="<=")
1425 result = (left_result<=result);
1426 else if(binary.oper==">")
1427 result = (left_result>result);
1428 else if(binary.oper==">=")
1429 result = (left_result>=result);
1430 else if(binary.oper=="==")
1431 result = (left_result==result);
1432 else if(binary.oper=="!=")
1433 result = (left_result!=result);
1434 else if(binary.oper=="&&")
1435 result = (left_result && result);
1436 else if(binary.oper=="||")
1437 result = (left_result || result);
1439 result_valid = false;
1443 ProgramCompiler::ConstantConditionEliminator::ConstantConditionEliminator():
1448 void ProgramCompiler::ConstantConditionEliminator::visit(Block &block)
1450 SetForScope<unsigned> set(scope_level, scope_level+1);
1451 BlockModifier::visit(block);
1453 for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
1454 variable_values.erase(i->second);
1457 void ProgramCompiler::ConstantConditionEliminator::visit(UnaryExpression &unary)
1459 if(VariableReference *var = dynamic_cast<VariableReference *>(unary.expression.get()))
1460 if(unary.oper=="++" || unary.oper=="--")
1461 variable_values.erase(var->declaration);
1464 void ProgramCompiler::ConstantConditionEliminator::visit(Assignment &assign)
1466 variable_values.erase(assign.target_declaration);
1469 void ProgramCompiler::ConstantConditionEliminator::visit(VariableDeclaration &var)
1471 if(var.constant || scope_level>1)
1472 variable_values[&var] = var.init_expression.get();
1475 void ProgramCompiler::ConstantConditionEliminator::visit(Conditional &cond)
1479 ExpressionEvaluator eval(variable_values);
1480 cond.condition->visit(eval);
1481 if(eval.result_valid)
1483 flatten_block(eval.result ? cond.body : cond.else_body);
1488 TraversingVisitor::visit(cond);
1491 void ProgramCompiler::ConstantConditionEliminator::visit(Iteration &iter)
1497 /* If the loop condition is always false on the first iteration, the
1498 entire loop can be removed */
1499 if(iter.init_statement)
1500 iter.init_statement->visit(*this);
1501 ExpressionEvaluator eval(variable_values);
1502 iter.condition->visit(eval);
1503 if(eval.result_valid && !eval.result)
1510 /* Record all assignments that occur inside the loop body so those
1511 variables won't be considered as constant */
1512 SetFlag set_record(record_only);
1513 TraversingVisitor::visit(iter);
1516 TraversingVisitor::visit(iter);
1518 if(VariableDeclaration *init_decl = dynamic_cast<VariableDeclaration *>(iter.init_statement.get()))
1519 variable_values.erase(init_decl);
1523 ProgramCompiler::UnusedVariableLocator::UnusedVariableLocator():
1526 assignment_target(false),
1527 assign_to_subscript(false),
1531 void ProgramCompiler::UnusedVariableLocator::apply(Stage &s)
1533 variables.push_back(BlockVariableMap());
1535 BlockVariableMap &global_variables = variables.back();
1536 for(BlockVariableMap::iterator i=global_variables.begin(); i!=global_variables.end(); ++i)
1538 if(i->first->interface=="out" && (s.type==FRAGMENT || i->first->linked_declaration || !i->first->name.compare(0, 3, "gl_")))
1540 if(!i->second.referenced)
1542 unused_nodes.insert(i->first);
1543 clear_assignments(i->second, true);
1546 variables.pop_back();
1549 void ProgramCompiler::UnusedVariableLocator::visit(VariableReference &var)
1551 map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
1552 if(i!=aggregates.end())
1553 unused_nodes.erase(i->second);
1555 if(var.declaration && !assignment_target)
1557 VariableInfo &var_info = variables.back()[var.declaration];
1558 var_info.assignments.clear();
1559 var_info.referenced = true;
1563 void ProgramCompiler::UnusedVariableLocator::visit(MemberAccess &memacc)
1565 TraversingVisitor::visit(memacc);
1566 unused_nodes.erase(memacc.declaration);
1569 void ProgramCompiler::UnusedVariableLocator::visit(BinaryExpression &binary)
1571 if(binary.oper=="[")
1573 if(assignment_target)
1574 assign_to_subscript = true;
1575 binary.left->visit(*this);
1576 SetForScope<bool> set(assignment_target, false);
1577 binary.right->visit(*this);
1580 TraversingVisitor::visit(binary);
1583 void ProgramCompiler::UnusedVariableLocator::visit(Assignment &assign)
1586 assign_to_subscript = false;
1587 SetForScope<bool> set(assignment_target, !assign.self_referencing);
1588 assign.left->visit(*this);
1590 assign.right->visit(*this);
1591 assignment = &assign;
1594 void ProgramCompiler::UnusedVariableLocator::record_assignment(VariableDeclaration &var, Node &node, bool chained)
1596 VariableInfo &var_info = variables.back()[&var];
1598 clear_assignments(var_info, true);
1599 var_info.assignments.push_back(&node);
1600 var_info.conditionally_assigned = false;
1603 void ProgramCompiler::UnusedVariableLocator::clear_assignments(VariableInfo &var_info, bool mark_unused)
1607 for(vector<Node *>::iterator i=var_info.assignments.begin(); i!=var_info.assignments.end(); ++i)
1608 unused_nodes.insert(*i);
1610 var_info.assignments.clear();
1613 void ProgramCompiler::UnusedVariableLocator::visit(ExpressionStatement &expr)
1616 TraversingVisitor::visit(expr);
1617 if(assignment && assignment->target_declaration)
1618 record_assignment(*assignment->target_declaration, expr, (assignment->self_referencing || assign_to_subscript));
1621 void ProgramCompiler::UnusedVariableLocator::visit(StructDeclaration &strct)
1623 SetForScope<Node *> set(aggregate, &strct);
1624 unused_nodes.insert(&strct);
1625 TraversingVisitor::visit(strct);
1628 void ProgramCompiler::UnusedVariableLocator::visit(VariableDeclaration &var)
1631 aggregates[&var] = aggregate;
1634 variables.back()[&var].local = true;
1635 if(var.init_expression)
1636 record_assignment(var, *var.init_expression, false);
1638 unused_nodes.erase(var.type_declaration);
1639 TraversingVisitor::visit(var);
1642 void ProgramCompiler::UnusedVariableLocator::visit(InterfaceBlock &iface)
1644 SetForScope<Node *> set(aggregate, &iface);
1645 unused_nodes.insert(&iface);
1646 TraversingVisitor::visit(iface);
1649 void ProgramCompiler::UnusedVariableLocator::visit(FunctionDeclaration &func)
1651 variables.push_back(BlockVariableMap());
1654 SetForScope<bool> set(global_scope, false);
1655 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1657 func.body.visit(*this);
1660 BlockVariableMap &block_variables = variables.back();
1661 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1662 i->second.conditionally_assigned = true;
1663 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1664 block_variables[i->get()].referenced = true;
1665 merge_down_variables();
1668 void ProgramCompiler::UnusedVariableLocator::merge_down_variables()
1670 BlockVariableMap &parent_variables = variables[variables.size()-2];
1671 BlockVariableMap &block_variables = variables.back();
1672 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1676 if(!i->second.referenced)
1677 unused_nodes.insert(i->first);
1678 clear_assignments(i->second, true);
1682 BlockVariableMap::iterator j = parent_variables.find(i->first);
1683 if(j==parent_variables.end())
1684 parent_variables.insert(*i);
1687 if(i->second.referenced || !i->second.conditionally_assigned)
1688 clear_assignments(j->second, !i->second.referenced);
1689 j->second.conditionally_assigned = i->second.conditionally_assigned;
1690 j->second.referenced |= i->second.referenced;
1691 j->second.assignments.insert(j->second.assignments.end(), i->second.assignments.begin(), i->second.assignments.end());
1694 variables.pop_back();
1697 void ProgramCompiler::UnusedVariableLocator::visit(Conditional &cond)
1699 cond.condition->visit(*this);
1700 variables.push_back(BlockVariableMap());
1701 cond.body.visit(*this);
1703 BlockVariableMap if_variables;
1704 swap(variables.back(), if_variables);
1705 cond.else_body.visit(*this);
1707 BlockVariableMap &else_variables = variables.back();
1708 for(BlockVariableMap::iterator i=else_variables.begin(); i!=else_variables.end(); ++i)
1710 BlockVariableMap::iterator j = if_variables.find(i->first);
1711 if(j!=if_variables.end())
1713 i->second.assignments.insert(i->second.assignments.end(), j->second.assignments.begin(), j->second.assignments.end());
1714 i->second.conditionally_assigned |= j->second.conditionally_assigned;
1715 if_variables.erase(j);
1718 i->second.conditionally_assigned = true;
1721 for(BlockVariableMap::iterator i=if_variables.begin(); i!=if_variables.end(); ++i)
1723 i->second.conditionally_assigned = true;
1724 else_variables.insert(*i);
1727 merge_down_variables();
1730 void ProgramCompiler::UnusedVariableLocator::visit(Iteration &iter)
1732 variables.push_back(BlockVariableMap());
1733 TraversingVisitor::visit(iter);
1735 BlockVariableMap &block_variables = variables.back();
1736 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1737 if(!i->second.local && i->second.referenced)
1738 i->second.assignments.clear();
1740 merge_down_variables();
1744 ProgramCompiler::UnusedVariableLocator::VariableInfo::VariableInfo():
1746 conditionally_assigned(false),
1751 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionCall &call)
1753 TraversingVisitor::visit(call);
1755 unused_nodes.erase(call.declaration);
1756 if(call.declaration && call.declaration->definition!=call.declaration)
1757 used_definitions.insert(call.declaration->definition);
1760 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionDeclaration &func)
1762 TraversingVisitor::visit(func);
1764 if((func.name!="main" || func.body.body.empty()) && !used_definitions.count(&func))
1765 unused_nodes.insert(&func);
1769 ProgramCompiler::NodeRemover::NodeRemover(const set<Node *> &r):
1773 void ProgramCompiler::NodeRemover::visit(Block &block)
1775 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
1778 if(to_remove.count(i->get()))
1779 block.body.erase(i++);
1785 void ProgramCompiler::NodeRemover::visit(VariableDeclaration &var)
1787 if(to_remove.count(&var))
1789 stage->in_variables.erase(var.name);
1790 stage->out_variables.erase(var.name);
1791 stage->locations.erase(var.name);
1792 if(var.linked_declaration)
1793 var.linked_declaration->linked_declaration = 0;
1795 else if(var.init_expression && to_remove.count(var.init_expression.get()))
1796 var.init_expression = 0;
1799 void ProgramCompiler::NodeRemover::visit(Iteration &iter)
1801 if(to_remove.count(iter.init_statement.get()))
1802 iter.init_statement = 0;
1803 TraversingVisitor::visit(iter);
1807 void ProgramCompiler::PrecisionRemover::visit(Precision &)
1812 void ProgramCompiler::PrecisionRemover::visit(VariableDeclaration &var)
1814 var.precision.clear();
1818 ProgramCompiler::DefaultPrecisionGenerator::DefaultPrecisionGenerator():
1822 void ProgramCompiler::DefaultPrecisionGenerator::visit(Block &block)
1826 SetForScope<bool> set(toplevel, false);
1827 BlockModifier::visit(block);
1830 Visitor::visit(block);
1833 void ProgramCompiler::DefaultPrecisionGenerator::visit(Precision &prec)
1835 have_default.insert(prec.type);
1838 void ProgramCompiler::DefaultPrecisionGenerator::visit(VariableDeclaration &var)
1840 if(var.type_declaration)
1843 string type = var.type;
1844 if(!type.compare(0, 3, "vec") || !type.compare(0, 3, "mat"))
1846 else if(!type.compare(0, 3, "ivec") || type=="uint")
1849 if(!have_default.count(type))
1851 Precision *prec = new Precision;
1852 if(!type.compare(0, 7, "sampler"))
1853 prec->precision = "lowp";
1854 else if(stage->type==FRAGMENT)
1855 prec->precision = "mediump";
1857 prec->precision = "highp";
1859 insert_nodes.push_back(prec);
1861 have_default.insert(type);
1866 ProgramCompiler::LegacyConverter::LegacyConverter():
1867 target_api(get_gl_api()),
1868 target_version(get_glsl_version()),
1872 ProgramCompiler::LegacyConverter::LegacyConverter(const Version &v):
1873 target_api(get_gl_api()),
1878 bool ProgramCompiler::LegacyConverter::check_version(const Version &feature_version) const
1880 if(target_version<feature_version)
1882 else if(stage->required_version<feature_version)
1883 stage->required_version = feature_version;
1888 bool ProgramCompiler::LegacyConverter::check_extension(const Extension &extension) const
1893 vector<const Extension *>::iterator i = find(stage->required_extensions, &extension);
1894 if(i==stage->required_extensions.end())
1895 stage->required_extensions.push_back(&extension);
1900 bool ProgramCompiler::LegacyConverter::supports_unified_interface_syntax() const
1902 if(target_api==OPENGL_ES2)
1903 return check_version(Version(3, 0));
1905 return check_version(Version(1, 30));
1908 void ProgramCompiler::LegacyConverter::visit(VariableReference &var)
1910 if(var.declaration==frag_out && !supports_unified_interface_syntax())
1912 var.name = "gl_FragColor";
1913 var.declaration = 0;
1916 else if(var.declaration)
1917 type = var.declaration->type;
1922 void ProgramCompiler::LegacyConverter::visit(Assignment &assign)
1924 TraversingVisitor::visit(assign);
1925 if(assign.target_declaration==frag_out && !supports_unified_interface_syntax())
1926 assign.target_declaration = 0;
1929 bool ProgramCompiler::LegacyConverter::supports_unified_sampling_functions() const
1931 if(target_api==OPENGL_ES2)
1932 return check_version(Version(3, 0));
1934 return check_version(Version(1, 30));
1937 void ProgramCompiler::LegacyConverter::visit(FunctionCall &call)
1939 if(call.name=="texture" && !call.declaration && !supports_unified_sampling_functions())
1941 NodeArray<Expression>::iterator i = call.arguments.begin();
1942 if(i!=call.arguments.end())
1945 if(type=="sampler1D")
1946 call.name = "texture1D";
1947 else if(type=="sampler2D")
1948 call.name = "texture2D";
1949 else if(type=="sampler3D")
1950 call.name = "texture3D";
1951 else if(type=="sampler1DShadow")
1952 call.name = "shadow1D";
1953 else if(type=="sampler2DShadow")
1954 call.name = "shadow2D";
1956 for(; i!=call.arguments.end(); ++i)
1961 TraversingVisitor::visit(call);
1964 bool ProgramCompiler::LegacyConverter::supports_interface_layouts() const
1966 if(target_api==OPENGL_ES2)
1967 return check_version(Version(3, 0));
1968 else if(check_version(Version(3, 30)))
1971 return check_extension(ARB_explicit_attrib_location);
1974 bool ProgramCompiler::LegacyConverter::supports_centroid_sampling() const
1976 if(target_api==OPENGL_ES2)
1977 return check_version(Version(3, 0));
1978 else if(check_version(Version(1, 20)))
1981 return check_extension(EXT_gpu_shader4);
1984 bool ProgramCompiler::LegacyConverter::supports_sample_sampling() const
1986 if(target_api==OPENGL_ES2)
1987 return check_version(Version(3, 20));
1988 else if(check_version(Version(4, 0)))
1991 return check_extension(ARB_gpu_shader5);
1994 void ProgramCompiler::LegacyConverter::visit(VariableDeclaration &var)
1996 if(var.layout && !supports_interface_layouts())
1998 vector<Layout::Qualifier>::iterator i;
1999 for(i=var.layout->qualifiers.begin(); (i!=var.layout->qualifiers.end() && i->identifier!="location"); ++i) ;
2000 if(i!=var.layout->qualifiers.end())
2002 unsigned location = lexical_cast<unsigned>(i->value);
2003 if(stage->type==VERTEX && var.interface=="in")
2005 stage->locations[var.name] = location;
2006 var.layout->qualifiers.erase(i);
2008 else if(stage->type==FRAGMENT && var.interface=="out")
2011 static Require _req(EXT_gpu_shader4);
2012 stage->locations[var.name] = location;
2013 var.layout->qualifiers.erase(i);
2016 if(var.layout->qualifiers.empty())
2021 if(var.sampling=="centroid")
2023 if(!supports_centroid_sampling())
2024 var.sampling = string();
2026 else if(var.sampling=="sample")
2028 if(!supports_sample_sampling())
2029 var.sampling = string();
2032 if((var.interface=="in" || var.interface=="out") && !supports_unified_interface_syntax())
2034 if(stage->type==FRAGMENT && var.interface=="out")
2041 TraversingVisitor::visit(var);
2044 bool ProgramCompiler::LegacyConverter::supports_interface_blocks(const string &iface) const
2046 if(target_api==OPENGL_ES2)
2048 if(iface=="uniform")
2049 return check_version(Version(3, 0));
2051 return check_version(Version(3, 20));
2053 else if(check_version(Version(1, 50)))
2055 else if(iface=="uniform")
2056 return check_extension(ARB_uniform_buffer_object);
2061 void ProgramCompiler::LegacyConverter::visit(InterfaceBlock &iface)
2063 if(!supports_interface_blocks(iface.interface))
2064 flatten_block(iface.members);