1*7c478bd9Sstevel@tonic-gate /*
2*7c478bd9Sstevel@tonic-gate * CDDL HEADER START
3*7c478bd9Sstevel@tonic-gate *
4*7c478bd9Sstevel@tonic-gate * The contents of this file are subject to the terms of the
5*7c478bd9Sstevel@tonic-gate * Common Development and Distribution License, Version 1.0 only
6*7c478bd9Sstevel@tonic-gate * (the "License"). You may not use this file except in compliance
7*7c478bd9Sstevel@tonic-gate * with the License.
8*7c478bd9Sstevel@tonic-gate *
9*7c478bd9Sstevel@tonic-gate * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10*7c478bd9Sstevel@tonic-gate * or http://www.opensolaris.org/os/licensing.
11*7c478bd9Sstevel@tonic-gate * See the License for the specific language governing permissions
12*7c478bd9Sstevel@tonic-gate * and limitations under the License.
13*7c478bd9Sstevel@tonic-gate *
14*7c478bd9Sstevel@tonic-gate * When distributing Covered Code, include this CDDL HEADER in each
15*7c478bd9Sstevel@tonic-gate * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16*7c478bd9Sstevel@tonic-gate * If applicable, add the following below this CDDL HEADER, with the
17*7c478bd9Sstevel@tonic-gate * fields enclosed by brackets "[]" replaced with your own identifying
18*7c478bd9Sstevel@tonic-gate * information: Portions Copyright [yyyy] [name of copyright owner]
19*7c478bd9Sstevel@tonic-gate *
20*7c478bd9Sstevel@tonic-gate * CDDL HEADER END
21*7c478bd9Sstevel@tonic-gate */
22*7c478bd9Sstevel@tonic-gate /*
23*7c478bd9Sstevel@tonic-gate * Copyright 2001-2002 Sun Microsystems, Inc. All rights reserved.
24*7c478bd9Sstevel@tonic-gate * Use is subject to license terms.
25*7c478bd9Sstevel@tonic-gate */
26*7c478bd9Sstevel@tonic-gate
27*7c478bd9Sstevel@tonic-gate #include "gnu_msgfmt.h"
28*7c478bd9Sstevel@tonic-gate #include "gnu_prime.h"
29*7c478bd9Sstevel@tonic-gate
30*7c478bd9Sstevel@tonic-gate
31*7c478bd9Sstevel@tonic-gate /*
32*7c478bd9Sstevel@tonic-gate * hashpjw
33*7c478bd9Sstevel@tonic-gate *
34*7c478bd9Sstevel@tonic-gate * Calculates the hash value from the specified string.
35*7c478bd9Sstevel@tonic-gate * Actual hashid will be mod(hash value, PRIME_NUMBER).
36*7c478bd9Sstevel@tonic-gate *
37*7c478bd9Sstevel@tonic-gate * Ref: Compilers - Principles, Techniques, and Tools
38*7c478bd9Sstevel@tonic-gate * Aho, Sethi, and Ullman
39*7c478bd9Sstevel@tonic-gate */
40*7c478bd9Sstevel@tonic-gate unsigned int
hashpjw(const char * str)41*7c478bd9Sstevel@tonic-gate hashpjw(const char *str)
42*7c478bd9Sstevel@tonic-gate {
43*7c478bd9Sstevel@tonic-gate const char *p;
44*7c478bd9Sstevel@tonic-gate unsigned int h = 0, g;
45*7c478bd9Sstevel@tonic-gate
46*7c478bd9Sstevel@tonic-gate for (p = str; *p; p++) {
47*7c478bd9Sstevel@tonic-gate h = (h << 4) + *p;
48*7c478bd9Sstevel@tonic-gate g = h & 0xf0000000;
49*7c478bd9Sstevel@tonic-gate if (g) {
50*7c478bd9Sstevel@tonic-gate h = h ^ (g >> 24);
51*7c478bd9Sstevel@tonic-gate h = h ^ g;
52*7c478bd9Sstevel@tonic-gate }
53*7c478bd9Sstevel@tonic-gate }
54*7c478bd9Sstevel@tonic-gate
55*7c478bd9Sstevel@tonic-gate return (h);
56*7c478bd9Sstevel@tonic-gate }
57*7c478bd9Sstevel@tonic-gate
58*7c478bd9Sstevel@tonic-gate static unsigned int
find_prime_big(unsigned int n)59*7c478bd9Sstevel@tonic-gate find_prime_big(unsigned int n)
60*7c478bd9Sstevel@tonic-gate {
61*7c478bd9Sstevel@tonic-gate int t;
62*7c478bd9Sstevel@tonic-gate unsigned int max_tbl_prime, prd;
63*7c478bd9Sstevel@tonic-gate max_tbl_prime = prime[MAX_PRIME_INDEX] + 2;
64*7c478bd9Sstevel@tonic-gate
65*7c478bd9Sstevel@tonic-gate for (; ; ) {
66*7c478bd9Sstevel@tonic-gate for (t = 1; t <= MAX_PRIME_INDEX; t++) {
67*7c478bd9Sstevel@tonic-gate if (n % prime[t] == 0) {
68*7c478bd9Sstevel@tonic-gate /* n is not a prime number */
69*7c478bd9Sstevel@tonic-gate break;
70*7c478bd9Sstevel@tonic-gate }
71*7c478bd9Sstevel@tonic-gate }
72*7c478bd9Sstevel@tonic-gate if (t <= MAX_PRIME_INDEX) {
73*7c478bd9Sstevel@tonic-gate n += 2;
74*7c478bd9Sstevel@tonic-gate continue;
75*7c478bd9Sstevel@tonic-gate }
76*7c478bd9Sstevel@tonic-gate
77*7c478bd9Sstevel@tonic-gate prd = max_tbl_prime;
78*7c478bd9Sstevel@tonic-gate while ((prd * prd < n) && (n % prd != 0)) {
79*7c478bd9Sstevel@tonic-gate prd += 2;
80*7c478bd9Sstevel@tonic-gate }
81*7c478bd9Sstevel@tonic-gate if (n % prd == 0) {
82*7c478bd9Sstevel@tonic-gate n += 2;
83*7c478bd9Sstevel@tonic-gate continue;
84*7c478bd9Sstevel@tonic-gate }
85*7c478bd9Sstevel@tonic-gate return (n);
86*7c478bd9Sstevel@tonic-gate }
87*7c478bd9Sstevel@tonic-gate /* NOTREACHED */
88*7c478bd9Sstevel@tonic-gate }
89*7c478bd9Sstevel@tonic-gate
90*7c478bd9Sstevel@tonic-gate unsigned int
find_prime(unsigned int tbl_size)91*7c478bd9Sstevel@tonic-gate find_prime(unsigned int tbl_size)
92*7c478bd9Sstevel@tonic-gate {
93*7c478bd9Sstevel@tonic-gate int t, d;
94*7c478bd9Sstevel@tonic-gate unsigned int n, prd;
95*7c478bd9Sstevel@tonic-gate
96*7c478bd9Sstevel@tonic-gate /* for compatibility with GNU msgfmt */
97*7c478bd9Sstevel@tonic-gate if (tbl_size == 1)
98*7c478bd9Sstevel@tonic-gate return (1);
99*7c478bd9Sstevel@tonic-gate else if (tbl_size == 2)
100*7c478bd9Sstevel@tonic-gate return (5);
101*7c478bd9Sstevel@tonic-gate
102*7c478bd9Sstevel@tonic-gate n = 4 * tbl_size / 3;
103*7c478bd9Sstevel@tonic-gate
104*7c478bd9Sstevel@tonic-gate /* make n an odd number */
105*7c478bd9Sstevel@tonic-gate n |= 1;
106*7c478bd9Sstevel@tonic-gate
107*7c478bd9Sstevel@tonic-gate prd = n / 100;
108*7c478bd9Sstevel@tonic-gate if (prd <= MAX_INDEX_INDEX) {
109*7c478bd9Sstevel@tonic-gate /* first, search the table */
110*7c478bd9Sstevel@tonic-gate for (t = index[prd] + 1; t <= MAX_PRIME_INDEX; t++) {
111*7c478bd9Sstevel@tonic-gate if (prime[t] >= n)
112*7c478bd9Sstevel@tonic-gate return (prime[t]);
113*7c478bd9Sstevel@tonic-gate }
114*7c478bd9Sstevel@tonic-gate error(ERR_PRIME, n);
115*7c478bd9Sstevel@tonic-gate /* NOTREACHED */
116*7c478bd9Sstevel@tonic-gate }
117*7c478bd9Sstevel@tonic-gate t = START_SEARCH_INDEX;
118*7c478bd9Sstevel@tonic-gate for (; ; ) {
119*7c478bd9Sstevel@tonic-gate while (prime[t] * prime[t] < n) {
120*7c478bd9Sstevel@tonic-gate if (t == MAX_PRIME_INDEX) {
121*7c478bd9Sstevel@tonic-gate return (find_prime_big(n));
122*7c478bd9Sstevel@tonic-gate }
123*7c478bd9Sstevel@tonic-gate t++;
124*7c478bd9Sstevel@tonic-gate }
125*7c478bd9Sstevel@tonic-gate for (d = 1; d <= t; d++) {
126*7c478bd9Sstevel@tonic-gate if (n % prime[d] == 0) {
127*7c478bd9Sstevel@tonic-gate /* n is not a prime number */
128*7c478bd9Sstevel@tonic-gate break;
129*7c478bd9Sstevel@tonic-gate }
130*7c478bd9Sstevel@tonic-gate }
131*7c478bd9Sstevel@tonic-gate if (d > t) {
132*7c478bd9Sstevel@tonic-gate /* n is a prime number */
133*7c478bd9Sstevel@tonic-gate return (n);
134*7c478bd9Sstevel@tonic-gate }
135*7c478bd9Sstevel@tonic-gate n += 2;
136*7c478bd9Sstevel@tonic-gate }
137*7c478bd9Sstevel@tonic-gate /* NOTREACHED */
138*7c478bd9Sstevel@tonic-gate }
139*7c478bd9Sstevel@tonic-gate
140*7c478bd9Sstevel@tonic-gate unsigned int
get_hash_index(unsigned int * hash_tbl,unsigned int hash_value,unsigned int hash_size)141*7c478bd9Sstevel@tonic-gate get_hash_index(unsigned int *hash_tbl, unsigned int hash_value,
142*7c478bd9Sstevel@tonic-gate unsigned int hash_size)
143*7c478bd9Sstevel@tonic-gate {
144*7c478bd9Sstevel@tonic-gate unsigned int idx, inc;
145*7c478bd9Sstevel@tonic-gate
146*7c478bd9Sstevel@tonic-gate idx = hash_value % hash_size;
147*7c478bd9Sstevel@tonic-gate inc = 1 + (hash_value % (hash_size - 2));
148*7c478bd9Sstevel@tonic-gate
149*7c478bd9Sstevel@tonic-gate for (; ; ) {
150*7c478bd9Sstevel@tonic-gate if (!hash_tbl[idx])
151*7c478bd9Sstevel@tonic-gate return (idx);
152*7c478bd9Sstevel@tonic-gate idx = (idx + inc) % hash_size;
153*7c478bd9Sstevel@tonic-gate }
154*7c478bd9Sstevel@tonic-gate /* NOTREACHED */
155*7c478bd9Sstevel@tonic-gate }
156