| /llvm-project-15.0.7/llvm/include/llvm/Support/ |
| H A D | GenericDomTreeConstruction.h | 126 NodePtr getIDom(NodePtr BB) const { in getIDom() function
138 NodePtr IDom = getIDom(BB); in getNodeForBlock()
607 NodePtr ImmDom = getIDom(W); in attachNewSubtree()
685 if (!DT.isVirtualRoot(To->getIDom())) return false; in UpdateRootsBeforeInsertion()
855 assert(TN->getLevel() == TN->getIDom()->getLevel() + 1 && in UpdateInsertion()
950 const TreeNodePtr ToIDom = ToTN->getIDom(); in DeleteEdge()
980 const TreeNodePtr PrevIDomSubTree = ToIDomTN->getIDom(); in DeleteReachable()
1088 if (!MinNode->getIDom()) { in DeleteUnreachable()
1110 const TreeNodePtr PrevIDom = MinNode->getIDom(); in DeleteUnreachable()
1134 const TreeNodePtr IDom = TN->getIDom(); in EraseNode()
[all …]
|
| H A D | GenericDomTree.h | 89 DomTreeNodeBase *getIDom() const { return IDom; }
430 if (B->getIDom() == A) return true;
432 if (A->getIDom() == B) return false;
677 DomTreeNodeBase<NodeT> *IDom = Node->getIDom();
897 while ((IDom = B->getIDom()) != nullptr && IDom->getLevel() >= ALevel)
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | ConstantHoisting.cpp | 202 auto *IDom = DT->getNode(InsertionBlock)->getIDom(); in findMatInsertPt()
205 IDom = IDom->getIDom(); in findMatInsertPt()
240 assert(DT.getNode(Node)->getIDom() && in findBestInsertionSet()
242 Node = DT.getNode(Node)->getIDom()->getBlock(); in findBestInsertionSet()
291 BasicBlock *Parent = DT.getNode(Node)->getIDom()->getBlock(); in findBestInsertionSet()
|
| H A D | Sink.cpp | 156 SuccToSinkTo = DT.getNode(SuccToSinkTo)->getIDom()->getBlock(); in SinkInstruction()
|
| H A D | PlaceSafepoints.cpp | 233 Current = DT.getNode(Current)->getIDom()->getBlock(); in containsUnconditionalCallSafepoint()
|
| H A D | CallSiteSplitting.cpp | 466 BasicBlock *StopAt = CSDTNode ? CSDTNode->getIDom()->getBlock() : nullptr; in shouldSplitOnPredicatedArgument()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | LegacyDivergenceAnalysis.cpp | 169 BasicBlock *IPostDom = ThisNode->getIDom()->getBlock(); in exploreSyncDependency()
211 DomTreeNode *IDomNode = DT.getNode(InfluencedBB)->getIDom(); in exploreSyncDependency()
|
| H A D | MemorySSAUpdater.cpp | 894 if (auto *IDom = DT.getNode(BB)->getIDom()) in applyInsertUpdates()
933 DT.getNode(NextIDom)->getIDom()->getBlock()) { in applyInsertUpdates()
1080 assert(DT.getNode(BB)->getIDom() && "BB does not have valid idom"); in applyInsertUpdates()
1083 BasicBlock *NewIDom = DT.getNode(BB)->getIDom()->getBlock(); in applyInsertUpdates()
1150 auto *IDom = DT.getNode(DominatedBlock)->getIDom(); in applyInsertUpdates()
|
| H A D | MustExecute.cpp | 543 if (const auto *IDomNode = InitNode->getIDom()) in findForwardJoinPoint()
647 if (const auto *IDomNode = InitNode->getIDom()) in findBackwardJoinPoint()
|
| /llvm-project-15.0.7/llvm/tools/llvm-reduce/deltas/ |
| H A D | ReduceInstructionsMIR.cpp | 114 if (auto *IDM = MDT.getNode(BB)->getIDom()) { in extractInstrFromFunction()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | SSAUpdaterBulk.cpp | 74 BasicBlock *IDom = DT->getNode(BB)->getIDom()->getBlock(); in computeValueAt()
|
| H A D | LCSSA.cpp | 309 BasicBlock *IDomBB = DT.getNode(BB)->getIDom()->getBlock(); in computeBlocksDominatingExits()
|
| H A D | CodeMoverUtils.cpp | 125 BasicBlock *IDom = DT.getNode(CurBlock)->getIDom()->getBlock(); in collectControlConditions()
|
| H A D | SimplifyIndVar.cpp | 1170 for (auto *DTN = (*DT)[InsertPt->getParent()]; DTN; DTN = DTN->getIDom()) in getInsertPointForUses()
2035 for (auto *DTB = (*DT)[NarrowUserBB]->getIDom(); in calculatePostIncRange()
2037 DTB = DTB->getIDom()) { in calculatePostIncRange()
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | DominanceFrontierImpl.h | 185 if (DT[Succ]->getIDom() != currentNode) in calculate()
|
| H A D | RegionInfoImpl.h | 640 return N->getIDom(); in getNextPostDom()
642 return PDT->getNode(e->second)->getIDom(); in getNextPostDom()
|
| /llvm-project-15.0.7/llvm/lib/IR/ |
| H A D | SafepointIRVerifier.cpp | 748 while (DTN->getIDom()) { in gatherDominatingDefs()
749 DTN = DTN->getIDom(); in gatherDominatingDefs()
|
| /llvm-project-15.0.7/clang/include/clang/Analysis/Analyses/ |
| H A D | Dominators.h | 104 DomTreeNode *IDom = DT.getNode(*I)->getIDom(); in dump()
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Bufferization/Transforms/ |
| H A D | BufferOptimizations.cpp | 201 idom = dominators.getNode(currentBlock)->getIDom(); in findPlacementBlock()
|
| /llvm-project-15.0.7/llvm/lib/Target/AMDGPU/ |
| H A D | SILowerI1Copies.cpp | 301 PDNode = PDNode->getIDom(); in findLoop()
354 VisitedPostDom = PDT.getNode(VisitedPostDom)->getIDom()->getBlock(); in advanceLevel()
|
| H A D | SIAnnotateControlFlow.cpp | 171 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock(); in isElse()
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | LiveRangeCalc.cpp | 343 MachineDomTreeNode *IDom = Node->getIDom(); in updateSSA()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/ObjCARC/ |
| H A D | ObjCARCContract.cpp | 628 InsertBB = DT->getNode(InsertBB)->getIDom()->getBlock(); in run()
|
| /llvm-project-15.0.7/llvm/lib/Target/Hexagon/ |
| H A D | HexagonCommonGEP.cpp | 799 DomTreeNode *N = (*DT)[DomB]->getIDom(); in recalculatePlacement()
862 return DN->getIDom()->getBlock(); in preheader()
|
| /llvm-project-15.0.7/llvm/lib/Target/AArch64/ |
| H A D | AArch64ConditionalCompares.cpp | 829 assert(Node->getIDom() == HeadNode && "CmpBB should be dominated by Head"); in updateDomTree()
|