SIMD oriented Fast Mersenne Twister(SFMT) pseudorandom number generator with jump function. This file includes common functions used in random number generation and jump. More...
#include "SFMT.h"Go to the source code of this file.
Macros | |
| #define | SFMT_COMMON_H |
Functions | |
| static void | do_recursion (w128_t *r, w128_t *a, w128_t *b, w128_t *c, w128_t *d) |
| static void | rshift128 (w128_t *out, w128_t const *in, int shift) |
| static void | lshift128 (w128_t *out, w128_t const *in, int shift) |
SIMD oriented Fast Mersenne Twister(SFMT) pseudorandom number generator with jump function. This file includes common functions used in random number generation and jump.
Copyright (C) 2006, 2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima University. Copyright (C) 2012 Mutsuo Saito, Makoto Matsumoto, Hiroshima University and The University of Tokyo. All rights reserved.
The 3-clause BSD License is applied to this software, see LICENSE.txt
| #define SFMT_COMMON_H |
This function represents the recursion formula.
| r | output |
| a | a 128-bit part of the internal state array |
| b | a 128-bit part of the internal state array |
| c | a 128-bit part of the internal state array |
| d | a 128-bit part of the internal state array |
This function simulates SIMD 128-bit left shift by the standard C. The 128-bit integer given in in is shifted by (shift * 8) bits. This function simulates the LITTLE ENDIAN SIMD.
| out | the output of this function |
| in | the 128-bit data to be shifted |
| shift | the shift value |
This function simulates SIMD 128-bit right shift by the standard C. The 128-bit integer given in in is shifted by (shift * 8) bits. This function simulates the LITTLE ENDIAN SIMD.
| out | the output of this function |
| in | the 128-bit data to be shifted |
| shift | the shift value |