]>
Commit | Line | Data |
---|---|---|
a6aa71ff | 1 | /* crypto/rand/md_rand.c */ |
58964a49 | 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
d02b48c6 RE |
3 | * All rights reserved. |
4 | * | |
5 | * This package is an SSL implementation written | |
6 | * by Eric Young (eay@cryptsoft.com). | |
7 | * The implementation was written so as to conform with Netscapes SSL. | |
8 | * | |
9 | * This library is free for commercial and non-commercial use as long as | |
10 | * the following conditions are aheared to. The following conditions | |
11 | * apply to all code found in this distribution, be it the RC4, RSA, | |
12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | |
13 | * included with this distribution is covered by the same copyright terms | |
14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | |
15 | * | |
16 | * Copyright remains Eric Young's, and as such any Copyright notices in | |
17 | * the code are not to be removed. | |
18 | * If this package is used in a product, Eric Young should be given attribution | |
19 | * as the author of the parts of the library used. | |
20 | * This can be in the form of a textual message at program startup or | |
21 | * in documentation (online or textual) provided with the package. | |
22 | * | |
23 | * Redistribution and use in source and binary forms, with or without | |
24 | * modification, are permitted provided that the following conditions | |
25 | * are met: | |
26 | * 1. Redistributions of source code must retain the copyright | |
27 | * notice, this list of conditions and the following disclaimer. | |
28 | * 2. Redistributions in binary form must reproduce the above copyright | |
29 | * notice, this list of conditions and the following disclaimer in the | |
30 | * documentation and/or other materials provided with the distribution. | |
31 | * 3. All advertising materials mentioning features or use of this software | |
32 | * must display the following acknowledgement: | |
33 | * "This product includes cryptographic software written by | |
34 | * Eric Young (eay@cryptsoft.com)" | |
35 | * The word 'cryptographic' can be left out if the rouines from the library | |
36 | * being used are not cryptographic related :-). | |
37 | * 4. If you include any Windows specific code (or a derivative thereof) from | |
38 | * the apps directory (application code) you must include an acknowledgement: | |
39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
40 | * | |
41 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | |
42 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
43 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
44 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | |
45 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
46 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
47 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
49 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
50 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
51 | * SUCH DAMAGE. | |
52 | * | |
53 | * The licence and distribution terms for any publically available version or | |
54 | * derivative of this code cannot be changed. i.e. this code cannot simply be | |
55 | * copied and put under another distribution licence | |
56 | * [including the GNU Public Licence.] | |
57 | */ | |
863fe2ec | 58 | /* ==================================================================== |
f9b0f47c | 59 | * Copyright (c) 1998-2001 The OpenSSL Project. All rights reserved. |
863fe2ec BM |
60 | * |
61 | * Redistribution and use in source and binary forms, with or without | |
62 | * modification, are permitted provided that the following conditions | |
63 | * are met: | |
64 | * | |
65 | * 1. Redistributions of source code must retain the above copyright | |
66 | * notice, this list of conditions and the following disclaimer. | |
67 | * | |
68 | * 2. Redistributions in binary form must reproduce the above copyright | |
69 | * notice, this list of conditions and the following disclaimer in | |
70 | * the documentation and/or other materials provided with the | |
71 | * distribution. | |
72 | * | |
73 | * 3. All advertising materials mentioning features or use of this | |
74 | * software must display the following acknowledgment: | |
75 | * "This product includes software developed by the OpenSSL Project | |
76 | * for use in the OpenSSL Toolkit. (http://www.openssl.org/)" | |
77 | * | |
78 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | |
79 | * endorse or promote products derived from this software without | |
80 | * prior written permission. For written permission, please contact | |
81 | * openssl-core@openssl.org. | |
82 | * | |
83 | * 5. Products derived from this software may not be called "OpenSSL" | |
84 | * nor may "OpenSSL" appear in their names without prior written | |
85 | * permission of the OpenSSL Project. | |
86 | * | |
87 | * 6. Redistributions of any form whatsoever must retain the following | |
88 | * acknowledgment: | |
89 | * "This product includes software developed by the OpenSSL Project | |
90 | * for use in the OpenSSL Toolkit (http://www.openssl.org/)" | |
91 | * | |
92 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | |
93 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
94 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | |
95 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | |
96 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
97 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | |
98 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | |
99 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
100 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | |
101 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | |
102 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | |
103 | * OF THE POSSIBILITY OF SUCH DAMAGE. | |
104 | * ==================================================================== | |
105 | * | |
106 | * This product includes cryptographic software written by Eric Young | |
107 | * (eay@cryptsoft.com). This product includes software written by Tim | |
108 | * Hudson (tjh@cryptsoft.com). | |
109 | * | |
110 | */ | |
d02b48c6 | 111 | |
2ace287d | 112 | #ifdef MD_RAND_DEBUG |
c1e744b9 BM |
113 | # ifndef NDEBUG |
114 | # define NDEBUG | |
115 | # endif | |
116 | #endif | |
117 | ||
118 | #include <assert.h> | |
d02b48c6 | 119 | #include <stdio.h> |
a224de3f | 120 | #include <string.h> |
17e3dd1c | 121 | |
41d2a336 | 122 | #include "e_os.h" |
17e3dd1c | 123 | |
8ad7635e UM |
124 | #include <openssl/rand.h> |
125 | #include "rand_lcl.h" | |
126 | ||
ec577822 | 127 | #include <openssl/crypto.h> |
eb952088 | 128 | #include <openssl/err.h> |
d02b48c6 | 129 | |
e64dceab UM |
130 | #ifdef BN_DEBUG |
131 | # define PREDICT | |
132 | #endif | |
133 | ||
dfeab068 | 134 | /* #define PREDICT 1 */ |
d02b48c6 RE |
135 | |
136 | #define STATE_SIZE 1023 | |
137 | static int state_num=0,state_index=0; | |
58964a49 | 138 | static unsigned char state[STATE_SIZE+MD_DIGEST_LENGTH]; |
d02b48c6 | 139 | static unsigned char md[MD_DIGEST_LENGTH]; |
dfeab068 | 140 | static long md_count[2]={0,0}; |
853f757e | 141 | static double entropy=0; |
4ec2d4d2 | 142 | static int initialized=0; |
d02b48c6 | 143 | |
6e6d04e2 BM |
144 | static unsigned int crypto_lock_rand = 0; /* may be set only when a thread |
145 | * holds CRYPTO_LOCK_RAND | |
146 | * (to prevent double locking) */ | |
daba492c | 147 | /* access to lockin_thread is synchronized by CRYPTO_LOCK_RAND2 */ |
4c329696 | 148 | static CRYPTO_THREADID locking_threadid; /* valid iff crypto_lock_rand is set */ |
6e6d04e2 | 149 | |
a4125514 | 150 | |
e64dceab UM |
151 | #ifdef PREDICT |
152 | int rand_predictable=0; | |
153 | #endif | |
154 | ||
560b79cb | 155 | const char RAND_version[]="RAND" OPENSSL_VERSION_PTEXT; |
d02b48c6 | 156 | |
dfeab068 | 157 | static void ssleay_rand_cleanup(void); |
6343829a GT |
158 | static void ssleay_rand_seed(const void *buf, int num); |
159 | static void ssleay_rand_add(const void *buf, int num, double add_entropy); | |
160 | static int ssleay_rand_bytes(unsigned char *buf, int num); | |
161 | static int ssleay_rand_pseudo_bytes(unsigned char *buf, int num); | |
5eb8ca4d | 162 | static int ssleay_rand_status(void); |
dfeab068 | 163 | |
651d0aff | 164 | RAND_METHOD rand_ssleay_meth={ |
dfeab068 RE |
165 | ssleay_rand_seed, |
166 | ssleay_rand_bytes, | |
167 | ssleay_rand_cleanup, | |
eb952088 | 168 | ssleay_rand_add, |
373b575f | 169 | ssleay_rand_pseudo_bytes, |
5eb8ca4d | 170 | ssleay_rand_status |
dfeab068 RE |
171 | }; |
172 | ||
6b691a5c | 173 | RAND_METHOD *RAND_SSLeay(void) |
dfeab068 | 174 | { |
651d0aff | 175 | return(&rand_ssleay_meth); |
dfeab068 RE |
176 | } |
177 | ||
6b691a5c | 178 | static void ssleay_rand_cleanup(void) |
d02b48c6 | 179 | { |
4579924b | 180 | OPENSSL_cleanse(state,sizeof(state)); |
d02b48c6 RE |
181 | state_num=0; |
182 | state_index=0; | |
4579924b | 183 | OPENSSL_cleanse(md,MD_DIGEST_LENGTH); |
dfeab068 RE |
184 | md_count[0]=0; |
185 | md_count[1]=0; | |
eb952088 | 186 | entropy=0; |
d3093944 | 187 | initialized=0; |
d02b48c6 RE |
188 | } |
189 | ||
6343829a | 190 | static void ssleay_rand_add(const void *buf, int num, double add) |
d02b48c6 | 191 | { |
6343829a | 192 | int i,j,k,st_idx; |
c1e744b9 BM |
193 | long md_c[2]; |
194 | unsigned char local_md[MD_DIGEST_LENGTH]; | |
dbad1690 | 195 | EVP_MD_CTX m; |
6e6d04e2 | 196 | int do_not_lock; |
d02b48c6 | 197 | |
c1e744b9 | 198 | /* |
60b52453 | 199 | * (Based on the rand(3) manpage) |
c1e744b9 | 200 | * |
c88a900f | 201 | * The input is chopped up into units of 20 bytes (or less for |
60b52453 | 202 | * the last block). Each of these blocks is run through the hash |
0b5cfe32 | 203 | * function as follows: The data passed to the hash function |
c1e744b9 BM |
204 | * is the current 'md', the same number of bytes from the 'state' |
205 | * (the location determined by in incremented looping index) as | |
206 | * the current 'block', the new key data 'block', and 'count' | |
207 | * (which is incremented after each use). | |
208 | * The result of this is kept in 'md' and also xored into the | |
60b52453 UM |
209 | * 'state' at the same locations that were used as input into the |
210 | * hash function. | |
c1e744b9 BM |
211 | */ |
212 | ||
6e6d04e2 | 213 | /* check if we already have the lock */ |
daba492c BM |
214 | if (crypto_lock_rand) |
215 | { | |
4c329696 GT |
216 | CRYPTO_THREADID cur; |
217 | CRYPTO_THREADID_current(&cur); | |
daba492c | 218 | CRYPTO_r_lock(CRYPTO_LOCK_RAND2); |
4c329696 | 219 | do_not_lock = !CRYPTO_THREADID_cmp(&locking_threadid, &cur); |
daba492c BM |
220 | CRYPTO_r_unlock(CRYPTO_LOCK_RAND2); |
221 | } | |
222 | else | |
223 | do_not_lock = 0; | |
6e6d04e2 BM |
224 | |
225 | if (!do_not_lock) CRYPTO_w_lock(CRYPTO_LOCK_RAND); | |
d02b48c6 | 226 | st_idx=state_index; |
d02b48c6 | 227 | |
c1e744b9 BM |
228 | /* use our own copies of the counters so that even |
229 | * if a concurrent thread seeds with exactly the | |
230 | * same data and uses the same subarray there's _some_ | |
231 | * difference */ | |
232 | md_c[0] = md_count[0]; | |
233 | md_c[1] = md_count[1]; | |
234 | ||
235 | memcpy(local_md, md, sizeof md); | |
236 | ||
237 | /* state_index <= state_num <= STATE_SIZE */ | |
238 | state_index += num; | |
58964a49 | 239 | if (state_index >= STATE_SIZE) |
d02b48c6 RE |
240 | { |
241 | state_index%=STATE_SIZE; | |
242 | state_num=STATE_SIZE; | |
243 | } | |
244 | else if (state_num < STATE_SIZE) | |
245 | { | |
246 | if (state_index > state_num) | |
247 | state_num=state_index; | |
248 | } | |
c1e744b9 BM |
249 | /* state_index <= state_num <= STATE_SIZE */ |
250 | ||
251 | /* state[st_idx], ..., state[(st_idx + num - 1) % STATE_SIZE] | |
252 | * are what we will use now, but other threads may use them | |
253 | * as well */ | |
254 | ||
255 | md_count[1] += (num / MD_DIGEST_LENGTH) + (num % MD_DIGEST_LENGTH > 0); | |
256 | ||
6e6d04e2 | 257 | if (!do_not_lock) CRYPTO_w_unlock(CRYPTO_LOCK_RAND); |
d02b48c6 | 258 | |
dbad1690 | 259 | EVP_MD_CTX_init(&m); |
d02b48c6 RE |
260 | for (i=0; i<num; i+=MD_DIGEST_LENGTH) |
261 | { | |
262 | j=(num-i); | |
263 | j=(j > MD_DIGEST_LENGTH)?MD_DIGEST_LENGTH:j; | |
264 | ||
265 | MD_Init(&m); | |
c1e744b9 | 266 | MD_Update(&m,local_md,MD_DIGEST_LENGTH); |
d02b48c6 RE |
267 | k=(st_idx+j)-STATE_SIZE; |
268 | if (k > 0) | |
269 | { | |
270 | MD_Update(&m,&(state[st_idx]),j-k); | |
271 | MD_Update(&m,&(state[0]),k); | |
272 | } | |
273 | else | |
274 | MD_Update(&m,&(state[st_idx]),j); | |
275 | ||
276 | MD_Update(&m,buf,j); | |
c1e744b9 | 277 | MD_Update(&m,(unsigned char *)&(md_c[0]),sizeof(md_c)); |
323f289c | 278 | MD_Final(&m,local_md); |
c1e744b9 | 279 | md_c[1]++; |
d02b48c6 | 280 | |
e778802f | 281 | buf=(const char *)buf + j; |
d02b48c6 RE |
282 | |
283 | for (k=0; k<j; k++) | |
284 | { | |
c1e744b9 BM |
285 | /* Parallel threads may interfere with this, |
286 | * but always each byte of the new state is | |
287 | * the XOR of some previous value of its | |
288 | * and local_md (itermediate values may be lost). | |
289 | * Alway using locking could hurt performance more | |
290 | * than necessary given that conflicts occur only | |
291 | * when the total seeding is longer than the random | |
292 | * state. */ | |
293 | state[st_idx++]^=local_md[k]; | |
d02b48c6 | 294 | if (st_idx >= STATE_SIZE) |
d02b48c6 | 295 | st_idx=0; |
d02b48c6 RE |
296 | } |
297 | } | |
dbad1690 | 298 | EVP_MD_CTX_cleanup(&m); |
c1e744b9 | 299 | |
6e6d04e2 | 300 | if (!do_not_lock) CRYPTO_w_lock(CRYPTO_LOCK_RAND); |
c1e744b9 BM |
301 | /* Don't just copy back local_md into md -- this could mean that |
302 | * other thread's seeding remains without effect (except for | |
303 | * the incremented counter). By XORing it we keep at least as | |
304 | * much entropy as fits into md. */ | |
6343829a | 305 | for (k = 0; k < (int)sizeof(md); k++) |
c1e744b9 BM |
306 | { |
307 | md[k] ^= local_md[k]; | |
308 | } | |
c6709c6b BM |
309 | if (entropy < ENTROPY_NEEDED) /* stop counting when we have enough */ |
310 | entropy += add; | |
6e6d04e2 | 311 | if (!do_not_lock) CRYPTO_w_unlock(CRYPTO_LOCK_RAND); |
c1e744b9 | 312 | |
bc36ee62 | 313 | #if !defined(OPENSSL_THREADS) && !defined(OPENSSL_SYS_WIN32) |
c1e744b9 BM |
314 | assert(md_c[1] == md_count[1]); |
315 | #endif | |
eb952088 UM |
316 | } |
317 | ||
6343829a | 318 | static void ssleay_rand_seed(const void *buf, int num) |
eb952088 | 319 | { |
ec37635c | 320 | ssleay_rand_add(buf, num, (double)num); |
d02b48c6 RE |
321 | } |
322 | ||
6343829a | 323 | static int ssleay_rand_bytes(unsigned char *buf, int num) |
d02b48c6 | 324 | { |
361ee973 | 325 | static volatile int stirred_pool = 0; |
6343829a | 326 | int i,j,k,st_num,st_idx; |
e9ad0d2c | 327 | int num_ceil; |
eb952088 | 328 | int ok; |
c1e744b9 BM |
329 | long md_c[2]; |
330 | unsigned char local_md[MD_DIGEST_LENGTH]; | |
dbad1690 | 331 | EVP_MD_CTX m; |
9a1e34e5 | 332 | #ifndef GETPID_IS_MEANINGLESS |
62ac2938 | 333 | pid_t curr_pid = getpid(); |
c1e744b9 | 334 | #endif |
361ee973 | 335 | int do_stir_pool = 0; |
d02b48c6 RE |
336 | |
337 | #ifdef PREDICT | |
e64dceab UM |
338 | if (rand_predictable) |
339 | { | |
340 | static unsigned char val=0; | |
d02b48c6 | 341 | |
e64dceab UM |
342 | for (i=0; i<num; i++) |
343 | buf[i]=val++; | |
344 | return(1); | |
345 | } | |
d02b48c6 RE |
346 | #endif |
347 | ||
e9ad0d2c BM |
348 | if (num <= 0) |
349 | return 1; | |
dbad1690 BL |
350 | |
351 | EVP_MD_CTX_init(&m); | |
e9ad0d2c BM |
352 | /* round upwards to multiple of MD_DIGEST_LENGTH/2 */ |
353 | num_ceil = (1 + (num-1)/(MD_DIGEST_LENGTH/2)) * (MD_DIGEST_LENGTH/2); | |
354 | ||
c1e744b9 | 355 | /* |
2c8aeddc | 356 | * (Based on the rand(3) manpage:) |
c1e744b9 | 357 | * |
c88a900f | 358 | * For each group of 10 bytes (or less), we do the following: |
c1e744b9 | 359 | * |
e9ad0d2c BM |
360 | * Input into the hash function the local 'md' (which is initialized from |
361 | * the global 'md' before any bytes are generated), the bytes that are to | |
362 | * be overwritten by the random bytes, and bytes from the 'state' | |
363 | * (incrementing looping index). From this digest output (which is kept | |
364 | * in 'md'), the top (up to) 10 bytes are returned to the caller and the | |
365 | * bottom 10 bytes are xored into the 'state'. | |
366 | * | |
c1e744b9 | 367 | * Finally, after we have finished 'num' random bytes for the |
2c8aeddc BM |
368 | * caller, 'count' (which is incremented) and the local and global 'md' |
369 | * are fed into the hash function and the results are kept in the | |
370 | * global 'md'. | |
c1e744b9 BM |
371 | */ |
372 | ||
8ad7635e | 373 | CRYPTO_w_lock(CRYPTO_LOCK_RAND); |
d02b48c6 | 374 | |
6e6d04e2 | 375 | /* prevent ssleay_rand_bytes() from trying to obtain the lock again */ |
daba492c | 376 | CRYPTO_w_lock(CRYPTO_LOCK_RAND2); |
4c329696 | 377 | CRYPTO_THREADID_current(&locking_threadid); |
daba492c | 378 | CRYPTO_w_unlock(CRYPTO_LOCK_RAND2); |
badb910f | 379 | crypto_lock_rand = 1; |
6e6d04e2 BM |
380 | |
381 | if (!initialized) | |
382 | { | |
383 | RAND_poll(); | |
384 | initialized = 1; | |
385 | } | |
386 | ||
361ee973 BM |
387 | if (!stirred_pool) |
388 | do_stir_pool = 1; | |
389 | ||
eb952088 | 390 | ok = (entropy >= ENTROPY_NEEDED); |
c6709c6b BM |
391 | if (!ok) |
392 | { | |
393 | /* If the PRNG state is not yet unpredictable, then seeing | |
394 | * the PRNG output may help attackers to determine the new | |
395 | * state; thus we have to decrease the entropy estimate. | |
396 | * Once we've had enough initial seeding we don't bother to | |
397 | * adjust the entropy count, though, because we're not ambitious | |
398 | * to provide *information-theoretic* randomness. | |
361ee973 BM |
399 | * |
400 | * NOTE: This approach fails if the program forks before | |
401 | * we have enough entropy. Entropy should be collected | |
402 | * in a separate input pool and be transferred to the | |
403 | * output pool only when the entropy limit has been reached. | |
c6709c6b BM |
404 | */ |
405 | entropy -= num; | |
406 | if (entropy < 0) | |
407 | entropy = 0; | |
408 | } | |
eb952088 | 409 | |
361ee973 BM |
410 | if (do_stir_pool) |
411 | { | |
e9ad0d2c BM |
412 | /* In the output function only half of 'md' remains secret, |
413 | * so we better make sure that the required entropy gets | |
414 | * 'evenly distributed' through 'state', our randomness pool. | |
415 | * The input function (ssleay_rand_add) chains all of 'md', | |
416 | * which makes it more suitable for this purpose. | |
361ee973 BM |
417 | */ |
418 | ||
419 | int n = STATE_SIZE; /* so that the complete pool gets accessed */ | |
420 | while (n > 0) | |
421 | { | |
422 | #if MD_DIGEST_LENGTH > 20 | |
423 | # error "Please adjust DUMMY_SEED." | |
424 | #endif | |
425 | #define DUMMY_SEED "...................." /* at least MD_DIGEST_LENGTH */ | |
426 | /* Note that the seed does not matter, it's just that | |
427 | * ssleay_rand_add expects to have something to hash. */ | |
428 | ssleay_rand_add(DUMMY_SEED, MD_DIGEST_LENGTH, 0.0); | |
429 | n -= MD_DIGEST_LENGTH; | |
430 | } | |
431 | if (ok) | |
432 | stirred_pool = 1; | |
433 | } | |
434 | ||
d02b48c6 RE |
435 | st_idx=state_index; |
436 | st_num=state_num; | |
c1e744b9 BM |
437 | md_c[0] = md_count[0]; |
438 | md_c[1] = md_count[1]; | |
439 | memcpy(local_md, md, sizeof md); | |
440 | ||
e9ad0d2c | 441 | state_index+=num_ceil; |
d02b48c6 | 442 | if (state_index > state_num) |
c1e744b9 BM |
443 | state_index %= state_num; |
444 | ||
e9ad0d2c | 445 | /* state[st_idx], ..., state[(st_idx + num_ceil - 1) % st_num] |
c1e744b9 | 446 | * are now ours (but other threads may use them too) */ |
d02b48c6 | 447 | |
c1e744b9 | 448 | md_count[0] += 1; |
a4125514 | 449 | |
6e6d04e2 BM |
450 | /* before unlocking, we must clear 'crypto_lock_rand' */ |
451 | crypto_lock_rand = 0; | |
d02b48c6 RE |
452 | CRYPTO_w_unlock(CRYPTO_LOCK_RAND); |
453 | ||
454 | while (num > 0) | |
455 | { | |
e9ad0d2c | 456 | /* num_ceil -= MD_DIGEST_LENGTH/2 */ |
d02b48c6 RE |
457 | j=(num >= MD_DIGEST_LENGTH/2)?MD_DIGEST_LENGTH/2:num; |
458 | num-=j; | |
459 | MD_Init(&m); | |
9a1e34e5 | 460 | #ifndef GETPID_IS_MEANINGLESS |
62ac2938 BM |
461 | if (curr_pid) /* just in the first iteration to save time */ |
462 | { | |
463 | MD_Update(&m,(unsigned char*)&curr_pid,sizeof curr_pid); | |
464 | curr_pid = 0; | |
465 | } | |
466 | #endif | |
e9ad0d2c | 467 | MD_Update(&m,local_md,MD_DIGEST_LENGTH); |
c1e744b9 | 468 | MD_Update(&m,(unsigned char *)&(md_c[0]),sizeof(md_c)); |
d02b48c6 RE |
469 | #ifndef PURIFY |
470 | MD_Update(&m,buf,j); /* purify complains */ | |
471 | #endif | |
e9ad0d2c | 472 | k=(st_idx+MD_DIGEST_LENGTH/2)-st_num; |
d02b48c6 RE |
473 | if (k > 0) |
474 | { | |
e9ad0d2c | 475 | MD_Update(&m,&(state[st_idx]),MD_DIGEST_LENGTH/2-k); |
d02b48c6 RE |
476 | MD_Update(&m,&(state[0]),k); |
477 | } | |
478 | else | |
e9ad0d2c | 479 | MD_Update(&m,&(state[st_idx]),MD_DIGEST_LENGTH/2); |
323f289c | 480 | MD_Final(&m,local_md); |
d02b48c6 | 481 | |
e9ad0d2c | 482 | for (i=0; i<MD_DIGEST_LENGTH/2; i++) |
d02b48c6 | 483 | { |
c1e744b9 | 484 | state[st_idx++]^=local_md[i]; /* may compete with other threads */ |
d02b48c6 RE |
485 | if (st_idx >= st_num) |
486 | st_idx=0; | |
e9ad0d2c BM |
487 | if (i < j) |
488 | *(buf++)=local_md[i+MD_DIGEST_LENGTH/2]; | |
d02b48c6 RE |
489 | } |
490 | } | |
491 | ||
492 | MD_Init(&m); | |
6343829a | 493 | MD_Update(&m,(unsigned char *)&(md_c[0]),sizeof(md_c)); |
c1e744b9 BM |
494 | MD_Update(&m,local_md,MD_DIGEST_LENGTH); |
495 | CRYPTO_w_lock(CRYPTO_LOCK_RAND); | |
d02b48c6 | 496 | MD_Update(&m,md,MD_DIGEST_LENGTH); |
323f289c | 497 | MD_Final(&m,md); |
c1e744b9 BM |
498 | CRYPTO_w_unlock(CRYPTO_LOCK_RAND); |
499 | ||
dbad1690 | 500 | EVP_MD_CTX_cleanup(&m); |
eb952088 UM |
501 | if (ok) |
502 | return(1); | |
503 | else | |
504 | { | |
505 | RANDerr(RAND_F_SSLEAY_RAND_BYTES,RAND_R_PRNG_NOT_SEEDED); | |
3b3bc455 RL |
506 | ERR_add_error_data(1, "You need to read the OpenSSL FAQ, " |
507 | "http://www.openssl.org/support/faq.html"); | |
eb952088 UM |
508 | return(0); |
509 | } | |
d02b48c6 RE |
510 | } |
511 | ||
373b575f UM |
512 | /* pseudo-random bytes that are guaranteed to be unique but not |
513 | unpredictable */ | |
6343829a | 514 | static int ssleay_rand_pseudo_bytes(unsigned char *buf, int num) |
373b575f | 515 | { |
85628011 | 516 | int ret; |
47b0f48d | 517 | unsigned long err; |
373b575f UM |
518 | |
519 | ret = RAND_bytes(buf, num); | |
520 | if (ret == 0) | |
521 | { | |
47b0f48d | 522 | err = ERR_peek_error(); |
373b575f UM |
523 | if (ERR_GET_LIB(err) == ERR_LIB_RAND && |
524 | ERR_GET_REASON(err) == RAND_R_PRNG_NOT_SEEDED) | |
f763e0b5 | 525 | ERR_clear_error(); |
373b575f UM |
526 | } |
527 | return (ret); | |
528 | } | |
529 | ||
5eb8ca4d | 530 | static int ssleay_rand_status(void) |
4ec2d4d2 | 531 | { |
4c329696 | 532 | CRYPTO_THREADID cur; |
b841e0ac | 533 | int ret; |
6e6d04e2 | 534 | int do_not_lock; |
b841e0ac | 535 | |
4c329696 | 536 | CRYPTO_THREADID_current(&cur); |
6e6d04e2 BM |
537 | /* check if we already have the lock |
538 | * (could happen if a RAND_poll() implementation calls RAND_status()) */ | |
daba492c BM |
539 | if (crypto_lock_rand) |
540 | { | |
541 | CRYPTO_r_lock(CRYPTO_LOCK_RAND2); | |
4c329696 | 542 | do_not_lock = !CRYPTO_THREADID_cmp(&locking_threadid, &cur); |
daba492c BM |
543 | CRYPTO_r_unlock(CRYPTO_LOCK_RAND2); |
544 | } | |
545 | else | |
546 | do_not_lock = 0; | |
6e6d04e2 BM |
547 | |
548 | if (!do_not_lock) | |
549 | { | |
550 | CRYPTO_w_lock(CRYPTO_LOCK_RAND); | |
551 | ||
552 | /* prevent ssleay_rand_bytes() from trying to obtain the lock again */ | |
daba492c | 553 | CRYPTO_w_lock(CRYPTO_LOCK_RAND2); |
4c329696 | 554 | CRYPTO_THREADID_cpy(&locking_threadid, &cur); |
daba492c | 555 | CRYPTO_w_unlock(CRYPTO_LOCK_RAND2); |
badb910f | 556 | crypto_lock_rand = 1; |
6e6d04e2 BM |
557 | } |
558 | ||
4ec2d4d2 | 559 | if (!initialized) |
6e6d04e2 | 560 | { |
8ad7635e | 561 | RAND_poll(); |
6e6d04e2 BM |
562 | initialized = 1; |
563 | } | |
7ae634de | 564 | |
8ad7635e | 565 | ret = entropy >= ENTROPY_NEEDED; |
7ae634de | 566 | |
6e6d04e2 BM |
567 | if (!do_not_lock) |
568 | { | |
569 | /* before unlocking, we must clear 'crypto_lock_rand' */ | |
570 | crypto_lock_rand = 0; | |
6e6d04e2 BM |
571 | |
572 | CRYPTO_w_unlock(CRYPTO_LOCK_RAND); | |
573 | } | |
574 | ||
b841e0ac | 575 | return ret; |
4ec2d4d2 | 576 | } |