Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineDominators.h206 void eraseNode(MachineBasicBlock *BB) { in eraseNode() function
208 DT->eraseNode(BB); in eraseNode()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DDomTreeUpdater.cpp207 DT->eraseNode(DelBB); in eraseDelBBNode()
211 PDT->eraseNode(DelBB); in eraseDelBBNode()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp118 if (MDT && MDT->getNode(&BB)) MDT->eraseNode(&BB); in runOnMachineFunction()
H A DEarlyIfConversion.cpp824 DomTree->eraseNode(B); in updateDomTree()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DIntervalMap.h1583 void eraseNode(unsigned Level);
1943 eraseNode(IM.height); in treeErase()
1968 iterator::eraseNode(unsigned Level) { in eraseNode() function
1988 eraseNode(Level); in eraseNode()
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64ConditionalCompares.cpp830 DomTree->eraseNode(RemovedMBB); in updateDomTree()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp680 DT->eraseNode(ExitingBlock); in simplifyOneLoop()
H A DBasicBlockUtils.cpp330 DT->eraseNode(BB); in MergeBlockIntoPredecessor()
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h686 void eraseNode(NodeT *BB) {
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSILowerControlFlow.cpp830 MDT->eraseNode(&MBB); in removeMBBifRedundant()
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonEarlyIfConv.cpp978 MDT->eraseNode(B); in removeBlock()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp2051 DT->eraseNode(MemCheckBlock); in Create()
2055 DT->eraseNode(SCEVCheckBlock); in Create()