2 * Written by Josh Dybnis and released to the public domain, as explained at
3 * http://creativecommons.org/licenses/publicdomain
17 #include "hashtable.h"
20 #define ASSERT_EQUAL(x, y) CuAssertIntEquals(tc, x, y)
22 //#define TEST_STRING_KEYS
24 typedef struct worker_data {
31 static const map_impl_t *map_type_;
33 static uint64_t iterator_size (map_t *map) {
34 map_iter_t *iter = map_iter_begin(map, NULL);
36 while (map_iter_next(iter, NULL) != DOES_NOT_EXIST) {
43 // Test some basic stuff; add a few keys, remove a few keys
44 void basic_test (CuTest* tc) {
46 #ifdef TEST_STRING_KEYS
47 map_t *map = map_alloc(map_type_, &DATATYPE_NSTRING);
48 nstring_t *k1 = ns_alloc(3); strcpy(k1->data, "k1");
49 nstring_t *k2 = ns_alloc(3); strcpy(k1->data, "k2");
50 nstring_t *k3 = ns_alloc(3); strcpy(k1->data, "k3");
51 nstring_t *k4 = ns_alloc(3); strcpy(k1->data, "k4");
53 map_t *map = map_alloc(map_type_, NULL);
60 ASSERT_EQUAL( 0, map_count (map) );
61 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k1,10) );
62 ASSERT_EQUAL( 1, map_count (map) );
63 ASSERT_EQUAL( 1, iterator_size(map) );
64 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k2,20) );
65 ASSERT_EQUAL( 2, map_count (map) );
66 ASSERT_EQUAL( 2, iterator_size(map) );
67 ASSERT_EQUAL( 20, map_get (map, k2) );
68 ASSERT_EQUAL( 10, map_set (map, k1,11) );
69 ASSERT_EQUAL( 20, map_set (map, k2,21) );
70 ASSERT_EQUAL( 2, map_count (map) );
71 ASSERT_EQUAL( 2, iterator_size(map) );
72 ASSERT_EQUAL( 21, map_add (map, k2,22) );
73 ASSERT_EQUAL( 11, map_remove (map, k1) );
74 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k1) );
75 ASSERT_EQUAL( 1, map_count (map) );
76 ASSERT_EQUAL( 1, iterator_size(map) );
77 ASSERT_EQUAL( DOES_NOT_EXIST, map_remove (map, k1) );
78 ASSERT_EQUAL( 21, map_remove (map, k2) );
79 ASSERT_EQUAL( 0, map_count (map) );
80 ASSERT_EQUAL( 0, iterator_size(map) );
81 ASSERT_EQUAL( DOES_NOT_EXIST, map_remove (map, k2) );
82 ASSERT_EQUAL( DOES_NOT_EXIST, map_remove (map, k3) );
83 ASSERT_EQUAL( 0, map_count (map) );
84 ASSERT_EQUAL( 0, iterator_size(map) );
86 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k4,40) );
87 ASSERT_EQUAL( 40, map_get (map, k4) );
88 ASSERT_EQUAL( 1, map_count (map) );
89 ASSERT_EQUAL( 1, iterator_size(map) );
90 ASSERT_EQUAL( 40, map_remove (map, k4) );
91 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k4) );
92 ASSERT_EQUAL( 0, map_count (map) );
93 ASSERT_EQUAL( 0, iterator_size(map) );
95 ASSERT_EQUAL( DOES_NOT_EXIST, map_replace(map, k4,10) );
96 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k4) );
97 ASSERT_EQUAL( DOES_NOT_EXIST, map_set (map, k4,40) );
98 ASSERT_EQUAL( 40, map_replace(map, k4,41) );
99 ASSERT_EQUAL( 41, map_get (map, k4) );
100 ASSERT_EQUAL( 41, map_remove (map, k4) );
101 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k4) );
102 ASSERT_EQUAL( 0, map_count (map) );
103 ASSERT_EQUAL( 0, iterator_size(map) );
105 ASSERT_EQUAL( DOES_NOT_EXIST, map_replace(map, k2,20) );
106 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k2) );
108 // In the end, all entries should be removed
109 ASSERT_EQUAL( DOES_NOT_EXIST, map_set (map, k2,20) );
110 ASSERT_EQUAL( 20, map_replace(map, k2,21) );
111 ASSERT_EQUAL( 21, map_get (map, k2) );
112 ASSERT_EQUAL( 21, map_remove (map, k2) );
113 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k2) );
114 ASSERT_EQUAL( 0, map_count (map) );
115 ASSERT_EQUAL( 0, iterator_size(map) );
119 rcu_update(); // In a quiecent state.
120 #ifdef TEST_STRING_KEYS
121 nbd_free(k1); nbd_free(k2); nbd_free(k3); nbd_free(k4);
125 void *add_remove_worker (void *arg) {
126 worker_data_t *wd = (worker_data_t *)arg;
127 map_t *map = wd->map;
132 SYNC_ADD(wd->wait, -1);
133 do { } while (*wd->wait); // wait for all workers to be ready
135 #ifdef TEST_STRING_KEYS
136 nstring_t *key = ns_alloc(9);
141 for (int j = 0; j < 10; ++j) {
142 for (uint64_t i = d+1; i < iters; i+=2) {
143 #ifdef TEST_STRING_KEYS
144 memset(key->data, 0, key->len);
145 snprintf(key->data, key->len, "%llu", i);
149 TRACE("t0", "test map_add() iteration (%llu, %llu)", j, i);
150 ASSERT_EQUAL(DOES_NOT_EXIST, map_add(map, key, d+1) );
151 rcu_update(); // In a quiecent state.
153 for (uint64_t i = d+1; i < iters; i+=2) {
154 #ifdef TEST_STRING_KEYS
155 memset(key->data, 0, key->len);
156 snprintf(key->data, key->len, "%llu", i);
160 TRACE("t0", "test map_remove() iteration (%llu, %llu)", j, i);
161 ASSERT_EQUAL(d+1, map_remove(map, key) );
162 rcu_update(); // In a quiecent state.
168 // Do some simple concurrent testing
169 void concurrent_add_remove_test (CuTest* tc) {
173 volatile int wait = 2;
174 #ifdef TEST_STRING_KEYS
175 map_t *map = map_alloc(map_type_, &DATATYPE_NSTRING);
177 map_t *map = map_alloc(map_type_, NULL);
180 struct timeval tv1, tv2;
181 gettimeofday(&tv1, NULL);
183 // In 2 threads, add & remove even & odd elements concurrently
185 for (i = 0; i < 2; ++i) {
190 int rc = nbd_thread_create(thread + i, i, add_remove_worker, wd + i);
191 if (rc != 0) { perror("nbd_thread_create"); return; }
194 for (i = 0; i < 2; ++i) {
195 pthread_join(thread[i], NULL);
198 gettimeofday(&tv2, NULL);
199 int ms = (int)(1000000*(tv2.tv_sec - tv1.tv_sec) + tv2.tv_usec - tv1.tv_usec) / 1000;
201 printf("Th:%d Time:%dms\n", 2, ms);
204 // In the end, all members should be removed
205 ASSERT_EQUAL( 0, map_count(map) );
206 ASSERT_EQUAL( 0, iterator_size(map) );
208 // In a quiecent state; it is safe to free.
212 void basic_iteration_test (CuTest* tc) {
213 #ifdef TEST_STRING_KEYS
214 map_t *map = map_alloc(map_type_, &DATATYPE_NSTRING);
215 nstring_t *k1 = ns_alloc(3); strcpy(k1->data, "k1");
216 nstring_t *k2 = ns_alloc(3); strcpy(k1->data, "k2");
220 map_t *map = map_alloc(map_type_, NULL);
221 void *k1 = (void *)1;
222 void *k2 = (void *)2;
227 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k1,1) );
228 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k2,2) );
231 map_iter_t *iter = map_iter_begin(map, NULL);
232 x_v = map_iter_next(iter, &x_k);
233 y_v = map_iter_next(iter, &y_k);
234 ASSERT_EQUAL( DOES_NOT_EXIST, map_iter_next(iter, NULL) );
236 #ifdef TEST_STRING_KEYS
237 ASSERT_EQUAL( TRUE, (ns_cmp(x_k, k1) == 0 && x_v == 1) || (ns_cmp(y_k, k1) == 0 && y_v == 1) );
238 ASSERT_EQUAL( TRUE, (ns_cmp(x_k, k2) == 0 && x_v == 2) || (ns_cmp(y_k, k2) == 0 && y_v == 2) );
242 ASSERT_EQUAL( TRUE, (x_k == k1 && x_v == 1) || (y_k == k1 && y_v == 1) );
243 ASSERT_EQUAL( TRUE, (x_k == k2 && x_v == 2) || (y_k == k2 && y_v == 2) );
249 void big_iteration_test (CuTest* tc) {
250 static const int n = 10000;
252 #ifdef TEST_STRING_KEYS
253 map_t *map = map_alloc(map_type_, &DATATYPE_NSTRING);
254 nstring_t *key = ns_alloc(9);
255 nstring_t *k3 = ns_alloc(3); strcpy(k1->data, "k3");
256 nstring_t *k4 = ns_alloc(3); strcpy(k1->data, "k4");
258 map_t *map = map_alloc(map_type_, NULL);
259 void *k3 = (void *)3;
260 void *k4 = (void *)4;
264 for (size_t i = 1; i <= n; ++i) {
265 #ifdef TEST_STRING_KEYS
266 memset(key->data, 0, key->len);
267 snprintf(key->data, key->len, "k%llu", i);
271 ASSERT_EQUAL( DOES_NOT_EXIST, map_get(map, key) );
272 ASSERT_EQUAL( DOES_NOT_EXIST, map_set(map, key, i) );
273 ASSERT_EQUAL( i, map_get(map, key) );
274 rcu_update(); // In a quiecent state.
277 ASSERT_EQUAL( n, map_count(map) );
278 ASSERT_EQUAL( n, iterator_size(map) );
282 map_iter_t *iter = map_iter_begin(map, NULL);
283 while ((val = map_iter_next(iter, NULL)) != DOES_NOT_EXIST) {
287 ASSERT_EQUAL(n*(n+1)/2, sum);
288 ASSERT_EQUAL(3, map_remove(map, k3));
289 ASSERT_EQUAL(4, map_remove(map, k4));
291 iter = map_iter_begin(map, NULL);
292 while ((val = map_iter_next(iter, NULL)) != DOES_NOT_EXIST) {
296 ASSERT_EQUAL(n*(n+1)/2 - (3+4), sum);
298 #ifdef TEST_STRING_KEYS
306 lwt_set_trace_level("h3");
308 static const map_impl_t *map_types[] = { &ll_map_impl, &sl_map_impl, &ht_map_impl };
309 for (int i = 0; i < sizeof(map_types)/sizeof(*map_types); ++i) {
310 map_type_ = map_types[i];
312 // Create and run test suite
313 CuString *output = CuStringNew();
314 CuSuite* suite = CuSuiteNew();
316 SUITE_ADD_TEST(suite, basic_test);
317 SUITE_ADD_TEST(suite, concurrent_add_remove_test);
318 SUITE_ADD_TEST(suite, basic_iteration_test);
319 SUITE_ADD_TEST(suite, big_iteration_test);
322 CuSuiteDetails(suite, output);
323 printf("%s\n", output->buffer);