crypto/external/bsd/heimdal/dist/lib/asn1/hash.h

   1 /*      $NetBSD: hash.h,v 1.1.1.2 2011/04/14 14:08:21 elric Exp $       */
   2
   3 /*
   4  * Copyright (c) 1997 Kungliga Tekniska Högskolan
   5  * (Royal Institute of Technology, Stockholm, Sweden).
   6  * All rights reserved.
   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  *
  12  * 1. Redistributions of source code must retain the above copyright
  13  *    notice, this list of conditions and the following disclaimer.
  14  *
  15  * 2. Redistributions in binary form must reproduce the above copyright
  16  *    notice, this list of conditions and the following disclaimer in the
  17  *    documentation and/or other materials provided with the distribution.
  18  *
  19  * 3. Neither the name of the Institute nor the names of its contributors
  20  *    may be used to endorse or promote products derived from this software
  21  *    without specific prior written permission.
  22  *
  23  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
  24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
  27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  33  * SUCH DAMAGE.
  34  */
  35
  36 /*
  37  * hash.h. Header file for hash table functions
  38  */
  39
  40 /* Id */
  41
  42 struct hashentry {              /* Entry in bucket */
  43      struct hashentry **prev;
  44      struct hashentry *next;
  45      void *ptr;
  46 };
  47
  48 typedef struct hashentry Hashentry;
  49
  50 struct hashtab {                /* Hash table */
  51      int (*cmp)(void *, void *); /* Compare function */
  52      unsigned (*hash)(void *);  /* hash function */
  53      int sz;                    /* Size */
  54      Hashentry *tab[1];         /* The table */
  55 };
  56
  57 typedef struct hashtab Hashtab;
  58
  59 /* prototypes */
  60
  61 Hashtab *hashtabnew(int sz,
  62                     int (*cmp)(void *, void *),
  63                     unsigned (*hash)(void *));  /* Make new hash table */
  64
  65 void *hashtabsearch(Hashtab *htab, /* The hash table */
  66                     void *ptr); /*  The key */
  67
  68
  69 void *hashtabadd(Hashtab *htab, /* The hash table */
  70                void *ptr);      /* The element */
  71
  72 int _hashtabdel(Hashtab *htab,  /* The table */
  73                 void *ptr,      /* Key */
  74                 int freep);     /* Free data part? */
  75
  76 void hashtabforeach(Hashtab *htab,
  77                     int (*func)(void *ptr, void *arg),
  78                     void *arg);
  79
  80 unsigned hashadd(const char *s);                /* Standard hash function */
  81 unsigned hashcaseadd(const char *s);            /* Standard hash function */
  82 unsigned hashjpw(const char *s);                /* another hash function */
  83
  84 /* macros */
  85
  86  /* Don't free space */
  87 #define hashtabdel(htab,key)  _hashtabdel(htab,key,FALSE)
  88
  89 #define hashtabfree(htab,key) _hashtabdel(htab,key,TRUE) /* Do! */