| /external/llvm/include/llvm/Transforms/Utils/ |
| UnrollLoop.h | 22 class LoopInfo;
26 unsigned TripMultiple, LoopInfo* LI, LPPassManager* LPM);
28 bool UnrollRuntimeLoopProlog(Loop *L, unsigned Count, LoopInfo *LI,
|
| /external/llvm/test/Other/ |
| 2003-02-19-LoopInfoNestingBug.ll | 0 ; LoopInfo is incorrectly calculating loop nesting! In this case it doesn't
|
| /external/llvm/test/Transforms/LoopSimplify/ |
| 2003-04-25-AssertFail.ll | 1 ; This testcase exposed a problem with the loop identification pass (LoopInfo).
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 20 #include "llvm/Analysis/LoopInfo.h"
43 AU.addRequired<LoopInfo>();
58 INITIALIZE_PASS_DEPENDENCY(LoopInfo)
69 LoopInfo *LI = &getAnalysis<LoopInfo>();
|
| LoopDeletion.cpp | 41 AU.addRequired<LoopInfo>();
48 AU.addPreserved<LoopInfo>();
65 INITIALIZE_PASS_DEPENDENCY(LoopInfo)
233 // Finally, the blocks from loopinfo. This has to happen late because
235 LoopInfo &loopInfo = getAnalysis<LoopInfo>();
240 loopInfo.removeBlock(*I);
|
| Sink.cpp | 20 #include "llvm/Analysis/LoopInfo.h"
35 LoopInfo *LI;
51 AU.addRequired<LoopInfo>();
53 AU.addPreserved<LoopInfo>();
65 INITIALIZE_PASS_DEPENDENCY(LoopInfo)
100 LI = &getAnalysis<LoopInfo>();
|
| LoopUnrollPass.cpp | 86 AU.addRequired<LoopInfo>();
87 AU.addPreserved<LoopInfo>();
107 INITIALIZE_PASS_DEPENDENCY(LoopInfo)
139 LoopInfo *LI = &getAnalysis<LoopInfo>();
|
| /external/llvm/lib/Analysis/ |
| CMakeLists.txt | 30 LoopInfo.cpp
|
| CFG.cpp | 19 #include "llvm/Analysis/LoopInfo.h"
117 // LoopInfo contains a mapping from basic block to the innermost loop. Find
119 static const Loop *getOutermostLoop(LoopInfo *LI, const BasicBlock *BB) {
129 static bool loopContainsBoth(LoopInfo *LI,
138 LoopInfo *LI) {
153 // Can't be in a loop if LoopInfo doesn't know about it.
169 DominatorTree *DT, LoopInfo *LI) {
|
| LoopPass.cpp | 68 /// Delete loop from the loop queue and loop hierarchy (LoopInfo).
93 // Inset loop into loop nest (LoopInfo) and loop queue (LQ).
171 // LPPassManager needs LoopInfo. In the long term LoopInfo class will
173 Info.addRequired<LoopInfo>();
180 LI = &getAnalysis<LoopInfo>();
192 // Note that LoopInfo::iterator visits loops in reverse program
195 for (LoopInfo::reverse_iterator I = LI->rbegin(), E = LI->rend(); I != E; ++I)
243 // instead of relying on LoopInfo::verifyLoop since LoopInfo
[all...] |
| 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"
38 // Always verify loopinfo if expensive checking is enabled.
48 char LoopInfo::ID = 0;
49 INITIALIZE_PASS_BEGIN(LoopInfo, "loops", "Natural Loop Information", true, true)
51 INITIALIZE_PASS_END(LoopInfo, "loops", "Natural Loop Information", true, true)
437 LoopInfo *LI;
452 UnloopUpdater(Loop *UL, LoopInfo *LInfo) :
625 // LoopInfo implementatio
[all...] |
| ProfileEstimatorPass.cpp | 16 #include "llvm/Analysis/LoopInfo.h"
35 LoopInfo *LI;
49 AU.addRequired<LoopInfo>();
78 INITIALIZE_PASS_DEPENDENCY(LoopInfo)
124 // Read the LoopInfo for this block.
321 // Fetch LoopInfo and clear ProfileInfo for this function.
322 LI = &getAnalysis<LoopInfo>();
|
| Android.mk | 32 LoopInfo.cpp \
|
| BlockFrequencyInfo.cpp | 17 #include "llvm/Analysis/LoopInfo.h"
|
| /external/llvm/include/llvm/Analysis/ |
| 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) :
|
| CFG.h | 27 class LoopInfo;
65 DominatorTree *DT = 0, LoopInfo *LI = 0);
|
| 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
51 class LoopInfo;
237 /// to the specified LoopInfo object as being in the current basic block. It
293 /// the mapping in the LoopInfo class.
433 /// LoopInfo - This class builds and contains all of the top level loop
443 friend class LoopInfo;
446 LoopInfoBase(const LoopInfo &) LLVM_DELETED_FUNCTION;
575 class LoopInfo : public FunctionPass {
579 void operator=(const LoopInfo &) LLVM_DELETED_FUNCTION
[all...] |
| LoopPass.h | 18 #include "llvm/Analysis/LoopInfo.h"
96 // LPPassManager needs LoopInfo.
120 // Delete loop from the loop queue and loop nest (LoopInfo).
154 LoopInfo *LI;
|
| BranchProbabilityInfo.h | 24 class LoopInfo;
125 /// \brief Handle to the LoopInfo analysis.
126 LoopInfo *LI;
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
| radeon_dataflow_deadcode.c | 46 struct loopinfo { struct
69 struct loopinfo * LoopStack;
93 struct loopinfo * loop = &s->LoopStack[s->LoopStackSize - 1];
102 memory_pool_array_reserve(&s->C->Pool, struct loopinfo, s->LoopStack,
104 memset(&s->LoopStack[s->LoopStackSize++], 0, sizeof(struct loopinfo));
275 struct loopinfo * loop = &s.LoopStack[s.LoopStackSize-1];
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_dataflow_deadcode.c | 46 struct loopinfo { struct
69 struct loopinfo * LoopStack;
93 struct loopinfo * loop = &s->LoopStack[s->LoopStackSize - 1];
102 memory_pool_array_reserve(&s->C->Pool, struct loopinfo, s->LoopStack,
104 memset(&s->LoopStack[s->LoopStackSize++], 0, sizeof(struct loopinfo));
275 struct loopinfo * loop = &s.LoopStack[s.LoopStackSize-1];
|
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 19 #include "llvm/Analysis/LoopInfo.h"
181 if (LoopInfo *LI = P->getAnalysisIfAvailable<LoopInfo>())
280 if (LoopInfo *LI = P->getAnalysisIfAvailable<LoopInfo>())
302 /// UpdateAnalysisInformation - Update DominatorTree, LoopInfo, and LCCSA
309 LoopInfo *LI = P->getAnalysisIfAvailable<LoopInfo>();
329 // If we need to preserve LoopInfo, note whether any of the preds crosses
435 /// LoopInfo, and LCCSA but no other analyses. In particular, it does no
[all...] |
| SimplifyIndVar.cpp | 22 #include "llvm/Analysis/LoopInfo.h"
45 LoopInfo *LI;
57 LI(LPM->getAnalysisIfAvailable<LoopInfo>()),
62 assert(LI && "IV simplification requires LoopInfo");
376 LoopInfo *LI = &LPM->getAnalysis<LoopInfo>();
|
| LCSSA.cpp | 56 LoopInfo *LI;
72 AU.addRequired<LoopInfo>();
96 INITIALIZE_PASS_DEPENDENCY(LoopInfo)
122 LI = &getAnalysis<LoopInfo>();
|
| /external/llvm/unittests/Analysis/ |
| CFGTest.cpp | 13 #include "llvm/Analysis/LoopInfo.h"
87 AU.addRequired<LoopInfo>();
95 LoopInfo *LI = &getAnalysis<LoopInfo>();
|
