HomeSort by relevance Sort by last modified time
    Searched refs:CurLoop (Results 1 - 10 of 10) sorted by null

  /external/llvm/lib/Transforms/Scalar/
LICM.cpp 77 static bool inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI);
78 static bool isNotUsedInLoop(const Instruction &I, const Loop *CurLoop);
81 const Loop *CurLoop, AliasSetTracker *CurAST );
84 const Loop *CurLoop,
89 const Loop *CurLoop,
101 Loop *CurLoop, AliasSetTracker *CurAST,
150 Loop *CurLoop; // The current loop we are working on...
219 CurLoop = L;
237 computeLICMSafetyInfo(&SafetyInfo, CurLoop);
250 Changed |= sinkRegion(DT->getNode(L->getHeader()), AA, LI, DT, TLI, CurLoop,
    [all...]
LoopIdiomRecognize.cpp 69 Loop *CurLoop;
190 CurLoop = L;
207 *CurLoop->getHeader()->getParent());
208 DL = &CurLoop->getHeader()->getModule()->getDataLayout();
217 const SCEV *BECount = SE->getBackedgeTakenCount(CurLoop);
229 CurLoop->getUniqueExitBlocks(ExitBlocks);
232 << CurLoop->getHeader()->getParent()->getName() << "] Loop %"
233 << CurLoop->getHeader()->getName() << "\n");
237 for (auto *BB : CurLoop->getBlocks()) {
239 if (LI->getLoopFor(BB) != CurLoop)
    [all...]
SeparateConstOffsetFromGEP.cpp 408 Loop *CurLoop);
    [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.
250 static bool LoopIsOuterMostWithPredecessor(MachineLoop *CurLoop) {
252 if (!CurLoop->getLoopPredecessor())
255 for (MachineLoop *L = CurLoop->getParentLoop(); L; L = L->getParentLoop())
300 CurLoop = Worklist.pop_back_val();
306 if (PreRegAlloc && !LoopIsOuterMostWithPredecessor(CurLoop)) {
307 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())
342 const MachineLoop *CurLoop = getLoopFor(MBB);
347 if (CurLoop && Succ == CurLoop->getHeader())
349 // Don't consider successors exiting CurLoop.
350 if (isExitingLoop(CurLoop, getLoopFor(Succ)))
    [all...]
  /external/llvm/lib/Analysis/
DependenceAnalysis.cpp 352 const Loop *CurLoop) {
356 AssociatedLoop = CurLoop;
363 const Loop *CurLoop) {
368 AssociatedLoop = CurLoop;
373 const Loop *CurLoop) {
378 AssociatedLoop = CurLoop;
    [all...]
ScalarEvolutionExpander.cpp 690 const Loop *CurLoop = I->first;
700 for (; I != E && I->first == CurLoop; ++I) {
717 for (++I; I != E && I->first == CurLoop; ++I)
    [all...]
  /external/llvm/include/llvm/Analysis/
LoopInfo.h 96 for (const LoopT *CurLoop = ParentLoop; CurLoop;
97 CurLoop = CurLoop->ParentLoop)
  /external/llvm/lib/TableGen/
TGParser.cpp 303 ForeachLoop &CurLoop = Loops[IterVals.size()];
304 ListInit *List = dyn_cast<ListInit>(CurLoop.ListValue);
313 IterVals.push_back(IterRecord(CurLoop.IterVar, ItemVal));
    [all...]

Completed in 435 milliseconds