src/external/tng_io/src/lib/md5.c

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