| /external/llvm-project/llvm/lib/Analysis/ |
| D | DomPrinter.cpp | 29 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()
|
| /external/llvm/lib/Analysis/ |
| D | DomPrinter.cpp | 29 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()
|
| D | IteratedDominanceFrontier.cpp | 33 typedef std::pair<DomTreeNode *, unsigned> DomTreeNodePair; in calculate()
39 if (DomTreeNode *Node = DT.getNode(BB)) in calculate()
43 SmallVector<DomTreeNode *, 32> Worklist; in calculate()
44 SmallPtrSet<DomTreeNode *, 32> VisitedPQ; in calculate()
45 SmallPtrSet<DomTreeNode *, 32> VisitedWorklist; in calculate()
50 DomTreeNode *Root = RootPair.first; in calculate()
63 DomTreeNode *Node = Worklist.pop_back_val(); in calculate()
71 DomTreeNode *SuccNode = DT.getNode(Succ); in calculate()
|
| D | DivergenceAnalysis.cpp | 148 DomTreeNode *ThisNode = PDT.getNode(ThisBB); in exploreSyncDependency()
192 DomTreeNode *IDomNode = DT.getNode(InfluencedBB)->getIDom(); in exploreSyncDependency()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | DomPrinter.cpp | 29 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()
|
| D | OrderedInstructions.cpp | 47 DomTreeNode *DA = DT->getNode(InstA->getParent()); in dfsBefore()
48 DomTreeNode *DB = DT->getNode(InstB->getParent()); in dfsBefore()
|
| /external/clang/include/clang/Analysis/Analyses/ |
| D | Dominators.h | 33 typedef llvm::DomTreeNodeBase<CFGBlock> DomTreeNode; typedef
59 inline DomTreeNode *getRootNode() const { in getRootNode()
68 DomTreeNode *R = getRootNode(); in compare()
69 DomTreeNode *OtherR = Other.getRootNode(); in compare()
169 template <> struct GraphTraits< ::clang::DomTreeNode* > {
170 typedef ::clang::DomTreeNode NodeType;
183 typedef df_iterator< ::clang::DomTreeNode* > nodes_iterator;
185 static nodes_iterator nodes_begin(::clang::DomTreeNode *N) {
189 static nodes_iterator nodes_end(::clang::DomTreeNode *N) {
195 : public GraphTraits< ::clang::DomTreeNode* > {
|
| /external/llvm-project/clang/include/clang/Analysis/Analyses/ |
| D | Dominators.h | 38 using DomTreeNode = llvm::DomTreeNodeBase<CFGBlock>; variable
66 DomTreeNode *getRootNode() { in getRootNode()
74 DomTreeNode *R = getRootNode(); in compare()
75 DomTreeNode *OtherR = Other.getRootNode(); in compare()
104 DomTreeNode *IDom = DT.getNode(*I)->getIDom(); in dump()
280 template <> struct GraphTraits<clang::DomTreeNode *> {
281 using NodeRef = ::clang::DomTreeNode *;
282 using ChildIteratorType = ::clang::DomTreeNode::const_iterator;
289 llvm::pointer_iterator<df_iterator<::clang::DomTreeNode *>>;
291 static nodes_iterator nodes_begin(::clang::DomTreeNode *N) {
[all …]
|
| /external/llvm/include/llvm/IR/ |
| D | Dominators.h | 41 typedef DomTreeNodeBase<BasicBlock> DomTreeNode; typedef
115 const DomTreeNode *R = getRootNode();
116 const DomTreeNode *OtherR = Other.getRootNode();
178 struct GraphTraits<DomTreeNode *>
179 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::iterator> {};
182 struct GraphTraits<const DomTreeNode *>
183 : public DomTreeGraphTraitsBase<const DomTreeNode,
184 DomTreeNode::const_iterator> {};
187 : public GraphTraits<DomTreeNode*> {
|
| /external/llvm-project/llvm/include/llvm/IR/ |
| D | Dominators.h | 81 using DomTreeNode = DomTreeNodeBase<BasicBlock>; variable
226 struct GraphTraits<DomTreeNode *>
227 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::const_iterator> {
231 struct GraphTraits<const DomTreeNode *>
232 : public DomTreeGraphTraitsBase<const DomTreeNode,
233 DomTreeNode::const_iterator> {};
236 : public GraphTraits<DomTreeNode*> {
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/ |
| D | Dominators.h | 74 using DomTreeNode = DomTreeNodeBase<BasicBlock>; variable
208 struct GraphTraits<DomTreeNode *>
209 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::iterator> {};
212 struct GraphTraits<const DomTreeNode *>
213 : public DomTreeGraphTraitsBase<const DomTreeNode,
214 DomTreeNode::const_iterator> {};
217 : public GraphTraits<DomTreeNode*> {
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | EarlyCSE.cpp | 347 CallHTType &AvailableCalls, unsigned cg, DomTreeNode *n, in StackNode()
348 DomTreeNode::iterator child, DomTreeNode::iterator end) in StackNode()
357 DomTreeNode *node() { return Node; } in node()
358 DomTreeNode::iterator childIter() { return ChildIter; } in childIter()
359 DomTreeNode *nextChild() { in nextChild()
360 DomTreeNode *child = *ChildIter; in nextChild()
364 DomTreeNode::iterator end() { return EndIter; } in end()
375 DomTreeNode *Node;
376 DomTreeNode::iterator ChildIter;
377 DomTreeNode::iterator EndIter;
[all …]
|
| D | LoopRotation.cpp | 374 DomTreeNode *OrigHeaderNode = DT->getNode(OrigHeader); in rotateLoop()
375 SmallVector<DomTreeNode *, 8> HeaderChildren(OrigHeaderNode->begin(), in rotateLoop()
377 DomTreeNode *OrigPreheaderNode = DT->getNode(OrigPreheader); in rotateLoop()
434 DomTreeNode *OrigHeaderNode = DT->getNode(OrigHeader); in rotateLoop()
435 SmallVector<DomTreeNode *, 8> HeaderChildren(OrigHeaderNode->begin(), in rotateLoop()
441 DomTreeNode *Node = HeaderChildren[I]; in rotateLoop()
|
| D | LoopDeletion.cpp | 175 SmallVector<DomTreeNode*, 8> ChildNodes; in runImpl()
181 for (DomTreeNode *ChildNode : ChildNodes) { in runImpl()
|
| D | Sink.cpp | 168 DomTreeNode *DTN = DT.getNode(Inst->getParent()); in SinkInstruction()
169 for (DomTreeNode::iterator I = DTN->begin(), E = DTN->end(); in SinkInstruction()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | BasicBlockUtils.cpp | 152 if (DomTreeNode *DTN = DT->getNode(BB)) { in MergeBlockIntoPredecessor()
153 DomTreeNode *PredDTN = DT->getNode(PredBB); in MergeBlockIntoPredecessor()
154 SmallVector<DomTreeNode *, 8> Children(DTN->begin(), DTN->end()); in MergeBlockIntoPredecessor()
155 for (DomTreeNode *DI : Children) in MergeBlockIntoPredecessor()
266 if (DomTreeNode *OldNode = DT->getNode(Old)) { in SplitBlock()
267 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlock()
269 DomTreeNode *NewNode = DT->addNewBlock(New, Old); in SplitBlock()
270 for (DomTreeNode *I : Children) in SplitBlock()
636 if (DomTreeNode *OldNode = DT->getNode(Head)) { in SplitBlockAndInsertIfThen()
637 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockAndInsertIfThen()
[all …]
|
| D | BreakCriticalEdges.cpp | 213 DomTreeNode *TINode = DT->getNode(TIBB); in SplitCriticalEdge()
219 DomTreeNode *NewBBNode = DT->addNewBlock(NewBB, TIBB); in SplitCriticalEdge()
220 DomTreeNode *DestBBNode = nullptr; in SplitCriticalEdge()
226 if (DomTreeNode *OPNode = DT->getNode(OtherPreds.back())) in SplitCriticalEdge()
|
| D | MemorySSA.cpp | 161 DomTreeNode *DTN;
162 DomTreeNode::const_iterator ChildIt;
165 RenamePassData(DomTreeNode *D, DomTreeNode::const_iterator It, in RenamePassData()
224 void MemorySSA::renamePass(DomTreeNode *Root, MemoryAccess *IncomingVal, in renamePass()
232 DomTreeNode *Node = WorkStack.back().DTN; in renamePass()
233 DomTreeNode::const_iterator ChildIt = WorkStack.back().ChildIt; in renamePass()
239 DomTreeNode *Child = *ChildIt; in renamePass()
250 void MemorySSA::computeDomLevels(DenseMap<DomTreeNode *, unsigned> &DomLevels) { in computeDomLevels() argument
557 DomTreeNode *CurrNode = DT->getNode(UseBlock); in findDominatingDef()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/Utils/ |
| D | LoopUtils.h | 121 bool sinkRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
134 bool hoistRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
170 SmallVector<DomTreeNode *, 16> collectChildrenInLoop(DomTreeNode *N,
|
| /external/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| D | LoopUtils.h | 24 using DomTreeNode = DomTreeNodeBase<BasicBlock>; variable
148 bool sinkRegion(DomTreeNode *, AAResults *, LoopInfo *, DominatorTree *,
162 bool hoistRegion(DomTreeNode *, AAResults *, LoopInfo *, DominatorTree *,
199 SmallVector<DomTreeNode *, 16> collectChildrenInLoop(DomTreeNode *N,
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | EarlyCSE.cpp | 601 unsigned cg, DomTreeNode *n, DomTreeNode::iterator child, in StackNode()
602 DomTreeNode::iterator end) in StackNode()
615 DomTreeNode *node() { return Node; } in node()
616 DomTreeNode::iterator childIter() { return ChildIter; } in childIter()
618 DomTreeNode *nextChild() { in nextChild()
619 DomTreeNode *child = *ChildIter; in nextChild()
624 DomTreeNode::iterator end() { return EndIter; } in end()
631 DomTreeNode *Node;
632 DomTreeNode::iterator ChildIter;
633 DomTreeNode::iterator EndIter;
[all …]
|
| /external/llvm-project/llvm/lib/Transforms/Scalar/ |
| D | EarlyCSE.cpp | 619 unsigned cg, DomTreeNode *n, DomTreeNode::const_iterator child, in StackNode()
620 DomTreeNode::const_iterator end) in StackNode()
633 DomTreeNode *node() { return Node; } in node()
634 DomTreeNode::const_iterator childIter() const { return ChildIter; } in childIter()
636 DomTreeNode *nextChild() { in nextChild()
637 DomTreeNode *child = *ChildIter; in nextChild()
642 DomTreeNode::const_iterator end() const { return EndIter; } in end()
649 DomTreeNode *Node;
650 DomTreeNode::const_iterator ChildIter;
651 DomTreeNode::const_iterator EndIter;
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/ |
| D | BasicBlockUtils.cpp | 535 if (DomTreeNode *OldNode = DT->getNode(Old)) { in SplitBlock()
536 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlock()
538 DomTreeNode *NewNode = DT->addNewBlock(New, Old); in SplitBlock()
539 for (DomTreeNode *I : Children) in SplitBlock()
952 if (DomTreeNode *OldNode = DT->getNode(Head)) { in SplitBlockAndInsertIfThen()
953 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockAndInsertIfThen()
955 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); in SplitBlockAndInsertIfThen()
956 for (DomTreeNode *Child : Children) in SplitBlockAndInsertIfThen()
|
| D | PredicateInfo.cpp | 180 DomTreeNode *DomASrc = DT.getNode(ASrc); in comparePHIRelated()
181 DomTreeNode *DomBSrc = DT.getNode(BSrc); in comparePHIRelated()
193 DomTreeNode *DomADest = DT.getNode(ADest); in comparePHIRelated()
194 DomTreeNode *DomBDest = DT.getNode(BDest); in comparePHIRelated()
310 DomTreeNode *DomNode = DT.getNode(IBlock); in convertUsesToDFSOrdered()
621 DomTreeNode *DomNode = DT.getNode(PAssume->AssumeInst->getParent()); in renameUses()
|
| /external/llvm/include/llvm/Analysis/ |
| D | IteratedDominanceFrontier.h | 89 DenseMap<DomTreeNode *, unsigned> DomLevels;
|