RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-25 04:02:41 +01:00
Code Issues Projects Releases Wiki Activity

Rename ItCount to BECount, since it holds a backedge-taken count rather

Browse Source 
than an iteration count.

llvm-svn: 94549
This commit is contained in:
Dan Gohman 2010-01-26 16:46:18 +00:00
parent 332216f73c
commit 783616ec9a
1 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
lib/Analysis/ScalarEvolution.cpp
View File

@ -3358,19 +3358,19 @@ ScalarEvolution::getBackedgeTakenInfo(const Loop *L) {
std::pair<std::map<const Loop *, BackedgeTakenInfo>::iterator, bool> Pair =
BackedgeTakenCounts.insert(std::make_pair(L, getCouldNotCompute()));
if (Pair.second) {
BackedgeTakenInfo ItCount = ComputeBackedgeTakenCount(L);
if (ItCount.Exact != getCouldNotCompute()) {
assert(ItCount.Exact->isLoopInvariant(L) &&
ItCount.Max->isLoopInvariant(L) &&
"Computed trip count isn't loop invariant for loop!");
BackedgeTakenInfo BECount = ComputeBackedgeTakenCount(L);
if (BECount.Exact != getCouldNotCompute()) {
assert(BECount.Exact->isLoopInvariant(L) &&
BECount.Max->isLoopInvariant(L) &&
"Computed backedge-taken count isn't loop invariant for loop!");
++NumTripCountsComputed;
// Update the value in the map.
Pair.first->second = ItCount;
Pair.first->second = BECount;
} else {
if (ItCount.Max != getCouldNotCompute())
if (BECount.Max != getCouldNotCompute())
// Update the value in the map.
Pair.first->second = ItCount;
Pair.first->second = BECount;
if (isa<PHINode>(L->getHeader()->begin()))
// Only count loops that have phi nodes as not being computable.
++NumTripCountsNotComputed;
@ -3381,7 +3381,7 @@ ScalarEvolution::getBackedgeTakenInfo(const Loop *L) {
// conservative estimates made without the benefit of trip count
// information. This is similar to the code in forgetLoop, except that
// it handles SCEVUnknown PHI nodes specially.
if (ItCount.hasAnyInfo()) {
if (BECount.hasAnyInfo()) {
SmallVector<Instruction *, 16> Worklist;
PushLoopPHIs(L, Worklist);