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         string head = "#version 150\n";
  62         for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
  63         {
  64                 if(i->type==VERTEX)
  65                         program.attach_shader_owned(new VertexShader(head+apply<Formatter>(*i)));
  66                 else if(i->type==GEOMETRY)
  67                         program.attach_shader_owned(new GeometryShader(head+apply<Formatter>(*i)));
  68                 else if(i->type==FRAGMENT)
  69                         program.attach_shader_owned(new FragmentShader(head+apply<Formatter>(*i)));
  70         }
  71
  72         program.bind_attribute(VERTEX4, "vertex");
  73         program.bind_attribute(NORMAL3, "normal");
  74         program.bind_attribute(COLOR4_FLOAT, "color");
  75         program.bind_attribute(TEXCOORD4, "texcoord");
  76 }
  77
  78 Module *ProgramCompiler::create_builtins_module()
  79 {
  80         ProgramParser parser;
  81         Module *module = new Module(parser.parse(builtins_src));
  82         for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
  83         {
  84                 VariableResolver resolver;
  85                 i->content.visit(resolver);
  86                 for(map<string, VariableDeclaration *>::iterator j=i->content.variables.begin(); j!=i->content.variables.end(); ++j)
  87                         j->second->linked_declaration = j->second;
  88         }
  89         return module;
  90 }
  91
  92 Module &ProgramCompiler::get_builtins_module()
  93 {
  94         static RefPtr<Module> builtins_module = create_builtins_module();
  95         return *builtins_module;
  96 }
  97
  98 Stage *ProgramCompiler::get_builtins(StageType type)
  99 {
 100         Module &module = get_builtins_module();
 101         for(list<Stage>::iterator i=module.stages.begin(); i!=module.stages.end(); ++i)
 102                 if(i->type==type)
 103                         return &*i;
 104         return 0;
 105 }
 106
 107 void ProgramCompiler::process()
 108 {
 109         list<Import *> imports = apply<NodeGatherer<Import> >(module->shared);
 110         for(list<Import *>::iterator i=imports.end(); i!=imports.begin(); )
 111                 import((*--i)->module);
 112         apply<NodeRemover>(module->shared, set<Node *>(imports.begin(), imports.end()));
 113
 114         for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); ++i)
 115                 generate(*i);
 116         for(list<Stage>::iterator i=module->stages.begin(); i!=module->stages.end(); )
 117         {
 118                 if(optimize(*i))
 119                         i = module->stages.begin();
 120                 else
 121                         ++i;
 122         }
 123 }
 124
 125 void ProgramCompiler::import(const string &name)
 126 {
 127         if(!resources)
 128                 throw runtime_error("no resources");
 129         RefPtr<IO::Seekable> io = resources->open_raw(name+".glsl");
 130         if(!io)
 131                 throw runtime_error(format("module %s not found", name));
 132         ProgramParser import_parser;
 133         Module &imported_module = import_parser.parse(*io);
 134
 135         inject_block(module->shared.content, imported_module.shared.content);
 136         apply<DeclarationCombiner>(module->shared);
 137         for(list<Stage>::iterator i=imported_module.stages.begin(); i!=imported_module.stages.end(); ++i)
 138         {
 139                 list<Stage>::iterator j;
 140                 for(j=module->stages.begin(); (j!=module->stages.end() && j->type<i->type); ++j) ;
 141                 if(j==module->stages.end() || j->type>i->type)
 142                 {
 143                         j = module->stages.insert(j, *i);
 144                         list<Stage>::iterator k = j;
 145                         if(++k!=module->stages.end())
 146                                 k->previous = &*j;
 147                         if(j!=module->stages.begin())
 148                                 j->previous = &*--(k=j);
 149                 }
 150                 else
 151                 {
 152                         inject_block(j->content, i->content);
 153                         apply<DeclarationCombiner>(*j);
 154                 }
 155         }
 156 }
 157
 158 void ProgramCompiler::generate(Stage &stage)
 159 {
 160         inject_block(stage.content, module->shared.content);
 161
 162         apply<VariableResolver>(stage);
 163         apply<InterfaceGenerator>(stage);
 164         apply<VariableResolver>(stage);
 165         apply<VariableRenamer>(stage);
 166 }
 167
 168 bool ProgramCompiler::optimize(Stage &stage)
 169 {
 170         set<Node *> unused = apply<UnusedVariableLocator>(stage);
 171         apply<NodeRemover>(stage, unused);
 172
 173         return !unused.empty();
 174 }
 175
 176 void ProgramCompiler::inject_block(Block &target, const Block &source)
 177 {
 178         list<NodePtr<Node> >::iterator insert_point = target.body.begin();
 179         for(list<NodePtr<Node> >::const_iterator i=source.body.begin(); i!=source.body.end(); ++i)
 180                 target.body.insert(insert_point, (*i)->clone());
 181 }
 182
 183 template<typename T>
 184 typename T::ResultType ProgramCompiler::apply(Stage &stage)
 185 {
 186         T visitor;
 187         visitor.apply(stage);
 188         return visitor.get_result();
 189 }
 190
 191 template<typename T, typename A>
 192 typename T::ResultType ProgramCompiler::apply(Stage &stage, const A &arg)
 193 {
 194         T visitor(arg);
 195         visitor.apply(stage);
 196         return visitor.get_result();
 197 }
 198
 199
 200 ProgramCompiler::Visitor::Visitor():
 201         stage(0)
 202 { }
 203
 204 void ProgramCompiler::Visitor::apply(Stage &s)
 205 {
 206         SetForScope<Stage *> set(stage, &s);
 207         stage->content.visit(*this);
 208 }
 209
 210
 211 ProgramCompiler::Formatter::Formatter():
 212         indent(0),
 213         parameter_list(false),
 214         else_if(0)
 215 { }
 216
 217 void ProgramCompiler::Formatter::visit(Literal &literal)
 218 {
 219         formatted += literal.token;
 220 }
 221
 222 void ProgramCompiler::Formatter::visit(ParenthesizedExpression &parexpr)
 223 {
 224         formatted += '(';
 225         parexpr.expression->visit(*this);
 226         formatted += ')';
 227 }
 228
 229 void ProgramCompiler::Formatter::visit(VariableReference &var)
 230 {
 231         formatted += var.name;
 232 }
 233
 234 void ProgramCompiler::Formatter::visit(MemberAccess &memacc)
 235 {
 236         memacc.left->visit(*this);
 237         formatted += format(".%s", memacc.member);
 238 }
 239
 240 void ProgramCompiler::Formatter::visit(UnaryExpression &unary)
 241 {
 242         if(unary.prefix)
 243                 formatted += unary.oper;
 244         unary.expression->visit(*this);
 245         if(!unary.prefix)
 246                 formatted += unary.oper;
 247 }
 248
 249 void ProgramCompiler::Formatter::visit(BinaryExpression &binary)
 250 {
 251         binary.left->visit(*this);
 252         formatted += binary.oper;
 253         binary.right->visit(*this);
 254         formatted += binary.after;
 255 }
 256
 257 void ProgramCompiler::Formatter::visit(Assignment &assign)
 258 {
 259         assign.left->visit(*this);
 260         formatted += format(" %s ", assign.oper);
 261         assign.right->visit(*this);
 262 }
 263
 264 void ProgramCompiler::Formatter::visit(FunctionCall &call)
 265 {
 266         formatted += format("%s(", call.name);
 267         for(vector<NodePtr<Expression> >::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
 268         {
 269                 if(i!=call.arguments.begin())
 270                         formatted += ", ";
 271                 (*i)->visit(*this);
 272         }
 273         formatted += ')';
 274 }
 275
 276 void ProgramCompiler::Formatter::visit(ExpressionStatement &expr)
 277 {
 278         expr.expression->visit(*this);
 279         formatted += ';';
 280 }
 281
 282 void ProgramCompiler::Formatter::visit(Block &block)
 283 {
 284         if(else_if)
 285                 --else_if;
 286
 287         unsigned brace_indent = indent;
 288         bool use_braces = (block.use_braces || (indent && block.body.size()!=1));
 289         if(use_braces)
 290                 formatted += format("%s{\n", string(brace_indent*2, ' '));
 291
 292         SetForScope<unsigned> set(indent, indent+!formatted.empty());
 293         string spaces(indent*2, ' ');
 294         for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
 295         {
 296                 if(i!=block.body.begin())
 297                         formatted += '\n';
 298                 formatted += spaces;
 299                 (*i)->visit(*this);
 300                 else_if = 0;
 301         }
 302
 303         if(use_braces)
 304                 formatted += format("\n%s}", string(brace_indent*2, ' '));
 305 }
 306
 307 void ProgramCompiler::Formatter::visit(Import &import)
 308 {
 309         formatted += format("import %s;", import.module);
 310 }
 311
 312 void ProgramCompiler::Formatter::visit(Layout &layout)
 313 {
 314         formatted += "layout(";
 315         for(vector<Layout::Qualifier>::const_iterator i=layout.qualifiers.begin(); i!=layout.qualifiers.end(); ++i)
 316         {
 317                 if(i!=layout.qualifiers.begin())
 318                         formatted += ", ";
 319                 formatted += i->identifier;
 320                 if(!i->value.empty())
 321                         formatted += format("=%s", i->value);
 322         }
 323         formatted += format(") %s;", layout.interface);
 324 }
 325
 326 void ProgramCompiler::Formatter::visit(StructDeclaration &strct)
 327 {
 328         formatted += format("struct %s\n", strct.name);
 329         strct.members.visit(*this);
 330         formatted += ';';
 331 }
 332
 333 void ProgramCompiler::Formatter::visit(VariableDeclaration &var)
 334 {
 335         if(var.constant)
 336                 formatted += "const ";
 337         if(!var.sampling.empty())
 338                 formatted += format("%s ", var.sampling);
 339         if(!var.interface.empty() && var.interface!=block_interface)
 340                 formatted += format("%s ", var.interface);
 341         formatted += format("%s %s", var.type, var.name);
 342         if(var.array)
 343         {
 344                 formatted += '[';
 345                 if(var.array_size)
 346                         var.array_size->visit(*this);
 347                 formatted += ']';
 348         }
 349         if(var.init_expression)
 350         {
 351                 formatted += " = ";
 352                 var.init_expression->visit(*this);
 353         }
 354         if(!parameter_list)
 355                 formatted += ';';
 356 }
 357
 358 void ProgramCompiler::Formatter::visit(InterfaceBlock &iface)
 359 {
 360         SetForScope<string> set(block_interface, iface.interface);
 361         formatted += format("%s %s\n", iface.interface, iface.name);
 362         iface.members.visit(*this);
 363         formatted += ';';
 364 }
 365
 366 void ProgramCompiler::Formatter::visit(FunctionDeclaration &func)
 367 {
 368         formatted += format("%s %s(", func.return_type, func.name);
 369         for(vector<NodePtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
 370         {
 371                 if(i!=func.parameters.begin())
 372                         formatted += ", ";
 373                 SetFlag set(parameter_list);
 374                 (*i)->visit(*this);
 375         }
 376         formatted += ')';
 377         if(func.definition==&func)
 378         {
 379                 formatted += '\n';
 380                 func.body.visit(*this);
 381         }
 382         else
 383                 formatted += ';';
 384 }
 385
 386 void ProgramCompiler::Formatter::visit(Conditional &cond)
 387 {
 388         if(else_if)
 389                 formatted.replace(formatted.rfind('\n'), string::npos, 1, ' ');
 390
 391         indent -= else_if;
 392
 393         formatted += "if(";
 394         cond.condition->visit(*this);
 395         formatted += ")\n";
 396
 397         cond.body.visit(*this);
 398         if(!cond.else_body.body.empty())
 399         {
 400                 formatted += format("\n%selse\n", string(indent*2, ' '));
 401                 SetForScope<unsigned> set(else_if, 2);
 402                 cond.else_body.visit(*this);
 403         }
 404 }
 405
 406 void ProgramCompiler::Formatter::visit(Iteration &iter)
 407 {
 408         formatted += "for(";
 409         iter.init_statement->visit(*this);
 410         formatted += ' ';
 411         iter.condition->visit(*this);
 412         formatted += "; ";
 413         iter.loop_expression->visit(*this);
 414         formatted += ")\n";
 415         iter.body.visit(*this);
 416 }
 417
 418 void ProgramCompiler::Formatter::visit(Return &ret)
 419 {
 420         formatted += "return ";
 421         ret.expression->visit(*this);
 422         formatted += ';';
 423 }
 424
 425
 426 ProgramCompiler::DeclarationCombiner::DeclarationCombiner():
 427         toplevel(true),
 428         remove_node(false)
 429 { }
 430
 431 void ProgramCompiler::DeclarationCombiner::visit(Block &block)
 432 {
 433         if(!toplevel)
 434                 return;
 435
 436         SetForScope<bool> set(toplevel, false);
 437         for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
 438         {
 439                 remove_node = false;
 440                 (*i)->visit(*this);
 441                 if(remove_node)
 442                         block.body.erase(i++);
 443                 else
 444                         ++i;
 445         }
 446 }
 447
 448 void ProgramCompiler::DeclarationCombiner::visit(FunctionDeclaration &func)
 449 {
 450         vector<FunctionDeclaration *> &decls = functions[func.name];
 451         if(func.definition)
 452         {
 453                 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
 454                 {
 455                         (*i)->definition = func.definition;
 456                         (*i)->body.body.clear();
 457                 }
 458         }
 459         decls.push_back(&func);
 460 }
 461
 462 void ProgramCompiler::DeclarationCombiner::visit(VariableDeclaration &var)
 463 {
 464         VariableDeclaration *&ptr = variables[var.name];
 465         if(ptr)
 466         {
 467                 if(var.init_expression)
 468                         ptr->init_expression = var.init_expression;
 469                 remove_node = true;
 470         }
 471         else
 472                 ptr = &var;
 473 }
 474
 475
 476 ProgramCompiler::VariableResolver::VariableResolver():
 477         anonymous(false),
 478         record_target(false),
 479         assignment_target(0),
 480         self_referencing(false)
 481 { }
 482
 483 void ProgramCompiler::VariableResolver::apply(Stage &s)
 484 {
 485         SetForScope<Stage *> set(stage, &s);
 486         Stage *builtins = get_builtins(stage->type);
 487         if(builtins)
 488                 blocks.push_back(&builtins->content);
 489         stage->content.visit(*this);
 490         if(builtins)
 491                 blocks.pop_back();
 492 }
 493
 494 void ProgramCompiler::VariableResolver::visit(Block &block)
 495 {
 496         blocks.push_back(&block);
 497         block.variables.clear();
 498         TraversingVisitor::visit(block);
 499         blocks.pop_back();
 500 }
 501
 502 void ProgramCompiler::VariableResolver::visit(VariableReference &var)
 503 {
 504         var.declaration = 0;
 505         type = 0;
 506         for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
 507         {
 508                 --i;
 509                 map<string, VariableDeclaration *>::iterator j = (*i)->variables.find(var.name);
 510                 if(j!=(*i)->variables.end())
 511                 {
 512                         var.declaration = j->second;
 513                         type = j->second->type_declaration;
 514                         break;
 515                 }
 516         }
 517
 518         if(record_target)
 519         {
 520                 if(assignment_target)
 521                 {
 522                         record_target = false;
 523                         assignment_target = 0;
 524                 }
 525                 else
 526                         assignment_target = var.declaration;
 527         }
 528         else if(var.declaration && var.declaration==assignment_target)
 529                 self_referencing = true;
 530 }
 531
 532 void ProgramCompiler::VariableResolver::visit(MemberAccess &memacc)
 533 {
 534         type = 0;
 535         TraversingVisitor::visit(memacc);
 536         memacc.declaration = 0;
 537         if(type)
 538         {
 539                 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
 540                 if(i!=type->members.variables.end())
 541                 {
 542                         memacc.declaration = i->second;
 543                         type = i->second->type_declaration;
 544                 }
 545                 else
 546                         type = 0;
 547         }
 548 }
 549
 550 void ProgramCompiler::VariableResolver::visit(BinaryExpression &binary)
 551 {
 552         if(binary.oper=="[")
 553         {
 554                 {
 555                         SetForScope<bool> set(record_target, false);
 556                         binary.right->visit(*this);
 557                 }
 558                 type = 0;
 559                 binary.left->visit(*this);
 560         }
 561         else
 562         {
 563                 TraversingVisitor::visit(binary);
 564                 type = 0;
 565         }
 566 }
 567
 568 void ProgramCompiler::VariableResolver::visit(Assignment &assign)
 569 {
 570         {
 571                 SetFlag set(record_target);
 572                 assignment_target = 0;
 573                 assign.left->visit(*this);
 574         }
 575
 576         self_referencing = false;
 577         assign.right->visit(*this);
 578
 579         assign.self_referencing = (self_referencing || assign.oper!="=");
 580         assign.target_declaration = assignment_target;
 581 }
 582
 583 void ProgramCompiler::VariableResolver::visit(StructDeclaration &strct)
 584 {
 585         TraversingVisitor::visit(strct);
 586         blocks.back()->types[strct.name] = &strct;
 587 }
 588
 589 void ProgramCompiler::VariableResolver::visit(VariableDeclaration &var)
 590 {
 591         for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
 592         {
 593                 --i;
 594                 map<string, StructDeclaration *>::iterator j = (*i)->types.find(var.type);
 595                 if(j!=(*i)->types.end())
 596                         var.type_declaration = j->second;
 597         }
 598
 599         if(!block_interface.empty() && var.interface.empty())
 600                 var.interface = block_interface;
 601
 602         TraversingVisitor::visit(var);
 603         blocks.back()->variables[var.name] = &var;
 604         if(anonymous && blocks.size()>1)
 605                 blocks[blocks.size()-2]->variables[var.name] = &var;
 606 }
 607
 608 void ProgramCompiler::VariableResolver::visit(InterfaceBlock &iface)
 609 {
 610         SetFlag set(anonymous);
 611         SetForScope<string> set2(block_interface, iface.interface);
 612         TraversingVisitor::visit(iface);
 613 }
 614
 615
 616 ProgramCompiler::InterfaceGenerator::InterfaceGenerator():
 617         scope_level(0),
 618         remove_node(false)
 619 { }
 620
 621 string ProgramCompiler::InterfaceGenerator::get_out_prefix(StageType type)
 622 {
 623         if(type==VERTEX)
 624                 return "_vs_out_";
 625         else if(type==GEOMETRY)
 626                 return "_gs_out_";
 627         else
 628                 return string();
 629 }
 630
 631 void ProgramCompiler::InterfaceGenerator::apply(Stage &s)
 632 {
 633         SetForScope<Stage *> set(stage, &s);
 634         if(stage->previous)
 635                 in_prefix = get_out_prefix(stage->previous->type);
 636         out_prefix = get_out_prefix(stage->type);
 637         stage->content.visit(*this);
 638 }
 639
 640 void ProgramCompiler::InterfaceGenerator::visit(Block &block)
 641 {
 642         SetForScope<unsigned> set(scope_level, scope_level+1);
 643         for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
 644         {
 645                 (*i)->visit(*this);
 646
 647                 if(scope_level==1)
 648                 {
 649                         for(map<string, VariableDeclaration *>::iterator j=iface_declarations.begin(); j!=iface_declarations.end(); ++j)
 650                         {
 651                                 list<NodePtr<Node> >::iterator k = block.body.insert(i, j->second);
 652                                 (*k)->visit(*this);
 653                         }
 654                         iface_declarations.clear();
 655                 }
 656
 657                 for(list<Node *>::iterator j=insert_nodes.begin(); j!=insert_nodes.end(); ++j)
 658                         block.body.insert(i, *j);
 659                 insert_nodes.clear();
 660
 661                 if(remove_node)
 662                         block.body.erase(i++);
 663                 else
 664                         ++i;
 665                 remove_node = false;
 666         }
 667 }
 668
 669 string ProgramCompiler::InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
 670 {
 671         unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
 672         return prefix+name.substr(offset);
 673 }
 674
 675 bool ProgramCompiler::InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
 676 {
 677         const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
 678         if(stage_vars.count(name) || iface_declarations.count(name))
 679                 return false;
 680
 681         VariableDeclaration* iface_var = new VariableDeclaration;
 682         iface_var->sampling = var.sampling;
 683         iface_var->interface = iface;
 684         iface_var->type = var.type;
 685         iface_var->type_declaration = var.type_declaration;
 686         iface_var->name = name;
 687         if(stage->type==GEOMETRY)
 688                 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
 689         else
 690                 iface_var->array = var.array;
 691         if(iface_var->array)
 692                 iface_var->array_size = var.array_size;
 693         if(iface=="in")
 694                 iface_var->linked_declaration = &var;
 695         iface_declarations[name] = iface_var;
 696
 697         return true;
 698 }
 699
 700 void ProgramCompiler::InterfaceGenerator::insert_assignment(const string &left, ProgramSyntax::Expression *right)
 701 {
 702         Assignment *assign = new Assignment;
 703         VariableReference *ref = new VariableReference;
 704         ref->name = left;
 705         assign->left = ref;
 706         assign->oper = "=";
 707         assign->right = right;
 708
 709         ExpressionStatement *stmt = new ExpressionStatement;
 710         stmt->expression = assign;
 711         insert_nodes.push_back(stmt);
 712 }
 713
 714 void ProgramCompiler::InterfaceGenerator::visit(VariableReference &var)
 715 {
 716         if(var.declaration || !stage->previous)
 717                 return;
 718         if(iface_declarations.count(var.name))
 719                 return;
 720
 721         const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
 722         map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
 723         if(i==prev_out.end())
 724                 i = prev_out.find(in_prefix+var.name);
 725         if(i!=prev_out.end())
 726                 generate_interface(*i->second, "in", var.name);
 727 }
 728
 729 void ProgramCompiler::InterfaceGenerator::visit(VariableDeclaration &var)
 730 {
 731         if(var.interface=="out")
 732         {
 733                 if(scope_level==1)
 734                         stage->out_variables[var.name] = &var;
 735                 else if(generate_interface(var, "out", change_prefix(var.name, string())))
 736                 {
 737                         remove_node = true;
 738                         if(var.init_expression)
 739                                 insert_assignment(var.name, var.init_expression->clone());
 740                 }
 741         }
 742         else if(var.interface=="in")
 743         {
 744                 stage->in_variables[var.name] = &var;
 745                 if(var.linked_declaration)
 746                         var.linked_declaration->linked_declaration = &var;
 747                 else if(stage->previous)
 748                 {
 749                         const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
 750                         map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
 751                         if(i!=prev_out.end())
 752                         {
 753                                 var.linked_declaration = i->second;
 754                                 i->second->linked_declaration = &var;
 755                         }
 756                 }
 757         }
 758
 759         TraversingVisitor::visit(var);
 760 }
 761
 762 void ProgramCompiler::InterfaceGenerator::visit(Passthrough &pass)
 763 {
 764         vector<VariableDeclaration *> pass_vars;
 765
 766         for(map<string, VariableDeclaration *>::const_iterator i=stage->in_variables.begin(); i!=stage->in_variables.end(); ++i)
 767                 pass_vars.push_back(i->second);
 768         for(map<string, VariableDeclaration *>::const_iterator i=iface_declarations.begin(); i!=iface_declarations.end(); ++i)
 769                 if(i->second->interface=="in")
 770                         pass_vars.push_back(i->second);
 771
 772         if(stage->previous)
 773         {
 774                 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
 775                 for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
 776                 {
 777                         bool linked = false;
 778                         for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
 779                                 linked = ((*j)->linked_declaration==i->second);
 780
 781                         if(!linked && generate_interface(*i->second, "in", i->second->name))
 782                                 pass_vars.push_back(i->second);
 783                 }
 784         }
 785
 786         if(stage->type==GEOMETRY)
 787         {
 788                 VariableReference *ref = new VariableReference;
 789                 ref->name = "gl_in";
 790
 791                 BinaryExpression *subscript = new BinaryExpression;
 792                 subscript->left = ref;
 793                 subscript->oper = "[";
 794                 subscript->right = pass.subscript;
 795                 subscript->after = "]";
 796
 797                 MemberAccess *memacc = new MemberAccess;
 798                 memacc->left = subscript;
 799                 memacc->member = "gl_Position";
 800
 801                 insert_assignment("gl_Position", memacc);
 802         }
 803
 804         for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
 805         {
 806                 string out_name = change_prefix((*i)->name, out_prefix);
 807                 generate_interface(**i, "out", out_name);
 808
 809                 VariableReference *ref = new VariableReference;
 810                 ref->name = (*i)->name;
 811                 if(pass.subscript)
 812                 {
 813                         BinaryExpression *subscript = new BinaryExpression;
 814                         subscript->left = ref;
 815                         subscript->oper = "[";
 816                         subscript->right = pass.subscript;
 817                         subscript->after = "]";
 818                         insert_assignment(out_name, subscript);
 819                 }
 820                 else
 821                         insert_assignment(out_name, ref);
 822         }
 823
 824         remove_node = true;
 825 }
 826
 827
 828 void ProgramCompiler::VariableRenamer::visit(VariableReference &var)
 829 {
 830         if(var.declaration)
 831                 var.name = var.declaration->name;
 832 }
 833
 834 void ProgramCompiler::VariableRenamer::visit(VariableDeclaration &var)
 835 {
 836         if(var.linked_declaration)
 837                 var.name = var.linked_declaration->name;
 838         TraversingVisitor::visit(var);
 839 }
 840
 841
 842 ProgramCompiler::UnusedVariableLocator::UnusedVariableLocator():
 843         aggregate(0),
 844         assignment(0),
 845         assignment_target(false)
 846 { }
 847
 848 void ProgramCompiler::UnusedVariableLocator::apply(Stage &s)
 849 {
 850         assignments.push_back(BlockAssignmentMap());
 851         Visitor::apply(s);
 852         assignments.pop_back();
 853 }
 854
 855 void ProgramCompiler::UnusedVariableLocator::visit(VariableReference &var)
 856 {
 857         unused_nodes.erase(var.declaration);
 858
 859         map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
 860         if(i!=aggregates.end())
 861                 unused_nodes.erase(i->second);
 862
 863         if(assignment_target)
 864                 return;
 865
 866         for(vector<BlockAssignmentMap>::iterator j=assignments.end(); j!=assignments.begin(); )
 867         {
 868                 --j;
 869                 BlockAssignmentMap::iterator k = j->find(var.declaration);
 870                 if(k!=j->end())
 871                 {
 872                         for(vector<Node *>::iterator l=k->second.nodes.begin(); l!=k->second.nodes.end(); ++l)
 873                                 unused_nodes.erase(*l);
 874                         j->erase(k);
 875                         break;
 876                 }
 877         }
 878 }
 879
 880 void ProgramCompiler::UnusedVariableLocator::visit(MemberAccess &memacc)
 881 {
 882         TraversingVisitor::visit(memacc);
 883         unused_nodes.erase(memacc.declaration);
 884 }
 885
 886 void ProgramCompiler::UnusedVariableLocator::visit(BinaryExpression &binary)
 887 {
 888         if(binary.oper=="[")
 889         {
 890                 binary.left->visit(*this);
 891                 SetForScope<bool> set(assignment_target, false);
 892                 binary.right->visit(*this);
 893         }
 894         else
 895                 TraversingVisitor::visit(binary);
 896 }
 897
 898 void ProgramCompiler::UnusedVariableLocator::visit(Assignment &assign)
 899 {
 900         {
 901                 SetForScope<bool> set(assignment_target, !assign.self_referencing);
 902                 assign.left->visit(*this);
 903         }
 904         assign.right->visit(*this);
 905         assignment = &assign;
 906 }
 907
 908 void ProgramCompiler::UnusedVariableLocator::record_assignment(VariableDeclaration &var, Node &node, bool self_ref)
 909 {
 910         unused_nodes.insert(&node);
 911         BlockAssignmentMap &block_assignments = assignments.back();
 912         AssignmentList &var_assignments = block_assignments[&var];
 913         if(!self_ref)
 914                 var_assignments.nodes.clear();
 915         var_assignments.nodes.push_back(&node);
 916         var_assignments.conditional = false;
 917         var_assignments.self_referencing = self_ref;
 918 }
 919
 920 void ProgramCompiler::UnusedVariableLocator::visit(ExpressionStatement &expr)
 921 {
 922         assignment = 0;
 923         TraversingVisitor::visit(expr);
 924         if(assignment && assignment->target_declaration)
 925                 record_assignment(*assignment->target_declaration, expr, assignment->self_referencing);
 926 }
 927
 928 void ProgramCompiler::UnusedVariableLocator::visit(StructDeclaration &strct)
 929 {
 930         SetForScope<Node *> set(aggregate, &strct);
 931         unused_nodes.insert(&strct);
 932         TraversingVisitor::visit(strct);
 933 }
 934
 935 void ProgramCompiler::UnusedVariableLocator::visit(VariableDeclaration &var)
 936 {
 937         if(aggregate)
 938                 aggregates[&var] = aggregate;
 939         else
 940         {
 941                 unused_nodes.insert(&var);
 942                 if(var.init_expression)
 943                         record_assignment(var, *var.init_expression, false);
 944         }
 945         unused_nodes.erase(var.type_declaration);
 946         TraversingVisitor::visit(var);
 947 }
 948
 949 void ProgramCompiler::UnusedVariableLocator::visit(InterfaceBlock &iface)
 950 {
 951         SetForScope<Node *> set(aggregate, &iface);
 952         unused_nodes.insert(&iface);
 953         TraversingVisitor::visit(iface);
 954 }
 955
 956 void ProgramCompiler::UnusedVariableLocator::visit(FunctionDeclaration &func)
 957 {
 958         assignments.push_back(BlockAssignmentMap());
 959
 960         for(vector<NodePtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
 961                 (*i)->visit(*this);
 962         func.body.visit(*this);
 963
 964         BlockAssignmentMap &block_assignments = assignments.back();
 965         for(map<string, VariableDeclaration *>::iterator i=func.body.variables.begin(); i!=func.body.variables.end(); ++i)
 966                 block_assignments.erase(i->second);
 967         for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
 968         {
 969                 if(i->first->interface=="out" && stage->type!=FRAGMENT && !i->first->linked_declaration)
 970                         continue;
 971
 972                 for(vector<Node *>::iterator j=i->second.nodes.begin(); j!=i->second.nodes.end(); ++j)
 973                         unused_nodes.erase(*j);
 974         }
 975
 976         assignments.pop_back();
 977 }
 978
 979 void ProgramCompiler::UnusedVariableLocator::merge_down_assignments()
 980 {
 981         BlockAssignmentMap &parent_assignments = assignments[assignments.size()-2];
 982         BlockAssignmentMap &block_assignments = assignments.back();
 983         for(BlockAssignmentMap::iterator i=block_assignments.begin(); i!=block_assignments.end(); ++i)
 984         {
 985                 BlockAssignmentMap::iterator j = parent_assignments.find(i->first);
 986                 if(j==parent_assignments.end())
 987                         parent_assignments.insert(*i);
 988                 else if(i->second.self_referencing || i->second.conditional)
 989                 {
 990                         j->second.nodes.insert(j->second.nodes.end(), i->second.nodes.begin(), i->second.nodes.end());
 991                         j->second.conditional |= i->second.conditional;
 992                         j->second.self_referencing |= i->second.self_referencing;
 993                 }
 994                 else
 995                         j->second = i->second;
 996         }
 997         assignments.pop_back();
 998 }
 999
1000 void ProgramCompiler::UnusedVariableLocator::visit(Conditional &cond)
1001 {
1002         cond.condition->visit(*this);
1003         assignments.push_back(BlockAssignmentMap());
1004         cond.body.visit(*this);
1005
1006         BlockAssignmentMap if_assignments;
1007         swap(assignments.back(), if_assignments);
1008         cond.else_body.visit(*this);
1009
1010         BlockAssignmentMap &else_assignments = assignments.back();
1011         for(BlockAssignmentMap::iterator i=else_assignments.begin(); i!=else_assignments.end(); ++i)
1012         {
1013                 BlockAssignmentMap::iterator j = if_assignments.find(i->first);
1014                 if(j!=if_assignments.end())
1015                 {
1016                         i->second.nodes.insert(i->second.nodes.end(), j->second.nodes.begin(), j->second.nodes.end());
1017                         i->second.conditional |= j->second.conditional;
1018                         i->second.self_referencing |= j->second.self_referencing;
1019                         if_assignments.erase(j);
1020                 }
1021                 else
1022                         i->second.conditional = true;
1023         }
1024
1025         for(BlockAssignmentMap::iterator i=if_assignments.begin(); i!=if_assignments.end(); ++i)
1026         {
1027                 i->second.conditional = true;
1028                 else_assignments.insert(*i);
1029         }
1030
1031         merge_down_assignments();
1032 }
1033
1034 void ProgramCompiler::UnusedVariableLocator::visit(Iteration &iter)
1035 {
1036         assignments.push_back(BlockAssignmentMap());
1037         TraversingVisitor::visit(iter);
1038         merge_down_assignments();
1039 }
1040
1041
1042 ProgramCompiler::NodeRemover::NodeRemover(const set<Node *> &r):
1043         to_remove(r)
1044 { }
1045
1046 void ProgramCompiler::NodeRemover::visit(Block &block)
1047 {
1048         for(list<NodePtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
1049         {
1050                 (*i)->visit(*this);
1051                 if(to_remove.count(&**i))
1052                         block.body.erase(i++);
1053                 else
1054                         ++i;
1055         }
1056 }
1057
1058 void ProgramCompiler::NodeRemover::visit(VariableDeclaration &var)
1059 {
1060         if(to_remove.count(&var))
1061         {
1062                 stage->in_variables.erase(var.name);
1063                 stage->out_variables.erase(var.name);
1064                 if(var.linked_declaration)
1065                         var.linked_declaration->linked_declaration = 0;
1066         }
1067         else if(var.init_expression && to_remove.count(&*var.init_expression))
1068                 var.init_expression = 0;
1069 }
1070
1071 } // namespace GL
1072 } // namespace Msp