Fix typo. Thanks to Duncan for noticing.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@47062 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Wojciech Matyjewicz 2008-02-13 12:21:32 +00:00
parent 3a4cbe2a41
commit a65ee03bb2

View File

@ -2533,7 +2533,7 @@ HowManyLessThans(SCEV *LHS, SCEV *RHS, const Loop *L, bool isSigned) {
// We know the LHS is of the form {n,+,1} and the RHS is some loop-invariant
// m. So, we count the number of iterations in which {n,+,1} < m is true.
// Note that we cannot simply return max(m-n,0) because it's not safe to
// treat m-n as signed nor unsinged due to overflow possibility.
// treat m-n as signed nor unsigned due to overflow possibility.
// First, we get the value of the LHS in the first iteration: n
SCEVHandle Start = AddRec->getOperand(0);