Lines Matching defs:nodeStack
507 vector<CaseTreeNode*> nodeStack;
514 nodeStack.push_back(root);
516 while (!nodeStack.empty())
532 nodeStack.back()->addChild(newChild);
541 nodeStack.push_back(newChild);
551 nodeStack.pop_back();
554 if (nodeStack.empty())
572 static void parseSimpleCaseList (vector<CaseTreeNode*>& nodeStack, std::istream& in, bool reportDuplicates, std::unordered_map<test_case_hash_t, string> &hashCollisionDetectionMap)
589 if (!nodeStack[stackPos]->hasChild(hash))
595 nodeStack[stackPos]->addChild(newChild);
624 if ((int)nodeStack.size() <= stackPos+1)
625 nodeStack.resize(nodeStack.size()*2, DE_NULL);
628 if (!nodeStack[stackPos+1] || nodeStack[stackPos+1]->getHash() != hash)
630 CaseTreeNode* curGroup = nodeStack[stackPos]->getChild(hash);
638 nodeStack[stackPos]->addChild(curGroup);
647 nodeStack[stackPos+1] = curGroup;
649 if ((int)nodeStack.size() > stackPos+2)
650 nodeStack[stackPos+2] = DE_NULL; // Invalidate rest of entries
653 DE_ASSERT(nodeStack[stackPos+1]->getHash() == hash);
667 vector<CaseTreeNode*> nodeStack(8, root);
668 parseSimpleCaseList(nodeStack, in, reportDuplicates, hashCollisionDetectionMap);
677 vector<CaseTreeNode*> nodeStack(8, root);
693 parseSimpleCaseList(nodeStack, groupIn, reportDuplicates, hashCollisionDetectionMap);