127 lines
2.6 KiB
C
127 lines
2.6 KiB
C
#include <system.h>
|
|
#include <logging.h>
|
|
#include <hashmap.h>
|
|
|
|
/* This is a really bad hash */
|
|
static unsigned int hashmap_default_hash(char * key) {
|
|
unsigned int hash = 0;
|
|
while (*key) {
|
|
hash += (unsigned int)(*(char *)key);
|
|
key++;
|
|
}
|
|
return hash;
|
|
}
|
|
|
|
hashmap_t * hashmap_create(int size) {
|
|
hashmap_t * map = malloc(sizeof(hashmap_t));
|
|
|
|
map->hash_func = hashmap_default_hash;
|
|
map->size = size;
|
|
map->entries = malloc(sizeof(hashmap_entry_t *) * size);
|
|
memset(map->entries, 0x00, sizeof(hashmap_entry_t *) * size);
|
|
|
|
return map;
|
|
}
|
|
|
|
void * hashmap_set(hashmap_t * map, char * key, void * value) {
|
|
unsigned int hash = map->hash_func(key) % map->size;
|
|
|
|
hashmap_entry_t * x = map->entries[hash];
|
|
if (!x) {
|
|
debug_print(WARNING, "Inserting without collision: %s (0x%x) hash=%d", key, value, hash);
|
|
hashmap_entry_t * e = malloc(sizeof(hashmap_entry_t));
|
|
e->key = strdup(key);
|
|
e->value = value;
|
|
e->next = NULL;
|
|
map->entries[hash] = e;
|
|
return NULL;
|
|
} else {
|
|
debug_print(WARNING, "Hash collision: %s (0x%x) hash=%d", key, value, hash);
|
|
hashmap_entry_t * p = NULL;
|
|
do {
|
|
debug_print(WARNING, "x: %s:0x%x compared to %s", x->key, x->value, key);
|
|
if (!strcmp(x->key, key)) {
|
|
void * out = x->value;
|
|
x->value = value;
|
|
return out;
|
|
} else {
|
|
p = x;
|
|
x = x->next;
|
|
}
|
|
} while (x);
|
|
hashmap_entry_t * e = malloc(sizeof(hashmap_entry_t));
|
|
e->key = strdup(key);
|
|
e->value = value;
|
|
e->next = NULL;
|
|
|
|
p->next = e;
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
void * hashmap_get(hashmap_t * map, char * key) {
|
|
unsigned int hash = map->hash_func(key) % map->size;
|
|
|
|
hashmap_entry_t * x = map->entries[hash];
|
|
if (!x) {
|
|
return NULL;
|
|
} else {
|
|
do {
|
|
if (!strcmp(x->key, key)) {
|
|
return x->value;
|
|
}
|
|
x = x->next;
|
|
} while (x);
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
void * hashmap_remove(hashmap_t * map, char * key) {
|
|
unsigned int hash = map->hash_func(key) % map->size;
|
|
|
|
hashmap_entry_t * x = map->entries[hash];
|
|
if (!x) {
|
|
return NULL;
|
|
} else {
|
|
if (!strcmp(x->key, key)) {
|
|
void * out = x->value;
|
|
map->entries[hash] = x->next;
|
|
free(x);
|
|
return out;
|
|
} else {
|
|
hashmap_entry_t * p = x;
|
|
x = x->next;
|
|
do {
|
|
if (!strcmp(x->key, key)) {
|
|
void * out = x->value;
|
|
p->next = x->next;
|
|
free(x);
|
|
return out;
|
|
}
|
|
p = x;
|
|
x = x->next;
|
|
} while (x);
|
|
}
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
int hashmap_has(hashmap_t * map, char * key) {
|
|
unsigned int hash = map->hash_func(key) % map->size;
|
|
|
|
hashmap_entry_t * x = map->entries[hash];
|
|
if (!x) {
|
|
return 0;
|
|
} else {
|
|
do {
|
|
if (!strcmp(x->key, key)) {
|
|
return 1;
|
|
}
|
|
x = x->next;
|
|
} while (x);
|
|
return 0;
|
|
}
|
|
|
|
}
|
|
|