diff options
author | David S. Miller <davem@davemloft.net> | 2013-11-11 14:33:06 -0500 |
---|---|---|
committer | David S. Miller <davem@davemloft.net> | 2013-11-11 14:33:06 -0500 |
commit | 75ecab1df14d90e86cebef9ec5c76befde46e65f (patch) | |
tree | aa0aee61cf99280eaa533956438c9daec3a2afc7 | |
parent | 129596674c00352cbbb1efaf36db50726fd374ef (diff) | |
parent | a6a9c0f1bf5a9a5faa605773ea75e0b93c3ab108 (diff) |
Merge branch 'prandom'
prandom fixes/improvements
====================
It would be great if you could still consider this series that fixes and
improves prandom for 3.13. We have sent it to netdev as prandom() originally
came from net/core/utils.c and networking is its main user. For a detailled
description, please see individual patches.
For patch 3 in this series, there will be a minor merge conflict with the
random tree that is for 3.13. See below how to resolve it.
====
Hannes says: on merge with the random tree I would suggest to resolve the
conflict in drivers/char/random.c like this:
if (r->entropy_total > 128) {
r->initialized = 1;
r->entropy_total = 0;
if (r == &nonblocking_pool) {
prandom_reseed_late();
pr_notice("random: %s pool is initialized\n",
r->name);
}
}
So it won't generate a warning if DEBUG_RANDOM_BOOT gets activated.
====
Patch 1 should probably also go to -stable.
Set tested on 32 and 64 bit machines.
Thanks a lot!
Ref. original discussion: http://patchwork.ozlabs.org/patch/289951/
====================
Signed-off-by: David S. Miller <davem@davemloft.net>
-rw-r--r-- | drivers/char/random.c | 5 | ||||
-rw-r--r-- | include/linux/random.h | 14 | ||||
-rw-r--r-- | include/uapi/linux/random.h | 7 | ||||
-rw-r--r-- | lib/Kconfig | 7 | ||||
-rw-r--r-- | lib/random32.c | 307 |
5 files changed, 294 insertions, 46 deletions
diff --git a/drivers/char/random.c b/drivers/char/random.c index 7a744d391756..4fe5609eeb72 100644 --- a/drivers/char/random.c +++ b/drivers/char/random.c | |||
@@ -603,8 +603,11 @@ retry: | |||
603 | 603 | ||
604 | if (!r->initialized && nbits > 0) { | 604 | if (!r->initialized && nbits > 0) { |
605 | r->entropy_total += nbits; | 605 | r->entropy_total += nbits; |
606 | if (r->entropy_total > 128) | 606 | if (r->entropy_total > 128) { |
607 | r->initialized = 1; | 607 | r->initialized = 1; |
608 | if (r == &nonblocking_pool) | ||
609 | prandom_reseed_late(); | ||
610 | } | ||
608 | } | 611 | } |
609 | 612 | ||
610 | trace_credit_entropy_bits(r->name, nbits, entropy_count, | 613 | trace_credit_entropy_bits(r->name, nbits, entropy_count, |
diff --git a/include/linux/random.h b/include/linux/random.h index 6312dd9ba449..4002b3df4c85 100644 --- a/include/linux/random.h +++ b/include/linux/random.h | |||
@@ -29,8 +29,13 @@ unsigned long randomize_range(unsigned long start, unsigned long end, unsigned l | |||
29 | u32 prandom_u32(void); | 29 | u32 prandom_u32(void); |
30 | void prandom_bytes(void *buf, int nbytes); | 30 | void prandom_bytes(void *buf, int nbytes); |
31 | void prandom_seed(u32 seed); | 31 | void prandom_seed(u32 seed); |
32 | void prandom_reseed_late(void); | ||
32 | 33 | ||
33 | u32 prandom_u32_state(struct rnd_state *); | 34 | struct rnd_state { |
35 | __u32 s1, s2, s3, s4; | ||
36 | }; | ||
37 | |||
38 | u32 prandom_u32_state(struct rnd_state *state); | ||
34 | void prandom_bytes_state(struct rnd_state *state, void *buf, int nbytes); | 39 | void prandom_bytes_state(struct rnd_state *state, void *buf, int nbytes); |
35 | 40 | ||
36 | /* | 41 | /* |
@@ -50,9 +55,10 @@ static inline void prandom_seed_state(struct rnd_state *state, u64 seed) | |||
50 | { | 55 | { |
51 | u32 i = (seed >> 32) ^ (seed << 10) ^ seed; | 56 | u32 i = (seed >> 32) ^ (seed << 10) ^ seed; |
52 | 57 | ||
53 | state->s1 = __seed(i, 1); | 58 | state->s1 = __seed(i, 2U); |
54 | state->s2 = __seed(i, 7); | 59 | state->s2 = __seed(i, 8U); |
55 | state->s3 = __seed(i, 15); | 60 | state->s3 = __seed(i, 16U); |
61 | state->s4 = __seed(i, 128U); | ||
56 | } | 62 | } |
57 | 63 | ||
58 | #ifdef CONFIG_ARCH_RANDOM | 64 | #ifdef CONFIG_ARCH_RANDOM |
diff --git a/include/uapi/linux/random.h b/include/uapi/linux/random.h index 7471b5b3b8ba..fff3528a078f 100644 --- a/include/uapi/linux/random.h +++ b/include/uapi/linux/random.h | |||
@@ -40,11 +40,4 @@ struct rand_pool_info { | |||
40 | __u32 buf[0]; | 40 | __u32 buf[0]; |
41 | }; | 41 | }; |
42 | 42 | ||
43 | struct rnd_state { | ||
44 | __u32 s1, s2, s3; | ||
45 | }; | ||
46 | |||
47 | /* Exported functions */ | ||
48 | |||
49 | |||
50 | #endif /* _UAPI_LINUX_RANDOM_H */ | 43 | #endif /* _UAPI_LINUX_RANDOM_H */ |
diff --git a/lib/Kconfig b/lib/Kconfig index b3c8be0da17f..75485e163ca3 100644 --- a/lib/Kconfig +++ b/lib/Kconfig | |||
@@ -189,6 +189,13 @@ config AUDIT_GENERIC | |||
189 | depends on AUDIT && !AUDIT_ARCH | 189 | depends on AUDIT && !AUDIT_ARCH |
190 | default y | 190 | default y |
191 | 191 | ||
192 | config RANDOM32_SELFTEST | ||
193 | bool "PRNG perform self test on init" | ||
194 | default n | ||
195 | help | ||
196 | This option enables the 32 bit PRNG library functions to perform a | ||
197 | self test on initialization. | ||
198 | |||
192 | # | 199 | # |
193 | # compression support is select'ed if needed | 200 | # compression support is select'ed if needed |
194 | # | 201 | # |
diff --git a/lib/random32.c b/lib/random32.c index 52280d5526be..82da4f4c3489 100644 --- a/lib/random32.c +++ b/lib/random32.c | |||
@@ -2,19 +2,19 @@ | |||
2 | This is a maximally equidistributed combined Tausworthe generator | 2 | This is a maximally equidistributed combined Tausworthe generator |
3 | based on code from GNU Scientific Library 1.5 (30 Jun 2004) | 3 | based on code from GNU Scientific Library 1.5 (30 Jun 2004) |
4 | 4 | ||
5 | x_n = (s1_n ^ s2_n ^ s3_n) | 5 | lfsr113 version: |
6 | 6 | ||
7 | s1_{n+1} = (((s1_n & 4294967294) <<12) ^ (((s1_n <<13) ^ s1_n) >>19)) | 7 | x_n = (s1_n ^ s2_n ^ s3_n ^ s4_n) |
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 | 8 | ||
11 | The period of this generator is about 2^88. | 9 | s1_{n+1} = (((s1_n & 4294967294) << 18) ^ (((s1_n << 6) ^ s1_n) >> 13)) |
10 | s2_{n+1} = (((s2_n & 4294967288) << 2) ^ (((s2_n << 2) ^ s2_n) >> 27)) | ||
11 | s3_{n+1} = (((s3_n & 4294967280) << 7) ^ (((s3_n << 13) ^ s3_n) >> 21)) | ||
12 | s4_{n+1} = (((s4_n & 4294967168) << 13) ^ (((s4_n << 3) ^ s4_n) >> 12)) | ||
12 | 13 | ||
13 | From: P. L'Ecuyer, "Maximally Equidistributed Combined Tausworthe | 14 | The period of this generator is about 2^113 (see erratum paper). |
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 | 15 | ||
16 | From: P. L'Ecuyer, "Maximally Equidistributed Combined Tausworthe | ||
17 | Generators", Mathematics of Computation, 65, 213 (1996), 203--213: | ||
18 | http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps | 18 | http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
19 | ftp://ftp.iro.umontreal.ca/pub/simulation/lecuyer/papers/tausme.ps | 19 | ftp://ftp.iro.umontreal.ca/pub/simulation/lecuyer/papers/tausme.ps |
20 | 20 | ||
@@ -29,7 +29,7 @@ | |||
29 | that paper.) | 29 | that paper.) |
30 | 30 | ||
31 | This affects the seeding procedure by imposing the requirement | 31 | This affects the seeding procedure by imposing the requirement |
32 | s1 > 1, s2 > 7, s3 > 15. | 32 | s1 > 1, s2 > 7, s3 > 15, s4 > 127. |
33 | 33 | ||
34 | */ | 34 | */ |
35 | 35 | ||
@@ -38,6 +38,11 @@ | |||
38 | #include <linux/export.h> | 38 | #include <linux/export.h> |
39 | #include <linux/jiffies.h> | 39 | #include <linux/jiffies.h> |
40 | #include <linux/random.h> | 40 | #include <linux/random.h> |
41 | #include <linux/sched.h> | ||
42 | |||
43 | #ifdef CONFIG_RANDOM32_SELFTEST | ||
44 | static void __init prandom_state_selftest(void); | ||
45 | #endif | ||
41 | 46 | ||
42 | static DEFINE_PER_CPU(struct rnd_state, net_rand_state); | 47 | static DEFINE_PER_CPU(struct rnd_state, net_rand_state); |
43 | 48 | ||
@@ -52,11 +57,12 @@ u32 prandom_u32_state(struct rnd_state *state) | |||
52 | { | 57 | { |
53 | #define TAUSWORTHE(s,a,b,c,d) ((s&c)<<d) ^ (((s <<a) ^ s)>>b) | 58 | #define TAUSWORTHE(s,a,b,c,d) ((s&c)<<d) ^ (((s <<a) ^ s)>>b) |
54 | 59 | ||
55 | state->s1 = TAUSWORTHE(state->s1, 13, 19, 4294967294UL, 12); | 60 | state->s1 = TAUSWORTHE(state->s1, 6U, 13U, 4294967294U, 18U); |
56 | state->s2 = TAUSWORTHE(state->s2, 2, 25, 4294967288UL, 4); | 61 | state->s2 = TAUSWORTHE(state->s2, 2U, 27U, 4294967288U, 2U); |
57 | state->s3 = TAUSWORTHE(state->s3, 3, 11, 4294967280UL, 17); | 62 | state->s3 = TAUSWORTHE(state->s3, 13U, 21U, 4294967280U, 7U); |
63 | state->s4 = TAUSWORTHE(state->s4, 3U, 12U, 4294967168U, 13U); | ||
58 | 64 | ||
59 | return (state->s1 ^ state->s2 ^ state->s3); | 65 | return (state->s1 ^ state->s2 ^ state->s3 ^ state->s4); |
60 | } | 66 | } |
61 | EXPORT_SYMBOL(prandom_u32_state); | 67 | EXPORT_SYMBOL(prandom_u32_state); |
62 | 68 | ||
@@ -126,6 +132,38 @@ void prandom_bytes(void *buf, int bytes) | |||
126 | } | 132 | } |
127 | EXPORT_SYMBOL(prandom_bytes); | 133 | EXPORT_SYMBOL(prandom_bytes); |
128 | 134 | ||
135 | static void prandom_warmup(struct rnd_state *state) | ||
136 | { | ||
137 | /* Calling RNG ten times to satify recurrence condition */ | ||
138 | prandom_u32_state(state); | ||
139 | prandom_u32_state(state); | ||
140 | prandom_u32_state(state); | ||
141 | prandom_u32_state(state); | ||
142 | prandom_u32_state(state); | ||
143 | prandom_u32_state(state); | ||
144 | prandom_u32_state(state); | ||
145 | prandom_u32_state(state); | ||
146 | prandom_u32_state(state); | ||
147 | prandom_u32_state(state); | ||
148 | } | ||
149 | |||
150 | static void prandom_seed_very_weak(struct rnd_state *state, u32 seed) | ||
151 | { | ||
152 | /* Note: This sort of seeding is ONLY used in test cases and | ||
153 | * during boot at the time from core_initcall until late_initcall | ||
154 | * as we don't have a stronger entropy source available yet. | ||
155 | * After late_initcall, we reseed entire state, we have to (!), | ||
156 | * otherwise an attacker just needs to search 32 bit space to | ||
157 | * probe for our internal 128 bit state if he knows a couple | ||
158 | * of prandom32 outputs! | ||
159 | */ | ||
160 | #define LCG(x) ((x) * 69069U) /* super-duper LCG */ | ||
161 | state->s1 = __seed(LCG(seed), 2U); | ||
162 | state->s2 = __seed(LCG(state->s1), 8U); | ||
163 | state->s3 = __seed(LCG(state->s2), 16U); | ||
164 | state->s4 = __seed(LCG(state->s3), 128U); | ||
165 | } | ||
166 | |||
129 | /** | 167 | /** |
130 | * prandom_seed - add entropy to pseudo random number generator | 168 | * prandom_seed - add entropy to pseudo random number generator |
131 | * @seed: seed value | 169 | * @seed: seed value |
@@ -141,7 +179,9 @@ void prandom_seed(u32 entropy) | |||
141 | */ | 179 | */ |
142 | for_each_possible_cpu (i) { | 180 | for_each_possible_cpu (i) { |
143 | struct rnd_state *state = &per_cpu(net_rand_state, i); | 181 | struct rnd_state *state = &per_cpu(net_rand_state, i); |
144 | state->s1 = __seed(state->s1 ^ entropy, 1); | 182 | |
183 | state->s1 = __seed(state->s1 ^ entropy, 2U); | ||
184 | prandom_warmup(state); | ||
145 | } | 185 | } |
146 | } | 186 | } |
147 | EXPORT_SYMBOL(prandom_seed); | 187 | EXPORT_SYMBOL(prandom_seed); |
@@ -154,46 +194,245 @@ static int __init prandom_init(void) | |||
154 | { | 194 | { |
155 | int i; | 195 | int i; |
156 | 196 | ||
197 | #ifdef CONFIG_RANDOM32_SELFTEST | ||
198 | prandom_state_selftest(); | ||
199 | #endif | ||
200 | |||
157 | for_each_possible_cpu(i) { | 201 | for_each_possible_cpu(i) { |
158 | struct rnd_state *state = &per_cpu(net_rand_state,i); | 202 | struct rnd_state *state = &per_cpu(net_rand_state,i); |
159 | 203 | ||
160 | #define LCG(x) ((x) * 69069) /* super-duper LCG */ | 204 | prandom_seed_very_weak(state, (i + jiffies) ^ random_get_entropy()); |
161 | state->s1 = __seed(LCG(i + jiffies), 1); | 205 | prandom_warmup(state); |
162 | state->s2 = __seed(LCG(state->s1), 7); | ||
163 | state->s3 = __seed(LCG(state->s2), 15); | ||
164 | |||
165 | /* "warm it up" */ | ||
166 | prandom_u32_state(state); | ||
167 | prandom_u32_state(state); | ||
168 | prandom_u32_state(state); | ||
169 | prandom_u32_state(state); | ||
170 | prandom_u32_state(state); | ||
171 | prandom_u32_state(state); | ||
172 | } | 206 | } |
173 | return 0; | 207 | return 0; |
174 | } | 208 | } |
175 | core_initcall(prandom_init); | 209 | core_initcall(prandom_init); |
176 | 210 | ||
211 | static void __prandom_timer(unsigned long dontcare); | ||
212 | static DEFINE_TIMER(seed_timer, __prandom_timer, 0, 0); | ||
213 | |||
214 | static void __prandom_timer(unsigned long dontcare) | ||
215 | { | ||
216 | u32 entropy; | ||
217 | |||
218 | get_random_bytes(&entropy, sizeof(entropy)); | ||
219 | prandom_seed(entropy); | ||
220 | /* reseed every ~60 seconds, in [40 .. 80) interval with slack */ | ||
221 | seed_timer.expires = jiffies + (40 * HZ + (prandom_u32() % (40 * HZ))); | ||
222 | add_timer(&seed_timer); | ||
223 | } | ||
224 | |||
225 | static void prandom_start_seed_timer(void) | ||
226 | { | ||
227 | set_timer_slack(&seed_timer, HZ); | ||
228 | seed_timer.expires = jiffies + 40 * HZ; | ||
229 | add_timer(&seed_timer); | ||
230 | } | ||
231 | |||
177 | /* | 232 | /* |
178 | * Generate better values after random number generator | 233 | * Generate better values after random number generator |
179 | * is fully initialized. | 234 | * is fully initialized. |
180 | */ | 235 | */ |
181 | static int __init prandom_reseed(void) | 236 | static void __prandom_reseed(bool late) |
182 | { | 237 | { |
183 | int i; | 238 | int i; |
239 | unsigned long flags; | ||
240 | static bool latch = false; | ||
241 | static DEFINE_SPINLOCK(lock); | ||
242 | |||
243 | /* only allow initial seeding (late == false) once */ | ||
244 | spin_lock_irqsave(&lock, flags); | ||
245 | if (latch && !late) | ||
246 | goto out; | ||
247 | latch = true; | ||
184 | 248 | ||
185 | for_each_possible_cpu(i) { | 249 | for_each_possible_cpu(i) { |
186 | struct rnd_state *state = &per_cpu(net_rand_state,i); | 250 | struct rnd_state *state = &per_cpu(net_rand_state,i); |
187 | u32 seeds[3]; | 251 | u32 seeds[4]; |
188 | 252 | ||
189 | get_random_bytes(&seeds, sizeof(seeds)); | 253 | get_random_bytes(&seeds, sizeof(seeds)); |
190 | state->s1 = __seed(seeds[0], 1); | 254 | state->s1 = __seed(seeds[0], 2U); |
191 | state->s2 = __seed(seeds[1], 7); | 255 | state->s2 = __seed(seeds[1], 8U); |
192 | state->s3 = __seed(seeds[2], 15); | 256 | state->s3 = __seed(seeds[2], 16U); |
257 | state->s4 = __seed(seeds[3], 128U); | ||
193 | 258 | ||
194 | /* mix it in */ | 259 | prandom_warmup(state); |
195 | prandom_u32_state(state); | ||
196 | } | 260 | } |
261 | out: | ||
262 | spin_unlock_irqrestore(&lock, flags); | ||
263 | } | ||
264 | |||
265 | void prandom_reseed_late(void) | ||
266 | { | ||
267 | __prandom_reseed(true); | ||
268 | } | ||
269 | |||
270 | static int __init prandom_reseed(void) | ||
271 | { | ||
272 | __prandom_reseed(false); | ||
273 | prandom_start_seed_timer(); | ||
197 | return 0; | 274 | return 0; |
198 | } | 275 | } |
199 | late_initcall(prandom_reseed); | 276 | late_initcall(prandom_reseed); |
277 | |||
278 | #ifdef CONFIG_RANDOM32_SELFTEST | ||
279 | static struct prandom_test1 { | ||
280 | u32 seed; | ||
281 | u32 result; | ||
282 | } test1[] = { | ||
283 | { 1U, 3484351685U }, | ||
284 | { 2U, 2623130059U }, | ||
285 | { 3U, 3125133893U }, | ||
286 | { 4U, 984847254U }, | ||
287 | }; | ||
288 | |||
289 | static struct prandom_test2 { | ||
290 | u32 seed; | ||
291 | u32 iteration; | ||
292 | u32 result; | ||
293 | } test2[] = { | ||
294 | /* Test cases against taus113 from GSL library. */ | ||
295 | { 931557656U, 959U, 2975593782U }, | ||
296 | { 1339693295U, 876U, 3887776532U }, | ||
297 | { 1545556285U, 961U, 1615538833U }, | ||
298 | { 601730776U, 723U, 1776162651U }, | ||
299 | { 1027516047U, 687U, 511983079U }, | ||
300 | { 416526298U, 700U, 916156552U }, | ||
301 | { 1395522032U, 652U, 2222063676U }, | ||
302 | { 366221443U, 617U, 2992857763U }, | ||
303 | { 1539836965U, 714U, 3783265725U }, | ||
304 | { 556206671U, 994U, 799626459U }, | ||
305 | { 684907218U, 799U, 367789491U }, | ||
306 | { 2121230701U, 931U, 2115467001U }, | ||
307 | { 1668516451U, 644U, 3620590685U }, | ||
308 | { 768046066U, 883U, 2034077390U }, | ||
309 | { 1989159136U, 833U, 1195767305U }, | ||
310 | { 536585145U, 996U, 3577259204U }, | ||
311 | { 1008129373U, 642U, 1478080776U }, | ||
312 | { 1740775604U, 939U, 1264980372U }, | ||
313 | { 1967883163U, 508U, 10734624U }, | ||
314 | { 1923019697U, 730U, 3821419629U }, | ||
315 | { 442079932U, 560U, 3440032343U }, | ||
316 | { 1961302714U, 845U, 841962572U }, | ||
317 | { 2030205964U, 962U, 1325144227U }, | ||
318 | { 1160407529U, 507U, 240940858U }, | ||
319 | { 635482502U, 779U, 4200489746U }, | ||
320 | { 1252788931U, 699U, 867195434U }, | ||
321 | { 1961817131U, 719U, 668237657U }, | ||
322 | { 1071468216U, 983U, 917876630U }, | ||
323 | { 1281848367U, 932U, 1003100039U }, | ||
324 | { 582537119U, 780U, 1127273778U }, | ||
325 | { 1973672777U, 853U, 1071368872U }, | ||
326 | { 1896756996U, 762U, 1127851055U }, | ||
327 | { 847917054U, 500U, 1717499075U }, | ||
328 | { 1240520510U, 951U, 2849576657U }, | ||
329 | { 1685071682U, 567U, 1961810396U }, | ||
330 | { 1516232129U, 557U, 3173877U }, | ||
331 | { 1208118903U, 612U, 1613145022U }, | ||
332 | { 1817269927U, 693U, 4279122573U }, | ||
333 | { 1510091701U, 717U, 638191229U }, | ||
334 | { 365916850U, 807U, 600424314U }, | ||
335 | { 399324359U, 702U, 1803598116U }, | ||
336 | { 1318480274U, 779U, 2074237022U }, | ||
337 | { 697758115U, 840U, 1483639402U }, | ||
338 | { 1696507773U, 840U, 577415447U }, | ||
339 | { 2081979121U, 981U, 3041486449U }, | ||
340 | { 955646687U, 742U, 3846494357U }, | ||
341 | { 1250683506U, 749U, 836419859U }, | ||
342 | { 595003102U, 534U, 366794109U }, | ||
343 | { 47485338U, 558U, 3521120834U }, | ||
344 | { 619433479U, 610U, 3991783875U }, | ||
345 | { 704096520U, 518U, 4139493852U }, | ||
346 | { 1712224984U, 606U, 2393312003U }, | ||
347 | { 1318233152U, 922U, 3880361134U }, | ||
348 | { 855572992U, 761U, 1472974787U }, | ||
349 | { 64721421U, 703U, 683860550U }, | ||
350 | { 678931758U, 840U, 380616043U }, | ||
351 | { 692711973U, 778U, 1382361947U }, | ||
352 | { 677703619U, 530U, 2826914161U }, | ||
353 | { 92393223U, 586U, 1522128471U }, | ||
354 | { 1222592920U, 743U, 3466726667U }, | ||
355 | { 358288986U, 695U, 1091956998U }, | ||
356 | { 1935056945U, 958U, 514864477U }, | ||
357 | { 735675993U, 990U, 1294239989U }, | ||
358 | { 1560089402U, 897U, 2238551287U }, | ||
359 | { 70616361U, 829U, 22483098U }, | ||
360 | { 368234700U, 731U, 2913875084U }, | ||
361 | { 20221190U, 879U, 1564152970U }, | ||
362 | { 539444654U, 682U, 1835141259U }, | ||
363 | { 1314987297U, 840U, 1801114136U }, | ||
364 | { 2019295544U, 645U, 3286438930U }, | ||
365 | { 469023838U, 716U, 1637918202U }, | ||
366 | { 1843754496U, 653U, 2562092152U }, | ||
367 | { 400672036U, 809U, 4264212785U }, | ||
368 | { 404722249U, 965U, 2704116999U }, | ||
369 | { 600702209U, 758U, 584979986U }, | ||
370 | { 519953954U, 667U, 2574436237U }, | ||
371 | { 1658071126U, 694U, 2214569490U }, | ||
372 | { 420480037U, 749U, 3430010866U }, | ||
373 | { 690103647U, 969U, 3700758083U }, | ||
374 | { 1029424799U, 937U, 3787746841U }, | ||
375 | { 2012608669U, 506U, 3362628973U }, | ||
376 | { 1535432887U, 998U, 42610943U }, | ||
377 | { 1330635533U, 857U, 3040806504U }, | ||
378 | { 1223800550U, 539U, 3954229517U }, | ||
379 | { 1322411537U, 680U, 3223250324U }, | ||
380 | { 1877847898U, 945U, 2915147143U }, | ||
381 | { 1646356099U, 874U, 965988280U }, | ||
382 | { 805687536U, 744U, 4032277920U }, | ||
383 | { 1948093210U, 633U, 1346597684U }, | ||
384 | { 392609744U, 783U, 1636083295U }, | ||
385 | { 690241304U, 770U, 1201031298U }, | ||
386 | { 1360302965U, 696U, 1665394461U }, | ||
387 | { 1220090946U, 780U, 1316922812U }, | ||
388 | { 447092251U, 500U, 3438743375U }, | ||
389 | { 1613868791U, 592U, 828546883U }, | ||
390 | { 523430951U, 548U, 2552392304U }, | ||
391 | { 726692899U, 810U, 1656872867U }, | ||
392 | { 1364340021U, 836U, 3710513486U }, | ||
393 | { 1986257729U, 931U, 935013962U }, | ||
394 | { 407983964U, 921U, 728767059U }, | ||
395 | }; | ||
396 | |||
397 | static void __init prandom_state_selftest(void) | ||
398 | { | ||
399 | int i, j, errors = 0, runs = 0; | ||
400 | bool error = false; | ||
401 | |||
402 | for (i = 0; i < ARRAY_SIZE(test1); i++) { | ||
403 | struct rnd_state state; | ||
404 | |||
405 | prandom_seed_very_weak(&state, test1[i].seed); | ||
406 | prandom_warmup(&state); | ||
407 | |||
408 | if (test1[i].result != prandom_u32_state(&state)) | ||
409 | error = true; | ||
410 | } | ||
411 | |||
412 | if (error) | ||
413 | pr_warn("prandom: seed boundary self test failed\n"); | ||
414 | else | ||
415 | pr_info("prandom: seed boundary self test passed\n"); | ||
416 | |||
417 | for (i = 0; i < ARRAY_SIZE(test2); i++) { | ||
418 | struct rnd_state state; | ||
419 | |||
420 | prandom_seed_very_weak(&state, test2[i].seed); | ||
421 | prandom_warmup(&state); | ||
422 | |||
423 | for (j = 0; j < test2[i].iteration - 1; j++) | ||
424 | prandom_u32_state(&state); | ||
425 | |||
426 | if (test2[i].result != prandom_u32_state(&state)) | ||
427 | errors++; | ||
428 | |||
429 | runs++; | ||
430 | cond_resched(); | ||
431 | } | ||
432 | |||
433 | if (errors) | ||
434 | pr_warn("prandom: %d/%d self tests failed\n", errors, runs); | ||
435 | else | ||
436 | pr_info("prandom: %d self tests passed\n", runs); | ||
437 | } | ||
438 | #endif | ||