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

  /external/llvm/lib/Analysis/
LoopInfo.cpp 144 BasicBlock *Incoming = nullptr, *Backedge = nullptr;
147 "Loop must have at least one backedge!");
148 Backedge = *PI++;
154 if (contains(Backedge))
156 std::swap(Incoming, Backedge);
157 } else if (!contains(Backedge))
167 dyn_cast<Instruction>(PN->getIncomingValueForBlock(Backedge)))
206 // Normal-form loops have a preheader, a single backedge, and all of their
433 // Flag the presence of an irreducible backedge whose destination is a block
576 // irreducible backedge
    [all...]
BlockFrequencyInfoImpl.cpp 289 DEBUG(debugSuccessor("backedge"));
306 // Irreducible backedge. Abort.
311 // If "Pred" is a loop header, then this isn't really a backedge; rather,
329 // Irreducible backedge.
399 // Check for a local edge (non-backedge and non-exit).
408 assert(OuterLoop && "backedge or exit outside of loop");
410 // Check for a backedge.
411 if (W.Type == Weight::Backedge) {
  /external/llvm/include/llvm/Analysis/
LoopInfoImpl.h 515 BlockT *Backedge = *PI;
518 if (DomTree.dominates(Header, Backedge)
519 && DomTree.isReachableFromEntry(Backedge)) {
520 Backedges.push_back(Backedge);
BlockFrequencyInfoImpl.h 330 /// backedge to the loop header?
332 enum DistType { Local, Exit, Backedge };
361 add(Node, Amount, Weight::Backedge);
393 /// \return \c true unless there's an irreducible backedge.
400 /// edge is local/exit/backedge is in the context of LoopHead. Otherwise,
403 /// \return \c true unless aborted due to an irreducible backedge.
638 /// nodes that are targets of a backedge within it (excluding backedges within
677 /// Track the backedge mass distributed to the loop header, and use it to
692 /// within the current loop, \a Weight::Backedge, a backedge to th
    [all...]
  /external/llvm/lib/Target/Hexagon/
HexagonHardwareLoops.cpp 436 MachineBasicBlock *Backedge = *PI++;
443 // Make sure there is one incoming and one backedge and determine which
446 if (L->contains(Backedge))
448 std::swap(Incoming, Backedge);
449 } else if (!L->contains(Backedge))
    [all...]

Completed in 129 milliseconds