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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
|
/*
* Ouroboros - Copyright (C) 2016 - 2017
*
* Hash table with separate chaining on collisions
*
* Dimitri Staessens <dimitri.staessens@ugent.be>
* Sander Vrijders <sander.vrijders@ugent.be>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public License
* version 2.1 as published by the Free Software Foundation.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., http://www.fsf.org/about/contact/.
*/
#include <ouroboros/hashtable.h>
#include <ouroboros/list.h>
#include <ouroboros/errno.h>
#include <assert.h>
struct htable_entry {
struct list_head next;
uint64_t key;
void * val;
};
struct htable {
struct list_head * buckets;
bool hash_key;
uint64_t buckets_size;
};
struct htable * htable_create(uint64_t buckets, bool hash_key)
{
struct htable * tmp;
unsigned int i;
if (buckets == 0)
return NULL;
buckets--;
buckets |= buckets >> 1;
buckets |= buckets >> 2;
buckets |= buckets >> 4;
buckets |= buckets >> 8;
buckets |= buckets >> 16;
buckets |= buckets >> 32;
buckets++;
tmp = malloc(sizeof(*tmp));
if (tmp == NULL)
return NULL;
tmp->hash_key = hash_key;
tmp->buckets_size = buckets;
tmp->buckets = malloc(buckets * sizeof(*tmp->buckets));
if (tmp->buckets == NULL) {
free(tmp);
return NULL;
}
for (i = 0; i < buckets; i++)
list_head_init(&(tmp->buckets[i]));
return tmp;
}
void htable_destroy(struct htable * table)
{
assert(table);
assert(table->buckets);
htable_flush(table);
free(table->buckets);
free(table);
}
void htable_flush(struct htable * table)
{
unsigned int i;
struct list_head * pos = NULL;
struct list_head * n = NULL;
struct htable_entry * entry;
assert(table);
for (i = 0; i < table->buckets_size; i++) {
list_for_each_safe(pos, n, &(table->buckets[i])) {
entry = list_entry(pos, struct htable_entry, next);
list_del(&entry->next);
free(entry->val);
free(entry);
}
}
}
static uint64_t hash(uint64_t x)
{
x = (x ^ (x >> 30)) * UINT64_C(0xbf58476d1ce4e5b9);
x = (x ^ (x >> 27)) * UINT64_C(0x94d049bb133111eb);
x = x ^ (x >> 31);
return x;
}
static uint64_t calc_key(struct htable * table, uint64_t key)
{
if (table->hash_key == true)
key = hash(key);
return (key & (table->buckets_size - 1));
}
int htable_insert(struct htable * table, uint64_t key, void * val)
{
struct htable_entry * entry;
uint64_t lookup_key;
struct list_head * pos = NULL;
assert(table);
lookup_key = calc_key(table, key);
list_for_each(pos, &(table->buckets[lookup_key])) {
entry = list_entry(pos, struct htable_entry, next);
if (entry->key == key)
return -1;
}
entry = malloc(sizeof(*entry));
if (entry == NULL)
return -ENOMEM;
entry->key = key;
entry->val = val;
list_head_init(&entry->next);
list_add(&entry->next, &(table->buckets[lookup_key]));
return 0;
}
void * htable_lookup(struct htable * table, uint64_t key)
{
struct htable_entry * entry;
struct list_head * pos = NULL;
uint64_t lookup_key;
assert(table);
lookup_key = calc_key(table, key);
list_for_each(pos, &(table->buckets[lookup_key])) {
entry = list_entry(pos, struct htable_entry, next);
if (entry->key == key)
return entry->val;
}
return NULL;
}
int htable_delete(struct htable * table, uint64_t key)
{
struct htable_entry * entry;
uint64_t lookup_key;
struct list_head * pos = NULL;
struct list_head * n = NULL;
assert(table);
lookup_key = calc_key(table, key);
list_for_each_safe(pos, n, &(table->buckets[lookup_key])) {
entry = list_entry(pos, struct htable_entry, next);
if (entry->key == key) {
list_del(&entry->next);
free(entry->val);
free(entry);
return 0;
}
}
return -1;
}
|
