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