4 * This file is part of BeRTOS.
6 * Bertos is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 * As a special exception, you may use this file as part of a free software
21 * library without restriction. Specifically, if other files instantiate
22 * templates or use macros or inline functions from this file, or you compile
23 * this file and link it with other files to produce an executable, this
24 * file does not by itself cause the resulting executable to be covered by
25 * the GNU General Public License. This exception does not however
26 * invalidate any other reasons why the executable file might be covered by
27 * the GNU General Public License.
29 * Copyright 2010 Develer S.r.l. (http://www.develer.com/)
32 * \brief Test hashtable module.
34 * Test the hashtable module (insertion and find).
36 * \author Andrea Righi <arighi@develer.com>
38 * $test$: cp bertos/cfg/cfg_hashtable.h $cfgdir/
41 #include <cfg/debug.h>
43 #include <string.h> /* strlen() */
44 #include "struct/hashtable.h"
46 static const void *test_get_key(const void *ptr, uint8_t *length)
54 #define NUM_ELEMENTS 256
55 DECLARE_HASHTABLE_STATIC(hash1, NUM_ELEMENTS, test_get_key);
56 DECLARE_HASHTABLE_INTERNALKEY_STATIC(hash2, NUM_ELEMENTS);
58 static char data[NUM_ELEMENTS][10];
59 static char keydomain[] = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
61 static bool single_test(void)
68 for (i = 0; i < NUM_ELEMENTS; i++)
73 for (k = 0; k < klen; k++)
74 data[i][k] = keydomain[i % (sizeof(keydomain) - 1)];
77 ASSERT(ht_insert(&hash1, data[i]));
78 ASSERT(ht_insert_str(&hash2, data[i], data[i]));
80 for (i = 0; i < NUM_ELEMENTS; i++)
82 const char *found1, *found2;
84 found1 = ht_find_str(&hash1, data[i]);
85 if (strcmp(found1, data[i]))
87 kprintf("hash1: found data[%d] = %s\n", i, found1);
89 found2 = ht_find_str(&hash2, data[i]);
90 if (strcmp(found2, data[i]))
92 kprintf("hash2: found data[%d] = %s\n", i, found2);
97 int hashtable_testRun(void)
101 kprintf("hashtable_test failed\n");
104 kprintf("hashtable_test successful\n");
108 int hashtable_testSetup(void)
114 int hashtable_testTearDown(void)
116 kputs("TearDown hashtable test.\n");
120 TEST_MAIN(hashtable);