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

  /external/llvm/lib/Transforms/Scalar/
LICM.cpp 102 Loop *CurLoop; // The current loop we are working on...
133 assert(CurLoop->contains(BB) && "Only valid if BB is IN the loop");
134 return LI->getLoopFor(BB) != CurLoop;
164 // Check to see if any of the basic blocks in CurLoop invalidate *V.
214 CurLoop = L;
255 CurLoop = 0;
278 if (!CurLoop->contains(BB)) return;
325 if (!CurLoop->contains(BB)) return;
349 if (CurLoop->hasLoopInvariantOperands(&I) && canSinkOrHoistInst(I) &&
427 if (CurLoop->contains(PN->getIncomingBlock(i))
    [all...]
LoopIdiomRecognize.cpp 67 Loop *CurLoop;
174 CurLoop = L;
203 CurLoop->getUniqueExitBlocks(ExitBlocks);
214 if (LI.getLoopFor(*BI) != CurLoop)
285 if (StoreEv == 0 || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine())
316 if (LoadEv && LoadEv->getLoop() == CurLoop && LoadEv->isAffine() &&
342 if (Ev == 0 || Ev->getLoop() != CurLoop || !Ev->isAffine())
457 CurLoop->isLoopInvariant(SplatValue)) {
473 BasicBlock *Preheader = CurLoop->getLoopPreheader();
489 CurLoop, BECount
    [all...]
  /external/llvm/lib/CodeGen/
MachineLICM.cpp 81 MachineLoop *CurLoop; // The current loop we are working on.
82 MachineBasicBlock *CurPreheader; // The preheader for CurLoop.
295 static bool LoopIsOuterMostWithPredecessor(MachineLoop *CurLoop) {
297 if (!CurLoop->getLoopPredecessor())
300 for (MachineLoop *L = CurLoop->getParentLoop(); L; L = L->getParentLoop())
342 CurLoop = Worklist.pop_back_val();
347 if (PreRegAlloc && !LoopIsOuterMostWithPredecessor(CurLoop)) {
348 Worklist.append(CurLoop->begin(), CurLoop->end());
357 MachineDomTreeNode *N = DT->getNode(CurLoop->getHeader())
    [all...]
  /external/llvm/include/llvm/Analysis/
LoopInfo.h 93 for (const LoopT *CurLoop = ParentLoop; CurLoop;
94 CurLoop = CurLoop->ParentLoop)
    [all...]
  /external/llvm/lib/Analysis/
ScalarEvolutionExpander.cpp 717 const Loop *CurLoop = I->first;
727 for (; I != E && I->first == CurLoop; ++I) {
744 for (++I; I != E && I->first == CurLoop; ++I)
    [all...]

Completed in 123 milliseconds