Searched refs:nodeStack (Results 1 – 12 of 12) sorted by relevance
388 vector<CaseTreeNode*> nodeStack; in parseCaseTrie() local395 nodeStack.push_back(root); in parseCaseTrie()397 while (!nodeStack.empty()) in parseCaseTrie()412 nodeStack.back()->addChild(newChild); in parseCaseTrie()421 nodeStack.push_back(newChild); in parseCaseTrie()431 nodeStack.pop_back(); in parseCaseTrie()434 if (nodeStack.empty()) in parseCaseTrie()452 static void parseSimpleCaseList (vector<CaseTreeNode*>& nodeStack, std::istream& in, bool reportDup… in parseSimpleCaseList() argument468 if (!nodeStack[stackPos]->hasChild(curName)) in parseSimpleCaseList()474 nodeStack[stackPos]->addChild(newChild); in parseSimpleCaseList()[all …]
151 std::string TestHierarchyIterator::buildNodePath (const vector<NodeIter>& nodeStack) in buildNodePath() argument154 for (size_t ndx = 1; ndx < nodeStack.size(); ndx++) in buildNodePath()156 const NodeIter& iter = nodeStack[ndx]; in buildNodePath()
190 static std::string buildNodePath (const std::vector<NodeIter>& nodeStack);
871 std::vector<CommandGraphNode *> nodeStack; in submitCommands() local890 nodeStack.push_back(topLevelNode); in submitCommands()892 while (!nodeStack.empty()) in submitCommands()894 CommandGraphNode *node = nodeStack.back(); in submitCommands()899 node->visitParents(&nodeStack); in submitCommands()904 nodeStack.pop_back(); in submitCommands()907 nodeStack.pop_back(); in submitCommands()
306 ConsList<TIntermNode *> &nodeStack; member307 NodeStackGuard(ConsList<TIntermNode *> &nodeStack) in NodeStackGuard()308 : oldNodeStack(nodeStack), nodeStack(nodeStack) in NodeStackGuard()310 ~NodeStackGuard() { nodeStack = oldNodeStack; } in ~NodeStackGuard()
2557 const nodeStack = [node]; constant2561 node = nodeStack[stackIndex];2611 nodeStack[stackIndex] = next;
84237 var nodeStack = [node];84241 node = nodeStack[stackIndex];84279 nodeStack[stackIndex] = next;
102930 var nodeStack = [node];102934 node = nodeStack[stackIndex];102979 nodeStack[stackIndex] = next;
103135 var nodeStack = [node];103139 node = nodeStack[stackIndex];103184 nodeStack[stackIndex] = next;
102941 var nodeStack = [node];102945 node = nodeStack[stackIndex];102990 nodeStack[stackIndex] = next;