75 class Edge;
91   Edge *getEdge(Chain *Other) const {  in getEdge()
92     for (std::pair<Chain *, Edge *> It : Edges)  in getEdge()
109   void addEdge(Chain *Other, Edge *Edge) { Edges.emplace_back(Other, Edge); }  in addEdge()  argument
135   std::vector<std::pair<Chain *, Edge *>> Edges;
141 class Edge {  class
143   Edge(const Edge &) = delete;
144   Edge(Edge &&) = default;
145   Edge &operator=(const Edge &) = delete;
146   Edge &operator=(Edge &&) = default;
148   explicit Edge(Chain *SrcChain_, Chain *DstChain_, const Arc *A)  in Edge()  function in llvm::bolt::__anonbf028ece0111::Edge
158   void moveArcs(Edge *Other) {  in moveArcs()
207     Edge *const DstEdge = EdgeIt.second;  in mergeEdges()
211     Edge *CurEdge = getEdge(TargetChain);  in mergeEdges()
296         Edge *CurEdge = NodeChain[F]->getEdge(NodeChain[Succ]);  in initialize()
350     Edge *Edge = Chain->getEdge(Chain);  in shortCalls()  local
351     if (Edge == nullptr)  in shortCalls()
355     for (const Arc *Arc : Edge->Arcs) {  in shortCalls()
365   double shortCalls(Chain *ChainPred, Chain *ChainSucc, Edge *Edge) const {  in shortCalls()
367     for (const Arc *Arc : Edge->Arcs) {  in shortCalls()
403   double mergeGain(Chain *ChainPred, Chain *ChainSucc, Edge *Edge) const {  in mergeGain()
409                        shortCalls(ChainPred, ChainSucc, Edge);  in mergeGain()
477     auto GainComparator = [](Edge *L, Edge *R) {  in runPassTwo()
487     std::set<Edge *, decltype(GainComparator)> Queue(GainComparator);  in runPassTwo()
493         Edge *ChainEdge = EdgeIt.second;  in runPassTwo()
513       Edge *It = *Queue.begin();  in runPassTwo()
515       Edge *BestEdge = It;  in runPassTwo()
522       for (std::pair<Chain *, Edge *> EdgeIt : BestChainPred->Edges)  in runPassTwo()
524       for (std::pair<Chain *, Edge *> EdgeIt : BestChainSucc->Edges)  in runPassTwo()
533         Edge *ChainEdge = EdgeIt.second;  in runPassTwo()
584   std::vector<Edge> AllEdges;