Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
Newer
Older
100644 44 lines (38 sloc) 1.153 kB
9027f53 @torvalds Do linear-time/space rename logic for exact renames
torvalds authored
1 #ifndef HASH_H
2 #define HASH_H
3
4 /*
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.
9 *
10 * It keeps the hash table at roughly 50-75% free, so the memory
11 * cost of the hash table itself is roughly
12 *
13 * 3 * 2*sizeof(void *) * nr_of_objects
14 *
15 * bytes.
16 *
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.
20 */
21 struct hash_table_entry {
22 unsigned int hash;
23 void *ptr;
24 };
25
26 struct hash_table {
27 unsigned int size, nr;
28 struct hash_table_entry *array;
29 };
30
d1f128b @torvalds Add 'const' where appropriate to index handling functions
torvalds authored
31 extern void *lookup_hash(unsigned int hash, const struct hash_table *table);
9027f53 @torvalds Do linear-time/space rename logic for exact renames
torvalds authored
32 extern void **insert_hash(unsigned int hash, void *ptr, struct hash_table *table);
d1f128b @torvalds Add 'const' where appropriate to index handling functions
torvalds authored
33 extern int for_each_hash(const struct hash_table *table, int (*fn)(void *));
9027f53 @torvalds Do linear-time/space rename logic for exact renames
torvalds authored
34 extern void free_hash(struct hash_table *table);
35
36 static inline void init_hash(struct hash_table *table)
37 {
38 table->size = 0;
39 table->nr = 0;
40 table->array = NULL;
41 }
42
43 #endif
Something went wrong with that request. Please try again.