Lines Matching defs:CurChain

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