1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
/* $OpenBSD: hsearchtest.c,v 1.2 2009/10/27 23:59:32 deraadt Exp $ */
/* $NetBSD: hsearchtest.c,v 1.5 2003/07/26 19:38:46 salo Exp $ */
/*
* Copyright (c) 2001 Christopher G. Demetriou
* 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. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed for the
* NetBSD Project. See http://www.NetBSD.org/ for
* information about NetBSD.
* 4. 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.
*
* <<Id: LICENSE,v 1.2 2000/06/14 15:57:33 cgd Exp>>
*/
/*
* Test program for hsearch() et al.
*/
#include <search.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#define TEST(e) ((e) ? (void)0 : testfail(__FILE__, __LINE__, #e))
static void
testfail(const char *file, unsigned long line, const char *expression)
{
fprintf(stderr, "TEST FAILED: %s: file %s, line %ld\n",
expression, file, line);
exit(1);
}
int
main(int argc, char *argv[])
{
ENTRY e, *ep, *ep2;
int created_ok;
char ch[2];
int i;
created_ok = hcreate(16);
TEST(created_ok);
/* ch[1] should be constant from here on down. */
ch[1] = '\0';
/* Basic insertions. Check enough that there'll be collisions. */
for (i = 0; i < 26; i++) {
ch[0] = 'a' + i;
e.key = strdup(ch); /* ptr to provided key is kept! */
TEST(e.key != NULL);
e.data = (void *)(long)i;
ep = hsearch(e, ENTER);
TEST(ep != NULL);
TEST(strcmp(ep->key, ch) == 0);
TEST((long)ep->data == i);
}
/* e.key should be constant from here on down. */
e.key = ch;
/* Basic lookups. */
for (i = 0; i < 26; i++) {
ch[0] = 'a' + i;
ep = hsearch(e, FIND);
TEST(ep != NULL);
TEST(strcmp(ep->key, ch) == 0);
TEST((long)ep->data == i);
}
/* Check duplicate entry. Should _not_ overwrite existing data. */
ch[0] = 'a';
e.data = (void *)(long)12345;
ep = hsearch(e, FIND);
TEST(ep != NULL);
TEST(strcmp(ep->key, ch) == 0);
TEST((long)ep->data == 0);
/* Check for something that's not there. */
ch[0] = 'A';
ep = hsearch(e, FIND);
TEST(ep == NULL);
/* Check two at once. */
ch[0] = 'a';
ep = hsearch(e, FIND);
ch[0] = 'b';
ep2 = hsearch(e, FIND);
TEST(ep != NULL);
TEST(strcmp(ep->key, "a") == 0 && (long)ep->data == 0);
TEST(ep2 != NULL);
TEST(strcmp(ep2->key, "b") == 0 && (long)ep2->data == 1);
hdestroy();
exit(0);
}
|
