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

  /external/llvm/lib/Transforms/Scalar/
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...]
LICM.cpp 109 Loop *CurLoop; // The current loop we are working on...
140 assert(CurLoop->contains(BB) && "Only valid if BB is IN the loop");
141 return LI->getLoopFor(BB) != CurLoop;
171 // Check to see if any of the basic blocks in CurLoop invalidate *V.
225 CurLoop = L;
266 CurLoop = 0;
289 if (!CurLoop->contains(BB)) return;
336 if (!CurLoop->contains(BB)) return;
360 if (CurLoop->hasLoopInvariantOperands(&I) && canSinkOrHoistInst(I) &&
440 if (CurLoop->contains(PN->getIncomingBlock(i))
    [all...]
  /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/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...]

Completed in 51 milliseconds