2 * This code implements the MD5 message-digest algorithm.
3 * The algorithm is due to Ron Rivest. This code was
4 * written by Colin Plumb in 1993, no copyright is claimed.
5 * This code is in the public domain; do with it what you wish.
7 * Equivalent code is available from RSA Data Security, Inc.
8 * This code has been tested against that, and is equivalent,
9 * except that you don't need to include two pages of legalese
12 * To compute the message digest of a chunk of bytes, declare an
13 * MD5Context structure, pass it to md5_init, call md5_update as
14 * needed on buffers full of bytes, and then call md5_Final, which
15 * will fill a supplied 16-byte array with the digest.
18 /* parts of this file are :
19 * Written March 1993 by Branko Lankester
20 * Modified June 1993 by Colin Plumb for altered md5.c.
21 * Modified October 1995 by Erik Troan for RPM
25 * Pulled from evolution for use in GQview, their version is nicely glib'ed
26 * GNOME CVS HEAD evolution/e-util/md5-utils.[ch] September 8, 2004
34 #include "ui_fileops.h" /* for utf-8 filename conversion */
37 static void md5_transform (guint32 buf[4], const guint32 in[16]);
39 static gint _ie = 0x44332211;
40 static union _endian { gint i; gchar b[4]; } *_endian = (union _endian *)&_ie;
41 #define IS_BIG_ENDIAN() (_endian->b[0] == '\x44')
42 #define IS_LITTLE_ENDIAN() (_endian->b[0] == '\x11')
46 * Note: this code is harmless on little-endian machines.
49 _byte_reverse (guchar *buf, guint32 longs)
53 t = (guint32) ((guint32) buf[3] << 8 | buf[2]) << 16 |
54 ((guint32) buf[1] << 8 | buf[0]);
61 * md5_init: Initialise an md5 context object
64 * Initialise an md5 buffer.
68 md5_init (MD5Context *ctx)
70 ctx->buf[0] = 0x67452301;
71 ctx->buf[1] = 0xefcdab89;
72 ctx->buf[2] = 0x98badcfe;
73 ctx->buf[3] = 0x10325476;
79 ctx->doByteReverse = 1;
81 ctx->doByteReverse = 0;
87 * md5_update: add a buffer to md5 hash computation
88 * @ctx: conetxt object used for md5 computaion
92 * Update context to reflect the concatenation of another buffer full
93 * of bytes. Use this to progressively construct an md5 hash.
96 md5_update (MD5Context *ctx, const guchar *buf, guint32 len)
100 /* Update bitcount */
103 if ((ctx->bits[0] = t + ((guint32) len << 3)) < t)
104 ctx->bits[1]++; /* Carry from low to high */
105 ctx->bits[1] += len >> 29;
107 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
109 /* Handle any leading odd-sized chunks */
112 guchar *p = (guchar *) ctx->in + t;
116 memcpy (p, buf, len);
120 if (ctx->doByteReverse)
121 _byte_reverse (ctx->in, 16);
122 md5_transform (ctx->buf, (guint32 *) ctx->in);
126 /* Process data in 64-byte chunks */
129 memcpy (ctx->in, buf, 64);
130 if (ctx->doByteReverse)
131 _byte_reverse (ctx->in, 16);
132 md5_transform (ctx->buf, (guint32 *) ctx->in);
137 /* Handle any remaining bytes of data. */
139 memcpy (ctx->in, buf, len);
147 * Final wrapup - pad to 64-byte boundary with the bit pattern
148 * 1 0* (64-bit count of bits processed, MSB-first)
151 * md5_final: copy the final md5 hash to a bufer
152 * @digest: 16 bytes buffer
153 * @ctx: context containing the calculated md5
155 * copy the final md5 hash to a bufer
158 md5_final (MD5Context *ctx, guchar digest[16])
163 /* Compute number of bytes mod 64 */
164 count = (ctx->bits[0] >> 3) & 0x3F;
166 /* Set the first char of padding to 0x80. This is safe since there is
167 always at least one byte free */
171 /* Bytes of padding needed to make 64 bytes */
172 count = 64 - 1 - count;
174 /* Pad out to 56 mod 64 */
176 /* Two lots of padding: Pad the first block to 64 bytes */
177 memset (p, 0, count);
178 if (ctx->doByteReverse)
179 _byte_reverse (ctx->in, 16);
180 md5_transform (ctx->buf, (guint32 *) ctx->in);
182 /* Now fill the next block with 56 bytes */
183 memset (ctx->in, 0, 56);
185 /* Pad block to 56 bytes */
186 memset (p, 0, count - 8);
188 if (ctx->doByteReverse)
189 _byte_reverse (ctx->in, 14);
191 /* Append length in bits and transform */
192 ((guint32 *) ctx->in)[14] = ctx->bits[0];
193 ((guint32 *) ctx->in)[15] = ctx->bits[1];
195 md5_transform (ctx->buf, (guint32 *) ctx->in);
196 if (ctx->doByteReverse)
197 _byte_reverse ((guchar *) ctx->buf, 4);
198 memcpy (digest, ctx->buf, 16);
204 /* The four core functions - F1 is optimized somewhat */
206 /* #define F1(x, y, z) (x & y | ~x & z) */
207 #define F1(x, y, z) (z ^ (x & (y ^ z)))
208 #define F2(x, y, z) F1(z, x, y)
209 #define F3(x, y, z) (x ^ y ^ z)
210 #define F4(x, y, z) (y ^ (x | ~z))
212 /* This is the central step in the MD5 algorithm. */
213 #define MD5STEP(f, w, x, y, z, data, s) \
214 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
217 * The core of the MD5 algorithm, this alters an existing MD5 hash to
218 * reflect the addition of 16 longwords of new data. md5_Update blocks
219 * the data and converts bytes into longwords for this routine.
222 md5_transform (guint32 buf[4], const guint32 in[16])
224 register guint32 a, b, c, d;
231 MD5STEP (F1, a, b, c, d, in[0] + 0xd76aa478, 7);
232 MD5STEP (F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
233 MD5STEP (F1, c, d, a, b, in[2] + 0x242070db, 17);
234 MD5STEP (F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
235 MD5STEP (F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
236 MD5STEP (F1, d, a, b, c, in[5] + 0x4787c62a, 12);
237 MD5STEP (F1, c, d, a, b, in[6] + 0xa8304613, 17);
238 MD5STEP (F1, b, c, d, a, in[7] + 0xfd469501, 22);
239 MD5STEP (F1, a, b, c, d, in[8] + 0x698098d8, 7);
240 MD5STEP (F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
241 MD5STEP (F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
242 MD5STEP (F1, b, c, d, a, in[11] + 0x895cd7be, 22);
243 MD5STEP (F1, a, b, c, d, in[12] + 0x6b901122, 7);
244 MD5STEP (F1, d, a, b, c, in[13] + 0xfd987193, 12);
245 MD5STEP (F1, c, d, a, b, in[14] + 0xa679438e, 17);
246 MD5STEP (F1, b, c, d, a, in[15] + 0x49b40821, 22);
248 MD5STEP (F2, a, b, c, d, in[1] + 0xf61e2562, 5);
249 MD5STEP (F2, d, a, b, c, in[6] + 0xc040b340, 9);
250 MD5STEP (F2, c, d, a, b, in[11] + 0x265e5a51, 14);
251 MD5STEP (F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
252 MD5STEP (F2, a, b, c, d, in[5] + 0xd62f105d, 5);
253 MD5STEP (F2, d, a, b, c, in[10] + 0x02441453, 9);
254 MD5STEP (F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
255 MD5STEP (F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
256 MD5STEP (F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
257 MD5STEP (F2, d, a, b, c, in[14] + 0xc33707d6, 9);
258 MD5STEP (F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
259 MD5STEP (F2, b, c, d, a, in[8] + 0x455a14ed, 20);
260 MD5STEP (F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
261 MD5STEP (F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
262 MD5STEP (F2, c, d, a, b, in[7] + 0x676f02d9, 14);
263 MD5STEP (F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
265 MD5STEP (F3, a, b, c, d, in[5] + 0xfffa3942, 4);
266 MD5STEP (F3, d, a, b, c, in[8] + 0x8771f681, 11);
267 MD5STEP (F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
268 MD5STEP (F3, b, c, d, a, in[14] + 0xfde5380c, 23);
269 MD5STEP (F3, a, b, c, d, in[1] + 0xa4beea44, 4);
270 MD5STEP (F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
271 MD5STEP (F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
272 MD5STEP (F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
273 MD5STEP (F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
274 MD5STEP (F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
275 MD5STEP (F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
276 MD5STEP (F3, b, c, d, a, in[6] + 0x04881d05, 23);
277 MD5STEP (F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
278 MD5STEP (F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
279 MD5STEP (F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
280 MD5STEP (F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
282 MD5STEP (F4, a, b, c, d, in[0] + 0xf4292244, 6);
283 MD5STEP (F4, d, a, b, c, in[7] + 0x432aff97, 10);
284 MD5STEP (F4, c, d, a, b, in[14] + 0xab9423a7, 15);
285 MD5STEP (F4, b, c, d, a, in[5] + 0xfc93a039, 21);
286 MD5STEP (F4, a, b, c, d, in[12] + 0x655b59c3, 6);
287 MD5STEP (F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
288 MD5STEP (F4, c, d, a, b, in[10] + 0xffeff47d, 15);
289 MD5STEP (F4, b, c, d, a, in[1] + 0x85845dd1, 21);
290 MD5STEP (F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
291 MD5STEP (F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
292 MD5STEP (F4, c, d, a, b, in[6] + 0xa3014314, 15);
293 MD5STEP (F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
294 MD5STEP (F4, a, b, c, d, in[4] + 0xf7537e82, 6);
295 MD5STEP (F4, d, a, b, c, in[11] + 0xbd3af235, 10);
296 MD5STEP (F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
297 MD5STEP (F4, b, c, d, a, in[9] + 0xeb86d391, 21);
309 * md5_get_digest: get the md5 hash of a buffer
310 * @buffer: byte buffer
311 * @buffer_size: buffer size (in bytes)
312 * @digest: 16 bytes buffer receiving the hash code.
314 * Get the md5 hash of a buffer. The result is put in
315 * the 16 bytes buffer @digest .
318 md5_get_digest (const gchar *buffer, gint buffer_size, guchar digest[16])
323 md5_update (&ctx, buffer, buffer_size);
324 md5_final (&ctx, digest);
328 /* modified for GQView, starting here */
331 * md5_get_digest_from_file: get the md5 hash of a file
332 * @filename: file name
333 * @digest: 16 bytes buffer receiving the hash code.
334 * @return: TRUE on success
336 * Get the md5 hash of a file. The result is put in
337 * the 16 bytes buffer @digest .
339 gboolean md5_get_digest_from_file(const gchar *path, guchar digest[16])
342 guchar tmp_buf[1024];
347 fp = fopen(path, "r");
348 if (!fp) return FALSE;
352 while ((nb_bytes_read = fread (tmp_buf, sizeof (guchar), 1024, fp)) > 0)
354 md5_update (&ctx, tmp_buf, nb_bytes_read);
357 success = (ferror(fp) == 0);
359 if (!success) return FALSE;
361 md5_final (&ctx, digest);
365 /* does filename utf8 to filesystem encoding first */
366 gboolean md5_get_digest_from_file_utf8(const gchar *path, guchar digest[16])
371 pathl = path_from_utf8(path);
372 success = md5_get_digest_from_file(pathl, digest);
378 /* these to and from text string converters were borrowed from
379 * the libgnomeui library, where they are name thumb_digest_to/from_ascii
381 * this version of the from text util does buffer length checking,
382 * and assumes a NULL terminated string.
385 gchar *md5_digest_to_text(guchar digest[16])
387 static gchar hex_digits[] = "0123456789abcdef";
391 result = g_malloc(33);
392 for (i = 0; i < 16; i++)
394 result[2*i] = hex_digits[digest[i] >> 4];
395 result[2*i+1] = hex_digits[digest[i] & 0xf];
402 gboolean md5_digest_from_text(const gchar *text, guchar digest[16])
406 for (i = 0; i < 16; i++)
408 if (text[2*i] == '\0' || text[2*i+1] == '\0') return FALSE;
409 digest[i] = g_ascii_xdigit_value (text[2*i]) << 4 |
410 g_ascii_xdigit_value (text[2*i + 1]);
416 gchar *md5_text_from_file_utf8(const gchar *path, const gchar *error_text)
420 if (!md5_get_digest_from_file_utf8(path, digest)) return g_strdup(error_text);
422 return md5_digest_to_text(digest);