1 /* $NetBSD: citrus_hash.h,v 1.4 2022/04/19 20:32:14 rillig 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) LIST_ENTRY(type) 33 #define _CITRUS_HASH_HEAD(headname, type, hashsize) \ 34 struct headname { \ 35 LIST_HEAD(, type) chh_table[hashsize]; \ 36 } 37 #define _CITRUS_HASH_INIT(head, hashsize) \ 38 do { \ 39 int _ch_loop; \ 40 for (_ch_loop = 0; _ch_loop < hashsize; _ch_loop++) \ 41 LIST_INIT(&(head)->chh_table[_ch_loop]); \ 42 } while (0) 43 #define _CITRUS_HASH_REMOVE(elm, field) LIST_REMOVE(elm, field) 44 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \ 45 LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field) 46 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \ 47 do { \ 48 LIST_FOREACH((elm), &(head)->chh_table[hashval], field) { \ 49 if (matchfunc((elm), key)==0) \ 50 break; \ 51 } \ 52 } while (0) 53 54 __BEGIN_DECLS 55 int _citrus_string_hash_func(const char *, int); 56 __END_DECLS 57 58 #endif 59