]> git.saurik.com Git - apple/libc.git/blame - db/hash/hsearch.c
Libc-262.2.12.tar.gz
[apple/libc.git] / db / hash / hsearch.c
CommitLineData
e9ce8d39
A
1/*
2 * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
734aad71 6 * Copyright (c) 1999-2003 Apple Computer, Inc. All Rights Reserved.
e9ce8d39 7 *
734aad71
A
8 * This file contains Original Code and/or Modifications of Original Code
9 * as defined in and that are subject to the Apple Public Source License
10 * Version 2.0 (the 'License'). You may not use this file except in
11 * compliance with the License. Please obtain a copy of the License at
12 * http://www.opensource.apple.com/apsl/ and read it before using this
13 * file.
14 *
15 * The Original Code and all software distributed under the License are
16 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
e9ce8d39
A
17 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
18 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
734aad71
A
19 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
20 * Please see the License for the specific language governing rights and
21 * limitations under the License.
e9ce8d39
A
22 *
23 * @APPLE_LICENSE_HEADER_END@
24 */
25/*
26 * Copyright (c) 1990, 1993
27 * The Regents of the University of California. All rights reserved.
28 *
29 * This code is derived from software contributed to Berkeley by
30 * Margo Seltzer.
31 *
32 * Redistribution and use in source and binary forms, with or without
33 * modification, are permitted provided that the following conditions
34 * are met:
35 * 1. Redistributions of source code must retain the above copyright
36 * notice, this list of conditions and the following disclaimer.
37 * 2. Redistributions in binary form must reproduce the above copyright
38 * notice, this list of conditions and the following disclaimer in the
39 * documentation and/or other materials provided with the distribution.
40 * 3. All advertising materials mentioning features or use of this software
41 * must display the following acknowledgement:
42 * This product includes software developed by the University of
43 * California, Berkeley and its contributors.
44 * 4. Neither the name of the University nor the names of its contributors
45 * may be used to endorse or promote products derived from this software
46 * without specific prior written permission.
47 *
48 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
49 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
50 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
51 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
52 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
53 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
54 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
55 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
56 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
57 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
58 * SUCH DAMAGE.
59 */
60
61
62#include <sys/types.h>
63
64#include <fcntl.h>
65#include <string.h>
66
67#include <db.h>
68#include "search.h"
69
70static DB *dbp = NULL;
71static ENTRY retval;
72
73extern int
74hcreate(nel)
75 u_int nel;
76{
77 HASHINFO info;
78
79 info.nelem = nel;
80 info.bsize = 256;
81 info.ffactor = 8;
82 info.cachesize = NULL;
83 info.hash = NULL;
84 info.lorder = 0;
85 dbp = (DB *)__hash_open(NULL, O_CREAT | O_RDWR, 0600, &info, 0);
86 return ((int)dbp);
87}
88
89extern ENTRY *
90hsearch(item, action)
91 ENTRY item;
92 ACTION action;
93{
94 DBT key, val;
95 int status;
96
97 if (!dbp)
98 return (NULL);
99 key.data = (u_char *)item.key;
100 key.size = strlen(item.key) + 1;
101
102 if (action == ENTER) {
103 val.data = (u_char *)item.data;
104 val.size = strlen(item.data) + 1;
105 status = (dbp->put)(dbp, &key, &val, R_NOOVERWRITE);
106 if (status)
107 return (NULL);
108 } else {
109 /* FIND */
110 status = (dbp->get)(dbp, &key, &val, 0);
111 if (status)
112 return (NULL);
113 else
114 item.data = (char *)val.data;
115 }
116 retval.key = item.key;
117 retval.data = item.data;
118 return (&retval);
119}
120
121extern void
122hdestroy()
123{
124 if (dbp) {
125 (void)(dbp->close)(dbp);
126 dbp = NULL;
127 }
128}