Home
last modified time | relevance | path

Searched refs:Irr (Results 1 – 2 of 2) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DBlockFrequencyInfoImpl.cpp658 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()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h654 void addEdge(IrrNode &Irr, const BlockNode &Succ,
680 IrrNode &Irr = *L->second;
685 addEdge(Irr, I.first, OuterLoop);
687 addBlockEdges(*this, Irr, OuterLoop);
1647 void operator()(IrreducibleGraph &G, IrreducibleGraph::IrrNode &Irr,
1649 const BlockT *BB = BFI.RPOT[Irr.Node.Index];
1651 G.addEdge(Irr, BFI.getNode(Succ), OuterLoop);