1 #include <msp/core/raii.h>
11 void DeclarationCombiner::apply(Stage &stage)
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)
55 if(j->identifier==i->identifier)
62 ptr->layout->qualifiers.push_back(*i);
66 ptr->layout = var.layout;
68 nodes_to_remove.insert(&var);
75 void BlockResolver::visit(Block &block)
77 block.parent = current_block;
78 TraversingVisitor::visit(block);
81 void BlockResolver::visit(InterfaceBlock &iface)
83 iface.members.anonymous = true;
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);
101 Block *VariableResolver::next_block(Block &block)
103 return block.parent ? block.parent : &block!=builtins ? builtins : 0;
106 void VariableResolver::visit(Block &block)
108 if(current_block!=&block)
109 block.variables.clear();
111 TraversingVisitor::visit(block);
114 void VariableResolver::visit(VariableReference &var)
118 for(Block *block=current_block; block; block=next_block(*block))
120 map<string, VariableDeclaration *>::iterator j = block->variables.find(var.name);
121 if(j!=block->variables.end())
123 var.declaration = j->second;
124 type = j->second->type_declaration;
131 if(assignment_target)
133 record_target = false;
134 assignment_target = 0;
137 assignment_target = var.declaration;
139 else if(var.declaration && var.declaration==assignment_target)
140 self_referencing = true;
143 void VariableResolver::visit(MemberAccess &memacc)
146 TraversingVisitor::visit(memacc);
147 memacc.declaration = 0;
150 map<string, VariableDeclaration *>::iterator i = type->members.variables.find(memacc.member);
151 if(i!=type->members.variables.end())
153 memacc.declaration = i->second;
154 type = i->second->type_declaration;
161 void VariableResolver::visit(BinaryExpression &binary)
166 SetForScope<bool> set(record_target, false);
167 binary.right->visit(*this);
170 binary.left->visit(*this);
174 TraversingVisitor::visit(binary);
179 void VariableResolver::visit(Assignment &assign)
182 SetFlag set(record_target);
183 assignment_target = 0;
184 assign.left->visit(*this);
187 self_referencing = false;
188 assign.right->visit(*this);
190 assign.self_referencing = (self_referencing || assign.oper!="=");
191 assign.target_declaration = assignment_target;
194 void VariableResolver::visit(StructDeclaration &strct)
196 TraversingVisitor::visit(strct);
197 current_block->types[strct.name] = &strct;
200 void VariableResolver::visit(VariableDeclaration &var)
202 for(Block *block=current_block; block; block=next_block(*block))
204 map<string, StructDeclaration *>::iterator j = block->types.find(var.type);
205 if(j!=block->types.end())
206 var.type_declaration = j->second;
209 if(!block_interface.empty() && var.interface.empty())
210 var.interface = block_interface;
212 TraversingVisitor::visit(var);
213 current_block->variables[var.name] = &var;
214 if(current_block->anonymous && current_block->parent)
215 current_block->parent->variables[var.name] = &var;
218 void VariableResolver::visit(InterfaceBlock &iface)
220 SetForScope<string> set_iface(block_interface, iface.interface);
221 TraversingVisitor::visit(iface);
224 void VariableResolver::visit(FunctionDeclaration &func)
226 SetForScope<Block *> set_block(current_block, &func.body);
227 func.body.variables.clear();
228 TraversingVisitor::visit(func);
231 void VariableResolver::visit(Iteration &iter)
233 SetForScope<Block *> set_block(current_block, &iter.body);
234 iter.body.variables.clear();
235 TraversingVisitor::visit(iter);
239 void FunctionResolver::visit(FunctionCall &call)
241 map<string, vector<FunctionDeclaration *> >::iterator i = functions.find(call.name);
242 if(i!=functions.end())
243 call.declaration = i->second.back();
245 TraversingVisitor::visit(call);
248 void FunctionResolver::visit(FunctionDeclaration &func)
250 vector<FunctionDeclaration *> &decls = functions[func.name];
253 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
254 (*i)->definition = func.definition;
256 decls.push_back(&func);
258 else if(!decls.empty() && decls.back()->definition)
259 func.definition = decls.back()->definition;
261 decls.push_back(&func);
263 TraversingVisitor::visit(func);
267 InterfaceGenerator::InterfaceGenerator():
271 string InterfaceGenerator::get_out_prefix(Stage::Type type)
273 if(type==Stage::VERTEX)
275 else if(type==Stage::GEOMETRY)
281 void InterfaceGenerator::apply(Stage &s)
285 in_prefix = get_out_prefix(stage->previous->type);
286 out_prefix = get_out_prefix(stage->type);
288 NodeRemover().apply(s, nodes_to_remove);
291 void InterfaceGenerator::visit(Block &block)
293 SetForScope<Block *> set_block(current_block, &block);
294 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
296 assignment_insert_point = i;
297 if(&block==&stage->content)
298 iface_insert_point = i;
304 string InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
306 unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
307 return prefix+name.substr(offset);
310 bool InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
312 const map<string, VariableDeclaration *> &stage_vars = (iface=="in" ? stage->in_variables : stage->out_variables);
313 if(stage_vars.count(name))
316 VariableDeclaration* iface_var = new VariableDeclaration;
317 iface_var->sampling = var.sampling;
318 iface_var->interface = iface;
319 iface_var->type = var.type;
320 iface_var->type_declaration = var.type_declaration;
321 iface_var->name = name;
322 if(stage->type==Stage::GEOMETRY)
323 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
325 iface_var->array = var.array;
327 iface_var->array_size = var.array_size;
329 iface_var->linked_declaration = &var;
330 stage->content.body.insert(iface_insert_point, iface_var);
332 SetForScope<Block *> set_block(current_block, &stage->content);
333 iface_var->visit(*this);
339 ExpressionStatement &InterfaceGenerator::insert_assignment(const string &left, Expression *right)
341 Assignment *assign = new Assignment;
342 VariableReference *ref = new VariableReference;
346 assign->right = right;
348 ExpressionStatement *stmt = new ExpressionStatement;
349 stmt->expression = assign;
350 current_block->body.insert(assignment_insert_point, stmt);
356 void InterfaceGenerator::visit(VariableReference &var)
358 if(var.declaration || !stage->previous)
361 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
362 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
363 if(i==prev_out.end())
364 i = prev_out.find(in_prefix+var.name);
365 if(i!=prev_out.end())
367 generate_interface(*i->second, "in", i->second->name);
368 var.name = i->second->name;
372 void InterfaceGenerator::visit(VariableDeclaration &var)
374 if(var.interface=="out")
376 if(current_block==&stage->content)
377 stage->out_variables[var.name] = &var;
378 else if(generate_interface(var, "out", change_prefix(var.name, string())))
380 nodes_to_remove.insert(&var);
381 if(var.init_expression)
383 ExpressionStatement &stmt = insert_assignment(var.name, var.init_expression->clone());
384 stmt.source = var.source;
385 stmt.line = var.line;
390 else if(var.interface=="in")
392 stage->in_variables[var.name] = &var;
393 if(var.linked_declaration)
394 var.linked_declaration->linked_declaration = &var;
395 else if(stage->previous)
397 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
398 map<string, VariableDeclaration *>::const_iterator i = prev_out.find(var.name);
399 if(i!=prev_out.end())
401 var.linked_declaration = i->second;
402 i->second->linked_declaration = &var;
407 TraversingVisitor::visit(var);
410 void InterfaceGenerator::visit(Passthrough &pass)
412 vector<VariableDeclaration *> pass_vars;
414 for(map<string, VariableDeclaration *>::const_iterator i=stage->in_variables.begin(); i!=stage->in_variables.end(); ++i)
415 pass_vars.push_back(i->second);
419 const map<string, VariableDeclaration *> &prev_out = stage->previous->out_variables;
420 for(map<string, VariableDeclaration *>::const_iterator i=prev_out.begin(); i!=prev_out.end(); ++i)
423 for(vector<VariableDeclaration *>::const_iterator j=pass_vars.begin(); (!linked && j!=pass_vars.end()); ++j)
424 linked = ((*j)->linked_declaration==i->second);
426 if(!linked && generate_interface(*i->second, "in", i->second->name))
427 pass_vars.push_back(i->second);
431 if(stage->type==Stage::GEOMETRY)
433 VariableReference *ref = new VariableReference;
436 BinaryExpression *subscript = new BinaryExpression;
437 subscript->left = ref;
438 subscript->oper = "[";
439 subscript->right = pass.subscript;
440 subscript->after = "]";
442 MemberAccess *memacc = new MemberAccess;
443 memacc->left = subscript;
444 memacc->member = "gl_Position";
446 insert_assignment("gl_Position", memacc);
449 for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
451 string out_name = change_prefix((*i)->name, out_prefix);
452 generate_interface(**i, "out", out_name);
454 VariableReference *ref = new VariableReference;
455 ref->name = (*i)->name;
458 BinaryExpression *subscript = new BinaryExpression;
459 subscript->left = ref;
460 subscript->oper = "[";
461 subscript->right = pass.subscript;
462 subscript->after = "]";
463 insert_assignment(out_name, subscript);
466 insert_assignment(out_name, ref);
469 nodes_to_remove.insert(&pass);
473 DeclarationReorderer::DeclarationReorderer():
477 void DeclarationReorderer::visit(FunctionCall &call)
479 FunctionDeclaration *def = call.declaration;
481 def = def->definition;
482 if(def && !ordered_funcs.count(def))
483 needed_funcs.insert(def);
486 void DeclarationReorderer::visit(Block &block)
489 return TraversingVisitor::visit(block);
491 NodeList<Statement>::iterator struct_insert_point = block.body.end();
492 NodeList<Statement>::iterator variable_insert_point = block.body.end();
493 NodeList<Statement>::iterator function_insert_point = block.body.end();
494 unsigned unordered_func_count = 0;
495 bool ordered_any_funcs = false;
497 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); )
499 kind = NO_DECLARATION;
503 if(kind==STRUCT && struct_insert_point!=block.body.end())
505 block.body.insert(struct_insert_point, *i);
508 else if(kind>STRUCT && struct_insert_point==block.body.end())
509 struct_insert_point = i;
511 if(kind==VARIABLE && variable_insert_point!=block.body.end())
513 block.body.insert(variable_insert_point, *i);
516 else if(kind>VARIABLE && variable_insert_point==block.body.end())
517 variable_insert_point = i;
521 if(function_insert_point==block.body.end())
522 function_insert_point = i;
524 if(needed_funcs.empty())
526 ordered_funcs.insert(i->get());
527 if(i!=function_insert_point)
529 block.body.insert(function_insert_point, *i);
533 ++function_insert_point;
534 ordered_any_funcs = true;
537 ++unordered_func_count;
542 if(function_insert_point==i)
543 ++function_insert_point;
544 block.body.erase(i++);
549 if(i==block.body.end() && unordered_func_count)
551 if(!ordered_any_funcs)
552 // A subset of the remaining functions forms a recursive loop
553 /* TODO pick a function and move it up, adding any necessary
557 i = function_insert_point;
558 unordered_func_count = 0;
563 void DeclarationReorderer::visit(VariableDeclaration &var)
565 TraversingVisitor::visit(var);
569 void DeclarationReorderer::visit(FunctionDeclaration &func)
571 needed_funcs.clear();
572 func.body.visit(*this);
573 needed_funcs.erase(&func);