2671b001722c2d2dbf4ca2f3f15ca5e09733ae3c
[openssl.git] / crypto / md5 / md5_dgst.c
1 /* crypto/md5/md5_dgst.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3  * All rights reserved.
4  *
5  * This package is an SSL implementation written
6  * by Eric Young (eay@cryptsoft.com).
7  * The implementation was written so as to conform with Netscapes SSL.
8  * 
9  * This library is free for commercial and non-commercial use as long as
10  * the following conditions are aheared to.  The following conditions
11  * apply to all code found in this distribution, be it the RC4, RSA,
12  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
13  * included with this distribution is covered by the same copyright terms
14  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15  * 
16  * Copyright remains Eric Young's, and as such any Copyright notices in
17  * the code are not to be removed.
18  * If this package is used in a product, Eric Young should be given attribution
19  * as the author of the parts of the library used.
20  * This can be in the form of a textual message at program startup or
21  * in documentation (online or textual) provided with the package.
22  * 
23  * Redistribution and use in source and binary forms, with or without
24  * modification, are permitted provided that the following conditions
25  * are met:
26  * 1. Redistributions of source code must retain the copyright
27  *    notice, this list of conditions and the following disclaimer.
28  * 2. Redistributions in binary form must reproduce the above copyright
29  *    notice, this list of conditions and the following disclaimer in the
30  *    documentation and/or other materials provided with the distribution.
31  * 3. All advertising materials mentioning features or use of this software
32  *    must display the following acknowledgement:
33  *    "This product includes cryptographic software written by
34  *     Eric Young (eay@cryptsoft.com)"
35  *    The word 'cryptographic' can be left out if the rouines from the library
36  *    being used are not cryptographic related :-).
37  * 4. If you include any Windows specific code (or a derivative thereof) from 
38  *    the apps directory (application code) you must include an acknowledgement:
39  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40  * 
41  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
51  * SUCH DAMAGE.
52  * 
53  * The licence and distribution terms for any publically available version or
54  * derivative of this code cannot be changed.  i.e. this code cannot simply be
55  * copied and put under another distribution licence
56  * [including the GNU Public Licence.]
57  */
58
59 #include <stdio.h>
60 #include "md5_locl.h"
61 #include <openssl/opensslv.h>
62
63 char *MD5_version="MD5" OPENSSL_VERSION_PTEXT;
64
65 /* Implemented from RFC1321 The MD5 Message-Digest Algorithm
66  */
67
68 #define INIT_DATA_A (unsigned long)0x67452301L
69 #define INIT_DATA_B (unsigned long)0xefcdab89L
70 #define INIT_DATA_C (unsigned long)0x98badcfeL
71 #define INIT_DATA_D (unsigned long)0x10325476L
72
73 #  ifdef MD5_ASM
74      void md5_block_x86(MD5_CTX *c, unsigned long *p,int num);
75 #    define md5_block md5_block_x86
76 #  else
77      static void md5_block(MD5_CTX *c, unsigned long *p,int num);
78 #  endif
79 void MD5_Init(MD5_CTX *c)
80         {
81         c->A=INIT_DATA_A;
82         c->B=INIT_DATA_B;
83         c->C=INIT_DATA_C;
84         c->D=INIT_DATA_D;
85         c->Nl=0;
86         c->Nh=0;
87         c->num=0;
88         }
89
90 void MD5_Update(MD5_CTX *c, const void *_data, unsigned long len)
91         {
92         register const unsigned char *data=_data;
93         register ULONG *p;
94         int sw,sc;
95         ULONG l;
96
97         if (len == 0) return;
98
99         l=(c->Nl+(len<<3))&0xffffffffL;
100         /* 95-05-24 eay Fixed a bug with the overflow handling, thanks to
101          * Wei Dai <weidai@eskimo.com> for pointing it out. */
102         if (l < c->Nl) /* overflow */
103                 c->Nh++;
104         c->Nh+=(len>>29);
105         c->Nl=l;
106
107         if (c->num != 0)
108                 {
109                 p=c->data;
110                 sw=c->num>>2;
111                 sc=c->num&0x03;
112
113                 if ((c->num+len) >= MD5_CBLOCK)
114                         {
115                         l= p[sw];
116                         p_c2l(data,l,sc);
117                         p[sw++]=l;
118                         for (; sw<MD5_LBLOCK; sw++)
119                                 {
120                                 c2l(data,l);
121                                 p[sw]=l;
122                                 }
123                         len-=(MD5_CBLOCK-c->num);
124
125                         md5_block(c,p,64);
126                         c->num=0;
127                         /* drop through and do the rest */
128                         }
129                 else
130                         {
131                         int ew,ec;
132
133                         c->num+=(int)len;
134                         if ((sc+len) < 4) /* ugly, add char's to a word */
135                                 {
136                                 l= p[sw];
137                                 p_c2l_p(data,l,sc,len);
138                                 p[sw]=l;
139                                 }
140                         else
141                                 {
142                                 ew=(c->num>>2);
143                                 ec=(c->num&0x03);
144                                 l= p[sw];
145                                 p_c2l(data,l,sc);
146                                 p[sw++]=l;
147                                 for (; sw < ew; sw++)
148                                         { c2l(data,l); p[sw]=l; }
149                                 if (ec)
150                                         {
151                                         c2l_p(data,l,ec);
152                                         p[sw]=l;
153                                         }
154                                 }
155                         return;
156                         }
157                 }
158         /* we now can process the input data in blocks of MD5_CBLOCK
159          * chars and save the leftovers to c->data. */
160 #ifdef L_ENDIAN
161         if ((((unsigned long)data)%sizeof(ULONG)) == 0)
162                 {
163                 sw=(int)len/MD5_CBLOCK;
164                 if (sw > 0)
165                         {
166                         sw*=MD5_CBLOCK;
167                         md5_block(c,(ULONG *)data,sw);
168                         data+=sw;
169                         len-=sw;
170                         }
171                 }
172 #endif
173         p=c->data;
174         while (len >= MD5_CBLOCK)
175                 {
176 #if defined(L_ENDIAN) || defined(B_ENDIAN)
177                 if (p != (unsigned long *)data)
178                         memcpy(p,data,MD5_CBLOCK);
179                 data+=MD5_CBLOCK;
180 #ifdef B_ENDIAN
181                 for (sw=(MD5_LBLOCK/4); sw; sw--)
182                         {
183                         Endian_Reverse32(p[0]);
184                         Endian_Reverse32(p[1]);
185                         Endian_Reverse32(p[2]);
186                         Endian_Reverse32(p[3]);
187                         p+=4;
188                         }
189 #endif
190 #else
191                 for (sw=(MD5_LBLOCK/4); sw; sw--)
192                         {
193                         c2l(data,l); *(p++)=l;
194                         c2l(data,l); *(p++)=l;
195                         c2l(data,l); *(p++)=l;
196                         c2l(data,l); *(p++)=l; 
197                         } 
198 #endif
199                 p=c->data;
200                 md5_block(c,p,64);
201                 len-=MD5_CBLOCK;
202                 }
203         sc=(int)len;
204         c->num=sc;
205         if (sc)
206                 {
207                 sw=sc>>2;       /* words to copy */
208 #ifdef L_ENDIAN
209                 p[sw]=0;
210                 memcpy(p,data,sc);
211 #else
212                 sc&=0x03;
213                 for ( ; sw; sw--)
214                         { c2l(data,l); *(p++)=l; }
215                 c2l_p(data,l,sc);
216                 *p=l;
217 #endif
218                 }
219         }
220
221 void MD5_Transform(MD5_CTX *c, unsigned char *b)
222         {
223         ULONG p[16];
224 #if !defined(L_ENDIAN)
225         ULONG *q;
226         int i;
227 #endif
228
229 #if defined(B_ENDIAN) || defined(L_ENDIAN)
230         memcpy(p,b,64);
231 #ifdef B_ENDIAN
232         q=p;
233         for (i=(MD5_LBLOCK/4); i; i--)
234                 {
235                 Endian_Reverse32(q[0]);
236                 Endian_Reverse32(q[1]);
237                 Endian_Reverse32(q[2]);
238                 Endian_Reverse32(q[3]);
239                 q+=4;
240                 }
241 #endif
242 #else
243         q=p;
244         for (i=(MD5_LBLOCK/4); i; i--)
245                 {
246                 ULONG l;
247                 c2l(b,l); *(q++)=l;
248                 c2l(b,l); *(q++)=l;
249                 c2l(b,l); *(q++)=l;
250                 c2l(b,l); *(q++)=l; 
251                 } 
252 #endif
253         md5_block(c,p,64);
254         }
255
256 #ifndef MD5_ASM
257
258 static void md5_block(MD5_CTX *c, register ULONG *X, int num)
259         {
260         register ULONG A,B,C,D;
261
262         A=c->A;
263         B=c->B;
264         C=c->C;
265         D=c->D;
266         for (;;)
267                 {
268         /* Round 0 */
269         R0(A,B,C,D,X[ 0], 7,0xd76aa478L);
270         R0(D,A,B,C,X[ 1],12,0xe8c7b756L);
271         R0(C,D,A,B,X[ 2],17,0x242070dbL);
272         R0(B,C,D,A,X[ 3],22,0xc1bdceeeL);
273         R0(A,B,C,D,X[ 4], 7,0xf57c0fafL);
274         R0(D,A,B,C,X[ 5],12,0x4787c62aL);
275         R0(C,D,A,B,X[ 6],17,0xa8304613L);
276         R0(B,C,D,A,X[ 7],22,0xfd469501L);
277         R0(A,B,C,D,X[ 8], 7,0x698098d8L);
278         R0(D,A,B,C,X[ 9],12,0x8b44f7afL);
279         R0(C,D,A,B,X[10],17,0xffff5bb1L);
280         R0(B,C,D,A,X[11],22,0x895cd7beL);
281         R0(A,B,C,D,X[12], 7,0x6b901122L);
282         R0(D,A,B,C,X[13],12,0xfd987193L);
283         R0(C,D,A,B,X[14],17,0xa679438eL);
284         R0(B,C,D,A,X[15],22,0x49b40821L);
285         /* Round 1 */
286         R1(A,B,C,D,X[ 1], 5,0xf61e2562L);
287         R1(D,A,B,C,X[ 6], 9,0xc040b340L);
288         R1(C,D,A,B,X[11],14,0x265e5a51L);
289         R1(B,C,D,A,X[ 0],20,0xe9b6c7aaL);
290         R1(A,B,C,D,X[ 5], 5,0xd62f105dL);
291         R1(D,A,B,C,X[10], 9,0x02441453L);
292         R1(C,D,A,B,X[15],14,0xd8a1e681L);
293         R1(B,C,D,A,X[ 4],20,0xe7d3fbc8L);
294         R1(A,B,C,D,X[ 9], 5,0x21e1cde6L);
295         R1(D,A,B,C,X[14], 9,0xc33707d6L);
296         R1(C,D,A,B,X[ 3],14,0xf4d50d87L);
297         R1(B,C,D,A,X[ 8],20,0x455a14edL);
298         R1(A,B,C,D,X[13], 5,0xa9e3e905L);
299         R1(D,A,B,C,X[ 2], 9,0xfcefa3f8L);
300         R1(C,D,A,B,X[ 7],14,0x676f02d9L);
301         R1(B,C,D,A,X[12],20,0x8d2a4c8aL);
302         /* Round 2 */
303         R2(A,B,C,D,X[ 5], 4,0xfffa3942L);
304         R2(D,A,B,C,X[ 8],11,0x8771f681L);
305         R2(C,D,A,B,X[11],16,0x6d9d6122L);
306         R2(B,C,D,A,X[14],23,0xfde5380cL);
307         R2(A,B,C,D,X[ 1], 4,0xa4beea44L);
308         R2(D,A,B,C,X[ 4],11,0x4bdecfa9L);
309         R2(C,D,A,B,X[ 7],16,0xf6bb4b60L);
310         R2(B,C,D,A,X[10],23,0xbebfbc70L);
311         R2(A,B,C,D,X[13], 4,0x289b7ec6L);
312         R2(D,A,B,C,X[ 0],11,0xeaa127faL);
313         R2(C,D,A,B,X[ 3],16,0xd4ef3085L);
314         R2(B,C,D,A,X[ 6],23,0x04881d05L);
315         R2(A,B,C,D,X[ 9], 4,0xd9d4d039L);
316         R2(D,A,B,C,X[12],11,0xe6db99e5L);
317         R2(C,D,A,B,X[15],16,0x1fa27cf8L);
318         R2(B,C,D,A,X[ 2],23,0xc4ac5665L);
319         /* Round 3 */
320         R3(A,B,C,D,X[ 0], 6,0xf4292244L);
321         R3(D,A,B,C,X[ 7],10,0x432aff97L);
322         R3(C,D,A,B,X[14],15,0xab9423a7L);
323         R3(B,C,D,A,X[ 5],21,0xfc93a039L);
324         R3(A,B,C,D,X[12], 6,0x655b59c3L);
325         R3(D,A,B,C,X[ 3],10,0x8f0ccc92L);
326         R3(C,D,A,B,X[10],15,0xffeff47dL);
327         R3(B,C,D,A,X[ 1],21,0x85845dd1L);
328         R3(A,B,C,D,X[ 8], 6,0x6fa87e4fL);
329         R3(D,A,B,C,X[15],10,0xfe2ce6e0L);
330         R3(C,D,A,B,X[ 6],15,0xa3014314L);
331         R3(B,C,D,A,X[13],21,0x4e0811a1L);
332         R3(A,B,C,D,X[ 4], 6,0xf7537e82L);
333         R3(D,A,B,C,X[11],10,0xbd3af235L);
334         R3(C,D,A,B,X[ 2],15,0x2ad7d2bbL);
335         R3(B,C,D,A,X[ 9],21,0xeb86d391L);
336
337         A+=c->A&0xffffffffL;
338         B+=c->B&0xffffffffL;
339         c->A=A;
340         c->B=B;
341         C+=c->C&0xffffffffL;
342         D+=c->D&0xffffffffL;
343         c->C=C;
344         c->D=D;
345         X+=16;
346         num-=64;
347         if (num <= 0) break;
348                 }
349         }
350 #endif
351
352 void MD5_Final(unsigned char *md, MD5_CTX *c)
353         {
354         register int i,j;
355         register ULONG l;
356         register ULONG *p;
357         static unsigned char end[4]={0x80,0x00,0x00,0x00};
358         unsigned char *cp=end;
359
360         /* c->num should definitly have room for at least one more byte. */
361         p=c->data;
362         j=c->num;
363         i=j>>2;
364
365         /* purify often complains about the following line as an
366          * Uninitialized Memory Read.  While this can be true, the
367          * following p_c2l macro will reset l when that case is true.
368          * This is because j&0x03 contains the number of 'valid' bytes
369          * already in p[i].  If and only if j&0x03 == 0, the UMR will
370          * occur but this is also the only time p_c2l will do
371          * l= *(cp++) instead of l|= *(cp++)
372          * Many thanks to Alex Tang <altitude@cic.net> for pickup this
373          * 'potential bug' */
374 #ifdef PURIFY
375         if ((j&0x03) == 0) p[i]=0;
376 #endif
377         l=p[i];
378         p_c2l(cp,l,j&0x03);
379         p[i]=l;
380         i++;
381         /* i is the next 'undefined word' */
382         if (c->num >= MD5_LAST_BLOCK)
383                 {
384                 for (; i<MD5_LBLOCK; i++)
385                         p[i]=0;
386                 md5_block(c,p,64);
387                 i=0;
388                 }
389         for (; i<(MD5_LBLOCK-2); i++)
390                 p[i]=0;
391         p[MD5_LBLOCK-2]=c->Nl;
392         p[MD5_LBLOCK-1]=c->Nh;
393         md5_block(c,p,64);
394         cp=md;
395         l=c->A; l2c(l,cp);
396         l=c->B; l2c(l,cp);
397         l=c->C; l2c(l,cp);
398         l=c->D; l2c(l,cp);
399
400         /* clear stuff, md5_block may be leaving some stuff on the stack
401          * but I'm not worried :-) */
402         c->num=0;
403 /*      memset((char *)&c,0,sizeof(c));*/
404         }
405
406 #ifdef undef
407 int printit(unsigned long *l)
408         {
409         int i,ii;
410
411         for (i=0; i<2; i++)
412                 {
413                 for (ii=0; ii<8; ii++)
414                         {
415                         fprintf(stderr,"%08lx ",l[i*8+ii]);
416                         }
417                 fprintf(stderr,"\n");
418                 }
419         }
420 #endif