Searched refs:isNegatedPowerOf2 (Results 1 – 21 of 21) sorted by relevance
845 else if (CI->getValue().isNegatedPowerOf2()) in getOperandInfo()869 else if (CI->getValue().isNegatedPowerOf2()) in getOperandInfo()877 AllNegPow2 &= CI->getValue().isNegatedPowerOf2(); in getOperandInfo()
601 if (IndexOffset.isNegatedPowerOf2()) { in emitBump()
467 CVal->getValue().isNegatedPowerOf2())) in getArithmeticInstrCost()
429 bool isNegatedPowerOf2() const { in isNegatedPowerOf2() function
623 bool isValue(const APInt &C) { return C.isNegatedPowerOf2(); } in isValue()635 bool isValue(const APInt &C) { return !C || C.isNegatedPowerOf2(); } in isValue()
618 MulConst->isNegatedPowerOf2() && MulConst->countr_zero() == NumBits; in canEvaluateShifted()
1781 if (NewC2.isNegatedPowerOf2()) { in foldICmpAndConstConst()1920 if (Cmp.getOperand(1) == Y && C.isNegatedPowerOf2()) { in foldICmpAndConstant()5638 (*C0 ^ *C1).isNegatedPowerOf2(); in foldICmpEquality()5842 if (Pred == ICmpInst::ICMP_ULT && C->isNegatedPowerOf2()) { in foldICmpWithTrunc()
2345 (InnerSub->hasNoUnsignedWrap() || C2->isNegatedPowerOf2())) { in visitSub()
231 if (Imm.isPowerOf2() || Imm.isNegatedPowerOf2()) in getIntImmCostInst()
1111 bool isNegatedPowerOf2() const { in isNegatedPowerOf2() function
354 C->getValue() == Imm && Imm.isNegative() && Imm.isNegatedPowerOf2()) { in isSSATMinMaxPattern()
329 (Op2Info.isPowerOf2() || Op2Info.isNegatedPowerOf2())) { in getArithmeticInstrCost()333 if (Op2Info.isNegatedPowerOf2()) in getArithmeticInstrCost()
22947 assert((Divisor.isPowerOf2() || Divisor.isNegatedPowerOf2()) && in BuildSDIVPow2()
4898 !(C.isPowerOf2() || C.isNegatedPowerOf2())) in selectSDiv()
1906 if (Divisor.isNegatedPowerOf2()) { in instCombineSVESDIV()
17954 !(Divisor.isPowerOf2() || Divisor.isNegatedPowerOf2())) in BuildSDIVPow2()17983 !(Divisor.isPowerOf2() || Divisor.isNegatedPowerOf2())) in BuildSREMPow2()
2887 if (UnmaskedC.isNegatedPowerOf2()) in SimplifyDemandedBits()5148 if (AndRHSC.isNegatedPowerOf2() && (AndRHSC & C1) == C1) { in SimplifySetCC()
4380 if (N1IsConst && !N1IsOpaqueConst && ConstValue1.isNegatedPowerOf2()) { in visitMUL()4776 if (C->getAPIntValue().isNegatedPowerOf2()) in isDivisorPowerOfTwo()
5488 (IsSigned && CI->getValue().isNegatedPowerOf2())); in matchDivByPow2()
16580 !(Divisor.isPowerOf2() || Divisor.isNegatedPowerOf2())) in BuildSDIVPow2()16586 bool IsNegPow2 = Divisor.isNegatedPowerOf2(); in BuildSDIVPow2()
7707 return CI->getValue().isNegatedPowerOf2(); in getOperandInfo()