Home
last modified time | relevance | path

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

/freebsd-13.1/contrib/llvm-project/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()
418 LAI = &GetLAI(CurLoop); in legalLoopInstructions()
536 CurLoop->getStartLoc(), CurLoop->getHeader()) in isLegalForVersioning()
[all …]
H A DLICM.cpp577 if (inSubLoop(BB, CurLoop, LI)) in sinkRegion()
634 Loop *CurLoop; member in __anoncfbeaccc0511::ControlFlowHoister
648 : LI(LI), DT(DT), CurLoop(CurLoop), MSSAU(MSSAU) {} in ControlFlowHoister()
661 if (!CurLoop->contains(TrueDest) || !CurLoop->contains(FalseDest) || in registerPossiblyHoistableBranch()
788 if (CurLoop->getParentLoop()) in getOrCreateHoistedBlock()
907 LoopBlocksRPO Worklist(CurLoop); in hoistRegion()
1427 if (CurLoop->contains(UI) && in isFreeInLoop()
1465 if (CurLoop->contains(UI)) { in isNotUsedOrFreeInLoop()
1770 if (CurLoop->contains(User)) in sink()
2403 if (CurLoop->begin() != CurLoop->end()) in pointerInvalidatedByLoop()
[all …]
H A DLoopIdiomRecognize.cpp151 Loop *CurLoop = nullptr; member in __anon04ee8af90111::LoopIdiomRecognize
360 CurLoop = L; in runOnLoop()
418 if (LI->getLoopFor(BB) != CurLoop) in runOnCountableLoop()
1708 if (CurLoop->getNumBackEdges() != 1 || CurLoop->getNumBlocks() != 1) in recognizeAndInsertFFS()
1811 if (CurLoop->getNumBackEdges() != 1 || CurLoop->getNumBlocks() != 1) in recognizePopcount()
1993 SE->forgetLoop(CurLoop); in transformLoopToCountable()
2099 SE->forgetLoop(CurLoop); in transformLoopToPopcount()
2150 if (CurLoop->getNumBlocks() != 1 || CurLoop->getNumBackEdges() != 1) { in detectShiftUntilBitTestIdiom()
2441 SE->forgetLoop(CurLoop); in recognizeShiftUntilBitTest()
2489 if (CurLoop->getNumBlocks() != 1 || CurLoop->getNumBackEdges() != 1) { in detectShiftUntilZeroIdiom()
[all …]
H A DSeparateConstOffsetFromGEP.cpp463 Loop *CurLoop);
1283 GetElementPtrInst *FirstGEP, GetElementPtrInst *SecondGEP, Loop *CurLoop) { in isLegalToSwapOperand() argument
1303 if (CurLoop->isLoopInvariant(FirstOffset)) in isLegalToSwapOperand()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DMustExecute.cpp56 BasicBlock *Header = CurLoop->getHeader(); in computeLoopSafetyInfo()
70 computeBlockColors(CurLoop); in computeLoopSafetyInfo()
87 for (auto &BB : CurLoop->blocks()) in computeLoopSafetyInfo()
92 computeBlockColors(CurLoop); in computeLoopSafetyInfo()
163 const Loop *CurLoop, const BasicBlock *BB, in collectTransitivePredecessors() argument
167 if (BB == CurLoop->getHeader()) in collectTransitivePredecessors()
178 if (Pred == CurLoop->getHeader()) in collectTransitivePredecessors()
198 if (BB == CurLoop->getHeader()) in allLoopPathsLeadToBlock()
240 if (CurLoop->contains(Succ) || in allLoopPathsLeadToBlock()
257 if (Inst.getParent() == CurLoop->getHeader()) in isGuaranteedToExecute()
[all …]
H A DDependenceAnalysis.cpp380 AssociatedLoop = CurLoop; in setPoint()
389 AssociatedLoop = CurLoop; in setLine()
398 AssociatedLoop = CurLoop; in setDistance()
1498 CurLoop); in exactSIVtest()
1693 CurLoop); in weakZeroSrcSIVtest()
1802 CurLoop); in weakZeroDstSIVtest()
2156 Level = mapSrcLoop(CurLoop); in testSIV()
2169 symbolicRDIVtest(SrcCoeff, DstCoeff, SrcConst, DstConst, CurLoop, CurLoop); in testSIV()
2176 Level = mapSrcLoop(CurLoop); in testSIV()
2186 Level = mapDstLoop(CurLoop); in testSIV()
[all …]
/freebsd-13.1/contrib/llvm-project/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()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineLICM.cpp318 if (!CurLoop->getLoopPredecessor()) in INITIALIZE_PASS_DEPENDENCY()
369 CurLoop = Worklist.pop_back_val(); in runOnMachineFunction()
376 Worklist.append(CurLoop->begin(), CurLoop->end()); in runOnMachineFunction()
380 CurLoop->getExitBlocks(ExitBlocks); in runOnMachineFunction()
526 for (MachineBasicBlock *BB : CurLoop->getBlocks()) { in HoistRegionPostRA()
647 if (BB != CurLoop->getHeader()) { in IsGuaranteedToExecute()
724 if (!CurLoop->contains(BB)) in HoistOutOfLoop()
995 return CurLoop->isLoopInvariant(I); in IsLoopInvariantInst()
1015 if (CurLoop->contains(&UseMI)) in HasLoopPHIUse()
1043 if (!CurLoop->contains(UseMI.getParent())) in HasHighOperandLatency()
[all …]
H A DPHIElimination.cpp643 const MachineLoop *CurLoop = MLI ? MLI->getLoopFor(&MBB) : nullptr; in SplitPHIEdges() local
644 bool IsLoopHeader = CurLoop && &MBB == CurLoop->getHeader(); in SplitPHIEdges()
661 if (IsLoopHeader && PreLoop == CurLoop && !SplitAllCriticalEdges) in SplitPHIEdges()
690 if (!ShouldSplit && CurLoop != PreLoop) { in SplitPHIEdges()
695 if (CurLoop) in SplitPHIEdges()
696 dbgs() << "CurLoop: " << *CurLoop; in SplitPHIEdges()
702 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()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonVectorLoopCarriedReuse.cpp189 HexagonVectorLoopCarriedReuse(Loop *L) : CurLoop(L){}; in HexagonVectorLoopCarriedReuse()
196 Loop *CurLoop; member in __anon0d183b480111::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()
618 if (BB != CurLoop->getHeader()) { in findDepChainFromPHI()
630 PN->getIncomingValueForBlock(CurLoop->getLoopPreheader()); in findDepChainFromPHI()
[all …]
H A DHexagonLoopIdiomRecognition.cpp132 bool isLegalStore(Loop *CurLoop, StoreInst *SI);
634 Loop *CurLoop; member in __anon087f9c4a0511::PolynomialMultiplyRecognize
932 if (CurLoop->isLoopInvariant(PV.X)) { in scanSelect()
1783 << *CurLoop << '\n'); in recognize()
1789 BasicBlock *LoopB = CurLoop->getHeader(); in recognize()
1792 if (LoopB != CurLoop->getLoopLatch()) in recognize()
1794 BasicBlock *ExitB = CurLoop->getExitBlock(); in recognize()
2023 if (isLegalStore(CurLoop, SI)) in collectStores()
2121 if (!coverLoop(CurLoop, Insts)) in processCopyingStore()
2155 CurLoop->getUniqueExitBlocks(ExitBlocks); in processCopyingStore()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCloneFunction.cpp831 for (Loop *CurLoop : OrigLoop->getLoopsInPreorder()) { in cloneLoopWithPreheader()
832 Loop *&NewLoop = LMap[CurLoop]; in cloneLoopWithPreheader()
837 Loop *OrigParent = CurLoop->getParentLoop(); in cloneLoopWithPreheader()
847 Loop *CurLoop = LI->getLoopFor(BB); in cloneLoopWithPreheader() local
848 Loop *&NewLoop = LMap[CurLoop]; in cloneLoopWithPreheader()
866 Loop *CurLoop = LI->getLoopFor(BB); in cloneLoopWithPreheader() local
867 if (BB == CurLoop->getHeader()) in cloneLoopWithPreheader()
868 LMap[CurLoop]->moveToHeader(cast<BasicBlock>(VMap[BB])); in cloneLoopWithPreheader()
H A DLoopUnrollAndJam.cpp782 Loop *CurLoop = LI.getLoopFor((*Blocks.begin())->front().getParent()); in checkDependencies() local
783 unsigned CurLoopDepth = CurLoop->getLoopDepth(); in checkDependencies()
H A DLoopUtils.cpp458 llvm::collectChildrenInLoop(DomTreeNode *N, const Loop *CurLoop) { in collectChildrenInLoop() argument
463 if (CurLoop->contains(BB)) in collectChildrenInLoop()
H A DScalarEvolutionExpander.cpp762 const Loop *CurLoop = I->first; in visitAddExpr() local
772 for (; I != E && I->first == CurLoop; ++I) { in visitAddExpr()
789 for (++I; I != E && I->first == CurLoop; ++I) in visitAddExpr()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DLoopUtils.h208 const Loop *CurLoop);
336 Loop *CurLoop, AliasSetTracker *CurAST,
/freebsd-13.1/contrib/llvm-project/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()