| /external/swiftshader/third_party/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 | DominanceFrontier.cpp | 28 const DomTreeNode *N, in DFCalculateWorkObject()
29 const DomTreeNode *PN) in DFCalculateWorkObject()
33 const DomTreeNode *Node;
34 const DomTreeNode *parentNode;
40 const DomTreeNode *Node) { in calculate()
54 const DomTreeNode *currentNode = currentW->Node; in calculate()
55 const DomTreeNode *parentNode = currentW->parentNode; in calculate()
77 for (DomTreeNode::const_iterator NI = currentNode->begin(), in calculate()
79 DomTreeNode *IDominee = *NI; in calculate()
|
| /external/swiftshader/third_party/llvm-7.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 | IteratedDominanceFrontier.cpp | 27 typedef std::pair<DomTreeNode *, std::pair<unsigned, unsigned>> in calculate()
36 if (DomTreeNode *Node = DT.getNode(BB)) in calculate()
40 SmallVector<DomTreeNode *, 32> Worklist; in calculate()
41 SmallPtrSet<DomTreeNode *, 32> VisitedPQ; in calculate()
42 SmallPtrSet<DomTreeNode *, 32> VisitedWorklist; in calculate()
47 DomTreeNode *Root = RootPair.first; in calculate()
60 DomTreeNode *Node = Worklist.pop_back_val(); in calculate()
65 DomTreeNode *SuccNode = DT.getNode(Succ); in calculate()
|
| /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()
|
| /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/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| D | PostDominators.h | 45 inline DomTreeNode *getRootNode() const { in getRootNode()
49 inline DomTreeNode *operator[](BasicBlock *BB) const {
53 inline DomTreeNode *getNode(BasicBlock *BB) const { in getNode()
57 inline bool dominates(DomTreeNode* A, DomTreeNode* B) const { in dominates()
65 inline bool properlyDominates(const DomTreeNode* A, DomTreeNode* B) const { in properlyDominates()
87 : public GraphTraits<DomTreeNode*> {
|
| D | Dominators.h | 176 typedef DomTreeNodeBase<BasicBlock> DomTreeNode; typedef
717 inline DomTreeNode *getRootNode() const { in getRootNode()
724 DomTreeNode *R = getRootNode(); in compare()
725 DomTreeNode *OtherR = Other.getRootNode(); in compare()
744 inline bool dominates(const DomTreeNode* A, const DomTreeNode* B) const { in dominates()
756 bool properlyDominates(const DomTreeNode *A, const DomTreeNode *B) const { in properlyDominates()
775 inline DomTreeNode *operator[](BasicBlock *BB) const {
782 inline DomTreeNode *getNode(BasicBlock *BB) const { in getNode()
789 inline DomTreeNode *addNewBlock(BasicBlock *BB, BasicBlock *DomBB) { in addNewBlock()
800 inline void changeImmediateDominator(DomTreeNode *N, DomTreeNode* NewIDom) { in changeImmediateDominator()
[all …]
|
| D | RegionInfo.h | 561 DomTreeNode *getNextPostDom(DomTreeNode* N, BBtoBBMap *ShortCut) const;
579 void buildRegionsTree(DomTreeNode *N, Region *region);
|
| /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/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/ |
| D | Dominators.h | 72 using DomTreeNode = DomTreeNodeBase<BasicBlock>;
203 struct GraphTraits<DomTreeNode *>
204 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::iterator> {};
207 struct GraphTraits<const DomTreeNode *>
208 : public DomTreeGraphTraitsBase<const DomTreeNode,
209 DomTreeNode::const_iterator> {};
212 : 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()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Utils/ |
| D | BasicBlockUtils.cpp | 200 if (DomTreeNode *DTN = DT->getNode(BB)) { in MergeBlockIntoPredecessor()
201 DomTreeNode *PredDTN = DT->getNode(PredBB); in MergeBlockIntoPredecessor()
202 SmallVector<DomTreeNode *, 8> Children(DTN->begin(), DTN->end()); in MergeBlockIntoPredecessor()
203 for (DomTreeNode *DI : Children) in MergeBlockIntoPredecessor()
319 if (DomTreeNode *OldNode = DT->getNode(Old)) { in SplitBlock()
320 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlock()
322 DomTreeNode *NewNode = DT->addNewBlock(New, Old); in SplitBlock()
323 for (DomTreeNode *I : Children) in SplitBlock()
705 if (DomTreeNode *OldNode = DT->getNode(Head)) { in SplitBlockAndInsertIfThen()
706 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockAndInsertIfThen()
[all …]
|
| D | OrderedInstructions.cpp | 48 DomTreeNode *DA = DT->getNode(InstA->getParent()); in dfsBefore()
49 DomTreeNode *DB = DT->getNode(InstB->getParent()); in dfsBefore()
|
| /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-7.0/llvm/lib/Transforms/Scalar/ |
| D | EarlyCSE.cpp | 447 unsigned cg, DomTreeNode *n, DomTreeNode::iterator child, in StackNode()
448 DomTreeNode::iterator end) in StackNode()
461 DomTreeNode *node() { return Node; } in node()
462 DomTreeNode::iterator childIter() { return ChildIter; } in childIter()
464 DomTreeNode *nextChild() { in nextChild()
465 DomTreeNode *child = *ChildIter; in nextChild()
470 DomTreeNode::iterator end() { return EndIter; } in end()
477 DomTreeNode *Node;
478 DomTreeNode::iterator ChildIter;
479 DomTreeNode::iterator EndIter;
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| D | PromoteMemoryToRegister.cpp | 241 DenseMap<DomTreeNode*, unsigned> DomLevels;
350 typedef std::pair<DomTreeNode*, unsigned> DomTreeNodePair;
489 SmallVector<DomTreeNode*, 32> Worklist; in run()
491 DomTreeNode *Root = DT.getRootNode(); in run()
496 DomTreeNode *Node = Worklist.pop_back_val(); in run()
498 for (DomTreeNode::iterator CI = Node->begin(), CE = Node->end(); in run()
762 if (DomTreeNode *Node = DT.getNode(*I)) in DetermineInsertionPoint()
767 SmallPtrSet<DomTreeNode*, 32> Visited; in DetermineInsertionPoint()
768 SmallVector<DomTreeNode*, 32> Worklist; in DetermineInsertionPoint()
772 DomTreeNode *Root = RootPair.first; in DetermineInsertionPoint()
[all …]
|
| D | BasicBlockUtils.cpp | 170 if (DomTreeNode *DTN = DT->getNode(BB)) { in MergeBlockIntoPredecessor()
171 DomTreeNode *PredDTN = DT->getNode(PredBB); in MergeBlockIntoPredecessor()
172 SmallVector<DomTreeNode*, 8> Children(DTN->begin(), DTN->end()); in MergeBlockIntoPredecessor()
173 for (SmallVector<DomTreeNode*, 8>::iterator DI = Children.begin(), in MergeBlockIntoPredecessor()
302 if (DomTreeNode *OldNode = DT->getNode(Old)) { in SplitBlock()
303 std::vector<DomTreeNode *> Children; in SplitBlock()
304 for (DomTreeNode::iterator I = OldNode->begin(), E = OldNode->end(); in SplitBlock()
308 DomTreeNode *NewNode = DT->addNewBlock(New,Old); in SplitBlock()
309 for (std::vector<DomTreeNode *>::iterator I = Children.begin(), in SplitBlock()
|
| D | BreakCriticalEdges.cpp | 274 DomTreeNode *TINode = DT->getNode(TIBB); in SplitCriticalEdge()
280 DomTreeNode *NewBBNode = DT->addNewBlock(NewBB, TIBB); in SplitCriticalEdge()
281 DomTreeNode *DestBBNode = 0; in SplitCriticalEdge()
287 if (DomTreeNode *OPNode = DT->getNode(OtherPreds.back())) in SplitCriticalEdge()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Transforms/Utils/ |
| D | LoopUtils.h | 421 bool sinkRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
434 bool hoistRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
470 SmallVector<DomTreeNode *, 16> collectChildrenInLoop(DomTreeNode *N,
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| D | LICM.cpp | 119 void SinkRegion(DomTreeNode *N);
127 void HoistRegion(DomTreeNode *N);
273 void LICM::SinkRegion(DomTreeNode *N) { in SinkRegion()
281 const std::vector<DomTreeNode*> &Children = N->getChildren(); in SinkRegion()
320 void LICM::HoistRegion(DomTreeNode *N) { in HoistRegion()
354 const std::vector<DomTreeNode*> &Children = N->getChildren(); in HoistRegion()
|