summaryrefslogtreecommitdiff
path: root/zlog/zc_hashtable.c
diff options
context:
space:
mode:
Diffstat (limited to 'zlog/zc_hashtable.c')
-rw-r--r--zlog/zc_hashtable.c330
1 files changed, 0 insertions, 330 deletions
diff --git a/zlog/zc_hashtable.c b/zlog/zc_hashtable.c
deleted file mode 100644
index 00ce20f..0000000
--- a/zlog/zc_hashtable.c
+++ /dev/null
@@ -1,330 +0,0 @@
-/*
- * This file is part of the zlog Library.
- *
- * Copyright (C) 2011 by Hardy Simpson <[email protected]>
- *
- * Licensed under the LGPL v2.1, see the file COPYING in base directory.
- */
-
-#include <stdlib.h>
-#include <errno.h>
-#include <pthread.h>
-
-#include "zc_defs.h"
-#include "zc_hashtable.h"
-
-struct zc_hashtable_s {
- size_t nelem;
-
- zc_hashtable_entry_t **tab;
- size_t tab_size;
-
- zc_hashtable_hash_fn hash;
- zc_hashtable_equal_fn equal;
- zc_hashtable_del_fn key_del;
- zc_hashtable_del_fn value_del;
-};
-
-zc_hashtable_t *zc_hashtable_new(size_t a_size,
- zc_hashtable_hash_fn hash,
- zc_hashtable_equal_fn equal,
- zc_hashtable_del_fn key_del,
- zc_hashtable_del_fn value_del)
-{
- zc_hashtable_t *a_table;
-
- a_table = calloc(1, sizeof(*a_table));
- if (!a_table) {
- zc_error("calloc fail, errno[%d]", errno);
- return NULL;
- }
-
- a_table->tab = calloc(a_size, sizeof(*(a_table->tab)));
- if (!a_table->tab) {
- zc_error("calloc fail, errno[%d]", errno);
- free(a_table);
- return NULL;
- }
- a_table->tab_size = a_size;
-
- a_table->nelem = 0;
- a_table->hash = hash;
- a_table->equal = equal;
-
- /* these two could be NULL */
- a_table->key_del = key_del;
- a_table->value_del = value_del;
-
- return a_table;
-}
-
-void zc_hashtable_del(zc_hashtable_t * a_table)
-{
- size_t i;
- zc_hashtable_entry_t *p;
- zc_hashtable_entry_t *q;
-
- if (!a_table) {
- zc_error("a_table[%p] is NULL, just do nothing", a_table);
- return;
- }
-
- for (i = 0; i < a_table->tab_size; i++) {
- for (p = (a_table->tab)[i]; p; p = q) {
- q = p->next;
- if (a_table->key_del) {
- a_table->key_del(p->key);
- }
- if (a_table->value_del) {
- a_table->value_del(p->value);
- }
- free(p);
- }
- }
- if (a_table->tab)
- free(a_table->tab);
- free(a_table);
-
- return;
-}
-
-void zc_hashtable_clean(zc_hashtable_t * a_table)
-{
- size_t i;
- zc_hashtable_entry_t *p;
- zc_hashtable_entry_t *q;
-
- for (i = 0; i < a_table->tab_size; i++) {
- for (p = (a_table->tab)[i]; p; p = q) {
- q = p->next;
- if (a_table->key_del) {
- a_table->key_del(p->key);
- }
- if (a_table->value_del) {
- a_table->value_del(p->value);
- }
- free(p);
- }
- (a_table->tab)[i] = NULL;
- }
- a_table->nelem = 0;
- return;
-}
-
-static int zc_hashtable_rehash(zc_hashtable_t * a_table)
-{
- size_t i;
- size_t j;
- size_t tab_size;
- zc_hashtable_entry_t **tab;
- zc_hashtable_entry_t *p;
- zc_hashtable_entry_t *q;
-
- tab_size = 2 * a_table->tab_size;
- tab = calloc(tab_size, sizeof(*tab));
- if (!tab) {
- zc_error("calloc fail, errno[%d]", errno);
- return -1;
- }
-
- for (i = 0; i < a_table->tab_size; i++) {
- for (p = (a_table->tab)[i]; p; p = q) {
- q = p->next;
-
- p->next = NULL;
- p->prev = NULL;
- j = p->hash_key % tab_size;
- if (tab[j]) {
- tab[j]->prev = p;
- p->next = tab[j];
- }
- tab[j] = p;
- }
- }
- free(a_table->tab);
- a_table->tab = tab;
- a_table->tab_size = tab_size;
-
- return 0;
-}
-
-zc_hashtable_entry_t *zc_hashtable_get_entry(zc_hashtable_t * a_table, const void *a_key)
-{
- unsigned int i;
- zc_hashtable_entry_t *p;
-
- i = a_table->hash(a_key) % a_table->tab_size;
- for (p = (a_table->tab)[i]; p; p = p->next) {
- if (a_table->equal(a_key, p->key))
- return p;
- }
-
- return NULL;
-}
-
-void *zc_hashtable_get(zc_hashtable_t * a_table, const void *a_key)
-{
- unsigned int i;
- zc_hashtable_entry_t *p;
-
- i = a_table->hash(a_key) % a_table->tab_size;
- for (p = (a_table->tab)[i]; p; p = p->next) {
- if (a_table->equal(a_key, p->key))
- return p->value;
- }
-
- return NULL;
-}
-
-int zc_hashtable_put(zc_hashtable_t * a_table, void *a_key, void *a_value)
-{
- int rc = 0;
- unsigned int i;
- zc_hashtable_entry_t *p = NULL;
-
- i = a_table->hash(a_key) % a_table->tab_size;
- for (p = (a_table->tab)[i]; p; p = p->next) {
- if (a_table->equal(a_key, p->key))
- break;
- }
-
- if (p) {
- if (a_table->key_del) {
- a_table->key_del(p->key);
- }
- if (a_table->value_del) {
- a_table->value_del(p->value);
- }
- p->key = a_key;
- p->value = a_value;
- return 0;
- } else {
- if (a_table->nelem > a_table->tab_size * 1.3) {
- rc = zc_hashtable_rehash(a_table);
- if (rc) {
- zc_error("rehash fail");
- return -1;
- }
- }
-
- p = calloc(1, sizeof(*p));
- if (!p) {
- zc_error("calloc fail, errno[%d]", errno);
- return -1;
- }
-
- p->hash_key = a_table->hash(a_key);
- p->key = a_key;
- p->value = a_value;
- p->next = NULL;
- p->prev = NULL;
-
- i = p->hash_key % a_table->tab_size;
- if ((a_table->tab)[i]) {
- (a_table->tab)[i]->prev = p;
- p->next = (a_table->tab)[i];
- }
- (a_table->tab)[i] = p;
- a_table->nelem++;
- }
-
- return 0;
-}
-
-void zc_hashtable_remove(zc_hashtable_t * a_table, const void *a_key)
-{
- zc_hashtable_entry_t *p;
- unsigned int i;
-
- if (!a_table || !a_key) {
- zc_error("a_table[%p] or a_key[%p] is NULL, just do nothing", a_table, a_key);
- return;
- }
-
- i = a_table->hash(a_key) % a_table->tab_size;
- for (p = (a_table->tab)[i]; p; p = p->next) {
- if (a_table->equal(a_key, p->key))
- break;
- }
-
- if (!p) {
- zc_error("p[%p] not found in hashtable", p);
- return;
- }
-
- if (a_table->key_del) {
- a_table->key_del(p->key);
- }
- if (a_table->value_del) {
- a_table->value_del(p->value);
- }
-
- if (p->next) {
- p->next->prev = p->prev;
- }
- if (p->prev) {
- p->prev->next = p->next;
- } else {
- unsigned int i;
-
- i = p->hash_key % a_table->tab_size;
- a_table->tab[i] = p->next;
- }
-
- free(p);
- a_table->nelem--;
-
- return;
-}
-
-zc_hashtable_entry_t *zc_hashtable_begin(zc_hashtable_t * a_table)
-{
- size_t i;
- zc_hashtable_entry_t *p;
-
- for (i = 0; i < a_table->tab_size; i++) {
- for (p = (a_table->tab)[i]; p; p = p->next) {
- if (p)
- return p;
- }
- }
-
- return NULL;
-}
-
-zc_hashtable_entry_t *zc_hashtable_next(zc_hashtable_t * a_table, zc_hashtable_entry_t * a_entry)
-{
- size_t i;
- size_t j;
-
- if (a_entry->next)
- return a_entry->next;
-
- i = a_entry->hash_key % a_table->tab_size;
-
- for (j = i + 1; j < a_table->tab_size; j++) {
- if ((a_table->tab)[j]) {
- return (a_table->tab)[j];
- }
- }
-
- return NULL;
-}
-
-/*******************************************************************************/
-
-unsigned int zc_hashtable_str_hash(const void *str)
-{
- unsigned int h = 5381;
- const char *p = (const char *)str;
-
- while (*p != '\0')
- h = ((h << 5) + h) + (*p++); /* hash * 33 + c */
-
- return h;
-}
-
-int zc_hashtable_str_equal(const void *key1, const void *key2)
-{
- return (STRCMP((const char *)key1, ==, (const char *)key2));
-}
generated by cgit v1.2.3 (git 2.39.1) at 2025-12-30 18:21:55 +0000