246   ChainT *CurChain{nullptr};  member
337       Nodes[Idx]->CurChain = this;  in merge()
376       : SrcChain(Jump->Source->CurChain), DstChain(Jump->Target->CurChain),  in ChainEdge()
664       Node.CurChain = &AllChains.back();  in initialize()
675         ChainEdge *CurEdge = PredNode.CurChain->getEdge(SuccNode->CurChain);  in initialize()
678           assert(SuccNode->CurChain->getEdge(PredNode.CurChain) != nullptr);  in initialize()
684         PredNode.CurChain->addEdge(SuccNode->CurChain, &AllEdges.back());  in initialize()
685         SuccNode->CurChain->addEdge(PredNode.CurChain, &AllEdges.back());  in initialize()
733           mergeChains(Node.CurChain, NextBlock->CurChain, 0, MergeTypeT::X_Y);  in mergeForcedPairs()
813         ChainT *SrcChain = AllNodes[SrcBB].CurChain;  in mergeColdChains()
814         ChainT *DstChain = AllNodes[DstBB].CurChain;  in mergeColdChains()
890       if (SrcBlock->CurChain != ChainPred)  in getBestMergeGain()
899       if (DstBlock->CurChain != ChainPred)  in getBestMergeGain()
1105       Node.CurChain = &AllChains.back();  in initialize()
1113         ChainEdge *CurEdge = PredNode.CurChain->getEdge(SuccNode->CurChain);  in initialize()
1116           assert(SuccNode->CurChain->getEdge(PredNode.CurChain) != nullptr);  in initialize()
1122         PredNode.CurChain->addEdge(SuccNode->CurChain, &AllEdges.back());  in initialize()
1123         SuccNode->CurChain->addEdge(PredNode.CurChain, &AllEdges.back());  in initialize()
1143       for (const auto &[_, Edge] : Node.CurChain->Edges) {  in mergeChainPairs()