Lines Matching refs:Irr
658 void IrreducibleGraph::addEdge(IrrNode &Irr, const BlockNode &Succ, in addEdge() argument
666 Irr.Edges.push_back(&SuccIrr); in addEdge()
667 SuccIrr.Edges.push_front(&Irr); in addEdge()
702 auto &Irr = *I->first; in findIrreducibleHeaders() local
703 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) { in findIrreducibleHeaders()
709 Headers.push_back(Irr.Node); in findIrreducibleHeaders()
710 LLVM_DEBUG(dbgs() << " => entry = " << BFI.getBlockName(Irr.Node) in findIrreducibleHeaders()
729 auto &Irr = *I.first; in findIrreducibleHeaders() local
730 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) { in findIrreducibleHeaders()
732 if (P->Node < Irr.Node) in findIrreducibleHeaders()
741 Headers.push_back(Irr.Node); in findIrreducibleHeaders()
742 LLVM_DEBUG(dbgs() << " => extra = " << BFI.getBlockName(Irr.Node) in findIrreducibleHeaders()
746 if (Headers.back() == Irr.Node) in findIrreducibleHeaders()
751 Others.push_back(Irr.Node); in findIrreducibleHeaders()
752 LLVM_DEBUG(dbgs() << " => other = " << BFI.getBlockName(Irr.Node) << "\n"); in findIrreducibleHeaders()