#ifndef _LINUX_HASHTABLE_H
#define _LINUX_HASHTABLE_H
#include <linux/list.h>
#include <linux/hash.h>
#define DECLARE_HASHTABLE(name, bits) struct hlist_head name[1 << (bits)]
static inline void
__hash_init(struct hlist_head *table, u_int size)
{
u_int i;
for (i = 0; i < size; i++)
INIT_HLIST_HEAD(&table[i]);
}
static inline bool
__hash_empty(struct hlist_head *table, u_int size)
{
u_int i;
for (i = 0; i < size; i++) {
if (!hlist_empty(&table[i]))
return false;
}
return true;
}
#define HASH_SIZE(table) nitems(table)
#define __hash(table, key) &table[key % (nitems(table) - 1)]
#define hash_init(table) __hash_init(table, nitems(table))
#define hash_add(table, node, key) \
hlist_add_head(node, __hash(table, key))
#define hash_del(node) hlist_del_init(node)
#define hash_empty(table) __hash_empty(table, nitems(table))
#define hash_for_each_possible(table, obj, member, key) \
hlist_for_each_entry(obj, __hash(table, key), member)
#define hash_for_each_safe(table, i, tmp, obj, member) \
for (i = 0; i < nitems(table); i++) \
hlist_for_each_entry_safe(obj, tmp, &table[i], member)
#endif