Jens Axboe | 79c94bd | 2010-03-25 23:13:32 +0100 | [diff] [blame] | 1 | /* |
| 2 | This is a maximally equidistributed combined Tausworthe generator |
| 3 | based on code from GNU Scientific Library 1.5 (30 Jun 2004) |
| 4 | |
| 5 | x_n = (s1_n ^ s2_n ^ s3_n) |
| 6 | |
| 7 | s1_{n+1} = (((s1_n & 4294967294) <<12) ^ (((s1_n <<13) ^ s1_n) >>19)) |
| 8 | s2_{n+1} = (((s2_n & 4294967288) << 4) ^ (((s2_n << 2) ^ s2_n) >>25)) |
| 9 | s3_{n+1} = (((s3_n & 4294967280) <<17) ^ (((s3_n << 3) ^ s3_n) >>11)) |
| 10 | |
| 11 | The period of this generator is about 2^88. |
| 12 | |
| 13 | From: P. L'Ecuyer, "Maximally Equidistributed Combined Tausworthe |
| 14 | Generators", Mathematics of Computation, 65, 213 (1996), 203--213. |
| 15 | |
| 16 | This is available on the net from L'Ecuyer's home page, |
| 17 | |
| 18 | http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
| 19 | ftp://ftp.iro.umontreal.ca/pub/simulation/lecuyer/papers/tausme.ps |
| 20 | |
| 21 | There is an erratum in the paper "Tables of Maximally |
| 22 | Equidistributed Combined LFSR Generators", Mathematics of |
| 23 | Computation, 68, 225 (1999), 261--269: |
| 24 | http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
| 25 | |
| 26 | ... the k_j most significant bits of z_j must be non- |
| 27 | zero, for each j. (Note: this restriction also applies to the |
| 28 | computer code given in [4], but was mistakenly not mentioned in |
| 29 | that paper.) |
| 30 | |
| 31 | This affects the seeding procedure by imposing the requirement |
| 32 | s1 > 1, s2 > 7, s3 > 15. |
| 33 | |
| 34 | */ |
| 35 | |
Jens Axboe | 9c42684 | 2012-03-02 21:02:12 +0100 | [diff] [blame^] | 36 | #include <string.h> |
| 37 | #include <assert.h> |
Jens Axboe | 1fbbf72 | 2010-03-25 23:03:18 +0100 | [diff] [blame] | 38 | #include "rand.h" |
Jens Axboe | 637ef8d | 2010-06-21 20:39:38 +0200 | [diff] [blame] | 39 | #include "../hash.h" |
Jens Axboe | 1fbbf72 | 2010-03-25 23:03:18 +0100 | [diff] [blame] | 40 | |
Jens Axboe | 1fbbf72 | 2010-03-25 23:03:18 +0100 | [diff] [blame] | 41 | static inline int __seed(unsigned int x, unsigned int m) |
| 42 | { |
| 43 | return (x < m) ? x + m : x; |
| 44 | } |
| 45 | |
Jens Axboe | 2615cc4 | 2011-03-28 09:35:09 +0200 | [diff] [blame] | 46 | static void __init_rand(struct frand_state *state, unsigned int seed) |
| 47 | { |
| 48 | int cranks = 6; |
| 49 | |
| 50 | #define LCG(x, seed) ((x) * 69069 ^ (seed)) |
| 51 | |
| 52 | state->s1 = __seed(LCG((2^31) + (2^17) + (2^7), seed), 1); |
| 53 | state->s2 = __seed(LCG(state->s1, seed), 7); |
| 54 | state->s3 = __seed(LCG(state->s2, seed), 15); |
| 55 | |
| 56 | while (cranks--) |
| 57 | __rand(state); |
| 58 | } |
| 59 | |
Jens Axboe | 1fbbf72 | 2010-03-25 23:03:18 +0100 | [diff] [blame] | 60 | void init_rand(struct frand_state *state) |
| 61 | { |
Jens Axboe | 2615cc4 | 2011-03-28 09:35:09 +0200 | [diff] [blame] | 62 | __init_rand(state, 1); |
| 63 | } |
Jens Axboe | 1fbbf72 | 2010-03-25 23:03:18 +0100 | [diff] [blame] | 64 | |
Jens Axboe | 2615cc4 | 2011-03-28 09:35:09 +0200 | [diff] [blame] | 65 | void init_rand_seed(struct frand_state *state, unsigned int seed) |
| 66 | { |
| 67 | __init_rand(state, seed); |
Jens Axboe | 1fbbf72 | 2010-03-25 23:03:18 +0100 | [diff] [blame] | 68 | } |
Jens Axboe | 637ef8d | 2010-06-21 20:39:38 +0200 | [diff] [blame] | 69 | |
Jens Axboe | 7d9fb45 | 2011-01-11 22:16:49 +0100 | [diff] [blame] | 70 | void __fill_random_buf(void *buf, unsigned int len, unsigned long seed) |
Jens Axboe | 637ef8d | 2010-06-21 20:39:38 +0200 | [diff] [blame] | 71 | { |
Jens Axboe | 637ef8d | 2010-06-21 20:39:38 +0200 | [diff] [blame] | 72 | long *ptr = buf; |
| 73 | |
Jens Axboe | 7d9fb45 | 2011-01-11 22:16:49 +0100 | [diff] [blame] | 74 | while ((void *) ptr - buf < len) { |
| 75 | *ptr = seed; |
| 76 | ptr++; |
| 77 | seed *= GOLDEN_RATIO_PRIME; |
| 78 | seed >>= 3; |
| 79 | } |
| 80 | } |
| 81 | |
Jens Axboe | 3545a10 | 2011-08-31 15:20:15 -0600 | [diff] [blame] | 82 | unsigned long fill_random_buf(struct frand_state *fs, void *buf, |
| 83 | unsigned int len) |
Jens Axboe | 7d9fb45 | 2011-01-11 22:16:49 +0100 | [diff] [blame] | 84 | { |
Jens Axboe | 3545a10 | 2011-08-31 15:20:15 -0600 | [diff] [blame] | 85 | unsigned long r = __rand(fs); |
Jens Axboe | 7d9fb45 | 2011-01-11 22:16:49 +0100 | [diff] [blame] | 86 | |
| 87 | if (sizeof(int) != sizeof(long *)) |
Jens Axboe | 3545a10 | 2011-08-31 15:20:15 -0600 | [diff] [blame] | 88 | r *= (unsigned long) __rand(fs); |
Jens Axboe | 637ef8d | 2010-06-21 20:39:38 +0200 | [diff] [blame] | 89 | |
Jens Axboe | 7d9fb45 | 2011-01-11 22:16:49 +0100 | [diff] [blame] | 90 | __fill_random_buf(buf, len, r); |
| 91 | return r; |
Jens Axboe | 637ef8d | 2010-06-21 20:39:38 +0200 | [diff] [blame] | 92 | } |
Jens Axboe | 9c42684 | 2012-03-02 21:02:12 +0100 | [diff] [blame^] | 93 | |
| 94 | unsigned long fill_random_buf_percentage(struct frand_state *fs, void *buf, |
| 95 | unsigned int percentage, |
| 96 | unsigned int segment, unsigned int len) |
| 97 | { |
| 98 | unsigned int this_len, rep_len; |
| 99 | unsigned long r = __rand(fs); |
| 100 | |
| 101 | assert(segment <= len); |
| 102 | |
| 103 | if (sizeof(int) != sizeof(long *)) |
| 104 | r *= (unsigned long) __rand(fs); |
| 105 | |
| 106 | while (len) { |
| 107 | /* |
| 108 | * Fill random chunk |
| 109 | */ |
| 110 | this_len = (segment * (100 - percentage)) / 100; |
| 111 | if (this_len > len) |
| 112 | this_len = len; |
| 113 | |
| 114 | __fill_random_buf(buf, this_len, r); |
| 115 | |
| 116 | len -= this_len; |
| 117 | buf += this_len; |
| 118 | |
| 119 | /* |
| 120 | * Now duplicate random chunk in rest of buf |
| 121 | */ |
| 122 | rep_len = segment - this_len; |
| 123 | if (rep_len > len) |
| 124 | rep_len = len; |
| 125 | |
| 126 | memcpy(buf, buf + rep_len, rep_len); |
| 127 | buf += rep_len; |
| 128 | len -= rep_len; |
| 129 | } |
| 130 | |
| 131 | return r; |
| 132 | } |