subr_hash.c revision 1.4 1 1.4 christos /* $NetBSD: subr_hash.c,v 1.4 2011/12/25 02:23:09 christos Exp $ */
2 1.1 pooka
3 1.1 pooka /*
4 1.1 pooka * Copyright (c) 1982, 1986, 1991, 1993
5 1.1 pooka * The Regents of the University of California. All rights reserved.
6 1.1 pooka * (c) UNIX System Laboratories, Inc.
7 1.1 pooka * All or some portions of this file are derived from material licensed
8 1.1 pooka * to the University of California by American Telephone and Telegraph
9 1.1 pooka * Co. or Unix System Laboratories, Inc. and are reproduced herein with
10 1.1 pooka * the permission of UNIX System Laboratories, Inc.
11 1.1 pooka *
12 1.1 pooka * Redistribution and use in source and binary forms, with or without
13 1.1 pooka * modification, are permitted provided that the following conditions
14 1.1 pooka * are met:
15 1.1 pooka * 1. Redistributions of source code must retain the above copyright
16 1.1 pooka * notice, this list of conditions and the following disclaimer.
17 1.1 pooka * 2. Redistributions in binary form must reproduce the above copyright
18 1.1 pooka * notice, this list of conditions and the following disclaimer in the
19 1.1 pooka * documentation and/or other materials provided with the distribution.
20 1.1 pooka * 3. Neither the name of the University nor the names of its contributors
21 1.1 pooka * may be used to endorse or promote products derived from this software
22 1.1 pooka * without specific prior written permission.
23 1.1 pooka *
24 1.1 pooka * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 pooka * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 pooka * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 pooka * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 pooka * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 pooka * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 pooka * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 pooka * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 pooka * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 pooka * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 pooka * SUCH DAMAGE.
35 1.1 pooka *
36 1.1 pooka * @(#)kern_subr.c 8.4 (Berkeley) 2/14/95
37 1.1 pooka */
38 1.1 pooka
39 1.1 pooka #include <sys/cdefs.h>
40 1.4 christos __KERNEL_RCSID(0, "$NetBSD: subr_hash.c,v 1.4 2011/12/25 02:23:09 christos Exp $");
41 1.1 pooka
42 1.1 pooka #include <sys/param.h>
43 1.3 ad #include <sys/kmem.h>
44 1.1 pooka #include <sys/systm.h>
45 1.1 pooka
46 1.1 pooka /*
47 1.1 pooka * General routine to allocate a hash table.
48 1.1 pooka * Allocate enough memory to hold at least `elements' list-head pointers.
49 1.1 pooka * Return a pointer to the allocated space and set *hashmask to a pattern
50 1.1 pooka * suitable for masking a value to use as an index into the returned array.
51 1.1 pooka */
52 1.1 pooka void *
53 1.3 ad hashinit(u_int elements, enum hashtype htype, bool waitok, u_long *hashmask)
54 1.1 pooka {
55 1.1 pooka u_long hashsize, i;
56 1.1 pooka LIST_HEAD(, generic) *hashtbl_list;
57 1.2 rmind SLIST_HEAD(, generic) *hashtbl_slist;
58 1.1 pooka TAILQ_HEAD(, generic) *hashtbl_tailq;
59 1.1 pooka size_t esize;
60 1.1 pooka void *p;
61 1.1 pooka if (elements == 0)
62 1.1 pooka panic("hashinit: bad cnt");
63 1.4 christos
64 1.4 christos #define MAXELEMENTS (1U << ((sizeof(elements) * NBBY) - 1))
65 1.4 christos if (elements > MAXELEMENTS)
66 1.4 christos elements = MAXELEMENTS;
67 1.4 christos
68 1.1 pooka for (hashsize = 1; hashsize < elements; hashsize <<= 1)
69 1.1 pooka continue;
70 1.1 pooka
71 1.1 pooka switch (htype) {
72 1.1 pooka case HASH_LIST:
73 1.1 pooka esize = sizeof(*hashtbl_list);
74 1.1 pooka break;
75 1.2 rmind case HASH_SLIST:
76 1.2 rmind esize = sizeof(*hashtbl_slist);
77 1.2 rmind break;
78 1.1 pooka case HASH_TAILQ:
79 1.1 pooka esize = sizeof(*hashtbl_tailq);
80 1.1 pooka break;
81 1.1 pooka default:
82 1.1 pooka panic("hashinit: invalid table type");
83 1.1 pooka }
84 1.1 pooka
85 1.3 ad p = kmem_alloc(hashsize * esize, (waitok ? KM_SLEEP : KM_NOSLEEP));
86 1.3 ad if (p == NULL)
87 1.1 pooka return (NULL);
88 1.1 pooka
89 1.1 pooka switch (htype) {
90 1.1 pooka case HASH_LIST:
91 1.1 pooka hashtbl_list = p;
92 1.1 pooka for (i = 0; i < hashsize; i++)
93 1.1 pooka LIST_INIT(&hashtbl_list[i]);
94 1.1 pooka break;
95 1.2 rmind case HASH_SLIST:
96 1.2 rmind hashtbl_slist = p;
97 1.2 rmind for (i = 0; i < hashsize; i++)
98 1.2 rmind SLIST_INIT(&hashtbl_slist[i]);
99 1.2 rmind break;
100 1.1 pooka case HASH_TAILQ:
101 1.1 pooka hashtbl_tailq = p;
102 1.1 pooka for (i = 0; i < hashsize; i++)
103 1.1 pooka TAILQ_INIT(&hashtbl_tailq[i]);
104 1.1 pooka break;
105 1.1 pooka }
106 1.1 pooka *hashmask = hashsize - 1;
107 1.1 pooka return (p);
108 1.1 pooka }
109 1.1 pooka
110 1.1 pooka /*
111 1.1 pooka * Free memory from hash table previosly allocated via hashinit().
112 1.1 pooka */
113 1.1 pooka void
114 1.3 ad hashdone(void *hashtbl, enum hashtype htype, u_long hashmask)
115 1.1 pooka {
116 1.3 ad LIST_HEAD(, generic) *hashtbl_list;
117 1.3 ad SLIST_HEAD(, generic) *hashtbl_slist;
118 1.3 ad TAILQ_HEAD(, generic) *hashtbl_tailq;
119 1.3 ad size_t esize;
120 1.3 ad
121 1.3 ad switch (htype) {
122 1.3 ad case HASH_LIST:
123 1.3 ad esize = sizeof(*hashtbl_list);
124 1.3 ad break;
125 1.3 ad case HASH_SLIST:
126 1.3 ad esize = sizeof(*hashtbl_slist);
127 1.3 ad break;
128 1.3 ad case HASH_TAILQ:
129 1.3 ad esize = sizeof(*hashtbl_tailq);
130 1.3 ad break;
131 1.3 ad default:
132 1.3 ad panic("hashdone: invalid table type");
133 1.3 ad }
134 1.1 pooka
135 1.3 ad kmem_free(hashtbl, esize * (hashmask + 1));
136 1.1 pooka }
137