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

  /external/llvm/lib/Analysis/
LoopInfo.cpp 142 BasicBlock *Incoming = 0, *Backedge = 0;
145 "Loop must have at least one backedge!");
146 Backedge = *PI++;
152 if (contains(Backedge))
154 std::swap(Incoming, Backedge);
155 } else if (!contains(Backedge))
165 dyn_cast<Instruction>(PN->getIncomingValueForBlock(Backedge)))
209 // Normal-form loops have a preheader, a single backedge, and all of their
396 // Flag the presence of an irreducible backedge whose destination is a block
539 // irreducible backedge
    [all...]
  /external/llvm/include/llvm/Analysis/
LoopInfoImpl.h 535 BlockT *Backedge = *PI;
538 if (DomTree.dominates(Header, Backedge)
539 && DomTree.isReachableFromEntry(Backedge)) {
540 Backedges.push_back(Backedge);
  /external/llvm/lib/Target/PowerPC/
PPCCTRLoops.cpp 263 MachineBasicBlock *Backedge = *PI++;
268 // make sure there is one incoming and one backedge and determine which
271 if (L->contains(Backedge))
273 std::swap(Incoming, Backedge);
274 } else if (!L->contains(Backedge))
279 // - The recurrence comes from the backedge.
286 // Check each operand for the value from the backedge.
288 if (L->contains(MBB)) { // operands comes from the backedge
  /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 155 milliseconds