mirror of
https://github.com/MariaDB/server.git
synced 2025-01-22 14:54:20 +01:00
4e1116b2c6
Also, remove empty .ic files that were not removed by my MySQL commit. Problem: InnoDB used to support a compilation mode that allowed to choose whether the function definitions in .ic files are to be inlined or not. This stopped making sense when InnoDB moved to C++ in MySQL 5.6 (and ha_innodb.cc started to #include .ic files), and more so in MySQL 5.7 when inline methods and functions were introduced in .h files. Solution: Remove all references to UNIV_NONINL and UNIV_MUST_NOT_INLINE from all files, assuming that the symbols are never defined. Remove the files fut0fut.cc and ut0byte.cc which only mattered when UNIV_NONINL was defined.
92 lines
2.3 KiB
C++
92 lines
2.3 KiB
C++
/*****************************************************************************
|
|
|
|
Copyright (c) 1994, 2016, Oracle and/or its affiliates. All Rights Reserved.
|
|
|
|
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, Suite 500, Boston, MA 02110-1335 USA
|
|
|
|
*****************************************************************************/
|
|
|
|
/***************************************************************//**
|
|
@file ut/ut0rnd.cc
|
|
Random numbers and hashing
|
|
|
|
Created 5/11/1994 Heikki Tuuri
|
|
********************************************************************/
|
|
|
|
#include "ut0rnd.h"
|
|
|
|
/** 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
|
|
/*@}*/
|
|
|
|
/** Seed value of ut_rnd_gen_ulint(). */
|
|
ulint ut_rnd_ulint_counter = 65654363;
|
|
|
|
/***********************************************************//**
|
|
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);
|
|
}
|