/haiku/src/system/runtime_loader/ |
H A D | elf_symbol_lookup.cpp | 52 uint32 hash = 0; local 56 hash = (hash << 4) + *name++; 57 if ((temp = hash & 0xf0000000)) { 58 hash ^= temp >> 24; 60 hash &= ~temp; 62 return hash; 116 uint32 bucket = lookupInfo.hash % HASHTABSIZE(image); 170 if (version.hash == lookupInfo.version->hash [all...] |
H A D | elf_versioning.cpp | 34 if (neededVersion.hash == info.hash 132 info.hash = definition->vd_hash; 153 info.hash = vernaux->vna_hash;
|
/haiku/src/add-ons/kernel/file_systems/ext2/ |
H A D | HTreeEntryIterator.cpp | 135 HTreeEntryIterator::Lookup(uint32 hash, int indirections, argument 174 hash, middle->Hash()); 176 if (hash >= middle->Hash()) 188 "iterator starting at block: %" B_PRIu32 ", hash: 0x%" B_PRIx32 201 "starting at block: %" B_PRIu32 ", hash: 0x%" B_PRIx32 "\n", 220 return fChild->Lookup(hash, indirections - 1, directoryIterator, 316 HTreeEntryIterator::InsertEntry(Transaction& transaction, uint32 hash, argument 377 entries[fCurrentEntry + 1].SetHash((oldHash & 1) == 0 ? hash & ~1 378 : hash | 1);
|
H A D | DirectoryIterator.cpp | 35 uint32 hash; member in struct:HashedEntry 39 return hash <= other.hash; 44 return hash >= other.hash; 648 entry.hash = htree.Hash(dirEntry->name, dirEntry->name_length); 650 cbuffer, entry.hash); 671 entry.hash = htree.Hash(name, nameLength); 673 name, entry.hash); 684 uint32 previousHash = (*iterator).hash; [all...] |
/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/tools/vmdkimage/ |
H A D | vmdkimage.cpp | 117 uint64_t hash = 0; local 121 hash = c + (hash << 6) + (hash << 16) - hash; 124 return hash;
|
/haiku/src/tests/add-ons/kernel/file_systems/consistency_check/ |
H A D | generate_hashs.cpp | 90 uint8 hash[SHA_DIGEST_LENGTH]; member in struct:file_entry 103 sprintf(buffer + i * 2, "%02x", hash[i]); 178 memcpy(entry.hash, gSHA.Digest(), SHA_DIGEST_LENGTH); 199 fprintf(stderr, "%s: Could not write hash file \"%s\": %s\n", 218 write(file, entry.hash, SHA_DIGEST_LENGTH); 234 fprintf(stderr, "usage: %s <hash-file> [<files> ...]\n" 235 "\tWhen invoked without files, the hash-file is updated only.\n", 253 // read files from hash file 257 fprintf(stderr, "%s: Could not open hash file \"%s\": %s\n", 265 fprintf(stderr, "%s: \"%s\" is not a hash fil [all...] |
H A D | consistency_check.cpp | 90 uint8 hash[SHA_DIGEST_LENGTH]; member in struct:file_entry 103 sprintf(buffer + i * 2, "%02x", hash[i]); 148 if (memcmp(entry.hash, gSHA.Digest(), SHA_DIGEST_LENGTH)) 163 fprintf(stderr, "usage: %s <hash-file>\n", kProgramName); 176 // read files from hash file 180 fprintf(stderr, "%s: Could not open hash file \"%s\": %s\n", 188 fprintf(stderr, "%s: \"%s\" is not a hash file\n", 206 // Read file names and their hash 213 read(file, entry.hash, SHA_DIGEST_LENGTH);
|
/haiku/src/add-ons/translators/gif/ |
H A D | GIFSave.h | 63 SFHash* hash; member in class:GIFSave
|
/haiku/src/apps/terminal/ |
H A D | Colors.h | 68 // "hash <-> rgb_color" pairs. The table is loaded only on demand. 73 uint32 hash; member in struct:XColorsTable::_XColorEntry
|
/haiku/src/add-ons/kernel/file_systems/fat/ |
H A D | vcache.cpp | 62 #define hash(v) ((v) & (vol->vcache.cache_size-1)) macro 68 struct vcache_entry *next_vnid; /* next entry in vnid hash table */ 69 struct vcache_entry *next_loc; /* next entry in location hash table */ 169 int hash1 = hash(vnid), hash2 = hash(loc); 221 int hash1 = hash(vnid), hash2; 244 hash2 = hash(c->loc); 270 int hash1 = hash(vnid); 288 int hash2 = hash(loc);
|
/haiku/src/system/boot/platform/openfirmware/arch/ppc/ |
H A D | mmu.cpp | 240 uint32 hash = page_table_entry::PrimaryHash(virtualSegmentID, local 242 page_table_entry_group *group = &sPageTable[hash & sPageTableHashMask]; 251 //TRACE("map: va = %p -> %p, mode = %d, hash = %lu\n", 252 // virtualAddress, physicalAddress, mode, hash); 256 hash = page_table_entry::SecondaryHash(hash); 257 group = &sPageTable[hash & sPageTableHashMask]; 265 //TRACE("map: va = %p -> %p, mode = %d, second hash = %lu\n", 266 // virtualAddress, physicalAddress, mode, hash); 630 uint32 hash local [all...] |
/haiku/src/system/kernel/arch/ppc/paging/460/ |
H A D | PPCPagingMethod460.cpp | 176 // and due to being a hash table the access patterns might look sporadic, which 244 uint32 hash = page_table_entry::PrimaryHash(virtualSegmentID, (uint32)virtualAddress); local 245 page_table_entry_group *group = &fPageTable[hash & fPageTableHashMask]; 257 hash = page_table_entry::SecondaryHash(hash); 258 group = &fPageTable[hash & fPageTableHashMask];
|
/haiku/src/system/kernel/arch/ppc/paging/classic/ |
H A D | PPCPagingMethodClassic.cpp | 176 // and due to being a hash table the access patterns might look sporadic, which 244 uint32 hash = page_table_entry::PrimaryHash(virtualSegmentID, (uint32)virtualAddress); local 245 page_table_entry_group *group = &fPageTable[hash & fPageTableHashMask]; 257 hash = page_table_entry::SecondaryHash(hash); 258 group = &fPageTable[hash & fPageTableHashMask];
|
/haiku/src/system/libroot/posix/glibc/regex/ |
H A D | regex_internal.c | 27 unsigned int hash) internal_function; 31 unsigned int hash) internal_function; 1447 unsigned int hash = nodes->nelem + context; 1450 hash += nodes->elems[i]; 1451 return hash; 1468 unsigned int hash; 1477 hash = calc_state_hash (nodes, 0); 1478 spot = dfa->state_table + (hash & dfa->state_hash_mask); 1483 if (hash != state->hash) 1444 unsigned int hash = nodes->nelem + context; local 1465 unsigned int hash; local 1509 unsigned int hash; local 1542 register_state(const re_dfa_t *dfa, re_dfastate_t *newstate, unsigned int hash) argument 1596 create_ci_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int hash) argument 1646 create_cd_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context, unsigned int hash) argument [all...] |
/haiku/src/kits/tracker/ |
H A D | Utilities.cpp | 111 uint32 hash = seed; local 114 hash = (hash << 7) ^ (hash >> 24); 115 hash ^= ch; 117 hash ^= hash << 12; 119 return hash; 127 uint32 hash = 0; local 130 hash [all...] |
/haiku/src/tools/fs_shell/ |
H A D | block_cache.cpp | 18 #include "hash.h" 63 cached_block* next; // next in hash 103 hash_table* hash; member in struct:FSShell::block_cache 474 hash(NULL), 490 hash_uninit(hash); 503 hash = hash_init(128, offsetof(cached_block, next), &cached_block::Compare, 505 if (hash == NULL) 626 hash_remove(hash, block); 704 cached_block* block = (cached_block*)hash_lookup(cache->hash, &blockNumber); 710 /*! Retrieves the block \a blockNumber from the hash tabl [all...] |
/haiku/src/system/kernel/util/ |
H A D | Random.cpp | 28 // MD4 based hash function. Simplified in order to improve performance. 30 hash(uint32* data) function 124 uint32 random = hash(data);
|
/haiku/src/kits/debugger/debug_info/ |
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...] |
/haiku/src/add-ons/kernel/network/protocols/l2cap/ |
H A D | l2cap_address.cpp | 291 uint32 hash = 0; 293 hash += address->l2cap_bdaddr.b[i] << (i * 2); 296 hash += address->l2cap_psm; 297 return hash;
|
/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/kits/locale/ |
H A D | HashMapCatalog.cpp | 18 * This is the standard implementation of a localization catalog, using a hash 22 * If you ever need to create a catalog not built around an hash map, inherit 61 // are equal (testing only the hash would not filter out collisions): 73 // are equal (testing only the hash would not filter out collisions): 268 * wrong order, and this does happen, as an hash map is an unsorted container. 275 int32 hash; local 280 hash = B_HOST_TO_LENDIAN_INT32(entry.key.fHashVal); 281 checksum += 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/drivers/network/ether/usb_asix/ |
H A D | ASIXDevice.cpp | 646 uint32 hash = EthernetCRC32(group->ebyte, 6); local 647 bool isInTable = fMulticastHashes.Find(hash) != fMulticastHashes.End(); 661 fMulticastHashes.PushBack(hash); 663 fMulticastHashes.Remove(hash); 666 uint32 hash = fMulticastHashes[i] >> 26; local 667 hashTable[hash / 8] |= 1 << (hash % 8); 683 // write multicast hash table 690 TRACE_ALWAYS("Error writing hash table in MAR: %#010x.\n", result); 695 TRACE_ALWAYS("Incomplete writing of hash tabl [all...] |