Lines Matching defs:hash
336 * \brief Generates an hash for the test case name part provided.
337 * If a hashCollisionDetectionMap is passed, will detect hash
339 * As an example, the standard std::hash<std::string> on a 32-bit
344 test_case_hash_t hash = MurmurHash64B(name.c_str(), (int)name.length(), 1);
346 auto search = hashCollisionDetectionMap->find(hash);
349 print("There was an hash collision between '%s' and '%s'\n", search->second.c_str(), name.c_str());
353 hashCollisionDetectionMap->insert({hash, name});
355 return hash;
419 CaseTreeNode (const test_case_hash_t hash) : m_hash(hash) {}
425 bool hasChild (test_case_hash_t hash) const;
426 CaseTreeNode* getChild (test_case_hash_t hash) const;
436 int findChildNdx (test_case_hash_t hash) const;
448 int CaseTreeNode::findChildNdx (test_case_hash_t hash) const
452 if (m_children[ndx]->getHash() == hash)
458 inline bool CaseTreeNode::hasChild (test_case_hash_t hash) const
460 return findChildNdx(hash) != NOT_FOUND;
463 inline CaseTreeNode* CaseTreeNode::getChild (test_case_hash_t hash) const
465 const int ndx = findChildNdx(hash);
484 test_case_hash_t hash = hashTestNodeName(std::string(curPath, curPath + curLen), nullptr);
485 curNode = curNode->getChild(hash);
527 test_case_hash_t hash = hashTestNodeName(curName, &hashCollisionDetectionMap);
528 CaseTreeNode* const newChild = new CaseTreeNode(hash);
588 test_case_hash_t hash = hashTestNodeName(curName, &hashCollisionDetectionMap);
589 if (!nodeStack[stackPos]->hasChild(hash))
591 CaseTreeNode* const newChild = new CaseTreeNode(hash);
627 test_case_hash_t hash = hashTestNodeName(curName, &hashCollisionDetectionMap);
628 if (!nodeStack[stackPos+1] || nodeStack[stackPos+1]->getHash() != hash)
630 CaseTreeNode* curGroup = nodeStack[stackPos]->getChild(hash);
634 curGroup = new CaseTreeNode(hash);
653 DE_ASSERT(nodeStack[stackPos+1]->getHash() == hash);
701 test_case_hash_t hash = hashTestNodeName(rootName, &hashCollisionDetectionMap);
702 CaseTreeNode* const root = new CaseTreeNode(hash);