1 /* SPDX-License-Identifier: GPL-2.0 */
3 * A hash table (hashtab) maintains associations between
4 * key values and datum values. The type of the key values
5 * and the type of the datum values is arbitrary. The
6 * functions for hash computation and key comparison are
7 * provided by the creator of the table.
9 * Author : Stephen Smalley, <stephen.smalley.work@gmail.com>
11 #ifndef _SS_HASHTAB_H_
12 #define _SS_HASHTAB_H_
14 #include <linux/types.h>
15 #include <linux/errno.h>
16 #include <linux/sched.h>
18 #define HASHTAB_MAX_NODES U32_MAX
20 struct hashtab_key_params {
21 u32 (*hash)(const void *key); /* hash function */
22 int (*cmp)(const void *key1, const void *key2);
23 /* key comparison function */
29 struct hashtab_node *next;
33 struct hashtab_node **htable; /* hash table */
34 u32 size; /* number of slots in hash table */
35 u32 nel; /* number of elements in hash table */
45 * Initializes a new hash table with the specified characteristics.
47 * Returns -ENOMEM if insufficient space is available or 0 otherwise.
49 int hashtab_init(struct hashtab *h, u32 nel_hint);
51 int __hashtab_insert(struct hashtab *h, struct hashtab_node **dst,
52 void *key, void *datum);
55 * Inserts the specified (key, datum) pair into the specified hash table.
57 * Returns -ENOMEM on memory allocation error,
58 * -EEXIST if there is already an entry with the same key,
59 * -EINVAL for general errors or
62 static inline int hashtab_insert(struct hashtab *h, void *key, void *datum,
63 struct hashtab_key_params key_params)
66 struct hashtab_node *prev, *cur;
70 if (!h->size || h->nel == HASHTAB_MAX_NODES)
73 hvalue = key_params.hash(key) & (h->size - 1);
75 cur = h->htable[hvalue];
77 int cmp = key_params.cmp(key, cur->key);
87 return __hashtab_insert(h, prev ? &prev->next : &h->htable[hvalue],
92 * Searches for the entry with the specified key in the hash table.
94 * Returns NULL if no entry has the specified key or
95 * the datum of the entry otherwise.
97 static inline void *hashtab_search(struct hashtab *h, const void *key,
98 struct hashtab_key_params key_params)
101 struct hashtab_node *cur;
106 hvalue = key_params.hash(key) & (h->size - 1);
107 cur = h->htable[hvalue];
109 int cmp = key_params.cmp(key, cur->key);
121 * Destroys the specified hash table.
123 void hashtab_destroy(struct hashtab *h);
126 * Applies the specified apply function to (key,datum,args)
127 * for each entry in the specified hash table.
129 * The order in which the function is applied to the entries
130 * is dependent upon the internal structure of the hash table.
132 * If apply returns a non-zero status, then hashtab_map will cease
133 * iterating through the hash table and will propagate the error
134 * return to its caller.
136 int hashtab_map(struct hashtab *h,
137 int (*apply)(void *k, void *d, void *args),
140 int hashtab_duplicate(struct hashtab *new, struct hashtab *orig,
141 int (*copy)(struct hashtab_node *new,
142 struct hashtab_node *orig, void *args),
143 int (*destroy)(void *k, void *d, void *args),
146 #ifdef CONFIG_SECURITY_SELINUX_DEBUG
147 /* Fill info with some hash table statistics */
148 void hashtab_stat(struct hashtab *h, struct hashtab_info *info);
150 static inline void hashtab_stat(struct hashtab *h, struct hashtab_info *info)
155 #endif /* _SS_HASHTAB_H */