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(NULL);
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' - 'k' */
51 static sdb_object_t test_data[] = {
52 SSTRING_OBJ("d"),
53 SSTRING_OBJ("f"),
54 SSTRING_OBJ("e"),
55 SSTRING_OBJ("b"),
56 SSTRING_OBJ("a"),
57 SSTRING_OBJ("c"),
58 SSTRING_OBJ("g"),
59 SSTRING_OBJ("h"),
60 SSTRING_OBJ("i"),
61 SSTRING_OBJ("j"),
62 SSTRING_OBJ("k"),
63 };
65 static void
66 populate(void)
67 {
68 size_t i;
69 for (i = 0; i < SDB_STATIC_ARRAY_LEN(test_data); ++i)
70 sdb_avltree_insert(tree, &test_data[i]);
71 } /* populate */
73 START_TEST(test_null)
74 {
75 sdb_object_t o1 = SSTRING_OBJ("obj");
76 sdb_object_t *o2;
77 sdb_avltree_iter_t *iter;
78 int check;
80 /* all functions should work even when passed null values */
81 sdb_avltree_destroy(NULL);
82 sdb_avltree_clear(NULL);
84 check = sdb_avltree_insert(NULL, NULL);
85 fail_unless(check < 0,
86 "sdb_avltree_insert(NULL, NULL) = %d; expected: <0", check);
87 check = sdb_avltree_insert(NULL, &o1);
88 fail_unless(check < 0,
89 "sdb_avltree_insert(NULL, <obj>) = %d; expected: <0", check);
90 fail_unless(o1.ref_cnt == 1,
91 "sdb_avltree_insert(NULL, <obj>) incremented ref-cnt");
92 /* it's acceptable to insert NULL */
94 iter = sdb_avltree_get_iter(NULL);
95 fail_unless(iter == NULL,
96 "sdb_avltree_get_iter(NULL) = %p; expected: NULL", iter);
98 check = sdb_avltree_iter_has_next(NULL) != 0;
99 fail_unless(check == 0,
100 "sdb_avltree_iter_has_next(NULL) = %d; expected: 0", check);
101 o2 = sdb_avltree_iter_get_next(NULL);
102 fail_unless(o2 == NULL,
103 "sdb_avltree_iter_get_next(NULL) = %p; expected: NULL", o2);
105 sdb_avltree_iter_destroy(NULL);
107 check = (int)sdb_avltree_size(NULL);
108 fail_unless(check == 0,
109 "sdb_avltree_size(NULL) = %d; expected: 0", check);
110 }
111 END_TEST
113 START_TEST(test_insert)
114 {
115 size_t i;
117 for (i = 0; i < SDB_STATIC_ARRAY_LEN(test_data); ++i) {
118 int check;
120 check = sdb_avltree_insert(tree, &test_data[i]);
121 fail_unless(check == 0,
122 "sdb_avltree_insert(<tree>, <%s>) = %d; expected: 0",
123 test_data[i].name, check);
125 check = (int)sdb_avltree_size(tree);
126 fail_unless(check == (int)i + 1,
127 "sdb_avltree_size(<tree>) = %d; expected: %zu",
128 check, i + 1);
129 }
130 }
131 END_TEST
133 START_TEST(test_iter)
134 {
135 sdb_avltree_iter_t *iter;
136 sdb_object_t *obj;
138 size_t check, i;
140 populate();
141 check = sdb_avltree_size(tree);
142 fail_unless(check == SDB_STATIC_ARRAY_LEN(test_data),
143 "INTERNAL ERROR: AVL tree size (after populate) = %zu; "
144 "expected: %zu", check, SDB_STATIC_ARRAY_LEN(test_data));
146 iter = sdb_avltree_get_iter(tree);
147 fail_unless(iter != NULL,
148 "sdb_avltree_get_iter(<tree>) = NULL; expected: <iter>");
150 for (i = 0; i < SDB_STATIC_ARRAY_LEN(test_data); ++i) {
151 char expected_name[] = { (char)('a' + (int)i), '\0' };
153 _Bool c = sdb_avltree_iter_has_next(iter);
154 fail_unless(c, "sdb_avltree_iter_has_next(<iter[%zu]>) = false; "
155 "expected: true", i);
157 obj = sdb_avltree_iter_get_next(iter);
158 fail_unless(obj != NULL,
159 "sdb_avltree_iter_get_next(<iter[%zu]>) = NULL; "
160 "expected: <obj>", i);
161 fail_unless(!strcmp(obj->name, expected_name),
162 "sdb_avltree_iter[%zu] = %s; expected: %s",
163 i, obj->name, expected_name);
164 }
166 check = sdb_avltree_iter_has_next(iter) != 0;
167 fail_unless(check == 0, "sdb_avltree_iter_has_next(<iter>) = true; "
168 "expected: false");
169 obj = sdb_avltree_iter_get_next(iter);
170 fail_unless(obj == NULL,
171 "sdb_avltree_iter_get_next(<iter>) = <obj>; expected: NULL");
173 sdb_avltree_iter_destroy(iter);
174 }
175 END_TEST
177 Suite *
178 util_avltree_suite(void)
179 {
180 Suite *s = suite_create("utils::avltree");
181 TCase *tc;
183 tc = tcase_create("core");
184 tcase_add_checked_fixture(tc, setup, teardown);
185 tcase_add_test(tc, test_null);
186 tcase_add_test(tc, test_insert);
187 tcase_add_test(tc, test_iter);
188 suite_add_tcase(s, tc);
190 return s;
191 } /* util_avltree_suite */
193 /* vim: set tw=78 sw=4 ts=4 noexpandtab : */