2 * Written by Josh Dybnis and released to the public domain, as explained at
3 * http://creativecommons.org/licenses/publicdomain
5 * tests ported from high-scale-lib
6 * http://sourceforge.net/projects/high-scale-lib
20 #include "hashtable.h"
24 #define ASSERT_EQUAL(x, y) CuAssertIntEquals(tc, x, y)
26 //#define TEST_STRING_KEYS
28 typedef struct worker_data {
35 static const map_impl_t *map_type_;
37 static size_t iterator_size (map_t *map) {
38 map_iter_t *iter = map_iter_begin(map, 0);
40 while (map_iter_next(iter, NULL) != DOES_NOT_EXIST) {
47 // Test some basic stuff; add a few keys, remove a few keys
48 void basic_test (CuTest* tc) {
50 #ifdef TEST_STRING_KEYS
51 map_t *map = map_alloc(map_type_, &DATATYPE_NSTRING);
52 nstring_t *s1 = ns_alloc(3); strcpy(s1->data, "k1");
53 nstring_t *s2 = ns_alloc(3); strcpy(s2->data, "k2");
54 nstring_t *s3 = ns_alloc(3); strcpy(s3->data, "k3");
55 nstring_t *s4 = ns_alloc(3); strcpy(s4->data, "k4");
56 map_key_t k1 = (map_key_t)s1;
57 map_key_t k2 = (map_key_t)s2;
58 map_key_t k3 = (map_key_t)s3;
59 map_key_t k4 = (map_key_t)s4;
61 map_t *map = map_alloc(map_type_, NULL);
62 map_key_t k1 = (map_key_t)1;
63 map_key_t k2 = (map_key_t)2;
64 map_key_t k3 = (map_key_t)3;
65 map_key_t k4 = (map_key_t)4;
68 ASSERT_EQUAL( 0, map_count (map) );
69 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k1,10) );
70 ASSERT_EQUAL( 1, map_count (map) );
71 ASSERT_EQUAL( 1, iterator_size(map) );
72 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k2,20) );
73 ASSERT_EQUAL( 2, map_count (map) );
74 ASSERT_EQUAL( 2, iterator_size(map) );
75 ASSERT_EQUAL( 20, map_get (map, k2) );
76 ASSERT_EQUAL( 10, map_set (map, k1,11) );
77 ASSERT_EQUAL( 20, map_set (map, k2,21) );
78 ASSERT_EQUAL( 2, map_count (map) );
79 ASSERT_EQUAL( 2, iterator_size(map) );
80 ASSERT_EQUAL( 21, map_add (map, k2,22) );
81 ASSERT_EQUAL( 11, map_remove (map, k1) );
82 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k1) );
83 ASSERT_EQUAL( 1, map_count (map) );
84 ASSERT_EQUAL( 1, iterator_size(map) );
85 ASSERT_EQUAL( DOES_NOT_EXIST, map_remove (map, k1) );
86 ASSERT_EQUAL( 21, map_remove (map, k2) );
87 ASSERT_EQUAL( 0, map_count (map) );
88 ASSERT_EQUAL( 0, iterator_size(map) );
89 ASSERT_EQUAL( DOES_NOT_EXIST, map_remove (map, k2) );
90 ASSERT_EQUAL( DOES_NOT_EXIST, map_remove (map, k3) );
91 ASSERT_EQUAL( 0, map_count (map) );
92 ASSERT_EQUAL( 0, iterator_size(map) );
94 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k4,40) );
95 ASSERT_EQUAL( 40, map_get (map, k4) );
96 ASSERT_EQUAL( 1, map_count (map) );
97 ASSERT_EQUAL( 1, iterator_size(map) );
98 ASSERT_EQUAL( 40, map_remove (map, k4) );
99 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k4) );
100 ASSERT_EQUAL( 0, map_count (map) );
101 ASSERT_EQUAL( 0, iterator_size(map) );
103 ASSERT_EQUAL( DOES_NOT_EXIST, map_replace(map, k4,10) );
104 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k4) );
105 ASSERT_EQUAL( DOES_NOT_EXIST, map_set (map, k4,40) );
106 ASSERT_EQUAL( 40, map_replace(map, k4,41) );
107 ASSERT_EQUAL( 41, map_get (map, k4) );
108 ASSERT_EQUAL( 41, map_remove (map, k4) );
109 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k4) );
110 ASSERT_EQUAL( 0, map_count (map) );
111 ASSERT_EQUAL( 0, iterator_size(map) );
113 ASSERT_EQUAL( DOES_NOT_EXIST, map_replace(map, k2,20) );
114 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k2) );
116 // In the end, all entries should be removed
117 ASSERT_EQUAL( DOES_NOT_EXIST, map_set (map, k2,20) );
118 ASSERT_EQUAL( 20, map_replace(map, k2,21) );
119 ASSERT_EQUAL( 21, map_get (map, k2) );
120 ASSERT_EQUAL( 21, map_remove (map, k2) );
121 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k2) );
122 ASSERT_EQUAL( 0, map_count (map) );
123 ASSERT_EQUAL( 0, iterator_size(map) );
127 rcu_update(); // In a quiecent state.
128 #ifdef TEST_STRING_KEYS
129 nbd_free(s1); nbd_free(s2); nbd_free(s3); nbd_free(s4);
133 void *add_remove_worker (void *arg) {
134 worker_data_t *wd = (worker_data_t *)arg;
135 map_t *map = wd->map;
140 SYNC_ADD(wd->wait, -1);
141 do { } while (*wd->wait); // wait for all workers to be ready
144 #ifdef TEST_STRING_KEYS
145 nstring_t *s = ns_alloc(9);
149 for (int j = 0; j < 10; ++j) {
150 for (int i = d+1; i < iters; i+=2) {
151 #ifdef TEST_STRING_KEYS
152 s->len = 1 + snprintf(s->data, 9, "%u", i);
156 TRACE("t0", "test map_add() iteration (%llu, %llu)", j, i);
157 ASSERT_EQUAL(DOES_NOT_EXIST, map_add(map, key, d+1) );
158 rcu_update(); // In a quiecent state.
160 for (int i = d+1; i < iters; i+=2) {
161 #ifdef TEST_STRING_KEYS
162 s->len = 1 + snprintf(s->data, 9, "%u", i);
166 TRACE("t0", "test map_remove() iteration (%llu, %llu)", j, i);
167 ASSERT_EQUAL(d+1, map_remove(map, key) );
168 rcu_update(); // In a quiecent state.
171 #ifdef TEST_STRING_KEYS
177 // Do some simple concurrent testing
178 void concurrent_add_remove_test (CuTest* tc) {
182 static const int num_threads = 2;
183 volatile int wait = num_threads;
184 #ifdef TEST_STRING_KEYS
185 map_t *map = map_alloc(map_type_, &DATATYPE_NSTRING);
187 map_t *map = map_alloc(map_type_, NULL);
190 struct timeval tv1, tv2;
191 gettimeofday(&tv1, NULL);
193 // In 2 threads, add & remove even & odd elements concurrently
195 for (i = 0; i < num_threads; ++i) {
200 int rc = nbd_thread_create(thread + i, i, add_remove_worker, wd + i);
201 if (rc != 0) { perror("nbd_thread_create"); return; }
204 for (i = 0; i < num_threads; ++i) {
205 pthread_join(thread[i], NULL);
208 gettimeofday(&tv2, NULL);
209 int ms = (int)(1000000*(tv2.tv_sec - tv1.tv_sec) + tv2.tv_usec - tv1.tv_usec) / 1000;
211 printf("Th:%d Time:%dms\n", num_threads, ms);
214 // In the end, all members should be removed
215 ASSERT_EQUAL( 0, map_count(map) );
216 ASSERT_EQUAL( 0, iterator_size(map) );
218 // In a quiecent state; it is safe to free.
222 void basic_iteration_test (CuTest* tc) {
223 #ifdef TEST_STRING_KEYS
224 map_t *map = map_alloc(map_type_, &DATATYPE_NSTRING);
225 nstring_t *s1 = ns_alloc(3); strcpy(s1->data, "k1");
226 nstring_t *s2 = ns_alloc(3); strcpy(s2->data, "k2");
227 map_key_t k1 = (map_key_t)s1;
228 map_key_t k2 = (map_key_t)s2;
232 map_t *map = map_alloc(map_type_, NULL);
233 map_key_t k1 = (map_key_t)1;
234 map_key_t k2 = (map_key_t)2;
239 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k1,1) );
240 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k2,2) );
243 map_iter_t *iter = map_iter_begin(map, 0);
244 x_v = map_iter_next(iter, (map_key_t *)&x_k);
245 y_v = map_iter_next(iter, (map_key_t *)&y_k);
246 ASSERT_EQUAL( DOES_NOT_EXIST, map_iter_next(iter, NULL) );
248 #ifdef TEST_STRING_KEYS
249 ASSERT_EQUAL( TRUE, (ns_cmp(x_k, s1) == 0 && x_v == 1) || (ns_cmp(y_k, s1) == 0 && y_v == 1) );
250 ASSERT_EQUAL( TRUE, (ns_cmp(x_k, s2) == 0 && x_v == 2) || (ns_cmp(y_k, s2) == 0 && y_v == 2) );
254 ASSERT_EQUAL( TRUE, (x_k == k1 && x_v == 1) || (y_k == k1 && y_v == 1) );
255 ASSERT_EQUAL( TRUE, (x_k == k2 && x_v == 2) || (y_k == k2 && y_v == 2) );
261 void big_iteration_test (CuTest* tc) {
262 static const int n = 10000;
264 #ifdef TEST_STRING_KEYS
265 map_t *map = map_alloc(map_type_, &DATATYPE_NSTRING);
266 nstring_t *s = ns_alloc(9);
267 nstring_t *s3 = ns_alloc(3); strcpy(s3->data, "k3");
268 nstring_t *s4 = ns_alloc(3); strcpy(s4->data, "k4");
269 map_key_t k3 = (map_key_t)s3;
270 map_key_t k4 = (map_key_t)s4;
271 map_key_t key = (map_key_t)s;
273 map_t *map = map_alloc(map_type_, NULL);
274 map_key_t k3 = (map_key_t)3;
275 map_key_t k4 = (map_key_t)4;
279 for (int i = 1; i <= n; ++i) {
280 #ifdef TEST_STRING_KEYS
281 s->len = 1 + snprintf(s->data, 9, "k%d", i);
285 ASSERT_EQUAL( DOES_NOT_EXIST, map_get(map, key) );
286 ASSERT_EQUAL( DOES_NOT_EXIST, map_set(map, key, i) );
287 ASSERT_EQUAL( i, map_get(map, key) );
288 rcu_update(); // In a quiecent state.
291 ASSERT_EQUAL( n, map_count(map) );
292 ASSERT_EQUAL( n, iterator_size(map) );
296 map_iter_t *iter = map_iter_begin(map, 0);
297 while ((val = map_iter_next(iter, NULL)) != DOES_NOT_EXIST) {
301 ASSERT_EQUAL(n*(n+1)/2, sum);
302 ASSERT_EQUAL(3, map_remove(map, k3));
303 ASSERT_EQUAL(4, map_remove(map, k4));
305 iter = map_iter_begin(map, 0);
306 while ((val = map_iter_next(iter, NULL)) != DOES_NOT_EXIST) {
310 ASSERT_EQUAL(n*(n+1)/2 - (3+4), sum);
312 #ifdef TEST_STRING_KEYS
320 lwt_set_trace_level("h3");
322 static const map_impl_t *map_types[] = { &ll_map_impl, &sl_map_impl, &ht_map_impl };
323 for (int i = 0; i < sizeof(map_types)/sizeof(*map_types); ++i) {
324 map_type_ = map_types[i];
326 // Create and run test suite
327 CuString *output = CuStringNew();
328 CuSuite* suite = CuSuiteNew();
330 SUITE_ADD_TEST(suite, basic_test);
331 SUITE_ADD_TEST(suite, basic_iteration_test);
332 SUITE_ADD_TEST(suite, big_iteration_test);
333 SUITE_ADD_TEST(suite, concurrent_add_remove_test);
336 CuSuiteDetails(suite, output);
337 printf("%s\n", output->buffer);