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