261 static bool isKnownToBeAPowerOfTwo(const Value *V, bool OrZero, unsigned Depth,
265                                   bool OrZero, unsigned Depth,  in isKnownToBeAPowerOfTwo()  argument
269       V, OrZero, Depth,  in isKnownToBeAPowerOfTwo()
1873 static bool isPowerOfTwoRecurrence(const PHINode *PN, bool OrZero,  in isPowerOfTwoRecurrence()  argument
1886       if (!isKnownToBeAPowerOfTwo(Start, OrZero, Depth, Q))  in isPowerOfTwoRecurrence()
1900     return (OrZero || Q.IIQ.hasNoUnsignedWrap(BO) ||  in isPowerOfTwoRecurrence()
1902            isKnownToBeAPowerOfTwo(Step, OrZero, Depth, Q);  in isPowerOfTwoRecurrence()
1913     return (OrZero || Q.IIQ.isExact(BO)) &&  in isPowerOfTwoRecurrence()
1916     return OrZero || Q.IIQ.hasNoUnsignedWrap(BO) || Q.IIQ.hasNoSignedWrap(BO);  in isPowerOfTwoRecurrence()
1922     return OrZero || Q.IIQ.isExact(BO);  in isPowerOfTwoRecurrence()
1932 bool isKnownToBeAPowerOfTwo(const Value *V, bool OrZero, unsigned Depth,  in isKnownToBeAPowerOfTwo()  argument
1937     return OrZero ? match(V, m_Power2OrZero()) : match(V, m_Power2());  in isKnownToBeAPowerOfTwo()
1940   if (OrZero && V->getType()->getScalarSizeInBits() == 1)  in isKnownToBeAPowerOfTwo()
1969     return isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Depth, Q);  in isKnownToBeAPowerOfTwo()
1971     return OrZero && isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Depth, Q);  in isKnownToBeAPowerOfTwo()
1973     if (OrZero || Q.IIQ.hasNoUnsignedWrap(I) || Q.IIQ.hasNoSignedWrap(I))  in isKnownToBeAPowerOfTwo()
1974       return isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Depth, Q);  in isKnownToBeAPowerOfTwo()
1977     if (OrZero || Q.IIQ.isExact(cast<BinaryOperator>(I)))  in isKnownToBeAPowerOfTwo()
1978       return isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Depth, Q);  in isKnownToBeAPowerOfTwo()
1982       return isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Depth, Q);  in isKnownToBeAPowerOfTwo()
1985     return isKnownToBeAPowerOfTwo(I->getOperand(1), OrZero, Depth, Q) &&  in isKnownToBeAPowerOfTwo()
1986            isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Depth, Q) &&  in isKnownToBeAPowerOfTwo()
1987            (OrZero || isKnownNonZero(I, Depth, Q));  in isKnownToBeAPowerOfTwo()
1990     if (OrZero &&  in isKnownToBeAPowerOfTwo()
1997       return OrZero || isKnownNonZero(I->getOperand(0), Depth, Q);  in isKnownToBeAPowerOfTwo()
2003     if (OrZero || Q.IIQ.hasNoUnsignedWrap(VOBO) ||  in isKnownToBeAPowerOfTwo()
2007           isKnownToBeAPowerOfTwo(I->getOperand(1), OrZero, Depth, Q))  in isKnownToBeAPowerOfTwo()
2011           isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Depth, Q))  in isKnownToBeAPowerOfTwo()
2026         if (OrZero || RHSBits.One.getBoolValue() || LHSBits.One.getBoolValue())  in isKnownToBeAPowerOfTwo()
2032     return isKnownToBeAPowerOfTwo(I->getOperand(1), OrZero, Depth, Q) &&  in isKnownToBeAPowerOfTwo()
2033            isKnownToBeAPowerOfTwo(I->getOperand(2), OrZero, Depth, Q);  in isKnownToBeAPowerOfTwo()
2042     if (isPowerOfTwoRecurrence(PN, OrZero, Depth, RecQ))  in isKnownToBeAPowerOfTwo()
2056       return isKnownToBeAPowerOfTwo(U.get(), OrZero, NewDepth, RecQ);  in isKnownToBeAPowerOfTwo()
2067         return isKnownToBeAPowerOfTwo(II->getArgOperand(1), OrZero, Depth, Q) &&  in isKnownToBeAPowerOfTwo()
2068                isKnownToBeAPowerOfTwo(II->getArgOperand(0), OrZero, Depth, Q);  in isKnownToBeAPowerOfTwo()
2073         return isKnownToBeAPowerOfTwo(II->getArgOperand(0), OrZero, Depth, Q);  in isKnownToBeAPowerOfTwo()
2078           return isKnownToBeAPowerOfTwo(II->getArgOperand(0), OrZero, Depth, Q);  in isKnownToBeAPowerOfTwo()