585     vector<CaseTreeNode *> nodeStack;  in parseCaseTrie()  local
592     nodeStack.push_back(root);  in parseCaseTrie()
594     while (!nodeStack.empty())  in parseCaseTrie()
610                     nodeStack.back()->addChild(newChild);  in parseCaseTrie()
619                     nodeStack.push_back(newChild);  in parseCaseTrie()
629                 nodeStack.pop_back();  in parseCaseTrie()
632                 if (nodeStack.empty())  in parseCaseTrie()
650 static void parseSimpleCaseList(vector<CaseTreeNode *> &nodeStack, std::istream &in, bool reportDup…  in parseSimpleCaseList()  argument
668             if (!nodeStack[stackPos]->hasChild(hash))  in parseSimpleCaseList()
674                     nodeStack[stackPos]->addChild(newChild);  in parseSimpleCaseList()
703             if ((int)nodeStack.size() <= stackPos + 1)  in parseSimpleCaseList()
704                 nodeStack.resize(nodeStack.size() * 2, DE_NULL);  in parseSimpleCaseList()
707             if (!nodeStack[stackPos + 1] || nodeStack[stackPos + 1]->getHash() != hash)  in parseSimpleCaseList()
709                 CaseTreeNode *curGroup = nodeStack[stackPos]->getChild(hash);  in parseSimpleCaseList()
717                         nodeStack[stackPos]->addChild(curGroup);  in parseSimpleCaseList()
726                 nodeStack[stackPos + 1] = curGroup;  in parseSimpleCaseList()
728                 if ((int)nodeStack.size() > stackPos + 2)  in parseSimpleCaseList()
729                     nodeStack[stackPos + 2] = DE_NULL; // Invalidate rest of entries  in parseSimpleCaseList()
732             DE_ASSERT(nodeStack[stackPos + 1]->getHash() == hash);  in parseSimpleCaseList()
747     vector<CaseTreeNode *> nodeStack(8, root);  in parseCaseList()  local
748     parseSimpleCaseList(nodeStack, in, reportDuplicates, hashCollisionDetectionMap);  in parseCaseList()
759     vector<CaseTreeNode *> nodeStack(8, root);  in parseGroupFile()  local
775         parseSimpleCaseList(nodeStack, groupIn, reportDuplicates, hashCollisionDetectionMap);  in parseGroupFile()