Home
last modified time | relevance | path

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

/llvm-project-15.0.7/llvm/lib/Analysis/
H A DCallGraph.cpp282 CallGraphNode *OldNode = OldCBs[N]; in replaceCallEdge() local
287 if (!J->first && J->second == OldNode) { in replaceCallEdge()
289 OldNode->DropRef(); in replaceCallEdge()
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DGenericDomTree.h643 auto &OldNode = DomTreeNodes[OldRoot];
644 OldNode = NewNode->addChild(std::move(DomTreeNodes[OldRoot]));
645 OldNode->IDom = NewNode;
646 OldNode->UpdateLevel();
/llvm-project-15.0.7/polly/lib/Transform/
H A DScheduleTreeTransform.cpp282 isl::schedule visitBand(isl::schedule_node_band OldNode, in visitBand()
285 isl::schedule_node OldChild = OldNode.first_child(); in visitBand()
287 isl::manage(isl_schedule_node_band_get_partial_schedule(OldNode.get())); in visitBand()
295 unsigned BandDims = isl_schedule_node_band_n_member(OldNode.get()); in visitBand()
322 isl_schedule_node_band_get_permutable(OldNode.get()))); in visitBand()
325 i, OldNode, i); in visitBand()
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp821 if (DomTreeNode *OldNode = DT->getNode(Old)) { in SplitBlockImpl() local
822 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockImpl()
1419 if (DomTreeNode *OldNode = DT->getNode(Head)) { in SplitBlockAndInsertIfThenImpl() local
1420 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockAndInsertIfThenImpl()
H A DCodeExtractor.cpp799 DomTreeNode *OldNode = DT->getNode(Block); in splitReturnBlocks() local
800 SmallVector<DomTreeNode *, 8> Children(OldNode->begin(), in splitReturnBlocks()
801 OldNode->end()); in splitReturnBlocks()
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DImmutableSet.h574 TreeTy* OldNode;
575 TreeTy* newRight = removeMinBinding(R,OldNode);
576 return balanceTree(L, getValue(OldNode), newRight);