source: vtkvis/branches/1.7/md5.c @ 4643

Last change on this file since 4643 was 3383, checked in by gah, 11 years ago

fixes for new stats file

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