Lines Matching defs:iter
99 NodeIter iter(&rootNode);
100 iter.setState(NodeIter::NISTATE_ENTER); // Root is never reported
101 m_sessionStack.push_back(iter);
108 for (vector<NodeIter>::reverse_iterator iter = m_sessionStack.rbegin(); iter != m_sessionStack.rend(); ++iter)
110 TestNode* const node = iter->node;
128 const NodeIter& iter = m_sessionStack.back();
130 DE_ASSERT(iter.getState() == NodeIter::NISTATE_ENTER ||
131 iter.getState() == NodeIter::NISTATE_LEAVE);
133 return iter.getState() == NodeIter::NISTATE_ENTER ? STATE_ENTER_NODE : STATE_LEAVE_NODE;
156 const NodeIter& iter = nodeStack[ndx];
159 nodePath += iter.node->getName();
168 NodeIter& iter = m_sessionStack.back();
169 TestNode* const node = iter.node;
172 switch (iter.getState())
187 iter.setState(NodeIter::NISTATE_ENTER);
195 iter.setState(NodeIter::NISTATE_LEAVE);
200 iter.setState(NodeIter::NISTATE_TRAVERSE_CHILDREN);
201 iter.children.clear();
205 case NODETYPE_ROOT: static_cast<TestPackageRoot*>(node)->getChildren(iter.children); break;
206 case NODETYPE_PACKAGE: m_inflater.enterTestPackage(static_cast<TestPackage*>(node), iter.children); break;
207 case NODETYPE_GROUP: m_inflater.enterGroupNode(static_cast<TestCaseGroup*>(node), iter.children); break;
218 int numChildren = (int)iter.children.size();
219 if (++iter.curChildNdx < numChildren)
222 TestNode* childNode = iter.children[iter.curChildNdx];
236 iter.setState(NodeIter::NISTATE_LEAVE);