mirror of
https://github.com/RPCS3/llvm.git
synced 2026-07-19 23:23:38 -04:00
[APInt] Fix typo in comment. NFC
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@302815 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -1138,7 +1138,7 @@ APInt APInt::multiplicativeInverse(const APInt& modulo) const {
|
||||
return APInt(BitWidth, 0);
|
||||
|
||||
// The next-to-last t is the multiplicative inverse. However, we are
|
||||
// interested in a positive inverse. Calcuate a positive one from a negative
|
||||
// interested in a positive inverse. Calculate a positive one from a negative
|
||||
// one if necessary. A simple addition of the modulo suffices because
|
||||
// abs(t[i]) is known to be less than *this/2 (see the link above).
|
||||
return t[i].isNegative() ? t[i] + modulo : t[i];
|
||||
|
||||
Reference in New Issue
Block a user