diff options
author | Craig Topper <craig.topper@gmail.com> | 2017-05-11 17:57:43 +0000 |
---|---|---|
committer | Craig Topper <craig.topper@gmail.com> | 2017-05-11 17:57:43 +0000 |
commit | 3fbecadab632f4caec1d0d5c05db2eeb2a78333b (patch) | |
tree | b5f2af05303ccd6e0daa70ba78e20ad2a7f70044 /llvm/lib/Support/APInt.cpp | |
parent | 47ccafe787e38223b95679ecf05e4723395f5aa2 (diff) | |
download | bcm5719-llvm-3fbecadab632f4caec1d0d5c05db2eeb2a78333b.tar.gz bcm5719-llvm-3fbecadab632f4caec1d0d5c05db2eeb2a78333b.zip |
[APInt] Fix typo in comment. NFC
llvm-svn: 302815
Diffstat (limited to 'llvm/lib/Support/APInt.cpp')
-rw-r--r-- | llvm/lib/Support/APInt.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/llvm/lib/Support/APInt.cpp b/llvm/lib/Support/APInt.cpp index 6b01c9bb277..0fade287d43 100644 --- a/llvm/lib/Support/APInt.cpp +++ b/llvm/lib/Support/APInt.cpp @@ -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]; |