2
0

md5.inl 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472
  1. /*
  2. * This an amalgamation of md5.c and md5.h into a single file
  3. * with all static declaration to reduce linker conflicts
  4. * in Civetweb.
  5. *
  6. * The MD5_STATIC declaration was added to facilitate static
  7. * inclusion.
  8. * No Face Press, LLC
  9. */
  10. /* $Id: md5.h,v 1.4 2002/04/13 19:20:28 lpd Exp $ */
  11. /*
  12. Independent implementation of MD5 (RFC 1321).
  13. This code implements the MD5 Algorithm defined in RFC 1321, whose
  14. text is available at
  15. http://www.ietf.org/rfc/rfc1321.txt
  16. The code is derived from the text of the RFC, including the test suite
  17. (section A.5) but excluding the rest of Appendix A. It does not include
  18. any code or documentation that is identified in the RFC as being
  19. copyrighted.
  20. The original and principal author of md5.h is L. Peter Deutsch
  21. <ghost@aladdin.com>. Other authors are noted in the change history
  22. that follows (in reverse chronological order):
  23. 2002-04-13 lpd Removed support for non-ANSI compilers; removed
  24. references to Ghostscript; clarified derivation from RFC 1321;
  25. now handles byte order either statically or dynamically.
  26. 1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
  27. 1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5);
  28. added conditionalization for C++ compilation from Martin
  29. Purschke <purschke@bnl.gov>.
  30. 1999-05-03 lpd Original version.
  31. */
  32. #if !defined(md5_INCLUDED)
  33. #define md5_INCLUDED
  34. /*
  35. * This package supports both compile-time and run-time determination of CPU
  36. * byte order. If ARCH_IS_BIG_ENDIAN is defined as 0, the code will be
  37. * compiled to run only on little-endian CPUs; if ARCH_IS_BIG_ENDIAN is
  38. * defined as non-zero, the code will be compiled to run only on big-endian
  39. * CPUs; if ARCH_IS_BIG_ENDIAN is not defined, the code will be compiled to
  40. * run on either big- or little-endian CPUs, but will run slightly less
  41. * efficiently on either one than if ARCH_IS_BIG_ENDIAN is defined.
  42. */
  43. typedef unsigned char md5_byte_t; /* 8-bit byte */
  44. typedef unsigned int md5_word_t; /* 32-bit word */
  45. /* Define the state of the MD5 Algorithm. */
  46. typedef struct md5_state_s {
  47. md5_word_t count[2]; /* message length in bits, lsw first */
  48. md5_word_t abcd[4]; /* digest buffer */
  49. md5_byte_t buf[64]; /* accumulate block */
  50. } md5_state_t;
  51. #if defined(__cplusplus)
  52. extern "C" {
  53. #endif
  54. /* Initialize the algorithm. */
  55. MD5_STATIC void md5_init(md5_state_t *pms);
  56. /* Append a string to the message. */
  57. MD5_STATIC void
  58. md5_append(md5_state_t *pms, const md5_byte_t *data, size_t nbytes);
  59. /* Finish the message and return the digest. */
  60. MD5_STATIC void md5_finish(md5_state_t *pms, md5_byte_t digest[16]);
  61. #if defined(__cplusplus)
  62. } /* end extern "C" */
  63. #endif
  64. #endif /* md5_INCLUDED */
  65. /*
  66. Copyright (C) 1999, 2000, 2002 Aladdin Enterprises. All rights reserved.
  67. This software is provided 'as-is', without any express or implied
  68. warranty. In no event will the authors be held liable for any damages
  69. arising from the use of this software.
  70. Permission is granted to anyone to use this software for any purpose,
  71. including commercial applications, and to alter it and redistribute it
  72. freely, subject to the following restrictions:
  73. 1. The origin of this software must not be misrepresented; you must not
  74. claim that you wrote the original software. If you use this software
  75. in a product, an acknowledgment in the product documentation would be
  76. appreciated but is not required.
  77. 2. Altered source versions must be plainly marked as such, and must not be
  78. misrepresented as being the original software.
  79. 3. This notice may not be removed or altered from any source distribution.
  80. L. Peter Deutsch
  81. ghost@aladdin.com
  82. */
  83. /* $Id: md5.c,v 1.6 2002/04/13 19:20:28 lpd Exp $ */
  84. /*
  85. Independent implementation of MD5 (RFC 1321).
  86. This code implements the MD5 Algorithm defined in RFC 1321, whose
  87. text is available at
  88. http://www.ietf.org/rfc/rfc1321.txt
  89. The code is derived from the text of the RFC, including the test suite
  90. (section A.5) but excluding the rest of Appendix A. It does not include
  91. any code or documentation that is identified in the RFC as being
  92. copyrighted.
  93. The original and principal author of md5.c is L. Peter Deutsch
  94. <ghost@aladdin.com>. Other authors are noted in the change history
  95. that follows (in reverse chronological order):
  96. 2002-04-13 lpd Clarified derivation from RFC 1321; now handles byte order
  97. either statically or dynamically; added missing #include <string.h>
  98. in library.
  99. 2002-03-11 lpd Corrected argument list for main(), and added int return
  100. type, in test program and T value program.
  101. 2002-02-21 lpd Added missing #include <stdio.h> in test program.
  102. 2000-07-03 lpd Patched to eliminate warnings about "constant is
  103. unsigned in ANSI C, signed in traditional"; made test program
  104. self-checking.
  105. 1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
  106. 1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5).
  107. 1999-05-03 lpd Original version.
  108. */
  109. #if !defined(MD5_STATIC)
  110. #include <stdint.h>
  111. #include <string.h>
  112. #endif
  113. #undef BYTE_ORDER /* 1 = big-endian, -1 = little-endian, 0 = unknown */
  114. #if defined(ARCH_IS_BIG_ENDIAN)
  115. #define BYTE_ORDER (ARCH_IS_BIG_ENDIAN ? 1 : -1)
  116. #else
  117. #define BYTE_ORDER (0)
  118. #endif
  119. #define T_MASK ((md5_word_t)~0)
  120. #define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87)
  121. #define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9)
  122. #define T3 (0x242070db)
  123. #define T4 /* 0xc1bdceee */ (T_MASK ^ 0x3e423111)
  124. #define T5 /* 0xf57c0faf */ (T_MASK ^ 0x0a83f050)
  125. #define T6 (0x4787c62a)
  126. #define T7 /* 0xa8304613 */ (T_MASK ^ 0x57cfb9ec)
  127. #define T8 /* 0xfd469501 */ (T_MASK ^ 0x02b96afe)
  128. #define T9 (0x698098d8)
  129. #define T10 /* 0x8b44f7af */ (T_MASK ^ 0x74bb0850)
  130. #define T11 /* 0xffff5bb1 */ (T_MASK ^ 0x0000a44e)
  131. #define T12 /* 0x895cd7be */ (T_MASK ^ 0x76a32841)
  132. #define T13 (0x6b901122)
  133. #define T14 /* 0xfd987193 */ (T_MASK ^ 0x02678e6c)
  134. #define T15 /* 0xa679438e */ (T_MASK ^ 0x5986bc71)
  135. #define T16 (0x49b40821)
  136. #define T17 /* 0xf61e2562 */ (T_MASK ^ 0x09e1da9d)
  137. #define T18 /* 0xc040b340 */ (T_MASK ^ 0x3fbf4cbf)
  138. #define T19 (0x265e5a51)
  139. #define T20 /* 0xe9b6c7aa */ (T_MASK ^ 0x16493855)
  140. #define T21 /* 0xd62f105d */ (T_MASK ^ 0x29d0efa2)
  141. #define T22 (0x02441453)
  142. #define T23 /* 0xd8a1e681 */ (T_MASK ^ 0x275e197e)
  143. #define T24 /* 0xe7d3fbc8 */ (T_MASK ^ 0x182c0437)
  144. #define T25 (0x21e1cde6)
  145. #define T26 /* 0xc33707d6 */ (T_MASK ^ 0x3cc8f829)
  146. #define T27 /* 0xf4d50d87 */ (T_MASK ^ 0x0b2af278)
  147. #define T28 (0x455a14ed)
  148. #define T29 /* 0xa9e3e905 */ (T_MASK ^ 0x561c16fa)
  149. #define T30 /* 0xfcefa3f8 */ (T_MASK ^ 0x03105c07)
  150. #define T31 (0x676f02d9)
  151. #define T32 /* 0x8d2a4c8a */ (T_MASK ^ 0x72d5b375)
  152. #define T33 /* 0xfffa3942 */ (T_MASK ^ 0x0005c6bd)
  153. #define T34 /* 0x8771f681 */ (T_MASK ^ 0x788e097e)
  154. #define T35 (0x6d9d6122)
  155. #define T36 /* 0xfde5380c */ (T_MASK ^ 0x021ac7f3)
  156. #define T37 /* 0xa4beea44 */ (T_MASK ^ 0x5b4115bb)
  157. #define T38 (0x4bdecfa9)
  158. #define T39 /* 0xf6bb4b60 */ (T_MASK ^ 0x0944b49f)
  159. #define T40 /* 0xbebfbc70 */ (T_MASK ^ 0x4140438f)
  160. #define T41 (0x289b7ec6)
  161. #define T42 /* 0xeaa127fa */ (T_MASK ^ 0x155ed805)
  162. #define T43 /* 0xd4ef3085 */ (T_MASK ^ 0x2b10cf7a)
  163. #define T44 (0x04881d05)
  164. #define T45 /* 0xd9d4d039 */ (T_MASK ^ 0x262b2fc6)
  165. #define T46 /* 0xe6db99e5 */ (T_MASK ^ 0x1924661a)
  166. #define T47 (0x1fa27cf8)
  167. #define T48 /* 0xc4ac5665 */ (T_MASK ^ 0x3b53a99a)
  168. #define T49 /* 0xf4292244 */ (T_MASK ^ 0x0bd6ddbb)
  169. #define T50 (0x432aff97)
  170. #define T51 /* 0xab9423a7 */ (T_MASK ^ 0x546bdc58)
  171. #define T52 /* 0xfc93a039 */ (T_MASK ^ 0x036c5fc6)
  172. #define T53 (0x655b59c3)
  173. #define T54 /* 0x8f0ccc92 */ (T_MASK ^ 0x70f3336d)
  174. #define T55 /* 0xffeff47d */ (T_MASK ^ 0x00100b82)
  175. #define T56 /* 0x85845dd1 */ (T_MASK ^ 0x7a7ba22e)
  176. #define T57 (0x6fa87e4f)
  177. #define T58 /* 0xfe2ce6e0 */ (T_MASK ^ 0x01d3191f)
  178. #define T59 /* 0xa3014314 */ (T_MASK ^ 0x5cfebceb)
  179. #define T60 (0x4e0811a1)
  180. #define T61 /* 0xf7537e82 */ (T_MASK ^ 0x08ac817d)
  181. #define T62 /* 0xbd3af235 */ (T_MASK ^ 0x42c50dca)
  182. #define T63 (0x2ad7d2bb)
  183. #define T64 /* 0xeb86d391 */ (T_MASK ^ 0x14792c6e)
  184. static void
  185. md5_process(md5_state_t *pms, const md5_byte_t *data /*[64]*/)
  186. {
  187. md5_word_t a = pms->abcd[0], b = pms->abcd[1], c = pms->abcd[2],
  188. d = pms->abcd[3];
  189. md5_word_t t;
  190. #if BYTE_ORDER > 0
  191. /* Define storage only for big-endian CPUs. */
  192. md5_word_t X[16];
  193. #else
  194. /* Define storage for little-endian or both types of CPUs. */
  195. md5_word_t xbuf[16];
  196. const md5_word_t *X;
  197. #endif
  198. {
  199. #if BYTE_ORDER == 0
  200. /*
  201. * Determine dynamically whether this is a big-endian or
  202. * little-endian machine, since we can use a more efficient
  203. * algorithm on the latter.
  204. */
  205. static const int w = 1;
  206. if (*((const md5_byte_t *)&w)) /* dynamic little-endian */
  207. #endif
  208. #if BYTE_ORDER <= 0 /* little-endian */
  209. {
  210. /*
  211. * On little-endian machines, we can process properly aligned
  212. * data without copying it.
  213. */
  214. if (!(((uintptr_t)data) & 3)) {
  215. /* data are properly aligned, a direct assignment is possible */
  216. /* cast through a (void *) should avoid a compiler warning,
  217. see
  218. https://github.com/bel2125/civetweb/issues/94#issuecomment-98112861
  219. */
  220. X = (const md5_word_t *)(const void *)data;
  221. } else {
  222. /* not aligned */
  223. memcpy(xbuf, data, 64);
  224. X = xbuf;
  225. }
  226. }
  227. #endif
  228. #if BYTE_ORDER == 0
  229. else /* dynamic big-endian */
  230. #endif
  231. #if BYTE_ORDER >= 0 /* big-endian */
  232. {
  233. /*
  234. * On big-endian machines, we must arrange the bytes in the
  235. * right order.
  236. */
  237. const md5_byte_t *xp = data;
  238. int i;
  239. #if BYTE_ORDER == 0
  240. X = xbuf; /* (dynamic only) */
  241. #else
  242. #define xbuf X /* (static only) */
  243. #endif
  244. for (i = 0; i < 16; ++i, xp += 4)
  245. xbuf[i] = (md5_word_t)(xp[0]) + (md5_word_t)(xp[1] << 8)
  246. + (md5_word_t)(xp[2] << 16)
  247. + (md5_word_t)(xp[3] << 24);
  248. }
  249. #endif
  250. }
  251. #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
  252. /* Round 1. */
  253. /* Let [abcd k s i] denote the operation
  254. a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */
  255. #define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
  256. #define SET(a, b, c, d, k, s, Ti) \
  257. t = (a) + F(b, c, d) + X[k] + (Ti); \
  258. (a) = ROTATE_LEFT(t, s) + (b)
  259. /* Do the following 16 operations. */
  260. SET(a, b, c, d, 0, 7, T1);
  261. SET(d, a, b, c, 1, 12, T2);
  262. SET(c, d, a, b, 2, 17, T3);
  263. SET(b, c, d, a, 3, 22, T4);
  264. SET(a, b, c, d, 4, 7, T5);
  265. SET(d, a, b, c, 5, 12, T6);
  266. SET(c, d, a, b, 6, 17, T7);
  267. SET(b, c, d, a, 7, 22, T8);
  268. SET(a, b, c, d, 8, 7, T9);
  269. SET(d, a, b, c, 9, 12, T10);
  270. SET(c, d, a, b, 10, 17, T11);
  271. SET(b, c, d, a, 11, 22, T12);
  272. SET(a, b, c, d, 12, 7, T13);
  273. SET(d, a, b, c, 13, 12, T14);
  274. SET(c, d, a, b, 14, 17, T15);
  275. SET(b, c, d, a, 15, 22, T16);
  276. #undef SET
  277. /* Round 2. */
  278. /* Let [abcd k s i] denote the operation
  279. a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */
  280. #define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
  281. #define SET(a, b, c, d, k, s, Ti) \
  282. t = (a) + G(b, c, d) + X[k] + (Ti); \
  283. (a) = ROTATE_LEFT(t, s) + (b)
  284. /* Do the following 16 operations. */
  285. SET(a, b, c, d, 1, 5, T17);
  286. SET(d, a, b, c, 6, 9, T18);
  287. SET(c, d, a, b, 11, 14, T19);
  288. SET(b, c, d, a, 0, 20, T20);
  289. SET(a, b, c, d, 5, 5, T21);
  290. SET(d, a, b, c, 10, 9, T22);
  291. SET(c, d, a, b, 15, 14, T23);
  292. SET(b, c, d, a, 4, 20, T24);
  293. SET(a, b, c, d, 9, 5, T25);
  294. SET(d, a, b, c, 14, 9, T26);
  295. SET(c, d, a, b, 3, 14, T27);
  296. SET(b, c, d, a, 8, 20, T28);
  297. SET(a, b, c, d, 13, 5, T29);
  298. SET(d, a, b, c, 2, 9, T30);
  299. SET(c, d, a, b, 7, 14, T31);
  300. SET(b, c, d, a, 12, 20, T32);
  301. #undef SET
  302. /* Round 3. */
  303. /* Let [abcd k s t] denote the operation
  304. a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */
  305. #define H(x, y, z) ((x) ^ (y) ^ (z))
  306. #define SET(a, b, c, d, k, s, Ti) \
  307. t = (a) + H(b, c, d) + X[k] + (Ti); \
  308. (a) = ROTATE_LEFT(t, s) + b
  309. /* Do the following 16 operations. */
  310. SET(a, b, c, d, 5, 4, T33);
  311. SET(d, a, b, c, 8, 11, T34);
  312. SET(c, d, a, b, 11, 16, T35);
  313. SET(b, c, d, a, 14, 23, T36);
  314. SET(a, b, c, d, 1, 4, T37);
  315. SET(d, a, b, c, 4, 11, T38);
  316. SET(c, d, a, b, 7, 16, T39);
  317. SET(b, c, d, a, 10, 23, T40);
  318. SET(a, b, c, d, 13, 4, T41);
  319. SET(d, a, b, c, 0, 11, T42);
  320. SET(c, d, a, b, 3, 16, T43);
  321. SET(b, c, d, a, 6, 23, T44);
  322. SET(a, b, c, d, 9, 4, T45);
  323. SET(d, a, b, c, 12, 11, T46);
  324. SET(c, d, a, b, 15, 16, T47);
  325. SET(b, c, d, a, 2, 23, T48);
  326. #undef SET
  327. /* Round 4. */
  328. /* Let [abcd k s t] denote the operation
  329. a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */
  330. #define I(x, y, z) ((y) ^ ((x) | ~(z)))
  331. #define SET(a, b, c, d, k, s, Ti) \
  332. t = (a) + I(b, c, d) + X[k] + (Ti); \
  333. (a) = ROTATE_LEFT(t, s) + (b)
  334. /* Do the following 16 operations. */
  335. SET(a, b, c, d, 0, 6, T49);
  336. SET(d, a, b, c, 7, 10, T50);
  337. SET(c, d, a, b, 14, 15, T51);
  338. SET(b, c, d, a, 5, 21, T52);
  339. SET(a, b, c, d, 12, 6, T53);
  340. SET(d, a, b, c, 3, 10, T54);
  341. SET(c, d, a, b, 10, 15, T55);
  342. SET(b, c, d, a, 1, 21, T56);
  343. SET(a, b, c, d, 8, 6, T57);
  344. SET(d, a, b, c, 15, 10, T58);
  345. SET(c, d, a, b, 6, 15, T59);
  346. SET(b, c, d, a, 13, 21, T60);
  347. SET(a, b, c, d, 4, 6, T61);
  348. SET(d, a, b, c, 11, 10, T62);
  349. SET(c, d, a, b, 2, 15, T63);
  350. SET(b, c, d, a, 9, 21, T64);
  351. #undef SET
  352. /* Then perform the following additions. (That is increment each
  353. of the four registers by the value it had before this block
  354. was started.) */
  355. pms->abcd[0] += a;
  356. pms->abcd[1] += b;
  357. pms->abcd[2] += c;
  358. pms->abcd[3] += d;
  359. }
  360. MD5_STATIC void
  361. md5_init(md5_state_t *pms)
  362. {
  363. pms->count[0] = pms->count[1] = 0;
  364. pms->abcd[0] = 0x67452301;
  365. pms->abcd[1] = /*0xefcdab89*/ T_MASK ^ 0x10325476;
  366. pms->abcd[2] = /*0x98badcfe*/ T_MASK ^ 0x67452301;
  367. pms->abcd[3] = 0x10325476;
  368. }
  369. MD5_STATIC void
  370. md5_append(md5_state_t *pms, const md5_byte_t *data, size_t nbytes)
  371. {
  372. const md5_byte_t *p = data;
  373. size_t left = nbytes;
  374. size_t offset = (pms->count[0] >> 3) & 63;
  375. md5_word_t nbits = (md5_word_t)(nbytes << 3);
  376. if (nbytes <= 0)
  377. return;
  378. /* Update the message length. */
  379. pms->count[1] += (md5_word_t)(nbytes >> 29);
  380. pms->count[0] += nbits;
  381. if (pms->count[0] < nbits)
  382. pms->count[1]++;
  383. /* Process an initial partial block. */
  384. if (offset) {
  385. size_t copy = (offset + nbytes > 64 ? 64 - offset : nbytes);
  386. memcpy(pms->buf + offset, p, copy);
  387. if (offset + copy < 64)
  388. return;
  389. p += copy;
  390. left -= copy;
  391. md5_process(pms, pms->buf);
  392. }
  393. /* Process full blocks. */
  394. for (; left >= 64; p += 64, left -= 64)
  395. md5_process(pms, p);
  396. /* Process a final partial block. */
  397. if (left)
  398. memcpy(pms->buf, p, left);
  399. }
  400. MD5_STATIC void
  401. md5_finish(md5_state_t *pms, md5_byte_t digest[16])
  402. {
  403. static const md5_byte_t pad[64] = {0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  404. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  405. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  406. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  407. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
  408. md5_byte_t data[8];
  409. int i;
  410. /* Save the length before padding. */
  411. for (i = 0; i < 8; ++i)
  412. data[i] = (md5_byte_t)(pms->count[i >> 2] >> ((i & 3) << 3));
  413. /* Pad to 56 bytes mod 64. */
  414. md5_append(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1);
  415. /* Append the length. */
  416. md5_append(pms, data, 8);
  417. for (i = 0; i < 16; ++i)
  418. digest[i] = (md5_byte_t)(pms->abcd[i >> 2] >> ((i & 3) << 3));
  419. }
  420. /* End of md5.inl */