RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2025-02-03 19:15:30 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

We know it's always a SCEVConstant if it gets here, so just cast it and

Browse Source 
inline the only use of isNegative. Fixes warning reported by Mike Stump.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@61600 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Nick Lewycky 2009-01-03 01:53:24 +00:00
parent 93d9ad567d
commit 87f333641a
1 changed files with 2 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
lib/Analysis/ScalarEvolution.cpp
View File

@ -2905,11 +2905,6 @@ bool ScalarEvolutionsImpl::executesAtLeastOnce(const Loop *L, bool isSigned,
return false;
}
static bool isNegative(SCEVHandle X) {
if (SCEVConstant *C = dyn_cast<SCEVConstant>(X))
return C->getValue()->getValue().isNegative();
}
/// potentialInfiniteLoop - Test whether the loop might jump over the exit value
/// due to wrapping around 2^n.
bool ScalarEvolutionsImpl::potentialInfiniteLoop(SCEV *Stride, SCEV *RHS,
@ -2967,7 +2962,8 @@ HowManyLessThans(SCEV *LHS, SCEV *RHS, const Loop *L,
// the stride is negative, we're not counting how many times 'less-than' is
// true as we approach it, we're counting how far away we are from wrapping
// around the backside.
if (isSigned && isNegative(Stride))
if (isSigned &&
cast<SCEVConstant>(Stride)->getValue()->getValue().isNegative())
return UnknownValue;
// We know the LHS is of the form {n,+,s} and the RHS is some loop-invariant