[mirror_edk2.git] / AppPkg / Applications / Python / Python-2.7.10 / Modules / md5.c

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