RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2025-02-27 08:26:23 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

[Unroll] Refactor the accumulation of optimized instruction costs into

Browse Source 
a single location.

This reduces code duplication a bit and will also pave the way for
a better separation between the visitation algorithm and the unroll
analysis.

No functionality changed.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@237990 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chandler Carruth 2015-05-22 02:47:29 +00:00
parent 2c78f9499c
commit 9233137390
1 changed files with 10 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
lib/Transforms/Scalar/LoopUnrollPass.cpp
View File

@ -402,14 +402,10 @@ class UnrollAnalyzer : public InstVisitor<UnrollAnalyzer, bool> {
else
SimpleV = SimplifyBinOp(I.getOpcode(), LHS, RHS, DL);
if (SimpleV)
NumberOfOptimizedInstructions += TTI.getUserCost(&I);
if (Constant *C = dyn_cast_or_null<Constant>(SimpleV)) {
if (Constant *C = dyn_cast_or_null<Constant>(SimpleV))
SimplifiedValues[&I] = C;
return true;
}
return false;
return SimpleV;
}
/// Try to fold load I.
@ -452,7 +448,6 @@ class UnrollAnalyzer : public InstVisitor<UnrollAnalyzer, bool> {
assert(CV && "Constant expected.");
SimplifiedValues[&I] = CV;
NumberOfOptimizedInstructions += TTI.getUserCost(&I);
return true;
}
@ -571,7 +566,13 @@ public:
// opportunities.
for (Instruction &I : *BB) {
UnrolledLoopSize += TTI.getUserCost(&I);
Base::visit(I);
// Visit the instruction to analyze its loop cost after unrolling,
// and if the visitor returns true, then we can optimize this
// instruction away.
if (Base::visit(I))
NumberOfOptimizedInstructions += TTI.getUserCost(&I);
// If unrolled body turns out to be too big, bail out.
if (UnrolledLoopSize - NumberOfOptimizedInstructions >
MaxUnrolledLoopSize)