/haiku/src/system/kernel/arch/ppc/paging/classic/ |
H A D | PPCVMTranslationMapClassic.cpp | 292 // Search for the page table entry using the primary hash value 294 uint32 hash = page_table_entry::PrimaryHash(virtualSegmentID, virtualAddress); local 295 page_table_entry_group *group = &(m->PageTable())[hash & m->PageTableHashMask()]; 306 // didn't find it, try the secondary hash value 308 hash = page_table_entry::SecondaryHash(hash); 309 group = &(m->PageTable())[hash & m->PageTableHashMask()]; 369 // Search for a free page table slot using the primary hash value 370 uint32 hash = page_table_entry::PrimaryHash(virtualSegmentID, virtualAddress); local 371 page_table_entry_group *group = &(m->PageTable())[hash [all...] |
/haiku/src/system/kernel/arch/ppc/paging/460/ |
H A D | PPCVMTranslationMap460.cpp | 292 // Search for the page table entry using the primary hash value 294 uint32 hash = page_table_entry::PrimaryHash(virtualSegmentID, virtualAddress); local 295 page_table_entry_group *group = &(m->PageTable())[hash & m->PageTableHashMask()]; 306 // didn't find it, try the secondary hash value 308 hash = page_table_entry::SecondaryHash(hash); 309 group = &(m->PageTable())[hash & m->PageTableHashMask()]; 369 // Search for a free page table slot using the primary hash value 370 uint32 hash = page_table_entry::PrimaryHash(virtualSegmentID, virtualAddress); local 371 page_table_entry_group *group = &(m->PageTable())[hash [all...] |
/haiku/src/add-ons/translators/gif/ |
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();
|
H A D | GIFSave.cpp | 199 hash = new(std::nothrow) SFHash(1 << 16); 200 if (hash == NULL) { 226 delete hash; 584 ColorCache* cc = (ColorCache*)hash->GetItem(key); 589 hash->AddItem((HashItem*)cc);
|
/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
|
/haiku/src/add-ons/kernel/drivers/network/ether/usb_davicom/ |
H A D | DavicomDevice.cpp | 765 uint32 hash = _EthernetCRC32(group->ebyte, 6); local 766 bool isInTable = fMulticastHashes.Find(hash) != fMulticastHashes.End(); 787 fMulticastHashes.PushBack(hash); 789 fMulticastHashes.Remove(hash); 792 uint32 hash = fMulticastHashes[i] >> 26; local 793 hashTable[hash / 8] |= 1 << (hash % 8); 817 TRACE_ALWAYS("Error writing hash table in MAR: %#010x.\n", result);
|
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | security.c | 103 le32 hash; member in struct:SII 122 le32 hash; member in struct:SDH 387 * ntfs_security_hash - calculate the hash of a security descriptor 388 * @sd: self-relative security descriptor whose hash to calculate 391 * Calculate the hash of the self-relative security descriptor @sd of length 394 * This hash is used in the $Secure system file as the primary key for the $SDH 400 * Return the calculated security hash in little endian. 406 u32 hash = 0; local 409 hash = le32_to_cpup(pos) + ntfs_rol32(hash, 484 entersecurity_data(ntfs_volume *vol, const SECURITY_DESCRIPTOR_RELATIVE *attr, s64 attrsz, le32 hash, le32 keyid, off_t offs, int gap) argument 549 entersecurity_indexes(ntfs_volume *vol, s64 attrsz, le32 hash, le32 keyid, off_t offs) argument 627 entersecurityattr(ntfs_volume *vol, const SECURITY_DESCRIPTOR_RELATIVE *attr, s64 attrsz, le32 hash) argument 848 le32 hash; local [all...] |
H A D | compress.c | 82 /* log base 2 of the number of entries in the hash table for match-finding. */ 85 /* Constant for the multiplicative hash function. */ 104 u32 hash; local 114 hash = str * HASH_MULTIPLIER; 117 return hash >> (32 - HASH_SHIFT); 123 * A hash table, each entry of which points to a chain of sequence 124 * positions sharing the corresponding hash code, is maintained to speed up 125 * searching for matches. To maintain the hash table, either 159 unsigned int hash; local 167 /* Insert the current sequence into the appropriate hash chai 250 unsigned int hash; local [all...] |
H A D | layout.h | 538 * COLLATION_NTOFS_SECURITY_HASH - Sorting is done first by ascending hash 1901 * A simple hash is computed from each security descriptor. This hash is used 1904 * The $SDH index is sorted by security descriptor hash and is stored in a B+ 1907 * matching hash is found, but the security descriptors do not match, the 1908 * search in the $SDH index is continued, searching for a next matching hash. 1933 le32 hash; /* Hash of the security descriptor. */ member in struct:__anon69 1943 le32 hash; /* Hash of the security descriptor. */ member in struct:__anon70 1972 le32 hash; /* Hash of the security descriptor. */ member in struct:__anon71 1992 * The keys are sorted first by hash an 1996 le32 hash; /* Hash of the security descriptor. */ member in struct:__anon73 [all...] |
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | Inode.cpp | 471 uint32 hash = calculate_crc((uint32)~1, (uint8*)name, nameLength); 487 entry.key.SetOffset(hash); 532 uint32 hash = calculate_crc((uint32)~1, (uint8*)name, strlen(name)); 535 key.SetOffset(hash);
|
/haiku/src/add-ons/kernel/file_systems/netfs/server/ |
H A D | VolumeManager.cpp | 151 uint32 hash = EntryRef::GetHashCode(); local 152 hash = 17 * hash + (uint32)(toDirectory >> 32); 153 hash = 17 * hash + (uint32)toDirectory; 154 hash = 17 * hash + string_hash(toName.GetString()); 155 return hash;
|
/haiku/src/system/kernel/ |
H A D | elf.cpp | 307 uint32 hash = 0; local 311 hash = (hash << 4) + (uint8)*name++; 312 if ((temp = hash & 0xf0000000) != 0) 313 hash ^= temp >> 24; 314 hash &= ~temp; 316 return hash; 615 uint32 hash = elf_hash(name) % HASHTABSIZE(image); local 616 for (uint32 i = HASHBUCKETS(image)[hash]; i != STN_UNDEF; 659 if (version.hash [all...] |
H A D | port.cpp | 60 // * sPortsLock: Protects the sPorts and sPortsByName hash tables. 67 // and removing ports to the hash tables and the team port list. 69 // fashion, so a port can be in the hash table but not in the team port list 80 // physical deletion removes the port from hash tables and team port list. 147 // id is initialized when the caller adds the port to the hash table 198 // Hash function: hash(key) = key[0] * 31^(length - 1) 203 size_t hash = 0; local 205 hash = 31 * hash + key[index]; 207 return hash; 212 size_t& hash = value->name_hash; local [all...] |
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/beos/ |
H A D | fs_cache.c | 7 The cache is organized as a hash table (for lookups by device 257 fs_off_t hash; local 275 hash = he->hash_val & newmask; 278 he->next = new_table[hash]; 279 new_table[hash] = he; 297 fs_off_t hash; local 300 hash = HASH(dev, bnum) & ht->mask; 302 curr = ht->table[hash]; 308 printf("entry %d:%" B_PRIdOFF " already in the hash table!\n", 317 he->next = ht->table[hash]; 352 fs_off_t hash; local [all...] |
/haiku/src/add-ons/kernel/file_systems/fat/ |
H A D | dir.cpp | 51 uint8 hash = 0; local 101 hash = buffer[0xd]; 117 if (buffer[0xd] != hash) { 118 dprintf("error in long file name: hash values don't match\n"); 163 } else if (hash_msdos_name((const char *)buffer) != hash) { 164 dprintf("error: long file name (%s) hash and short file name " 578 uint8 *buffer, hash; local 695 hash = hash_msdos_name(nshort); 705 buffer[0x0d] = hash;
|
/haiku/src/system/kernel/cache/ |
H A D | block_cache.cpp | 66 cached_block* next; // next in hash 213 BlockTable* hash; member in struct:__anon39::block_cache 1341 // Remove can trigger a resize of the hash table which would 1400 hash(NULL), 1427 delete hash; 1448 hash = new BlockTable(); 1449 if (hash == NULL || hash->Init(1024) != B_OK) 1609 hash->Remove(block); 1701 hash [all...] |
/haiku/src/kits/tracker/ |
H A D | TitleView.cpp | 816 uint32 hash = fTitle->Column()->AttrHash(); local 824 if (hash == primarySort) { 832 if (hash == secondarySort) 835 poseView->SetSecondarySort(hash); 837 poseView->SetPrimarySort(hash);
|
/haiku/src/build/libbe/app/ |
H A D | Message.cpp | 320 // initializing the hash table to -1 because 0 is a valid index 651 uint32 hash = _HashName(oldEntry) % fHeader->hash_table_size; 652 int32 *nextField = &fHeader->hash_table[hash]; 664 hash = _HashName(newEntry) % fHeader->hash_table_size; 665 nextField = &fHeader->hash_table[hash]; 1247 uint32 hash = _HashName(name) % fHeader->hash_table_size; 1248 int32 nextField = fHeader->hash_table[hash]; 1291 uint32 hash = _HashName(name) % fHeader->hash_table_size; local 1292 int32 *nextField = &fHeader->hash_table[hash];
|
/haiku/headers/private/runtime_loader/ |
H A D | runtime_loader.h | 85 uint32 hash; // version name hash member in struct:elf_version_info
|
/haiku/src/libs/compat/freebsd_wlan/net80211/ |
H A D | ieee80211_node.c | 1356 int hash; local 1360 hash = IEEE80211_NODE_HASH(ic, ni->ni_macaddr); 1363 LIST_INSERT_HEAD(&nt->nt_hash[hash], ni, ni_hash); 1586 int hash; local 1590 hash = IEEE80211_NODE_HASH(nt->nt_ic, macaddr); 1591 LIST_FOREACH(ni, &nt->nt_hash[hash], ni_hash) { 1636 int hash; local 1640 hash = IEEE80211_NODE_HASH(nt->nt_ic, macaddr); 1641 LIST_FOREACH(ni, &nt->nt_hash[hash], ni_hash) { 2223 * in the mapping table even if it's not in the hash [all...] |
H A D | ieee80211_scan_sta.c | 99 /* simple hash is enough for variation of macaddr */ 255 int hash; local 257 hash = STA_HASH(macaddr); 260 LIST_FOREACH(se, &st->st_hash[hash], se_hash) 273 LIST_INSERT_HEAD(&st->st_hash[hash], se, se_hash); 1332 int hash = STA_HASH(macaddr); local 1335 LIST_FOREACH(se, &st->st_hash[hash], se_hash)
|
/haiku/headers/cpp/ |
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>,
|
/haiku/src/system/libroot/posix/glibc/regex/ |
H A D | regex_internal.h | 66 # include <locale/elem-hash.h> 496 unsigned int hash; member in struct:re_dfastate_t
|
/haiku/src/kits/debugger/value/value_nodes/ |
H A D | BMessageValueNode.cpp | 535 uint32 hash = _HashName(name) % fHeader->hash_table_size; 536 int32 nextField = fHeader->hash_table[hash];
|