| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | DomPrinter.h | 25 struct DOTGraphTraits<DomTreeNode *> : public DefaultDOTGraphTraits {
29 std::string getNodeLabel(DomTreeNode *Node, DomTreeNode *Graph) {
45 : public DOTGraphTraits<DomTreeNode *> {
48 : DOTGraphTraits<DomTreeNode *>(isSimple) {}
54 std::string getNodeLabel(DomTreeNode *Node, DominatorTree *G) {
55 return DOTGraphTraits<DomTreeNode *>::getNodeLabel(Node,
62 : public DOTGraphTraits<DomTreeNode*> {
65 : DOTGraphTraits<DomTreeNode*>(isSimple) {}
71 std::string getNodeLabel(DomTreeNode *Node,
73 return DOTGraphTraits<DomTreeNode*>::getNodeLabel(Node, G->getRootNode());
|
| H A D | PostDominators.h | 102 : public GraphTraits<DomTreeNode*> {
|
| H A D | RegionInfo.h | 90 using DomTreeNodeT = DomTreeNode;
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | Dominators.h | 95 using DomTreeNode = DomTreeNodeBase<BasicBlock>; variable
261 struct GraphTraits<DomTreeNode *>
262 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::const_iterator> {
266 struct GraphTraits<const DomTreeNode *>
267 : public DomTreeGraphTraitsBase<const DomTreeNode,
268 DomTreeNode::const_iterator> {};
271 : public GraphTraits<DomTreeNode*> {
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopUnroll.cpp | 223 DomTreeNode *Node;
224 DomTreeNode::const_iterator ChildIter;
225 DomTreeNode::const_iterator EndIter;
230 unsigned cg, DomTreeNode *N, DomTreeNode::const_iterator Child, in StackNode()
231 DomTreeNode::const_iterator End) in StackNode()
238 DomTreeNode *node() { return Node; } in node()
239 DomTreeNode::const_iterator childIter() const { return ChildIter; } in childIter()
241 DomTreeNode *nextChild() { in nextChild()
242 DomTreeNode *Child = *ChildIter; in nextChild()
247 DomTreeNode::const_iterator end() const { return EndIter; } in end()
[all …]
|
| H A D | PredicateInfo.cpp | 150 DomTreeNode *DomASrc = DT.getNode(ASrc); in comparePHIRelated()
151 DomTreeNode *DomBSrc = DT.getNode(BSrc); in comparePHIRelated()
163 DomTreeNode *DomADest = DT.getNode(ADest); in comparePHIRelated()
164 DomTreeNode *DomBDest = DT.getNode(BDest); in comparePHIRelated()
309 DomTreeNode *DomNode = DT.getNode(IBlock); in convertUsesToDFSOrdered()
593 DomTreeNode *DomNode = DT.getNode(PAssume->AssumeInst->getParent()); in renameUses()
|
| H A D | BasicBlockUtils.cpp | 236 DomTreeNode *PredNode = DT->getNode(PredBB); in MergeBlockIntoPredecessor()
237 DomTreeNode *BBNode = DT->getNode(BB); in MergeBlockIntoPredecessor()
240 for (DomTreeNode *C : to_vector(BBNode->children())) in MergeBlockIntoPredecessor()
927 if (DomTreeNode *OldNode = DT->getNode(Old)) { in SplitBlockImpl()
928 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockImpl()
930 DomTreeNode *NewNode = DT->addNewBlock(New, Old); in SplitBlockImpl()
931 for (DomTreeNode *I : Children) in SplitBlockImpl()
|
| H A D | CodeMoverUtils.cpp | 102 DomTreeNode *DA = DT->getNode(InstA->getParent()); in domTreeLevelBefore()
103 DomTreeNode *DB = DT->getNode(InstB->getParent()); in domTreeLevelBefore()
|
| H A D | LoopSimplify.cpp | 671 DomTreeNode *Node = DT->getNode(ExitingBlock); in simplifyOneLoop()
673 DomTreeNode *Child = Node->back(); in simplifyOneLoop()
|
| H A D | CodeExtractor.cpp | 820 DomTreeNode *OldNode = DT->getNode(Block); in splitReturnBlocks()
821 SmallVector<DomTreeNode *, 8> Children(OldNode->begin(), in splitReturnBlocks()
824 DomTreeNode *NewNode = DT->addNewBlock(New, Block); in splitReturnBlocks()
826 for (DomTreeNode *I : Children) in splitReturnBlocks()
|
| H A D | LCSSA.cpp | 144 const DomTreeNode *DomNode = DT.getNode(DomBB); in formLCSSAForInstructionsImpl()
|
| H A D | LoopUtils.cpp | 451 DomTreeNode *N, in collectChildrenInLoop()
454 auto AddRegionToWorklist = [&](DomTreeNode *DTN) { in collectChildrenInLoop()
464 for (DomTreeNode *Child : DT->getNode(Worklist[I])->children()) in collectChildrenInLoop()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | LoopUtils.h | 25 using DomTreeNode = DomTreeNodeBase<BasicBlock>; variable
157 LLVM_ABI bool sinkRegion(DomTreeNode *, AAResults *, LoopInfo *,
166 LLVM_ABI bool sinkRegionForLoopNest(DomTreeNode *, AAResults *, LoopInfo *,
183 LLVM_ABI bool hoistRegion(DomTreeNode *, AAResults *, LoopInfo *,
236 collectChildrenInLoop(DominatorTree *DT, DomTreeNode *N, const Loop *CurLoop);
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | EarlyCSE.cpp | 766 GEPHTType &AvailableGEPs, unsigned cg, DomTreeNode *n, in StackNode()
767 DomTreeNode::const_iterator child, in StackNode()
768 DomTreeNode::const_iterator end) in StackNode()
780 DomTreeNode *node() { return Node; } in node()
781 DomTreeNode::const_iterator childIter() const { return ChildIter; } in childIter()
783 DomTreeNode *nextChild() { in nextChild()
784 DomTreeNode *child = *ChildIter; in nextChild()
789 DomTreeNode::const_iterator end() const { return EndIter; } in end()
796 DomTreeNode *Node;
797 DomTreeNode::const_iterator ChildIter;
[all …]
|
| H A D | GuardWidening.cpp | 142 DomTreeNode *Root;
158 Instruction *Instr, const df_iterator<DomTreeNode *> &DFSI,
323 MemorySSAUpdater *MSSAU, DomTreeNode *Root, in GuardWideningImpl()
377 Instruction *Instr, const df_iterator<DomTreeNode *> &DFSI, in eliminateInstrViaWidening()
|
| H A D | ConstraintElimination.cpp | 115 FactOrCheck(EntryTy Ty, DomTreeNode *DTN, Instruction *Inst) in FactOrCheck()
119 FactOrCheck(DomTreeNode *DTN, Use *U) in FactOrCheck()
123 FactOrCheck(DomTreeNode *DTN, CmpPredicate Pred, Value *Op0, Value *Op1, in FactOrCheck()
128 static FactOrCheck getConditionFact(DomTreeNode *DTN, CmpPredicate Pred, in getConditionFact()
134 static FactOrCheck getInstFact(DomTreeNode *DTN, Instruction *Inst) { in getInstFact()
138 static FactOrCheck getCheck(DomTreeNode *DTN, Use *U) { in getCheck()
142 static FactOrCheck getCheck(DomTreeNode *DTN, CallInst *CI) { in getCheck()
1009 DomTreeNode *DTN = DT.getNode(InLoopSucc); in addInfoForInductions()
|
| H A D | SimpleLoopUnswitch.cpp | 2122 SmallVector<DomTreeNode *, 4> DomWorklist; in visitDomSubTree()
2125 SmallPtrSet<DomTreeNode *, 4> Visited; in visitDomSubTree()
2129 DomTreeNode *N = DomWorklist.pop_back_val(); in visitDomSubTree()
2136 for (DomTreeNode *ChildN : *N) { in visitDomSubTree()
2668 DomTreeNode &N, in computeDomSubtreeCost()
2670 SmallDenseMap<DomTreeNode *, InstructionCost, 4> &DTCostMap) { in computeDomSubtreeCost() argument
2686 [&](InstructionCost Sum, DomTreeNode *ChildN) -> InstructionCost { in computeDomSubtreeCost()
3374 SmallDenseMap<DomTreeNode *, InstructionCost, 4> DTCostMap; in findBestNonTrivialUnswitchCandidate()
|
| H A D | LICM.cpp | 556 bool llvm::sinkRegion(DomTreeNode *N, AAResults *AA, LoopInfo *LI, in sinkRegion()
623 bool llvm::sinkRegionForLoopNest(DomTreeNode *N, AAResults *AA, LoopInfo *LI, in sinkRegionForLoopNest()
849 DomTreeNode *PreheaderNode = DT->getNode(HoistCommonSucc); in getOrCreateHoistedBlock()
850 DomTreeNode *HeaderNode = DT->getNode(CurLoop->getHeader()); in getOrCreateHoistedBlock()
877 bool llvm::hoistRegion(DomTreeNode *N, AAResults *AA, LoopInfo *LI, in hoistRegion()
|
| H A D | ADCE.cpp | 303 for (const auto &PDTChild : children<DomTreeNode *>(PDT.getRootNode())) { in initialize()
|
| H A D | NewGVN.cpp | 522 DenseMap<const DomTreeNode *, unsigned> RPOOrdering;
3490 llvm::sort(*Node, [&](const DomTreeNode *A, const DomTreeNode *B) { in runGVN()
3625 DomTreeNode *DomNode = DT->getNode(BB); in convertClassToDFSOrdered()
3684 DomTreeNode *DomNode = DT->getNode(IBlock); in convertClassToDFSOrdered()
3714 DomTreeNode *DomNode = DT->getNode(BB); in convertClassToLoadsAndStores()
|
| /freebsd/contrib/llvm-project/llvm/lib/FuzzMutate/ |
| H A D | RandomIRBuilder.cpp | 29 DomTreeNode *Node = DT.getNode(BB); in getDominators()
48 DomTreeNode *Parent = DT.getNode(BB); in getDominatees()
53 for (DomTreeNode *Child : Parent->children()) in getDominatees()
57 DomTreeNode *Node = DT[ret[Idx]]; in getDominatees()
59 for (DomTreeNode *Child : Node->children()) in getDominatees()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | MemorySSA.cpp | 532 DomTreeNode *Node = DT.getNode(BB); in getWalkTarget()
969 DomTreeNode *DTN;
970 DomTreeNode::const_iterator ChildIt;
973 RenamePassData(DomTreeNode *D, DomTreeNode::const_iterator It, in RenamePassData()
1146 void MemorySSA::renamePass(DomTreeNode *Root, MemoryAccess *IncomingVal, in renamePass()
1164 DomTreeNode *Node = WorkStack.back().DTN; in renamePass()
1165 DomTreeNode::const_iterator ChildIt = WorkStack.back().ChildIt; in renamePass()
1171 DomTreeNode *Child = *ChildIt; in renamePass()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonGenExtract.cpp | 215 for (auto *DTN : children<DomTreeNode*>(DT->getNode(B))) in visitBlock()
|
| H A D | HexagonCommonGEP.cpp | 324 for (auto *DTN : children<DomTreeNode*>(DT->getNode(Root))) in getBlockTraversalOrder()
794 DomTreeNode *N = (*DT)[DomB]->getIDom(); in recalculatePlacement()
854 DomTreeNode *DN = DT->getNode(L->getHeader()); in preheader()
1228 for (auto *DTN : children<DomTreeNode *>(DT->getNode(B))) in removeDeadCode()
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | SafepointIRVerifier.cpp | 743 DomTreeNode *DTN = DT[const_cast<BasicBlock *>(BB)]; in gatherDominatingDefs()
|