hashtable.h revision 1.5.2.2
1 1.5.2.2 pgoyette /* $NetBSD: hashtable.h,v 1.5.2.2 2018/09/06 06:56:36 pgoyette Exp $ */ 2 1.5.2.2 pgoyette 3 1.5.2.2 pgoyette /*- 4 1.5.2.2 pgoyette * Copyright (c) 2018 The NetBSD Foundation, Inc. 5 1.5.2.2 pgoyette * All rights reserved. 6 1.5.2.2 pgoyette * 7 1.5.2.2 pgoyette * This code is derived from software contributed to The NetBSD Foundation 8 1.5.2.2 pgoyette * by Taylor R. Campbell. 9 1.5.2.2 pgoyette * 10 1.5.2.2 pgoyette * Redistribution and use in source and binary forms, with or without 11 1.5.2.2 pgoyette * modification, are permitted provided that the following conditions 12 1.5.2.2 pgoyette * are met: 13 1.5.2.2 pgoyette * 1. Redistributions of source code must retain the above copyright 14 1.5.2.2 pgoyette * notice, this list of conditions and the following disclaimer. 15 1.5.2.2 pgoyette * 2. Redistributions in binary form must reproduce the above copyright 16 1.5.2.2 pgoyette * notice, this list of conditions and the following disclaimer in the 17 1.5.2.2 pgoyette * documentation and/or other materials provided with the distribution. 18 1.5.2.2 pgoyette * 19 1.5.2.2 pgoyette * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 20 1.5.2.2 pgoyette * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 21 1.5.2.2 pgoyette * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 22 1.5.2.2 pgoyette * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 23 1.5.2.2 pgoyette * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 24 1.5.2.2 pgoyette * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 25 1.5.2.2 pgoyette * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 26 1.5.2.2 pgoyette * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 27 1.5.2.2 pgoyette * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 28 1.5.2.2 pgoyette * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 29 1.5.2.2 pgoyette * POSSIBILITY OF SUCH DAMAGE. 30 1.5.2.2 pgoyette */ 31 1.5.2.2 pgoyette 32 1.5.2.2 pgoyette #ifndef _LINUX_HASHTABLE_H_ 33 1.5.2.2 pgoyette #define _LINUX_HASHTABLE_H_ 34 1.5.2.2 pgoyette 35 1.5.2.2 pgoyette #include <sys/cdefs.h> 36 1.5.2.2 pgoyette 37 1.5.2.2 pgoyette #include <linux/list.h> 38 1.5.2.2 pgoyette 39 1.5.2.2 pgoyette #define DECLARE_HASHTABLE(name, bits) \ 40 1.5.2.2 pgoyette struct hlist_head name[1u << (bits)] 41 1.5.2.2 pgoyette 42 1.5.2.2 pgoyette static inline void 43 1.5.2.2 pgoyette __hash_init(struct hlist_head *hash, unsigned n) 44 1.5.2.2 pgoyette { 45 1.5.2.2 pgoyette 46 1.5.2.2 pgoyette while (n --> 0) 47 1.5.2.2 pgoyette INIT_HLIST_HEAD(&hash[n]); 48 1.5.2.2 pgoyette } 49 1.5.2.2 pgoyette 50 1.5.2.2 pgoyette static inline bool 51 1.5.2.2 pgoyette __hash_empty(struct hlist_head *hash, unsigned n) 52 1.5.2.2 pgoyette { 53 1.5.2.2 pgoyette 54 1.5.2.2 pgoyette while (n --> 0) { 55 1.5.2.2 pgoyette if (!hlist_empty(&hash[n])) 56 1.5.2.2 pgoyette return false; 57 1.5.2.2 pgoyette } 58 1.5.2.2 pgoyette 59 1.5.2.2 pgoyette return true; 60 1.5.2.2 pgoyette } 61 1.5.2.2 pgoyette 62 1.5.2.2 pgoyette #define hash_init(h) __hash_init((h), __arraycount(h)) 63 1.5.2.2 pgoyette #define hash_add(h, n, k) hlist_add_head(n, &(h)[(k) % __arraycount(h)]) 64 1.5.2.2 pgoyette #define hash_del(n) hlist_del_init(n) 65 1.5.2.2 pgoyette #define hash_empty(h) __hash_empty((h), __arraycount(h)) 66 1.5.2.2 pgoyette #define hash_for_each_possible(h, n, f, k) \ 67 1.5.2.2 pgoyette hlist_for_each_entry(n, &(h)[(k) % __arraycount(h)], f) 68 1.5.2.2 pgoyette #define hash_for_each_safe(h, i, t, n, f) \ 69 1.5.2.2 pgoyette for ((i) = 0; (i) < __arraycount(h); (i)++) \ 70 1.5.2.2 pgoyette hlist_for_each_entry_safe(n, t, &(h)[i], f) 71 1.5.2.2 pgoyette 72 1.5.2.2 pgoyette #endif /*_LINUX_HASHTABLE_H_*/ 73
Indexes created Thu Oct 02 10:09:58 GMT 2025