2 * Written by Josh Dybnis and released to the public domain, as explained at
3 * http://creativecommons.org/licenses/publicdomain
17 #define ASSERT_EQUAL(x, y) CuAssertIntEquals(tc, x, y)
19 #define TEST_STRING_KEYS
21 typedef struct worker_data {
28 static map_type_t map_type_;
30 // Test some basic stuff; add a few keys, remove a few keys
31 void simple (CuTest* tc) {
33 #ifdef TEST_STRING_KEYS
34 map_t *map = map_alloc(map_type_, &DATATYPE_NSTRING);
35 nstring_t *k1 = ns_alloc(3); strcpy(k1->data, "k1");
36 nstring_t *k2 = ns_alloc(3); strcpy(k1->data, "k2");
37 nstring_t *k3 = ns_alloc(3); strcpy(k1->data, "k3");
38 nstring_t *k4 = ns_alloc(3); strcpy(k1->data, "k4");
40 map_t *map = map_alloc(map_type_, NULL);
47 ASSERT_EQUAL( 0, map_count (map) );
48 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k1,10) );
49 ASSERT_EQUAL( 1, map_count (map) );
50 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k2,20) );
51 ASSERT_EQUAL( 2, map_count (map) );
52 ASSERT_EQUAL( 20, map_get (map, k2) );
53 ASSERT_EQUAL( 10, map_set (map, k1,11) );
54 ASSERT_EQUAL( 20, map_set (map, k2,21) );
55 ASSERT_EQUAL( 2, map_count (map) );
56 ASSERT_EQUAL( 21, map_add (map, k2,22) );
57 ASSERT_EQUAL( 11, map_remove (map, k1) );
58 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k1) );
59 ASSERT_EQUAL( 1, map_count (map) );
60 ASSERT_EQUAL( DOES_NOT_EXIST, map_remove (map, k1) );
61 ASSERT_EQUAL( 21, map_remove (map, k2) );
62 ASSERT_EQUAL( 0, map_count (map) );
63 ASSERT_EQUAL( DOES_NOT_EXIST, map_remove (map, k2) );
64 ASSERT_EQUAL( DOES_NOT_EXIST, map_remove (map, k3) );
65 ASSERT_EQUAL( 0, map_count (map) );
67 ASSERT_EQUAL( DOES_NOT_EXIST, map_add (map, k4,40) );
68 ASSERT_EQUAL( 40, map_get (map, k4) );
69 ASSERT_EQUAL( 1, map_count (map) );
70 ASSERT_EQUAL( 40, map_remove (map, k4) );
71 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k4) );
72 ASSERT_EQUAL( 0, map_count (map) );
74 ASSERT_EQUAL( DOES_NOT_EXIST, map_replace(map, k4,10) );
75 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k4) );
76 ASSERT_EQUAL( DOES_NOT_EXIST, map_set (map, k4,40) );
77 ASSERT_EQUAL( 40, map_replace(map, k4,41) );
78 ASSERT_EQUAL( 41, map_get (map, k4) );
79 ASSERT_EQUAL( 41, map_remove (map, k4) );
80 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k4) );
81 ASSERT_EQUAL( 0, map_count (map) );
83 ASSERT_EQUAL( DOES_NOT_EXIST, map_replace(map, k2,20) );
84 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k2) );
86 // In the end, all entries should be removed
87 ASSERT_EQUAL( DOES_NOT_EXIST, map_set (map, k2,20) );
88 ASSERT_EQUAL( 20, map_replace(map, k2,21) );
89 ASSERT_EQUAL( 21, map_get (map, k2) );
90 ASSERT_EQUAL( 21, map_remove (map, k2) );
91 ASSERT_EQUAL( DOES_NOT_EXIST, map_get (map, k2) );
92 ASSERT_EQUAL( 0, map_count (map) );
96 // In a quiecent state; it is safe to free.
100 void *add_remove_worker (void *arg) {
101 worker_data_t *wd = (worker_data_t *)arg;
102 map_t *map = wd->map;
107 SYNC_ADD(wd->wait, -1);
108 do { } while (*wd->wait); // wait for all workers to be ready
110 #ifdef TEST_STRING_KEYS
111 nstring_t *key = ns_alloc(9);
116 for (int j = 0; j < 10; ++j) {
117 for (uint64_t i = d+1; i < iters; i+=2) {
118 #ifdef TEST_STRING_KEYS
119 memset(key->data, 0, key->len);
120 snprintf(key->data, key->len, "%llu", i);
124 TRACE("t0", "test map_add() iteration (%llu, %llu)", j, i);
125 CuAssertIntEquals_Msg(tc, (void *)i, DOES_NOT_EXIST, map_add(map, key, d+1) );
128 for (uint64_t i = d+1; i < iters; i+=2) {
129 #ifdef TEST_STRING_KEYS
130 memset(key->data, 0, key->len);
131 snprintf(key->data, key->len, "%llu", i);
135 TRACE("t0", "test map_remove() iteration (%llu, %llu)", j, i);
136 CuAssertIntEquals_Msg(tc, (void *)i, d+1, map_remove(map, key) );
143 // Do some simple concurrent testing
144 void add_remove (CuTest* tc) {
148 volatile int wait = 2;
149 #ifdef TEST_STRING_KEYS
150 map_t *map = map_alloc(map_type_, &DATATYPE_NSTRING);
152 map_t *map = map_alloc(map_type_, NULL);
155 struct timeval tv1, tv2;
156 gettimeofday(&tv1, NULL);
158 // In 2 threads, add & remove even & odd elements concurrently
160 for (i = 0; i < 2; ++i) {
165 int rc = nbd_thread_create(thread + i, i, add_remove_worker, wd + i);
166 if (rc != 0) { perror("nbd_thread_create"); return; }
169 for (i = 0; i < 2; ++i) {
170 pthread_join(thread[i], NULL);
173 gettimeofday(&tv2, NULL);
174 int ms = (int)(1000000*(tv2.tv_sec - tv1.tv_sec) + tv2.tv_usec - tv1.tv_usec) / 1000;
176 printf("Th:%d Time:%dms\n", 2, ms);
179 // In the end, all members should be removed
180 ASSERT_EQUAL( 0, map_count(map) );
182 // In a quiecent state; it is safe to free.
186 void *inserter_worker (void *arg) {
187 //pthread_t thread[NUM_THREADS];
189 //map_t *map = map_alloc(map_type_);
193 // Concurrent insertion
194 void concurrent_insert (CuTest* tc) {
200 lwt_set_trace_level("h3");
202 map_type_t map_types[] = { MAP_TYPE_LIST, MAP_TYPE_SKIPLIST, MAP_TYPE_HASHTABLE };
203 for (int i = 0; i < sizeof(map_types)/sizeof(*map_types); ++i) {
204 map_type_ = map_types[i];
206 // Create and run test suite
207 CuString *output = CuStringNew();
208 CuSuite* suite = CuSuiteNew();
210 SUITE_ADD_TEST(suite, simple);
211 SUITE_ADD_TEST(suite, add_remove);
214 CuSuiteDetails(suite, output);
215 printf("%s\n", output->buffer);