1 /* $NetBSD: t_hsearch.c,v 1.4 2014/07/20 20:17:21 christos Exp $ */
4 * Copyright (c) 2008 The NetBSD Foundation, Inc.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
16 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
17 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
18 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
19 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
20 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 * POSSIBILITY OF SUCH DAMAGE.
30 * Copyright (c) 2001 Christopher G. Demetriou
31 * All rights reserved.
33 * Redistribution and use in source and binary forms, with or without
34 * modification, are permitted provided that the following conditions
36 * 1. Redistributions of source code must retain the above copyright
37 * notice, this list of conditions and the following disclaimer.
38 * 2. Redistributions in binary form must reproduce the above copyright
39 * notice, this list of conditions and the following disclaimer in the
40 * documentation and/or other materials provided with the distribution.
41 * 3. All advertising materials mentioning features or use of this software
42 * must display the following acknowledgement:
43 * This product includes software developed for the
44 * NetBSD Project. See http://www.NetBSD.org/ for
45 * information about NetBSD.
46 * 4. The name of the author may not be used to endorse or promote products
47 * derived from this software without specific prior written permission.
49 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
50 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
51 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
52 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
53 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
54 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
55 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
56 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
57 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
58 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
60 * <<Id: LICENSE,v 1.2 2000/06/14 15:57:33 cgd Exp>>
63 #include <sys/cdefs.h>
64 __COPYRIGHT("@(#) Copyright (c) 2008\
65 The NetBSD Foundation, inc. All rights reserved.");
66 __RCSID("$NetBSD: t_hsearch.c,v 1.4 2014/07/20 20:17:21 christos Exp $");
76 #define REQUIRE_ERRNO(x) ATF_REQUIRE_MSG(x, "%s", strerror(errno))
79 ATF_TC(hsearch_basic);
80 ATF_TC_HEAD(hsearch_basic, tc)
83 atf_tc_set_md_var(tc, "descr", "Checks basic insertions and searching");
86 ATF_TC_BODY(hsearch_basic, tc)
92 REQUIRE_ERRNO(hcreate(16) != 0);
94 /* ch[1] should be constant from here on down. */
97 /* Basic insertions. Check enough that there'll be collisions. */
98 for (i = 0; i < 26; i++) {
100 e.key = strdup(ch); /* ptr to provided key is kept! */
101 ATF_REQUIRE(e.key != NULL);
102 e.data = (void *)(intptr_t)i;
104 ep = hsearch(e, ENTER);
106 ATF_REQUIRE(ep != NULL);
107 ATF_REQUIRE_STREQ(ep->key, ch);
108 ATF_REQUIRE_EQ((intptr_t)ep->data, i);
111 /* e.key should be constant from here on down. */
115 for (i = 0; i < 26; i++) {
118 ep = hsearch(e, FIND);
120 ATF_REQUIRE(ep != NULL);
121 ATF_REQUIRE_STREQ(ep->key, ch);
122 ATF_REQUIRE_EQ((intptr_t)ep->data, i);
125 hdestroy1(free, NULL);
129 ATF_TC(hsearch_duplicate);
130 ATF_TC_HEAD(hsearch_duplicate, tc)
133 atf_tc_set_md_var(tc, "descr", "Checks that inserting duplicate "
134 "doesn't overwrite existing data");
137 ATF_TC_BODY(hsearch_duplicate, tc)
141 REQUIRE_ERRNO(hcreate(16));
143 e.key = __UNCONST("a");
144 e.data = (void *)(intptr_t) 0;
146 ep = hsearch(e, ENTER);
148 ATF_REQUIRE(ep != NULL);
149 ATF_REQUIRE_STREQ(ep->key, "a");
150 ATF_REQUIRE_EQ((intptr_t)ep->data, 0);
152 e.data = (void *)(intptr_t)12345;
154 ep = hsearch(e, ENTER);
155 ep = hsearch(e, FIND);
157 ATF_REQUIRE(ep != NULL);
158 ATF_REQUIRE_STREQ(ep->key, "a");
159 ATF_REQUIRE_EQ((intptr_t)ep->data, 0);
164 ATF_TC(hsearch_nonexistent);
165 ATF_TC_HEAD(hsearch_nonexistent, tc)
168 atf_tc_set_md_var(tc, "descr",
169 "Checks searching for non-existent entry");
172 ATF_TC_BODY(hsearch_nonexistent, tc)
176 REQUIRE_ERRNO(hcreate(16));
178 e.key = __UNCONST("A");
179 ep = hsearch(e, FIND);
180 ATF_REQUIRE_EQ(ep, NULL);
186 ATF_TC_HEAD(hsearch_two, tc)
189 atf_tc_set_md_var(tc, "descr",
190 "Checks that searching doesn't overwrite previous search results");
193 ATF_TC_BODY(hsearch_two, tc)
197 REQUIRE_ERRNO(hcreate(16));
199 e.key = __UNCONST("a");
200 e.data = (void*)(intptr_t)0;
202 ep = hsearch(e, ENTER);
204 ATF_REQUIRE(ep != NULL);
205 ATF_REQUIRE_STREQ(ep->key, "a");
206 ATF_REQUIRE_EQ((intptr_t)ep->data, 0);
208 e.key = __UNCONST("b");
209 e.data = (void*)(intptr_t)1;
211 ep = hsearch(e, ENTER);
213 ATF_REQUIRE(ep != NULL);
214 ATF_REQUIRE_STREQ(ep->key, "b");
215 ATF_REQUIRE_EQ((intptr_t)ep->data, 1);
217 e.key = __UNCONST("a");
218 ep = hsearch(e, FIND);
220 e.key = __UNCONST("b");
221 ep2 = hsearch(e, FIND);
223 ATF_REQUIRE(ep != NULL);
224 ATF_REQUIRE_STREQ(ep->key, "a");
225 ATF_REQUIRE_EQ((intptr_t)ep->data, 0);
227 ATF_REQUIRE(ep2 != NULL);
228 ATF_REQUIRE_STREQ(ep2->key, "b");
229 ATF_REQUIRE_EQ((intptr_t)ep2->data, 1);
234 #if defined(__FreeBSD__) && 1100027 <= __FreeBSD_version
236 ATF_TC(hsearch_r_basic);
237 ATF_TC_HEAD(hsearch_r_basic, tc)
240 atf_tc_set_md_var(tc, "descr", "Checks basic insertions and searching");
243 ATF_TC_BODY(hsearch_r_basic, tc)
248 struct hsearch_data t;
250 REQUIRE_ERRNO(hcreate_r(16, &t) != 0);
252 /* ch[1] should be constant from here on down. */
255 /* Basic insertions. Check enough that there'll be collisions. */
256 for (i = 0; i < 26; i++) {
258 e.key = strdup(ch); /* ptr to provided key is kept! */
259 ATF_REQUIRE(e.key != NULL);
260 e.data = (void *)(intptr_t)i;
262 ATF_REQUIRE(hsearch_r(e, ENTER, &ep, &t) == 1);
263 ATF_REQUIRE(ep != NULL);
264 ATF_REQUIRE_STREQ(ep->key, ch);
265 ATF_REQUIRE_EQ((intptr_t)ep->data, i);
268 /* e.key should be constant from here on down. */
272 for (i = 0; i < 26; i++) {
275 ATF_REQUIRE(hsearch_r(e, FIND, &ep, &t) == 1);
276 ATF_REQUIRE(ep != NULL);
277 ATF_REQUIRE_STREQ(ep->key, ch);
278 ATF_REQUIRE_EQ((intptr_t)ep->data, i);
281 hdestroy1_r(&t, free, NULL);
285 ATF_TC(hsearch_r_duplicate);
286 ATF_TC_HEAD(hsearch_r_duplicate, tc)
289 atf_tc_set_md_var(tc, "descr", "Checks that inserting duplicate "
290 "doesn't overwrite existing data");
293 ATF_TC_BODY(hsearch_r_duplicate, tc)
296 struct hsearch_data t;
298 REQUIRE_ERRNO(hcreate_r(16, &t));
300 e.key = __UNCONST("a");
301 e.data = (void *)(intptr_t) 0;
303 ATF_REQUIRE(hsearch_r(e, ENTER, &ep, &t) == 1);
304 ATF_REQUIRE(ep != NULL);
305 ATF_REQUIRE_STREQ(ep->key, "a");
306 ATF_REQUIRE_EQ((intptr_t)ep->data, 0);
308 e.data = (void *)(intptr_t)12345;
310 ATF_REQUIRE(hsearch_r(e, ENTER, &ep, &t) == 1);
311 ATF_REQUIRE(hsearch_r(e, FIND, &ep, &t) == 1);
313 ATF_REQUIRE(ep != NULL);
314 ATF_REQUIRE_STREQ(ep->key, "a");
315 ATF_REQUIRE_EQ((intptr_t)ep->data, 0);
320 ATF_TC(hsearch_r_nonexistent);
321 ATF_TC_HEAD(hsearch_r_nonexistent, tc)
324 atf_tc_set_md_var(tc, "descr",
325 "Checks searching for non-existent entry");
328 ATF_TC_BODY(hsearch_r_nonexistent, tc)
331 struct hsearch_data t;
333 REQUIRE_ERRNO(hcreate_r(16, &t));
335 e.key = __UNCONST("A");
336 ATF_REQUIRE(hsearch_r(e, FIND, &ep, &t) == 1);
337 ATF_REQUIRE_EQ(ep, NULL);
342 ATF_TC(hsearch_r_two);
343 ATF_TC_HEAD(hsearch_r_two, tc)
346 atf_tc_set_md_var(tc, "descr",
347 "Checks that searching doesn't overwrite previous search results");
350 ATF_TC_BODY(hsearch_r_two, tc)
353 struct hsearch_data t;
355 REQUIRE_ERRNO(hcreate_r(16, &t));
357 e.key = __UNCONST("a");
358 e.data = (void*)(intptr_t)0;
360 ATF_REQUIRE(hsearch_r(e, ENTER, &ep, &t) == 1);
361 ATF_REQUIRE(ep != NULL);
362 ATF_REQUIRE_STREQ(ep->key, "a");
363 ATF_REQUIRE_EQ((intptr_t)ep->data, 0);
365 e.key = __UNCONST("b");
366 e.data = (void*)(intptr_t)1;
368 ATF_REQUIRE(hsearch_r(e, ENTER, &ep, &t) == 1);
369 ATF_REQUIRE(ep != NULL);
370 ATF_REQUIRE_STREQ(ep->key, "b");
371 ATF_REQUIRE_EQ((intptr_t)ep->data, 1);
373 e.key = __UNCONST("a");
374 ATF_REQUIRE(hsearch_r(e, FIND, &ep, &t) == 1);
376 e.key = __UNCONST("b");
377 ATF_REQUIRE(hsearch_r(e, FIND, &ep2, &t) == 1);
379 ATF_REQUIRE(ep != NULL);
380 ATF_REQUIRE_STREQ(ep->key, "a");
381 ATF_REQUIRE_EQ((intptr_t)ep->data, 0);
383 ATF_REQUIRE(ep2 != NULL);
384 ATF_REQUIRE_STREQ(ep2->key, "b");
385 ATF_REQUIRE_EQ((intptr_t)ep2->data, 1);
395 ATF_TP_ADD_TC(tp, hsearch_basic);
397 ATF_TP_ADD_TC(tp, hsearch_duplicate);
398 ATF_TP_ADD_TC(tp, hsearch_nonexistent);
399 ATF_TP_ADD_TC(tp, hsearch_two);
401 #if defined(__FreeBSD__) && 1100027 <= __FreeBSD_version
403 ATF_TP_ADD_TC(tp, hsearch_r_basic);
405 ATF_TP_ADD_TC(tp, hsearch_r_duplicate);
406 ATF_TP_ADD_TC(tp, hsearch_r_nonexistent);
407 ATF_TP_ADD_TC(tp, hsearch_r_two);
410 return atf_no_error();