source/programcompiler.cpp

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