Home
last modified time | relevance | path

Searched refs:CurLoop (Results 1 – 19 of 19) sorted by relevance

/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
H A DLoopVersioningLICM.cpp162 CurLoop = nullptr; in reset()
193 Loop *CurLoop = nullptr; member
230 if (!CurLoop->isLoopSimplifyForm()) { in legalLoopStructure()
235 if (!CurLoop->getSubLoops().empty()) { in legalLoopStructure()
240 if (CurLoop->getNumBackEdges() != 1) { in legalLoopStructure()
245 if (!CurLoop->getExitingBlock()) { in legalLoopStructure()
252 if (CurLoop->getExitingBlock() != CurLoop->getLoopLatch()) { in legalLoopStructure()
258 if (CurLoop->isAnnotatedParallel()) { in legalLoopStructure()
263 if (CurLoop->getLoopDepth() > LoopDepthThreshold) { in legalLoopStructure()
269 const SCEV *ExitCount = SE->getBackedgeTakenCount(CurLoop); in legalLoopStructure()
[all …]
H A DLICM.cpp151 static bool inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI);
152 static bool isNotUsedOrFreeInLoop(const Instruction &I, const Loop *CurLoop,
155 static void hoist(Instruction &I, const DominatorTree *DT, const Loop *CurLoop,
160 BlockFrequencyInfo *BFI, const Loop *CurLoop,
166 const Loop *CurLoop,
171 AliasSetTracker *CurAST, Loop *CurLoop,
174 Loop *CurLoop, Instruction &I,
527 Loop *CurLoop, AliasSetTracker *CurAST, in sinkRegion() argument
534 CurLoop != nullptr && SafetyInfo != nullptr && in sinkRegion()
542 SmallVector<DomTreeNode *, 16> Worklist = collectChildrenInLoop(N, CurLoop); in sinkRegion()
[all …]
H A DLoopIdiomRecognize.cpp150 Loop *CurLoop = nullptr; member in __anon705bfb100111::LoopIdiomRecognize
359 CurLoop = L; in runOnLoop()
386 const SCEV *BECount = SE->getBackedgeTakenCount(CurLoop); in runOnCountableLoop()
398 CurLoop->getUniqueExitBlocks(ExitBlocks); in runOnCountableLoop()
401 << CurLoop->getHeader()->getParent()->getName() in runOnCountableLoop()
402 << "] Countable Loop %" << CurLoop->getHeader()->getName() in runOnCountableLoop()
408 SafetyInfo.computeLoopSafetyInfo(CurLoop); in runOnCountableLoop()
415 for (auto *BB : CurLoop->getBlocks()) { in runOnCountableLoop()
417 if (LI->getLoopFor(BB) != CurLoop) in runOnCountableLoop()
508 if (!StoreEv || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine()) in isLegalStore()
[all …]
H A DSeparateConstOffsetFromGEP.cpp463 Loop *CurLoop);
1283 GetElementPtrInst *FirstGEP, GetElementPtrInst *SecondGEP, Loop *CurLoop) { in isLegalToSwapOperand() argument
1303 if (CurLoop->isLoopInvariant(FirstOffset)) in isLegalToSwapOperand()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DMustExecute.cpp54 void SimpleLoopSafetyInfo::computeLoopSafetyInfo(const Loop *CurLoop) { in computeLoopSafetyInfo() argument
55 assert(CurLoop != nullptr && "CurLoop can't be null"); in computeLoopSafetyInfo()
56 BasicBlock *Header = CurLoop->getHeader(); in computeLoopSafetyInfo()
63 assert(Header == *CurLoop->getBlocks().begin() && in computeLoopSafetyInfo()
65 for (Loop::block_iterator BB = std::next(CurLoop->block_begin()), in computeLoopSafetyInfo()
66 BBE = CurLoop->block_end(); in computeLoopSafetyInfo()
70 computeBlockColors(CurLoop); in computeLoopSafetyInfo()
81 void ICFLoopSafetyInfo::computeLoopSafetyInfo(const Loop *CurLoop) { in computeLoopSafetyInfo() argument
82 assert(CurLoop != nullptr && "CurLoop can't be null"); in computeLoopSafetyInfo()
87 for (auto &BB : CurLoop->blocks()) in computeLoopSafetyInfo()
[all …]
H A DDependenceAnalysis.cpp376 const Loop *CurLoop) { in setPoint() argument
380 AssociatedLoop = CurLoop; in setPoint()
384 const SCEV *CC, const Loop *CurLoop) { in setLine() argument
389 AssociatedLoop = CurLoop; in setLine()
393 const Loop *CurLoop) { in setDistance() argument
398 AssociatedLoop = CurLoop; in setDistance()
1146 const SCEV *DstConst, const Loop *CurLoop, in strongSIVtest() argument
1165 if (const SCEV *UpperBound = collectUpperBound(CurLoop, Delta->getType())) { in strongSIVtest()
1198 NewConstraint.setDistance(SE->getConstant(Distance), CurLoop); in strongSIVtest()
1210 NewConstraint.setDistance(Delta, CurLoop); in strongSIVtest()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DMustExecute.h66 void computeBlockColors(const Loop *CurLoop);
85 bool allLoopPathsLeadToBlock(const Loop *CurLoop, const BasicBlock *BB,
93 virtual void computeLoopSafetyInfo(const Loop *CurLoop) = 0;
99 const Loop *CurLoop) const = 0;
120 void computeLoopSafetyInfo(const Loop *CurLoop) override;
124 const Loop *CurLoop) const override;
145 void computeLoopSafetyInfo(const Loop *CurLoop) override;
149 const Loop *CurLoop) const override;
153 bool doesNotWriteMemoryBefore(const BasicBlock *BB, const Loop *CurLoop)
158 bool doesNotWriteMemoryBefore(const Instruction &I, const Loop *CurLoop)
H A DLoopInfo.h99 for (const LoopT *CurLoop = ParentLoop; CurLoop; in getLoopDepth() local
100 CurLoop = CurLoop->ParentLoop) in getLoopDepth()
363 const LoopT *CurLoop = static_cast<const LoopT *>(this); in getLoopsInPreorder() local
364 PreOrderLoops.push_back(CurLoop); in getLoopsInPreorder()
365 getInnerLoopsInPreorder(*CurLoop, PreOrderLoops); in getLoopsInPreorder()
370 LoopT *CurLoop = static_cast<LoopT *>(this); in getLoopsInPreorder() local
371 PreOrderLoops.push_back(CurLoop); in getLoopsInPreorder()
372 getInnerLoopsInPreorder(*CurLoop, PreOrderLoops); in getLoopsInPreorder()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DMachineLICM.cpp133 MachineLoop *CurLoop; // The current loop we are working on. member in __anondcd5ce190111::MachineLICMBase
316 static bool LoopIsOuterMostWithPredecessor(MachineLoop *CurLoop) { in INITIALIZE_PASS_DEPENDENCY()
318 if (!CurLoop->getLoopPredecessor()) in INITIALIZE_PASS_DEPENDENCY()
321 for (MachineLoop *L = CurLoop->getParentLoop(); L; L = L->getParentLoop()) in INITIALIZE_PASS_DEPENDENCY()
369 CurLoop = Worklist.pop_back_val(); in runOnMachineFunction()
375 if (PreRegAlloc && !LoopIsOuterMostWithPredecessor(CurLoop)) { in runOnMachineFunction()
376 Worklist.append(CurLoop->begin(), CurLoop->end()); in runOnMachineFunction()
380 CurLoop->getExitBlocks(ExitBlocks); in runOnMachineFunction()
387 MachineDomTreeNode *N = DT->getNode(CurLoop->getHeader()); in runOnMachineFunction()
526 for (MachineBasicBlock *BB : CurLoop->getBlocks()) { in HoistRegionPostRA()
[all …]
H A DPHIElimination.cpp633 const MachineLoop *CurLoop = MLI ? MLI->getLoopFor(&MBB) : nullptr; in SplitPHIEdges() local
634 bool IsLoopHeader = CurLoop && &MBB == CurLoop->getHeader(); in SplitPHIEdges()
651 if (IsLoopHeader && PreLoop == CurLoop && !SplitAllCriticalEdges) in SplitPHIEdges()
680 if (!ShouldSplit && CurLoop != PreLoop) { in SplitPHIEdges()
685 if (CurLoop) in SplitPHIEdges()
686 dbgs() << "CurLoop: " << *CurLoop; in SplitPHIEdges()
692 ShouldSplit = PreLoop && !PreLoop->contains(CurLoop); in SplitPHIEdges()
H A DMachineTraceMetrics.cpp329 const MachineLoop *CurLoop = getLoopFor(MBB); in pickTracePred() local
331 if (CurLoop && MBB == CurLoop->getHeader()) in pickTracePred()
357 const MachineLoop *CurLoop = getLoopFor(MBB); in pickTraceSucc() local
362 if (CurLoop && Succ == CurLoop->getHeader()) in pickTraceSucc()
365 if (isExitingLoop(CurLoop, getLoopFor(Succ))) in pickTraceSucc()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
H A DHexagonVectorLoopCarriedReuse.cpp189 HexagonVectorLoopCarriedReuse(Loop *L) : CurLoop(L){}; in HexagonVectorLoopCarriedReuse()
196 Loop *CurLoop; member in __anon7e23d25f0111::HexagonVectorLoopCarriedReuse
245 if (!CurLoop->getLoopPreheader()) in run()
249 if (!CurLoop->getSubLoops().empty()) in run()
253 if (CurLoop->getNumBlocks() != 1) in run()
530 BasicBlock *LoopPH = CurLoop->getLoopPreheader(); in reuseValue()
578 assert(CurLoop->getSubLoops().empty() && in doVLCR()
580 assert((CurLoop->getNumBlocks() == 1) && in doVLCR()
586 LLVM_DEBUG(dbgs() << "Working on Loop: " << *CurLoop->getHeader() << "\n"); in doVLCR()
618 if (BB != CurLoop->getHeader()) { in findDepChainFromPHI()
[all …]
H A DHexagonLoopIdiomRecognition.cpp132 bool isLegalStore(Loop *CurLoop, StoreInst *SI);
133 void collectStores(Loop *CurLoop, BasicBlock *BB,
135 bool processCopyingStore(Loop *CurLoop, StoreInst *SI, const SCEV *BECount);
137 bool runOnLoopBlock(Loop *CurLoop, BasicBlock *BB, const SCEV *BECount,
581 : CurLoop(loop), DL(dl), DT(dt), TLI(tli), SE(se) {} in PolynomialMultiplyRecognize()
589 LLVMContext &Ctx = CurLoop->getHeader()->getParent()->getContext(); in getPmpyType()
634 Loop *CurLoop; member in __anonf6bc81a10511::PolynomialMultiplyRecognize
932 if (CurLoop->isLoopInvariant(PV.X)) { in scanSelect()
1783 << *CurLoop << '\n'); in recognize()
1789 BasicBlock *LoopB = CurLoop->getHeader(); in recognize()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
H A DCloneFunction.cpp828 for (Loop *CurLoop : OrigLoop->getLoopsInPreorder()) { in cloneLoopWithPreheader()
829 Loop *&NewLoop = LMap[CurLoop]; in cloneLoopWithPreheader()
834 Loop *OrigParent = CurLoop->getParentLoop(); in cloneLoopWithPreheader()
844 Loop *CurLoop = LI->getLoopFor(BB); in cloneLoopWithPreheader() local
845 Loop *&NewLoop = LMap[CurLoop]; in cloneLoopWithPreheader()
863 Loop *CurLoop = LI->getLoopFor(BB); in cloneLoopWithPreheader() local
864 if (BB == CurLoop->getHeader()) in cloneLoopWithPreheader()
865 LMap[CurLoop]->moveToHeader(cast<BasicBlock>(VMap[BB])); in cloneLoopWithPreheader()
H A DLoopUnrollAndJam.cpp785 Loop *CurLoop = LI.getLoopFor((*Blocks.begin())->front().getParent()); in checkDependencies() local
786 unsigned CurLoopDepth = CurLoop->getLoopDepth(); in checkDependencies()
H A DLoopUtils.cpp519 llvm::collectChildrenInLoop(DomTreeNode *N, const Loop *CurLoop) { in collectChildrenInLoop() argument
524 if (CurLoop->contains(BB)) in collectChildrenInLoop()
H A DScalarEvolutionExpander.cpp752 const Loop *CurLoop = I->first; in visitAddExpr() local
762 for (; I != E && I->first == CurLoop; ++I) { in visitAddExpr()
779 for (++I; I != E && I->first == CurLoop; ++I) in visitAddExpr()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/
H A DLoopUtils.h208 const Loop *CurLoop);
354 Loop *CurLoop, AliasSetTracker *CurAST,
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
H A DInstrProfiling.cpp240 Loop &CurLoop, LoopInfo &LI, BlockFrequencyInfo *BFI) in PGOCounterPromoter() argument
241 : LoopToCandidates(LoopToCands), ExitBlocks(), InsertPts(), L(CurLoop), in PGOCounterPromoter()