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