| /external/llvm/include/llvm/Transforms/Utils/ |
| UnrollLoop.h | 26 class LoopInfo;
34 LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT,
38 bool AllowExpensiveTripCount, LoopInfo *LI,
|
| LoopVersioning.h | 28 class LoopInfo;
38 /// \brief Expects LoopAccessInfo, Loop, LoopInfo, DominatorTree as input.
42 LoopVersioning(const LoopAccessInfo &LAI, Loop *L, LoopInfo *LI,
47 /// the DominatorTree and LoopInfo updates.
108 LoopInfo *LI;
|
| SimplifyIndVar.h | 28 class LoopInfo;
61 LoopInfo *LI, SmallVectorImpl<WeakVH> &Dead,
67 LoopInfo *LI, SmallVectorImpl<WeakVH> &Dead);
|
| BasicBlockUtils.h | 27 class LoopInfo;
55 LoopInfo *LI = nullptr,
84 LoopInfo *LI;
90 LoopInfo *LI = nullptr)
183 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
191 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
203 /// This currently updates the LLVM IR, DominatorTree, LoopInfo, and LCCSA but
211 LoopInfo *LI = nullptr,
221 /// This currently updates the LLVM IR, DominatorTree, LoopInfo, and LCCSA but
231 LoopInfo *LI = nullptr
[all...] |
| LoopUtils.h | 30 class LoopInfo;
296 BasicBlock *InsertPreheaderForLoop(Loop *L, DominatorTree *DT, LoopInfo *LI,
304 bool simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, ScalarEvolution *SE,
313 /// LoopInfo and DominatorTree are required and preserved.
318 bool formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI,
325 /// LoopInfo and DominatorTree are required and preserved.
330 bool formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI,
337 /// iteration. Takes DomTreeNode, AliasAnalysis, LoopInfo, DominatorTree,
341 bool sinkRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
349 /// Takes DomTreeNode, AliasAnalysis, LoopInfo, DominatorTree, DataLayout
[all...] |
| Cloning.h | 46 class LoopInfo;
252 /// Updates LoopInfo and DominatorTree assuming the loop is dominated by block
256 const Twine &NameSuffix, LoopInfo *LI,
|
| /external/llvm/include/llvm/Analysis/ |
| CFG.h | 27 class LoopInfo;
69 const LoopInfo *LI = nullptr);
79 const LoopInfo *LI = nullptr);
91 const LoopInfo *LI = nullptr);
|
| BlockFrequencyInfo.h | 24 class LoopInfo;
36 const LoopInfo &LI);
53 const LoopInfo &LI);
|
| BranchProbabilityInfo.h | 25 class LoopInfo;
43 BranchProbabilityInfo(Function &F, const LoopInfo &LI) { calculate(F, LI); }
123 void calculate(Function &F, const LoopInfo& LI);
156 bool calcLoopBranchHeuristics(BasicBlock *BB, const LoopInfo &LI);
|
| LoopInfo.h | 1 //===- llvm/Analysis/LoopInfo.h - Natural Loop Calculator -------*- C++ -*-===//
10 // This file defines the LoopInfo class that is used to identify natural loops
52 class LoopInfo;
266 /// to the specified LoopInfo object as being in the current basic block. It
333 /// the mapping in the LoopInfo class.
501 /// LoopInfo - This class builds and contains all of the top level loop
511 friend class LoopInfo;
654 class LoopInfo : public LoopInfoBase<BasicBlock, Loop> {
659 void operator=(const LoopInfo &) = delete;
660 LoopInfo(const LoopInfo &) = delete
[all...] |
| BasicAliasAnalysis.h | 32 class LoopInfo;
45 LoopInfo *LI;
50 LoopInfo *LI = nullptr)
|
| LoopIterator.h | 20 // contained within the loop according to the most recent LoopInfo analysis are
28 #include "llvm/Analysis/LoopInfo.h"
64 void perform(LoopInfo *LI);
129 LoopInfo *LI;
132 LoopBlocksTraversal(LoopBlocksDFS &Storage, LoopInfo *LInfo) :
|
| LoopPass.h | 18 #include "llvm/Analysis/LoopInfo.h"
106 // LPPassManager needs LoopInfo.
155 LoopInfo *LI;
|
| LoopAccessAnalysis.h | 513 DominatorTree *DT, LoopInfo *LI,
620 LoopInfo *LI;
706 LoopInfo *LI;
|
| IVUsers.h | 124 LoopInfo *LI;
|
| /external/clang/lib/CodeGen/ |
| CGLoopInfo.h | 63 class LoopInfo {
65 /// \brief Construct a new LoopInfo for the loop with entry Header.
66 LoopInfo(llvm::BasicBlock *Header, const LoopAttributes &Attrs);
144 /// \brief Returns true if there is LoopInfo on the stack.
146 /// \brief Return the LoopInfo for the current loop. HasInfo should be called
147 /// first to ensure LoopInfo is present.
148 const LoopInfo &getInfo() const { return Active.back(); }
152 llvm::SmallVector<LoopInfo, 4> Active;
|
| CGLoopInfo.cpp | 101 LoopInfo::LoopInfo(BasicBlock *Header, const LoopAttributes &Attrs)
107 Active.push_back(LoopInfo(Header, StagedAttrs));
233 const LoopInfo &L = getInfo();
|
| /external/llvm/lib/Analysis/ |
| CFG.cpp | 17 #include "llvm/Analysis/LoopInfo.h"
111 // LoopInfo contains a mapping from basic block to the innermost loop. Find
113 static const Loop *getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) {
123 static bool loopContainsBoth(const LoopInfo *LI,
132 const DominatorTree *DT, const LoopInfo *LI) {
175 const DominatorTree *DT, const LoopInfo *LI) {
187 const DominatorTree *DT, const LoopInfo *LI) {
|
| BlockFrequencyInfo.cpp | 17 #include "llvm/Analysis/LoopInfo.h"
112 const LoopInfo &LI) {
118 const LoopInfo &LI) {
210 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
|
| LoopInfo.cpp | 1 //===- LoopInfo.cpp - Natural Loop Calculator -----------------------------===//
10 // This file defines the LoopInfo class that is used to identify natural loops
17 #include "llvm/Analysis/LoopInfo.h"
40 // Always verify loopinfo if expensive checking is enabled.
449 LoopInfo *LI;
464 UnloopUpdater(Loop *UL, LoopInfo *LInfo) :
636 LoopInfo::LoopInfo(const DominatorTreeBase<BasicBlock> &DomTree) {
640 void LoopInfo::updateUnloop(Loop *Unloop) {
659 // Remove the loop from the top-level LoopInfo object
[all...] |
| Delinearization.cpp | 18 #include "llvm/Analysis/LoopInfo.h"
44 LoopInfo *LI;
|
| /external/llvm/lib/Transforms/Utils/ |
| LCSSA.cpp | 66 PredIteratorCache &PredCache, LoopInfo *LI) {
219 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI,
265 bool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI,
286 LoopInfo *LI;
329 for (LoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I)
|
| LoopSimplify.cpp | 52 #include "llvm/Analysis/LoopInfo.h"
118 LoopInfo *LI, bool PreserveLCSSA) {
159 DominatorTree *DT, LoopInfo *LI,
249 DominatorTree *DT, LoopInfo *LI,
352 DominatorTree *DT, LoopInfo *LI) {
464 DominatorTree *DT, LoopInfo *LI,
703 bool llvm::simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI,
735 LoopInfo *LI;
794 for (LoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I)
[all...] |
| /external/v8/src/compiler/ |
| loop-analysis.cc | 29 struct LoopInfo {
95 for (LoopInfo& li : loops_) {
111 ZoneVector<LoopInfo> loops_;
268 for (LoopInfo& li : loops_) {
325 LoopInfo* innermost = nullptr;
335 LoopInfo* loop = &loops_[loop_num - 1];
365 LoopInfo* li = &loops_[0];
390 LoopInfo& li = loops_[loop_num - 1];
414 LoopInfo& li = loops_[loop_num - 1];
|
| /external/llvm/lib/Transforms/Scalar/ |
| LICM.cpp | 40 #include "llvm/Analysis/LoopInfo.h"
77 static bool inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI);
80 static bool sink(Instruction &I, const LoopInfo *LI, const DominatorTree *DT,
98 const LoopInfo *LI);
142 LoopInfo *LI; // Current LoopInfo
307 bool llvm::sinkRegion(DomTreeNode *N, AliasAnalysis *AA, LoopInfo *LI,
365 bool llvm::hoistRegion(DomTreeNode *N, AliasAnalysis *AA, LoopInfo *LI,
571 const LoopInfo *LI) {
603 static bool sink(Instruction &I, const LoopInfo *LI, const DominatorTree *DT
[all...] |
