7 * with the License.
8 *
9 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10 * or http://www.opensolaris.org/os/licensing.
11 * See the License for the specific language governing permissions
12 * and limitations under the License.
13 *
14 * When distributing Covered Code, include this CDDL HEADER in each
15 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16 * If applicable, add the following below this CDDL HEADER, with the
17 * fields enclosed by brackets "[]" replaced with your own identifying
18 * information: Portions Copyright [yyyy] [name of copyright owner]
19 *
20 * CDDL HEADER END
21 */
22 /*
23 * Copyright 2003 Sun Microsystems, Inc. All rights reserved.
24 * Use is subject to license terms.
25 */
26
27 #pragma ident "%Z%%M% %I% %E% SMI"
28
29 #include <sgs.h>
30
31 /*
32 * classic Bernstein k=33 hash function
33 *
34 * This routine is to be used for internal hashing of strings. It's not
35 * to be confused with elf_hash() which is the required ELF hashing
36 * tool for ELF structures.
37 */
38 uint_t
39 sgs_str_hash(const char *str)
40 {
41 uint_t hash = 5381;
42 int c;
43
44 while ((c = *str++) != 0)
45 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
46 return (hash);
47 }
|
7 * with the License.
8 *
9 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10 * or http://www.opensolaris.org/os/licensing.
11 * See the License for the specific language governing permissions
12 * and limitations under the License.
13 *
14 * When distributing Covered Code, include this CDDL HEADER in each
15 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16 * If applicable, add the following below this CDDL HEADER, with the
17 * fields enclosed by brackets "[]" replaced with your own identifying
18 * information: Portions Copyright [yyyy] [name of copyright owner]
19 *
20 * CDDL HEADER END
21 */
22 /*
23 * Copyright 2003 Sun Microsystems, Inc. All rights reserved.
24 * Use is subject to license terms.
25 */
26
27 #include <sgs.h>
28
29 /*
30 * classic Bernstein k=33 hash function
31 *
32 * This routine is to be used for internal hashing of strings. It's not
33 * to be confused with elf_hash() which is the required ELF hashing
34 * tool for ELF structures.
35 */
36 uint_t
37 sgs_str_hash(const char *str)
38 {
39 uint_t hash = 5381;
40 int c;
41
42 while ((c = *str++) != 0)
43 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
44 return (hash);
45 }
|