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

  /external/llvm/lib/Transforms/Scalar/
LICM.cpp 109 Loop *CurLoop; // The current loop we are working on...
143 assert(CurLoop->contains(BB) && "Only valid if BB is IN the loop");
144 return LI->getLoopFor(BB) != CurLoop;
174 // Check to see if any of the basic blocks in CurLoop invalidate *V.
230 CurLoop = L;
283 CurLoop = 0;
306 if (!CurLoop->contains(BB)) return;
353 if (!CurLoop->contains(BB)) return;
377 if (CurLoop->hasLoopInvariantOperands(&I) && canSinkOrHoistInst(I) &&
462 if (CurLoop->contains(PN->getIncomingBlock(i))
    [all...]
LoopIdiomRecognize.cpp 67 Loop *CurLoop;
176 CurLoop = L;
205 CurLoop->getUniqueExitBlocks(ExitBlocks);
216 if (LI.getLoopFor(*BI) != CurLoop)
287 if (StoreEv == 0 || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine())
318 if (LoadEv && LoadEv->getLoop() == CurLoop && LoadEv->isAffine() &&
344 if (Ev == 0 || Ev->getLoop() != CurLoop || !Ev->isAffine())
459 CurLoop->isLoopInvariant(SplatValue)) {
475 BasicBlock *Preheader = CurLoop->getLoopPreheader();
491 CurLoop, BECount
    [all...]
  /external/llvm/lib/CodeGen/
PHIElimination.cpp 426 const MachineLoop *CurLoop = MLI ? MLI->getLoopFor(&MBB) : 0;
427 bool IsLoopHeader = CurLoop && &MBB == CurLoop->getHeader();
444 if (IsLoopHeader && PreLoop == CurLoop)
471 if (!ShouldSplit && CurLoop != PreLoop) {
475 if (CurLoop) dbgs() << "CurLoop: " << *CurLoop;
480 // Split unless this edge is entering CurLoop from an outer loop.
481 ShouldSplit = PreLoop && !PreLoop->contains(CurLoop);
    [all...]
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...]
MachineTraceMetrics.cpp 224 const MachineLoop *CurLoop = getLoopFor(MBB);
226 if (CurLoop && MBB == CurLoop->getHeader())
252 const MachineLoop *CurLoop = getLoopFor(MBB);
259 if (CurLoop && Succ == CurLoop->getHeader())
261 // Don't consider successors exiting CurLoop.
262 if (isExitingLoop(CurLoop, getLoopFor(Succ)))
    [all...]
  /external/llvm/include/llvm/Analysis/
LoopInfo.h 92 for (const LoopT *CurLoop = ParentLoop; CurLoop;
93 CurLoop = CurLoop->ParentLoop)
  /external/llvm/lib/Analysis/
ScalarEvolutionExpander.cpp 731 const Loop *CurLoop = I->first;
741 for (; I != E && I->first == CurLoop; ++I) {
758 for (++I; I != E && I->first == CurLoop; ++I)
    [all...]
  /external/llvm/lib/TableGen/
TGParser.cpp 313 ForeachLoop &CurLoop = Loops[IterVals.size()];
314 ListInit *List = dynamic_cast<ListInit *>(CurLoop.ListValue);
323 IterVals.push_back(IterRecord(CurLoop.IterVar, ItemVal));
    [all...]

Completed in 169 milliseconds