Home
last modified time | relevance | path

Searched refs:Loops (Results 1 – 25 of 48) sorted by relevance

12

/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopNestAnalysis.h81 Loop &getOutermostLoop() const { return *Loops.front(); } in getOutermostLoop()
87 if (Loops.size() == 1) in getInnermostLoop()
88 return Loops.back(); in getInnermostLoop()
93 Loop *LastLoop = Loops.back(); in getInnermostLoop()
94 auto SecondLastLoopIter = ++Loops.rbegin(); in getInnermostLoop()
102 assert(Index < Loops.size() && "Index is out of bounds"); in getLoop()
103 return Loops[Index]; in getLoop()
115 size_t getNumLoops() const { return Loops.size(); } in getNumLoops()
118 ArrayRef<Loop *> getLoops() const { return Loops; } in getLoops()
122 assert(Depth >= Loops.front()->getLoopDepth() && in getLoopsAtDepth()
[all …]
H A DDependenceAnalysis.h384 SmallBitVector Loops; member
578 SmallBitVector &Loops) const;
584 SmallBitVector &Loops);
590 SmallBitVector &Loops);
630 SmallBitVector &Loops);
676 const SmallBitVector &Loops,
816 const SmallBitVector &Loops,
853 const SmallBitVector &Loops,
903 SmallBitVector &Loops,
989 SmallBitVector &Loops, bool IsSrc);
H A DScalarEvolutionNormalization.h57 const PostIncLoopSet &Loops,
70 const PostIncLoopSet &Loops,
H A DLoopCacheAnalysis.h200 CacheCost(const LoopVectorTy &Loops, const LoopInfo &LI, ScalarEvolution &SE,
262 LoopVectorTy Loops;
H A DBlockFrequencyInfoImpl.h429 std::list<LoopData> Loops; variable
1194 Loops.emplace_back(Parent, Header);
1195 Working[Header.Index].Loop = &Loops.back();
1199 Q.emplace_back(L, &Loops.back());
1232 for (auto L = Loops.rbegin(), E = Loops.rend(); L != E; ++L) {
1341 computeIrreducibleMass(nullptr, Loops.begin());
1355 for (auto L = Loops.rbegin(), E = Loops.rend(); L != E; ++L) {
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DScalarEvolutionNormalization.cpp98 const PostIncLoopSet &Loops, in normalizeForPostIncUse() argument
101 if (Loops.empty()) in normalizeForPostIncUse()
104 return Loops.count(AR->getLoop()); in normalizeForPostIncUse()
108 const SCEV *Denormalized = denormalizeForPostIncUse(Normalized, Loops, SE); in normalizeForPostIncUse()
121 const PostIncLoopSet &Loops, in denormalizeForPostIncUse() argument
123 if (Loops.empty()) in denormalizeForPostIncUse()
126 return Loops.count(AR->getLoop()); in denormalizeForPostIncUse()
H A DLoopCacheAnalysis.cpp62 static Loop *getInnerMostLoop(const LoopVectorTy &Loops) { in getInnerMostLoop() argument
63 assert(!Loops.empty() && "Expecting a non-empy loop vector"); in getInnerMostLoop()
65 Loop *LastLoop = Loops.back(); in getInnerMostLoop()
69 assert(Loops.size() == 1 && "Expecting a single loop"); in getInnerMostLoop()
73 return (llvm::is_sorted(Loops, in getInnerMostLoop()
568 CacheCost::CacheCost(const LoopVectorTy &Loops, const LoopInfo &LI, in CacheCost() argument
572 : Loops(Loops), TRT(TRT.value_or(TemporalReuseThreshold)), LI(LI), SE(SE), in CacheCost()
574 assert(!Loops.empty() && "Expecting a non-empty loop vector."); in CacheCost()
576 for (const Loop *L : Loops) { in CacheCost()
593 LoopVectorTy Loops; in getCacheCost() local
[all …]
H A DDependenceAnalysis.cpp905 SmallBitVector &Loops) const { in collectCommonLoops()
909 Loops.set(Level); in collectCommonLoops()
990 SmallBitVector &Loops, bool IsSrc) { in checkSubscript() argument
1011 Loops.set(mapSrcLoop(AddRec->getLoop())); in checkSubscript()
1013 Loops.set(mapDstLoop(AddRec->getLoop())); in checkSubscript()
1014 return checkSubscript(Start, LoopNest, Loops, IsSrc); in checkSubscript()
1020 SmallBitVector &Loops) { in checkSrcSubscript() argument
1021 return checkSubscript(Src, LoopNest, Loops, true); in checkSrcSubscript()
1027 SmallBitVector &Loops) { in checkDstSubscript() argument
1028 return checkSubscript(Dst, LoopNest, Loops, false); in checkDstSubscript()
[all …]
H A DBlockFrequencyInfoImpl.cpp298 Loops.clear(); in clear()
542 for (LoopData &Loop : Loops) in unwrapLoops()
769 auto Loop = BFI.Loops.emplace(Insert, OuterLoop, Headers.begin(), in createIrreducibleLoop()
784 assert((OuterLoop == nullptr) == (Insert == Loops.begin())); in analyzeIrreducible()
785 auto Prev = OuterLoop ? std::prev(Insert) : Loops.end(); in analyzeIrreducible()
797 return make_range(Loops.begin(), Insert); in analyzeIrreducible()
H A DInlineSizeEstimatorAnalysis.cpp59 Loops, enumerator
196 FF[NamedFeatureIndex::Loops] = std::distance(LI.begin(), LI.end()); in getFunctionFeatures()
H A DLoopNestAnalysis.cpp44 append_range(Loops, breadth_first(&Root)); in LoopNest()
245 for (Loop *L : depth_first(const_cast<Loop *>(Loops.front()))) { in getPerfectLoops()
H A DMustExecute.cpp368 const auto &Loops = MustExec.lookup(&V); in printInfoComment() local
369 const auto NumLoops = Loops.size(); in printInfoComment()
376 for (const Loop *L : Loops) in printInfoComment()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DCalcSpillWeights.h50 const MachineLoopInfo &Loops; variable
60 const VirtRegMap &VRM, const MachineLoopInfo &Loops,
63 : MF(MF), LIS(LIS), VRM(VRM), Loops(Loops), PSI(PSI), MBFI(MBFI) {} in MF()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIOptimizeVGPRLiveRange.cpp96 const MachineLoopInfo *Loops = nullptr; member in __anon0f1b199c0111::SIOptimizeVGPRLiveRange
101 MachineLoopInfo *Loops) in SIOptimizeVGPRLiveRange() argument
102 : LV(LV), MDT(MDT), Loops(Loops) {} in SIOptimizeVGPRLiveRange()
257 Loops->getLoopFor(DefMBB) == Loops->getLoopFor(If)) { in collectCandidateRegisters()
302 Loops->getLoopFor(DefMBB) == Loops->getLoopFor(If)) in collectCandidateRegisters()
645 MachineLoopInfo *Loops = &getAnalysis<MachineLoopInfoWrapperPass>().getLI(); in runOnMachineFunction() local
646 return SIOptimizeVGPRLiveRange(LV, MDT, Loops).run(MF); in runOnMachineFunction()
655 MachineLoopInfo *Loops = &MFAM.getResult<MachineLoopAnalysis>(MF); in run() local
657 bool Changed = SIOptimizeVGPRLiveRange(LV, MDT, Loops).run(MF); in run()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp300 BB2BBMap Loops; member in __anone8c890770111::StructurizeCFG
316 void insertConditions(bool Loops);
478 Loops[Exit] = N->getEntry(); in analyzeLoops()
487 Loops[Succ] = BB; in analyzeLoops()
536 if (Visited.count(Other) && !Loops.count(Other) && in gatherPredicates()
574 Loops.clear(); in collectInfos()
597 void StructurizeCFG::insertConditions(bool Loops) { in insertConditions() argument
598 BranchVector &Conds = Loops ? LoopConds : Conditions; in insertConditions()
599 Value *Default = Loops ? BoolTrue : BoolFalse; in insertConditions()
610 PhiInserter.AddAvailableValue(Loops ? SuccFalse : Parent, Default); in insertConditions()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMLRegAllocEvictAdvisor.cpp298 const MachineLoopInfo &Loops);
359 const MachineLoopInfo &Loops; member in __anonb6cddc090111::MLEvictAdvisor
413 MachineBlockFrequencyInfo *MBFI, MachineLoopInfo *Loops) override { in getAdvisor() argument
424 assert(MBFI && Loops && in getAdvisor()
427 *Loops); in getAdvisor()
483 const MachineLoopInfo &Loops, Logger *Log) in DevelopmentModeEvictAdvisor() argument
484 : MLEvictAdvisor(MF, RA, Runner, MBFI, Loops), Log(Log) {} in DevelopmentModeEvictAdvisor()
577 MachineBlockFrequencyInfo *MBFI, MachineLoopInfo *Loops) override { in getAdvisor() argument
582 assert(MBFI && Loops && in getAdvisor()
585 MF, RA, Runner.get(), *MBFI, *Loops, Log.get()); in getAdvisor()
[all …]
H A DEarlyIfConversion.cpp809 MachineLoopInfo *Loops = nullptr; member in __anon4c5015260311::EarlyIfConverter
817 : DomTree(&DT), Loops(&LI), Traces(&MTM) {} in EarlyIfConverter()
880 void updateLoops(MachineLoopInfo *Loops, in updateLoops() argument
885 Loops->removeBlock(B); in updateLoops()
927 MachineLoop *CurrentLoop = Loops->getLoopFor(IfConv.Head); in shouldConvertIf()
1124 updateLoops(Loops, RemoveBlocks); in tryConvertIf()
1202 MachineLoopInfo *Loops = nullptr; member in __anon4c5015260b11::EarlyIfPredicator
1291 updateLoops(Loops, RemoveBlocks); in tryConvertIf()
1308 Loops = &getAnalysis<MachineLoopInfoWrapperPass>().getLI(); in runOnMachineFunction()
H A DMLRegallocEvictAdvisor.cpp
H A DMachineTraceMetrics.cpp81 Loops = &LI; in init()
183 return MTM.Loops->getLoopFor(MBB); in getLoopFor()
477 const MachineLoopInfo *Loops; member
481 const MachineLoopInfo *loops) : Blocks(blocks), Loops(loops) {} in LoopBounds()
507 if (const MachineLoop *FromLoop = LB.Loops->getLoopFor(*From)) { in insertEdge()
512 if (isExitingLoop(FromLoop, LB.Loops->getLoopFor(To))) in insertEdge()
529 LoopBounds Bounds(BlockInfo, MTM.Loops); in computeTrace()
H A DRegAllocGreedy.cpp183 MachineLoopInfo *Loops = nullptr; member
208 Loops = Analyses.Loops; in RAGreedy()
234 Loops = &MFAM.getResult<MachineLoopAnalysis>(MF); in RequiredAnalyses()
275 Loops = &P.getAnalysis<MachineLoopInfoWrapperPass>().getLI(); in RequiredAnalyses()
914 MachineLoop *L = Loops->getLoopFor(MF->getBlockNumbered(NewBlocks[0])); in growRegion()
917 return L == Loops->getLoopFor(MF->getBlockNumbered(Block)); in growRegion()
2787 if (Loops->getLoopFor(MBB) == L) in reportStats()
2808 for (MachineLoop *L : *Loops) in reportStats()
2812 if (!Loops->getLoopFor(&MBB)) in reportStats()
2877 EvictAdvisor = EvictProvider->getAdvisor(*MF, *this, MBFI, Loops); in run()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DLoopExtractor.cpp223 SmallVector<Loop *, 8> Loops; in extractLoops() local
226 Loops.assign(From, To); in extractLoops()
227 for (Loop *L : Loops) { in extractLoops()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86CmovConversion.cpp237 SmallVector<MachineLoop *, 4> Loops(MLI->begin(), MLI->end()); in runOnMachineFunction() local
240 for (int i = 0; i < (int)Loops.size(); ++i) in runOnMachineFunction()
241 llvm::append_range(Loops, Loops[i]->getSubLoops()); in runOnMachineFunction()
243 for (MachineLoop *CurrLoop : Loops) { in runOnMachineFunction()
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericLoopInfoImpl.h403 DenseSet<const LoopT *> *Loops) const { in verifyLoopNest() argument
405 Loops->insert(static_cast<const LoopT *>(this)); in verifyLoopNest()
410 (*I)->verifyLoopNest(Loops); in verifyLoopNest()
721 DenseSet<const LoopT *> Loops; in verify() local
724 (*I)->verifyLoopNest(&Loops); in verify()
732 assert(Loops.count(L) && "orphaned loop"); in verify()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DUnifyLoopExits.cpp207 auto Loops = LI.getLoopsInPreorder(); in runImpl() local
208 for (auto *L : Loops) { in runImpl()
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64ConditionalCompares.cpp767 MachineLoopInfo *Loops; member in __anon79d718350211::AArch64ConditionalCompares
834 if (!Loops) in updateLoops()
837 Loops->removeBlock(RemovedMBB); in updateLoops()
936 Loops = &getAnalysis<MachineLoopInfoWrapperPass>().getLI(); in runOnMachineFunction()

12