| /external/llvm/lib/Analysis/ |
| IteratedDominanceFrontier.cpp | 33 typedef std::pair<DomTreeNode *, unsigned> DomTreeNodePair;
39 if (DomTreeNode *Node = DT.getNode(BB))
43 SmallVector<DomTreeNode *, 32> Worklist;
44 SmallPtrSet<DomTreeNode *, 32> VisitedPQ;
45 SmallPtrSet<DomTreeNode *, 32> VisitedWorklist;
50 DomTreeNode *Root = RootPair.first;
63 DomTreeNode *Node = Worklist.pop_back_val();
71 DomTreeNode *SuccNode = DT.getNode(Succ);
|
| DomPrinter.cpp | 29 struct DOTGraphTraits<DomTreeNode*> : public DefaultDOTGraphTraits {
34 std::string getNodeLabel(DomTreeNode *Node, DomTreeNode *Graph) {
52 struct DOTGraphTraits<DominatorTree*> : public DOTGraphTraits<DomTreeNode*> {
55 : DOTGraphTraits<DomTreeNode*>(isSimple) {}
61 std::string getNodeLabel(DomTreeNode *Node, DominatorTree *G) {
62 return DOTGraphTraits<DomTreeNode*>::getNodeLabel(Node, G->getRootNode());
68 : public DOTGraphTraits<DomTreeNode*> {
71 : DOTGraphTraits<DomTreeNode*>(isSimple) {}
77 std::string getNodeLabel(DomTreeNode *Node, PostDominatorTree *G )
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| PostDominators.h | 45 inline DomTreeNode *getRootNode() const {
49 inline DomTreeNode *operator[](BasicBlock *BB) const {
53 inline DomTreeNode *getNode(BasicBlock *BB) const {
57 inline bool dominates(DomTreeNode* A, DomTreeNode* B) const {
65 inline bool properlyDominates(const DomTreeNode* A, DomTreeNode* B) const {
87 : public GraphTraits<DomTreeNode*> {
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| DomPrinter.cpp | 29 struct DOTGraphTraits<DomTreeNode*> : public DefaultDOTGraphTraits {
34 std::string getNodeLabel(DomTreeNode *Node, DomTreeNode *Graph) {
52 struct DOTGraphTraits<DominatorTree*> : public DOTGraphTraits<DomTreeNode*> {
55 : DOTGraphTraits<DomTreeNode*>(isSimple) {}
61 std::string getNodeLabel(DomTreeNode *Node, DominatorTree *G) {
62 return DOTGraphTraits<DomTreeNode*>::getNodeLabel(Node, G->getRootNode());
68 : public DOTGraphTraits<DomTreeNode*> {
71 : DOTGraphTraits<DomTreeNode*>(isSimple) {}
77 std::string getNodeLabel(DomTreeNode *Node, PostDominatorTree *G )
[all...] |
| DominanceFrontier.cpp | 28 const DomTreeNode *N,
29 const DomTreeNode *PN)
33 const DomTreeNode *Node;
34 const DomTreeNode *parentNode;
40 const DomTreeNode *Node) {
54 const DomTreeNode *currentNode = currentW->Node;
55 const DomTreeNode *parentNode = currentW->parentNode;
77 for (DomTreeNode::const_iterator NI = currentNode->begin(),
79 DomTreeNode *IDominee = *NI;
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 33 typedef llvm::DomTreeNodeBase<CFGBlock> DomTreeNode;
57 /// \brief This method returns the root DomTreeNode, which is the wrapper
59 inline DomTreeNode *getRootNode() const {
68 DomTreeNode *R = getRootNode();
69 DomTreeNode *OtherR = Other.getRootNode();
169 template <> struct GraphTraits< ::clang::DomTreeNode* > {
170 typedef ::clang::DomTreeNode *NodeRef;
171 typedef ::clang::DomTreeNode::iterator ChildIteratorType;
177 typedef llvm::pointer_iterator<df_iterator<::clang::DomTreeNode *>>
180 static nodes_iterator nodes_begin(::clang::DomTreeNode *N)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 33 typedef llvm::DomTreeNodeBase<CFGBlock> DomTreeNode;
57 /// \brief This method returns the root DomTreeNode, which is the wrapper
59 inline DomTreeNode *getRootNode() const {
68 DomTreeNode *R = getRootNode();
69 DomTreeNode *OtherR = Other.getRootNode();
169 template <> struct GraphTraits< ::clang::DomTreeNode* > {
170 typedef ::clang::DomTreeNode *NodeRef;
171 typedef ::clang::DomTreeNode::iterator ChildIteratorType;
177 typedef llvm::pointer_iterator<df_iterator<::clang::DomTreeNode *>>
180 static nodes_iterator nodes_begin(::clang::DomTreeNode *N)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 33 typedef llvm::DomTreeNodeBase<CFGBlock> DomTreeNode;
57 /// \brief This method returns the root DomTreeNode, which is the wrapper
59 inline DomTreeNode *getRootNode() const {
68 DomTreeNode *R = getRootNode();
69 DomTreeNode *OtherR = Other.getRootNode();
169 template <> struct GraphTraits< ::clang::DomTreeNode* > {
170 typedef ::clang::DomTreeNode *NodeRef;
171 typedef ::clang::DomTreeNode::iterator ChildIteratorType;
177 typedef llvm::pointer_iterator<df_iterator<::clang::DomTreeNode *>>
180 static nodes_iterator nodes_begin(::clang::DomTreeNode *N)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 33 typedef llvm::DomTreeNodeBase<CFGBlock> DomTreeNode;
57 /// \brief This method returns the root DomTreeNode, which is the wrapper
59 inline DomTreeNode *getRootNode() const {
68 DomTreeNode *R = getRootNode();
69 DomTreeNode *OtherR = Other.getRootNode();
169 template <> struct GraphTraits< ::clang::DomTreeNode* > {
170 typedef ::clang::DomTreeNode *NodeRef;
171 typedef ::clang::DomTreeNode::iterator ChildIteratorType;
177 typedef llvm::pointer_iterator<df_iterator<::clang::DomTreeNode *>>
180 static nodes_iterator nodes_begin(::clang::DomTreeNode *N)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 33 typedef llvm::DomTreeNodeBase<CFGBlock> DomTreeNode;
57 /// \brief This method returns the root DomTreeNode, which is the wrapper
59 inline DomTreeNode *getRootNode() const {
68 DomTreeNode *R = getRootNode();
69 DomTreeNode *OtherR = Other.getRootNode();
169 template <> struct GraphTraits< ::clang::DomTreeNode* > {
170 typedef ::clang::DomTreeNode *NodeRef;
171 typedef ::clang::DomTreeNode::iterator ChildIteratorType;
177 typedef llvm::pointer_iterator<df_iterator<::clang::DomTreeNode *>>
180 static nodes_iterator nodes_begin(::clang::DomTreeNode *N)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 33 typedef llvm::DomTreeNodeBase<CFGBlock> DomTreeNode;
57 /// \brief This method returns the root DomTreeNode, which is the wrapper
59 inline DomTreeNode *getRootNode() const {
68 DomTreeNode *R = getRootNode();
69 DomTreeNode *OtherR = Other.getRootNode();
169 template <> struct GraphTraits< ::clang::DomTreeNode* > {
170 typedef ::clang::DomTreeNode *NodeRef;
171 typedef ::clang::DomTreeNode::iterator ChildIteratorType;
177 typedef llvm::pointer_iterator<df_iterator<::clang::DomTreeNode *>>
180 static nodes_iterator nodes_begin(::clang::DomTreeNode *N)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 33 typedef llvm::DomTreeNodeBase<CFGBlock> DomTreeNode;
57 /// \brief This method returns the root DomTreeNode, which is the wrapper
59 inline DomTreeNode *getRootNode() const {
68 DomTreeNode *R = getRootNode();
69 DomTreeNode *OtherR = Other.getRootNode();
169 template <> struct GraphTraits< ::clang::DomTreeNode* > {
170 typedef ::clang::DomTreeNode *NodeRef;
171 typedef ::clang::DomTreeNode::iterator ChildIteratorType;
177 typedef llvm::pointer_iterator<df_iterator<::clang::DomTreeNode *>>
180 static nodes_iterator nodes_begin(::clang::DomTreeNode *N)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 33 typedef llvm::DomTreeNodeBase<CFGBlock> DomTreeNode;
57 /// \brief This method returns the root DomTreeNode, which is the wrapper
59 inline DomTreeNode *getRootNode() const {
68 DomTreeNode *R = getRootNode();
69 DomTreeNode *OtherR = Other.getRootNode();
169 template <> struct GraphTraits< ::clang::DomTreeNode* > {
170 typedef ::clang::DomTreeNode *NodeRef;
171 typedef ::clang::DomTreeNode::iterator ChildIteratorType;
177 typedef llvm::pointer_iterator<df_iterator<::clang::DomTreeNode *>>
180 static nodes_iterator nodes_begin(::clang::DomTreeNode *N)
[all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 33 typedef llvm::DomTreeNodeBase<CFGBlock> DomTreeNode;
57 /// \brief This method returns the root DomTreeNode, which is the wrapper
59 inline DomTreeNode *getRootNode() const {
68 DomTreeNode *R = getRootNode();
69 DomTreeNode *OtherR = Other.getRootNode();
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)
[all...] |
| /external/llvm/include/llvm/IR/ |
| Dominators.h | 41 typedef DomTreeNodeBase<BasicBlock> DomTreeNode;
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*> {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/IR/ |
| Dominators.h | 45 typedef DomTreeNodeBase<BasicBlock> DomTreeNode;
130 const DomTreeNode *R = getRootNode();
131 const DomTreeNode *OtherR = Other.getRootNode();
183 struct GraphTraits<DomTreeNode *>
184 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::iterator> {};
187 struct GraphTraits<const DomTreeNode *>
188 : public DomTreeGraphTraitsBase<const DomTreeNode,
189 DomTreeNode::const_iterator> {};
192 : public GraphTraits<DomTreeNode*> {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/IR/ |
| Dominators.h | 45 typedef DomTreeNodeBase<BasicBlock> DomTreeNode;
130 const DomTreeNode *R = getRootNode();
131 const DomTreeNode *OtherR = Other.getRootNode();
183 struct GraphTraits<DomTreeNode *>
184 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::iterator> {};
187 struct GraphTraits<const DomTreeNode *>
188 : public DomTreeGraphTraitsBase<const DomTreeNode,
189 DomTreeNode::const_iterator> {};
192 : public GraphTraits<DomTreeNode*> {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/IR/ |
| Dominators.h | 45 typedef DomTreeNodeBase<BasicBlock> DomTreeNode;
130 const DomTreeNode *R = getRootNode();
131 const DomTreeNode *OtherR = Other.getRootNode();
183 struct GraphTraits<DomTreeNode *>
184 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::iterator> {};
187 struct GraphTraits<const DomTreeNode *>
188 : public DomTreeGraphTraitsBase<const DomTreeNode,
189 DomTreeNode::const_iterator> {};
192 : public GraphTraits<DomTreeNode*> {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
| Dominators.h | 45 typedef DomTreeNodeBase<BasicBlock> DomTreeNode;
130 const DomTreeNode *R = getRootNode();
131 const DomTreeNode *OtherR = Other.getRootNode();
183 struct GraphTraits<DomTreeNode *>
184 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::iterator> {};
187 struct GraphTraits<const DomTreeNode *>
188 : public DomTreeGraphTraitsBase<const DomTreeNode,
189 DomTreeNode::const_iterator> {};
192 : public GraphTraits<DomTreeNode*> {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/IR/ |
| Dominators.h | 45 typedef DomTreeNodeBase<BasicBlock> DomTreeNode;
130 const DomTreeNode *R = getRootNode();
131 const DomTreeNode *OtherR = Other.getRootNode();
183 struct GraphTraits<DomTreeNode *>
184 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::iterator> {};
187 struct GraphTraits<const DomTreeNode *>
188 : public DomTreeGraphTraitsBase<const DomTreeNode,
189 DomTreeNode::const_iterator> {};
192 : public GraphTraits<DomTreeNode*> {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/IR/ |
| Dominators.h | 45 typedef DomTreeNodeBase<BasicBlock> DomTreeNode;
130 const DomTreeNode *R = getRootNode();
131 const DomTreeNode *OtherR = Other.getRootNode();
183 struct GraphTraits<DomTreeNode *>
184 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::iterator> {};
187 struct GraphTraits<const DomTreeNode *>
188 : public DomTreeGraphTraitsBase<const DomTreeNode,
189 DomTreeNode::const_iterator> {};
192 : public GraphTraits<DomTreeNode*> {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/IR/ |
| Dominators.h | 45 typedef DomTreeNodeBase<BasicBlock> DomTreeNode;
130 const DomTreeNode *R = getRootNode();
131 const DomTreeNode *OtherR = Other.getRootNode();
183 struct GraphTraits<DomTreeNode *>
184 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::iterator> {};
187 struct GraphTraits<const DomTreeNode *>
188 : public DomTreeGraphTraitsBase<const DomTreeNode,
189 DomTreeNode::const_iterator> {};
192 : public GraphTraits<DomTreeNode*> {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
| Dominators.h | 45 typedef DomTreeNodeBase<BasicBlock> DomTreeNode;
130 const DomTreeNode *R = getRootNode();
131 const DomTreeNode *OtherR = Other.getRootNode();
183 struct GraphTraits<DomTreeNode *>
184 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::iterator> {};
187 struct GraphTraits<const DomTreeNode *>
188 : public DomTreeGraphTraitsBase<const DomTreeNode,
189 DomTreeNode::const_iterator> {};
192 : public GraphTraits<DomTreeNode*> {
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 89 DenseMap<DomTreeNode *, unsigned> DomLevels;
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 89 DenseMap<DomTreeNode *, unsigned> DomLevels;
|
