Searched refs:Irr (Results 1 – 2 of 2) sorted by relevance
| /minix3/external/bsd/llvm/dist/llvm/lib/Analysis/ |
| H A D | BlockFrequencyInfoImpl.cpp | 560 void IrreducibleGraph::addEdge(IrrNode &Irr, const BlockNode &Succ, in addEdge() argument
568 Irr.Edges.push_back(&SuccIrr); in addEdge()
569 SuccIrr.Edges.push_front(&Irr); in addEdge()
605 auto &Irr = *I->first; in findIrreducibleHeaders() local
606 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) { in findIrreducibleHeaders()
612 Headers.push_back(Irr.Node); in findIrreducibleHeaders()
613 DEBUG(dbgs() << " => entry = " << BFI.getBlockName(Irr.Node) << "\n"); in findIrreducibleHeaders()
631 auto &Irr = *I.first; in findIrreducibleHeaders() local
632 for (const auto *P : make_range(Irr.pred_begin(), Irr.pred_end())) { in findIrreducibleHeaders()
634 if (P->Node < Irr.Node) in findIrreducibleHeaders()
[all …]
|
| /minix3/external/bsd/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | BlockFrequencyInfoImpl.h | 577 void addEdge(IrrNode &Irr, const BlockNode &Succ,
601 IrrNode &Irr = *L->second;
606 addEdge(Irr, I.first, OuterLoop);
608 addBlockEdges(*this, Irr, OuterLoop);
1102 void operator()(IrreducibleGraph &G, IrreducibleGraph::IrrNode &Irr,
1104 const BlockT *BB = BFI.RPOT[Irr.Node.Index];
1107 G.addEdge(Irr, BFI.getNode(*I), OuterLoop);
|