⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 md5_hash.cpp

📁 mysql-5.0.22.tar.gz源码包
💻 CPP
字号:
/* Copyright (C) 2003 MySQL AB   This program is free software; you can redistribute it and/or modify   it under the terms of the GNU General Public License as published by   the Free Software Foundation; either version 2 of the License, or   (at your option) any later version.   This program is distributed in the hope that it will be useful,   but WITHOUT ANY WARRANTY; without even the implied warranty of   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the   GNU General Public License for more details.   You should have received a copy of the GNU General Public License   along with this program; if not, write to the Free Software   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA */#include "md5_hash.hpp"#ifdef WORDS_BIGENDIAN#define HIGHFIRST 1#endif/* * 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. * * The code has been modified by Mikael Ronstroem to handle * calculating a hash value of a key that is always a multiple * of 4 bytes long. Word 0 of the calculated 4-word hash value * is returned as the hash value. */#ifndef HIGHFIRST#define byteReverse(buf, len)	/* Nothing */#elsevoid byteReverse(unsigned char *buf, unsigned longs);/* * Note: this code is harmless on little-endian machines. */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/* 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;}/* * Start MD5 accumulation.  Set bit count to 0 and buffer to mysterious * initialization constants. */void md5_hash(Uint32 result[4], const Uint64* keybuf, Uint32 no_of_32_words){  /**   * This is the external interface of the module   * It is assumed that keybuf is placed on 8 byte   * alignment.   */  Uint32 i;  Uint32 buf[4];  Uint64 transform64_buf[8];  Uint32* transform32_buf;  Uint32 len = no_of_32_words << 2;  const Uint64* key64buf = (const Uint64*)keybuf;  const Uint32* key32buf = (const Uint32*)keybuf;  transform32_buf = (Uint32*)&transform64_buf[0];  buf[0] = 0x67452301;  buf[1] = 0xefcdab89;  buf[2] = 0x98badcfe;  buf[3] = 0x10325476;  while (no_of_32_words >= 16) {    transform64_buf[0] = key64buf[0];    transform64_buf[1] = key64buf[1];    transform64_buf[2] = key64buf[2];    transform64_buf[3] = key64buf[3];    transform64_buf[4] = key64buf[4];    transform64_buf[5] = key64buf[5];    transform64_buf[6] = key64buf[6];    transform64_buf[7] = key64buf[7];    no_of_32_words -= 16;    key64buf += 8;    byteReverse((unsigned char *)transform32_buf, 16);    MD5Transform(buf, transform32_buf);  }  key32buf = (const Uint32*)key64buf;  transform64_buf[0] = 0;  transform64_buf[1] = 0;  transform64_buf[2] = 0;  transform64_buf[3] = 0;  transform64_buf[4] = 0;  transform64_buf[5] = 0;  transform64_buf[6] = 0;  transform64_buf[7] = (Uint64)len;  for (i = 0; i < no_of_32_words; i++)    transform32_buf[i] = key32buf[i];  transform32_buf[no_of_32_words] = 0x80000000;  if (no_of_32_words < 14) {    byteReverse((unsigned char *)transform32_buf, 16);    MD5Transform(buf, transform32_buf);  } else {    if (no_of_32_words == 14)      transform32_buf[15] = 0;    MD5Transform(buf, transform32_buf);    transform64_buf[0] = 0;    transform64_buf[1] = 0;    transform64_buf[2] = 0;    transform64_buf[3] = 0;    transform64_buf[4] = 0;    transform64_buf[5] = 0;    transform64_buf[6] = 0;    transform64_buf[7] = (Uint64)len;    byteReverse((unsigned char *)transform32_buf, 16);    MD5Transform(buf, transform32_buf);      }  result[0] = buf[0];  result[1] = buf[1];  result[2] = buf[2];  result[3] = buf[3];}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -