Lines Matching defs:Irr

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