source/programcompiler.cpp

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