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