1 /*
2 * SysDB - t/utils/llist_test.c
3 * Copyright (C) 2013 Sebastian 'tokkee' Harl <sh@tokkee.org>
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
16 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
17 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
18 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
19 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
20 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
21 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
22 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
23 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
24 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
25 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 */
28 #include "utils/llist.h"
29 #include "libsysdb_test.h"
31 #include <check.h>
33 /*
34 * private data types
35 */
37 static sdb_object_t golden_data[] = {
38 SSTRING_OBJ("abc"),
39 SSTRING_OBJ("bcd"),
40 SSTRING_OBJ("cde"),
41 SSTRING_OBJ("def"),
42 SSTRING_OBJ("efg"),
43 SSTRING_OBJ("fgh"),
44 SSTRING_OBJ("ghi")
45 };
47 static char *unused_names[] = {
48 "xyz",
49 "yza",
50 "zab"
51 };
53 static sdb_llist_t *list;
55 static void
56 setup(void)
57 {
58 list = sdb_llist_create();
59 fail_unless(list != NULL,
60 "sdb_llist_create() = NULL; expected list object");
61 } /* setup */
63 static void
64 teardown(void)
65 {
66 sdb_llist_destroy(list);
67 list = NULL;
68 } /* teardown */
70 /* populate the list with the golden data in the specified order */
71 static void
72 populate(void)
73 {
74 size_t i;
75 for (i = 0; i < SDB_STATIC_ARRAY_LEN(golden_data); ++i) {
76 int check = sdb_llist_append(list, &golden_data[i]);
77 fail_unless(check == 0,
78 "sdb_llist_append(%s) = %i; expected: 0",
79 golden_data[i].name, check);
80 }
81 } /* populate */
83 START_TEST(test_sdb_llist_clone)
84 {
85 sdb_llist_t *clone;
86 size_t i;
88 populate();
90 clone = sdb_llist_clone(list);
91 fail_unless(clone != NULL,
92 "sdb_llist_clone() = NULL; expected: cloned list object");
94 for (i = 0; i < SDB_STATIC_ARRAY_LEN(golden_data); ++i) {
95 fail_unless(golden_data[i].ref_cnt == 3,
96 "sdb_llist_clone() did not take ownership");
97 }
99 sdb_llist_destroy(clone);
100 }
101 END_TEST
103 START_TEST(test_sdb_llist_destroy)
104 {
105 size_t i;
106 populate();
107 sdb_llist_destroy(list);
108 list = NULL;
110 for (i = 0; i < SDB_STATIC_ARRAY_LEN(golden_data); ++i) {
111 fail_unless(golden_data[i].ref_cnt == 1,
112 "sdb_llist_destroy() did not deref element %s",
113 golden_data[i].name);
114 }
115 }
116 END_TEST
118 START_TEST(test_sdb_llist_append)
119 {
120 size_t i;
122 fail_unless(sdb_llist_len(list) == 0,
123 "sdb_llist_len(<empty list>) = %zu; expected: 0",
124 sdb_llist_len(list));
126 for (i = 0; i < SDB_STATIC_ARRAY_LEN(golden_data); ++i) {
127 int check = sdb_llist_append(list, &golden_data[i]);
128 fail_unless(check == 0,
129 "sdb_llist_append(%s) = %i; expected: 0",
130 golden_data[i].name, check);
131 fail_unless(golden_data[i].ref_cnt == 2,
132 "sdb_llist_append(%s) did not take ownership",
133 golden_data[i].name);
134 fail_unless(sdb_llist_len(list) == i + 1,
135 "sdb_llist_len(<empty list>) = %zu; expected: zu",
136 sdb_llist_len(list), i + 1);
137 }
138 }
139 END_TEST
141 START_TEST(test_sdb_llist_insert)
142 {
143 size_t i;
144 for (i = 0; i < SDB_STATIC_ARRAY_LEN(golden_data); ++i) {
145 int check = sdb_llist_insert(list, &golden_data[i], 0);
146 fail_unless(check == 0,
147 "sdb_llist_insert(%s, 0) = %i; expected: 0",
148 golden_data[i].name, check);
149 fail_unless(golden_data[i].ref_cnt == 2,
150 "sdb_llist_insert(%s, 0) did not take ownership",
151 golden_data[i].name);
152 }
153 }
154 END_TEST
156 START_TEST(test_validate_insert)
157 {
158 size_t i;
159 for (i = 0; i < SDB_STATIC_ARRAY_LEN(golden_data); ++i) {
160 /* none of these operations will succeed
161 * => 1 is invalid for each case */
162 int check = sdb_llist_insert(list, &golden_data[i], 1);
163 fail_unless(check == -1,
164 "sdb_llist_insert(%s, 1) = %i; expected: -1",
165 golden_data[i].name, check);
166 fail_unless(golden_data[i].ref_cnt == 1,
167 "sdb_llist_insert(%s, 1) took ownership",
168 golden_data[i].name);
169 }
170 }
171 END_TEST
173 START_TEST(test_sdb_llist_get)
174 {
175 size_t i;
176 populate();
177 for (i = 0; i < SDB_STATIC_ARRAY_LEN(golden_data); ++i) {
178 sdb_object_t *check = sdb_llist_get(list, i);
179 fail_unless(check == &golden_data[i],
180 "sdb_llist_get() = NULL; expected: %p",
181 &golden_data[i]);
182 fail_unless(check->ref_cnt == 2,
183 "sdb_llist_get() changed reference count; got: %i; "
184 "expected: 2", check->ref_cnt);
185 }
186 }
187 END_TEST
189 static int
190 dummy_lookup(const sdb_object_t __attribute__((unused)) *obj,
191 const void __attribute__((unused)) *user_data)
192 {
193 return 0;
194 } /* dummy_lookup */
196 START_TEST(test_sdb_llist_search)
197 {
198 size_t i;
199 populate();
200 for (i = 0; i < SDB_STATIC_ARRAY_LEN(golden_data); ++i) {
201 sdb_object_t *check = sdb_llist_search_by_name(list,
202 golden_data[i].name);
203 fail_unless(check == &golden_data[i],
204 "sdb_llist_search_by_name(%s) = NULL; expected: %p",
205 golden_data[i].name, &golden_data[i]);
206 }
208 for (i = 0; i < SDB_STATIC_ARRAY_LEN(unused_names); ++i) {
209 sdb_object_t *check = sdb_llist_search_by_name(list,
210 unused_names[i]);
211 fail_unless(check == NULL,
212 "sdb_llist_search_by_name(%s) = %p; expected: NULL",
213 unused_names[i], check);
214 }
216 for (i = 0; i < SDB_STATIC_ARRAY_LEN(golden_data); ++i) {
217 /* dummy_lookup always return 0, thus, this will always return the
218 * first element */
219 sdb_object_t *check = sdb_llist_search(list, dummy_lookup, NULL);
220 fail_unless(check == &golden_data[i],
221 "sdb_llist_search() = %p (%s); expected: %p (%s)",
222 check, check->name, &golden_data[i], golden_data[i].name);
224 /* => remove the first element */
225 check = sdb_llist_remove(list, dummy_lookup, NULL);
226 fail_unless(check == &golden_data[i],
227 "sdb_llist_remove() = %p (%s); expected: %p (%s)",
228 check, check->name, &golden_data[i], golden_data[i].name);
229 fail_unless(check->ref_cnt == 2,
230 "sdb_llist_remove() changed reference count; got: %i; "
231 "expected: 2", check->ref_cnt);
232 }
233 /* should now be empty */
234 fail_unless(sdb_llist_len(list) == 0,
235 "Still have %i elements in the list; expected: 0",
236 sdb_llist_len(list));
237 }
238 END_TEST
240 START_TEST(test_sdb_llist_shift)
241 {
242 size_t i;
243 populate();
244 for (i = 0; i < SDB_STATIC_ARRAY_LEN(golden_data); ++i) {
245 sdb_object_t *check = sdb_llist_shift(list);
246 fail_unless(check == &golden_data[i],
247 "sdb_llist_shift() = NULL; expected: %p",
248 &golden_data[i]);
249 fail_unless(check->ref_cnt == 2,
250 "sdb_llist_shift() changed reference count; got: %i; "
251 "expected: 2", check->ref_cnt);
252 }
254 /* must be empty now */
255 fail_unless(sdb_llist_shift(list) == NULL,
256 "sdb_llist_shift() returned value; expected: NULL");
257 }
258 END_TEST
260 START_TEST(test_sdb_llist_iter)
261 {
262 sdb_llist_iter_t *iter;
263 size_t i;
265 populate();
267 iter = sdb_llist_get_iter(list);
268 fail_unless(iter != NULL,
269 "sdb_llist_get_iter() did not return an iterator");
271 for (i = 0; i < SDB_STATIC_ARRAY_LEN(golden_data); ++i) {
272 sdb_object_t *check;
273 fail_unless(sdb_llist_iter_has_next(iter),
274 "sdb_llist_iter_has_next() = FALSE; expected: TRUE");
275 check = sdb_llist_iter_get_next(iter);
276 fail_unless(check == &golden_data[i],
277 "sdb_llist_iter_get_next() = %p; expected: %p",
278 check, &golden_data[i]);
279 }
281 fail_unless(!sdb_llist_iter_has_next(iter),
282 "sdb_llist_iter_has_next() = TRUE; expected: FALSE");
283 fail_unless(sdb_llist_iter_get_next(iter) == NULL,
284 "sdb_llist_iter_get_next() returned value; expected: NULL");
285 sdb_llist_iter_destroy(iter);
286 }
287 END_TEST
289 START_TEST(test_sdb_llist_iter_remove)
290 {
291 sdb_llist_iter_t *iter;
292 sdb_object_t *check;
293 size_t i;
295 populate();
297 iter = sdb_llist_get_iter(list);
298 fail_unless(iter != NULL,
299 "sdb_llist_get_iter() did not return an iterator");
301 i = 0;
302 while (sdb_llist_iter_has_next(iter)) {
303 check = sdb_llist_iter_get_next(iter);
304 fail_unless(check == &golden_data[i],
305 "sdb_llist_iter_get_next() = %p; expected: %p",
306 check, &golden_data[i]);
308 sdb_llist_iter_remove_current(iter);
309 ++i;
310 }
311 sdb_llist_iter_destroy(iter);
313 fail_unless(i == (size_t)SDB_STATIC_ARRAY_LEN(golden_data),
314 "iterated for %zu steps; expected: %i",
315 i, SDB_STATIC_ARRAY_LEN(golden_data));
317 /* all elements should be removed */
318 check = sdb_llist_shift(list);
319 fail_unless(check == NULL,
320 "sdb_llist_shift() = %p; expected: NULL", check);
321 }
322 END_TEST
324 Suite *
325 util_llist_suite(void)
326 {
327 Suite *s = suite_create("utils::llist");
328 TCase *tc;
330 tc = tcase_create("core");
331 tcase_add_checked_fixture(tc, setup, teardown);
332 tcase_add_test(tc, test_sdb_llist_clone);
333 tcase_add_test(tc, test_sdb_llist_destroy);
334 tcase_add_test(tc, test_sdb_llist_append);
335 tcase_add_test(tc, test_sdb_llist_insert);
336 tcase_add_test(tc, test_validate_insert);
337 tcase_add_test(tc, test_sdb_llist_get);
338 tcase_add_test(tc, test_sdb_llist_search);
339 tcase_add_test(tc, test_sdb_llist_shift);
340 tcase_add_test(tc, test_sdb_llist_iter);
341 tcase_add_test(tc, test_sdb_llist_iter_remove);
342 suite_add_tcase(s, tc);
344 return s;
345 } /* util_llist_suite */
347 /* vim: set tw=78 sw=4 ts=4 noexpandtab : */