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 <sys/types.h>
30
31 /*
32 * function that will find a prime'ish number. Usefull for
33 * hashbuckets and related things.
34 */
35 uint_t
36 findprime(uint_t count)
37 {
38 uint_t h, f;
39
40 if (count <= 3)
41 return (3);
42
43
44 /*
45 * Check to see if divisible by two, if so
46 * increment.
47 */
48 if ((count & 0x1) == 0)
|
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 <sys/types.h>
28
29 /*
30 * function that will find a prime'ish number. Usefull for
31 * hashbuckets and related things.
32 */
33 uint_t
34 findprime(uint_t count)
35 {
36 uint_t h, f;
37
38 if (count <= 3)
39 return (3);
40
41
42 /*
43 * Check to see if divisible by two, if so
44 * increment.
45 */
46 if ((count & 0x1) == 0)
|