Home | History | Annotate | Line # | Download | only in citrus
citrus_hash.h revision 1.1 
      1 /*	$NetBSD: citrus_hash.h,v 1.1 2003/06/25 09:51:33 tshiozak Exp $	*/
      2 
      3 /*-
      4  * Copyright (c)2003 Citrus Project,
      5  * All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  *
     16  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
     17  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     18  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     19  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
     20  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     21  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     22  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     23  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     24  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     25  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     26  * SUCH DAMAGE.
     27  */
     28 
     29 #ifndef _CITRUS_HASH_H_
     30 #define _CITRUS_HASH_H_
     31 
     32 #define _CITRUS_HASH_ENTRY(type) 				\
     33 struct {							\
     34 	struct type *che_next, **che_pprev;			\
     35 }
     36 #define _CITRUS_HASH_HEAD(headname, type, hashsize)		\
     37 struct headname {						\
     38 	struct type *chh_table[hashsize];			\
     39 }
     40 #define _CITRUS_HASH_INIT(head, hashsize)			\
     41 do {								\
     42 	int _ch_loop;						\
     43 	for (_ch_loop=0; _ch_loop<hashsize; _ch_loop++)		\
     44 		(head)->chh_table[_ch_loop] = NULL;		\
     45 } while (/*CONSTCOND*/0)
     46 #define _CITRUS_HASH_REMOVE(elm, field)				\
     47 do {								\
     48 	if ((elm)->field.che_next)				\
     49 		(elm)->field.che_next->field.che_pprev =	\
     50 			(elm)->field.che_pprev;			\
     51 	*(elm)->field.che_pprev = (elm)->field.che_next;	\
     52 } while (/*CONSTCOND*/0)
     53 #define _CITRUS_HASH_INSERT(head, elm, field, hashval)		\
     54 do {								\
     55 	(elm)->field.che_pprev = &(head)->chh_table[hashval];	\
     56 	(elm)->field.che_next  =  (head)->chh_table[hashval];	\
     57 	(head)->chh_table[hashval] = (elm);			\
     58 } while (/*CONSTCOND*/0)
     59 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval)	\
     60 do {									\
     61 	for ((elm)=(head)->chh_table[hashval];				\
     62 	     (elm);							\
     63 	     (elm)=(elm)->field.che_next)				\
     64 		if (matchfunc((elm), key)==0)				\
     65 			break;						\
     66 } while (/*CONSTCOND*/0)
     67 
     68 __BEGIN_DECLS
     69 int	_citrus_string_hash_func(const char *, int);
     70 __END_DECLS
     71 
     72 #endif
     73