/haiku/src/tools/fs_shell/ |
H A D | hash.h | 19 typedef struct hash_table hash_table; typedef in namespace:FSShell 21 struct hash_table *hash_init(uint32_t table_size, int next_ptr_offset, 24 int hash_uninit(struct hash_table *table); 25 fssh_status_t hash_insert(struct hash_table *table, void *_element); 26 fssh_status_t hash_remove(struct hash_table *table, void *_element); 27 void hash_remove_current(struct hash_table *table, struct hash_iterator *iterator); 28 void *hash_remove_first(struct hash_table *table, uint32_t *_cookie); 29 void *hash_find(struct hash_table *table, void *e); 30 void *hash_lookup(struct hash_table *tabl [all...] |
H A D | hash.cpp | 34 struct hash_table { struct in namespace:FSShell 51 next_element(hash_table *table, void *element) 58 struct hash_table * 63 struct hash_table *t; 71 t = (struct hash_table *)malloc(sizeof(struct hash_table)); 99 hash_uninit(struct hash_table *table) 111 hash_insert(struct hash_table *table, void *element) 130 hash_remove(struct hash_table *table, void *_element) 154 hash_remove_current(struct hash_table *tabl [all...] |
H A D | module.cpp | 75 static hash_table *sModulesHash;
|
H A D | block_cache.cpp | 49 struct hash_table; 103 hash_table* hash; 111 hash_table* transaction_hash;
|
H A D | vfs.cpp | 175 static hash_table *sVnodeTable; 181 static hash_table *sMountsTable;
|
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/beos/ |
H A D | fs_cache_priv.h | 24 typedef struct hash_table { struct 29 } hash_table; typedef in typeref:struct:hash_table 70 hash_table ht;
|
H A D | fs_cache.c | 173 init_hash_table(hash_table *ht) 188 shutdown_hash_table(hash_table *ht) 209 print_hash_stats(hash_table *ht) 254 grow_hash_table(hash_table *ht) 295 hash_insert(hash_table *ht, int dev, fs_off_t bnum, void *data) 330 hash_lookup(hash_table *ht, int dev, fs_off_t bnum) 349 hash_delete(hash_table *ht, int dev, fs_off_t bnum)
|
/haiku/src/system/kernel/slab/ |
H A D | HashedObjectCache.cpp | 50 hash_table(this) 69 size_t hashSize = cache->hash_table.ResizeNeeded(); 76 cache->hash_table.Resize(buffer, hashSize, true); 120 hash_table.InsertUnchecked(slab); 144 hash_table.RemoveUnchecked(slab); 162 HashedSlab* slab = hash_table.Lookup(::lower_boundary(object, slab_size)); 175 size_t hashSize = hash_table.ResizeNeeded(); 182 if (hash_table.ResizeNeeded() == hashSize) { 184 hash_table.Resize(buffer, hashSize, true, &oldHash);
|
H A D | HashedObjectCache.h | 102 HashTable hash_table; member in struct:HashedObjectCache
|
/haiku/headers/private/userlandfs/legacy/ |
H A D | cache.h | 26 typedef struct hash_table { struct 31 } hash_table; typedef in typeref:struct:hash_table 72 hash_table ht;
|
/haiku/headers/build/private/app/ |
H A D | MessagePrivate.h | 74 int32 hash_table[MESSAGE_BODY_HASH_TABLE_SIZE]; member in struct:BMessage::message_header
|
/haiku/headers/private/app/ |
H A D | MessagePrivate.h | 74 int32 hash_table[MESSAGE_BODY_HASH_TABLE_SIZE]; member in struct:BMessage::message_header
|
/haiku/src/build/libbe/app/ |
H A D | Message.cpp | 307 memset(fHeader, 0, sizeof(message_header) - sizeof(fHeader->hash_table)); 322 memset(&fHeader->hash_table, 255, sizeof(fHeader->hash_table)); 652 int32 *nextField = &fHeader->hash_table[hash]; 665 nextField = &fHeader->hash_table[hash]; 1248 int32 nextField = fHeader->hash_table[hash]; 1292 int32 *nextField = &fHeader->hash_table[hash]; 1333 int32 *value = fHeader->hash_table;
|
/haiku/src/kits/app/ |
H A D | Message.cpp | 379 memset(fHeader, 0, sizeof(message_header) - sizeof(fHeader->hash_table)); 394 memset(&fHeader->hash_table, 255, sizeof(fHeader->hash_table)); 788 int32* nextField = &fHeader->hash_table[hash]; 801 nextField = &fHeader->hash_table[hash]; 1662 int32 nextField = fHeader->hash_table[hash]; 1706 int32* nextField = &fHeader->hash_table[hash]; 1747 int32* value = fHeader->hash_table;
|
/haiku/src/kits/debugger/value/value_nodes/ |
H A D | BMessageValueNode.cpp | 536 int32 nextField = fHeader->hash_table[hash];
|