1b2441318SGreg Kroah-Hartman // SPDX-License-Identifier: GPL-2.0 21da177e4SLinus Torvalds /* 31da177e4SLinus Torvalds * Implementation of the hash table type. 41da177e4SLinus Torvalds * 57efbb60bSStephen Smalley * Author : Stephen Smalley, <sds@tycho.nsa.gov> 61da177e4SLinus Torvalds */ 71da177e4SLinus Torvalds #include <linux/kernel.h> 81da177e4SLinus Torvalds #include <linux/slab.h> 91da177e4SLinus Torvalds #include <linux/errno.h> 10ed1c9642SDave Jones #include <linux/sched.h> 111da177e4SLinus Torvalds #include "hashtab.h" 121da177e4SLinus Torvalds 137c620eceSKyeongdon Kim static struct kmem_cache *hashtab_node_cachep; 147c620eceSKyeongdon Kim 15bb242497SChad Sellers struct hashtab *hashtab_create(u32 (*hash_value)(struct hashtab *h, const void *key), 16bb242497SChad Sellers int (*keycmp)(struct hashtab *h, const void *key1, const void *key2), 171da177e4SLinus Torvalds u32 size) 181da177e4SLinus Torvalds { 191da177e4SLinus Torvalds struct hashtab *p; 201da177e4SLinus Torvalds u32 i; 211da177e4SLinus Torvalds 2289d155efSJames Morris p = kzalloc(sizeof(*p), GFP_KERNEL); 23cb8d21e3SMarkus Elfring if (!p) 241da177e4SLinus Torvalds return p; 251da177e4SLinus Torvalds 261da177e4SLinus Torvalds p->size = size; 271da177e4SLinus Torvalds p->nel = 0; 281da177e4SLinus Torvalds p->hash_value = hash_value; 291da177e4SLinus Torvalds p->keycmp = keycmp; 302f00e680SMarkus Elfring p->htable = kmalloc_array(size, sizeof(*p->htable), GFP_KERNEL); 31cb8d21e3SMarkus Elfring if (!p->htable) { 321da177e4SLinus Torvalds kfree(p); 331da177e4SLinus Torvalds return NULL; 341da177e4SLinus Torvalds } 351da177e4SLinus Torvalds 361da177e4SLinus Torvalds for (i = 0; i < size; i++) 371da177e4SLinus Torvalds p->htable[i] = NULL; 381da177e4SLinus Torvalds 391da177e4SLinus Torvalds return p; 401da177e4SLinus Torvalds } 411da177e4SLinus Torvalds 421da177e4SLinus Torvalds int hashtab_insert(struct hashtab *h, void *key, void *datum) 431da177e4SLinus Torvalds { 441da177e4SLinus Torvalds u32 hvalue; 451da177e4SLinus Torvalds struct hashtab_node *prev, *cur, *newnode; 461da177e4SLinus Torvalds 47ed1c9642SDave Jones cond_resched(); 48ed1c9642SDave Jones 491da177e4SLinus Torvalds if (!h || h->nel == HASHTAB_MAX_NODES) 501da177e4SLinus Torvalds return -EINVAL; 511da177e4SLinus Torvalds 521da177e4SLinus Torvalds hvalue = h->hash_value(h, key); 531da177e4SLinus Torvalds prev = NULL; 541da177e4SLinus Torvalds cur = h->htable[hvalue]; 551da177e4SLinus Torvalds while (cur && h->keycmp(h, key, cur->key) > 0) { 561da177e4SLinus Torvalds prev = cur; 571da177e4SLinus Torvalds cur = cur->next; 581da177e4SLinus Torvalds } 591da177e4SLinus Torvalds 601da177e4SLinus Torvalds if (cur && (h->keycmp(h, key, cur->key) == 0)) 611da177e4SLinus Torvalds return -EEXIST; 621da177e4SLinus Torvalds 637c620eceSKyeongdon Kim newnode = kmem_cache_zalloc(hashtab_node_cachep, GFP_KERNEL); 64cb8d21e3SMarkus Elfring if (!newnode) 651da177e4SLinus Torvalds return -ENOMEM; 661da177e4SLinus Torvalds newnode->key = key; 671da177e4SLinus Torvalds newnode->datum = datum; 681da177e4SLinus Torvalds if (prev) { 691da177e4SLinus Torvalds newnode->next = prev->next; 701da177e4SLinus Torvalds prev->next = newnode; 711da177e4SLinus Torvalds } else { 721da177e4SLinus Torvalds newnode->next = h->htable[hvalue]; 731da177e4SLinus Torvalds h->htable[hvalue] = newnode; 741da177e4SLinus Torvalds } 751da177e4SLinus Torvalds 761da177e4SLinus Torvalds h->nel++; 771da177e4SLinus Torvalds return 0; 781da177e4SLinus Torvalds } 791da177e4SLinus Torvalds 80bb242497SChad Sellers void *hashtab_search(struct hashtab *h, const void *key) 811da177e4SLinus Torvalds { 821da177e4SLinus Torvalds u32 hvalue; 831da177e4SLinus Torvalds struct hashtab_node *cur; 841da177e4SLinus Torvalds 851da177e4SLinus Torvalds if (!h) 861da177e4SLinus Torvalds return NULL; 871da177e4SLinus Torvalds 881da177e4SLinus Torvalds hvalue = h->hash_value(h, key); 891da177e4SLinus Torvalds cur = h->htable[hvalue]; 90dbc74c65SVesa-Matti Kari while (cur && h->keycmp(h, key, cur->key) > 0) 911da177e4SLinus Torvalds cur = cur->next; 921da177e4SLinus Torvalds 93cb8d21e3SMarkus Elfring if (!cur || (h->keycmp(h, key, cur->key) != 0)) 941da177e4SLinus Torvalds return NULL; 951da177e4SLinus Torvalds 961da177e4SLinus Torvalds return cur->datum; 971da177e4SLinus Torvalds } 981da177e4SLinus Torvalds 991da177e4SLinus Torvalds void hashtab_destroy(struct hashtab *h) 1001da177e4SLinus Torvalds { 1011da177e4SLinus Torvalds u32 i; 1021da177e4SLinus Torvalds struct hashtab_node *cur, *temp; 1031da177e4SLinus Torvalds 1041da177e4SLinus Torvalds if (!h) 1051da177e4SLinus Torvalds return; 1061da177e4SLinus Torvalds 1071da177e4SLinus Torvalds for (i = 0; i < h->size; i++) { 1081da177e4SLinus Torvalds cur = h->htable[i]; 109dbc74c65SVesa-Matti Kari while (cur) { 1101da177e4SLinus Torvalds temp = cur; 1111da177e4SLinus Torvalds cur = cur->next; 1127c620eceSKyeongdon Kim kmem_cache_free(hashtab_node_cachep, temp); 1131da177e4SLinus Torvalds } 1141da177e4SLinus Torvalds h->htable[i] = NULL; 1151da177e4SLinus Torvalds } 1161da177e4SLinus Torvalds 1171da177e4SLinus Torvalds kfree(h->htable); 1181da177e4SLinus Torvalds h->htable = NULL; 1191da177e4SLinus Torvalds 1201da177e4SLinus Torvalds kfree(h); 1211da177e4SLinus Torvalds } 1221da177e4SLinus Torvalds 1231da177e4SLinus Torvalds int hashtab_map(struct hashtab *h, 1241da177e4SLinus Torvalds int (*apply)(void *k, void *d, void *args), 1251da177e4SLinus Torvalds void *args) 1261da177e4SLinus Torvalds { 1271da177e4SLinus Torvalds u32 i; 1281da177e4SLinus Torvalds int ret; 1291da177e4SLinus Torvalds struct hashtab_node *cur; 1301da177e4SLinus Torvalds 1311da177e4SLinus Torvalds if (!h) 1321da177e4SLinus Torvalds return 0; 1331da177e4SLinus Torvalds 1341da177e4SLinus Torvalds for (i = 0; i < h->size; i++) { 1351da177e4SLinus Torvalds cur = h->htable[i]; 136dbc74c65SVesa-Matti Kari while (cur) { 1371da177e4SLinus Torvalds ret = apply(cur->key, cur->datum, args); 1381da177e4SLinus Torvalds if (ret) 1391da177e4SLinus Torvalds return ret; 1401da177e4SLinus Torvalds cur = cur->next; 1411da177e4SLinus Torvalds } 1421da177e4SLinus Torvalds } 1431da177e4SLinus Torvalds return 0; 1441da177e4SLinus Torvalds } 1451da177e4SLinus Torvalds 1461da177e4SLinus Torvalds 1471da177e4SLinus Torvalds void hashtab_stat(struct hashtab *h, struct hashtab_info *info) 1481da177e4SLinus Torvalds { 1491da177e4SLinus Torvalds u32 i, chain_len, slots_used, max_chain_len; 1501da177e4SLinus Torvalds struct hashtab_node *cur; 1511da177e4SLinus Torvalds 1521da177e4SLinus Torvalds slots_used = 0; 1531da177e4SLinus Torvalds max_chain_len = 0; 1545794ed76SColin Ian King for (i = 0; i < h->size; i++) { 1551da177e4SLinus Torvalds cur = h->htable[i]; 1561da177e4SLinus Torvalds if (cur) { 1571da177e4SLinus Torvalds slots_used++; 1581da177e4SLinus Torvalds chain_len = 0; 1591da177e4SLinus Torvalds while (cur) { 1601da177e4SLinus Torvalds chain_len++; 1611da177e4SLinus Torvalds cur = cur->next; 1621da177e4SLinus Torvalds } 1631da177e4SLinus Torvalds 1641da177e4SLinus Torvalds if (chain_len > max_chain_len) 1651da177e4SLinus Torvalds max_chain_len = chain_len; 1661da177e4SLinus Torvalds } 1671da177e4SLinus Torvalds } 1681da177e4SLinus Torvalds 1691da177e4SLinus Torvalds info->slots_used = slots_used; 1701da177e4SLinus Torvalds info->max_chain_len = max_chain_len; 1711da177e4SLinus Torvalds } 172aa8e712cSStephen Smalley 173aa8e712cSStephen Smalley void __init hashtab_cache_init(void) 1747c620eceSKyeongdon Kim { 1757c620eceSKyeongdon Kim hashtab_node_cachep = kmem_cache_create("hashtab_node", 1767c620eceSKyeongdon Kim sizeof(struct hashtab_node), 1777c620eceSKyeongdon Kim 0, SLAB_PANIC, NULL); 1787c620eceSKyeongdon Kim } 179