141 lines
4 KiB
C
141 lines
4 KiB
C
/* _,.---._ .-._ .--.-. ,--.--------.
|
|
* _,..---._ ,-.' , - `. /==/ \ .-._/==/ //==/, - , -\
|
|
* /==/, - \ /==/_, , - \|==|, \/ /, |==\ -\\==\.-. - ,-./
|
|
* |==| _ _\==| .=. |==|- \| | \==\- \`--`\==\- \
|
|
* |==| .=. |==|_ : ;=: - |==| , | -| `--`-' \==\_ \
|
|
* |==|,| | -|==| , '=' |==| - _ | |==|- |
|
|
* |==| '=' /\==\ - ,_ /|==| /\ , | |==|, |
|
|
* |==|-, _`/ '.='. - .' /==/, | |- | /==/ -/
|
|
* `-.`.____.' `--`--'' `--`./ `--` `--`--`
|
|
* _ __ ,---. .-._ .=-.-. _,.----.
|
|
* .-`.' ,`..--.' \ /==/ \ .-._ /==/_ /.' .' - \
|
|
* /==/, - \==\-/\ \ |==|, \/ /, /==|, |/==/ , ,-'
|
|
* |==| _ .=. /==/-|_\ | |==|- \| ||==| ||==|- | .
|
|
* |==| , '=',\==\, - \ |==| , | -||==|- ||==|_ `-' \
|
|
* |==|- '..'/==/ - ,| |==| - _ ||==| ,||==| _ , |
|
|
* |==|, | /==/- /\ - \|==| /\ , ||==|- |\==\. /
|
|
* /==/ - | \==\ _.\=\.-'/==/, | |- |/==/. / `-.`.___.-'
|
|
* `--`---' `--` `--`./ `--``--`-`
|
|
*
|
|
* @(#)Copyright (c) 2023, Nathan D. Fisher.
|
|
*
|
|
* This is free software. It comes with NO WARRANTY.
|
|
* Permission to use, modify and distribute this source code
|
|
* is granted subject to the following conditions.
|
|
* 1/ that the above copyright notice and this notice
|
|
* are preserved in all copies and that due credit be given
|
|
* to the author.
|
|
* 2/ that any changes to this code are clearly commented
|
|
* as such so that the author does not get blamed for bugs
|
|
* other than his own.
|
|
*/
|
|
|
|
#include <stddef.h>
|
|
#include <stdint.h>
|
|
#include <stdlib.h>
|
|
#include <sys/stat.h>
|
|
#include <sys/types.h>
|
|
|
|
#include "haggis.h"
|
|
#include "haggis_private.h"
|
|
|
|
#define FNV64_OFFSET_BASIS 14695981039346656037u
|
|
#define FNV64_PRIME 1099511628211u
|
|
|
|
uint64_t hash_fnv1a_64(uint8_t *key, size_t len) {
|
|
int i;
|
|
uint64_t hash = FNV64_OFFSET_BASIS;
|
|
|
|
for (i = 0; i < len; i++) {
|
|
hash = hash ^ *key;
|
|
hash = hash * FNV64_PRIME;
|
|
key++;
|
|
}
|
|
return hash;
|
|
}
|
|
|
|
struct _map_node {
|
|
struct _map_node *next;
|
|
void * key;
|
|
uint64_t hash;
|
|
void *data;
|
|
};
|
|
|
|
typedef struct _map_node hmap_node;
|
|
|
|
typedef struct {
|
|
size_t capacity;
|
|
size_t len;
|
|
hmap_node *buckets;
|
|
} hmap;
|
|
|
|
hmap_node* hmap_node_init(void *key, size_t keysize, void *data) {
|
|
hmap_node *node;
|
|
uint64_t hash;
|
|
|
|
hash = hash_fnv1a_64(key, keysize);
|
|
node = calloc(1, sizeof(hmap_node));
|
|
if (node == NULL) return NULL;
|
|
node->key = key;
|
|
node->hash = hash;
|
|
node->data = data;
|
|
return node;
|
|
}
|
|
|
|
void* hmap_node_attach(hmap_node *root, hmap_node *leaf) {
|
|
void *ret = NULL;
|
|
|
|
while (1) {
|
|
if (root->key == leaf->key) {
|
|
ret = root->data;
|
|
root->data = leaf->data;
|
|
return ret;
|
|
} else if (root->next == NULL) {
|
|
root->next = leaf;
|
|
break;
|
|
} else {
|
|
root = root->next;
|
|
}
|
|
}
|
|
return NULL;
|
|
// todo
|
|
}
|
|
|
|
hmap* hmap_init() {
|
|
hmap* map;
|
|
|
|
map = calloc(1, sizeof(hmap));
|
|
if (map == NULL) return NULL;
|
|
map->len = 0;
|
|
map->capacity = 64;
|
|
map->buckets = calloc(64, sizeof(size_t));
|
|
if (map->buckets == NULL) {
|
|
free(map);
|
|
return NULL;
|
|
}
|
|
return map;
|
|
}
|
|
|
|
int hmap_expand(hmap *map) {
|
|
return 0;
|
|
}
|
|
|
|
hmap_node* hmap_insert(hmap * map, void *key, size_t keysize, void *data) {
|
|
hmap_node *node;
|
|
size_t idx;
|
|
hmap_node *ret = NULL;
|
|
|
|
if (map->len >= map->capacity / 2) {
|
|
if (hmap_expand(map)) return NULL;
|
|
}
|
|
node = hmap_node_init(key, keysize, data);
|
|
if (node == NULL) return NULL;
|
|
idx = node->hash % map->capacity;
|
|
if (map->buckets[idx].key == NULL) {
|
|
map->buckets[idx] = *node;
|
|
} else {
|
|
ret = hmap_node_attach(&map->buckets[idx], node);
|
|
}
|
|
// todo
|
|
return ret;
|
|
}
|