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