Home
last modified time | relevance | path

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

123

/openbsd-src/gnu/llvm/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()
101 assert(Index < Loops.size() && "Index is out of bounds"); in getLoop()
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()
[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.h54 const SCEV *normalizeForPostIncUse(const SCEV *S, const PostIncLoopSet &Loops,
64 const SCEV *denormalizeForPostIncUse(const SCEV *S, const PostIncLoopSet &Loops,
H A DLoopInfoImpl.h383 DenseSet<const LoopT *> *Loops) const { in verifyLoopNest() argument
385 Loops->insert(static_cast<const LoopT *>(this)); in verifyLoopNest()
390 (*I)->verifyLoopNest(Loops); in verifyLoopNest()
701 DenseSet<const LoopT *> Loops; in verify() local
704 (*I)->verifyLoopNest(&Loops); in verify()
712 assert(Loops.count(L) && "orphaned loop"); in verify()
H A DLoopCacheAnalysis.h201 CacheCost(const LoopVectorTy &Loops, const LoopInfo &LI, ScalarEvolution &SE,
263 LoopVectorTy Loops;
H A DBlockFrequencyInfoImpl.h431 std::list<LoopData> Loops; variable
1206 Loops.emplace_back(Parent, Header);
1207 Working[Header.Index].Loop = &Loops.back();
1211 Q.emplace_back(L, &Loops.back());
1244 for (auto L = Loops.rbegin(), E = Loops.rend(); L != E; ++L) {
1353 computeIrreducibleMass(nullptr, Loops.begin());
1367 for (auto L = Loops.rbegin(), E = Loops.rend(); L != E; ++L) {
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
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()
557 CacheCost::CacheCost(const LoopVectorTy &Loops, const LoopInfo &LI, in CacheCost() argument
561 : Loops(Loops), TRT(TRT.value_or(TemporalReuseThreshold)), LI(LI), SE(SE), in CacheCost()
563 assert(!Loops.empty() && "Expecting a non-empty loop vector."); in CacheCost()
565 for (const Loop *L : Loops) { in CacheCost()
582 LoopVectorTy Loops; in getCacheCost() local
[all …]
H A DScalarEvolutionNormalization.cpp98 const PostIncLoopSet &Loops, in normalizeForPostIncUse() argument
101 return Loops.count(AR->getLoop()); in normalizeForPostIncUse()
112 const PostIncLoopSet &Loops, in denormalizeForPostIncUse() argument
115 return Loops.count(AR->getLoop()); in denormalizeForPostIncUse()
H A DDependenceAnalysis.cpp878 SmallBitVector &Loops) const { in collectCommonLoops()
882 Loops.set(Level); in collectCommonLoops()
963 SmallBitVector &Loops, bool IsSrc) { in checkSubscript() argument
992 Loops.set(mapSrcLoop(AddRec->getLoop())); in checkSubscript()
994 Loops.set(mapDstLoop(AddRec->getLoop())); in checkSubscript()
995 return checkSubscript(Start, LoopNest, Loops, IsSrc); in checkSubscript()
1001 SmallBitVector &Loops) { in checkSrcSubscript() argument
1002 return checkSubscript(Src, LoopNest, Loops, true); in checkSrcSubscript()
1008 SmallBitVector &Loops) { in checkDstSubscript() argument
1009 return checkSubscript(Dst, LoopNest, Loops, false); in checkDstSubscript()
[all …]
H A DBlockFrequencyInfoImpl.cpp297 Loops.clear(); in clear()
547 for (LoopData &Loop : Loops) in unwrapLoops()
792 auto Loop = BFI.Loops.emplace(Insert, OuterLoop, Headers.begin(), in createIrreducibleLoop()
807 assert((OuterLoop == nullptr) == (Insert == Loops.begin())); in analyzeIrreducible()
808 auto Prev = OuterLoop ? std::prev(Insert) : Loops.end(); in analyzeIrreducible()
820 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()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp261 BB2BBMap Loops; member in __anon82769d8e0111::StructurizeCFG
279 void insertConditions(bool Loops);
438 Loops[Exit] = N->getEntry(); in analyzeLoops()
447 Loops[Succ] = BB; in analyzeLoops()
490 if (Visited.count(Other) && !Loops.count(Other) && in gatherPredicates()
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()
573 PhiInserter.AddAvailableValue(Loops ? SuccFalse : Parent, Default); in insertConditions()
[all …]
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DEarlyIfConversion.cpp768 MachineLoopInfo *Loops; member in __anon3786be1d0311::EarlyIfConverter
829 void updateLoops(MachineLoopInfo *Loops, in updateLoops() argument
831 if (!Loops) in updateLoops()
836 Loops->removeBlock(B); in updateLoops()
1042 updateLoops(Loops, RemovedBlocks); in tryConvertIf()
1063 Loops = getAnalysisIfAvailable<MachineLoopInfo>(); in runOnMachineFunction()
1093 MachineLoopInfo *Loops; member in __anon3786be1d0911::EarlyIfPredicator
1180 updateLoops(Loops, RemovedBlocks); in tryConvertIf()
1197 Loops = getAnalysisIfAvailable<MachineLoopInfo>(); in runOnMachineFunction()
H A DMLRegallocEvictAdvisor.cpp278 const MachineLoopInfo &Loops);
339 const MachineLoopInfo &Loops; member in __anon583707800111::MLEvictAdvisor
417 const MachineLoopInfo &Loops, Logger *Log) in DevelopmentModeEvictAdvisor() argument
418 : MLEvictAdvisor(MF, RA, Runner, MBFI, Loops), Log(Log) {} in DevelopmentModeEvictAdvisor()
555 const MachineLoopInfo &Loops) in MLEvictAdvisor() argument
557 Runner(std::move(Runner)), MBFI(MBFI), Loops(Loops), in MLEvictAdvisor()
809 auto *Loop = Loops.getLoopFor(MBB); in getLIFeatureComponents()
H A DMachineTraceMetrics.cpp71 Loops = &getAnalysis<MachineLoopInfo>(); in runOnMachineFunction()
169 return MTM.Loops->getLoopFor(MBB); in getLoopFor()
429 const MachineLoopInfo *Loops; member
433 const MachineLoopInfo *loops) : Blocks(blocks), Loops(loops) {} in LoopBounds()
459 if (const MachineLoop *FromLoop = LB.Loops->getLoopFor(*From)) { in insertEdge()
464 if (isExitingLoop(FromLoop, LB.Loops->getLoopFor(To))) in insertEdge()
481 LoopBounds Bounds(BlockInfo, MTM.Loops); in computeTrace()
H A DSelectOptimize.cpp298 SmallVector<Loop *, 4> Loops(LI->begin(), LI->end()); in optimizeSelectsInnerLoops() local
300 for (unsigned long i = 0; i < Loops.size(); ++i) in optimizeSelectsInnerLoops()
301 for (Loop *ChildL : Loops[i]->getSubLoops()) in optimizeSelectsInnerLoops()
302 Loops.push_back(ChildL); in optimizeSelectsInnerLoops()
304 for (Loop *L : Loops) { in optimizeSelectsInnerLoops()
/openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DSIOptimizeVGPRLiveRange.cpp96 const MachineLoopInfo *Loops = nullptr; member in __anon6e3fed130111::SIOptimizeVGPRLiveRange
250 Loops->getLoopFor(DefMBB) == Loops->getLoopFor(If)) { in collectCandidateRegisters()
295 Loops->getLoopFor(DefMBB) == Loops->getLoopFor(If)) in collectCandidateRegisters()
630 Loops = &getAnalysis<MachineLoopInfo>(); in runOnMachineFunction()
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/
H A DUnifyLoopExits.cpp222 auto Loops = LI.getLoopsInPreorder(); in runImpl() local
223 for (auto *L : Loops) { in runImpl()
/openbsd-src/gnu/llvm/llvm/lib/Target/AArch64/
H A DAArch64ConditionalCompares.cpp769 MachineLoopInfo *Loops; member in __anonbd96cf2c0211::AArch64ConditionalCompares
838 if (!Loops) in updateLoops()
841 Loops->removeBlock(RemovedMBB); in updateLoops()
938 Loops = getAnalysisIfAvailable<MachineLoopInfo>(); in runOnMachineFunction()
/openbsd-src/gnu/llvm/llvm/lib/Frontend/OpenMP/
H A DOMPIRBuilder.cpp2613 OpenMPIRBuilder::collapseLoops(DebugLoc DL, ArrayRef<CanonicalLoopInfo *> Loops, in collapseLoops() argument
2615 assert(Loops.size() >= 1 && "At least one loop required"); in collapseLoops()
2616 size_t NumLoops = Loops.size(); in collapseLoops()
2620 return Loops.front(); in collapseLoops()
2622 CanonicalLoopInfo *Outermost = Loops.front(); in collapseLoops()
2623 CanonicalLoopInfo *Innermost = Loops.back(); in collapseLoops()
2630 OldControlBBs.reserve(6 * Loops.size()); in collapseLoops()
2631 for (CanonicalLoopInfo *Loop : Loops) in collapseLoops()
2644 for (CanonicalLoopInfo *L : Loops) { in collapseLoops()
2673 Value *OrigTripCount = Loops[i]->getTripCount(); in collapseLoops()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/TableGen/
H A DTGParser.cpp351 if (!Loops.empty()) { in addEntry()
352 Loops.back()->Entries.push_back(std::move(E)); in addEntry()
907 for (const auto &L : Loops) { in ParseIDValue()
3274 Loops.push_back(std::make_unique<ForeachLoop>(Loc, IterName, ListValue)); in ParseForeach()
3301 std::unique_ptr<ForeachLoop> Loop = std::move(Loops.back()); in ParseForeach()
3302 Loops.pop_back(); in ParseForeach()
3343 Loops.push_back(std::make_unique<ForeachLoop>(Loc, nullptr, ThenClauseList)); in ParseIf()
3348 std::unique_ptr<ForeachLoop> Loop = std::move(Loops.back()); in ParseIf()
3349 Loops.pop_back(); in ParseIf()
3365 Loops.push_back( in ParseIf()
[all …]

123