diff options
| author | Wojciech Matyjewicz <wmatyjewicz@fastmail.fm> | 2008-07-20 15:55:14 +0000 |
|---|---|---|
| committer | Wojciech Matyjewicz <wmatyjewicz@fastmail.fm> | 2008-07-20 15:55:14 +0000 |
| commit | de0f2382e4aa99c921216574ce97f09c3d145d0f (patch) | |
| tree | 3b5d9ec1f33c87da491d11462800a095a1830a1f /lib/Support/APInt.cpp | |
| parent | b8c44d3aacca4ac25ceca2f25c27cdc0cfc5b73c (diff) | |
Fix PR2088. Use modulo linear equation solver to compute loop iteration
count.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53810 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Support/APInt.cpp')
| -rw-r--r-- | lib/Support/APInt.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/Support/APInt.cpp b/lib/Support/APInt.cpp index b0577b3680..167d56955e 100644 --- a/lib/Support/APInt.cpp +++ b/lib/Support/APInt.cpp @@ -1466,7 +1466,7 @@ APInt APInt::multiplicativeInverse(const APInt& modulo) const { // The next-to-last t is the multiplicative inverse. However, we are // interested in a positive inverse. Calcuate a positive one from a negative // one if necessary. A simple addition of the modulo suffices because - // abs(t[i]) is known to less than *this/2 (see the link above). + // abs(t[i]) is known to be less than *this/2 (see the link above). return t[i].isNegative() ? t[i] + modulo : t[i]; } |