-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathGenerator.h
329 lines (242 loc) · 6.51 KB
/
Generator.h
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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
/*
* Generator.h
*
* Created on: Mar 8, 2022
* Author: tugrul
*/
#ifndef GENERATOR_H_
#define GENERATOR_H_
#include<memory>
namespace oofrng
{
template<int LANES=64>
class Generator
{
public:
Generator()
{
alignedSeedBuf = std::make_shared<AlignedSeedBuffer>();
}
const uint32_t generate1()
{
return rnd(alignedSeedBuf->seed);
}
const uint32_t generate1(const uint32_t limit)
{
return rnd(alignedSeedBuf->seed,limit);
}
const float generate1Float()
{
return ((float)rnd(alignedSeedBuf->seed))*alignedSeedBuf->multiplier;
}
const float generate1Float(const float limit)
{
return ((float)rnd(alignedSeedBuf->seed))*alignedSeedBuf->multiplier*limit;
}
// fills array of length n with values between 0 and max(2^32-1)
void generate(uint32_t * const __restrict__ out, const size_t n)
{
const size_t nL = n-n%LANES;
for(size_t i=0;i<nL;i+=LANES)
{
rndL(alignedSeedBuf->ptrL,out+i);
}
for(size_t i=nL;i<n;i++)
{
out[i]=rnd(alignedSeedBuf->seed);
}
}
// fills array of length n with values in range [0,limit)
void generate(uint32_t * const __restrict__ out, const size_t n, const uint32_t limit)
{
const size_t nL = n-n%LANES;
for(size_t i=0;i<nL;i+=LANES)
{
rndL(alignedSeedBuf->ptrL,out+i,limit);
}
for(size_t i=nL;i<n;i++)
{
out[i]=rnd(alignedSeedBuf->seed,limit);
}
}
// generate [0,1)
void generate(float * const __restrict__ out, const size_t n)
{
const size_t nL = n-n%LANES;
for(size_t i=0;i<nL;i+=LANES)
{
rndL(alignedSeedBuf->ptrL,out+i);
}
for(size_t i=nL;i<n;i++)
{
out[i]=rnd(alignedSeedBuf->seed);
}
}
// generate [0,limit)
void generate(float * const __restrict__ out, const size_t n, const float limit)
{
const size_t nL = n-n%LANES;
for(size_t i=0;i<nL;i+=LANES)
{
rndL(alignedSeedBuf->ptrL,out+i,limit);
}
for(size_t i=nL;i<n;i++)
{
out[i]=rnd(alignedSeedBuf->seed,limit);
}
}
private:
static uint32_t* computeAlignment(uint32_t* ptr)
{
uint32_t* ptrLTmp = ptr;
while(((size_t)ptrLTmp)%4096 != 0)
{
ptrLTmp++;
}
return ptrLTmp;
}
class AlignedSeedBuffer
{
public:
AlignedSeedBuffer():ptrL(computeAlignment(seedL)),uint32_tmax(((uint32_t)0)-1),multiplier(1.0/uint32_tmax)
{
for(size_t i=0;i<LANES;i++)
{
ptrL[i]=i+1;
}
seed=LANES+1;
}
uint32_t seedL[LANES+4096];
uint32_t seed;
uint32_t* const __restrict__ ptrL;
const uint32_t uint32_tmax;
const float multiplier;
};
std::shared_ptr<AlignedSeedBuffer> alignedSeedBuf;
// generate random number in range [0,max)
const uint32_t rnd(uint32_t& seed)
{
// Thomas Wang's invention
seed = (seed ^ 61) ^ (seed >> 16);
seed *= 9;
seed = seed ^ (seed >> 4);
seed *= 0x27d4eb2d;
seed = seed ^ (seed >> 15);
return seed;
}
// generate random number in range [0,limit)
const uint32_t rnd(uint32_t& seed, const uint32_t limit)
{
// Thomas Wang's invention
seed = (seed ^ 61) ^ (seed >> 16);
seed *= 9;
seed = seed ^ (seed >> 4);
seed *= 0x27d4eb2d;
seed = seed ^ (seed >> 15);
return seed%limit;
}
// generate [0,max)
inline
void rndL(uint32_t * const __restrict__ seed, uint32_t * const __restrict__ out)
{
for(int i=0;i<LANES;i+=2)
{
const uint32_t sd = seed[i];
const uint32_t sd_ = seed[i+1];
const uint32_t sd2 = (sd ^ 61) ^ (sd >> 16);
const uint32_t sd2_ = (sd_ ^ 61) ^ (sd_ >> 16);
const uint32_t sd3 = sd2*9;
const uint32_t sd3_ = sd2_*9;
const uint32_t sd4 = sd3 ^ (sd3 >> 4);
const uint32_t sd4_ = sd3_ ^ (sd3_ >> 4);
const uint32_t sd5 = sd4*0x27d4eb2d;
const uint32_t sd5_ = sd4_*0x27d4eb2d;
const uint32_t sd6 = sd5 ^ (sd5 >> 15);
const uint32_t sd6_ = sd5_ ^ (sd5_ >> 15);
out[i]=sd6;
out[i+1]=sd6_;
seed[i]=sd6;
seed[i+1]=sd6_;
}
}
// generate [0,limit)
inline
void rndL(uint32_t * const __restrict__ seed, uint32_t * const __restrict__ out, const uint32_t limit)
{
for(int i=0;i<LANES;i+=2)
{
const uint32_t sd = seed[i];
const uint32_t sd_ = seed[i+1];
const uint32_t sd2 = (sd ^ 61) ^ (sd >> 16);
const uint32_t sd2_ = (sd_ ^ 61) ^ (sd_ >> 16);
const uint32_t sd3 = sd2*9;
const uint32_t sd3_ = sd2_*9;
const uint32_t sd4 = sd3 ^ (sd3 >> 4);
const uint32_t sd4_ = sd3_ ^ (sd3_ >> 4);
const uint32_t sd5 = sd4*0x27d4eb2d;
const uint32_t sd5_ = sd4_*0x27d4eb2d;
const uint32_t sd6 = sd5 ^ (sd5 >> 15);
const uint32_t sd6_ = sd5_ ^ (sd5_ >> 15);
out[i]=sd6%limit;
out[i+1]=sd6_%limit;
seed[i]=sd6;
seed[i+1]=sd6_;
}
}
// generate [0,1)
inline
void rndL(uint32_t * const __restrict__ seed, float * const __restrict__ out)
{
const float mult = alignedSeedBuf->multiplier;
for(int i=0;i<LANES;i+=2)
{
const uint32_t sd = seed[i];
const uint32_t sd_ = seed[i+1];
const uint32_t sd2 = (sd ^ 61) ^ (sd >> 16);
const uint32_t sd2_ = (sd_ ^ 61) ^ (sd_ >> 16);
const uint32_t sd3 = sd2*9;
const uint32_t sd3_ = sd2_*9;
const uint32_t sd4 = sd3 ^ (sd3 >> 4);
const uint32_t sd4_ = sd3_ ^ (sd3_ >> 4);
const uint32_t sd5 = sd4*0x27d4eb2d;
const uint32_t sd5_ = sd4_*0x27d4eb2d;
const uint32_t sd6 = sd5 ^ (sd5 >> 15);
const uint32_t sd6_ = sd5_ ^ (sd5_ >> 15);
const float sd7 = sd6*mult;
const float sd7_ = sd6_*mult;
out[i]=sd7;
out[i+1]=sd7_;
seed[i]=sd6;
seed[i+1]=sd6_;
}
}
// generate [0,limit)
inline
void rndL(uint32_t * const __restrict__ seed, float * const __restrict__ out, const float limit)
{
const float mult = alignedSeedBuf->multiplier*limit;
for(int i=0;i<LANES;i+=2)
{
const uint32_t sd = seed[i];
const uint32_t sd_ = seed[i+1];
const uint32_t sd2 = (sd ^ 61) ^ (sd >> 16);
const uint32_t sd2_ = (sd_ ^ 61) ^ (sd_ >> 16);
const uint32_t sd3 = sd2*9;
const uint32_t sd3_ = sd2_*9;
const uint32_t sd4 = sd3 ^ (sd3 >> 4);
const uint32_t sd4_ = sd3_ ^ (sd3_ >> 4);
const uint32_t sd5 = sd4*0x27d4eb2d;
const uint32_t sd5_ = sd4_*0x27d4eb2d;
const uint32_t sd6 = sd5 ^ (sd5 >> 15);
const uint32_t sd6_ = sd5_ ^ (sd5_ >> 15);
const float sd7 = sd6*mult;
const float sd7_ = sd6_*mult;
out[i]=sd7;
out[i+1]=sd7_;
seed[i]=sd6;
seed[i+1]=sd6_;
}
}
};
}
#endif /* GENERATOR_H_ */