mono/utils/mono-md5.c

   1 /* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
   2 /*
   3  * This code implements the MD5 message-digest algorithm.
   4  * The algorithm is due to Ron Rivest.  This code was
   5  * written by Colin Plumb in 1993, no copyright is claimed.
   6  * This code is in the public domain; do with it what you wish.
   7  *
   8  * Equivalent code is available from RSA Data Security, Inc.
   9  * This code has been tested against that, and is equivalent,
  10  * except that you don't need to include two pages of legalese
  11  * with every copy.
  12  *
  13  * To compute the message digest of a chunk of bytes, declare an
  14  * MonoMD5Context structure, pass it to mono_md5_init, call mono_md5_update as
  15  * needed on buffers full of bytes, and then call md5_Final, which
  16  * will fill a supplied 16-byte array with the digest.
  17  */
  18
  19 /* parts of this file are :
  20  * Written March 1993 by Branko Lankester
  21  * Modified June 1993 by Colin Plumb for altered md5.c.
  22  * Modified October 1995 by Erik Troan for RPM
  23  */
  24
  25
  26 #include <stdio.h>
  27 #include <string.h>
  28 #include "mono-digest.h"
  29
  30 #if HAVE_COMMONCRYPTO_COMMONDIGEST_H
  31
  32 void
  33 mono_md5_init (MonoMD5Context *ctx)
  34 {
  35         CC_MD5_Init (ctx);
  36 }
  37
  38 void
  39 mono_md5_update (MonoMD5Context *ctx, const guchar *buf, guint32 len)
  40 {
  41         CC_MD5_Update (ctx, buf, len);
  42 }
  43
  44 void
  45 mono_md5_final (MonoMD5Context *ctx, guchar digest[16])
  46 {
  47         CC_MD5_Final (digest, ctx);
  48 }
  49
  50 #else
  51
  52 static void md5_transform (guint32 buf[4], const guint32 in[16]);
  53
  54 static gint _ie = 0x44332211;
  55 static union _endian { gint i; gchar b[4]; } *_endian = (union _endian *)&_ie;
  56 #define IS_BIG_ENDIAN()         (_endian->b[0] == '\x44')
  57 #define IS_LITTLE_ENDIAN()      (_endian->b[0] == '\x11')
  58
  59
  60 /*
  61  * Note: this code is harmless on little-endian machines.
  62  */
  63 static void
  64 _byte_reverse (guchar *buf, guint32 longs)
  65 {
  66         guint32 t;
  67         do {
  68                 t = (guint32) ((guint32) buf[3] << 8 | buf[2]) << 16 |
  69                         ((guint32) buf[1] << 8 | buf[0]);
  70                 *(guint32 *) buf = t;
  71                 buf += 4;
  72         } while (--longs);
  73 }
  74
  75 /**
  76  * mono_md5_init: Initialise an md5 context object
  77  * @ctx: md5 context
  78  *
  79  * Initialise an md5 buffer.
  80  *
  81  **/
  82 void
  83 mono_md5_init (MonoMD5Context *ctx)
  84 {
  85         ctx->buf[0] = 0x67452301;
  86         ctx->buf[1] = 0xefcdab89;
  87         ctx->buf[2] = 0x98badcfe;
  88         ctx->buf[3] = 0x10325476;
  89
  90         ctx->bits[0] = 0;
  91         ctx->bits[1] = 0;
  92
  93         if (IS_BIG_ENDIAN())
  94                 ctx->doByteReverse = 1;
  95         else
  96                 ctx->doByteReverse = 0;
  97 }
  98
  99
 100
 101 /**
 102  * mono_md5_update: add a buffer to md5 hash computation
 103  * @ctx: conetxt object used for md5 computaion
 104  * @buf: buffer to add
 105  * @len: buffer length
 106  *
 107  * Update context to reflect the concatenation of another buffer full
 108  * of bytes. Use this to progressively construct an md5 hash.
 109  **/
 110 void
 111 mono_md5_update (MonoMD5Context *ctx, const guchar *buf, guint32 len)
 112 {
 113         guint32 t;
 114
 115         /* Update bitcount */
 116
 117         t = ctx->bits[0];
 118         if ((ctx->bits[0] = t + ((guint32) len << 3)) < t)
 119                 ctx->bits[1]++;         /* Carry from low to high */
 120         ctx->bits[1] += len >> 29;
 121
 122         t = (t >> 3) & 0x3f;    /* Bytes already in shsInfo->data */
 123
 124         /* Handle any leading odd-sized chunks */
 125
 126         if (t) {
 127                 guchar *p = (guchar *) ctx->in + t;
 128
 129                 t = 64 - t;
 130                 if (len < t) {
 131                         memcpy (p, buf, len);
 132                         return;
 133                 }
 134                 memcpy (p, buf, t);
 135                 if (ctx->doByteReverse)
 136                         _byte_reverse (ctx->in, 16);
 137                 md5_transform (ctx->buf, (guint32 *) ctx->in);
 138                 buf += t;
 139                 len -= t;
 140         }
 141         /* Process data in 64-byte chunks */
 142
 143         while (len >= 64) {
 144                 memcpy (ctx->in, buf, 64);
 145                 if (ctx->doByteReverse)
 146                         _byte_reverse (ctx->in, 16);
 147                 md5_transform (ctx->buf, (guint32 *) ctx->in);
 148                 buf += 64;
 149                 len -= 64;
 150         }
 151
 152         /* Handle any remaining bytes of data. */
 153
 154         memcpy (ctx->in, buf, len);
 155 }
 156
 157
 158
 159
 160
 161 /*
 162  * Final wrapup - pad to 64-byte boundary with the bit pattern
 163  * 1 0* (64-bit count of bits processed, MSB-first)
 164  */
 165 /**
 166  * mono_md5_final: copy the final md5 hash to a bufer
 167  * @digest: 16 bytes buffer
 168  * @ctx: context containing the calculated md5
 169  *
 170  * copy the final md5 hash to a bufer
 171  **/
 172 void
 173 mono_md5_final (MonoMD5Context *ctx, guchar digest[16])
 174 {
 175         guint32 count;
 176         guchar *p;
 177
 178         /* Compute number of bytes mod 64 */
 179         count = (ctx->bits[0] >> 3) & 0x3F;
 180
 181         /* Set the first char of padding to 0x80.  This is safe since there is
 182            always at least one byte free */
 183         p = ctx->in + count;
 184         *p++ = 0x80;
 185
 186         /* Bytes of padding needed to make 64 bytes */
 187         count = 64 - 1 - count;
 188
 189         /* Pad out to 56 mod 64 */
 190         if (count < 8) {
 191                 /* Two lots of padding:  Pad the first block to 64 bytes */
 192                 memset (p, 0, count);
 193                 if (ctx->doByteReverse)
 194                         _byte_reverse (ctx->in, 16);
 195                 md5_transform (ctx->buf, (guint32 *) ctx->in);
 196
 197                 /* Now fill the next block with 56 bytes */
 198                 memset (ctx->in, 0, 56);
 199         } else {
 200                 /* Pad block to 56 bytes */
 201                 memset (p, 0, count - 8);
 202         }
 203         if (ctx->doByteReverse)
 204                 _byte_reverse (ctx->in, 14);
 205
 206         /* Append length in bits and transform */
 207         ((guint32 *) ctx->in)[14] = ctx->bits[0];
 208         ((guint32 *) ctx->in)[15] = ctx->bits[1];
 209
 210         md5_transform (ctx->buf, (guint32 *) ctx->in);
 211         if (ctx->doByteReverse)
 212                 _byte_reverse ((guchar *) ctx->buf, 4);
 213         memcpy (digest, ctx->buf, 16);
 214 }
 215
 216
 217
 218
 219 /* The four core functions - F1 is optimized somewhat */
 220
 221 /* #define F1(x, y, z) (x & y | ~x & z) */
 222 #define F1(x, y, z) (z ^ (x & (y ^ z)))
 223 #define F2(x, y, z) F1(z, x, y)
 224 #define F3(x, y, z) (x ^ y ^ z)
 225 #define F4(x, y, z) (y ^ (x | ~z))
 226
 227 /* This is the central step in the MD5 algorithm. */
 228 #define MD5STEP(f, w, x, y, z, data, s) \
 229         ( w += f(x, y, z) + data,  w = w<<s | w>>(32-s),  w += x )
 230
 231 /*
 232  * The core of the MD5 algorithm, this alters an existing MD5 hash to
 233  * reflect the addition of 16 longwords of new data.  md5_Update blocks
 234  * the data and converts bytes into longwords for this routine.
 235  */
 236 static void
 237 md5_transform (guint32 buf[4], const guint32 in[16])
 238 {
 239         register guint32 a, b, c, d;
 240
 241         a = buf[0];
 242         b = buf[1];
 243         c = buf[2];
 244         d = buf[3];
 245
 246         MD5STEP (F1, a, b, c, d, in[0] + 0xd76aa478, 7);
 247         MD5STEP (F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
 248         MD5STEP (F1, c, d, a, b, in[2] + 0x242070db, 17);
 249         MD5STEP (F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
 250         MD5STEP (F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
 251         MD5STEP (F1, d, a, b, c, in[5] + 0x4787c62a, 12);
 252         MD5STEP (F1, c, d, a, b, in[6] + 0xa8304613, 17);
 253         MD5STEP (F1, b, c, d, a, in[7] + 0xfd469501, 22);
 254         MD5STEP (F1, a, b, c, d, in[8] + 0x698098d8, 7);
 255         MD5STEP (F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
 256         MD5STEP (F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
 257         MD5STEP (F1, b, c, d, a, in[11] + 0x895cd7be, 22);
 258         MD5STEP (F1, a, b, c, d, in[12] + 0x6b901122, 7);
 259         MD5STEP (F1, d, a, b, c, in[13] + 0xfd987193, 12);
 260         MD5STEP (F1, c, d, a, b, in[14] + 0xa679438e, 17);
 261         MD5STEP (F1, b, c, d, a, in[15] + 0x49b40821, 22);
 262
 263         MD5STEP (F2, a, b, c, d, in[1] + 0xf61e2562, 5);
 264         MD5STEP (F2, d, a, b, c, in[6] + 0xc040b340, 9);
 265         MD5STEP (F2, c, d, a, b, in[11] + 0x265e5a51, 14);
 266         MD5STEP (F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
 267         MD5STEP (F2, a, b, c, d, in[5] + 0xd62f105d, 5);
 268         MD5STEP (F2, d, a, b, c, in[10] + 0x02441453, 9);
 269         MD5STEP (F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
 270         MD5STEP (F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
 271         MD5STEP (F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
 272         MD5STEP (F2, d, a, b, c, in[14] + 0xc33707d6, 9);
 273         MD5STEP (F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
 274         MD5STEP (F2, b, c, d, a, in[8] + 0x455a14ed, 20);
 275         MD5STEP (F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
 276         MD5STEP (F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
 277         MD5STEP (F2, c, d, a, b, in[7] + 0x676f02d9, 14);
 278         MD5STEP (F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
 279
 280         MD5STEP (F3, a, b, c, d, in[5] + 0xfffa3942, 4);
 281         MD5STEP (F3, d, a, b, c, in[8] + 0x8771f681, 11);
 282         MD5STEP (F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
 283         MD5STEP (F3, b, c, d, a, in[14] + 0xfde5380c, 23);
 284         MD5STEP (F3, a, b, c, d, in[1] + 0xa4beea44, 4);
 285         MD5STEP (F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
 286         MD5STEP (F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
 287         MD5STEP (F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
 288         MD5STEP (F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
 289         MD5STEP (F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
 290         MD5STEP (F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
 291         MD5STEP (F3, b, c, d, a, in[6] + 0x04881d05, 23);
 292         MD5STEP (F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
 293         MD5STEP (F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
 294         MD5STEP (F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
 295         MD5STEP (F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
 296
 297         MD5STEP (F4, a, b, c, d, in[0] + 0xf4292244, 6);
 298         MD5STEP (F4, d, a, b, c, in[7] + 0x432aff97, 10);
 299         MD5STEP (F4, c, d, a, b, in[14] + 0xab9423a7, 15);
 300         MD5STEP (F4, b, c, d, a, in[5] + 0xfc93a039, 21);
 301         MD5STEP (F4, a, b, c, d, in[12] + 0x655b59c3, 6);
 302         MD5STEP (F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
 303         MD5STEP (F4, c, d, a, b, in[10] + 0xffeff47d, 15);
 304         MD5STEP (F4, b, c, d, a, in[1] + 0x85845dd1, 21);
 305         MD5STEP (F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
 306         MD5STEP (F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
 307         MD5STEP (F4, c, d, a, b, in[6] + 0xa3014314, 15);
 308         MD5STEP (F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
 309         MD5STEP (F4, a, b, c, d, in[4] + 0xf7537e82, 6);
 310         MD5STEP (F4, d, a, b, c, in[11] + 0xbd3af235, 10);
 311         MD5STEP (F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
 312         MD5STEP (F4, b, c, d, a, in[9] + 0xeb86d391, 21);
 313
 314         buf[0] += a;
 315         buf[1] += b;
 316         buf[2] += c;
 317         buf[3] += d;
 318 }
 319
 320 #endif
 321
 322
 323 /**
 324  * mono_md5_get_digest: get the md5 hash of a buffer
 325  * @buffer: byte buffer
 326  * @buffer_size: buffer size (in bytes)
 327  * @digest: 16 bytes buffer receiving the hash code.
 328  *
 329  * Get the md5 hash of a buffer. The result is put in
 330  * the 16 bytes buffer @digest .
 331  **/
 332 void
 333 mono_md5_get_digest (const guchar *buffer, gint buffer_size, guchar digest[16])
 334 {
 335         MonoMD5Context ctx;
 336
 337         mono_md5_init (&ctx);
 338         mono_md5_update (&ctx, buffer, buffer_size);
 339         mono_md5_final (&ctx, digest);
 340
 341 }
 342
 343
 344 /**
 345  * mono_md5_get_digest_from_file: get the md5 hash of a file
 346  * @filename: file name
 347  * @digest: 16 bytes buffer receiving the hash code.
 348  *
 349  * Get the md5 hash of a file. The result is put in
 350  * the 16 bytes buffer @digest .
 351  *
 352  * If an IO error happens the value in @digest is not updated.
 353  **/
 354 void
 355 mono_md5_get_digest_from_file (const gchar *filename, guchar digest[16])
 356 {
 357         MonoMD5Context ctx;
 358         guchar tmp_buf[1024];
 359         gint nb_bytes_read;
 360         FILE *fp;
 361
 362         mono_md5_init (&ctx);
 363         fp = fopen(filename, "r");
 364         if (!fp) {
 365                 return;
 366         }
 367
 368         while ((nb_bytes_read = fread (tmp_buf, sizeof (guchar), 1024, fp)) > 0)
 369                 mono_md5_update (&ctx, tmp_buf, nb_bytes_read);
 370
 371         if (ferror(fp)) {
 372                 fclose(fp);
 373                 return;
 374         } else {
 375                 fclose(fp);
 376         }
 377
 378         mono_md5_final (&ctx, digest);
 379 }
 380
 381
 382
 383