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():
131 void ConstantConditionEliminator::visit(Block &block)
133 SetForScope<unsigned> set(scope_level, scope_level+1);
134 BlockModifier::visit(block);
136 for(map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
137 variable_values.erase(i->second);
140 void ConstantConditionEliminator::visit(UnaryExpression &unary)
142 if(VariableReference *var = dynamic_cast<VariableReference *>(unary.expression.get()))
143 if(unary.oper=="++" || unary.oper=="--")
144 variable_values.erase(var->declaration);
147 void ConstantConditionEliminator::visit(Assignment &assign)
149 variable_values.erase(assign.target_declaration);
152 void ConstantConditionEliminator::visit(VariableDeclaration &var)
154 if(var.constant || scope_level>1)
155 variable_values[&var] = var.init_expression.get();
158 void ConstantConditionEliminator::visit(Conditional &cond)
162 ExpressionEvaluator eval(variable_values);
163 cond.condition->visit(eval);
164 if(eval.is_result_valid())
166 flatten_block(eval.get_result() ? cond.body : cond.else_body);
171 TraversingVisitor::visit(cond);
174 void ConstantConditionEliminator::visit(Iteration &iter)
180 /* If the loop condition is always false on the first iteration, the
181 entire loop can be removed */
182 if(iter.init_statement)
183 iter.init_statement->visit(*this);
184 ExpressionEvaluator eval(variable_values);
185 iter.condition->visit(eval);
186 if(eval.is_result_valid() && !eval.get_result())
193 /* Record all assignments that occur inside the loop body so those
194 variables won't be considered as constant */
195 SetFlag set_record(record_only);
196 TraversingVisitor::visit(iter);
199 TraversingVisitor::visit(iter);
201 if(VariableDeclaration *init_decl = dynamic_cast<VariableDeclaration *>(iter.init_statement.get()))
202 variable_values.erase(init_decl);
206 UnusedVariableRemover::VariableInfo::VariableInfo():
208 conditionally_assigned(false),
213 UnusedVariableRemover::UnusedVariableRemover():
216 assignment_target(false),
217 assign_to_subscript(false),
221 bool UnusedVariableRemover::apply(Stage &stage)
223 variables.push_back(BlockVariableMap());
224 visit(stage.content);
225 BlockVariableMap &global_variables = variables.back();
226 for(BlockVariableMap::iterator i=global_variables.begin(); i!=global_variables.end(); ++i)
228 if(i->first->interface=="out" && (stage.type==Stage::FRAGMENT || i->first->linked_declaration || !i->first->name.compare(0, 3, "gl_")))
230 if(!i->second.referenced)
232 unused_nodes.insert(i->first);
233 clear_assignments(i->second, true);
236 variables.pop_back();
238 NodeRemover().apply(stage, unused_nodes);
240 return !unused_nodes.empty();
243 void UnusedVariableRemover::visit(VariableReference &var)
245 map<VariableDeclaration *, Node *>::iterator i = aggregates.find(var.declaration);
246 if(i!=aggregates.end())
247 unused_nodes.erase(i->second);
249 if(var.declaration && !assignment_target)
251 VariableInfo &var_info = variables.back()[var.declaration];
252 var_info.assignments.clear();
253 var_info.referenced = true;
257 void UnusedVariableRemover::visit(MemberAccess &memacc)
259 TraversingVisitor::visit(memacc);
260 unused_nodes.erase(memacc.declaration);
263 void UnusedVariableRemover::visit(BinaryExpression &binary)
267 if(assignment_target)
268 assign_to_subscript = true;
269 binary.left->visit(*this);
270 SetForScope<bool> set(assignment_target, false);
271 binary.right->visit(*this);
274 TraversingVisitor::visit(binary);
277 void UnusedVariableRemover::visit(Assignment &assign)
280 assign_to_subscript = false;
281 SetForScope<bool> set(assignment_target, !assign.self_referencing);
282 assign.left->visit(*this);
284 assign.right->visit(*this);
285 assignment = &assign;
288 void UnusedVariableRemover::record_assignment(VariableDeclaration &var, Node &node, bool chained)
290 VariableInfo &var_info = variables.back()[&var];
292 clear_assignments(var_info, true);
293 var_info.assignments.push_back(&node);
294 var_info.conditionally_assigned = false;
297 void UnusedVariableRemover::clear_assignments(VariableInfo &var_info, bool mark_unused)
301 for(vector<Node *>::iterator i=var_info.assignments.begin(); i!=var_info.assignments.end(); ++i)
302 unused_nodes.insert(*i);
304 var_info.assignments.clear();
307 void UnusedVariableRemover::visit(ExpressionStatement &expr)
310 TraversingVisitor::visit(expr);
311 if(assignment && assignment->target_declaration)
312 record_assignment(*assignment->target_declaration, expr, (assignment->self_referencing || assign_to_subscript));
315 void UnusedVariableRemover::visit(StructDeclaration &strct)
317 SetForScope<Node *> set(aggregate, &strct);
318 unused_nodes.insert(&strct);
319 TraversingVisitor::visit(strct);
322 void UnusedVariableRemover::visit(VariableDeclaration &var)
325 aggregates[&var] = aggregate;
328 variables.back()[&var].local = true;
329 if(var.init_expression)
330 record_assignment(var, *var.init_expression, false);
332 unused_nodes.erase(var.type_declaration);
333 TraversingVisitor::visit(var);
336 void UnusedVariableRemover::visit(InterfaceBlock &iface)
338 SetForScope<Node *> set(aggregate, &iface);
339 unused_nodes.insert(&iface);
340 TraversingVisitor::visit(iface);
343 void UnusedVariableRemover::visit(FunctionDeclaration &func)
345 variables.push_back(BlockVariableMap());
348 SetForScope<bool> set(global_scope, false);
349 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
351 func.body.visit(*this);
354 BlockVariableMap &block_variables = variables.back();
355 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
356 i->second.conditionally_assigned = true;
357 for(NodeArray<VariableDeclaration>::iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
358 block_variables[i->get()].referenced = true;
359 merge_down_variables();
362 void UnusedVariableRemover::merge_down_variables()
364 BlockVariableMap &parent_variables = variables[variables.size()-2];
365 BlockVariableMap &block_variables = variables.back();
366 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
370 if(!i->second.referenced)
371 unused_nodes.insert(i->first);
372 clear_assignments(i->second, i->first->interface!="out");
376 BlockVariableMap::iterator j = parent_variables.find(i->first);
377 if(j==parent_variables.end())
378 parent_variables.insert(*i);
381 if(i->second.referenced || !i->second.conditionally_assigned)
382 clear_assignments(j->second, !i->second.referenced);
383 j->second.conditionally_assigned = i->second.conditionally_assigned;
384 j->second.referenced |= i->second.referenced;
385 j->second.assignments.insert(j->second.assignments.end(), i->second.assignments.begin(), i->second.assignments.end());
388 variables.pop_back();
391 void UnusedVariableRemover::visit(Conditional &cond)
393 cond.condition->visit(*this);
394 variables.push_back(BlockVariableMap());
395 cond.body.visit(*this);
397 BlockVariableMap if_variables;
398 swap(variables.back(), if_variables);
399 cond.else_body.visit(*this);
401 BlockVariableMap &else_variables = variables.back();
402 for(BlockVariableMap::iterator i=else_variables.begin(); i!=else_variables.end(); ++i)
404 BlockVariableMap::iterator j = if_variables.find(i->first);
405 if(j!=if_variables.end())
407 i->second.assignments.insert(i->second.assignments.end(), j->second.assignments.begin(), j->second.assignments.end());
408 i->second.conditionally_assigned |= j->second.conditionally_assigned;
409 if_variables.erase(j);
412 i->second.conditionally_assigned = true;
415 for(BlockVariableMap::iterator i=if_variables.begin(); i!=if_variables.end(); ++i)
417 i->second.conditionally_assigned = true;
418 else_variables.insert(*i);
421 merge_down_variables();
424 void UnusedVariableRemover::visit(Iteration &iter)
426 variables.push_back(BlockVariableMap());
427 TraversingVisitor::visit(iter);
429 BlockVariableMap &block_variables = variables.back();
430 for(BlockVariableMap::iterator i=block_variables.begin(); i!=block_variables.end(); ++i)
431 if(!i->second.local && i->second.referenced)
432 i->second.assignments.clear();
434 merge_down_variables();
438 bool UnusedFunctionRemover::apply(Stage &stage)
440 visit(stage.content);
441 NodeRemover().apply(stage, unused_nodes);
442 return !unused_nodes.empty();
445 void UnusedFunctionRemover::visit(FunctionCall &call)
447 TraversingVisitor::visit(call);
449 unused_nodes.erase(call.declaration);
450 if(call.declaration && call.declaration->definition!=call.declaration)
451 used_definitions.insert(call.declaration->definition);
454 void UnusedFunctionRemover::visit(FunctionDeclaration &func)
456 TraversingVisitor::visit(func);
458 if((func.name!="main" || func.body.body.empty()) && !used_definitions.count(&func))
459 unused_nodes.insert(&func);