642         NodeT &PredNode = AllNodes[Edge.src];  in initialize()  local
644         AllJumps.emplace_back(&PredNode, &SuccNode, Edge.count);  in initialize()
646         PredNode.OutJumps.push_back(&AllJumps.back());  in initialize()
648         PredNode.ExecutionCount = std::max(PredNode.ExecutionCount, Edge.count);  in initialize()
671     for (NodeT &PredNode : AllNodes) {  in initialize()
672       for (JumpT *Jump : PredNode.OutJumps) {  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()
1085         NodeT &PredNode = AllNodes[Pred];  in initialize()  local
1087         AllJumps.emplace_back(&PredNode, &SuccNode, Count);  in initialize()
1090         PredNode.OutJumps.push_back(&AllJumps.back());  in initialize()
1092         PredNode.ExecutionCount = std::max(PredNode.ExecutionCount, Count);  in initialize()
1110     for (NodeT &PredNode : AllNodes) {  in initialize()
1111       for (JumpT *Jump : PredNode.OutJumps) {  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()