forked from OSchip/llvm-project
parent
47ccafe787
commit
3fbecadab6
|
@ -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];
|
||||
|
|
Loading…
Reference in New Issue