2 * Copyright (c) 1990, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 4. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 #if defined(LIBC_SCCS) && !defined(lint)
34 static char sccsid[] = "@(#)hash_func.c 8.2 (Berkeley) 2/21/94";
35 #endif /* LIBC_SCCS and not lint */
36 #include <sys/cdefs.h>
37 __FBSDID("$FreeBSD$");
39 #include <sys/types.h>
47 static u_int32_t hash1(const void *, size_t) __unused;
48 static u_int32_t hash2(const void *, size_t) __unused;
49 static u_int32_t hash3(const void *, size_t) __unused;
51 static u_int32_t hash4(const void *, size_t);
53 /* Default hash function. */
54 u_int32_t (*__default_hash)(const void *, size_t) = hash4;
58 * Assume that we've already split the bucket to which this key hashes,
59 * calculate that bucket, and check that in fact we did already split it.
61 * EJB's original hsearch hash.
64 #define PRIME2 1048583
67 hash1(const void *key, size_t len)
74 /* Convert string to integer */
76 h = h * PRIME1 ^ (*k++ - ' ');
82 * Phong Vo's linear congruential hash
84 #define dcharhash(h, c) ((h) = 0x63c63cd9*(h) + 0x9c39c33d + (c))
87 hash2(const void *key, size_t len)
94 for (h = 0; k != e;) {
104 * This is INCREDIBLY ugly, but fast. We break the string up into 8 byte
105 * units. On the first time through the loop we get the "leftover bytes"
106 * (strlen % 8). On every other iteration, we perform 8 HASHC's so we handle
107 * all 8 bytes. Essentially, this saves us 7 cmp & branch instructions. If
108 * this routine is heavily used enough, it's worth the ugly coding.
110 * Ozan Yigit's original sdbm hash.
113 hash3(const void *key, size_t len)
118 #define HASHC n = *k++ + 65599 * n
123 loop = (len + 8 - 1) >> 3;
125 switch (len & (8 - 1)) {
127 do { /* All fall throughs */
151 /* Chris Torek's hash function. */
153 hash4(const void *key, size_t len)
158 #define HASH4a h = (h << 5) - h + *k++;
159 #define HASH4b h = (h << 5) + h + *k++;
165 loop = (len + 8 - 1) >> 3;
167 switch (len & (8 - 1)) {
169 do { /* All fall throughs */