Lines Matching refs:getAPInt
469 return SC->getAPInt().isNegative(); in isNonConstantNegative()
713 const APInt &LA = LC->getAPInt(); in CompareSCEVComplexity()
714 const APInt &RA = RC->getAPInt(); in CompareSCEVComplexity()
1459 APInt StartAI = StartC->getAPInt(); in proveNoWrapByVaryingStart()
1496 const APInt &C = ConstantTerm->getAPInt(); in extractConstantWithoutWrapping()
1577 return getConstant(SC->getAPInt().zext(getTypeSizeInBits(Ty))); in getZeroExtendExprImpl()
1745 const APInt &C = SC->getAPInt(); in getZeroExtendExprImpl()
1839 if (MulLHS->getAPInt().isPowerOf2()) in getZeroExtendExprImpl()
1842 MulLHS->getAPInt().logBase2(); in getZeroExtendExprImpl()
1913 return getConstant(SC->getAPInt().sext(getTypeSizeInBits(Ty))); in getSignExtendExprImpl()
2097 const APInt &C = SC->getAPInt(); in getSignExtendExprImpl()
2174 if (SC->getAPInt().isNegative()) in getAnyExtendExpr()
2249 AccumulatedConstant += Scale * C->getAPInt(); in CollectAddOperandsWithScales()
2258 Scale * cast<SCEVConstant>(Mul->getOperand(0))->getAPInt(); in CollectAddOperandsWithScales()
2343 APInt C = RHSC->getAPInt(); in willNotOverflow()
2465 const APInt &C = cast<SCEVConstant>(Ops[0])->getAPInt(); in StrengthenNoWrapFlags()
2537 Ops[0] = getConstant(LHSC->getAPInt() + RHSC->getAPInt()); in getAddExpr()
2667 auto C1 = cast<SCEVConstant>(AddExpr->getOperand(0))->getAPInt(); in getAddExpr()
2668 auto C2 = C->getAPInt(); in getAddExpr()
3130 Ops[0] = getConstant(LHSC->getAPInt() * RHSC->getAPInt()); in getMulExpr()
3404 if (RHSC->getAPInt().isPowerOf2()) { in getURemExpr()
3407 IntegerType::get(getContext(), RHSC->getAPInt().logBase2()); in getURemExpr()
3451 unsigned LZ = RHSC->getAPInt().countl_zero(); in getUDivExpr()
3455 if (!RHSC->getAPInt().isPowerOf2()) in getUDivExpr()
3463 const APInt &StepInt = Step->getAPInt(); in getUDivExpr()
3464 const APInt &DivInt = RHSC->getAPInt(); in getUDivExpr()
3484 const APInt &StartInt = StartC->getAPInt(); in getUDivExpr()
3530 DivisorConstant->getAPInt().umul_ov(RHSC->getAPInt(), Overflow); in getUDivExpr()
3559 return getConstant(LHSC->getAPInt().udiv(RHSC->getAPInt())); in getUDivExpr()
3575 APInt A = C1->getAPInt().abs(); in gcd()
3576 APInt B = C2->getAPInt().abs(); in gcd()
3617 cast<SCEVConstant>(getConstant(LHSCst->getAPInt().udiv(Factor))); in getUDivExactExpr()
3619 cast<SCEVConstant>(getConstant(RHSCst->getAPInt().udiv(Factor))); in getUDivExactExpr()
3880 getContext(), FoldOp(LHSC->getAPInt(), RHSC->getAPInt())); in getMinMaxExpr()
5091 const APInt &BECountAP = BECountMax->getAPInt(); in proveNoWrapViaConstantRanges()
6152 if (isa<SCEVConstant>(C) && cast<SCEVConstant>(C)->getAPInt().ule(1)) in createNodeForSelectOrPHIInstWithICmpInstCond()
6292 return cast<SCEVConstant>(S)->getAPInt(); in getConstantMultipleImpl()
6616 return setRange(C, SignHint, ConstantRange(C->getAPInt())); in getRangeRef()
6749 APInt MaxBECount = cast<SCEVConstant>(MaxBEScev)->getAPInt(); in getRangeRef()
7133 Offset = cast<SCEVConstant>(SA->getOperand(0))->getAPInt(); in getRangeViaFactoring()
7800 unsigned MulZeros = OpC->getAPInt().countr_zero(); in createSCEV()
7804 MulOps.push_back(getConstant(OpC->getAPInt().lshr(GCD))); in createSCEV()
9122 ConstantRange::makeExactICmpRegion(Pred, RHSC->getAPInt()); in computeExitLimitFromICmp()
9142 StrideC && StrideC->getAPInt().isPowerOf2()) { in computeExitLimitFromICmp()
9979 getConstantEvolutionLoopExitValue(PN, BTCC->getAPInt(), CurrLoop); in computeSCEVAtScope()
10119 APInt L = LC->getAPInt(); in GetQuadraticEquation()
10120 APInt M = MC->getAPInt(); in GetQuadraticEquation()
10121 APInt N = NC->getAPInt(); in GetQuadraticEquation()
10124 unsigned BitWidth = LC->getAPInt().getBitWidth(); in GetQuadraticEquation()
10445 bool CountDown = StepC->getAPInt().isNegative(); in howFarToZero()
10496 const SCEV *E = SolveLinEquationWithOverflow(StepC->getAPInt(), in howFarToZero()
10619 const APInt &RA = RC->getAPInt(); in SimplifyICmpOperands()
11225 OutC1 = cast<SCEVConstant>(XConstOp)->getAPInt(); in isKnownPredicateViaNoOverflow()
11226 OutC2 = cast<SCEVConstant>(YConstOp)->getAPInt(); in isKnownPredicateViaNoOverflow()
11782 if (Min == C->getAPInt()) { in isImpliedCondBalancedTypes()
11897 const auto &M = cast<SCEVConstant>(More)->getAPInt(); in computeConstantDifference()
11898 const auto &L = cast<SCEVConstant>(Less)->getAPInt(); in computeConstantDifference()
11910 return -(C1->getAPInt()); in computeConstantDifference()
11916 return C2->getAPInt(); in computeConstantDifference()
11920 return C2->getAPInt() - C1->getAPInt(); in computeConstantDifference()
12572 const APInt &ConstFoundRHS = cast<SCEVConstant>(FoundRHS)->getAPInt(); in isImpliedCondOperandsViaRanges()
12584 const APInt &ConstRHS = cast<SCEVConstant>(RHS)->getAPInt(); in isImpliedCondOperandsViaRanges()
12723 if (!StrideC || !StrideC->getAPInt().isPowerOf2()) in howManyLessThans()
13037 if (StrideC->getAPInt().isPowerOf2()) { in howManyLessThans()
13243 Range.subtract(SC->getAPInt()), SE); in getNumIterationsInRange()
13270 APInt A = cast<SCEVConstant>(getOperand(1))->getAPInt(); in getNumIterationsInRange()
14025 return SE.getConstant(Constant->getAPInt()); in verify()
15038 ConstantRange::makeExactICmpRegion(Predicate, C2->getAPInt()) in applyLoopGuards()
15039 .sub(C1->getAPInt()); in applyLoopGuards()
15065 if (C->getAPInt().isNegative()) in applyLoopGuards()
15084 ExprVal = ConstExpr->getAPInt(); in applyLoopGuards()
15085 DivisorVal = ConstDivisor->getAPInt(); in applyLoopGuards()