Lines Matching defs:root
476 static const CaseTreeNode* findNode (const CaseTreeNode* root, const char* path)
478 const CaseTreeNode* curNode = root;
505 static void parseCaseTrie (CaseTreeNode* root, std::istream& in, std::unordered_map<test_case_hash_t, string> &hashCollisionDetectionMap)
514 nodeStack.push_back(root);
665 static void parseCaseList (CaseTreeNode* root, std::istream& in, bool reportDuplicates, std::unordered_map<test_case_hash_t, string> &hashCollisionDetectionMap)
667 vector<CaseTreeNode*> nodeStack(8, root);
671 static void parseGroupFile(CaseTreeNode* root, std::istream& inGroupList, const tcu::Archive& archive, bool reportDuplicates, std::unordered_map<test_case_hash_t, string> &hashCollisionDetectionMap)
677 vector<CaseTreeNode*> nodeStack(8, root);
702 CaseTreeNode* const root = new CaseTreeNode(hash);
706 parseCaseTrie(root, in, hashCollisionDetectionMap);
729 parseGroupFile(root, in, archive, true, hashCollisionDetectionMap);
731 parseCaseList(root, in, true, hashCollisionDetectionMap);
740 return root;
744 delete root;
1231 static bool checkTestGroupName (const CaseTreeNode* root, const char* groupPath)
1233 const CaseTreeNode* node = findNode(root, groupPath);
1237 static bool checkTestCaseName (const CaseTreeNode* root, const char* casePath)
1239 const CaseTreeNode* node = findNode(root, casePath);