hash_table
int32 hash_table[MESSAGE_BODY_HASH_TABLE_SIZE];
int32 hash_table[MESSAGE_BODY_HASH_TABLE_SIZE];
hash_table ht;
init_hash_table(hash_table *ht)
shutdown_hash_table(hash_table *ht)
print_hash_stats(hash_table *ht)
grow_hash_table(hash_table *ht)
hash_insert(hash_table *ht, int dev, fs_off_t bnum, void *data)
hash_lookup(hash_table *ht, int dev, fs_off_t bnum)
hash_delete(hash_table *ht, int dev, fs_off_t bnum)
hash_table ht;
int32 nextField = fHeader->hash_table[hash];
int32 *nextField = &fHeader->hash_table[hash];
int32 *value = fHeader->hash_table;
memset(fHeader, 0, sizeof(message_header) - sizeof(fHeader->hash_table));
memset(&fHeader->hash_table, 255, sizeof(fHeader->hash_table));
int32 *nextField = &fHeader->hash_table[hash];
nextField = &fHeader->hash_table[hash];
int32 nextField = fHeader->hash_table[hash];
int32* nextField = &fHeader->hash_table[hash];
int32* value = fHeader->hash_table;
memset(fHeader, 0, sizeof(message_header) - sizeof(fHeader->hash_table));
memset(&fHeader->hash_table, 255, sizeof(fHeader->hash_table));
int32* nextField = &fHeader->hash_table[hash];
nextField = &fHeader->hash_table[hash];
int32 nextField = fHeader->hash_table[hash];
hash_table.InsertUnchecked(slab);
hash_table.RemoveUnchecked(slab);
HashedSlab* slab = hash_table.Lookup(::lower_boundary(object, slab_size));
size_t hashSize = hash_table.ResizeNeeded();
if (hash_table.ResizeNeeded() == hashSize) {
hash_table.Resize(buffer, hashSize, true, &oldHash);
hash_table(this)
size_t hashSize = cache->hash_table.ResizeNeeded();
cache->hash_table.Resize(buffer, hashSize, true);
HashTable hash_table;
hash_table* hash;
hash_table* transaction_hash;
struct hash_table;
hash_insert(struct hash_table *table, void *element)
hash_remove(struct hash_table *table, void *_element)
hash_remove_current(struct hash_table *table, struct hash_iterator *iterator)
hash_remove_first(struct hash_table *table, uint32_t *_cookie)
hash_find(struct hash_table *table, void *searchedElement)
hash_lookup(struct hash_table *table, const void *key)
hash_open(struct hash_table *table, struct hash_iterator *iterator)
hash_close(struct hash_table *table, struct hash_iterator *iterator, bool freeIterator)
hash_rewind(struct hash_table *table, struct hash_iterator *iterator)
hash_next(struct hash_table *table, struct hash_iterator *iterator)
next_element(hash_table *table, void *element)
struct hash_table *
struct hash_table *t;
t = (struct hash_table *)malloc(sizeof(struct hash_table));
hash_uninit(struct hash_table *table)
typedef struct hash_table hash_table;
struct hash_table *hash_init(uint32_t table_size, int next_ptr_offset,
int hash_uninit(struct hash_table *table);
fssh_status_t hash_insert(struct hash_table *table, void *_element);
fssh_status_t hash_remove(struct hash_table *table, void *_element);
void hash_remove_current(struct hash_table *table, struct hash_iterator *iterator);
void *hash_remove_first(struct hash_table *table, uint32_t *_cookie);
void *hash_find(struct hash_table *table, void *e);
void *hash_lookup(struct hash_table *table, const void *key);
struct hash_iterator *hash_open(struct hash_table *table, struct hash_iterator *i);
void hash_close(struct hash_table *table, struct hash_iterator *i, bool free_iterator);
void *hash_next(struct hash_table *table, struct hash_iterator *i);
void hash_rewind(struct hash_table *table, struct hash_iterator *i);
static hash_table *sModulesHash;
static hash_table *sVnodeTable;
static hash_table *sMountsTable;