Home
last modified time | relevance | path

Searched refs:LoopInfo (Results 1 – 25 of 121) sorted by relevance

12345

/freebsd-12.1/contrib/llvm/include/llvm/Transforms/Utils/
H A DUnrollLoop.h31 class LoopInfo; variable
48 BasicBlock *ClonedBB, LoopInfo *LI,
71 LoopInfo *LI, ScalarEvolution *SE,
79 LoopInfo *LI, ScalarEvolution *SE,
90 bool peelLoop(Loop *L, unsigned PeelCount, LoopInfo *LI, ScalarEvolution *SE,
95 LoopInfo *LI, ScalarEvolution *SE,
104 DominatorTree &DT, LoopInfo *LI, ScalarEvolution &SE,
112 BasicBlock *foldBlockIntoPredecessor(BasicBlock *BB, LoopInfo *LI,
117 void simplifyLoopAfterUnroll(Loop *L, bool SimplifyIVs, LoopInfo *LI,
H A DLoopUtils.h43 class LoopInfo; variable
53 BasicBlock *InsertPreheaderForLoop(Loop *L, DominatorTree *DT, LoopInfo *LI,
61 bool formDedicatedExitBlocks(Loop *L, DominatorTree *DT, LoopInfo *LI,
76 DominatorTree &DT, LoopInfo &LI);
89 bool formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI, ScalarEvolution *SE);
100 bool formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI,
111 bool sinkRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
124 bool hoistRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
141 LoopInfo *LI);
154 PredIteratorCache &, LoopInfo *,
H A DBasicBlockUtils.h35 class LoopInfo; variable
69 LoopInfo *LI = nullptr,
95 LoopInfo *LI;
102 LoopInfo *LI = nullptr,
190 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr,
198 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr,
218 LoopInfo *LI = nullptr,
236 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr,
271 LoopInfo *LI = nullptr);
H A DSimplifyIndVar.h26 class LoopInfo; variable
50 LoopInfo *LI, SmallVectorImpl<WeakTrackingVH> &Dead,
56 LoopInfo *LI, SmallVectorImpl<WeakTrackingVH> &Dead);
H A DLoopVersioning.h28 class LoopInfo; variable
42 LoopVersioning(const LoopAccessInfo &LAI, Loop *L, LoopInfo *LI,
146 LoopInfo *LI;
H A DLoopRotationUtils.h22 class LoopInfo; variable
34 bool LoopRotation(Loop *L, LoopInfo *LI, const TargetTransformInfo *TTI,
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DLoopInfo.h56 class LoopInfo; variable
617 friend class LoopInfo; variable
805 void operator=(const LoopInfo &) = delete;
806 LoopInfo(const LoopInfo &) = delete;
809 LoopInfo() {} in LoopInfo() function
812 LoopInfo(LoopInfo &&Arg) : BaseT(std::move(static_cast<BaseT &>(Arg))) {} in LoopInfo() function
813 LoopInfo &operator=(LoopInfo &&RHS) {
928 typedef LoopInfo::iterator ChildIteratorType;
950 typedef LoopInfo Result;
971 LoopInfo LI;
[all …]
H A DCFG.h27 class LoopInfo; variable
68 const LoopInfo *LI = nullptr);
78 const LoopInfo *LI = nullptr);
90 const LoopInfo *LI = nullptr);
H A DLazyBranchProbabilityInfo.h26 class LoopInfo; variable
59 LazyBranchProbabilityInfo(const Function *F, const LoopInfo *LI, in LazyBranchProbabilityInfo()
81 const LoopInfo *LI;
H A DLoopAnalysisManager.h58 LoopInfo &LI;
92 explicit Result(LoopAnalysisManager &InnerAM, LoopInfo &LI) in Result()
136 LoopInfo *LI;
H A DBranchProbabilityInfo.h36 class LoopInfo; variable
57 BranchProbabilityInfo(const Function &F, const LoopInfo &LI,
134 void calculate(const Function &F, const LoopInfo &LI,
197 bool calcLoopBranchHeuristics(const BasicBlock *BB, const LoopInfo &LI,
H A DDivergenceAnalysis.h48 const DominatorTree &DT, const LoopInfo &LI,
152 const LoopInfo &LI;
184 const PostDominatorTree &PDT, const LoopInfo &LI,
H A DBlockFrequencyInfo.h29 class LoopInfo; variable
46 const LoopInfo &LI);
93 const LoopInfo &LI);
H A DLoopIterator.h124 void perform(LoopInfo *LI);
181 void perform(LoopInfo *LI) { in perform()
208 LoopInfo *LI;
211 LoopBlocksTraversal(LoopBlocksDFS &Storage, LoopInfo *LInfo) : in LoopBlocksTraversal()
H A DSyncDependenceAnalysis.h49 const LoopInfo &LI);
77 const LoopInfo &LI;
/freebsd-12.1/contrib/llvm/tools/clang/lib/CodeGen/
H A DCGLoopInfo.h78 class LoopInfo {
81 LoopInfo(llvm::BasicBlock *Header, const LoopAttributes &Attrs,
193 const LoopInfo &getInfo() const { return Active.back(); } in getInfo()
197 llvm::SmallVector<LoopInfo, 4> Active;
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DCFG.cpp114 static const Loop *getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) { in getOutermostLoop()
124 static bool loopContainsBoth(const LoopInfo *LI, in loopContainsBoth()
133 const DominatorTree *DT, const LoopInfo *LI) { in isPotentiallyReachableFromMany()
176 const DominatorTree *DT, const LoopInfo *LI) { in isPotentiallyReachable()
188 const DominatorTree *DT, const LoopInfo *LI) { in isPotentiallyReachable()
H A DLoopInfo.cpp184 bool Loop::isRecursivelyLCSSAForm(DominatorTree &DT, const LoopInfo &LI) const { in isRecursivelyLCSSAForm()
417 LoopInfo *LI;
432 UnloopUpdater(Loop *UL, LoopInfo *LInfo) in UnloopUpdater()
600 LoopInfo::LoopInfo(const DomTreeBase<BasicBlock> &DomTree) { analyze(DomTree); } in LoopInfo() function in LoopInfo
602 bool LoopInfo::invalidate(Function &F, const PreservedAnalyses &PA, in invalidate()
611 void LoopInfo::erase(Loop *Unloop) { in erase()
672 LoopInfo LoopAnalysis::run(Function &F, FunctionAnalysisManager &AM) { in run()
679 LoopInfo LI; in run()
804 LoopInfo &LI = AM.getResult<LoopAnalysis>(F); in run()
817 void LoopBlocksDFS::perform(LoopInfo *LI) { in perform()
/freebsd-12.1/contrib/llvm/include/llvm/Transforms/Vectorize/
H A DLoopVectorize.h73 class LoopInfo; variable
90 LoopInfo *LI;
104 bool runImpl(Function &F, ScalarEvolution &SE_, LoopInfo &LI_,
H A DSLPVectorizer.h42 class LoopInfo; variable
69 LoopInfo *LI = nullptr;
80 TargetLibraryInfo *TLI_, AliasAnalysis *AA_, LoopInfo *LI_,
/freebsd-12.1/contrib/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp118 LoopInfo *LI, bool PreserveLCSSA) { in InsertPreheaderForLoop()
218 DominatorTree *DT, LoopInfo *LI, in separateNestedLoop()
342 DominatorTree *DT, LoopInfo *LI) { in insertUniqueBackedgeBlock()
462 DominatorTree *DT, LoopInfo *LI, in simplifyOneLoop()
678 bool llvm::simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, in simplifyLoop()
765 LoopInfo *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo(); in runOnFunction()
775 for (LoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I) in runOnFunction()
791 LoopInfo *LI = &AM.getResult<LoopAnalysis>(F); in run()
798 for (LoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I) in run()
867 for (LoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I) in verifyAnalysis()
H A DLCSSA.cpp76 DominatorTree &DT, LoopInfo &LI) { in formLCSSAForInstructions()
305 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSA()
360 bool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSARecursively()
373 static bool formLCSSAOnAllLoops(LoopInfo *LI, DominatorTree &DT, in formLCSSAOnAllLoops()
390 LoopInfo *LI;
/freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/
H A DVPlanHCFGBuilder.h46 LoopInfo *LI;
64 VPlanHCFGBuilder(Loop *Lp, LoopInfo *LI, VPlan &P) in VPlanHCFGBuilder()
/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DSink.cpp96 DominatorTree &DT, LoopInfo &LI) { in IsAcceptableTarget()
141 DominatorTree &DT, LoopInfo &LI, AAResults &AA) { in SinkInstruction()
199 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI, in ProcessBlock()
240 LoopInfo &LI, AAResults &AA) { in iterativelySinkInstructions()
H A DLICM.cpp122 static bool inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI);
129 static bool sink(Instruction &I, LoopInfo *LI, DominatorTree *DT,
168 collectAliasInfoForLoop(Loop *L, LoopInfo *LI, AliasAnalysis *AA);
287 Loop *L, AliasAnalysis *AA, LoopInfo *LI, DominatorTree *DT, in runOnLoop()
418 bool llvm::sinkRegion(DomTreeNode *N, AliasAnalysis *AA, LoopInfo *LI, in sinkRegion()
494 LoopInfo *LI;
508 ControlFlowHoister(LoopInfo *LI, DominatorTree *DT, Loop *CurLoop, in ControlFlowHoister()
1320 PHINode *TPN, Instruction *I, LoopInfo *LI, in sinkThroughTriviallyReplaceablePHI()
1427 static bool sink(Instruction &I, LoopInfo *LI, DominatorTree *DT, in sink()
1616 LoopInfo &LI;
[all …]

12345