1998-12-21 18:52:47 +08:00
|
|
|
/* crypto/rand/md_rand.c */
|
1998-12-21 18:56:39 +08:00
|
|
|
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
|
1998-12-21 18:52:47 +08:00
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* This package is an SSL implementation written
|
|
|
|
* by Eric Young (eay@cryptsoft.com).
|
|
|
|
* The implementation was written so as to conform with Netscapes SSL.
|
|
|
|
*
|
|
|
|
* This library is free for commercial and non-commercial use as long as
|
|
|
|
* the following conditions are aheared to. The following conditions
|
|
|
|
* apply to all code found in this distribution, be it the RC4, RSA,
|
|
|
|
* lhash, DES, etc., code; not just the SSL code. The SSL documentation
|
|
|
|
* included with this distribution is covered by the same copyright terms
|
|
|
|
* except that the holder is Tim Hudson (tjh@cryptsoft.com).
|
|
|
|
*
|
|
|
|
* Copyright remains Eric Young's, and as such any Copyright notices in
|
|
|
|
* the code are not to be removed.
|
|
|
|
* If this package is used in a product, Eric Young should be given attribution
|
|
|
|
* as the author of the parts of the library used.
|
|
|
|
* This can be in the form of a textual message at program startup or
|
|
|
|
* in documentation (online or textual) provided with the package.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* "This product includes cryptographic software written by
|
|
|
|
* Eric Young (eay@cryptsoft.com)"
|
|
|
|
* The word 'cryptographic' can be left out if the rouines from the library
|
|
|
|
* being used are not cryptographic related :-).
|
|
|
|
* 4. If you include any Windows specific code (or a derivative thereof) from
|
|
|
|
* the apps directory (application code) you must include an acknowledgement:
|
|
|
|
* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* The licence and distribution terms for any publically available version or
|
|
|
|
* derivative of this code cannot be changed. i.e. this code cannot simply be
|
|
|
|
* copied and put under another distribution licence
|
|
|
|
* [including the GNU Public Licence.]
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <time.h>
|
1999-01-26 05:19:12 +08:00
|
|
|
#include <string.h>
|
1999-05-21 05:59:20 +08:00
|
|
|
|
|
|
|
#ifndef FLAT_INC
|
1999-05-21 06:18:49 +08:00
|
|
|
# include "../../e_os.h"
|
1999-05-21 05:59:20 +08:00
|
|
|
#else
|
|
|
|
# include "e_os.h"
|
|
|
|
#endif
|
|
|
|
|
1999-04-24 06:13:45 +08:00
|
|
|
#include <openssl/crypto.h>
|
1998-12-21 18:52:47 +08:00
|
|
|
|
|
|
|
#if !defined(USE_MD5_RAND) && !defined(USE_SHA1_RAND) && !defined(USE_MDC2_RAND) && !defined(USE_MD2_RAND)
|
1999-04-27 12:18:53 +08:00
|
|
|
#if !defined(NO_SHA) && !defined(NO_SHA1)
|
1998-12-21 18:52:47 +08:00
|
|
|
#define USE_SHA1_RAND
|
1999-04-27 12:18:53 +08:00
|
|
|
#elif !defined(NO_MD5)
|
|
|
|
#define USE_MD5_RAND
|
|
|
|
#elif !defined(NO_MDC2) && !defined(NO_DES)
|
1998-12-21 18:52:47 +08:00
|
|
|
#define USE_MDC2_RAND
|
|
|
|
#elif !defined(NO_MD2)
|
|
|
|
#define USE_MD2_RAND
|
|
|
|
#else
|
1999-04-27 12:18:53 +08:00
|
|
|
#error No message digest algorithm available
|
1998-12-21 18:52:47 +08:00
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Changed how the state buffer used. I now attempt to 'wrap' such
|
|
|
|
* that I don't run over the same locations the next time go through
|
|
|
|
* the 1023 bytes - many thanks to
|
|
|
|
* Robert J. LeBlanc <rjl@renaissoft.com> for his comments
|
|
|
|
*/
|
|
|
|
|
|
|
|
#if defined(USE_MD5_RAND)
|
1999-04-24 06:13:45 +08:00
|
|
|
#include <openssl/md5.h>
|
1998-12-21 18:52:47 +08:00
|
|
|
#define MD_DIGEST_LENGTH MD5_DIGEST_LENGTH
|
|
|
|
#define MD_CTX MD5_CTX
|
|
|
|
#define MD_Init(a) MD5_Init(a)
|
|
|
|
#define MD_Update(a,b,c) MD5_Update(a,b,c)
|
|
|
|
#define MD_Final(a,b) MD5_Final(a,b)
|
1998-12-21 19:00:56 +08:00
|
|
|
#define MD(a,b,c) MD5(a,b,c)
|
1998-12-21 18:52:47 +08:00
|
|
|
#elif defined(USE_SHA1_RAND)
|
1999-04-24 06:13:45 +08:00
|
|
|
#include <openssl/sha.h>
|
1998-12-21 18:52:47 +08:00
|
|
|
#define MD_DIGEST_LENGTH SHA_DIGEST_LENGTH
|
|
|
|
#define MD_CTX SHA_CTX
|
|
|
|
#define MD_Init(a) SHA1_Init(a)
|
|
|
|
#define MD_Update(a,b,c) SHA1_Update(a,b,c)
|
|
|
|
#define MD_Final(a,b) SHA1_Final(a,b)
|
1998-12-21 19:00:56 +08:00
|
|
|
#define MD(a,b,c) SHA1(a,b,c)
|
1998-12-21 18:52:47 +08:00
|
|
|
#elif defined(USE_MDC2_RAND)
|
1999-04-24 06:13:45 +08:00
|
|
|
#include <openssl/mdc2.h>
|
1998-12-21 18:52:47 +08:00
|
|
|
#define MD_DIGEST_LENGTH MDC2_DIGEST_LENGTH
|
|
|
|
#define MD_CTX MDC2_CTX
|
|
|
|
#define MD_Init(a) MDC2_Init(a)
|
|
|
|
#define MD_Update(a,b,c) MDC2_Update(a,b,c)
|
|
|
|
#define MD_Final(a,b) MDC2_Final(a,b)
|
1998-12-21 19:00:56 +08:00
|
|
|
#define MD(a,b,c) MDC2(a,b,c)
|
1998-12-21 18:52:47 +08:00
|
|
|
#elif defined(USE_MD2_RAND)
|
1999-04-24 06:13:45 +08:00
|
|
|
#include <openssl/md2.h>
|
1998-12-21 18:52:47 +08:00
|
|
|
#define MD_DIGEST_LENGTH MD2_DIGEST_LENGTH
|
|
|
|
#define MD_CTX MD2_CTX
|
|
|
|
#define MD_Init(a) MD2_Init(a)
|
|
|
|
#define MD_Update(a,b,c) MD2_Update(a,b,c)
|
|
|
|
#define MD_Final(a,b) MD2_Final(a,b)
|
1998-12-21 19:00:56 +08:00
|
|
|
#define MD(a,b,c) MD2(a,b,c)
|
1998-12-21 18:52:47 +08:00
|
|
|
#endif
|
|
|
|
|
1999-04-24 06:13:45 +08:00
|
|
|
#include <openssl/rand.h>
|
1998-12-21 18:52:47 +08:00
|
|
|
|
1998-12-21 19:00:56 +08:00
|
|
|
/* #define NORAND 1 */
|
|
|
|
/* #define PREDICT 1 */
|
1998-12-21 18:52:47 +08:00
|
|
|
|
|
|
|
#define STATE_SIZE 1023
|
|
|
|
static int state_num=0,state_index=0;
|
1998-12-21 18:56:39 +08:00
|
|
|
static unsigned char state[STATE_SIZE+MD_DIGEST_LENGTH];
|
1998-12-21 18:52:47 +08:00
|
|
|
static unsigned char md[MD_DIGEST_LENGTH];
|
1998-12-21 19:00:56 +08:00
|
|
|
static long md_count[2]={0,0};
|
1998-12-21 18:52:47 +08:00
|
|
|
|
1999-04-18 05:25:43 +08:00
|
|
|
const char *RAND_version="RAND" OPENSSL_VERSION_PTEXT;
|
1998-12-21 18:52:47 +08:00
|
|
|
|
1998-12-21 19:00:56 +08:00
|
|
|
static void ssleay_rand_cleanup(void);
|
1999-02-10 07:01:08 +08:00
|
|
|
static void ssleay_rand_seed(const void *buf, int num);
|
1998-12-21 19:00:56 +08:00
|
|
|
static void ssleay_rand_bytes(unsigned char *buf, int num);
|
|
|
|
|
1998-12-22 23:04:48 +08:00
|
|
|
RAND_METHOD rand_ssleay_meth={
|
1998-12-21 19:00:56 +08:00
|
|
|
ssleay_rand_seed,
|
|
|
|
ssleay_rand_bytes,
|
|
|
|
ssleay_rand_cleanup,
|
|
|
|
};
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
RAND_METHOD *RAND_SSLeay(void)
|
1998-12-21 19:00:56 +08:00
|
|
|
{
|
1998-12-22 23:04:48 +08:00
|
|
|
return(&rand_ssleay_meth);
|
1998-12-21 19:00:56 +08:00
|
|
|
}
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
static void ssleay_rand_cleanup(void)
|
1998-12-21 18:52:47 +08:00
|
|
|
{
|
1998-12-21 18:56:39 +08:00
|
|
|
memset(state,0,sizeof(state));
|
1998-12-21 18:52:47 +08:00
|
|
|
state_num=0;
|
|
|
|
state_index=0;
|
|
|
|
memset(md,0,MD_DIGEST_LENGTH);
|
1998-12-21 19:00:56 +08:00
|
|
|
md_count[0]=0;
|
|
|
|
md_count[1]=0;
|
1998-12-21 18:52:47 +08:00
|
|
|
}
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
static void ssleay_rand_seed(const void *buf, int num)
|
1998-12-21 18:52:47 +08:00
|
|
|
{
|
|
|
|
int i,j,k,st_idx,st_num;
|
|
|
|
MD_CTX m;
|
|
|
|
|
|
|
|
#ifdef NORAND
|
|
|
|
return;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
CRYPTO_w_lock(CRYPTO_LOCK_RAND);
|
|
|
|
st_idx=state_index;
|
|
|
|
st_num=state_num;
|
|
|
|
|
|
|
|
state_index=(state_index+num);
|
1998-12-21 18:56:39 +08:00
|
|
|
if (state_index >= STATE_SIZE)
|
1998-12-21 18:52:47 +08:00
|
|
|
{
|
|
|
|
state_index%=STATE_SIZE;
|
|
|
|
state_num=STATE_SIZE;
|
|
|
|
}
|
|
|
|
else if (state_num < STATE_SIZE)
|
|
|
|
{
|
|
|
|
if (state_index > state_num)
|
|
|
|
state_num=state_index;
|
|
|
|
}
|
|
|
|
CRYPTO_w_unlock(CRYPTO_LOCK_RAND);
|
|
|
|
|
|
|
|
for (i=0; i<num; i+=MD_DIGEST_LENGTH)
|
|
|
|
{
|
|
|
|
j=(num-i);
|
|
|
|
j=(j > MD_DIGEST_LENGTH)?MD_DIGEST_LENGTH:j;
|
|
|
|
|
|
|
|
MD_Init(&m);
|
|
|
|
MD_Update(&m,md,MD_DIGEST_LENGTH);
|
|
|
|
k=(st_idx+j)-STATE_SIZE;
|
|
|
|
if (k > 0)
|
|
|
|
{
|
|
|
|
MD_Update(&m,&(state[st_idx]),j-k);
|
|
|
|
MD_Update(&m,&(state[0]),k);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
MD_Update(&m,&(state[st_idx]),j);
|
|
|
|
|
|
|
|
MD_Update(&m,buf,j);
|
1998-12-21 19:00:56 +08:00
|
|
|
MD_Update(&m,(unsigned char *)&(md_count[0]),sizeof(md_count));
|
1998-12-21 18:52:47 +08:00
|
|
|
MD_Final(md,&m);
|
1998-12-21 19:00:56 +08:00
|
|
|
md_count[1]++;
|
1998-12-21 18:52:47 +08:00
|
|
|
|
1999-04-18 05:25:43 +08:00
|
|
|
buf=(const char *)buf + j;
|
1998-12-21 18:52:47 +08:00
|
|
|
|
|
|
|
for (k=0; k<j; k++)
|
|
|
|
{
|
|
|
|
state[st_idx++]^=md[k];
|
|
|
|
if (st_idx >= STATE_SIZE)
|
|
|
|
{
|
|
|
|
st_idx=0;
|
|
|
|
st_num=STATE_SIZE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
memset((char *)&m,0,sizeof(m));
|
|
|
|
}
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
static void ssleay_rand_bytes(unsigned char *buf, int num)
|
1998-12-21 18:52:47 +08:00
|
|
|
{
|
|
|
|
int i,j,k,st_num,st_idx;
|
|
|
|
MD_CTX m;
|
|
|
|
static int init=1;
|
|
|
|
unsigned long l;
|
|
|
|
#ifdef DEVRANDOM
|
|
|
|
FILE *fh;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef PREDICT
|
|
|
|
{
|
|
|
|
static unsigned char val=0;
|
|
|
|
|
|
|
|
for (i=0; i<num; i++)
|
|
|
|
buf[i]=val++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
CRYPTO_w_lock(CRYPTO_LOCK_RAND);
|
|
|
|
|
|
|
|
if (init)
|
|
|
|
{
|
|
|
|
CRYPTO_w_unlock(CRYPTO_LOCK_RAND);
|
|
|
|
/* put in some default random data, we need more than
|
|
|
|
* just this */
|
1999-02-10 07:01:08 +08:00
|
|
|
RAND_seed(&m,sizeof(m));
|
1998-12-21 18:52:47 +08:00
|
|
|
#ifndef MSDOS
|
|
|
|
l=getpid();
|
1999-02-10 07:01:08 +08:00
|
|
|
RAND_seed(&l,sizeof(l));
|
1998-12-21 18:52:47 +08:00
|
|
|
l=getuid();
|
1999-02-10 07:01:08 +08:00
|
|
|
RAND_seed(&l,sizeof(l));
|
1998-12-21 18:52:47 +08:00
|
|
|
#endif
|
|
|
|
l=time(NULL);
|
1999-02-10 07:01:08 +08:00
|
|
|
RAND_seed(&l,sizeof(l));
|
1998-12-21 18:52:47 +08:00
|
|
|
|
1998-12-21 18:56:39 +08:00
|
|
|
/* #ifdef DEVRANDOM */
|
1998-12-21 18:52:47 +08:00
|
|
|
/*
|
|
|
|
* Use a random entropy pool device.
|
|
|
|
* Linux 1.3.x and FreeBSD-Current has
|
|
|
|
* this. Use /dev/urandom if you can
|
|
|
|
* as /dev/random will block if it runs out
|
|
|
|
* of random entries.
|
|
|
|
*/
|
|
|
|
if ((fh = fopen(DEVRANDOM, "r")) != NULL)
|
|
|
|
{
|
1998-12-21 18:56:39 +08:00
|
|
|
unsigned char tmpbuf[32];
|
1998-12-21 18:52:47 +08:00
|
|
|
|
1998-12-21 18:56:39 +08:00
|
|
|
fread((unsigned char *)tmpbuf,1,32,fh);
|
1998-12-21 18:52:47 +08:00
|
|
|
/* we don't care how many bytes we read,
|
|
|
|
* we will just copy the 'stack' if there is
|
|
|
|
* nothing else :-) */
|
|
|
|
fclose(fh);
|
1998-12-21 18:56:39 +08:00
|
|
|
RAND_seed(tmpbuf,32);
|
|
|
|
memset(tmpbuf,0,32);
|
1998-12-21 18:52:47 +08:00
|
|
|
}
|
1998-12-21 18:56:39 +08:00
|
|
|
/* #endif */
|
1998-12-21 18:52:47 +08:00
|
|
|
#ifdef PURIFY
|
|
|
|
memset(state,0,STATE_SIZE);
|
|
|
|
memset(md,0,MD_DIGEST_LENGTH);
|
|
|
|
#endif
|
|
|
|
CRYPTO_w_lock(CRYPTO_LOCK_RAND);
|
1999-04-22 21:37:46 +08:00
|
|
|
init=0;
|
1998-12-21 18:52:47 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
st_idx=state_index;
|
|
|
|
st_num=state_num;
|
|
|
|
state_index+=num;
|
|
|
|
if (state_index > state_num)
|
|
|
|
state_index=(state_index%state_num);
|
|
|
|
|
|
|
|
CRYPTO_w_unlock(CRYPTO_LOCK_RAND);
|
|
|
|
|
|
|
|
while (num > 0)
|
|
|
|
{
|
|
|
|
j=(num >= MD_DIGEST_LENGTH/2)?MD_DIGEST_LENGTH/2:num;
|
|
|
|
num-=j;
|
|
|
|
MD_Init(&m);
|
|
|
|
MD_Update(&m,&(md[MD_DIGEST_LENGTH/2]),MD_DIGEST_LENGTH/2);
|
1998-12-21 19:00:56 +08:00
|
|
|
MD_Update(&m,(unsigned char *)&(md_count[0]),sizeof(md_count));
|
1998-12-21 18:52:47 +08:00
|
|
|
#ifndef PURIFY
|
|
|
|
MD_Update(&m,buf,j); /* purify complains */
|
|
|
|
#endif
|
|
|
|
k=(st_idx+j)-st_num;
|
|
|
|
if (k > 0)
|
|
|
|
{
|
|
|
|
MD_Update(&m,&(state[st_idx]),j-k);
|
|
|
|
MD_Update(&m,&(state[0]),k);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
MD_Update(&m,&(state[st_idx]),j);
|
|
|
|
MD_Final(md,&m);
|
|
|
|
|
|
|
|
for (i=0; i<j; i++)
|
|
|
|
{
|
|
|
|
if (st_idx >= st_num)
|
|
|
|
st_idx=0;
|
|
|
|
state[st_idx++]^=md[i];
|
|
|
|
*(buf++)=md[i+MD_DIGEST_LENGTH/2];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
MD_Init(&m);
|
1998-12-21 19:00:56 +08:00
|
|
|
MD_Update(&m,(unsigned char *)&(md_count[0]),sizeof(md_count));
|
|
|
|
md_count[0]++;
|
1998-12-21 18:52:47 +08:00
|
|
|
MD_Update(&m,md,MD_DIGEST_LENGTH);
|
|
|
|
MD_Final(md,&m);
|
|
|
|
memset(&m,0,sizeof(m));
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef WINDOWS
|
|
|
|
#include <windows.h>
|
1999-04-26 04:57:09 +08:00
|
|
|
#include <openssl/rand.h>
|
1998-12-21 18:52:47 +08:00
|
|
|
|
|
|
|
/*****************************************************************************
|
|
|
|
* Initialisation function for the SSL random generator. Takes the contents
|
|
|
|
* of the screen as random seed.
|
|
|
|
*
|
|
|
|
* Created 960901 by Gertjan van Oosten, gertjan@West.NL, West Consulting B.V.
|
|
|
|
*
|
|
|
|
* Code adapted from
|
|
|
|
* <URL:http://www.microsoft.com/kb/developr/win_dk/q97193.htm>;
|
|
|
|
* the original copyright message is:
|
|
|
|
*
|
1999-02-27 20:17:40 +08:00
|
|
|
* (C) Copyright Microsoft Corp. 1993. All rights reserved.
|
|
|
|
*
|
|
|
|
* You have a royalty-free right to use, modify, reproduce and
|
|
|
|
* distribute the Sample Files (and/or any modified version) in
|
|
|
|
* any way you find useful, provided that you agree that
|
|
|
|
* Microsoft has no warranty obligations or liability for any
|
|
|
|
* Sample Application Files which are modified.
|
1998-12-21 18:52:47 +08:00
|
|
|
*/
|
|
|
|
/*
|
|
|
|
* I have modified the loading of bytes via RAND_seed() mechanism since
|
|
|
|
* the origional would have been very very CPU intensive since RAND_seed()
|
|
|
|
* does an MD5 per 16 bytes of input. The cost to digest 16 bytes is the same
|
|
|
|
* as that to digest 56 bytes. So under the old system, a screen of
|
|
|
|
* 1024*768*256 would have been CPU cost of approximatly 49,000 56 byte MD5
|
|
|
|
* digests or digesting 2.7 mbytes. What I have put in place would
|
|
|
|
* be 48 16k MD5 digests, or efectivly 48*16+48 MD5 bytes or 816 kbytes
|
|
|
|
* or about 3.5 times as much.
|
|
|
|
* - eric
|
|
|
|
*/
|
|
|
|
void RAND_screen(void)
|
|
|
|
{
|
|
|
|
HDC hScrDC; /* screen DC */
|
|
|
|
HDC hMemDC; /* memory DC */
|
|
|
|
HBITMAP hBitmap; /* handle for our bitmap */
|
|
|
|
HBITMAP hOldBitmap; /* handle for previous bitmap */
|
|
|
|
BITMAP bm; /* bitmap properties */
|
|
|
|
unsigned int size; /* size of bitmap */
|
|
|
|
char *bmbits; /* contents of bitmap */
|
|
|
|
int w; /* screen width */
|
|
|
|
int h; /* screen height */
|
|
|
|
int y; /* y-coordinate of screen lines to grab */
|
|
|
|
int n = 16; /* number of screen lines to grab at a time */
|
|
|
|
|
|
|
|
/* Create a screen DC and a memory DC compatible to screen DC */
|
|
|
|
hScrDC = CreateDC("DISPLAY", NULL, NULL, NULL);
|
|
|
|
hMemDC = CreateCompatibleDC(hScrDC);
|
|
|
|
|
|
|
|
/* Get screen resolution */
|
|
|
|
w = GetDeviceCaps(hScrDC, HORZRES);
|
|
|
|
h = GetDeviceCaps(hScrDC, VERTRES);
|
|
|
|
|
|
|
|
/* Create a bitmap compatible with the screen DC */
|
|
|
|
hBitmap = CreateCompatibleBitmap(hScrDC, w, n);
|
|
|
|
|
|
|
|
/* Select new bitmap into memory DC */
|
|
|
|
hOldBitmap = SelectObject(hMemDC, hBitmap);
|
|
|
|
|
|
|
|
/* Get bitmap properties */
|
|
|
|
GetObject(hBitmap, sizeof(BITMAP), (LPSTR)&bm);
|
|
|
|
size = (unsigned int)bm.bmWidthBytes * bm.bmHeight * bm.bmPlanes;
|
|
|
|
|
|
|
|
bmbits = Malloc(size);
|
|
|
|
if (bmbits) {
|
|
|
|
/* Now go through the whole screen, repeatedly grabbing n lines */
|
|
|
|
for (y = 0; y < h-n; y += n)
|
|
|
|
{
|
|
|
|
unsigned char md[MD_DIGEST_LENGTH];
|
|
|
|
|
|
|
|
/* Bitblt screen DC to memory DC */
|
|
|
|
BitBlt(hMemDC, 0, 0, w, n, hScrDC, 0, y, SRCCOPY);
|
|
|
|
|
|
|
|
/* Copy bitmap bits from memory DC to bmbits */
|
|
|
|
GetBitmapBits(hBitmap, size, bmbits);
|
|
|
|
|
|
|
|
/* Get the MD5 of the bitmap */
|
1998-12-21 19:00:56 +08:00
|
|
|
MD(bmbits,size,md);
|
1998-12-21 18:52:47 +08:00
|
|
|
|
|
|
|
/* Seed the random generator with the MD5 digest */
|
|
|
|
RAND_seed(md, MD_DIGEST_LENGTH);
|
|
|
|
}
|
|
|
|
|
|
|
|
Free(bmbits);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Select old bitmap back into memory DC */
|
|
|
|
hBitmap = SelectObject(hMemDC, hOldBitmap);
|
|
|
|
|
|
|
|
/* Clean up */
|
|
|
|
DeleteObject(hBitmap);
|
|
|
|
DeleteDC(hMemDC);
|
|
|
|
DeleteDC(hScrDC);
|
|
|
|
}
|
|
|
|
#endif
|