1 #include <msp/core/raii.h>
11 DeclarationCombiner::DeclarationCombiner():
15 void DeclarationCombiner::apply(Stage &stage)
18 NodeRemover().apply(stage, nodes_to_remove);
21 void DeclarationCombiner::visit(Block &block)
26 SetForScope<bool> set(toplevel, false);
27 TraversingVisitor::visit(block);
30 void DeclarationCombiner::visit(FunctionDeclaration &func)
32 vector<FunctionDeclaration *> &decls = functions[func.name];
35 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
37 (*i)->definition = func.definition;
38 (*i)->body.body.clear();
41 decls.push_back(&func);
44 void DeclarationCombiner::visit(VariableDeclaration &var)
46 VariableDeclaration *&ptr = variables[var.name];
50 if(var.init_expression)
51 ptr->init_expression = var.init_expression;
56 for(vector<Layout::Qualifier>::iterator i=var.layout->qualifiers.begin(); i!=var.layout->qualifiers.end(); ++i)
59 for(vector<Layout::Qualifier>::iterator j=ptr->layout->qualifiers.begin(); (!found && j!=ptr->layout->qualifiers.end()); ++j)
60 if(j->identifier==i->identifier)
67 ptr->layout->qualifiers.push_back(*i);
71 ptr->layout = var.layout;
73 nodes_to_remove.insert(&var);
80 VariableResolver::VariableResolver():
84 self_referencing(false)
87 void VariableResolver::apply(Stage &stage)
89 Stage *builtins = get_builtins(stage.type);
91 blocks.push_back(&builtins->content);
97 void VariableResolver::visit(Block &block)
99 if(!blocks.empty() && blocks.back()==&block)
100 return TraversingVisitor::visit(block);
102 blocks.push_back(&block);
103 block.variables.clear();
104 TraversingVisitor::visit(block);
108 void VariableResolver::visit(VariableReference &var)
112 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
115 map<string, VariableDeclaration *>::iterator j = (*i)->variables.find(var.name);
116 if(j!=(*i)->variables.end())
118 var.declaration = j->second;
119 type = j->second->type_declaration;
126 if(assignment_target)
128 record_target = false;
129 assignment_target = 0;
132 assignment_target = var.declaration;
134 else if(var.declaration && var.declaration==assignment_target)
135 self_referencing = true;
138 void VariableResolver::visit(MemberAccess &memacc)
141 TraversingVisitor::visit(memacc);
142 memacc.declaration = 0;
145 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
146 if(i!=type->members.variables.end())
148 memacc.declaration = i->second;
149 type = i->second->type_declaration;
156 void VariableResolver::visit(BinaryExpression &binary)
161 SetForScope<bool> set(record_target, false);
162 binary.right->visit(*this);
165 binary.left->visit(*this);
169 TraversingVisitor::visit(binary);
174 void VariableResolver::visit(Assignment &assign)
177 SetFlag set(record_target);
178 assignment_target = 0;
179 assign.left->visit(*this);
182 self_referencing = false;
183 assign.right->visit(*this);
185 assign.self_referencing = (self_referencing || assign.oper!="=");
186 assign.target_declaration = assignment_target;
189 void VariableResolver::visit(StructDeclaration &strct)
191 TraversingVisitor::visit(strct);
192 blocks.back()->types[strct.name] = &strct;
195 void VariableResolver::visit(VariableDeclaration &var)
197 for(vector<Block *>::iterator i=blocks.end(); i!=blocks.begin(); )
200 map<string, StructDeclaration *>::iterator j = (*i)->types.find(var.type);
201 if(j!=(*i)->types.end())
202 var.type_declaration = j->second;
205 if(!block_interface.empty() && var.interface.empty())
206 var.interface = block_interface;
208 TraversingVisitor::visit(var);
209 blocks.back()->variables[var.name] = &var;
210 if(anonymous && blocks.size()>1)
211 blocks[blocks.size()-2]->variables[var.name] = &var;
214 void VariableResolver::visit(InterfaceBlock &iface)
216 SetFlag set(anonymous);
217 SetForScope<string> set2(block_interface, iface.interface);
218 TraversingVisitor::visit(iface);
221 void VariableResolver::visit(FunctionDeclaration &func)
223 blocks.push_back(&func.body);
224 func.body.variables.clear();
225 TraversingVisitor::visit(func);
229 void VariableResolver::visit(Iteration &iter)
231 blocks.push_back(&iter.body);
232 iter.body.variables.clear();
233 TraversingVisitor::visit(iter);
238 void FunctionResolver::visit(FunctionCall &call)
240 map<string, vector<FunctionDeclaration *> >::iterator i = functions.find(call.name);
241 if(i!=functions.end())
242 call.declaration = i->second.back();
244 TraversingVisitor::visit(call);
247 void FunctionResolver::visit(FunctionDeclaration &func)
249 vector<FunctionDeclaration *> &decls = functions[func.name];
252 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
253 (*i)->definition = func.definition;
255 decls.push_back(&func);
257 else if(!decls.empty() && decls.back()->definition)
258 func.definition = decls.back()->definition;
260 decls.push_back(&func);
262 TraversingVisitor::visit(func);
266 InterfaceGenerator::InterfaceGenerator():
272 string InterfaceGenerator::get_out_prefix(Stage::Type type)
274 if(type==Stage::VERTEX)
276 else if(type==Stage::GEOMETRY)
282 void InterfaceGenerator::apply(Stage &s)
286 in_prefix = get_out_prefix(stage->previous->type);
287 out_prefix = get_out_prefix(stage->type);
289 NodeRemover().apply(s, nodes_to_remove);
292 void InterfaceGenerator::visit(Block &block)
294 SetForScope<unsigned> set(scope_level, scope_level+1);
295 SetForScope<Block *> set_block(current_block, &block);
296 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
298 assignment_insert_point = i;
300 iface_insert_point = i;
306 string InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
308 unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
309 return prefix+name.substr(offset);
312 bool InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
314 const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
315 if(stage_vars.count(name))
318 VariableDeclaration* iface_var = new VariableDeclaration;
319 iface_var->sampling = var.sampling;
320 iface_var->interface = iface;
321 iface_var->type = var.type;
322 iface_var->type_declaration = var.type_declaration;
323 iface_var->name = name;
324 if(stage->type==Stage::GEOMETRY)
325 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
327 iface_var->array = var.array;
329 iface_var->array_size = var.array_size;
331 iface_var->linked_declaration = &var;
332 stage->content.body.insert(iface_insert_point, iface_var);
334 SetForScope<unsigned> set_level(scope_level, 1);
335 SetForScope<Block *> set_block(current_block, &stage->content);
336 iface_var->visit(*this);
342 ExpressionStatement &InterfaceGenerator::insert_assignment(const string &left, Expression *right)
344 Assignment *assign = new Assignment;
345 VariableReference *ref = new VariableReference;
349 assign->right = right;
351 ExpressionStatement *stmt = new ExpressionStatement;
352 stmt->expression = assign;
353 current_block->body.insert(assignment_insert_point, stmt);
359 void InterfaceGenerator::visit(VariableReference &var)
361 if(var.declaration || !stage->previous)
364 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
365 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
366 if(i==prev_out.end())
367 i = prev_out.find(in_prefix+var.name);
368 if(i!=prev_out.end())
370 generate_interface(*i->second, "in", i->second->name);
371 var.name = i->second->name;
375 void InterfaceGenerator::visit(VariableDeclaration &var)
377 if(var.interface=="out")
380 stage->out_variables[var.name] = &var;
381 else if(generate_interface(var, "out", change_prefix(var.name, string())))
383 nodes_to_remove.insert(&var);
384 if(var.init_expression)
386 ExpressionStatement &stmt = insert_assignment(var.name, var.init_expression->clone());
387 stmt.source = var.source;
388 stmt.line = var.line;
393 else if(var.interface=="in")
395 stage->in_variables[var.name] = &var;
396 if(var.linked_declaration)
397 var.linked_declaration->linked_declaration = &var;
398 else if(stage->previous)
400 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
401 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
402 if(i!=prev_out.end())
404 var.linked_declaration = i->second;
405 i->second->linked_declaration = &var;
410 TraversingVisitor::visit(var);
413 void InterfaceGenerator::visit(Passthrough &pass)
415 vector<VariableDeclaration *> pass_vars;
417 for(map<string, VariableDeclaration *>::const_iterator i=stage->in_variables.begin(); i!=stage->in_variables.end(); ++i)
418 pass_vars.push_back(i->second);
422 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
423 for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
426 for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
427 linked = ((*j)->linked_declaration==i->second);
429 if(!linked && generate_interface(*i->second, "in", i->second->name))
430 pass_vars.push_back(i->second);
434 if(stage->type==Stage::GEOMETRY)
436 VariableReference *ref = new VariableReference;
439 BinaryExpression *subscript = new BinaryExpression;
440 subscript->left = ref;
441 subscript->oper = "[";
442 subscript->right = pass.subscript;
443 subscript->after = "]";
445 MemberAccess *memacc = new MemberAccess;
446 memacc->left = subscript;
447 memacc->member = "gl_Position";
449 insert_assignment("gl_Position", memacc);
452 for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
454 string out_name = change_prefix((*i)->name, out_prefix);
455 generate_interface(**i, "out", out_name);
457 VariableReference *ref = new VariableReference;
458 ref->name = (*i)->name;
461 BinaryExpression *subscript = new BinaryExpression;
462 subscript->left = ref;
463 subscript->oper = "[";
464 subscript->right = pass.subscript;
465 subscript->after = "]";
466 insert_assignment(out_name, subscript);
469 insert_assignment(out_name, ref);
472 nodes_to_remove.insert(&pass);
476 DeclarationReorderer::DeclarationReorderer():
481 void DeclarationReorderer::visit(FunctionCall &call)
483 FunctionDeclaration *def = call.declaration;
485 def = def->definition;
486 if(def && !ordered_funcs.count(def))
487 needed_funcs.insert(def);
490 void DeclarationReorderer::visit(Block &block)
492 SetForScope<unsigned> set(scope_level, scope_level+1);
494 return TraversingVisitor::visit(block);
496 NodeList<Statement>::iterator struct_insert_point = block.body.end();
497 NodeList<Statement>::iterator variable_insert_point = block.body.end();
498 NodeList<Statement>::iterator function_insert_point = block.body.end();
499 unsigned unordered_func_count = 0;
500 bool ordered_any_funcs = false;
502 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
504 kind = NO_DECLARATION;
508 if(kind==STRUCT && struct_insert_point!=block.body.end())
510 block.body.insert(struct_insert_point, *i);
513 else if(kind>STRUCT && struct_insert_point==block.body.end())
514 struct_insert_point = i;
516 if(kind==VARIABLE && variable_insert_point!=block.body.end())
518 block.body.insert(variable_insert_point, *i);
521 else if(kind>VARIABLE && variable_insert_point==block.body.end())
522 variable_insert_point = i;
526 if(function_insert_point==block.body.end())
527 function_insert_point = i;
529 if(needed_funcs.empty())
531 ordered_funcs.insert(i->get());
532 if(i!=function_insert_point)
534 block.body.insert(function_insert_point, *i);
538 ++function_insert_point;
539 ordered_any_funcs = true;
542 ++unordered_func_count;
547 if(function_insert_point==i)
548 ++function_insert_point;
549 block.body.erase(i++);
554 if(i==block.body.end() && unordered_func_count)
556 if(!ordered_any_funcs)
557 // A subset of the remaining functions forms a recursive loop
558 /* TODO pick a function and move it up, adding any necessary
562 i = function_insert_point;
563 unordered_func_count = 0;
568 void DeclarationReorderer::visit(VariableDeclaration &var)
570 TraversingVisitor::visit(var);
574 void DeclarationReorderer::visit(FunctionDeclaration &func)
576 needed_funcs.clear();
577 func.body.visit(*this);
578 needed_funcs.erase(&func);