1 /* $OpenBSD: splay-test.c,v 1.4 2008/04/13 00:22:17 djm Exp $ */
2 /*
3 * Copyright 2002 Niels Provos <provos@citi.umich.edu>
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 * 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.
16 *
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.
27 */
28 #include <sys/types.h>
29
30 #include <sys/tree.h>
31 #include <stdlib.h>
32
33 #include <atf-c.h>
34
35 struct node {
36 SPLAY_ENTRY(node) node;
37 int key;
38 };
39
40 static SPLAY_HEAD(tree, node) root;
41
42 static int
compare(struct node * a,struct node * b)43 compare(struct node *a, struct node *b)
44 {
45 if (a->key < b->key) return (-1);
46 else if (a->key > b->key) return (1);
47 return (0);
48 }
49
50 SPLAY_PROTOTYPE(tree, node, node, compare);
51
52 SPLAY_GENERATE(tree, node, node, compare);
53
54 #define ITER 150
55 #define MIN 5
56 #define MAX 5000
57
58 ATF_TC_WITHOUT_HEAD(splay_test);
ATF_TC_BODY(splay_test,tc)59 ATF_TC_BODY(splay_test, tc)
60 {
61 struct node *tmp, *ins;
62 int i, max, min;
63
64 SPLAY_INIT(&root);
65
66 max = min = 42; /* pacify gcc */
67
68 for (i = 0; i < ITER; i++) {
69 tmp = malloc(sizeof(struct node));
70 ATF_REQUIRE_MSG(tmp != NULL, "malloc failed");
71 do {
72 tmp->key = arc4random_uniform(MAX-MIN);
73 tmp->key += MIN;
74 } while (SPLAY_FIND(tree, &root, tmp) != NULL);
75 if (i == 0)
76 max = min = tmp->key;
77 else {
78 if (tmp->key > max)
79 max = tmp->key;
80 if (tmp->key < min)
81 min = tmp->key;
82 }
83 ATF_REQUIRE_EQ(NULL, SPLAY_INSERT(tree, &root, tmp));
84 }
85
86 ins = SPLAY_MIN(tree, &root);
87 ATF_REQUIRE_MSG(ins != NULL, "SPLAY_MIN error");
88 ATF_CHECK_EQ(min, ins->key);
89 tmp = ins;
90 ins = SPLAY_MAX(tree, &root);
91 ATF_REQUIRE_MSG(ins != NULL, "SPLAY_MAX error");
92 ATF_CHECK_EQ(max, ins->key);
93
94 ATF_CHECK_EQ(tmp, SPLAY_REMOVE(tree, &root, tmp));
95
96 for (i = 0; i < ITER - 1; i++) {
97 tmp = SPLAY_ROOT(&root);
98 ATF_REQUIRE_MSG(tmp != NULL, "SPLAY_ROOT error");
99 ATF_CHECK_EQ(tmp, SPLAY_REMOVE(tree, &root, tmp));
100 free(tmp);
101 }
102 }
103
ATF_TP_ADD_TCS(tp)104 ATF_TP_ADD_TCS(tp)
105 {
106
107 ATF_TP_ADD_TC(tp, splay_test);
108
109 return (atf_no_error());
110 }
111