Home
last modified time | relevance | path

Searched refs:eraseNode (Results 1 – 19 of 19) sorted by relevance

/llvm-project-15.0.7/mlir/lib/Analysis/
H A DCallGraph.cpp153 void CallGraph::eraseNode(CallGraphNode *node) { in eraseNode() function in CallGraph
158 eraseNode(edge.getTarget()); in eraseNode()
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DMachineDominators.h206 void eraseNode(MachineBasicBlock *BB) { in eraseNode() function
208 DT->eraseNode(BB); in eraseNode()
/llvm-project-15.0.7/mlir/lib/Transforms/
H A DInliner.cpp97 void eraseNode(CallGraphNode *node);
181 void CGUseList::eraseNode(CallGraphNode *node) { in eraseNode() function in CGUseList
185 eraseNode(edge.getTarget()); in eraseNode()
567 useList.eraseNode(it.targetNode); in inlineCallsInSCC()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DDomTreeUpdater.cpp208 DT->eraseNode(DelBB); in eraseDelBBNode()
212 PDT->eraseNode(DelBB); in eraseDelBBNode()
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp118 if (MDT && MDT->getNode(&BB)) MDT->eraseNode(&BB); in runOnMachineFunction()
H A DEarlyIfConversion.cpp818 DomTree->eraseNode(B); in updateDomTree()
/llvm-project-15.0.7/mlir/include/mlir/Analysis/
H A DCallGraph.h200 void eraseNode(CallGraphNode *node);
/llvm-project-15.0.7/polly/lib/CodeGen/
H A DCodeGeneration.cpp268 DT.eraseNode(ExitingBlock); in generateCode()
H A DIslNodeBuilder.cpp642 DT.eraseNode(BB); in removeSubFuncFromDomTree()
H A DPPCGCodeGeneration.cpp1565 DT.eraseNode(BB); in clearDominators()
3537 DT->eraseNode(ExitingBlock); in generateCode()
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DIntervalMap.h1544 void eraseNode(unsigned Level);
1904 eraseNode(IM.height); in treeErase()
1929 iterator::eraseNode(unsigned Level) { in eraseNode() function
1949 eraseNode(Level); in eraseNode()
/llvm-project-15.0.7/llvm/lib/Target/AArch64/
H A DAArch64ConditionalCompares.cpp832 DomTree->eraseNode(RemovedMBB); in updateDomTree()
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp686 DT->eraseNode(ExitingBlock); in simplifyOneLoop()
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DGenericDomTree.h669 void eraseNode(NodeT *BB) {
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DSILowerControlFlow.cpp819 MDT->eraseNode(&MBB); in removeMBBifRedundant()
/llvm-project-15.0.7/llvm/lib/Target/Hexagon/
H A DHexagonEarlyIfConv.cpp980 MDT->eraseNode(B); in removeBlock()
/llvm-project-15.0.7/llvm/unittests/IR/
H A DDominatorTreeTest.cpp613 PDT->eraseNode(C2); in TEST()
/llvm-project-15.0.7/llvm/unittests/Transforms/Scalar/
H A DLoopPassManagerTest.cpp1406 AR.DT.eraseNode(LoopBB); in TEST_F()
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp1957 DT->eraseNode(MemCheckBlock); in Create()
1961 DT->eraseNode(SCEVCheckBlock); in Create()