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