2N/A/*-
2N/A * Copyright (c) 1990, 1993
2N/A * The Regents of the University of California. All rights reserved.
2N/A *
2N/A * This code is derived from software contributed to Berkeley by
2N/A * Margo Seltzer.
2N/A *
2N/A * Redistribution and use in source and binary forms, with or without
2N/A * modification, are permitted provided that the following conditions
2N/A * are met:
2N/A * 1. Redistributions of source code must retain the above copyright
2N/A * notice, this list of conditions and the following disclaimer.
2N/A * 2. Redistributions in binary form must reproduce the above copyright
2N/A * notice, this list of conditions and the following disclaimer in the
2N/A * documentation and/or other materials provided with the distribution.
2N/A * 3. All advertising materials mentioning features or use of this software
2N/A * must display the following acknowledgement:
2N/A * This product includes software developed by the University of
2N/A * California, Berkeley and its contributors.
2N/A * 4. Neither the name of the University nor the names of its contributors
2N/A * may be used to endorse or promote products derived from this software
2N/A * without specific prior written permission.
2N/A *
2N/A * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
2N/A * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
2N/A * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
2N/A * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
2N/A * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2N/A * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
2N/A * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
2N/A * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2N/A * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2N/A * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
2N/A * SUCH DAMAGE.
2N/A */
2N/A
2N/A#if defined(LIBC_SCCS) && !defined(lint)
2N/Astatic char sccsid[] = "@(#)hsearch.c 8.5 (Berkeley) 9/21/94";
2N/A#endif /* LIBC_SCCS and not lint */
2N/A
2N/A#include <sys/types.h>
2N/A
2N/A#include <fcntl.h>
2N/A#include <string.h>
2N/A
2N/A#include "db-int.h"
2N/A#include "search.h"
2N/A
2N/Astatic DB *dbp = NULL;
2N/Astatic ENTRY retval;
2N/A
2N/Aextern int
2N/Ahcreate(nel)
2N/A u_int nel;
2N/A{
2N/A HASHINFO info;
2N/A
2N/A info.nelem = nel;
2N/A info.bsize = 256;
2N/A info.ffactor = 8;
2N/A info.cachesize = 0;
2N/A info.hash = NULL;
2N/A info.lorder = 0;
2N/A dbp = (DB *)__hash_open(NULL, O_CREAT | O_RDWR | O_BINARY, 0600, &info, 0);
2N/A return (dbp != NULL);
2N/A}
2N/A
2N/Aextern ENTRY *
2N/Ahsearch(item, action)
2N/A ENTRY item;
2N/A ACTION action;
2N/A{
2N/A DBT key, val;
2N/A int status;
2N/A
2N/A if (!dbp)
2N/A return (NULL);
2N/A key.data = (u_char *)item.key;
2N/A key.size = strlen(item.key) + 1;
2N/A
2N/A if (action == ENTER) {
2N/A val.data = (u_char *)item.data;
2N/A val.size = strlen(item.data) + 1;
2N/A status = (dbp->put)(dbp, &key, &val, R_NOOVERWRITE);
2N/A if (status)
2N/A return (NULL);
2N/A } else {
2N/A /* FIND */
2N/A status = (dbp->get)(dbp, &key, &val, 0);
2N/A if (status)
2N/A return (NULL);
2N/A else
2N/A item.data = (char *)val.data;
2N/A }
2N/A retval.key = item.key;
2N/A retval.data = item.data;
2N/A return (&retval);
2N/A}
2N/A
2N/Aextern void
2N/Ahdestroy()
2N/A{
2N/A if (dbp) {
2N/A (void)(dbp->close)(dbp);
2N/A dbp = NULL;
2N/A }
2N/A}