Home
last modified time | relevance | path

Searched refs:getLoop (Results 1 – 25 of 45) 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.cpp324 return (DstBlock.getLoop() && in isLoopEnteringEdge()
325 !DstBlock.getLoop()->contains(SrcBlock.getLoop())) || in isLoopEnteringEdge()
344 ((DstBlock.getLoop() && in isLoopBackEdge()
345 DstBlock.getLoop()->getHeader() == DstBlock.getBlock()) || in isLoopBackEdge()
352 if (LB.getLoop()) { in getLoopEnterBlocks()
353 auto *Header = LB.getLoop()->getHeader(); in getLoopEnterBlocks()
363 if (LB.getLoop()) { in getLoopExitBlocks()
364 LB.getLoop()->getExitBlocks(Exits); in getLoopExitBlocks()
880 if (LoopBB.getLoop()) in calcEstimatedHeuristics()
881 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()
441 AccessFnAR->getLoop(), in delinearize()
510 if (AR && AR->getLoop() == &L) { in getSubscriptIndex()
526 return (AR != nullptr) ? AR->getLoop() != &L in isCoeffForLoopZeroOrInvariant()
536 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()
341 if (AR->getLoop() == L) in findAddRecForLoop()
H A DDependenceAnalysis.cpp1001 while (L && AddRec->getLoop() != L) in checkSubscript()
1011 Loops.set(mapSrcLoop(AddRec->getLoop())); in checkSubscript()
1013 Loops.set(mapDstLoop(AddRec->getLoop())); in checkSubscript()
1132 const SCEV *BECount = SE->getBackedgeTakenCount(AddRec->getLoop()); in isKnownLessThan()
2257 const Loop *CurLoop = SrcAddRec->getLoop(); in testSIV()
2258 assert(CurLoop == DstAddRec->getLoop() && in testSIV()
2279 const Loop *CurLoop = SrcAddRec->getLoop(); in testSIV()
2289 const Loop *CurLoop = DstAddRec->getLoop(); in testSIV()
2332 SrcLoop = SrcAddRec->getLoop(); in testRDIV()
2335 DstLoop = DstAddRec->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.cpp322 AR->getLoop()->getHeader()->printAsOperand(OS, /*PrintType=*/false); in print()
710 const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop(); in CompareSCEVComplexity()
1217 return getAddRecExpr(Operands, AddRec->getLoop(), SCEV::FlagAnyWrap); in getTruncateExpr()
1335 const Loop *L = AR->getLoop(); in getPreStartForExtend()
1627 const Loop *L = AR->getLoop(); in getZeroExtendExprImpl()
2000 const Loop *L = AR->getLoop(); in getSignExtendExprImpl()
2205 return getAddRecExpr(Ops, AR->getLoop(), SCEV::FlagNW); in getAnyExtendExpr()
2866 const Loop *AddRecLoop = AddRec->getLoop(); in getAddExpr()
2934 cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()->getHeader(), in getAddExpr()
2935 AddRec->getLoop()->getHeader()) && in getAddExpr()
[all …]
H A DIVDescriptors.cpp721 if (!AR || AR->getLoop() != TheLoop) in isFindIVPattern()
1476 const Loop *L = AR->getLoop(); in getCastsForInductionPHI()
1603 if (AR->getLoop() != TheLoop) { in isInductionPHI()
1614 assert(Phi->getParent() == AR->getLoop()->getHeader() in isInductionPHI()
1618 Phi->getIncomingValueForBlock(AR->getLoop()->getLoopPreheader()); in isInductionPHI()
1620 BasicBlock *Latch = AR->getLoop()->getLoopLatch(); in isInductionPHI()
H A DLoopUnrollAnalyzer.cpp48 if (!AR || AR->getLoop() != L) in simplifyInstWithSCEV()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DBranchProbabilityInfo.h309 Loop *getLoop() const { return LD.first; } in getLoop() function
312 bool belongsToLoop() const { return getLoop() || getSccNum() != -1; } in belongsToLoop()
314 return (LB.getLoop() && getLoop() == LB.getLoop()) || in belongsToSameLoop()
H A DLoopNestAnalysis.h101 Loop *getLoop(unsigned Index) const { in getLoop() function
109 if (getLoop(I) == &L) in getLoopIndex()
126 Loop *L = getLoop(I); in getLoopsAtDepth()
H A DScalarEvolutionExpressions.h360 const Loop *getLoop() const { return L; } in getLoop() function
370 SmallVector<const SCEV *, 3>(operands().drop_front()), getLoop(), in getStepRecurrence()
840 : SE.getAddRecExpr(Operands, Expr->getLoop(), in visitAddRecExpr()
949 const Loop *L = Expr->getLoop(); in visitAddRecExpr()
H A DIVUsers.h122 Loop *getLoop() const { return L; } in getLoop() function
H A DLoopIterator.h120 Loop *getLoop() const { return L; } in getLoop() function
H A DScalarEvolutionPatternMatch.h214 return Ops.match(S) && Loop.match(cast<SCEVAddRecExpr>(S)->getLoop()); in match()
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DStmtOpenACC.h223 Stmt *getLoop() { return getAssociatedStmt(); } in getLoop() function
224 const Stmt *getLoop() const { in getLoop() function
225 return const_cast<OpenACCLoopConstruct *>(this)->getLoop(); in getLoop()
284 Stmt *getLoop() { return getAssociatedStmt(); } in getLoop() function
285 const Stmt *getLoop() const { in getLoop() function
286 return const_cast<OpenACCCombinedConstruct *>(this)->getLoop(); in getLoop()
/freebsd/contrib/llvm-project/clang/lib/CIR/CodeGen/
H A DCIRGenStmtOpenACC.cpp229 s.getLoop()); in emitOpenACCCombinedConstruct()
233 s.getLoop()); in emitOpenACCCombinedConstruct()
237 s.getLoop()); in emitOpenACCCombinedConstruct()
H A DCIRGenStmtOpenACCLoop.cpp135 stmtRes = emitStmt(s.getLoop(), /*useCurrentScope=*/true); in emitOpenACCLoopConstruct()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DModuloSchedule.cpp72 BB = Schedule.getLoop()->getTopBlock(); in expand()
2024 KernelRewriter KR(*Schedule.getLoop(), Schedule, BB); in rewriteKernel()
2029 BB = Schedule.getLoop()->getTopBlock(); in expand()
2030 Preheader = Schedule.getLoop()->getLoopPreheader(); in expand()
2041 BB = Schedule.getLoop()->getTopBlock(); in validateAgainstModuloScheduleExpander()
2042 Preheader = Schedule.getLoop()->getLoopPreheader(); in validateAgainstModuloScheduleExpander()
2067 KernelRewriter KR(*Schedule.getLoop(), Schedule, BB); in validateAgainstModuloScheduleExpander()
2721 OrigKernel = Schedule.getLoop()->getTopBlock(); in expand()
2722 OrigPreheader = Schedule.getLoop()->getLoopPreheader(); in expand()
2723 OrigExit = Schedule.getLoop()->getExitBlock(); in expand()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInductiveRangeCheckElimination.cpp508 if ((IndexAddRec->getLoop() != L) || !IndexAddRec->isAffine()) in extractRangeChecksFromCond()
770 const Loop *L = IndVar->getLoop(); in computeSafeIterationSpace()
814 auto L = IndVar->getLoop(); in computeSafeIterationSpace()
H A DLoopStrengthReduce.cpp619 return isa<SCEVAddRecExpr>(S) && (cast<SCEVAddRecExpr>(S)->getLoop() == &L); in containsAddRecDependentOnLoop()
878 return SE.getAddRecExpr(Start, Step, AR->getLoop(), SCEV::FlagAnyWrap); in getExactSDiv()
954 S = SE.getAddRecExpr(NewOps, AR->getLoop(), in ExtractImmediate()
984 S = SE.getAddRecExpr(NewOps, AR->getLoop(), in ExtractSymbol()
1093 for (PHINode &PN : AR->getLoop()->getHeader()->phis()) { in isExistingPhi()
1405 if (AR->getLoop() != L) { in RateRegister()
1412 if (!AR->getLoop()->contains(L)) { in RateRegister()
2539 assert(cast<SCEVAddRecExpr>(IV)->getLoop() == L && in OptimizeMax()
2901 if (AR->getLoop() == L) in CollectInterestingTypesAndFactors()
2961 if (AR->getLoop() == L) in findIVOperand()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DScalarEvolutionExpander.cpp450 L = AR->getLoop(); in getRelevantLoop()
1137 const Loop *L = S->getLoop(); in expandAddRecExprLiterally()
1241 const Loop *L = S->getLoop(); in visitAddRecExpr()
1257 Value *V = expand(SE.getAddRecExpr(NewOps, S->getLoop(), in visitAddRecExpr()
2093 SE.getPredicatedSymbolicMaxBackedgeTakenCount(AR->getLoop(), Pred); in generateOverflowCheck()
2339 if (!AR->getLoop()->getLoopPreheader() && in follow()
H A DSimplifyIndVar.cpp895 if (AR && AR->getLoop() == L) in isSimpleIVUser()
1533 if (!AddRec || AddRec->getLoop() != L) in getExtendedOperandRecurrence()
1574 if (!AddRec || AddRec->getLoop() != L) in getWideRecurrence()
1771 if (!AddRecOp1 || AddRecOp1->getLoop() != L) in widenWithVariantUse()
2059 if (!AddRec || AddRec->getLoop() != L) in createWideIV()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/
H A DLoopVectorizationLegality.h460 Loop *getLoop() const { return TheLoop; } in getLoop() function
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp647 assert(BasePtrSCEV->getLoop() == L && "AddRec for the wrong loop?"); in rewriteForBase()
880 if (!LARSCEV || LARSCEV->getLoop() != L) in collectCandidates()
1323 if (!LARSCEV || LARSCEV->getLoop() != L) in runOnLoop()

12