SFMTRand Class Reference

#include <SFMT.h>

Public Member Functions
	SFMTRand ()
void	RandomInit (int seed)
int32_t	IRandom (int32_t min, int32_t max)
uint32_t	URandom (uint32_t min, uint32_t max)
double	Random ()
uint32_t	BRandom ()
void *	operator new (size_t size, std::nothrow_t const &)
void	operator delete (void *ptr, std::nothrow_t const &)
void *	operator new (size_t size)
void	operator delete (void *ptr)
void *	operator new[] (size_t size, std::nothrow_t const &)
void	operator delete[] (void *ptr, std::nothrow_t const &)
void *	operator new[] (size_t size)
void	operator delete[] (void *ptr)

Private Member Functions
void	Init2 ()
void	Generate ()

Private Attributes
__m128i	mask
__m128i	state [SFMT_N]
uint32_t	ix
uint32_t	LastInterval
uint32_t	RLimit

Friends
class	boost::thread_specific_ptr< SFMTRand >

Constructor & Destructor Documentation

SFMTRand::SFMTRand ( )

inline

 {
 LastInterval = 0;
 RandomInit((int)(time(0)));
 }

Here is the call graph for this function:

Member Function Documentation

uint32_t SFMTRand::BRandom ( )

inline

 {
 // Output 32 random bits
 uint32_t y;

 if (ix >= SFMT_N*4) {
 Generate();
 }
 y = ((uint32_t*)state)[ix++];
 return y;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

void SFMTRand::Generate ( )

inlineprivate

 {
 // Fill state array with new random numbers
 int i;
 __m128i r, r1, r2;

 r1 = state[SFMT_N - 2];
 r2 = state[SFMT_N - 1];
 for (i = 0; i < SFMT_N - SFMT_M; i++) {
 r = sfmt_recursion(state[i], state[i + SFMT_M], r1, r2, mask);
 state[i] = r;
 r1 = r2;
 r2 = r;
 }
 for (; i < SFMT_N; i++) {
 r = sfmt_recursion(state[i], state[i + SFMT_M - SFMT_N], r1, r2, mask);
 state[i] = r;
 r1 = r2;
 r2 = r;
 }
 ix = 0;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

void SFMTRand::Init2 ( )

inlineprivate

 {
 // Various initializations and period certification
 uint32_t i, j, temp;
 
 // Initialize mask
 static const uint32_t maskinit[4] = {SFMT_MASK};
 mask = _mm_loadu_si128((__m128i*)maskinit);

 // Period certification
 // Define period certification vector
 static const uint32_t parityvec[4] = {SFMT_PARITY};

 // Check if parityvec & state[0] has odd parity
 temp = 0;
 for (i = 0; i < 4; i++)
 temp ^= parityvec[i] & ((uint32_t*)state)[i];

 for (i = 16; i > 0; i >>= 1) temp ^= temp >> i;
 if (!(temp & 1)) {
 // parity is even. Certification failed
 // Find a nonzero bit in period certification vector
 for (i = 0; i < 4; i++) {
 if (parityvec[i]) {
 for (j = 1; j; j <<= 1) {
 if (parityvec[i] & j) {
 // Flip the corresponding bit in state[0] to change parity
 ((uint32_t*)state)[i] ^= j;
 // Done. Exit i and j loops
 i = 5; break;
 }
 }
 }
 }
 }

 // Generate first random numbers and set ix = 0
 Generate();
 }

Here is the call graph for this function:

Here is the caller graph for this function:

int32_t SFMTRand::IRandom ( int32_t  min, int32_t  max  )

inline

 {
 // Output random integer in the interval min <= x <= max
 // Slightly inaccurate if (max-min+1) is not a power of 2
 if (max <= min) {
 if (max == min) return min; else return 0x80000000;
 }
 // Assume 64 bit integers supported. Use multiply and shift method
 uint32_t interval; // Length of interval
 uint64_t longran; // Random bits * interval
 uint32_t iran; // Longran / 2^32

 interval = (uint32_t)(max - min + 1);
 longran = (uint64_t)BRandom() * interval;
 iran = (uint32_t)(longran >> 32);
 // Convert back to signed and return result
 return (int32_t)iran + min;
 }

Here is the call graph for this function:

void SFMTRand::operator delete ( void *  ptr, std::nothrow_t const &    )

inline

 {
 _mm_free(ptr);
 }

void SFMTRand::operator delete ( void *  ptr )

inline

 {
 _mm_free(ptr);
 }

void SFMTRand::operator delete[] ( void *  ptr, std::nothrow_t const &    )

inline

 {
 _mm_free(ptr);
 }

void SFMTRand::operator delete[] ( void *  ptr )

inline

 {
 _mm_free(ptr);
 }

void* SFMTRand::operator new ( size_t  size, std::nothrow_t const &    )

inline

 {
 return _mm_malloc(size, 16);
 }

void* SFMTRand::operator new ( size_t  size )

inline

 {
 return _mm_malloc(size, 16);
 }

void* SFMTRand::operator new[] ( size_t  size, std::nothrow_t const &    )

inline

 {
 return _mm_malloc(size, 16);
 }

void* SFMTRand::operator new[] ( size_t  size )

inline

 {
 return _mm_malloc(size, 16);
 }

double SFMTRand::Random ( )

inline

 {
 // Output random floating point number
 if (ix >= SFMT_N*4-1) {
 // Make sure we have at least two 32-bit numbers
 Generate();
 }
 uint64_t r = *(uint64_t*)((uint32_t*)state+ix);
 ix += 2;
 // 52 bits resolution for compatibility with assembly version:
 return (int64_t)(r >> 12) * (1./(67108864.0*67108864.0));
 }

Here is the call graph for this function:

Here is the caller graph for this function:

void SFMTRand::RandomInit ( int  seed )

inline

 {
 // Re-seed
 uint32_t i; // Loop counter
 uint32_t y = seed; // Temporary
 uint32_t statesize = SFMT_N*4; // Size of state vector

 // Fill state vector with random numbers from seed
 uint32_t* s = (uint32_t*)&state;
 s[0] = y;
 const uint32_t factor = 1812433253U;// Multiplication factor

 for (i = 1; i < statesize; i++) {
 y = factor * (y ^ (y >> 30)) + i;
 ((uint32_t*)state)[i] = y;
 }

 // Further initialization and period certification
 Init2();
 }

Here is the call graph for this function:

Here is the caller graph for this function:

uint32_t SFMTRand::URandom ( uint32_t  min, uint32_t  max  )

inline

 {
 // Output random integer in the interval min <= x <= max
 // Slightly inaccurate if (max-min+1) is not a power of 2
 if (max <= min) {
 if (max == min) return min; else return 0;
 }
 // Assume 64 bit integers supported. Use multiply and shift method
 uint32_t interval; // Length of interval
 uint64_t longran; // Random bits * interval
 uint32_t iran; // Longran / 2^32

 interval = (uint32_t)(max - min + 1);
 longran = (uint64_t)BRandom() * interval;
 iran = (uint32_t)(longran >> 32);
 // Convert back to signed and return result
 return iran + min;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

Friends And Related Function Documentation

friend class boost::thread_specific_ptr< SFMTRand >

friend

Member Data Documentation

uint32_t SFMTRand::ix

private

uint32_t SFMTRand::LastInterval

private

__m128i SFMTRand::mask

private

uint32_t SFMTRand::RLimit

private

__m128i SFMTRand::state[SFMT_N]

private

---

The documentation for this class was generated from the following file:

• dep/SFMT/SFMT.h