1 #include <msp/core/raii.h>
10 InlineableFunctionLocator::InlineableFunctionLocator():
14 void InlineableFunctionLocator::visit(FunctionCall &call)
16 FunctionDeclaration *def = call.declaration;
18 def = def->definition;
22 unsigned &count = refcounts[def];
24 if(count>1 || def==in_function)
25 inlineable.erase(def);
28 TraversingVisitor::visit(call);
31 void InlineableFunctionLocator::visit(FunctionDeclaration &func)
33 unsigned &count = refcounts[func.definition];
34 if(!count && func.parameters.empty())
35 inlineable.insert(func.definition);
37 SetForScope<FunctionDeclaration *> set(in_function, &func);
38 TraversingVisitor::visit(func);
42 FunctionInliner::FunctionInliner():
46 void FunctionInliner::apply(Stage &stage)
48 inlineable = InlineableFunctionLocator().apply(stage);
49 stage.content.visit(*this);
52 void FunctionInliner::visit_and_inline(RefPtr<Expression> &ptr)
60 void FunctionInliner::visit(Block &block)
65 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
73 void FunctionInliner::visit(UnaryExpression &unary)
75 visit_and_inline(unary.expression);
79 void FunctionInliner::visit(BinaryExpression &binary)
81 visit_and_inline(binary.left);
82 visit_and_inline(binary.right);
86 void FunctionInliner::visit(MemberAccess &memacc)
88 visit_and_inline(memacc.left);
92 void FunctionInliner::visit(FunctionCall &call)
94 for(NodeArray<Expression>::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
97 FunctionDeclaration *def = call.declaration;
99 def = def->definition;
101 if(def && inlineable.count(def))
110 void FunctionInliner::visit(VariableDeclaration &var)
112 if(var.init_expression)
113 visit_and_inline(var.init_expression);
117 void FunctionInliner::visit(Return &ret)
119 TraversingVisitor::visit(ret);
122 inline_result = ret.expression->clone();
126 ConstantConditionEliminator::ConstantConditionEliminator():
130 void ConstantConditionEliminator::apply(Stage &stage)
132 stage.content.visit(*this);
133 NodeRemover().apply(stage, nodes_to_remove);
136 void ConstantConditionEliminator::visit(Block &block)
138 SetForScope<Block *> set_block(current_block, &block);
139 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
145 for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
146 variable_values.erase(i->second);
149 void ConstantConditionEliminator::visit(UnaryExpression &unary)
151 if(VariableReference *var = dynamic_cast<VariableReference *>(unary.expression.get()))
152 if(unary.oper=="++" || unary.oper=="--")
153 variable_values.erase(var->declaration);
156 void ConstantConditionEliminator::visit(Assignment &assign)
158 variable_values.erase(assign.target_declaration);
161 void ConstantConditionEliminator::visit(VariableDeclaration &var)
163 bool constant = var.constant;
164 if(constant && var.layout)
166 for(vector<Layout::Qualifier>::const_iterator i=var.layout->qualifiers.begin(); (constant && i!=var.layout->qualifiers.end()); ++i)
167 constant = (i->name!="constant_id");
169 if((constant || current_block->parent) && var.init_expression)
170 variable_values[&var] = var.init_expression.get();
173 void ConstantConditionEliminator::visit(Conditional &cond)
177 ExpressionEvaluator eval(variable_values);
178 cond.condition->visit(eval);
179 if(eval.is_result_valid())
181 Block &block = (eval.get_result() ? cond.body : cond.else_body);
182 current_block->body.splice(insert_point, block.body);
183 nodes_to_remove.insert(&cond);
188 TraversingVisitor::visit(cond);
191 void ConstantConditionEliminator::visit(Iteration &iter)
197 /* If the loop condition is always false on the first iteration, the
198 entire loop can be removed */
199 if(iter.init_statement)
200 iter.init_statement->visit(*this);
201 ExpressionEvaluator eval(variable_values);
202 iter.condition->visit(eval);
203 if(eval.is_result_valid() && !eval.get_result())
205 nodes_to_remove.insert(&iter);
210 /* Record all assignments that occur inside the loop body so those
211 variables won't be considered as constant */
212 SetFlag set_record(record_only);
213 TraversingVisitor::visit(iter);
216 TraversingVisitor::visit(iter);
218 if(VariableDeclaration *init_decl = dynamic_cast<VariableDeclaration *>(iter.init_statement.get()))
219 variable_values.erase(init_decl);
223 UnusedVariableRemover::VariableInfo::VariableInfo():
225 conditionally_assigned(false),
230 UnusedVariableRemover::UnusedVariableRemover():
233 assignment_target(false),
234 assign_to_subscript(false)
237 bool UnusedVariableRemover::apply(Stage &stage)
239 variables.push_back(BlockVariableMap());
240 stage.content.visit(*this);
241 BlockVariableMap &global_variables = variables.back();
242 for(BlockVariableMap::iterator i=global_variables.begin(); i!=global_variables.end(); ++i)
244 if(i->first->interface=="out" && (stage.type==Stage::FRAGMENT || i->first->linked_declaration || !i->first->name.compare(0, 3, "gl_")))
246 if(!i->second.referenced)
248 unused_nodes.insert(i->first);
249 clear_assignments(i->second, true);
252 variables.pop_back();
254 NodeRemover().apply(stage, unused_nodes);
256 return !unused_nodes.empty();
259 void UnusedVariableRemover::visit(VariableReference &var)
261 map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
262 if(i!=aggregates.end())
263 unused_nodes.erase(i->second);
265 if(var.declaration && !assignment_target)
267 VariableInfo &var_info = variables.back()[var.declaration];
268 clear_assignments(var_info, false);
269 var_info.referenced = true;
273 void UnusedVariableRemover::visit(InterfaceBlockReference &iface)
275 unused_nodes.erase(iface.declaration);
278 void UnusedVariableRemover::visit(MemberAccess &memacc)
280 TraversingVisitor::visit(memacc);
281 unused_nodes.erase(memacc.declaration);
284 void UnusedVariableRemover::visit(BinaryExpression &binary)
288 if(assignment_target)
289 assign_to_subscript = true;
290 binary.left->visit(*this);
291 SetForScope<bool> set(assignment_target, false);
292 binary.right->visit(*this);
295 TraversingVisitor::visit(binary);
298 void UnusedVariableRemover::visit(Assignment &assign)
301 assign_to_subscript = false;
302 SetForScope<bool> set(assignment_target, !assign.self_referencing);
303 assign.left->visit(*this);
305 assign.right->visit(*this);
306 assignment = &assign;
309 void UnusedVariableRemover::record_assignment(VariableDeclaration &var, Node &node, bool chained)
311 VariableInfo &var_info = variables.back()[&var];
313 clear_assignments(var_info, true);
314 var_info.assignments.push_back(&node);
315 var_info.conditionally_assigned = false;
318 void UnusedVariableRemover::clear_assignments(VariableInfo &var_info, bool mark_unused)
322 for(vector<Node *>::iterator i=var_info.assignments.begin(); i!=var_info.assignments.end(); ++i)
323 unused_nodes.insert(*i);
325 var_info.assignments.clear();
328 void UnusedVariableRemover::visit(ExpressionStatement &expr)
331 TraversingVisitor::visit(expr);
332 if(assignment && assignment->target_declaration)
333 record_assignment(*assignment->target_declaration, expr, (assignment->self_referencing || assign_to_subscript));
336 void UnusedVariableRemover::visit(StructDeclaration &strct)
338 SetForScope<Node *> set(aggregate, &strct);
339 unused_nodes.insert(&strct);
340 TraversingVisitor::visit(strct);
343 void UnusedVariableRemover::visit(VariableDeclaration &var)
346 aggregates[&var] = aggregate;
349 variables.back()[&var].local = true;
350 if(var.init_expression)
351 record_assignment(var, *var.init_expression, false);
353 unused_nodes.erase(var.type_declaration);
354 TraversingVisitor::visit(var);
357 void UnusedVariableRemover::visit(InterfaceBlock &iface)
359 SetForScope<Node *> set(aggregate, &iface);
360 unused_nodes.insert(&iface);
361 TraversingVisitor::visit(iface);
364 void UnusedVariableRemover::visit(FunctionDeclaration &func)
366 variables.push_back(BlockVariableMap());
368 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
370 func.body.visit(*this);
372 BlockVariableMap &block_variables = variables.back();
373 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
374 i->second.conditionally_assigned = true;
375 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
376 block_variables[i->get()].referenced = true;
377 merge_down_variables();
380 void UnusedVariableRemover::merge_down_variables()
382 BlockVariableMap &parent_variables = variables[variables.size()-2];
383 BlockVariableMap &block_variables = variables.back();
384 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
388 if(!i->second.referenced)
389 unused_nodes.insert(i->first);
390 clear_assignments(i->second, i->first->interface!="out");
394 BlockVariableMap::iterator j = parent_variables.find(i->first);
395 if(j==parent_variables.end())
396 parent_variables.insert(*i);
399 if(i->second.referenced || !i->second.conditionally_assigned)
400 clear_assignments(j->second, !i->second.referenced);
401 j->second.conditionally_assigned = i->second.conditionally_assigned;
402 j->second.referenced |= i->second.referenced;
403 j->second.assignments.insert(j->second.assignments.end(), i->second.assignments.begin(), i->second.assignments.end());
406 variables.pop_back();
409 void UnusedVariableRemover::visit(Conditional &cond)
411 cond.condition->visit(*this);
412 variables.push_back(BlockVariableMap());
413 cond.body.visit(*this);
415 BlockVariableMap if_variables;
416 swap(variables.back(), if_variables);
417 cond.else_body.visit(*this);
419 BlockVariableMap &else_variables = variables.back();
420 for(BlockVariableMap::iterator i=else_variables.begin(); i!=else_variables.end(); ++i)
422 BlockVariableMap::iterator j = if_variables.find(i->first);
423 if(j!=if_variables.end())
425 i->second.assignments.insert(i->second.assignments.end(), j->second.assignments.begin(), j->second.assignments.end());
426 i->second.conditionally_assigned |= j->second.conditionally_assigned;
427 if_variables.erase(j);
430 i->second.conditionally_assigned = true;
433 for(BlockVariableMap::iterator i=if_variables.begin(); i!=if_variables.end(); ++i)
435 i->second.conditionally_assigned = true;
436 else_variables.insert(*i);
439 merge_down_variables();
442 void UnusedVariableRemover::visit(Iteration &iter)
444 variables.push_back(BlockVariableMap());
445 TraversingVisitor::visit(iter);
447 BlockVariableMap &block_variables = variables.back();
448 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
449 if(!i->second.local && i->second.referenced)
450 clear_assignments(i->second, false);
452 merge_down_variables();
456 bool UnusedFunctionRemover::apply(Stage &stage)
458 stage.content.visit(*this);
459 NodeRemover().apply(stage, unused_nodes);
460 return !unused_nodes.empty();
463 void UnusedFunctionRemover::visit(FunctionCall &call)
465 TraversingVisitor::visit(call);
467 unused_nodes.erase(call.declaration);
468 if(call.declaration && call.declaration->definition!=call.declaration)
469 used_definitions.insert(call.declaration->definition);
472 void UnusedFunctionRemover::visit(FunctionDeclaration &func)
474 TraversingVisitor::visit(func);
476 if((func.name!="main" || func.body.body.empty()) && !used_definitions.count(&func))
477 unused_nodes.insert(&func);