Searched refs:LoopInfo (Results 1 - 25 of 140) sorted by relevance

123456

/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanHCFGBuilder.h45 LoopInfo *LI;
63 VPlanHCFGBuilder(Loop *Lp, LoopInfo *LI, VPlan &P)
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DLoopRotationUtils.h21 class LoopInfo;
33 bool LoopRotation(Loop *L, LoopInfo *LI, const TargetTransformInfo *TTI,
H A DSimplifyIndVar.h25 class LoopInfo;
50 LoopInfo *LI, const TargetTransformInfo *TTI,
57 LoopInfo *LI, const TargetTransformInfo *TTI,
H A DLoopSimplify.h48 class LoopInfo;
62 /// update \c DominatorTree, \c LoopInfo, \c ScalarEvolution and \c MemorySSA
64 bool simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, ScalarEvolution *SE,
H A DUnrollLoop.h29 class LoopInfo;
49 BasicBlock *ClonedBB, LoopInfo *LI,
81 LoopUnrollResult UnrollLoop(Loop *L, UnrollLoopOptions ULO, LoopInfo *LI,
91 LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT, AssumptionCache *AC,
102 bool peelLoop(Loop *L, unsigned PeelCount, LoopInfo *LI, ScalarEvolution *SE,
107 LoopInfo *LI, ScalarEvolution *SE,
114 DependenceInfo &DI, LoopInfo &LI);
117 DominatorTree &DT, LoopInfo *LI, ScalarEvolution &SE,
127 void simplifyLoopAfterUnroll(Loop *L, bool SimplifyIVs, LoopInfo *LI,
H A DLoopUtils.h31 class LoopInfo;
55 BasicBlock *InsertPreheaderForLoop(Loop *L, DominatorTree *DT, LoopInfo *LI,
63 bool formDedicatedExitBlocks(Loop *L, DominatorTree *DT, LoopInfo *LI,
73 /// LoopInfo and DominatorTree are required and, since the routine makes no
78 const DominatorTree &DT, const LoopInfo &LI,
88 /// LoopInfo and DominatorTree are required and preserved.
93 bool formLCSSA(Loop &L, const DominatorTree &DT, const LoopInfo *LI,
100 /// LoopInfo and DominatorTree are required and preserved.
105 bool formLCSSARecursively(Loop &L, const DominatorTree &DT, const LoopInfo *LI,
120 /// iteration. Takes DomTreeNode, AAResults, LoopInfo, DominatorTre
[all...]
H A DLoopVersioning.h26 class LoopInfo;
42 /// Expects LoopAccessInfo, Loop, LoopInfo, DominatorTree as input.
46 LoopVersioning(const LoopAccessInfo &LAI, Loop *L, LoopInfo *LI,
51 /// the DominatorTree and LoopInfo updates.
147 LoopInfo *LI;
H A DBasicBlockUtils.h22 #include "llvm/Analysis/LoopInfo.h"
36 class LoopInfo;
95 LoopInfo *LI = nullptr,
109 DomTreeUpdater *DTU = nullptr, LoopInfo *LI = nullptr);
138 LoopInfo *LI;
150 LoopInfo *LI = nullptr,
249 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr,
257 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr,
271 /// This currently updates the LLVM IR, DominatorTree, LoopInfo, and LCCSA but
278 LoopInfo *L
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCFG.h27 class LoopInfo;
72 const DominatorTree *DT = nullptr, const LoopInfo *LI = nullptr);
82 const LoopInfo *LI = nullptr);
94 const LoopInfo *LI = nullptr);
108 const DominatorTree *DT = nullptr, const LoopInfo *LI = nullptr);
H A DSyncDependenceAnalysis.h22 #include "llvm/Analysis/LoopInfo.h"
43 const LoopInfo &LI);
71 const LoopInfo &LI;
H A DLoopAnalysisManager.h18 /// - LoopInfo
42 class LoopInfo;
56 LoopInfo &LI;
81 /// retains a \c LoopInfo reference.
87 explicit Result(LoopAnalysisManager &InnerAM, LoopInfo &LI)
124 /// If the proxy, \c LoopInfo, and associated analyses are preserved, this
130 /// LoopInfo for this function.
136 LoopInfo *LI;
141 /// so it can pass the \c LoopInfo to the result.
H A DLazyBranchProbabilityInfo.h25 class LoopInfo;
45 /// getAnalysis<LazyBranchProbabilityInfoPass>().getBPI() before LoopInfo
58 LazyBranchProbabilityInfo(const Function *F, const LoopInfo *LI,
80 const LoopInfo *LI;
H A DBlockFrequencyInfo.h28 class LoopInfo;
45 const LoopInfo &LI);
93 const LoopInfo &LI);
H A DDivergenceAnalysis.h47 const DominatorTree &DT, const LoopInfo &LI,
154 const LoopInfo &LI;
186 const PostDominatorTree &PDT, const LoopInfo &LI,
H A DLoopCacheAnalysis.h20 #include "llvm/Analysis/LoopInfo.h"
49 IndexedReference(Instruction &StoreOrLoadInst, const LoopInfo &LI,
96 bool delinearize(const LoopInfo &LI);
185 CacheCost(const LoopVectorTy &Loops, const LoopInfo &LI, ScalarEvolution &SE,
258 const LoopInfo &LI;
H A DLazyBlockFrequencyInfo.h27 class LoopInfo;
94 /// getAnalysis<LazyBlockFrequencyInfoPass>().getBFI() before either LoopInfo
102 LazyBlockFrequencyInfo<Function, LazyBranchProbabilityInfoPass, LoopInfo,
H A DLoopInfo.h1 //===- llvm/Analysis/LoopInfo.h - Natural Loop Calculator -------*- C++ -*-===//
9 // This file defines the LoopInfo class that is used to identify natural loops
58 class LoopInfo;
370 /// to the specified LoopInfo object as being in the current basic block. It
445 /// Blocks as appropriate. This does not update the mapping in the LoopInfo
486 // but should be using LoopInfo::markAsRemoved, which keeps around the `Loop`
487 // pointer till the end of the lifetime of the `LoopInfo` object.
786 const LoopInfo &LI) const;
874 friend class LoopInfo;
1041 /// Destroy a loop that has been removed from the `LoopInfo` nes
1063 class LoopInfo : public LoopInfoBase<BasicBlock, Loop> { class in namespace:llvm
1072 LoopInfo() {} function in class:llvm::LoopInfo
1075 LoopInfo(LoopInfo &&Arg) : BaseT(std::move(static_cast<BaseT &>(Arg))) {} function in class:llvm::LoopInfo
[all...]
H A DBranchProbabilityInfo.h35 class LoopInfo;
57 BranchProbabilityInfo(const Function &F, const LoopInfo &LI,
148 void calculate(const Function &F, const LoopInfo &LI,
213 bool calcLoopBranchHeuristics(const BasicBlock *BB, const LoopInfo &LI,
H A DLoopIterator.h19 // contained within the loop according to the most recent LoopInfo analysis are
27 #include "llvm/Analysis/LoopInfo.h"
123 void perform(LoopInfo *LI);
180 void perform(LoopInfo *LI) {
207 LoopInfo *LI;
210 LoopBlocksTraversal(LoopBlocksDFS &Storage, LoopInfo *LInfo) :
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/
H A DLoopVectorize.h73 class LoopInfo;
143 LoopInfo *LI;
159 runImpl(Function &F, ScalarEvolution &SE_, LoopInfo &LI_,
H A DSLPVectorizer.h40 class LoopInfo;
67 LoopInfo *LI = nullptr;
78 TargetLibraryInfo *TLI_, AliasAnalysis *AA_, LoopInfo *LI_,
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DLoopExtractor.cpp18 #include "llvm/Analysis/LoopInfo.h"
53 bool extractLoops(Loop::iterator From, Loop::iterator To, LoopInfo &LI,
55 bool extractLoop(Loop *L, LoopInfo &LI, DominatorTree &DT);
135 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>(F, &Changed).getLoopInfo();
186 LoopInfo &LI, DominatorTree &DT) {
204 bool LoopExtractor::extractLoop(Loop *L, LoopInfo &LI, DominatorTree &DT) {
/freebsd-13-stable/contrib/llvm-project/clang/lib/CodeGen/
H A DCGLoopInfo.h81 class LoopInfo { class in namespace:clang::CodeGen
83 /// Construct a new LoopInfo for the loop with entry Header.
84 LoopInfo(llvm::BasicBlock *Header, const LoopAttributes &Attrs,
86 LoopInfo *Parent);
118 LoopInfo *Parent;
120 /// loop's LoopInfo to set the llvm.loop.unroll_and_jam.followup_inner
276 /// Returns true if there is LoopInfo on the stack.
278 /// Return the LoopInfo for the current loop. HasInfo should be called
279 /// first to ensure LoopInfo is present.
280 const LoopInfo
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DFixIrreducible.cpp116 static void reconnectChildLoops(LoopInfo &LI, Loop *ParentLoop, Loop *NewLoop,
158 static void createNaturalLoopInternal(LoopInfo &LI, DominatorTree &DT,
206 // header. Since the new loop is already in LoopInfo, the new blocks
247 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Function *F,
253 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Loop &L,
261 static bool makeReducible(LoopInfo &LI, DominatorTree &DT, Graph &&G) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSink.cpp17 #include "llvm/Analysis/LoopInfo.h"
96 DominatorTree &DT, LoopInfo &LI) {
141 DominatorTree &DT, LoopInfo &LI, AAResults &AA) {
199 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI,
240 LoopInfo &LI, AAResults &AA) {

Completed in 92 milliseconds

123456