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():
264 string InterfaceGenerator::get_out_prefix(Stage::Type type)
266 if(type==Stage::VERTEX)
268 else if(type==Stage::GEOMETRY)
274 void InterfaceGenerator::apply(Stage &s)
278 in_prefix = get_out_prefix(stage->previous->type);
279 out_prefix = get_out_prefix(stage->type);
280 s.content.visit(*this);
281 NodeRemover().apply(s, nodes_to_remove);
284 void InterfaceGenerator::visit(Block &block)
286 SetForScope<Block *> set_block(current_block, &block);
287 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
289 assignment_insert_point = i;
290 if(&block==&stage->content)
291 iface_insert_point = i;
297 string InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
299 unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
300 return prefix+name.substr(offset);
303 bool InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
305 if(stage->content.variables.count(name))
308 VariableDeclaration* iface_var = new VariableDeclaration;
309 iface_var->sampling = var.sampling;
310 iface_var->interface = iface;
311 iface_var->type = var.type;
312 iface_var->type_declaration = var.type_declaration;
313 iface_var->name = name;
314 if(stage->type==Stage::GEOMETRY)
315 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
317 iface_var->array = var.array;
319 iface_var->array_size = var.array_size;
322 iface_var->linked_declaration = &var;
323 var.linked_declaration = iface_var;
325 stage->content.body.insert(iface_insert_point, iface_var);
326 stage->content.variables[name] = iface_var;
331 ExpressionStatement &InterfaceGenerator::insert_assignment(const string &left, Expression *right)
333 Assignment *assign = new Assignment;
334 VariableReference *ref = new VariableReference;
338 assign->right = right;
340 ExpressionStatement *stmt = new ExpressionStatement;
341 stmt->expression = assign;
342 current_block->body.insert(assignment_insert_point, stmt);
348 void InterfaceGenerator::visit(VariableReference &var)
350 if(var.declaration || !stage->previous)
352 /* Don't pull a variable from previous stage if we just generated an out
353 interface in this stage */
354 if(stage->content.variables.count(var.name))
357 const map<string, VariableDeclaration *> &prev_vars = stage->previous->content.variables;
358 map<string, VariableDeclaration *>::const_iterator i = prev_vars.find(var.name);
359 if(i==prev_vars.end() || i->second->interface!="out")
360 i = prev_vars.find(in_prefix+var.name);
361 if(i!=prev_vars.end() && i->second->interface=="out")
363 generate_interface(*i->second, "in", i->second->name);
364 var.name = i->second->name;
368 void InterfaceGenerator::visit(VariableDeclaration &var)
370 if(var.interface=="out")
372 if(current_block!=&stage->content && generate_interface(var, "out", change_prefix(var.name, string())))
374 nodes_to_remove.insert(&var);
375 if(var.init_expression)
377 ExpressionStatement &stmt = insert_assignment(var.name, var.init_expression->clone());
378 stmt.source = var.source;
379 stmt.line = var.line;
384 else if(var.interface=="in")
386 if(!var.linked_declaration && stage->previous)
388 const map<string, VariableDeclaration *> &prev_vars = stage->previous->content.variables;
389 map<string, VariableDeclaration *>::const_iterator i = prev_vars.find(var.name);
390 if(i!=prev_vars.end() && i->second->interface=="out")
392 var.linked_declaration = i->second;
393 i->second->linked_declaration = &var;
398 TraversingVisitor::visit(var);
401 void InterfaceGenerator::visit(FunctionDeclaration &func)
403 // Skip parameters because they're not useful here
404 func.body.visit(*this);
407 void InterfaceGenerator::visit(Passthrough &pass)
409 vector<VariableDeclaration *> pass_vars;
411 for(map<string, VariableDeclaration *>::const_iterator i=stage->content.variables.begin(); i!=stage->content.variables.end(); ++i)
412 if(i->second->interface=="in")
413 pass_vars.push_back(i->second);
417 const map<string, VariableDeclaration *> &prev_vars = stage->previous->content.variables;
418 for(map<string, VariableDeclaration *>::const_iterator i=prev_vars.begin(); i!=prev_vars.end(); ++i)
421 for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
422 linked = ((*j)->linked_declaration==i->second);
424 if(!linked && generate_interface(*i->second, "in", i->second->name))
425 pass_vars.push_back(i->second);
429 if(stage->type==Stage::GEOMETRY)
431 VariableReference *ref = new VariableReference;
434 BinaryExpression *subscript = new BinaryExpression;
435 subscript->left = ref;
436 subscript->oper = "[";
437 subscript->right = pass.subscript;
438 subscript->after = "]";
440 MemberAccess *memacc = new MemberAccess;
441 memacc->left = subscript;
442 memacc->member = "gl_Position";
444 insert_assignment("gl_Position", memacc);
447 for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
449 string out_name = change_prefix((*i)->name, out_prefix);
450 generate_interface(**i, "out", out_name);
452 VariableReference *ref = new VariableReference;
453 ref->name = (*i)->name;
456 BinaryExpression *subscript = new BinaryExpression;
457 subscript->left = ref;
458 subscript->oper = "[";
459 subscript->right = pass.subscript;
460 subscript->after = "]";
461 insert_assignment(out_name, subscript);
464 insert_assignment(out_name, ref);
467 nodes_to_remove.insert(&pass);
471 DeclarationReorderer::DeclarationReorderer():
475 void DeclarationReorderer::visit(FunctionCall &call)
477 FunctionDeclaration *def = call.declaration;
479 def = def->definition;
480 if(def && !ordered_funcs.count(def))
481 needed_funcs.insert(def);
484 void DeclarationReorderer::visit(Block &block)
487 return TraversingVisitor::visit(block);
489 NodeList<Statement>::iterator struct_insert_point = block.body.end();
490 NodeList<Statement>::iterator variable_insert_point = block.body.end();
491 NodeList<Statement>::iterator function_insert_point = block.body.end();
492 unsigned unordered_func_count = 0;
493 bool ordered_any_funcs = false;
495 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
497 kind = NO_DECLARATION;
501 if(kind==STRUCT && struct_insert_point!=block.body.end())
503 block.body.insert(struct_insert_point, *i);
506 else if(kind>STRUCT && struct_insert_point==block.body.end())
507 struct_insert_point = i;
509 if(kind==VARIABLE && variable_insert_point!=block.body.end())
511 block.body.insert(variable_insert_point, *i);
514 else if(kind>VARIABLE && variable_insert_point==block.body.end())
515 variable_insert_point = i;
519 if(function_insert_point==block.body.end())
520 function_insert_point = i;
522 if(needed_funcs.empty())
524 ordered_funcs.insert(i->get());
525 if(i!=function_insert_point)
527 block.body.insert(function_insert_point, *i);
531 ++function_insert_point;
532 ordered_any_funcs = true;
535 ++unordered_func_count;
540 if(function_insert_point==i)
541 ++function_insert_point;
542 block.body.erase(i++);
547 if(i==block.body.end() && unordered_func_count)
549 if(!ordered_any_funcs)
550 // A subset of the remaining functions forms a recursive loop
551 /* TODO pick a function and move it up, adding any necessary
555 i = function_insert_point;
556 unordered_func_count = 0;
561 void DeclarationReorderer::visit(VariableDeclaration &var)
563 TraversingVisitor::visit(var);
567 void DeclarationReorderer::visit(FunctionDeclaration &func)
569 needed_funcs.clear();
570 func.body.visit(*this);
571 needed_funcs.erase(&func);