Kyoshiro/bip
1
0
Fork 0
forked from bip/bip
Code Pull Requests Activity

Hash fonction just for fun.

Browse Source
This commit is contained in:
nohar 2006-12-08 21:08:23 +00:00
parent 70ae216122
commit 4e12ff1c94
1 changed files with 9 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
src/util.c
View File

@ -396,7 +396,7 @@ void list_append(list_t *src, list_t *dest)
struct hash_item {
char *key;
void *item;
};
};
static int hash_item_nocase_cmp(struct hash_item *a, char *b)
{
@ -453,12 +453,15 @@ hash_t *hash_new(int options)
return h;
}
/* Now we have a real hash, but we use only the last byte of it :p */
static unsigned char hash_func(char *pkey)
{
unsigned char i = 0;
while (*pkey)
i += (unsigned char)toupper(*pkey++);
return i;
char c;
unsigned long hash = 5381; /* 5381 & 0xff makes more sense */
while (c = *pkey++)
hash = ((hash << 5) + hash) ^ c;
return (unsigned char)hash;
}
void hash_insert(hash_t *hash, char *key, void *ptr)
@ -467,7 +470,7 @@ void hash_insert(hash_t *hash, char *key, void *ptr)
if (hash_get(hash, key))
fatal("Element with key %s already in hash %x\n", key, hash);
it = malloc(sizeof(struct hash_item));
if (!it)
fatal("malloc");