From 71eeedd1a05d5dd200c77527ea15086bf43e1a26 Mon Sep 17 00:00:00 2001 From: Dimitri Staessens Date: Wed, 12 Feb 2020 22:31:17 +0100 Subject: lib: Move hashtable from lib to unicast The hashtable is only used for forwarding tables in the unicast IPCP. This moves the generic hashtable out of the library into the unicast IPCP to prepare a more tailored implementation specific to routing tables containing address lists. Signed-off-by: Dimitri Staessens Signed-off-by: Sander Vrijders --- src/ipcpd/unicast/pol/tests/hashtable_test.c | 129 +++++++++++++++++++++++++++ 1 file changed, 129 insertions(+) create mode 100644 src/ipcpd/unicast/pol/tests/hashtable_test.c (limited to 'src/ipcpd/unicast/pol/tests/hashtable_test.c') diff --git a/src/ipcpd/unicast/pol/tests/hashtable_test.c b/src/ipcpd/unicast/pol/tests/hashtable_test.c new file mode 100644 index 00000000..f84fee63 --- /dev/null +++ b/src/ipcpd/unicast/pol/tests/hashtable_test.c @@ -0,0 +1,129 @@ +/* + * Ouroboros - Copyright (C) 2016 - 2020 + * + * Test of the hash table + * + * Dimitri Staessens + * Sander Vrijders + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License version 2 as + * published by the Free Software Foundation. + * + * 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 this program; if not, write to the Free Software + * Foundation, Inc., http://www.fsf.org/about/contact/. + */ + +#include "hashtable.c" + +#include + +#define HASHTABLE_SIZE 256 +#define INT_TEST 4 + +int hashtable_test(int argc, char ** argv) +{ + struct htable * table; + int i; + int * j; + void * el; + size_t len; + + (void) argc; + (void) argv; + + table = htable_create(HASHTABLE_SIZE, true); + if (table == NULL) { + printf("Failed to create.\n"); + return -1; + } + + htable_destroy(table); + + table = htable_create(HASHTABLE_SIZE, false); + if (table == NULL) { + printf("Failed to create.\n"); + return -1; + } + + for (i = 0; i < HASHTABLE_SIZE + INT_TEST + 2; i++) { + j = malloc(sizeof(*j)); + if (j == NULL) { + printf("Failed to malloc.\n"); + htable_destroy(table); + return -1; + } + *j = i; + + if (htable_insert(table, i, (void *) j, 1)) { + printf("Failed to insert.\n"); + htable_destroy(table); + free(j); + return -1; + } + } + + if (htable_lookup(table, INT_TEST, &el, &len)) { + printf("Failed to lookup.\n"); + htable_destroy(table); + return -1; + } + + j = (int *) el; + if (*j != INT_TEST) { + printf("Lookup returned wrong value (%d != %d).\n", + INT_TEST, *j); + htable_destroy(table); + return -1; + } + + if (htable_lookup(table, HASHTABLE_SIZE + INT_TEST, &el, &len)) { + printf("Failed to lookup.\n"); + htable_destroy(table); + return -1; + } + + j = (int *) el; + if (*j != HASHTABLE_SIZE + INT_TEST) { + printf("Lookup returned wrong value (%d != %d).\n", + INT_TEST, *j); + htable_destroy(table); + return -1; + } + + if (htable_delete(table, INT_TEST)) { + printf("Failed to delete.\n"); + htable_destroy(table); + return -1; + } + + if (htable_lookup(table, INT_TEST, &el, &len) == 0) { + printf("Failed to delete properly.\n"); + htable_destroy(table); + return -1; + } + + if (htable_lookup(table, HASHTABLE_SIZE + INT_TEST, &el, &len)) { + printf("Failed to lookup after deletion.\n"); + htable_destroy(table); + return -1; + } + + j = (int *) el; + if (*j != HASHTABLE_SIZE + INT_TEST) { + printf("Lookup returned wrong value (%d != %d).\n", + INT_TEST, *j); + htable_destroy(table); + return -1; + } + + htable_destroy(table); + + return 0; +} -- cgit v1.2.3