/haiku/3rdparty/mmu_man/onlinedemo/ |
H A D | haiku.php | 852 window.location.hash = anchor;
|
/haiku/headers/cpp/ |
H A D | hash_map.h | 38 using __STD::hash;
|
H A D | hash_set.h | 38 using __STD::hash;
|
H A D | hashtable.h | 40 using __STD::hash;
|
H A D | stl_hash_fun.h | 38 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 D | stl_hash_map.h | 43 template <class _Key, class _Tp, class _HashFcn = hash<_Key>, 225 template <class _Key, class _Tp, class _HashFcn = hash<_Key>,
|
H A D | stl_hash_set.h | 42 template <class _Value, class _HashFcn = hash<_Value>, 221 template <class _Value, class _HashFcn = hash<_Value>,
|
H A D | stl_rope.h | 2506 __STL_TEMPLATE_NULL struct hash<crope> struct 2518 __STL_TEMPLATE_NULL struct hash<wrope> struct
|
/haiku/src/add-ons/kernel/busses/scsi/usb/ |
H A D | settings.c | 78 }hash; member in struct:_settings_key 111 #define SK_EQUAL(__name, __id) ((CAST_SK(__name) == (settings_keys[__id].hash.key)) && \ 112 (0 == strcmp(__name, settings_keys[__id].hash.name)))
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | Attribute.cpp | 150 uint32 hash = calculate_crc((uint32)~1, (uint8*)name, nameLength); local 154 key.SetOffset(hash); 162 TRACE("AttributeIterator::Lookup(): Couldn't find entry with hash %" 163 B_PRIu32 " \"%s\"\n", hash, name); 188 // TODO there could be several entries with the same name hash
|
H A D | DirectoryIterator.cpp | 85 // TODO there could be several entries with the same name hash 121 uint32 hash = calculate_crc((uint32)~1, (uint8*)name, nameLength); local 125 key.SetOffset(hash); 133 TRACE("DirectoryIterator::Lookup(): Couldn't find entry with hash %" B_PRIu32 134 " \"%s\"\n", hash, name); 143 // TODO there could be several entries with the same name hash
|
/haiku/src/add-ons/kernel/file_systems/ext2/ |
H A D | HTree.h | 62 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/add-ons/kernel/file_systems/netfs/client/ |
H A D | ShareVolume.cpp | 75 uint32 hash = (uint32)directoryID; local 76 hash = 31 * hash + (uint32)(directoryID >> 32); 77 hash = 31 * hash + string_hash(name); 78 return hash;
|
/haiku/src/add-ons/kernel/file_systems/netfs/server/ |
H A D | EntryRef.cpp | 37 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 D | Volume.cpp | 50 uint32 hash = (uint32)directoryID; local 51 hash = 31 * hash + (uint32)(directoryID >> 32); 52 hash = 31 * hash + string_hash(name); 53 return hash;
|
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | cache.c | 58 * Enter a new hash index, after a new record has been inserted 73 /* get a free link and insert at top of hash list */ 85 ntfs_log_error("No more hash entries," 91 ntfs_log_error("Illegal hash value," 100 * Drop a hash index when a record is about to be deleted 104 const struct CACHED_GENERIC *current, int hash) 110 if ((hash >= 0) && (hash < cache->max_hash)) { 112 link = cache->first_hash[hash]; 122 cache->first_hash[hash] 103 drophashindex(struct CACHE_HEADER *cache, const struct CACHED_GENERIC *current, int hash) argument [all...] |
/haiku/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | hashes.cpp | 3 * Keyed 32-bit hash function using TEA in a Davis-Meyer function 31 /* a, b, c, d - data; h0, h1 - accumulated hash */ 231 /* hash value occupies bits from 7 up to 30 */ 238 key_offset_for_name(hash_function_t hash, const char *name, int len) argument 247 res = (*hash)((const signed char*)name, len); 252 // needed to have no names before "." and ".." those have hash
|
H A D | hashes.h | 34 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/add-ons/translators/gif/ |
H A D | GIFSave.h | 63 SFHash* hash; member in class:GIFSave
|
H A D | SavePalette.cpp | 230 touch_color_item(SFHash& hash, unsigned int key, uint8 r, uint8 g, uint8 b) argument 232 ColorItem* ci = (ColorItem*)hash.GetItem(key); 240 hash.AddItem((HashItem*)ci); 268 SFHash hash(1 << 16); 269 if (hash.fatalerror) { 311 if (!touch_color_item(hash, key, r, g, b)) { 331 if (!touch_color_item(hash, key, r, g, b)) { 342 int unique_colors = hash.CountItems(); 360 ColorItem* ci = (ColorItem*)hash.NextItem();
|
/haiku/src/apps/pairs/ |
H A D | Pairs.cpp | 97 // 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/apps/webpositive/support/ |
H A D | HashKeys.h | 88 uint32 hash = 0; local 92 uint32 g = hash & 0xf0000000; 94 hash ^= g >> 24; 95 hash = (hash << 4) + *string; 98 return hash;
|
/haiku/src/bin/bfs_tools/lib/ |
H A D | Hashtable.cpp | 1 /* 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/debug_info/ |
H A D | DwarfStackFrameDebugInfo.cpp | 65 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...] |
H A D | TeamDebugInfo.cpp | 50 uint32 hash = StringUtils::HashValue(key->Name()); 51 hash = hash * 17 + (uint32)(addr_t)key->SourceFile(); 53 hash = hash * 17 + location.Line(); 54 hash = hash * 17 + location.Column(); 56 return hash; 317 // create function hash table 326 // create source file hash tabl [all...] |