]>
Commit | Line | Data |
---|---|---|
53e1b683 | 1 | /* SPDX-License-Identifier: LGPL-2.1+ */ |
9341a4a1 | 2 | |
9341a4a1 | 3 | #include "hashmap.h" |
cf0fbc49 | 4 | #include "util.h" |
9341a4a1 | 5 | |
8872c3a3 ZJS |
6 | unsigned custom_counter = 0; |
7 | static void custom_destruct(void* p) { | |
8 | custom_counter--; | |
9 | free(p); | |
10 | } | |
11 | ||
12 | DEFINE_HASH_OPS_FULL(boring_hash_ops, char, string_hash_func, string_compare_func, free, char, free); | |
13 | DEFINE_HASH_OPS_FULL(custom_hash_ops, char, string_hash_func, string_compare_func, custom_destruct, char, custom_destruct); | |
14 | ||
32a4456c MS |
15 | void test_hashmap_funcs(void); |
16 | void test_ordered_hashmap_funcs(void); | |
9341a4a1 | 17 | |
32a4456c | 18 | static void test_ordered_hashmap_next(void) { |
8f8a5213 MS |
19 | _cleanup_ordered_hashmap_free_ OrderedHashmap *m = NULL; |
20 | int i; | |
21 | ||
32ca2911 ZJS |
22 | log_info("/* %s */", __func__); |
23 | ||
8f8a5213 MS |
24 | assert_se(m = ordered_hashmap_new(NULL)); |
25 | for (i = -2; i <= 2; i++) | |
26 | assert_se(ordered_hashmap_put(m, INT_TO_PTR(i), INT_TO_PTR(i+10)) == 1); | |
27 | for (i = -2; i <= 1; i++) | |
28 | assert_se(ordered_hashmap_next(m, INT_TO_PTR(i)) == INT_TO_PTR(i+11)); | |
29 | assert_se(!ordered_hashmap_next(m, INT_TO_PTR(2))); | |
30 | assert_se(!ordered_hashmap_next(NULL, INT_TO_PTR(1))); | |
31 | assert_se(!ordered_hashmap_next(m, INT_TO_PTR(3))); | |
d06b3a9d RC |
32 | } |
33 | ||
9341a4a1 | 34 | static void test_uint64_compare_func(void) { |
8097ab4f ZJS |
35 | const uint64_t a = 0x100, b = 0x101; |
36 | ||
37 | assert_se(uint64_compare_func(&a, &a) == 0); | |
38 | assert_se(uint64_compare_func(&a, &b) == -1); | |
39 | assert_se(uint64_compare_func(&b, &a) == 1); | |
9341a4a1 DB |
40 | } |
41 | ||
42 | static void test_trivial_compare_func(void) { | |
43 | assert_se(trivial_compare_func(INT_TO_PTR('a'), INT_TO_PTR('a')) == 0); | |
44 | assert_se(trivial_compare_func(INT_TO_PTR('a'), INT_TO_PTR('b')) == -1); | |
45 | assert_se(trivial_compare_func(INT_TO_PTR('b'), INT_TO_PTR('a')) == 1); | |
46 | } | |
47 | ||
48 | static void test_string_compare_func(void) { | |
4b3eff61 | 49 | assert_se(string_compare_func("fred", "wilma") != 0); |
9341a4a1 DB |
50 | assert_se(string_compare_func("fred", "fred") == 0); |
51 | } | |
52 | ||
647c7b74 VC |
53 | static void compare_cache(Hashmap *map, IteratedCache *cache) { |
54 | const void **keys = NULL, **values = NULL; | |
55 | unsigned num, idx; | |
56 | Iterator iter; | |
57 | void *k, *v; | |
58 | ||
59 | assert_se(iterated_cache_get(cache, &keys, &values, &num) == 0); | |
60 | assert_se(num == 0 || keys); | |
61 | assert_se(num == 0 || values); | |
62 | ||
63 | idx = 0; | |
64 | HASHMAP_FOREACH_KEY(v, k, map, iter) { | |
65 | assert_se(v == values[idx]); | |
66 | assert_se(k == keys[idx]); | |
67 | ||
68 | idx++; | |
69 | } | |
70 | ||
71 | assert_se(idx == num); | |
72 | } | |
73 | ||
74 | static void test_iterated_cache(void) { | |
75 | Hashmap *m; | |
76 | IteratedCache *c; | |
77 | ||
32ca2911 ZJS |
78 | log_info("/* %s */", __func__); |
79 | ||
647c7b74 VC |
80 | assert_se(m = hashmap_new(NULL)); |
81 | assert_se(c = hashmap_iterated_cache_new(m)); | |
82 | compare_cache(m, c); | |
83 | ||
84 | for (int stage = 0; stage < 100; stage++) { | |
85 | ||
86 | for (int i = 0; i < 100; i++) { | |
87 | int foo = stage * 1000 + i; | |
88 | ||
89 | assert_se(hashmap_put(m, INT_TO_PTR(foo), INT_TO_PTR(foo + 777)) == 1); | |
90 | } | |
91 | ||
92 | compare_cache(m, c); | |
93 | ||
94 | if (!(stage % 10)) { | |
95 | for (int i = 0; i < 100; i++) { | |
96 | int foo = stage * 1000 + i; | |
97 | ||
98 | assert_se(hashmap_remove(m, INT_TO_PTR(foo)) == INT_TO_PTR(foo + 777)); | |
99 | } | |
100 | ||
101 | compare_cache(m, c); | |
102 | } | |
103 | } | |
104 | ||
105 | hashmap_clear(m); | |
106 | compare_cache(m, c); | |
107 | ||
108 | assert_se(hashmap_free(m) == NULL); | |
109 | assert_se(iterated_cache_free(c) == NULL); | |
110 | } | |
111 | ||
d578f909 ZJS |
112 | int main(int argc, const char *argv[]) { |
113 | /* This file tests in test-hashmap-plain.c, and tests in test-hashmap-ordered.c, which is generated | |
114 | * from test-hashmap-plain.c. Hashmap tests should be added to test-hashmap-plain.c, and here only if | |
115 | * they don't apply to ordered hashmaps. */ | |
46e16b34 | 116 | |
d578f909 ZJS |
117 | log_parse_environment(); |
118 | log_open(); | |
32ca2911 | 119 | |
32a4456c MS |
120 | test_hashmap_funcs(); |
121 | test_ordered_hashmap_funcs(); | |
122 | ||
d578f909 ZJS |
123 | log_info("/************ non-shared tests ************/"); |
124 | ||
32a4456c | 125 | test_ordered_hashmap_next(); |
9341a4a1 DB |
126 | test_uint64_compare_func(); |
127 | test_trivial_compare_func(); | |
128 | test_string_compare_func(); | |
647c7b74 | 129 | test_iterated_cache(); |
46e16b34 LP |
130 | |
131 | return 0; | |
9341a4a1 | 132 | } |