Lines Matching refs:SuccNode
643 NodeT &SuccNode = AllNodes[Edge.dst];
644 AllJumps.emplace_back(&PredNode, &SuccNode, Edge.count);
645 SuccNode.InJumps.push_back(&AllJumps.back());
649 SuccNode.ExecutionCount = std::max(SuccNode.ExecutionCount, Edge.count);
674 NodeT *SuccNode = Jump->Target;
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());
716 NodeT *SuccNode = Node.ForcedSucc;
717 while (SuccNode != nullptr && SuccNode != &Node) {
718 SuccNode = SuccNode->ForcedSucc;
720 if (SuccNode == nullptr)
1086 NodeT &SuccNode = AllNodes[Succ];
1087 AllJumps.emplace_back(&PredNode, &SuccNode, Count);
1089 SuccNode.InJumps.push_back(&AllJumps.back());
1093 SuccNode.ExecutionCount = std::max(SuccNode.ExecutionCount, Count);
1112 NodeT *SuccNode = Jump->Target;
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());