summaryrefslogtreecommitdiffstats
path: root/Source/CTest/Curl/hash.c
diff options
context:
space:
mode:
authorAndy Cedilnik <andy.cedilnik@kitware.com>2003-01-10 04:26:37 (GMT)
committerAndy Cedilnik <andy.cedilnik@kitware.com>2003-01-10 04:26:37 (GMT)
commit3ad91bf9d39c22dc6941068e6fdc1453988f0b07 (patch)
tree19e8dd0c44daf44ad8600de820752b39e385785f /Source/CTest/Curl/hash.c
parent382d0d447497549b6db54b052b6eb3cc45f5d182 (diff)
downloadCMake-3ad91bf9d39c22dc6941068e6fdc1453988f0b07.zip
CMake-3ad91bf9d39c22dc6941068e6fdc1453988f0b07.tar.gz
CMake-3ad91bf9d39c22dc6941068e6fdc1453988f0b07.tar.bz2
New version of libcurl
Diffstat (limited to 'Source/CTest/Curl/hash.c')
-rw-r--r--Source/CTest/Curl/hash.c311
1 files changed, 167 insertions, 144 deletions
diff --git a/Source/CTest/Curl/hash.c b/Source/CTest/Curl/hash.c
index 584c30e..56e7077 100644
--- a/Source/CTest/Curl/hash.c
+++ b/Source/CTest/Curl/hash.c
@@ -1,30 +1,31 @@
-/*****************************************************************************
+/***************************************************************************
* _ _ ____ _
* Project ___| | | | _ \| |
* / __| | | | |_) | |
* | (__| |_| | _ <| |___
* \___|\___/|_| \_\_____|
*
- * Copyright (C) 2002, Daniel Stenberg, <daniel@haxx.se>, et al
- *
- * In order to be useful for every potential user, curl and libcurl are
- * dual-licensed under the MPL and the MIT/X-derivate licenses.
+ * Copyright (C) 1998 - 2002, Daniel Stenberg, <daniel@haxx.se>, et al.
*
+ * This software is licensed as described in the file COPYING, which
+ * you should have received as part of this distribution. The terms
+ * are also available at http://curl.haxx.se/docs/copyright.html.
+ *
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
* copies of the Software, and permit persons to whom the Software is
- * furnished to do so, under the terms of the MPL or the MIT/X-derivate
- * licenses. You may pick one of these licenses.
+ * furnished to do so, under the terms of the COPYING file.
*
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
* KIND, either express or implied.
*
* $Id$
- *****************************************************************************/
+ ***************************************************************************/
#include "setup.h"
#include <string.h>
#include <stdlib.h>
+
#include "hash.h"
#include "llist.h"
@@ -34,55 +35,45 @@
#endif
-static unsigned long
-curl_hash_str(const char *key, unsigned int key_length)
+/* {{{ static unsigned long _hash_str (const char *, size_t)
+ */
+static unsigned long
+_hash_str (const char *key, size_t key_length)
{
- register unsigned long h = 0;
- register unsigned long g;
- register char *p = (char *) key;
- register char *end = (char *) key + key_length;
-
- while (p < end) {
- h = (h << 4) + *p++;
- if ((g = (h & 0xF0000000))) {
- h = h ^ (g >> 24);
- h = h ^ g;
- }
+ char *end = (char *) key + key_length;
+ unsigned long h = 5381;
+
+ while (key < end) {
+ h += h << 5;
+ h ^= (unsigned long) *key++;
}
return h;
}
+/* }}} */
-static unsigned long
-curl_hash_num(unsigned long key)
-{
- key += ~(key << 15);
- key ^= (key >> 10);
- key += (key << 3);
- key ^= (key >> 6);
- key += (key << 11);
- key ^= (key >> 16);
-
- return key;
-}
-
+/* {{{ static void _hash_element_dtor (void *, void *)
+ */
static void
-hash_element_dtor(void *u, void *ele)
+_hash_element_dtor (void *user, void *element)
{
- curl_hash_element *e = (curl_hash_element *) ele;
- curl_hash *h = (curl_hash *) u;
-
- if (e->key.type == CURL_HASH_KEY_IS_STRING) {
- free(e->key.value.str.val);
+ curl_hash *h = (curl_hash *) user;
+ curl_hash_element *e = (curl_hash_element *) element;
+
+ if (e->key) {
+ free(e->key);
}
+
h->dtor(e->ptr);
free(e);
- e = NULL;
}
+/* }}} */
+/* {{{ void curl_hash_init (curl_hash *, int, curl_hash_dtor)
+ */
void
-curl_hash_init(curl_hash *h, int slots, curl_hash_dtor dtor)
+Curl_hash_init (curl_hash *h, int slots, curl_hash_dtor dtor)
{
int i;
@@ -91,116 +82,110 @@ curl_hash_init(curl_hash *h, int slots, curl_hash_dtor dtor)
h->slots = slots;
h->table = (curl_llist **) malloc(slots * sizeof(curl_llist *));
- for (i = 0; i < h->slots; ++i) {
- h->table[i] = curl_llist_alloc((curl_llist_dtor) hash_element_dtor);
+ for (i = 0; i < slots; ++i) {
+ h->table[i] = Curl_llist_alloc((curl_llist_dtor) _hash_element_dtor);
}
}
+/* }}} */
+/* {{{ curl_hash *curl_hash_alloc (int, curl_hash_dtor)
+ */
curl_hash *
-curl_hash_alloc(int slots, curl_hash_dtor dtor)
+Curl_hash_alloc (int slots, curl_hash_dtor dtor)
{
curl_hash *h;
- h = (curl_hash *)malloc(sizeof(curl_hash));
- if(NULL == h)
+ h = (curl_hash *) malloc(sizeof(curl_hash));
+ if (NULL == h)
return NULL;
- curl_hash_init(h, slots, dtor);
+ Curl_hash_init(h, slots, dtor);
return h;
}
+/* }}} */
-#define FIND_SLOT(__h, __s_key, __s_key_len, __n_key) \
- ((__s_key ? curl_hash_str(__s_key, __s_key_len) : curl_hash_num(__n_key)) % (__h)->slots)
-
-#define KEY_CREATE(__k, __s_key, __s_key_len, __n_key, __dup) \
- if (__s_key) { \
- if (__dup) { \
- (__k)->value.str.val = (char *) malloc(__s_key_len); \
- memcpy((__k)->value.str.val, __s_key, __s_key_len); \
- } else { \
- (__k)->value.str.val = __s_key; \
- } \
- (__k)->value.str.len = __s_key_len; \
- (__k)->type = CURL_HASH_KEY_IS_STRING; \
- } else { \
- (__k)->value.num = __n_key; \
- (__k)->type = CURL_HASH_KEY_IS_NUM; \
+/* {{{ static int _hash_key_compare (char *, size_t, char *, size_t)
+ */
+static int
+_hash_key_compare (char *key1, size_t key1_len, char *key2, size_t key2_len)
+{
+ if (key1_len == key2_len &&
+ *key1 == *key2 &&
+ memcmp(key1, key2, key1_len) == 0) {
+ return 1;
}
-#define MIN(a, b) (a > b ? b : a)
+ return 0;
+}
+/* }}} */
-static int
-curl_hash_key_compare(curl_hash_key *key1, curl_hash_key *key2)
+/* {{{ static int _mk_hash_element (curl_hash_element **, char *, size_t, const void *)
+ */
+static int
+_mk_hash_element (curl_hash_element **e, char *key, size_t key_len, const void *p)
{
- if (key1->type == CURL_HASH_KEY_IS_NUM) {
- if (key2->type == CURL_HASH_KEY_IS_STRING)
- return 0;
+ *e = (curl_hash_element *) malloc(sizeof(curl_hash_element));
+ (*e)->key = strdup(key);
+ (*e)->key_len = key_len;
+ (*e)->ptr = (void *) p;
+ return 0;
+}
+/* }}} */
- if (key1->value.num == key2->value.num)
- return 1;
- } else {
- if (key2->type == CURL_HASH_KEY_IS_NUM)
- return 0;
+#define find_slot(__h, __k, __k_len) (_hash_str(__k, __k_len) % (__h)->slots)
- if (memcmp(key1->value.str.val, key2->value.str.val,
- MIN(key1->value.str.len, key2->value.str.len)) == 0)
- return 1;
- }
+#define FETCH_LIST \
+ curl_llist *l = h->table[find_slot(h, key, key_len)]
- return 0;
-}
+/* {{{ int curl_hash_add (curl_hash *, char *, size_t, const void *)
+ */
int
-curl_hash_add_or_update(curl_hash *h, char *str_key, unsigned int str_key_len,
- unsigned long num_key, const void *p)
+Curl_hash_add (curl_hash *h, char *key, size_t key_len, const void *p)
{
- curl_hash_element *e;
- curl_hash_key tmp;
- curl_llist *l;
+ curl_hash_element *he;
curl_llist_element *le;
- int slot;
-
- slot = FIND_SLOT(h, str_key, str_key_len, num_key);
- l = h->table[slot];
- KEY_CREATE(&tmp, str_key, str_key_len, num_key, 0);
- for (le = CURL_LLIST_HEAD(l); le != NULL; le = CURL_LLIST_NEXT(le)) {
- if (curl_hash_key_compare(&tmp, &((curl_hash_element *) CURL_LLIST_VALP(le))->key)) {
- curl_hash_element *to_update = CURL_LLIST_VALP(le);
- h->dtor(to_update->ptr);
- to_update->ptr = (void *) p;
+ FETCH_LIST;
+
+ for (le = CURL_LLIST_HEAD(l);
+ le != NULL;
+ le = CURL_LLIST_NEXT(le)) {
+ he = (curl_hash_element *) CURL_LLIST_VALP(le);
+ if (_hash_key_compare(he->key, he->key_len, key, key_len)) {
+ h->dtor(he->ptr);
+ he->ptr = (void *) p;
return 1;
}
}
- e = (curl_hash_element *) malloc(sizeof(curl_hash_element));
- KEY_CREATE(&e->key, str_key, str_key_len, num_key, 1);
- e->ptr = (void *) p;
+ if (_mk_hash_element(&he, key, key_len, p) != 0)
+ return 0;
- if (curl_llist_insert_next(l, CURL_LLIST_TAIL(l), e)) {
+ if (Curl_llist_insert_next(l, CURL_LLIST_TAIL(l), he)) {
++h->size;
return 1;
- } else {
- return 0;
}
+
+ return 0;
}
+/* }}} */
+/* {{{ int curl_hash_delete (curl_hash *, char *, size_t)
+ */
int
-curl_hash_extended_delete(curl_hash *h, char *str_key, unsigned int str_key_len,
- unsigned long num_key)
+Curl_hash_delete(curl_hash *h, char *key, size_t key_len)
{
- curl_llist *l;
+ curl_hash_element *he;
curl_llist_element *le;
- curl_hash_key tmp;
- int slot;
-
- slot = FIND_SLOT(h, str_key, str_key_len, num_key);
- l = h->table[slot];
-
- KEY_CREATE(&tmp, str_key, str_key_len, num_key, 0);
- for (le = CURL_LLIST_HEAD(l); le != NULL; le = CURL_LLIST_NEXT(le)) {
- if (curl_hash_key_compare(&tmp, &((curl_hash_element *) CURL_LLIST_VALP(le))->key)) {
- curl_llist_remove(l, le, (void *) h);
+ FETCH_LIST;
+
+ for (le = CURL_LLIST_HEAD(l);
+ le != NULL;
+ le = CURL_LLIST_NEXT(le)) {
+ he = CURL_LLIST_VALP(le);
+ if (_hash_key_compare(he->key, he->key_len, key, key_len)) {
+ Curl_llist_remove(l, le, (void *) h);
--h->size;
return 1;
}
@@ -208,73 +193,111 @@ curl_hash_extended_delete(curl_hash *h, char *str_key, unsigned int str_key_len,
return 0;
}
+/* }}} */
-int
-curl_hash_extended_find(curl_hash *h, char *str_key, unsigned int str_key_len,
- unsigned long num_key, void **p)
+/* {{{ int curl_hash_pick (curl_hash *, char *, size_t, void **)
+ */
+void *
+Curl_hash_pick(curl_hash *h, char *key, size_t key_len)
{
- curl_llist *l;
curl_llist_element *le;
- curl_hash_key tmp;
- int slot;
-
- slot = FIND_SLOT(h, str_key, str_key_len, num_key);
- l = h->table[slot];
-
- KEY_CREATE(&tmp, str_key, str_key_len, num_key, 0);
- for (le = CURL_LLIST_HEAD(l); le != NULL; le = CURL_LLIST_NEXT(le)) {
- if (curl_hash_key_compare(&tmp, &((curl_hash_element *) CURL_LLIST_VALP(le))->key)) {
- *p = ((curl_hash_element *) CURL_LLIST_VALP(le))->ptr;
- return 1;
+ curl_hash_element *he;
+ FETCH_LIST;
+
+ for (le = CURL_LLIST_HEAD(l);
+ le != NULL;
+ le = CURL_LLIST_NEXT(le)) {
+ he = CURL_LLIST_VALP(le);
+ if (_hash_key_compare(he->key, he->key_len, key, key_len)) {
+ return he->ptr;
}
}
- return 0;
+ return NULL;
}
+/* }}} */
+/* {{{ void curl_hash_apply (curl_hash *, void *, void (*)(void *, curl_hash_element *))
+ */
void
-curl_hash_apply(curl_hash *h, void *user, void (*cb)(void *, curl_hash_element *))
+Curl_hash_apply(curl_hash *h, void *user,
+ void (*cb)(void *user, void *ptr))
{
curl_llist_element *le;
int i;
for (i = 0; i < h->slots; ++i) {
- for (le = CURL_LLIST_HEAD(h->table[i]); le != NULL; le = CURL_LLIST_NEXT(le)) {
- cb(user, (curl_hash_element *) CURL_LLIST_VALP(le));
+ for (le = CURL_LLIST_HEAD(h->table[i]);
+ le != NULL;
+ le = CURL_LLIST_NEXT(le)) {
+ curl_hash_element *el = CURL_LLIST_VALP(le);
+ cb(user, el->ptr);
}
}
}
+/* }}} */
+/* {{{ void curl_hash_clean (curl_hash *)
+ */
void
-curl_hash_clean(curl_hash *h)
+Curl_hash_clean(curl_hash *h)
{
int i;
for (i = 0; i < h->slots; ++i) {
- curl_llist_destroy(h->table[i], (void *) h);
+ Curl_llist_destroy(h->table[i], (void *) h);
}
free(h->table);
- h->table = NULL;
}
+/* }}} */
-size_t
-curl_hash_count(curl_hash *h)
+/* {{{ void curl_hash_clean_with_criterium (curl_hash *, void *,
+ int (*)(void *, void *))
+ */
+void
+Curl_hash_clean_with_criterium(curl_hash *h, void *user,
+ int (*comp)(void *, void *))
+{
+ curl_llist_element *le;
+ curl_llist_element *lnext;
+ int i;
+
+ for (i = 0; i < h->slots; ++i) {
+ le = CURL_LLIST_HEAD(h->table[i]);
+ while(le != NULL)
+ if (comp(user, ((curl_hash_element *) CURL_LLIST_VALP(le))->ptr)) {
+ lnext = CURL_LLIST_NEXT(le);
+ Curl_llist_remove(h->table[i], le, (void *) h);
+ --h->size;
+ le = lnext;
+ }
+ else
+ le = CURL_LLIST_NEXT(le);
+ }
+}
+
+/* {{{ int curl_hash_count (curl_hash *)
+ */
+int
+Curl_hash_count(curl_hash *h)
{
return h->size;
}
+/* }}} */
+/* {{{ void curl_hash_destroy (curl_hash *)
+ */
void
-curl_hash_destroy(curl_hash *h)
+Curl_hash_destroy(curl_hash *h)
{
- if (!h) {
+ if (!h)
return;
- }
- curl_hash_clean(h);
+ Curl_hash_clean(h);
free(h);
- h = NULL;
}
+/* }}} */
/*
* local variables: