source/programcompiler.cpp

   1 #include <msp/core/raii.h>
   2 #include <msp/gl/extensions/ext_gpu_shader4.h>
   3 #include <msp/strings/format.h>
   4 #include <msp/strings/utils.h>
   5 #include "error.h"
   6 #include "program.h"
   7 #include "programcompiler.h"
   8 #include "resources.h"
   9 #include "shader.h"
  10
  11 using namespace std;
  12
  13 namespace {
  14
  15 const char builtins_src[] =
  16         "#pragma MSP stage(vertex)\n"
  17         "out gl_PerVertex {\n"
  18         "  vec4 gl_Position;\n"
  19         "  float gl_ClipDistance[];\n"
  20         "};\n"
  21         "#pragma MSP stage(geometry)\n"
  22         "in gl_PerVertex {\n"
  23         "  vec4 gl_Position;\n"
  24         "  float gl_ClipDistance[];\n"
  25         "} gl_in[];\n"
  26         "out gl_PerVertex {\n"
  27         "  vec4 gl_Position;\n"
  28         "  float gl_ClipDistance[];\n"
  29         "};\n";
  30
  31 }
  32
  33 namespace Msp {
  34 namespace GL {
  35
  36 using namespace ProgramSyntax;
  37
  38 // XXX For some reason global declarations are emitted for otherwise undeclared local variables
  39
  40 ProgramCompiler::ProgramCompiler():
  41         resources(0),
  42         module(0)
  43 { }
  44
  45 ProgramCompiler::~ProgramCompiler()
  46 {
  47         delete module;
  48 }
  49
  50 void ProgramCompiler::compile(const string &source, const string &src_name)
  51 {
  52         resources = 0;
  53         delete module;
  54         module = new Module();
  55         ProgramParser parser;
  56         imported_names.insert(src_name);
  57         append_module(parser.parse(source, src_name));
  58         process();
  59 }
  60
  61 void ProgramCompiler::compile(IO::Base &io, Resources *res, const string &src_name)
  62 {
  63         resources = res;
  64         delete module;
  65         module = new Module();
  66         ProgramParser parser;
  67         imported_names.insert(src_name);
  68         append_module(parser.parse(io, src_name));
  69         process();
  70 }
  71
  72 void ProgramCompiler::compile(IO::Base &io, const string &src_name)
  73 {
  74         compile(io, 0, src_name);
  75 }
  76
  77 void ProgramCompiler::add_shaders(Program &program)
  78 {
  79         if(!module)
  80                 throw invalid_operation("ProgramCompiler::add_shaders");
  81
  82         for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
  83         {
  84                 if(i->type==VERTEX)
  85                 {
  86                         program.attach_shader_owned(new VertexShader(apply<Formatter>(*i)));
  87                         for(map<string, unsigned>::iterator j=i->locations.begin(); j!=i->locations.end(); ++j)
  88                                 program.bind_attribute(j->second, j->first);
  89                 }
  90                 else if(i->type==GEOMETRY)
  91                         program.attach_shader_owned(new GeometryShader(apply<Formatter>(*i)));
  92                 else if(i->type==FRAGMENT)
  93                 {
  94                         program.attach_shader_owned(new FragmentShader(apply<Formatter>(*i)));
  95                         if(EXT_gpu_shader4)
  96                         {
  97                                 for(map<string, unsigned>::iterator j=i->locations.begin(); j!=i->locations.end(); ++j)
  98                                         program.bind_fragment_data(j->second, j->first);
  99                         }
 100                 }
 101         }
 102 }
 103
 104 Module *ProgramCompiler::create_builtins_module()
 105 {
 106         ProgramParser parser;
 107         Module *module = new Module(parser.parse(builtins_src, "<builtin>"));
 108         for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
 109         {
 110                 VariableResolver resolver;
 111                 i->content.visit(resolver);
 112                 for(map<string, VariableDeclaration *>::iterator j=i->content.variables.begin(); j!=i->content.variables.end(); ++j)
 113                         j->second->linked_declaration = j->second;
 114         }
 115         return module;
 116 }
 117
 118 Module &ProgramCompiler::get_builtins_module()
 119 {
 120         static RefPtr<Module> builtins_module = create_builtins_module();
 121         return *builtins_module;
 122 }
 123
 124 Stage *ProgramCompiler::get_builtins(StageType type)
 125 {
 126         Module &module = get_builtins_module();
 127         for(list<Stage>::iterator i=module.stages.begin(); i!=module.stages.end(); ++i)
 128                 if(i->type==type)
 129                         return &*i;
 130         return 0;
 131 }
 132
 133 void ProgramCompiler::append_module(ProgramSyntax::Module &mod)
 134 {
 135         vector<Import *> imports = apply<NodeGatherer<Import> >(mod.shared);
 136         for(vector<Import *>::iterator i=imports.begin(); i!=imports.end(); ++i)
 137                 import((*i)->module);
 138         apply<NodeRemover>(mod.shared, set<Node *>(imports.begin(), imports.end()));
 139
 140         append_stage(mod.shared);
 141         for(list<Stage>::iterator i=mod.stages.begin(); i!=mod.stages.end(); ++i)
 142                 append_stage(*i);
 143 }
 144
 145 void ProgramCompiler::append_stage(Stage &stage)
 146 {
 147         Stage *target = 0;
 148         if(stage.type==SHARED)
 149                 target = &module->shared;
 150         else
 151         {
 152                 list<Stage>::iterator i;
 153                 for(i=module->stages.begin(); (i!=module->stages.end() && i->type<stage.type); ++i) ;
 154                 if(i==module->stages.end() || i->type>stage.type)
 155                 {
 156                         list<Stage>::iterator j = module->stages.insert(i, stage.type);
 157                         if(i!=module->stages.end())
 158                                 i->previous = &*j;
 159                         i = j;
 160                         if(i!=module->stages.begin())
 161                                 i->previous = &*--j;
 162                 }
 163
 164                 target = &*i;
 165         }
 166
 167         for(NodeList<Node>::iterator i=stage.content.body.begin(); i!=stage.content.body.end(); ++i)
 168                 target->content.body.push_back(*i);
 169         apply<DeclarationCombiner>(*target);
 170 }
 171
 172 void ProgramCompiler::process()
 173 {
 174         for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
 175                 generate(*i);
 176         for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); )
 177         {
 178                 if(optimize(*i))
 179                         i = module->stages.begin();
 180                 else
 181                         ++i;
 182         }
 183         for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
 184                 finalize(*i);
 185 }
 186
 187 void ProgramCompiler::import(const string &name)
 188 {
 189         string fn = name+".glsl";
 190         if(imported_names.count(fn))
 191                 return;
 192         imported_names.insert(fn);
 193
 194         RefPtr<IO::Seekable> io = (resources ? resources->open_raw(fn) : Resources::get_builtins().open(fn));
 195         if(!io)
 196                 throw runtime_error(format("module %s not found", name));
 197         ProgramParser import_parser;
 198         append_module(import_parser.parse(*io, fn));
 199 }
 200
 201 void ProgramCompiler::generate(Stage &stage)
 202 {
 203         inject_block(stage.content, module->shared.content);
 204
 205         apply<DeclarationReorderer>(stage);
 206         apply<FunctionResolver>(stage);
 207         apply<VariableResolver>(stage);
 208         apply<InterfaceGenerator>(stage);
 209         apply<VariableResolver>(stage);
 210         apply<DeclarationReorderer>(stage);
 211         apply<LegacyConverter>(stage);
 212 }
 213
 214 bool ProgramCompiler::optimize(Stage &stage)
 215 {
 216         apply<ConstantConditionEliminator>(stage);
 217
 218         set<FunctionDeclaration *> inlineable = apply<InlineableFunctionLocator>(stage);
 219         apply<FunctionInliner>(stage, inlineable);
 220
 221         set<Node *> unused = apply<UnusedVariableLocator>(stage);
 222         set<Node *> unused2 = apply<UnusedFunctionLocator>(stage);
 223         unused.insert(unused2.begin(), unused2.end());
 224         apply<NodeRemover>(stage, unused);
 225
 226         return !unused.empty();
 227 }
 228
 229 void ProgramCompiler::finalize(Stage &stage)
 230 {
 231         if(get_gl_api()==OPENGL_ES2)
 232                 apply<DefaultPrecisionGenerator>(stage);
 233         else
 234                 apply<PrecisionRemover>(stage);
 235 }
 236
 237 void ProgramCompiler::inject_block(Block &target, const Block &source)
 238 {
 239         list<RefPtr<Node> >::iterator insert_point = target.body.begin();
 240         for(list<RefPtr<Node> >::const_iterator i=source.body.begin(); i!=source.body.end(); ++i)
 241                 target.body.insert(insert_point, (*i)->clone());
 242 }
 243
 244 template<typename T>
 245 typename T::ResultType ProgramCompiler::apply(Stage &stage)
 246 {
 247         T visitor;
 248         visitor.apply(stage);
 249         return visitor.get_result();
 250 }
 251
 252 template<typename T, typename A>
 253 typename T::ResultType ProgramCompiler::apply(Stage &stage, const A &arg)
 254 {
 255         T visitor(arg);
 256         visitor.apply(stage);
 257         return visitor.get_result();
 258 }
 259
 260
 261 ProgramCompiler::Visitor::Visitor():
 262         stage(0)
 263 { }
 264
 265 void ProgramCompiler::Visitor::apply(Stage &s)
 266 {
 267         SetForScope<Stage *> set(stage, &s);
 268         stage->content.visit(*this);
 269 }
 270
 271
 272 ProgramCompiler::BlockModifier::BlockModifier():
 273         remove_node(false)
 274 { }
 275
 276 void ProgramCompiler::BlockModifier::flatten_block(Block &block)
 277 {
 278         insert_nodes.insert(insert_nodes.end(), block.body.begin(), block.body.end());
 279         remove_node = true;
 280 }
 281
 282 void ProgramCompiler::BlockModifier::apply_and_increment(Block &block, list<RefPtr<Node> >::iterator &i)
 283 {
 284         block.body.insert(i, insert_nodes.begin(), insert_nodes.end());
 285         insert_nodes.clear();
 286
 287         if(remove_node)
 288                 block.body.erase(i++);
 289         else
 290                 ++i;
 291         remove_node = false;
 292 }
 293
 294 void ProgramCompiler::BlockModifier::visit(Block &block)
 295 {
 296         for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
 297         {
 298                 (*i)->visit(*this);
 299                 apply_and_increment(block, i);
 300         }
 301 }
 302
 303
 304 ProgramCompiler::Formatter::Formatter():
 305         indent(0),
 306         parameter_list(false),
 307         else_if(0)
 308 { }
 309
 310 void ProgramCompiler::Formatter::apply(ProgramSyntax::Stage &s)
 311 {
 312         GLApi api = get_gl_api();
 313         const Version &ver = s.required_version;
 314
 315         if(ver)
 316         {
 317                 formatted += format("#version %d%02d", ver.major, ver.minor);
 318                 if(api==OPENGL_ES2 && ver>=Version(3, 0))
 319                         formatted += " es";
 320                 formatted += '\n';
 321         }
 322
 323         Visitor::apply(s);
 324 }
 325
 326 void ProgramCompiler::Formatter::visit(Literal &literal)
 327 {
 328         formatted += literal.token;
 329 }
 330
 331 void ProgramCompiler::Formatter::visit(ParenthesizedExpression &parexpr)
 332 {
 333         formatted += '(';
 334         parexpr.expression->visit(*this);
 335         formatted += ')';
 336 }
 337
 338 void ProgramCompiler::Formatter::visit(VariableReference &var)
 339 {
 340         formatted += var.name;
 341 }
 342
 343 void ProgramCompiler::Formatter::visit(MemberAccess &memacc)
 344 {
 345         memacc.left->visit(*this);
 346         formatted += format(".%s", memacc.member);
 347 }
 348
 349 void ProgramCompiler::Formatter::visit(UnaryExpression &unary)
 350 {
 351         if(unary.prefix)
 352                 formatted += unary.oper;
 353         unary.expression->visit(*this);
 354         if(!unary.prefix)
 355                 formatted += unary.oper;
 356 }
 357
 358 void ProgramCompiler::Formatter::visit(BinaryExpression &binary)
 359 {
 360         binary.left->visit(*this);
 361         formatted += binary.oper;
 362         binary.right->visit(*this);
 363         formatted += binary.after;
 364 }
 365
 366 void ProgramCompiler::Formatter::visit(Assignment &assign)
 367 {
 368         assign.left->visit(*this);
 369         formatted += format(" %s ", assign.oper);
 370         assign.right->visit(*this);
 371 }
 372
 373 void ProgramCompiler::Formatter::visit(FunctionCall &call)
 374 {
 375         formatted += format("%s(", call.name);
 376         for(vector<RefPtr<Expression> >::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
 377         {
 378                 if(i!=call.arguments.begin())
 379                         formatted += ", ";
 380                 (*i)->visit(*this);
 381         }
 382         formatted += ')';
 383 }
 384
 385 void ProgramCompiler::Formatter::visit(ExpressionStatement &expr)
 386 {
 387         expr.expression->visit(*this);
 388         formatted += ';';
 389 }
 390
 391 void ProgramCompiler::Formatter::visit(Block &block)
 392 {
 393         if(else_if)
 394                 --else_if;
 395
 396         unsigned brace_indent = indent;
 397         bool use_braces = (block.use_braces || (indent && block.body.size()!=1));
 398         if(use_braces)
 399                 formatted += format("%s{\n", string(brace_indent*2, ' '));
 400
 401         SetForScope<unsigned> set(indent, indent+(indent>0 || use_braces));
 402         string spaces(indent*2, ' ');
 403         for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
 404         {
 405                 if(i!=block.body.begin())
 406                         formatted += '\n';
 407                 formatted += spaces;
 408                 (*i)->visit(*this);
 409                 else_if = 0;
 410         }
 411
 412         if(use_braces)
 413                 formatted += format("\n%s}", string(brace_indent*2, ' '));
 414 }
 415
 416 void ProgramCompiler::Formatter::visit(Import &import)
 417 {
 418         formatted += format("import %s;", import.module);
 419 }
 420
 421 void ProgramCompiler::Formatter::visit(Precision &prec)
 422 {
 423         formatted += format("precision %s %s;", prec.precision, prec.type);
 424 }
 425
 426 void ProgramCompiler::Formatter::visit(Layout &layout)
 427 {
 428         formatted += "layout(";
 429         for(vector<Layout::Qualifier>::const_iterator i=layout.qualifiers.begin(); i!=layout.qualifiers.end(); ++i)
 430         {
 431                 if(i!=layout.qualifiers.begin())
 432                         formatted += ", ";
 433                 formatted += i->identifier;
 434                 if(!i->value.empty())
 435                         formatted += format("=%s", i->value);
 436         }
 437         formatted += ')';
 438 }
 439
 440 void ProgramCompiler::Formatter::visit(InterfaceLayout &layout)
 441 {
 442         layout.layout.visit(*this);
 443         formatted += format(" %s;", layout.interface);
 444 }
 445
 446 void ProgramCompiler::Formatter::visit(StructDeclaration &strct)
 447 {
 448         formatted += format("struct %s\n", strct.name);
 449         strct.members.visit(*this);
 450         formatted += ';';
 451 }
 452
 453 void ProgramCompiler::Formatter::visit(VariableDeclaration &var)
 454 {
 455         if(var.layout)
 456         {
 457                 var.layout->visit(*this);
 458                 formatted += ' ';
 459         }
 460         if(var.constant)
 461                 formatted += "const ";
 462         if(!var.sampling.empty())
 463                 formatted += format("%s ", var.sampling);
 464         if(!var.interface.empty() && var.interface!=block_interface)
 465         {
 466                 string interface = var.interface;
 467                 if(stage->required_version<Version(1, 30))
 468                 {
 469                         if(stage->type==VERTEX && var.interface=="in")
 470                                 interface = "attribute";
 471                         else if((stage->type==VERTEX && var.interface=="out") || (stage->type==FRAGMENT && var.interface=="in"))
 472                                 interface = "varying";
 473                 }
 474                 formatted += format("%s ", interface);
 475         }
 476         if(!var.precision.empty())
 477                 formatted += format("%s ", var.precision);
 478         formatted += format("%s %s", var.type, var.name);
 479         if(var.array)
 480         {
 481                 formatted += '[';
 482                 if(var.array_size)
 483                         var.array_size->visit(*this);
 484                 formatted += ']';
 485         }
 486         if(var.init_expression)
 487         {
 488                 formatted += " = ";
 489                 var.init_expression->visit(*this);
 490         }
 491         if(!parameter_list)
 492                 formatted += ';';
 493 }
 494
 495 void ProgramCompiler::Formatter::visit(InterfaceBlock &iface)
 496 {
 497         SetForScope<string> set(block_interface, iface.interface);
 498         formatted += format("%s %s\n", iface.interface, iface.name);
 499         iface.members.visit(*this);
 500         formatted += ';';
 501 }
 502
 503 void ProgramCompiler::Formatter::visit(FunctionDeclaration &func)
 504 {
 505         formatted += format("%s %s(", func.return_type, func.name);
 506         for(vector<RefPtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
 507         {
 508                 if(i!=func.parameters.begin())
 509                         formatted += ", ";
 510                 SetFlag set(parameter_list);
 511                 (*i)->visit(*this);
 512         }
 513         formatted += ')';
 514         if(func.definition==&func)
 515         {
 516                 formatted += '\n';
 517                 func.body.visit(*this);
 518         }
 519         else
 520                 formatted += ';';
 521 }
 522
 523 void ProgramCompiler::Formatter::visit(Conditional &cond)
 524 {
 525         if(else_if)
 526                 formatted.replace(formatted.rfind('\n'), string::npos, 1, ' ');
 527
 528         indent -= else_if;
 529
 530         formatted += "if(";
 531         cond.condition->visit(*this);
 532         formatted += ")\n";
 533
 534         cond.body.visit(*this);
 535         if(!cond.else_body.body.empty())
 536         {
 537                 formatted += format("\n%selse\n", string(indent*2, ' '));
 538                 SetForScope<unsigned> set(else_if, 2);
 539                 cond.else_body.visit(*this);
 540         }
 541 }
 542
 543 void ProgramCompiler::Formatter::visit(Iteration &iter)
 544 {
 545         formatted += "for(";
 546         iter.init_statement->visit(*this);
 547         formatted += ' ';
 548         iter.condition->visit(*this);
 549         formatted += "; ";
 550         iter.loop_expression->visit(*this);
 551         formatted += ")\n";
 552         iter.body.visit(*this);
 553 }
 554
 555 void ProgramCompiler::Formatter::visit(Return &ret)
 556 {
 557         formatted += "return ";
 558         ret.expression->visit(*this);
 559         formatted += ';';
 560 }
 561
 562 void ProgramCompiler::Formatter::visit(Jump &jump)
 563 {
 564         formatted += jump.keyword;
 565         formatted += ';';
 566 }
 567
 568
 569 ProgramCompiler::DeclarationCombiner::DeclarationCombiner():
 570         toplevel(true)
 571 { }
 572
 573 void ProgramCompiler::DeclarationCombiner::visit(Block &block)
 574 {
 575         if(!toplevel)
 576                 return;
 577
 578         SetForScope<bool> set(toplevel, false);
 579         BlockModifier::visit(block);
 580 }
 581
 582 void ProgramCompiler::DeclarationCombiner::visit(FunctionDeclaration &func)
 583 {
 584         vector<FunctionDeclaration *> &decls = functions[func.name];
 585         if(func.definition)
 586         {
 587                 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
 588                 {
 589                         (*i)->definition = func.definition;
 590                         (*i)->body.body.clear();
 591                 }
 592         }
 593         decls.push_back(&func);
 594 }
 595
 596 void ProgramCompiler::DeclarationCombiner::visit(VariableDeclaration &var)
 597 {
 598         VariableDeclaration *&ptr = variables[var.name];
 599         if(ptr)
 600         {
 601                 ptr->type = var.type;
 602                 if(var.init_expression)
 603                         ptr->init_expression = var.init_expression;
 604                 remove_node = true;
 605         }
 606         else
 607                 ptr = &var;
 608 }
 609
 610
 611 ProgramCompiler::VariableResolver::VariableResolver():
 612         anonymous(false),
 613         record_target(false),
 614         assignment_target(0),
 615         self_referencing(false)
 616 { }
 617
 618 void ProgramCompiler::VariableResolver::apply(Stage &s)
 619 {
 620         SetForScope<Stage *> set(stage, &s);
 621         Stage *builtins = get_builtins(stage->type);
 622         if(builtins)
 623                 blocks.push_back(&builtins->content);
 624         stage->content.visit(*this);
 625         if(builtins)
 626                 blocks.pop_back();
 627 }
 628
 629 void ProgramCompiler::VariableResolver::visit(Block &block)
 630 {
 631         blocks.push_back(&block);
 632         block.variables.clear();
 633         TraversingVisitor::visit(block);
 634         blocks.pop_back();
 635 }
 636
 637 void ProgramCompiler::VariableResolver::visit(VariableReference &var)
 638 {
 639         var.declaration = 0;
 640         type = 0;
 641         for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
 642         {
 643                 --i;
 644                 map<string, VariableDeclaration *>::iterator j = (*i)->variables.find(var.name);
 645                 if(j!=(*i)->variables.end())
 646                 {
 647                         var.declaration = j->second;
 648                         type = j->second->type_declaration;
 649                         break;
 650                 }
 651         }
 652
 653         if(record_target)
 654         {
 655                 if(assignment_target)
 656                 {
 657                         record_target = false;
 658                         assignment_target = 0;
 659                 }
 660                 else
 661                         assignment_target = var.declaration;
 662         }
 663         else if(var.declaration && var.declaration==assignment_target)
 664                 self_referencing = true;
 665 }
 666
 667 void ProgramCompiler::VariableResolver::visit(MemberAccess &memacc)
 668 {
 669         type = 0;
 670         TraversingVisitor::visit(memacc);
 671         memacc.declaration = 0;
 672         if(type)
 673         {
 674                 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
 675                 if(i!=type->members.variables.end())
 676                 {
 677                         memacc.declaration = i->second;
 678                         type = i->second->type_declaration;
 679                 }
 680                 else
 681                         type = 0;
 682         }
 683 }
 684
 685 void ProgramCompiler::VariableResolver::visit(BinaryExpression &binary)
 686 {
 687         if(binary.oper=="[")
 688         {
 689                 {
 690                         SetForScope<bool> set(record_target, false);
 691                         binary.right->visit(*this);
 692                 }
 693                 type = 0;
 694                 binary.left->visit(*this);
 695         }
 696         else
 697         {
 698                 TraversingVisitor::visit(binary);
 699                 type = 0;
 700         }
 701 }
 702
 703 void ProgramCompiler::VariableResolver::visit(Assignment &assign)
 704 {
 705         {
 706                 SetFlag set(record_target);
 707                 assignment_target = 0;
 708                 assign.left->visit(*this);
 709         }
 710
 711         self_referencing = false;
 712         assign.right->visit(*this);
 713
 714         assign.self_referencing = (self_referencing || assign.oper!="=");
 715         assign.target_declaration = assignment_target;
 716 }
 717
 718 void ProgramCompiler::VariableResolver::visit(StructDeclaration &strct)
 719 {
 720         TraversingVisitor::visit(strct);
 721         blocks.back()->types[strct.name] = &strct;
 722 }
 723
 724 void ProgramCompiler::VariableResolver::visit(VariableDeclaration &var)
 725 {
 726         for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
 727         {
 728                 --i;
 729                 map<string, StructDeclaration *>::iterator j = (*i)->types.find(var.type);
 730                 if(j!=(*i)->types.end())
 731                         var.type_declaration = j->second;
 732         }
 733
 734         if(!block_interface.empty() && var.interface.empty())
 735                 var.interface = block_interface;
 736
 737         TraversingVisitor::visit(var);
 738         blocks.back()->variables[var.name] = &var;
 739         if(anonymous && blocks.size()>1)
 740                 blocks[blocks.size()-2]->variables[var.name] = &var;
 741 }
 742
 743 void ProgramCompiler::VariableResolver::visit(InterfaceBlock &iface)
 744 {
 745         SetFlag set(anonymous);
 746         SetForScope<string> set2(block_interface, iface.interface);
 747         TraversingVisitor::visit(iface);
 748 }
 749
 750
 751 void ProgramCompiler::FunctionResolver::visit(FunctionCall &call)
 752 {
 753         map<string, vector<FunctionDeclaration *> >::iterator i = functions.find(call.name);
 754         if(i!=functions.end())
 755                 call.declaration = i->second.back();
 756
 757         TraversingVisitor::visit(call);
 758 }
 759
 760 void ProgramCompiler::FunctionResolver::visit(FunctionDeclaration &func)
 761 {
 762         vector<FunctionDeclaration *> &decls = functions[func.name];
 763         if(func.definition)
 764         {
 765                 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
 766                         (*i)->definition = func.definition;
 767                 decls.clear();
 768                 decls.push_back(&func);
 769         }
 770         else if(!decls.empty() && decls.back()->definition)
 771                 func.definition = decls.back()->definition;
 772         else
 773                 decls.push_back(&func);
 774
 775         TraversingVisitor::visit(func);
 776 }
 777
 778
 779 ProgramCompiler::InterfaceGenerator::InterfaceGenerator():
 780         scope_level(0)
 781 { }
 782
 783 string ProgramCompiler::InterfaceGenerator::get_out_prefix(StageType type)
 784 {
 785         if(type==VERTEX)
 786                 return "_vs_out_";
 787         else if(type==GEOMETRY)
 788                 return "_gs_out_";
 789         else
 790                 return string();
 791 }
 792
 793 void ProgramCompiler::InterfaceGenerator::apply(Stage &s)
 794 {
 795         SetForScope<Stage *> set(stage, &s);
 796         if(stage->previous)
 797                 in_prefix = get_out_prefix(stage->previous->type);
 798         out_prefix = get_out_prefix(stage->type);
 799         stage->content.visit(*this);
 800 }
 801
 802 void ProgramCompiler::InterfaceGenerator::visit(Block &block)
 803 {
 804         SetForScope<unsigned> set(scope_level, scope_level+1);
 805         for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
 806         {
 807                 (*i)->visit(*this);
 808
 809                 if(scope_level==1)
 810                 {
 811                         for(map<string, RefPtr<VariableDeclaration> >::iterator j=iface_declarations.begin(); j!=iface_declarations.end(); ++j)
 812                         {
 813                                 list<RefPtr<Node> >::iterator k = block.body.insert(i, j->second);
 814                                 (*k)->visit(*this);
 815                         }
 816                         iface_declarations.clear();
 817                 }
 818
 819                 apply_and_increment(block, i);
 820         }
 821 }
 822
 823 string ProgramCompiler::InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
 824 {
 825         unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
 826         return prefix+name.substr(offset);
 827 }
 828
 829 bool ProgramCompiler::InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
 830 {
 831         const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
 832         if(stage_vars.count(name) || iface_declarations.count(name))
 833                 return false;
 834
 835         VariableDeclaration* iface_var = new VariableDeclaration;
 836         iface_var->sampling = var.sampling;
 837         iface_var->interface = iface;
 838         iface_var->type = var.type;
 839         iface_var->type_declaration = var.type_declaration;
 840         iface_var->name = name;
 841         if(stage->type==GEOMETRY)
 842                 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
 843         else
 844                 iface_var->array = var.array;
 845         if(iface_var->array)
 846                 iface_var->array_size = var.array_size;
 847         if(iface=="in")
 848                 iface_var->linked_declaration = &var;
 849         iface_declarations[name] = iface_var;
 850
 851         return true;
 852 }
 853
 854 void ProgramCompiler::InterfaceGenerator::insert_assignment(const string &left, ProgramSyntax::Expression *right)
 855 {
 856         Assignment *assign = new Assignment;
 857         VariableReference *ref = new VariableReference;
 858         ref->name = left;
 859         assign->left = ref;
 860         assign->oper = "=";
 861         assign->right = right;
 862
 863         ExpressionStatement *stmt = new ExpressionStatement;
 864         stmt->expression = assign;
 865         stmt->visit(*this);
 866         insert_nodes.push_back(stmt);
 867 }
 868
 869 void ProgramCompiler::InterfaceGenerator::visit(VariableReference &var)
 870 {
 871         if(var.declaration || !stage->previous)
 872                 return;
 873         if(iface_declarations.count(var.name))
 874                 return;
 875
 876         const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
 877         map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
 878         if(i==prev_out.end())
 879                 i = prev_out.find(in_prefix+var.name);
 880         if(i!=prev_out.end())
 881         {
 882                 generate_interface(*i->second, "in", i->second->name);
 883                 var.name = i->second->name;
 884         }
 885 }
 886
 887 void ProgramCompiler::InterfaceGenerator::visit(VariableDeclaration &var)
 888 {
 889         if(var.interface=="out")
 890         {
 891                 if(scope_level==1)
 892                         stage->out_variables[var.name] = &var;
 893                 else if(generate_interface(var, "out", change_prefix(var.name, string())))
 894                 {
 895                         remove_node = true;
 896                         if(var.init_expression)
 897                         {
 898                                 insert_assignment(var.name, var.init_expression->clone());
 899                                 return;
 900                         }
 901                 }
 902         }
 903         else if(var.interface=="in")
 904         {
 905                 stage->in_variables[var.name] = &var;
 906                 if(var.linked_declaration)
 907                         var.linked_declaration->linked_declaration = &var;
 908                 else if(stage->previous)
 909                 {
 910                         const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
 911                         map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
 912                         if(i!=prev_out.end())
 913                         {
 914                                 var.linked_declaration = i->second;
 915                                 i->second->linked_declaration = &var;
 916                         }
 917                 }
 918         }
 919
 920         TraversingVisitor::visit(var);
 921 }
 922
 923 void ProgramCompiler::InterfaceGenerator::visit(Passthrough &pass)
 924 {
 925         vector<VariableDeclaration *> pass_vars;
 926
 927         for(map<string, VariableDeclaration *>::const_iterator i=stage->in_variables.begin(); i!=stage->in_variables.end(); ++i)
 928                 pass_vars.push_back(i->second);
 929         for(map<string, RefPtr<VariableDeclaration> >::const_iterator i=iface_declarations.begin(); i!=iface_declarations.end(); ++i)
 930                 if(i->second->interface=="in")
 931                         pass_vars.push_back(i->second.get());
 932
 933         if(stage->previous)
 934         {
 935                 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
 936                 for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
 937                 {
 938                         bool linked = false;
 939                         for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
 940                                 linked = ((*j)->linked_declaration==i->second);
 941
 942                         if(!linked && generate_interface(*i->second, "in", i->second->name))
 943                                 pass_vars.push_back(i->second);
 944                 }
 945         }
 946
 947         if(stage->type==GEOMETRY)
 948         {
 949                 VariableReference *ref = new VariableReference;
 950                 ref->name = "gl_in";
 951
 952                 BinaryExpression *subscript = new BinaryExpression;
 953                 subscript->left = ref;
 954                 subscript->oper = "[";
 955                 subscript->right = pass.subscript;
 956                 subscript->after = "]";
 957
 958                 MemberAccess *memacc = new MemberAccess;
 959                 memacc->left = subscript;
 960                 memacc->member = "gl_Position";
 961
 962                 insert_assignment("gl_Position", memacc);
 963         }
 964
 965         for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
 966         {
 967                 string out_name = change_prefix((*i)->name, out_prefix);
 968                 generate_interface(**i, "out", out_name);
 969
 970                 VariableReference *ref = new VariableReference;
 971                 ref->name = (*i)->name;
 972                 if(pass.subscript)
 973                 {
 974                         BinaryExpression *subscript = new BinaryExpression;
 975                         subscript->left = ref;
 976                         subscript->oper = "[";
 977                         subscript->right = pass.subscript;
 978                         subscript->after = "]";
 979                         insert_assignment(out_name, subscript);
 980                 }
 981                 else
 982                         insert_assignment(out_name, ref);
 983         }
 984
 985         remove_node = true;
 986 }
 987
 988
 989 ProgramCompiler::DeclarationReorderer::DeclarationReorderer():
 990         kind(NO_DECLARATION)
 991 { }
 992
 993 void ProgramCompiler::DeclarationReorderer::visit(Block &block)
 994 {
 995         list<RefPtr<Node> >::iterator struct_insert_point = block.body.end();
 996         list<RefPtr<Node> >::iterator variable_insert_point = block.body.end();
 997
 998         for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
 999         {
1000                 kind = NO_DECLARATION;
1001                 (*i)->visit(*this);
1002
1003                 bool moved = false;
1004                 if(kind==STRUCT && struct_insert_point!=block.body.end())
1005                 {
1006                         block.body.insert(struct_insert_point, *i);
1007                         moved = true;
1008                 }
1009                 else if(kind>STRUCT && struct_insert_point==block.body.end())
1010                         struct_insert_point = i;
1011
1012                 if(kind==VARIABLE && variable_insert_point!=block.body.end())
1013                 {
1014                         block.body.insert(variable_insert_point, *i);
1015                         moved = true;
1016                 }
1017                 else if(kind>VARIABLE && variable_insert_point==block.body.end())
1018                         variable_insert_point = i;
1019
1020                 if(moved)
1021                         block.body.erase(i++);
1022                 else
1023                         ++i;
1024         }
1025 }
1026
1027
1028 ProgramCompiler::InlineableFunctionLocator::InlineableFunctionLocator():
1029         in_function(0)
1030 { }
1031
1032 void ProgramCompiler::InlineableFunctionLocator::visit(FunctionCall &call)
1033 {
1034         FunctionDeclaration *def = call.declaration;
1035         if(def && def->definition!=def)
1036                 def = def->definition;
1037
1038         if(def)
1039         {
1040                 unsigned &count = refcounts[def];
1041                 ++count;
1042                 if(count>1 || def==in_function)
1043                         inlineable.erase(def);
1044         }
1045
1046         TraversingVisitor::visit(call);
1047 }
1048
1049 void ProgramCompiler::InlineableFunctionLocator::visit(FunctionDeclaration &func)
1050 {
1051         unsigned &count = refcounts[func.definition];
1052         if(!count && func.parameters.empty())
1053                 inlineable.insert(func.definition);
1054
1055         SetForScope<FunctionDeclaration *> set(in_function, &func);
1056         TraversingVisitor::visit(func);
1057 }
1058
1059
1060 ProgramCompiler::FunctionInliner::FunctionInliner():
1061         extract_result(0)
1062 { }
1063
1064 ProgramCompiler::FunctionInliner::FunctionInliner(const set<FunctionDeclaration *> &in):
1065         inlineable(in),
1066         extract_result(0)
1067 { }
1068
1069 void ProgramCompiler::FunctionInliner::visit_and_inline(RefPtr<Expression> &ptr)
1070 {
1071         inline_result = 0;
1072         ptr->visit(*this);
1073         if(inline_result)
1074                 ptr = inline_result;
1075 }
1076
1077 void ProgramCompiler::FunctionInliner::visit(Block &block)
1078 {
1079         if(extract_result)
1080                 --extract_result;
1081
1082         for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
1083         {
1084                 (*i)->visit(*this);
1085                 if(extract_result)
1086                         --extract_result;
1087         }
1088 }
1089
1090 void ProgramCompiler::FunctionInliner::visit(UnaryExpression &unary)
1091 {
1092         visit_and_inline(unary.expression);
1093         inline_result = 0;
1094 }
1095
1096 void ProgramCompiler::FunctionInliner::visit(BinaryExpression &binary)
1097 {
1098         visit_and_inline(binary.left);
1099         visit_and_inline(binary.right);
1100         inline_result = 0;
1101 }
1102
1103 void ProgramCompiler::FunctionInliner::visit(FunctionCall &call)
1104 {
1105         for(vector<RefPtr<Expression> >::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
1106                 visit_and_inline(*i);
1107
1108         FunctionDeclaration *def = call.declaration;
1109         if(def && def->definition!=def)
1110                 def = def->definition;
1111
1112         if(def && inlineable.count(def))
1113         {
1114                 extract_result = 2;
1115                 def->visit(*this);
1116         }
1117         else
1118                 inline_result = 0;
1119 }
1120
1121 void ProgramCompiler::FunctionInliner::visit(Return &ret)
1122 {
1123         TraversingVisitor::visit(ret);
1124
1125         if(extract_result)
1126                 inline_result = ret.expression->clone();
1127 }
1128
1129
1130 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator():
1131         variable_values(0),
1132         result(0.0f),
1133         result_valid(false)
1134 { }
1135
1136 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator(const ValueMap &v):
1137         variable_values(&v),
1138         result(0.0f),
1139         result_valid(false)
1140 { }
1141
1142 void ProgramCompiler::ExpressionEvaluator::visit(Literal &literal)
1143 {
1144         if(literal.token=="true")
1145                 result = 1.0f;
1146         else if(literal.token=="false")
1147                 result = 0.0f;
1148         else
1149                 result = lexical_cast<float>(literal.token);
1150         result_valid = true;
1151 }
1152
1153 void ProgramCompiler::ExpressionEvaluator::visit(ParenthesizedExpression &parexp)
1154 {
1155         parexp.expression->visit(*this);
1156 }
1157
1158 void ProgramCompiler::ExpressionEvaluator::visit(VariableReference &var)
1159 {
1160         if(!var.declaration)
1161                 return;
1162
1163         if(variable_values)
1164         {
1165                 ValueMap::const_iterator i = variable_values->find(var.declaration);
1166                 if(i!=variable_values->end())
1167                         i->second->visit(*this);
1168         }
1169         else if(var.declaration->init_expression)
1170                 var.declaration->init_expression->visit(*this);
1171 }
1172
1173 void ProgramCompiler::ExpressionEvaluator::visit(UnaryExpression &unary)
1174 {
1175         result_valid = false;
1176         unary.expression->visit(*this);
1177         if(!result_valid)
1178                 return;
1179
1180         if(unary.oper=="!")
1181                 result = !result;
1182         else
1183                 result_valid = false;
1184 }
1185
1186 void ProgramCompiler::ExpressionEvaluator::visit(BinaryExpression &binary)
1187 {
1188         result_valid = false;
1189         binary.left->visit(*this);
1190         if(!result_valid)
1191                 return;
1192
1193         float left_result = result;
1194         result_valid = false;
1195         binary.right->visit(*this);
1196         if(!result_valid)
1197                 return;
1198
1199         if(binary.oper=="<")
1200                 result = (left_result<result);
1201         else if(binary.oper=="<=")
1202                 result = (left_result<=result);
1203         else if(binary.oper==">")
1204                 result = (left_result>result);
1205         else if(binary.oper==">=")
1206                 result = (left_result>=result);
1207         else if(binary.oper=="==")
1208                 result = (left_result==result);
1209         else if(binary.oper=="!=")
1210                 result = (left_result!=result);
1211         else if(binary.oper=="&&")
1212                 result = (left_result && result);
1213         else if(binary.oper=="||")
1214                 result = (left_result || result);
1215         else
1216                 result_valid = false;
1217 }
1218
1219
1220 ProgramCompiler::ConstantConditionEliminator::ConstantConditionEliminator():
1221         scope_level(0)
1222 { }
1223
1224 void ProgramCompiler::ConstantConditionEliminator::visit(Block &block)
1225 {
1226         SetForScope<unsigned> set(scope_level, scope_level+1);
1227         BlockModifier::visit(block);
1228
1229         for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
1230                 variable_values.erase(i->second);
1231 }
1232
1233 void ProgramCompiler::ConstantConditionEliminator::visit(Assignment &assign)
1234 {
1235         variable_values.erase(assign.target_declaration);
1236 }
1237
1238 void ProgramCompiler::ConstantConditionEliminator::visit(VariableDeclaration &var)
1239 {
1240         if(var.constant || scope_level>1)
1241                 variable_values[&var] = var.init_expression.get();
1242 }
1243
1244 void ProgramCompiler::ConstantConditionEliminator::visit(Conditional &cond)
1245 {
1246         ExpressionEvaluator eval(variable_values);
1247         cond.condition->visit(eval);
1248         if(eval.result_valid)
1249                 flatten_block(eval.result ? cond.body : cond.else_body);
1250         else
1251                 TraversingVisitor::visit(cond);
1252 }
1253
1254 void ProgramCompiler::ConstantConditionEliminator::visit(Iteration &iter)
1255 {
1256         if(iter.condition)
1257         {
1258                 ExpressionEvaluator eval;
1259                 iter.condition->visit(eval);
1260                 if(eval.result_valid && !eval.result)
1261                 {
1262                         remove_node = true;
1263                         return;
1264                 }
1265         }
1266
1267         TraversingVisitor::visit(iter);
1268 }
1269
1270
1271 ProgramCompiler::UnusedVariableLocator::UnusedVariableLocator():
1272         aggregate(0),
1273         assignment(0),
1274         assignment_target(false),
1275         global_scope(true)
1276 { }
1277
1278 void ProgramCompiler::UnusedVariableLocator::apply(Stage &s)
1279 {
1280         variables.push_back(BlockVariableMap());
1281         Visitor::apply(s);
1282         BlockVariableMap &global_variables = variables.back();
1283         for(BlockVariableMap::iterator i=global_variables.begin(); i!=global_variables.end(); ++i)
1284         {
1285                 if(i->first->interface=="out" && (s.type==FRAGMENT || i->first->linked_declaration || !i->first->name.compare(0, 3, "gl_")))
1286                         continue;
1287                 if(!i->second.referenced)
1288                 {
1289                         unused_nodes.insert(i->first);
1290                         clear_assignments(i->second, true);
1291                 }
1292         }
1293         variables.pop_back();
1294 }
1295
1296 void ProgramCompiler::UnusedVariableLocator::visit(VariableReference &var)
1297 {
1298         map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
1299         if(i!=aggregates.end())
1300                 unused_nodes.erase(i->second);
1301
1302         if(var.declaration && !assignment_target)
1303         {
1304                 VariableInfo &var_info = variables.back()[var.declaration];
1305                 var_info.assignments.clear();
1306                 var_info.referenced = true;
1307         }
1308 }
1309
1310 void ProgramCompiler::UnusedVariableLocator::visit(MemberAccess &memacc)
1311 {
1312         TraversingVisitor::visit(memacc);
1313         unused_nodes.erase(memacc.declaration);
1314 }
1315
1316 void ProgramCompiler::UnusedVariableLocator::visit(BinaryExpression &binary)
1317 {
1318         if(binary.oper=="[")
1319         {
1320                 binary.left->visit(*this);
1321                 SetForScope<bool> set(assignment_target, false);
1322                 binary.right->visit(*this);
1323         }
1324         else
1325                 TraversingVisitor::visit(binary);
1326 }
1327
1328 void ProgramCompiler::UnusedVariableLocator::visit(Assignment &assign)
1329 {
1330         {
1331                 SetForScope<bool> set(assignment_target, !assign.self_referencing);
1332                 assign.left->visit(*this);
1333         }
1334         assign.right->visit(*this);
1335         assignment = &assign;
1336 }
1337
1338 void ProgramCompiler::UnusedVariableLocator::record_assignment(VariableDeclaration &var, Node &node, bool self_ref)
1339 {
1340         VariableInfo &var_info = variables.back()[&var];
1341         if(!self_ref)
1342                 clear_assignments(var_info, true);
1343         var_info.assignments.push_back(&node);
1344         var_info.conditionally_assigned = false;
1345 }
1346
1347 void ProgramCompiler::UnusedVariableLocator::clear_assignments(VariableInfo &var_info, bool mark_unused)
1348 {
1349         if(mark_unused)
1350         {
1351                 for(vector<Node *>::iterator i=var_info.assignments.begin(); i!=var_info.assignments.end(); ++i)
1352                         unused_nodes.insert(*i);
1353         }
1354         var_info.assignments.clear();
1355 }
1356
1357 void ProgramCompiler::UnusedVariableLocator::visit(ExpressionStatement &expr)
1358 {
1359         assignment = 0;
1360         TraversingVisitor::visit(expr);
1361         if(assignment && assignment->target_declaration)
1362                 record_assignment(*assignment->target_declaration, expr, assignment->self_referencing);
1363 }
1364
1365 void ProgramCompiler::UnusedVariableLocator::visit(StructDeclaration &strct)
1366 {
1367         SetForScope<Node *> set(aggregate, &strct);
1368         unused_nodes.insert(&strct);
1369         TraversingVisitor::visit(strct);
1370 }
1371
1372 void ProgramCompiler::UnusedVariableLocator::visit(VariableDeclaration &var)
1373 {
1374         if(aggregate)
1375                 aggregates[&var] = aggregate;
1376         else
1377         {
1378                 variables.back()[&var].local = true;
1379                 if(var.init_expression)
1380                         record_assignment(var, *var.init_expression, false);
1381         }
1382         unused_nodes.erase(var.type_declaration);
1383         TraversingVisitor::visit(var);
1384 }
1385
1386 void ProgramCompiler::UnusedVariableLocator::visit(InterfaceBlock &iface)
1387 {
1388         SetForScope<Node *> set(aggregate, &iface);
1389         unused_nodes.insert(&iface);
1390         TraversingVisitor::visit(iface);
1391 }
1392
1393 void ProgramCompiler::UnusedVariableLocator::visit(FunctionDeclaration &func)
1394 {
1395         variables.push_back(BlockVariableMap());
1396
1397         {
1398                 SetForScope<bool> set(global_scope, false);
1399                 for(vector<RefPtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1400                         (*i)->visit(*this);
1401                 func.body.visit(*this);
1402         }
1403
1404         BlockVariableMap &block_variables = variables.back();
1405         for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1406                 i->second.conditionally_assigned = true;
1407         for(vector<RefPtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1408                 block_variables[i->get()].referenced = true;
1409         merge_down_variables();
1410 }
1411
1412 void ProgramCompiler::UnusedVariableLocator::merge_down_variables()
1413 {
1414         BlockVariableMap &parent_variables = variables[variables.size()-2];
1415         BlockVariableMap &block_variables = variables.back();
1416         for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1417         {
1418                 if(i->second.local)
1419                 {
1420                         if(!i->second.referenced)
1421                                 unused_nodes.insert(i->first);
1422                         clear_assignments(i->second, true);
1423                         continue;
1424                 }
1425
1426                 BlockVariableMap::iterator j = parent_variables.find(i->first);
1427                 if(j==parent_variables.end())
1428                         parent_variables.insert(*i);
1429                 else
1430                 {
1431                         if(i->second.referenced || !i->second.conditionally_assigned)
1432                                 clear_assignments(j->second, !i->second.referenced);
1433                         j->second.conditionally_assigned = i->second.conditionally_assigned;
1434                         j->second.referenced |= i->second.referenced;
1435                         j->second.assignments.insert(j->second.assignments.end(), i->second.assignments.begin(), i->second.assignments.end());
1436                 }
1437         }
1438         variables.pop_back();
1439 }
1440
1441 void ProgramCompiler::UnusedVariableLocator::visit(Conditional &cond)
1442 {
1443         cond.condition->visit(*this);
1444         variables.push_back(BlockVariableMap());
1445         cond.body.visit(*this);
1446
1447         BlockVariableMap if_variables;
1448         swap(variables.back(), if_variables);
1449         cond.else_body.visit(*this);
1450
1451         BlockVariableMap &else_variables = variables.back();
1452         for(BlockVariableMap::iterator i=else_variables.begin(); i!=else_variables.end(); ++i)
1453         {
1454                 BlockVariableMap::iterator j = if_variables.find(i->first);
1455                 if(j!=if_variables.end())
1456                 {
1457                         i->second.assignments.insert(i->second.assignments.end(), j->second.assignments.begin(), j->second.assignments.end());
1458                         i->second.conditionally_assigned |= j->second.conditionally_assigned;
1459                         if_variables.erase(j);
1460                 }
1461                 else
1462                         i->second.conditionally_assigned = true;
1463         }
1464
1465         for(BlockVariableMap::iterator i=if_variables.begin(); i!=if_variables.end(); ++i)
1466         {
1467                 i->second.conditionally_assigned = true;
1468                 else_variables.insert(*i);
1469         }
1470
1471         merge_down_variables();
1472 }
1473
1474 void ProgramCompiler::UnusedVariableLocator::visit(Iteration &iter)
1475 {
1476         variables.push_back(BlockVariableMap());
1477         TraversingVisitor::visit(iter);
1478
1479         BlockVariableMap &block_variables = variables.back();
1480         for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1481                 if(!i->second.local && i->second.referenced)
1482                         i->second.assignments.clear();
1483
1484         merge_down_variables();
1485 }
1486
1487
1488 ProgramCompiler::UnusedVariableLocator::VariableInfo::VariableInfo():
1489         local(false),
1490         conditionally_assigned(false),
1491         referenced(false)
1492 { }
1493
1494
1495 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionCall &call)
1496 {
1497         TraversingVisitor::visit(call);
1498
1499         unused_nodes.erase(call.declaration);
1500         if(call.declaration && call.declaration->definition!=call.declaration)
1501                 used_definitions.insert(call.declaration->definition);
1502 }
1503
1504 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionDeclaration &func)
1505 {
1506         TraversingVisitor::visit(func);
1507
1508         if((func.name!="main" || func.body.body.empty()) && !used_definitions.count(&func))
1509                 unused_nodes.insert(&func);
1510 }
1511
1512
1513 ProgramCompiler::NodeRemover::NodeRemover(const set<Node *> &r):
1514         to_remove(r)
1515 { }
1516
1517 void ProgramCompiler::NodeRemover::visit(Block &block)
1518 {
1519         for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
1520         {
1521                 (*i)->visit(*this);
1522                 if(to_remove.count(i->get()))
1523                         block.body.erase(i++);
1524                 else
1525                         ++i;
1526         }
1527 }
1528
1529 void ProgramCompiler::NodeRemover::visit(VariableDeclaration &var)
1530 {
1531         if(to_remove.count(&var))
1532         {
1533                 stage->in_variables.erase(var.name);
1534                 stage->out_variables.erase(var.name);
1535                 stage->locations.erase(var.name);
1536                 if(var.linked_declaration)
1537                         var.linked_declaration->linked_declaration = 0;
1538         }
1539         else if(var.init_expression && to_remove.count(var.init_expression.get()))
1540                 var.init_expression = 0;
1541 }
1542
1543
1544 void ProgramCompiler::PrecisionRemover::visit(Precision &)
1545 {
1546         remove_node = true;
1547 }
1548
1549 void ProgramCompiler::PrecisionRemover::visit(VariableDeclaration &var)
1550 {
1551         var.precision.clear();
1552 }
1553
1554
1555 ProgramCompiler::DefaultPrecisionGenerator::DefaultPrecisionGenerator():
1556         toplevel(true)
1557 { }
1558
1559 void ProgramCompiler::DefaultPrecisionGenerator::visit(Block &block)
1560 {
1561         if(toplevel)
1562         {
1563                 SetForScope<bool> set(toplevel, false);
1564                 BlockModifier::visit(block);
1565         }
1566         else
1567                 Visitor::visit(block);
1568 }
1569
1570 void ProgramCompiler::DefaultPrecisionGenerator::visit(Precision &prec)
1571 {
1572         have_default.insert(prec.type);
1573 }
1574
1575 void ProgramCompiler::DefaultPrecisionGenerator::visit(VariableDeclaration &var)
1576 {
1577         if(var.type_declaration)
1578                 return;
1579
1580         string type = var.type;
1581         if(!type.compare(0, 3, "vec") || !type.compare(0, 3, "mat"))
1582                 type = "float";
1583         else if(!type.compare(0, 3, "ivec") || type=="uint")
1584                 type = "int";
1585
1586         if(!have_default.count(type))
1587         {
1588                 Precision *prec = new Precision;
1589                 if(!type.compare(0, 7, "sampler"))
1590                         prec->precision = "lowp";
1591                 else if(stage->type==FRAGMENT)
1592                         prec->precision = "mediump";
1593                 else
1594                         prec->precision = "highp";
1595                 prec->type = type;
1596                 insert_nodes.push_back(prec);
1597
1598                 have_default.insert(type);
1599         }
1600 }
1601
1602
1603 ProgramCompiler::LegacyConverter::LegacyConverter():
1604         target_api(get_gl_api()),
1605         target_version(get_glsl_version()),
1606         frag_out(0)
1607 { }
1608
1609 ProgramCompiler::LegacyConverter::LegacyConverter(const Version &v):
1610         target_api(get_gl_api()),
1611         target_version(v),
1612         frag_out(0)
1613 { }
1614
1615 bool ProgramCompiler::LegacyConverter::check_version(const Version &feature_version) const
1616 {
1617         if(target_version<feature_version)
1618                 return false;
1619         else if(stage->required_version<feature_version)
1620                 stage->required_version = feature_version;
1621
1622         return true;
1623 }
1624
1625 bool ProgramCompiler::LegacyConverter::supports_unified_interface_syntax() const
1626 {
1627         if(target_api==OPENGL_ES2)
1628                 return check_version(Version(3, 0));
1629         else
1630                 return check_version(Version(1, 30));
1631 }
1632
1633 void ProgramCompiler::LegacyConverter::visit(VariableReference &var)
1634 {
1635         if(var.declaration==frag_out && !supports_unified_interface_syntax())
1636         {
1637                 var.name = "gl_FragColor";
1638                 var.declaration = 0;
1639                 type = "vec4";
1640         }
1641         else if(var.declaration)
1642                 type = var.declaration->type;
1643         else
1644                 type = string();
1645 }
1646
1647 void ProgramCompiler::LegacyConverter::visit(Assignment &assign)
1648 {
1649         TraversingVisitor::visit(assign);
1650         if(assign.target_declaration==frag_out && !supports_unified_interface_syntax())
1651                 assign.target_declaration = 0;
1652 }
1653
1654 bool ProgramCompiler::LegacyConverter::supports_unified_sampling_functions() const
1655 {
1656         if(target_api==OPENGL_ES2)
1657                 return check_version(Version(3, 0));
1658         else
1659                 return check_version(Version(1, 30));
1660 }
1661
1662 void ProgramCompiler::LegacyConverter::visit(FunctionCall &call)
1663 {
1664         if(call.name=="texture" && !call.declaration && !supports_unified_sampling_functions())
1665         {
1666                 vector<RefPtr<Expression> >::iterator i = call.arguments.begin();
1667                 if(i!=call.arguments.end())
1668                 {
1669                         (*i)->visit(*this);
1670                         if(type=="sampler1D")
1671                                 call.name = "texture1D";
1672                         else if(type=="sampler2D")
1673                                 call.name = "texture2D";
1674                         else if(type=="sampler3D")
1675                                 call.name = "texture3D";
1676                         else if(type=="sampler1DShadow")
1677                                 call.name = "shadow1D";
1678                         else if(type=="sampler2DShadow")
1679                                 call.name = "shadow2D";
1680
1681                         for(; i!=call.arguments.end(); ++i)
1682                                 (*i)->visit(*this);
1683                 }
1684         }
1685         else
1686                 TraversingVisitor::visit(call);
1687 }
1688
1689 bool ProgramCompiler::LegacyConverter::supports_interface_layouts() const
1690 {
1691         if(target_api==OPENGL_ES2)
1692                 return check_version(Version(3, 0));
1693         else
1694                 return check_version(Version(3, 30));
1695 }
1696
1697 void ProgramCompiler::LegacyConverter::visit(VariableDeclaration &var)
1698 {
1699         if(var.layout && !supports_interface_layouts())
1700         {
1701                 vector<Layout::Qualifier>::iterator i;
1702                 for(i=var.layout->qualifiers.begin(); (i!=var.layout->qualifiers.end() && i->identifier!="location"); ++i) ;
1703                 if(i!=var.layout->qualifiers.end())
1704                 {
1705                         unsigned location = lexical_cast<unsigned>(i->value);
1706                         if(stage->type==VERTEX && var.interface=="in")
1707                         {
1708                                 stage->locations[var.name] = location;
1709                                 var.layout->qualifiers.erase(i);
1710                         }
1711                         else if(stage->type==FRAGMENT && var.interface=="out")
1712                         {
1713                                 if(location!=0)
1714                                         static Require _req(EXT_gpu_shader4);
1715                                 stage->locations[var.name] = location;
1716                                 var.layout->qualifiers.erase(i);
1717                         }
1718
1719                         if(var.layout->qualifiers.empty())
1720                                 var.layout = 0;
1721                 }
1722         }
1723
1724         if((var.interface=="in" || var.interface=="out") && !supports_unified_interface_syntax())
1725         {
1726                 if(stage->type==FRAGMENT && var.interface=="out")
1727                 {
1728                         frag_out = &var;
1729                         remove_node = true;
1730                 }
1731         }
1732
1733         TraversingVisitor::visit(var);
1734 }
1735
1736 bool ProgramCompiler::LegacyConverter::supports_interface_blocks(const string &iface) const
1737 {
1738         if(target_api==OPENGL_ES2)
1739         {
1740                 if(iface=="uniform")
1741                         return check_version(Version(3, 0));
1742                 else
1743                         return check_version(Version(3, 20));
1744         }
1745         else
1746                 return check_version(Version(1, 50));
1747 }
1748
1749 void ProgramCompiler::LegacyConverter::visit(InterfaceBlock &iface)
1750 {
1751         if(!supports_interface_blocks(iface.interface))
1752                 flatten_block(iface.members);
1753 }
1754
1755 } // namespace GL
1756 } // namespace Msp