Changeset View
Changeset View
Standalone View
Standalone View
tests/sys/sys/splay_test.c
- This file was added.
Property | Old Value | New Value |
---|---|---|
svn:eol-style | null | native \ No newline at end of property |
svn:keywords | null | FreeBSD=%H \ No newline at end of property |
svn:mime-type | null | text/plain \ No newline at end of property |
/* $OpenBSD: splay-test.c,v 1.4 2008/04/13 00:22:17 djm Exp $ */ | |||||
/* | |||||
* Copyright 2002 Niels Provos <provos@citi.umich.edu> | |||||
* All rights reserved. | |||||
* | |||||
* Redistribution and use in source and binary forms, with or without | |||||
* modification, are permitted provided that the following conditions | |||||
* are met: | |||||
* 1. Redistributions of source code must retain the above copyright | |||||
* notice, this list of conditions and the following disclaimer. | |||||
* 2. Redistributions in binary form must reproduce the above copyright | |||||
* notice, this list of conditions and the following disclaimer in the | |||||
* documentation and/or other materials provided with the distribution. | |||||
* 3. The name of the author may not be used to endorse or promote products | |||||
* derived from this software without specific prior written permission. | |||||
* | |||||
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR | |||||
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES | |||||
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. | |||||
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, | |||||
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | |||||
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |||||
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |||||
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |||||
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF | |||||
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |||||
* | |||||
* $FreeBSD$ | |||||
*/ | |||||
#include <sys/types.h> | |||||
#include <sys/tree.h> | |||||
#include <stdlib.h> | |||||
#include <atf-c.h> | |||||
struct node { | |||||
SPLAY_ENTRY(node) node; | |||||
int key; | |||||
}; | |||||
SPLAY_HEAD(tree, node) root; | |||||
static int | |||||
compare(struct node *a, struct node *b) | |||||
{ | |||||
if (a->key < b->key) return (-1); | |||||
else if (a->key > b->key) return (1); | |||||
return (0); | |||||
} | |||||
SPLAY_PROTOTYPE(tree, node, node, compare); | |||||
SPLAY_GENERATE(tree, node, node, compare); | |||||
#define ITER 150 | |||||
#define MIN 5 | |||||
#define MAX 5000 | |||||
ATF_TC_WITHOUT_HEAD(splay_test); | |||||
ATF_TC_BODY(splay_test, tc) | |||||
{ | |||||
struct node *tmp, *ins; | |||||
int i, max, min; | |||||
SPLAY_INIT(&root); | |||||
for (i = 0; i < ITER; i++) { | |||||
tmp = malloc(sizeof(struct node)); | |||||
ATF_CHECK_MSG(tmp != NULL, "malloc failed"); | |||||
do { | |||||
tmp->key = arc4random_uniform(MAX-MIN); | |||||
tmp->key += MIN; | |||||
} while (SPLAY_FIND(tree, &root, tmp) != NULL); | |||||
ngie: That's an interesting way to handle collisions... | |||||
if (i == 0) | |||||
max = min = tmp->key; | |||||
else { | |||||
if (tmp->key > max) | |||||
max = tmp->key; | |||||
if (tmp->key < min) | |||||
min = tmp->key; | |||||
} | |||||
ATF_CHECK_EQ(NULL, SPLAY_INSERT(tree, &root, tmp)); | |||||
} | |||||
ins = SPLAY_MIN(tree, &root); | |||||
ATF_CHECK_EQ(min, ins->key); | |||||
tmp = ins; | |||||
ins = SPLAY_MAX(tree, &root); | |||||
ATF_CHECK_EQ(max, ins->key); | |||||
ATF_CHECK_EQ(tmp, SPLAY_REMOVE(tree, &root, tmp)); | |||||
for (i = 0; i < ITER - 1; i++) { | |||||
ngieUnsubmitted Not Done Inline ActionsGeneral comment (I know this is upstream code): testing against ITER/ITER-1 (because the splay is removed on 92) is ok, but it is a bit fragile in the event that more code is added in the middle of the two loops. It would be better to increment the maximum value, decrement when removing, then test against the new smaller maximum in the second loop. ngie: General comment (I know this is upstream code): testing against ITER/ITER-1 (because the splay… | |||||
tmp = SPLAY_ROOT(&root); | |||||
ATF_CHECK_MSG(tmp != NULL, "SPLAY_ROOT error"); | |||||
ATF_CHECK_EQ(tmp, SPLAY_REMOVE(tree, &root, tmp)); | |||||
free(tmp); | |||||
} | |||||
} | |||||
ATF_TP_ADD_TCS(tp) | |||||
{ | |||||
ATF_TP_ADD_TC(tp, splay_test); | |||||
return (atf_no_error()); | |||||
} |
That's an interesting way to handle collisions...