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         list<Import *> imports = apply<NodeGatherer<Import> >(mod.shared);
 134         for(list<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<VariableRenamer>(stage);
 209         apply<DeclarationReorderer>(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.sampling.empty())
 462                 formatted += format("%s ", var.sampling);
 463         if(!var.interface.empty() && var.interface!=block_interface)
 464         {
 465                 string interface = var.interface;
 466                 if(stage->required_version<Version(1, 30))
 467                 {
 468                         if(stage->type==VERTEX && var.interface=="in")
 469                                 interface = "attribute";
 470                         else if((stage->type==VERTEX && var.interface=="out") || (stage->type==FRAGMENT && var.interface=="in"))
 471                                 interface = "varying";
 472                 }
 473                 formatted += format("%s ", interface);
 474         }
 475         if(!var.precision.empty())
 476                 formatted += format("%s ", var.precision);
 477         formatted += format("%s %s", var.type, var.name);
 478         if(var.array)
 479         {
 480                 formatted += '[';
 481                 if(var.array_size)
 482                         var.array_size->visit(*this);
 483                 formatted += ']';
 484         }
 485         if(var.init_expression)
 486         {
 487                 formatted += " = ";
 488                 var.init_expression->visit(*this);
 489         }
 490         if(!parameter_list)
 491                 formatted += ';';
 492 }
 493
 494 void ProgramCompiler::Formatter::visit(InterfaceBlock &iface)
 495 {
 496         SetForScope<string> set(block_interface, iface.interface);
 497         formatted += format("%s %s\n", iface.interface, iface.name);
 498         iface.members.visit(*this);
 499         formatted += ';';
 500 }
 501
 502 void ProgramCompiler::Formatter::visit(FunctionDeclaration &func)
 503 {
 504         formatted += format("%s %s(", func.return_type, func.name);
 505         for(vector<RefPtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
 506         {
 507                 if(i!=func.parameters.begin())
 508                         formatted += ", ";
 509                 SetFlag set(parameter_list);
 510                 (*i)->visit(*this);
 511         }
 512         formatted += ')';
 513         if(func.definition==&func)
 514         {
 515                 formatted += '\n';
 516                 func.body.visit(*this);
 517         }
 518         else
 519                 formatted += ';';
 520 }
 521
 522 void ProgramCompiler::Formatter::visit(Conditional &cond)
 523 {
 524         if(else_if)
 525                 formatted.replace(formatted.rfind('\n'), string::npos, 1, ' ');
 526
 527         indent -= else_if;
 528
 529         formatted += "if(";
 530         cond.condition->visit(*this);
 531         formatted += ")\n";
 532
 533         cond.body.visit(*this);
 534         if(!cond.else_body.body.empty())
 535         {
 536                 formatted += format("\n%selse\n", string(indent*2, ' '));
 537                 SetForScope<unsigned> set(else_if, 2);
 538                 cond.else_body.visit(*this);
 539         }
 540 }
 541
 542 void ProgramCompiler::Formatter::visit(Iteration &iter)
 543 {
 544         formatted += "for(";
 545         iter.init_statement->visit(*this);
 546         formatted += ' ';
 547         iter.condition->visit(*this);
 548         formatted += "; ";
 549         iter.loop_expression->visit(*this);
 550         formatted += ")\n";
 551         iter.body.visit(*this);
 552 }
 553
 554 void ProgramCompiler::Formatter::visit(Return &ret)
 555 {
 556         formatted += "return ";
 557         ret.expression->visit(*this);
 558         formatted += ';';
 559 }
 560
 561 void ProgramCompiler::Formatter::visit(Jump &jump)
 562 {
 563         formatted += jump.keyword;
 564         formatted += ';';
 565 }
 566
 567
 568 ProgramCompiler::DeclarationCombiner::DeclarationCombiner():
 569         toplevel(true)
 570 { }
 571
 572 void ProgramCompiler::DeclarationCombiner::visit(Block &block)
 573 {
 574         if(!toplevel)
 575                 return;
 576
 577         SetForScope<bool> set(toplevel, false);
 578         BlockModifier::visit(block);
 579 }
 580
 581 void ProgramCompiler::DeclarationCombiner::visit(FunctionDeclaration &func)
 582 {
 583         vector<FunctionDeclaration *> &decls = functions[func.name];
 584         if(func.definition)
 585         {
 586                 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
 587                 {
 588                         (*i)->definition = func.definition;
 589                         (*i)->body.body.clear();
 590                 }
 591         }
 592         decls.push_back(&func);
 593 }
 594
 595 void ProgramCompiler::DeclarationCombiner::visit(VariableDeclaration &var)
 596 {
 597         VariableDeclaration *&ptr = variables[var.name];
 598         if(ptr)
 599         {
 600                 ptr->type = var.type;
 601                 if(var.init_expression)
 602                         ptr->init_expression = var.init_expression;
 603                 remove_node = true;
 604         }
 605         else
 606                 ptr = &var;
 607 }
 608
 609
 610 ProgramCompiler::VariableResolver::VariableResolver():
 611         anonymous(false),
 612         record_target(false),
 613         assignment_target(0),
 614         self_referencing(false)
 615 { }
 616
 617 void ProgramCompiler::VariableResolver::apply(Stage &s)
 618 {
 619         SetForScope<Stage *> set(stage, &s);
 620         Stage *builtins = get_builtins(stage->type);
 621         if(builtins)
 622                 blocks.push_back(&builtins->content);
 623         stage->content.visit(*this);
 624         if(builtins)
 625                 blocks.pop_back();
 626 }
 627
 628 void ProgramCompiler::VariableResolver::visit(Block &block)
 629 {
 630         blocks.push_back(&block);
 631         block.variables.clear();
 632         TraversingVisitor::visit(block);
 633         blocks.pop_back();
 634 }
 635
 636 void ProgramCompiler::VariableResolver::visit(VariableReference &var)
 637 {
 638         var.declaration = 0;
 639         type = 0;
 640         for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
 641         {
 642                 --i;
 643                 map<string, VariableDeclaration *>::iterator j = (*i)->variables.find(var.name);
 644                 if(j!=(*i)->variables.end())
 645                 {
 646                         var.declaration = j->second;
 647                         type = j->second->type_declaration;
 648                         break;
 649                 }
 650         }
 651
 652         if(record_target)
 653         {
 654                 if(assignment_target)
 655                 {
 656                         record_target = false;
 657                         assignment_target = 0;
 658                 }
 659                 else
 660                         assignment_target = var.declaration;
 661         }
 662         else if(var.declaration && var.declaration==assignment_target)
 663                 self_referencing = true;
 664 }
 665
 666 void ProgramCompiler::VariableResolver::visit(MemberAccess &memacc)
 667 {
 668         type = 0;
 669         TraversingVisitor::visit(memacc);
 670         memacc.declaration = 0;
 671         if(type)
 672         {
 673                 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
 674                 if(i!=type->members.variables.end())
 675                 {
 676                         memacc.declaration = i->second;
 677                         type = i->second->type_declaration;
 678                 }
 679                 else
 680                         type = 0;
 681         }
 682 }
 683
 684 void ProgramCompiler::VariableResolver::visit(BinaryExpression &binary)
 685 {
 686         if(binary.oper=="[")
 687         {
 688                 {
 689                         SetForScope<bool> set(record_target, false);
 690                         binary.right->visit(*this);
 691                 }
 692                 type = 0;
 693                 binary.left->visit(*this);
 694         }
 695         else
 696         {
 697                 TraversingVisitor::visit(binary);
 698                 type = 0;
 699         }
 700 }
 701
 702 void ProgramCompiler::VariableResolver::visit(Assignment &assign)
 703 {
 704         {
 705                 SetFlag set(record_target);
 706                 assignment_target = 0;
 707                 assign.left->visit(*this);
 708         }
 709
 710         self_referencing = false;
 711         assign.right->visit(*this);
 712
 713         assign.self_referencing = (self_referencing || assign.oper!="=");
 714         assign.target_declaration = assignment_target;
 715 }
 716
 717 void ProgramCompiler::VariableResolver::visit(StructDeclaration &strct)
 718 {
 719         TraversingVisitor::visit(strct);
 720         blocks.back()->types[strct.name] = &strct;
 721 }
 722
 723 void ProgramCompiler::VariableResolver::visit(VariableDeclaration &var)
 724 {
 725         for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
 726         {
 727                 --i;
 728                 map<string, StructDeclaration *>::iterator j = (*i)->types.find(var.type);
 729                 if(j!=(*i)->types.end())
 730                         var.type_declaration = j->second;
 731         }
 732
 733         if(!block_interface.empty() && var.interface.empty())
 734                 var.interface = block_interface;
 735
 736         TraversingVisitor::visit(var);
 737         blocks.back()->variables[var.name] = &var;
 738         if(anonymous && blocks.size()>1)
 739                 blocks[blocks.size()-2]->variables[var.name] = &var;
 740 }
 741
 742 void ProgramCompiler::VariableResolver::visit(InterfaceBlock &iface)
 743 {
 744         SetFlag set(anonymous);
 745         SetForScope<string> set2(block_interface, iface.interface);
 746         TraversingVisitor::visit(iface);
 747 }
 748
 749
 750 void ProgramCompiler::FunctionResolver::visit(FunctionCall &call)
 751 {
 752         map<string, vector<FunctionDeclaration *> >::iterator i = functions.find(call.name);
 753         if(i!=functions.end())
 754                 call.declaration = i->second.back();
 755
 756         TraversingVisitor::visit(call);
 757 }
 758
 759 void ProgramCompiler::FunctionResolver::visit(FunctionDeclaration &func)
 760 {
 761         vector<FunctionDeclaration *> &decls = functions[func.name];
 762         if(func.definition)
 763         {
 764                 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
 765                         (*i)->definition = func.definition;
 766                 decls.clear();
 767                 decls.push_back(&func);
 768         }
 769         else if(!decls.empty() && decls.back()->definition)
 770                 func.definition = decls.back()->definition;
 771         else
 772                 decls.push_back(&func);
 773
 774         TraversingVisitor::visit(func);
 775 }
 776
 777
 778 ProgramCompiler::InterfaceGenerator::InterfaceGenerator():
 779         scope_level(0)
 780 { }
 781
 782 string ProgramCompiler::InterfaceGenerator::get_out_prefix(StageType type)
 783 {
 784         if(type==VERTEX)
 785                 return "_vs_out_";
 786         else if(type==GEOMETRY)
 787                 return "_gs_out_";
 788         else
 789                 return string();
 790 }
 791
 792 void ProgramCompiler::InterfaceGenerator::apply(Stage &s)
 793 {
 794         SetForScope<Stage *> set(stage, &s);
 795         if(stage->previous)
 796                 in_prefix = get_out_prefix(stage->previous->type);
 797         out_prefix = get_out_prefix(stage->type);
 798         stage->content.visit(*this);
 799 }
 800
 801 void ProgramCompiler::InterfaceGenerator::visit(Block &block)
 802 {
 803         SetForScope<unsigned> set(scope_level, scope_level+1);
 804         for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
 805         {
 806                 (*i)->visit(*this);
 807
 808                 if(scope_level==1)
 809                 {
 810                         for(map<string, RefPtr<VariableDeclaration> >::iterator j=iface_declarations.begin(); j!=iface_declarations.end(); ++j)
 811                         {
 812                                 list<RefPtr<Node> >::iterator k = block.body.insert(i, j->second);
 813                                 (*k)->visit(*this);
 814                         }
 815                         iface_declarations.clear();
 816                 }
 817
 818                 apply_and_increment(block, i);
 819         }
 820 }
 821
 822 string ProgramCompiler::InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
 823 {
 824         unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
 825         return prefix+name.substr(offset);
 826 }
 827
 828 bool ProgramCompiler::InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
 829 {
 830         const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
 831         if(stage_vars.count(name) || iface_declarations.count(name))
 832                 return false;
 833
 834         VariableDeclaration* iface_var = new VariableDeclaration;
 835         iface_var->sampling = var.sampling;
 836         iface_var->interface = iface;
 837         iface_var->type = var.type;
 838         iface_var->type_declaration = var.type_declaration;
 839         iface_var->name = name;
 840         if(stage->type==GEOMETRY)
 841                 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
 842         else
 843                 iface_var->array = var.array;
 844         if(iface_var->array)
 845                 iface_var->array_size = var.array_size;
 846         if(iface=="in")
 847                 iface_var->linked_declaration = &var;
 848         iface_declarations[name] = iface_var;
 849
 850         return true;
 851 }
 852
 853 void ProgramCompiler::InterfaceGenerator::insert_assignment(const string &left, ProgramSyntax::Expression *right)
 854 {
 855         Assignment *assign = new Assignment;
 856         VariableReference *ref = new VariableReference;
 857         ref->name = left;
 858         assign->left = ref;
 859         assign->oper = "=";
 860         assign->right = right;
 861
 862         ExpressionStatement *stmt = new ExpressionStatement;
 863         stmt->expression = assign;
 864         insert_nodes.push_back(stmt);
 865 }
 866
 867 void ProgramCompiler::InterfaceGenerator::visit(VariableReference &var)
 868 {
 869         if(var.declaration || !stage->previous)
 870                 return;
 871         if(iface_declarations.count(var.name))
 872                 return;
 873
 874         const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
 875         map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
 876         if(i==prev_out.end())
 877                 i = prev_out.find(in_prefix+var.name);
 878         if(i!=prev_out.end())
 879                 generate_interface(*i->second, "in", var.name);
 880 }
 881
 882 void ProgramCompiler::InterfaceGenerator::visit(VariableDeclaration &var)
 883 {
 884         if(var.interface=="out")
 885         {
 886                 if(scope_level==1)
 887                         stage->out_variables[var.name] = &var;
 888                 else if(generate_interface(var, "out", change_prefix(var.name, string())))
 889                 {
 890                         remove_node = true;
 891                         if(var.init_expression)
 892                                 insert_assignment(var.name, var.init_expression->clone());
 893                 }
 894         }
 895         else if(var.interface=="in")
 896         {
 897                 stage->in_variables[var.name] = &var;
 898                 if(var.linked_declaration)
 899                         var.linked_declaration->linked_declaration = &var;
 900                 else if(stage->previous)
 901                 {
 902                         const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
 903                         map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
 904                         if(i!=prev_out.end())
 905                         {
 906                                 var.linked_declaration = i->second;
 907                                 i->second->linked_declaration = &var;
 908                         }
 909                 }
 910         }
 911
 912         TraversingVisitor::visit(var);
 913 }
 914
 915 void ProgramCompiler::InterfaceGenerator::visit(Passthrough &pass)
 916 {
 917         vector<VariableDeclaration *> pass_vars;
 918
 919         for(map<string, VariableDeclaration *>::const_iterator i=stage->in_variables.begin(); i!=stage->in_variables.end(); ++i)
 920                 pass_vars.push_back(i->second);
 921         for(map<string, RefPtr<VariableDeclaration> >::const_iterator i=iface_declarations.begin(); i!=iface_declarations.end(); ++i)
 922                 if(i->second->interface=="in")
 923                         pass_vars.push_back(i->second.get());
 924
 925         if(stage->previous)
 926         {
 927                 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
 928                 for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
 929                 {
 930                         bool linked = false;
 931                         for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
 932                                 linked = ((*j)->linked_declaration==i->second);
 933
 934                         if(!linked && generate_interface(*i->second, "in", i->second->name))
 935                                 pass_vars.push_back(i->second);
 936                 }
 937         }
 938
 939         if(stage->type==GEOMETRY)
 940         {
 941                 VariableReference *ref = new VariableReference;
 942                 ref->name = "gl_in";
 943
 944                 BinaryExpression *subscript = new BinaryExpression;
 945                 subscript->left = ref;
 946                 subscript->oper = "[";
 947                 subscript->right = pass.subscript;
 948                 subscript->after = "]";
 949
 950                 MemberAccess *memacc = new MemberAccess;
 951                 memacc->left = subscript;
 952                 memacc->member = "gl_Position";
 953
 954                 insert_assignment("gl_Position", memacc);
 955         }
 956
 957         for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
 958         {
 959                 string out_name = change_prefix((*i)->name, out_prefix);
 960                 generate_interface(**i, "out", out_name);
 961
 962                 VariableReference *ref = new VariableReference;
 963                 ref->name = (*i)->name;
 964                 if(pass.subscript)
 965                 {
 966                         BinaryExpression *subscript = new BinaryExpression;
 967                         subscript->left = ref;
 968                         subscript->oper = "[";
 969                         subscript->right = pass.subscript;
 970                         subscript->after = "]";
 971                         insert_assignment(out_name, subscript);
 972                 }
 973                 else
 974                         insert_assignment(out_name, ref);
 975         }
 976
 977         remove_node = true;
 978 }
 979
 980
 981 void ProgramCompiler::VariableRenamer::visit(VariableReference &var)
 982 {
 983         if(var.declaration)
 984                 var.name = var.declaration->name;
 985 }
 986
 987 void ProgramCompiler::VariableRenamer::visit(VariableDeclaration &var)
 988 {
 989         if(var.linked_declaration)
 990                 var.name = var.linked_declaration->name;
 991         TraversingVisitor::visit(var);
 992 }
 993
 994
 995 ProgramCompiler::DeclarationReorderer::DeclarationReorderer():
 996         kind(NO_DECLARATION)
 997 { }
 998
 999 void ProgramCompiler::DeclarationReorderer::visit(Block &block)
1000 {
1001         list<RefPtr<Node> >::iterator struct_insert_point = block.body.end();
1002         list<RefPtr<Node> >::iterator variable_insert_point = block.body.end();
1003
1004         for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
1005         {
1006                 kind = NO_DECLARATION;
1007                 (*i)->visit(*this);
1008
1009                 bool moved = false;
1010                 if(kind==STRUCT && struct_insert_point!=block.body.end())
1011                 {
1012                         block.body.insert(struct_insert_point, *i);
1013                         moved = true;
1014                 }
1015                 else if(kind>STRUCT && struct_insert_point==block.body.end())
1016                         struct_insert_point = i;
1017
1018                 if(kind==VARIABLE && variable_insert_point!=block.body.end())
1019                 {
1020                         block.body.insert(variable_insert_point, *i);
1021                         moved = true;
1022                 }
1023                 else if(kind>VARIABLE && variable_insert_point==block.body.end())
1024                         variable_insert_point = i;
1025
1026                 if(moved)
1027                         block.body.erase(i++);
1028                 else
1029                         ++i;
1030         }
1031 }
1032
1033
1034 ProgramCompiler::InlineableFunctionLocator::InlineableFunctionLocator():
1035         in_function(0)
1036 { }
1037
1038 void ProgramCompiler::InlineableFunctionLocator::visit(FunctionCall &call)
1039 {
1040         FunctionDeclaration *def = call.declaration;
1041         if(def && def->definition!=def)
1042                 def = def->definition;
1043
1044         if(def)
1045         {
1046                 unsigned &count = refcounts[def];
1047                 ++count;
1048                 if(count>1 || def==in_function)
1049                         inlineable.erase(def);
1050         }
1051
1052         TraversingVisitor::visit(call);
1053 }
1054
1055 void ProgramCompiler::InlineableFunctionLocator::visit(FunctionDeclaration &func)
1056 {
1057         unsigned &count = refcounts[func.definition];
1058         if(!count && func.parameters.empty())
1059                 inlineable.insert(func.definition);
1060
1061         SetForScope<FunctionDeclaration *> set(in_function, &func);
1062         TraversingVisitor::visit(func);
1063 }
1064
1065
1066 ProgramCompiler::FunctionInliner::FunctionInliner():
1067         extract_result(0)
1068 { }
1069
1070 ProgramCompiler::FunctionInliner::FunctionInliner(const set<FunctionDeclaration *> &in):
1071         inlineable(in),
1072         extract_result(0)
1073 { }
1074
1075 void ProgramCompiler::FunctionInliner::visit_and_inline(RefPtr<Expression> &ptr)
1076 {
1077         inline_result = 0;
1078         ptr->visit(*this);
1079         if(inline_result)
1080                 ptr = inline_result;
1081 }
1082
1083 void ProgramCompiler::FunctionInliner::visit(Block &block)
1084 {
1085         if(extract_result)
1086                 --extract_result;
1087
1088         for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); ++i)
1089         {
1090                 (*i)->visit(*this);
1091                 if(extract_result)
1092                         --extract_result;
1093         }
1094 }
1095
1096 void ProgramCompiler::FunctionInliner::visit(UnaryExpression &unary)
1097 {
1098         visit_and_inline(unary.expression);
1099         inline_result = 0;
1100 }
1101
1102 void ProgramCompiler::FunctionInliner::visit(BinaryExpression &binary)
1103 {
1104         visit_and_inline(binary.left);
1105         visit_and_inline(binary.right);
1106         inline_result = 0;
1107 }
1108
1109 void ProgramCompiler::FunctionInliner::visit(FunctionCall &call)
1110 {
1111         for(vector<RefPtr<Expression> >::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
1112                 visit_and_inline(*i);
1113
1114         FunctionDeclaration *def = call.declaration;
1115         if(def && def->definition!=def)
1116                 def = def->definition;
1117
1118         if(def && inlineable.count(def))
1119         {
1120                 extract_result = 2;
1121                 def->visit(*this);
1122         }
1123         else
1124                 inline_result = 0;
1125 }
1126
1127 void ProgramCompiler::FunctionInliner::visit(Return &ret)
1128 {
1129         TraversingVisitor::visit(ret);
1130
1131         if(extract_result)
1132                 inline_result = ret.expression->clone();
1133 }
1134
1135
1136 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator():
1137         variable_values(0),
1138         result(0.0f),
1139         result_valid(false)
1140 { }
1141
1142 ProgramCompiler::ExpressionEvaluator::ExpressionEvaluator(const ValueMap &v):
1143         variable_values(&v),
1144         result(0.0f),
1145         result_valid(false)
1146 { }
1147
1148 void ProgramCompiler::ExpressionEvaluator::visit(Literal &literal)
1149 {
1150         if(literal.token=="true")
1151                 result = 1.0f;
1152         else if(literal.token=="false")
1153                 result = 0.0f;
1154         else
1155                 result = lexical_cast<float>(literal.token);
1156         result_valid = true;
1157 }
1158
1159 void ProgramCompiler::ExpressionEvaluator::visit(ParenthesizedExpression &parexp)
1160 {
1161         parexp.expression->visit(*this);
1162 }
1163
1164 void ProgramCompiler::ExpressionEvaluator::visit(VariableReference &var)
1165 {
1166         if(!var.declaration)
1167                 return;
1168
1169         if(variable_values)
1170         {
1171                 ValueMap::const_iterator i = variable_values->find(var.declaration);
1172                 if(i!=variable_values->end())
1173                         i->second->visit(*this);
1174         }
1175         else if(var.declaration->init_expression)
1176                 var.declaration->init_expression->visit(*this);
1177 }
1178
1179 void ProgramCompiler::ExpressionEvaluator::visit(UnaryExpression &unary)
1180 {
1181         result_valid = false;
1182         unary.expression->visit(*this);
1183         if(!result_valid)
1184                 return;
1185
1186         if(unary.oper=="!")
1187                 result = !result;
1188         else
1189                 result_valid = false;
1190 }
1191
1192 void ProgramCompiler::ExpressionEvaluator::visit(BinaryExpression &binary)
1193 {
1194         result_valid = false;
1195         binary.left->visit(*this);
1196         if(!result_valid)
1197                 return;
1198
1199         float left_result = result;
1200         result_valid = false;
1201         binary.right->visit(*this);
1202         if(!result_valid)
1203                 return;
1204
1205         if(binary.oper=="<")
1206                 result = (left_result<result);
1207         else if(binary.oper=="<=")
1208                 result = (left_result<=result);
1209         else if(binary.oper==">")
1210                 result = (left_result>result);
1211         else if(binary.oper==">=")
1212                 result = (left_result>=result);
1213         else if(binary.oper=="==")
1214                 result = (left_result==result);
1215         else if(binary.oper=="!=")
1216                 result = (left_result!=result);
1217         else if(binary.oper=="&&")
1218                 result = (left_result && result);
1219         else if(binary.oper=="||")
1220                 result = (left_result || result);
1221         else
1222                 result_valid = false;
1223 }
1224
1225
1226 ProgramCompiler::ConstantConditionEliminator::ConstantConditionEliminator():
1227         scope_level(0)
1228 { }
1229
1230 void ProgramCompiler::ConstantConditionEliminator::visit(Block &block)
1231 {
1232         SetForScope<unsigned> set(scope_level, scope_level+1);
1233         BlockModifier::visit(block);
1234
1235         for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
1236                 variable_values.erase(i->second);
1237 }
1238
1239 void ProgramCompiler::ConstantConditionEliminator::visit(Assignment &assign)
1240 {
1241         variable_values.erase(assign.target_declaration);
1242 }
1243
1244 void ProgramCompiler::ConstantConditionEliminator::visit(VariableDeclaration &var)
1245 {
1246         if(var.constant || scope_level>1)
1247                 variable_values[&var] = var.init_expression.get();
1248 }
1249
1250 void ProgramCompiler::ConstantConditionEliminator::visit(Conditional &cond)
1251 {
1252         ExpressionEvaluator eval(variable_values);
1253         cond.condition->visit(eval);
1254         if(eval.result_valid)
1255                 flatten_block(eval.result ? cond.body : cond.else_body);
1256         else
1257                 TraversingVisitor::visit(cond);
1258 }
1259
1260 void ProgramCompiler::ConstantConditionEliminator::visit(Iteration &iter)
1261 {
1262         if(iter.condition)
1263         {
1264                 ExpressionEvaluator eval;
1265                 iter.condition->visit(eval);
1266                 if(eval.result_valid && !eval.result)
1267                 {
1268                         remove_node = true;
1269                         return;
1270                 }
1271         }
1272
1273         TraversingVisitor::visit(iter);
1274 }
1275
1276
1277 ProgramCompiler::UnusedVariableLocator::UnusedVariableLocator():
1278         aggregate(0),
1279         assignment(0),
1280         assignment_target(false),
1281         global_scope(true)
1282 { }
1283
1284 void ProgramCompiler::UnusedVariableLocator::apply(Stage &s)
1285 {
1286         variables.push_back(BlockVariableMap());
1287         Visitor::apply(s);
1288         BlockVariableMap &global_variables = variables.back();
1289         for(BlockVariableMap::iterator i=global_variables.begin(); i!=global_variables.end(); ++i)
1290         {
1291                 if(i->first->interface=="out" && (s.type==FRAGMENT || i->first->linked_declaration || !i->first->name.compare(0, 3, "gl_")))
1292                         continue;
1293                 if(!i->second.referenced)
1294                 {
1295                         unused_nodes.insert(i->first);
1296                         clear_assignments(i->second, true);
1297                 }
1298         }
1299         variables.pop_back();
1300 }
1301
1302 void ProgramCompiler::UnusedVariableLocator::visit(VariableReference &var)
1303 {
1304         map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
1305         if(i!=aggregates.end())
1306                 unused_nodes.erase(i->second);
1307
1308         if(var.declaration && !assignment_target)
1309         {
1310                 VariableInfo &var_info = variables.back()[var.declaration];
1311                 var_info.assignments.clear();
1312                 var_info.referenced = true;
1313         }
1314 }
1315
1316 void ProgramCompiler::UnusedVariableLocator::visit(MemberAccess &memacc)
1317 {
1318         TraversingVisitor::visit(memacc);
1319         unused_nodes.erase(memacc.declaration);
1320 }
1321
1322 void ProgramCompiler::UnusedVariableLocator::visit(BinaryExpression &binary)
1323 {
1324         if(binary.oper=="[")
1325         {
1326                 binary.left->visit(*this);
1327                 SetForScope<bool> set(assignment_target, false);
1328                 binary.right->visit(*this);
1329         }
1330         else
1331                 TraversingVisitor::visit(binary);
1332 }
1333
1334 void ProgramCompiler::UnusedVariableLocator::visit(Assignment &assign)
1335 {
1336         {
1337                 SetForScope<bool> set(assignment_target, !assign.self_referencing);
1338                 assign.left->visit(*this);
1339         }
1340         assign.right->visit(*this);
1341         assignment = &assign;
1342 }
1343
1344 void ProgramCompiler::UnusedVariableLocator::record_assignment(VariableDeclaration &var, Node &node, bool self_ref)
1345 {
1346         VariableInfo &var_info = variables.back()[&var];
1347         if(!self_ref)
1348                 clear_assignments(var_info, true);
1349         var_info.assignments.push_back(&node);
1350         var_info.conditionally_assigned = false;
1351 }
1352
1353 void ProgramCompiler::UnusedVariableLocator::clear_assignments(VariableInfo &var_info, bool mark_unused)
1354 {
1355         if(mark_unused)
1356         {
1357                 for(vector<Node *>::iterator i=var_info.assignments.begin(); i!=var_info.assignments.end(); ++i)
1358                         unused_nodes.insert(*i);
1359         }
1360         var_info.assignments.clear();
1361 }
1362
1363 void ProgramCompiler::UnusedVariableLocator::visit(ExpressionStatement &expr)
1364 {
1365         assignment = 0;
1366         TraversingVisitor::visit(expr);
1367         if(assignment && assignment->target_declaration)
1368                 record_assignment(*assignment->target_declaration, expr, assignment->self_referencing);
1369 }
1370
1371 void ProgramCompiler::UnusedVariableLocator::visit(StructDeclaration &strct)
1372 {
1373         SetForScope<Node *> set(aggregate, &strct);
1374         unused_nodes.insert(&strct);
1375         TraversingVisitor::visit(strct);
1376 }
1377
1378 void ProgramCompiler::UnusedVariableLocator::visit(VariableDeclaration &var)
1379 {
1380         if(aggregate)
1381                 aggregates[&var] = aggregate;
1382         else
1383         {
1384                 variables.back()[&var].local = true;
1385                 if(var.init_expression)
1386                         record_assignment(var, *var.init_expression, false);
1387         }
1388         unused_nodes.erase(var.type_declaration);
1389         TraversingVisitor::visit(var);
1390 }
1391
1392 void ProgramCompiler::UnusedVariableLocator::visit(InterfaceBlock &iface)
1393 {
1394         SetForScope<Node *> set(aggregate, &iface);
1395         unused_nodes.insert(&iface);
1396         TraversingVisitor::visit(iface);
1397 }
1398
1399 void ProgramCompiler::UnusedVariableLocator::visit(FunctionDeclaration &func)
1400 {
1401         variables.push_back(BlockVariableMap());
1402
1403         {
1404                 SetForScope<bool> set(global_scope, false);
1405                 for(vector<RefPtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1406                         (*i)->visit(*this);
1407                 func.body.visit(*this);
1408         }
1409
1410         BlockVariableMap &block_variables = variables.back();
1411         for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1412                 i->second.conditionally_assigned = true;
1413         for(vector<RefPtr<VariableDeclaration> >::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1414                 block_variables[i->get()].referenced = true;
1415         merge_down_variables();
1416 }
1417
1418 void ProgramCompiler::UnusedVariableLocator::merge_down_variables()
1419 {
1420         BlockVariableMap &parent_variables = variables[variables.size()-2];
1421         BlockVariableMap &block_variables = variables.back();
1422         for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1423         {
1424                 if(i->second.local)
1425                 {
1426                         if(!i->second.referenced)
1427                                 unused_nodes.insert(i->first);
1428                         clear_assignments(i->second, true);
1429                         continue;
1430                 }
1431
1432                 BlockVariableMap::iterator j = parent_variables.find(i->first);
1433                 if(j==parent_variables.end())
1434                         parent_variables.insert(*i);
1435                 else
1436                 {
1437                         if(i->second.referenced || !i->second.conditionally_assigned)
1438                                 clear_assignments(j->second, !i->second.referenced);
1439                         j->second.conditionally_assigned = i->second.conditionally_assigned;
1440                         j->second.referenced |= i->second.referenced;
1441                         j->second.assignments.insert(j->second.assignments.end(), i->second.assignments.begin(), i->second.assignments.end());
1442                 }
1443         }
1444         variables.pop_back();
1445 }
1446
1447 void ProgramCompiler::UnusedVariableLocator::visit(Conditional &cond)
1448 {
1449         cond.condition->visit(*this);
1450         variables.push_back(BlockVariableMap());
1451         cond.body.visit(*this);
1452
1453         BlockVariableMap if_variables;
1454         swap(variables.back(), if_variables);
1455         cond.else_body.visit(*this);
1456
1457         BlockVariableMap &else_variables = variables.back();
1458         for(BlockVariableMap::iterator i=else_variables.begin(); i!=else_variables.end(); ++i)
1459         {
1460                 BlockVariableMap::iterator j = if_variables.find(i->first);
1461                 if(j!=if_variables.end())
1462                 {
1463                         i->second.assignments.insert(i->second.assignments.end(), j->second.assignments.begin(), j->second.assignments.end());
1464                         i->second.conditionally_assigned |= j->second.conditionally_assigned;
1465                         if_variables.erase(j);
1466                 }
1467                 else
1468                         i->second.conditionally_assigned = true;
1469         }
1470
1471         for(BlockVariableMap::iterator i=if_variables.begin(); i!=if_variables.end(); ++i)
1472         {
1473                 i->second.conditionally_assigned = true;
1474                 else_variables.insert(*i);
1475         }
1476
1477         merge_down_variables();
1478 }
1479
1480 void ProgramCompiler::UnusedVariableLocator::visit(Iteration &iter)
1481 {
1482         variables.push_back(BlockVariableMap());
1483         TraversingVisitor::visit(iter);
1484
1485         BlockVariableMap &block_variables = variables.back();
1486         for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
1487                 if(!i->second.local && i->second.referenced)
1488                         i->second.assignments.clear();
1489
1490         merge_down_variables();
1491 }
1492
1493
1494 ProgramCompiler::UnusedVariableLocator::VariableInfo::VariableInfo():
1495         local(false),
1496         conditionally_assigned(false),
1497         referenced(false)
1498 { }
1499
1500
1501 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionCall &call)
1502 {
1503         TraversingVisitor::visit(call);
1504
1505         unused_nodes.erase(call.declaration);
1506         if(call.declaration && call.declaration->definition!=call.declaration)
1507                 used_definitions.insert(call.declaration->definition);
1508 }
1509
1510 void ProgramCompiler::UnusedFunctionLocator::visit(FunctionDeclaration &func)
1511 {
1512         TraversingVisitor::visit(func);
1513
1514         if((func.name!="main" || func.body.body.empty()) && !used_definitions.count(&func))
1515                 unused_nodes.insert(&func);
1516 }
1517
1518
1519 ProgramCompiler::NodeRemover::NodeRemover(const set<Node *> &r):
1520         to_remove(r)
1521 { }
1522
1523 void ProgramCompiler::NodeRemover::visit(Block &block)
1524 {
1525         for(list<RefPtr<Node> >::iterator i=block.body.begin(); i!=block.body.end(); )
1526         {
1527                 (*i)->visit(*this);
1528                 if(to_remove.count(i->get()))
1529                         block.body.erase(i++);
1530                 else
1531                         ++i;
1532         }
1533 }
1534
1535 void ProgramCompiler::NodeRemover::visit(VariableDeclaration &var)
1536 {
1537         if(to_remove.count(&var))
1538         {
1539                 stage->in_variables.erase(var.name);
1540                 stage->out_variables.erase(var.name);
1541                 stage->locations.erase(var.name);
1542                 if(var.linked_declaration)
1543                         var.linked_declaration->linked_declaration = 0;
1544         }
1545         else if(var.init_expression && to_remove.count(var.init_expression.get()))
1546                 var.init_expression = 0;
1547 }
1548
1549
1550 void ProgramCompiler::PrecisionRemover::visit(Precision &)
1551 {
1552         remove_node = true;
1553 }
1554
1555 void ProgramCompiler::PrecisionRemover::visit(VariableDeclaration &var)
1556 {
1557         var.precision.clear();
1558 }
1559
1560
1561 ProgramCompiler::DefaultPrecisionGenerator::DefaultPrecisionGenerator():
1562         toplevel(true)
1563 { }
1564
1565 void ProgramCompiler::DefaultPrecisionGenerator::visit(Block &block)
1566 {
1567         if(toplevel)
1568         {
1569                 SetForScope<bool> set(toplevel, false);
1570                 BlockModifier::visit(block);
1571         }
1572         else
1573                 Visitor::visit(block);
1574 }
1575
1576 void ProgramCompiler::DefaultPrecisionGenerator::visit(Precision &prec)
1577 {
1578         have_default.insert(prec.type);
1579 }
1580
1581 void ProgramCompiler::DefaultPrecisionGenerator::visit(VariableDeclaration &var)
1582 {
1583         if(var.type_declaration)
1584                 return;
1585
1586         string type = var.type;
1587         if(!type.compare(0, 3, "vec") || !type.compare(0, 3, "mat"))
1588                 type = "float";
1589         else if(!type.compare(0, 3, "ivec") || type=="uint")
1590                 type = "int";
1591
1592         if(!have_default.count(type))
1593         {
1594                 Precision *prec = new Precision;
1595                 if(!type.compare(0, 7, "sampler"))
1596                         prec->precision = "lowp";
1597                 else if(stage->type==FRAGMENT)
1598                         prec->precision = "mediump";
1599                 else
1600                         prec->precision = "highp";
1601                 prec->type = type;
1602                 insert_nodes.push_back(prec);
1603
1604                 have_default.insert(type);
1605         }
1606 }
1607
1608
1609 ProgramCompiler::LegacyConverter::LegacyConverter():
1610         target_api(get_gl_api()),
1611         target_version(get_glsl_version()),
1612         frag_out(0)
1613 { }
1614
1615 ProgramCompiler::LegacyConverter::LegacyConverter(const Version &v):
1616         target_api(get_gl_api()),
1617         target_version(v),
1618         frag_out(0)
1619 { }
1620
1621 bool ProgramCompiler::LegacyConverter::check_version(const Version &feature_version) const
1622 {
1623         if(target_version<feature_version)
1624                 return false;
1625         else if(stage->required_version<feature_version)
1626                 stage->required_version = feature_version;
1627
1628         return true;
1629 }
1630
1631 bool ProgramCompiler::LegacyConverter::supports_unified_interface_syntax() const
1632 {
1633         if(target_api==OPENGL_ES2)
1634                 return check_version(Version(3, 0));
1635         else
1636                 return check_version(Version(1, 30));
1637 }
1638
1639 void ProgramCompiler::LegacyConverter::visit(VariableReference &var)
1640 {
1641         if(var.declaration==frag_out && !supports_unified_interface_syntax())
1642         {
1643                 var.name = "gl_FragColor";
1644                 var.declaration = 0;
1645                 type = "vec4";
1646         }
1647         else if(var.declaration)
1648                 type = var.declaration->type;
1649         else
1650                 type = string();
1651 }
1652
1653 void ProgramCompiler::LegacyConverter::visit(Assignment &assign)
1654 {
1655         TraversingVisitor::visit(assign);
1656         if(assign.target_declaration==frag_out && !supports_unified_interface_syntax())
1657                 assign.target_declaration = 0;
1658 }
1659
1660 bool ProgramCompiler::LegacyConverter::supports_unified_sampling_functions() const
1661 {
1662         if(target_api==OPENGL_ES2)
1663                 return check_version(Version(3, 0));
1664         else
1665                 return check_version(Version(1, 30));
1666 }
1667
1668 void ProgramCompiler::LegacyConverter::visit(FunctionCall &call)
1669 {
1670         if(call.name=="texture" && !call.declaration && !supports_unified_sampling_functions())
1671         {
1672                 vector<RefPtr<Expression> >::iterator i = call.arguments.begin();
1673                 if(i!=call.arguments.end())
1674                 {
1675                         (*i)->visit(*this);
1676                         if(type=="sampler1D")
1677                                 call.name = "texture1D";
1678                         else if(type=="sampler2D")
1679                                 call.name = "texture2D";
1680                         else if(type=="sampler3D")
1681                                 call.name = "texture3D";
1682                         else if(type=="sampler1DShadow")
1683                                 call.name = "shadow1D";
1684                         else if(type=="sampler2DShadow")
1685                                 call.name = "shadow2D";
1686
1687                         for(; i!=call.arguments.end(); ++i)
1688                                 (*i)->visit(*this);
1689                 }
1690         }
1691         else
1692                 TraversingVisitor::visit(call);
1693 }
1694
1695 bool ProgramCompiler::LegacyConverter::supports_interface_layouts() const
1696 {
1697         if(target_api==OPENGL_ES2)
1698                 return check_version(Version(3, 0));
1699         else
1700                 return check_version(Version(3, 30));
1701 }
1702
1703 void ProgramCompiler::LegacyConverter::visit(VariableDeclaration &var)
1704 {
1705         if(var.layout && !supports_interface_layouts())
1706         {
1707                 vector<Layout::Qualifier>::iterator i;
1708                 for(i=var.layout->qualifiers.begin(); (i!=var.layout->qualifiers.end() && i->identifier!="location"); ++i) ;
1709                 if(i!=var.layout->qualifiers.end())
1710                 {
1711                         unsigned location = lexical_cast<unsigned>(i->value);
1712                         if(stage->type==VERTEX && var.interface=="in")
1713                         {
1714                                 stage->locations[var.name] = location;
1715                                 var.layout->qualifiers.erase(i);
1716                         }
1717                         else if(stage->type==FRAGMENT && var.interface=="out")
1718                         {
1719                                 if(location!=0)
1720                                         static Require _req(EXT_gpu_shader4);
1721                                 stage->locations[var.name] = location;
1722                                 var.layout->qualifiers.erase(i);
1723                         }
1724
1725                         if(var.layout->qualifiers.empty())
1726                                 var.layout = 0;
1727                 }
1728         }
1729
1730         if((var.interface=="in" || var.interface=="out") && !supports_unified_interface_syntax())
1731         {
1732                 if(stage->type==FRAGMENT && var.interface=="out")
1733                 {
1734                         frag_out = &var;
1735                         remove_node = true;
1736                 }
1737         }
1738
1739         TraversingVisitor::visit(var);
1740 }
1741
1742 bool ProgramCompiler::LegacyConverter::supports_interface_blocks(const string &iface) const
1743 {
1744         if(target_api==OPENGL_ES2)
1745         {
1746                 if(iface=="uniform")
1747                         return check_version(Version(3, 0));
1748                 else
1749                         return check_version(Version(3, 20));
1750         }
1751         else
1752                 return check_version(Version(1, 50));
1753 }
1754
1755 void ProgramCompiler::LegacyConverter::visit(InterfaceBlock &iface)
1756 {
1757         if(!supports_interface_blocks(iface.interface))
1758                 flatten_block(iface.members);
1759 }
1760
1761 } // namespace GL
1762 } // namespace Msp