388 	vector<CaseTreeNode*>	nodeStack;  in parseCaseTrie()  local
395 	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()  argument
468 			if (!nodeStack[stackPos]->hasChild(curName))  in parseSimpleCaseList()
474 					nodeStack[stackPos]->addChild(newChild);  in parseSimpleCaseList()
503 			if ((int)nodeStack.size() <= stackPos+1)  in parseSimpleCaseList()
504 				nodeStack.resize(nodeStack.size()*2, DE_NULL);  in parseSimpleCaseList()
506 			if (!nodeStack[stackPos+1] || nodeStack[stackPos+1]->getName() != curName)  in parseSimpleCaseList()
508 				CaseTreeNode* curGroup = nodeStack[stackPos]->getChild(curName);  in parseSimpleCaseList()
516 						nodeStack[stackPos]->addChild(curGroup);  in parseSimpleCaseList()
525 				nodeStack[stackPos+1] = curGroup;  in parseSimpleCaseList()
527 				if ((int)nodeStack.size() > stackPos+2)  in parseSimpleCaseList()
528 					nodeStack[stackPos+2] = DE_NULL; // Invalidate rest of entries  in parseSimpleCaseList()
531 			DE_ASSERT(nodeStack[stackPos+1]->getName() == curName);  in parseSimpleCaseList()
545 	vector<CaseTreeNode*> nodeStack(8, root);  in parseCaseList()  local
546 	parseSimpleCaseList(nodeStack, in, reportDuplicates);  in parseCaseList()
555 	vector<CaseTreeNode*>	nodeStack(8, root);  in parseGroupFile()  local
571 		parseSimpleCaseList(nodeStack, groupIn, reportDuplicates);  in parseGroupFile()