451   return SC->getAPInt().isNegative();  in isNonConstantNegative()
746     const APInt &LA = LC->getAPInt();  in CompareSCEVComplexity()
747     const APInt &RA = RC->getAPInt();  in CompareSCEVComplexity()
1527   APInt StartAI = StartC->getAPInt();  in proveNoWrapByVaryingStart()
1564   const APInt &C = ConstantTerm->getAPInt();  in extractConstantWithoutWrapping()
1778         const APInt &C = SC->getAPInt();  in getZeroExtendExpr()
1872         if (MulLHS->getAPInt().isPowerOf2())  in getZeroExtendExpr()
1875                                MulLHS->getAPInt().logBase2();  in getZeroExtendExpr()
2096         const APInt &C = SC->getAPInt();  in getSignExtendExpr()
2161     if (SC->getAPInt().isNegative())  in getAnyExtendExpr()
2237     AccumulatedConstant += Scale * C->getAPInt();  in CollectAddOperandsWithScales()
2246           Scale * cast<SCEVConstant>(Mul->getOperand(0))->getAPInt();  in CollectAddOperandsWithScales()
2411     const APInt &C = cast<SCEVConstant>(Ops[0])->getAPInt();  in StrengthenNoWrapFlags()
2483       Ops[0] = getConstant(LHSC->getAPInt() + RHSC->getAPInt());  in getAddExpr()
2613       auto C1 = cast<SCEVConstant>(AddExpr->getOperand(0))->getAPInt();  in getAddExpr()
2614       auto C2 = C->getAPInt();  in getAddExpr()
3078       Ops[0] = getConstant(LHSC->getAPInt() * RHSC->getAPInt());  in getMulExpr()
3332     if (RHSC->getAPInt().isPowerOf2()) {  in getURemExpr()
3335           IntegerType::get(getContext(), RHSC->getAPInt().logBase2());  in getURemExpr()
3379       unsigned LZ = RHSC->getAPInt().countLeadingZeros();  in getUDivExpr()
3383       if (!RHSC->getAPInt().isPowerOf2())  in getUDivExpr()
3391           const APInt &StepInt = Step->getAPInt();  in getUDivExpr()
3392           const APInt &DivInt = RHSC->getAPInt();  in getUDivExpr()
3412             const APInt &StartInt = StartC->getAPInt();  in getUDivExpr()
3458               DivisorConstant->getAPInt().umul_ov(RHSC->getAPInt(), Overflow);  in getUDivExpr()
3487         return getConstant(LHSC->getAPInt().udiv(RHSC->getAPInt()));  in getUDivExpr()
3503   APInt A = C1->getAPInt().abs();  in gcd()
3504   APInt B = C2->getAPInt().abs();  in gcd()
3545             cast<SCEVConstant>(getConstant(LHSCst->getAPInt().udiv(Factor)));  in getUDivExactExpr()
3547             cast<SCEVConstant>(getConstant(RHSCst->getAPInt().udiv(Factor)));  in getUDivExactExpr()
3805           getContext(), FoldOp(LHSC->getAPInt(), RHSC->getAPInt()));  in getMinMaxExpr()
6045       if (isa<SCEVConstant>(C) && cast<SCEVConstant>(C)->getAPInt().ule(1))  in createNodeForSelectOrPHIInstWithICmpInstCond()
6170     return C->getAPInt().countTrailingZeros();  in GetMinTrailingZerosImpl()
6413     return setRange(C, SignHint, ConstantRange(C->getAPInt()));  in getRangeRef()
6864         Offset = cast<SCEVConstant>(SA->getOperand(0))->getAPInt();  in getRangeViaFactoring()
7575               unsigned MulZeros = OpC->getAPInt().countTrailingZeros();  in createSCEV()
7579               MulOps.push_back(getConstant(OpC->getAPInt().lshr(GCD)));  in createSCEV()
8006       if (Step->getAPInt().getActiveBits() > 32 ||  in getConstantMaxTripCountFromArray()
8007           Step->getAPInt().getZExtValue() !=  in getConstantMaxTripCountFromArray()
8008               ElemSize->getAPInt().getZExtValue() ||  in getConstantMaxTripCountFromArray()
8009           Step->isZero() || Step->getAPInt().isNegative())  in getConstantMaxTripCountFromArray()
8033       if (!MaxExeCount || MaxExeCount->getAPInt().getActiveBits() > 32)  in getConstantMaxTripCountFromArray()
8043       if (!InferCount || InferCount->getAPInt().getActiveBits() > 32)  in getConstantMaxTripCountFromArray()
8895             ConstantRange::makeExactICmpRegion(Pred, RHSC->getAPInt());  in computeExitLimitFromICmp()
8915           StrideC && StrideC->getAPInt().isPowerOf2()) {  in computeExitLimitFromICmp()
9630                 PN, BTCC->getAPInt(), CurrLoop);  in computeSCEVAtScope()
9873   APInt L = LC->getAPInt();  in GetQuadraticEquation()
9874   APInt M = MC->getAPInt();  in GetQuadraticEquation()
9875   APInt N = NC->getAPInt();  in GetQuadraticEquation()
9878   unsigned BitWidth = LC->getAPInt().getBitWidth();  in GetQuadraticEquation()
10194   bool CountDown = StepC->getAPInt().isNegative();  in howFarToZero()
10241   const SCEV *E = SolveLinEquationWithOverflow(StepC->getAPInt(),  in howFarToZero()
10365     const APInt &RA = RC->getAPInt();  in SimplifyICmpOperands()
10917     OutC1 = cast<SCEVConstant>(XConstOp)->getAPInt();  in isKnownPredicateViaNoOverflow()
10918     OutC2 = cast<SCEVConstant>(YConstOp)->getAPInt();  in isKnownPredicateViaNoOverflow()
11474     if (Min == C->getAPInt()) {  in isImpliedCondBalancedTypes()
11586     const auto &M = cast<SCEVConstant>(More)->getAPInt();  in computeConstantDifference()
11587     const auto &L = cast<SCEVConstant>(Less)->getAPInt();  in computeConstantDifference()
11599         return -(C1->getAPInt());  in computeConstantDifference()
11605         return C2->getAPInt();  in computeConstantDifference()
11609     return C2->getAPInt() - C1->getAPInt();  in computeConstantDifference()
12260   const APInt &ConstFoundRHS = cast<SCEVConstant>(FoundRHS)->getAPInt();  in isImpliedCondOperandsViaRanges()
12272   const APInt &ConstRHS = cast<SCEVConstant>(RHS)->getAPInt();  in isImpliedCondOperandsViaRanges()
12411     if (!StrideC || !StrideC->getAPInt().isPowerOf2())  in howManyLessThans()
12723         if (StrideC->getAPInt().isPowerOf2()) {  in howManyLessThans()
12923             Range.subtract(SC->getAPInt()), SE);  in getNumIterationsInRange()
12950     APInt A = cast<SCEVConstant>(getOperand(1))->getAPInt();  in getNumIterationsInRange()
13692       return SE.getConstant(Constant->getAPInt());  in verify()
14599           ConstantRange::makeExactICmpRegion(Predicate, C2->getAPInt())  in applyLoopGuards()
14600               .sub(C1->getAPInt());  in applyLoopGuards()