1 #include <msp/core/raii.h>
10 InlineableFunctionLocator::InlineableFunctionLocator():
14 void InlineableFunctionLocator::visit(FunctionCall &call)
16 FunctionDeclaration *def = call.declaration;
17 if(def && def->definition!=def)
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);
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;
98 if(def && def->definition!=def)
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():
132 void ConstantConditionEliminator::apply(Stage &stage)
134 visit(stage.content);
135 NodeRemover().apply(stage, nodes_to_remove);
138 void ConstantConditionEliminator::visit(Block &block)
140 SetForScope<unsigned> set(scope_level, scope_level+1);
141 SetForScope<Block *> set_block(current_block, &block);
142 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
148 for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
149 variable_values.erase(i->second);
152 void ConstantConditionEliminator::visit(UnaryExpression &unary)
154 if(VariableReference *var = dynamic_cast<VariableReference *>(unary.expression.get()))
155 if(unary.oper=="++" || unary.oper=="--")
156 variable_values.erase(var->declaration);
159 void ConstantConditionEliminator::visit(Assignment &assign)
161 variable_values.erase(assign.target_declaration);
164 void ConstantConditionEliminator::visit(VariableDeclaration &var)
166 if(var.constant || scope_level>1)
167 variable_values[&var] = var.init_expression.get();
170 void ConstantConditionEliminator::visit(Conditional &cond)
174 ExpressionEvaluator eval(variable_values);
175 cond.condition->visit(eval);
176 if(eval.is_result_valid())
178 Block &block = (eval.get_result() ? cond.body : cond.else_body);
179 current_block->body.splice(insert_point, block.body);
180 nodes_to_remove.insert(&cond);
185 TraversingVisitor::visit(cond);
188 void ConstantConditionEliminator::visit(Iteration &iter)
194 /* If the loop condition is always false on the first iteration, the
195 entire loop can be removed */
196 if(iter.init_statement)
197 iter.init_statement->visit(*this);
198 ExpressionEvaluator eval(variable_values);
199 iter.condition->visit(eval);
200 if(eval.is_result_valid() && !eval.get_result())
202 nodes_to_remove.insert(&iter);
207 /* Record all assignments that occur inside the loop body so those
208 variables won't be considered as constant */
209 SetFlag set_record(record_only);
210 TraversingVisitor::visit(iter);
213 TraversingVisitor::visit(iter);
215 if(VariableDeclaration *init_decl = dynamic_cast<VariableDeclaration *>(iter.init_statement.get()))
216 variable_values.erase(init_decl);
220 UnusedVariableRemover::VariableInfo::VariableInfo():
222 conditionally_assigned(false),
227 UnusedVariableRemover::UnusedVariableRemover():
230 assignment_target(false),
231 assign_to_subscript(false),
235 bool UnusedVariableRemover::apply(Stage &stage)
237 variables.push_back(BlockVariableMap());
238 visit(stage.content);
239 BlockVariableMap &global_variables = variables.back();
240 for(BlockVariableMap::iterator i=global_variables.begin(); i!=global_variables.end(); ++i)
242 if(i->first->interface=="out" && (stage.type==Stage::FRAGMENT || i->first->linked_declaration || !i->first->name.compare(0, 3, "gl_")))
244 if(!i->second.referenced)
246 unused_nodes.insert(i->first);
247 clear_assignments(i->second, true);
250 variables.pop_back();
252 NodeRemover().apply(stage, unused_nodes);
254 return !unused_nodes.empty();
257 void UnusedVariableRemover::visit(VariableReference &var)
259 map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
260 if(i!=aggregates.end())
261 unused_nodes.erase(i->second);
263 if(var.declaration && !assignment_target)
265 VariableInfo &var_info = variables.back()[var.declaration];
266 var_info.assignments.clear();
267 var_info.referenced = true;
271 void UnusedVariableRemover::visit(MemberAccess &memacc)
273 TraversingVisitor::visit(memacc);
274 unused_nodes.erase(memacc.declaration);
277 void UnusedVariableRemover::visit(BinaryExpression &binary)
281 if(assignment_target)
282 assign_to_subscript = true;
283 binary.left->visit(*this);
284 SetForScope<bool> set(assignment_target, false);
285 binary.right->visit(*this);
288 TraversingVisitor::visit(binary);
291 void UnusedVariableRemover::visit(Assignment &assign)
294 assign_to_subscript = false;
295 SetForScope<bool> set(assignment_target, !assign.self_referencing);
296 assign.left->visit(*this);
298 assign.right->visit(*this);
299 assignment = &assign;
302 void UnusedVariableRemover::record_assignment(VariableDeclaration &var, Node &node, bool chained)
304 VariableInfo &var_info = variables.back()[&var];
306 clear_assignments(var_info, true);
307 var_info.assignments.push_back(&node);
308 var_info.conditionally_assigned = false;
311 void UnusedVariableRemover::clear_assignments(VariableInfo &var_info, bool mark_unused)
315 for(vector<Node *>::iterator i=var_info.assignments.begin(); i!=var_info.assignments.end(); ++i)
316 unused_nodes.insert(*i);
318 var_info.assignments.clear();
321 void UnusedVariableRemover::visit(ExpressionStatement &expr)
324 TraversingVisitor::visit(expr);
325 if(assignment && assignment->target_declaration)
326 record_assignment(*assignment->target_declaration, expr, (assignment->self_referencing || assign_to_subscript));
329 void UnusedVariableRemover::visit(StructDeclaration &strct)
331 SetForScope<Node *> set(aggregate, &strct);
332 unused_nodes.insert(&strct);
333 TraversingVisitor::visit(strct);
336 void UnusedVariableRemover::visit(VariableDeclaration &var)
339 aggregates[&var] = aggregate;
342 variables.back()[&var].local = true;
343 if(var.init_expression)
344 record_assignment(var, *var.init_expression, false);
346 unused_nodes.erase(var.type_declaration);
347 TraversingVisitor::visit(var);
350 void UnusedVariableRemover::visit(InterfaceBlock &iface)
352 SetForScope<Node *> set(aggregate, &iface);
353 unused_nodes.insert(&iface);
354 TraversingVisitor::visit(iface);
357 void UnusedVariableRemover::visit(FunctionDeclaration &func)
359 variables.push_back(BlockVariableMap());
362 SetForScope<bool> set(global_scope, false);
363 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
365 func.body.visit(*this);
368 BlockVariableMap &block_variables = variables.back();
369 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
370 i->second.conditionally_assigned = true;
371 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
372 block_variables[i->get()].referenced = true;
373 merge_down_variables();
376 void UnusedVariableRemover::merge_down_variables()
378 BlockVariableMap &parent_variables = variables[variables.size()-2];
379 BlockVariableMap &block_variables = variables.back();
380 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
384 if(!i->second.referenced)
385 unused_nodes.insert(i->first);
386 clear_assignments(i->second, i->first->interface!="out");
390 BlockVariableMap::iterator j = parent_variables.find(i->first);
391 if(j==parent_variables.end())
392 parent_variables.insert(*i);
395 if(i->second.referenced || !i->second.conditionally_assigned)
396 clear_assignments(j->second, !i->second.referenced);
397 j->second.conditionally_assigned = i->second.conditionally_assigned;
398 j->second.referenced |= i->second.referenced;
399 j->second.assignments.insert(j->second.assignments.end(), i->second.assignments.begin(), i->second.assignments.end());
402 variables.pop_back();
405 void UnusedVariableRemover::visit(Conditional &cond)
407 cond.condition->visit(*this);
408 variables.push_back(BlockVariableMap());
409 cond.body.visit(*this);
411 BlockVariableMap if_variables;
412 swap(variables.back(), if_variables);
413 cond.else_body.visit(*this);
415 BlockVariableMap &else_variables = variables.back();
416 for(BlockVariableMap::iterator i=else_variables.begin(); i!=else_variables.end(); ++i)
418 BlockVariableMap::iterator j = if_variables.find(i->first);
419 if(j!=if_variables.end())
421 i->second.assignments.insert(i->second.assignments.end(), j->second.assignments.begin(), j->second.assignments.end());
422 i->second.conditionally_assigned |= j->second.conditionally_assigned;
423 if_variables.erase(j);
426 i->second.conditionally_assigned = true;
429 for(BlockVariableMap::iterator i=if_variables.begin(); i!=if_variables.end(); ++i)
431 i->second.conditionally_assigned = true;
432 else_variables.insert(*i);
435 merge_down_variables();
438 void UnusedVariableRemover::visit(Iteration &iter)
440 variables.push_back(BlockVariableMap());
441 TraversingVisitor::visit(iter);
443 BlockVariableMap &block_variables = variables.back();
444 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
445 if(!i->second.local && i->second.referenced)
446 i->second.assignments.clear();
448 merge_down_variables();
452 bool UnusedFunctionRemover::apply(Stage &stage)
454 visit(stage.content);
455 NodeRemover().apply(stage, unused_nodes);
456 return !unused_nodes.empty();
459 void UnusedFunctionRemover::visit(FunctionCall &call)
461 TraversingVisitor::visit(call);
463 unused_nodes.erase(call.declaration);
464 if(call.declaration && call.declaration->definition!=call.declaration)
465 used_definitions.insert(call.declaration->definition);
468 void UnusedFunctionRemover::visit(FunctionDeclaration &func)
470 TraversingVisitor::visit(func);
472 if((func.name!="main" || func.body.body.empty()) && !used_definitions.count(&func))
473 unused_nodes.insert(&func);