mirror of
https://github.com/mruby/mruby
synced 2026-06-08 16:11:16 +00:00
Christopher Aue
225 lines
7.0 KiB
C
225 lines
7.0 KiB
C
/*
|
|
** mt19937ar.c - MT Random functions
|
|
**
|
|
** Copyright (C) 1997 - 2016, Makoto Matsumoto and Takuji Nishimura,
|
|
** All rights reserved.
|
|
**
|
|
** Permission is hereby granted, free of charge, to any person obtaining
|
|
** a copy of this software and associated documentation files (the
|
|
** "Software"), to deal in the Software without restriction, including
|
|
** without limitation the rights to use, copy, modify, merge, publish,
|
|
** distribute, sublicense, and/or sell copies of the Software, and to
|
|
** permit persons to whom the Software is furnished to do so, subject to
|
|
** the following conditions:
|
|
**
|
|
** The above copyright notice and this permission notice shall be
|
|
** included in all copies or substantial portions of the Software.
|
|
**
|
|
** THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
** EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
** MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
|
** IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
|
|
** CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
|
|
** TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
|
** SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
**
|
|
** [ MIT license: http://www.opensource.org/licenses/mit-license.php ]
|
|
**
|
|
** Any feedback is very welcome.
|
|
** http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
|
|
** email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
|
|
**
|
|
** This version is modified by mruby developers. If you see any problem,
|
|
** contact us first at https://github.com/mruby/mruby/issues
|
|
*/
|
|
|
|
#include <mruby.h>
|
|
#include "mt19937ar.h"
|
|
|
|
/* Period parameters */
|
|
/* #define N 624 */
|
|
#define M 397
|
|
#define MATRIX_A 0x9908b0dfUL /* constant vector a */
|
|
#define UPPER_MASK 0x80000000UL /* most significant w-r bits */
|
|
#define LOWER_MASK 0x7fffffffUL /* least significant r bits */
|
|
|
|
#if 0 /* dead_code */
|
|
static unsigned long mt[N]; /* the array for the state vector */
|
|
static int mti=N+1; /* mti==N+1 means mt[N] is not initialized */
|
|
#endif /* dead_code */
|
|
|
|
void mrb_random_init_genrand(mt_state *t, unsigned long s)
|
|
{
|
|
t->mt[0]= s & 0xffffffffUL;
|
|
for (t->mti=1; t->mti<N; t->mti++) {
|
|
t->mt[t->mti] = (1812433253UL * (t->mt[t->mti-1] ^ (t->mt[t->mti-1] >> 30)) + t->mti);
|
|
t->mt[t->mti] &= 0xffffffffUL;
|
|
}
|
|
}
|
|
|
|
unsigned long mrb_random_genrand_int32(mt_state *t)
|
|
{
|
|
unsigned long y;
|
|
static const unsigned long mag01[2]={0x0UL, MATRIX_A};
|
|
/* mag01[x] = x * MATRIX_A for x=0,1 */
|
|
|
|
if (t->mti >= N) { /* generate N words at one time */
|
|
int kk;
|
|
|
|
if (t->mti == N+1) /* if init_genrand() has not been called, */
|
|
mrb_random_init_genrand(t, 5489UL); /* a default initial seed is used */
|
|
|
|
for (kk=0;kk<N-M;kk++) {
|
|
y = (t->mt[kk]&UPPER_MASK)|(t->mt[kk+1]&LOWER_MASK);
|
|
t->mt[kk] = t->mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
|
|
}
|
|
for (;kk<N-1;kk++) {
|
|
y = (t->mt[kk]&UPPER_MASK)|(t->mt[kk+1]&LOWER_MASK);
|
|
t->mt[kk] = t->mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
|
|
}
|
|
y = (t->mt[N-1]&UPPER_MASK)|(t->mt[0]&LOWER_MASK);
|
|
t->mt[N-1] = t->mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
|
|
|
|
t->mti = 0;
|
|
}
|
|
|
|
y = t->mt[t->mti++];
|
|
|
|
/* Tempering */
|
|
y ^= (y >> 11);
|
|
y ^= (y << 7) & 0x9d2c5680UL;
|
|
y ^= (y << 15) & 0xefc60000UL;
|
|
y ^= (y >> 18);
|
|
|
|
t->gen.int_ = y;
|
|
|
|
return y;
|
|
}
|
|
|
|
double mrb_random_genrand_real1(mt_state *t)
|
|
{
|
|
mrb_random_genrand_int32(t);
|
|
t->gen.double_ = t->gen.int_*(1.0/4294967295.0);
|
|
return t->gen.double_;
|
|
/* divided by 2^32-1 */
|
|
}
|
|
|
|
#if 0 /* dead_code */
|
|
/* initializes mt[N] with a seed */
|
|
void init_genrand(unsigned long s)
|
|
{
|
|
mt[0]= s & 0xffffffffUL;
|
|
for (mti=1; mti<N; mti++) {
|
|
mt[mti] = (1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);
|
|
/* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
|
|
/* In the previous versions, MSBs of the seed affect */
|
|
/* only MSBs of the array mt[]. */
|
|
/* 2002/01/09 modified by Makoto Matsumoto */
|
|
mt[mti] &= 0xffffffffUL;
|
|
/* for >32 bit machines */
|
|
}
|
|
}
|
|
|
|
/* initialize by an array with array-length */
|
|
/* init_key is the array for initializing keys */
|
|
/* key_length is its length */
|
|
/* slight change for C++, 2004/2/26 */
|
|
void init_by_array(unsigned long init_key[], int key_length)
|
|
{
|
|
int i, j, k;
|
|
init_genrand(19650218UL);
|
|
i=1; j=0;
|
|
k = (N>key_length ? N : key_length);
|
|
for (; k; k--) {
|
|
mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))
|
|
+ init_key[j] + j; /* non linear */
|
|
mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
|
|
i++; j++;
|
|
if (i>=N) { mt[0] = mt[N-1]; i=1; }
|
|
if (j>=key_length) j=0;
|
|
}
|
|
for (k=N-1; k; k--) {
|
|
mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))
|
|
- i; /* non linear */
|
|
mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
|
|
i++;
|
|
if (i>=N) { mt[0] = mt[N-1]; i=1; }
|
|
}
|
|
|
|
mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */
|
|
}
|
|
|
|
/* generates a random number on [0,0xffffffff]-interval */
|
|
unsigned long genrand_int32(void)
|
|
{
|
|
unsigned long y;
|
|
static const unsigned long mag01[2]={0x0UL, MATRIX_A};
|
|
/* mag01[x] = x * MATRIX_A for x=0,1 */
|
|
|
|
if (mti >= N) { /* generate N words at one time */
|
|
int kk;
|
|
|
|
if (mti == N+1) /* if init_genrand() has not been called, */
|
|
init_genrand(5489UL); /* a default initial seed is used */
|
|
|
|
for (kk=0;kk<N-M;kk++) {
|
|
y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
|
|
mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
|
|
}
|
|
for (;kk<N-1;kk++) {
|
|
y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
|
|
mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
|
|
}
|
|
y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
|
|
mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
|
|
|
|
mti = 0;
|
|
}
|
|
|
|
y = mt[mti++];
|
|
|
|
/* Tempering */
|
|
y ^= (y >> 11);
|
|
y ^= (y << 7) & 0x9d2c5680UL;
|
|
y ^= (y << 15) & 0xefc60000UL;
|
|
y ^= (y >> 18);
|
|
|
|
return y;
|
|
}
|
|
|
|
/* generates a random number on [0,0x7fffffff]-interval */
|
|
long genrand_int31(void)
|
|
{
|
|
return (long)(genrand_int32()>>1);
|
|
}
|
|
|
|
/* generates a random number on [0,1]-real-interval */
|
|
double genrand_real1(void)
|
|
{
|
|
return genrand_int32()*(1.0/4294967295.0);
|
|
/* divided by 2^32-1 */
|
|
}
|
|
|
|
/* generates a random number on [0,1)-real-interval */
|
|
double genrand_real2(void)
|
|
{
|
|
return genrand_int32()*(1.0/4294967296.0);
|
|
/* divided by 2^32 */
|
|
}
|
|
|
|
/* generates a random number on (0,1)-real-interval */
|
|
double genrand_real3(void)
|
|
{
|
|
return (((double)genrand_int32()) + 0.5)*(1.0/4294967296.0);
|
|
/* divided by 2^32 */
|
|
}
|
|
|
|
/* generates a random number on [0,1) with 53-bit resolution*/
|
|
double genrand_res53(void)
|
|
{
|
|
unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6;
|
|
return(a*67108864.0+b)*(1.0/9007199254740992.0);
|
|
}
|
|
/* These real versions are due to Isaku Wada, 2002/01/09 added */
|
|
#endif /* dead_code */
|