lib/libc/DB/hash/hsearch.c

   1 /*-
   2  * Copyright (c) 1990 The Regents of the University of California.
   3  * All rights reserved.
   4  *
   5  * This code is derived from software contributed to Berkeley by
   6  * Margo Seltzer.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions
  10  * are met:
  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. All advertising materials mentioning features or use of this software
  17  *    must display the following acknowledgement:
  18  *      This product includes software developed by the University of
  19  *      California, Berkeley and its contributors.
  20  * 4. Neither the name of the University nor the names of its contributors
  21  *    may be used to endorse or promote products derived from this software
  22  *    without specific prior written permission.
  23  *
  24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  34  * SUCH DAMAGE.
  35  */
  36
  37 #if defined(LIBC_SCCS) && !defined(lint)
  38 static char sccsid[] = "@(#)hsearch.c   5.8 (Berkeley) 2/11/93";
  39 #endif /* LIBC_SCCS and not lint */
  40
  41 #include <sys/types.h>
  42
  43 #include <fcntl.h>
  44 #include <string.h>
  45
  46 #define __DBINTERFACE_PRIVATE
  47 #include <db.h>
  48 #include "search.h"
  49
  50 static DB *dbp = NULL;
  51 static ENTRY retval;
  52
  53 extern int
  54 hcreate(nel)
  55         u_int nel;
  56 {
  57         HASHINFO info;
  58
  59         info.nelem = nel;
  60         info.bsize = 256;
  61         info.ffactor = 8;
  62         info.cachesize = NULL;
  63         info.hash = NULL;
  64         info.lorder = 0;
  65         dbp = (DB *)__hash_open(NULL, O_CREAT | O_RDWR, 0600, &info);
  66         return ((int)dbp);
  67 }
  68
  69 extern ENTRY *
  70 hsearch(item, action)
  71         ENTRY item;
  72         ACTION action;
  73 {
  74         DBT key, val;
  75         int status;
  76
  77         if (!dbp)
  78                 return (NULL);
  79         key.data = (u_char *)item.key;
  80         key.size = strlen(item.key) + 1;
  81
  82         if (action == ENTER) {
  83                 val.data = (u_char *)item.data;
  84                 val.size = strlen(item.data) + 1;
  85                 status = (dbp->put)(dbp, &key, &val, R_NOOVERWRITE);
  86                 if (status)
  87                         return (NULL);
  88         } else {
  89                 /* FIND */
  90                 status = (dbp->get)(dbp, &key, &val, 0);
  91                 if (status)
  92                         return (NULL);
  93                 else
  94                         item.data = (char *)val.data;
  95         }
  96         retval.key = item.key;
  97         retval.data = item.data;
  98         return (&retval);
  99 }
 100
 101 extern void
 102 hdestroy()
 103 {
 104         if (dbp) {
 105                 (void)(dbp->close)(dbp);
 106                 dbp = NULL;
 107         }
 108 }