#include <windows.h>
#include <stdio.h>
void init_by_array(unsigned long init_key[], int key_length);
unsigned long genrand_int32(void);
constexpr int N = (1024 * 1024 * 128);
constexpr int N2 = N / sizeof(int);
static_assert(N % sizeof(int) == 0);
static_assert(sizeof(int) == sizeof(LONG));
static int buff[N2];
int main(int argc, char **argv) {
HANDLE h;
long unsigned int actualWrite;
volatile LONG dmy;
if (argc != 2) {
fprintf(stderr, "usage: %s <file>\n", argv[0]);
exit(-1);
}
/* srand() */
unsigned long init[4]={0x314, 0x159, 0x265, 0x358}, length=4;
init_by_array(init, length);
int n = 0;
h = CreateFile(argv[1], GENERIC_WRITE, 0, 0, OPEN_ALWAYS, 0, 0);
if (h != INVALID_HANDLE_VALUE) {
for (;;) {
dmy = 0;
SetFilePointer(h, 0, (LONG * volatile)&dmy, FILE_END);
for (int i = 0; i < N2; i++) {
buff[i] = genrand_int32();
}
WriteFile(h, buff, N, &actualWrite, 0);
if (actualWrite != N) {
printf("actual write bytes: %d, exit.\n", actualWrite);
break;
}
FlushFileBuffers(h);
printf("<%d>\n", n++);
}
CloseHandle(h);
} else {
printf("cannot open the file %s\n", argv[1]);
exit(1);
}
printf("stoped.\n");
return 0;
}
/*
A C-program for MT19937, with initialization improved 2002/1/26.
Coded by Takuji Nishimura and Makoto Matsumoto.
*/
#include <stdio.h>
/* Period parameters */
#define N 624
#define M 397
#define MATRIX_A 0x9908b0dfUL /* constant vector a */
#define UPPER_MASK 0x80000000UL /* most significant w-r bits */
#define LOWER_MASK 0x7fffffffUL /* least significant r bits */
static unsigned long mt[N]; /* the array for the state vector */
static int mti=N+1; /* mti==N+1 means mt[N] is not initialized */
void init_genrand(unsigned long s)
{
mt[0]= s & 0xffffffffUL;
for (mti=1; mti<N; mti++) {
mt[mti] =
(1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);
/* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
/* In the previous versions, MSBs of the seed affect */
/* only MSBs of the array mt[]. */
/* 2002/01/09 modified by Makoto Matsumoto */
mt[mti] &= 0xffffffffUL;
/* for >32 bit machines */
}
}
void init_by_array(unsigned long init_key[], int key_length)
{
int i, j, k;
init_genrand(19650218UL);
i=1; j=0;
k = (N>key_length ? N : key_length);
for (; k; k--) {
mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))
+ init_key[j] + j;
mt[i] &= 0xffffffffUL;
i++; j++;
if (i>=N) { mt[0] = mt[N-1]; i=1; }
if (j>=key_length) j=0;
}
for (k=N-1; k; k--) {
mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))
- i;
mt[i] &= 0xffffffffUL;
i++;
if (i>=N) { mt[0] = mt[N-1]; i=1; }
}
mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */
}
/* generates a random number on [0,0xffffffff]-interval */
unsigned long genrand_int32(void)
{
unsigned long y;
static unsigned long mag01[2]={0x0UL, MATRIX_A};
/* mag01[x] = x * MATRIX_A for x=0,1 */
if (mti >= N) { /* generate N words at one time */
int kk;
if (mti == N+1) /* if init_genrand() has not been called, */
init_genrand(5489UL); /* a default initial seed is used */
for (kk=0;kk<N-M;kk++) {
y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
}
for (;kk<N-1;kk++) {
y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
}
y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
mti = 0;
}
y = mt[mti++];
/* Tempering */
y ^= (y >> 11);
y ^= (y << 7) & 0x9d2c5680UL;
y ^= (y << 15) & 0xefc60000UL;
y ^= (y >> 18);
return y;
}
/* end */