2 * Copyright (c) 1990, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. ***REMOVED*** - see
17 * ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change
18 * 4. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 #if defined(LIBC_SCCS) && !defined(lint)
36 static char sccsid
[] = "@(#)hsearch.c 8.4 (Berkeley) 7/21/94";
37 #endif /* LIBC_SCCS and not lint */
42 #include <sys/types.h>
51 static DB
*dbp
= NULL
;
65 dbp
= (DB
*)__hash_open(NULL
, O_CREAT
| O_RDWR
, 0600, &info
, 0);
70 hsearch(ENTRY item
, ACTION action
)
77 key
.data
= (uint8
*)item
.key
;
78 key
.size
= strlen(item
.key
) + 1;
80 if (action
== ENTER
) {
81 val
.data
= (uint8
*)item
.data
;
82 val
.size
= strlen(item
.data
) + 1;
83 status
= (dbp
->put
)(dbp
, &key
, &val
, R_NOOVERWRITE
);
88 status
= (dbp
->get
)(dbp
, &key
, &val
, 0);
92 item
.data
= (char *)val
.data
;
94 retval
.key
= item
.key
;
95 retval
.data
= item
.data
;
103 (void)(dbp
->close
)(dbp
);