Lines Matching refs:nodeStack
381 vector<CaseTreeNode*> nodeStack; in parseCaseTrie() local
388 nodeStack.push_back(root); in parseCaseTrie()
390 while (!nodeStack.empty()) in parseCaseTrie()
405 nodeStack.back()->addChild(newChild); in parseCaseTrie()
414 nodeStack.push_back(newChild); in parseCaseTrie()
424 nodeStack.pop_back(); in parseCaseTrie()
427 if (nodeStack.empty()) in parseCaseTrie()
449 vector<CaseTreeNode*> nodeStack; in parseCaseList() local
453 nodeStack.resize(8, DE_NULL); in parseCaseList()
455 nodeStack[0] = root; in parseCaseList()
466 if (!nodeStack[stackPos]->hasChild(curName)) in parseCaseList()
472 nodeStack[stackPos]->addChild(newChild); in parseCaseList()
501 if ((int)nodeStack.size() <= stackPos+1) in parseCaseList()
502 nodeStack.resize(nodeStack.size()*2, DE_NULL); in parseCaseList()
504 if (!nodeStack[stackPos+1] || nodeStack[stackPos+1]->getName() != curName) in parseCaseList()
506 CaseTreeNode* curGroup = nodeStack[stackPos]->getChild(curName); in parseCaseList()
514 nodeStack[stackPos]->addChild(curGroup); in parseCaseList()
523 nodeStack[stackPos+1] = curGroup; in parseCaseList()
525 if ((int)nodeStack.size() > stackPos+2) in parseCaseList()
526 nodeStack[stackPos+2] = DE_NULL; // Invalidate rest of entries in parseCaseList()
529 DE_ASSERT(nodeStack[stackPos+1]->getName() == curName); in parseCaseList()