Home
last modified time | relevance | path

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

12345

/llvm-project-15.0.7/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.h346 SmallBitVector Loops; member
539 SmallBitVector &Loops) const;
545 SmallBitVector &Loops);
551 SmallBitVector &Loops);
591 SmallBitVector &Loops);
637 const SmallBitVector &Loops,
777 const SmallBitVector &Loops,
814 const SmallBitVector &Loops,
864 SmallBitVector &Loops,
950 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.h371 DenseSet<const LoopT *> *Loops) const { in verifyLoopNest() argument
373 Loops->insert(static_cast<const LoopT *>(this)); in verifyLoopNest()
378 (*I)->verifyLoopNest(Loops); in verifyLoopNest()
689 DenseSet<const LoopT *> Loops; in verify() local
692 (*I)->verifyLoopNest(&Loops); in verify()
700 assert(Loops.count(L) && "orphaned loop"); in verify()
/llvm-project-15.0.7/mlir/include/mlir/Dialect/SCF/Utils/
H A DUtils.h142 using Loops = SmallVector<scf::ForOp, 8>; variable
143 using TileLoops = std::pair<Loops, Loops>;
151 SmallVector<Loops, 8> tile(ArrayRef<scf::ForOp> forOps, ArrayRef<Value> sizes,
158 Loops tile(ArrayRef<scf::ForOp> forOps, ArrayRef<Value> sizes,
166 Loops tilePerfectlyNested(scf::ForOp rootForOp, ArrayRef<Value> sizes);
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/llvm/lib/Analysis/
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), in CacheCost()
566 for (const Loop *L : Loops) { in CacheCost()
583 LoopVectorTy Loops; in getCacheCost() local
584 append_range(Loops, breadth_first(&Root)); in getCacheCost()
586 if (!getInnerMostLoop(Loops)) { in getCacheCost()
602 for (const Loop *L : Loops) { in calculateCacheFootprint()
[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.cpp819 Loops.set(Level); in collectCommonLoops()
963 Loops = SrcLoops; in classifyPair()
964 Loops |= DstLoops; in classifyPair()
965 unsigned N = Loops.count(); in classifyPair()
2587 if (Loops[K]) { in banerjeeMIVtest()
2635 if (Loops[K]) in exploreDirections()
2644 if (Loops[K]) { in exploreDirections()
2669 if (Loops[Level]) { in exploreDirections()
3605 Pair[P].Loops); in depends()
3881 CompleteLoops |= Pair[SI].Loops; in depends()
[all …]
/llvm-project-15.0.7/llvm/unittests/Analysis/
H A DLoopNestTest.cpp106 const ArrayRef<Loop*> Loops = LN.getLoops(); in TEST() local
107 EXPECT_EQ(Loops.size(), 2ull); in TEST()
204 const ArrayRef<Loop*> Loops = LN.getLoops(); in TEST() local
205 EXPECT_EQ(Loops.size(), 3ull); in TEST()
288 const ArrayRef<Loop *> Loops = LN.getLoops(); in TEST() local
289 EXPECT_EQ(Loops.size(), 2ull); in TEST()
/llvm-project-15.0.7/llvm/test/Analysis/LoopNestAnalysis/
H A Dperfectnest.ll9 ; CHECK-LABEL: IsPerfect=true, Depth=1, OutermostLoop: perf_nest_2D_1_loop_j, Loops: ( perf_nest_2D…
10 ; CHECK-LABEL: IsPerfect=true, Depth=2, OutermostLoop: perf_nest_2D_1_loop_i, Loops: ( perf_nest_2D…
50 ; CHECK-LABEL: IsPerfect=true, Depth=1, OutermostLoop: perf_nest_2D_2_loop_j, Loops: ( perf_nest_2D…
89 ; CHECK-LABEL: IsPerfect=true, Depth=1, OutermostLoop: perf_nest_2D_3_loop_j, Loops: ( perf_nest_2D…
145 ; CHECK-LABEL: IsPerfect=true, Depth=1, OutermostLoop: perf_nest_3D_1_loop_k, Loops: ( perf_nest_3D…
210 ; CHECK-LABEL: IsPerfect=true, Depth=1, OutermostLoop: perf_nest_3D_2_loop_k, Loops: ( perf_nest_3D…
280 ; CHECK-LABEL: IsPerfect=true, Depth=1, OutermostLoop: perf_nest_live_out_loop_j, Loops: ( perf_nes…
333 ; CHECK-LABEL: IsPerfect=true, Depth=1, OutermostLoop: test6Loop2, Loops: ( test6Loop2 )
334 ; CHECK-LABEL: IsPerfect=true, Depth=2, OutermostLoop: test6Loop1, Loops: ( test6Loop1 test6Loop2 )
406 ; CHECK-LABEL: IsPerfect=true, Depth=1, OutermostLoop: test6Loop2, Loops: ( test6Loop2 )
[all …]
H A Dinfinite.ll5 ; CHECK-LABEL: IsPerfect=true, Depth=1, OutermostLoop: for.inner, Loops: ( for.inner )
6 ; CHECK-LABEL: IsPerfect=false, Depth=2, OutermostLoop: for.outer, Loops: ( for.outer for.inner )
7 ; CHECK-LABEL: IsPerfect=true, Depth=1, OutermostLoop: for.infinite, Loops: ( for.infinite )
H A Dnests-with-lcssa.ll12 ; CHECK: IsPerfect=true, Depth=1, OutermostLoop: for.j, Loops: ( for.j )
13 ; CHECK: IsPerfect=true, Depth=2, OutermostLoop: for.i, Loops: ( for.i for.j )
77 ; CHECK: IsPerfect=true, Depth=1, OutermostLoop: for.k, Loops: ( for.k )
78 ; CHECK: IsPerfect=false, Depth=2, OutermostLoop: for.j, Loops: ( for.j for.k )
79 ; CHECK: IsPerfect=false, Depth=3, OutermostLoop: for.i, Loops: ( for.i for.j for.k )
174 ; CHECK: IsPerfect=true, Depth=1, OutermostLoop: for.k, Loops: ( for.k )
175 ; CHECK: IsPerfect=true, Depth=2, OutermostLoop: for.j, Loops: ( for.j for.k )
176 ; CHECK: IsPerfect=true, Depth=3, OutermostLoop: for.i, Loops: ( for.i for.j for.k )
H A Dduplicate-successors.ll4 ; CHECK: IsPerfect=true, Depth=1, OutermostLoop: inner.header, Loops: ( inner.header )
5 ; CHECK-NEXT: IsPerfect=true, Depth=2, OutermostLoop: outer.header, Loops: ( outer.header inner.hea…
/llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/clang-analyzer/
H A Dosx.cocoa.Loops.rst1 .. title:: clang-tidy - clang-analyzer-osx.cocoa.Loops
3 clang-analyzer-osx.cocoa.Loops
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp257 BB2BBMap Loops; member in __anond74a67a70111::StructurizeCFG
273 void insertConditions(bool Loops);
429 Loops[Exit] = N->getEntry(); in analyzeLoops()
438 Loops[Succ] = BB; in analyzeLoops()
519 Loops.clear(); in collectInfos()
542 void StructurizeCFG::insertConditions(bool Loops) { in insertConditions() argument
543 BranchVector &Conds = Loops ? LoopConds : Conditions; in insertConditions()
544 Value *Default = Loops ? BoolTrue : BoolFalse; in insertConditions()
874 if (!Loops.count(LoopStart)) { in handleLoops()
882 LoopEnd = Loops[Node->getEntry()]; in handleLoops()
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/
H A Dppc-passname-assert.ll7 ; STOP-BEFORE-CTR-LOOPS-VERIFY-NOT: PowerPC CTR Loops Verify
12 ; STOP-AFTER-CTR-LOOPS-VERIFY: PowerPC CTR Loops Verify
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DMLRegallocEvictAdvisor.cpp251 const MachineLoopInfo &Loops);
311 const MachineLoopInfo &Loops; member in __anon8d2f77590111::MLEvictAdvisor
390 const MachineLoopInfo &Loops, Logger *Log) in DevelopmentModeEvictAdvisor() argument
391 : MLEvictAdvisor(MF, RA, Runner, MBFI, Loops), Log(Log) {} in DevelopmentModeEvictAdvisor()
506 const MachineLoopInfo &Loops) in MLEvictAdvisor() argument
508 Runner(std::move(Runner)), MBFI(MBFI), Loops(Loops), in MLEvictAdvisor()
731 auto *Loop = Loops.getLoopFor(MBB); in getLIFeatureComponents()
H A DEarlyIfConversion.cpp762 MachineLoopInfo *Loops; member in __anon1f7aa2560311::EarlyIfConverter
823 void updateLoops(MachineLoopInfo *Loops, in updateLoops() argument
825 if (!Loops) in updateLoops()
830 Loops->removeBlock(B); in updateLoops()
1036 updateLoops(Loops, RemovedBlocks); in tryConvertIf()
1057 Loops = getAnalysisIfAvailable<MachineLoopInfo>(); in runOnMachineFunction()
1087 MachineLoopInfo *Loops; member in __anon1f7aa2560911::EarlyIfPredicator
1174 updateLoops(Loops, RemovedBlocks); in tryConvertIf()
1191 Loops = getAnalysisIfAvailable<MachineLoopInfo>(); in runOnMachineFunction()
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DSIOptimizeVGPRLiveRange.cpp96 const MachineLoopInfo *Loops = nullptr; member in __anon2b52eecc0111::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()
/llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/readability/
H A Dfunction-cognitive-complexity.rst53 * Loops:
82 * Loops:
111 * Loops:
/llvm-project-15.0.7/polly/lib/Support/
H A DSCEVValidator.cpp522 SetVector<const Loop *> &Loops; member in SCEVFindLoops
525 SCEVFindLoops(SetVector<const Loop *> &Loops) : Loops(Loops) {} in SCEVFindLoops() argument
529 Loops.insert(AddRec->getLoop()); in follow()
535 void polly::findLoops(const SCEV *Expr, SetVector<const Loop *> &Loops) { in findLoops() argument
536 SCEVFindLoops FindLoops(Loops); in findLoops()
/llvm-project-15.0.7/llvm/test/Transforms/LoopInterchange/
H A Dinterchanged-loop-nest-3.ll16 ; CHECK: Loops interchanged.
19 ; CHECK: Loops interchanged.
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DX86CmovConversion.cpp234 SmallVector<MachineLoop *, 4> Loops(MLI->begin(), MLI->end()); in runOnMachineFunction() local
237 for (int i = 0; i < (int)Loops.size(); ++i) in runOnMachineFunction()
238 for (MachineLoop *Child : Loops[i]->getSubLoops()) in runOnMachineFunction()
239 Loops.push_back(Child); in runOnMachineFunction()
241 for (MachineLoop *CurrLoop : Loops) { in runOnMachineFunction()

12345