HomeSort by relevance Sort by last modified time
    Searched full:subloop (Results 1 - 11 of 11) sorted by null

  /external/llvm/include/llvm/Analysis/
LoopInfoImpl.h 290 // Each block in each subloop should be contained within this loop.
294 "Loop does not contain all the blocks of a subloop!");
301 "Loop is not a subloop of its parent!");
342 /// Discover a subloop with the specified backedges such that: All blocks within
343 /// this loop are mapped to this loop or a subloop. And all subloops within this
344 /// loop have their parent loop set to this loop or a subloop.
360 LoopT *Subloop = LI->getLoopFor(PredBB);
361 if (!Subloop) {
377 while (LoopT *Parent = Subloop->getParentLoop())
378 Subloop = Parent
    [all...]
LoopInfo.h 273 /// removeChildLoop - This removes the specified child from being a subloop of
584 "Loops already embedded into a subloop!");
590 assert(!New->getParentLoop() && "Loop already in subloop!");
609 static bool isNotAlreadyContainedIn(const LoopT *SubLoop,
611 if (!SubLoop) return true;
612 if (SubLoop == ParentLoop) return false;
613 return isNotAlreadyContainedIn(SubLoop->getParentLoop(), ParentLoop);
BlockFrequencyInfoImpl.h 687 /// If this is a packaged-subloop, the weight distribution is stored
839 /// \pre \a computeMassInLoop() has been called for each subloop of \c Loop.
    [all...]
  /external/llvm/lib/Analysis/
LoopInfo.cpp 429 // subloop's new parent will be the nearest loop reachable from either its own
472 // Or the current block is part of a subloop, in which case its parent
529 Loop *Subloop = *std::prev(Unloop->end());
532 assert(SubloopParents.count(Subloop) && "DFS failed to visit subloop");
533 if (Loop *Parent = SubloopParents[Subloop])
534 Parent->addChildLoop(Subloop);
536 LI->addTopLevelLoop(Subloop);
541 /// successors. If a successor is a subloop header, consider its parent to be
542 /// the nearest parent of the subloop's exits
    [all...]
BlockFrequencyInfoImpl.cpp 367 // Clear the subloop exits to prevent quadratic memory usage.
  /external/llvm/test/Transforms/LICM/
scalar_promote.ll 87 br label %subloop
89 subloop:
90 %count = phi i8 [ 0, %loop ], [ %nextcount, %subloop ]
97 br i1 %innerexitcond, label %innerexit, label %subloop
100 ; CHECK: subloop:
  /external/llvm/lib/Transforms/Scalar/
LoopInstSimplify.cpp 87 // block is the header of a subloop, in which case we only process its phis.
146 // their phis, but we contract the rest of the subloop body and only follow
LICM.cpp 150 /// block is in a subloop of the current one, not the current one itself.
252 // subloop's anymore.
358 // subloop (which would already have been processed).
400 // subloop (which would already have been processed).
    [all...]
IndVarSimplify.cpp 541 // If this pred is for a subloop, not L itself, skip it.
543 continue; // The Block is in a subloop, skip it.
    [all...]
  /external/llvm/lib/Transforms/Utils/
BreakCriticalEdges.cpp 321 // the predecessor must be directly in TIL, not in a subloop, or again
LoopSimplify.cpp 305 // L is now a subloop of our outer loop.
    [all...]

Completed in 1118 milliseconds