diff options
| author | Craig Topper <craig.topper@intel.com> | 2020-09-30 13:55:01 -0700 |
|---|---|---|
| committer | Craig Topper <craig.topper@intel.com> | 2020-09-30 16:07:15 -0700 |
| commit | b23916504a1a9f29c7519ed83813774eecce1789 (patch) | |
| tree | bc9370203c178cb91dc52efefb72b26cdd3ea42c /llvm/lib/Support/APFloat.cpp | |
| parent | 66d2e3f495948412602db4507359b4612639e523 (diff) | |
| download | llvm-b23916504a1a9f29c7519ed83813774eecce1789.zip llvm-b23916504a1a9f29c7519ed83813774eecce1789.tar.gz llvm-b23916504a1a9f29c7519ed83813774eecce1789.tar.bz2 | |
Patch IEEEFloat::isSignificandAllZeros and IEEEFloat::isSignificandAllOnes (bug 34579)
Patch IEEEFloat::isSignificandAllZeros and IEEEFloat::isSignificandAllOnes to behave correctly in the case that the size of the significand is a multiple of the width of the integerParts making up the significand.
The patch to IEEEFloat::isSignificandAllOnes fixes bug 34579, and the patch to IEEE:Float:isSignificandAllZeros fixes the unit test "APFloatTest.x87Next" I added here. I have included both in this diff since the changes are very similar.
Patch by Andrew Briand
Diffstat (limited to 'llvm/lib/Support/APFloat.cpp')
| -rw-r--r-- | llvm/lib/Support/APFloat.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/llvm/lib/Support/APFloat.cpp b/llvm/lib/Support/APFloat.cpp index adc6299..c5adbe9 100644 --- a/llvm/lib/Support/APFloat.cpp +++ b/llvm/lib/Support/APFloat.cpp @@ -842,7 +842,7 @@ bool IEEEFloat::isSignificandAllOnes() const { // Test if the significand excluding the integral bit is all ones. This allows // us to test for binade boundaries. const integerPart *Parts = significandParts(); - const unsigned PartCount = partCount(); + const unsigned PartCount = partCountForBits(semantics->precision); for (unsigned i = 0; i < PartCount - 1; i++) if (~Parts[i]) return false; @@ -864,7 +864,7 @@ bool IEEEFloat::isSignificandAllZeros() const { // Test if the significand excluding the integral bit is all zeros. This // allows us to test for binade boundaries. const integerPart *Parts = significandParts(); - const unsigned PartCount = partCount(); + const unsigned PartCount = partCountForBits(semantics->precision); for (unsigned i = 0; i < PartCount - 1; i++) if (Parts[i]) |