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():
130 void ConstantConditionEliminator::apply(Stage &stage)
132 visit(stage.content);
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 if(var.constant || current_block->parent)
164 variable_values[&var] = var.init_expression.get();
167 void ConstantConditionEliminator::visit(Conditional &cond)
171 ExpressionEvaluator eval(variable_values);
172 cond.condition->visit(eval);
173 if(eval.is_result_valid())
175 Block &block = (eval.get_result() ? cond.body : cond.else_body);
176 current_block->body.splice(insert_point, block.body);
177 nodes_to_remove.insert(&cond);
182 TraversingVisitor::visit(cond);
185 void ConstantConditionEliminator::visit(Iteration &iter)
191 /* If the loop condition is always false on the first iteration, the
192 entire loop can be removed */
193 if(iter.init_statement)
194 iter.init_statement->visit(*this);
195 ExpressionEvaluator eval(variable_values);
196 iter.condition->visit(eval);
197 if(eval.is_result_valid() && !eval.get_result())
199 nodes_to_remove.insert(&iter);
204 /* Record all assignments that occur inside the loop body so those
205 variables won't be considered as constant */
206 SetFlag set_record(record_only);
207 TraversingVisitor::visit(iter);
210 TraversingVisitor::visit(iter);
212 if(VariableDeclaration *init_decl = dynamic_cast<VariableDeclaration *>(iter.init_statement.get()))
213 variable_values.erase(init_decl);
217 UnusedVariableRemover::VariableInfo::VariableInfo():
219 conditionally_assigned(false),
224 UnusedVariableRemover::UnusedVariableRemover():
227 assignment_target(false),
228 assign_to_subscript(false)
231 bool UnusedVariableRemover::apply(Stage &stage)
233 variables.push_back(BlockVariableMap());
234 visit(stage.content);
235 BlockVariableMap &global_variables = variables.back();
236 for(BlockVariableMap::iterator i=global_variables.begin(); i!=global_variables.end(); ++i)
238 if(i->first->interface=="out" && (stage.type==Stage::FRAGMENT || i->first->linked_declaration || !i->first->name.compare(0, 3, "gl_")))
240 if(!i->second.referenced)
242 unused_nodes.insert(i->first);
243 clear_assignments(i->second, true);
246 variables.pop_back();
248 NodeRemover().apply(stage, unused_nodes);
250 return !unused_nodes.empty();
253 void UnusedVariableRemover::visit(VariableReference &var)
255 map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
256 if(i!=aggregates.end())
257 unused_nodes.erase(i->second);
259 if(var.declaration && !assignment_target)
261 VariableInfo &var_info = variables.back()[var.declaration];
262 var_info.assignments.clear();
263 var_info.referenced = true;
267 void UnusedVariableRemover::visit(MemberAccess &memacc)
269 TraversingVisitor::visit(memacc);
270 unused_nodes.erase(memacc.declaration);
273 void UnusedVariableRemover::visit(BinaryExpression &binary)
277 if(assignment_target)
278 assign_to_subscript = true;
279 binary.left->visit(*this);
280 SetForScope<bool> set(assignment_target, false);
281 binary.right->visit(*this);
284 TraversingVisitor::visit(binary);
287 void UnusedVariableRemover::visit(Assignment &assign)
290 assign_to_subscript = false;
291 SetForScope<bool> set(assignment_target, !assign.self_referencing);
292 assign.left->visit(*this);
294 assign.right->visit(*this);
295 assignment = &assign;
298 void UnusedVariableRemover::record_assignment(VariableDeclaration &var, Node &node, bool chained)
300 VariableInfo &var_info = variables.back()[&var];
302 clear_assignments(var_info, true);
303 var_info.assignments.push_back(&node);
304 var_info.conditionally_assigned = false;
307 void UnusedVariableRemover::clear_assignments(VariableInfo &var_info, bool mark_unused)
311 for(vector<Node *>::iterator i=var_info.assignments.begin(); i!=var_info.assignments.end(); ++i)
312 unused_nodes.insert(*i);
314 var_info.assignments.clear();
317 void UnusedVariableRemover::visit(ExpressionStatement &expr)
320 TraversingVisitor::visit(expr);
321 if(assignment && assignment->target_declaration)
322 record_assignment(*assignment->target_declaration, expr, (assignment->self_referencing || assign_to_subscript));
325 void UnusedVariableRemover::visit(StructDeclaration &strct)
327 SetForScope<Node *> set(aggregate, &strct);
328 unused_nodes.insert(&strct);
329 TraversingVisitor::visit(strct);
332 void UnusedVariableRemover::visit(VariableDeclaration &var)
335 aggregates[&var] = aggregate;
338 variables.back()[&var].local = true;
339 if(var.init_expression)
340 record_assignment(var, *var.init_expression, false);
342 unused_nodes.erase(var.type_declaration);
343 TraversingVisitor::visit(var);
346 void UnusedVariableRemover::visit(InterfaceBlock &iface)
348 SetForScope<Node *> set(aggregate, &iface);
349 unused_nodes.insert(&iface);
350 TraversingVisitor::visit(iface);
353 void UnusedVariableRemover::visit(FunctionDeclaration &func)
355 variables.push_back(BlockVariableMap());
357 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
359 func.body.visit(*this);
361 BlockVariableMap &block_variables = variables.back();
362 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
363 i->second.conditionally_assigned = true;
364 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
365 block_variables[i->get()].referenced = true;
366 merge_down_variables();
369 void UnusedVariableRemover::merge_down_variables()
371 BlockVariableMap &parent_variables = variables[variables.size()-2];
372 BlockVariableMap &block_variables = variables.back();
373 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
377 if(!i->second.referenced)
378 unused_nodes.insert(i->first);
379 clear_assignments(i->second, i->first->interface!="out");
383 BlockVariableMap::iterator j = parent_variables.find(i->first);
384 if(j==parent_variables.end())
385 parent_variables.insert(*i);
388 if(i->second.referenced || !i->second.conditionally_assigned)
389 clear_assignments(j->second, !i->second.referenced);
390 j->second.conditionally_assigned = i->second.conditionally_assigned;
391 j->second.referenced |= i->second.referenced;
392 j->second.assignments.insert(j->second.assignments.end(), i->second.assignments.begin(), i->second.assignments.end());
395 variables.pop_back();
398 void UnusedVariableRemover::visit(Conditional &cond)
400 cond.condition->visit(*this);
401 variables.push_back(BlockVariableMap());
402 cond.body.visit(*this);
404 BlockVariableMap if_variables;
405 swap(variables.back(), if_variables);
406 cond.else_body.visit(*this);
408 BlockVariableMap &else_variables = variables.back();
409 for(BlockVariableMap::iterator i=else_variables.begin(); i!=else_variables.end(); ++i)
411 BlockVariableMap::iterator j = if_variables.find(i->first);
412 if(j!=if_variables.end())
414 i->second.assignments.insert(i->second.assignments.end(), j->second.assignments.begin(), j->second.assignments.end());
415 i->second.conditionally_assigned |= j->second.conditionally_assigned;
416 if_variables.erase(j);
419 i->second.conditionally_assigned = true;
422 for(BlockVariableMap::iterator i=if_variables.begin(); i!=if_variables.end(); ++i)
424 i->second.conditionally_assigned = true;
425 else_variables.insert(*i);
428 merge_down_variables();
431 void UnusedVariableRemover::visit(Iteration &iter)
433 variables.push_back(BlockVariableMap());
434 TraversingVisitor::visit(iter);
436 BlockVariableMap &block_variables = variables.back();
437 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
438 if(!i->second.local && i->second.referenced)
439 i->second.assignments.clear();
441 merge_down_variables();
445 bool UnusedFunctionRemover::apply(Stage &stage)
447 visit(stage.content);
448 NodeRemover().apply(stage, unused_nodes);
449 return !unused_nodes.empty();
452 void UnusedFunctionRemover::visit(FunctionCall &call)
454 TraversingVisitor::visit(call);
456 unused_nodes.erase(call.declaration);
457 if(call.declaration && call.declaration->definition!=call.declaration)
458 used_definitions.insert(call.declaration->definition);
461 void UnusedFunctionRemover::visit(FunctionDeclaration &func)
463 TraversingVisitor::visit(func);
465 if((func.name!="main" || func.body.body.empty()) && !used_definitions.count(&func))
466 unused_nodes.insert(&func);