507 	vector<CaseTreeNode*>	nodeStack;  in parseCaseTrie()  local
514 	nodeStack.push_back(root);  in parseCaseTrie()
516 	while (!nodeStack.empty())  in parseCaseTrie()
532 					nodeStack.back()->addChild(newChild);  in parseCaseTrie()
541 					nodeStack.push_back(newChild);  in parseCaseTrie()
551 				nodeStack.pop_back();  in parseCaseTrie()
554 				if (nodeStack.empty())  in parseCaseTrie()
572 static void parseSimpleCaseList (vector<CaseTreeNode*>& nodeStack, std::istream& in, bool reportDup…  in parseSimpleCaseList()  argument
589 			if (!nodeStack[stackPos]->hasChild(hash))  in parseSimpleCaseList()
595 					nodeStack[stackPos]->addChild(newChild);  in parseSimpleCaseList()
624 			if ((int)nodeStack.size() <= stackPos+1)  in parseSimpleCaseList()
625 				nodeStack.resize(nodeStack.size()*2, DE_NULL);  in parseSimpleCaseList()
628 			if (!nodeStack[stackPos+1] || nodeStack[stackPos+1]->getHash() != hash)  in parseSimpleCaseList()
630 				CaseTreeNode* curGroup = nodeStack[stackPos]->getChild(hash);  in parseSimpleCaseList()
638 						nodeStack[stackPos]->addChild(curGroup);  in parseSimpleCaseList()
647 				nodeStack[stackPos+1] = curGroup;  in parseSimpleCaseList()
649 				if ((int)nodeStack.size() > stackPos+2)  in parseSimpleCaseList()
650 					nodeStack[stackPos+2] = DE_NULL; // Invalidate rest of entries  in parseSimpleCaseList()
653 			DE_ASSERT(nodeStack[stackPos+1]->getHash() == hash);  in parseSimpleCaseList()
667 	vector<CaseTreeNode*> nodeStack(8, root);  in parseCaseList()  local
668 	parseSimpleCaseList(nodeStack, in, reportDuplicates, hashCollisionDetectionMap);  in parseCaseList()
677 	vector<CaseTreeNode*>	nodeStack(8, root);  in parseGroupFile()  local
693 		parseSimpleCaseList(nodeStack, groupIn, reportDuplicates, hashCollisionDetectionMap);  in parseGroupFile()