Home
last modified time | relevance | path

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

12

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopNestAnalysis.h71 Loop &getOutermostLoop() const { return *Loops.front(); } in getOutermostLoop()
77 if (Loops.size() == 1) in getInnermostLoop()
78 return Loops.back(); in getInnermostLoop()
83 Loop *LastLoop = Loops.back(); in getInnermostLoop()
84 auto SecondLastLoopIter = ++Loops.rbegin(); in getInnermostLoop()
92 assert(Index < Loops.size() && "Index is out of bounds"); in getLoop()
93 return Loops[Index]; in getLoop()
97 size_t getNumLoops() const { return Loops.size(); } in getNumLoops()
100 ArrayRef<Loop *> getLoops() const { return Loops; } in getLoops()
125 Loops.back()->getLoopDepth() - Loops.front()->getLoopDepth() + 1; in getNestDepth()
[all …]
H A DDependenceAnalysis.h349 SmallBitVector Loops; member
542 SmallBitVector &Loops) const;
548 SmallBitVector &Loops);
554 SmallBitVector &Loops);
594 SmallBitVector &Loops);
640 const SmallBitVector &Loops,
780 const SmallBitVector &Loops,
817 const SmallBitVector &Loops,
867 SmallBitVector &Loops,
953 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.h373 DenseSet<const LoopT *> *Loops) const { in verifyLoopNest() argument
375 Loops->insert(static_cast<const LoopT *>(this)); in verifyLoopNest()
380 (*I)->verifyLoopNest(Loops); in verifyLoopNest()
691 DenseSet<const LoopT *> Loops; in verify() local
694 (*I)->verifyLoopNest(&Loops); in verify()
702 assert(Loops.count(L) && "orphaned loop"); in verify()
H A DLoopCacheAnalysis.h186 CacheCost(const LoopVectorTy &Loops, const LoopInfo &LI, ScalarEvolution &SE,
247 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) {
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopCacheAnalysis.cpp61 static Loop *getInnerMostLoop(const LoopVectorTy &Loops) { in getInnerMostLoop() argument
64 Loop *LastLoop = Loops.back(); in getInnerMostLoop()
68 assert(Loops.size() == 1 && "Expecting a single loop"); in getInnerMostLoop()
72 return (llvm::is_sorted(Loops, in getInnerMostLoop()
483 : Loops(Loops), TripCounts(), LoopCosts(), in CacheCost()
488 for (const Loop *L : Loops) { in CacheCost()
505 LoopVectorTy Loops; in getCacheCost() local
506 append_range(Loops, breadth_first(&Root)); in getCacheCost()
508 if (!getInnerMostLoop(Loops)) { in getCacheCost()
524 for (const Loop *L : Loops) { in calculateCacheFootprint()
[all …]
H A DScalarEvolutionNormalization.cpp97 const PostIncLoopSet &Loops, in normalizeForPostIncUse() argument
100 return Loops.count(AR->getLoop()); in normalizeForPostIncUse()
111 const PostIncLoopSet &Loops, in denormalizeForPostIncUse() argument
114 return Loops.count(AR->getLoop()); in denormalizeForPostIncUse()
H A DDependenceAnalysis.cpp809 Loops.set(Level); in collectCommonLoops()
941 Loops = SrcLoops; in classifyPair()
942 Loops |= DstLoops; in classifyPair()
943 unsigned N = Loops.count(); in classifyPair()
2565 if (Loops[K]) { in banerjeeMIVtest()
2609 if (Loops[K]) { in exploreDirections()
2634 if (Loops[Level]) { in exploreDirections()
3584 Pair[P].Loops); in depends()
3585 Pair[P].GroupLoops = Pair[P].Loops; in depends()
3860 CompleteLoops |= Pair[SI].Loops; in depends()
[all …]
H A DBlockFrequencyInfoImpl.cpp298 Loops.clear(); in clear()
548 for (LoopData &Loop : Loops) in unwrapLoops()
793 auto Loop = BFI.Loops.emplace(Insert, OuterLoop, Headers.begin(), in createIrreducibleLoop()
808 assert((OuterLoop == nullptr) == (Insert == Loops.begin())); in analyzeIrreducible()
809 auto Prev = OuterLoop ? std::prev(Insert) : Loops.end(); in analyzeIrreducible()
821 return make_range(Loops.begin(), Insert); in analyzeIrreducible()
H A DInlineSizeEstimatorAnalysis.cpp61 Loops, enumerator
198 FF[NamedFeatureIndex::Loops] = std::distance(LI.begin(), LI.end()); in getFunctionFeatures()
H A DLoopNestAnalysis.cpp45 append_range(Loops, breadth_first(&Root)); in LoopNest()
165 for (Loop *L : depth_first(const_cast<Loop *>(Loops.front()))) { in getPerfectLoops()
H A DMustExecute.cpp448 const auto &Loops = MustExec.lookup(&V); in printInfoComment() local
449 const auto NumLoops = Loops.size(); in printInfoComment()
456 for (const Loop *L : Loops) in printInfoComment()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DCalcSpillWeights.h50 const MachineLoopInfo &Loops; variable
59 const VirtRegMap &VRM, const MachineLoopInfo &Loops, in VirtRegAuxInfo() argument
61 : MF(MF), LIS(LIS), VRM(VRM), Loops(Loops), MBFI(MBFI) {} in VirtRegAuxInfo()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp261 BB2BBMap Loops; member in __anon4b9e022b0111::StructurizeCFG
277 void insertConditions(bool Loops);
431 Loops[Exit] = N->getEntry(); in analyzeLoops()
440 Loops[Succ] = BB; in analyzeLoops()
521 Loops.clear(); in collectInfos()
544 void StructurizeCFG::insertConditions(bool Loops) { in insertConditions() argument
545 BranchVector &Conds = Loops ? LoopConds : Conditions; in insertConditions()
546 Value *Default = Loops ? BoolTrue : BoolFalse; in insertConditions()
854 if (!Loops.count(LoopStart)) { in handleLoops()
862 LoopEnd = Loops[Node->getEntry()]; in handleLoops()
[all …]
H A DLoopUnrollAndJamPass.cpp436 ArrayRef<Loop *> Loops = LN.getLoops(); in tryToUnrollAndJamLoop() local
442 appendLoopsToWorklist(Loops, Worklist); in tryToUnrollAndJamLoop()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIOptimizeVGPRLiveRange.cpp96 const MachineLoopInfo *Loops = nullptr; member in __anonb9dfbbd00111::SIOptimizeVGPRLiveRange
240 Loops->getLoopFor(DefMBB) == Loops->getLoopFor(If)) { in collectCandidateRegisters()
285 Loops->getLoopFor(DefMBB) == Loops->getLoopFor(If)) in collectCandidateRegisters()
584 Loops = &getAnalysis<MachineLoopInfo>(); in runOnMachineFunction()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DLoopExtractor.cpp228 SmallVector<Loop *, 8> Loops; in extractLoops() local
231 Loops.assign(From, To); in extractLoops()
232 for (Loop *L : Loops) { in extractLoops()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DEarlyIfConversion.cpp764 MachineLoopInfo *Loops; member in __anon9918c95a0311::EarlyIfConverter
825 void updateLoops(MachineLoopInfo *Loops, in updateLoops() argument
827 if (!Loops) in updateLoops()
832 Loops->removeBlock(B); in updateLoops()
1038 updateLoops(Loops, RemovedBlocks); in tryConvertIf()
1059 Loops = getAnalysisIfAvailable<MachineLoopInfo>(); in runOnMachineFunction()
1089 MachineLoopInfo *Loops; member in __anon9918c95a0911::EarlyIfPredicator
1176 updateLoops(Loops, RemovedBlocks); in tryConvertIf()
1193 Loops = getAnalysisIfAvailable<MachineLoopInfo>(); in runOnMachineFunction()
H A DMachineTraceMetrics.cpp72 Loops = &getAnalysis<MachineLoopInfo>(); in runOnMachineFunction()
170 return MTM.Loops->getLoopFor(MBB); in getLoopFor()
430 const MachineLoopInfo *Loops; member
434 const MachineLoopInfo *loops) : Blocks(blocks), Loops(loops) {} in LoopBounds()
460 if (const MachineLoop *FromLoop = LB.Loops->getLoopFor(*From)) { in insertEdge()
465 if (isExitingLoop(FromLoop, LB.Loops->getLoopFor(To))) in insertEdge()
482 LoopBounds Bounds(BlockInfo, MTM.Loops); in computeTrace()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Frontend/OpenMP/
H A DOMPIRBuilder.cpp1572 size_t NumLoops = Loops.size(); in collapseLoops()
1576 return Loops.front(); in collapseLoops()
1594 for (CanonicalLoopInfo *L : Loops) { in collapseLoops()
1656 ContinueWith(Loops[i]->getBody(), Loops[i + 1]->getHeader()); in collapseLoops()
1663 ContinueWith(Loops[i]->getAfter(), Loops[i - 1]->getLatch()); in collapseLoops()
1678 OldControlBBs.reserve(6 * Loops.size()); in collapseLoops()
1679 for (CanonicalLoopInfo *Loop : Loops) in collapseLoops()
1694 int NumLoops = Loops.size(); in tileLoops()
1708 for (CanonicalLoopInfo *L : Loops) { in tileLoops()
1862 OldControlBBs.reserve(6 * Loops.size()); in tileLoops()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86CmovConversion.cpp225 SmallVector<MachineLoop *, 4> Loops(MLI->begin(), MLI->end()); in runOnMachineFunction() local
228 for (int i = 0; i < (int)Loops.size(); ++i) in runOnMachineFunction()
229 for (MachineLoop *Child : Loops[i]->getSubLoops()) in runOnMachineFunction()
230 Loops.push_back(Child); in runOnMachineFunction()
232 for (MachineLoop *CurrLoop : Loops) { in runOnMachineFunction()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DUnifyLoopExits.cpp213 auto Loops = LI.getLoopsInPreorder(); in runImpl() local
214 for (auto L : Loops) { in runImpl()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64ConditionalCompares.cpp770 MachineLoopInfo *Loops; member in __anon5dc9b4690211::AArch64ConditionalCompares
839 if (!Loops) in updateLoops()
842 Loops->removeBlock(RemovedMBB); in updateLoops()
939 Loops = getAnalysisIfAvailable<MachineLoopInfo>(); in runOnMachineFunction()
/freebsd-13.1/contrib/llvm-project/llvm/lib/TableGen/
H A DTGParser.cpp351 if (!Loops.empty()) { in addEntry()
352 Loops.back()->Entries.push_back(std::move(E)); in addEntry()
890 for (const auto &L : Loops) { in ParseIDValue()
3173 std::unique_ptr<ForeachLoop> Loop = std::move(Loops.back()); in ParseForeach()
3174 Loops.pop_back(); in ParseForeach()
3220 Loops.pop_back(); in ParseIf()
3236 Loops.push_back( in ParseIf()
3242 Loop = std::move(Loops.back()); in ParseIf()
3243 Loops.pop_back(); in ParseIf()
3700 if (!Loops.empty()) in ParseObject()
[all …]

12