69 #include <sys/types.h>
76 #if defined(HAVE_SYS_TIME_H)
81 # if !defined(_WIN32_WINNT) || _WIN32_WINNT < 0x0400
83 # define _WIN32_WINNT 0x400
84 # undef __WINCRYPT_H__
94 #define MATRIX_A 0x9908b0dfU
95 #define UMASK 0x80000000U
96 #define LMASK 0x7fffffffU
97 #define MIXBITS(u,v) ( ((u) & UMASK) | ((v) & LMASK) )
98 #define TWIST(u,v) ((MIXBITS((u),(v)) >> 1) ^ ((v)&1U ? MATRIX_A : 0U))
109 #define genrand_initialized(mt) ((mt)->next != 0)
110 #define uninit_genrand(mt) ((mt)->next = 0)
117 mt->
state[0] = s & 0xffffffff
U;
118 for (j=1; j<
N; j++) {
119 mt->
state[j] = (1812433253U * (mt->
state[j-1] ^ (mt->
state[j-1] >> 30)) + j);
124 mt->
state[j] &= 0xffffffff;
140 k = (
N>key_length ?
N : key_length);
147 if (j>=key_length) j=0;
149 for (k=
N-1; k; k--) {
157 mt->
state[0] = 0x80000000
U;
163 unsigned int *
p = mt->
state;
169 for (j=
N-
M+1; --j; p++)
170 *p = p[
M] ^
TWIST(p[0], p[1]);
173 *p = p[
M-
N] ^
TWIST(p[0], p[1]);
190 y ^= (y << 7) & 0x9d2c5680;
191 y ^= (y << 15) & 0xefc60000;
203 return(a*67108864.0+b)*(1.0/9007199254740992.0);
228 #define DEFAULT_SEED_CNT 4
238 struct MT *mt = &r->
mt;
265 #define BDIGITS(x) (RBIGNUM_DIGITS(x))
266 #define BITSPERDIG (SIZEOF_BDIGITS*CHAR_BIT)
267 #define BIGRAD ((BDIGIT_DBL)1 << BITSPERDIG)
268 #define DIGSPERINT (SIZEOF_INT/SIZEOF_BDIGITS)
269 #define BIGUP(x) ((BDIGIT_DBL)(x) << BITSPERDIG)
270 #define BIGDN(x) RSHIFT((x),BITSPERDIG)
271 #define BIGLO(x) ((BDIGIT)((x) & (BIGRAD-1)))
272 #define BDIGMAX ((BDIGIT)-1)
274 #define roomof(n, m) (int)(((n)+(m)-1) / (m))
275 #define numberof(array) (int)(sizeof(array) / sizeof((array)[0]))
276 #define SIZEOF_INT32 (31/CHAR_BIT + 1)
303 #if CHAR_BIT * SIZEOF_LONG > 64
310 #if 64 % BITSPERDIG == 0
326 return ldexp(r, -53);
345 if (ptr != &default_rand)
402 switch (
TYPE(seed)) {
407 fixnum_seed = -fixnum_seed;
408 buf[0] = (
unsigned int)(fixnum_seed & 0xffffffff);
409 #if SIZEOF_LONG > SIZEOF_INT32
410 if ((
long)(int32_t)fixnum_seed != fixnum_seed) {
411 if ((buf[1] = (
unsigned int)(fixnum_seed >> 32)) != 0) ++len;
427 memset(buf, 0, len *
sizeof(*buf));
429 for (i = (
int)(blen-1); 0 <=
i; i--) {
431 #if SIZEOF_BDIGITS < SIZEOF_INT32
435 if (!len && buf[j]) len = j;
451 if (buf != buf0)
xfree(buf);
487 #define DEFAULT_SEED_LEN (DEFAULT_SEED_CNT * (int)sizeof(int))
489 #if defined(S_ISCHR) && !defined(DOSISH)
490 # define USE_DEV_URANDOM 1
492 # define USE_DEV_URANDOM 0
503 #elif defined(_WIN32)
510 if ((fd = open(
"/dev/urandom", O_RDONLY
519 if (
fstat(fd, &statbuf) == 0 &&
S_ISCHR(statbuf.st_mode)) {
526 #elif defined(_WIN32)
527 if (CryptAcquireContext(&prov,
NULL,
NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT)) {
529 CryptReleaseContext(prov, 0);
535 seed[1] ^= (
unsigned int)tv.
tv_sec;
536 #
if SIZEOF_TIME_T > SIZEOF_INT
537 seed[0] ^= (
unsigned int)((time_t)tv.
tv_sec >> SIZEOF_INT *
CHAR_BIT);
539 seed[2] ^= getpid() ^ (n++ << 16);
540 seed[3] ^= (
unsigned int)(
VALUE)&seed;
541 #if SIZEOF_VOIDP > SIZEOF_INT
542 seed[2] ^= (
unsigned int)((
VALUE)&seed >> SIZEOF_INT *
CHAR_BIT);
562 #if SIZEOF_INT32 / SIZEOF_BDIGITS > 1
563 digits[len-2] <= 1 && digits[len-1] == 0
602 struct MT *mt = &rnd1->
mt;
617 unsigned int x = mt->
state[
i];
618 #if SIZEOF_BDIGITS < SIZEOF_INT32
680 struct MT *mt = &rnd->
mt;
701 mt->
state[0] = (
unsigned int)x;
702 #if SIZEOF_LONG / SIZEOF_INT >= 2
705 #if SIZEOF_LONG / SIZEOF_INT >= 3
708 #if SIZEOF_LONG / SIZEOF_INT >= 4
720 #if SIZEOF_BDIGITS < SIZEOF_INT
730 }
while (--len % DIGSPERINT);
743 # elif SIZEOF_BDIGITS < SIZEOF_INT
746 }
while (--len % DIGSPERINT);
756 mt->
left = (
unsigned int)x;
815 unsigned long val, mask;
817 if (!limit)
return 0;
822 if ((mask >> (i * 32)) & 0xffffffff) {
836 unsigned long mask, lim, rnd;
844 #if SIZEOF_BDIGITS == 2
845 # define BIG_GET32(big,i) \
846 (RBIGNUM_DIGITS(big)[(i)*2] | \
847 ((i)*2+1 < RBIGNUM_LEN(big) ? \
848 (RBIGNUM_DIGITS(big)[(i)*2+1] << 16) : \
850 # define BIG_SET32(big,i,d) \
851 ((RBIGNUM_DIGITS(big)[(i)*2] = (d) & 0xffff), \
852 ((i)*2+1 < RBIGNUM_LEN(big) ? \
853 (RBIGNUM_DIGITS(big)[(i)*2+1] = (d) >> 16) : \
857 # define BIG_GET32(big,i) (RBIGNUM_DIGITS(big)[(i)])
858 # define BIG_SET32(big,i,d) (RBIGNUM_DIGITS(big)[(i)] = (d))
863 for (i = len-1; 0 <=
i; i--) {
865 mask = mask ? 0xffffffff :
make_mask(lim);
900 #if SIZEOF_LONG * CHAR_BIT > 32
902 #elif defined HAVE_LONG_LONG
903 VALUE lim = ULL2NUM((LONG_LONG)0xffffffff+1);
919 if (d < 0.0 || d >= 1.0) {
977 if (endp) *endp = end;
993 if (!max)
return Qnil;
995 if (restrictive)
return Qnil;
1005 if (restrictive)
return Qnil;
1012 if (max == -1)
return Qnil;
1022 static inline double
1047 if ((max =
FIX2LONG(vmax) - excl) >= 0) {
1048 unsigned long r =
limited_rand(mt, (
unsigned long)max);
1083 return rb_float_new(+(+(+(r - 0.5) * max) * scale) + mid);
1087 else if (max == 0.0 && !excl) {
1148 else if (argc != 1) {
1235 if (argc == 0)
goto zero_arg;
1237 if (
NIL_P(vmax))
goto zero_arg;
1265 #define SIP_HASH_STREAMING 0
1266 #define sip_hash24 ruby_sip_hash24
1267 #if !defined _WIN32 && !defined BYTE_ORDER
1268 # ifdef WORDS_BIGENDIAN
1269 # define BYTE_ORDER BIG_ENDIAN
1271 # define BYTE_ORDER LITTLE_ENDIAN
1273 # ifndef LITTLE_ENDIAN
1274 # define LITTLE_ENDIAN 1234
1277 # define BIG_ENDIAN 4321
1304 struct MT *mt = &r->
mt;
1309 #if SIZEOF_ST_INDEX_T*CHAR_BIT > 4*8
1313 #if SIZEOF_ST_INDEX_T*CHAR_BIT > 8*8
1317 #if SIZEOF_ST_INDEX_T*CHAR_BIT > 12*8
1339 #ifdef HAVE_UINT64_T