source/programcompiler.cpp

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