2 This file is part of systemd
4 Copyright 2013 Daniel Buch
6 systemd is free software; you can redistribute it and/or modify it
7 under the terms of the GNU Lesser General Public License as published by
8 the Free Software Foundation; either version 2.1 of the License, or
9 (at your option) any later version.
11 systemd is distributed in the hope that it will be useful, but
12 WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 Lesser General Public License for more details.
16 You should have received a copy of the GNU Lesser General Public License
17 along with systemd; If not, see <http://www.gnu.org/licenses/>.
25 static void test_hashmap_replace(void) {
27 char *val1, *val2, *val3, *val4, *val5, *r;
29 m = hashmap_new(string_hash_func, string_compare_func);
31 val1 = strdup("val1");
33 val2 = strdup("val2");
35 val3 = strdup("val3");
37 val4 = strdup("val4");
39 val5 = strdup("val5");
42 hashmap_put(m, "key 1", val1);
43 hashmap_put(m, "key 2", val2);
44 hashmap_put(m, "key 3", val3);
45 hashmap_put(m, "key 4", val4);
47 hashmap_replace(m, "key 3", val1);
48 r = hashmap_get(m, "key 3");
49 assert_se(streq(r, "val1"));
51 hashmap_replace(m, "key 5", val5);
52 r = hashmap_get(m, "key 5");
53 assert_se(streq(r, "val5"));
63 static void test_hashmap_copy(void) {
65 char *val1, *val2, *val3, *val4, *r;
67 val1 = strdup("val1");
69 val2 = strdup("val2");
71 val3 = strdup("val3");
73 val4 = strdup("val4");
76 m = hashmap_new(string_hash_func, string_compare_func);
78 hashmap_put(m, "key 1", val1);
79 hashmap_put(m, "key 2", val2);
80 hashmap_put(m, "key 3", val3);
81 hashmap_put(m, "key 4", val4);
83 copy = hashmap_copy(m);
85 r = hashmap_get(copy, "key 1");
86 assert_se(streq(r, "val1"));
87 r = hashmap_get(copy, "key 2");
88 assert_se(streq(r, "val2"));
89 r = hashmap_get(copy, "key 3");
90 assert_se(streq(r, "val3"));
91 r = hashmap_get(copy, "key 4");
92 assert_se(streq(r, "val4"));
94 hashmap_free_free(copy);
98 static void test_hashmap_get_strv(void) {
101 char *val1, *val2, *val3, *val4;
103 val1 = strdup("val1");
105 val2 = strdup("val2");
107 val3 = strdup("val3");
109 val4 = strdup("val4");
112 m = hashmap_new(string_hash_func, string_compare_func);
114 hashmap_put(m, "key 1", val1);
115 hashmap_put(m, "key 2", val2);
116 hashmap_put(m, "key 3", val3);
117 hashmap_put(m, "key 4", val4);
119 strv = hashmap_get_strv(m);
121 assert_se(streq(strv[0], "val1"));
122 assert_se(streq(strv[1], "val2"));
123 assert_se(streq(strv[2], "val3"));
124 assert_se(streq(strv[3], "val4"));
131 static void test_hashmap_move_one(void) {
133 char *val1, *val2, *val3, *val4, *r;
135 val1 = strdup("val1");
137 val2 = strdup("val2");
139 val3 = strdup("val3");
141 val4 = strdup("val4");
144 m = hashmap_new(string_hash_func, string_compare_func);
145 n = hashmap_new(string_hash_func, string_compare_func);
147 hashmap_put(m, "key 1", val1);
148 hashmap_put(m, "key 2", val2);
149 hashmap_put(m, "key 3", val3);
150 hashmap_put(m, "key 4", val4);
152 hashmap_move_one(n, m, "key 3");
153 hashmap_move_one(n, m, "key 4");
155 r = hashmap_get(n, "key 3");
156 assert_se(r && streq(r, "val3"));
157 r = hashmap_get(n, "key 4");
158 assert_se(r && streq(r, "val4"));
159 r = hashmap_get(m, "key 3");
163 hashmap_free_free(m);
164 hashmap_free_free(n);
167 static void test_hashmap_next(void) {
169 char *val1, *val2, *val3, *val4, *r;
171 m = hashmap_new(string_hash_func, string_compare_func);
172 val1 = strdup("val1");
174 val2 = strdup("val2");
176 val3 = strdup("val3");
178 val4 = strdup("val4");
181 hashmap_put(m, "key 1", val1);
182 hashmap_put(m, "key 2", val2);
183 hashmap_put(m, "key 3", val3);
184 hashmap_put(m, "key 4", val4);
186 r = hashmap_next(m, "key 1");
187 assert_se(streq(r, val2));
188 r = hashmap_next(m, "key 2");
189 assert_se(streq(r, val3));
190 r = hashmap_next(m, "key 3");
191 assert_se(streq(r, val4));
192 r = hashmap_next(m, "key 4");
195 hashmap_free_free(m);
198 static void test_hashmap_update(void) {
200 char *val1, *val2, *r;
202 m = hashmap_new(string_hash_func, string_compare_func);
203 val1 = strdup("old_value");
205 val2 = strdup("new_value");
208 hashmap_put(m, "key 1", val1);
209 r = hashmap_get(m, "key 1");
210 assert_se(streq(r, "old_value"));
212 hashmap_update(m, "key 1", val2);
213 r = hashmap_get(m, "key 1");
214 assert_se(streq(r, "new_value"));
221 static void test_hashmap_put(void) {
223 int valid_hashmap_put;
225 m = hashmap_new(string_hash_func, string_compare_func);
227 valid_hashmap_put = hashmap_put(m, "key 1", (void*) (const char *) "val 1");
228 assert_se(valid_hashmap_put == 1);
234 static void test_hashmap_ensure_allocated(void) {
238 m = hashmap_new(string_hash_func, string_compare_func);
240 valid_hashmap = hashmap_ensure_allocated(&m, string_hash_func, string_compare_func);
241 assert_se(valid_hashmap == 0);
247 static void test_hashmap_foreach_key(void) {
250 bool key_found[] = { false, false, false, false };
253 static const char key_table[] =
259 m = hashmap_new(string_hash_func, string_compare_func);
261 NULSTR_FOREACH(key, key_table)
262 hashmap_put(m, key, (void*) (const char*) "my dummy val");
264 HASHMAP_FOREACH_KEY(s, key, m, i) {
265 if (!key_found[0] && streq(key, "key 1"))
267 else if (!key_found[1] && streq(key, "key 2"))
269 else if (!key_found[2] && streq(key, "key 3"))
271 else if (!key_found[3] && streq(key, "fail"))
276 assert_se(key_found[0] && key_found[1] && key_found[2] && !key_found[3]);
281 static void test_hashmap_foreach(void) {
284 bool value_found[] = { false, false, false, false };
285 char *val1, *val2, *val3, *val4, *s;
287 val1 = strdup("my val1");
289 val2 = strdup("my val2");
291 val3 = strdup("my val3");
293 val4 = strdup("my val4");
296 m = hashmap_new(string_hash_func, string_compare_func);
298 hashmap_put(m, "Key 1", val1);
299 hashmap_put(m, "Key 2", val2);
300 hashmap_put(m, "Key 3", val3);
301 hashmap_put(m, "Key 4", val4);
303 HASHMAP_FOREACH(s, m, i) {
304 if (!value_found[0] && streq(s, val1))
305 value_found[0] = true;
306 else if (!value_found[1] && streq(s, val2))
307 value_found[1] = true;
308 else if (!value_found[2] && streq(s, val3))
309 value_found[2] = true;
310 else if (!value_found[3] && streq(s, val4))
311 value_found[3] = true;
315 assert_se(value_found[0] && value_found[1] && value_found[2] && value_found[3]);
317 hashmap_free_free(m);
320 static void test_hashmap_foreach_backwards(void) {
323 char *val1, *val2, *val3, *val4, *s;
324 bool value_found[] = { false, false, false, false };
326 val1 = strdup("my val1");
328 val2 = strdup("my val2");
330 val3 = strdup("my val3");
332 val4 = strdup("my val4");
335 m = hashmap_new(string_hash_func, string_compare_func);
336 hashmap_put(m, "Key 1", val1);
337 hashmap_put(m, "Key 2", val2);
338 hashmap_put(m, "Key 3", val3);
339 hashmap_put(m, "Key 4", val4);
341 HASHMAP_FOREACH_BACKWARDS(s, m, i) {
342 if (!value_found[0] && streq(s, val1))
343 value_found[0] = true;
344 else if (!value_found[1] && streq(s, val2))
345 value_found[1] = true;
346 else if (!value_found[2] && streq(s, val3))
347 value_found[2] = true;
348 else if (!value_found[3] && streq(s, val4))
349 value_found[3] = true;
353 assert_se(value_found[0] && value_found[1] && value_found[2] && value_found[3]);
355 hashmap_free_free(m);
358 static void test_hashmap_merge(void) {
361 char *val1, *val2, *val3, *val4, *r;
363 val1 = strdup("my val1");
365 val2 = strdup("my val2");
367 val3 = strdup("my val3");
369 val4 = strdup("my val4");
372 n = hashmap_new(string_hash_func, string_compare_func);
373 m = hashmap_new(string_hash_func, string_compare_func);
375 hashmap_put(m, "Key 1", val1);
376 hashmap_put(m, "Key 2", val2);
377 hashmap_put(n, "Key 3", val3);
378 hashmap_put(n, "Key 4", val4);
380 assert_se(hashmap_merge(m, n) == 0);
381 r = hashmap_get(m, "Key 3");
382 assert_se(r && streq(r, "my val3"));
383 r = hashmap_get(m, "Key 4");
384 assert_se(r && streq(r, "my val4"));
389 hashmap_free_free(m);
392 static void test_hashmap_contains(void) {
396 val1 = strdup("my val");
399 m = hashmap_new(string_hash_func, string_compare_func);
401 assert_se(!hashmap_contains(m, "Key 1"));
402 hashmap_put(m, "Key 1", val1);
403 assert_se(hashmap_contains(m, "Key 1"));
406 hashmap_free_free(m);
409 static void test_hashmap_isempty(void) {
413 val1 = strdup("my val");
416 m = hashmap_new(string_hash_func, string_compare_func);
418 assert_se(hashmap_isempty(m));
419 hashmap_put(m, "Key 1", val1);
420 assert_se(!hashmap_isempty(m));
423 hashmap_free_free(m);
426 static void test_hashmap_size(void) {
428 char *val1, *val2, *val3, *val4;
430 val1 = strdup("my val");
432 val2 = strdup("my val");
434 val3 = strdup("my val");
436 val4 = strdup("my val");
439 m = hashmap_new(string_hash_func, string_compare_func);
441 hashmap_put(m, "Key 1", val1);
442 hashmap_put(m, "Key 2", val2);
443 hashmap_put(m, "Key 3", val3);
444 hashmap_put(m, "Key 4", val4);
447 assert_se(hashmap_size(m) == 4);
448 hashmap_free_free(m);
451 static void test_hashmap_get(void) {
456 val = strdup("my val");
459 m = hashmap_new(string_hash_func, string_compare_func);
461 hashmap_put(m, "Key 1", val);
463 r = hashmap_get(m, "Key 1");
464 assert_se(streq(r, val));
467 hashmap_free_free(m);
470 static void test_hashmap_many(void) {
474 #define N_ENTRIES 100000
476 assert_se(h = hashmap_new(NULL, NULL));
478 for (i = 1; i < N_ENTRIES*3; i+=3) {
479 assert_se(hashmap_put(h, UINT_TO_PTR(i), UINT_TO_PTR(i)) >= 0);
480 assert_se(PTR_TO_UINT(hashmap_get(h, UINT_TO_PTR(i))) == i);
483 for (i = 1; i < N_ENTRIES*3; i++)
484 assert_se(hashmap_contains(h, UINT_TO_PTR(i)) == (i % 3 == 1));
486 log_info("%u <= %u * 0.75 = %g", hashmap_size(h), hashmap_buckets(h), hashmap_buckets(h) * 0.75);
488 assert_se(hashmap_size(h) <= hashmap_buckets(h) * 0.75);
489 assert_se(hashmap_size(h) == N_ENTRIES);
494 static void test_uint64_compare_func(void) {
495 const uint64_t a = 0x100, b = 0x101;
497 assert_se(uint64_compare_func(&a, &a) == 0);
498 assert_se(uint64_compare_func(&a, &b) == -1);
499 assert_se(uint64_compare_func(&b, &a) == 1);
502 static void test_trivial_compare_func(void) {
503 assert_se(trivial_compare_func(INT_TO_PTR('a'), INT_TO_PTR('a')) == 0);
504 assert_se(trivial_compare_func(INT_TO_PTR('a'), INT_TO_PTR('b')) == -1);
505 assert_se(trivial_compare_func(INT_TO_PTR('b'), INT_TO_PTR('a')) == 1);
508 static void test_string_compare_func(void) {
509 assert_se(!string_compare_func("fred", "wilma") == 0);
510 assert_se(string_compare_func("fred", "fred") == 0);
513 int main(int argc, const char *argv[]) {
515 test_hashmap_get_strv();
516 test_hashmap_move_one();
518 test_hashmap_replace();
519 test_hashmap_update();
521 test_hashmap_ensure_allocated();
522 test_hashmap_foreach();
523 test_hashmap_foreach_backwards();
524 test_hashmap_foreach_key();
525 test_hashmap_contains();
526 test_hashmap_merge();
527 test_hashmap_isempty();
531 test_uint64_compare_func();
532 test_trivial_compare_func();
533 test_string_compare_func();