Searched refs:Backedge (Results 1 – 6 of 6) sorted by relevance
123 BasicBlock *&Backedge) const { in getIncomingAndBackEdge()127 Backedge = nullptr; in getIncomingAndBackEdge()130 Backedge = *PI++; in getIncomingAndBackEdge()138 if (contains(Backedge)) in getIncomingAndBackEdge()140 std::swap(Incoming, Backedge); in getIncomingAndBackEdge()141 } else if (!contains(Backedge)) in getIncomingAndBackEdge()144 assert(Incoming && Backedge && "expected non-null incoming and backedges"); in getIncomingAndBackEdge()151 BasicBlock *Incoming = nullptr, *Backedge = nullptr; in getCanonicalInductionVariable() local152 if (!getIncomingAndBackEdge(Incoming, Backedge)) in getCanonicalInductionVariable()162 dyn_cast<Instruction>(PN->getIncomingValueForBlock(Backedge))) in getCanonicalInductionVariable()
447 if (W.Type == Weight::Backedge) { in distributeMass()
547 for (const auto Backedge : children<Inverse<BlockT *>>(Header)) { in analyze() local549 if (DomTree.dominates(Header, Backedge) && in analyze()550 DomTree.isReachableFromEntry(Backedge)) { in analyze()551 Backedges.push_back(Backedge); in analyze()
357 enum DistType { Local, Exit, Backedge }; enumerator393 add(Node, Amount, Weight::Backedge); in addBackedge()
574 BasicBlock *&Backedge) const;
572 MachineBasicBlock *Backedge = *PI++; in getLoopTripCount() local582 if (L->contains(Backedge)) in getLoopTripCount()584 std::swap(Incoming, Backedge); in getLoopTripCount()585 } else if (!L->contains(Backedge)) in getLoopTripCount()