1 /* $OpenBSD: rb-test.c,v 1.4 2008/04/13 00:22:17 djm Exp $ */
3 * Copyright 2002 Niels Provos <provos@citi.umich.edu>
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
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 * 3. The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 #include <sys/types.h>
32 #define _RB_DIAGNOSTIC 1
43 static RB_HEAD(tree, node) root;
46 compare(struct node *a, struct node *b)
48 if (a->key < b->key) return (-1);
49 else if (a->key > b->key) return (1);
53 RB_PROTOTYPE(tree, node, node, compare);
55 RB_GENERATE(tree, node, node, compare);
59 ATF_TC_WITHOUT_HEAD(rb_test);
60 ATF_TC_BODY(rb_test, tc)
62 struct node *tmp, *ins, store[ITER];
63 int i, j, k, max, min;
71 for (i = 0; i < ITER; i++)
74 /* Randomly shuffle keys */
75 for (i = 0; i < ITER; i++) {
76 j = i + arc4random_uniform(ITER - i);
78 store[j].key = store[i].key;
82 for (i = 0; i < ITER; i++) {
83 for (j = 0; j < i; ++j) {
85 ATF_REQUIRE_EQ(tmp, RB_FIND(tree, &root, tmp));
92 ATF_REQUIRE_EQ(NULL, RB_INSERT(tree, &root, tmp));
93 ins = RB_MIN(tree, &root);
94 ATF_REQUIRE_MSG(ins != NULL, "RB_MIN error");
95 ATF_CHECK_EQ(min, ins->key);
96 ins = RB_MAX(tree, &root);
97 ATF_REQUIRE_MSG(ins != NULL, "RB_MAX error");
98 ATF_CHECK_EQ(max, ins->key);
100 tmp = RB_ROOT(&root);
101 ATF_REQUIRE_MSG(tree_RB_RANK(tmp) >= 0, "RB rank balance error");
102 for (i = 0; i < ITER; i++) {
103 tmp = RB_ROOT(&root);
104 ATF_REQUIRE_MSG(tmp != NULL, "RB_ROOT error");
105 ATF_CHECK_EQ(tmp, RB_REMOVE(tree, &root, tmp));
112 ATF_TP_ADD_TC(tp, rb_test);
114 return (atf_no_error());