1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
|
/*
This file is part of ct.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with Takwrap. If not, see <https://www.gnu.org/licenses/>.
*/
#include "hashtable.h"
// ===================================================================
// Helper declarations
// ===================================================================
ht_entry_t * new_ll_node(const uint64_t key, void *data);
// ===================================================================
// Exported functions
// ===================================================================
hashtable_t *ht_init(void) {
hashtable_t *table = malloc(sizeof(struct hashtable_s));
table->num_entries = 0;
for (uint32_t k=0; k<=HASHTABLE_SIZE; k++)
table->entries[k] = NULL;
return EXIT_SUCCESS;
}
void ht_free(void *data_free(void*), hashtable_t *table) {
ht_entry_t *n, *nn;
for (uint32_t k=0; k<=HASHTABLE_SIZE; k++) {
n = table->entries[k];
while (n) {
nn = n->next;
data_free(n->data);
free(n);
n = nn;
}
}
}
ht_entry_t *ht_seek(const uint64_t key, hashtable_t *table) {
ht_entry_t *lookup = table->entries[key & HASHTABLE_SIZE];
while (lookup && lookup->key != key)
lookup = lookup->next;
return lookup;
}
int ht_insert(const uint64_t key, void *data, hashtable_t *table) {
ht_entry_t *new = new_ll_node(key, data), *n;
// TODO: trap
const uint32_t idx = key & HASHTABLE_SIZE;
if ((n = table->entries[idx]) != NULL) {
for (; n->next != NULL; n = n->next);
n->next = new;
} else {
table->entries[idx] = new;
}
table->num_entries++;
return EXIT_SUCCESS;
}
// ===================================================================
// Helper function implementations
// ===================================================================
ht_entry_t *new_ll_node(const uint64_t key, void *data) {
ht_entry_t *new = malloc(sizeof(struct ht_node_s));
// TODO: trap errno
new->key = key;
new->next = NULL;
new->data = data;
return new;
}
|
