| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | GenericDomTreeConstruction.h | 147 NodePtr getIDom(NodePtr BB) { return getNodeInfo(BB).IDom; } in getIDom() function
154 NodePtr IDom = getIDom(BB); in getNodeForBlock()
607 NodePtr ImmDom = getIDom(W); in attachNewSubtree()
684 if (!DT.isVirtualRoot(To->getIDom())) return false; in UpdateRootsBeforeInsertion()
854 assert(TN->getLevel() == TN->getIDom()->getLevel() + 1 && in UpdateInsertion()
949 const TreeNodePtr ToIDom = ToTN->getIDom(); in DeleteEdge()
979 const TreeNodePtr PrevIDomSubTree = ToIDomTN->getIDom(); in DeleteReachable()
1087 if (!MinNode->getIDom()) { in DeleteUnreachable()
1108 const TreeNodePtr PrevIDom = MinNode->getIDom(); in DeleteUnreachable()
1291 const TreeNodePtr IDom = TN->getIDom(); in VerifyLevels()
|
| H A D | GenericDomTree.h | 90 DomTreeNodeBase *getIDom() const { return IDom; }
481 if (B->getIDom() == A) return true;
483 if (A->getIDom() == B) return false;
747 DomTreeNodeBase<NodeT> *IDom = Node->getIDom();
1000 while ((IDom = B->getIDom()) != nullptr && IDom->getLevel() >= ALevel)
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | ConstantHoisting.cpp | 201 auto *IDom = DT->getNode(InsertionBlock)->getIDom(); in findMatInsertPt()
204 IDom = IDom->getIDom(); in findMatInsertPt()
239 assert(DT.getNode(Node)->getIDom() && in findBestInsertionSet()
241 Node = DT.getNode(Node)->getIDom()->getBlock(); in findBestInsertionSet()
289 BasicBlock *Parent = DT.getNode(Node)->getIDom()->getBlock(); in findBestInsertionSet()
|
| H A D | Sink.cpp | 149 SuccToSinkTo = DT.getNode(SuccToSinkTo)->getIDom()->getBlock(); in SinkInstruction()
|
| H A D | CallSiteSplitting.cpp | 467 BasicBlock *StopAt = CSDTNode ? CSDTNode->getIDom()->getBlock() : nullptr; in shouldSplitOnPredicatedArgument()
|
| H A D | PlaceSafepoints.cpp | 435 Current = DT.getNode(Current)->getIDom()->getBlock(); in containsUnconditionalCallSafepoint()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | DominanceFrontierImpl.h | 106 if (DT[Succ]->getIDom() != currentNode) in calculate()
|
| H A D | RegionInfoImpl.h | 615 return N->getIDom(); in getNextPostDom()
617 return PDT->getNode(e->second)->getIDom(); in getNextPostDom()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | MemorySSAUpdater.cpp | 878 if (auto *IDom = DT.getNode(BB)->getIDom()) in applyInsertUpdates()
917 DT.getNode(NextIDom)->getIDom()->getBlock()) { in applyInsertUpdates()
1064 assert(DT.getNode(BB)->getIDom() && "BB does not have valid idom"); in applyInsertUpdates()
1067 BasicBlock *NewIDom = DT.getNode(BB)->getIDom()->getBlock(); in applyInsertUpdates()
1137 auto *IDom = DT.getNode(DominatedBlock)->getIDom(); in applyInsertUpdates()
|
| H A D | MustExecute.cpp | 456 if (const auto *IDomNode = InitNode->getIDom()) in findForwardJoinPoint()
560 if (const auto *IDomNode = InitNode->getIDom()) in findBackwardJoinPoint()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SSAUpdaterBulk.cpp | 171 (BB = DT->getNode(BB)->getIDom()->getBlock())) { in RewriteAllUses()
|
| H A D | LCSSA.cpp | 353 BasicBlock *IDomBB = DT.getNode(BB)->getIDom()->getBlock(); in computeBlocksDominatingExits()
|
| H A D | CodeMoverUtils.cpp | 127 BasicBlock *IDom = DT.getNode(CurBlock)->getIDom()->getBlock(); in collectControlConditions()
|
| H A D | SimplifyIndVar.cpp | 1220 for (auto *DTN = (*DT)[InsertPt->getParent()]; DTN; DTN = DTN->getIDom()) in getInsertPointForUses()
2217 for (auto *DTB = (*DT)[NarrowUserBB]->getIDom(); in calculatePostIncRange()
2219 DTB = DTB->getIDom()) { in calculatePostIncRange()
|
| H A D | LoopSimplify.cpp | 674 DT->changeImmediateDominator(Child, Node->getIDom()); in simplifyOneLoop()
|
| /freebsd/contrib/llvm-project/llvm/lib/FuzzMutate/ |
| H A D | RandomIRBuilder.cpp | 34 Node = Node->getIDom(); in getDominators()
38 Node = Node->getIDom(); in getDominators()
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | SafepointIRVerifier.cpp | 746 while (DTN->getIDom()) { in gatherDominatingDefs()
747 DTN = DTN->getIDom(); in gatherDominatingDefs()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/ |
| H A D | SPIRVStructurizer.cpp | 625 assert(DT.getNode(&BB)->getIDom()); in addMergeForNodesWithMultiplePredecessors()
626 BasicBlock *Header = DT.getNode(&BB)->getIDom()->getBlock(); in addMergeForNodesWithMultiplePredecessors()
1064 BasicBlock *Merge = PDT.getNode(&BB)->getIDom()->getBlock(); in addHeaderToRemainingDivergentDAG()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SILowerI1Copies.cpp | 266 PDNode = PDNode->getIDom(); in findLoop()
324 VisitedPostDom = PDT.getNode(VisitedPostDom)->getIDom()->getBlock(); in advanceLevel()
|
| H A D | SIAnnotateControlFlow.cpp | 151 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock(); in isElse()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | LiveRangeCalc.cpp | 347 MachineDomTreeNode *IDom = Node->getIDom(); in updateSSA()
|
| H A D | InlineSpiller.cpp | 1450 MachineDomTreeNode *RootIDomNode = MDT[Root]->getIDom(); in getVisitOrders()
1476 Node = Node->getIDom(); in getVisitOrders()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
| H A D | ObjCARCContract.cpp | 675 InsertBB = DT->getNode(InsertBB)->getIDom()->getBlock(); in run()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonCommonGEP.cpp | 794 DomTreeNode *N = (*DT)[DomB]->getIDom(); in recalculatePlacement()
857 return DN->getIDom()->getBlock(); in preheader()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64ConditionalCompares.cpp | 824 assert(Node->getIDom() == HeadNode && "CmpBB should be dominated by Head"); in updateDomTree()
|