]>
Commit | Line | Data |
---|---|---|
2ace287d BM |
1 | /* crypto/rand/rand_win.c */ |
2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | |
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 | */ | |
58 | /* ==================================================================== | |
59 | * Copyright (c) 1998-2000 The OpenSSL Project. All rights reserved. | |
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 | */ | |
111 | ||
c0722725 UM |
112 | #include "cryptlib.h" |
113 | #include <openssl/rand.h> | |
114 | #include "rand_lcl.h" | |
2ace287d | 115 | |
bc36ee62 | 116 | #if defined(OPENSSL_SYS_WINDOWS) || defined(OPENSSL_SYS_WIN32) |
2ace287d | 117 | #include <windows.h> |
c0722725 UM |
118 | #ifndef _WIN32_WINNT |
119 | # define _WIN32_WINNT 0x0400 | |
2ace287d | 120 | #endif |
c0722725 UM |
121 | #include <wincrypt.h> |
122 | #include <tlhelp32.h> | |
123 | ||
124 | /* Intel hardware RNG CSP -- available from | |
125 | * http://developer.intel.com/design/security/rng/redist_license.htm | |
126 | */ | |
127 | #define PROV_INTEL_SEC 22 | |
128 | #define INTEL_DEF_PROV "Intel Hardware Cryptographic Service Provider" | |
129 | ||
130 | static void readtimer(void); | |
131 | static void readscreen(void); | |
132 | ||
7abee0ce RL |
133 | /* It appears like CURSORINFO, PCURSORINFO and LPCURSORINFO are only defined |
134 | when WINVER is 0x0500 and up, which currently only happens on Win2000. | |
135 | Unfortunately, those are typedefs, so they're a little bit difficult to | |
136 | detect properly. On the other hand, the macro CURSOR_SHOWING is defined | |
137 | within the same conditional, so it can be use to detect the absence of said | |
138 | typedefs. */ | |
139 | ||
c0366d89 | 140 | #ifndef CURSOR_SHOWING |
7abee0ce RL |
141 | /* |
142 | * Information about the global cursor. | |
143 | */ | |
144 | typedef struct tagCURSORINFO | |
145 | { | |
146 | DWORD cbSize; | |
147 | DWORD flags; | |
148 | HCURSOR hCursor; | |
149 | POINT ptScreenPos; | |
150 | } CURSORINFO, *PCURSORINFO, *LPCURSORINFO; | |
151 | ||
152 | #define CURSOR_SHOWING 0x00000001 | |
153 | #endif /* CURSOR_SHOWING */ | |
c0366d89 | 154 | |
c0722725 UM |
155 | typedef BOOL (WINAPI *CRYPTACQUIRECONTEXT)(HCRYPTPROV *, LPCTSTR, LPCTSTR, |
156 | DWORD, DWORD); | |
157 | typedef BOOL (WINAPI *CRYPTGENRANDOM)(HCRYPTPROV, DWORD, BYTE *); | |
158 | typedef BOOL (WINAPI *CRYPTRELEASECONTEXT)(HCRYPTPROV, DWORD); | |
159 | ||
160 | typedef HWND (WINAPI *GETFOREGROUNDWINDOW)(VOID); | |
161 | typedef BOOL (WINAPI *GETCURSORINFO)(PCURSORINFO); | |
162 | typedef DWORD (WINAPI *GETQUEUESTATUS)(UINT); | |
163 | ||
164 | typedef HANDLE (WINAPI *CREATETOOLHELP32SNAPSHOT)(DWORD, DWORD); | |
165 | typedef BOOL (WINAPI *HEAP32FIRST)(LPHEAPENTRY32, DWORD, DWORD); | |
166 | typedef BOOL (WINAPI *HEAP32NEXT)(LPHEAPENTRY32); | |
167 | typedef BOOL (WINAPI *HEAP32LIST)(HANDLE, LPHEAPLIST32); | |
168 | typedef BOOL (WINAPI *PROCESS32)(HANDLE, LPPROCESSENTRY32); | |
169 | typedef BOOL (WINAPI *THREAD32)(HANDLE, LPTHREADENTRY32); | |
170 | typedef BOOL (WINAPI *MODULE32)(HANDLE, LPMODULEENTRY32); | |
171 | ||
1d95fb65 RL |
172 | #include <lmcons.h> |
173 | #include <lmstats.h> | |
10bb0dbf RL |
174 | #if 1 /* The NET API is Unicode only. It requires the use of the UNICODE |
175 | * macro. When UNICODE is defined LPTSTR becomes LPWSTR. LMSTR was | |
176 | * was added to the Platform SDK to allow the NET API to be used in | |
177 | * non-Unicode applications provided that Unicode strings were still | |
178 | * used for input. LMSTR is defined as LPWSTR. | |
676432d4 | 179 | */ |
1d95fb65 | 180 | typedef NET_API_STATUS (NET_API_FUNCTION * NETSTATGET) |
10bb0dbf | 181 | (LPWSTR, LPWSTR, DWORD, DWORD, LPBYTE*); |
1d95fb65 | 182 | typedef NET_API_STATUS (NET_API_FUNCTION * NETFREE)(LPBYTE); |
10bb0dbf | 183 | #endif /* 1 */ |
1d95fb65 | 184 | |
c0722725 UM |
185 | int RAND_poll(void) |
186 | { | |
187 | MEMORYSTATUS m; | |
188 | HCRYPTPROV hProvider = 0; | |
189 | BYTE buf[64]; | |
190 | DWORD w; | |
191 | HWND h; | |
192 | ||
1d95fb65 | 193 | HMODULE advapi, kernel, user, netapi; |
362f2b69 RL |
194 | CRYPTACQUIRECONTEXT acquire = 0; |
195 | CRYPTGENRANDOM gen = 0; | |
196 | CRYPTRELEASECONTEXT release = 0; | |
10bb0dbf RL |
197 | #if 1 /* There was previously a problem with NETSTATGET. Currently, this |
198 | * section is still experimental, but if all goes well, this conditional | |
199 | * will be removed | |
676432d4 | 200 | */ |
362f2b69 RL |
201 | NETSTATGET netstatget = 0; |
202 | NETFREE netfree = 0; | |
10bb0dbf RL |
203 | #endif /* 1 */ |
204 | ||
205 | /* Determine the OS version we are on so we can turn off things | |
206 | * that do not work properly. | |
207 | */ | |
208 | OSVERSIONINFO osverinfo ; | |
209 | osverinfo.dwOSVersionInfoSize = sizeof(OSVERSIONINFO) ; | |
210 | GetVersionEx( &osverinfo ) ; | |
c0722725 UM |
211 | |
212 | /* load functions dynamically - not available on all systems */ | |
362f2b69 RL |
213 | advapi = LoadLibrary("ADVAPI32.DLL"); |
214 | kernel = LoadLibrary("KERNEL32.DLL"); | |
215 | user = LoadLibrary("USER32.DLL"); | |
216 | netapi = LoadLibrary("NETAPI32.DLL"); | |
1d95fb65 | 217 | |
10bb0dbf RL |
218 | #if 1 /* There was previously a problem with NETSTATGET. Currently, this |
219 | * section is still experimental, but if all goes well, this conditional | |
220 | * will be removed | |
676432d4 | 221 | */ |
1d95fb65 RL |
222 | if (netapi) |
223 | { | |
224 | netstatget = (NETSTATGET) GetProcAddress(netapi,"NetStatisticsGet"); | |
225 | netfree = (NETFREE) GetProcAddress(netapi,"NetApiBufferFree"); | |
226 | } | |
227 | ||
228 | if (netstatget && netfree) | |
229 | { | |
230 | LPBYTE outbuf; | |
10bb0dbf RL |
231 | /* NetStatisticsGet() is a Unicode only function |
232 | * STAT_WORKSTATION_0 contains 45 fields and STAT_SERVER_0 | |
233 | * contains 17 fields. We treat each field as a source of | |
234 | * one byte of entropy. | |
235 | */ | |
236 | ||
1d95fb65 RL |
237 | if (netstatget(NULL, L"LanmanWorkstation", 0, 0, &outbuf) == 0) |
238 | { | |
10bb0dbf | 239 | RAND_add(outbuf, sizeof(STAT_WORKSTATION_0), 45); |
1d95fb65 RL |
240 | netfree(outbuf); |
241 | } | |
242 | if (netstatget(NULL, L"LanmanServer", 0, 0, &outbuf) == 0) | |
243 | { | |
10bb0dbf | 244 | RAND_add(outbuf, sizeof(STAT_SERVER_0), 17); |
1d95fb65 RL |
245 | netfree(outbuf); |
246 | } | |
247 | } | |
248 | ||
362f2b69 RL |
249 | if (netapi) |
250 | FreeLibrary(netapi); | |
10bb0dbf | 251 | #endif /* 1 */ |
362f2b69 | 252 | |
10bb0dbf RL |
253 | /* It appears like this can cause an exception deep within ADVAPI32.DLL |
254 | * at random times on Windows 2000. Reported by Jeffrey Altman. | |
255 | * Only use it on NT. | |
256 | */ | |
cc85ec44 BM |
257 | /* Wolfgang Marczy <WMarczy@topcall.co.at> reports that |
258 | * the RegQueryValueEx call below can hang on NT4.0 (SP6). | |
259 | * So we don't use this at all for now. */ | |
260 | #if 0 | |
10bb0dbf RL |
261 | if ( osverinfo.dwPlatformId == VER_PLATFORM_WIN32_NT && |
262 | osverinfo.dwMajorVersion < 5) | |
1d95fb65 | 263 | { |
10bb0dbf RL |
264 | /* Read Performance Statistics from NT/2000 registry |
265 | * The size of the performance data can vary from call | |
266 | * to call so we must guess the size of the buffer to use | |
267 | * and increase its size if we get an ERROR_MORE_DATA | |
268 | * return instead of ERROR_SUCCESS. | |
269 | */ | |
270 | LONG rc=ERROR_MORE_DATA; | |
271 | char * buf=NULL; | |
272 | DWORD bufsz=0; | |
273 | DWORD length; | |
274 | ||
275 | while (rc == ERROR_MORE_DATA) | |
276 | { | |
277 | buf = realloc(buf,bufsz+8192); | |
278 | if (!buf) | |
279 | break; | |
280 | bufsz += 8192; | |
281 | ||
282 | length = bufsz; | |
283 | rc = RegQueryValueEx(HKEY_PERFORMANCE_DATA, "Global", | |
284 | NULL, NULL, buf, &length); | |
285 | } | |
286 | if (rc == ERROR_SUCCESS) | |
287 | { | |
288 | /* For entropy count assume only least significant | |
289 | * byte of each DWORD is random. | |
35a6db86 | 290 | */ |
10bb0dbf RL |
291 | RAND_add(&length, sizeof(length), 0); |
292 | RAND_add(buf, length, length / 4.0); | |
35a6db86 RL |
293 | |
294 | /* Close the Registry Key to allow Windows to cleanup/close | |
295 | * the open handle | |
296 | * Note: The 'HKEY_PERFORMANCE_DATA' key is implicitly opened | |
297 | * when the RegQueryValueEx above is done. However, if | |
298 | * it is not explicitly closed, it can cause disk | |
299 | * partition manipulation problems. | |
300 | */ | |
301 | RegCloseKey(HKEY_PERFORMANCE_DATA); | |
10bb0dbf RL |
302 | } |
303 | if (buf) | |
304 | free(buf); | |
1d95fb65 | 305 | } |
cc85ec44 | 306 | #endif |
c0722725 UM |
307 | |
308 | if (advapi) | |
309 | { | |
310 | acquire = (CRYPTACQUIRECONTEXT) GetProcAddress(advapi, | |
311 | "CryptAcquireContextA"); | |
312 | gen = (CRYPTGENRANDOM) GetProcAddress(advapi, | |
313 | "CryptGenRandom"); | |
314 | release = (CRYPTRELEASECONTEXT) GetProcAddress(advapi, | |
315 | "CryptReleaseContext"); | |
316 | } | |
317 | ||
318 | if (acquire && gen && release) | |
319 | { | |
320 | /* poll the CryptoAPI PRNG */ | |
10bb0dbf | 321 | /* The CryptoAPI returns sizeof(buf) bytes of randomness */ |
c0722725 UM |
322 | if (acquire(&hProvider, 0, 0, PROV_RSA_FULL, |
323 | CRYPT_VERIFYCONTEXT)) | |
324 | { | |
325 | if (gen(hProvider, sizeof(buf), buf) != 0) | |
326 | { | |
361c7f2b | 327 | RAND_add(buf, sizeof(buf), 0); |
3e563bce | 328 | #if 0 |
c0722725 | 329 | printf("randomness from PROV_RSA_FULL\n"); |
2ace287d | 330 | #endif |
c0722725 UM |
331 | } |
332 | release(hProvider, 0); | |
333 | } | |
334 | ||
335 | /* poll the Pentium PRG with CryptoAPI */ | |
336 | if (acquire(&hProvider, 0, INTEL_DEF_PROV, PROV_INTEL_SEC, 0)) | |
337 | { | |
338 | if (gen(hProvider, sizeof(buf), buf) != 0) | |
339 | { | |
10bb0dbf | 340 | RAND_add(buf, sizeof(buf), sizeof(buf)); |
3e563bce | 341 | #if 0 |
c0722725 UM |
342 | printf("randomness from PROV_INTEL_SEC\n"); |
343 | #endif | |
344 | } | |
345 | release(hProvider, 0); | |
346 | } | |
347 | } | |
348 | ||
362f2b69 RL |
349 | if (advapi) |
350 | FreeLibrary(advapi); | |
351 | ||
c0722725 UM |
352 | /* timer data */ |
353 | readtimer(); | |
354 | ||
355 | /* memory usage statistics */ | |
356 | GlobalMemoryStatus(&m); | |
357 | RAND_add(&m, sizeof(m), 1); | |
358 | ||
359 | /* process ID */ | |
360 | w = GetCurrentProcessId(); | |
10bb0dbf | 361 | RAND_add(&w, sizeof(w), 1); |
c0722725 UM |
362 | |
363 | if (user) | |
364 | { | |
365 | GETCURSORINFO cursor; | |
366 | GETFOREGROUNDWINDOW win; | |
848f3d40 | 367 | GETQUEUESTATUS queue; |
c0722725 UM |
368 | |
369 | win = (GETFOREGROUNDWINDOW) GetProcAddress(user, "GetForegroundWindow"); | |
370 | cursor = (GETCURSORINFO) GetProcAddress(user, "GetCursorInfo"); | |
848f3d40 | 371 | queue = (GETQUEUESTATUS) GetProcAddress(user, "GetQueueStatus"); |
c0722725 UM |
372 | |
373 | if (win) | |
10bb0dbf | 374 | { |
c0722725 UM |
375 | /* window handle */ |
376 | h = win(); | |
377 | RAND_add(&h, sizeof(h), 0); | |
10bb0dbf | 378 | } |
1d95fb65 RL |
379 | if (cursor) |
380 | { | |
381 | /* unfortunately, its not safe to call GetCursorInfo() | |
382 | * on NT4 even though it exists in SP3 (or SP6) and | |
383 | * higher. | |
384 | */ | |
1d95fb65 RL |
385 | if ( osverinfo.dwPlatformId == VER_PLATFORM_WIN32_NT && |
386 | osverinfo.dwMajorVersion < 5) | |
387 | cursor = 0; | |
388 | } | |
c0722725 UM |
389 | if (cursor) |
390 | { | |
391 | /* cursor position */ | |
10bb0dbf | 392 | /* assume 2 bytes of entropy */ |
1d95fb65 RL |
393 | CURSORINFO ci; |
394 | ci.cbSize = sizeof(CURSORINFO); | |
395 | if (cursor(&ci)) | |
10bb0dbf | 396 | RAND_add(&ci, ci.cbSize, 2); |
848f3d40 | 397 | } |
848f3d40 RL |
398 | |
399 | if (queue) | |
400 | { | |
401 | /* message queue status */ | |
10bb0dbf | 402 | /* assume 1 byte of entropy */ |
848f3d40 | 403 | w = queue(QS_ALLEVENTS); |
10bb0dbf | 404 | RAND_add(&w, sizeof(w), 1); |
c0722725 | 405 | } |
362f2b69 RL |
406 | |
407 | FreeLibrary(user); | |
c0722725 UM |
408 | } |
409 | ||
410 | /* Toolhelp32 snapshot: enumerate processes, threads, modules and heap | |
411 | * http://msdn.microsoft.com/library/psdk/winbase/toolhelp_5pfd.htm | |
1d95fb65 | 412 | * (Win 9x and 2000 only, not available on NT) |
c0722725 UM |
413 | * |
414 | * This seeding method was proposed in Peter Gutmann, Software | |
415 | * Generation of Practically Strong Random Numbers, | |
c0366d89 | 416 | * http://www.usenix.org/publications/library/proceedings/sec98/gutmann.html |
24b8bf21 | 417 | * revised version at http://www.cryptoengines.com/~peter/06_random.pdf |
c0722725 UM |
418 | * (The assignment of entropy estimates below is arbitrary, but based |
419 | * on Peter's analysis the full poll appears to be safe. Additional | |
420 | * interactive seeding is encouraged.) | |
421 | */ | |
422 | ||
423 | if (kernel) | |
424 | { | |
425 | CREATETOOLHELP32SNAPSHOT snap; | |
426 | HANDLE handle; | |
427 | ||
428 | HEAP32FIRST heap_first; | |
429 | HEAP32NEXT heap_next; | |
430 | HEAP32LIST heaplist_first, heaplist_next; | |
431 | PROCESS32 process_first, process_next; | |
432 | THREAD32 thread_first, thread_next; | |
433 | MODULE32 module_first, module_next; | |
434 | ||
435 | HEAPLIST32 hlist; | |
436 | HEAPENTRY32 hentry; | |
437 | PROCESSENTRY32 p; | |
438 | THREADENTRY32 t; | |
439 | MODULEENTRY32 m; | |
440 | ||
441 | snap = (CREATETOOLHELP32SNAPSHOT) | |
10bb0dbf | 442 | GetProcAddress(kernel, "CreateToolhelp32Snapshot"); |
c0722725 UM |
443 | heap_first = (HEAP32FIRST) GetProcAddress(kernel, "Heap32First"); |
444 | heap_next = (HEAP32NEXT) GetProcAddress(kernel, "Heap32Next"); | |
445 | heaplist_first = (HEAP32LIST) GetProcAddress(kernel, "Heap32ListFirst"); | |
446 | heaplist_next = (HEAP32LIST) GetProcAddress(kernel, "Heap32ListNext"); | |
447 | process_first = (PROCESS32) GetProcAddress(kernel, "Process32First"); | |
448 | process_next = (PROCESS32) GetProcAddress(kernel, "Process32Next"); | |
449 | thread_first = (THREAD32) GetProcAddress(kernel, "Thread32First"); | |
450 | thread_next = (THREAD32) GetProcAddress(kernel, "Thread32Next"); | |
451 | module_first = (MODULE32) GetProcAddress(kernel, "Module32First"); | |
452 | module_next = (MODULE32) GetProcAddress(kernel, "Module32Next"); | |
453 | ||
454 | if (snap && heap_first && heap_next && heaplist_first && | |
455 | heaplist_next && process_first && process_next && | |
456 | thread_first && thread_next && module_first && | |
457 | module_next && (handle = snap(TH32CS_SNAPALL,0)) | |
458 | != NULL) | |
459 | { | |
460 | /* heap list and heap walking */ | |
10bb0dbf RL |
461 | /* HEAPLIST32 contains 3 fields that will change with |
462 | * each entry. Consider each field a source of 1 byte | |
463 | * of entropy. | |
464 | * HEAPENTRY32 contains 5 fields that will change with | |
465 | * each entry. Consider each field a source of 1 byte | |
466 | * of entropy. | |
467 | */ | |
c0722725 UM |
468 | hlist.dwSize = sizeof(HEAPLIST32); |
469 | if (heaplist_first(handle, &hlist)) | |
470 | do | |
471 | { | |
10bb0dbf | 472 | RAND_add(&hlist, hlist.dwSize, 3); |
c0722725 UM |
473 | hentry.dwSize = sizeof(HEAPENTRY32); |
474 | if (heap_first(&hentry, | |
475 | hlist.th32ProcessID, | |
476 | hlist.th32HeapID)) | |
c0366d89 | 477 | { |
9f6fe8db | 478 | int entrycnt = 80; |
c0722725 UM |
479 | do |
480 | RAND_add(&hentry, | |
10bb0dbf | 481 | hentry.dwSize, 5); |
c0366d89 RL |
482 | while (heap_next(&hentry) |
483 | && --entrycnt > 0); | |
484 | } | |
c0722725 UM |
485 | } while (heaplist_next(handle, |
486 | &hlist)); | |
10bb0dbf | 487 | |
c0722725 | 488 | /* process walking */ |
10bb0dbf RL |
489 | /* PROCESSENTRY32 contains 9 fields that will change |
490 | * with each entry. Consider each field a source of | |
491 | * 1 byte of entropy. | |
492 | */ | |
c0722725 UM |
493 | p.dwSize = sizeof(PROCESSENTRY32); |
494 | if (process_first(handle, &p)) | |
495 | do | |
10bb0dbf | 496 | RAND_add(&p, p.dwSize, 9); |
c0722725 | 497 | while (process_next(handle, &p)); |
10bb0dbf | 498 | |
c0722725 | 499 | /* thread walking */ |
10bb0dbf RL |
500 | /* THREADENTRY32 contains 6 fields that will change |
501 | * with each entry. Consider each field a source of | |
502 | * 1 byte of entropy. | |
503 | */ | |
c0722725 UM |
504 | t.dwSize = sizeof(THREADENTRY32); |
505 | if (thread_first(handle, &t)) | |
506 | do | |
10bb0dbf | 507 | RAND_add(&t, t.dwSize, 6); |
c0722725 | 508 | while (thread_next(handle, &t)); |
10bb0dbf | 509 | |
c0722725 | 510 | /* module walking */ |
10bb0dbf RL |
511 | /* MODULEENTRY32 contains 9 fields that will change |
512 | * with each entry. Consider each field a source of | |
513 | * 1 byte of entropy. | |
514 | */ | |
c0722725 UM |
515 | m.dwSize = sizeof(MODULEENTRY32); |
516 | if (module_first(handle, &m)) | |
517 | do | |
10bb0dbf | 518 | RAND_add(&m, m.dwSize, 9); |
c0722725 | 519 | while (module_next(handle, &m)); |
10bb0dbf | 520 | |
c0722725 UM |
521 | CloseHandle(handle); |
522 | } | |
362f2b69 RL |
523 | |
524 | FreeLibrary(kernel); | |
c0722725 UM |
525 | } |
526 | ||
3e563bce | 527 | #if 0 |
c0722725 | 528 | printf("Exiting RAND_poll\n"); |
2ace287d BM |
529 | #endif |
530 | ||
c0722725 UM |
531 | return(1); |
532 | } | |
2ace287d BM |
533 | |
534 | int RAND_event(UINT iMsg, WPARAM wParam, LPARAM lParam) | |
535 | { | |
536 | double add_entropy=0; | |
2ace287d BM |
537 | |
538 | switch (iMsg) | |
539 | { | |
540 | case WM_KEYDOWN: | |
541 | { | |
542 | static WPARAM key; | |
543 | if (key != wParam) | |
544 | add_entropy = 0.05; | |
545 | key = wParam; | |
546 | } | |
547 | break; | |
548 | case WM_MOUSEMOVE: | |
549 | { | |
550 | static int lastx,lasty,lastdx,lastdy; | |
551 | int x,y,dx,dy; | |
552 | ||
553 | x=LOWORD(lParam); | |
554 | y=HIWORD(lParam); | |
555 | dx=lastx-x; | |
556 | dy=lasty-y; | |
557 | if (dx != 0 && dy != 0 && dx-lastdx != 0 && dy-lastdy != 0) | |
558 | add_entropy=.2; | |
559 | lastx=x, lasty=y; | |
560 | lastdx=dx, lastdy=dy; | |
561 | } | |
562 | break; | |
563 | } | |
564 | ||
c0722725 | 565 | readtimer(); |
2ace287d BM |
566 | RAND_add(&iMsg, sizeof(iMsg), add_entropy); |
567 | RAND_add(&wParam, sizeof(wParam), 0); | |
568 | RAND_add(&lParam, sizeof(lParam), 0); | |
c0722725 | 569 | |
2ace287d BM |
570 | return (RAND_status()); |
571 | } | |
572 | ||
573 | ||
c0722725 UM |
574 | void RAND_screen(void) /* function available for backward compatibility */ |
575 | { | |
576 | RAND_poll(); | |
577 | readscreen(); | |
578 | } | |
579 | ||
580 | ||
581 | /* feed timing information to the PRNG */ | |
582 | static void readtimer(void) | |
583 | { | |
159cf04e | 584 | DWORD w; |
c0722725 UM |
585 | LARGE_INTEGER l; |
586 | static int have_perfc = 1; | |
c1db5bfc | 587 | #ifdef _MSC_VER |
c0722725 | 588 | static int have_tsc = 1; |
159cf04e | 589 | DWORD cyclecount; |
c0722725 UM |
590 | |
591 | if (have_tsc) { | |
592 | __try { | |
593 | __asm { | |
429cf462 | 594 | _emit 0x0f |
40e15f9d | 595 | _emit 0x31 |
c0722725 UM |
596 | mov cyclecount, eax |
597 | } | |
598 | RAND_add(&cyclecount, sizeof(cyclecount), 1); | |
599 | } __except(EXCEPTION_EXECUTE_HANDLER) { | |
600 | have_tsc = 0; | |
601 | } | |
602 | } | |
603 | #else | |
604 | # define have_tsc 0 | |
605 | #endif | |
606 | ||
607 | if (have_perfc) { | |
608 | if (QueryPerformanceCounter(&l) == 0) | |
609 | have_perfc = 0; | |
610 | else | |
611 | RAND_add(&l, sizeof(l), 0); | |
612 | } | |
613 | ||
614 | if (!have_tsc && !have_perfc) { | |
615 | w = GetTickCount(); | |
616 | RAND_add(&w, sizeof(w), 0); | |
617 | } | |
618 | } | |
619 | ||
620 | /* feed screen contents to PRNG */ | |
2ace287d | 621 | /***************************************************************************** |
2ace287d BM |
622 | * |
623 | * Created 960901 by Gertjan van Oosten, gertjan@West.NL, West Consulting B.V. | |
624 | * | |
625 | * Code adapted from | |
626 | * <URL:http://www.microsoft.com/kb/developr/win_dk/q97193.htm>; | |
627 | * the original copyright message is: | |
628 | * | |
629 | * (C) Copyright Microsoft Corp. 1993. All rights reserved. | |
630 | * | |
631 | * You have a royalty-free right to use, modify, reproduce and | |
632 | * distribute the Sample Files (and/or any modified version) in | |
633 | * any way you find useful, provided that you agree that | |
634 | * Microsoft has no warranty obligations or liability for any | |
635 | * Sample Application Files which are modified. | |
636 | */ | |
c0722725 UM |
637 | |
638 | static void readscreen(void) | |
2ace287d BM |
639 | { |
640 | HDC hScrDC; /* screen DC */ | |
641 | HDC hMemDC; /* memory DC */ | |
642 | HBITMAP hBitmap; /* handle for our bitmap */ | |
643 | HBITMAP hOldBitmap; /* handle for previous bitmap */ | |
644 | BITMAP bm; /* bitmap properties */ | |
645 | unsigned int size; /* size of bitmap */ | |
646 | char *bmbits; /* contents of bitmap */ | |
647 | int w; /* screen width */ | |
648 | int h; /* screen height */ | |
649 | int y; /* y-coordinate of screen lines to grab */ | |
650 | int n = 16; /* number of screen lines to grab at a time */ | |
651 | ||
652 | /* Create a screen DC and a memory DC compatible to screen DC */ | |
653 | hScrDC = CreateDC("DISPLAY", NULL, NULL, NULL); | |
654 | hMemDC = CreateCompatibleDC(hScrDC); | |
655 | ||
656 | /* Get screen resolution */ | |
657 | w = GetDeviceCaps(hScrDC, HORZRES); | |
658 | h = GetDeviceCaps(hScrDC, VERTRES); | |
659 | ||
660 | /* Create a bitmap compatible with the screen DC */ | |
661 | hBitmap = CreateCompatibleBitmap(hScrDC, w, n); | |
662 | ||
663 | /* Select new bitmap into memory DC */ | |
664 | hOldBitmap = SelectObject(hMemDC, hBitmap); | |
665 | ||
666 | /* Get bitmap properties */ | |
667 | GetObject(hBitmap, sizeof(BITMAP), (LPSTR)&bm); | |
668 | size = (unsigned int)bm.bmWidthBytes * bm.bmHeight * bm.bmPlanes; | |
669 | ||
26a3a48d | 670 | bmbits = OPENSSL_malloc(size); |
2ace287d BM |
671 | if (bmbits) { |
672 | /* Now go through the whole screen, repeatedly grabbing n lines */ | |
673 | for (y = 0; y < h-n; y += n) | |
674 | { | |
675 | unsigned char md[MD_DIGEST_LENGTH]; | |
676 | ||
677 | /* Bitblt screen DC to memory DC */ | |
678 | BitBlt(hMemDC, 0, 0, w, n, hScrDC, 0, y, SRCCOPY); | |
679 | ||
680 | /* Copy bitmap bits from memory DC to bmbits */ | |
681 | GetBitmapBits(hBitmap, size, bmbits); | |
682 | ||
c0722725 | 683 | /* Get the hash of the bitmap */ |
2ace287d BM |
684 | MD(bmbits,size,md); |
685 | ||
c0722725 UM |
686 | /* Seed the random generator with the hash value */ |
687 | RAND_add(md, MD_DIGEST_LENGTH, 0); | |
2ace287d BM |
688 | } |
689 | ||
26a3a48d | 690 | OPENSSL_free(bmbits); |
2ace287d BM |
691 | } |
692 | ||
693 | /* Select old bitmap back into memory DC */ | |
694 | hBitmap = SelectObject(hMemDC, hOldBitmap); | |
695 | ||
696 | /* Clean up */ | |
697 | DeleteObject(hBitmap); | |
698 | DeleteDC(hMemDC); | |
699 | DeleteDC(hScrDC); | |
700 | } | |
701 | ||
2ace287d | 702 | #endif |