1 #include <msp/core/raii.h>
11 void DeclarationCombiner::apply(Stage &stage)
13 stage.content.visit(*this);
14 NodeRemover().apply(stage, nodes_to_remove);
17 void DeclarationCombiner::visit(Block &block)
22 TraversingVisitor::visit(block);
25 void DeclarationCombiner::visit(FunctionDeclaration &func)
27 vector<FunctionDeclaration *> &decls = functions[func.name];
30 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
32 (*i)->definition = func.definition;
33 (*i)->body.body.clear();
36 decls.push_back(&func);
39 void DeclarationCombiner::visit(VariableDeclaration &var)
41 VariableDeclaration *&ptr = variables[var.name];
45 if(var.init_expression)
46 ptr->init_expression = var.init_expression;
51 for(vector<Layout::Qualifier>::iterator i=var.layout->qualifiers.begin(); i!=var.layout->qualifiers.end(); ++i)
54 for(vector<Layout::Qualifier>::iterator j=ptr->layout->qualifiers.begin(); (!found && j!=ptr->layout->qualifiers.end()); ++j)
57 j->has_value = i->value;
63 ptr->layout->qualifiers.push_back(*i);
67 ptr->layout = var.layout;
69 nodes_to_remove.insert(&var);
76 void BlockResolver::enter(Block &block)
78 block.parent = current_block;
81 void BlockResolver::visit(InterfaceBlock &iface)
83 current_block->interfaces.insert(&iface);
84 TraversingVisitor::visit(iface);
88 VariableResolver::VariableResolver():
91 self_referencing(false)
94 void VariableResolver::apply(Stage &stage)
96 Stage *builtin_stage = get_builtins(stage.type);
97 builtins = (builtin_stage ? &builtin_stage->content : 0);
98 stage.content.visit(*this);
101 Block *VariableResolver::next_block(Block &block)
103 return block.parent ? block.parent : &block!=builtins ? builtins : 0;
106 void VariableResolver::enter(Block &block)
108 block.variables.clear();
111 void VariableResolver::visit(VariableReference &var)
115 for(Block *block=current_block; block; block=next_block(*block))
117 map<string, VariableDeclaration *>::iterator i = block->variables.find(var.name);
118 if(i!=block->variables.end())
119 var.declaration = i->second;
122 const set<InterfaceBlock *> &ifaces = block->interfaces;
123 for(set<InterfaceBlock *>::const_iterator j=ifaces.begin(); (!var.declaration && j!=ifaces.end()); ++j)
125 i = (*j)->members.variables.find(var.name);
126 if(i!=(*j)->members.variables.end())
127 var.declaration = i->second;
133 type = var.declaration->type_declaration;
140 if(assignment_target)
142 record_target = false;
143 assignment_target = 0;
146 assignment_target = var.declaration;
148 else if(var.declaration && var.declaration==assignment_target)
149 self_referencing = true;
152 void VariableResolver::visit(MemberAccess &memacc)
155 TraversingVisitor::visit(memacc);
156 memacc.declaration = 0;
159 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
160 if(i!=type->members.variables.end())
162 memacc.declaration = i->second;
163 type = i->second->type_declaration;
170 void VariableResolver::visit(BinaryExpression &binary)
175 SetForScope<bool> set(record_target, false);
176 binary.right->visit(*this);
179 binary.left->visit(*this);
183 TraversingVisitor::visit(binary);
188 void VariableResolver::visit(Assignment &assign)
191 SetFlag set(record_target);
192 assignment_target = 0;
193 assign.left->visit(*this);
196 self_referencing = false;
197 assign.right->visit(*this);
199 assign.self_referencing = (self_referencing || assign.oper!="=");
200 assign.target_declaration = assignment_target;
203 void VariableResolver::visit(StructDeclaration &strct)
205 TraversingVisitor::visit(strct);
206 current_block->types[strct.name] = &strct;
209 void VariableResolver::visit(VariableDeclaration &var)
211 for(Block *block=current_block; block; block=next_block(*block))
213 map<string, StructDeclaration *>::iterator j = block->types.find(var.type);
214 if(j!=block->types.end())
215 var.type_declaration = j->second;
218 if(!block_interface.empty() && var.interface.empty())
219 var.interface = block_interface;
221 TraversingVisitor::visit(var);
222 current_block->variables[var.name] = &var;
225 void VariableResolver::visit(InterfaceBlock &iface)
227 SetForScope<string> set_iface(block_interface, iface.interface);
228 TraversingVisitor::visit(iface);
232 void FunctionResolver::visit(FunctionCall &call)
234 map<string, vector<FunctionDeclaration *> >::iterator i = functions.find(call.name);
235 if(i!=functions.end())
236 call.declaration = i->second.back();
238 TraversingVisitor::visit(call);
241 void FunctionResolver::visit(FunctionDeclaration &func)
243 vector<FunctionDeclaration *> &decls = functions[func.name];
246 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
247 (*i)->definition = func.definition;
249 decls.push_back(&func);
251 else if(!decls.empty() && decls.back()->definition)
252 func.definition = decls.back()->definition;
254 decls.push_back(&func);
256 TraversingVisitor::visit(func);
260 InterfaceGenerator::InterfaceGenerator():
262 function_scope(false)
265 string InterfaceGenerator::get_out_prefix(Stage::Type type)
267 if(type==Stage::VERTEX)
269 else if(type==Stage::GEOMETRY)
275 void InterfaceGenerator::apply(Stage &s)
279 in_prefix = get_out_prefix(stage->previous->type);
280 out_prefix = get_out_prefix(stage->type);
281 s.content.visit(*this);
282 NodeRemover().apply(s, nodes_to_remove);
285 void InterfaceGenerator::visit(Block &block)
287 SetForScope<Block *> set_block(current_block, &block);
288 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
290 assignment_insert_point = i;
291 if(&block==&stage->content)
292 iface_insert_point = i;
298 string InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
300 unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
301 return prefix+name.substr(offset);
304 bool InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
306 if(stage->content.variables.count(name))
309 VariableDeclaration* iface_var = new VariableDeclaration;
310 iface_var->sampling = var.sampling;
311 iface_var->interface = iface;
312 iface_var->type = var.type;
313 iface_var->type_declaration = var.type_declaration;
314 iface_var->name = name;
315 if(stage->type==Stage::GEOMETRY)
316 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
318 iface_var->array = var.array;
320 iface_var->array_size = var.array_size;
323 iface_var->linked_declaration = &var;
324 var.linked_declaration = iface_var;
326 stage->content.body.insert(iface_insert_point, iface_var);
327 stage->content.variables[name] = iface_var;
332 ExpressionStatement &InterfaceGenerator::insert_assignment(const string &left, Expression *right)
334 Assignment *assign = new Assignment;
335 VariableReference *ref = new VariableReference;
339 assign->right = right;
341 ExpressionStatement *stmt = new ExpressionStatement;
342 stmt->expression = assign;
343 current_block->body.insert(assignment_insert_point, stmt);
349 void InterfaceGenerator::visit(VariableReference &var)
351 if(var.declaration || !stage->previous)
353 /* Don't pull a variable from previous stage if we just generated an out
354 interface in this stage */
355 if(stage->content.variables.count(var.name))
358 const map<string, VariableDeclaration *> &prev_vars = stage->previous->content.variables;
359 map<string, VariableDeclaration *>::const_iterator i = prev_vars.find(var.name);
360 if(i==prev_vars.end() || i->second->interface!="out")
361 i = prev_vars.find(in_prefix+var.name);
362 if(i!=prev_vars.end() && i->second->interface=="out")
364 generate_interface(*i->second, "in", i->second->name);
365 var.name = i->second->name;
369 void InterfaceGenerator::visit(VariableDeclaration &var)
371 if(var.interface=="out")
373 /* For out variables in function scope, generate a global interface and
374 replace the local declaration with an assignment. */
375 if(function_scope && generate_interface(var, "out", var.name))
377 nodes_to_remove.insert(&var);
378 if(var.init_expression)
380 ExpressionStatement &stmt = insert_assignment(var.name, var.init_expression->clone());
381 stmt.source = var.source;
382 stmt.line = var.line;
387 else if(var.interface=="in")
389 /* Try to link in variables in global scope with out variables from
391 if(current_block==&stage->content && !var.linked_declaration && stage->previous)
393 const map<string, VariableDeclaration *> &prev_vars = stage->previous->content.variables;
394 map<string, VariableDeclaration *>::const_iterator i = prev_vars.find(var.name);
395 if(i!=prev_vars.end() && i->second->interface=="out")
397 var.linked_declaration = i->second;
398 i->second->linked_declaration = &var;
403 TraversingVisitor::visit(var);
406 void InterfaceGenerator::visit(FunctionDeclaration &func)
408 SetFlag set_scope(function_scope, true);
409 // Skip parameters because they're not useful here
410 func.body.visit(*this);
413 void InterfaceGenerator::visit(Passthrough &pass)
415 vector<VariableDeclaration *> pass_vars;
417 for(map<string, VariableDeclaration *>::const_iterator i=stage->content.variables.begin(); i!=stage->content.variables.end(); ++i)
418 if(i->second->interface=="in")
419 pass_vars.push_back(i->second);
423 const map<string, VariableDeclaration *> &prev_vars = stage->previous->content.variables;
424 for(map<string, VariableDeclaration *>::const_iterator i=prev_vars.begin(); i!=prev_vars.end(); ++i)
427 for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
428 linked = ((*j)->linked_declaration==i->second);
430 if(!linked && generate_interface(*i->second, "in", i->second->name))
431 pass_vars.push_back(i->second);
435 if(stage->type==Stage::GEOMETRY)
437 VariableReference *ref = new VariableReference;
440 BinaryExpression *subscript = new BinaryExpression;
441 subscript->left = ref;
442 subscript->oper = "[";
443 subscript->right = pass.subscript;
444 subscript->after = "]";
446 MemberAccess *memacc = new MemberAccess;
447 memacc->left = subscript;
448 memacc->member = "gl_Position";
450 insert_assignment("gl_Position", memacc);
453 for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
455 string out_name = change_prefix((*i)->name, out_prefix);
456 generate_interface(**i, "out", out_name);
458 VariableReference *ref = new VariableReference;
459 ref->name = (*i)->name;
462 BinaryExpression *subscript = new BinaryExpression;
463 subscript->left = ref;
464 subscript->oper = "[";
465 subscript->right = pass.subscript;
466 subscript->after = "]";
467 insert_assignment(out_name, subscript);
470 insert_assignment(out_name, ref);
473 nodes_to_remove.insert(&pass);
477 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)
493 return TraversingVisitor::visit(block);
495 NodeList<Statement>::iterator struct_insert_point = block.body.end();
496 NodeList<Statement>::iterator variable_insert_point = block.body.end();
497 NodeList<Statement>::iterator function_insert_point = block.body.end();
498 unsigned unordered_func_count = 0;
499 bool ordered_any_funcs = false;
501 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
503 kind = NO_DECLARATION;
507 if(kind==STRUCT && struct_insert_point!=block.body.end())
509 block.body.insert(struct_insert_point, *i);
512 else if(kind>STRUCT && struct_insert_point==block.body.end())
513 struct_insert_point = i;
515 if(kind==VARIABLE && variable_insert_point!=block.body.end())
517 block.body.insert(variable_insert_point, *i);
520 else if(kind>VARIABLE && variable_insert_point==block.body.end())
521 variable_insert_point = i;
525 if(function_insert_point==block.body.end())
526 function_insert_point = i;
528 if(needed_funcs.empty())
530 ordered_funcs.insert(i->get());
531 if(i!=function_insert_point)
533 block.body.insert(function_insert_point, *i);
537 ++function_insert_point;
538 ordered_any_funcs = true;
541 ++unordered_func_count;
546 if(function_insert_point==i)
547 ++function_insert_point;
548 block.body.erase(i++);
553 if(i==block.body.end() && unordered_func_count)
555 if(!ordered_any_funcs)
556 // A subset of the remaining functions forms a recursive loop
557 /* TODO pick a function and move it up, adding any necessary
561 i = function_insert_point;
562 unordered_func_count = 0;
567 void DeclarationReorderer::visit(VariableDeclaration &var)
569 TraversingVisitor::visit(var);
573 void DeclarationReorderer::visit(FunctionDeclaration &func)
575 needed_funcs.clear();
576 func.body.visit(*this);
577 needed_funcs.erase(&func);