mirror of
https://github.com/MariaDB/server.git
synced 2025-01-18 04:53:01 +01:00
b1f2d3a8c8
We should not need anywhere near 32 bits of entropy, so we might just limit ourselves to a 32-bit random number generator. Also, it might be cheaper to use exclusive-or, bit shifting and conditional jumps, instead of multiplication and addition. We use relaxed atomic operations on the global random number generator state in order in an attempt to silence any warnings about race conditions. There is an obvious race condition between the load and store in ut_rnd_gen(), but we do not think that it matters much that the state of the random number generator could 'stutter'. This change seems makes the 'uncompress_ops' nondeterministic in innodb_zip.cmp_per_index after the restart. It looks like there is an inherent race condition in the test, because the table could be opened for InnoDB statistics recalculation already before innodb_cmp_per_index_enabled was set. We might end up having uncompress_ops anywhere between 0 and 9, or perhaps even more. Let us remove that part of the test.
93 lines
2.3 KiB
C++
93 lines
2.3 KiB
C++
/*****************************************************************************
|
|
|
|
Copyright (c) 1994, 2016, Oracle and/or its affiliates. All Rights Reserved.
|
|
Copyright (c) 2019, MariaDB Corporation.
|
|
|
|
This program is free software; you can redistribute it and/or modify it under
|
|
the terms of the GNU General Public License as published by the Free Software
|
|
Foundation; version 2 of the License.
|
|
|
|
This program is distributed in the hope that it will be useful, but WITHOUT
|
|
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
|
FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License along with
|
|
this program; if not, write to the Free Software Foundation, Inc.,
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1335 USA
|
|
|
|
*****************************************************************************/
|
|
|
|
/***************************************************************//**
|
|
@file ut/ut0rnd.cc
|
|
Random numbers and hashing
|
|
|
|
Created 5/11/1994 Heikki Tuuri
|
|
********************************************************************/
|
|
|
|
#include "ut0rnd.h"
|
|
|
|
/** Seed value of ut_rnd_gen() */
|
|
int32 ut_rnd_current;
|
|
|
|
/** These random numbers are used in ut_find_prime */
|
|
/*@{*/
|
|
#define UT_RANDOM_1 1.0412321
|
|
#define UT_RANDOM_2 1.1131347
|
|
#define UT_RANDOM_3 1.0132677
|
|
/*@}*/
|
|
|
|
/***********************************************************//**
|
|
Looks for a prime number slightly greater than the given argument.
|
|
The prime is chosen so that it is not near any power of 2.
|
|
@return prime */
|
|
ulint
|
|
ut_find_prime(
|
|
/*==========*/
|
|
ulint n) /*!< in: positive number > 100 */
|
|
{
|
|
ulint pow2;
|
|
ulint i;
|
|
|
|
n += 100;
|
|
|
|
pow2 = 1;
|
|
while (pow2 * 2 < n) {
|
|
pow2 = 2 * pow2;
|
|
}
|
|
|
|
if ((double) n < 1.05 * (double) pow2) {
|
|
n = (ulint) ((double) n * UT_RANDOM_1);
|
|
}
|
|
|
|
pow2 = 2 * pow2;
|
|
|
|
if ((double) n > 0.95 * (double) pow2) {
|
|
n = (ulint) ((double) n * UT_RANDOM_2);
|
|
}
|
|
|
|
if (n > pow2 - 20) {
|
|
n += 30;
|
|
}
|
|
|
|
/* Now we have n far enough from powers of 2. To make
|
|
n more random (especially, if it was not near
|
|
a power of 2), we then multiply it by a random number. */
|
|
|
|
n = (ulint) ((double) n * UT_RANDOM_3);
|
|
|
|
for (;; n++) {
|
|
i = 2;
|
|
while (i * i <= n) {
|
|
if (n % i == 0) {
|
|
goto next_n;
|
|
}
|
|
i++;
|
|
}
|
|
|
|
/* Found a prime */
|
|
break;
|
|
next_n: ;
|
|
}
|
|
|
|
return(n);
|
|
}
|