1 /* $OpenBSD: rb-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 * $FreeBSD$ 29 */ 30 #include <sys/types.h> 31 32 #define _RB_DIAGNOSTIC 1 33 #include <sys/tree.h> 34 #include <stdlib.h> 35 36 #include <atf-c.h> 37 38 struct node { 39 RB_ENTRY(node) node; 40 int key; 41 }; 42 43 static RB_HEAD(tree, node) root; 44 45 static int 46 compare(struct node *a, struct node *b) 47 { 48 if (a->key < b->key) return (-1); 49 else if (a->key > b->key) return (1); 50 return (0); 51 } 52 53 RB_PROTOTYPE(tree, node, node, compare); 54 55 RB_GENERATE(tree, node, node, compare); 56 57 #define ITER 150 58 59 ATF_TC_WITHOUT_HEAD(rb_test); 60 ATF_TC_BODY(rb_test, tc) 61 { 62 struct node *tmp, *ins, store[ITER]; 63 int i, j, k, max, min; 64 65 min = ITER; 66 max = -1; 67 68 RB_INIT(&root); 69 70 /* Initialize keys */ 71 for (i = 0; i < ITER; i++) 72 store[i].key = i; 73 74 /* Randomly shuffle keys */ 75 for (i = 0; i < ITER; i++) { 76 j = i + arc4random_uniform(ITER - i); 77 k = store[j].key; 78 store[j].key = store[i].key; 79 store[i].key = k; 80 } 81 82 for (i = 0; i < ITER; i++) { 83 for (j = 0; j < i; ++j) { 84 tmp = &store[j]; 85 ATF_REQUIRE_EQ(tmp, RB_FIND(tree, &root, tmp)); 86 } 87 tmp = &store[i]; 88 if (tmp->key > max) 89 max = tmp->key; 90 if (tmp->key < min) 91 min = tmp->key; 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); 99 } 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)); 106 } 107 } 108 109 ATF_TP_ADD_TCS(tp) 110 { 111 112 ATF_TP_ADD_TC(tp, rb_test); 113 114 return (atf_no_error()); 115 } 116