RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-04-17 07:00:05 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Refactor the inline cost bonus calculation for constants to use

Browse Source 
a worklist rather than a recursive call.

No functionality changed.

llvm-svn: 152706
This commit is contained in:
Chandler Carruth 2012-03-14 07:32:53 +00:00
parent 542f88bf4f
commit dbefb1f9d8
1 changed files with 26 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

46
lib/Analysis/InlineCost.cpp
View File

@ -165,18 +165,24 @@ void CodeMetrics::analyzeBasicBlock(const BasicBlock *BB,
unsigned InlineCostAnalyzer::FunctionInfo::countCodeReductionForConstant( unsigned InlineCostAnalyzer::FunctionInfo::countCodeReductionForConstant(
const CodeMetrics &Metrics, Value *V) { const CodeMetrics &Metrics, Value *V) {
unsigned Reduction = 0; unsigned Reduction = 0;
for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){ SmallVector<Value *, 4> Worklist;
User *U = *UI; Worklist.push_back(V);
if (isa<BranchInst>(U) || isa<SwitchInst>(U)) { do {
// We will be able to eliminate all but one of the successors. Value *V = Worklist.pop_back_val();
const TerminatorInst &TI = cast<TerminatorInst>(*U); for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
const unsigned NumSucc = TI.getNumSuccessors(); User *U = *UI;
unsigned Instrs = 0; if (isa<BranchInst>(U) || isa<SwitchInst>(U)) {
for (unsigned I = 0; I != NumSucc; ++I) // We will be able to eliminate all but one of the successors.
Instrs += Metrics.NumBBInsts.lookup(TI.getSuccessor(I)); const TerminatorInst &TI = cast<TerminatorInst>(*U);
// We don't know which blocks will be eliminated, so use the average size. const unsigned NumSucc = TI.getNumSuccessors();
Reduction += InlineConstants::InstrCost*Instrs*(NumSucc-1)/NumSucc; unsigned Instrs = 0;
} else { for (unsigned I = 0; I != NumSucc; ++I)
Instrs += Metrics.NumBBInsts.lookup(TI.getSuccessor(I));
// We don't know which blocks will be eliminated, so use the average size.
Reduction += InlineConstants::InstrCost*Instrs*(NumSucc-1)/NumSucc;
continue;
}
// Figure out if this instruction will be removed due to simple constant // Figure out if this instruction will be removed due to simple constant
// propagation. // propagation.
Instruction &Inst = cast<Instruction>(*U); Instruction &Inst = cast<Instruction>(*U);
@ -198,17 +204,17 @@ unsigned InlineCostAnalyzer::FunctionInfo::countCodeReductionForConstant(
AllOperandsConstant = false; AllOperandsConstant = false;
break; break;
} }
if (!AllOperandsConstant)
continue;
if (AllOperandsConstant) { // We will get to remove this instruction...
// We will get to remove this instruction... Reduction += InlineConstants::InstrCost;
Reduction += InlineConstants::InstrCost;
// And any other instructions that use it which become constants // And any other instructions that use it which become constants
// themselves. // themselves.
Reduction += countCodeReductionForConstant(Metrics, &Inst); Worklist.push_back(&Inst);
}
} }
} } while (!Worklist.empty());
return Reduction; return Reduction;
} }