/thirdparty/breakpad/common/md5.c

http://github.com/tomahawk-player/tomahawk · C · 246 lines · 162 code · 34 blank · 50 comment · 7 complexity · e1b225e7d02784f2833e2a348ad3e0a7 MD5 · raw file

  1. /*
  2. * written by Colin Plumb in 1993, no copyright is claimed.
  3. * This code is in the public domain; do with it what you wish.
  4. *
  5. * Equivalent code is available from RSA Data Security, Inc.
  6. * This code has been tested against that, and is equivalent,
  7. * except that you don't need to include two pages of legalese
  8. * with every copy.
  9. *
  10. * To compute the message digest of a chunk of bytes, declare an
  11. * MD5Context structure, pass it to MD5Init, call MD5Update as
  12. * needed on buffers full of bytes, and then call MD5Final, which
  13. * will fill a supplied 16-byte array with the digest.
  14. */
  15. #include <string.h>
  16. #include "common/md5.h"
  17. #ifndef WORDS_BIGENDIAN
  18. #define byteReverse(buf, len) /* Nothing */
  19. #else
  20. /*
  21. * Note: this code is harmless on little-endian machines.
  22. */
  23. static void byteReverse(unsigned char *buf, unsigned longs)
  24. {
  25. u32 t;
  26. do {
  27. t = (u32) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
  28. ((unsigned) buf[1] << 8 | buf[0]);
  29. *(u32 *) buf = t;
  30. buf += 4;
  31. } while (--longs);
  32. }
  33. #endif
  34. static void MD5Transform(u32 buf[4], u32 const in[16]);
  35. /*
  36. * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
  37. * initialization constants.
  38. */
  39. void MD5Init(struct MD5Context *ctx)
  40. {
  41. ctx->buf[0] = 0x67452301;
  42. ctx->buf[1] = 0xefcdab89;
  43. ctx->buf[2] = 0x98badcfe;
  44. ctx->buf[3] = 0x10325476;
  45. ctx->bits[0] = 0;
  46. ctx->bits[1] = 0;
  47. }
  48. /*
  49. * Update context to reflect the concatenation of another buffer full
  50. * of bytes.
  51. */
  52. void MD5Update(struct MD5Context *ctx, unsigned char const *buf, unsigned len)
  53. {
  54. u32 t;
  55. /* Update bitcount */
  56. t = ctx->bits[0];
  57. if ((ctx->bits[0] = t + ((u32) len << 3)) < t)
  58. ctx->bits[1]++; /* Carry from low to high */
  59. ctx->bits[1] += len >> 29;
  60. t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
  61. /* Handle any leading odd-sized chunks */
  62. if (t) {
  63. unsigned char *p = (unsigned char *) ctx->in + t;
  64. t = 64 - t;
  65. if (len < t) {
  66. memcpy(p, buf, len);
  67. return;
  68. }
  69. memcpy(p, buf, t);
  70. byteReverse(ctx->in, 16);
  71. MD5Transform(ctx->buf, (u32 *) ctx->in);
  72. buf += t;
  73. len -= t;
  74. }
  75. /* Process data in 64-byte chunks */
  76. while (len >= 64) {
  77. memcpy(ctx->in, buf, 64);
  78. byteReverse(ctx->in, 16);
  79. MD5Transform(ctx->buf, (u32 *) ctx->in);
  80. buf += 64;
  81. len -= 64;
  82. }
  83. /* Handle any remaining bytes of data. */
  84. memcpy(ctx->in, buf, len);
  85. }
  86. /*
  87. * Final wrapup - pad to 64-byte boundary with the bit pattern
  88. * 1 0* (64-bit count of bits processed, MSB-first)
  89. */
  90. void MD5Final(unsigned char digest[16], struct MD5Context *ctx)
  91. {
  92. unsigned count;
  93. unsigned char *p;
  94. /* Compute number of bytes mod 64 */
  95. count = (ctx->bits[0] >> 3) & 0x3F;
  96. /* Set the first char of padding to 0x80. This is safe since there is
  97. always at least one byte free */
  98. p = ctx->in + count;
  99. *p++ = 0x80;
  100. /* Bytes of padding needed to make 64 bytes */
  101. count = 64 - 1 - count;
  102. /* Pad out to 56 mod 64 */
  103. if (count < 8) {
  104. /* Two lots of padding: Pad the first block to 64 bytes */
  105. memset(p, 0, count);
  106. byteReverse(ctx->in, 16);
  107. MD5Transform(ctx->buf, (u32 *) ctx->in);
  108. /* Now fill the next block with 56 bytes */
  109. memset(ctx->in, 0, 56);
  110. } else {
  111. /* Pad block to 56 bytes */
  112. memset(p, 0, count - 8);
  113. }
  114. byteReverse(ctx->in, 14);
  115. /* Append length in bits and transform */
  116. ((u32 *) ctx->in)[14] = ctx->bits[0];
  117. ((u32 *) ctx->in)[15] = ctx->bits[1];
  118. MD5Transform(ctx->buf, (u32 *) ctx->in);
  119. byteReverse((unsigned char *) ctx->buf, 4);
  120. memcpy(digest, ctx->buf, 16);
  121. memset(ctx, 0, sizeof(*ctx)); /* In case it's sensitive */
  122. }
  123. /* The four core functions - F1 is optimized somewhat */
  124. /* #define F1(x, y, z) (x & y | ~x & z) */
  125. #define F1(x, y, z) (z ^ (x & (y ^ z)))
  126. #define F2(x, y, z) F1(z, x, y)
  127. #define F3(x, y, z) (x ^ y ^ z)
  128. #define F4(x, y, z) (y ^ (x | ~z))
  129. /* This is the central step in the MD5 algorithm. */
  130. #define MD5STEP(f, w, x, y, z, data, s) \
  131. ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
  132. /*
  133. * The core of the MD5 algorithm, this alters an existing MD5 hash to
  134. * reflect the addition of 16 longwords of new data. MD5Update blocks
  135. * the data and converts bytes into longwords for this routine.
  136. */
  137. static void MD5Transform(u32 buf[4], u32 const in[16])
  138. {
  139. register u32 a, b, c, d;
  140. a = buf[0];
  141. b = buf[1];
  142. c = buf[2];
  143. d = buf[3];
  144. MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
  145. MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
  146. MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
  147. MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
  148. MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
  149. MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
  150. MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
  151. MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
  152. MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
  153. MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
  154. MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
  155. MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
  156. MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
  157. MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
  158. MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
  159. MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
  160. MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
  161. MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
  162. MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
  163. MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
  164. MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
  165. MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
  166. MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
  167. MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
  168. MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
  169. MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
  170. MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
  171. MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
  172. MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
  173. MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
  174. MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
  175. MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
  176. MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
  177. MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
  178. MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
  179. MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
  180. MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
  181. MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
  182. MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
  183. MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
  184. MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
  185. MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
  186. MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
  187. MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
  188. MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
  189. MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
  190. MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
  191. MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
  192. MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
  193. MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
  194. MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
  195. MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
  196. MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
  197. MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
  198. MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
  199. MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
  200. MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
  201. MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
  202. MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
  203. MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
  204. MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
  205. MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
  206. MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
  207. MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
  208. buf[0] += a;
  209. buf[1] += b;
  210. buf[2] += c;
  211. buf[3] += d;
  212. }