1 #include <msp/core/raii.h>
2 #include <msp/strings/format.h>
3 #include <msp/strings/utils.h>
6 #include "programcompiler.h"
14 const char builtins_src[] =
16 "out gl_PerVertex {\n"
17 " vec4 gl_Position;\n"
18 " float gl_ClipDistance[];\n"
22 " vec4 gl_Position;\n"
23 " float gl_ClipDistance[];\n"
25 "out gl_PerVertex {\n"
26 " vec4 gl_Position;\n"
27 " float gl_ClipDistance[];\n"
35 using namespace ProgramSyntax;
37 ProgramCompiler::ProgramCompiler():
42 void ProgramCompiler::compile(const string &source)
45 module = &parser.parse(source);
49 void ProgramCompiler::compile(IO::Base &io, Resources *res)
52 module = &parser.parse(io);
56 void ProgramCompiler::add_shaders(Program &program)
59 throw invalid_operation("ProgramCompiler::add_shaders");
61 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
65 program.attach_shader_owned(new VertexShader(apply<Formatter>(*i)));
66 for(map<string, unsigned>::iterator j=i->locations.begin(); j!=i->locations.end(); ++j)
67 program.bind_attribute(j->second, j->first);
69 else if(i->type==GEOMETRY)
70 program.attach_shader_owned(new GeometryShader(apply<Formatter>(*i)));
71 else if(i->type==FRAGMENT)
73 program.attach_shader_owned(new FragmentShader(apply<Formatter>(*i)));
74 for(map<string, unsigned>::iterator j=i->locations.begin(); j!=i->locations.end(); ++j)
75 program.bind_fragment_data(j->second, j->first);
80 Module *ProgramCompiler::create_builtins_module()
83 Module *module = new Module(parser.parse(builtins_src));
84 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
86 VariableResolver resolver;
87 i->content.visit(resolver);
88 for(map<string, VariableDeclaration *>::iterator j=i->content.variables.begin(); j!=i->content.variables.end(); ++j)
89 j->second->linked_declaration = j->second;
94 Module &ProgramCompiler::get_builtins_module()
96 static RefPtr<Module> builtins_module = create_builtins_module();
97 return *builtins_module;
100 Stage *ProgramCompiler::get_builtins(StageType type)
102 Module &module = get_builtins_module();
103 for(list<Stage>::iterator i=module.stages.begin(); i!=module.stages.end(); ++i)
109 void ProgramCompiler::process()
111 list<Import *> imports = apply<NodeGatherer<Import> >(module->shared);
112 for(list<Import *>::iterator i=imports.end(); i!=imports.begin(); )
113 import((*--i)->module);
114 apply<NodeRemover>(module->shared, set<Node *>(imports.begin(), imports.end()));
116 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
118 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); )
121 i = module->stages.begin();
127 void ProgramCompiler::import(const string &name)
129 string fn = name+".glsl";
130 RefPtr<IO::Seekable> io = (resources ? resources->open_raw(fn) : Resources::get_builtins().open(fn));
132 throw runtime_error(format("module %s not found", name));
133 ProgramParser import_parser;
134 Module &imported_module = import_parser.parse(*io);
136 inject_block(module->shared.content, imported_module.shared.content);
137 apply<DeclarationCombiner>(module->shared);
138 for(list<Stage>::iterator i=imported_module.stages.begin(); i!=imported_module.stages.end(); ++i)
140 list<Stage>::iterator j;
141 for(j=module->stages.begin(); (j!=module->stages.end() && j->type<i->type); ++j) ;
142 if(j==module->stages.end() || j->type>i->type)
144 j = module->stages.insert(j, *i);
145 list<Stage>::iterator k = j;
146 if(++k!=module->stages.end())
148 if(j!=module->stages.begin())
149 j->previous = &*--(k=j);
153 inject_block(j->content, i->content);
154 apply<DeclarationCombiner>(*j);
159 void ProgramCompiler::generate(Stage &stage)
161 inject_block(stage.content, module->shared.content);
163 apply<DeclarationReorderer>(stage);
164 apply<FunctionResolver>(stage);
165 apply<VariableResolver>(stage);
166 apply<InterfaceGenerator>(stage);
167 apply<VariableResolver>(stage);
168 apply<VariableRenamer>(stage);
169 apply<DeclarationReorderer>(stage);
170 apply<LegacyConverter>(stage);
173 bool ProgramCompiler::optimize(Stage &stage)
175 apply<ConstantConditionEliminator>(stage);
177 set<FunctionDeclaration *> inlineable = apply<InlineableFunctionLocator>(stage);
178 apply<FunctionInliner>(stage, inlineable);
180 set<Node *> unused = apply<UnusedVariableLocator>(stage);
181 set<Node *> unused2 = apply<UnusedFunctionLocator>(stage);
182 unused.insert(unused2.begin(), unused2.end());
183 apply<NodeRemover>(stage, unused);
185 return !unused.empty();
188 void ProgramCompiler::inject_block(Block &target, const Block &source)
190 list<RefPtr<Node> >::iterator insert_point = target.body.begin();
191 for(list<RefPtr<Node> >::const_iterator i=source.body.begin(); i!=source.body.end(); ++i)
192 target.body.insert(insert_point, (*i)->clone());
196 typename T::ResultType ProgramCompiler::apply(Stage &stage)
199 visitor.apply(stage);
200 return visitor.get_result();
203 template<typename T, typename A>
204 typename T::ResultType ProgramCompiler::apply(Stage &stage, const A &arg)
207 visitor.apply(stage);
208 return visitor.get_result();
212 ProgramCompiler::Visitor::Visitor():
216 void ProgramCompiler::Visitor::apply(Stage &s)
218 SetForScope<Stage *> set(stage, &s);
219 stage->content.visit(*this);
223 ProgramCompiler::Formatter::Formatter():
225 parameter_list(false),
229 void ProgramCompiler::Formatter::apply(ProgramSyntax::Stage &s)
231 const Version &ver = s.required_version;
233 formatted += format("#version %d%d\n", ver.major, ver.minor);
237 void ProgramCompiler::Formatter::visit(Literal &literal)
239 formatted += literal.token;
242 void ProgramCompiler::Formatter::visit(ParenthesizedExpression &parexpr)
245 parexpr.expression->visit(*this);
249 void ProgramCompiler::Formatter::visit(VariableReference &var)
251 formatted += var.name;
254 void ProgramCompiler::Formatter::visit(MemberAccess &memacc)
256 memacc.left->visit(*this);
257 formatted += format(".%s", memacc.member);
260 void ProgramCompiler::Formatter::visit(UnaryExpression &unary)
263 formatted += unary.oper;
264 unary.expression->visit(*this);
266 formatted += unary.oper;
269 void ProgramCompiler::Formatter::visit(BinaryExpression &binary)
271 binary.left->visit(*this);
272 formatted += binary.oper;
273 binary.right->visit(*this);
274 formatted += binary.after;
277 void ProgramCompiler::Formatter::visit(Assignment &assign)
279 assign.left->visit(*this);
280 formatted += format(" %s ", assign.oper);
281 assign.right->visit(*this);
284 void ProgramCompiler::Formatter::visit(FunctionCall &call)
286 formatted += format("%s(", call.name);
287 for(vector<RefPtr<Expression> >::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
289 if(i!=call.arguments.begin())
296 void ProgramCompiler::Formatter::visit(ExpressionStatement &expr)
298 expr.expression->visit(*this);
302 void ProgramCompiler::Formatter::visit(Block &block)
307 unsigned brace_indent = indent;
308 bool use_braces = (block.use_braces || (indent && block.body.size()!=1));
310 formatted += format("%s{\n", string(brace_indent*2, ' '));
312 SetForScope<unsigned> set(indent, indent+(indent>0 || use_braces));
313 string spaces(indent*2, ' ');
314 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
316 if(i!=block.body.begin())
324 formatted += format("\n%s}", string(brace_indent*2, ' '));
327 void ProgramCompiler::Formatter::visit(Import &import)
329 formatted += format("import %s;", import.module);
332 void ProgramCompiler::Formatter::visit(Layout &layout)
334 formatted += "layout(";
335 for(vector<Layout::Qualifier>::const_iterator i=layout.qualifiers.begin(); i!=layout.qualifiers.end(); ++i)
337 if(i!=layout.qualifiers.begin())
339 formatted += i->identifier;
340 if(!i->value.empty())
341 formatted += format("=%s", i->value);
346 void ProgramCompiler::Formatter::visit(InterfaceLayout &layout)
348 layout.layout.visit(*this);
349 formatted += format(" %s;", layout.interface);
352 void ProgramCompiler::Formatter::visit(StructDeclaration &strct)
354 formatted += format("struct %s\n", strct.name);
355 strct.members.visit(*this);
359 void ProgramCompiler::Formatter::visit(VariableDeclaration &var)
363 var.layout->visit(*this);
367 formatted += "const ";
368 if(!var.sampling.empty())
369 formatted += format("%s ", var.sampling);
370 if(!var.interface.empty() && var.interface!=block_interface)
371 formatted += format("%s ", var.interface);
372 formatted += format("%s %s", var.type, var.name);
377 var.array_size->visit(*this);
380 if(var.init_expression)
383 var.init_expression->visit(*this);
389 void ProgramCompiler::Formatter::visit(InterfaceBlock &iface)
391 SetForScope<string> set(block_interface, iface.interface);
392 formatted += format("%s %s\n", iface.interface, iface.name);
393 iface.members.visit(*this);
397 void ProgramCompiler::Formatter::visit(FunctionDeclaration &func)
399 formatted += format("%s %s(", func.return_type, func.name);
400 for(vector<RefPtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
402 if(i!=func.parameters.begin())
404 SetFlag set(parameter_list);
408 if(func.definition==&func)
411 func.body.visit(*this);
417 void ProgramCompiler::Formatter::visit(Conditional &cond)
420 formatted.replace(formatted.rfind('\n'), string::npos, 1, ' ');
425 cond.condition->visit(*this);
428 cond.body.visit(*this);
429 if(!cond.else_body.body.empty())
431 formatted += format("\n%selse\n", string(indent*2, ' '));
432 SetForScope<unsigned> set(else_if, 2);
433 cond.else_body.visit(*this);
437 void ProgramCompiler::Formatter::visit(Iteration &iter)
440 iter.init_statement->visit(*this);
442 iter.condition->visit(*this);
444 iter.loop_expression->visit(*this);
446 iter.body.visit(*this);
449 void ProgramCompiler::Formatter::visit(Return &ret)
451 formatted += "return ";
452 ret.expression->visit(*this);
456 void ProgramCompiler::Formatter::visit(Jump &jump)
458 formatted += jump.keyword;
463 ProgramCompiler::DeclarationCombiner::DeclarationCombiner():
468 void ProgramCompiler::DeclarationCombiner::visit(Block &block)
473 SetForScope<bool> set(toplevel, false);
474 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
479 block.body.erase(i++);
485 void ProgramCompiler::DeclarationCombiner::visit(FunctionDeclaration &func)
487 vector<FunctionDeclaration *> &decls = functions[func.name];
490 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
492 (*i)->definition = func.definition;
493 (*i)->body.body.clear();
496 decls.push_back(&func);
499 void ProgramCompiler::DeclarationCombiner::visit(VariableDeclaration &var)
501 VariableDeclaration *&ptr = variables[var.name];
504 ptr->type = var.type;
505 if(var.init_expression)
506 ptr->init_expression = var.init_expression;
514 ProgramCompiler::VariableResolver::VariableResolver():
516 record_target(false),
517 assignment_target(0),
518 self_referencing(false)
521 void ProgramCompiler::VariableResolver::apply(Stage &s)
523 SetForScope<Stage *> set(stage, &s);
524 Stage *builtins = get_builtins(stage->type);
526 blocks.push_back(&builtins->content);
527 stage->content.visit(*this);
532 void ProgramCompiler::VariableResolver::visit(Block &block)
534 blocks.push_back(&block);
535 block.variables.clear();
536 TraversingVisitor::visit(block);
540 void ProgramCompiler::VariableResolver::visit(VariableReference &var)
544 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
547 map<string, VariableDeclaration *>::iterator j = (*i)->variables.find(var.name);
548 if(j!=(*i)->variables.end())
550 var.declaration = j->second;
551 type = j->second->type_declaration;
558 if(assignment_target)
560 record_target = false;
561 assignment_target = 0;
564 assignment_target = var.declaration;
566 else if(var.declaration && var.declaration==assignment_target)
567 self_referencing = true;
570 void ProgramCompiler::VariableResolver::visit(MemberAccess &memacc)
573 TraversingVisitor::visit(memacc);
574 memacc.declaration = 0;
577 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
578 if(i!=type->members.variables.end())
580 memacc.declaration = i->second;
581 type = i->second->type_declaration;
588 void ProgramCompiler::VariableResolver::visit(BinaryExpression &binary)
593 SetForScope<bool> set(record_target, false);
594 binary.right->visit(*this);
597 binary.left->visit(*this);
601 TraversingVisitor::visit(binary);
606 void ProgramCompiler::VariableResolver::visit(Assignment &assign)
609 SetFlag set(record_target);
610 assignment_target = 0;
611 assign.left->visit(*this);
614 self_referencing = false;
615 assign.right->visit(*this);
617 assign.self_referencing = (self_referencing || assign.oper!="=");
618 assign.target_declaration = assignment_target;
621 void ProgramCompiler::VariableResolver::visit(StructDeclaration &strct)
623 TraversingVisitor::visit(strct);
624 blocks.back()->types[strct.name] = &strct;
627 void ProgramCompiler::VariableResolver::visit(VariableDeclaration &var)
629 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
632 map<string, StructDeclaration *>::iterator j = (*i)->types.find(var.type);
633 if(j!=(*i)->types.end())
634 var.type_declaration = j->second;
637 if(!block_interface.empty() && var.interface.empty())
638 var.interface = block_interface;
640 TraversingVisitor::visit(var);
641 blocks.back()->variables[var.name] = &var;
642 if(anonymous && blocks.size()>1)
643 blocks[blocks.size()-2]->variables[var.name] = &var;
646 void ProgramCompiler::VariableResolver::visit(InterfaceBlock &iface)
648 SetFlag set(anonymous);
649 SetForScope<string> set2(block_interface, iface.interface);
650 TraversingVisitor::visit(iface);
654 void ProgramCompiler::FunctionResolver::visit(FunctionCall &call)
656 map<string, vector<FunctionDeclaration *> >::iterator i = functions.find(call.name);
657 if(i!=functions.end())
658 call.declaration = i->second.back();
660 TraversingVisitor::visit(call);
663 void ProgramCompiler::FunctionResolver::visit(FunctionDeclaration &func)
665 vector<FunctionDeclaration *> &decls = functions[func.name];
668 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
669 (*i)->definition = func.definition;
671 decls.push_back(&func);
673 else if(!decls.empty() && decls.back()->definition)
674 func.definition = decls.back()->definition;
676 decls.push_back(&func);
678 TraversingVisitor::visit(func);
682 ProgramCompiler::BlockModifier::BlockModifier():
686 void ProgramCompiler::BlockModifier::flatten_block(Block &block)
688 insert_nodes.insert(insert_nodes.end(), block.body.begin(), block.body.end());
692 void ProgramCompiler::BlockModifier::apply_and_increment(Block &block, list<RefPtr<Node> >::iterator &i)
694 block.body.insert(i, insert_nodes.begin(), insert_nodes.end());
695 insert_nodes.clear();
698 block.body.erase(i++);
704 void ProgramCompiler::BlockModifier::visit(Block &block)
706 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
709 apply_and_increment(block, i);
714 ProgramCompiler::InterfaceGenerator::InterfaceGenerator():
718 string ProgramCompiler::InterfaceGenerator::get_out_prefix(StageType type)
722 else if(type==GEOMETRY)
728 void ProgramCompiler::InterfaceGenerator::apply(Stage &s)
730 SetForScope<Stage *> set(stage, &s);
732 in_prefix = get_out_prefix(stage->previous->type);
733 out_prefix = get_out_prefix(stage->type);
734 stage->content.visit(*this);
737 void ProgramCompiler::InterfaceGenerator::visit(Block &block)
739 SetForScope<unsigned> set(scope_level, scope_level+1);
740 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
746 for(map<string, RefPtr<VariableDeclaration> >::iterator j=iface_declarations.begin(); j!=iface_declarations.end(); ++j)
748 list<RefPtr<Node> >::iterator k = block.body.insert(i, j->second);
751 iface_declarations.clear();
754 apply_and_increment(block, i);
758 string ProgramCompiler::InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
760 unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
761 return prefix+name.substr(offset);
764 bool ProgramCompiler::InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
766 const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
767 if(stage_vars.count(name) || iface_declarations.count(name))
770 VariableDeclaration* iface_var = new VariableDeclaration;
771 iface_var->sampling = var.sampling;
772 iface_var->interface = iface;
773 iface_var->type = var.type;
774 iface_var->type_declaration = var.type_declaration;
775 iface_var->name = name;
776 if(stage->type==GEOMETRY)
777 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
779 iface_var->array = var.array;
781 iface_var->array_size = var.array_size;
783 iface_var->linked_declaration = &var;
784 iface_declarations[name] = iface_var;
789 void ProgramCompiler::InterfaceGenerator::insert_assignment(const string &left, ProgramSyntax::Expression *right)
791 Assignment *assign = new Assignment;
792 VariableReference *ref = new VariableReference;
796 assign->right = right;
798 ExpressionStatement *stmt = new ExpressionStatement;
799 stmt->expression = assign;
800 insert_nodes.push_back(stmt);
803 void ProgramCompiler::InterfaceGenerator::visit(VariableReference &var)
805 if(var.declaration || !stage->previous)
807 if(iface_declarations.count(var.name))
810 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
811 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
812 if(i==prev_out.end())
813 i = prev_out.find(in_prefix+var.name);
814 if(i!=prev_out.end())
815 generate_interface(*i->second, "in", var.name);
818 void ProgramCompiler::InterfaceGenerator::visit(VariableDeclaration &var)
820 if(var.interface=="out")
823 stage->out_variables[var.name] = &var;
824 else if(generate_interface(var, "out", change_prefix(var.name, string())))
827 if(var.init_expression)
828 insert_assignment(var.name, var.init_expression->clone());
831 else if(var.interface=="in")
833 stage->in_variables[var.name] = &var;
834 if(var.linked_declaration)
835 var.linked_declaration->linked_declaration = &var;
836 else if(stage->previous)
838 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
839 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
840 if(i!=prev_out.end())
842 var.linked_declaration = i->second;
843 i->second->linked_declaration = &var;
848 TraversingVisitor::visit(var);
851 void ProgramCompiler::InterfaceGenerator::visit(Passthrough &pass)
853 vector<VariableDeclaration *> pass_vars;
855 for(map<string, VariableDeclaration *>::const_iterator i=stage->in_variables.begin(); i!=stage->in_variables.end(); ++i)
856 pass_vars.push_back(i->second);
857 for(map<string, RefPtr<VariableDeclaration> >::const_iterator i=iface_declarations.begin(); i!=iface_declarations.end(); ++i)
858 if(i->second->interface=="in")
859 pass_vars.push_back(i->second.get());
863 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
864 for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
867 for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
868 linked = ((*j)->linked_declaration==i->second);
870 if(!linked && generate_interface(*i->second, "in", i->second->name))
871 pass_vars.push_back(i->second);
875 if(stage->type==GEOMETRY)
877 VariableReference *ref = new VariableReference;
880 BinaryExpression *subscript = new BinaryExpression;
881 subscript->left = ref;
882 subscript->oper = "[";
883 subscript->right = pass.subscript;
884 subscript->after = "]";
886 MemberAccess *memacc = new MemberAccess;
887 memacc->left = subscript;
888 memacc->member = "gl_Position";
890 insert_assignment("gl_Position", memacc);
893 for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
895 string out_name = change_prefix((*i)->name, out_prefix);
896 generate_interface(**i, "out", out_name);
898 VariableReference *ref = new VariableReference;
899 ref->name = (*i)->name;
902 BinaryExpression *subscript = new BinaryExpression;
903 subscript->left = ref;
904 subscript->oper = "[";
905 subscript->right = pass.subscript;
906 subscript->after = "]";
907 insert_assignment(out_name, subscript);
910 insert_assignment(out_name, ref);
917 void ProgramCompiler::VariableRenamer::visit(VariableReference &var)
920 var.name = var.declaration->name;
923 void ProgramCompiler::VariableRenamer::visit(VariableDeclaration &var)
925 if(var.linked_declaration)
926 var.name = var.linked_declaration->name;
927 TraversingVisitor::visit(var);
931 ProgramCompiler::DeclarationReorderer::DeclarationReorderer():
935 void ProgramCompiler::DeclarationReorderer::visit(Block &block)
937 list<RefPtr<Node> >::iterator struct_insert_point = block.body.end();
938 list<RefPtr<Node> >::iterator variable_insert_point = block.body.end();
940 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
942 kind = NO_DECLARATION;
946 if(kind==STRUCT && struct_insert_point!=block.body.end())
948 block.body.insert(struct_insert_point, *i);
951 else if(kind>STRUCT && struct_insert_point==block.body.end())
952 struct_insert_point = i;
954 if(kind==VARIABLE && variable_insert_point!=block.body.end())
956 block.body.insert(variable_insert_point, *i);
959 else if(kind>VARIABLE && variable_insert_point==block.body.end())
960 variable_insert_point = i;
963 block.body.erase(i++);
970 ProgramCompiler::InlineableFunctionLocator::InlineableFunctionLocator():
974 void ProgramCompiler::InlineableFunctionLocator::visit(FunctionCall &call)
976 FunctionDeclaration *def = call.declaration;
977 if(def && def->definition!=def)
978 def = def->definition;
982 unsigned &count = refcounts[def];
984 if(count>1 || def==in_function)
985 inlineable.erase(def);
988 TraversingVisitor::visit(call);
991 void ProgramCompiler::InlineableFunctionLocator::visit(FunctionDeclaration &func)
993 unsigned &count = refcounts[func.definition];
994 if(!count && func.parameters.empty())
995 inlineable.insert(func.definition);
997 SetForScope<FunctionDeclaration *> set(in_function, &func);
998 TraversingVisitor::visit(func);
1002 ProgramCompiler::FunctionInliner::FunctionInliner():
1006 ProgramCompiler::FunctionInliner::FunctionInliner(const set<FunctionDeclaration *> &in):
1011 void ProgramCompiler::FunctionInliner::visit_and_inline(RefPtr<Expression> &ptr)
1016 ptr = inline_result;
1019 void ProgramCompiler::FunctionInliner::visit(Block &block)
1024 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
1032 void ProgramCompiler::FunctionInliner::visit(UnaryExpression &unary)
1034 visit_and_inline(unary.expression);
1038 void ProgramCompiler::FunctionInliner::visit(BinaryExpression &binary)
1040 visit_and_inline(binary.left);
1041 visit_and_inline(binary.right);
1045 void ProgramCompiler::FunctionInliner::visit(FunctionCall &call)
1047 for(vector<RefPtr<Expression> >::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
1048 visit_and_inline(*i);
1050 FunctionDeclaration *def = call.declaration;
1051 if(def && def->definition!=def)
1052 def = def->definition;
1054 if(def && inlineable.count(def))
1063 void ProgramCompiler::FunctionInliner::visit(Return &ret)
1065 TraversingVisitor::visit(ret);
1068 inline_result = ret.expression->clone();
1072 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator():
1078 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator(const ValueMap &v):
1079 variable_values(&v),
1084 void ProgramCompiler::ExpressionEvaluator::visit(Literal &literal)
1086 if(literal.token=="true")
1088 else if(literal.token=="false")
1091 result = lexical_cast<float>(literal.token);
1092 result_valid = true;
1095 void ProgramCompiler::ExpressionEvaluator::visit(ParenthesizedExpression &parexp)
1097 parexp.expression->visit(*this);
1100 void ProgramCompiler::ExpressionEvaluator::visit(VariableReference &var)
1102 if(!var.declaration)
1107 ValueMap::const_iterator i = variable_values->find(var.declaration);
1108 if(i!=variable_values->end())
1109 i->second->visit(*this);
1111 else if(var.declaration->init_expression)
1112 var.declaration->init_expression->visit(*this);
1115 void ProgramCompiler::ExpressionEvaluator::visit(UnaryExpression &unary)
1117 result_valid = false;
1118 unary.expression->visit(*this);
1125 result_valid = false;
1128 void ProgramCompiler::ExpressionEvaluator::visit(BinaryExpression &binary)
1130 result_valid = false;
1131 binary.left->visit(*this);
1135 float left_result = result;
1136 result_valid = false;
1137 binary.right->visit(*this);
1141 if(binary.oper=="<")
1142 result = (left_result<result);
1143 else if(binary.oper=="<=")
1144 result = (left_result<=result);
1145 else if(binary.oper==">")
1146 result = (left_result>result);
1147 else if(binary.oper==">=")
1148 result = (left_result>=result);
1149 else if(binary.oper=="==")
1150 result = (left_result==result);
1151 else if(binary.oper=="!=")
1152 result = (left_result!=result);
1153 else if(binary.oper=="&&")
1154 result = (left_result && result);
1155 else if(binary.oper=="||")
1156 result = (left_result || result);
1158 result_valid = false;
1162 ProgramCompiler::ConstantConditionEliminator::ConstantConditionEliminator():
1166 void ProgramCompiler::ConstantConditionEliminator::visit(Block &block)
1168 SetForScope<unsigned> set(scope_level, scope_level+1);
1169 BlockModifier::visit(block);
1171 for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
1172 variable_values.erase(i->second);
1175 void ProgramCompiler::ConstantConditionEliminator::visit(Assignment &assign)
1177 variable_values.erase(assign.target_declaration);
1180 void ProgramCompiler::ConstantConditionEliminator::visit(VariableDeclaration &var)
1182 if(var.constant || scope_level>1)
1183 variable_values[&var] = var.init_expression.get();
1186 void ProgramCompiler::ConstantConditionEliminator::visit(Conditional &cond)
1188 ExpressionEvaluator eval(variable_values);
1189 cond.condition->visit(eval);
1190 if(eval.result_valid)
1191 flatten_block(eval.result ? cond.body : cond.else_body);
1193 TraversingVisitor::visit(cond);
1196 void ProgramCompiler::ConstantConditionEliminator::visit(Iteration &iter)
1200 ExpressionEvaluator eval;
1201 iter.condition->visit(eval);
1202 if(eval.result_valid && !eval.result)
1209 TraversingVisitor::visit(iter);
1213 ProgramCompiler::UnusedVariableLocator::UnusedVariableLocator():
1216 assignment_target(false),
1220 void ProgramCompiler::UnusedVariableLocator::apply(Stage &s)
1222 variables.push_back(BlockVariableMap());
1224 BlockVariableMap &global_variables = variables.back();
1225 for(BlockVariableMap::iterator i=global_variables.begin(); i!=global_variables.end(); ++i)
1227 if(i->first->interface=="out" && (s.type==FRAGMENT || i->first->linked_declaration || !i->first->name.compare(0, 3, "gl_")))
1229 if(!i->second.referenced)
1231 unused_nodes.insert(i->first);
1232 clear_assignments(i->second, true);
1235 variables.pop_back();
1238 void ProgramCompiler::UnusedVariableLocator::visit(VariableReference &var)
1240 map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
1241 if(i!=aggregates.end())
1242 unused_nodes.erase(i->second);
1244 if(var.declaration && !assignment_target)
1246 VariableInfo &var_info = variables.back()[var.declaration];
1247 var_info.assignments.clear();
1248 var_info.referenced = true;
1252 void ProgramCompiler::UnusedVariableLocator::visit(MemberAccess &memacc)
1254 TraversingVisitor::visit(memacc);
1255 unused_nodes.erase(memacc.declaration);
1258 void ProgramCompiler::UnusedVariableLocator::visit(BinaryExpression &binary)
1260 if(binary.oper=="[")
1262 binary.left->visit(*this);
1263 SetForScope<bool> set(assignment_target, false);
1264 binary.right->visit(*this);
1267 TraversingVisitor::visit(binary);
1270 void ProgramCompiler::UnusedVariableLocator::visit(Assignment &assign)
1273 SetForScope<bool> set(assignment_target, !assign.self_referencing);
1274 assign.left->visit(*this);
1276 assign.right->visit(*this);
1277 assignment = &assign;
1280 void ProgramCompiler::UnusedVariableLocator::record_assignment(VariableDeclaration &var, Node &node, bool self_ref)
1282 VariableInfo &var_info = variables.back()[&var];
1284 clear_assignments(var_info, true);
1285 var_info.assignments.push_back(&node);
1286 var_info.conditionally_assigned = false;
1289 void ProgramCompiler::UnusedVariableLocator::clear_assignments(VariableInfo &var_info, bool mark_unused)
1293 for(vector<Node *>::iterator i=var_info.assignments.begin(); i!=var_info.assignments.end(); ++i)
1294 unused_nodes.insert(*i);
1296 var_info.assignments.clear();
1299 void ProgramCompiler::UnusedVariableLocator::visit(ExpressionStatement &expr)
1302 TraversingVisitor::visit(expr);
1303 if(assignment && assignment->target_declaration)
1304 record_assignment(*assignment->target_declaration, expr, assignment->self_referencing);
1307 void ProgramCompiler::UnusedVariableLocator::visit(StructDeclaration &strct)
1309 SetForScope<Node *> set(aggregate, &strct);
1310 unused_nodes.insert(&strct);
1311 TraversingVisitor::visit(strct);
1314 void ProgramCompiler::UnusedVariableLocator::visit(VariableDeclaration &var)
1317 aggregates[&var] = aggregate;
1320 variables.back()[&var].local = true;
1321 if(var.init_expression)
1322 record_assignment(var, *var.init_expression, false);
1324 unused_nodes.erase(var.type_declaration);
1325 TraversingVisitor::visit(var);
1328 void ProgramCompiler::UnusedVariableLocator::visit(InterfaceBlock &iface)
1330 SetForScope<Node *> set(aggregate, &iface);
1331 unused_nodes.insert(&iface);
1332 TraversingVisitor::visit(iface);
1335 void ProgramCompiler::UnusedVariableLocator::visit(FunctionDeclaration &func)
1337 variables.push_back(BlockVariableMap());
1340 SetForScope<bool> set(global_scope, false);
1341 for(vector<RefPtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1343 func.body.visit(*this);
1346 BlockVariableMap &block_variables = variables.back();
1347 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1348 i->second.conditionally_assigned = true;
1349 for(vector<RefPtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1350 block_variables[i->get()].referenced = true;
1351 merge_down_variables();
1354 void ProgramCompiler::UnusedVariableLocator::merge_down_variables()
1356 BlockVariableMap &parent_variables = variables[variables.size()-2];
1357 BlockVariableMap &block_variables = variables.back();
1358 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1362 if(!i->second.referenced)
1363 unused_nodes.insert(i->first);
1364 clear_assignments(i->second, true);
1368 BlockVariableMap::iterator j = parent_variables.find(i->first);
1369 if(j==parent_variables.end())
1370 parent_variables.insert(*i);
1373 if(i->second.referenced || !i->second.conditionally_assigned)
1374 clear_assignments(j->second, !i->second.referenced);
1375 j->second.conditionally_assigned = i->second.conditionally_assigned;
1376 j->second.referenced |= i->second.referenced;
1377 j->second.assignments.insert(j->second.assignments.end(), i->second.assignments.begin(), i->second.assignments.end());
1380 variables.pop_back();
1383 void ProgramCompiler::UnusedVariableLocator::visit(Conditional &cond)
1385 cond.condition->visit(*this);
1386 variables.push_back(BlockVariableMap());
1387 cond.body.visit(*this);
1389 BlockVariableMap if_variables;
1390 swap(variables.back(), if_variables);
1391 cond.else_body.visit(*this);
1393 BlockVariableMap &else_variables = variables.back();
1394 for(BlockVariableMap::iterator i=else_variables.begin(); i!=else_variables.end(); ++i)
1396 BlockVariableMap::iterator j = if_variables.find(i->first);
1397 if(j!=if_variables.end())
1399 i->second.assignments.insert(i->second.assignments.end(), j->second.assignments.begin(), j->second.assignments.end());
1400 i->second.conditionally_assigned |= j->second.conditionally_assigned;
1401 if_variables.erase(j);
1404 i->second.conditionally_assigned = true;
1407 for(BlockVariableMap::iterator i=if_variables.begin(); i!=if_variables.end(); ++i)
1409 i->second.conditionally_assigned = true;
1410 else_variables.insert(*i);
1413 merge_down_variables();
1416 void ProgramCompiler::UnusedVariableLocator::visit(Iteration &iter)
1418 variables.push_back(BlockVariableMap());
1419 TraversingVisitor::visit(iter);
1421 BlockVariableMap &block_variables = variables.back();
1422 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1423 if(!i->second.local && i->second.referenced)
1424 i->second.assignments.clear();
1426 merge_down_variables();
1430 ProgramCompiler::UnusedVariableLocator::VariableInfo::VariableInfo():
1432 conditionally_assigned(false),
1437 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionCall &call)
1439 TraversingVisitor::visit(call);
1441 unused_nodes.erase(call.declaration);
1442 if(call.declaration && call.declaration->definition!=call.declaration)
1443 used_definitions.insert(call.declaration->definition);
1446 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionDeclaration &func)
1448 TraversingVisitor::visit(func);
1450 if((func.name!="main" || func.body.body.empty()) && !used_definitions.count(&func))
1451 unused_nodes.insert(&func);
1455 ProgramCompiler::NodeRemover::NodeRemover(const set<Node *> &r):
1459 void ProgramCompiler::NodeRemover::visit(Block &block)
1461 for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
1464 if(to_remove.count(i->get()))
1465 block.body.erase(i++);
1471 void ProgramCompiler::NodeRemover::visit(VariableDeclaration &var)
1473 if(to_remove.count(&var))
1475 stage->in_variables.erase(var.name);
1476 stage->out_variables.erase(var.name);
1477 stage->locations.erase(var.name);
1478 if(var.linked_declaration)
1479 var.linked_declaration->linked_declaration = 0;
1481 else if(var.init_expression && to_remove.count(var.init_expression.get()))
1482 var.init_expression = 0;
1486 ProgramCompiler::LegacyConverter::LegacyConverter():
1487 target_version(get_glsl_version())
1490 ProgramCompiler::LegacyConverter::LegacyConverter(const Version &v):
1494 bool ProgramCompiler::LegacyConverter::check_version(const Version &feature_version)
1496 if(target_version<feature_version)
1498 else if(stage->required_version<feature_version)
1499 stage->required_version = feature_version;
1504 void ProgramCompiler::LegacyConverter::visit(VariableReference &var)
1506 if(var.name==frag_out_name && !check_version(Version(1, 30)))
1508 var.name = "gl_FragColor";
1509 var.declaration = 0;
1512 else if(var.declaration)
1513 type = var.declaration->type;
1518 void ProgramCompiler::LegacyConverter::visit(FunctionCall &call)
1520 if(call.name=="texture" && !call.declaration && !check_version(Version(1, 30)))
1522 vector<RefPtr<Expression> >::iterator i = call.arguments.begin();
1523 if(i!=call.arguments.end())
1526 if(type=="sampler1D")
1527 call.name = "texture1D";
1528 else if(type=="sampler2D")
1529 call.name = "texture2D";
1530 else if(type=="sampler3D")
1531 call.name = "texture3D";
1532 else if(type=="sampler1DShadow")
1533 call.name = "shadow1D";
1534 else if(type=="sampler2DShadow")
1535 call.name = "shadow2D";
1537 for(; i!=call.arguments.end(); ++i)
1542 TraversingVisitor::visit(call);
1545 void ProgramCompiler::LegacyConverter::visit(VariableDeclaration &var)
1547 if(var.layout && !check_version(Version(3, 30)))
1549 vector<Layout::Qualifier>::iterator i;
1550 for(i=var.layout->qualifiers.begin(); (i!=var.layout->qualifiers.end() && i->identifier!="location"); ++i) ;
1551 if(i!=var.layout->qualifiers.end())
1553 unsigned location = lexical_cast<unsigned>(i->value);
1554 if(stage->type==VERTEX && var.interface=="in")
1556 stage->locations[var.name] = location;
1557 var.layout->qualifiers.erase(i);
1559 else if(stage->type==FRAGMENT && var.interface=="out")
1561 stage->locations[var.name] = location;
1562 var.layout->qualifiers.erase(i);
1565 if(var.layout->qualifiers.empty())
1570 if((var.interface=="in" || var.interface=="out") && !check_version(Version(1, 30)))
1572 if(stage->type==VERTEX && var.interface=="in")
1573 var.interface = "attribute";
1574 else if((stage->type==VERTEX && var.interface=="out") || (stage->type==FRAGMENT && var.interface=="in"))
1575 var.interface = "varying";
1576 else if(stage->type==FRAGMENT && var.interface=="out")
1578 frag_out_name = var.name;
1583 TraversingVisitor::visit(var);
1586 void ProgramCompiler::LegacyConverter::visit(InterfaceBlock &iface)
1588 if(!check_version(Version(1, 50)))
1589 flatten_block(iface.members);