Lines Matching refs:Irr
608 void IrreducibleGraph::addEdge(IrrNode &Irr, const BlockNode &Succ,
616 Irr.Edges.push_back(&SuccIrr);
617 SuccIrr.Edges.push_front(&Irr);
653 auto &Irr = *I->first;
654 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) {
660 Headers.push_back(Irr.Node);
661 DEBUG(dbgs() << " => entry = " << BFI.getBlockName(Irr.Node) << "\n");
679 auto &Irr = *I.first;
680 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) {
682 if (P->Node < Irr.Node)
691 Headers.push_back(Irr.Node);
692 DEBUG(dbgs() << " => extra = " << BFI.getBlockName(Irr.Node) << "\n");
695 if (Headers.back() == Irr.Node)
700 Others.push_back(Irr.Node);
701 DEBUG(dbgs() << " => other = " << BFI.getBlockName(Irr.Node) << "\n");
