source/programcompiler.cpp

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