| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | ScalarEvolutionNormalization.cpp | 55 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap); in visitAddRecExpr() 94 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap); in visitAddRecExpr() 101 return Loops.count(AR->getLoop()); in normalizeForPostIncUse() 115 return Loops.count(AR->getLoop()); in denormalizeForPostIncUse()
|
| H A D | DependenceAnalysis.cpp | 2233 SrcLoop = SrcAddRec->getLoop(); in testRDIV() 2236 DstLoop = DstAddRec->getLoop(); in testRDIV() 2243 SrcLoop = tmpAddRec->getLoop(); in testRDIV() 2246 DstLoop = SrcAddRec->getLoop(); in testRDIV() 2256 DstLoop = tmpAddRec->getLoop(); in testRDIV() 2259 SrcLoop = DstAddRec->getLoop(); in testRDIV() 2434 if (CurLoop == AddRec->getLoop()) in gcdMIVtest() 2451 if (CurLoop == AddRec->getLoop()) in gcdMIVtest() 2917 const Loop *L = AddRec->getLoop(); in collectCoeffInfo() 2993 if (AddRec->getLoop() == TargetLoop) in findCoefficient() [all …]
|
| H A D | IVUsers.cpp | 66 if (AR->getLoop() == L) in isInteresting() 257 auto *L = AR->getLoop(); in AddUsersImpl() 397 if (AR->getLoop() == L) in findAddRecForLoop()
|
| H A D | ScalarEvolution.cpp | 684 const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop(); in CompareSCEVComplexity() 1402 const Loop *L = AR->getLoop(); in getPreStartForExtend() 4241 if (Expr->getLoop() == L) in visitAddRecExpr() 4282 if (Expr->getLoop() == L) in visitAddRecExpr() 9110 const Loop *L = LHS->getLoop(); in isKnownOnEveryIteration() 9797 if (LAR->getLoop() != MAR->getLoop()) in computeConstantDifference() 9862 if (L != AddRecLHS->getLoop()) in isImpliedCondOperandsViaNoOverflow() 10002 auto *RLoop = RAR->getLoop(); in isImpliedViaMerge() 10101 if (LAR->getLoop() != RAR->getLoop()) in IsKnownPredicateViaAddRecStart() 11585 if (AR->getLoop() == L) in computeLoopDisposition() [all …]
|
| H A D | ScalarEvolutionExpander.cpp | 300 S = SE.getAddRecExpr(Start, Step, A->getLoop(), in FactorOutConstant() 353 A->getLoop(), in SplitAddRecs() 632 L = AR->getLoop(); in getRelevantLoop() 863 A->getLoop(), in ExposePointerBase() 1321 const Loop *L = S->getLoop(); in expandAddRecExprLiterally() 1340 Normalized->getLoop(), in expandAddRecExprLiterally() 1359 Start, Step, Normalized->getLoop(), in expandAddRecExprLiterally() 1470 const Loop *L = S->getLoop(); in visitAddRecExpr() 1486 Value *V = expand(SE.getAddRecExpr(NewOps, S->getLoop(), in visitAddRecExpr() 2155 SE.getPredicatedBackedgeTakenCount(AR->getLoop(), Pred); in generateOverflowCheck() [all …]
|
| H A D | LoopUnrollAnalyzer.cpp | 39 if (!AR || AR->getLoop() != L) in simplifyInstWithSCEV()
|
| H A D | IVDescriptors.cpp | 915 const Loop *L = AR->getLoop(); in getCastsForInductionPHI() 1042 if (AR->getLoop() != TheLoop) { in isInductionPHI() 1051 Phi->getIncomingValueForBlock(AR->getLoop()->getLoopPreheader()); in isInductionPHI()
|
| H A D | LoopAccessAnalysis.cpp | 984 return OpAR->getLoop() == L && OpAR->getNoWrapFlags(SCEV::FlagNSW); in isNoWrapAddRec() 1018 if (Lp != AR->getLoop()) { in getPtrStride()
|
| /freebsd-12.1/contrib/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolutionExpressions.h | 301 const Loop *getLoop() const { return L; } in getLoop() function 311 getLoop(), FlagAnyWrap); in getStepRecurrence() 660 : SE.getAddRecExpr(Operands, Expr->getLoop(), in visitAddRecExpr() 746 const Loop *L = Expr->getLoop(); in visitAddRecExpr()
|
| H A D | IVUsers.h | 125 Loop *getLoop() const { return L; } in getLoop() function
|
| H A D | LoopIterator.h | 121 Loop *getLoop() const { return L; } in getLoop() function
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | LoopStrengthReduce.cpp | 468 if (SAR && SAR->getLoop() == &L) in isCanonical() 477 (cast<SCEVAddRecExpr>(S)->getLoop() == &L); in isCanonical() 506 if (!SAR || SAR->getLoop() != &L) { in canonicalize() 753 S = SE.getAddRecExpr(NewOps, AR->getLoop(), in ExtractImmediate() 779 S = SE.getAddRecExpr(NewOps, AR->getLoop(), in ExtractSymbol() 1221 if (AR->getLoop() != L) { in RateRegister() 1228 if (!AR->getLoop()->contains(L)) { in RateRegister() 2280 assert(AR->getLoop() == L && in OptimizeMax() 2640 if (AR->getLoop() == L) in CollectInterestingTypesAndFactors() 2700 if (AR->getLoop() == L) in findIVOperand() [all …]
|
| H A D | IndVarSimplify.cpp | 1254 if (!AddRec || AddRec->getLoop() != L) in getExtendedOperandRecurrence() 1295 if (!AddRec || AddRec->getLoop() != L) in getWideRecurrence() 1408 if (!AddRecOp1 || AddRecOp1->getLoop() != L) in widenWithVariantLoadUse() 1691 if (!AddRec || AddRec->getLoop() != L) in createWideIV() 2176 if (!AR || AR->getLoop() != L || !AR->isAffine()) in isLoopCounter() 2718 if (!AR || AR->getLoop()->getLoopPreheader()) in run()
|
| H A D | LoopIdiomRecognize.cpp | 420 if (!StoreEv || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine()) in isLegalStore() 479 if (!LoadEv || LoadEv->getLoop() != CurLoop || !LoadEv->isAffine()) in isLegalStore() 740 if (!Ev || Ev->getLoop() != CurLoop || !Ev->isAffine()) in processLoopMemSet()
|
| H A D | LoopInterchange.cpp | 1052 if (AR->getLoop() == InnerLoop) { in getInstrOrderCost() 1066 if (AR->getLoop() == OuterLoop) { in getInstrOrderCost()
|
| H A D | LoopRerollPass.cpp | 585 if (PHISCEV->getLoop() != L) in collectPossibleIVs() 908 if (!IVU_ADR || IVU_ADR->getLoop() != L) in findRootsBase()
|
| H A D | LoopPredication.cpp | 376 if (!AR || AR->getLoop() != L) in parseLoopICmp()
|
| H A D | InductiveRangeCheckElimination.cpp | 359 IndexAddRec && (IndexAddRec->getLoop() == L) && IndexAddRec->isAffine(); in extractRangeChecksFromCond() 1646 const Loop *L = IndVar->getLoop(); in computeSafeIterationSpace()
|
| /freebsd-12.1/contrib/llvm/lib/Target/PowerPC/ |
| H A D | PPCLoopPreIncPrep.cpp | 295 if (LARSCEV->getLoop() != L) in runOnLoop() 398 assert(BasePtrSCEV->getLoop() == L && in runOnLoop()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Utils/ |
| H A D | LoopUnrollPeel.cpp | 201 if (!LeftAR->isAffine() || LeftAR->getLoop() != &L || in countToEliminateCompares()
|
| H A D | SimplifyIndVar.cpp | 864 if (AR && AR->getLoop() == L) in isSimpleIVUser()
|
| /freebsd-12.1/contrib/llvm/lib/Target/Hexagon/ |
| H A D | HexagonLoopIdiomRecognition.cpp | 1929 if (!StoreEv || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine()) in isLegalStore() 1951 if (!LoadEv || LoadEv->getLoop() != CurLoop || !LoadEv->isAffine()) in isLegalStore()
|