drizzle
C++ MySQL-protocol-compatible database server
Loading...
Searching...
No Matches
ut0rnd.cc
1/*****************************************************************************
2
3Copyright (C) 1994, 2009, Innobase Oy. All Rights Reserved.
4
5This program is free software; you can redistribute it and/or modify it under
6the terms of the GNU General Public License as published by the Free Software
7Foundation; version 2 of the License.
8
9This program is distributed in the hope that it will be useful, but WITHOUT
10ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
11FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
12
13You should have received a copy of the GNU General Public License along with
14this program; if not, write to the Free Software Foundation, Inc., 51 Franklin
15St, Fifth Floor, Boston, MA 02110-1301 USA
16
17*****************************************************************************/
18
19/***************************************************************/
25
26#include "ut0rnd.h"
27
28#ifdef UNIV_NONINL
29#include "ut0rnd.ic"
30#endif
31
34#define UT_RANDOM_1 1.0412321
35#define UT_RANDOM_2 1.1131347
36#define UT_RANDOM_3 1.0132677
38
40UNIV_INTERN ulint ut_rnd_ulint_counter = 65654363;
41
42/***********************************************************/
46UNIV_INTERN
47ulint
49/*==========*/
50 ulint n)
51{
52 ulint pow2;
53 ulint i;
54
55 n += 100;
56
57 pow2 = 1;
58 while (pow2 * 2 < n) {
59 pow2 = 2 * pow2;
60 }
61
62 if ((double)n < 1.05 * (double)pow2) {
63 n = (ulint) ((double)n * UT_RANDOM_1);
64 }
65
66 pow2 = 2 * pow2;
67
68 if ((double)n > 0.95 * (double)pow2) {
69 n = (ulint) ((double)n * UT_RANDOM_2);
70 }
71
72 if (n > pow2 - 20) {
73 n += 30;
74 }
75
76 /* Now we have n far enough from powers of 2. To make
77 n more random (especially, if it was not near
78 a power of 2), we then multiply it by a random number. */
79
80 n = (ulint) ((double)n * UT_RANDOM_3);
81
82 for (;; n++) {
83 i = 2;
84 while (i * i <= n) {
85 if (n % i == 0) {
86 goto next_n;
87 }
88 i++;
89 }
90
91 /* Found a prime */
92 break;
93next_n: ;
94 }
95
96 return(n);
97}
UNIV_INTERN ulint ut_find_prime(ulint n) __attribute__((const))