1/* $FreeBSD$ */
2/* $NetBSD: citrus_hash.h,v 1.3 2004/01/02 21:49:35 itojun Exp $ */
3
4/*-
5 * SPDX-License-Identifier: BSD-2-Clause
6 *
7 * Copyright (c)2003 Citrus Project,
8 * All rights reserved.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 *    notice, this list of conditions and the following disclaimer.
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 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * SUCH DAMAGE.
30 */
31
32#ifndef _CITRUS_HASH_H_
33#define _CITRUS_HASH_H_
34
35#define _CITRUS_HASH_ENTRY(type) LIST_ENTRY(type)
36#define _CITRUS_HASH_HEAD(headname, type, hashsize)	\
37struct headname {					\
38	LIST_HEAD(, type)	chh_table[hashsize];	\
39}
40#define _CITRUS_HASH_INIT(head, hashsize)			\
41do {								\
42	int _ch_loop;						\
43								\
44	for (_ch_loop = 0; _ch_loop < hashsize; _ch_loop++)	\
45		LIST_INIT(&(head)->chh_table[_ch_loop]);	\
46} while (0)
47#define _CITRUS_HASH_REMOVE(elm, field)	LIST_REMOVE(elm, field)
48#define _CITRUS_HASH_INSERT(head, elm, field, hashval)		\
49    LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field)
50#define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval)	\
51do {									\
52	LIST_FOREACH((elm), &(head)->chh_table[hashval], field)		\
53		if (matchfunc((elm), key) == 0)				\
54			break;						\
55} while (0)
56
57__BEGIN_DECLS
58int	 _citrus_string_hash_func(const char *, int);
59__END_DECLS
60
61#endif
62