2 .\" Copyright (c) 2004 Joseph Koshy
3 .\" All rights reserved.
5 .\" Redistribution and use in source and binary forms, with or without
6 .\" modification, are permitted provided that the following conditions
8 .\" 1. Redistributions of source code must retain the above copyright
9 .\" notice, this list of conditions and the following disclaimer.
10 .\" 2. Redistributions in binary form must reproduce the above copyright
11 .\" notice, this list of conditions and the following disclaimer in the
12 .\" documentation and/or other materials provided with the distribution.
14 .\" THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS''
15 .\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
16 .\" TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
17 .\" PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE
18 .\" LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
19 .\" CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
20 .\" SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
21 .\" INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
22 .\" CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
23 .\" ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
24 .\" POSSIBILITY OF SUCH DAMAGE.
32 .Nm hashinit , hashinit_flags, hashdestroy , phashinit
33 .Nd manage kernel hash tables
39 .Fn hashinit "int nelements" "struct malloc_type *type" "u_long *hashmask"
42 .Fa "int nelements" "struct malloc_type *type" "u_long *hashmask" "int flags"
45 .Fn hashdestroy "void *hashtbl" "struct malloc_type *type" "u_long hashmask"
47 .Fn phashinit "int nelements" "struct malloc_type *type" "u_long *nentries"
54 functions allocate space for hash tables of size given by the argument
59 function allocates hash tables that are sized to largest power of two
60 less than or equal to argument
64 function allocates hash tables that are sized to the largest prime
65 number less than or equal to argument
69 function operates like
71 but also accepts an additional argument
73 which control various options during allocation.
74 Allocated hash tables are contiguous arrays of
76 entries, allocated using
80 The malloc arena to be used for allocation is pointed to by argument
85 function frees the space occupied by the hash table pointed to by argument
89 determines the malloc arena to use when freeing space.
92 should be the bit mask returned by the call to
94 that allocated the hash table.
97 must be used with one of the following values.
99 .Bl -tag -width ".Dv HASH_NOWAIT" -offset indent -compact
101 Any malloc performed by the
103 function will not be allowed to wait, and therefore may fail.
105 Any malloc performed by the
107 function is allowed to wait for memory.
109 .Sh IMPLEMENTATION NOTES
110 The largest prime hash value chosen by
116 function returns a pointer to an allocated hash table and sets the
117 location pointed to by
119 to the bit mask to be used for computing the correct slot in the
124 function returns a pointer to an allocated hash table and sets the
125 location pointed to by
127 to the number of rows in the hash table.
129 A typical example is shown below:
130 .Bd -literal -offset indent
132 static LIST_HEAD(foo, foo) *footable;
133 static u_long foomask;
135 footable = hashinit(32, M_FOO, &foomask);
138 Here we allocate a hash table with 32 entries from the malloc arena
141 The mask for the allocated hash table is returned in
147 .Bd -literal -offset indent
149 hashdestroy(footable, M_FOO, foomask);
156 functions will panic if argument
158 is less than or equal to zero.
162 function will panic if the hash table
174 to free a hash table allocated by
176 usually has grave consequences.