HomeSort by relevance Sort by last modified time
    Searched refs:GraphT (Results 51 - 75 of 131) sorted by null

1 23 4 5 6

  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/
SCCIterator.h 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
102 static scc_iterator begin(const GraphT &G) {
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
155 template <class GraphT, class GT>
156 void scc_iterator<GraphT, GT>::DFSVisitChildren() {
175 template <class GraphT, class GT> void scc_iterator<GraphT, GT>::GetNextSCC()
    [all...]
BreadthFirstIterator.h 44 template <class GraphT,
46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
47 class GT = GraphTraits<GraphT>>
114 static bf_iterator begin(const GraphT &G) {
118 static bf_iterator end(const GraphT &G) { return bf_iterator(); }
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/
SCCIterator.h 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
102 static scc_iterator begin(const GraphT &G) {
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
155 template <class GraphT, class GT>
156 void scc_iterator<GraphT, GT>::DFSVisitChildren() {
175 template <class GraphT, class GT> void scc_iterator<GraphT, GT>::GetNextSCC()
    [all...]
BreadthFirstIterator.h 44 template <class GraphT,
46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
47 class GT = GraphTraits<GraphT>>
114 static bf_iterator begin(const GraphT &G) {
118 static bf_iterator end(const GraphT &G) { return bf_iterator(); }
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/
SCCIterator.h 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
102 static scc_iterator begin(const GraphT &G) {
105 static scc_iterator end(const GraphT &) { return scc_iterator(); }
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
155 template <class GraphT, class GT>
156 void scc_iterator<GraphT, GT>::DFSVisitChildren() {
175 template <class GraphT, class GT> void scc_iterator<GraphT, GT>::GetNextSCC()
    [all...]
BreadthFirstIterator.h 44 template <class GraphT,
46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
47 class GT = GraphTraits<GraphT>>
114 static bf_iterator begin(const GraphT &G) {
118 static bf_iterator end(const GraphT &G) { return bf_iterator(); }
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
BreadthFirstIterator.h 45 template <class GraphT,
47 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
48 class GT = GraphTraits<GraphT>>
115 static bf_iterator begin(const GraphT &G) {
119 static bf_iterator end(const GraphT &G) { return bf_iterator(); }
PostOrderIterator.h 92 template <class GraphT,
94 SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
95 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
141 static po_iterator begin(GraphT G) {
144 static po_iterator end(GraphT G) { return po_iterator(); }
146 static po_iterator begin(GraphT G, SetType &S) {
149 static po_iterator end(GraphT G, SetType &S) { return po_iterator(S); }
287 template<class GraphT, class GT = GraphTraits<GraphT>>
299 ReversePostOrderTraversal(GraphT G) { Initialize(GT::getEntryNode(G));
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/
BreadthFirstIterator.h 44 template <class GraphT,
46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
47 class GT = GraphTraits<GraphT>>
114 static bf_iterator begin(const GraphT &G) {
118 static bf_iterator end(const GraphT &G) { return bf_iterator(); }
PostOrderIterator.h 92 template <class GraphT,
94 SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
95 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
141 static po_iterator begin(GraphT G) {
144 static po_iterator end(GraphT G) { return po_iterator(); }
146 static po_iterator begin(GraphT G, SetType &S) {
149 static po_iterator end(GraphT G, SetType &S) { return po_iterator(S); }
287 template<class GraphT, class GT = GraphTraits<GraphT>>
300 ReversePostOrderTraversal(GraphT G) { Initialize(GT::getEntryNode(G));
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/
BreadthFirstIterator.h 44 template <class GraphT,
46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
47 class GT = GraphTraits<GraphT>>
114 static bf_iterator begin(const GraphT &G) {
118 static bf_iterator end(const GraphT &G) { return bf_iterator(); }
PostOrderIterator.h 92 template <class GraphT,
94 SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
95 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
141 static po_iterator begin(GraphT G) {
144 static po_iterator end(GraphT G) { return po_iterator(); }
146 static po_iterator begin(GraphT G, SetType &S) {
149 static po_iterator end(GraphT G, SetType &S) { return po_iterator(S); }
287 template<class GraphT, class GT = GraphTraits<GraphT>>
300 ReversePostOrderTraversal(GraphT G) { Initialize(GT::getEntryNode(G));
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/
BreadthFirstIterator.h 44 template <class GraphT,
46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
47 class GT = GraphTraits<GraphT>>
114 static bf_iterator begin(const GraphT &G) {
118 static bf_iterator end(const GraphT &G) { return bf_iterator(); }
PostOrderIterator.h 92 template <class GraphT,
94 SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
95 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
141 static po_iterator begin(GraphT G) {
144 static po_iterator end(GraphT G) { return po_iterator(); }
146 static po_iterator begin(GraphT G, SetType &S) {
149 static po_iterator end(GraphT G, SetType &S) { return po_iterator(S); }
287 template<class GraphT, class GT = GraphTraits<GraphT>>
300 ReversePostOrderTraversal(GraphT G) { Initialize(GT::getEntryNode(G));
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/
BreadthFirstIterator.h 44 template <class GraphT,
46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
47 class GT = GraphTraits<GraphT>>
114 static bf_iterator begin(const GraphT &G) {
118 static bf_iterator end(const GraphT &G) { return bf_iterator(); }
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/
BreadthFirstIterator.h 44 template <class GraphT,
46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
47 class GT = GraphTraits<GraphT>>
114 static bf_iterator begin(const GraphT &G) {
118 static bf_iterator end(const GraphT &G) { return bf_iterator(); }
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/
BreadthFirstIterator.h 44 template <class GraphT,
46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
47 class GT = GraphTraits<GraphT>>
114 static bf_iterator begin(const GraphT &G) {
118 static bf_iterator end(const GraphT &G) { return bf_iterator(); }
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
BreadthFirstIterator.h 45 template <class GraphT,
47 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
48 class GT = GraphTraits<GraphT>>
115 static bf_iterator begin(const GraphT &G) {
119 static bf_iterator end(const GraphT &G) { return bf_iterator(); }
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/
BreadthFirstIterator.h 44 template <class GraphT,
46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
47 class GT = GraphTraits<GraphT>>
114 static bf_iterator begin(const GraphT &G) {
118 static bf_iterator end(const GraphT &G) { return bf_iterator(); }
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/
BreadthFirstIterator.h 44 template <class GraphT,
46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
47 class GT = GraphTraits<GraphT>>
114 static bf_iterator begin(const GraphT &G) {
118 static bf_iterator end(const GraphT &G) { return bf_iterator(); }
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/
BreadthFirstIterator.h 44 template <class GraphT,
46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
47 class GT = GraphTraits<GraphT>>
114 static bf_iterator begin(const GraphT &G) {
118 static bf_iterator end(const GraphT &G) { return bf_iterator(); }
  /external/swiftshader/third_party/LLVM/include/llvm/ADT/
PostOrderIterator.h 48 template<class GraphT,
49 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
51 class GT = GraphTraits<GraphT> >
93 typedef po_iterator<GraphT, SetType, ExtStorage, GT> _Self;
96 static inline _Self begin(GraphT G) { return _Self(GT::getEntryNode(G)); }
97 static inline _Self end (GraphT G) { return _Self(); }
99 static inline _Self begin(GraphT G, SetType &S) {
102 static inline _Self end (GraphT G, SetType &S) { return _Self(S); }
219 template<class GraphT, class GT = GraphTraits<GraphT> >
    [all...]
DepthFirstIterator.h 62 template<class GraphT,
63 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
64 bool ExtStorage = false, class GT = GraphTraits<GraphT> >
131 typedef df_iterator<GraphT, SetType, ExtStorage, GT> _Self;
134 static inline _Self begin(const GraphT& G) {
137 static inline _Self end(const GraphT& G) { return _Self(); }
140 static inline _Self begin(const GraphT& G, SetType &S) {
143 static inline _Self end(const GraphT& G, SetType &S) { return _Self(S); }
SCCIterator.h 35 template<class GraphT, class GT = GraphTraits<GraphT> >
138 typedef scc_iterator<GraphT, GT> _Self;
141 static inline _Self begin(const GraphT &G){return _Self(GT::getEntryNode(G));}
142 static inline _Self end (const GraphT &) { return _Self(); }
  /external/llvm/include/llvm/ADT/
PostOrderIterator.h 89 template<class GraphT,
90 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
92 class GT = GraphTraits<GraphT> >
137 static po_iterator begin(GraphT G) {
140 static po_iterator end(GraphT G) { return po_iterator(); }
142 static po_iterator begin(GraphT G, SetType &S) {
145 static po_iterator end(GraphT G, SetType &S) { return po_iterator(S); }
281 template<class GraphT, class GT = GraphTraits<GraphT> >
291 ReversePostOrderTraversal(GraphT G) { Initialize(GT::getEntryNode(G));
    [all...]

Completed in 1097 milliseconds

1 23 4 5 6