1219019Sgabor/* $FreeBSD$ */ 2219019Sgabor/* $NetBSD: citrus_hash.h,v 1.3 2004/01/02 21:49:35 itojun Exp $ */ 3219019Sgabor 4219019Sgabor/*- 5219019Sgabor * Copyright (c)2003 Citrus Project, 6219019Sgabor * All rights reserved. 7219019Sgabor * 8219019Sgabor * Redistribution and use in source and binary forms, with or without 9219019Sgabor * modification, are permitted provided that the following conditions 10219019Sgabor * are met: 11219019Sgabor * 1. Redistributions of source code must retain the above copyright 12219019Sgabor * notice, this list of conditions and the following disclaimer. 13219019Sgabor * 2. Redistributions in binary form must reproduce the above copyright 14219019Sgabor * notice, this list of conditions and the following disclaimer in the 15219019Sgabor * documentation and/or other materials provided with the distribution. 16219019Sgabor * 17219019Sgabor * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 18219019Sgabor * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19219019Sgabor * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20219019Sgabor * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 21219019Sgabor * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22219019Sgabor * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23219019Sgabor * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24219019Sgabor * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25219019Sgabor * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26219019Sgabor * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27219019Sgabor * SUCH DAMAGE. 28219019Sgabor */ 29219019Sgabor 30219019Sgabor#ifndef _CITRUS_HASH_H_ 31219019Sgabor#define _CITRUS_HASH_H_ 32219019Sgabor 33219019Sgabor#define _CITRUS_HASH_ENTRY(type) LIST_ENTRY(type) 34219019Sgabor#define _CITRUS_HASH_HEAD(headname, type, hashsize) \ 35219019Sgaborstruct headname { \ 36219019Sgabor LIST_HEAD(, type) chh_table[hashsize]; \ 37219019Sgabor} 38219019Sgabor#define _CITRUS_HASH_INIT(head, hashsize) \ 39219019Sgabordo { \ 40219019Sgabor int _ch_loop; \ 41219019Sgabor \ 42219019Sgabor for (_ch_loop = 0; _ch_loop < hashsize; _ch_loop++) \ 43219019Sgabor LIST_INIT(&(head)->chh_table[_ch_loop]); \ 44219019Sgabor} while (0) 45219019Sgabor#define _CITRUS_HASH_REMOVE(elm, field) LIST_REMOVE(elm, field) 46219019Sgabor#define _CITRUS_HASH_INSERT(head, elm, field, hashval) \ 47219019Sgabor LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field) 48219019Sgabor#define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \ 49219019Sgabordo { \ 50219019Sgabor LIST_FOREACH((elm), &(head)->chh_table[hashval], field) \ 51219019Sgabor if (matchfunc((elm), key) == 0) \ 52219019Sgabor break; \ 53219019Sgabor} while (0) 54219019Sgabor 55219019Sgabor__BEGIN_DECLS 56219019Sgaborint _citrus_string_hash_func(const char *, int); 57219019Sgabor__END_DECLS 58219019Sgabor 59219019Sgabor#endif 60