lib/libc/citrus/citrus_hash.h

   1 /* $FreeBSD: head/lib/libc/iconv/citrus_hash.h 219019 2011-02-25 00:04:39Z gabor $ */
   2 /* $NetBSD: citrus_hash.h,v 1.3 2004/01/02 21:49:35 itojun Exp $ */
   3
   4 /*-
   5  * Copyright (c)2003 Citrus Project,
   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  * 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  *
  17  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
  18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  27  * SUCH DAMAGE.
  28  */
  29
  30 #ifndef _CITRUS_HASH_H_
  31 #define _CITRUS_HASH_H_
  32
  33 #define _CITRUS_HASH_ENTRY(type) LIST_ENTRY(type)
  34 #define _CITRUS_HASH_HEAD(headname, type, hashsize)     \
  35 struct headname {                                       \
  36         LIST_HEAD(, type)       chh_table[hashsize];    \
  37 }
  38 #define _CITRUS_HASH_INIT(head, hashsize)                       \
  39 do {                                                            \
  40         int _ch_loop;                                           \
  41                                                                 \
  42         for (_ch_loop = 0; _ch_loop < hashsize; _ch_loop++)     \
  43                 LIST_INIT(&(head)->chh_table[_ch_loop]);        \
  44 } while (0)
  45 #define _CITRUS_HASH_REMOVE(elm, field) LIST_REMOVE(elm, field)
  46 #define _CITRUS_HASH_INSERT(head, elm, field, hashval)          \
  47     LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field)
  48 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval)  \
  49 do {                                                                    \
  50         LIST_FOREACH((elm), &(head)->chh_table[hashval], field)         \
  51                 if (matchfunc((elm), key) == 0)                         \
  52                         break;                                          \
  53 } while (0)
  54
  55 __BEGIN_DECLS
  56 int      _citrus_string_hash_func(const char *, int);
  57 __END_DECLS
  58
  59 #endif