[270] | 1 | /*
|
---|
| 2 | ** mt19937ar.c - MT Random functions
|
---|
| 3 | **
|
---|
| 4 | ** See Copyright Notice in mruby.h
|
---|
| 5 | */
|
---|
| 6 |
|
---|
| 7 | #include "mruby.h"
|
---|
| 8 | #include "mt19937ar.h"
|
---|
| 9 |
|
---|
| 10 | /* Period parameters */
|
---|
| 11 | /* #define N 624 */
|
---|
| 12 | #define M 397
|
---|
| 13 | #define MATRIX_A 0x9908b0dfUL /* constant vector a */
|
---|
| 14 | #define UPPER_MASK 0x80000000UL /* most significant w-r bits */
|
---|
| 15 | #define LOWER_MASK 0x7fffffffUL /* least significant r bits */
|
---|
| 16 |
|
---|
| 17 | #if 0 /* dead_code */
|
---|
| 18 | static unsigned long mt[N]; /* the array for the state vector */
|
---|
| 19 | static int mti=N+1; /* mti==N+1 means mt[N] is not initialized */
|
---|
| 20 | #endif /* dead_code */
|
---|
| 21 |
|
---|
| 22 | void mrb_random_init_genrand(mt_state *t, unsigned long s)
|
---|
| 23 | {
|
---|
| 24 | t->mt[0]= s & 0xffffffffUL;
|
---|
| 25 | for (t->mti=1; t->mti<N; t->mti++) {
|
---|
| 26 | t->mt[t->mti] =
|
---|
| 27 | (1812433253UL * (t->mt[t->mti-1] ^ (t->mt[t->mti-1] >> 30)) + t->mti);
|
---|
| 28 | t->mt[t->mti] &= 0xffffffffUL;
|
---|
| 29 | }
|
---|
| 30 | }
|
---|
| 31 |
|
---|
| 32 | unsigned long mrb_random_genrand_int32(mt_state *t)
|
---|
| 33 | {
|
---|
| 34 | unsigned long y;
|
---|
| 35 | static const unsigned long mag01[2]={0x0UL, MATRIX_A};
|
---|
| 36 | /* mag01[x] = x * MATRIX_A for x=0,1 */
|
---|
| 37 |
|
---|
| 38 | if (t->mti >= N) { /* generate N words at one time */
|
---|
| 39 | int kk;
|
---|
| 40 |
|
---|
| 41 | if (t->mti == N+1) /* if init_genrand() has not been called, */
|
---|
| 42 | mrb_random_init_genrand(t, 5489UL); /* a default initial seed is used */
|
---|
| 43 |
|
---|
| 44 | for (kk=0;kk<N-M;kk++) {
|
---|
| 45 | y = (t->mt[kk]&UPPER_MASK)|(t->mt[kk+1]&LOWER_MASK);
|
---|
| 46 | t->mt[kk] = t->mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
|
---|
| 47 | }
|
---|
| 48 | for (;kk<N-1;kk++) {
|
---|
| 49 | y = (t->mt[kk]&UPPER_MASK)|(t->mt[kk+1]&LOWER_MASK);
|
---|
| 50 | t->mt[kk] = t->mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
|
---|
| 51 | }
|
---|
| 52 | y = (t->mt[N-1]&UPPER_MASK)|(t->mt[0]&LOWER_MASK);
|
---|
| 53 | t->mt[N-1] = t->mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
|
---|
| 54 |
|
---|
| 55 | t->mti = 0;
|
---|
| 56 | }
|
---|
| 57 |
|
---|
| 58 | y = t->mt[t->mti++];
|
---|
| 59 |
|
---|
| 60 | /* Tempering */
|
---|
| 61 | y ^= (y >> 11);
|
---|
| 62 | y ^= (y << 7) & 0x9d2c5680UL;
|
---|
| 63 | y ^= (y << 15) & 0xefc60000UL;
|
---|
| 64 | y ^= (y >> 18);
|
---|
| 65 |
|
---|
| 66 | t->gen.int_ = y;
|
---|
| 67 |
|
---|
| 68 | return y;
|
---|
| 69 | }
|
---|
| 70 |
|
---|
| 71 | double mrb_random_genrand_real1(mt_state *t)
|
---|
| 72 | {
|
---|
| 73 | mrb_random_genrand_int32(t);
|
---|
| 74 | t->gen.double_ = t->gen.int_*(1.0/4294967295.0);
|
---|
| 75 | return t->gen.double_;
|
---|
| 76 | /* divided by 2^32-1 */
|
---|
| 77 | }
|
---|
| 78 |
|
---|
| 79 | #if 0 /* dead_code */
|
---|
| 80 | /* initializes mt[N] with a seed */
|
---|
| 81 | void init_genrand(unsigned long s)
|
---|
| 82 | {
|
---|
| 83 | mt[0]= s & 0xffffffffUL;
|
---|
| 84 | for (mti=1; mti<N; mti++) {
|
---|
| 85 | mt[mti] =
|
---|
| 86 | (1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);
|
---|
| 87 | /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
|
---|
| 88 | /* In the previous versions, MSBs of the seed affect */
|
---|
| 89 | /* only MSBs of the array mt[]. */
|
---|
| 90 | /* 2002/01/09 modified by Makoto Matsumoto */
|
---|
| 91 | mt[mti] &= 0xffffffffUL;
|
---|
| 92 | /* for >32 bit machines */
|
---|
| 93 | }
|
---|
| 94 | }
|
---|
| 95 |
|
---|
| 96 | /* initialize by an array with array-length */
|
---|
| 97 | /* init_key is the array for initializing keys */
|
---|
| 98 | /* key_length is its length */
|
---|
| 99 | /* slight change for C++, 2004/2/26 */
|
---|
| 100 | void init_by_array(unsigned long init_key[], int key_length)
|
---|
| 101 | {
|
---|
| 102 | int i, j, k;
|
---|
| 103 | init_genrand(19650218UL);
|
---|
| 104 | i=1; j=0;
|
---|
| 105 | k = (N>key_length ? N : key_length);
|
---|
| 106 | for (; k; k--) {
|
---|
| 107 | mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))
|
---|
| 108 | + init_key[j] + j; /* non linear */
|
---|
| 109 | mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
|
---|
| 110 | i++; j++;
|
---|
| 111 | if (i>=N) { mt[0] = mt[N-1]; i=1; }
|
---|
| 112 | if (j>=key_length) j=0;
|
---|
| 113 | }
|
---|
| 114 | for (k=N-1; k; k--) {
|
---|
| 115 | mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))
|
---|
| 116 | - i; /* non linear */
|
---|
| 117 | mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
|
---|
| 118 | i++;
|
---|
| 119 | if (i>=N) { mt[0] = mt[N-1]; i=1; }
|
---|
| 120 | }
|
---|
| 121 |
|
---|
| 122 | mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */
|
---|
| 123 | }
|
---|
| 124 |
|
---|
| 125 | /* generates a random number on [0,0xffffffff]-interval */
|
---|
| 126 | unsigned long genrand_int32(void)
|
---|
| 127 | {
|
---|
| 128 | unsigned long y;
|
---|
| 129 | static const unsigned long mag01[2]={0x0UL, MATRIX_A};
|
---|
| 130 | /* mag01[x] = x * MATRIX_A for x=0,1 */
|
---|
| 131 |
|
---|
| 132 | if (mti >= N) { /* generate N words at one time */
|
---|
| 133 | int kk;
|
---|
| 134 |
|
---|
| 135 | if (mti == N+1) /* if init_genrand() has not been called, */
|
---|
| 136 | init_genrand(5489UL); /* a default initial seed is used */
|
---|
| 137 |
|
---|
| 138 | for (kk=0;kk<N-M;kk++) {
|
---|
| 139 | y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
|
---|
| 140 | mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
|
---|
| 141 | }
|
---|
| 142 | for (;kk<N-1;kk++) {
|
---|
| 143 | y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
|
---|
| 144 | mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
|
---|
| 145 | }
|
---|
| 146 | y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
|
---|
| 147 | mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
|
---|
| 148 |
|
---|
| 149 | mti = 0;
|
---|
| 150 | }
|
---|
| 151 |
|
---|
| 152 | y = mt[mti++];
|
---|
| 153 |
|
---|
| 154 | /* Tempering */
|
---|
| 155 | y ^= (y >> 11);
|
---|
| 156 | y ^= (y << 7) & 0x9d2c5680UL;
|
---|
| 157 | y ^= (y << 15) & 0xefc60000UL;
|
---|
| 158 | y ^= (y >> 18);
|
---|
| 159 |
|
---|
| 160 | return y;
|
---|
| 161 | }
|
---|
| 162 |
|
---|
| 163 | /* generates a random number on [0,0x7fffffff]-interval */
|
---|
| 164 | long genrand_int31(void)
|
---|
| 165 | {
|
---|
| 166 | return (long)(genrand_int32()>>1);
|
---|
| 167 | }
|
---|
| 168 |
|
---|
| 169 | /* generates a random number on [0,1]-real-interval */
|
---|
| 170 | double genrand_real1(void)
|
---|
| 171 | {
|
---|
| 172 | return genrand_int32()*(1.0/4294967295.0);
|
---|
| 173 | /* divided by 2^32-1 */
|
---|
| 174 | }
|
---|
| 175 |
|
---|
| 176 | /* generates a random number on [0,1)-real-interval */
|
---|
| 177 | double genrand_real2(void)
|
---|
| 178 | {
|
---|
| 179 | return genrand_int32()*(1.0/4294967296.0);
|
---|
| 180 | /* divided by 2^32 */
|
---|
| 181 | }
|
---|
| 182 |
|
---|
| 183 | /* generates a random number on (0,1)-real-interval */
|
---|
| 184 | double genrand_real3(void)
|
---|
| 185 | {
|
---|
| 186 | return (((double)genrand_int32()) + 0.5)*(1.0/4294967296.0);
|
---|
| 187 | /* divided by 2^32 */
|
---|
| 188 | }
|
---|
| 189 |
|
---|
| 190 | /* generates a random number on [0,1) with 53-bit resolution*/
|
---|
| 191 | double genrand_res53(void)
|
---|
| 192 | {
|
---|
| 193 | unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6;
|
---|
| 194 | return(a*67108864.0+b)*(1.0/9007199254740992.0);
|
---|
| 195 | }
|
---|
| 196 | /* These real versions are due to Isaku Wada, 2002/01/09 added */
|
---|
| 197 | #endif /* dead_code */
|
---|