1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
|
/*
A C-program for MT19937, with initialisation improved 2002/1/26.
Coded by Takuji Nishimura and Makoto Matsumoto.
Before using, initialise the state by using csoundSeedRandMT().
Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The names of its contributors may not be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
Any feedback is very welcome.
http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
*/
#include "csoundCore.h"
/* simple linear congruential generator */
PUBLIC int32_t csoundRand31(int32_t *seedVal)
{
uint64_t tmp1;
uint32_t tmp2;
/* x = (742938285 * x) % 0x7FFFFFFF */
tmp1 = (uint64_t) ((int32_t) (*seedVal) * (int64_t) 742938285);
tmp2 = (uint32_t) tmp1 & (uint32_t) 0x7FFFFFFF;
tmp2 += (uint32_t) (tmp1 >> 31);
tmp2 = (tmp2 & (uint32_t) 0x7FFFFFFF) + (tmp2 >> 31);
(*seedVal) = (int32_t) tmp2;
return (int32_t) tmp2;
}
/* Period parameters */
#define N (624)
#define M (397)
#define MATRIX_A 0x9908B0DFU /* constant vector a */
#define UPPER_MASK 0x80000000U /* most significant w-r bits */
#define LOWER_MASK 0x7FFFFFFFU /* least significant r bits */
static CS_NOINLINE void MT_update_state(uint32_t *mt)
{
/* mag01[x] = x * MATRIX_A for x=0,1 */
const uint32_t mag01[2] = { (uint32_t) 0, (uint32_t) MATRIX_A };
int32_t i;
uint32_t y;
for (i = 0; i < (N - M); i++) {
y = (mt[i] & UPPER_MASK) | (mt[i + 1] & LOWER_MASK);
mt[i] = mt[i + M] ^ (y >> 1) ^ mag01[y & (uint32_t) 1];
}
for ( ; i < (N - 1); i++) {
y = (mt[i] & UPPER_MASK) | (mt[i + 1] & LOWER_MASK);
mt[i] = mt[i + (M - N)] ^ (y >> 1) ^ mag01[y & (uint32_t) 1];
}
y = (mt[N - 1] & UPPER_MASK) | (mt[0] & LOWER_MASK);
mt[N - 1] = mt[M - 1] ^ (y >> 1) ^ mag01[y & (uint32_t) 1];
}
/* generates a random number on [0,0xffffffff]-interval */
PUBLIC uint32_t csoundRandMT(CsoundRandMTState *p)
{
int32_t i = p->mti;
uint32_t y;
if (i >= N) { /* generate N words at one time */
MT_update_state(&(p->mt[0]));
i = 0;
}
y = p->mt[i];
p->mti = i + 1;
/* Tempering */
y ^= (y >> 11);
y ^= (y << 7) & (uint32_t) 0x9D2C5680U;
y ^= (y << 15) & (uint32_t) 0xEFC60000U;
y ^= (y >> 18);
return y;
}
/* initialise by an array with array-length */
/* init_key is the array for initialising keys */
/* key_length is its length */
/* slight change for C++, 2004/2/26 */
PUBLIC void csoundSeedRandMT(CsoundRandMTState *p,
const uint32_t *initKey, uint32_t keyLength)
{
int32_t i, j, k;
uint32_t x;
/* if array is NULL, use length parameter as simple 32 bit seed */
x = (initKey == NULL ? keyLength : (uint32_t) 19650218);
p->mt[0] = x;
for (i = 1; i < N; i++) {
/* 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 */
x = ((uint32_t) 1812433253 * (x ^ (x >> 30)) + (uint32_t) i);
p->mt[i] = x;
}
p->mti = N;
if (initKey == NULL)
return;
i = 0; j = 0;
k = (N > (int32_t) keyLength ? N : (int32_t) keyLength);
for ( ; k; k--) {
x = p->mt[i++];
p->mt[i] = (p->mt[i] ^ ((x ^ (x >> 30)) * (uint32_t) 1664525))
+ initKey[j] + (uint32_t) j; /* non linear */
if (i == (N - 1)) {
p->mt[0] = p->mt[N - 1];
i = 0;
}
if (++j >= (int32_t) keyLength)
j = 0;
}
for (k = (N - 1); k; k--) {
x = p->mt[i++];
p->mt[i] = (p->mt[i] ^ ((x ^ (x >> 30)) * (uint32_t) 1566083941))
- (uint32_t) i; /* non linear */
if (i == (N - 1)) {
p->mt[0] = p->mt[N - 1];
i = 0;
}
}
/* MSB is 1; assuring non-zero initial array */
p->mt[0] = (uint32_t) 0x80000000U;
}
/* called from csoundPreCompile() */
void csound_init_rand(CSOUND *csound)
{
uint32_t tmp;
csound->csRandState = &(csound->randState_);
csound->randSeed1 = 15937;
tmp = (uint32_t) csound->GetRandomSeedFromTime();
while (tmp >= (uint32_t) 0x7FFFFFFE)
tmp -= (uint32_t) 0x7FFFFFFE;
csound->randSeed2 = ((int) tmp + 1);
csound->SeedRandMT(&(csound->randState_), NULL, (uint32_t) 5489);
}
|
