Home
last modified time | relevance | path

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

12

/freebsd/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()
327 assert(AR && AR->getLoop() && "Expecting valid loop"); in computeRefCost()
329 computeTripCount(*AR->getLoop(), *Sizes.back(), SE); in computeRefCost()
435 AccessFnAR->getLoop(), in delinearize()
504 if (AR && AR->getLoop() == &L) { in getSubscriptIndex()
520 return (AR != nullptr) ? AR->getLoop() != &L in isCoeffForLoopZeroOrInvariant()
530 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.cpp144 Quotient = SE.getAddRecExpr(StartQ, StepQ, Numerator->getLoop(), in visitAddRecExpr()
146 Remainder = SE.getAddRecExpr(StartR, StepR, Numerator->getLoop(), in visitAddRecExpr()
H A DScalarEvolution.cpp316 AR->getLoop()->getHeader()->printAsOperand(OS, /*PrintType=*/false); in print()
741 const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop(); in CompareSCEVComplexity()
1211 return getAddRecExpr(Operands, AddRec->getLoop(), SCEV::FlagAnyWrap); in getTruncateExpr()
1329 const Loop *L = AR->getLoop(); in getPreStartForExtend()
1623 const Loop *L = AR->getLoop(); in getZeroExtendExprImpl()
1997 const Loop *L = AR->getLoop(); in getSignExtendExprImpl()
2202 return getAddRecExpr(Ops, AR->getLoop(), SCEV::FlagNW); in getAnyExtendExpr()
2878 const Loop *AddRecLoop = AddRec->getLoop(); in getAddExpr()
2946 cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()->getHeader(), in getAddExpr()
2947 AddRec->getLoop()->getHeader()) && in getAddExpr()
[all …]
H A DIVDescriptors.cpp1368 const Loop *L = AR->getLoop(); in getCastsForInductionPHI()
1495 if (AR->getLoop() != TheLoop) { in isInductionPHI()
1506 assert(Phi->getParent() == AR->getLoop()->getHeader() in isInductionPHI()
1510 Phi->getIncomingValueForBlock(AR->getLoop()->getLoopPreheader()); in isInductionPHI()
1512 BasicBlock *Latch = AR->getLoop()->getLoopLatch(); in isInductionPHI()
H A DLoopAccessAnalysis.cpp307 if (!SrcAR || !SinkAR || SrcAR->getLoop() != DC.getInnermostLoop() || in tryToCreateDiffCheck()
308 SinkAR->getLoop() != DC.getInnermostLoop()) in tryToCreateDiffCheck()
321 SinkAR->getLoop()->getHeader()->getDataLayout(); in tryToCreateDiffCheck()
347 const Loop *InnerLoop = SrcAR->getLoop(); in tryToCreateDiffCheck()
356 const Loop *StartARLoop = SrcStartAR->getLoop(); in tryToCreateDiffCheck()
357 if (StartARLoop == SinkStartAR->getLoop() && in tryToCreateDiffCheck()
1450 return OpAR->getLoop() == L && OpAR->getNoWrapFlags(SCEV::FlagNSW); in isNoWrapAddRec()
1485 if (Lp != AR->getLoop()) { in getPtrStride()
2878 if (Lp != S->getLoop()) in getStrideFromPointer()
H A DLoopUnrollAnalyzer.cpp47 if (!AR || AR->getLoop() != L) in simplifyInstWithSCEV()
/freebsd/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 getStart()
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()
360 const Loop *getLoop() const { return L; } getLoop() function
H A DIVUsers.h122 Loop *getLoop() const { return L; } in getLoop() function
H A DLoopIterator.h120 Loop *getLoop() const { return L; } in getLoop() function
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DStmtOpenACC.h238 Stmt *getLoop() { return getAssociatedStmt(); } in getLoop() function
239 const Stmt *getLoop() const { in getLoop() function
240 return const_cast<OpenACCLoopConstruct *>(this)->getLoop(); in getLoop()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DModuloSchedule.cpp72 BB = Schedule.getLoop()->getTopBlock(); in expand()
2005 KernelRewriter KR(*Schedule.getLoop(), Schedule, BB); in rewriteKernel()
2010 BB = Schedule.getLoop()->getTopBlock(); in expand()
2011 Preheader = Schedule.getLoop()->getLoopPreheader(); in expand()
2022 BB = Schedule.getLoop()->getTopBlock(); in validateAgainstModuloScheduleExpander()
2023 Preheader = Schedule.getLoop()->getLoopPreheader(); in validateAgainstModuloScheduleExpander()
2048 KernelRewriter KR(*Schedule.getLoop(), Schedule, BB); in validateAgainstModuloScheduleExpander()
2684 OrigKernel = Schedule.getLoop()->getTopBlock(); in expand()
2685 OrigPreheader = Schedule.getLoop()->getLoopPreheader(); in expand()
2686 OrigExit = Schedule.getLoop()->getExitBlock(); in expand()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/
H A DLoopVectorizationLegality.h397 Loop *getLoop() const { return TheLoop; } in getLoop() function
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DScalarEvolutionExpander.cpp440 L = AR->getLoop(); in getRelevantLoop()
1113 const Loop *L = S->getLoop(); in expandAddRecExprLiterally()
1217 const Loop *L = S->getLoop(); in visitAddRecExpr()
1233 Value *V = expand(SE.getAddRecExpr(NewOps, S->getLoop(), in visitAddRecExpr()
2092 SE.getPredicatedSymbolicMaxBackedgeTakenCount(AR->getLoop(), Pred); in generateOverflowCheck()
2332 if (!AR->getLoop()->getLoopPreheader() && in follow()
H A DSimplifyIndVar.cpp893 if (AR && AR->getLoop() == L) in isSimpleIVUser()
1533 if (!AddRec || AddRec->getLoop() != L) in getExtendedOperandRecurrence()
1574 if (!AddRec || AddRec->getLoop() != L) in getWideRecurrence()
1761 if (!AddRecOp1 || AddRecOp1->getLoop() != L) in widenWithVariantUse()
2049 if (!AddRec || AddRec->getLoop() != L) in createWideIV()
H A DLoopPeel.cpp409 if (!LeftAR->isAffine() || LeftAR->getLoop() != &L) in countToEliminateCompares()
465 if (!AddRec || !AddRec->isAffine() || AddRec->getLoop() != &L) in countToEliminateCompares()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp573 AR->getLoop(), SCEV::FlagAnyWrap), in DoInitialMatch()
624 return isa<SCEVAddRecExpr>(S) && (cast<SCEVAddRecExpr>(S)->getLoop() == &L); in containsAddRecDependentOnLoop()
870 return SE.getAddRecExpr(Start, Step, AR->getLoop(), SCEV::FlagAnyWrap); in getExactSDiv()
945 S = SE.getAddRecExpr(NewOps, AR->getLoop(), in ExtractImmediate()
979 S = SE.getAddRecExpr(NewOps, AR->getLoop(), in ExtractSymbol()
1088 for (PHINode &PN : AR->getLoop()->getHeader()->phis()) { in isExistingPhi()
1424 if (AR->getLoop() != L) { in RateRegister()
1431 if (!AR->getLoop()->contains(L)) { in RateRegister()
2552 assert(AR->getLoop() == L && in OptimizeMax()
2912 if (AR->getLoop() == L) in CollectInterestingTypesAndFactors()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp656 assert(BasePtrSCEV->getLoop() == L && "AddRec for the wrong loop?"); in rewriteForBase()
889 if (!LARSCEV || LARSCEV->getLoop() != L) in collectCandidates()
1332 if (!LARSCEV || LARSCEV->getLoop() != L) in runOnLoop()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DModuloSchedule.h120 MachineLoop *getLoop() const { return Loop; } in getLoop() function
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DMVETailPredication.cpp239 if (AddExpr->getLoop() != L) { in IsSafeActiveMask()

12