5 * These are some simple generic hash table helper functions.
6 * Not necessarily suitable for all users, but good for things
7 * where you want to just keep track of a list of things, and
8 * have a good hash to use on them.
10 * It keeps the hash table at roughly 50-75% free, so the memory
11 * cost of the hash table itself is roughly
13 * 3 * 2*sizeof(void *) * nr_of_objects
17 * FIXME: on 64-bit architectures, we waste memory. It would be
18 * good to have just 32-bit pointers, requiring a special allocator
19 * for hashed entries or something.
21 struct hash_table_entry {
27 unsigned int size, nr;
28 struct hash_table_entry *array;
31 extern void *lookup_hash(unsigned int hash, const struct hash_table *table);
32 extern void **insert_hash(unsigned int hash, void *ptr, struct hash_table *table);
33 extern int for_each_hash(const struct hash_table *table, int (*fn)(void *));
34 extern void free_hash(struct hash_table *table);
36 static inline void init_hash(struct hash_table *table)