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 // Test some basic stuff; add a few keys, remove a few keys
34 void simple (CuTest* tc) {
36 #ifdef TEST_STRING_KEYS
37 map_t *map = map_alloc(map_type_, &DATATYPE_NSTRING);
38 nstring_t *k1 = ns_alloc(3); strcpy(k1->data, "k1");
39 nstring_t *k2 = ns_alloc(3); strcpy(k1->data, "k2");
40 nstring_t *k3 = ns_alloc(3); strcpy(k1->data, "k3");
41 nstring_t *k4 = ns_alloc(3); strcpy(k1->data, "k4");
43 map_t *map = map_alloc(map_type_, NULL);
50 ASSERT_EQUAL( 0, map_count (map) );
51 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k1,10) );
52 ASSERT_EQUAL( 1, map_count (map) );
53 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k2,20) );
54 ASSERT_EQUAL( 2, map_count (map) );
55 ASSERT_EQUAL( 20, map_get (map, k2) );
56 ASSERT_EQUAL( 10, map_set (map, k1,11) );
57 ASSERT_EQUAL( 20, map_set (map, k2,21) );
58 ASSERT_EQUAL( 2, map_count (map) );
59 ASSERT_EQUAL( 21, map_add (map, k2,22) );
60 ASSERT_EQUAL( 11, map_remove (map, k1) );
61 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k1) );
62 ASSERT_EQUAL( 1, map_count (map) );
63 ASSERT_EQUAL( DOES_NOT_EXIST, map_remove (map, k1) );
64 ASSERT_EQUAL( 21, map_remove (map, k2) );
65 ASSERT_EQUAL( 0, map_count (map) );
66 ASSERT_EQUAL( DOES_NOT_EXIST, map_remove (map, k2) );
67 ASSERT_EQUAL( DOES_NOT_EXIST, map_remove (map, k3) );
68 ASSERT_EQUAL( 0, map_count (map) );
70 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k4,40) );
71 ASSERT_EQUAL( 40, map_get (map, k4) );
72 ASSERT_EQUAL( 1, map_count (map) );
73 ASSERT_EQUAL( 40, map_remove (map, k4) );
74 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k4) );
75 ASSERT_EQUAL( 0, map_count (map) );
77 ASSERT_EQUAL( DOES_NOT_EXIST, map_replace(map, k4,10) );
78 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k4) );
79 ASSERT_EQUAL( DOES_NOT_EXIST, map_set (map, k4,40) );
80 ASSERT_EQUAL( 40, map_replace(map, k4,41) );
81 ASSERT_EQUAL( 41, map_get (map, k4) );
82 ASSERT_EQUAL( 41, map_remove (map, k4) );
83 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k4) );
84 ASSERT_EQUAL( 0, map_count (map) );
86 ASSERT_EQUAL( DOES_NOT_EXIST, map_replace(map, k2,20) );
87 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k2) );
89 // In the end, all entries should be removed
90 ASSERT_EQUAL( DOES_NOT_EXIST, map_set (map, k2,20) );
91 ASSERT_EQUAL( 20, map_replace(map, k2,21) );
92 ASSERT_EQUAL( 21, map_get (map, k2) );
93 ASSERT_EQUAL( 21, map_remove (map, k2) );
94 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k2) );
95 ASSERT_EQUAL( 0, map_count (map) );
99 // In a quiecent state; it is safe to free.
103 void *add_remove_worker (void *arg) {
104 worker_data_t *wd = (worker_data_t *)arg;
105 map_t *map = wd->map;
110 SYNC_ADD(wd->wait, -1);
111 do { } while (*wd->wait); // wait for all workers to be ready
113 #ifdef TEST_STRING_KEYS
114 nstring_t *key = ns_alloc(9);
119 for (int j = 0; j < 10; ++j) {
120 for (uint64_t i = d+1; i < iters; i+=2) {
121 #ifdef TEST_STRING_KEYS
122 memset(key->data, 0, key->len);
123 snprintf(key->data, key->len, "%llu", i);
127 TRACE("t0", "test map_add() iteration (%llu, %llu)", j, i);
128 CuAssertIntEquals_Msg(tc, (void *)i, DOES_NOT_EXIST, map_add(map, key, d+1) );
131 for (uint64_t i = d+1; i < iters; i+=2) {
132 #ifdef TEST_STRING_KEYS
133 memset(key->data, 0, key->len);
134 snprintf(key->data, key->len, "%llu", i);
138 TRACE("t0", "test map_remove() iteration (%llu, %llu)", j, i);
139 CuAssertIntEquals_Msg(tc, (void *)i, d+1, map_remove(map, key) );
146 // Do some simple concurrent testing
147 void add_remove (CuTest* tc) {
151 volatile int wait = 2;
152 #ifdef TEST_STRING_KEYS
153 map_t *map = map_alloc(map_type_, &DATATYPE_NSTRING);
155 map_t *map = map_alloc(map_type_, NULL);
158 struct timeval tv1, tv2;
159 gettimeofday(&tv1, NULL);
161 // In 2 threads, add & remove even & odd elements concurrently
163 for (i = 0; i < 2; ++i) {
168 int rc = nbd_thread_create(thread + i, i, add_remove_worker, wd + i);
169 if (rc != 0) { perror("nbd_thread_create"); return; }
172 for (i = 0; i < 2; ++i) {
173 pthread_join(thread[i], NULL);
176 gettimeofday(&tv2, NULL);
177 int ms = (int)(1000000*(tv2.tv_sec - tv1.tv_sec) + tv2.tv_usec - tv1.tv_usec) / 1000;
179 printf("Th:%d Time:%dms\n", 2, ms);
182 // In the end, all members should be removed
183 ASSERT_EQUAL( 0, map_count(map) );
185 // In a quiecent state; it is safe to free.
189 void *inserter_worker (void *arg) {
190 //pthread_t thread[NUM_THREADS];
192 //map_t *map = map_alloc(map_type_);
196 // Concurrent insertion
197 void concurrent_insert (CuTest* tc) {
203 lwt_set_trace_level("h3");
205 static const map_impl_t *map_types[] = { &ll_map_impl, &sl_map_impl, &ht_map_impl };
206 for (int i = 0; i < sizeof(map_types)/sizeof(*map_types); ++i) {
207 map_type_ = map_types[i];
209 // Create and run test suite
210 CuString *output = CuStringNew();
211 CuSuite* suite = CuSuiteNew();
213 SUITE_ADD_TEST(suite, simple);
214 SUITE_ADD_TEST(suite, add_remove);
217 CuSuiteDetails(suite, output);
218 printf("%s\n", output->buffer);