]> git.ipfire.org Git - thirdparty/systemd.git/blame - src/test/test-ordered-set.c
license: LGPL-2.1+ -> LGPL-2.1-or-later
[thirdparty/systemd.git] / src / test / test-ordered-set.c
CommitLineData
db9ecf05 1/* SPDX-License-Identifier: LGPL-2.1-or-later */
1b78172b 2
53ae3f64
ZJS
3#include <stdio.h>
4
1b78172b 5#include "ordered-set.h"
ef79eae0
ZJS
6#include "string-util.h"
7#include "strv.h"
1b78172b
ZJS
8
9static void test_set_steal_first(void) {
d4fa0493
ZJS
10 log_info("/* %s */", __func__);
11
1b78172b
ZJS
12 _cleanup_ordered_set_free_ OrderedSet *m = NULL;
13 int seen[3] = {};
14 char *val;
15
16 m = ordered_set_new(&string_hash_ops);
17 assert_se(m);
18
19 assert_se(ordered_set_put(m, (void*) "1") == 1);
20 assert_se(ordered_set_put(m, (void*) "22") == 1);
21 assert_se(ordered_set_put(m, (void*) "333") == 1);
22
53ae3f64
ZJS
23 ordered_set_print(stdout, "SET=", m);
24
1b78172b
ZJS
25 while ((val = ordered_set_steal_first(m)))
26 seen[strlen(val) - 1]++;
27
28 assert_se(seen[0] == 1 && seen[1] == 1 && seen[2] == 1);
29
30 assert_se(ordered_set_isempty(m));
53ae3f64
ZJS
31
32 ordered_set_print(stdout, "SET=", m);
1b78172b
ZJS
33}
34
35typedef struct Item {
36 int seen;
37} Item;
38static void item_seen(Item *item) {
39 item->seen++;
40}
41
42DEFINE_PRIVATE_HASH_OPS_WITH_VALUE_DESTRUCTOR(item_hash_ops, void, trivial_hash_func, trivial_compare_func, Item, item_seen);
43
44static void test_set_free_with_hash_ops(void) {
45 OrderedSet *m;
46 struct Item items[4] = {};
d4fa0493
ZJS
47
48 log_info("/* %s */", __func__);
1b78172b
ZJS
49
50 assert_se(m = ordered_set_new(&item_hash_ops));
d4fa0493
ZJS
51
52 for (size_t i = 0; i < ELEMENTSOF(items) - 1; i++)
1b78172b
ZJS
53 assert_se(ordered_set_put(m, items + i) == 1);
54
d4fa0493
ZJS
55 for (size_t i = 0; i < ELEMENTSOF(items) - 1; i++)
56 assert_se(ordered_set_put(m, items + i) == 0); /* We get 0 here, because we use trivial hash
57 * ops. Also see below... */
58
1b78172b
ZJS
59 m = ordered_set_free(m);
60 assert_se(items[0].seen == 1);
61 assert_se(items[1].seen == 1);
62 assert_se(items[2].seen == 1);
63 assert_se(items[3].seen == 0);
64}
65
66static void test_set_put(void) {
67 _cleanup_ordered_set_free_ OrderedSet *m = NULL;
2645d4bc 68 _cleanup_free_ char **t = NULL, *str = NULL;
1b78172b 69
d4fa0493
ZJS
70 log_info("/* %s */", __func__);
71
1b78172b
ZJS
72 m = ordered_set_new(&string_hash_ops);
73 assert_se(m);
74
75 assert_se(ordered_set_put(m, (void*) "1") == 1);
76 assert_se(ordered_set_put(m, (void*) "22") == 1);
77 assert_se(ordered_set_put(m, (void*) "333") == 1);
78 assert_se(ordered_set_put(m, (void*) "333") == 0);
79 assert_se(ordered_set_remove(m, (void*) "333"));
80 assert_se(ordered_set_put(m, (void*) "333") == 1);
81 assert_se(ordered_set_put(m, (void*) "333") == 0);
82 assert_se(ordered_set_put(m, (void*) "22") == 0);
ef79eae0 83
2645d4bc 84 assert_se(str = strdup("333"));
d4fa0493
ZJS
85 assert_se(ordered_set_put(m, str) == -EEXIST); /* ... and we get -EEXIST here, because we use
86 * non-trivial hash ops. */
2645d4bc 87
ef79eae0
ZJS
88 assert_se(t = ordered_set_get_strv(m));
89 assert_se(streq(t[0], "1"));
90 assert_se(streq(t[1], "22"));
91 assert_se(streq(t[2], "333"));
92 assert_se(!t[3]);
53ae3f64
ZJS
93
94 ordered_set_print(stdout, "FOO=", m);
ef79eae0
ZJS
95}
96
97static void test_set_put_string_set(void) {
98 _cleanup_ordered_set_free_free_ OrderedSet *m = NULL;
99 _cleanup_ordered_set_free_ OrderedSet *q = NULL;
100 _cleanup_free_ char **final = NULL; /* "just free" because the strings are in the set */
101 void *t;
102
d4fa0493
ZJS
103 log_info("/* %s */", __func__);
104
ef79eae0
ZJS
105 m = ordered_set_new(&string_hash_ops);
106 assert_se(m);
107
108 q = ordered_set_new(&string_hash_ops);
109 assert_se(q);
110
111 assert_se(t = strdup("1"));
112 assert_se(ordered_set_put(m, t) == 1);
113 assert_se(t = strdup("22"));
114 assert_se(ordered_set_put(m, t) == 1);
115 assert_se(t = strdup("333"));
116 assert_se(ordered_set_put(m, t) == 1);
117
118 assert_se(ordered_set_put(q, (void*) "11") == 1);
119 assert_se(ordered_set_put(q, (void*) "22") == 1);
120 assert_se(ordered_set_put(q, (void*) "33") == 1);
121
122 assert_se(ordered_set_put_string_set(m, q) == 2);
123
124 assert_se(final = ordered_set_get_strv(m));
125 assert_se(strv_equal(final, STRV_MAKE("1", "22", "333", "11", "33")));
53ae3f64
ZJS
126
127 ordered_set_print(stdout, "BAR=", m);
1b78172b
ZJS
128}
129
130int main(int argc, const char *argv[]) {
131 test_set_steal_first();
132 test_set_free_with_hash_ops();
133 test_set_put();
ef79eae0 134 test_set_put_string_set();
1b78172b
ZJS
135
136 return 0;
137}