Searched refs:NodeIter (Results 1 – 7 of 7) sorted by relevance
| /external/deqp/framework/common/ |
| D | tcuTestHierarchyIterator.cpp | 95 NodeIter iter(&rootNode); in TestHierarchyIterator()
96 iter.setState(NodeIter::STATE_ENTER); // Root is never reported in TestHierarchyIterator()
104 …for (vector<NodeIter>::reverse_iterator iter = m_sessionStack.rbegin(); iter != m_sessionStack.ren… in ~TestHierarchyIterator()
124 const NodeIter& iter = m_sessionStack.back(); in getState()
126 DE_ASSERT(iter.getState() == NodeIter::STATE_ENTER || in getState()
127 iter.getState() == NodeIter::STATE_LEAVE); in getState()
129 return iter.getState() == NodeIter::STATE_ENTER ? STATE_ENTER_NODE : STATE_LEAVE_NODE; in getState()
147 std::string TestHierarchyIterator::buildNodePath (const vector<NodeIter>& nodeStack) in buildNodePath()
152 const NodeIter& iter = nodeStack[ndx]; in buildNodePath()
164 NodeIter& iter = m_sessionStack.back(); in next()
[all …]
|
| D | tcuTestHierarchyIterator.hpp | 130 struct NodeIter struct in tcu::TestHierarchyIterator
142 NodeIter (void) in NodeIter() argument
149 NodeIter (TestNode* node_) in NodeIter() argument
190 static std::string buildNodePath (const std::vector<NodeIter>& nodeStack);
196 std::vector<NodeIter> m_sessionStack;
|
| /external/google-fruit/include/fruit/impl/data_structures/ |
| D | semistatic_graph.templates.h | 59 template <typename NodeIter>
60 void SemistaticGraph<NodeId, Node>::printGraph(NodeIter first, NodeIter last) { in printGraph()
62 for (NodeIter i = first; i != last; ++i) { in printGraph()
83 template <typename NodeIter>
84 SemistaticGraph<NodeId, Node>::SemistaticGraph(NodeIter first, NodeIter last, MemoryPool& memory_po… in SemistaticGraph()
88 for (NodeIter i = first; i != last; ++i) { in SemistaticGraph()
120 for (NodeIter i = first; i != last; ++i) { in SemistaticGraph()
140 template <typename NodeIter>
141 SemistaticGraph<NodeId, Node>::SemistaticGraph(const SemistaticGraph& x, NodeIter first, NodeIter l… in SemistaticGraph()
155 for (NodeIter i = first; i != last; ++i) { in SemistaticGraph()
[all …]
|
| D | semistatic_graph.h | 97 template <typename NodeIter>
98 void printGraph(NodeIter first, NodeIter last);
189 template <typename NodeIter>
190 SemistaticGraph(NodeIter first, NodeIter last, MemoryPool& memory_pool);
205 template <typename NodeIter>
206 SemistaticGraph(const SemistaticGraph& x, NodeIter first, NodeIter last, MemoryPool& memory_pool);
|
| /external/tensorflow/tensorflow/core/graph/ |
| D | graph.h | 67 class NodeIter; // Declared below variable
575 gtl::iterator_range<NodeIter> nodes() const;
578 gtl::iterator_range<NodeIter> op_nodes() const;
769 class NodeIter {
771 NodeIter(const Graph* graph, int id);
772 bool operator==(const NodeIter& rhs);
773 bool operator!=(const NodeIter& rhs);
801 inline NodeIter::NodeIter(const Graph* graph, int id) in NodeIter() function
804 inline bool NodeIter::operator==(const NodeIter& rhs) {
809 inline bool NodeIter::operator!=(const NodeIter& rhs) {
[all …]
|
| /external/llvm/include/llvm/Analysis/ |
| D | BlockFrequencyInfoImpl.h | 1250 typedef typename GTraits::nodes_iterator NodeIter;
1266 for (NodeIter I = GTraits::nodes_begin(Graph),
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
| D | BlockFrequencyInfoImpl.h | 1370 using NodeIter = typename GTraits::nodes_iterator;
1389 for (NodeIter I = GTraits::nodes_begin(Graph),
|