[llvm] r260911 - APInt: Slightly simplify countLeadingZerosSlowCase()
Matthias Braun via llvm-commits
llvm-commits at lists.llvm.org
Mon Feb 15 12:06:23 PST 2016
Author: matze
Date: Mon Feb 15 14:06:22 2016
New Revision: 260911
URL: http://llvm.org/viewvc/llvm-project?rev=260911&view=rev
Log:
APInt: Slightly simplify countLeadingZerosSlowCase()
We always clear the unused bits in the most signifant word so there is
no need to mask them out in countLeadingZerosSlowCase().
Differential Revision: http://reviews.llvm.org/D16621
Modified:
llvm/trunk/lib/Support/APInt.cpp
Modified: llvm/trunk/lib/Support/APInt.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Support/APInt.cpp?rev=260911&r1=260910&r2=260911&view=diff
==============================================================================
--- llvm/trunk/lib/Support/APInt.cpp (original)
+++ llvm/trunk/lib/Support/APInt.cpp Mon Feb 15 14:06:22 2016
@@ -676,30 +676,19 @@ APInt APInt::getLoBits(unsigned numBits)
}
unsigned APInt::countLeadingZerosSlowCase() const {
- // Treat the most significand word differently because it might have
- // meaningless bits set beyond the precision.
- unsigned BitsInMSW = BitWidth % APINT_BITS_PER_WORD;
- integerPart MSWMask;
- if (BitsInMSW) MSWMask = (integerPart(1) << BitsInMSW) - 1;
- else {
- MSWMask = ~integerPart(0);
- BitsInMSW = APINT_BITS_PER_WORD;
- }
-
- unsigned i = getNumWords();
- integerPart MSW = pVal[i-1] & MSWMask;
- if (MSW)
- return llvm::countLeadingZeros(MSW) - (APINT_BITS_PER_WORD - BitsInMSW);
-
- unsigned Count = BitsInMSW;
- for (--i; i > 0u; --i) {
- if (pVal[i-1] == 0)
+ unsigned Count = 0;
+ for (int i = getNumWords()-1; i >= 0; --i) {
+ integerPart V = pVal[i];
+ if (V == 0)
Count += APINT_BITS_PER_WORD;
else {
- Count += llvm::countLeadingZeros(pVal[i-1]);
+ Count += llvm::countLeadingZeros(V);
break;
}
}
+ // Adjust for unused bits in the most significant word (they are zero).
+ unsigned Mod = BitWidth % APINT_BITS_PER_WORD;
+ Count -= Mod > 0 ? APINT_BITS_PER_WORD - Mod : 0;
return Count;
}
More information about the llvm-commits
mailing list