Searched refs:hash (Results 1 - 25 of 88) sorted by last modified time

1234

/haiku/src/add-ons/kernel/network/protocols/l2cap/
H A Dl2cap_address.cpp291 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/file_systems/btrfs/
H A DInode.cpp471 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/kits/tracker/
H A DUtilities.cpp111 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...]
H A DTitleView.cpp816 uint32 hash = fTitle->Column()->AttrHash(); local
824 if (hash == primarySort) {
832 if (hash == secondarySort)
835 poseView->SetSecondarySort(hash);
837 poseView->SetPrimarySort(hash);
H A DIconCache.cpp47 // already calculated hash value
136 // clean up a bit to leave the hash table entry in an initialized state
1572 size_t hash = HashString(typeAndSignature.type, 0); local
1575 hash = HashString(typeAndSignature.signature, hash);
1577 return hash;
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DDirectoryIterator.cpp35 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...]
H A Dext2.h786 uint32 hash; member in struct:ext2_xattr_header
815 uint32 hash; member in struct:ext2_xattr_entry
/haiku/src/system/kernel/
H A Delf.cpp307 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 Dport.cpp60 // * 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/tools/fs_shell/
H A Dblock_cache.cpp18 #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/tests/system/kernel/cache/
H A Dblock_cache_test.cpp192 cached_block* block = (cached_block*)hash_lookup(gCache->hash, &number);
/haiku/src/tests/add-ons/kernel/file_systems/consistency_check/
H A Dconsistency_check.cpp90 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/kits/app/
H A DMessage.cpp392 // initializing the hash table to -1 because 0 is a valid index
787 uint32 hash = _HashName(oldEntry) % fHeader->hash_table_size; local
788 int32* nextField = &fHeader->hash_table[hash];
800 hash = _HashName(newEntry) % fHeader->hash_table_size;
801 nextField = &fHeader->hash_table[hash];
1661 uint32 hash = _HashName(name) % fHeader->hash_table_size;
1662 int32 nextField = fHeader->hash_table[hash];
1705 uint32 hash = _HashName(name) % fHeader->hash_table_size; local
1706 int32* nextField = &fHeader->hash_table[hash];
/haiku/src/build/libbe/app/
H A DMessage.cpp320 // 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/src/add-ons/kernel/file_systems/userlandfs/server/beos/
H A Dfs_cache.c7 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/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/kernel/cache/
H A Dblock_cache.cpp66 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/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...]
H A DColors.h68 // "hash <-> rgb_color" pairs. The table is loaded only on demand.
73 uint32 hash; member in struct:XColorsTable::_XColorEntry
/haiku/src/apps/debugger/user_interface/gui/team_window/
H A DVariablesView.cpp247 uint32 hash = reinterpret_cast<addr_t>(fInfo); local
248 hash = hash * 19 + StringUtils::HashValue(fInfo->Expression());
250 return hash;
/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/system/runtime_loader/
H A Delf_symbol_lookup.cpp52 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...]
/haiku/src/add-ons/kernel/drivers/network/ether/usb_asix/
H A DASIXDevice.cpp646 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...]
/haiku/src/add-ons/kernel/network/protocols/udp/
H A Dudp.cpp40 // hash is required when holding the DomainSupport's lock.
114 // endpoint hash (and it is bound and
144 static size_t _Mix(size_t hash) argument
147 return (hash & 0x000007FF) ^ (hash & 0x003FF800) >> 11
148 ^ (hash & 0xFFC00000UL) >> 22;
/haiku/src/add-ons/kernel/file_systems/fat/
H A Ddir.cpp51 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;

Completed in 191 milliseconds

1234