md5.c 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210
  1. #include "__md5.h"
  2. struct MD5_CTX {
  3. unsigned int count[2];
  4. unsigned int state[4];
  5. unsigned char buffer[64];
  6. };
  7. typedef struct MD5_CTX MD5_CTX;
  8. static void MD5Init(MD5_CTX *context);
  9. static void MD5Update(MD5_CTX *context,unsigned char *input,unsigned int inputlen);
  10. static void MD5Final(MD5_CTX *context,unsigned char digest[16]);
  11. static void MD5Transform(unsigned int state[4],unsigned char block[64]);
  12. static void MD5Encode(unsigned char *output,const unsigned int *input,unsigned int len);
  13. static void MD5Decode(unsigned int *output,unsigned char *input,unsigned int len);
  14. unsigned char PADDING[] = {
  15. 0x80,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  16. 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  17. 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  18. 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
  19. };
  20. static void MD5Init(MD5_CTX *context) {
  21. context->count[0] = 0;
  22. context->count[1] = 0;
  23. context->state[0] = 0x67452301;
  24. context->state[1] = 0xEFCDAB89;
  25. context->state[2] = 0x98BADCFE;
  26. context->state[3] = 0x10325476;
  27. }
  28. static void MD5Update(MD5_CTX *context, unsigned char *input, unsigned int inputlen) {
  29. unsigned int i;
  30. unsigned int index;
  31. unsigned int partlen;
  32. index = (context->count[0] >> (unsigned)3) & (unsigned)0x3F;
  33. partlen = 64 - index;
  34. context->count[0] += inputlen << (unsigned)3;
  35. if(context->count[0] < (inputlen << (unsigned)3))
  36. context->count[1]++;
  37. context->count[1] += inputlen >> (unsigned)29;
  38. if(inputlen >= partlen) {
  39. memcpy(&context->buffer[index], input,partlen);
  40. MD5Transform(context->state, context->buffer);
  41. for(i = partlen; i+64 <= inputlen; i+=64)
  42. MD5Transform(context->state, &input[i]);
  43. index = 0;
  44. }
  45. else
  46. i = 0;
  47. memcpy(&context->buffer[index], &input[i], inputlen-i);
  48. }
  49. static void MD5Final(MD5_CTX *context, unsigned char digest[16]) {
  50. unsigned int index;
  51. unsigned int pad_len;
  52. unsigned char bits[8];
  53. index = (context->count[0] >> (unsigned)3) & (unsigned)0x3F;
  54. pad_len = (index < 56) ? (56 - index) : (120 - index);
  55. MD5Encode(bits, context->count, 8);
  56. MD5Update(context, PADDING, pad_len);
  57. MD5Update(context, bits, 8);
  58. MD5Encode(digest, context->state, 16);
  59. }
  60. static void MD5Encode(unsigned char *output,const unsigned int *input, unsigned int len) {
  61. unsigned int i = 0;
  62. unsigned int j = 0;
  63. while(j < len)
  64. {
  65. output[j] = input[i] & (unsigned)0xFF;
  66. output[j+1] = (input[i] >> (unsigned)8) & (unsigned)0xFF;
  67. output[j+2] = (input[i] >> (unsigned)16) & (unsigned)0xFF;
  68. output[j+3] = (input[i] >> (unsigned)24) & (unsigned)0xFF;
  69. i++;
  70. j += 4;
  71. }
  72. }
  73. static void MD5Decode(unsigned int *output, unsigned char *input, unsigned int len) {
  74. for (unsigned int i=0, j=0; j < len; i++, j+=4) {
  75. output[i] = (input[j]) |
  76. (input[j+1] << (unsigned)8) |
  77. (input[j+2] << (unsigned)16) |
  78. (input[j+3] << (unsigned)24);
  79. }
  80. }
  81. static void MD5Transform(unsigned int state[4], unsigned char block[64]) {
  82. unsigned int a = state[0];
  83. unsigned int b = state[1];
  84. unsigned int c = state[2];
  85. unsigned int d = state[3];
  86. unsigned int x[64];
  87. MD5Decode(x,block,64);
  88. FF(a, b, c, d, x[ 0], 7, 0xd76aa478); /* 1 */
  89. FF(d, a, b, c, x[ 1], 12, 0xe8c7b756); /* 2 */
  90. FF(c, d, a, b, x[ 2], 17, 0x242070db); /* 3 */
  91. FF(b, c, d, a, x[ 3], 22, 0xc1bdceee); /* 4 */
  92. FF(a, b, c, d, x[ 4], 7, 0xf57c0faf); /* 5 */
  93. FF(d, a, b, c, x[ 5], 12, 0x4787c62a); /* 6 */
  94. FF(c, d, a, b, x[ 6], 17, 0xa8304613); /* 7 */
  95. FF(b, c, d, a, x[ 7], 22, 0xfd469501); /* 8 */
  96. FF(a, b, c, d, x[ 8], 7, 0x698098d8); /* 9 */
  97. FF(d, a, b, c, x[ 9], 12, 0x8b44f7af); /* 10 */
  98. FF(c, d, a, b, x[10], 17, 0xffff5bb1); /* 11 */
  99. FF(b, c, d, a, x[11], 22, 0x895cd7be); /* 12 */
  100. FF(a, b, c, d, x[12], 7, 0x6b901122); /* 13 */
  101. FF(d, a, b, c, x[13], 12, 0xfd987193); /* 14 */
  102. FF(c, d, a, b, x[14], 17, 0xa679438e); /* 15 */
  103. FF(b, c, d, a, x[15], 22, 0x49b40821); /* 16 */
  104. /* Round 2 */
  105. GG(a, b, c, d, x[ 1], 5, 0xf61e2562); /* 17 */
  106. GG(d, a, b, c, x[ 6], 9, 0xc040b340); /* 18 */
  107. GG(c, d, a, b, x[11], 14, 0x265e5a51); /* 19 */
  108. GG(b, c, d, a, x[ 0], 20, 0xe9b6c7aa); /* 20 */
  109. GG(a, b, c, d, x[ 5], 5, 0xd62f105d); /* 21 */
  110. GG(d, a, b, c, x[10], 9, 0x2441453); /* 22 */
  111. GG(c, d, a, b, x[15], 14, 0xd8a1e681); /* 23 */
  112. GG(b, c, d, a, x[ 4], 20, 0xe7d3fbc8); /* 24 */
  113. GG(a, b, c, d, x[ 9], 5, 0x21e1cde6); /* 25 */
  114. GG(d, a, b, c, x[14], 9, 0xc33707d6); /* 26 */
  115. GG(c, d, a, b, x[ 3], 14, 0xf4d50d87); /* 27 */
  116. GG(b, c, d, a, x[ 8], 20, 0x455a14ed); /* 28 */
  117. GG(a, b, c, d, x[13], 5, 0xa9e3e905); /* 29 */
  118. GG(d, a, b, c, x[ 2], 9, 0xfcefa3f8); /* 30 */
  119. GG(c, d, a, b, x[ 7], 14, 0x676f02d9); /* 31 */
  120. GG(b, c, d, a, x[12], 20, 0x8d2a4c8a); /* 32 */
  121. /* Round 3 */
  122. HH(a, b, c, d, x[ 5], 4, 0xfffa3942); /* 33 */
  123. HH(d, a, b, c, x[ 8], 11, 0x8771f681); /* 34 */
  124. HH(c, d, a, b, x[11], 16, 0x6d9d6122); /* 35 */
  125. HH(b, c, d, a, x[14], 23, 0xfde5380c); /* 36 */
  126. HH(a, b, c, d, x[ 1], 4, 0xa4beea44); /* 37 */
  127. HH(d, a, b, c, x[ 4], 11, 0x4bdecfa9); /* 38 */
  128. HH(c, d, a, b, x[ 7], 16, 0xf6bb4b60); /* 39 */
  129. HH(b, c, d, a, x[10], 23, 0xbebfbc70); /* 40 */
  130. HH(a, b, c, d, x[13], 4, 0x289b7ec6); /* 41 */
  131. HH(d, a, b, c, x[ 0], 11, 0xeaa127fa); /* 42 */
  132. HH(c, d, a, b, x[ 3], 16, 0xd4ef3085); /* 43 */
  133. HH(b, c, d, a, x[ 6], 23, 0x4881d05); /* 44 */
  134. HH(a, b, c, d, x[ 9], 4, 0xd9d4d039); /* 45 */
  135. HH(d, a, b, c, x[12], 11, 0xe6db99e5); /* 46 */
  136. HH(c, d, a, b, x[15], 16, 0x1fa27cf8); /* 47 */
  137. HH(b, c, d, a, x[ 2], 23, 0xc4ac5665); /* 48 */
  138. /* Round 4 */
  139. II(a, b, c, d, x[ 0], 6, 0xf4292244); /* 49 */
  140. II(d, a, b, c, x[ 7], 10, 0x432aff97); /* 50 */
  141. II(c, d, a, b, x[14], 15, 0xab9423a7); /* 51 */
  142. II(b, c, d, a, x[ 5], 21, 0xfc93a039); /* 52 */
  143. II(a, b, c, d, x[12], 6, 0x655b59c3); /* 53 */
  144. II(d, a, b, c, x[ 3], 10, 0x8f0ccc92); /* 54 */
  145. II(c, d, a, b, x[10], 15, 0xffeff47d); /* 55 */
  146. II(b, c, d, a, x[ 1], 21, 0x85845dd1); /* 56 */
  147. II(a, b, c, d, x[ 8], 6, 0x6fa87e4f); /* 57 */
  148. II(d, a, b, c, x[15], 10, 0xfe2ce6e0); /* 58 */
  149. II(c, d, a, b, x[ 6], 15, 0xa3014314); /* 59 */
  150. II(b, c, d, a, x[13], 21, 0x4e0811a1); /* 60 */
  151. II(a, b, c, d, x[ 4], 6, 0xf7537e82); /* 61 */
  152. II(d, a, b, c, x[11], 10, 0xbd3af235); /* 62 */
  153. II(c, d, a, b, x[ 2], 15, 0x2ad7d2bb); /* 63 */
  154. II(b, c, d, a, x[ 9], 21, 0xeb86d391); /* 64 */
  155. state[0] += a;
  156. state[1] += b;
  157. state[2] += c;
  158. state[3] += d;
  159. }
  160. int getFileMd5(const char *path, char *md5str) {
  161. FILE *fd;
  162. unsigned long ret;
  163. unsigned char data[READ_DATA_SIZE];
  164. unsigned char md5_value[MD5_SIZE];
  165. MD5_CTX md5;
  166. if ((fd = fopen(path, "rb")) == NULL)
  167. return -1;
  168. MD5Init(&md5);
  169. while (1) {
  170. ret = fread(data, 1, READ_DATA_SIZE, fd);
  171. MD5Update(&md5, data, ret);
  172. if (ret < READ_DATA_SIZE)
  173. break;
  174. }
  175. fclose(fd);
  176. MD5Final(&md5, md5_value);
  177. for(int i = 0; i < MD5_SIZE; i++)
  178. snprintf(md5str + i * 2, 2 + 1, "%02x", md5_value[i]);
  179. return 0;
  180. }