Lines Matching refs:nodeStack
333 vector<CaseTreeNode*> nodeStack;
340 nodeStack.push_back(root);
342 while (!nodeStack.empty())
357 nodeStack.back()->addChild(newChild);
366 nodeStack.push_back(newChild);
376 nodeStack.pop_back();
379 if (nodeStack.empty())
401 vector<CaseTreeNode*> nodeStack;
405 nodeStack.resize(8, DE_NULL);
407 nodeStack[0] = root;
418 if (nodeStack[stackPos]->hasChild(curName))
425 nodeStack[stackPos]->addChild(newChild);
451 if ((int)nodeStack.size() <= stackPos+1)
452 nodeStack.resize(nodeStack.size()*2, DE_NULL);
454 if (!nodeStack[stackPos+1] || nodeStack[stackPos+1]->getName() != curName)
456 CaseTreeNode* curGroup = nodeStack[stackPos]->getChild(curName);
464 nodeStack[stackPos]->addChild(curGroup);
473 nodeStack[stackPos+1] = curGroup;
475 if ((int)nodeStack.size() > stackPos+2)
476 nodeStack[stackPos+2] = DE_NULL; // Invalidate rest of entries
479 DE_ASSERT(nodeStack[stackPos+1]->getName() == curName);