1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright 2016, Olivier MATZ <zer0@droids-corp.org>
15 #include <ecoli_init.h>
16 #include <ecoli_malloc.h>
17 #include <ecoli_log.h>
18 #include <ecoli_test.h>
19 #include <ecoli_murmurhash.h>
20 #include <ecoli_keyval.h>
24 EC_LOG_TYPE_REGISTER(keyval);
26 static uint32_t ec_keyval_seed;
28 struct ec_keyval_elt {
32 ec_keyval_elt_free_t free;
33 unsigned int refcount;
36 struct ec_keyval_elt_ref {
37 TAILQ_ENTRY(ec_keyval_elt_ref) next;
38 TAILQ_ENTRY(ec_keyval_elt_ref) hnext;
39 struct ec_keyval_elt *elt;
42 TAILQ_HEAD(ec_keyval_elt_ref_list, ec_keyval_elt_ref);
47 struct ec_keyval_elt_ref_list list;
48 struct ec_keyval_elt_ref_list *table;
51 struct ec_keyval *ec_keyval(void)
53 struct ec_keyval *keyval;
55 keyval = ec_calloc(1, sizeof(*keyval));
58 TAILQ_INIT(&keyval->list);
63 static struct ec_keyval_elt_ref *
64 ec_keyval_lookup(const struct ec_keyval *keyval, const char *key)
66 struct ec_keyval_elt_ref *ref;
67 uint32_t h, mask = keyval->table_size - 1;
69 if (keyval == NULL || key == NULL) {
73 if (keyval->table_size == 0) {
78 h = ec_murmurhash3(key, strlen(key), ec_keyval_seed);
79 TAILQ_FOREACH(ref, &keyval->table[h & mask], hnext) {
80 if (strcmp(ref->elt->key, key) == 0)
88 static void ec_keyval_elt_ref_free(struct ec_keyval_elt_ref *ref)
90 struct ec_keyval_elt *elt;
96 if (elt != NULL && --elt->refcount == 0) {
98 if (elt->free != NULL)
105 bool ec_keyval_has_key(const struct ec_keyval *keyval, const char *key)
107 return !!ec_keyval_lookup(keyval, key);
110 void *ec_keyval_get(const struct ec_keyval *keyval, const char *key)
112 struct ec_keyval_elt_ref *ref;
114 ref = ec_keyval_lookup(keyval, key);
118 return ref->elt->val;
121 int ec_keyval_del(struct ec_keyval *keyval, const char *key)
123 struct ec_keyval_elt_ref *ref;
126 ref = ec_keyval_lookup(keyval, key);
130 /* we could resize table here */
132 TAILQ_REMOVE(&keyval->list, ref, next);
133 idx = ref->elt->hash & (keyval->table_size - 1);
134 TAILQ_REMOVE(&keyval->table[idx], ref, hnext);
135 ec_keyval_elt_ref_free(ref);
141 static int ec_keyval_table_resize(struct ec_keyval *keyval, size_t new_size)
143 struct ec_keyval_elt_ref_list *new_table;
144 struct ec_keyval_elt_ref *ref;
147 if (new_size == 0 || (new_size & (new_size - 1))) {
152 new_table = ec_calloc(new_size, sizeof(*keyval->table));
153 if (new_table == NULL)
155 for (i = 0; i < new_size; i++)
156 TAILQ_INIT(&new_table[i]);
158 TAILQ_FOREACH(ref, &keyval->list, next) {
159 i = ref->elt->hash & (keyval->table_size - 1);
160 TAILQ_REMOVE(&keyval->table[i], ref, hnext);
161 i = ref->elt->hash & (new_size - 1);
162 TAILQ_INSERT_TAIL(&new_table[i], ref, hnext);
165 ec_free(keyval->table);
166 keyval->table = new_table;
167 keyval->table_size = new_size;
173 __ec_keyval_set(struct ec_keyval *keyval, struct ec_keyval_elt_ref *ref)
179 /* remove previous entry if any */
180 ec_keyval_del(keyval, ref->elt->key);
182 if (keyval->len >= keyval->table_size) {
183 if (keyval->table_size != 0)
184 new_size = keyval->table_size << FACTOR;
186 new_size = 1 << FACTOR;
187 ret = ec_keyval_table_resize(keyval, new_size);
192 mask = keyval->table_size - 1;
193 TAILQ_INSERT_TAIL(&keyval->table[ref->elt->hash & mask], ref, hnext);
194 TAILQ_INSERT_TAIL(&keyval->list, ref, next);
200 int ec_keyval_set(struct ec_keyval *keyval, const char *key, void *val,
201 ec_keyval_elt_free_t free_cb)
203 struct ec_keyval_elt *elt = NULL;
204 struct ec_keyval_elt_ref *ref = NULL;
207 if (keyval == NULL || key == NULL) {
212 ref = ec_calloc(1, sizeof(*ref));
216 elt = ec_calloc(1, sizeof(*elt));
225 elt->key = ec_strdup(key);
226 if (elt->key == NULL)
228 h = ec_murmurhash3(key, strlen(key), ec_keyval_seed);
231 if (__ec_keyval_set(keyval, ref) < 0)
237 if (free_cb != NULL && val != NULL)
239 ec_keyval_elt_ref_free(ref);
243 void ec_keyval_free(struct ec_keyval *keyval)
245 struct ec_keyval_elt_ref *ref;
251 while (!TAILQ_EMPTY(&keyval->list)) {
252 ref = TAILQ_FIRST(&keyval->list);
253 TAILQ_REMOVE(&keyval->list, ref, next);
254 idx = ref->elt->hash & (keyval->table_size - 1);
255 TAILQ_REMOVE(&keyval->table[idx], ref, hnext);
256 ec_keyval_elt_ref_free(ref);
258 ec_free(keyval->table);
262 size_t ec_keyval_len(const struct ec_keyval *keyval)
267 struct ec_keyval_elt_ref *
268 ec_keyval_iter(const struct ec_keyval *keyval)
273 return TAILQ_FIRST(&keyval->list);
276 struct ec_keyval_elt_ref *
277 ec_keyval_iter_next(struct ec_keyval_elt_ref *iter)
282 return TAILQ_NEXT(iter, next);
286 ec_keyval_iter_get_key(const struct ec_keyval_elt_ref *iter)
291 return iter->elt->key;
295 ec_keyval_iter_get_val(const struct ec_keyval_elt_ref *iter)
300 return iter->elt->val;
303 void ec_keyval_dump(FILE *out, const struct ec_keyval *keyval)
305 struct ec_keyval_elt_ref *iter;
307 if (keyval == NULL) {
308 fprintf(out, "empty keyval\n");
312 fprintf(out, "keyval:\n");
313 for (iter = ec_keyval_iter(keyval);
315 iter = ec_keyval_iter_next(iter)) {
316 fprintf(out, " %s: %p\n",
317 ec_keyval_iter_get_key(iter),
318 ec_keyval_iter_get_val(iter));
322 struct ec_keyval *ec_keyval_dup(const struct ec_keyval *keyval)
324 struct ec_keyval *dup = NULL;
325 struct ec_keyval_elt_ref *ref, *dup_ref = NULL;
331 TAILQ_FOREACH(ref, &keyval->list, next) {
332 dup_ref = ec_calloc(1, sizeof(*ref));
335 dup_ref->elt = ref->elt;
336 ref->elt->refcount++;
338 if (__ec_keyval_set(dup, dup_ref) < 0)
345 ec_keyval_elt_ref_free(dup_ref);
350 static int ec_keyval_init_func(void)
355 return 0;//XXX for test reproduceability
357 fd = open("/dev/urandom", 0);
359 fprintf(stderr, "failed to open /dev/urandom\n");
362 ret = read(fd, &ec_keyval_seed, sizeof(ec_keyval_seed));
363 if (ret != sizeof(ec_keyval_seed)) {
364 fprintf(stderr, "failed to read /dev/urandom\n");
371 static struct ec_init ec_keyval_init = {
372 .init = ec_keyval_init_func,
376 EC_INIT_REGISTER(ec_keyval_init);
378 /* LCOV_EXCL_START */
379 static int ec_keyval_testcase(void)
381 struct ec_keyval *keyval, *dup;
382 struct ec_keyval_elt_ref *iter;
385 int ret, testres = 0;
390 keyval = ec_keyval();
391 if (keyval == NULL) {
392 EC_LOG(EC_LOG_ERR, "cannot create keyval\n");
397 for (iter = ec_keyval_iter(keyval);
399 iter = ec_keyval_iter_next(iter)) {
402 testres |= EC_TEST_CHECK(count == 0, "invalid count in iterator");
404 testres |= EC_TEST_CHECK(ec_keyval_len(keyval) == 0, "bad keyval len");
405 ret = ec_keyval_set(keyval, "key1", "val1", NULL);
406 testres |= EC_TEST_CHECK(ret == 0, "cannot set key");
407 ret = ec_keyval_set(keyval, "key2", ec_strdup("val2"), ec_free_func);
408 testres |= EC_TEST_CHECK(ret == 0, "cannot set key");
409 testres |= EC_TEST_CHECK(ec_keyval_len(keyval) == 2, "bad keyval len");
411 val = ec_keyval_get(keyval, "key1");
412 testres |= EC_TEST_CHECK(val != NULL && !strcmp(val, "val1"),
413 "invalid keyval value");
414 val = ec_keyval_get(keyval, "key2");
415 testres |= EC_TEST_CHECK(val != NULL && !strcmp(val, "val2"),
416 "invalid keyval value");
417 val = ec_keyval_get(keyval, "key3");
418 testres |= EC_TEST_CHECK(val == NULL, "key3 should be NULL");
420 ret = ec_keyval_set(keyval, "key1", "another_val1", NULL);
421 testres |= EC_TEST_CHECK(ret == 0, "cannot set key");
422 ret = ec_keyval_set(keyval, "key2", ec_strdup("another_val2"),
424 testres |= EC_TEST_CHECK(ret == 0, "cannot set key");
425 testres |= EC_TEST_CHECK(ec_keyval_len(keyval) == 2,
428 val = ec_keyval_get(keyval, "key1");
429 testres |= EC_TEST_CHECK(val != NULL && !strcmp(val, "another_val1"),
430 "invalid keyval value");
431 val = ec_keyval_get(keyval, "key2");
432 testres |= EC_TEST_CHECK(val != NULL && !strcmp(val, "another_val2"),
433 "invalid keyval value");
434 testres |= EC_TEST_CHECK(ec_keyval_has_key(keyval, "key1"),
435 "key1 should be in keyval");
437 f = open_memstream(&buf, &buflen);
440 ec_keyval_dump(f, NULL);
446 f = open_memstream(&buf, &buflen);
449 ec_keyval_dump(f, keyval);
455 ret = ec_keyval_del(keyval, "key1");
456 testres |= EC_TEST_CHECK(ret == 0, "cannot del key1");
457 testres |= EC_TEST_CHECK(ec_keyval_len(keyval) == 1,
458 "invalid keyval len");
459 ret = ec_keyval_del(keyval, "key2");
460 testres |= EC_TEST_CHECK(ret == 0, "cannot del key2");
461 testres |= EC_TEST_CHECK(ec_keyval_len(keyval) == 0,
462 "invalid keyval len");
464 for (i = 0; i < 100; i++) {
466 snprintf(key, sizeof(key), "k%zd", i);
467 ret = ec_keyval_set(keyval, key, "val", NULL);
468 testres |= EC_TEST_CHECK(ret == 0, "cannot set key");
470 dup = ec_keyval_dup(keyval);
471 testres |= EC_TEST_CHECK(dup != NULL, "cannot duplicate keyval");
473 for (i = 0; i < 100; i++) {
475 snprintf(key, sizeof(key), "k%zd", i);
476 val = ec_keyval_get(dup, key);
477 testres |= EC_TEST_CHECK(
478 val != NULL && !strcmp(val, "val"),
479 "invalid keyval value");
486 for (iter = ec_keyval_iter(keyval);
488 iter = ec_keyval_iter_next(iter)) {
491 testres |= EC_TEST_CHECK(count == 100, "invalid count in iterator");
494 ret = ec_keyval_set(keyval, NULL, "val1", NULL);
495 testres |= EC_TEST_CHECK(ret == -1, "should not be able to set key");
496 val = ec_keyval_get(keyval, NULL);
497 testres |= EC_TEST_CHECK(val == NULL, "get(NULL) should no success");
499 ec_keyval_free(keyval);
504 ec_keyval_free(keyval);
512 static struct ec_test ec_keyval_test = {
514 .test = ec_keyval_testcase,
517 EC_TEST_REGISTER(ec_keyval_test);