source/programcompiler.cpp

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