Lines Matching refs:getAPInt

436   return SC->getAPInt().isNegative();  in isNonConstantNegative()
727 const APInt &LA = LC->getAPInt(); in CompareSCEVComplexity()
728 const APInt &RA = RC->getAPInt(); in CompareSCEVComplexity()
1463 APInt StartAI = StartC->getAPInt(); in proveNoWrapByVaryingStart()
1500 const APInt &C = ConstantTerm->getAPInt(); in extractConstantWithoutWrapping()
1715 const APInt &C = SC->getAPInt(); in getZeroExtendExpr()
1808 if (MulLHS->getAPInt().isPowerOf2()) in getZeroExtendExpr()
1811 MulLHS->getAPInt().logBase2(); in getZeroExtendExpr()
2030 const APInt &C = SC->getAPInt(); in getSignExtendExpr()
2078 if (SC->getAPInt().isNegative()) in getAnyExtendExpr()
2154 AccumulatedConstant += Scale * C->getAPInt(); in CollectAddOperandsWithScales()
2163 Scale * cast<SCEVConstant>(Mul->getOperand(0))->getAPInt(); in CollectAddOperandsWithScales()
2250 const APInt &C = cast<SCEVConstant>(Ops[0])->getAPInt(); in StrengthenNoWrapFlags()
2301 Ops[0] = getConstant(LHSC->getAPInt() + RHSC->getAPInt()); in getAddExpr()
2819 Ops[0] = getConstant(LHSC->getAPInt() * RHSC->getAPInt()); in getMulExpr()
3072 if (RHSC->getAPInt().isPowerOf2()) { in getURemExpr()
3075 IntegerType::get(getContext(), RHSC->getAPInt().logBase2()); in getURemExpr()
3113 unsigned LZ = RHSC->getAPInt().countLeadingZeros(); in getUDivExpr()
3117 if (!RHSC->getAPInt().isPowerOf2()) in getUDivExpr()
3125 const APInt &StepInt = Step->getAPInt(); in getUDivExpr()
3126 const APInt &DivInt = RHSC->getAPInt(); in getUDivExpr()
3146 const APInt &StartInt = StartC->getAPInt(); in getUDivExpr()
3193 DivisorConstant->getAPInt().umul_ov(RHSC->getAPInt(), Overflow); in getUDivExpr()
3242 APInt A = C1->getAPInt().abs(); in gcd()
3243 APInt B = C2->getAPInt().abs(); in gcd()
3285 cast<SCEVConstant>(getConstant(LHSCst->getAPInt().udiv(Factor))); in getUDivExactExpr()
3287 cast<SCEVConstant>(getConstant(RHSCst->getAPInt().udiv(Factor))); in getUDivExactExpr()
3535 getContext(), FoldOp(LHSC->getAPInt(), RHSC->getAPInt())); in getMinMaxExpr()
5525 return C->getAPInt().countTrailingZeros(); in GetMinTrailingZerosImpl()
5649 return setRange(C, SignHint, ConstantRange(C->getAPInt())); in getRangeRef()
6085 Offset = cast<SCEVConstant>(SA->getOperand(0))->getAPInt(); in getRangeViaFactoring()
6484 unsigned MulZeros = OpC->getAPInt().countTrailingZeros(); in createSCEV()
6488 MulOps.push_back(getConstant(OpC->getAPInt().lshr(GCD))); in createSCEV()
7693 ConstantRange::makeExactICmpRegion(Pred, RHSC->getAPInt()); in computeExitLimitFromICmp()
8497 PN, BTCC->getAPInt(), CurrLoop); in computeSCEVAtScope()
8766 APInt L = LC->getAPInt(); in GetQuadraticEquation()
8767 APInt M = MC->getAPInt(); in GetQuadraticEquation()
8768 APInt N = NC->getAPInt(); in GetQuadraticEquation()
8771 unsigned BitWidth = LC->getAPInt().getBitWidth(); in GetQuadraticEquation()
9087 bool CountDown = StepC->getAPInt().isNegative(); in howFarToZero()
9135 const SCEV *E = SolveLinEquationWithOverflow(StepC->getAPInt(), in howFarToZero()
9255 const APInt &RA = RC->getAPInt(); in SimplifyICmpOperands()
9740 OutY = cast<SCEVConstant>(ConstOp)->getAPInt(); in isKnownPredicateViaNoOverflow()
10237 if (Min == C->getAPInt()) { in isImpliedCondBalancedTypes()
10351 const auto &M = cast<SCEVConstant>(More)->getAPInt(); in computeConstantDifference()
10352 const auto &L = cast<SCEVConstant>(Less)->getAPInt(); in computeConstantDifference()
10364 return -(C1->getAPInt()); in computeConstantDifference()
10370 return C2->getAPInt(); in computeConstantDifference()
10374 return C2->getAPInt() - C1->getAPInt(); in computeConstantDifference()
10979 const APInt &ConstFoundRHS = cast<SCEVConstant>(FoundRHS)->getAPInt(); in isImpliedCondOperandsViaRanges()
10991 const APInt &ConstRHS = cast<SCEVConstant>(RHS)->getAPInt(); in isImpliedCondOperandsViaRanges()
11343 Range.subtract(SC->getAPInt()), SE); in getNumIterationsInRange()
11370 APInt A = cast<SCEVConstant>(getOperand(1))->getAPInt(); in getNumIterationsInRange()
12512 return SE.getConstant(Constant->getAPInt()); in verify()