CodeGen/SelectionDAG/SelectionDAG.cpp

1749   APInt KnownZero, KnownOne;
1750   ComputeMaskedBits(Op, KnownZero, KnownOne, Depth);
1751   assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1756 /// known to be either zero or one and return them in the KnownZero/KnownOne
1760                                      APInt &KnownOne, unsigned Depth) const {
1764   KnownZero = KnownOne = APInt(BitWidth, 0);   // Don't know anything.
1773     KnownOne = cast<ConstantSDNode>(Op)->getAPIntValue();
1774     KnownZero = ~KnownOne;
1778     ComputeMaskedBits(Op.getOperand(1), KnownZero, KnownOne, Depth+1);
1780     assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1784     KnownOne &= KnownOne2;
1789     ComputeMaskedBits(Op.getOperand(1), KnownZero, KnownOne, Depth+1);
1791     assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1797     KnownOne |= KnownOne2;
1800     ComputeMaskedBits(Op.getOperand(1), KnownZero, KnownOne, Depth+1);
1802     assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1806     APInt KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
1808     KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
1813     ComputeMaskedBits(Op.getOperand(1), KnownZero, KnownOne, Depth+1);
1815     assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1822     KnownOne.clearAllBits();
1854     ComputeMaskedBits(Op.getOperand(2), KnownZero, KnownOne, Depth+1);
1856     assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1860     KnownOne &= KnownOne2;
1864     ComputeMaskedBits(Op.getOperand(3), KnownZero, KnownOne, Depth+1);
1866     assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1870     KnownOne &= KnownOne2;
1897       ComputeMaskedBits(Op.getOperand(0), KnownZero, KnownOne, Depth+1);
1898       assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1900       KnownOne  <<= ShAmt;
1914       ComputeMaskedBits(Op.getOperand(0), KnownZero, KnownOne, Depth+1);
1915       assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1917       KnownOne  = KnownOne.lshr(ShAmt);
1935       ComputeMaskedBits(Op.getOperand(0), KnownZero, KnownOne, Depth+1);
1936       assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1938       KnownOne  = KnownOne.lshr(ShAmt);
1946       } else if (KnownOne.intersects(SignBit)) {
1947         KnownOne  |= HighBits;  // New bits are known one.
1968     ComputeMaskedBits(Op.getOperand(0), KnownZero, KnownOne, Depth+1);
1969     KnownOne &= InputDemandedBits;
1971     assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1977       KnownOne  &= ~NewBits;
1978     } else if (KnownOne.intersects(InSignBit)) {   // Input sign bit known set
1979       KnownOne  |= NewBits;
1983       KnownOne  &= ~NewBits;
1994     KnownOne.clearAllBits();
2014     KnownOne = KnownOne.trunc(InBits);
2015     ComputeMaskedBits(Op.getOperand(0), KnownZero, KnownOne, Depth+1);
2017     KnownOne = KnownOne.zext(BitWidth);
2027     KnownOne = KnownOne.trunc(InBits);
2028     ComputeMaskedBits(Op.getOperand(0), KnownZero, KnownOne, Depth+1);
2032     bool SignBitKnownOne  = KnownOne.isNegative();
2037     KnownOne = KnownOne.zext(BitWidth);
2043       KnownOne  |= NewBits;
2050     KnownOne = KnownOne.trunc(InBits);
2051     ComputeMaskedBits(Op.getOperand(0), KnownZero, KnownOne, Depth+1);
2053     KnownOne = KnownOne.zext(BitWidth);
2060     KnownOne = KnownOne.zext(InBits);
2061     ComputeMaskedBits(Op.getOperand(0), KnownZero, KnownOne, Depth+1);
2062     assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
2064     KnownOne = KnownOne.trunc(BitWidth);
2070     ComputeMaskedBits(Op.getOperand(0), KnownZero, KnownOne, Depth+1);
2072     KnownOne  &= (~KnownZero);
2139         KnownOne = KnownOne2 & LowBits;
2149           KnownOne |= ~LowBits;
2150         assert((KnownZero & KnownOne) == 0&&"Bits known to be one AND zero?");
2160         ComputeMaskedBits(Op.getOperand(0), KnownZero, KnownOne,Depth+1);
2161         assert((KnownZero & KnownOne) == 0&&"Bits known to be one AND zero?");
2168     ComputeMaskedBits(Op.getOperand(0), KnownZero, KnownOne, Depth+1);
2173     KnownOne.clearAllBits();
2194     TLI->computeMaskedBitsForTargetNode(Op, KnownZero, KnownOne, *this, Depth);
2319         APInt KnownZero, KnownOne;
2320         ComputeMaskedBits(Op.getOperand(0), KnownZero, KnownOne, Depth+1);
2344         APInt KnownZero, KnownOne;
2345         ComputeMaskedBits(Op.getOperand(1), KnownZero, KnownOne, Depth+1);
2398   APInt KnownZero, KnownOne;
2399   ComputeMaskedBits(Op, KnownZero, KnownOne, Depth);
2404   } else if (KnownOne.isNegative()) {  // sign bit is 1;
2405     Mask = KnownOne;
6379     APInt KnownZero(PtrWidth, 0), KnownOne(PtrWidth, 0);
6380     llvm::ComputeMaskedBits(const_cast<GlobalValue*>(GV), KnownZero, KnownOne,