crypt.cpp文件中的编译错误 [英] compilation error in crypt.cpp file
本文介绍了crypt.cpp文件中的编译错误的处理方法，对大家解决问题具有一定的参考价值，需要的朋友们下面随着小编来一起学习吧！
问题描述
从此链接找到转换为C ++ crypt.h和crypt.cpp文件 .但是尝试编译后，我得到很多错误，但是头文件中描述的结构MD5:
Found converted to C++ crypt.h and crypt.cpp file from this link. But after trying to compile I get lots of errors, but structure MD5 described in header file:
Error 5 error C2027: use of undefined type 'MD5Context' c:\PROJECTS\C++\NewCamD_test\NewCamD_test\crypt.cpp 52 NewCamD_test
Error 6 error C2227: left of '->buf' must point to class/struct/union/generic type c:\PROJECTS\C++\NewCamD_test\NewCamD_test\crypt.cpp 52 NewCamD_test
Error 7 error C2027: use of undefined type 'MD5Context' c:\PROJECTS\C++\NewCamD_test\NewCamD_test\crypt.cpp 53 NewCamD_test
Error 8 error C2227: left of '->buf' must point to class/struct/union/generic type c:\PROJECTS\C++\NewCamD_test\NewCamD_test\crypt.cpp 53 NewCamD_test
Error 9 error C2027: use of undefined type 'MD5Context' c:\PROJECTS\C++\NewCamD_test\NewCamD_test\crypt.cpp 54 NewCamD_test
Error 10 error C2227: left of '->buf' must point to class/struct/union/generic type c:\PROJECTS\C++\NewCamD_test\NewCamD_test\crypt.cpp 54 NewCamD_test
Error 11 error C2027: use of undefined type 'MD5Context' c:\PROJECTS\C++\NewCamD_test\NewCamD_test\crypt.cpp 55 NewCamD_test
Error 12 error C2227: left of '->buf' must point to class/struct/union/generic type c:\PROJECTS\C++\NewCamD_test\NewCamD_test\crypt.cpp 55 NewCamD_test
Error 13 error C2027: use of undefined type 'MD5Context' c:\PROJECTS\C++\NewCamD_test\NewCamD_test\crypt.cpp 57 NewCamD_test
Error 14 error C2227: left of '->bits' must point to class/struct/union/generic type c:\PROJECTS\C++\NewCamD_test\NewCamD_test\crypt.cpp 57 NewCamD_test
Error 15 error C2027: use of undefined type 'MD5Context' c:\PROJECTS\C++\NewCamD_test\NewCamD_test\crypt.cpp 58 NewCamD_test
Error 16 error C2227: left of '->bits' must point to class/struct/union/generic type c:\PROJECTS\C++\NewCamD_test\NewCamD_test\crypt.cpp 58 NewCamD_test
Error 17 error C2065: 'uint32' : undeclared identifier c:\PROJECTS\C++\NewCamD_test\NewCamD_test\crypt.cpp 71 NewCamD_test
Error 18 error C2146: syntax error : missing ';' before identifier 't' c:\PROJECTS\C++\NewCamD_test\NewCamD_test\crypt.cpp 71 NewCamD_test
Error 19 error C2065: 't' : undeclared identifier c:\PROJECTS\C++\NewCamD_test\NewCamD_test\crypt.cpp 71 NewCamD_test
... total 102 errors
我对C ++很陌生，因此对于某些用户来说此错误可能很容易.添加下载的md5 文件不能解决任何问题.
正如我在评论中所说的，所有结构和uint32类型都在crypt.h头文件中描述，但由于某种原因未在cpp文件中链接(来自链接的crypt.h文件的副本):
I am quite new to C++ so this error might be easy for some users. Adding downloaded md5 file does not resolve any issues.
As I said in comments all structures and type uint32 is described in crypt.h header file but for some reason does not link in cpp file (copy of crypt.h file from link):
#ifndef CRYPT_H
#define CRYPT_H
#ifdef __alpha
typedef unsigned int uint32;
#else
typedef unsigned long uint32;
#endif
struct MD5Context {
uint32 buf[4];
uint32 bits[2];
unsigned char in[64];
};
static void MD5Transform(uint32 buf[4], uint32 const in[16]);
/*
* This is needed to make RSAREF happy on some MS-DOS compilers.
*/
typedef struct MD5Context MD5_CTX;
int compare_md5(const char *passwd, const char *crypt);
const char * crypt_md5(const char *pw, const char *salt);
#endif
例如由于未声明t变量而发生错误19(在updatwe为31之前)，但它在其上方几行声明为:
For example Error 19 (before updatwe was 31) occures because undeclared t variable, but it is declare a few lines above it as:
uint32 t;
在VS2008中浏览cpp代码(该文件最终包含crypt.h文件)，并在uint32上单击[CTRL + J]，将其显示在建议列表中.
添加我的crypt.cpp代码(来自上面提供的链接的代码):
Browsing cpp code (which definatelly includes crypt.h file) in VS2008 and clicking [CTRL + J] on uint32 shows it in the suggestion list.
Adding my crypt.cpp code (code from link provided above):
/*
http://www.experts-exchange.com/Programming/Languages/CPP/Q_20386956.html
* This code implements the MD5 message-digest algorithm.
* The algorithm is due to Ron Rivest. This code was
* written by Colin Plumb in 1993, no copyright is claimed.
* This code is in the public domain; do with it what you wish.
*
* Equivalent code is available from RSA Data Security, Inc.
* This code has been tested against that, and is equivalent,
* except that you don''t need to include two pages of legalese
* with every copy.
*
* To compute the message digest of a chunk of bytes, declare an
* MD5Context structure, pass it to MD5Init, call MD5Update as
* needed on buffers full of bytes, and then call MD5Final, which
* will fill a supplied 16-byte array with the digest.
*/
#include <string.h> /* for memcpy() */
#include "crypt.h"
#include "stdafx.h"
#include "md5.h"
#ifndef HIGHFIRST
#define byteReverse(buf, len) /* Nothing */
#else
static void byteReverse(unsigned char *buf, unsigned longs);
#ifndef ASM_MD5
/*
* Note: this code is harmless on little-endian machines.
*/
static void byteReverse(unsigned char *buf, unsigned longs)
{
uint32 t;
do {
t = (uint32) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
((unsigned) buf[1] << 8 | buf[0]);
*(uint32 *) buf = t;
buf += 4;
} while (--longs);
}
#endif
#endif
/*
* Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
* initialization constants.
*/
static void MD5Init(struct MD5Context *ctx)
{
ctx->buf[0] = 0x67452301;
ctx->buf[1] = 0xefcdab89;
ctx->buf[2] = 0x98badcfe;
ctx->buf[3] = 0x10325476;
ctx->bits[0] = 0;
ctx->bits[1] = 0;
}
/*
* Update context to reflect the concatenation of another buffer full
* of bytes.
*/
static void MD5Update(struct MD5Context *ctx, unsigned char const *buf, unsigned len)
{
//uint32 t;
/* Update bitcount */
uint32 t = ctx->bits[0];
if ((ctx->bits[0] = t + ((uint32) len << 3)) < t)
ctx->bits[1]++; /* Carry from low to high */
ctx->bits[1] += len >> 29;
t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
/* Handle any leading odd-sized chunks */
if (t) {
unsigned char *p = (unsigned char *) ctx->in + t;
t = 64 - t;
if (len < t) {
memcpy(p, buf, len);
return;
}
memcpy(p, buf, t);
byteReverse(ctx->in, 16);
MD5Transform(ctx->buf, (uint32 *) ctx->in);
buf += t;
len -= t;
}
/* Process data in 64-byte chunks */
while (len >= 64) {
memcpy(ctx->in, buf, 64);
byteReverse(ctx->in, 16);
MD5Transform(ctx->buf, (uint32 *) ctx->in);
buf += 64;
len -= 64;
}
/* Handle any remaining bytes of data. */
memcpy(ctx->in, buf, len);
}
/*
* Final wrapup - pad to 64-byte boundary with the bit pattern
* 1 0* (64-bit count of bits processed, MSB-first)
*/
static void MD5Final(unsigned char digest[16], struct MD5Context *ctx)
{
unsigned count;
unsigned char *p;
/* Compute number of bytes mod 64 */
count = (ctx->bits[0] >> 3) & 0x3F;
/* Set the first char of padding to 0x80. This is safe since there is
always at least one byte free */
p = ctx->in + count;
*p++ = 0x80;
/* Bytes of padding needed to make 64 bytes */
count = 64 - 1 - count;
/* Pad out to 56 mod 64 */
if (count < 8) {
/* Two lots of padding: Pad the first block to 64 bytes */
memset(p, 0, count);
byteReverse(ctx->in, 16);
MD5Transform(ctx->buf, (uint32 *) ctx->in);
/* Now fill the next block with 56 bytes */
memset(ctx->in, 0, 56);
} else {
/* Pad block to 56 bytes */
memset(p, 0, count - 8);
}
byteReverse(ctx->in, 14);
/* Append length in bits and transform */
((uint32 *) ctx->in)[14] = ctx->bits[0];
((uint32 *) ctx->in)[15] = ctx->bits[1];
MD5Transform(ctx->buf, (uint32 *) ctx->in);
byteReverse((unsigned char *) ctx->buf, 4);
memcpy(digest, ctx->buf, 16);
memset(ctx, 0, sizeof(ctx)); /* In case it''s sensitive */
}
#ifndef ASM_MD5
/* The four core functions - F1 is optimized somewhat */
/* #define F1(x, y, z) (x & y | ~x & z) */
#define F1(x, y, z) (z ^ (x & (y ^ z)))
#define F2(x, y, z) F1(z, x, y)
#define F3(x, y, z) (x ^ y ^ z)
#define F4(x, y, z) (y ^ (x | ~z))
/* This is the central step in the MD5 algorithm. */
#define MD5STEP(f, w, x, y, z, data, s) \
( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
/*
* The core of the MD5 algorithm, this alters an existing MD5 hash to
* reflect the addition of 16 longwords of new data. MD5Update blocks
* the data and converts bytes into longwords for this routine.
*/
static void MD5Transform(uint32 buf[4], uint32 const in[16])
{
register uint32 a, b, c, d;
a = buf[0];
b = buf[1];
c = buf[2];
d = buf[3];
MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
buf[0] += a;
buf[1] += b;
buf[2] += c;
buf[3] += d;
}
#endif
/* $Id: md5crypt.c,v 1.4 2001/06/04 22:12:54 orange Exp $
*
* ----------------------------------------------------------------------------
* "THE BEER-WARE LICENSE" (Revision 42):
* <phk@login.dknet.dk> wrote this file. As long as you retain this notice you
* can do whatever you want with this stuff. If we meet some day, and you think
* this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp
* ----------------------------------------------------------------------------
*
* Origin: Id: crypt.c,v 1.3 1995/05/30 05:42:22 rgrimes Exp
*/
/* additions on 2000.13.10 by Jon Mayo
* saltgen_md5
*/
#include <stdlib.h>
#include <string.h>
static const unsigned char itoa64[] = /* 0 ... 63 => ascii - 64 */
"./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
static void
to64(char *s, unsigned long v, int n)
{
while (--n >= 0) {
*s++ = itoa64[v&0x3f];
v >>= 6;
}
}
/*
* UNIX password
*
* Use MD5 for what it is best at...
*/
const char * crypt_md5(const char *pw, const char *salt)
{
const char *magic = "$1$";
/* This string is magic for this algorithm. Having
* it this way, we can get get better later on */
static char passwd[120], *p;
static const char *sp,*ep;
unsigned char final[16];
int sl,pl,i,j;
MD5_CTX ctx,ctx1;
unsigned long l;
/* Refine the Salt first */
sp = salt;
/* If it starts with the magic string, then skip that */
if(!strncmp(sp,magic,strlen(magic)))
sp += strlen(magic);
/* It stops at the first ''$'', max 8 chars */
for(ep=sp;*ep && *ep != ''$'' && ep < (sp+8);ep++)
continue;
/* get the length of the true salt */
sl = ep - sp;
MD5Init(&ctx);
/* The password first, since that is what is most unknown */
MD5Update(&ctx,(unsigned const char *)pw,strlen(pw));
/* Then our magic string */
MD5Update(&ctx,(unsigned const char *)magic,strlen(magic));
/* Then the raw salt */
MD5Update(&ctx,(unsigned const char *)sp,sl);
/* Then just as many characters of the MD5(pw,salt,pw) */
MD5Init(&ctx1);
MD5Update(&ctx1,(unsigned const char *)pw,strlen(pw));
MD5Update(&ctx1,(unsigned const char *)sp,sl);
MD5Update(&ctx1,(unsigned const char *)pw,strlen(pw));
MD5Final(final,&ctx1);
for(pl = strlen(pw); pl > 0; pl -= 16)
MD5Update(&ctx,(unsigned const char *)final,pl>16 ? 16 : pl);
/* Don''t leave anything around in vm they could use. */
memset(final,0,sizeof final);
/* Then something really weird... */
for (j=0,i = strlen(pw); i ; i >>= 1)
if(i&1)
MD5Update(&ctx, (unsigned const char *)final+j, 1);
else
MD5Update(&ctx, (unsigned const char *)pw+j, 1);
/* Now make the output string */
strcpy(passwd,magic);
strncat(passwd,sp,sl);
strcat(passwd,"$");
MD5Final(final,&ctx);
/*
* and now, just to make sure things don''t run too fast
* On a 60 Mhz Pentium this takes 34 msec, so you would
* need 30 seconds to build a 1000 entry dictionary...
*/
for(i=0;i<1000;i++) {
MD5Init(&ctx1);
if(i & 1)
MD5Update(&ctx1,(unsigned const char *)pw,strlen(pw));
else
MD5Update(&ctx1,(unsigned const char *)final,16);
if(i % 3)
MD5Update(&ctx1,(unsigned const char *)sp,sl);
if(i % 7)
MD5Update(&ctx1,(unsigned const char *)pw,strlen(pw));
if(i & 1)
MD5Update(&ctx1,(unsigned const char *)final,16);
else
MD5Update(&ctx1,(unsigned const char *)pw,strlen(pw));
MD5Final(final,&ctx1);
}
p = passwd + strlen(passwd);
l = (final[ 0]<<16) | (final[ 6]<<8) | final[12]; to64(p,l,4); p += 4;
l = (final[ 1]<<16) | (final[ 7]<<8) | final[13]; to64(p,l,4); p += 4;
l = (final[ 2]<<16) | (final[ 8]<<8) | final[14]; to64(p,l,4); p += 4;
l = (final[ 3]<<16) | (final[ 9]<<8) | final[15]; to64(p,l,4); p += 4;
l = (final[ 4]<<16) | (final[10]<<8) | final[ 5]; to64(p,l,4); p += 4;
l = final[11] ; to64(p,l,2); p += 2;
*p = ''\0'';
/* Don''t leave anything around in vm they could use. */
memset(final,0,sizeof final);
return passwd;
}
/* generates a pseudorandom salt. requires reentry rand_r() */
/*
const char *saltgen_md5(unsigned int seed)
{
int i;
static char salt[9];
for(i=0;i<(sizeof salt - 1);i++) {
salt[i]=itoa64[((unsigned)rand_r(&seed)) % 64];
}
salt[i]=0;
return salt;
}
*/
static int MD5getsalt(const char *passwd, const char **salt, int *len)
{
const char *magic = "$1$";
const char *sp;
const char *ep;
sp=passwd;
if(!strncmp(sp,magic,strlen(magic)))
sp += strlen(magic);
/* It stops at the first ''$'', max 8 chars */
for(ep=sp;*ep && *ep != ''$'' && ep < (sp+8);ep++) ;
/* get the length of the true salt */
*len=ep - sp;
*salt=sp;
/* TODO: return failure if it can''t find the salt */
return 1; /* success */
}
int compare_md5(const char *passwd, const char *crypt)
{
const char *saltptr;
int saltlen;
char salt[9];
const char *crypt2;
MD5getsalt(crypt,&saltptr,&saltlen);
memcpy(salt,saltptr,saltlen);
salt[saltlen]=0;
crypt2=crypt_md5(passwd,salt);
return !strcmp(crypt,crypt2); /* ret 1: match, 0: fail */
}
推荐答案
Id:md5crypt.c，v 1.4 2001/06/04 22:12:54 orange Exp
Id: md5crypt.c,v 1.4 2001/06/04 22:12:54 orange Exp
* * ------------------------------------------------- --------------------------- *啤酒许可证"(修订版42): *< phk@login.dknet.dk>写了这个文件.只要您保留此通知，您 *可以用这个东西做任何你想做的事情.如果有一天我们见面，你认为 *这东西值得，您可以给我买啤酒.波尔·亨宁·坎普(Poul-Henning Kamp) * ------------------------------------------------- --------------------------- * *来源:ID:crypt.c，v 1.3 1995/05/30 05:42:22 rgrimes Exp */ /*乔恩·梅奥(Jon Mayo)在2000.13.10上的添加 * saltgen_md5 */ #include< stdlib.h> #include< string.h> 静态const unsigned char itoa64 [] =/* 0 ... 63 => ASCII-64 */ "./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"； 静态空隙 to64(char * s，unsigned long v，int n) { 而(--n> = 0){ * s ++ = itoa64 [v& 0x3f]; v>> = 6; } } /* * UNIX密码 * *使用MD5的最大优点是... */ const char * crypt_md5(const char * pw，const char * salt) { const char * magic ="
* * ---------------------------------------------------------------------------- * "THE BEER-WARE LICENSE" (Revision 42): * <phk@login.dknet.dk> wrote this file. As long as you retain this notice you * can do whatever you want with this stuff. If we meet some day, and you think * this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp * ---------------------------------------------------------------------------- * * Origin: Id: crypt.c,v 1.3 1995/05/30 05:42:22 rgrimes Exp */ /* additions on 2000.13.10 by Jon Mayo * saltgen_md5 */ #include <stdlib.h> #include <string.h> static const unsigned char itoa64[] = /* 0 ... 63 => ascii - 64 */ "./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"; static void to64(char *s, unsigned long v, int n) { while (--n >= 0) { *s++ = itoa64[v&0x3f]; v >>= 6; } } /* * UNIX password * * Use MD5 for what it is best at... */ const char * crypt_md5(const char *pw, const char *salt) { const char *magic = "
1
这篇关于crypt.cpp文件中的编译错误的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
查看全文
