423 	vector<CaseTreeNode*>	nodeStack;  in parseCaseTrie()  local
430 	nodeStack.push_back(root);  in parseCaseTrie()
432 	while (!nodeStack.empty())  in parseCaseTrie()
447 					nodeStack.back()->addChild(newChild);  in parseCaseTrie()
456 					nodeStack.push_back(newChild);  in parseCaseTrie()
466 				nodeStack.pop_back();  in parseCaseTrie()
469 				if (nodeStack.empty())  in parseCaseTrie()
487 static void parseSimpleCaseList (vector<CaseTreeNode*>& nodeStack, std::istream& in, bool reportDup…  in parseSimpleCaseList()  argument
503 			if (!nodeStack[stackPos]->hasChild(curName))  in parseSimpleCaseList()
509 					nodeStack[stackPos]->addChild(newChild);  in parseSimpleCaseList()
538 			if ((int)nodeStack.size() <= stackPos+1)  in parseSimpleCaseList()
539 				nodeStack.resize(nodeStack.size()*2, DE_NULL);  in parseSimpleCaseList()
541 			if (!nodeStack[stackPos+1] || nodeStack[stackPos+1]->getName() != curName)  in parseSimpleCaseList()
543 				CaseTreeNode* curGroup = nodeStack[stackPos]->getChild(curName);  in parseSimpleCaseList()
551 						nodeStack[stackPos]->addChild(curGroup);  in parseSimpleCaseList()
560 				nodeStack[stackPos+1] = curGroup;  in parseSimpleCaseList()
562 				if ((int)nodeStack.size() > stackPos+2)  in parseSimpleCaseList()
563 					nodeStack[stackPos+2] = DE_NULL; // Invalidate rest of entries  in parseSimpleCaseList()
566 			DE_ASSERT(nodeStack[stackPos+1]->getName() == curName);  in parseSimpleCaseList()
580 	vector<CaseTreeNode*> nodeStack(8, root);  in parseCaseList()  local
581 	parseSimpleCaseList(nodeStack, in, reportDuplicates);  in parseCaseList()
590 	vector<CaseTreeNode*>	nodeStack(8, root);  in parseGroupFile()  local
606 		parseSimpleCaseList(nodeStack, groupIn, reportDuplicates);  in parseGroupFile()