Home
last modified time | relevance | path

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

12

/openbsd-src/gnu/llvm/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()
101 return Loops.count(AR->getLoop()); in normalizeForPostIncUse()
115 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()
981 const SCEV *UB = SE->getBackedgeTakenCount(AddRec->getLoop()); in checkSubscript()
992 Loops.set(mapSrcLoop(AddRec->getLoop())); in checkSubscript()
994 Loops.set(mapDstLoop(AddRec->getLoop())); in checkSubscript()
1113 const SCEV *BECount = SE->getBackedgeTakenCount(AddRec->getLoop()); in isKnownLessThan()
2238 const Loop *CurLoop = SrcAddRec->getLoop(); in testSIV()
2239 assert(CurLoop == DstAddRec->getLoop() && in testSIV()
2260 const Loop *CurLoop = SrcAddRec->getLoop(); in testSIV()
2270 const Loop *CurLoop = DstAddRec->getLoop(); in testSIV()
2313 SrcLoop = SrcAddRec->getLoop(); in testRDIV()
[all …]
H A DScalarEvolutionDivision.cpp140 Quotient = SE.getAddRecExpr(StartQ, StepQ, Numerator->getLoop(), in visitAddRecExpr()
142 Remainder = SE.getAddRecExpr(StartR, StepR, Numerator->getLoop(), in visitAddRecExpr()
H A DScalarEvolution.cpp315 AR->getLoop()->getHeader()->printAsOperand(OS, /*PrintType=*/false); in print()
795 const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop(); in CompareSCEVComplexity()
1272 return getAddRecExpr(Operands, AddRec->getLoop(), SCEV::FlagAnyWrap); in getTruncateExpr()
1390 const Loop *L = AR->getLoop(); in getPreStartForExtend()
1685 const Loop *L = AR->getLoop(); in getZeroExtendExprImpl()
2046 const Loop *L = AR->getLoop(); in getSignExtendExprImpl()
2244 return getAddRecExpr(Ops, AR->getLoop(), SCEV::FlagNW); in getAnyExtendExpr()
2903 const Loop *AddRecLoop = AddRec->getLoop(); in getAddExpr()
2971 cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()->getHeader(), in getAddExpr()
2972 AddRec->getLoop()->getHeader()) && in getAddExpr()
[all …]
H A DLoopUnrollAnalyzer.cpp47 if (!AR || AR->getLoop() != L) in simplifyInstWithSCEV()
H A DIVDescriptors.cpp1409 const Loop *L = AR->getLoop(); in getCastsForInductionPHI()
1536 if (AR->getLoop() != TheLoop) { in isInductionPHI()
1545 Phi->getIncomingValueForBlock(AR->getLoop()->getLoopPreheader()); in isInductionPHI()
1547 BasicBlock *Latch = AR->getLoop()->getLoopLatch(); in isInductionPHI()
H A DLoopAccessAnalysis.cpp284 if (!SrcAR || !SinkAR || SrcAR->getLoop() != DC.getInnermostLoop() || in tryToCreateDiffCheck()
285 SinkAR->getLoop() != DC.getInnermostLoop()) { in tryToCreateDiffCheck()
301 SinkAR->getLoop()->getHeader()->getModule()->getDataLayout(); in tryToCreateDiffCheck()
1362 return OpAR->getLoop() == L && OpAR->getNoWrapFlags(SCEV::FlagNSW); in isNoWrapAddRec()
1396 if (Lp != AR->getLoop()) { in getPtrStride()
/openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/
H A DBranchProbabilityInfo.h295 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 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.h342 const Loop *getLoop() const { return L; } in getLoop() function
352 SmallVector<const SCEV *, 3>(operands().drop_front()), getLoop(), in getStepRecurrence()
826 : SE.getAddRecExpr(Operands, Expr->getLoop(), in visitAddRecExpr()
935 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
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/
H A DScalarEvolutionExpander.cpp355 S = SE.getAddRecExpr(Start, Step, A->getLoop(), in FactorOutConstant()
408 A->getLoop(), in SplitAddRecs()
699 L = AR->getLoop(); in getRelevantLoop()
1383 const Loop *L = S->getLoop(); in expandAddRecExprLiterally()
1402 Normalized->getLoop(), in expandAddRecExprLiterally()
1421 Start, Step, Normalized->getLoop(), in expandAddRecExprLiterally()
1550 const Loop *L = S->getLoop(); in visitAddRecExpr()
1566 Value *V = expand(SE.getAddRecExpr(NewOps, S->getLoop(), in visitAddRecExpr()
2363 SE.getPredicatedBackedgeTakenCount(AR->getLoop(), Pred); in generateOverflowCheck()
2602 if (!AR->isAffine() && !SE.dominates(Step, AR->getLoop()->getHeader())) { in follow()
[all …]
H A DSimplifyIndVar.cpp846 if (AR && AR->getLoop() == L) in isSimpleIVUser()
1388 if (!AddRec || AddRec->getLoop() != L) in getExtendedOperandRecurrence()
1429 if (!AddRec || AddRec->getLoop() != L) in getWideRecurrence()
1617 if (!AddRecOp1 || AddRecOp1->getLoop() != L) in widenWithVariantUse()
1883 if (!AddRec || AddRec->getLoop() != L) in createWideIV()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DModuloSchedule.cpp68 BB = Schedule.getLoop()->getTopBlock(); in expand()
2002 KernelRewriter KR(*Schedule.getLoop(), Schedule, BB); in rewriteKernel()
2007 BB = Schedule.getLoop()->getTopBlock(); in expand()
2008 Preheader = Schedule.getLoop()->getLoopPreheader(); in expand()
2019 BB = Schedule.getLoop()->getTopBlock(); in validateAgainstModuloScheduleExpander()
2020 Preheader = Schedule.getLoop()->getLoopPreheader(); in validateAgainstModuloScheduleExpander()
2045 KernelRewriter KR(*Schedule.getLoop(), Schedule, BB); in validateAgainstModuloScheduleExpander()
/openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/
H A DModuloSchedule.h119 MachineLoop *getLoop() const { return Loop; } in getLoop() function
/openbsd-src/gnu/llvm/llvm/lib/Target/ARM/
H A DMVETailPredication.cpp328 if (AddExpr->getLoop() != L) { in IsSafeActiveMask()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp444 AR->getLoop(), SCEV::FlagAnyWrap), in DoInitialMatch()
495 return isa<SCEVAddRecExpr>(S) && (cast<SCEVAddRecExpr>(S)->getLoop() == &L); in containsAddRecDependentOnLoop()
741 return SE.getAddRecExpr(Start, Step, AR->getLoop(), SCEV::FlagAnyWrap); in getExactSDiv()
816 S = SE.getAddRecExpr(NewOps, AR->getLoop(), in ExtractImmediate()
842 S = SE.getAddRecExpr(NewOps, AR->getLoop(), in ExtractSymbol()
953 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()
2715 if (AR->getLoop() == L) in CollectInterestingTypesAndFactors()
[all …]
H A DLoopIdiomRecognize.cpp510 if (!StoreEv || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine()) in isLegalStore()
569 if (!LoadEv || LoadEv->getLoop() != CurLoop || !LoadEv->isAffine()) in isLegalStore()
847 if (!StoreEv || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine()) in processLoopMemCpy()
850 if (!LoadEv || LoadEv->getLoop() != CurLoop || !LoadEv->isAffine()) in processLoopMemCpy()
913 if (!Ev || Ev->getLoop() != CurLoop) in processLoopMemSet()
H A DLoopFuse.cpp1244 const Loop *ExprL = Expr->getLoop(); in visitAddRecExpr()
1307 return !DT.dominates(L0Header, AddRec->getLoop()->getHeader()) && in accessDiffIsPositive()
1308 !DT.dominates(AddRec->getLoop()->getHeader(), L0Header); in accessDiffIsPositive()
H A DInductiveRangeCheckElimination.cpp379 IndexAddRec && (IndexAddRec->getLoop() == L) && IndexAddRec->isAffine(); in extractRangeChecksFromCond()
847 if (IndVarBase->getLoop() != &L) { in parseLoopStructure()
1684 const Loop *L = IndVar->getLoop(); in computeSafeIterationSpace()
/openbsd-src/gnu/llvm/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()
1325 if (!LARSCEV || LARSCEV->getLoop() != L) in runOnLoop()

12