2 * Written by Josh Dybnis and released to the public domain, as explained at
3 * http://creativecommons.org/licenses/publicdomain
16 #define ASSERT_EQUAL(x, y) CuAssertIntEquals(tc, x, y)
18 typedef struct worker_data {
25 static map_type_t map_type_;
27 // Test some basic stuff; add a few keys, remove a few keys
28 void simple (CuTest* tc) {
30 map_t *map = map_alloc(map_type_, NULL, NULL, NULL);
32 ASSERT_EQUAL( 0, map_count(map) );
33 ASSERT_EQUAL( DOES_NOT_EXIST, map_add(map, (void *)'a',10) );
34 ASSERT_EQUAL( 1, map_count(map) );
35 ASSERT_EQUAL( DOES_NOT_EXIST, map_add(map, (void *)'b',20) );
36 ASSERT_EQUAL( 2, map_count(map) );
37 ASSERT_EQUAL( 20, map_get(map, (void *)'b') );
38 ASSERT_EQUAL( 10, map_set(map, (void *)'a',11) );
39 ASSERT_EQUAL( 20, map_set(map, (void *)'b',21) );
40 ASSERT_EQUAL( 2, map_count(map) );
41 ASSERT_EQUAL( 21, map_add(map, (void *)'b',22) );
42 ASSERT_EQUAL( 11, map_remove(map, (void *)'a') );
43 ASSERT_EQUAL( DOES_NOT_EXIST, map_get(map, (void *)'a') );
44 ASSERT_EQUAL( 1, map_count(map) );
45 ASSERT_EQUAL( DOES_NOT_EXIST, map_remove(map, (void *)'a') );
46 ASSERT_EQUAL( 21, map_remove(map, (void *)'b') );
47 ASSERT_EQUAL( 0, map_count(map) );
48 ASSERT_EQUAL( DOES_NOT_EXIST, map_remove(map, (void *)'b') );
49 ASSERT_EQUAL( DOES_NOT_EXIST, map_remove(map, (void *)'c') );
50 ASSERT_EQUAL( 0, map_count(map) );
52 ASSERT_EQUAL( DOES_NOT_EXIST, map_add(map, (void *)'d',40) );
53 ASSERT_EQUAL( 40, map_get(map, (void *)'d') );
54 ASSERT_EQUAL( 1, map_count(map) );
55 ASSERT_EQUAL( 40, map_remove(map, (void *)'d') );
56 ASSERT_EQUAL( DOES_NOT_EXIST, map_get(map, (void *)'d') );
57 ASSERT_EQUAL( 0, map_count(map) );
59 ASSERT_EQUAL( DOES_NOT_EXIST, map_replace(map, (void *)'d',10) );
60 ASSERT_EQUAL( DOES_NOT_EXIST, map_get(map, (void *)'d') );
61 ASSERT_EQUAL( DOES_NOT_EXIST, map_set(map, (void *)'d',40) );
62 ASSERT_EQUAL( 40, map_replace(map, (void *)'d',41) );
63 ASSERT_EQUAL( 41, map_get(map, (void *)'d') );
64 ASSERT_EQUAL( 41, map_remove(map, (void *)'d') );
65 ASSERT_EQUAL( DOES_NOT_EXIST, map_get(map, (void *)'d') );
66 ASSERT_EQUAL( 0, map_count(map) );
68 ASSERT_EQUAL( DOES_NOT_EXIST, map_replace(map, (void *)'b',20) );
69 ASSERT_EQUAL( DOES_NOT_EXIST, map_get(map, (void *)'b') );
71 // In the end, all entries should be removed
72 ASSERT_EQUAL( DOES_NOT_EXIST, map_set(map, (void *)'b',20) );
73 ASSERT_EQUAL( 20, map_replace(map, (void *)'b',21) );
74 ASSERT_EQUAL( 21, map_get(map, (void *)'b') );
75 ASSERT_EQUAL( 21, map_remove(map, (void *)'b') );
76 ASSERT_EQUAL( DOES_NOT_EXIST, map_get(map, (void *)'b') );
77 ASSERT_EQUAL( 0, map_count(map) );
81 // In a quiecent state; it is safe to free.
85 void *add_remove_worker (void *arg) {
86 worker_data_t *wd = (worker_data_t *)arg;
90 int iters = (map_type_ == MAP_TYPE_LIST) ? 5000 : 500000;
92 SYNC_ADD(wd->wait, -1);
93 do { } while (*wd->wait); // wait for all workers to be ready
95 for (int j = 0; j < 10; ++j) {
96 for (uint64_t i = d+1; i < iters; i+=2) {
97 TRACE("t0", "test map_add() iteration (%llu, %llu)", j, i);
98 CuAssertIntEquals_Msg(tc, (void *)i, DOES_NOT_EXIST, map_add(map, (void *)i, d+1) );
101 for (uint64_t i = d+1; i < iters; i+=2) {
102 TRACE("t0", "test map_remove() iteration (%llu, %llu)", j, i);
103 CuAssertIntEquals_Msg(tc, (void *)i, d+1, map_remove(map, (void *)i) );
110 // Do some simple concurrent testing
111 void add_remove (CuTest* tc) {
115 volatile int wait = 2;
116 map_t *map = map_alloc(map_type_, NULL, NULL, NULL);
118 struct timeval tv1, tv2;
119 gettimeofday(&tv1, NULL);
121 // In 2 threads, add & remove even & odd elements concurrently
123 for (i = 0; i < 2; ++i) {
128 int rc = nbd_thread_create(thread + i, i, add_remove_worker, wd + i);
129 if (rc != 0) { perror("nbd_thread_create"); return; }
132 for (i = 0; i < 2; ++i) {
133 pthread_join(thread[i], NULL);
136 gettimeofday(&tv2, NULL);
137 int ms = (int)(1000000*(tv2.tv_sec - tv1.tv_sec) + tv2.tv_usec - tv1.tv_usec) / 1000;
139 printf("Th:%d Time:%dms\n", 2, ms);
142 // In the end, all members should be removed
143 ASSERT_EQUAL( 0, map_count(map) );
145 // In a quiecent state; it is safe to free.
149 void *inserter_worker (void *arg) {
150 //pthread_t thread[NUM_THREADS];
152 //map_t *map = map_alloc(map_type_);
156 // Concurrent insertion
157 void concurrent_insert (CuTest* tc) {
163 lwt_set_trace_level("h3");
165 map_type_t map_types[] = { MAP_TYPE_LIST, MAP_TYPE_SKIPLIST, MAP_TYPE_HASHTABLE };
166 for (int i = 0; i < sizeof(map_types)/sizeof(*map_types); ++i) {
167 map_type_ = map_types[i];
169 // Create and run test suite
170 CuString *output = CuStringNew();
171 CuSuite* suite = CuSuiteNew();
173 SUITE_ADD_TEST(suite, simple);
174 SUITE_ADD_TEST(suite, add_remove);
177 CuSuiteDetails(suite, output);
178 printf("%s\n", output->buffer);