Home
last modified time | relevance | path

Searched refs:OldNode (Results 1 – 5 of 5) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCallGraph.cpp234 CallGraphNode *OldNode = OldCBs[N]; in replaceCallEdge() local
239 if (!J->first && J->second == OldNode) { in replaceCallEdge()
241 OldNode->DropRef(); in replaceCallEdge()
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h711 DomTreeNodeBase<NodeT> *OldNode = getNode(OldRoot);
712 NewNode->addChild(OldNode);
713 OldNode->IDom = NewNode;
714 OldNode->UpdateLevel();
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DImmutableSet.h578 TreeTy* OldNode;
579 TreeTy* newRight = removeMinBinding(R,OldNode);
580 return balanceTree(L, getValue(OldNode), newRight);
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp927 if (DomTreeNode *OldNode = DT->getNode(Old)) { in SplitBlockImpl() local
928 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockImpl()
H A DCodeExtractor.cpp820 DomTreeNode *OldNode = DT->getNode(Block); in splitReturnBlocks() local
821 SmallVector<DomTreeNode *, 8> Children(OldNode->begin(), in splitReturnBlocks()
822 OldNode->end()); in splitReturnBlocks()