| /freebsd/contrib/llvm-project/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()
591 NodePtr ImmDom = getIDom(W); in attachNewSubtree()
668 if (!DT.isVirtualRoot(To->getIDom())) return false; in UpdateRootsBeforeInsertion()
838 assert(TN->getLevel() == TN->getIDom()->getLevel() + 1 && in UpdateInsertion()
933 const TreeNodePtr ToIDom = ToTN->getIDom(); in DeleteEdge()
963 const TreeNodePtr PrevIDomSubTree = ToIDomTN->getIDom(); in DeleteReachable()
1071 if (!MinNode->getIDom()) { in DeleteUnreachable()
1093 const TreeNodePtr PrevIDom = MinNode->getIDom(); in DeleteUnreachable()
1117 const TreeNodePtr IDom = TN->getIDom(); in EraseNode()
[all …]
|
| H A D | GenericDomTree.h | 90 DomTreeNodeBase *getIDom() const { return IDom; }
444 if (B->getIDom() == A) return true;
446 if (A->getIDom() == B) return false;
692 DomTreeNodeBase<NodeT> *IDom = Node->getIDom();
911 while ((IDom = B->getIDom()) != nullptr && IDom->getLevel() >= ALevel)
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | ConstantHoisting.cpp | 204 auto *IDom = DT->getNode(InsertionBlock)->getIDom(); in findMatInsertPt()
207 IDom = IDom->getIDom(); in findMatInsertPt()
242 assert(DT.getNode(Node)->getIDom() && in findBestInsertionSet()
244 Node = DT.getNode(Node)->getIDom()->getBlock(); in findBestInsertionSet()
293 BasicBlock *Parent = DT.getNode(Node)->getIDom()->getBlock(); in findBestInsertionSet()
|
| H A D | Sink.cpp | 157 SuccToSinkTo = DT.getNode(SuccToSinkTo)->getIDom()->getBlock(); in SinkInstruction()
|
| H A D | CallSiteSplitting.cpp | 466 BasicBlock *StopAt = CSDTNode ? CSDTNode->getIDom()->getBlock() : nullptr; in shouldSplitOnPredicatedArgument()
|
| H A D | PlaceSafepoints.cpp | 439 Current = DT.getNode(Current)->getIDom()->getBlock(); in containsUnconditionalCallSafepoint()
|
| /freebsd/contrib/llvm-project/llvm/lib/FuzzMutate/ |
| H A D | RandomIRBuilder.cpp | 35 Node = Node->getIDom(); in getDominators()
39 Node = Node->getIDom(); in getDominators()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SSAUpdaterBulk.cpp | 74 BasicBlock *IDom = DT->getNode(BB)->getIDom()->getBlock(); in computeValueAt()
|
| H A D | LCSSA.cpp | 337 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()
2209 for (auto *DTB = (*DT)[NarrowUserBB]->getIDom(); in calculatePostIncRange()
2211 DTB = DTB->getIDom()) { in calculatePostIncRange()
|
| H A D | LoopSimplify.cpp | 677 DT->changeImmediateDominator(Child, Node->getIDom()); in simplifyOneLoop()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | MemorySSAUpdater.cpp | 869 if (auto *IDom = DT.getNode(BB)->getIDom()) in applyInsertUpdates()
908 DT.getNode(NextIDom)->getIDom()->getBlock()) { in applyInsertUpdates()
1055 assert(DT.getNode(BB)->getIDom() && "BB does not have valid idom"); in applyInsertUpdates()
1058 BasicBlock *NewIDom = DT.getNode(BB)->getIDom()->getBlock(); in applyInsertUpdates()
1125 auto *IDom = DT.getNode(DominatedBlock)->getIDom(); in applyInsertUpdates()
|
| H A D | MustExecute.cpp | 448 if (const auto *IDomNode = InitNode->getIDom()) in findForwardJoinPoint()
552 if (const auto *IDomNode = InitNode->getIDom()) in findBackwardJoinPoint()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | DominanceFrontierImpl.h | 184 if (DT[Succ]->getIDom() != currentNode) in calculate()
|
| H A D | RegionInfoImpl.h | 618 return N->getIDom(); in insertShortCut()
620 return PDT->getNode(e->second)->getIDom(); in insertShortCut()
|
| /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/AMDGPU/ |
| H A D | SILowerI1Copies.cpp | 294 PDNode = PDNode->getIDom(); in findLoop()
352 VisitedPostDom = PDT.getNode(VisitedPostDom)->getIDom()->getBlock(); in advanceLevel()
|
| H A D | SIAnnotateControlFlow.cpp | 171 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock(); in isElse()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | LiveRangeCalc.cpp | 348 MachineDomTreeNode *IDom = Node->getIDom(); in updateSSA()
|
| H A D | InlineSpiller.cpp | 1423 MachineDomTreeNode *RootIDomNode = MDT[Root]->getIDom(); in getVisitOrders()
1449 Node = Node->getIDom(); in getVisitOrders()
|
| H A D | MachineCSE.cpp | 764 while (MachineDomTreeNode *Parent = Node->getIDom()) { in ExitScopeIfDone()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
| H A D | ObjCARCContract.cpp | 629 InsertBB = DT->getNode(InsertBB)->getIDom()->getBlock(); in run()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonCommonGEP.cpp | 799 DomTreeNode *N = (*DT)[DomB]->getIDom(); in recalculatePlacement()
862 return DN->getIDom()->getBlock(); in preheader()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64ConditionalCompares.cpp | 827 assert(Node->getIDom() == HeadNode && "CmpBB should be dominated by Head"); in updateDomTree()
|