213 struct ChainEdge;
306   ChainEdge *getEdge(ChainT *Other) const {  in getEdge()
307     for (const auto &[Chain, ChainEdge] : Edges) {  in getEdge()
309         return ChainEdge;  in getEdge()
325   void addEdge(ChainT *Other, ChainEdge *Edge) {  in addEdge()
363   std::vector<std::pair<ChainT *, ChainEdge *>> Edges;
369 struct ChainEdge {  struct
370   ChainEdge(const ChainEdge &) = delete;
371   ChainEdge(ChainEdge &&) = default;
372   ChainEdge &operator=(const ChainEdge &) = delete;
373   ChainEdge &operator=(ChainEdge &&) = delete;
375   explicit ChainEdge(JumpT *Jump)  in ChainEdge()  function
389   void moveJumps(ChainEdge *Other) {  in moveJumps()  argument
477     ChainEdge *CurEdge = getEdge(TargetChain);  in mergeEdges()
675         ChainEdge *CurEdge = PredNode.CurChain->getEdge(SuccNode->CurChain);  in initialize()
852                               ChainEdge *Edge) const {  in getBestMergeGain()
858     ChainEdge *EdgePP = ChainPred->getEdge(ChainPred);  in getBestMergeGain()
964     ChainEdge *SelfEdge = Into->getEdge(Into);  in mergeChains()
1029   std::vector<ChainEdge> AllEdges;
1113         ChainEdge *CurEdge = PredNode.CurChain->getEdge(SuccNode->CurChain);  in initialize()
1131     auto GainComparator = [](ChainEdge *L, ChainEdge *R) {  in mergeChainPairs()
1135     std::set<ChainEdge *, decltype(GainComparator)> Queue(GainComparator);  in mergeChainPairs()
1163       ChainEdge *BestEdge = *Queue.begin();  in mergeChainPairs()
1169       for (const auto &[_, ChainEdge] : BestSrcChain->Edges)  in mergeChainPairs()
1170         Queue.erase(ChainEdge);  in mergeChainPairs()
1171       for (const auto &[_, ChainEdge] : BestDstChain->Edges)  in mergeChainPairs()
1172         Queue.erase(ChainEdge);  in mergeChainPairs()
1209   MergeGainT getBestMergeGain(ChainEdge *Edge) const {  in getBestMergeGain()
1399   std::vector<ChainEdge> AllEdges;