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

  /external/llvm/lib/Analysis/
LoopInfo.cpp 145 BasicBlock *Incoming = nullptr, *Backedge = nullptr;
148 "Loop must have at least one backedge!");
149 Backedge = *PI++;
155 if (contains(Backedge))
157 std::swap(Incoming, Backedge);
158 } else if (!contains(Backedge))
168 dyn_cast<Instruction>(PN->getIncomingValueForBlock(Backedge)))
223 // Normal-form loops have a preheader, a single backedge, and all of their
459 // Flag the presence of an irreducible backedge whose destination is a block
602 // irreducible backedge
    [all...]
BlockFrequencyInfoImpl.cpp 288 DEBUG(debugSuccessor("backedge"));
305 // Irreducible backedge. Abort.
310 // If "Pred" is a loop header, then this isn't really a backedge; rather,
328 // Irreducible backedge.
404 // Check for a local edge (non-backedge and non-exit).
413 assert(OuterLoop && "backedge or exit outside of loop");
415 // Check for a backedge.
416 if (W.Type == Weight::Backedge) {
742 // To do this, we distribute the initial mass using the backedge masses
  /external/llvm/include/llvm/Analysis/
LoopInfoImpl.h 486 BlockT *Backedge = *PI;
489 if (DomTree.dominates(Header, Backedge)
490 && DomTree.isReachableFromEntry(Backedge)) {
491 Backedges.push_back(Backedge);
BlockFrequencyInfoImpl.h 329 /// backedge to the loop header?
331 enum DistType { Local, Exit, Backedge };
362 add(Node, Amount, Weight::Backedge);
394 /// \return \c true unless there's an irreducible backedge.
401 /// edge is local/exit/backedge is in the context of LoopHead. Otherwise,
404 /// \return \c true unless aborted due to an irreducible backedge.
651 /// nodes that are targets of a backedge within it (excluding backedges within
690 /// Track the backedge mass distributed to the loop header, and use it to
705 /// within the current loop, \a Weight::Backedge, a backedge to th
    [all...]
  /external/llvm/lib/Target/Hexagon/
HexagonHardwareLoops.cpp 537 MachineBasicBlock *Backedge = *PI++;
544 // Make sure there is one incoming and one backedge and determine which
547 if (L->contains(Backedge))
549 std::swap(Incoming, Backedge);
550 } else if (!L->contains(Backedge))
    [all...]
  /external/v8/src/compiler/
scheduler.cc 601 // (i.e. A -> B is a backedge).
665 typedef std::pair<BasicBlock*, size_t> Backedge;
761 // The successor is on the stack, so this is a backedge (cycle).
762 backedges_.push_back(Backedge(frame->block, frame->index - 1));
    [all...]

Completed in 1821 milliseconds