1 #include <msp/core/raii.h>
2 #include <msp/strings/format.h>
3 #include <msp/strings/utils.h>
6 #include "programcompiler.h"
14 const char builtins_src[] =
16 "out gl_PerVertex {\n"
17 " vec4 gl_Position;\n"
18 " float gl_ClipDistance[];\n"
22 " vec4 gl_Position;\n"
23 " float gl_ClipDistance[];\n"
25 "out gl_PerVertex {\n"
26 " vec4 gl_Position;\n"
27 " float gl_ClipDistance[];\n"
35 using namespace ProgramSyntax;
37 ProgramCompiler::ProgramCompiler():
42 void ProgramCompiler::compile(const string &source)
45 module = &parser.parse(source);
49 void ProgramCompiler::compile(IO::Base &io, Resources *res)
52 module = &parser.parse(io);
56 void ProgramCompiler::add_shaders(Program &program)
59 throw invalid_operation("ProgramCompiler::add_shaders");
61 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
65 program.attach_shader_owned(new VertexShader(apply<Formatter>(*i)));
66 for(map<string, unsigned>::iterator j=i->locations.begin(); j!=i->locations.end(); ++j)
67 program.bind_attribute(j->second, j->first);
69 else if(i->type==GEOMETRY)
70 program.attach_shader_owned(new GeometryShader(apply<Formatter>(*i)));
71 else if(i->type==FRAGMENT)
73 program.attach_shader_owned(new FragmentShader(apply<Formatter>(*i)));
74 for(map<string, unsigned>::iterator j=i->locations.begin(); j!=i->locations.end(); ++j)
75 program.bind_fragment_data(j->second, j->first);
80 Module *ProgramCompiler::create_builtins_module()
83 Module *module = new Module(parser.parse(builtins_src));
84 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
86 VariableResolver resolver;
87 i->content.visit(resolver);
88 for(map<string, VariableDeclaration *>::iterator j=i->content.variables.begin(); j!=i->content.variables.end(); ++j)
89 j->second->linked_declaration = j->second;
94 Module &ProgramCompiler::get_builtins_module()
96 static RefPtr<Module> builtins_module = create_builtins_module();
97 return *builtins_module;
100 Stage *ProgramCompiler::get_builtins(StageType type)
102 Module &module = get_builtins_module();
103 for(list<Stage>::iterator i=module.stages.begin(); i!=module.stages.end(); ++i)
109 void ProgramCompiler::process()
111 list<Import *> imports = apply<NodeGatherer<Import> >(module->shared);
112 for(list<Import *>::iterator i=imports.end(); i!=imports.begin(); )
113 import((*--i)->module);
114 apply<NodeRemover>(module->shared, set<Node *>(imports.begin(), imports.end()));
116 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
118 for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); )
121 i = module->stages.begin();
127 void ProgramCompiler::import(const string &name)
129 string fn = name+".glsl";
130 RefPtr<IO::Seekable> io = (resources ? resources->open_raw(fn) : Resources::get_builtins().open(fn));
132 throw runtime_error(format("module %s not found", name));
133 ProgramParser import_parser;
134 Module &imported_module = import_parser.parse(*io);
136 inject_block(module->shared.content, imported_module.shared.content);
137 apply<DeclarationCombiner>(module->shared);
138 for(list<Stage>::iterator i=imported_module.stages.begin(); i!=imported_module.stages.end(); ++i)
140 list<Stage>::iterator j;
141 for(j=module->stages.begin(); (j!=module->stages.end() && j->type<i->type); ++j) ;
142 if(j==module->stages.end() || j->type>i->type)
144 j = module->stages.insert(j, *i);
145 list<Stage>::iterator k = j;
146 if(++k!=module->stages.end())
148 if(j!=module->stages.begin())
149 j->previous = &*--(k=j);
153 inject_block(j->content, i->content);
154 apply<DeclarationCombiner>(*j);
159 void ProgramCompiler::generate(Stage &stage)
161 inject_block(stage.content, module->shared.content);
163 apply<FunctionResolver>(stage);
164 apply<VariableResolver>(stage);
165 apply<InterfaceGenerator>(stage);
166 apply<VariableResolver>(stage);
167 apply<VariableRenamer>(stage);
168 apply<LegacyConverter>(stage);
169 apply<VariableResolver>(stage);
172 bool ProgramCompiler::optimize(Stage &stage)
174 apply<ConstantConditionEliminator>(stage);
175 apply<VariableResolver>(stage);
177 set<Node *> unused = apply<UnusedVariableLocator>(stage);
178 set<Node *> unused2 = apply<UnusedFunctionLocator>(stage);
179 unused.insert(unused2.begin(), unused2.end());
180 apply<NodeRemover>(stage, unused);
182 return !unused.empty();
185 void ProgramCompiler::inject_block(Block &target, const Block &source)
187 list<NodePtr<Node> >::iterator insert_point = target.body.begin();
188 for(list<NodePtr<Node> >::const_iterator i=source.body.begin(); i!=source.body.end(); ++i)
189 target.body.insert(insert_point, (*i)->clone());
193 typename T::ResultType ProgramCompiler::apply(Stage &stage)
196 visitor.apply(stage);
197 return visitor.get_result();
200 template<typename T, typename A>
201 typename T::ResultType ProgramCompiler::apply(Stage &stage, const A &arg)
204 visitor.apply(stage);
205 return visitor.get_result();
209 ProgramCompiler::Visitor::Visitor():
213 void ProgramCompiler::Visitor::apply(Stage &s)
215 SetForScope<Stage *> set(stage, &s);
216 stage->content.visit(*this);
220 ProgramCompiler::Formatter::Formatter():
222 parameter_list(false),
226 void ProgramCompiler::Formatter::apply(ProgramSyntax::Stage &s)
228 const Version &ver = s.required_version;
230 formatted += format("#version %d%d\n", ver.major, ver.minor);
234 void ProgramCompiler::Formatter::visit(Literal &literal)
236 formatted += literal.token;
239 void ProgramCompiler::Formatter::visit(ParenthesizedExpression &parexpr)
242 parexpr.expression->visit(*this);
246 void ProgramCompiler::Formatter::visit(VariableReference &var)
248 formatted += var.name;
251 void ProgramCompiler::Formatter::visit(MemberAccess &memacc)
253 memacc.left->visit(*this);
254 formatted += format(".%s", memacc.member);
257 void ProgramCompiler::Formatter::visit(UnaryExpression &unary)
260 formatted += unary.oper;
261 unary.expression->visit(*this);
263 formatted += unary.oper;
266 void ProgramCompiler::Formatter::visit(BinaryExpression &binary)
268 binary.left->visit(*this);
269 formatted += binary.oper;
270 binary.right->visit(*this);
271 formatted += binary.after;
274 void ProgramCompiler::Formatter::visit(Assignment &assign)
276 assign.left->visit(*this);
277 formatted += format(" %s ", assign.oper);
278 assign.right->visit(*this);
281 void ProgramCompiler::Formatter::visit(FunctionCall &call)
283 formatted += format("%s(", call.name);
284 for(vector<NodePtr<Expression> >::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
286 if(i!=call.arguments.begin())
293 void ProgramCompiler::Formatter::visit(ExpressionStatement &expr)
295 expr.expression->visit(*this);
299 void ProgramCompiler::Formatter::visit(Block &block)
304 unsigned brace_indent = indent;
305 bool use_braces = (block.use_braces || (indent && block.body.size()!=1));
307 formatted += format("%s{\n", string(brace_indent*2, ' '));
309 SetForScope<unsigned> set(indent, indent+(indent>0 || use_braces));
310 string spaces(indent*2, ' ');
311 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
313 if(i!=block.body.begin())
321 formatted += format("\n%s}", string(brace_indent*2, ' '));
324 void ProgramCompiler::Formatter::visit(Import &import)
326 formatted += format("import %s;", import.module);
329 void ProgramCompiler::Formatter::visit(Layout &layout)
331 formatted += "layout(";
332 for(vector<Layout::Qualifier>::const_iterator i=layout.qualifiers.begin(); i!=layout.qualifiers.end(); ++i)
334 if(i!=layout.qualifiers.begin())
336 formatted += i->identifier;
337 if(!i->value.empty())
338 formatted += format("=%s", i->value);
343 void ProgramCompiler::Formatter::visit(InterfaceLayout &layout)
345 layout.layout.visit(*this);
346 formatted += format(" %s;", layout.interface);
349 void ProgramCompiler::Formatter::visit(StructDeclaration &strct)
351 formatted += format("struct %s\n", strct.name);
352 strct.members.visit(*this);
356 void ProgramCompiler::Formatter::visit(VariableDeclaration &var)
360 var.layout->visit(*this);
364 formatted += "const ";
365 if(!var.sampling.empty())
366 formatted += format("%s ", var.sampling);
367 if(!var.interface.empty() && var.interface!=block_interface)
368 formatted += format("%s ", var.interface);
369 formatted += format("%s %s", var.type, var.name);
374 var.array_size->visit(*this);
377 if(var.init_expression)
380 var.init_expression->visit(*this);
386 void ProgramCompiler::Formatter::visit(InterfaceBlock &iface)
388 SetForScope<string> set(block_interface, iface.interface);
389 formatted += format("%s %s\n", iface.interface, iface.name);
390 iface.members.visit(*this);
394 void ProgramCompiler::Formatter::visit(FunctionDeclaration &func)
396 formatted += format("%s %s(", func.return_type, func.name);
397 for(vector<NodePtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
399 if(i!=func.parameters.begin())
401 SetFlag set(parameter_list);
405 if(func.definition==&func)
408 func.body.visit(*this);
414 void ProgramCompiler::Formatter::visit(Conditional &cond)
417 formatted.replace(formatted.rfind('\n'), string::npos, 1, ' ');
422 cond.condition->visit(*this);
425 cond.body.visit(*this);
426 if(!cond.else_body.body.empty())
428 formatted += format("\n%selse\n", string(indent*2, ' '));
429 SetForScope<unsigned> set(else_if, 2);
430 cond.else_body.visit(*this);
434 void ProgramCompiler::Formatter::visit(Iteration &iter)
437 iter.init_statement->visit(*this);
439 iter.condition->visit(*this);
441 iter.loop_expression->visit(*this);
443 iter.body.visit(*this);
446 void ProgramCompiler::Formatter::visit(Return &ret)
448 formatted += "return ";
449 ret.expression->visit(*this);
454 ProgramCompiler::DeclarationCombiner::DeclarationCombiner():
459 void ProgramCompiler::DeclarationCombiner::visit(Block &block)
464 SetForScope<bool> set(toplevel, false);
465 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
470 block.body.erase(i++);
476 void ProgramCompiler::DeclarationCombiner::visit(FunctionDeclaration &func)
478 vector<FunctionDeclaration *> &decls = functions[func.name];
481 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
483 (*i)->definition = func.definition;
484 (*i)->body.body.clear();
487 decls.push_back(&func);
490 void ProgramCompiler::DeclarationCombiner::visit(VariableDeclaration &var)
492 VariableDeclaration *&ptr = variables[var.name];
495 ptr->type = var.type;
496 if(var.init_expression)
497 ptr->init_expression = var.init_expression;
505 ProgramCompiler::VariableResolver::VariableResolver():
507 record_target(false),
508 assignment_target(0),
509 self_referencing(false)
512 void ProgramCompiler::VariableResolver::apply(Stage &s)
514 SetForScope<Stage *> set(stage, &s);
515 Stage *builtins = get_builtins(stage->type);
517 blocks.push_back(&builtins->content);
518 stage->content.visit(*this);
523 void ProgramCompiler::VariableResolver::visit(Block &block)
525 blocks.push_back(&block);
526 block.variables.clear();
527 TraversingVisitor::visit(block);
531 void ProgramCompiler::VariableResolver::visit(VariableReference &var)
535 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
538 map<string, VariableDeclaration *>::iterator j = (*i)->variables.find(var.name);
539 if(j!=(*i)->variables.end())
541 var.declaration = j->second;
542 type = j->second->type_declaration;
549 if(assignment_target)
551 record_target = false;
552 assignment_target = 0;
555 assignment_target = var.declaration;
557 else if(var.declaration && var.declaration==assignment_target)
558 self_referencing = true;
561 void ProgramCompiler::VariableResolver::visit(MemberAccess &memacc)
564 TraversingVisitor::visit(memacc);
565 memacc.declaration = 0;
568 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
569 if(i!=type->members.variables.end())
571 memacc.declaration = i->second;
572 type = i->second->type_declaration;
579 void ProgramCompiler::VariableResolver::visit(BinaryExpression &binary)
584 SetForScope<bool> set(record_target, false);
585 binary.right->visit(*this);
588 binary.left->visit(*this);
592 TraversingVisitor::visit(binary);
597 void ProgramCompiler::VariableResolver::visit(Assignment &assign)
600 SetFlag set(record_target);
601 assignment_target = 0;
602 assign.left->visit(*this);
605 self_referencing = false;
606 assign.right->visit(*this);
608 assign.self_referencing = (self_referencing || assign.oper!="=");
609 assign.target_declaration = assignment_target;
612 void ProgramCompiler::VariableResolver::visit(StructDeclaration &strct)
614 TraversingVisitor::visit(strct);
615 blocks.back()->types[strct.name] = &strct;
618 void ProgramCompiler::VariableResolver::visit(VariableDeclaration &var)
620 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
623 map<string, StructDeclaration *>::iterator j = (*i)->types.find(var.type);
624 if(j!=(*i)->types.end())
625 var.type_declaration = j->second;
628 if(!block_interface.empty() && var.interface.empty())
629 var.interface = block_interface;
631 TraversingVisitor::visit(var);
632 blocks.back()->variables[var.name] = &var;
633 if(anonymous && blocks.size()>1)
634 blocks[blocks.size()-2]->variables[var.name] = &var;
637 void ProgramCompiler::VariableResolver::visit(InterfaceBlock &iface)
639 SetFlag set(anonymous);
640 SetForScope<string> set2(block_interface, iface.interface);
641 TraversingVisitor::visit(iface);
645 void ProgramCompiler::FunctionResolver::visit(FunctionCall &call)
647 map<string, vector<FunctionDeclaration *> >::iterator i = functions.find(call.name);
648 if(i!=functions.end())
649 call.declaration = i->second.back();
651 TraversingVisitor::visit(call);
654 void ProgramCompiler::FunctionResolver::visit(FunctionDeclaration &func)
656 vector<FunctionDeclaration *> &decls = functions[func.name];
659 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
660 (*i)->definition = func.definition;
662 decls.push_back(&func);
664 else if(!decls.empty() && decls.back()->definition)
665 func.definition = decls.back()->definition;
667 decls.push_back(&func);
669 TraversingVisitor::visit(func);
673 ProgramCompiler::BlockModifier::BlockModifier():
677 void ProgramCompiler::BlockModifier::flatten_block(Block &block)
679 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
680 insert_nodes.push_back((*i)->clone());
684 void ProgramCompiler::BlockModifier::apply_and_increment(Block &block, list<NodePtr<Node> >::iterator &i)
686 for(list<Node *>::iterator j=insert_nodes.begin(); j!=insert_nodes.end(); ++j)
687 block.body.insert(i, *j);
688 insert_nodes.clear();
691 block.body.erase(i++);
697 void ProgramCompiler::BlockModifier::visit(Block &block)
699 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
702 apply_and_increment(block, i);
707 ProgramCompiler::InterfaceGenerator::InterfaceGenerator():
711 string ProgramCompiler::InterfaceGenerator::get_out_prefix(StageType type)
715 else if(type==GEOMETRY)
721 void ProgramCompiler::InterfaceGenerator::apply(Stage &s)
723 SetForScope<Stage *> set(stage, &s);
725 in_prefix = get_out_prefix(stage->previous->type);
726 out_prefix = get_out_prefix(stage->type);
727 stage->content.visit(*this);
730 void ProgramCompiler::InterfaceGenerator::visit(Block &block)
732 SetForScope<unsigned> set(scope_level, scope_level+1);
733 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
739 for(map<string, VariableDeclaration *>::iterator j=iface_declarations.begin(); j!=iface_declarations.end(); ++j)
741 list<NodePtr<Node> >::iterator k = block.body.insert(i, j->second);
744 iface_declarations.clear();
747 apply_and_increment(block, i);
751 string ProgramCompiler::InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
753 unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
754 return prefix+name.substr(offset);
757 bool ProgramCompiler::InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
759 const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
760 if(stage_vars.count(name) || iface_declarations.count(name))
763 VariableDeclaration* iface_var = new VariableDeclaration;
764 iface_var->sampling = var.sampling;
765 iface_var->interface = iface;
766 iface_var->type = var.type;
767 iface_var->type_declaration = var.type_declaration;
768 iface_var->name = name;
769 if(stage->type==GEOMETRY)
770 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
772 iface_var->array = var.array;
774 iface_var->array_size = var.array_size;
776 iface_var->linked_declaration = &var;
777 iface_declarations[name] = iface_var;
782 void ProgramCompiler::InterfaceGenerator::insert_assignment(const string &left, ProgramSyntax::Expression *right)
784 Assignment *assign = new Assignment;
785 VariableReference *ref = new VariableReference;
789 assign->right = right;
791 ExpressionStatement *stmt = new ExpressionStatement;
792 stmt->expression = assign;
793 insert_nodes.push_back(stmt);
796 void ProgramCompiler::InterfaceGenerator::visit(VariableReference &var)
798 if(var.declaration || !stage->previous)
800 if(iface_declarations.count(var.name))
803 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
804 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
805 if(i==prev_out.end())
806 i = prev_out.find(in_prefix+var.name);
807 if(i!=prev_out.end())
808 generate_interface(*i->second, "in", var.name);
811 void ProgramCompiler::InterfaceGenerator::visit(VariableDeclaration &var)
813 if(var.interface=="out")
816 stage->out_variables[var.name] = &var;
817 else if(generate_interface(var, "out", change_prefix(var.name, string())))
820 if(var.init_expression)
821 insert_assignment(var.name, var.init_expression->clone());
824 else if(var.interface=="in")
826 stage->in_variables[var.name] = &var;
827 if(var.linked_declaration)
828 var.linked_declaration->linked_declaration = &var;
829 else if(stage->previous)
831 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
832 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
833 if(i!=prev_out.end())
835 var.linked_declaration = i->second;
836 i->second->linked_declaration = &var;
841 TraversingVisitor::visit(var);
844 void ProgramCompiler::InterfaceGenerator::visit(Passthrough &pass)
846 vector<VariableDeclaration *> pass_vars;
848 for(map<string, VariableDeclaration *>::const_iterator i=stage->in_variables.begin(); i!=stage->in_variables.end(); ++i)
849 pass_vars.push_back(i->second);
850 for(map<string, VariableDeclaration *>::const_iterator i=iface_declarations.begin(); i!=iface_declarations.end(); ++i)
851 if(i->second->interface=="in")
852 pass_vars.push_back(i->second);
856 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
857 for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
860 for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
861 linked = ((*j)->linked_declaration==i->second);
863 if(!linked && generate_interface(*i->second, "in", i->second->name))
864 pass_vars.push_back(i->second);
868 if(stage->type==GEOMETRY)
870 VariableReference *ref = new VariableReference;
873 BinaryExpression *subscript = new BinaryExpression;
874 subscript->left = ref;
875 subscript->oper = "[";
876 subscript->right = pass.subscript;
877 subscript->after = "]";
879 MemberAccess *memacc = new MemberAccess;
880 memacc->left = subscript;
881 memacc->member = "gl_Position";
883 insert_assignment("gl_Position", memacc);
886 for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
888 string out_name = change_prefix((*i)->name, out_prefix);
889 generate_interface(**i, "out", out_name);
891 VariableReference *ref = new VariableReference;
892 ref->name = (*i)->name;
895 BinaryExpression *subscript = new BinaryExpression;
896 subscript->left = ref;
897 subscript->oper = "[";
898 subscript->right = pass.subscript;
899 subscript->after = "]";
900 insert_assignment(out_name, subscript);
903 insert_assignment(out_name, ref);
910 void ProgramCompiler::VariableRenamer::visit(VariableReference &var)
913 var.name = var.declaration->name;
916 void ProgramCompiler::VariableRenamer::visit(VariableDeclaration &var)
918 if(var.linked_declaration)
919 var.name = var.linked_declaration->name;
920 TraversingVisitor::visit(var);
924 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator():
930 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator(const ValueMap &v):
936 void ProgramCompiler::ExpressionEvaluator::visit(Literal &literal)
938 if(literal.token=="true")
940 else if(literal.token=="false")
943 result = lexical_cast<float>(literal.token);
947 void ProgramCompiler::ExpressionEvaluator::visit(ParenthesizedExpression &parexp)
949 parexp.expression->visit(*this);
952 void ProgramCompiler::ExpressionEvaluator::visit(VariableReference &var)
959 ValueMap::const_iterator i = variable_values->find(var.declaration);
960 if(i!=variable_values->end())
961 i->second->visit(*this);
963 else if(var.declaration->init_expression)
964 var.declaration->init_expression->visit(*this);
967 void ProgramCompiler::ExpressionEvaluator::visit(UnaryExpression &unary)
969 result_valid = false;
970 unary.expression->visit(*this);
977 result_valid = false;
980 void ProgramCompiler::ExpressionEvaluator::visit(BinaryExpression &binary)
982 result_valid = false;
983 binary.left->visit(*this);
987 float left_result = result;
988 result_valid = false;
989 binary.right->visit(*this);
994 result = (left_result<result);
995 else if(binary.oper=="<=")
996 result = (left_result<=result);
997 else if(binary.oper==">")
998 result = (left_result>result);
999 else if(binary.oper==">=")
1000 result = (left_result>=result);
1001 else if(binary.oper=="==")
1002 result = (left_result==result);
1003 else if(binary.oper=="!=")
1004 result = (left_result!=result);
1005 else if(binary.oper=="&&")
1006 result = (left_result && result);
1007 else if(binary.oper=="||")
1008 result = (left_result || result);
1010 result_valid = false;
1014 ProgramCompiler::ConstantConditionEliminator::ConstantConditionEliminator():
1018 void ProgramCompiler::ConstantConditionEliminator::visit(Block &block)
1020 SetForScope<unsigned> set(scope_level, scope_level+1);
1021 BlockModifier::visit(block);
1023 for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
1024 variable_values.erase(i->second);
1027 void ProgramCompiler::ConstantConditionEliminator::visit(Assignment &assign)
1029 variable_values.erase(assign.target_declaration);
1032 void ProgramCompiler::ConstantConditionEliminator::visit(VariableDeclaration &var)
1034 if(var.constant || scope_level>1)
1035 variable_values[&var] = &*var.init_expression;
1038 void ProgramCompiler::ConstantConditionEliminator::visit(Conditional &cond)
1040 ExpressionEvaluator eval(variable_values);
1041 cond.condition->visit(eval);
1042 if(eval.result_valid)
1043 flatten_block(eval.result ? cond.body : cond.else_body);
1045 TraversingVisitor::visit(cond);
1048 void ProgramCompiler::ConstantConditionEliminator::visit(Iteration &iter)
1052 ExpressionEvaluator eval;
1053 iter.condition->visit(eval);
1054 if(eval.result_valid && !eval.result)
1061 TraversingVisitor::visit(iter);
1065 ProgramCompiler::UnusedVariableLocator::UnusedVariableLocator():
1068 assignment_target(false)
1071 void ProgramCompiler::UnusedVariableLocator::apply(Stage &s)
1073 assignments.push_back(BlockAssignmentMap());
1075 assignments.pop_back();
1078 void ProgramCompiler::UnusedVariableLocator::visit(VariableReference &var)
1080 unused_nodes.erase(var.declaration);
1082 map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
1083 if(i!=aggregates.end())
1084 unused_nodes.erase(i->second);
1086 if(assignment_target)
1089 for(vector<BlockAssignmentMap>::iterator j=assignments.end(); j!=assignments.begin(); )
1092 BlockAssignmentMap::iterator k = j->find(var.declaration);
1095 for(vector<Node *>::iterator l=k->second.nodes.begin(); l!=k->second.nodes.end(); ++l)
1096 unused_nodes.erase(*l);
1103 void ProgramCompiler::UnusedVariableLocator::visit(MemberAccess &memacc)
1105 TraversingVisitor::visit(memacc);
1106 unused_nodes.erase(memacc.declaration);
1109 void ProgramCompiler::UnusedVariableLocator::visit(BinaryExpression &binary)
1111 if(binary.oper=="[")
1113 binary.left->visit(*this);
1114 SetForScope<bool> set(assignment_target, false);
1115 binary.right->visit(*this);
1118 TraversingVisitor::visit(binary);
1121 void ProgramCompiler::UnusedVariableLocator::visit(Assignment &assign)
1124 SetForScope<bool> set(assignment_target, !assign.self_referencing);
1125 assign.left->visit(*this);
1127 assign.right->visit(*this);
1128 assignment = &assign;
1131 void ProgramCompiler::UnusedVariableLocator::record_assignment(VariableDeclaration &var, Node &node, bool self_ref)
1133 unused_nodes.insert(&node);
1134 BlockAssignmentMap &block_assignments = assignments.back();
1135 AssignmentList &var_assignments = block_assignments[&var];
1137 var_assignments.nodes.clear();
1138 var_assignments.nodes.push_back(&node);
1139 var_assignments.conditional = false;
1140 var_assignments.self_referencing = self_ref;
1143 void ProgramCompiler::UnusedVariableLocator::visit(ExpressionStatement &expr)
1146 TraversingVisitor::visit(expr);
1147 if(assignment && assignment->target_declaration)
1148 record_assignment(*assignment->target_declaration, expr, assignment->self_referencing);
1151 void ProgramCompiler::UnusedVariableLocator::visit(StructDeclaration &strct)
1153 SetForScope<Node *> set(aggregate, &strct);
1154 unused_nodes.insert(&strct);
1155 TraversingVisitor::visit(strct);
1158 void ProgramCompiler::UnusedVariableLocator::visit(VariableDeclaration &var)
1161 aggregates[&var] = aggregate;
1164 unused_nodes.insert(&var);
1165 if(var.init_expression)
1166 record_assignment(var, *var.init_expression, false);
1168 unused_nodes.erase(var.type_declaration);
1169 TraversingVisitor::visit(var);
1172 void ProgramCompiler::UnusedVariableLocator::visit(InterfaceBlock &iface)
1174 SetForScope<Node *> set(aggregate, &iface);
1175 unused_nodes.insert(&iface);
1176 TraversingVisitor::visit(iface);
1179 void ProgramCompiler::UnusedVariableLocator::visit(FunctionDeclaration &func)
1181 assignments.push_back(BlockAssignmentMap());
1183 for(vector<NodePtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1185 func.body.visit(*this);
1187 BlockAssignmentMap &block_assignments = assignments.back();
1188 for(map<string, VariableDeclaration *>::iterator i=func.body.variables.begin(); i!=func.body.variables.end(); ++i)
1189 block_assignments.erase(i->second);
1190 for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
1192 if(i->first->interface=="out" && stage->type!=FRAGMENT && !i->first->linked_declaration)
1195 for(vector<Node *>::iterator j=i->second.nodes.begin(); j!=i->second.nodes.end(); ++j)
1196 unused_nodes.erase(*j);
1199 assignments.pop_back();
1202 void ProgramCompiler::UnusedVariableLocator::merge_down_assignments()
1204 BlockAssignmentMap &parent_assignments = assignments[assignments.size()-2];
1205 BlockAssignmentMap &block_assignments = assignments.back();
1206 for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
1208 BlockAssignmentMap::iterator j = parent_assignments.find(i->first);
1209 if(j==parent_assignments.end())
1210 parent_assignments.insert(*i);
1211 else if(i->second.self_referencing || i->second.conditional)
1213 j->second.nodes.insert(j->second.nodes.end(), i->second.nodes.begin(), i->second.nodes.end());
1214 j->second.conditional |= i->second.conditional;
1215 j->second.self_referencing |= i->second.self_referencing;
1218 j->second = i->second;
1220 assignments.pop_back();
1223 void ProgramCompiler::UnusedVariableLocator::visit(Conditional &cond)
1225 cond.condition->visit(*this);
1226 assignments.push_back(BlockAssignmentMap());
1227 cond.body.visit(*this);
1229 BlockAssignmentMap if_assignments;
1230 swap(assignments.back(), if_assignments);
1231 cond.else_body.visit(*this);
1233 BlockAssignmentMap &else_assignments = assignments.back();
1234 for(BlockAssignmentMap::iterator i=else_assignments.begin(); i!=else_assignments.end(); ++i)
1236 BlockAssignmentMap::iterator j = if_assignments.find(i->first);
1237 if(j!=if_assignments.end())
1239 i->second.nodes.insert(i->second.nodes.end(), j->second.nodes.begin(), j->second.nodes.end());
1240 i->second.conditional |= j->second.conditional;
1241 i->second.self_referencing |= j->second.self_referencing;
1242 if_assignments.erase(j);
1245 i->second.conditional = true;
1248 for(BlockAssignmentMap::iterator i=if_assignments.begin(); i!=if_assignments.end(); ++i)
1250 i->second.conditional = true;
1251 else_assignments.insert(*i);
1254 merge_down_assignments();
1257 void ProgramCompiler::UnusedVariableLocator::visit(Iteration &iter)
1259 assignments.push_back(BlockAssignmentMap());
1260 TraversingVisitor::visit(iter);
1261 merge_down_assignments();
1265 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionCall &call)
1267 TraversingVisitor::visit(call);
1269 unused_nodes.erase(call.declaration);
1270 if(call.declaration && call.declaration->definition!=call.declaration)
1271 used_definitions.insert(call.declaration->definition);
1274 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionDeclaration &func)
1276 TraversingVisitor::visit(func);
1278 if(func.name!="main" && !used_definitions.count(&func))
1279 unused_nodes.insert(&func);
1283 ProgramCompiler::NodeRemover::NodeRemover(const set<Node *> &r):
1287 void ProgramCompiler::NodeRemover::visit(Block &block)
1289 for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
1292 if(to_remove.count(&**i))
1293 block.body.erase(i++);
1299 void ProgramCompiler::NodeRemover::visit(VariableDeclaration &var)
1301 if(to_remove.count(&var))
1303 stage->in_variables.erase(var.name);
1304 stage->out_variables.erase(var.name);
1305 stage->locations.erase(var.name);
1306 if(var.linked_declaration)
1307 var.linked_declaration->linked_declaration = 0;
1309 else if(var.init_expression && to_remove.count(&*var.init_expression))
1310 var.init_expression = 0;
1314 ProgramCompiler::LegacyConverter::LegacyConverter():
1315 target_version(get_glsl_version())
1318 ProgramCompiler::LegacyConverter::LegacyConverter(const Version &v):
1322 bool ProgramCompiler::LegacyConverter::check_version(const Version &feature_version)
1324 if(target_version<feature_version)
1326 else if(stage->required_version<feature_version)
1327 stage->required_version = feature_version;
1332 void ProgramCompiler::LegacyConverter::visit(VariableReference &var)
1334 if(var.name==frag_out_name && !check_version(Version(1, 30)))
1336 var.name = "gl_FragColor";
1337 var.declaration = 0;
1340 else if(var.declaration)
1341 type = var.declaration->type;
1346 void ProgramCompiler::LegacyConverter::visit(FunctionCall &call)
1348 if(call.name=="texture" && !call.declaration && !check_version(Version(1, 30)))
1350 vector<NodePtr<Expression> >::iterator i = call.arguments.begin();
1351 if(i!=call.arguments.end())
1354 if(type=="sampler1D")
1355 call.name = "texture1D";
1356 else if(type=="sampler2D")
1357 call.name = "texture2D";
1358 else if(type=="sampler3D")
1359 call.name = "texture3D";
1360 else if(type=="sampler1DShadow")
1361 call.name = "shadow1D";
1362 else if(type=="sampler2DShadow")
1363 call.name = "shadow2D";
1365 for(; i!=call.arguments.end(); ++i)
1370 TraversingVisitor::visit(call);
1373 void ProgramCompiler::LegacyConverter::visit(VariableDeclaration &var)
1375 if(var.layout && !check_version(Version(3, 30)))
1377 vector<Layout::Qualifier>::iterator i;
1378 for(i=var.layout->qualifiers.begin(); (i!=var.layout->qualifiers.end() && i->identifier!="location"); ++i) ;
1379 if(i!=var.layout->qualifiers.end())
1381 unsigned location = lexical_cast<unsigned>(i->value);
1382 if(stage->type==VERTEX && var.interface=="in")
1384 stage->locations[var.name] = location;
1385 var.layout->qualifiers.erase(i);
1387 else if(stage->type==FRAGMENT && var.interface=="out")
1389 stage->locations[var.name] = location;
1390 var.layout->qualifiers.erase(i);
1393 if(var.layout->qualifiers.empty())
1398 if((var.interface=="in" || var.interface=="out") && !check_version(Version(1, 30)))
1400 if(stage->type==VERTEX && var.interface=="in")
1401 var.interface = "attribute";
1402 else if((stage->type==VERTEX && var.interface=="out") || (stage->type==FRAGMENT && var.interface=="in"))
1403 var.interface = "varying";
1404 else if(stage->type==FRAGMENT && var.interface=="out")
1406 frag_out_name = var.name;
1411 TraversingVisitor::visit(var);
1414 void ProgramCompiler::LegacyConverter::visit(InterfaceBlock &iface)
1416 if(!check_version(Version(1, 50)))
1417 flatten_block(iface.members);