RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 11:42:57 +01:00
Code Issues Projects Releases Wiki Activity

Remove dead code, that I apparently wrote a while back. We seem to be doing well enough

Browse Source 
without whatever this was trying to do.  When/if someone has the time to do some empirical
evaluations, it might be worth it to figure out what this code was trying to do and see if
it's worth resurrecting/fixing.

llvm-svn: 123684
This commit is contained in:
Owen Anderson 2011-01-17 22:39:54 +00:00
parent 49f7d8c38c
commit b315a60d0f
1 changed files with 0 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -99,21 +99,6 @@ static unsigned ApproximateLoopSize(const Loop *L, unsigned &NumCalls) {
unsigned LoopSize = Metrics.NumInsts;
// If we can identify the induction variable, we know that it will become
// constant when we unroll the loop, so factor that into our loop size
// estimate.
// FIXME: We have to divide by InlineConstants::InstrCost because the
// measure returned by CountCodeReductionForConstant is not an instruction
// count, but rather a weight as defined by InlineConstants. It would
// probably be a good idea to standardize on a single weighting scheme by
// pushing more of the logic for weighting into CodeMetrics.
if (PHINode *IndVar = L->getCanonicalInductionVariable()) {
unsigned SizeDecrease = Metrics.CountCodeReductionForConstant(IndVar);
// NOTE: Because SizeDecrease is a fuzzy estimate, we don't want to allow
// it to totally negate the cost of unrolling a loop.
SizeDecrease = SizeDecrease > LoopSize / 2 ? LoopSize / 2 : SizeDecrease;
}
// Don't allow an estimate of size zero. This would allows unrolling of loops
// with huge iteration counts, which is a compile time problem even if it's
// not a problem for code quality.