This method is pretty new and probably isn't use much in the code base so this should have a negligible size impact. The OR and XOR operators are already inline.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@298870
91177308-0d34-0410-b5e6-
96231b3b80d8
/// Performs a bitwise AND operation on this APInt and RHS. RHS is
/// logically zero-extended or truncated to match the bit-width of
/// the LHS.
- APInt &operator&=(uint64_t RHS);
+ APInt &operator&=(uint64_t RHS) {
+ if (isSingleWord()) {
+ VAL &= RHS;
+ return *this;
+ }
+ pVal[0] &= RHS;
+ memset(pVal+1, 0, (getNumWords() - 1) * APINT_WORD_SIZE);
+ return *this;
+ }
/// \brief Bitwise OR assignment operator.
///
return *this;
}
-APInt &APInt::operator&=(uint64_t RHS) {
- if (isSingleWord()) {
- VAL &= RHS;
- return *this;
- }
- pVal[0] &= RHS;
- unsigned numWords = getNumWords();
- for (unsigned i = 1; i < numWords; ++i)
- pVal[i] = 0;
- return *this;
-}
-
APInt& APInt::operator|=(const APInt& RHS) {
assert(BitWidth == RHS.BitWidth && "Bit widths must be the same");
if (isSingleWord()) {