|
@@ -9,6 +9,8 @@
|
|
|
#include <linux/sched.h>
|
|
|
#include "hashtab.h"
|
|
|
|
|
|
+static struct kmem_cache *hashtab_node_cachep;
|
|
|
+
|
|
|
struct hashtab *hashtab_create(u32 (*hash_value)(struct hashtab *h, const void *key),
|
|
|
int (*keycmp)(struct hashtab *h, const void *key1, const void *key2),
|
|
|
u32 size)
|
|
@@ -57,7 +59,7 @@ int hashtab_insert(struct hashtab *h, void *key, void *datum)
|
|
|
if (cur && (h->keycmp(h, key, cur->key) == 0))
|
|
|
return -EEXIST;
|
|
|
|
|
|
- newnode = kzalloc(sizeof(*newnode), GFP_KERNEL);
|
|
|
+ newnode = kmem_cache_zalloc(hashtab_node_cachep, GFP_KERNEL);
|
|
|
if (!newnode)
|
|
|
return -ENOMEM;
|
|
|
newnode->key = key;
|
|
@@ -106,7 +108,7 @@ void hashtab_destroy(struct hashtab *h)
|
|
|
while (cur) {
|
|
|
temp = cur;
|
|
|
cur = cur->next;
|
|
|
- kfree(temp);
|
|
|
+ kmem_cache_free(hashtab_node_cachep, temp);
|
|
|
}
|
|
|
h->htable[i] = NULL;
|
|
|
}
|
|
@@ -166,3 +168,14 @@ void hashtab_stat(struct hashtab *h, struct hashtab_info *info)
|
|
|
info->slots_used = slots_used;
|
|
|
info->max_chain_len = max_chain_len;
|
|
|
}
|
|
|
+void hashtab_cache_init(void)
|
|
|
+{
|
|
|
+ hashtab_node_cachep = kmem_cache_create("hashtab_node",
|
|
|
+ sizeof(struct hashtab_node),
|
|
|
+ 0, SLAB_PANIC, NULL);
|
|
|
+}
|
|
|
+
|
|
|
+void hashtab_cache_destroy(void)
|
|
|
+{
|
|
|
+ kmem_cache_destroy(hashtab_node_cachep);
|
|
|
+}
|