OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:LoopInfo
(Results
1 - 25
of
36
) sorted by null
1
2
/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,
Cloning.h
44
class
LoopInfo
;
/external/llvm/include/llvm/Analysis/
BranchProbabilityInfo.h
24
class
LoopInfo
;
107
/// \brief Handle to the
LoopInfo
analysis.
108
LoopInfo
*LI;
LoopIterator.h
20
// contained within the loop according to the most recent
LoopInfo
analysis are
29
#include "llvm/Analysis/
LoopInfo
.h"
65
void perform(
LoopInfo
*LI);
120
LoopInfo
*LI;
123
LoopBlocksTraversal(LoopBlocksDFS &Storage,
LoopInfo
*LInfo) :
LoopPass.h
18
#include "llvm/Analysis/
LoopInfo
.h"
94
// LPPassManager needs
LoopInfo
.
118
// Delete loop from the loop queue and loop nest (
LoopInfo
).
152
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
56
class
LoopInfo
;
342
/// to the specified
LoopInfo
object as being in the current basic block. It
408
/// the mapping in the
LoopInfo
class.
622
///
LoopInfo
- This class builds and contains all of the top level loop
632
friend class
LoopInfo
;
635
LoopInfoBase(const
LoopInfo
&); // do not implement
[
all
...]
IVUsers.h
123
LoopInfo
*LI;
RegionInfo.h
42
class
LoopInfo
;
404
/// @param LI A pointer to a
LoopInfo
analysis.
408
Loop *outermostLoopInRegion(
LoopInfo
*LI, BasicBlock* BB) const;
/external/llvm/lib/Transforms/Scalar/
LoopUnrollPass.cpp
85
AU.addRequired<
LoopInfo
>();
86
AU.addPreserved<
LoopInfo
>();
104
INITIALIZE_PASS_DEPENDENCY(
LoopInfo
)
134
LoopInfo
*LI = &getAnalysis<
LoopInfo
>();
Sink.cpp
19
#include "llvm/Analysis/
LoopInfo
.h"
34
LoopInfo
*LI;
50
AU.addRequired<
LoopInfo
>();
52
AU.addPreserved<
LoopInfo
>();
63
INITIALIZE_PASS_DEPENDENCY(
LoopInfo
)
98
LI = &getAnalysis<
LoopInfo
>();
LoopInstSimplify.cpp
18
#include "llvm/Analysis/
LoopInfo
.h"
42
AU.addRequired<
LoopInfo
>();
57
INITIALIZE_PASS_DEPENDENCY(
LoopInfo
)
68
LoopInfo
*LI = &getAnalysis<
LoopInfo
>();
LoopDeletion.cpp
45
AU.addRequired<
LoopInfo
>();
52
AU.addPreserved<
LoopInfo
>();
63
INITIALIZE_PASS_DEPENDENCY(
LoopInfo
)
231
// Finally, the blocks from
loopinfo
. This has to happen late because
233
LoopInfo
&
loopInfo
= getAnalysis<
LoopInfo
>();
238
loopInfo
.removeBlock(*I);
LoopRotation.cpp
46
AU.addRequired<
LoopInfo
>();
47
AU.addPreserved<
LoopInfo
>();
60
LoopInfo
*LI;
66
INITIALIZE_PASS_DEPENDENCY(
LoopInfo
)
76
LI = &getAnalysis<
LoopInfo
>();
LoopIdiomRecognize.cpp
99
AU.addRequired<
LoopInfo
>();
100
AU.addPreserved<
LoopInfo
>();
119
INITIALIZE_PASS_DEPENDENCY(
LoopInfo
)
199
LoopInfo
&LI = getAnalysis<
LoopInfo
>();
/external/llvm/lib/Analysis/
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"
32
// Always verify
loopinfo
if expensive checking is enabled.
42
char
LoopInfo
::ID = 0;
43
INITIALIZE_PASS_BEGIN(
LoopInfo
, "loops", "Natural Loop Information", true, true)
45
INITIALIZE_PASS_END(
LoopInfo
, "loops", "Natural Loop Information", true, true)
317
LoopInfo
*LI;
332
UnloopUpdater(Loop *UL,
LoopInfo
*LInfo) :
506
//
LoopInfo
implementatio
[
all
...]
IVUsers.cpp
35
INITIALIZE_PASS_DEPENDENCY(
LoopInfo
)
49
ScalarEvolution *SE,
LoopInfo
*LI) {
85
const
LoopInfo
*LI,
219
AU.addRequired<
LoopInfo
>();
228
LI = &getAnalysis<
LoopInfo
>();
Android.mk
34
LoopInfo
.cpp \
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
>();
187
for (
LoopInfo
::iterator I = LI->begin(), E = LI->end(); I != E; ++I)
235
// instead of relying on
LoopInfo
::verifyLoop since
LoopInfo
ProfileEstimatorPass.cpp
18
#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
>();
BranchProbabilityInfo.cpp
20
#include "llvm/Analysis/
LoopInfo
.h"
29
INITIALIZE_PASS_DEPENDENCY(
LoopInfo
)
375
AU.addRequired<
LoopInfo
>();
381
LI = &getAnalysis<
LoopInfo
>();
/external/llvm/lib/Transforms/Utils/
SimplifyIndVar.cpp
21
#include "llvm/Analysis/
LoopInfo
.h"
46
LoopInfo
*LI;
59
LI(LPM->getAnalysisIfAvailable<
LoopInfo
>()),
64
assert(LI && "IV simplification requires
LoopInfo
");
378
LoopInfo
*LI = &LPM->getAnalysis<
LoopInfo
>();
BasicBlockUtils.cpp
23
#include "llvm/Analysis/
LoopInfo
.h"
180
if (
LoopInfo
*LI = P->getAnalysisIfAvailable<
LoopInfo
>())
295
if (
LoopInfo
*LI = P->getAnalysisIfAvailable<
LoopInfo
>())
317
/// UpdateAnalysisInformation - Update DominatorTree,
LoopInfo
, and LCCSA
324
LoopInfo
*LI = P->getAnalysisIfAvailable<
LoopInfo
>();
344
// If we need to preserve
LoopInfo
, note whether any of the preds crosses
450
///
LoopInfo
, and LCCSA but no other analyses. In particular, it does no
[
all
...]
LoopSimplify.cpp
76
LoopInfo
*LI;
87
AU.addRequired<
LoopInfo
>();
88
AU.addPreserved<
LoopInfo
>();
115
INITIALIZE_PASS_DEPENDENCY(
LoopInfo
)
129
LI = &getAnalysis<
LoopInfo
>();
462
AliasAnalysis *AA,
LoopInfo
*LI) {
BreakCriticalEdges.cpp
22
#include "llvm/Analysis/
LoopInfo
.h"
46
AU.addPreserved<
LoopInfo
>();
241
LoopInfo
*LI = P->getAnalysisIfAvailable<
LoopInfo
>();
303
// Update
LoopInfo
if it is around.
LCSSA.cpp
70
AU.addRequired<
LoopInfo
>();
94
INITIALIZE_PASS_DEPENDENCY(
LoopInfo
)
Completed in 332 milliseconds
1
2