Lines Matching refs:Irr
582 void IrreducibleGraph::addEdge(IrrNode &Irr, const BlockNode &Succ, in addEdge() argument
590 Irr.Edges.push_back(&SuccIrr); in addEdge()
591 SuccIrr.Edges.push_front(&Irr); in addEdge()
627 auto &Irr = *I->first; in findIrreducibleHeaders() local
628 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) { in findIrreducibleHeaders()
634 Headers.push_back(Irr.Node); in findIrreducibleHeaders()
635 DEBUG(dbgs() << " => entry = " << BFI.getBlockName(Irr.Node) << "\n"); in findIrreducibleHeaders()
653 auto &Irr = *I.first; in findIrreducibleHeaders() local
654 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) { in findIrreducibleHeaders()
656 if (P->Node < Irr.Node) in findIrreducibleHeaders()
665 Headers.push_back(Irr.Node); in findIrreducibleHeaders()
666 DEBUG(dbgs() << " => extra = " << BFI.getBlockName(Irr.Node) << "\n"); in findIrreducibleHeaders()
669 if (Headers.back() == Irr.Node) in findIrreducibleHeaders()
674 Others.push_back(Irr.Node); in findIrreducibleHeaders()
675 DEBUG(dbgs() << " => other = " << BFI.getBlockName(Irr.Node) << "\n"); in findIrreducibleHeaders()