Searched refs:PredNode (Results 1 – 2 of 2) sorted by relevance
642 NodeT &PredNode = AllNodes[Edge.src];644 AllJumps.emplace_back(&PredNode, &SuccNode, Edge.count); in mergeForcedPairs() 646 PredNode.OutJumps.push_back(&AllJumps.back()); in mergeForcedPairs() 648 PredNode.ExecutionCount = std::max(PredNode.ExecutionCount, Edge.count); in mergeForcedPairs() 671 for (NodeT &PredNode : AllNodes) { in mergeForcedPairs() 672 for (JumpT *Jump : PredNode.OutJumps) { in mergeForcedPairs() 675 ChainEdge *CurEdge = PredNode.CurChain->getEdge(SuccNode->CurChain); in mergeForcedPairs() 678 assert(SuccNode->CurChain->getEdge(PredNode.CurChain) != nullptr); in mergeForcedPairs() 684 PredNode in mergeForcedPairs() 597 NodeT &PredNode = AllNodes[Pred]; initialize() local [all...]
239 DomTreeNode *PredNode = DT->getNode(PredBB); in MergeBlockIntoPredecessor() local241 if (PredNode) { in MergeBlockIntoPredecessor()244 C->setIDom(PredNode); in MergeBlockIntoPredecessor()