| /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/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/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/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/system/kernel/fs/ |
| H A D | EntryCache.h | 23 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/system/libroot/posix/musl/search/ |
| H A D | hsearch.c | 8 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/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_symbol_lookup.h | 25 uint32 hash; member in struct:SymbolLookupInfo
30 SymbolLookupInfo(const char* name, int32 type, uint32 hash, argument
36 hash(hash),
49 hash(elf_hash(name)),
|
| 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/tests/add-ons/kernel/file_systems/consistency_check/ |
| 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/tests/system/kernel/cache/ |
| H A D | block_cache_test.cpp | 192 cached_block* block = (cached_block*)hash_lookup(gCache->hash, &number);
|
| /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...] |