diff options
| -rw-r--r-- | include/llvm/Analysis/InlineCost.h | 2 | ||||
| -rw-r--r-- | lib/Analysis/InlineCost.cpp | 9 |
2 files changed, 5 insertions, 6 deletions
diff --git a/include/llvm/Analysis/InlineCost.h b/include/llvm/Analysis/InlineCost.h index ea76ec1..a0c521d 100644 --- a/include/llvm/Analysis/InlineCost.h +++ b/include/llvm/Analysis/InlineCost.h @@ -152,7 +152,7 @@ namespace llvm { /// CountCodeReductionForConstant - Figure out an approximation for how /// many instructions will be constant folded if the specified value is /// constant. - unsigned CountCodeReductionForConstant(Value *V, CodeMetrics &M); + unsigned CountCodeReductionForConstant(Value *V); /// CountCodeReductionForAlloca - Figure out an approximation of how much /// smaller the function will be if it is inlined into a context where an diff --git a/lib/Analysis/InlineCost.cpp b/lib/Analysis/InlineCost.cpp index 280f5f5..f14dc5d 100644 --- a/lib/Analysis/InlineCost.cpp +++ b/lib/Analysis/InlineCost.cpp @@ -22,7 +22,7 @@ using namespace llvm; // instructions will be constant folded if the specified value is constant. // unsigned InlineCostAnalyzer::FunctionInfo:: -CountCodeReductionForConstant(Value *V, CodeMetrics &Metrics) { +CountCodeReductionForConstant(Value *V) { unsigned Reduction = 0; for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E; ++UI) if (isa<BranchInst>(*UI) || isa<SwitchInst>(*UI)) { @@ -71,7 +71,7 @@ CountCodeReductionForConstant(Value *V, CodeMetrics &Metrics) { // And any other instructions that use it which become constants // themselves. - Reduction += CountCodeReductionForConstant(&Inst, Metrics); + Reduction += CountCodeReductionForConstant(&Inst); } } @@ -242,9 +242,8 @@ void InlineCostAnalyzer::FunctionInfo::analyzeFunction(Function *F) { // code can be eliminated if one of the arguments is a constant. ArgumentWeights.reserve(F->arg_size()); for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end(); I != E; ++I) - ArgumentWeights. - push_back(ArgInfo(CountCodeReductionForConstant(I, Metrics), - CountCodeReductionForAlloca(I))); + ArgumentWeights.push_back(ArgInfo(CountCodeReductionForConstant(I), + CountCodeReductionForAlloca(I))); } // getInlineCost - The heuristic used to determine if we should inline the |