source/glsl/visitor.cpp

   1 #include <msp/core/raii.h>
   2 #include "visitor.h"
   3
   4 using namespace std;
   5
   6 namespace Msp {
   7 namespace GL {
   8 namespace SL {
   9
  10 void TraversingVisitor::visit(Block &block)
  11 {
  12         if(&block!=current_block)
  13                 enter(block);
  14         SetForScope<Block *> set_block(current_block, &block);
  15         for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
  16                 (*i)->visit(*this);
  17 }
  18
  19 void TraversingVisitor::visit(ParenthesizedExpression &parexpr)
  20 {
  21         parexpr.expression->visit(*this);
  22 }
  23
  24 void TraversingVisitor::visit(MemberAccess &memacc)
  25 {
  26         memacc.left->visit(*this);
  27 }
  28
  29 void TraversingVisitor::visit(UnaryExpression &unary)
  30 {
  31         unary.expression->visit(*this);
  32 }
  33
  34 void TraversingVisitor::visit(BinaryExpression &binary)
  35 {
  36         binary.left->visit(*this);
  37         binary.right->visit(*this);
  38 }
  39
  40 void TraversingVisitor::visit(Assignment &assign)
  41 {
  42         assign.left->visit(*this);
  43         assign.right->visit(*this);
  44 }
  45
  46 void TraversingVisitor::visit(FunctionCall &call)
  47 {
  48         for(NodeArray<Expression>::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
  49                 (*i)->visit(*this);
  50 }
  51
  52 void TraversingVisitor::visit(ExpressionStatement &expr)
  53 {
  54         expr.expression->visit(*this);
  55 }
  56
  57 void TraversingVisitor::visit(InterfaceLayout &layout)
  58 {
  59         layout.layout.visit(*this);
  60 }
  61
  62 void TraversingVisitor::visit(StructDeclaration &strct)
  63 {
  64         strct.members.visit(*this);
  65 }
  66
  67 void TraversingVisitor::visit(VariableDeclaration &var)
  68 {
  69         if(var.layout)
  70                 var.layout->visit(*this);
  71         if(var.init_expression)
  72                 var.init_expression->visit(*this);
  73         if(var.array_size)
  74                 var.array_size->visit(*this);
  75 }
  76
  77 void TraversingVisitor::visit(InterfaceBlock &iface)
  78 {
  79         iface.members.visit(*this);
  80 }
  81
  82 void TraversingVisitor::visit(FunctionDeclaration &func)
  83 {
  84         enter(func.body);
  85         SetForScope<Block *> set_block(current_block, &func.body);
  86         for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
  87                 (*i)->visit(*this);
  88         func.body.visit(*this);
  89 }
  90
  91 void TraversingVisitor::visit(Conditional &cond)
  92 {
  93         cond.condition->visit(*this);
  94         cond.body.visit(*this);
  95         cond.else_body.visit(*this);
  96 }
  97
  98 void TraversingVisitor::visit(Iteration &iter)
  99 {
 100         enter(iter.body);
 101         SetForScope<Block *> set_block(current_block, &iter.body);
 102         if(iter.init_statement)
 103                 iter.init_statement->visit(*this);
 104         if(iter.condition)
 105                 iter.condition->visit(*this);
 106         iter.body.visit(*this);
 107         if(iter.loop_expression)
 108                 iter.loop_expression->visit(*this);
 109 }
 110
 111 void TraversingVisitor::visit(Passthrough &pass)
 112 {
 113         if(pass.subscript)
 114                 pass.subscript->visit(*this);
 115 }
 116
 117 void TraversingVisitor::visit(Return &ret)
 118 {
 119         if(ret.expression)
 120                 ret.expression->visit(*this);
 121 }
 122
 123
 124 NodeRemover::NodeRemover():
 125         stage(0),
 126         to_remove(0),
 127         recursive_remove(false)
 128 { }
 129
 130 void NodeRemover::apply(Stage &s, const set<Node *> &tr)
 131 {
 132         stage = &s;
 133         to_remove = &tr;
 134         s.content.visit(*this);
 135 }
 136
 137 template<typename T>
 138 void NodeRemover::remove_from_map(map<string, T *> &vars, const string &key, T &node)
 139 {
 140         typename map<string, T *>::iterator i = vars.find(key);
 141         if(i!=vars.end() && i->second==&node)
 142                 vars.erase(i);
 143 }
 144
 145 void NodeRemover::visit(Block &block)
 146 {
 147         SetForScope<Block *> set_block(current_block, &block);
 148         for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
 149         {
 150                 (*i)->visit(*this);
 151                 if(to_remove->count(i->get()))
 152                         block.body.erase(i++);
 153                 else
 154                         ++i;
 155         }
 156 }
 157
 158 void NodeRemover::visit(TypeDeclaration &type)
 159 {
 160         if(to_remove->count(&type))
 161                 remove_from_map(stage->types, type.name, type);
 162 }
 163
 164 void NodeRemover::visit(VariableDeclaration &var)
 165 {
 166         if(recursive_remove || to_remove->count(&var))
 167         {
 168                 remove_from_map(current_block->variables, var.name, var);
 169                 stage->locations.erase(var.name);
 170                 if(var.linked_declaration)
 171                         var.linked_declaration->linked_declaration = 0;
 172         }
 173         else if(var.init_expression && to_remove->count(var.init_expression.get()))
 174                 var.init_expression = 0;
 175 }
 176
 177 void NodeRemover::visit(InterfaceBlock &iface)
 178 {
 179         if(to_remove->count(&iface))
 180         {
 181                 remove_from_map(stage->interface_blocks, iface.interface+iface.name, iface);
 182                 if(!iface.instance_name.empty())
 183                         remove_from_map(stage->interface_blocks, "_"+iface.instance_name, iface);
 184         }
 185         SetFlag set_recursive(recursive_remove, recursive_remove || to_remove->count(&iface));
 186         TraversingVisitor::visit(iface);
 187 }
 188
 189 void NodeRemover::visit(FunctionDeclaration &func)
 190 {
 191         if(to_remove->count(&func))
 192                 remove_from_map(stage->functions, func.name, func);
 193         TraversingVisitor::visit(func);
 194 }
 195
 196 void NodeRemover::visit(Iteration &iter)
 197 {
 198         if(to_remove->count(iter.init_statement.get()))
 199                 iter.init_statement = 0;
 200         TraversingVisitor::visit(iter);
 201 }
 202
 203
 204 NodeReorderer::NodeReorderer():
 205         reorder_before(0),
 206         to_reorder(0)
 207 { }
 208
 209 void NodeReorderer::apply(Stage &stage, Node &before, const set<Node *> &tr)
 210 {
 211         reorder_before = &before;
 212         to_reorder = &tr;
 213         stage.content.visit(*this);
 214 }
 215
 216 void NodeReorderer::visit(Block &block)
 217 {
 218         NodeList<Statement>::iterator insert_point = block.body.end();
 219         for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
 220         {
 221                 (*i)->visit(*this);
 222                 if(insert_point!=block.body.end() && to_reorder->count(i->get()))
 223                 {
 224                         NodeList<Statement>::iterator j = i++;
 225                         block.body.splice(insert_point, block.body, j);
 226                 }
 227                 else
 228                 {
 229                         if(i->get()==reorder_before)
 230                                 insert_point = i;
 231                         ++i;
 232                 }
 233         }
 234 }
 235
 236 } // namespace SL
 237 } // namespace GL
 238 } // namespace Msp