Home
last modified time | relevance | path

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

12

/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopNestAnalysis.h80 Loop &getOutermostLoop() const { return *Loops.front(); } in getOutermostLoop()
86 if (Loops.size() == 1) in getInnermostLoop()
87 return Loops.back(); in getInnermostLoop()
92 Loop *LastLoop = Loops.back(); in getInnermostLoop()
93 auto SecondLastLoopIter = ++Loops.rbegin(); in getInnermostLoop()
102 return Loops[Index]; in getLoop()
114 size_t getNumLoops() const { return Loops.size(); } in getNumLoops()
117 ArrayRef<Loop *> getLoops() const { return Loops; } in getLoops()
121 assert(Depth >= Loops.front()->getLoopDepth() && in getLoopsAtDepth()
157 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1; in getNestDepth()
[all …]
H A DDependenceAnalysis.h370 SmallBitVector Loops; member
563 SmallBitVector &Loops) const;
569 SmallBitVector &Loops);
575 SmallBitVector &Loops);
615 SmallBitVector &Loops);
661 const SmallBitVector &Loops,
801 const SmallBitVector &Loops,
838 const SmallBitVector &Loops,
888 SmallBitVector &Loops,
974 SmallBitVector &Loops, bool IsSrc);
H A DScalarEvolutionNormalization.h55 const SCEV *normalizeForPostIncUse(const SCEV *S, const PostIncLoopSet &Loops,
66 const SCEV *denormalizeForPostIncUse(const SCEV *S, const PostIncLoopSet &Loops,
H A DLoopCacheAnalysis.h201 CacheCost(const LoopVectorTy &Loops, const LoopInfo &LI, ScalarEvolution &SE,
263 LoopVectorTy Loops;
H A DBlockFrequencyInfoImpl.h432 std::list<LoopData> Loops; variable
1202 Loops.emplace_back(Parent, Header);
1203 Working[Header.Index].Loop = &Loops.back();
1207 Q.emplace_back(L, &Loops.back());
1240 for (auto L = Loops.rbegin(), E = Loops.rend(); L != E; ++L) {
1349 computeIrreducibleMass(nullptr, Loops.begin());
1363 for (auto L = Loops.rbegin(), E = Loops.rend(); L != E; ++L) {
/freebsd-14.2/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
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()
561 : Loops(Loops), TRT(TRT.value_or(TemporalReuseThreshold)), LI(LI), SE(SE), in CacheCost()
565 for (const Loop *L : Loops) { in CacheCost()
582 LoopVectorTy Loops; in getCacheCost() local
583 append_range(Loops, breadth_first(&Root)); in getCacheCost()
585 if (!getInnerMostLoop(Loops)) { in getCacheCost()
601 for (const Loop *L : Loops) { in calculateCacheFootprint()
[all …]
H A DDependenceAnalysis.cpp882 Loops.set(Level); in collectCommonLoops()
1026 Loops = SrcLoops; in classifyPair()
1027 Loops |= DstLoops; in classifyPair()
1028 unsigned N = Loops.count(); in classifyPair()
2650 if (Loops[K]) { in banerjeeMIVtest()
2698 if (Loops[K]) in exploreDirections()
2707 if (Loops[K]) { in exploreDirections()
2732 if (Loops[Level]) { in exploreDirections()
3668 Pair[P].Loops); in depends()
3944 CompleteLoops |= Pair[SI].Loops; in depends()
[all …]
H A DBlockFrequencyInfoImpl.cpp298 Loops.clear(); in clear()
542 for (LoopData &Loop : Loops) in unwrapLoops()
784 auto Loop = BFI.Loops.emplace(Insert, OuterLoop, Headers.begin(), in createIrreducibleLoop()
799 assert((OuterLoop == nullptr) == (Insert == Loops.begin())); in analyzeIrreducible()
800 auto Prev = OuterLoop ? std::prev(Insert) : Loops.end(); in analyzeIrreducible()
812 return make_range(Loops.begin(), Insert); in analyzeIrreducible()
H A DInlineSizeEstimatorAnalysis.cpp60 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.cpp360 const auto &Loops = MustExec.lookup(&V); in printInfoComment() local
361 const auto NumLoops = Loops.size(); in printInfoComment()
368 for (const Loop *L : Loops) in printInfoComment()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DCalcSpillWeights.h49 const MachineLoopInfo &Loops; variable
58 const VirtRegMap &VRM, const MachineLoopInfo &Loops, in VirtRegAuxInfo() argument
60 : MF(MF), LIS(LIS), VRM(VRM), Loops(Loops), MBFI(MBFI) {} in VirtRegAuxInfo()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp262 BB2BBMap Loops; member in __anon821ac72d0111::StructurizeCFG
280 void insertConditions(bool Loops);
438 Loops[Exit] = N->getEntry(); in analyzeLoops()
447 Loops[Succ] = BB; in analyzeLoops()
528 Loops.clear(); in collectInfos()
559 void StructurizeCFG::insertConditions(bool Loops) { in insertConditions() argument
560 BranchVector &Conds = Loops ? LoopConds : Conditions; in insertConditions()
561 Value *Default = Loops ? BoolTrue : BoolFalse; in insertConditions()
980 if (!Loops.count(LoopStart)) { in handleLoops()
988 LoopEnd = Loops[Node->getEntry()]; in handleLoops()
[all …]
H A DLoopUnrollAndJamPass.cpp429 ArrayRef<Loop *> Loops = LN.getLoops(); in tryToUnrollAndJamLoop() local
435 appendLoopsToWorklist(Loops, Worklist); in tryToUnrollAndJamLoop()
/freebsd-14.2/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-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DEarlyIfConversion.cpp768 MachineLoopInfo *Loops = nullptr; member in __anone8860c9c0311::EarlyIfConverter
829 void updateLoops(MachineLoopInfo *Loops, in updateLoops() argument
834 Loops->removeBlock(B); in updateLoops()
876 MachineLoop *CurrentLoop = Loops->getLoopFor(IfConv.Head); in shouldConvertIf()
1072 updateLoops(Loops, RemovedBlocks); in tryConvertIf()
1093 Loops = &getAnalysis<MachineLoopInfo>(); in runOnMachineFunction()
1123 MachineLoopInfo *Loops = nullptr; member in __anone8860c9c0b11::EarlyIfPredicator
1210 updateLoops(Loops, RemovedBlocks); in tryConvertIf()
1227 Loops = &getAnalysis<MachineLoopInfo>(); in runOnMachineFunction()
H A DMLRegAllocEvictAdvisor.cpp290 const MachineLoopInfo &Loops);
351 const MachineLoopInfo &Loops; member in __anon7996ed3f0111::MLEvictAdvisor
434 const MachineLoopInfo &Loops, Logger *Log) in DevelopmentModeEvictAdvisor() argument
435 : MLEvictAdvisor(MF, RA, Runner, MBFI, Loops), Log(Log) {} in DevelopmentModeEvictAdvisor()
572 const MachineLoopInfo &Loops) in MLEvictAdvisor() argument
574 Runner(std::move(Runner)), MBFI(MBFI), Loops(Loops), in MLEvictAdvisor()
827 auto *Loop = Loops.getLoopFor(MBB); in getLIFeatureComponents()
H A DMachineTraceMetrics.cpp71 Loops = &getAnalysis<MachineLoopInfo>(); in runOnMachineFunction()
169 return MTM.Loops->getLoopFor(MBB); in getLoopFor()
448 const MachineLoopInfo *Loops; member
452 const MachineLoopInfo *loops) : Blocks(blocks), Loops(loops) {} in LoopBounds()
478 if (const MachineLoop *FromLoop = LB.Loops->getLoopFor(*From)) { in insertEdge()
483 if (isExitingLoop(FromLoop, LB.Loops->getLoopFor(To))) in insertEdge()
500 LoopBounds Bounds(BlockInfo, MTM.Loops); in computeTrace()
H A DSelectOptimize.cpp483 SmallVector<Loop *, 4> Loops(LI->begin(), LI->end()); in optimizeSelectsInnerLoops() local
485 for (unsigned long i = 0; i < Loops.size(); ++i) in optimizeSelectsInnerLoops()
486 for (Loop *ChildL : Loops[i]->getSubLoops()) in optimizeSelectsInnerLoops()
487 Loops.push_back(ChildL); in optimizeSelectsInnerLoops()
489 for (Loop *L : Loops) { in optimizeSelectsInnerLoops()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIOptimizeVGPRLiveRange.cpp96 const MachineLoopInfo *Loops = nullptr; member in __anoneac9f2120111::SIOptimizeVGPRLiveRange
250 Loops->getLoopFor(DefMBB) == Loops->getLoopFor(If)) { in collectCandidateRegisters()
295 Loops->getLoopFor(DefMBB) == Loops->getLoopFor(If)) in collectCandidateRegisters()
639 Loops = &getAnalysis<MachineLoopInfo>(); in runOnMachineFunction()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericLoopInfoImpl.h392 DenseSet<const LoopT *> *Loops) const { in verifyLoopNest() argument
394 Loops->insert(static_cast<const LoopT *>(this)); in verifyLoopNest()
399 (*I)->verifyLoopNest(Loops); in verifyLoopNest()
709 DenseSet<const LoopT *> Loops; in verify() local
712 (*I)->verifyLoopNest(&Loops); in verify()
720 assert(Loops.count(L) && "orphaned loop"); in verify()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86CmovConversion.cpp239 SmallVector<MachineLoop *, 4> Loops(MLI->begin(), MLI->end()); in runOnMachineFunction() local
242 for (int i = 0; i < (int)Loops.size(); ++i) in runOnMachineFunction()
243 for (MachineLoop *Child : Loops[i]->getSubLoops()) in runOnMachineFunction()
244 Loops.push_back(Child); in runOnMachineFunction()
246 for (MachineLoop *CurrLoop : Loops) { in runOnMachineFunction()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DUnifyLoopExits.cpp219 auto Loops = LI.getLoopsInPreorder(); in runImpl() local
220 for (auto *L : Loops) { in runImpl()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64ConditionalCompares.cpp768 MachineLoopInfo *Loops; member in __anonc9893bab0211::AArch64ConditionalCompares
837 if (!Loops) in updateLoops()
840 Loops->removeBlock(RemovedMBB); in updateLoops()
937 Loops = &getAnalysis<MachineLoopInfo>(); in runOnMachineFunction()

12