Home
last modified time | relevance | path

Searched refs:getLoop (Results 1 – 25 of 40) sorted by relevance

12

/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DScalarEvolutionNormalization.cpp55 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap); in visitAddRecExpr()
94 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap); in visitAddRecExpr()
104 return Loops.count(AR->getLoop()); in normalizeForPostIncUse()
126 return Loops.count(AR->getLoop()); in denormalizeForPostIncUse()
H A DBranchProbabilityInfo.cpp328 return (DstBlock.getLoop() && in isLoopEnteringEdge()
329 !DstBlock.getLoop()->contains(SrcBlock.getLoop())) || in isLoopEnteringEdge()
348 ((DstBlock.getLoop() && in isLoopBackEdge()
349 DstBlock.getLoop()->getHeader() == DstBlock.getBlock()) || in isLoopBackEdge()
356 if (LB.getLoop()) { in getLoopEnterBlocks()
357 auto *Header = LB.getLoop()->getHeader(); in getLoopEnterBlocks()
367 if (LB.getLoop()) { in getLoopExitBlocks()
368 LB.getLoop()->getExitBlocks(Exits); in getLoopExitBlocks()
884 if (LoopBB.getLoop()) in calcEstimatedHeuristics()
885 computeUnlikelySuccessors(BB, LoopBB.getLoop(), UnlikelyBlocks); in calcEstimatedHeuristics()
[all …]
H A DLoopCacheAnalysis.cpp87 assert(AR->getLoop() && "AR should have a loop"); in isOneDimensionalArray()
322 assert(AR && AR->getLoop() && "Expecting valid loop"); in computeRefCost()
324 computeTripCount(*AR->getLoop(), *Sizes.back(), SE); in computeRefCost()
430 AccessFnAR->getLoop(), in delinearize()
499 if (AR && AR->getLoop() == &L) { in getSubscriptIndex()
515 return (AR != nullptr) ? AR->getLoop() != &L in isCoeffForLoopZeroOrInvariant()
525 assert(AR->getLoop() && "AR should have a loop"); in isSimpleAddRecurrence()
H A DIVUsers.cpp62 if (AR->getLoop() == L) in isInteresting()
212 auto *L = AR->getLoop(); in AddUsersIfInteresting()
343 if (AR->getLoop() == L) in findAddRecForLoop()
H A DDependenceAnalysis.cpp974 while (L && AddRec->getLoop() != L) in checkSubscript()
2313 SrcLoop = SrcAddRec->getLoop(); in testRDIV()
2316 DstLoop = DstAddRec->getLoop(); in testRDIV()
2323 SrcLoop = tmpAddRec->getLoop(); in testRDIV()
2326 DstLoop = SrcAddRec->getLoop(); in testRDIV()
2336 DstLoop = tmpAddRec->getLoop(); in testRDIV()
2339 SrcLoop = DstAddRec->getLoop(); in testRDIV()
2514 if (CurLoop == AddRec->getLoop()) in gcdMIVtest()
3010 const Loop *L = AddRec->getLoop(); in collectCoeffInfo()
3086 if (AddRec->getLoop() == TargetLoop) in findCoefficient()
[all …]
H A DScalarEvolutionDivision.cpp144 Quotient = SE.getAddRecExpr(StartQ, StepQ, Numerator->getLoop(), in visitAddRecExpr()
146 Remainder = SE.getAddRecExpr(StartR, StepR, Numerator->getLoop(), in visitAddRecExpr()
H A DScalarEvolution.cpp734 const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop(); in CompareSCEVComplexity()
1327 const Loop *L = AR->getLoop(); in getPreStartForExtend()
3328 if (!OtherAddRec || OtherAddRec->getLoop() != AddRec->getLoop()) in getMulExpr()
4903 if (Expr->getLoop() == L) in visitAddRecExpr()
4944 if (Expr->getLoop() == L) in visitAddRecExpr()
5137 const Loop *L = AR->getLoop(); in proveNoSignedWrapViaInduction()
5191 const Loop *L = AR->getLoop(); in proveNoUnsignedWrapViaInduction()
11104 if (!AR || AR->getLoop() != L) in getLoopInvariantExitCondDuringFirstIterationsImpl()
11879 if (LAR->getLoop() != MAR->getLoop()) in computeConstantDifference()
12252 if (LAR->getLoop() != RAR->getLoop()) in IsKnownPredicateViaAddRecStart()
[all …]
H A DIVDescriptors.cpp1369 const Loop *L = AR->getLoop(); in getCastsForInductionPHI()
1496 if (AR->getLoop() != TheLoop) { in isInductionPHI()
1507 assert(Phi->getParent() == AR->getLoop()->getHeader() in isInductionPHI()
1511 Phi->getIncomingValueForBlock(AR->getLoop()->getLoopPreheader()); in isInductionPHI()
1513 BasicBlock *Latch = AR->getLoop()->getLoopLatch(); in isInductionPHI()
H A DLoopAccessAnalysis.cpp292 if (!SrcAR || !SinkAR || SrcAR->getLoop() != DC.getInnermostLoop() || in tryToCreateDiffCheck()
293 SinkAR->getLoop() != DC.getInnermostLoop()) { in tryToCreateDiffCheck()
309 SinkAR->getLoop()->getHeader()->getModule()->getDataLayout(); in tryToCreateDiffCheck()
339 const Loop *InnerLoop = SrcAR->getLoop(); in tryToCreateDiffCheck()
348 const Loop *StartARLoop = SrcStartAR->getLoop(); in tryToCreateDiffCheck()
349 if (StartARLoop == SinkStartAR->getLoop() && in tryToCreateDiffCheck()
1455 return OpAR->getLoop() == L && OpAR->getNoWrapFlags(SCEV::FlagNSW); in isNoWrapAddRec()
1489 if (Lp != AR->getLoop()) { in getPtrStride()
2822 if (Lp != S->getLoop()) in getStrideFromPointer()
H A DLoopUnrollAnalyzer.cpp47 if (!AR || AR->getLoop() != L) in simplifyInstWithSCEV()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DBranchProbabilityInfo.h307 Loop *getLoop() const { return LD.first; } in getLoop() function
310 bool belongsToLoop() const { return getLoop() || getSccNum() != -1; } in belongsToLoop()
312 return (LB.getLoop() && getLoop() == LB.getLoop()) || in belongsToSameLoop()
H A DLoopNestAnalysis.h100 Loop *getLoop(unsigned Index) const { in getLoop() function
108 if (getLoop(I) == &L) in getLoopIndex()
125 Loop *L = getLoop(I); in getLoopsAtDepth()
H A DScalarEvolutionExpressions.h359 const Loop *getLoop() const { return L; } in getLoop() function
369 SmallVector<const SCEV *, 3>(operands().drop_front()), getLoop(), in getStepRecurrence()
836 : SE.getAddRecExpr(Operands, Expr->getLoop(), in visitAddRecExpr()
945 const Loop *L = Expr->getLoop(); in visitAddRecExpr()
H A DIVUsers.h121 Loop *getLoop() const { return L; } in getLoop() function
H A DLoopIterator.h120 Loop *getLoop() const { return L; } in getLoop() function
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DModuloSchedule.cpp68 BB = Schedule.getLoop()->getTopBlock(); in expand()
1997 KernelRewriter KR(*Schedule.getLoop(), Schedule, BB); in rewriteKernel()
2002 BB = Schedule.getLoop()->getTopBlock(); in expand()
2003 Preheader = Schedule.getLoop()->getLoopPreheader(); in expand()
2014 BB = Schedule.getLoop()->getTopBlock(); in validateAgainstModuloScheduleExpander()
2015 Preheader = Schedule.getLoop()->getLoopPreheader(); in validateAgainstModuloScheduleExpander()
2040 KernelRewriter KR(*Schedule.getLoop(), Schedule, BB); in validateAgainstModuloScheduleExpander()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInductiveRangeCheckElimination.cpp514 if ((IndexAddRec->getLoop() != L) || !IndexAddRec->isAffine()) in extractRangeChecksFromCond()
754 const Loop *L = IndVar->getLoop(); in computeSafeIterationSpace()
798 auto L = IndVar->getLoop(); in computeSafeIterationSpace()
H A DLoopStrengthReduce.cpp817 S = SE.getAddRecExpr(NewOps, AR->getLoop(), in ExtractImmediate()
843 S = SE.getAddRecExpr(NewOps, AR->getLoop(), in ExtractSymbol()
952 for (PHINode &PN : AR->getLoop()->getHeader()->phis()) { in isExistingPhi()
1288 if (AR->getLoop() != L) { in RateRegister()
1295 if (!AR->getLoop()->contains(L)) { in RateRegister()
2363 assert(AR->getLoop() == L && in OptimizeMax()
2716 if (AR->getLoop() == L) in CollectInterestingTypesAndFactors()
2776 if (AR->getLoop() == L) in findIVOperand()
3634 AR->getLoop(), in CollectSubexprs()
5024 cast<SCEVAddRecExpr>(Best)->getLoop() != in IsSimplerBaseSCEVForTarget()
[all …]
H A DLoopIdiomRecognize.cpp435 if (!StoreEv || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine()) in isLegalStore()
494 if (!LoadEv || LoadEv->getLoop() != CurLoop || !LoadEv->isAffine()) in isLegalStore()
772 if (!StoreEv || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine()) in processLoopMemCpy()
775 if (!LoadEv || LoadEv->getLoop() != CurLoop || !LoadEv->isAffine()) in processLoopMemCpy()
838 if (!Ev || Ev->getLoop() != CurLoop) in processLoopMemSet()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/
H A DLoopVectorizationLegality.h394 Loop *getLoop() const { return TheLoop; } in getLoop() function
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DScalarEvolutionExpander.cpp401 L = AR->getLoop(); in getRelevantLoop()
1056 const Loop *L = S->getLoop(); in expandAddRecExprLiterally()
1160 const Loop *L = S->getLoop(); in visitAddRecExpr()
1176 Value *V = expand(SE.getAddRecExpr(NewOps, S->getLoop(), in visitAddRecExpr()
1994 SE.getPredicatedBackedgeTakenCount(AR->getLoop(), Pred); in generateOverflowCheck()
2234 if (!AR->getLoop()->getLoopPreheader() && in follow()
H A DSimplifyIndVar.cpp870 if (AR && AR->getLoop() == L) in isSimpleIVUser()
1435 if (!AddRec || AddRec->getLoop() != L) in getExtendedOperandRecurrence()
1476 if (!AddRec || AddRec->getLoop() != L) in getWideRecurrence()
1660 if (!AddRecOp1 || AddRecOp1->getLoop() != L) in widenWithVariantUse()
1933 if (!AddRec || AddRec->getLoop() != L) in createWideIV()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DModuloSchedule.h120 MachineLoop *getLoop() const { return Loop; } in getLoop() function
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp656 assert(BasePtrSCEV->getLoop() == L && "AddRec for the wrong loop?"); in rewriteForBase()
884 if (!LARSCEV || LARSCEV->getLoop() != L) in collectCandidates()
1327 if (!LARSCEV || LARSCEV->getLoop() != L) in runOnLoop()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/ARM/
H A DMVETailPredication.cpp239 if (AddExpr->getLoop() != L) { in IsSafeActiveMask()

12