Searched refs:PredNode (Results 1 – 2 of 2) sorted by relevance
642 NodeT &PredNode = AllNodes[Edge.src]; in initialize() local644 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()[all …]
239 DomTreeNode *PredNode = DT->getNode(PredBB); in MergeBlockIntoPredecessor() local241 if (PredNode) { in MergeBlockIntoPredecessor()244 C->setIDom(PredNode); in MergeBlockIntoPredecessor()