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<LegacyConverter>(stage);
 169         apply<VariableResolver>(stage);
 170 }
 171
 172 bool ProgramCompiler::optimize(Stage &stage)
 173 {
 174         apply<ConstantConditionEliminator>(stage);
 175         apply<VariableResolver>(stage);
 176
 177         set<Node *> unused = apply<UnusedVariableLocator>(stage);
 178         set<Node *> unused2 = apply<UnusedFunctionLocator>(stage);
 179         unused.insert(unused2.begin(), unused2.end());
 180         apply<NodeRemover>(stage, unused);
 181
 182         return !unused.empty();
 183 }
 184
 185 void ProgramCompiler::inject_block(Block &target, const Block &source)
 186 {
 187         list<NodePtr<Node> >::iterator insert_point = target.body.begin();
 188         for(list<NodePtr<Node> >::const_iterator i=source.body.begin(); i!=source.body.end(); ++i)
 189                 target.body.insert(insert_point, (*i)->clone());
 190 }
 191
 192 template<typename T>
 193 typename T::ResultType ProgramCompiler::apply(Stage &stage)
 194 {
 195         T visitor;
 196         visitor.apply(stage);
 197         return visitor.get_result();
 198 }
 199
 200 template<typename T, typename A>
 201 typename T::ResultType ProgramCompiler::apply(Stage &stage, const A &arg)
 202 {
 203         T visitor(arg);
 204         visitor.apply(stage);
 205         return visitor.get_result();
 206 }
 207
 208
 209 ProgramCompiler::Visitor::Visitor():
 210         stage(0)
 211 { }
 212
 213 void ProgramCompiler::Visitor::apply(Stage &s)
 214 {
 215         SetForScope<Stage *> set(stage, &s);
 216         stage->content.visit(*this);
 217 }
 218
 219
 220 ProgramCompiler::Formatter::Formatter():
 221         indent(0),
 222         parameter_list(false),
 223         else_if(0)
 224 { }
 225
 226 void ProgramCompiler::Formatter::apply(ProgramSyntax::Stage &s)
 227 {
 228         const Version &ver = s.required_version;
 229         if(ver.major)
 230                 formatted += format("#version %d%d\n", ver.major, ver.minor);
 231         Visitor::apply(s);
 232 }
 233
 234 void ProgramCompiler::Formatter::visit(Literal &literal)
 235 {
 236         formatted += literal.token;
 237 }
 238
 239 void ProgramCompiler::Formatter::visit(ParenthesizedExpression &parexpr)
 240 {
 241         formatted += '(';
 242         parexpr.expression->visit(*this);
 243         formatted += ')';
 244 }
 245
 246 void ProgramCompiler::Formatter::visit(VariableReference &var)
 247 {
 248         formatted += var.name;
 249 }
 250
 251 void ProgramCompiler::Formatter::visit(MemberAccess &memacc)
 252 {
 253         memacc.left->visit(*this);
 254         formatted += format(".%s", memacc.member);
 255 }
 256
 257 void ProgramCompiler::Formatter::visit(UnaryExpression &unary)
 258 {
 259         if(unary.prefix)
 260                 formatted += unary.oper;
 261         unary.expression->visit(*this);
 262         if(!unary.prefix)
 263                 formatted += unary.oper;
 264 }
 265
 266 void ProgramCompiler::Formatter::visit(BinaryExpression &binary)
 267 {
 268         binary.left->visit(*this);
 269         formatted += binary.oper;
 270         binary.right->visit(*this);
 271         formatted += binary.after;
 272 }
 273
 274 void ProgramCompiler::Formatter::visit(Assignment &assign)
 275 {
 276         assign.left->visit(*this);
 277         formatted += format(" %s ", assign.oper);
 278         assign.right->visit(*this);
 279 }
 280
 281 void ProgramCompiler::Formatter::visit(FunctionCall &call)
 282 {
 283         formatted += format("%s(", call.name);
 284         for(vector<NodePtr<Expression> >::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
 285         {
 286                 if(i!=call.arguments.begin())
 287                         formatted += ", ";
 288                 (*i)->visit(*this);
 289         }
 290         formatted += ')';
 291 }
 292
 293 void ProgramCompiler::Formatter::visit(ExpressionStatement &expr)
 294 {
 295         expr.expression->visit(*this);
 296         formatted += ';';
 297 }
 298
 299 void ProgramCompiler::Formatter::visit(Block &block)
 300 {
 301         if(else_if)
 302                 --else_if;
 303
 304         unsigned brace_indent = indent;
 305         bool use_braces = (block.use_braces || (indent && block.body.size()!=1));
 306         if(use_braces)
 307                 formatted += format("%s{\n", string(brace_indent*2, ' '));
 308
 309         SetForScope<unsigned> set(indent, indent+(indent>0 || use_braces));
 310         string spaces(indent*2, ' ');
 311         for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
 312         {
 313                 if(i!=block.body.begin())
 314                         formatted += '\n';
 315                 formatted += spaces;
 316                 (*i)->visit(*this);
 317                 else_if = 0;
 318         }
 319
 320         if(use_braces)
 321                 formatted += format("\n%s}", string(brace_indent*2, ' '));
 322 }
 323
 324 void ProgramCompiler::Formatter::visit(Import &import)
 325 {
 326         formatted += format("import %s;", import.module);
 327 }
 328
 329 void ProgramCompiler::Formatter::visit(Layout &layout)
 330 {
 331         formatted += "layout(";
 332         for(vector<Layout::Qualifier>::const_iterator i=layout.qualifiers.begin(); i!=layout.qualifiers.end(); ++i)
 333         {
 334                 if(i!=layout.qualifiers.begin())
 335                         formatted += ", ";
 336                 formatted += i->identifier;
 337                 if(!i->value.empty())
 338                         formatted += format("=%s", i->value);
 339         }
 340         formatted += ')';
 341 }
 342
 343 void ProgramCompiler::Formatter::visit(InterfaceLayout &layout)
 344 {
 345         layout.layout.visit(*this);
 346         formatted += format(" %s;", layout.interface);
 347 }
 348
 349 void ProgramCompiler::Formatter::visit(StructDeclaration &strct)
 350 {
 351         formatted += format("struct %s\n", strct.name);
 352         strct.members.visit(*this);
 353         formatted += ';';
 354 }
 355
 356 void ProgramCompiler::Formatter::visit(VariableDeclaration &var)
 357 {
 358         if(var.layout)
 359         {
 360                 var.layout->visit(*this);
 361                 formatted += ' ';
 362         }
 363         if(var.constant)
 364                 formatted += "const ";
 365         if(!var.sampling.empty())
 366                 formatted += format("%s ", var.sampling);
 367         if(!var.interface.empty() && var.interface!=block_interface)
 368                 formatted += format("%s ", var.interface);
 369         formatted += format("%s %s", var.type, var.name);
 370         if(var.array)
 371         {
 372                 formatted += '[';
 373                 if(var.array_size)
 374                         var.array_size->visit(*this);
 375                 formatted += ']';
 376         }
 377         if(var.init_expression)
 378         {
 379                 formatted += " = ";
 380                 var.init_expression->visit(*this);
 381         }
 382         if(!parameter_list)
 383                 formatted += ';';
 384 }
 385
 386 void ProgramCompiler::Formatter::visit(InterfaceBlock &iface)
 387 {
 388         SetForScope<string> set(block_interface, iface.interface);
 389         formatted += format("%s %s\n", iface.interface, iface.name);
 390         iface.members.visit(*this);
 391         formatted += ';';
 392 }
 393
 394 void ProgramCompiler::Formatter::visit(FunctionDeclaration &func)
 395 {
 396         formatted += format("%s %s(", func.return_type, func.name);
 397         for(vector<NodePtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
 398         {
 399                 if(i!=func.parameters.begin())
 400                         formatted += ", ";
 401                 SetFlag set(parameter_list);
 402                 (*i)->visit(*this);
 403         }
 404         formatted += ')';
 405         if(func.definition==&func)
 406         {
 407                 formatted += '\n';
 408                 func.body.visit(*this);
 409         }
 410         else
 411                 formatted += ';';
 412 }
 413
 414 void ProgramCompiler::Formatter::visit(Conditional &cond)
 415 {
 416         if(else_if)
 417                 formatted.replace(formatted.rfind('\n'), string::npos, 1, ' ');
 418
 419         indent -= else_if;
 420
 421         formatted += "if(";
 422         cond.condition->visit(*this);
 423         formatted += ")\n";
 424
 425         cond.body.visit(*this);
 426         if(!cond.else_body.body.empty())
 427         {
 428                 formatted += format("\n%selse\n", string(indent*2, ' '));
 429                 SetForScope<unsigned> set(else_if, 2);
 430                 cond.else_body.visit(*this);
 431         }
 432 }
 433
 434 void ProgramCompiler::Formatter::visit(Iteration &iter)
 435 {
 436         formatted += "for(";
 437         iter.init_statement->visit(*this);
 438         formatted += ' ';
 439         iter.condition->visit(*this);
 440         formatted += "; ";
 441         iter.loop_expression->visit(*this);
 442         formatted += ")\n";
 443         iter.body.visit(*this);
 444 }
 445
 446 void ProgramCompiler::Formatter::visit(Return &ret)
 447 {
 448         formatted += "return ";
 449         ret.expression->visit(*this);
 450         formatted += ';';
 451 }
 452
 453
 454 ProgramCompiler::DeclarationCombiner::DeclarationCombiner():
 455         toplevel(true),
 456         remove_node(false)
 457 { }
 458
 459 void ProgramCompiler::DeclarationCombiner::visit(Block &block)
 460 {
 461         if(!toplevel)
 462                 return;
 463
 464         SetForScope<bool> set(toplevel, false);
 465         for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
 466         {
 467                 remove_node = false;
 468                 (*i)->visit(*this);
 469                 if(remove_node)
 470                         block.body.erase(i++);
 471                 else
 472                         ++i;
 473         }
 474 }
 475
 476 void ProgramCompiler::DeclarationCombiner::visit(FunctionDeclaration &func)
 477 {
 478         vector<FunctionDeclaration *> &decls = functions[func.name];
 479         if(func.definition)
 480         {
 481                 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
 482                 {
 483                         (*i)->definition = func.definition;
 484                         (*i)->body.body.clear();
 485                 }
 486         }
 487         decls.push_back(&func);
 488 }
 489
 490 void ProgramCompiler::DeclarationCombiner::visit(VariableDeclaration &var)
 491 {
 492         VariableDeclaration *&ptr = variables[var.name];
 493         if(ptr)
 494         {
 495                 ptr->type = var.type;
 496                 if(var.init_expression)
 497                         ptr->init_expression = var.init_expression;
 498                 remove_node = true;
 499         }
 500         else
 501                 ptr = &var;
 502 }
 503
 504
 505 ProgramCompiler::VariableResolver::VariableResolver():
 506         anonymous(false),
 507         record_target(false),
 508         assignment_target(0),
 509         self_referencing(false)
 510 { }
 511
 512 void ProgramCompiler::VariableResolver::apply(Stage &s)
 513 {
 514         SetForScope<Stage *> set(stage, &s);
 515         Stage *builtins = get_builtins(stage->type);
 516         if(builtins)
 517                 blocks.push_back(&builtins->content);
 518         stage->content.visit(*this);
 519         if(builtins)
 520                 blocks.pop_back();
 521 }
 522
 523 void ProgramCompiler::VariableResolver::visit(Block &block)
 524 {
 525         blocks.push_back(&block);
 526         block.variables.clear();
 527         TraversingVisitor::visit(block);
 528         blocks.pop_back();
 529 }
 530
 531 void ProgramCompiler::VariableResolver::visit(VariableReference &var)
 532 {
 533         var.declaration = 0;
 534         type = 0;
 535         for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
 536         {
 537                 --i;
 538                 map<string, VariableDeclaration *>::iterator j = (*i)->variables.find(var.name);
 539                 if(j!=(*i)->variables.end())
 540                 {
 541                         var.declaration = j->second;
 542                         type = j->second->type_declaration;
 543                         break;
 544                 }
 545         }
 546
 547         if(record_target)
 548         {
 549                 if(assignment_target)
 550                 {
 551                         record_target = false;
 552                         assignment_target = 0;
 553                 }
 554                 else
 555                         assignment_target = var.declaration;
 556         }
 557         else if(var.declaration && var.declaration==assignment_target)
 558                 self_referencing = true;
 559 }
 560
 561 void ProgramCompiler::VariableResolver::visit(MemberAccess &memacc)
 562 {
 563         type = 0;
 564         TraversingVisitor::visit(memacc);
 565         memacc.declaration = 0;
 566         if(type)
 567         {
 568                 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
 569                 if(i!=type->members.variables.end())
 570                 {
 571                         memacc.declaration = i->second;
 572                         type = i->second->type_declaration;
 573                 }
 574                 else
 575                         type = 0;
 576         }
 577 }
 578
 579 void ProgramCompiler::VariableResolver::visit(BinaryExpression &binary)
 580 {
 581         if(binary.oper=="[")
 582         {
 583                 {
 584                         SetForScope<bool> set(record_target, false);
 585                         binary.right->visit(*this);
 586                 }
 587                 type = 0;
 588                 binary.left->visit(*this);
 589         }
 590         else
 591         {
 592                 TraversingVisitor::visit(binary);
 593                 type = 0;
 594         }
 595 }
 596
 597 void ProgramCompiler::VariableResolver::visit(Assignment &assign)
 598 {
 599         {
 600                 SetFlag set(record_target);
 601                 assignment_target = 0;
 602                 assign.left->visit(*this);
 603         }
 604
 605         self_referencing = false;
 606         assign.right->visit(*this);
 607
 608         assign.self_referencing = (self_referencing || assign.oper!="=");
 609         assign.target_declaration = assignment_target;
 610 }
 611
 612 void ProgramCompiler::VariableResolver::visit(StructDeclaration &strct)
 613 {
 614         TraversingVisitor::visit(strct);
 615         blocks.back()->types[strct.name] = &strct;
 616 }
 617
 618 void ProgramCompiler::VariableResolver::visit(VariableDeclaration &var)
 619 {
 620         for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
 621         {
 622                 --i;
 623                 map<string, StructDeclaration *>::iterator j = (*i)->types.find(var.type);
 624                 if(j!=(*i)->types.end())
 625                         var.type_declaration = j->second;
 626         }
 627
 628         if(!block_interface.empty() && var.interface.empty())
 629                 var.interface = block_interface;
 630
 631         TraversingVisitor::visit(var);
 632         blocks.back()->variables[var.name] = &var;
 633         if(anonymous && blocks.size()>1)
 634                 blocks[blocks.size()-2]->variables[var.name] = &var;
 635 }
 636
 637 void ProgramCompiler::VariableResolver::visit(InterfaceBlock &iface)
 638 {
 639         SetFlag set(anonymous);
 640         SetForScope<string> set2(block_interface, iface.interface);
 641         TraversingVisitor::visit(iface);
 642 }
 643
 644
 645 void ProgramCompiler::FunctionResolver::visit(FunctionCall &call)
 646 {
 647         map<string, vector<FunctionDeclaration *> >::iterator i = functions.find(call.name);
 648         if(i!=functions.end())
 649                 call.declaration = i->second.back();
 650
 651         TraversingVisitor::visit(call);
 652 }
 653
 654 void ProgramCompiler::FunctionResolver::visit(FunctionDeclaration &func)
 655 {
 656         vector<FunctionDeclaration *> &decls = functions[func.name];
 657         if(func.definition)
 658         {
 659                 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
 660                         (*i)->definition = func.definition;
 661                 decls.clear();
 662                 decls.push_back(&func);
 663         }
 664         else if(!decls.empty() && decls.back()->definition)
 665                 func.definition = decls.back()->definition;
 666         else
 667                 decls.push_back(&func);
 668
 669         TraversingVisitor::visit(func);
 670 }
 671
 672
 673 ProgramCompiler::BlockModifier::BlockModifier():
 674         remove_node(false)
 675 { }
 676
 677 void ProgramCompiler::BlockModifier::flatten_block(Block &block)
 678 {
 679         for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
 680                 insert_nodes.push_back((*i)->clone());
 681         remove_node = true;
 682 }
 683
 684 void ProgramCompiler::BlockModifier::apply_and_increment(Block &block, list<NodePtr<Node> >::iterator &i)
 685 {
 686         for(list<Node *>::iterator j=insert_nodes.begin(); j!=insert_nodes.end(); ++j)
 687                 block.body.insert(i, *j);
 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<NodePtr<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<NodePtr<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, VariableDeclaration *>::iterator j=iface_declarations.begin(); j!=iface_declarations.end(); ++j)
 740                         {
 741                                 list<NodePtr<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, 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);
 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::ExpressionEvaluator::ExpressionEvaluator():
 925         variable_values(0),
 926         result(0.0f),
 927         result_valid(false)
 928 { }
 929
 930 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator(const ValueMap &v):
 931         variable_values(&v),
 932         result(0.0f),
 933         result_valid(false)
 934 { }
 935
 936 void ProgramCompiler::ExpressionEvaluator::visit(Literal &literal)
 937 {
 938         if(literal.token=="true")
 939                 result = 1.0f;
 940         else if(literal.token=="false")
 941                 result = 0.0f;
 942         else
 943                 result = lexical_cast<float>(literal.token);
 944         result_valid = true;
 945 }
 946
 947 void ProgramCompiler::ExpressionEvaluator::visit(ParenthesizedExpression &parexp)
 948 {
 949         parexp.expression->visit(*this);
 950 }
 951
 952 void ProgramCompiler::ExpressionEvaluator::visit(VariableReference &var)
 953 {
 954         if(!var.declaration)
 955                 return;
 956
 957         if(variable_values)
 958         {
 959                 ValueMap::const_iterator i = variable_values->find(var.declaration);
 960                 if(i!=variable_values->end())
 961                         i->second->visit(*this);
 962         }
 963         else if(var.declaration->init_expression)
 964                 var.declaration->init_expression->visit(*this);
 965 }
 966
 967 void ProgramCompiler::ExpressionEvaluator::visit(UnaryExpression &unary)
 968 {
 969         result_valid = false;
 970         unary.expression->visit(*this);
 971         if(!result_valid)
 972                 return;
 973
 974         if(unary.oper=="!")
 975                 result = !result;
 976         else
 977                 result_valid = false;
 978 }
 979
 980 void ProgramCompiler::ExpressionEvaluator::visit(BinaryExpression &binary)
 981 {
 982         result_valid = false;
 983         binary.left->visit(*this);
 984         if(!result_valid)
 985                 return;
 986
 987         float left_result = result;
 988         result_valid = false;
 989         binary.right->visit(*this);
 990         if(!result_valid)
 991                 return;
 992
 993         if(binary.oper=="<")
 994                 result = (left_result<result);
 995         else if(binary.oper=="<=")
 996                 result = (left_result<=result);
 997         else if(binary.oper==">")
 998                 result = (left_result>result);
 999         else if(binary.oper==">=")
1000                 result = (left_result>=result);
1001         else if(binary.oper=="==")
1002                 result = (left_result==result);
1003         else if(binary.oper=="!=")
1004                 result = (left_result!=result);
1005         else if(binary.oper=="&&")
1006                 result = (left_result && result);
1007         else if(binary.oper=="||")
1008                 result = (left_result || result);
1009         else
1010                 result_valid = false;
1011 }
1012
1013
1014 ProgramCompiler::ConstantConditionEliminator::ConstantConditionEliminator():
1015         scope_level(0)
1016 { }
1017
1018 void ProgramCompiler::ConstantConditionEliminator::visit(Block &block)
1019 {
1020         SetForScope<unsigned> set(scope_level, scope_level+1);
1021         BlockModifier::visit(block);
1022
1023         for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
1024                 variable_values.erase(i->second);
1025 }
1026
1027 void ProgramCompiler::ConstantConditionEliminator::visit(Assignment &assign)
1028 {
1029         variable_values.erase(assign.target_declaration);
1030 }
1031
1032 void ProgramCompiler::ConstantConditionEliminator::visit(VariableDeclaration &var)
1033 {
1034         if(var.constant || scope_level>1)
1035                 variable_values[&var] = &*var.init_expression;
1036 }
1037
1038 void ProgramCompiler::ConstantConditionEliminator::visit(Conditional &cond)
1039 {
1040         ExpressionEvaluator eval(variable_values);
1041         cond.condition->visit(eval);
1042         if(eval.result_valid)
1043                 flatten_block(eval.result ? cond.body : cond.else_body);
1044         else
1045                 TraversingVisitor::visit(cond);
1046 }
1047
1048 void ProgramCompiler::ConstantConditionEliminator::visit(Iteration &iter)
1049 {
1050         if(iter.condition)
1051         {
1052                 ExpressionEvaluator eval;
1053                 iter.condition->visit(eval);
1054                 if(eval.result_valid && !eval.result)
1055                 {
1056                         remove_node = true;
1057                         return;
1058                 }
1059         }
1060
1061         TraversingVisitor::visit(iter);
1062 }
1063
1064
1065 ProgramCompiler::UnusedVariableLocator::UnusedVariableLocator():
1066         aggregate(0),
1067         assignment(0),
1068         assignment_target(false)
1069 { }
1070
1071 void ProgramCompiler::UnusedVariableLocator::apply(Stage &s)
1072 {
1073         assignments.push_back(BlockAssignmentMap());
1074         Visitor::apply(s);
1075         assignments.pop_back();
1076 }
1077
1078 void ProgramCompiler::UnusedVariableLocator::visit(VariableReference &var)
1079 {
1080         unused_nodes.erase(var.declaration);
1081
1082         map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
1083         if(i!=aggregates.end())
1084                 unused_nodes.erase(i->second);
1085
1086         if(assignment_target)
1087                 return;
1088
1089         for(vector<BlockAssignmentMap>::iterator j=assignments.end(); j!=assignments.begin(); )
1090         {
1091                 --j;
1092                 BlockAssignmentMap::iterator k = j->find(var.declaration);
1093                 if(k!=j->end())
1094                 {
1095                         for(vector<Node *>::iterator l=k->second.nodes.begin(); l!=k->second.nodes.end(); ++l)
1096                                 unused_nodes.erase(*l);
1097                         j->erase(k);
1098                         break;
1099                 }
1100         }
1101 }
1102
1103 void ProgramCompiler::UnusedVariableLocator::visit(MemberAccess &memacc)
1104 {
1105         TraversingVisitor::visit(memacc);
1106         unused_nodes.erase(memacc.declaration);
1107 }
1108
1109 void ProgramCompiler::UnusedVariableLocator::visit(BinaryExpression &binary)
1110 {
1111         if(binary.oper=="[")
1112         {
1113                 binary.left->visit(*this);
1114                 SetForScope<bool> set(assignment_target, false);
1115                 binary.right->visit(*this);
1116         }
1117         else
1118                 TraversingVisitor::visit(binary);
1119 }
1120
1121 void ProgramCompiler::UnusedVariableLocator::visit(Assignment &assign)
1122 {
1123         {
1124                 SetForScope<bool> set(assignment_target, !assign.self_referencing);
1125                 assign.left->visit(*this);
1126         }
1127         assign.right->visit(*this);
1128         assignment = &assign;
1129 }
1130
1131 void ProgramCompiler::UnusedVariableLocator::record_assignment(VariableDeclaration &var, Node &node, bool self_ref)
1132 {
1133         unused_nodes.insert(&node);
1134         BlockAssignmentMap &block_assignments = assignments.back();
1135         AssignmentList &var_assignments = block_assignments[&var];
1136         if(!self_ref)
1137                 var_assignments.nodes.clear();
1138         var_assignments.nodes.push_back(&node);
1139         var_assignments.conditional = false;
1140         var_assignments.self_referencing = self_ref;
1141 }
1142
1143 void ProgramCompiler::UnusedVariableLocator::visit(ExpressionStatement &expr)
1144 {
1145         assignment = 0;
1146         TraversingVisitor::visit(expr);
1147         if(assignment && assignment->target_declaration)
1148                 record_assignment(*assignment->target_declaration, expr, assignment->self_referencing);
1149 }
1150
1151 void ProgramCompiler::UnusedVariableLocator::visit(StructDeclaration &strct)
1152 {
1153         SetForScope<Node *> set(aggregate, &strct);
1154         unused_nodes.insert(&strct);
1155         TraversingVisitor::visit(strct);
1156 }
1157
1158 void ProgramCompiler::UnusedVariableLocator::visit(VariableDeclaration &var)
1159 {
1160         if(aggregate)
1161                 aggregates[&var] = aggregate;
1162         else
1163         {
1164                 unused_nodes.insert(&var);
1165                 if(var.init_expression)
1166                         record_assignment(var, *var.init_expression, false);
1167         }
1168         unused_nodes.erase(var.type_declaration);
1169         TraversingVisitor::visit(var);
1170 }
1171
1172 void ProgramCompiler::UnusedVariableLocator::visit(InterfaceBlock &iface)
1173 {
1174         SetForScope<Node *> set(aggregate, &iface);
1175         unused_nodes.insert(&iface);
1176         TraversingVisitor::visit(iface);
1177 }
1178
1179 void ProgramCompiler::UnusedVariableLocator::visit(FunctionDeclaration &func)
1180 {
1181         assignments.push_back(BlockAssignmentMap());
1182
1183         for(vector<NodePtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1184                 (*i)->visit(*this);
1185         func.body.visit(*this);
1186
1187         BlockAssignmentMap &block_assignments = assignments.back();
1188         for(map<string, VariableDeclaration *>::iterator i=func.body.variables.begin(); i!=func.body.variables.end(); ++i)
1189                 block_assignments.erase(i->second);
1190         for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
1191         {
1192                 if(i->first->interface=="out" && stage->type!=FRAGMENT && !i->first->linked_declaration)
1193                         continue;
1194
1195                 for(vector<Node *>::iterator j=i->second.nodes.begin(); j!=i->second.nodes.end(); ++j)
1196                         unused_nodes.erase(*j);
1197         }
1198
1199         assignments.pop_back();
1200 }
1201
1202 void ProgramCompiler::UnusedVariableLocator::merge_down_assignments()
1203 {
1204         BlockAssignmentMap &parent_assignments = assignments[assignments.size()-2];
1205         BlockAssignmentMap &block_assignments = assignments.back();
1206         for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
1207         {
1208                 BlockAssignmentMap::iterator j = parent_assignments.find(i->first);
1209                 if(j==parent_assignments.end())
1210                         parent_assignments.insert(*i);
1211                 else if(i->second.self_referencing || i->second.conditional)
1212                 {
1213                         j->second.nodes.insert(j->second.nodes.end(), i->second.nodes.begin(), i->second.nodes.end());
1214                         j->second.conditional |= i->second.conditional;
1215                         j->second.self_referencing |= i->second.self_referencing;
1216                 }
1217                 else
1218                         j->second = i->second;
1219         }
1220         assignments.pop_back();
1221 }
1222
1223 void ProgramCompiler::UnusedVariableLocator::visit(Conditional &cond)
1224 {
1225         cond.condition->visit(*this);
1226         assignments.push_back(BlockAssignmentMap());
1227         cond.body.visit(*this);
1228
1229         BlockAssignmentMap if_assignments;
1230         swap(assignments.back(), if_assignments);
1231         cond.else_body.visit(*this);
1232
1233         BlockAssignmentMap &else_assignments = assignments.back();
1234         for(BlockAssignmentMap::iterator i=else_assignments.begin(); i!=else_assignments.end(); ++i)
1235         {
1236                 BlockAssignmentMap::iterator j = if_assignments.find(i->first);
1237                 if(j!=if_assignments.end())
1238                 {
1239                         i->second.nodes.insert(i->second.nodes.end(), j->second.nodes.begin(), j->second.nodes.end());
1240                         i->second.conditional |= j->second.conditional;
1241                         i->second.self_referencing |= j->second.self_referencing;
1242                         if_assignments.erase(j);
1243                 }
1244                 else
1245                         i->second.conditional = true;
1246         }
1247
1248         for(BlockAssignmentMap::iterator i=if_assignments.begin(); i!=if_assignments.end(); ++i)
1249         {
1250                 i->second.conditional = true;
1251                 else_assignments.insert(*i);
1252         }
1253
1254         merge_down_assignments();
1255 }
1256
1257 void ProgramCompiler::UnusedVariableLocator::visit(Iteration &iter)
1258 {
1259         assignments.push_back(BlockAssignmentMap());
1260         TraversingVisitor::visit(iter);
1261         merge_down_assignments();
1262 }
1263
1264
1265 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionCall &call)
1266 {
1267         TraversingVisitor::visit(call);
1268
1269         unused_nodes.erase(call.declaration);
1270         if(call.declaration && call.declaration->definition!=call.declaration)
1271                 used_definitions.insert(call.declaration->definition);
1272 }
1273
1274 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionDeclaration &func)
1275 {
1276         TraversingVisitor::visit(func);
1277
1278         if(func.name!="main" && !used_definitions.count(&func))
1279                 unused_nodes.insert(&func);
1280 }
1281
1282
1283 ProgramCompiler::NodeRemover::NodeRemover(const set<Node *> &r):
1284         to_remove(r)
1285 { }
1286
1287 void ProgramCompiler::NodeRemover::visit(Block &block)
1288 {
1289         for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
1290         {
1291                 (*i)->visit(*this);
1292                 if(to_remove.count(&**i))
1293                         block.body.erase(i++);
1294                 else
1295                         ++i;
1296         }
1297 }
1298
1299 void ProgramCompiler::NodeRemover::visit(VariableDeclaration &var)
1300 {
1301         if(to_remove.count(&var))
1302         {
1303                 stage->in_variables.erase(var.name);
1304                 stage->out_variables.erase(var.name);
1305                 stage->locations.erase(var.name);
1306                 if(var.linked_declaration)
1307                         var.linked_declaration->linked_declaration = 0;
1308         }
1309         else if(var.init_expression && to_remove.count(&*var.init_expression))
1310                 var.init_expression = 0;
1311 }
1312
1313
1314 ProgramCompiler::LegacyConverter::LegacyConverter():
1315         target_version(get_glsl_version())
1316 { }
1317
1318 ProgramCompiler::LegacyConverter::LegacyConverter(const Version &v):
1319         target_version(v)
1320 { }
1321
1322 bool ProgramCompiler::LegacyConverter::check_version(const Version &feature_version)
1323 {
1324         if(target_version<feature_version)
1325                 return false;
1326         else if(stage->required_version<feature_version)
1327                 stage->required_version = feature_version;
1328
1329         return true;
1330 }
1331
1332 void ProgramCompiler::LegacyConverter::visit(VariableReference &var)
1333 {
1334         if(var.name==frag_out_name && !check_version(Version(1, 30)))
1335         {
1336                 var.name = "gl_FragColor";
1337                 var.declaration = 0;
1338                 type = "vec4";
1339         }
1340         else if(var.declaration)
1341                 type = var.declaration->type;
1342         else
1343                 type = string();
1344 }
1345
1346 void ProgramCompiler::LegacyConverter::visit(FunctionCall &call)
1347 {
1348         if(call.name=="texture" && !call.declaration && !check_version(Version(1, 30)))
1349         {
1350                 vector<NodePtr<Expression> >::iterator i = call.arguments.begin();
1351                 if(i!=call.arguments.end())
1352                 {
1353                         (*i)->visit(*this);
1354                         if(type=="sampler1D")
1355                                 call.name = "texture1D";
1356                         else if(type=="sampler2D")
1357                                 call.name = "texture2D";
1358                         else if(type=="sampler3D")
1359                                 call.name = "texture3D";
1360                         else if(type=="sampler1DShadow")
1361                                 call.name = "shadow1D";
1362                         else if(type=="sampler2DShadow")
1363                                 call.name = "shadow2D";
1364
1365                         for(; i!=call.arguments.end(); ++i)
1366                                 (*i)->visit(*this);
1367                 }
1368         }
1369         else
1370                 TraversingVisitor::visit(call);
1371 }
1372
1373 void ProgramCompiler::LegacyConverter::visit(VariableDeclaration &var)
1374 {
1375         if(var.layout && !check_version(Version(3, 30)))
1376         {
1377                 vector<Layout::Qualifier>::iterator i;
1378                 for(i=var.layout->qualifiers.begin(); (i!=var.layout->qualifiers.end() && i->identifier!="location"); ++i) ;
1379                 if(i!=var.layout->qualifiers.end())
1380                 {
1381                         unsigned location = lexical_cast<unsigned>(i->value);
1382                         if(stage->type==VERTEX && var.interface=="in")
1383                         {
1384                                 stage->locations[var.name] = location;
1385                                 var.layout->qualifiers.erase(i);
1386                         }
1387                         else if(stage->type==FRAGMENT && var.interface=="out")
1388                         {
1389                                 stage->locations[var.name] = location;
1390                                 var.layout->qualifiers.erase(i);
1391                         }
1392
1393                         if(var.layout->qualifiers.empty())
1394                                 var.layout = 0;
1395                 }
1396         }
1397
1398         if((var.interface=="in" || var.interface=="out") && !check_version(Version(1, 30)))
1399         {
1400                 if(stage->type==VERTEX && var.interface=="in")
1401                         var.interface = "attribute";
1402                 else if((stage->type==VERTEX && var.interface=="out") || (stage->type==FRAGMENT && var.interface=="in"))
1403                         var.interface = "varying";
1404                 else if(stage->type==FRAGMENT && var.interface=="out")
1405                 {
1406                         frag_out_name = var.name;
1407                         remove_node = true;
1408                 }
1409         }
1410
1411         TraversingVisitor::visit(var);
1412 }
1413
1414 void ProgramCompiler::LegacyConverter::visit(InterfaceBlock &iface)
1415 {
1416         if(!check_version(Version(1, 50)))
1417                 flatten_block(iface.members);
1418 }
1419
1420 } // namespace GL
1421 } // namespace Msp