Searched refs:hashVal (Results 1 - 7 of 7) sorted by relevance

/haiku/src/tests/kits/locale/
H A DcatalogTestAddOn.cpp31 size_t hashVal = CatKey::HashFun(s.String()); local
42 res = cat1.SetString(hashVal, "Schnur_id_A");
60 s = cat1.GetString(hashVal);
100 size_t hashVal = CatKey::HashFun(s.String()); local
122 s = B_TRANSLATE_ID(hashVal);
H A DcatalogTest.cpp38 size_t hashVal = CatKey::HashFun(s.String()); local
49 res = cata.SetString(hashVal, "Schnur_id");
67 s = cata.GetString(hashVal);
108 size_t hashVal = CatKey::HashFun(s.String()); local
128 s = B_TRANSLATE_ID(hashVal);
/haiku/src/add-ons/kernel/file_systems/xfs/
H A DInode.cpp757 * previous hashVal after rotating 4 bits of hashVal. Likewise, continue
763 uint32 hashVal = 0; local
770 hashVal = (name[index] << 21) ^ (name[index + 1] << 14)
772 ^ ((hashVal << 28) | (hashVal >> 4));
778 hashVal = (name[index] << 14) ^ (name[index + 1] << 7)
779 ^ (name[index + 2] << 0) ^ ((hashVal << 21) | (hashVal >> 11));
782 hashVal
[all...]
H A DBPlusTree.h143 uint32 SearchForHashInNodeBlock(uint32 hashVal);
H A DNode.h107 status_t FindHashInNode(uint32 hashVal, uint32* rightMapOffset);
H A DNode.cpp201 NodeDirectory::FindHashInNode(uint32 hashVal, uint32* rightMapOffset) argument
216 if (hashVal <= B_BENDIAN_TO_HOST_INT32(entry[i].hashval)) {
H A DBPlusTree.cpp630 TreeDirectory::SearchForHashInNodeBlock(uint32 hashVal) argument
640 if (hashVal <= B_BENDIAN_TO_HOST_INT32(entry[i].hashval))

Completed in 51 milliseconds