OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:CurLoop
(Results
1 - 9
of
9
) sorted by null
/external/llvm/lib/Transforms/Scalar/
LICM.cpp
74
static bool inSubLoop(BasicBlock *BB, Loop *
CurLoop
, LoopInfo *LI);
75
static bool isNotUsedInLoop(Instruction &I, Loop *
CurLoop
);
78
Loop *
CurLoop
, AliasSetTracker *CurAST );
80
Loop *
CurLoop
, LICMSafetyInfo *SafetyInfo);
82
Loop *
CurLoop
,
91
DominatorTree *DT, Loop *
CurLoop
,
138
Loop *
CurLoop
; // The current loop we are working on...
204
CurLoop
= L;
222
computeLICMSafetyInfo(&SafetyInfo,
CurLoop
);
235
Changed |= sinkRegion(DT->getNode(L->getHeader()), AA, LI, DT, TLI,
CurLoop
,
[
all
...]
LoopIdiomRecognize.cpp
95
Loop *
CurLoop
;
132
Loop *
CurLoop
;
203
*
CurLoop
->getHeader()->getParent()));
206
Loop *getLoop() const { return
CurLoop
; }
276
LIR(TheLIR),
CurLoop
(TheLIR.getLoop()), PreCondBB(nullptr) {
290
if (
CurLoop
->getNumBackEdges() != 1 ||
CurLoop
->getNumBlocks() != 1)
293
BasicBlock *LoopBody = *(
CurLoop
->block_begin());
300
BasicBlock *PreHead =
CurLoop
->getLoopPreheader();
365
LoopEntry = *(
CurLoop
->block_begin())
[
all
...]
/external/llvm/lib/CodeGen/
MachineLICM.cpp
88
MachineLoop *
CurLoop
; // The current loop we are working on.
89
MachineBasicBlock *CurPreheader; // The preheader for
CurLoop
.
91
// Exit blocks for
CurLoop
.
324
static bool LoopIsOuterMostWithPredecessor(MachineLoop *
CurLoop
) {
326
if (!
CurLoop
->getLoopPredecessor())
329
for (MachineLoop *L =
CurLoop
->getParentLoop(); L; L = L->getParentLoop())
373
CurLoop
= Worklist.pop_back_val();
379
if (PreRegAlloc && !LoopIsOuterMostWithPredecessor(
CurLoop
)) {
380
Worklist.append(
CurLoop
->begin(),
CurLoop
->end())
[
all
...]
PHIElimination.cpp
554
const MachineLoop *
CurLoop
= MLI ? MLI->getLoopFor(&MBB) : nullptr;
555
bool IsLoopHeader =
CurLoop
&& &MBB ==
CurLoop
->getHeader();
572
if (IsLoopHeader && PreLoop ==
CurLoop
&& !SplitAllCriticalEdges)
601
if (!ShouldSplit &&
CurLoop
!= PreLoop) {
605
if (
CurLoop
) dbgs() << "
CurLoop
: " << *
CurLoop
;
610
// Split unless this edge is entering
CurLoop
from an outer loop.
611
ShouldSplit = PreLoop && !PreLoop->contains(
CurLoop
);
[
all
...]
MachineTraceMetrics.cpp
316
const MachineLoop *
CurLoop
= getLoopFor(MBB);
318
if (
CurLoop
&& MBB ==
CurLoop
->getHeader())
344
const MachineLoop *
CurLoop
= getLoopFor(MBB);
351
if (
CurLoop
&& Succ ==
CurLoop
->getHeader())
353
// Don't consider successors exiting
CurLoop
.
354
if (isExitingLoop(
CurLoop
, getLoopFor(Succ)))
[
all
...]
/external/llvm/lib/Analysis/
DependenceAnalysis.cpp
351
const Loop *
CurLoop
) {
355
AssociatedLoop =
CurLoop
;
362
const Loop *
CurLoop
) {
367
AssociatedLoop =
CurLoop
;
372
const Loop *
CurLoop
) {
377
AssociatedLoop =
CurLoop
;
[
all
...]
ScalarEvolutionExpander.cpp
687
const Loop *
CurLoop
= I->first;
697
for (; I != E && I->first ==
CurLoop
; ++I) {
714
for (++I; I != E && I->first ==
CurLoop
; ++I)
[
all
...]
/external/llvm/include/llvm/Analysis/
LoopInfo.h
98
for (const LoopT *
CurLoop
= ParentLoop;
CurLoop
;
99
CurLoop
=
CurLoop
->ParentLoop)
/external/llvm/lib/TableGen/
TGParser.cpp
318
ForeachLoop &
CurLoop
= Loops[IterVals.size()];
319
ListInit *List = dyn_cast<ListInit>(
CurLoop
.ListValue);
328
IterVals.push_back(IterRecord(
CurLoop
.IterVar, ItemVal));
[
all
...]
Completed in 248 milliseconds