/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
H A D | ScalarEvolutionNormalization.cpp | 54 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap); in visitAddRecExpr() 93 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap); in visitAddRecExpr() 100 return Loops.count(AR->getLoop()); in normalizeForPostIncUse() 114 return Loops.count(AR->getLoop()); in denormalizeForPostIncUse()
|
H A D | BranchProbabilityInfo.cpp | 255 return (DstBlock.getLoop() && in isLoopEnteringEdge() 256 !DstBlock.getLoop()->contains(SrcBlock.getLoop())) || in isLoopEnteringEdge() 275 ((DstBlock.getLoop() && in isLoopBackEdge() 276 DstBlock.getLoop()->getHeader() == DstBlock.getBlock()) || in isLoopBackEdge() 283 if (LB.getLoop()) { in getLoopEnterBlocks() 284 auto *Header = LB.getLoop()->getHeader(); in getLoopEnterBlocks() 294 if (LB.getLoop()) { in getLoopExitBlocks() 295 LB.getLoop()->getExitBlocks(Exits); in getLoopExitBlocks() 835 if (LoopBB.getLoop()) in calcEstimatedHeuristics() 836 computeUnlikelySuccessors(BB, LoopBB.getLoop(), UnlikelyBlocks); in calcEstimatedHeuristics() [all …]
|
H A D | IVUsers.cpp | 66 if (AR->getLoop() == L) in isInteresting() 257 auto *L = AR->getLoop(); in AddUsersImpl() 397 if (AR->getLoop() == L) in findAddRecForLoop()
|
H A D | DependenceAnalysis.cpp | 896 const SCEV *UB = SE->getBackedgeTakenCount(AddRec->getLoop()); in checkSubscript() 907 Loops.set(mapSrcLoop(AddRec->getLoop())); in checkSubscript() 909 Loops.set(mapDstLoop(AddRec->getLoop())); in checkSubscript() 1028 const SCEV *BECount = SE->getBackedgeTakenCount(AddRec->getLoop()); in isKnownLessThan() 2153 const Loop *CurLoop = SrcAddRec->getLoop(); in testSIV() 2154 assert(CurLoop == DstAddRec->getLoop() && in testSIV() 2175 const Loop *CurLoop = SrcAddRec->getLoop(); in testSIV() 2185 const Loop *CurLoop = DstAddRec->getLoop(); in testSIV() 2228 SrcLoop = SrcAddRec->getLoop(); in testRDIV() 2231 DstLoop = DstAddRec->getLoop(); in testRDIV() [all …]
|
H A D | LoopCacheAnalysis.cpp | 86 assert(AR->getLoop() && "AR should have a loop"); in isOneDimensionalArray() 375 AccessFnAR->getLoop(), in delinearize() 439 return (AR != nullptr) ? AR->getLoop() != &L in isCoeffForLoopZeroOrInvariant() 449 assert(AR->getLoop() && "AR should have a loop"); in isSimpleAddRecurrence()
|
H A D | ScalarEvolution.cpp | 297 AR->getLoop()->getHeader()->printAsOperand(OS, /*PrintType=*/false); in print() 746 const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop(); in CompareSCEVComplexity() 1252 return getAddRecExpr(Operands, AddRec->getLoop(), SCEV::FlagAnyWrap); in getTruncateExpr() 1370 const Loop *L = AR->getLoop(); in getPreStartForExtend() 1620 const Loop *L = AR->getLoop(); in getZeroExtendExpr() 1960 const Loop *L = AR->getLoop(); in getSignExtendExpr() 2140 return getAddRecExpr(Ops, AR->getLoop(), SCEV::FlagNW); in getAnyExtendExpr() 2616 const Loop *AddRecLoop = AddRec->getLoop(); in getAddExpr() 2668 cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()->getHeader(), in getAddExpr() 2669 AddRec->getLoop()->getHeader()) && in getAddExpr() [all …]
|
H A D | ScalarEvolutionDivision.cpp | 142 Quotient = SE.getAddRecExpr(StartQ, StepQ, Numerator->getLoop(), in visitAddRecExpr() 144 Remainder = SE.getAddRecExpr(StartR, StepR, Numerator->getLoop(), in visitAddRecExpr()
|
H A D | IVDescriptors.cpp | 1075 const Loop *L = AR->getLoop(); in getCastsForInductionPHI() 1202 if (AR->getLoop() != TheLoop) { in isInductionPHI() 1211 Phi->getIncomingValueForBlock(AR->getLoop()->getLoopPreheader()); in isInductionPHI() 1213 BasicBlock *Latch = AR->getLoop()->getLoopLatch(); in isInductionPHI()
|
H A D | LoopUnrollAnalyzer.cpp | 44 if (!AR || AR->getLoop() != L) in simplifyInstWithSCEV()
|
H A D | Loads.cpp | 294 if (!AddRec || AddRec->getLoop() != L || !AddRec->isAffine()) in isDereferenceableAndAlignedInLoop()
|
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
H A D | BranchProbabilityInfo.h | 303 Loop *getLoop() const { return LD.first; } in getLoop() function 306 bool belongsToLoop() const { return getLoop() || getSccNum() != -1; } in belongsToLoop() 308 return (LB.getLoop() && getLoop() == LB.getLoop()) || in belongsToSameLoop()
|
H A D | ScalarEvolutionExpressions.h | 363 const Loop *getLoop() const { return L; } in getLoop() function 373 getLoop(), FlagAnyWrap); in getStepRecurrence() 796 : SE.getAddRecExpr(Operands, Expr->getLoop(), in visitAddRecExpr() 897 const Loop *L = Expr->getLoop(); in visitAddRecExpr()
|
H A D | LoopNestAnalysis.h | 92 Loop *getLoop(unsigned Index) const { in getLoop() function
|
H A D | IVUsers.h | 124 Loop *getLoop() const { return L; } in getLoop() function
|
H A D | LoopIterator.h | 120 Loop *getLoop() const { return L; } in getLoop() function
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
H A D | ScalarEvolutionExpander.cpp | 347 S = SE.getAddRecExpr(Start, Step, A->getLoop(), in FactorOutConstant() 400 A->getLoop(), in SplitAddRecs() 680 L = AR->getLoop(); in getRelevantLoop() 926 A->getLoop(), in ExposePointerBase() 1392 const Loop *L = S->getLoop(); in expandAddRecExprLiterally() 1411 Normalized->getLoop(), in expandAddRecExprLiterally() 1430 Start, Step, Normalized->getLoop(), in expandAddRecExprLiterally() 1559 const Loop *L = S->getLoop(); in visitAddRecExpr() 1575 Value *V = expand(SE.getAddRecExpr(NewOps, S->getLoop(), in visitAddRecExpr() 2489 SE.getPredicatedBackedgeTakenCount(AR->getLoop(), Pred); in generateOverflowCheck() [all …]
|
H A D | SimplifyIndVar.cpp | 862 if (AR && AR->getLoop() == L) in isSimpleIVUser() 1395 if (!AddRec || AddRec->getLoop() != L) in getExtendedOperandRecurrence() 1436 if (!AddRec || AddRec->getLoop() != L) in getWideRecurrence() 1624 if (!AddRecOp1 || AddRecOp1->getLoop() != L) in widenWithVariantUse() 1891 if (!AddRec || AddRec->getLoop() != L) in createWideIV()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
H A D | PPCLoopInstrFormPrep.cpp | 368 if (!LARSCEV || LARSCEV->getLoop() != L) in collectCandidates() 503 assert(BasePtrSCEV->getLoop() == L && "AddRec for the wrong loop?"); in rewriteLoadStores() 848 if (!LARSCEV || LARSCEV->getLoop() != L) in runOnLoop()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
H A D | LoopStrengthReduce.cpp | 429 AR->getLoop(), SCEV::FlagAnyWrap), in DoInitialMatch() 492 if (SAR && SAR->getLoop() == &L) in isCanonical() 500 (cast<SCEVAddRecExpr>(S)->getLoop() == &L); in isCanonical() 528 if (!SAR || SAR->getLoop() != &L) { in canonicalize() 531 (cast<SCEVAddRecExpr>(S)->getLoop() == &L); in canonicalize() 714 return SE.getAddRecExpr(Start, Step, AR->getLoop(), SCEV::FlagAnyWrap); in getExactSDiv() 774 S = SE.getAddRecExpr(NewOps, AR->getLoop(), in ExtractImmediate() 800 S = SE.getAddRecExpr(NewOps, AR->getLoop(), in ExtractSymbol() 911 for (PHINode &PN : AR->getLoop()->getHeader()->phis()) { in isExistingPhi() 1246 if (AR->getLoop() != L) { in RateRegister() [all …]
|
H A D | LoopIdiomRecognize.cpp | 508 if (!StoreEv || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine()) in isLegalStore() 567 if (!LoadEv || LoadEv->getLoop() != CurLoop || !LoadEv->isAffine()) in isLegalStore() 846 if (!StoreEv || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine()) in processLoopMemCpy() 849 if (!LoadEv || LoadEv->getLoop() != CurLoop || !LoadEv->isAffine()) in processLoopMemCpy() 911 if (!Ev || Ev->getLoop() != CurLoop || !Ev->isAffine()) in processLoopMemSet()
|
H A D | LoopFuse.cpp | 1034 const Loop *ExprL = Expr->getLoop(); in visitAddRecExpr() 1097 return !DT.dominates(L0Header, AddRec->getLoop()->getHeader()) && in accessDiffIsPositive() 1098 !DT.dominates(AddRec->getLoop()->getHeader(), L0Header); in accessDiffIsPositive()
|
H A D | LoopRerollPass.cpp | 595 if (PHISCEV->getLoop() != L) in collectPossibleIVs() 933 if (!IVU_ADR || IVU_ADR->getLoop() != L) in findRootsBase()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
H A D | ModuloSchedule.cpp | 67 BB = Schedule.getLoop()->getTopBlock(); in expand() 1984 KernelRewriter KR(*Schedule.getLoop(), Schedule); in rewriteKernel() 1989 BB = Schedule.getLoop()->getTopBlock(); in expand() 1990 Preheader = Schedule.getLoop()->getLoopPreheader(); in expand() 2001 BB = Schedule.getLoop()->getTopBlock(); in validateAgainstModuloScheduleExpander() 2002 Preheader = Schedule.getLoop()->getLoopPreheader(); in validateAgainstModuloScheduleExpander() 2027 KernelRewriter KR(*Schedule.getLoop(), Schedule); in validateAgainstModuloScheduleExpander()
|
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
H A D | ModuloSchedule.h | 118 MachineLoop *getLoop() const { return Loop; } in getLoop() function
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/ARM/ |
H A D | MVETailPredication.cpp | 323 if (AddExpr->getLoop() != L) { in IsSafeActiveMask()
|