Searched refs:hash (Results 1 - 25 of 87) sorted by relevance

1234

/haiku/src/system/kernel/util/
H A DStringHash.cpp16 uint32 hash = 0; local
19 // we assume hash to be at least 32 bits
21 hash ^= hash >> 28;
22 hash <<= 4;
23 hash ^= c;
26 return hash;
33 uint32 hash = 0; local
36 // we assume hash to be at least 32 bits
38 hash
[all...]
/haiku/headers/cpp/
H A Dstl_hash_fun.h38 template <class _Key> struct hash { }; struct
49 __STL_TEMPLATE_NULL struct hash<char*> struct
54 __STL_TEMPLATE_NULL struct hash<const char*> struct
59 __STL_TEMPLATE_NULL struct hash<char> { struct
62 __STL_TEMPLATE_NULL struct hash<unsigned char> { struct
65 __STL_TEMPLATE_NULL struct hash<signed char> { struct
68 __STL_TEMPLATE_NULL struct hash<short> { struct
71 __STL_TEMPLATE_NULL struct hash<unsigned short> { struct
74 __STL_TEMPLATE_NULL struct hash<int> { struct
77 __STL_TEMPLATE_NULL struct hash<unsigne struct
80 __STL_TEMPLATE_NULL struct hash<long> { struct
83 __STL_TEMPLATE_NULL struct hash<unsigned long> { struct
[all...]
H A Dhashtable.h40 using __STD::hash;
H A Dhash_map.h38 using __STD::hash;
H A Dhash_set.h38 using __STD::hash;
/haiku/src/add-ons/kernel/file_systems/netfs/server/
H A DEntryRef.cpp37 uint32 hash = device; local
38 hash = 17 * hash + (uint32)(directory >> 32);
39 hash = 17 * hash + (uint32)directory;
40 hash = 17 * hash + string_hash(name);
41 return hash;
H A DVolume.cpp50 uint32 hash = (uint32)directoryID; local
51 hash = 31 * hash + (uint32)(directoryID >> 32);
52 hash = 31 * hash + string_hash(name);
53 return hash;
/haiku/src/apps/terminal/
H A DColors.cpp122 // use binary search to lookup color name hash in table
125 uint32 hash = _HashName(name); local
128 ((fTable[i].hash < hash) ? left : right) = i;
131 if (fTable[right].hash == hash) {
162 uint32 hash = 0; local
165 // Using modified P.J.Weinberger hash algorithm
176 hash = (hash <<
[all...]
/haiku/src/apps/webpositive/support/
H A DHashKeys.h88 uint32 hash = 0; local
92 uint32 g = hash & 0xf0000000;
94 hash ^= g >> 24;
95 hash = (hash << 4) + *string;
98 return hash;
/haiku/src/tools/fs_shell/
H A Dhash.cpp1 /* Generic hash table
7 #include "hash.h"
31 // resizing should be optional, though, in case the hash is used at times
113 uint32_t hash; local
118 hash = table->hash_func(element, NULL, table->table_size);
119 PUT_IN_NEXT(table, element, table->table[hash]);
120 table->table[hash] = (struct hash_element *)element;
123 // ToDo: resize hash table if it's grown too much!
132 uint32_t hash = table->hash_func(_element, NULL, table->table_size); local
135 for (element = table->table[hash]; elemen
211 uint32_t hash = table->hash_func(searchedElement, NULL, table->table_size); local
226 uint32_t hash = table->hash_func(NULL, key, table->table_size); local
297 uint32_t hash = 0; local
[all...]
/haiku/src/add-ons/kernel/file_systems/reiserfs/
H A Dhashes.h34 the rightmost entry with the same hash value as the supplied name
35 (if any). Walking backwards will find all other entries with that hash.
44 uint32 key_offset_for_name(hash_function_t hash, const char *name, int len);
/haiku/src/servers/package/
H A DPackageFile.h97 size_t hash = BString::HashValue(key.name); local
98 hash ^= (size_t)key.device;
99 hash ^= (size_t)key.directory;
100 return hash;
/haiku/src/apps/pairs/
H A DPairs.cpp97 // into a std::map keyed by a generated hash.
117 size_t hash = 0xdeadbeef; local
119 hash = 31 * hash + data[i];
121 if (fIconMap.find(hash) != fIconMap.end()) {
138 fIconMap[hash] = icon;
/haiku/src/bin/bfs_tools/lib/
H A DHashtable.cpp1 /* Hashtable - a general purpose hash table
15 /************************** standard string hash functions **************************/
112 int hash = fHashFunc(key); local
122 index = hash % fCapacity;
134 uint32 hash,(*func)(const void *); local
138 hash = (func = fHashFunc)(key);
139 index = hash % fCapacity;
143 if ((func(entry->key) == hash) && fCompareFunc(entry->key,key))
238 /** The hash table will be doubled in size, and rebuild.
280 uint32 hash,(*fun local
[all...]
/haiku/src/kits/debugger/model/
H A DTypeComponentPath.cpp34 uint32 hash = ((uint32)index << 8) | (componentKind << 4) | typeKind; local
35 return StringUtils::HashValue(name) * 13 + hash;
192 uint32 hash = fComponents.ItemAt(0)->HashValue();
195 hash = hash * 17 + fComponents.ItemAt(i)->HashValue();
197 return hash;
/haiku/src/kits/debugger/debug_info/
H A DDwarfStackFrameDebugInfo.cpp65 uint32 hash = fFunctionID->HashValue(); local
66 return hash * 19 + StringUtils::HashValue(fName);
108 uint32 hash = fFunctionID->HashValue(); local
109 hash = hash * 19 + StringUtils::HashValue(fName);
110 hash = hash * 19 + fLine;
111 hash = hash * 19 + fColumn;
112 return hash;
154 uint32 hash = fFunctionID->HashValue(); local
[all...]
/haiku/src/system/kernel/fs/
H A DEntryCache.h23 hash = (uint32)dir_id ^ (uint32)(dir_id >> 32) ^ hash_hash_string(name);
24 // We cache the hash value, so we can easily compute it before
30 size_t hash; member in struct:EntryCacheKey
63 return key.hash;
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DHTree.cpp130 uint32 hash = Hash(name, nameLength); local
148 status = fRootEntry->Lookup(hash, (uint32)root->indirection_levels,
162 uint32 hash; local
167 hash = _HashLegacy(name, length);
170 hash = _HashHalfMD4(name, length);
173 hash = _HashTEA(name, length);
177 hash = 0;
180 hash = 0;
183 TRACE("HTree::_Hash(): filename hash 0x%" B_PRIx32 "\n", hash);
193 uint32 hash = 0x12a3fe2d; local
[all...]
H A DHTreeEntryIterator.h28 status_t Lookup(uint32 hash, int indirections,
37 uint32 hash, off_t block,
H A DHTree.h62 uint32 hash; member in struct:HTreeEntry
66 { return B_LENDIAN_TO_HOST_INT32(hash); }
71 { hash = B_HOST_TO_LENDIAN_INT32(newHash); }
105 * Original MD4 hash: (Modified version used)
127 status_t _LookupInNode(uint32 hash, off_t& firstEntry,
/haiku/src/system/runtime_loader/
H A Delf_symbol_lookup.h25 uint32 hash; member in struct:SymbolLookupInfo
30 SymbolLookupInfo(const char* name, int32 type, uint32 hash, argument
36 hash(hash),
49 hash(elf_hash(name)),
/haiku/src/system/libroot/posix/musl/search/
H A Dhsearch.c8 open addressing hash table with 2^n table size
9 quadratic probing is used in case of hash collision
10 tab indices and hash are size_t
91 static ENTRY *lookup(char *key, size_t hash, struct hsearch_data *htab) argument
96 for (i=hash,j=1; ; i+=j++) {
138 size_t hash = keyhash(item.key); local
139 ENTRY *e = lookup(item.key, hash, htab);
157 e = lookup(item.key, hash, htab);
/haiku/src/libs/compat/freebsd_wlan/net80211/
H A Dieee80211_acl.c89 /* simple hash is enough for variation of macaddr */
136 int hash; local
138 hash = ACL_HASH(macaddr);
139 LIST_FOREACH(acl, &as->as_hash[hash], acl_hash) {
179 int hash; local
191 hash = ACL_HASH(mac);
192 LIST_FOREACH(acl, &as->as_hash[hash], acl_hash) {
204 LIST_INSERT_HEAD(&as->as_hash[hash], new, acl_hash);
/haiku/headers/private/userlandfs/private/
H A DFSCapabilities.h221 uint32 hash = 0; local
223 hash ^= capabilities.test(i) << (i % 32);
224 return hash;
/haiku/src/system/boot/loader/file_systems/amiga_ffs/
H A Damiga_ffs.cpp92 int32 hash = strlen(name); local
95 hash = (hash * 13 + ToUpperChar(type, name[0])) & 0x7ff;
99 return hash % HashSize();

Completed in 178 milliseconds

1234