5 * Generic implementation of hash-based key-value mappings.
6 * See Documentation/technical/api-hashmap.txt.
11 extern unsigned int strhash(const char *buf);
12 extern unsigned int strihash(const char *buf);
13 extern unsigned int memhash(const void *buf, size_t len);
14 extern unsigned int memihash(const void *buf, size_t len);
15 extern unsigned int memihash_cont(unsigned int hash_seed, const void *buf, size_t len);
17 static inline unsigned int sha1hash(const unsigned char *sha1)
20 * Equivalent to 'return *(unsigned int *)sha1;', but safe on
21 * platforms that don't support unaligned reads.
24 memcpy(&hash, sha1, sizeof(hash));
30 struct hashmap_entry {
31 struct hashmap_entry *next;
35 typedef int (*hashmap_cmp_fn)(const void *hashmap_cmp_fn_data,
36 const void *entry, const void *entry_or_key,
40 struct hashmap_entry **table;
42 const void *cmpfn_data;
43 unsigned int size, tablesize, grow_at, shrink_at;
44 unsigned disallow_rehash : 1;
49 struct hashmap_entry *next;
50 unsigned int tablepos;
53 /* hashmap functions */
55 extern void hashmap_init(struct hashmap *map,
56 hashmap_cmp_fn equals_function,
57 const void *equals_function_data,
59 extern void hashmap_free(struct hashmap *map, int free_entries);
61 /* hashmap_entry functions */
63 static inline void hashmap_entry_init(void *entry, unsigned int hash)
65 struct hashmap_entry *e = entry;
69 extern void *hashmap_get(const struct hashmap *map, const void *key,
71 extern void *hashmap_get_next(const struct hashmap *map, const void *entry);
72 extern void hashmap_add(struct hashmap *map, void *entry);
73 extern void *hashmap_put(struct hashmap *map, void *entry);
74 extern void *hashmap_remove(struct hashmap *map, const void *key,
77 static inline void *hashmap_get_from_hash(const struct hashmap *map,
78 unsigned int hash, const void *keydata)
80 struct hashmap_entry key;
81 hashmap_entry_init(&key, hash);
82 return hashmap_get(map, &key, keydata);
85 int hashmap_bucket(const struct hashmap *map, unsigned int hash);
88 * Disallow/allow rehashing of the hashmap.
89 * This is useful if the caller knows that the hashmap
90 * needs multi-threaded access. The caller is still
91 * required to guard/lock searches and inserts in a
92 * manner appropriate to their usage. This simply
93 * prevents the table from being unexpectedly re-mapped.
95 * If is up to the caller to ensure that the hashmap is
96 * initialized to a reasonable size to prevent poor
99 * When value=1, prevent future rehashes on adds and deleted.
100 * When value=0, allow future rehahses. This DOES NOT force
103 static inline void hashmap_disallow_rehash(struct hashmap *map, unsigned value)
105 map->disallow_rehash = value;
108 /* hashmap_iter functions */
110 extern void hashmap_iter_init(struct hashmap *map, struct hashmap_iter *iter);
111 extern void *hashmap_iter_next(struct hashmap_iter *iter);
112 static inline void *hashmap_iter_first(struct hashmap *map,
113 struct hashmap_iter *iter)
115 hashmap_iter_init(map, iter);
116 return hashmap_iter_next(iter);
119 /* string interning */
121 extern const void *memintern(const void *data, size_t len);
122 static inline const char *strintern(const char *string)
124 return memintern(string, strlen(string));