/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
D | RegionIterator.h | 38 template <class NodeRef, class BlockT, class RegionT> 40 : public std::iterator<std::forward_iterator_tag, NodeRef> { 41 using super = std::iterator<std::forward_iterator_tag, NodeRef>; 56 static_assert(std::is_pointer<NodeRef>::value, 63 PointerIntPair<NodeRef, 2, ItMode> Node; 75 NodeRef getNode() const { return Node.getPointer(); } in getNode() 82 NodeRef getISucc(BlockT *BB) const { in getISucc() 83 NodeRef succ; in getISucc() 101 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>; 105 inline RNSuccIterator(NodeRef node) in RNSuccIterator() [all …]
|
D | Interval.h | 120 using NodeRef = Interval *; 123 static NodeRef getEntryNode(Interval *I) { return I; } 126 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); } 127 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); } 131 using NodeRef = Interval *; 134 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; } 135 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); } 136 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
|
D | LoopIterator.h | 41 using NodeRef = std::pair<const Loop *, BasicBlock *>; member 49 NodeRef, std::ptrdiff_t, NodeRef *, NodeRef> { 53 NodeRef, std::ptrdiff_t, NodeRef *, NodeRef>; 61 NodeRef operator*() const { return {L, *I}; } 65 bool operator()(NodeRef N) const { in operator() 74 static NodeRef getEntryNode(const Loop &G) { return {&G, G.getHeader()}; } in getEntryNode() 76 static ChildIteratorType child_begin(NodeRef Node) { in child_begin() 84 static ChildIteratorType child_end(NodeRef Node) { in child_end()
|
/external/llvm-project/llvm/include/llvm/Analysis/ |
D | RegionIterator.h | 38 template <class NodeRef, class BlockT, class RegionT> 40 : public std::iterator<std::forward_iterator_tag, NodeRef> { 41 using super = std::iterator<std::forward_iterator_tag, NodeRef>; 56 static_assert(std::is_pointer<NodeRef>::value, 63 PointerIntPair<NodeRef, 2, ItMode> Node; 75 NodeRef getNode() const { return Node.getPointer(); } in getNode() 82 NodeRef getISucc(BlockT *BB) const { in getISucc() 83 NodeRef succ; in getISucc() 101 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>; 105 inline RNSuccIterator(NodeRef node) in RNSuccIterator() [all …]
|
D | Interval.h | 120 using NodeRef = Interval *; 123 static NodeRef getEntryNode(Interval *I) { return I; } 126 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); } 127 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); } 131 using NodeRef = Interval *; 134 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; } 135 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); } 136 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
|
D | LoopIterator.h | 41 using NodeRef = std::pair<const Loop *, BasicBlock *>; member 49 NodeRef, std::ptrdiff_t, NodeRef *, NodeRef> { 53 NodeRef, std::ptrdiff_t, NodeRef *, NodeRef>; 61 NodeRef operator*() const { return {L, *I}; } 65 bool operator()(NodeRef N) const { in operator() 74 static NodeRef getEntryNode(const Loop &G) { return {&G, G.getHeader()}; } in getEntryNode() 76 static ChildIteratorType child_begin(NodeRef Node) { in child_begin() 84 static ChildIteratorType child_end(NodeRef Node) { in child_end()
|
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
D | PostOrderIterator.h | 62 template <typename NodeRef> 63 bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge() 68 template <typename NodeRef> void finishPostorder(NodeRef BB) {} in finishPostorder() 83 template <class NodeRef> bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge() 88 template <class NodeRef> void finishPostorder(NodeRef BB) {} in finishPostorder() 93 SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>, 96 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>, 98 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>; 99 using NodeRef = typename GT::NodeRef; variable 104 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack; [all …]
|
D | SCCIterator.h | 44 const std::vector<typename GT::NodeRef>, ptrdiff_t> { 45 using NodeRef = typename GT::NodeRef; variable 47 using SccTy = std::vector<NodeRef>; 52 NodeRef Node; ///< The current node pointer. 56 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min) in StackElement() 71 DenseMap<NodeRef, unsigned> nodeVisitNumbers; 74 std::vector<NodeRef> SCCNodeStack; 84 void DFSVisitOne(NodeRef N); 92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() 135 void ReplaceNode(NodeRef Old, NodeRef New) { in ReplaceNode() [all …]
|
D | BreadthFirstIterator.h | 39 template <typename NodeRef, unsigned SmallSize = 8> 40 using bf_iterator_default_set = SmallPtrSet<NodeRef, SmallSize>; 45 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>, 48 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>, 50 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>; 52 using NodeRef = typename GT::NodeRef; variable 56 using QueueElement = std::pair<NodeRef, Optional<ChildItTy>>; 66 inline bf_iterator(NodeRef Node) { in bf_iterator() 80 NodeRef Node = H.first; in toNext() 86 NodeRef Next = *(*ChildIt)++; in toNext() [all …]
|
D | DepthFirstIterator.h | 68 template <typename NodeRef, unsigned SmallSize=8> 69 struct df_iterator_default_set : public SmallPtrSet<NodeRef, SmallSize> { 70 using BaseSet = SmallPtrSet<NodeRef, SmallSize>; 73 std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); } in insert() 77 void completed(NodeRef) {} in completed() 83 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>, 86 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>, 88 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>; 89 using NodeRef = typename GT::NodeRef; variable 95 using StackElement = std::pair<NodeRef, Optional<ChildItTy>>; [all …]
|
/external/llvm-project/llvm/include/llvm/ADT/ |
D | PostOrderIterator.h | 63 template <typename NodeRef> 64 bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge() 69 template <typename NodeRef> void finishPostorder(NodeRef BB) {} in finishPostorder() 84 template <class NodeRef> bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge() 89 template <class NodeRef> void finishPostorder(NodeRef BB) {} in finishPostorder() 94 SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>, 97 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>, 99 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>; 100 using NodeRef = typename GT::NodeRef; variable 105 SmallVector<std::pair<NodeRef, ChildItTy>, 8> VisitStack; [all …]
|
D | SCCIterator.h | 44 const std::vector<typename GT::NodeRef>, ptrdiff_t> { 45 using NodeRef = typename GT::NodeRef; variable 47 using SccTy = std::vector<NodeRef>; 52 NodeRef Node; ///< The current node pointer. 56 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min) in StackElement() 71 DenseMap<NodeRef, unsigned> nodeVisitNumbers; 74 std::vector<NodeRef> SCCNodeStack; 84 void DFSVisitOne(NodeRef N); 92 scc_iterator(NodeRef entryN) : visitNum(0) { in scc_iterator() 135 void ReplaceNode(NodeRef Old, NodeRef New) { in ReplaceNode() [all …]
|
D | BreadthFirstIterator.h | 39 template <typename NodeRef, unsigned SmallSize = 8> 40 using bf_iterator_default_set = SmallPtrSet<NodeRef, SmallSize>; 45 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>, 48 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>, 50 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>; 52 using NodeRef = typename GT::NodeRef; variable 56 using QueueElement = std::pair<NodeRef, Optional<ChildItTy>>; 66 inline bf_iterator(NodeRef Node) { in bf_iterator() 80 NodeRef Node = H.first; in toNext() 86 NodeRef Next = *(*ChildIt)++; in toNext() [all …]
|
D | DepthFirstIterator.h | 68 template <typename NodeRef, unsigned SmallSize=8> 69 struct df_iterator_default_set : public SmallPtrSet<NodeRef, SmallSize> { 70 using BaseSet = SmallPtrSet<NodeRef, SmallSize>; 73 std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); } in insert() 77 void completed(NodeRef) {} in completed() 83 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>, 86 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>, 88 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>; 89 using NodeRef = typename GT::NodeRef; variable 95 using StackElement = std::pair<NodeRef, Optional<ChildItTy>>; [all …]
|
/external/llvm-project/mlir/include/mlir/IR/ |
D | RegionGraphTraits.h | 25 using NodeRef = Node *; 27 static NodeRef getEntryNode(NodeRef bb) { return bb; } 29 static ChildIteratorType child_begin(NodeRef node) { 32 static ChildIteratorType child_end(NodeRef node) { return node->succ_end(); } 38 using NodeRef = Node *; 39 static NodeRef getEntryNode(Inverse<NodeRef> inverseGraph) { 42 static inline ChildIteratorType child_begin(NodeRef node) { 45 static inline ChildIteratorType child_end(NodeRef node) { 53 using NodeRef = mlir::Block *; 55 static NodeRef getEntryNode(GraphType fn) { return &fn->front(); } [all …]
|
D | Dominance.h | 169 using NodeRef = mlir::DominanceInfoNode *; 171 static NodeRef getEntryNode(NodeRef N) { return N; } 172 static inline ChildIteratorType child_begin(NodeRef N) { return N->begin(); } 173 static inline ChildIteratorType child_end(NodeRef N) { return N->end(); } 178 using NodeRef = const mlir::DominanceInfoNode *; 180 static NodeRef getEntryNode(NodeRef N) { return N; } 181 static inline ChildIteratorType child_begin(NodeRef N) { return N->begin(); } 182 static inline ChildIteratorType child_end(NodeRef N) { return N->end(); }
|
/external/llvm-project/llvm/unittests/Analysis/ |
D | CallGraphTest.cpp | 19 typedef typename GraphTraits<Ty *>::NodeRef NodeRef; in canSpecializeGraphTraitsIterators() typedef 26 static_assert(std::is_same<decltype(*I), NodeRef>::value, in canSpecializeGraphTraitsIterators() 28 static_assert(std::is_same<decltype(*X), NodeRef>::value, in canSpecializeGraphTraitsIterators() 30 static_assert(std::is_same<decltype(*E), NodeRef>::value, in canSpecializeGraphTraitsIterators() 33 NodeRef N = GraphTraits<Ty *>::getEntryNode(G); in canSpecializeGraphTraitsIterators() 35 auto S = GraphTraits<NodeRef>::child_begin(N); in canSpecializeGraphTraitsIterators() 36 auto F = GraphTraits<NodeRef>::child_end(N); in canSpecializeGraphTraitsIterators() 39 static_assert(std::is_same<decltype(*S), NodeRef>::value, in canSpecializeGraphTraitsIterators() 41 static_assert(std::is_same<decltype(*F), NodeRef>::value, in canSpecializeGraphTraitsIterators()
|
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/ |
D | CFGDiff.h | 160 using NodeRef = std::pair<DataRef, BasicBlock *>; member 163 WrappedPairNodeDataIterator<succ_iterator, NodeRef, DataRef>; 167 bool operator()(NodeRef N) const { in operator() 176 WrappedPairNodeDataIterator<vec_iterator, NodeRef, DataRef>; 178 concat_iterator<NodeRef, FilterExistingChildrenIterator, 181 static ChildIteratorType child_begin(NodeRef N) { in child_begin() 192 return concat_iterator<NodeRef, FilterExistingChildrenIterator, in child_begin() 196 static ChildIteratorType child_end(NodeRef N) { in child_end() 207 return concat_iterator<NodeRef, FilterExistingChildrenIterator, in child_end() 214 using NodeRef = std::pair<DataRef, BasicBlock *>; member [all …]
|
D | CFG.h | 299 using NodeRef = BasicBlock *; 302 static NodeRef getEntryNode(BasicBlock *BB) { return BB; } 303 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); } 304 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); } 308 using NodeRef = const BasicBlock *; 311 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; } 313 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); } 314 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); } 323 using NodeRef = BasicBlock *; 326 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; } [all …]
|
/external/llvm-project/clang/include/clang/AST/ |
D | StmtGraphTraits.h | 24 using NodeRef = clang::Stmt *; 28 static NodeRef getEntryNode(clang::Stmt *S) { return S; } 30 static ChildIteratorType child_begin(NodeRef N) { 35 static ChildIteratorType child_end(NodeRef N) { 50 using NodeRef = const clang::Stmt *; 54 static NodeRef getEntryNode(const clang::Stmt *S) { return S; } 56 static ChildIteratorType child_begin(NodeRef N) { 61 static ChildIteratorType child_end(NodeRef N) {
|
/external/llvm-project/llvm/include/llvm/IR/ |
D | CFG.h | 300 using NodeRef = BasicBlock *; 303 static NodeRef getEntryNode(BasicBlock *BB) { return BB; } 304 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); } 305 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); } 309 using NodeRef = const BasicBlock *; 312 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; } 314 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); } 315 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); } 324 using NodeRef = BasicBlock *; 327 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; } [all …]
|
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
D | IntervalMap.cpp | 24 NodeRef Path::getLeftSibling(unsigned Level) const { in getLeftSibling() 27 return NodeRef(); in getLeftSibling() 36 return NodeRef(); in getLeftSibling() 39 NodeRef NR = path[l].subtree(path[l].offset - 1); in getLeftSibling() 64 NodeRef NR = subtree(l); in moveLeft() 74 NodeRef Path::getRightSibling(unsigned Level) const { in getRightSibling() 77 return NodeRef(); in getRightSibling() 86 return NodeRef(); in getRightSibling() 89 NodeRef NR = path[l].subtree(path[l].offset + 1); in getRightSibling() 109 NodeRef NR = subtree(l); in moveRight()
|
/external/llvm-project/llvm/lib/Support/ |
D | IntervalMap.cpp | 25 NodeRef Path::getLeftSibling(unsigned Level) const { in getLeftSibling() 28 return NodeRef(); in getLeftSibling() 37 return NodeRef(); in getLeftSibling() 40 NodeRef NR = path[l].subtree(path[l].offset - 1); in getLeftSibling() 65 NodeRef NR = subtree(l); in moveLeft() 75 NodeRef Path::getRightSibling(unsigned Level) const { in getRightSibling() 78 return NodeRef(); in getRightSibling() 87 return NodeRef(); in getRightSibling() 90 NodeRef NR = path[l].subtree(path[l].offset + 1); in getRightSibling() 110 NodeRef NR = subtree(l); in moveRight()
|
/external/llvm/lib/Support/ |
D | IntervalMap.cpp | 25 NodeRef Path::getLeftSibling(unsigned Level) const { in getLeftSibling() 28 return NodeRef(); in getLeftSibling() 37 return NodeRef(); in getLeftSibling() 40 NodeRef NR = path[l].subtree(path[l].offset - 1); in getLeftSibling() 65 NodeRef NR = subtree(l); in moveLeft() 75 NodeRef Path::getRightSibling(unsigned Level) const { in getRightSibling() 78 return NodeRef(); in getRightSibling() 87 return NodeRef(); in getRightSibling() 90 NodeRef NR = path[l].subtree(path[l].offset + 1); in getRightSibling() 110 NodeRef NR = subtree(l); in moveRight()
|
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
D | MachineLoopInfo.h | 177 using NodeRef = const MachineLoop *; 180 static NodeRef getEntryNode(const MachineLoop *L) { return L; } 181 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); } 182 static ChildIteratorType child_end(NodeRef N) { return N->end(); } 186 using NodeRef = MachineLoop *; 189 static NodeRef getEntryNode(MachineLoop *L) { return L; } 190 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); } 191 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
|