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

  /external/llvm/lib/Transforms/Scalar/
LoopIdiomRecognize.cpp 96 Loop *CurLoop;
133 Loop *CurLoop;
203 Loop *getLoop() const { return CurLoop; }
309 LIR(TheLIR), CurLoop(TheLIR.getLoop()), PreCondBB(0) {
323 if (CurLoop->getNumBackEdges() != 1 || CurLoop->getNumBlocks() != 1)
326 BasicBlock *LoopBody = *(CurLoop->block_begin());
333 BasicBlock *PreHead = CurLoop->getLoopPreheader();
398 LoopEntry = *(CurLoop->block_begin());
483 Value *T = matchCondition (PreCondBr, CurLoop->getLoopPreheader())
    [all...]
LICM.cpp 112 Loop *CurLoop; // The current loop we are working on...
146 assert(CurLoop->contains(BB) && "Only valid if BB is IN the loop");
147 return LI->getLoopFor(BB) != CurLoop;
177 // Check to see if any of the basic blocks in CurLoop invalidate *V.
233 CurLoop = L;
286 CurLoop = 0;
309 if (!CurLoop->contains(BB)) return;
356 if (!CurLoop->contains(BB)) return;
380 if (CurLoop->hasLoopInvariantOperands(&I) && canSinkOrHoistInst(I) &&
464 if (CurLoop->contains(PN->getIncomingBlock(i))
    [all...]
  /external/llvm/lib/CodeGen/
MachineLICM.cpp 80 MachineLoop *CurLoop; // The current loop we are working on.
81 MachineBasicBlock *CurPreheader; // The preheader for CurLoop.
83 // Exit blocks for CurLoop.
309 static bool LoopIsOuterMostWithPredecessor(MachineLoop *CurLoop) {
311 if (!CurLoop->getLoopPredecessor())
314 for (MachineLoop *L = CurLoop->getParentLoop(); L; L = L->getParentLoop())
357 CurLoop = Worklist.pop_back_val();
363 if (PreRegAlloc && !LoopIsOuterMostWithPredecessor(CurLoop)) {
364 Worklist.append(CurLoop->begin(), CurLoop->end())
    [all...]
PHIElimination.cpp 550 const MachineLoop *CurLoop = MLI ? MLI->getLoopFor(&MBB) : 0;
551 bool IsLoopHeader = CurLoop && &MBB == CurLoop->getHeader();
568 if (IsLoopHeader && PreLoop == CurLoop && !SplitAllCriticalEdges)
595 if (!ShouldSplit && CurLoop != PreLoop) {
599 if (CurLoop) dbgs() << "CurLoop: " << *CurLoop;
604 // Split unless this edge is entering CurLoop from an outer loop.
605 ShouldSplit = PreLoop && !PreLoop->contains(CurLoop);
    [all...]
MachineTraceMetrics.cpp 320 const MachineLoop *CurLoop = getLoopFor(MBB);
322 if (CurLoop && MBB == CurLoop->getHeader())
348 const MachineLoop *CurLoop = getLoopFor(MBB);
355 if (CurLoop && Succ == CurLoop->getHeader())
357 // Don't consider successors exiting CurLoop.
358 if (isExitingLoop(CurLoop, getLoopFor(Succ)))
    [all...]
  /external/llvm/lib/Analysis/
DependenceAnalysis.cpp 347 const Loop *CurLoop) {
351 AssociatedLoop = CurLoop;
358 const Loop *CurLoop) {
363 AssociatedLoop = CurLoop;
368 const Loop *CurLoop) {
373 AssociatedLoop = CurLoop;
    [all...]
ScalarEvolutionExpander.cpp 730 const Loop *CurLoop = I->first;
740 for (; I != E && I->first == CurLoop; ++I) {
757 for (++I; I != E && I->first == CurLoop; ++I)
    [all...]
  /external/llvm/include/llvm/Analysis/
LoopInfo.h 88 for (const LoopT *CurLoop = ParentLoop; CurLoop;
89 CurLoop = CurLoop->ParentLoop)
  /external/llvm/lib/TableGen/
TGParser.cpp 315 ForeachLoop &CurLoop = Loops[IterVals.size()];
316 ListInit *List = dyn_cast<ListInit>(CurLoop.ListValue);
325 IterVals.push_back(IterRecord(CurLoop.IterVar, ItemVal));
    [all...]

Completed in 769 milliseconds