Home
last modified time | relevance | path

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

/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/
DCallGraph.cpp284 CallGraphNode *OldNode = OldCBs[N]; in replaceCallEdge() local
289 if (!J->first && J->second == OldNode) { in replaceCallEdge()
291 OldNode->DropRef(); in replaceCallEdge()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
DArgumentPromotion.cpp1124 for (CallGraphNode *OldNode : SCC) { in runOnSCC()
1125 Function *OldF = OldNode->getFunction(); in runOnSCC()
1146 NewNode->stealCalledFunctionsFrom(OldNode); in runOnSCC()
1147 if (OldNode->getNumReferences() == 0) in runOnSCC()
1148 delete CG.removeFunctionFromModule(OldNode); in runOnSCC()
1153 SCC.ReplaceNode(OldNode, NewNode); in runOnSCC()
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Support/
DGenericDomTree.h643 auto &OldNode = DomTreeNodes[OldRoot];
644 OldNode = NewNode->addChild(std::move(DomTreeNodes[OldRoot]));
645 OldNode->IDom = NewNode;
646 OldNode->UpdateLevel();
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
DBasicBlockUtils.cpp798 if (DomTreeNode *OldNode = DT->getNode(Old)) { in SplitBlockImpl() local
799 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockImpl()
1393 if (DomTreeNode *OldNode = DT->getNode(Head)) { in SplitBlockAndInsertIfThenImpl() local
1394 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockAndInsertIfThenImpl()
DCodeExtractor.cpp799 DomTreeNode *OldNode = DT->getNode(Block); in splitReturnBlocks() local
800 SmallVector<DomTreeNode *, 8> Children(OldNode->begin(), in splitReturnBlocks()
801 OldNode->end()); in splitReturnBlocks()
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/ADT/
DImmutableSet.h587 TreeTy* OldNode;
588 TreeTy* newRight = removeMinBinding(R,OldNode);
589 return balanceTree(L, getValue(OldNode), newRight);