606     vector<CaseTreeNode *> nodeStack;  in parseCaseTrie()  local
613     nodeStack.push_back(root);  in parseCaseTrie()
615     while (!nodeStack.empty())  in parseCaseTrie()
631                     nodeStack.back()->addChild(newChild);  in parseCaseTrie()
640                     nodeStack.push_back(newChild);  in parseCaseTrie()
650                 nodeStack.pop_back();  in parseCaseTrie()
653                 if (nodeStack.empty())  in parseCaseTrie()
671 static void parseSimpleCaseList(vector<CaseTreeNode *> &nodeStack, std::istream &in, bool reportDup…  in parseSimpleCaseList()  argument
689             if (!nodeStack[stackPos]->hasChild(hash))  in parseSimpleCaseList()
695                     nodeStack[stackPos]->addChild(newChild);  in parseSimpleCaseList()
724             if ((int)nodeStack.size() <= stackPos + 1)  in parseSimpleCaseList()
725                 nodeStack.resize(nodeStack.size() * 2, nullptr);  in parseSimpleCaseList()
728             if (!nodeStack[stackPos + 1] || nodeStack[stackPos + 1]->getHash() != hash)  in parseSimpleCaseList()
730                 CaseTreeNode *curGroup = nodeStack[stackPos]->getChild(hash);  in parseSimpleCaseList()
738                         nodeStack[stackPos]->addChild(curGroup);  in parseSimpleCaseList()
747                 nodeStack[stackPos + 1] = curGroup;  in parseSimpleCaseList()
749                 if ((int)nodeStack.size() > stackPos + 2)  in parseSimpleCaseList()
750                     nodeStack[stackPos + 2] = nullptr; // Invalidate rest of entries  in parseSimpleCaseList()
753             DE_ASSERT(nodeStack[stackPos + 1]->getHash() == hash);  in parseSimpleCaseList()
768     vector<CaseTreeNode *> nodeStack(8, root);  in parseCaseList()  local
769     parseSimpleCaseList(nodeStack, in, reportDuplicates, hashCollisionDetectionMap);  in parseCaseList()
780     vector<CaseTreeNode *> nodeStack(8, root);  in parseGroupFile()  local
796         parseSimpleCaseList(nodeStack, groupIn, reportDuplicates, hashCollisionDetectionMap);  in parseGroupFile()