hsearch.c revision 1
1N/A/*-
1N/A * See the file LICENSE for redistribution information.
1N/A *
1N/A * Copyright (c) 1996, 1997, 1998
1N/A * Sleepycat Software. All rights reserved.
1N/A */
1N/A/*
1N/A * Copyright (c) 1990, 1993
1N/A * Margo Seltzer. All rights reserved.
1N/A */
1N/A/*
1N/A * Copyright (c) 1990, 1993
1N/A * The Regents of the University of California. All rights reserved.
1N/A *
1N/A * This code is derived from software contributed to Berkeley by
1N/A * Margo Seltzer.
1N/A *
1N/A * Redistribution and use in source and binary forms, with or without
1N/A * modification, are permitted provided that the following conditions
1N/A * are met:
1N/A * 1. Redistributions of source code must retain the above copyright
1N/A * notice, this list of conditions and the following disclaimer.
1N/A * 2. Redistributions in binary form must reproduce the above copyright
1N/A * notice, this list of conditions and the following disclaimer in the
1N/A * documentation and/or other materials provided with the distribution.
1N/A * 3. All advertising materials mentioning features or use of this software
1N/A * must display the following acknowledgement:
1N/A * This product includes software developed by the University of
1N/A * California, Berkeley and its contributors.
1N/A * 4. Neither the name of the University nor the names of its contributors
1N/A * may be used to endorse or promote products derived from this software
1N/A * without specific prior written permission.
1N/A *
1N/A * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
1N/A * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1N/A * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1N/A * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
1N/A * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1N/A * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1N/A * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1N/A * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1N/A * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1N/A * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1N/A * SUCH DAMAGE.
1N/A */
1N/A
1N/A#include "config.h"
1N/A
1N/A#ifndef lint
1N/Astatic const char sccsid[] = "@(#)hsearch.c 10.9 (Sleepycat) 4/18/98";
1N/A#endif /* not lint */
1N/A
1N/A#ifndef NO_SYSTEM_INCLUDES
1N/A#include <sys/types.h>
1N/A
1N/A#include <errno.h>
1N/A#include <string.h>
1N/A#endif
1N/A
1N/A#define DB_DBM_HSEARCH 1
1N/A#include "db_int.h"
1N/A
1N/Astatic DB *dbp;
1N/Astatic ENTRY retval;
1N/A
1N/Aint
1N/A__db_hcreate(nel)
1N/A size_t nel;
1N/A{
1N/A DB_INFO dbinfo;
1N/A
1N/A memset(&dbinfo, 0, sizeof(dbinfo));
1N/A dbinfo.db_pagesize = 512;
1N/A dbinfo.h_ffactor = 16;
1N/A dbinfo.h_nelem = (u_int32_t)nel; /* XXX: Possible overflow. */
1N/A
1N/A errno = db_open(NULL,
1N/A DB_HASH, DB_CREATE, __db_omode("rw----"), NULL, &dbinfo, &dbp);
1N/A return (errno == 0 ? 1 : 0);
1N/A}
1N/A
1N/AENTRY *
1N/A__db_hsearch(item, action)
1N/A ENTRY item;
1N/A ACTION action;
1N/A{
1N/A DBT key, val;
1N/A
1N/A if (dbp == NULL) {
1N/A errno = EINVAL;
1N/A return (NULL);
1N/A }
1N/A memset(&key, 0, sizeof(key));
1N/A memset(&val, 0, sizeof(val));
1N/A key.data = item.key;
1N/A key.size = strlen(item.key) + 1;
1N/A
1N/A switch (action) {
1N/A case ENTER:
1N/A val.data = item.data;
1N/A val.size = strlen(item.data) + 1;
1N/A
1N/A /*
1N/A * Try and add the key to the database. If we fail because
1N/A * the key already exists, return the existing key.
1N/A */
1N/A if ((errno =
1N/A dbp->put(dbp, NULL, &key, &val, DB_NOOVERWRITE)) == 0)
1N/A break;
1N/A if (errno != DB_KEYEXIST)
1N/A return (NULL);
1N/A if ((errno = dbp->get(dbp, NULL, &key, &val, 0)) == 0)
1N/A break;
1N/A
1N/A if (errno == DB_NOTFOUND) /* XXX: can't happen. */
1N/A errno = EINVAL;
1N/A break;
1N/A case FIND:
1N/A if ((errno = dbp->get(dbp, NULL, &key, &val, 0)) != 0) {
1N/A if (errno == DB_NOTFOUND)
1N/A errno = 0;
1N/A return (NULL);
1N/A }
1N/A item.data = (char *)val.data;
1N/A break;
1N/A default:
1N/A errno = EINVAL;
1N/A return (NULL);
1N/A }
1N/A retval.key = item.key;
1N/A retval.data = item.data;
1N/A return (&retval);
1N/A}
1N/A
1N/Avoid
1N/A__db_hdestroy()
1N/A{
1N/A if (dbp != NULL) {
1N/A (void)dbp->close(dbp, 0);
1N/A dbp = NULL;
1N/A }
1N/A}