]> git.ipfire.org Git - thirdparty/openssl.git/blob - crypto/md5/md5_dgst.c
Change #include filenames from <foo.h> to <openssl.h>.
[thirdparty/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 #ifndef NOPROTO
74 # ifdef MD5_ASM
75 void md5_block_x86(MD5_CTX *c, unsigned long *p,int num);
76 # define md5_block md5_block_x86
77 # else
78 static void md5_block(MD5_CTX *c, unsigned long *p,int num);
79 # endif
80 #else
81 # ifdef MD5_ASM
82 void md5_block_x86();
83 # define md5_block md5_block_x86
84 # else
85 static void md5_block();
86 # endif
87 #endif
88
89 void MD5_Init(MD5_CTX *c)
90 {
91 c->A=INIT_DATA_A;
92 c->B=INIT_DATA_B;
93 c->C=INIT_DATA_C;
94 c->D=INIT_DATA_D;
95 c->Nl=0;
96 c->Nh=0;
97 c->num=0;
98 }
99
100 void MD5_Update(MD5_CTX *c, const void *_data, unsigned long len)
101 {
102 register const unsigned char *data=_data;
103 register ULONG *p;
104 int sw,sc;
105 ULONG l;
106
107 if (len == 0) return;
108
109 l=(c->Nl+(len<<3))&0xffffffffL;
110 /* 95-05-24 eay Fixed a bug with the overflow handling, thanks to
111 * Wei Dai <weidai@eskimo.com> for pointing it out. */
112 if (l < c->Nl) /* overflow */
113 c->Nh++;
114 c->Nh+=(len>>29);
115 c->Nl=l;
116
117 if (c->num != 0)
118 {
119 p=c->data;
120 sw=c->num>>2;
121 sc=c->num&0x03;
122
123 if ((c->num+len) >= MD5_CBLOCK)
124 {
125 l= p[sw];
126 p_c2l(data,l,sc);
127 p[sw++]=l;
128 for (; sw<MD5_LBLOCK; sw++)
129 {
130 c2l(data,l);
131 p[sw]=l;
132 }
133 len-=(MD5_CBLOCK-c->num);
134
135 md5_block(c,p,64);
136 c->num=0;
137 /* drop through and do the rest */
138 }
139 else
140 {
141 int ew,ec;
142
143 c->num+=(int)len;
144 if ((sc+len) < 4) /* ugly, add char's to a word */
145 {
146 l= p[sw];
147 p_c2l_p(data,l,sc,len);
148 p[sw]=l;
149 }
150 else
151 {
152 ew=(c->num>>2);
153 ec=(c->num&0x03);
154 l= p[sw];
155 p_c2l(data,l,sc);
156 p[sw++]=l;
157 for (; sw < ew; sw++)
158 { c2l(data,l); p[sw]=l; }
159 if (ec)
160 {
161 c2l_p(data,l,ec);
162 p[sw]=l;
163 }
164 }
165 return;
166 }
167 }
168 /* we now can process the input data in blocks of MD5_CBLOCK
169 * chars and save the leftovers to c->data. */
170 #ifdef L_ENDIAN
171 if ((((unsigned long)data)%sizeof(ULONG)) == 0)
172 {
173 sw=(int)len/MD5_CBLOCK;
174 if (sw > 0)
175 {
176 sw*=MD5_CBLOCK;
177 md5_block(c,(ULONG *)data,sw);
178 data+=sw;
179 len-=sw;
180 }
181 }
182 #endif
183 p=c->data;
184 while (len >= MD5_CBLOCK)
185 {
186 #if defined(L_ENDIAN) || defined(B_ENDIAN)
187 if (p != (unsigned long *)data)
188 memcpy(p,data,MD5_CBLOCK);
189 data+=MD5_CBLOCK;
190 #ifdef B_ENDIAN
191 for (sw=(MD5_LBLOCK/4); sw; sw--)
192 {
193 Endian_Reverse32(p[0]);
194 Endian_Reverse32(p[1]);
195 Endian_Reverse32(p[2]);
196 Endian_Reverse32(p[3]);
197 p+=4;
198 }
199 #endif
200 #else
201 for (sw=(MD5_LBLOCK/4); sw; sw--)
202 {
203 c2l(data,l); *(p++)=l;
204 c2l(data,l); *(p++)=l;
205 c2l(data,l); *(p++)=l;
206 c2l(data,l); *(p++)=l;
207 }
208 #endif
209 p=c->data;
210 md5_block(c,p,64);
211 len-=MD5_CBLOCK;
212 }
213 sc=(int)len;
214 c->num=sc;
215 if (sc)
216 {
217 sw=sc>>2; /* words to copy */
218 #ifdef L_ENDIAN
219 p[sw]=0;
220 memcpy(p,data,sc);
221 #else
222 sc&=0x03;
223 for ( ; sw; sw--)
224 { c2l(data,l); *(p++)=l; }
225 c2l_p(data,l,sc);
226 *p=l;
227 #endif
228 }
229 }
230
231 void MD5_Transform(MD5_CTX *c, unsigned char *b)
232 {
233 ULONG p[16];
234 #if !defined(L_ENDIAN)
235 ULONG *q;
236 int i;
237 #endif
238
239 #if defined(B_ENDIAN) || defined(L_ENDIAN)
240 memcpy(p,b,64);
241 #ifdef B_ENDIAN
242 q=p;
243 for (i=(MD5_LBLOCK/4); i; i--)
244 {
245 Endian_Reverse32(q[0]);
246 Endian_Reverse32(q[1]);
247 Endian_Reverse32(q[2]);
248 Endian_Reverse32(q[3]);
249 q+=4;
250 }
251 #endif
252 #else
253 q=p;
254 for (i=(MD5_LBLOCK/4); i; i--)
255 {
256 ULONG l;
257 c2l(b,l); *(q++)=l;
258 c2l(b,l); *(q++)=l;
259 c2l(b,l); *(q++)=l;
260 c2l(b,l); *(q++)=l;
261 }
262 #endif
263 md5_block(c,p,64);
264 }
265
266 #ifndef MD5_ASM
267
268 static void md5_block(MD5_CTX *c, register ULONG *X, int num)
269 {
270 register ULONG A,B,C,D;
271
272 A=c->A;
273 B=c->B;
274 C=c->C;
275 D=c->D;
276 for (;;)
277 {
278 /* Round 0 */
279 R0(A,B,C,D,X[ 0], 7,0xd76aa478L);
280 R0(D,A,B,C,X[ 1],12,0xe8c7b756L);
281 R0(C,D,A,B,X[ 2],17,0x242070dbL);
282 R0(B,C,D,A,X[ 3],22,0xc1bdceeeL);
283 R0(A,B,C,D,X[ 4], 7,0xf57c0fafL);
284 R0(D,A,B,C,X[ 5],12,0x4787c62aL);
285 R0(C,D,A,B,X[ 6],17,0xa8304613L);
286 R0(B,C,D,A,X[ 7],22,0xfd469501L);
287 R0(A,B,C,D,X[ 8], 7,0x698098d8L);
288 R0(D,A,B,C,X[ 9],12,0x8b44f7afL);
289 R0(C,D,A,B,X[10],17,0xffff5bb1L);
290 R0(B,C,D,A,X[11],22,0x895cd7beL);
291 R0(A,B,C,D,X[12], 7,0x6b901122L);
292 R0(D,A,B,C,X[13],12,0xfd987193L);
293 R0(C,D,A,B,X[14],17,0xa679438eL);
294 R0(B,C,D,A,X[15],22,0x49b40821L);
295 /* Round 1 */
296 R1(A,B,C,D,X[ 1], 5,0xf61e2562L);
297 R1(D,A,B,C,X[ 6], 9,0xc040b340L);
298 R1(C,D,A,B,X[11],14,0x265e5a51L);
299 R1(B,C,D,A,X[ 0],20,0xe9b6c7aaL);
300 R1(A,B,C,D,X[ 5], 5,0xd62f105dL);
301 R1(D,A,B,C,X[10], 9,0x02441453L);
302 R1(C,D,A,B,X[15],14,0xd8a1e681L);
303 R1(B,C,D,A,X[ 4],20,0xe7d3fbc8L);
304 R1(A,B,C,D,X[ 9], 5,0x21e1cde6L);
305 R1(D,A,B,C,X[14], 9,0xc33707d6L);
306 R1(C,D,A,B,X[ 3],14,0xf4d50d87L);
307 R1(B,C,D,A,X[ 8],20,0x455a14edL);
308 R1(A,B,C,D,X[13], 5,0xa9e3e905L);
309 R1(D,A,B,C,X[ 2], 9,0xfcefa3f8L);
310 R1(C,D,A,B,X[ 7],14,0x676f02d9L);
311 R1(B,C,D,A,X[12],20,0x8d2a4c8aL);
312 /* Round 2 */
313 R2(A,B,C,D,X[ 5], 4,0xfffa3942L);
314 R2(D,A,B,C,X[ 8],11,0x8771f681L);
315 R2(C,D,A,B,X[11],16,0x6d9d6122L);
316 R2(B,C,D,A,X[14],23,0xfde5380cL);
317 R2(A,B,C,D,X[ 1], 4,0xa4beea44L);
318 R2(D,A,B,C,X[ 4],11,0x4bdecfa9L);
319 R2(C,D,A,B,X[ 7],16,0xf6bb4b60L);
320 R2(B,C,D,A,X[10],23,0xbebfbc70L);
321 R2(A,B,C,D,X[13], 4,0x289b7ec6L);
322 R2(D,A,B,C,X[ 0],11,0xeaa127faL);
323 R2(C,D,A,B,X[ 3],16,0xd4ef3085L);
324 R2(B,C,D,A,X[ 6],23,0x04881d05L);
325 R2(A,B,C,D,X[ 9], 4,0xd9d4d039L);
326 R2(D,A,B,C,X[12],11,0xe6db99e5L);
327 R2(C,D,A,B,X[15],16,0x1fa27cf8L);
328 R2(B,C,D,A,X[ 2],23,0xc4ac5665L);
329 /* Round 3 */
330 R3(A,B,C,D,X[ 0], 6,0xf4292244L);
331 R3(D,A,B,C,X[ 7],10,0x432aff97L);
332 R3(C,D,A,B,X[14],15,0xab9423a7L);
333 R3(B,C,D,A,X[ 5],21,0xfc93a039L);
334 R3(A,B,C,D,X[12], 6,0x655b59c3L);
335 R3(D,A,B,C,X[ 3],10,0x8f0ccc92L);
336 R3(C,D,A,B,X[10],15,0xffeff47dL);
337 R3(B,C,D,A,X[ 1],21,0x85845dd1L);
338 R3(A,B,C,D,X[ 8], 6,0x6fa87e4fL);
339 R3(D,A,B,C,X[15],10,0xfe2ce6e0L);
340 R3(C,D,A,B,X[ 6],15,0xa3014314L);
341 R3(B,C,D,A,X[13],21,0x4e0811a1L);
342 R3(A,B,C,D,X[ 4], 6,0xf7537e82L);
343 R3(D,A,B,C,X[11],10,0xbd3af235L);
344 R3(C,D,A,B,X[ 2],15,0x2ad7d2bbL);
345 R3(B,C,D,A,X[ 9],21,0xeb86d391L);
346
347 A+=c->A&0xffffffffL;
348 B+=c->B&0xffffffffL;
349 c->A=A;
350 c->B=B;
351 C+=c->C&0xffffffffL;
352 D+=c->D&0xffffffffL;
353 c->C=C;
354 c->D=D;
355 X+=16;
356 num-=64;
357 if (num <= 0) break;
358 }
359 }
360 #endif
361
362 void MD5_Final(unsigned char *md, MD5_CTX *c)
363 {
364 register int i,j;
365 register ULONG l;
366 register ULONG *p;
367 static unsigned char end[4]={0x80,0x00,0x00,0x00};
368 unsigned char *cp=end;
369
370 /* c->num should definitly have room for at least one more byte. */
371 p=c->data;
372 j=c->num;
373 i=j>>2;
374
375 /* purify often complains about the following line as an
376 * Uninitialized Memory Read. While this can be true, the
377 * following p_c2l macro will reset l when that case is true.
378 * This is because j&0x03 contains the number of 'valid' bytes
379 * already in p[i]. If and only if j&0x03 == 0, the UMR will
380 * occur but this is also the only time p_c2l will do
381 * l= *(cp++) instead of l|= *(cp++)
382 * Many thanks to Alex Tang <altitude@cic.net> for pickup this
383 * 'potential bug' */
384 #ifdef PURIFY
385 if ((j&0x03) == 0) p[i]=0;
386 #endif
387 l=p[i];
388 p_c2l(cp,l,j&0x03);
389 p[i]=l;
390 i++;
391 /* i is the next 'undefined word' */
392 if (c->num >= MD5_LAST_BLOCK)
393 {
394 for (; i<MD5_LBLOCK; i++)
395 p[i]=0;
396 md5_block(c,p,64);
397 i=0;
398 }
399 for (; i<(MD5_LBLOCK-2); i++)
400 p[i]=0;
401 p[MD5_LBLOCK-2]=c->Nl;
402 p[MD5_LBLOCK-1]=c->Nh;
403 md5_block(c,p,64);
404 cp=md;
405 l=c->A; l2c(l,cp);
406 l=c->B; l2c(l,cp);
407 l=c->C; l2c(l,cp);
408 l=c->D; l2c(l,cp);
409
410 /* clear stuff, md5_block may be leaving some stuff on the stack
411 * but I'm not worried :-) */
412 c->num=0;
413 /* memset((char *)&c,0,sizeof(c));*/
414 }
415
416 #ifdef undef
417 int printit(unsigned long *l)
418 {
419 int i,ii;
420
421 for (i=0; i<2; i++)
422 {
423 for (ii=0; ii<8; ii++)
424 {
425 fprintf(stderr,"%08lx ",l[i*8+ii]);
426 }
427 fprintf(stderr,"\n");
428 }
429 }
430 #endif