Lines Matching refs:nodeStack
345 vector<CaseTreeNode*> nodeStack; in parseCaseTrie() local
352 nodeStack.push_back(root); in parseCaseTrie()
354 while (!nodeStack.empty()) in parseCaseTrie()
369 nodeStack.back()->addChild(newChild); in parseCaseTrie()
378 nodeStack.push_back(newChild); in parseCaseTrie()
388 nodeStack.pop_back(); in parseCaseTrie()
391 if (nodeStack.empty()) in parseCaseTrie()
413 vector<CaseTreeNode*> nodeStack; in parseCaseList() local
417 nodeStack.resize(8, DE_NULL); in parseCaseList()
419 nodeStack[0] = root; in parseCaseList()
430 if (nodeStack[stackPos]->hasChild(curName)) in parseCaseList()
437 nodeStack[stackPos]->addChild(newChild); in parseCaseList()
463 if ((int)nodeStack.size() <= stackPos+1) in parseCaseList()
464 nodeStack.resize(nodeStack.size()*2, DE_NULL); in parseCaseList()
466 if (!nodeStack[stackPos+1] || nodeStack[stackPos+1]->getName() != curName) in parseCaseList()
468 CaseTreeNode* curGroup = nodeStack[stackPos]->getChild(curName); in parseCaseList()
476 nodeStack[stackPos]->addChild(curGroup); in parseCaseList()
485 nodeStack[stackPos+1] = curGroup; in parseCaseList()
487 if ((int)nodeStack.size() > stackPos+2) in parseCaseList()
488 nodeStack[stackPos+2] = DE_NULL; // Invalidate rest of entries in parseCaseList()
491 DE_ASSERT(nodeStack[stackPos+1]->getName() == curName); in parseCaseList()