| /llvm-project-15.0.7/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 | BranchProbabilityInfo.cpp | 327 return (DstBlock.getLoop() && in isLoopEnteringEdge() 328 !DstBlock.getLoop()->contains(SrcBlock.getLoop())) || in isLoopEnteringEdge() 347 ((DstBlock.getLoop() && in isLoopBackEdge() 348 DstBlock.getLoop()->getHeader() == DstBlock.getBlock()) || in isLoopBackEdge() 355 if (LB.getLoop()) { in getLoopEnterBlocks() 356 auto *Header = LB.getLoop()->getHeader(); in getLoopEnterBlocks() 366 if (LB.getLoop()) { in getLoopExitBlocks() 367 LB.getLoop()->getExitBlocks(Exits); in getLoopExitBlocks() 894 if (LoopBB.getLoop()) in calcEstimatedHeuristics() 895 computeUnlikelySuccessors(BB, LoopBB.getLoop(), UnlikelyBlocks); in calcEstimatedHeuristics() [all …]
|
| H A D | LoopCacheAnalysis.cpp | 87 assert(AR->getLoop() && "AR should have a loop"); in isOneDimensionalArray() 323 assert(AR && AR->getLoop() && "Expecting valid loop"); in computeRefCost() 325 computeTripCount(*AR->getLoop(), *Sizes.back(), SE); in computeRefCost() 431 AccessFnAR->getLoop(), in delinearize() 500 if (AR && AR->getLoop() == &L) { in getSubscriptIndex() 516 return (AR != nullptr) ? AR->getLoop() != &L in isCoeffForLoopZeroOrInvariant() 526 assert(AR->getLoop() && "AR should have a loop"); in isSimpleAddRecurrence()
|
| H A D | IVUsers.cpp | 62 if (AR->getLoop() == L) in isInteresting() 212 auto *L = AR->getLoop(); in AddUsersIfInteresting() 343 if (AR->getLoop() == L) in findAddRecForLoop()
|
| H A D | DependenceAnalysis.cpp | 911 while (L && AddRec->getLoop() != L) in checkSubscript() 2250 SrcLoop = SrcAddRec->getLoop(); in testRDIV() 2253 DstLoop = DstAddRec->getLoop(); in testRDIV() 2260 SrcLoop = tmpAddRec->getLoop(); in testRDIV() 2263 DstLoop = SrcAddRec->getLoop(); in testRDIV() 2273 DstLoop = tmpAddRec->getLoop(); in testRDIV() 2276 SrcLoop = DstAddRec->getLoop(); in testRDIV() 2451 if (CurLoop == AddRec->getLoop()) in gcdMIVtest() 2947 const Loop *L = AddRec->getLoop(); in collectCoeffInfo() 3023 if (AddRec->getLoop() == TargetLoop) in findCoefficient() [all …]
|
| H A D | ScalarEvolutionDivision.cpp | 140 Quotient = SE.getAddRecExpr(StartQ, StepQ, Numerator->getLoop(), in visitAddRecExpr() 142 Remainder = SE.getAddRecExpr(StartR, StepR, Numerator->getLoop(), in visitAddRecExpr()
|
| H A D | ScalarEvolution.cpp | 761 const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop(); in CompareSCEVComplexity() 1398 const Loop *L = AR->getLoop(); in getPreStartForExtend() 4744 if (Expr->getLoop() == L) in visitAddRecExpr() 4785 if (Expr->getLoop() == L) in visitAddRecExpr() 4962 const Loop *L = AR->getLoop(); in proveNoSignedWrapViaInduction() 5012 const Loop *L = AR->getLoop(); in proveNoUnsignedWrapViaInduction() 10796 if (!AR || AR->getLoop() != L) in getLoopInvariantExitCondDuringFirstIterations() 11568 if (LAR->getLoop() != MAR->getLoop()) in computeConstantDifference() 11678 if (L != AddRecLHS->getLoop()) in isImpliedCondOperandsViaNoOverflow() 11941 if (LAR->getLoop() != RAR->getLoop()) in IsKnownPredicateViaAddRecStart() [all …]
|
| H A D | LoopUnrollAnalyzer.cpp | 47 if (!AR || AR->getLoop() != L) in simplifyInstWithSCEV()
|
| H A D | IVDescriptors.cpp | 1381 const Loop *L = AR->getLoop(); in getCastsForInductionPHI() 1508 if (AR->getLoop() != TheLoop) { in isInductionPHI() 1517 Phi->getIncomingValueForBlock(AR->getLoop()->getLoopPreheader()); in isInductionPHI() 1519 BasicBlock *Latch = AR->getLoop()->getLoopLatch(); in isInductionPHI()
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | BranchProbabilityInfo.h | 295 Loop *getLoop() const { return LD.first; } in getLoop() function 298 bool belongsToLoop() const { return getLoop() || getSccNum() != -1; } in belongsToLoop() 300 return (LB.getLoop() && getLoop() == LB.getLoop()) || in belongsToSameLoop()
|
| H A D | LoopNestAnalysis.h | 100 Loop *getLoop(unsigned Index) const { in getLoop() function 108 if (getLoop(I) == &L) in getLoopIndex() 125 Loop *L = getLoop(I); in getLoopsAtDepth()
|
| H A D | ScalarEvolutionExpressions.h | 354 const Loop *getLoop() const { return L; } in getLoop() function 364 SmallVector<const SCEV *, 3>(op_begin() + 1, op_end()), getLoop(), in getStepRecurrence() 845 : SE.getAddRecExpr(Operands, Expr->getLoop(), in visitAddRecExpr() 954 const Loop *L = Expr->getLoop(); in visitAddRecExpr()
|
| H A D | IVUsers.h | 121 Loop *getLoop() const { return L; } in getLoop() function
|
| H A D | LoopIterator.h | 120 Loop *getLoop() const { return L; } in getLoop() function
|
| /llvm-project-15.0.7/polly/lib/Support/ |
| H A D | SCEVAffinator.cpp | 178 if (AddRec->getLoop() != L) in hasNSWAddRecForLoop() 404 assert(S->contains(Expr->getLoop()) && in visitAddRecExpr() 411 unsigned loopDimension = S->getRelativeLoopDepth(Expr->getLoop()); in visitAddRecExpr() 428 Expr->getStepRecurrence(SE), Expr->getLoop(), Flags); in visitAddRecExpr()
|
| H A D | SCEVValidator.cpp | 234 auto *L = Expr->getLoop(); in visitAddRecExpr() 265 Expr->getStepRecurrence(SE), Expr->getLoop(), Expr->getNoWrapFlags()); in visitAddRecExpr() 507 auto *L = AddRec->getLoop(); in follow() 529 Loops.insert(AddRec->getLoop()); in follow() 683 SE.getAddRecExpr(StartExpr, StepPair.second, AddRec->getLoop(), in extractConstantFactor()
|
| /llvm-project-15.0.7/llvm/unittests/Analysis/ |
| H A D | LoopNestTest.cpp | 119 EXPECT_EQ(LN.getLoop(LN.getLoopIndex(OL)), &OL); in TEST() 120 EXPECT_EQ(LN.getLoop(LN.getLoopIndex(*IL)), IL); in TEST()
|
| H A D | ScalarEvolutionTest.cpp | 531 Loops.insert(S0->getLoop()); in TEST_F() 538 Loops.insert(S1->getLoop()); in TEST_F() 1295 const Loop *L = cast<SCEVAddRecExpr>(ScevIV)->getLoop(); in TEST_F() 1571 const Loop *L = cast<SCEVAddRecExpr>(ScevIV)->getLoop(); in TEST_F() 1612 const Loop *L = cast<SCEVAddRecExpr>(ScevIV)->getLoop(); in TEST_F() 1653 const Loop *L = cast<SCEVAddRecExpr>(ScevIV)->getLoop(); in TEST_F() 1698 const Loop *L = cast<SCEVAddRecExpr>(ScevIV)->getLoop(); in TEST_F() 1740 const Loop *L = cast<SCEVAddRecExpr>(ScevIV)->getLoop(); in TEST_F()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | ScalarEvolutionExpander.cpp | 354 S = SE.getAddRecExpr(Start, Step, A->getLoop(), in FactorOutConstant() 407 A->getLoop(), in SplitAddRecs() 693 L = AR->getLoop(); in getRelevantLoop() 1356 const Loop *L = S->getLoop(); in expandAddRecExprLiterally() 1375 Normalized->getLoop(), in expandAddRecExprLiterally() 1394 Start, Step, Normalized->getLoop(), in expandAddRecExprLiterally() 1523 const Loop *L = S->getLoop(); in visitAddRecExpr() 1539 Value *V = expand(SE.getAddRecExpr(NewOps, S->getLoop(), in visitAddRecExpr() 2372 SE.getPredicatedBackedgeTakenCount(AR->getLoop(), Pred); in generateOverflowCheck() 2596 if (!AR->isAffine() && !SE.dominates(Step, AR->getLoop()->getHeader())) { in follow() [all …]
|
| H A D | SimplifyIndVar.cpp | 857 if (AR && AR->getLoop() == L) in isSimpleIVUser() 1399 if (!AddRec || AddRec->getLoop() != L) in getExtendedOperandRecurrence() 1440 if (!AddRec || AddRec->getLoop() != L) in getWideRecurrence() 1628 if (!AddRecOp1 || AddRecOp1->getLoop() != L) in widenWithVariantUse() 1894 if (!AddRec || AddRec->getLoop() != L) in createWideIV()
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | ModuloSchedule.cpp | 68 BB = Schedule.getLoop()->getTopBlock(); in expand() 1981 KernelRewriter KR(*Schedule.getLoop(), Schedule, BB); in rewriteKernel() 1986 BB = Schedule.getLoop()->getTopBlock(); in expand() 1987 Preheader = Schedule.getLoop()->getLoopPreheader(); in expand() 1998 BB = Schedule.getLoop()->getTopBlock(); in validateAgainstModuloScheduleExpander() 1999 Preheader = Schedule.getLoop()->getLoopPreheader(); in validateAgainstModuloScheduleExpander() 2024 KernelRewriter KR(*Schedule.getLoop(), Schedule, BB); in validateAgainstModuloScheduleExpander()
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | ModuloSchedule.h | 119 MachineLoop *getLoop() const { return Loop; } in getLoop() function
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | LoopStrengthReduce.cpp | 431 AR->getLoop(), SCEV::FlagAnyWrap), in DoInitialMatch() 803 S = SE.getAddRecExpr(NewOps, AR->getLoop(), in ExtractImmediate() 829 S = SE.getAddRecExpr(NewOps, AR->getLoop(), in ExtractSymbol() 940 for (PHINode &PN : AR->getLoop()->getHeader()->phis()) { in isExistingPhi() 1275 if (AR->getLoop() != L) { in RateRegister() 1282 if (!AR->getLoop()->contains(L)) { in RateRegister() 2346 assert(AR->getLoop() == L && in OptimizeMax() 2707 if (AR->getLoop() == L) in CollectInterestingTypesAndFactors() 2767 if (AR->getLoop() == L) in findIVOperand() 3612 AR->getLoop(), in CollectSubexprs() [all …]
|
| /llvm-project-15.0.7/llvm/lib/Target/ARM/ |
| H A D | MVETailPredication.cpp | 328 if (AddExpr->getLoop() != L) { in IsSafeActiveMask()
|
| /llvm-project-15.0.7/llvm/lib/Target/PowerPC/ |
| H A D | PPCLoopInstrFormPrep.cpp | 655 assert(BasePtrSCEV->getLoop() == L && "AddRec for the wrong loop?"); in rewriteForBase() 883 if (!LARSCEV || LARSCEV->getLoop() != L) in collectCandidates() 1325 if (!LARSCEV || LARSCEV->getLoop() != L) in runOnLoop()
|