| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 91 const SCEV *Step = AR->getStepRecurrence(SE); in isOneDimensionalArray() 99 const SCEV *StepRec = AR->getStepRecurrence(SE); in isOneDimensionalArray() 436 const SCEV *StepRec = AccessFnAR ? AccessFnAR->getStepRecurrence(SE) : nullptr; in delinearize() 520 return AR->getStepRecurrence(SE); in getLastCoefficient() 542 const SCEV *Step = AR->getStepRecurrence(SE); in isSimpleAddRecurrence()
|
| H A D | DependenceAnalysis.cpp | 1007 const SCEV *Step = AddRec->getStepRecurrence(*SE); in checkSubscript() 2255 const SCEV *SrcCoeff = SrcAddRec->getStepRecurrence(*SE); in testSIV() 2256 const SCEV *DstCoeff = DstAddRec->getStepRecurrence(*SE); in testSIV() 2277 const SCEV *SrcCoeff = SrcAddRec->getStepRecurrence(*SE); in testSIV() 2287 const SCEV *DstCoeff = DstAddRec->getStepRecurrence(*SE); in testSIV() 2331 SrcCoeff = SrcAddRec->getStepRecurrence(*SE); in testRDIV() 2334 DstCoeff = DstAddRec->getStepRecurrence(*SE); in testRDIV() 2341 SrcCoeff = tmpAddRec->getStepRecurrence(*SE); in testRDIV() 2344 DstCoeff = SE->getNegativeSCEV(SrcAddRec->getStepRecurrence(*SE)); in testRDIV() 2354 DstCoeff = tmpAddRec->getStepRecurrence(*SE); in testRDIV() [all …]
|
| H A D | IVUsers.cpp | 70 !isInteresting(AR->getStepRecurrence(*SE), I, L, SE, LI); in isInteresting() 361 return AR->getStepRecurrence(*SE); in getStride()
|
| H A D | ScalarEvolutionDivision.cpp | 138 divide(SE, Numerator->getStepRecurrence(SE), Denominator, &StepQ, &StepR); in visitAddRecExpr()
|
| H A D | ScalarEvolution.cpp | 1337 const SCEV *Step = AR->getStepRecurrence(*SE); in getPreStartForExtend() 1416 return SE->getAddExpr((SE->*GetExtendExpr)(AR->getStepRecurrence(*SE), Ty, in getExtendAddRecStart() 1625 const SCEV *Step = AR->getStepRecurrence(*this); in getZeroExtendExprImpl() 1998 const SCEV *Step = AR->getStepRecurrence(*this); in getSignExtendExprImpl() 3429 dyn_cast<SCEVConstant>(AR->getStepRecurrence(*this))) { in getUDivExpr() 5032 return SE.getMinusSCEV(Expr, Expr->getStepRecurrence(SE)); in visitAddRecExpr() 5061 ConstantRange StepCR = getSignedRange(AR->getStepRecurrence(*this)); in proveNoWrapViaConstantRanges() 5072 ConstantRange IncRange = getSignedRange(AR->getStepRecurrence(*this)); in proveNoWrapViaConstantRanges() 5082 ConstantRange IncRange = getUnsignedRange(AR->getStepRecurrence(*this)); in proveNoWrapViaConstantRanges() 5107 const SCEV *Step = AR->getStepRecurrence(*this); in proveNoSignedWrapViaInduction() [all …]
|
| H A D | LoopAccessAnalysis.cpp | 227 const SCEV *Step = AR->getStepRecurrence(SE); in evaluatePtrAddRecAtMaxBTCWillNotWrap() 321 const SCEV *Step = AR->getStepRecurrence(*SE); in getStartAndEndForAccess() 458 SrcStartAR->getStepRecurrence(*SE) != in tryToCreateDiffCheck() 459 SinkStartAR->getStepRecurrence(*SE)) { in tryToCreateDiffCheck() 933 const SCEV *Step = AR->getStepRecurrence(*PSE.getSE()); in getStrideFromAddRec()
|
| H A D | Delinearization.cpp | 56 Strides.push_back(AR->getStepRecurrence(SE)); in follow()
|
| H A D | IVDescriptors.cpp | 724 const SCEV *Step = AR->getStepRecurrence(SE); in isFindIVPattern() 1624 const SCEV *Step = AR->getStepRecurrence(*SE); in isInductionPHI()
|
| H A D | Loads.cpp | 313 auto *Step = dyn_cast<SCEVConstant>(AddRec->getStepRecurrence(SE)); in isDereferenceableAndAlignedInLoop()
|
| H A D | LoopInfo.cpp | 278 if (const SCEV *StepRecur = StepAddRecExpr->getStepRecurrence(SE)) { in getDirection()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCLoopInstrFormPrep.cpp | 658 const SCEV *BasePtrIncSCEV = BasePtrSCEV->getStepRecurrence(*SE); in rewriteForBase() 835 if (cast<SCEVAddRecExpr>(B.BaseSCEV)->getStepRecurrence(*SE) != in addOneCandidate() 836 cast<SCEVAddRecExpr>(LSCEV)->getStepRecurrence(*SE)) in addOneCandidate() 1031 isa<SCEVConstant>(BasePtrSCEV->getStepRecurrence(*SE)) && in rewriteLoadStores() 1032 !cast<SCEVConstant>(BasePtrSCEV->getStepRecurrence(*SE)) in rewriteLoadStores() 1171 const SCEV *PHIBasePtrIncSCEV = PHIBasePtrSCEV->getStepRecurrence(*SE); in getNodeForInc() 1240 dyn_cast<SCEVConstant>(PHIBasePtrSCEV->getStepRecurrence(*SE)); in alreadyPrepared() 1326 dyn_cast<SCEVConstant>(LARSCEV->getStepRecurrence(*SE))) { in runOnLoop()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPredication.cpp | 643 RC.IV->getStepRecurrence(*SE)->isOne() && in normalizePredicate() 679 const SCEV *Step = RangeCheckIV->getStepRecurrence(*SE); in widenICmpRangeCheck() 699 CurrLatchCheck.IV->getStepRecurrence(*SE)->getType() && in widenICmpRangeCheck() 701 if (Step != CurrLatchCheck.IV->getStepRecurrence(*SE)) { in widenICmpRangeCheck() 847 const SCEV *Step = Result->IV->getStepRecurrence(*SE); in parseLoopLatchICmp()
|
| H A D | LoopDataPrefetch.cpp | 161 const auto *ConstStride = dyn_cast<SCEVConstant>(AR->getStepRecurrence(*SE)); in isStrideLargeEnough() 396 P.LSCEVAddRec->getStepRecurrence(*SE))); in runOnLoop()
|
| H A D | AlignmentFromAssumptions.cpp | 117 const SCEV *DiffIncSCEV = DiffARSCEV->getStepRecurrence(*SE); in getNewAlignment()
|
| H A D | LoopTermFold.cpp | 157 !SE.isKnownNonZero(AddRec->getStepRecurrence(SE))) in canFoldTermCondOfLoop()
|
| H A D | InductiveRangeCheckElimination.cpp | 514 IRC.Step = IndexAddRec->getStepRecurrence(SE); in extractRangeChecksFromCond() 706 NoopOrExtend(IndVar->getStepRecurrence(SE), RCType, SE, IsLatchSigned)); in computeSafeIterationSpace()
|
| H A D | LoopBoundSplit.cpp | 141 const SCEV *StepRecSCEV = Cond.AddRecSCEV->getStepRecurrence(SE); in hasProcessableCondition()
|
| H A D | LoopIdiomRecognize.cpp | 1660 if (!isa<SCEVConstant>(AddRecEv->getStepRecurrence(*SE))) in isValidStrlenIdiom() 1793 dyn_cast<SCEVConstant>(AddRecEv->getStepRecurrence(*SE)); in recognizeAndInsertStrLen()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopConstrainer.cpp | 209 SE.getSignExtendExpr(AR->getStepRecurrence(SE), WideTy); in parseLoopStructure() 212 ExtendAfterOp->getStepRecurrence(SE) == ExtendedStep; in parseLoopStructure() 234 const SCEV *StepRec = IndVarBase->getStepRecurrence(SE); in parseLoopStructure() 250 const SCEV *Addend = SE.getNegativeSCEV(IndVarBase->getStepRecurrence(SE)); in parseLoopStructure()
|
| H A D | ScalarEvolutionExpander.cpp | 932 const SCEV *Step = AR->getStepRecurrence(SE); in IsIncrementNSW() 946 const SCEV *Step = AR->getStepRecurrence(SE); in IsIncrementNUW() 1077 const SCEV *Step = Normalized->getStepRecurrence(SE); in getAddRecExprPHILiterally() 1150 const SCEV *Step = Normalized->getStepRecurrence(SE); in expandAddRecExprLiterally() 2097 const SCEV *Step = AR->getStepRecurrence(SE); in generateOverflowCheck()
|
| H A D | LoopPeel.cpp | 487 const SCEV *Step = LeftAR->getStepRecurrence(SE); in countToEliminateCompares() 530 const SCEV *Step = AddRec->getStepRecurrence(SE); in countToEliminateCompares()
|
| H A D | LoopUtils.cpp | 1899 const SCEV *Recur = LowAR->getStepRecurrence(SE); in expandBounds() 1900 if (Recur == HighAR->getStepRecurrence(SE) && in expandBounds()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolutionExpressions.h | 366 const SCEV *getStepRecurrence(ScalarEvolution &SE) const { in getStepRecurrence() function
|
| H A D | TargetTransformInfoImpl.h | 1212 return dyn_cast<SCEVConstant>(AddRec->getStepRecurrence(*SE)); in getConstantStrideStep()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorizationLegality.cpp | 511 const SCEV *Step = Expr->getStepRecurrence(SE); in visitAddRecExpr()
|