Home
last modified time | relevance | path

Searched refs:NodeIter (Results 1 – 7 of 7) sorted by relevance

/external/deqp/framework/common/
DtcuTestHierarchyIterator.cpp96 NodeIter iter(&rootNode); in TestHierarchyIterator()
97 iter.setState(NodeIter::NISTATE_ENTER); // Root is never reported in TestHierarchyIterator()
105 …for (vector<NodeIter>::reverse_iterator iter = m_sessionStack.rbegin(); iter != m_sessionStack.ren… in ~TestHierarchyIterator()
125 const NodeIter& iter = m_sessionStack.back(); in getState()
127 DE_ASSERT(iter.getState() == NodeIter::NISTATE_ENTER || in getState()
128 iter.getState() == NodeIter::NISTATE_LEAVE); in getState()
130 return iter.getState() == NodeIter::NISTATE_ENTER ? STATE_ENTER_NODE : STATE_LEAVE_NODE; in getState()
148 std::string TestHierarchyIterator::buildNodePath (const vector<NodeIter>& nodeStack) in buildNodePath()
153 const NodeIter& iter = nodeStack[ndx]; in buildNodePath()
165 NodeIter& iter = m_sessionStack.back(); in next()
[all …]
DtcuTestHierarchyIterator.hpp130 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/
Dsemistatic_graph.h97 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);
Dsemistatic_graph.templates.h59 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 …]
/external/tensorflow/tensorflow/core/graph/
Dgraph.h69 class NodeIter; // Declared below variable
601 gtl::iterator_range<NodeIter> nodes() const;
604 gtl::iterator_range<NodeIter> op_nodes() const;
799 class NodeIter
803 NodeIter(const Graph* graph, int id);
804 bool operator==(const NodeIter& rhs) const;
805 bool operator!=(const NodeIter& rhs) const;
835 inline NodeIter::NodeIter(const Graph* graph, int id) in NodeIter() function
838 inline bool NodeIter::operator==(const NodeIter& rhs) const {
843 inline bool NodeIter::operator!=(const NodeIter& rhs) const {
[all …]
/external/llvm/include/llvm/Analysis/
DBlockFrequencyInfoImpl.h1250 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/
DBlockFrequencyInfoImpl.h1370 using NodeIter = typename GTraits::nodes_iterator;
1389 for (NodeIter I = GTraits::nodes_begin(Graph),