aerkefiende
d2902e5c7f
Maybe there is a better solution? git-svn-id: svn://svn.code.sf.net/p/actiongame/code/trunk/ac@5643 e016b1c5-ed68-44aa-a2f7-31cac88cffde
52 lines
1.5 KiB
C++
52 lines
1.5 KiB
C++
#include <time.h>
|
|
#include "crypto_tools.h"
|
|
#include "cube.h"
|
|
|
|
////////////////////////// crypto rand ////////////////////////////////////////
|
|
|
|
#define N (624)
|
|
#define M (397)
|
|
#define K (0x9908B0DFU)
|
|
#define hiBit(u) ((u) & 0x80000000U)
|
|
#define loBit(u) ((u) & 0x00000001U)
|
|
#define loBits(u) ((u) & 0x7FFFFFFFU)
|
|
#define mixBits(u, v) (hiBit(u)|loBits(v))
|
|
|
|
static uint state[N+1];
|
|
static uint *next;
|
|
static int left = -1;
|
|
|
|
void seedMT(uint seed)
|
|
{
|
|
register uint x = (seed | 1U) & 0xFFFFFFFFU, *s = state;
|
|
register int j;
|
|
for(left=0, *s++=x, j=N; --j; *s++ = (x*=69069U) & 0xFFFFFFFFU);
|
|
}
|
|
|
|
uint reloadMT(void)
|
|
{
|
|
register uint *p0=state, *p2=state+2, *pM=state+M, s0, s1;
|
|
register int j;
|
|
if(left < -1) seedMT(time(NULL));
|
|
left=N-1, next=state+1;
|
|
for(s0=state[0], s1=state[1], j=N-M+1; --j; s0=s1, s1=*p2++) *p0++ = *pM++ ^ (mixBits(s0, s1) >> 1) ^ (loBit(s1) ? K : 0U);
|
|
for(pM=state, j=M; --j; s0=s1, s1=*p2++) *p0++ = *pM++ ^ (mixBits(s0, s1) >> 1) ^ (loBit(s1) ? K : 0U);
|
|
s1=state[0], *p0 = *pM ^ (mixBits(s0, s1) >> 1) ^ (loBit(s1) ? K : 0U);
|
|
s1 ^= (s1 >> 11);
|
|
s1 ^= (s1 << 7) & 0x9D2C5680U;
|
|
s1 ^= (s1 << 15) & 0xEFC60000U;
|
|
return(s1 ^ (s1 >> 18));
|
|
}
|
|
|
|
uint randomMT(void)
|
|
{
|
|
uint y;
|
|
if(--left < 0) return(reloadMT());
|
|
y = *next++;
|
|
y ^= (y >> 11);
|
|
y ^= (y << 7) & 0x9D2C5680U;
|
|
y ^= (y << 15) & 0xEFC60000U;
|
|
return(y ^ (y >> 18));
|
|
}
|
|
|