Home
last modified time | relevance | path

Searched refs:DomTreeNode (Results 1 – 25 of 36) sorted by relevance

12

/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/
H A DDominators.h38 using DomTreeNode = llvm::DomTreeNodeBase<CFGBlock>; variable
64 DomTreeNode *getRootNode() const { in getRootNode()
72 DomTreeNode *R = getRootNode(); in compare()
73 DomTreeNode *OtherR = Other.getRootNode(); in compare()
165 template <> struct GraphTraits< ::clang::DomTreeNode* > {
166 using NodeRef = ::clang::DomTreeNode *;
167 using ChildIteratorType = ::clang::DomTreeNode::iterator;
174 llvm::pointer_iterator<df_iterator<::clang::DomTreeNode *>>;
176 static nodes_iterator nodes_begin(::clang::DomTreeNode *N) {
180 static nodes_iterator nodes_end(::clang::DomTreeNode *N) {
[all …]
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DDomPrinter.cpp29 struct DOTGraphTraits<DomTreeNode*> : public DefaultDOTGraphTraits {
34 std::string getNodeLabel(DomTreeNode *Node, DomTreeNode *Graph) { in getNodeLabel()
52 struct DOTGraphTraits<DominatorTree*> : public DOTGraphTraits<DomTreeNode*> {
55 : DOTGraphTraits<DomTreeNode*>(isSimple) {} in DOTGraphTraits()
61 std::string getNodeLabel(DomTreeNode *Node, DominatorTree *G) { in getNodeLabel()
62 return DOTGraphTraits<DomTreeNode*>::getNodeLabel(Node, G->getRootNode()); in getNodeLabel()
68 : public DOTGraphTraits<DomTreeNode*> {
71 : DOTGraphTraits<DomTreeNode*>(isSimple) {} in DOTGraphTraits()
77 std::string getNodeLabel(DomTreeNode *Node, PostDominatorTree *G ) { in getNodeLabel()
78 return DOTGraphTraits<DomTreeNode*>::getNodeLabel(Node, G->getRootNode()); in getNodeLabel()
H A DIteratedDominanceFrontier.cpp28 typedef std::pair<DomTreeNode *, std::pair<unsigned, unsigned>> in calculate()
37 if (DomTreeNode *Node = DT.getNode(BB)) in calculate()
41 SmallVector<DomTreeNode *, 32> Worklist; in calculate()
42 SmallPtrSet<DomTreeNode *, 32> VisitedPQ; in calculate()
43 SmallPtrSet<DomTreeNode *, 32> VisitedWorklist; in calculate()
48 DomTreeNode *Root = RootPair.first; in calculate()
61 DomTreeNode *Node = Worklist.pop_back_val(); in calculate()
66 DomTreeNode *SuccNode = DT.getNode(Succ); in calculate()
H A DOrderedInstructions.cpp48 DomTreeNode *DA = DT->getNode(InstA->getParent()); in dfsBefore()
49 DomTreeNode *DB = DT->getNode(InstB->getParent()); in dfsBefore()
H A DLegacyDivergenceAnalysis.cpp159 DomTreeNode *ThisNode = PDT.getNode(ThisBB); in exploreSyncDependency()
203 DomTreeNode *IDomNode = DT.getNode(InfluencedBB)->getIDom(); in exploreSyncDependency()
H A DMemorySSA.cpp515 DomTreeNode *Node = DT.getNode(BB); in getWalkTarget()
931 DomTreeNode *DTN;
932 DomTreeNode::const_iterator ChildIt;
935 RenamePassData(DomTreeNode *D, DomTreeNode::const_iterator It, in RenamePassData()
1071 void MemorySSA::renamePass(DomTreeNode *Root, MemoryAccess *IncomingVal, in renamePass()
1087 DomTreeNode *Node = WorkStack.back().DTN; in renamePass()
1088 DomTreeNode::const_iterator ChildIt = WorkStack.back().ChildIt; in renamePass()
1094 DomTreeNode *Child = *ChildIt; in renamePass()
H A DIVUsers.cpp99 for (DomTreeNode *Rung = DT->getNode(BB); in isSimplifiedLoopNest()
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DDominators.h75 using DomTreeNode = DomTreeNodeBase<BasicBlock>; variable
209 struct GraphTraits<DomTreeNode *>
210 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::iterator> {};
213 struct GraphTraits<const DomTreeNode *>
214 : public DomTreeGraphTraitsBase<const DomTreeNode,
215 DomTreeNode::const_iterator> {};
218 : public GraphTraits<DomTreeNode*> {
/freebsd-12.1/contrib/llvm/include/llvm/Transforms/Utils/
H A DLoopUtils.h111 bool sinkRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
124 bool hoistRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
162 SmallVector<DomTreeNode *, 16> collectChildrenInLoop(DomTreeNode *N,
/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DEarlyCSE.cpp449 unsigned cg, DomTreeNode *n, DomTreeNode::iterator child, in StackNode()
450 DomTreeNode::iterator end) in StackNode()
463 DomTreeNode *node() { return Node; } in node()
466 DomTreeNode *nextChild() { in nextChild()
467 DomTreeNode *child = *ChildIter; in nextChild()
472 DomTreeNode::iterator end() { return EndIter; } in end()
479 DomTreeNode *Node;
480 DomTreeNode::iterator ChildIter;
481 DomTreeNode::iterator EndIter;
582 bool processNode(DomTreeNode *Node);
[all …]
H A DSink.cpp168 DomTreeNode *DTN = DT.getNode(Inst->getParent()); in SinkInstruction()
169 for (DomTreeNode::iterator I = DTN->begin(), E = DTN->end(); in SinkInstruction()
H A DGuardWidening.cpp125 DomTreeNode *Root;
141 Instruction *Guard, const df_iterator<DomTreeNode *> &DFSI,
278 DomTreeNode *Root, in GuardWideningImpl()
342 Instruction *GuardInst, const df_iterator<DomTreeNode *> &DFSI, in eliminateGuardViaWidening()
H A DSimpleLoopUnswitch.cpp1853 SmallVector<DomTreeNode *, 4> DomWorklist; in visitDomSubTree()
1856 SmallPtrSet<DomTreeNode *, 4> Visited; in visitDomSubTree()
1860 DomTreeNode *N = DomWorklist.pop_back_val(); in visitDomSubTree()
1867 for (DomTreeNode *ChildN : *N) { in visitDomSubTree()
2297 computeDomSubtreeCost(DomTreeNode &N, in computeDomSubtreeCost()
2299 SmallDenseMap<DomTreeNode *, int, 4> &DTCostMap) { in computeDomSubtreeCost() argument
2314 N.begin(), N.end(), BBCostIt->second, [&](int Sum, DomTreeNode *ChildN) { in computeDomSubtreeCost()
2639 SmallDenseMap<DomTreeNode *, int, 4> DTCostMap; in unswitchBestCondition()
H A DLICM.cpp418 bool llvm::sinkRegion(DomTreeNode *N, AliasAnalysis *AA, LoopInfo *LI, in sinkRegion()
435 SmallVector<DomTreeNode *, 16> Worklist = collectChildrenInLoop(N, CurLoop); in sinkRegion()
438 for (DomTreeNode *DTN : reverse(Worklist)) { in sinkRegion()
689 DomTreeNode *PreheaderNode = DT->getNode(HoistCommonSucc); in getOrCreateHoistedBlock()
690 DomTreeNode *HeaderNode = DT->getNode(CurLoop->getHeader()); in getOrCreateHoistedBlock()
717 bool llvm::hoistRegion(DomTreeNode *N, AliasAnalysis *AA, LoopInfo *LI, in hoistRegion()
/freebsd-12.1/contrib/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp337 if (DomTreeNode *OldNode = DT->getNode(Old)) { in SplitBlock()
338 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlock()
340 DomTreeNode *NewNode = DT->addNewBlock(New, Old); in SplitBlock()
341 for (DomTreeNode *I : Children) in SplitBlock()
741 if (DomTreeNode *OldNode = DT->getNode(Head)) { in SplitBlockAndInsertIfThen()
742 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockAndInsertIfThen()
744 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); in SplitBlockAndInsertIfThen()
745 for (DomTreeNode *Child : Children) in SplitBlockAndInsertIfThen()
H A DLoopUtils.cpp427 SmallVector<DomTreeNode *, 16>
428 llvm::collectChildrenInLoop(DomTreeNode *N, const Loop *CurLoop) { in collectChildrenInLoop()
429 SmallVector<DomTreeNode *, 16> Worklist; in collectChildrenInLoop()
430 auto AddRegionToWorklist = [&](DomTreeNode *DTN) { in collectChildrenInLoop()
440 for (DomTreeNode *Child : Worklist[I]->getChildren()) in collectChildrenInLoop()
H A DLoopUnroll.cpp137 if (DomTreeNode *DTN = DT->getNode(BB)) { in foldBlockIntoPredecessor()
138 DomTreeNode *PredDTN = DT->getNode(OnlyPred); in foldBlockIntoPredecessor()
139 SmallVector<DomTreeNode *, 8> Children(DTN->begin(), DTN->end()); in foldBlockIntoPredecessor()
H A DCodeExtractor.cpp666 DomTreeNode *OldNode = DT->getNode(Block); in splitReturnBlocks()
667 SmallVector<DomTreeNode *, 8> Children(OldNode->begin(), in splitReturnBlocks()
670 DomTreeNode *NewNode = DT->addNewBlock(New, Block); in splitReturnBlocks()
672 for (DomTreeNode *I : Children) in splitReturnBlocks()
H A DLoopSimplify.cpp652 DomTreeNode *Node = DT->getNode(ExitingBlock); in simplifyOneLoop()
656 DomTreeNode *Child = Children.front(); in simplifyOneLoop()
H A DLCSSA.cpp127 DomTreeNode *DomNode = DT.getNode(DomBB); in formLCSSAForInstructions()
H A DPredicateInfo.cpp279 DomTreeNode *DomNode = DT.getNode(IBlock); in convertUsesToDFSOrdered()
592 DomTreeNode *DomNode = DT.getNode(PAssume->AssumeInst->getParent()); in renameUses()
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DPostDominators.h97 : public GraphTraits<DomTreeNode*> {
/freebsd-12.1/contrib/llvm/include/llvm/Support/
H A DGenericDomTree.h306 for (const auto &DomTreeNode : DomTreeNodes) {
307 NodeT *BB = DomTreeNode.first;
313 DomTreeNodeBase<NodeT> &MyNd = *DomTreeNode.second;
/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DHexagonGenExtract.cpp224 for (auto *DTN : children<DomTreeNode*>(DT->getNode(B))) in visitBlock()
H A DHexagonCommonGEP.cpp329 for (auto *DTN : children<DomTreeNode*>(DT->getNode(Root))) in getBlockTraversalOrder()
810 DomTreeNode *N = (*DT)[DomB]->getIDom(); in recalculatePlacement()
870 DomTreeNode *DN = DT->getNode(L->getHeader()); in preheader()
1252 for (auto DTN : children<DomTreeNode*>(DT->getNode(B))) in removeDeadCode()

12