Home
last modified time | relevance | path

Searched refs:SuccNode (Results 1 – 3 of 3) sorted by relevance

/src/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h177 DomTreeNodeBase<NodeTy> *SuccNode = DT.getNode(Succ); in calculate() local
179 const unsigned SuccLevel = SuccNode->getLevel(); in calculate()
183 if (!VisitedPQ.insert(SuccNode).second) in calculate()
186 NodeTy *SuccBB = SuccNode->getBlock(); in calculate()
193 SuccNode, std::make_pair(SuccLevel, SuccNode->getDFSNumIn()))); in calculate()
/src/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCodeLayout.cpp643 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
[all …]
/src/contrib/llvm-project/llvm/include/llvm/IR/
H A DGenericConvergenceVerifierImpl.h212 auto *SuccNode = DT.getNode(Succ); in verify() local
219 if (!DT.dominates(DT.getNode(LiveToken->getParent()), SuccNode)) in verify()