1 /*
2 * SysDB - t/unit/utils/avltree_test.c
3 * Copyright (C) 2015 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/avltree.h"
29 #include "libsysdb_test.h"
31 #include <check.h>
33 static sdb_avltree_t *tree;
35 static void
36 setup(void)
37 {
38 tree = sdb_avltree_create();
39 fail_unless(tree != NULL,
40 "sdb_avltree_create() = NULL; expected AVL-tree object");
41 } /* setup */
43 static void
44 teardown(void)
45 {
46 sdb_avltree_destroy(tree);
47 tree = NULL;
48 } /* teardown */
50 /* 'a' thru 'o' */
51 static sdb_object_t test_data[] = {
52 SDB_OBJECT_STATIC("h"),
53 SDB_OBJECT_STATIC("j"),
54 SDB_OBJECT_STATIC("i"),
55 SDB_OBJECT_STATIC("f"),
56 SDB_OBJECT_STATIC("e"),
57 SDB_OBJECT_STATIC("g"),
58 SDB_OBJECT_STATIC("k"),
59 SDB_OBJECT_STATIC("l"),
60 SDB_OBJECT_STATIC("m"),
61 SDB_OBJECT_STATIC("n"),
62 SDB_OBJECT_STATIC("o"),
63 SDB_OBJECT_STATIC("d"),
64 SDB_OBJECT_STATIC("c"),
65 SDB_OBJECT_STATIC("b"),
66 SDB_OBJECT_STATIC("a"),
67 };
69 static char *unused_names[] = { "x", "y", "z" };
71 static void
72 populate(void)
73 {
74 size_t i;
75 for (i = 0; i < SDB_STATIC_ARRAY_LEN(test_data); ++i)
76 sdb_avltree_insert(tree, &test_data[i]);
77 } /* populate */
79 START_TEST(test_null)
80 {
81 sdb_object_t o1 = SDB_OBJECT_STATIC("obj");
82 sdb_object_t *o2;
83 sdb_avltree_iter_t *iter;
84 int check;
86 /* all functions should work even when passed null values */
87 sdb_avltree_destroy(NULL);
88 sdb_avltree_clear(NULL);
90 check = sdb_avltree_insert(NULL, NULL);
91 fail_unless(check < 0,
92 "sdb_avltree_insert(NULL, NULL) = %d; expected: <0", check);
93 check = sdb_avltree_insert(NULL, &o1);
94 fail_unless(check < 0,
95 "sdb_avltree_insert(NULL, <obj>) = %d; expected: <0", check);
96 fail_unless(o1.ref_cnt == 1,
97 "sdb_avltree_insert(NULL, <obj>) incremented ref-cnt");
98 /* it's acceptable to insert NULL */
100 iter = sdb_avltree_get_iter(NULL);
101 fail_unless(iter == NULL,
102 "sdb_avltree_get_iter(NULL) = %p; expected: NULL", iter);
104 check = sdb_avltree_iter_has_next(NULL) != 0;
105 fail_unless(check == 0,
106 "sdb_avltree_iter_has_next(NULL) = %d; expected: 0", check);
107 o2 = sdb_avltree_iter_get_next(NULL);
108 fail_unless(o2 == NULL,
109 "sdb_avltree_iter_get_next(NULL) = %p; expected: NULL", o2);
111 sdb_avltree_iter_destroy(NULL);
113 check = (int)sdb_avltree_size(NULL);
114 fail_unless(check == 0,
115 "sdb_avltree_size(NULL) = %d; expected: 0", check);
116 }
117 END_TEST
119 START_TEST(test_insert)
120 {
121 size_t i;
123 for (i = 0; i < SDB_STATIC_ARRAY_LEN(test_data); ++i) {
124 int check;
126 check = sdb_avltree_insert(tree, &test_data[i]);
127 fail_unless(check == 0,
128 "sdb_avltree_insert(<tree>, <%s>) = %d; expected: 0",
129 test_data[i].name, check);
131 check = (int)sdb_avltree_size(tree);
132 fail_unless(check == (int)i + 1,
133 "sdb_avltree_size(<tree>) = %d; expected: %zu",
134 check, i + 1);
136 fail_unless(sdb_avltree_valid(tree),
137 "sdb_avltree_insert(<tree>, <%s>) left behind invalid tree",
138 test_data[i].name);
139 }
141 /* and again ... now reporting errors because of duplicates */
142 for (i = 0; i < SDB_STATIC_ARRAY_LEN(test_data); ++i) {
143 int check;
145 check = sdb_avltree_insert(tree, &test_data[i]);
146 fail_unless(check < 0,
147 "sdb_avltree_insert(<tree>, <%s>) = %d (redo); expected: <0",
148 test_data[i].name, check);
150 check = (int)sdb_avltree_size(tree);
151 fail_unless(check == SDB_STATIC_ARRAY_LEN(test_data),
152 "sdb_avltree_size(<tree>) = %d; expected: %zu",
153 check, SDB_STATIC_ARRAY_LEN(test_data));
154 }
155 }
156 END_TEST
158 START_TEST(test_lookup)
159 {
160 size_t i;
162 populate();
164 for (i = 0; i < SDB_STATIC_ARRAY_LEN(test_data); ++i) {
165 sdb_object_t *obj;
167 obj = sdb_avltree_lookup(tree, test_data[i].name);
168 fail_unless(obj != NULL,
169 "sdb_avltree_lookup(<tree>, %s) = NULL; "
170 "expected: <obj>", test_data[i].name);
171 fail_unless(obj == &test_data[i],
172 "sdb_avltree_lookup(<tree>, %s) = %p (%s); "
173 "expected: %p, (%s)", test_data[i].name, obj, obj->name,
174 &test_data[i], test_data[i].name);
175 }
177 for (i = 0; i < SDB_STATIC_ARRAY_LEN(unused_names); ++i) {
178 sdb_object_t *obj;
180 obj = sdb_avltree_lookup(tree, unused_names[i]);
181 fail_unless(obj == NULL,
182 "sdb_avltree_lookup(<tree>, %s) = %p (%s); "
183 "expected: NULL", unused_names[i],
184 obj, obj ? obj->name : "<nil>");
185 }
186 }
187 END_TEST
189 START_TEST(test_iter)
190 {
191 sdb_avltree_iter_t *iter;
192 sdb_object_t *obj;
194 size_t check, i;
196 populate();
197 check = sdb_avltree_size(tree);
198 fail_unless(check == SDB_STATIC_ARRAY_LEN(test_data),
199 "INTERNAL ERROR: AVL tree size (after populate) = %zu; "
200 "expected: %zu", check, SDB_STATIC_ARRAY_LEN(test_data));
202 iter = sdb_avltree_get_iter(tree);
203 fail_unless(iter != NULL,
204 "sdb_avltree_get_iter(<tree>) = NULL; expected: <iter>");
206 for (i = 0; i < SDB_STATIC_ARRAY_LEN(test_data); ++i) {
207 char expected_name[] = { (char)('a' + (int)i), '\0' };
209 _Bool c = sdb_avltree_iter_has_next(iter);
210 fail_unless(c, "sdb_avltree_iter_has_next(<iter[%zu]>) = false; "
211 "expected: true", i);
213 obj = sdb_avltree_iter_get_next(iter);
214 fail_unless(obj != NULL,
215 "sdb_avltree_iter_get_next(<iter[%zu]>) = NULL; "
216 "expected: <obj>", i);
217 fail_unless(!strcmp(obj->name, expected_name),
218 "sdb_avltree_iter[%zu] = %s; expected: %s",
219 i, obj->name, expected_name);
220 }
222 check = sdb_avltree_iter_has_next(iter) != 0;
223 fail_unless(check == 0, "sdb_avltree_iter_has_next(<iter>) = true; "
224 "expected: false");
225 obj = sdb_avltree_iter_get_next(iter);
226 fail_unless(obj == NULL,
227 "sdb_avltree_iter_get_next(<iter>) = <obj>; expected: NULL");
229 sdb_avltree_iter_destroy(iter);
231 sdb_avltree_clear(tree);
232 check = sdb_avltree_size(tree);
233 fail_unless(check == 0,
234 "sdb_avltree_clear(<tree>) left %zu nodes in the tree; "
235 "expected: 0", check);
236 }
237 END_TEST
239 Suite *
240 util_avltree_suite(void)
241 {
242 Suite *s = suite_create("utils::avltree");
243 TCase *tc;
245 tc = tcase_create("core");
246 tcase_add_checked_fixture(tc, setup, teardown);
247 tcase_add_test(tc, test_null);
248 tcase_add_test(tc, test_insert);
249 tcase_add_test(tc, test_lookup);
250 tcase_add_test(tc, test_iter);
251 suite_add_tcase(s, tc);
253 return s;
254 } /* util_avltree_suite */
256 /* vim: set tw=78 sw=4 ts=4 noexpandtab : */