| /freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 90 const SCEV *Step = AR->getStepRecurrence(SE); in isOneDimensionalArray() 98 const SCEV *StepRec = AR->getStepRecurrence(SE); in isOneDimensionalArray() 368 const SCEV *StepRec = AccessFnAR ? AccessFnAR->getStepRecurrence(SE) : nullptr; in delinearize() 431 return AR->getStepRecurrence(SE); in getLastCoefficient() 453 const SCEV *Step = AR->getStepRecurrence(SE); in isSimpleAddRecurrence()
|
| H A D | DependenceAnalysis.cpp | 895 const SCEV *Step = AddRec->getStepRecurrence(*SE); in checkSubscript() 2227 SrcCoeff = SrcAddRec->getStepRecurrence(*SE); in testRDIV() 2230 DstCoeff = DstAddRec->getStepRecurrence(*SE); in testRDIV() 2237 SrcCoeff = tmpAddRec->getStepRecurrence(*SE); in testRDIV() 2250 DstCoeff = tmpAddRec->getStepRecurrence(*SE); in testRDIV() 2331 const SCEV *Coeff = AddRec->getStepRecurrence(*SE); in gcdMIVtest() 2350 const SCEV *Coeff = AddRec->getStepRecurrence(*SE); in gcdMIVtest() 2428 const SCEV *Coeff = AddRec->getStepRecurrence(*SE); in gcdMIVtest() 2914 CI[K].Coeff = AddRec->getStepRecurrence(*SE); in collectCoeffInfo() 2989 return AddRec->getStepRecurrence(*SE); in findCoefficient() [all …]
|
| H A D | IVUsers.cpp | 74 !isInteresting(AR->getStepRecurrence(*SE), I, L, SE, LI); in isInteresting() 414 return AR->getStepRecurrence(*SE); in getStride()
|
| H A D | ScalarEvolutionDivision.cpp | 136 divide(SE, Numerator->getStepRecurrence(SE), Denominator, &StepQ, &StepR); in visitAddRecExpr()
|
| H A D | ScalarEvolution.cpp | 1383 const SCEV *Step = AR->getStepRecurrence(*SE); in getPreStartForExtend() 1630 const SCEV *Step = AR->getStepRecurrence(*this); in getZeroExtendExpr() 4669 const SCEV *Step = AR->getStepRecurrence(*this); in proveNoSignedWrapViaInduction() 4718 const SCEV *Step = AR->getStepRecurrence(*this); in proveNoUnsignedWrapViaInduction() 5249 !areExprsEqual(AR1->getStepRecurrence(SE), AR2->getStepRecurrence(SE))) in areAddRecsEqualWithPreds() 10087 const SCEV *Step = AR->getStepRecurrence(*this); in getLoopInvariantExitCondDuringFirstIterations() 10815 if (LAR->getStepRecurrence(*this) != MAR->getStepRecurrence(*this)) in computeConstantDifference() 11140 if (LAR->getStepRecurrence(SE) != RAR->getStepRecurrence(SE)) in IsKnownPredicateViaAddRecStart() 12164 Strides.push_back(AR->getStepRecurrence(SE)); in follow() 13443 const SCEV *Step = AR->getStepRecurrence(SE); in visitZeroExtendExpr() [all …]
|
| H A D | Loads.cpp | 296 auto* Step = dyn_cast<SCEVConstant>(AddRec->getStepRecurrence(SE)); in isDereferenceableAndAlignedInLoop()
|
| H A D | LoopAccessAnalysis.cpp | 213 const SCEV *Step = AR->getStepRecurrence(*SE); in insert() 1092 const SCEV *Step = AR->getStepRecurrence(*PSE.getSE()); in getPtrStride()
|
| H A D | LoopInfo.cpp | 277 if (const SCEV *StepRecur = StepAddRecExpr->getStepRecurrence(SE)) { in getDirection()
|
| H A D | IVDescriptors.cpp | 1245 const SCEV *Step = AR->getStepRecurrence(*SE); in isInductionPHI()
|
| H A D | VectorUtils.cpp | 229 V = S->getStepRecurrence(*SE); in getStrideFromPointer()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPredication.cpp | 665 RC.IV->getStepRecurrence(*SE)->isOne() && in normalizePredicate() 702 auto *Step = RangeCheckIV->getStepRecurrence(*SE); in widenICmpRangeCheck() 722 CurrLatchCheck.IV->getStepRecurrence(*SE)->getType() && in widenICmpRangeCheck() 724 if (Step != CurrLatchCheck.IV->getStepRecurrence(*SE)) { in widenICmpRangeCheck() 886 auto *Step = Result->IV->getStepRecurrence(*SE); in parseLoopLatchICmp()
|
| H A D | LoopDataPrefetch.cpp | 161 const auto *ConstStride = dyn_cast<SCEVConstant>(AR->getStepRecurrence(*SE)); in isStrideLargeEnough() 389 P.LSCEVAddRec->getStepRecurrence(*SE))); in runOnLoop()
|
| H A D | InductiveRangeCheckElimination.cpp | 404 IRC.Step = IndexAddRec->getStepRecurrence(SE); in extractRangeChecksFromCond() 833 SE.getSignExtendExpr(AR->getStepRecurrence(SE), WideTy); in parseLoopStructure() 836 ExtendAfterOp->getStepRecurrence(SE) == ExtendedStep; in parseLoopStructure() 854 const SCEV* StepRec = IndVarBase->getStepRecurrence(SE); in parseLoopStructure() 870 const SCEV *Addend = SE.getNegativeSCEV(IndVarBase->getStepRecurrence(SE)); in parseLoopStructure() 1616 NoopOrExtend(IndVar->getStepRecurrence(SE), RCType, SE, IsLatchSigned)); in computeSafeIterationSpace()
|
| H A D | AlignmentFromAssumptions.cpp | 167 const SCEV *DiffIncSCEV = DiffARSCEV->getStepRecurrence(*SE); in getNewAlignment()
|
| H A D | LoopBoundSplit.cpp | 135 const SCEV *StepRecSCEV = AddRecSCEV->getStepRecurrence(SE); in hasProcessableCondition()
|
| H A D | LoopStrengthReduce.cpp | 427 AR->getStepRecurrence(SE), in DoInitialMatch() 716 const SCEV *Step = getExactSDiv(AR->getStepRecurrence(SE), RHS, SE, in getExactSDiv() 1296 if (auto *Step = dyn_cast<SCEVConstant>(AR->getStepRecurrence(*SE))) in RateRegister() 1300 const SCEV *LoopStep = AR->getStepRecurrence(*SE); in RateRegister() 2340 AR->getStepRecurrence(SE) != One) in OptimizeMax() 2705 Strides.insert(AR->getStepRecurrence(SE)); in CollectInterestingTypesAndFactors() 3570 AR->getStepRecurrence(SE), in CollectSubexprs() 3603 const SCEV *LoopStep = AR->getStepRecurrence(SE); in mayUsePostIncMode() 3863 dyn_cast<SCEVConstant>(GAR->getStepRecurrence(SE))) { in GenerateConstantOffsetsImpl() 6067 const SCEV *Stride = SAR.getStepRecurrence(SE); in SCEVToValueExpr() [all …]
|
| H A D | LoopRerollPass.cpp | 599 auto IncSCEV = dyn_cast<SCEVConstant>(PHISCEV->getStepRecurrence(*SE)); in collectPossibleIVs() 917 if (ADR->getStepRecurrence(*SE) != SE->getMulExpr(StepSCEV, ScaleSCEV)) in validateRootSet()
|
| H A D | IndVarSimplify.cpp | 872 const SCEV *Step = dyn_cast<SCEVConstant>(AR->getStepRecurrence(*SE)); in isLoopCounter() 1023 assert(AR->getStepRecurrence(*SE)->isOne() && "only handles unit stride"); in genLoopLimit()
|
| H A D | LoopInterchange.cpp | 311 const SCEV *Step = AddRec->getStepRecurrence(*SE); in getInductionVariable()
|
| H A D | LoopFuse.cpp | 1042 bool Pos = SE.isKnownPositive(Expr->getStepRecurrence(SE)); in visitAddRecExpr()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | ScalarEvolutionExpander.cpp | 344 const SCEV *Step = A->getStepRecurrence(SE); in FactorOutConstant() 405 A->getStepRecurrence(SE), in SplitAddRecs() 935 A->getStepRecurrence(SE), in ExposePointerBase() 1186 const SCEV *Step = AR->getStepRecurrence(SE); in IsIncrementNSW() 1200 const SCEV *Step = AR->getStepRecurrence(SE); in IsIncrementNUW() 1341 const SCEV *Step = Normalized->getStepRecurrence(SE); in getAddRecExprPHILiterally() 1424 SE.getAddRecExpr(Start, Normalized->getStepRecurrence(SE), in expandAddRecExprLiterally() 1430 const SCEV *Step = Normalized->getStepRecurrence(SE); in expandAddRecExprLiterally() 2509 const SCEV *Step = AR->getStepRecurrence(SE); in generateOverflowCheck() 2702 const SCEV *Step = AR->getStepRecurrence(SE); in follow()
|
| H A D | LoopPeel.cpp | 250 const SCEV *Step = LeftAR->getStepRecurrence(SE); in countToEliminateCompares()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCLoopInstrFormPrep.cpp | 519 dyn_cast<SCEVConstant>(BasePtrSCEV->getStepRecurrence(*SE)); in rewriteLoadStores() 764 dyn_cast<SCEVConstant>(PHIBasePtrSCEV->getStepRecurrence(*SE)); in alreadyPrepared() 850 dyn_cast<SCEVConstant>(LARSCEV->getStepRecurrence(*SE))) { in runOnLoop()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolutionExpressions.h | 370 const SCEV *getStepRecurrence(ScalarEvolution &SE) const { in getStepRecurrence() function
|
| H A D | TargetTransformInfoImpl.h | 830 return dyn_cast<SCEVConstant>(AddRec->getStepRecurrence(*SE)); in getConstantStrideStep()
|