Lines Matching refs:nodeStack
362 vector<CaseTreeNode*> nodeStack; in parseCaseTrie() local
369 nodeStack.push_back(root); in parseCaseTrie()
371 while (!nodeStack.empty()) in parseCaseTrie()
386 nodeStack.back()->addChild(newChild); in parseCaseTrie()
395 nodeStack.push_back(newChild); in parseCaseTrie()
405 nodeStack.pop_back(); in parseCaseTrie()
408 if (nodeStack.empty()) in parseCaseTrie()
430 vector<CaseTreeNode*> nodeStack; in parseCaseList() local
434 nodeStack.resize(8, DE_NULL); in parseCaseList()
436 nodeStack[0] = root; in parseCaseList()
447 if (nodeStack[stackPos]->hasChild(curName)) in parseCaseList()
454 nodeStack[stackPos]->addChild(newChild); in parseCaseList()
480 if ((int)nodeStack.size() <= stackPos+1) in parseCaseList()
481 nodeStack.resize(nodeStack.size()*2, DE_NULL); in parseCaseList()
483 if (!nodeStack[stackPos+1] || nodeStack[stackPos+1]->getName() != curName) in parseCaseList()
485 CaseTreeNode* curGroup = nodeStack[stackPos]->getChild(curName); in parseCaseList()
493 nodeStack[stackPos]->addChild(curGroup); in parseCaseList()
502 nodeStack[stackPos+1] = curGroup; in parseCaseList()
504 if ((int)nodeStack.size() > stackPos+2) in parseCaseList()
505 nodeStack[stackPos+2] = DE_NULL; // Invalidate rest of entries in parseCaseList()
508 DE_ASSERT(nodeStack[stackPos+1]->getName() == curName); in parseCaseList()