网上找了几个MD5类库，只有这个可用
md5.h
#ifndef _MD5_H
#define _MD5_H
/* MD5 Class. */
class MD5_CTX {
public:
MD5_CTX();
virtual ~MD5_CTX();
bool GetFileMd5(char *pMd5, const char *pFileName);
private:
unsigned long int state[4]; /* state (ABCD) */
unsigned long int count[2]; /* number of bits, modulo 2^64 (lsb first) */
unsigned char buffer[64]; /* input buffer */
unsigned char PADDING[64]; /* What? */
private:
void MD5Init ();
void MD5Update( unsigned char *input, unsigned int inputLen);
void MD5Final (unsigned char digest[16]);
void MD5Transform (unsigned long int state[4], unsigned char block[64]);
void MD5_memcpy (unsigned char* output, unsigned char* input,unsigned int len);
void Encode (unsigned char *output, unsigned long int *input,unsigned int len);
void Decode (unsigned long int *output, unsigned char *input, unsigned int len);
void MD5_memset (unsigned char* output,int value,unsigned int len);
};
#endifmd5.cpp
#include "md5.h"
#include <iostream>
#include <fstream>
/* Constants for MD5Transform routine.
*/
#define S11 7
#define S12 12
#define S13 17
#define S14 22
#define S21 5
#define S22 9
#define S23 14
#define S24 20
#define S31 4
#define S32 11
#define S33 16
#define S34 23
#define S41 6
#define S42 10
#define S43 15
#define S44 21
/* F, G, H and I are basic MD5 functions.
*/
#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
#define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
#define H(x, y, z) ((x) ^ (y) ^ (z))
#define I(x, y, z) ((y) ^ ((x) | (~z)))
/* ROTATE_LEFT rotates x left n bits.
*/
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
/* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
Rotation is separate from addition to prevent recomputation.
*/
#define FF(a, b, c, d, x, s, ac) { \
(a) += F ((b), (c), (d)) + (x) + (unsigned long int)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define GG(a, b, c, d, x, s, ac) { \
(a) += G ((b), (c), (d)) + (x) + (unsigned long int)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define HH(a, b, c, d, x, s, ac) { \
(a) += H ((b), (c), (d)) + (x) + (unsigned long int)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define II(a, b, c, d, x, s, ac) { \
(a) += I ((b), (c), (d)) + (x) + (unsigned long int)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
/* MD5 initialization. Begins an MD5 operation, writing a new context.
*/
MD5_CTX::MD5_CTX()
{
MD5Init ();
}
MD5_CTX::~MD5_CTX()
{
}
void MD5_CTX::MD5Init ()
{
this->count[0] = this->count[1] = 0;
/* Load magic initialization constants.*/
this->state[0] = 0x67452301;
this->state[1] = 0xefcdab89;
this->state[2] = 0x98badcfe;
this->state[3] = 0x10325476;
/* Add by Liguangyi */
MD5_memset(PADDING, 0, sizeof(PADDING));
*PADDING=0x80;
//PADDING = {
// 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
// 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
// 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
}
#define UPDATE_MD5_LEN 16
bool MD5_CTX::GetFileMd5(char *pMd5, const char *pFileName)
{
unsigned char chDigest[UPDATE_MD5_LEN] = {0};
FILE * pFile = fopen(pFileName, "rb");
if(NULL == pFile)
{
return false;
}
fseek(pFile,0, SEEK_END);
int length = ftell(pFile);
fseek(pFile,0, SEEK_SET);
unsigned char *pInPut = (unsigned char *)malloc(length);
fread(pInPut, 1, length, pFile);
MD5Update(pInPut, length);
MD5Final(chDigest);
if (pInPut)
{
free(pInPut);
}
fclose(pFile);
char szmd5[UPDATE_MD5_LEN*2+1] = {0};
char szmd5buf[3] = {0};
for (int i = 0; i < UPDATE_MD5_LEN; i++)
{
::itoa(chDigest[i], szmd5buf, 16);
if ( 0 == szmd5buf[1])
{
strcat(szmd5, "0");
strcat(szmd5, szmd5buf);
}else
{
strcat(szmd5, szmd5buf);
}
}
strcpy(pMd5, szmd5);
return true;
}
/* MD5 block update operation. Continues an MD5 message-digest
operation, processing another message block, and updating the
context.
*/
void MD5_CTX::MD5Update (unsigned char *input,unsigned int inputLen)
{
unsigned int i, index, partLen;
/* Compute number of bytes mod 64 */
index = (unsigned int)((this->count[0] >> 3) & 0x3F);
/* Update number of bits */
if ((this->count[0] += ((unsigned long int)inputLen << 3))
< ((unsigned long int)inputLen << 3))
this->count[1]++;
this->count[1] += ((unsigned long int)inputLen >> 29);
partLen = 64 - index;
/* Transform as many times as possible.
*/
if (inputLen >= partLen) {
MD5_memcpy((unsigned char*)&this->buffer[index],
(unsigned char*)input, partLen);
MD5Transform (this->state, this->buffer);
for (i = partLen; i + 63 < inputLen; i += 64)
MD5Transform (this->state, &input[i]);
index = 0;
}
else
i = 0;
/* Buffer remaining input */
MD5_memcpy ((unsigned char*)&this->buffer[index], (unsigned char*)&input[i], inputLen-i);
}
/* MD5 finalization. Ends an MD5 message-digest operation, writing the
the message digest and zeroizing the context.
*/
void MD5_CTX::MD5Final (unsigned char digest[16])
{
unsigned char bits[8];
unsigned int index, padLen;
/* Save number of bits */
Encode (bits, this->count, 8);
/* Pad out to 56 mod 64.
*/
index = (unsigned int)((this->count[0] >> 3) & 0x3f);
padLen = (index < 56) ? (56 - index) : (120 - index);
MD5Update ( PADDING, padLen);
/* Append length (before padding) */
MD5Update (bits, 8);
/* Store state in digest */
Encode (digest, this->state, 16);
/* Zeroize sensitive information.
*/
MD5_memset ((unsigned char*)this, 0, sizeof (*this));
this->MD5Init();
}
/* MD5 basic transformation. Transforms state based on block.
*/
void MD5_CTX::MD5Transform (unsigned long int state[4], unsigned char block[64])
{
unsigned long int a = state[0], b = state[1], c = state[2], d = state[3], x[16];
Decode (x, block, 64);
/* Round 1 */
FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
/* Round 2 */
GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
/* Round 3 */
HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
/* Round 4 */
II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
state[0] += a;
state[1] += b;
state[2] += c;
state[3] += d;
/* Zeroize sensitive information.
*/
MD5_memset ((unsigned char*)x, 0, sizeof (x));
}
/* Encodes input (unsigned long int) into output (unsigned char). Assumes len is
a multiple of 4.
*/
void MD5_CTX::Encode (unsigned char *output, unsigned long int *input,unsigned int len)
{
unsigned int i, j;
for (i = 0, j = 0; j < len; i++, j += 4) {
output[j] = (unsigned char)(input[i] & 0xff);
output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
}
}
/* Decodes input (unsigned char) into output (unsigned long int). Assumes len is
a multiple of 4.
*/
void MD5_CTX::Decode (unsigned long int *output, unsigned char *input, unsigned int len)
{
unsigned int i, j;
for (i = 0, j = 0; j < len; i++, j += 4)
output[i] = ((unsigned long int)input[j]) | (((unsigned long int)input[j+1]) << 8) |
(((unsigned long int)input[j+2]) << 16) | (((unsigned long int)input[j+3]) << 24);
}
/* Note: Replace "for loop" with standard memcpy if possible.
*/
void MD5_CTX::MD5_memcpy (unsigned char* output, unsigned char* input,unsigned int len)
{
unsigned int i;
for (i = 0; i < len; i++)
output[i] = input[i];
}
/* Note: Replace "for loop" with standard memset if possible.
*/
void MD5_CTX::MD5_memset (unsigned char* output,int value,unsigned int len)
{
unsigned int i;
for (i = 0; i < len; i++)
((char *)output)[i] = (char)value;
}DiskInfo.h
#ifndef __DISKINFO_H
#define __DISKINFO_H
#include <xstring>
#include <string>
#include <vector>
#include <sstream>
#include <windows.h>
using namespace std;
// 获取磁盘信息类
class DiskInfo
{
public:
DiskInfo();
~DiskInfo();
typedef vector<string> typeStr;
typedef vector<wstring> typeWStr;
typeStr &GetDiskSubareaList(); // 获取磁盘分区信息的列表
typeWStr &GetDiskSubareaListW(); // 获取磁盘分区信息的列表
int Find(string sPath, string sFext = ""); // 查找目录下的文件和目录地址
inline int Count(); // 获取目录下文件和目录的总数
typeStr &Content(); // 获取目录下所有文件和目录的地址
typeStr &ContentDir(); // 获取目录下所有目录的地址
typeStr &ContentFile(); // 获取目录下所有文件的地址
void SetFindChildDir(bool bFind); // 设置是否查找子目录
bool GetFindChildDir(); // 获取是否查找子目录
bool Dir(string s); // 判断s是否为目录
void SetLimit(unsigned int iLimit); // 设置查找文件数目上限
int GetLimit(); // 获取查找文件数目上限
virtual int Match(string sFext, string sFile); // 文件匹配检测
inline string Uppercase(string s); // 转换为大写字母
protected:
private:
void ReadDiskSubareaInfo(); // 读取磁盘的分区信息
void ReadDiskSubareaInfoW(); // 读取磁盘的分区信息
inline bool Limit(); // 判断是否超过查找的文件数目上限
typeStr m_diskSubareaList; // 储存磁盘分区信息的列表
typeWStr m_diskSubareaListW; // 储存磁盘分区信息的列表
typeStr m_contentFile; // 储存文件的地址
typeStr m_contentDir; // 储存目录的地址
typeStr m_content; // 储存文件和目录的地址
bool m_childDir; // 是否查找子目录(默认flase-不查找)
int m_limit; // 查找文件数目上限(默认0-无上限)
};
#endifDiskInfo.cpp
#include "DiskInfo.h"
#include <wchar.h>
#include<stdio.h>
DiskInfo::DiskInfo() : m_childDir(false), m_limit(0)
{
ReadDiskSubareaInfo();
}
DiskInfo::~DiskInfo()
{
}
// 读取磁盘分区信息
void DiskInfo::ReadDiskSubareaInfoW()
{
typeWStr diskSubareaList;
wchar_t *szBuffer = new wchar_t[100];
GetLogicalDriveStrings(100, szBuffer);
while(*szBuffer != '\0')
{
diskSubareaList.push_back(szBuffer);
szBuffer += wcslen(szBuffer) + 1;
}
m_diskSubareaListW = diskSubareaList;
return;
}
void DiskInfo::ReadDiskSubareaInfo()
{
typeStr diskSubareaList;
char *szBuffer = new char[100];
GetLogicalDriveStringsA(100, szBuffer);
while(*szBuffer != '\0')
{
diskSubareaList.push_back(szBuffer);
szBuffer += strlen(szBuffer) + 1;
}
m_diskSubareaList = diskSubareaList;
return;
}
// 获取磁盘分区信息的列表
DiskInfo::typeStr &DiskInfo::GetDiskSubareaList()
{
return m_diskSubareaList;
}
// 获取磁盘分区信息的列表
DiskInfo::typeWStr &DiskInfo::GetDiskSubareaListW()
{
return m_diskSubareaListW;
}
// 查找目录下的文件和目录地址
int DiskInfo::Find(string sPath, string sFext /* = "" */)
{
const char c_pathSeparator = '\\';
const string s_pathSeparator = "\\";
m_contentFile.clear();
m_contentDir.clear();
m_content.clear();
string path = sPath;
if (path.size() > 0 && c_pathSeparator != path[path.size() - 1])
{
path.append(s_pathSeparator);
}
m_contentDir.push_back( path );
string fext = sFext;
if (0 == fext.compare("*") || 0 == fext.compare("*.*"))
{
fext = "";
}
//string file = fext;
string file = "*";
string s = path + file;
WIN32_FIND_DATAA fileinfo = {0};
HANDLE handle = FindFirstFileA( s.c_str(), &fileinfo );
if (NULL != handle && INVALID_HANDLE_VALUE != handle)
{
do
{
if (Limit()) break; //--limit test
if ('.' != fileinfo.cFileName[0]) //--skip./..
{
if ((FILE_ATTRIBUTE_DIRECTORY & fileinfo.dwFileAttributes) == FILE_ATTRIBUTE_DIRECTORY) //--目录
{
if (!Limit()/*&& 0 == fext.size()*/) /*--limit test*/
{
m_contentDir.push_back( path + fileinfo.cFileName + s_pathSeparator );
}
if (GetFindChildDir())
{
DiskInfo o;
o.SetFindChildDir(GetFindChildDir());
o.Find( path + fileinfo.cFileName, fext);
//--dir
typeStr o_dir = o.ContentDir();
for (typeStr::iterator it_dir = o_dir.begin(); o_dir.end() != it_dir && !Limit(); /*--limit test*/it_dir ++)
{
m_contentDir.push_back(*it_dir);
}
//--file
typeStr o_file = o.ContentFile();
for (typeStr::iterator it_file = o_file.begin(); o_file.end() != it_file && !Limit(); /*--limit test*/it_file ++)
{
m_contentFile.push_back(*it_file);
}
}
}
else
{
if (!Limit() /*--limit test*/ && (0 == fext.size() || Match(fext, fileinfo.cFileName)))
{
m_contentFile.push_back( path + fileinfo.cFileName );
}
}
}
}
while (FindNextFileA( handle, &fileinfo ));
FindClose(handle);
}
//--dir
for (typeStr::iterator it_dir = m_contentDir.begin(); m_contentDir.end() != it_dir; it_dir ++)
{
m_content.push_back(*it_dir);
}
//--file
for (typeStr::iterator it_file = m_contentFile.begin(); m_contentFile.end() != it_file; it_file ++)
{
m_content.push_back(*it_file);
}
return Count();
}
// 获取目录下文件和目录的总数
int DiskInfo::Count()
{
return m_contentDir.size() + m_contentFile.size();
}
// 获取目录下所有文件和目录的地址
DiskInfo::typeStr &DiskInfo::Content()
{
return m_content;
}
// 获取目录下所有目录的地址
DiskInfo::typeStr &DiskInfo::ContentDir()
{
return m_contentDir;
}
// 获取目录下所有文件的地址
DiskInfo::typeStr &DiskInfo::ContentFile()
{
return m_contentFile;
}
// 设置是否查找子目录
void DiskInfo::SetFindChildDir(bool bFind)
{
m_childDir = bFind;
return;
}
// 获取是否查找子目录
bool DiskInfo::GetFindChildDir()
{
return m_childDir;
}
// 判断s是否为目录
bool DiskInfo::Dir(string s)
{
return (FILE_ATTRIBUTE_DIRECTORY == GetFileAttributesA(s.c_str()));
}
// 设置查找文件数目上限
void DiskInfo::SetLimit(unsigned int iLimit)
{
m_limit = iLimit;
return;
}
// 获取查找文件数目上限
int DiskInfo::GetLimit()
{
return m_limit;
}
// 文件匹配检测
int DiskInfo::Match(string sFext, string sFile)
{
string fext = Uppercase(sFext);
string file = Uppercase(sFile);
int pos = file.find_last_of('.');
if (string::npos != pos) file = file.substr(pos);
return (string::npos != fext.find(file));
}
// 判断是否超过查找的文件数目上限
bool DiskInfo::Limit()
{
if (m_limit)
{
return Count() == GetLimit();
}
else
{
return false;
}
}
//--转换s到大写字母
string DiskInfo::Uppercase(string s)
{
const char aAzZ = 'z' - 'Z';
string rs;
for (string::iterator it = s.begin(); s.end() != it; it++)
{
if ('a' <= *it && *it <= 'z') rs.append(1, *it - aAzZ);
else rs.append(1, *it);
}
return rs;
}使用事例
DiskInfo FileF1;
FileF1.SetFindChildDir(true);
int p = FileF1.Find("D:\", "*.*");
auto stringDir2 = FileF1.ContentFile();
for (size_t i = 0; i < stringDir2.size(); i++) {
MD5_CTX md5 = MD5_CTX();
char md5Str[33];
md5.GetFileMd5(md5Str, stringDir2.at(i).c_str());
}