-
-
Notifications
You must be signed in to change notification settings - Fork 290
/
core-mwc.c
467 lines (410 loc) · 9.24 KB
/
core-mwc.c
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
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
/*
* Copyright (C) 2013-2021 Canonical, Ltd.
* Copyright (C) 2022-2024 Colin Ian King.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include "stress-ng.h"
#include "core-attribute.h"
#include "core-cpu-cache.h"
#include "core-helper.h"
#include "core-mwc.h"
#if defined(HAVE_SYS_AUXV_H)
#include <sys/auxv.h>
#endif
#if defined(HAVE_UTIME_H)
#include <utime.h>
#endif
/* MWC random number initial seed */
#define STRESS_MWC_SEED_W (521288629UL)
#define STRESS_MWC_SEED_Z (362436069UL)
/* Fast random number generator state */
typedef struct {
uint32_t w;
uint32_t z;
uint32_t n16;
uint32_t saved16;
uint32_t n8;
uint32_t saved8;
uint32_t n1;
uint32_t saved1;
} stress_mwc_t;
static stress_mwc_t mwc = {
STRESS_MWC_SEED_W,
STRESS_MWC_SEED_Z,
0,
0,
0,
0,
0,
0,
};
/*
* mwc_flush()
* reset internal mwc cached values, flush out
*/
static inline void mwc_flush(void)
{
mwc.n16 = 0;
mwc.n8 = 0;
mwc.n1 = 0;
mwc.saved16 = 0;
mwc.saved8 = 0;
mwc.saved1 = 0;
}
#if defined(HAVE_SYS_AUXV_H) && \
defined(HAVE_GETAUXVAL) && \
defined(AT_RANDOM)
#define VAL(ptr, n) (((uint64_t)(*(ptr + n))) << (n << 3))
/*
* stress_aux_random_seed()
* get a fixed random value via getauxval
*/
static uint64_t stress_aux_random_seed(void)
{
const uint8_t *ptr = (const uint8_t *)(uintptr_t)getauxval(AT_RANDOM);
uint64_t val;
if (!ptr)
return 0ULL;
val = VAL(ptr, 0) | VAL(ptr, 1) | VAL(ptr, 2) | VAL(ptr, 3) |
VAL(ptr, 4) | VAL(ptr, 5) | VAL(ptr, 6) | VAL(ptr, 7);
return val;
}
#else
static uint64_t PURE stress_aux_random_seed(void)
{
return 0ULL;
}
#endif
/*
* stress_mwc_reseed()
* dirty mwc reseed, this is expensive as it
* pulls in various system values for the seeding
*/
void stress_mwc_reseed(void)
{
if (g_opt_flags & OPT_FLAGS_SEED) {
uint64_t seed;
if (stress_get_setting("seed", &seed)) {
mwc.z = seed >> 32;
mwc.w = seed & 0xffffffff;
mwc_flush();
return;
} else {
pr_inf("mwc_core: cannot determine seed from --seed option\n");
g_opt_flags &= ~(OPT_FLAGS_SEED);
}
}
if (g_opt_flags & OPT_FLAGS_NO_RAND_SEED) {
mwc.w = STRESS_MWC_SEED_W;
mwc.z = STRESS_MWC_SEED_Z;
} else {
struct timeval tv;
struct rusage r;
double m1, m5, m15;
int i, n;
const uint64_t aux_rnd = stress_aux_random_seed();
const uint64_t id = stress_get_machine_id();
const intptr_t p1 = (intptr_t)&mwc;
const intptr_t p2 = (intptr_t)&tv;
mwc.z = aux_rnd >> 32;
mwc.w = aux_rnd & 0xffffffff;
if (gettimeofday(&tv, NULL) == 0)
mwc.z ^= (uint64_t)tv.tv_sec ^ (uint64_t)tv.tv_usec;
mwc.z += ~(p1 - p2);
mwc.w += (uint64_t)getpid() ^ (uint64_t)getppid() << 12;
if (stress_get_load_avg(&m1, &m5, &m15) == 0) {
mwc.z += (uint64_t)(128.0 * (m1 + m15));
mwc.w += (uint64_t)(256.0 * (m5));
}
if (getrusage(RUSAGE_SELF, &r) == 0) {
mwc.z += r.ru_utime.tv_usec;
mwc.w += r.ru_utime.tv_sec;
}
mwc.z ^= stress_get_cpu();
mwc.w ^= stress_get_phys_mem_size();
mwc.z ^= (uint32_t)(id & 0xffffffffULL);
mwc.w ^= (uint32_t)((id >> 32) & 0xffffffffULL);
n = (int)mwc.z % 1733;
for (i = 0; i < n; i++) {
(void)stress_mwc32();
}
}
mwc_flush();
}
/*
* stress_mwc_set_seed()
* set mwc seeds
*/
void stress_mwc_set_seed(const uint32_t w, const uint32_t z)
{
mwc.w = w;
mwc.z = z;
mwc_flush();
}
/*
* stress_mwc_get_seed()
* get mwc seeds
*/
void stress_mwc_get_seed(uint32_t *w, uint32_t *z)
{
*w = mwc.w;
*z = mwc.z;
}
/*
* stress_mwc_seed()
* set default mwc seed
*/
void stress_mwc_seed(void)
{
stress_mwc_set_seed(STRESS_MWC_SEED_W, STRESS_MWC_SEED_Z);
}
/*
* stress_mwc32()
* Multiply-with-carry random numbers
* fast pseudo random number generator, see
* http://www.cse.yorku.ca/~oz/marsaglia-rng.html
*/
inline OPTIMIZE3 uint32_t stress_mwc32(void)
{
mwc.z = 36969 * (mwc.z & 65535) + (mwc.z >> 16);
mwc.w = 18000 * (mwc.w & 65535) + (mwc.w >> 16);
return (mwc.z << 16) + mwc.w;
}
/*
* stress_mwc64()
* get a 64 bit pseudo random number
*/
uint64_t OPTIMIZE3 stress_mwc64(void)
{
return (((uint64_t)stress_mwc32()) << 32) | stress_mwc32();
}
/*
* stress_mwc16()
* get a 16 bit pseudo random number
*/
uint16_t OPTIMIZE3 stress_mwc16(void)
{
if (LIKELY(mwc.n16)) {
mwc.n16--;
mwc.saved16 >>= 16;
} else {
mwc.n16 = 1;
mwc.saved16 = stress_mwc32();
}
return mwc.saved16 & 0xffff;
}
/*
* stress_mwc8()
* get an 8 bit pseudo random number
*/
uint8_t OPTIMIZE3 stress_mwc8(void)
{
if (LIKELY(mwc.n8)) {
mwc.n8--;
mwc.saved8 >>= 8;
} else {
mwc.n8 = 3;
mwc.saved8 = stress_mwc32();
}
return mwc.saved8 & 0xff;
}
/*
* stress_mwc1()
* get an 1 bit pseudo random number
*/
uint8_t OPTIMIZE3 stress_mwc1(void)
{
if (LIKELY(mwc.n1)) {
mwc.n1--;
mwc.saved1 >>= 1;
} else {
mwc.n1 = 31;
mwc.saved1 = stress_mwc32();
}
return mwc.saved1 & 0x1;
}
#if !defined(HAVE_FAST_MODULO_REDUCTION)
/*
* stress_mwc8mask()
* generate a mask large enough for 8 bit val
*/
static inline ALWAYS_INLINE OPTIMIZE3 uint8_t stress_mwc8mask(const uint8_t val)
{
register uint8_t v = val;
v |= (v >> 1);
v |= (v >> 2);
v |= (v >> 4);
return v;
}
/*
* stress_mwc8modn()
* see https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/
* return 8 bit non-modulo biased value 1..max (inclusive)
*/
uint8_t OPTIMIZE3 stress_mwc8modn(const uint8_t max)
{
register uint8_t mask, val;
if (UNLIKELY(max < 2))
return 0;
mask = stress_mwc8mask(max);
do {
val = stress_mwc8() & mask;
} while (val >= max);
return val;
}
/*
* stress_mwc16mask()
* generate a mask large enough for 16 bit val
*/
static inline ALWAYS_INLINE OPTIMIZE3 uint16_t stress_mwc16mask(const uint16_t val)
{
register uint16_t v = val;
v |= (v >> 1);
v |= (v >> 2);
v |= (v >> 4);
v |= (v >> 8);
return v;
}
/*
* stress_mwc16modn()
* return 16 bit non-modulo biased value 1..max (inclusive)
* where max is most probably not a power of 2
*/
uint16_t OPTIMIZE3 stress_mwc16modn(const uint16_t max)
{
register uint16_t mask, val;
if (UNLIKELY(max < 2))
return 0;
mask = stress_mwc16mask(max);
do {
val = stress_mwc16() & mask;
} while (val >= max);
return val;
}
/*
* stress_mwc32mask()
* generate a mask large enough for 32 bit val
*/
static inline ALWAYS_INLINE OPTIMIZE3 uint32_t stress_mwc32mask(const uint32_t val)
{
register uint32_t v = val;
v |= (v >> 1);
v |= (v >> 2);
v |= (v >> 4);
v |= (v >> 8);
v |= (v >> 16);
return v;
}
/*
* stress_mwc32modn()
* return 32 bit non-modulo biased value 1..max (inclusive)
* with no non-zero max check
*/
uint32_t OPTIMIZE3 stress_mwc32modn(const uint32_t max)
{
register uint32_t mask, val;
if (UNLIKELY(max < 2))
return 0;
mask = stress_mwc32mask(max);
do {
val = stress_mwc32() & mask;
} while (val >= max);
return val;
}
#endif
#if !defined(HAVE_FAST_MODULO_REDUCTION) || \
!defined(HAVE_INT128_T)
/*
* stress_mwc64mask()
* generate a mask large enough for 64 bit val
*/
static inline ALWAYS_INLINE OPTIMIZE3 uint64_t stress_mwc64mask(const uint64_t val)
{
register uint64_t v = val;
v |= (v >> 1);
v |= (v >> 2);
v |= (v >> 4);
v |= (v >> 8);
v |= (v >> 16);
v |= (v >> 32);
return v;
}
/*
* stress_mwc64modn()
* return 64 bit non-modulo biased value 1..max (inclusive)
* with no non-zero max check
*/
uint64_t OPTIMIZE3 stress_mwc64modn(const uint64_t max)
{
register uint64_t mask, val;
if (UNLIKELY(max < 2))
return 0;
mask = stress_mwc64mask(max);
do {
val = stress_mwc64() & mask;
} while (val >= max);
return val;
}
#endif
/*
* stress_rndbuf()
* fill buffer with pseudorandom bytes
*/
OPTIMIZE3 void stress_rndbuf(void *buf, const size_t len)
{
register char *ptr = (char *)buf;
register const char *end = ptr + len;
while (ptr < end)
*ptr++ = stress_mwc8();
}
/*
* stress_rndstr()
* generate pseudorandom string
*/
OPTIMIZE3 void stress_rndstr(char *str, const size_t len)
{
/*
* base64url alphabet.
* Be careful if expanding this alphabet, some of this function's users
* use it to generate random filenames.
*/
static const char alphabet[64] =
"ABCDEFGHIJKLMNOPQRSTUVWXYZ"
"abcdefghijklmnopqrstuvwxyz"
"0123456789-_";
register uint32_t r, mask;
register char *ptr, *ptr_end;
if (len == 0)
return;
shim_builtin_prefetch(alphabet);
ptr = str;
ptr_end = str + len - 1;
mask = 0xc0000000;
r = stress_mwc32() | mask;
while (LIKELY(ptr < ptr_end)) {
/* If we don't have enough random bits in r, get more. */
/*
* Use 6 bits from the 32-bit integer at a time.
* This means 2 bits from each 32-bit integer are wasted.
*/
*(ptr++) = alphabet[r & 0x3F];
r >>= 6;
if (r == 0x3)
r = stress_mwc32() | mask;
}
*ptr = '\0';
}