Lines Matching refs:Irr
572 void IrreducibleGraph::addEdge(IrrNode &Irr, const BlockNode &Succ, in addEdge() argument
580 Irr.Edges.push_back(&SuccIrr); in addEdge()
581 SuccIrr.Edges.push_front(&Irr); in addEdge()
617 auto &Irr = *I->first; in findIrreducibleHeaders() local
618 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) { in findIrreducibleHeaders()
624 Headers.push_back(Irr.Node); in findIrreducibleHeaders()
625 DEBUG(dbgs() << " => entry = " << BFI.getBlockName(Irr.Node) << "\n"); in findIrreducibleHeaders()
643 auto &Irr = *I.first; in findIrreducibleHeaders() local
644 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) { in findIrreducibleHeaders()
646 if (P->Node < Irr.Node) in findIrreducibleHeaders()
655 Headers.push_back(Irr.Node); in findIrreducibleHeaders()
656 DEBUG(dbgs() << " => extra = " << BFI.getBlockName(Irr.Node) << "\n"); in findIrreducibleHeaders()
659 if (Headers.back() == Irr.Node) in findIrreducibleHeaders()
664 Others.push_back(Irr.Node); in findIrreducibleHeaders()
665 DEBUG(dbgs() << " => other = " << BFI.getBlockName(Irr.Node) << "\n"); in findIrreducibleHeaders()