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 95 Loop *CurLoop;
132 Loop *CurLoop;
207 Loop *getLoop() const { return CurLoop; }
308 LIR(TheLIR), CurLoop(TheLIR.getLoop()), PreCondBB(nullptr) {
322 if (CurLoop->getNumBackEdges() != 1 || CurLoop->getNumBlocks() != 1)
325 BasicBlock *LoopBody = *(CurLoop->block_begin());
332 BasicBlock *PreHead = CurLoop->getLoopPreheader();
397 LoopEntry = *(CurLoop->block_begin());
481 Value *T = matchCondition (PreCondBr, CurLoop->getLoopPreheader())
    [all...]
LICM.cpp 118 Loop *CurLoop; // The current loop we are working on...
153 assert(CurLoop->contains(BB) && "Only valid if BB is IN the loop");
154 return LI->getLoopFor(BB) != CurLoop;
184 // Check to see if any of the basic blocks in CurLoop invalidate *V.
257 CurLoop = L;
327 CurLoop = nullptr;
350 if (!CurLoop->contains(BB)) return;
397 if (!CurLoop->contains(BB)) return;
421 if (CurLoop->hasLoopInvariantOperands(&I) && canSinkOrHoistInst(I) &&
520 if (CurLoop->contains(PN)
    [all...]
  /external/llvm/lib/CodeGen/
MachineLICM.cpp 81 MachineLoop *CurLoop; // The current loop we are working on.
82 MachineBasicBlock *CurPreheader; // The preheader for CurLoop.
84 // Exit blocks for CurLoop.
310 static bool LoopIsOuterMostWithPredecessor(MachineLoop *CurLoop) {
312 if (!CurLoop->getLoopPredecessor())
315 for (MachineLoop *L = CurLoop->getParentLoop(); L; L = L->getParentLoop())
361 CurLoop = Worklist.pop_back_val();
367 if (PreRegAlloc && !LoopIsOuterMostWithPredecessor(CurLoop)) {
368 Worklist.append(CurLoop->begin(), CurLoop->end())
    [all...]
PHIElimination.cpp 551 const MachineLoop *CurLoop = MLI ? MLI->getLoopFor(&MBB) : nullptr;
552 bool IsLoopHeader = CurLoop && &MBB == CurLoop->getHeader();
569 if (IsLoopHeader && PreLoop == CurLoop && !SplitAllCriticalEdges)
596 if (!ShouldSplit && CurLoop != PreLoop) {
600 if (CurLoop) dbgs() << "CurLoop: " << *CurLoop;
605 // Split unless this edge is entering CurLoop from an outer loop.
606 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 352 const Loop *CurLoop) {
356 AssociatedLoop = CurLoop;
363 const Loop *CurLoop) {
368 AssociatedLoop = CurLoop;
373 const Loop *CurLoop) {
378 AssociatedLoop = CurLoop;
    [all...]
ScalarEvolutionExpander.cpp 723 const Loop *CurLoop = I->first;
733 for (; I != E && I->first == CurLoop; ++I) {
750 for (++I; I != E && I->first == CurLoop; ++I)
    [all...]
  /external/llvm/include/llvm/Analysis/
LoopInfo.h 93 for (const LoopT *CurLoop = ParentLoop; CurLoop;
94 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 317 milliseconds