Sync libmd with FreeBSD:
[dragonfly.git] / lib / libmd / sha0c.c
CommitLineData
984263bc
MD
1/* crypto/sha/sha_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 *
3cd01911
SW
58 * $FreeBSD: src/lib/libmd/sha0c.c,v 1.6 2006/01/17 15:35:56 phk Exp $
59 * $DragonFly: src/lib/libmd/sha0c.c,v 1.5 2008/09/11 20:25:34 swildner Exp $
984263bc
MD
60 */
61
62#include <sys/types.h>
63
64#include <stdio.h>
65#include <string.h>
66
984263bc
MD
67#include <machine/endian.h>
68
69#define SHA_0
70#undef SHA_1
71#include "sha.h"
72#include "sha_locl.h"
73
74char *SHA_version="SHA part of SSLeay 0.9.0b 11-Oct-1998";
75
76/* Implemented from SHA-0 document - The Secure Hash Algorithm
77 */
78
79#define INIT_DATA_h0 (unsigned long)0x67452301L
80#define INIT_DATA_h1 (unsigned long)0xefcdab89L
81#define INIT_DATA_h2 (unsigned long)0x98badcfeL
82#define INIT_DATA_h3 (unsigned long)0x10325476L
83#define INIT_DATA_h4 (unsigned long)0xc3d2e1f0L
84
85#define K_00_19 0x5a827999L
86#define K_20_39 0x6ed9eba1L
87#define K_40_59 0x8f1bbcdcL
88#define K_60_79 0xca62c1d6L
89
90#ifndef NOPROTO
91 void sha_block(SHA_CTX *c, const u_int32_t *p, int num);
92#else
93 void sha_block();
94#endif
95
96#define M_c2nl c2nl
97#define M_p_c2nl p_c2nl
98#define M_c2nl_p c2nl_p
99#define M_p_c2nl_p p_c2nl_p
100#define M_nl2c nl2c
101
102void SHA_Init(c)
103SHA_CTX *c;
104 {
105 c->h0=INIT_DATA_h0;
106 c->h1=INIT_DATA_h1;
107 c->h2=INIT_DATA_h2;
108 c->h3=INIT_DATA_h3;
109 c->h4=INIT_DATA_h4;
110 c->Nl=0;
111 c->Nh=0;
112 c->num=0;
113 }
114
3cd01911 115void SHA_Update(c, in, len)
984263bc 116SHA_CTX *c;
3cd01911 117const void *in;
984263bc
MD
118size_t len;
119 {
660c873b 120 u_int32_t *p;
984263bc
MD
121 int ew,ec,sw,sc;
122 u_int32_t l;
3cd01911 123 const unsigned char *data = in;
984263bc
MD
124
125 if (len == 0) return;
126
127 l=(c->Nl+(len<<3))&0xffffffffL;
128 if (l < c->Nl) /* overflow */
129 c->Nh++;
130 c->Nh+=(len>>29);
131 c->Nl=l;
132
133 if (c->num != 0)
134 {
135 p=c->data;
136 sw=c->num>>2;
137 sc=c->num&0x03;
138
139 if ((c->num+len) >= SHA_CBLOCK)
140 {
141 l= p[sw];
142 M_p_c2nl(data,l,sc);
143 p[sw++]=l;
144 for (; sw<SHA_LBLOCK; sw++)
145 {
146 M_c2nl(data,l);
147 p[sw]=l;
148 }
149 len-=(SHA_CBLOCK-c->num);
150
151 sha_block(c,p,64);
152 c->num=0;
153 /* drop through and do the rest */
154 }
155 else
156 {
157 c->num+=(int)len;
158 if ((sc+len) < 4) /* ugly, add char's to a word */
159 {
160 l= p[sw];
161 M_p_c2nl_p(data,l,sc,len);
162 p[sw]=l;
163 }
164 else
165 {
166 ew=(c->num>>2);
167 ec=(c->num&0x03);
168 l= p[sw];
169 M_p_c2nl(data,l,sc);
170 p[sw++]=l;
171 for (; sw < ew; sw++)
172 { M_c2nl(data,l); p[sw]=l; }
173 if (ec)
174 {
175 M_c2nl_p(data,l,ec);
176 p[sw]=l;
177 }
178 }
179 return;
180 }
181 }
182 /* We can only do the following code for assember, the reason
183 * being that the sha_block 'C' version changes the values
184 * in the 'data' array. The assember code avoids this and
185 * copies it to a local array. I should be able to do this for
186 * the C version as well....
187 */
188#if 1
189#if BYTE_ORDER == BIG_ENDIAN || defined(SHA_ASM)
190 if ((((unsigned int)data)%sizeof(u_int32_t)) == 0)
191 {
192 sw=len/SHA_CBLOCK;
193 if (sw)
194 {
195 sw*=SHA_CBLOCK;
196 sha_block(c,(u_int32_t *)data,sw);
197 data+=sw;
198 len-=sw;
199 }
200 }
201#endif
202#endif
203 /* we now can process the input data in blocks of SHA_CBLOCK
204 * chars and save the leftovers to c->data. */
205 p=c->data;
206 while (len >= SHA_CBLOCK)
207 {
208#if BYTE_ORDER == BIG_ENDIAN || BYTE_ORDER == LITTLE_ENDIAN
209 if (p != (u_int32_t *)data)
210 memcpy(p,data,SHA_CBLOCK);
211 data+=SHA_CBLOCK;
212# if BYTE_ORDER == LITTLE_ENDIAN
213# ifndef SHA_ASM /* Will not happen */
214 for (sw=(SHA_LBLOCK/4); sw; sw--)
215 {
216 Endian_Reverse32(p[0]);
217 Endian_Reverse32(p[1]);
218 Endian_Reverse32(p[2]);
219 Endian_Reverse32(p[3]);
220 p+=4;
221 }
222 p=c->data;
223# endif
224# endif
225#else
226 for (sw=(SHA_BLOCK/4); sw; sw--)
227 {
228 M_c2nl(data,l); *(p++)=l;
229 M_c2nl(data,l); *(p++)=l;
230 M_c2nl(data,l); *(p++)=l;
231 M_c2nl(data,l); *(p++)=l;
232 }
233 p=c->data;
234#endif
235 sha_block(c,p,64);
236 len-=SHA_CBLOCK;
237 }
238 ec=(int)len;
239 c->num=ec;
240 ew=(ec>>2);
241 ec&=0x03;
242
243 for (sw=0; sw < ew; sw++)
244 { M_c2nl(data,l); p[sw]=l; }
245 M_c2nl_p(data,l,ec);
246 p[sw]=l;
247 }
248
249void SHA_Transform(c,b)
250SHA_CTX *c;
251unsigned char *b;
252 {
253 u_int32_t p[16];
254#if BYTE_ORDER == LITTLE_ENDIAN
255 u_int32_t *q;
256 int i;
257#endif
258
259#if BYTE_ORDER == BIG_ENDIAN || BYTE_ORDER == LITTLE_ENDIAN
260 memcpy(p,b,64);
261#if BYTE_ORDER == LITTLE_ENDIAN
262 q=p;
263 for (i=(SHA_LBLOCK/4); i; i--)
264 {
265 Endian_Reverse32(q[0]);
266 Endian_Reverse32(q[1]);
267 Endian_Reverse32(q[2]);
268 Endian_Reverse32(q[3]);
269 q+=4;
270 }
271#endif
272#else
273 q=p;
274 for (i=(SHA_LBLOCK/4); i; i--)
275 {
276 u_int32_t l;
277 c2nl(b,l); *(q++)=l;
278 c2nl(b,l); *(q++)=l;
279 c2nl(b,l); *(q++)=l;
280 c2nl(b,l); *(q++)=l;
281 }
282#endif
283 sha_block(c,p,64);
284 }
285
286void sha_block(c, W, num)
287SHA_CTX *c;
288const u_int32_t *W;
289int num;
290 {
660c873b 291 u_int32_t A,B,C,D,E,T;
984263bc
MD
292 u_int32_t X[16];
293
294 A=c->h0;
295 B=c->h1;
296 C=c->h2;
297 D=c->h3;
298 E=c->h4;
299
300 for (;;)
301 {
302 BODY_00_15( 0,A,B,C,D,E,T,W);
303 BODY_00_15( 1,T,A,B,C,D,E,W);
304 BODY_00_15( 2,E,T,A,B,C,D,W);
305 BODY_00_15( 3,D,E,T,A,B,C,W);
306 BODY_00_15( 4,C,D,E,T,A,B,W);
307 BODY_00_15( 5,B,C,D,E,T,A,W);
308 BODY_00_15( 6,A,B,C,D,E,T,W);
309 BODY_00_15( 7,T,A,B,C,D,E,W);
310 BODY_00_15( 8,E,T,A,B,C,D,W);
311 BODY_00_15( 9,D,E,T,A,B,C,W);
312 BODY_00_15(10,C,D,E,T,A,B,W);
313 BODY_00_15(11,B,C,D,E,T,A,W);
314 BODY_00_15(12,A,B,C,D,E,T,W);
315 BODY_00_15(13,T,A,B,C,D,E,W);
316 BODY_00_15(14,E,T,A,B,C,D,W);
317 BODY_00_15(15,D,E,T,A,B,C,W);
318 BODY_16_19(16,C,D,E,T,A,B,W,W,W,W);
319 BODY_16_19(17,B,C,D,E,T,A,W,W,W,W);
320 BODY_16_19(18,A,B,C,D,E,T,W,W,W,W);
321 BODY_16_19(19,T,A,B,C,D,E,W,W,W,X);
322
323 BODY_20_31(20,E,T,A,B,C,D,W,W,W,X);
324 BODY_20_31(21,D,E,T,A,B,C,W,W,W,X);
325 BODY_20_31(22,C,D,E,T,A,B,W,W,W,X);
326 BODY_20_31(23,B,C,D,E,T,A,W,W,W,X);
327 BODY_20_31(24,A,B,C,D,E,T,W,W,X,X);
328 BODY_20_31(25,T,A,B,C,D,E,W,W,X,X);
329 BODY_20_31(26,E,T,A,B,C,D,W,W,X,X);
330 BODY_20_31(27,D,E,T,A,B,C,W,W,X,X);
331 BODY_20_31(28,C,D,E,T,A,B,W,W,X,X);
332 BODY_20_31(29,B,C,D,E,T,A,W,W,X,X);
333 BODY_20_31(30,A,B,C,D,E,T,W,X,X,X);
334 BODY_20_31(31,T,A,B,C,D,E,W,X,X,X);
335 BODY_32_39(32,E,T,A,B,C,D,X);
336 BODY_32_39(33,D,E,T,A,B,C,X);
337 BODY_32_39(34,C,D,E,T,A,B,X);
338 BODY_32_39(35,B,C,D,E,T,A,X);
339 BODY_32_39(36,A,B,C,D,E,T,X);
340 BODY_32_39(37,T,A,B,C,D,E,X);
341 BODY_32_39(38,E,T,A,B,C,D,X);
342 BODY_32_39(39,D,E,T,A,B,C,X);
343
344 BODY_40_59(40,C,D,E,T,A,B,X);
345 BODY_40_59(41,B,C,D,E,T,A,X);
346 BODY_40_59(42,A,B,C,D,E,T,X);
347 BODY_40_59(43,T,A,B,C,D,E,X);
348 BODY_40_59(44,E,T,A,B,C,D,X);
349 BODY_40_59(45,D,E,T,A,B,C,X);
350 BODY_40_59(46,C,D,E,T,A,B,X);
351 BODY_40_59(47,B,C,D,E,T,A,X);
352 BODY_40_59(48,A,B,C,D,E,T,X);
353 BODY_40_59(49,T,A,B,C,D,E,X);
354 BODY_40_59(50,E,T,A,B,C,D,X);
355 BODY_40_59(51,D,E,T,A,B,C,X);
356 BODY_40_59(52,C,D,E,T,A,B,X);
357 BODY_40_59(53,B,C,D,E,T,A,X);
358 BODY_40_59(54,A,B,C,D,E,T,X);
359 BODY_40_59(55,T,A,B,C,D,E,X);
360 BODY_40_59(56,E,T,A,B,C,D,X);
361 BODY_40_59(57,D,E,T,A,B,C,X);
362 BODY_40_59(58,C,D,E,T,A,B,X);
363 BODY_40_59(59,B,C,D,E,T,A,X);
364
365 BODY_60_79(60,A,B,C,D,E,T,X);
366 BODY_60_79(61,T,A,B,C,D,E,X);
367 BODY_60_79(62,E,T,A,B,C,D,X);
368 BODY_60_79(63,D,E,T,A,B,C,X);
369 BODY_60_79(64,C,D,E,T,A,B,X);
370 BODY_60_79(65,B,C,D,E,T,A,X);
371 BODY_60_79(66,A,B,C,D,E,T,X);
372 BODY_60_79(67,T,A,B,C,D,E,X);
373 BODY_60_79(68,E,T,A,B,C,D,X);
374 BODY_60_79(69,D,E,T,A,B,C,X);
375 BODY_60_79(70,C,D,E,T,A,B,X);
376 BODY_60_79(71,B,C,D,E,T,A,X);
377 BODY_60_79(72,A,B,C,D,E,T,X);
378 BODY_60_79(73,T,A,B,C,D,E,X);
379 BODY_60_79(74,E,T,A,B,C,D,X);
380 BODY_60_79(75,D,E,T,A,B,C,X);
381 BODY_60_79(76,C,D,E,T,A,B,X);
382 BODY_60_79(77,B,C,D,E,T,A,X);
383 BODY_60_79(78,A,B,C,D,E,T,X);
384 BODY_60_79(79,T,A,B,C,D,E,X);
385
386 c->h0=(c->h0+E)&0xffffffffL;
387 c->h1=(c->h1+T)&0xffffffffL;
388 c->h2=(c->h2+A)&0xffffffffL;
389 c->h3=(c->h3+B)&0xffffffffL;
390 c->h4=(c->h4+C)&0xffffffffL;
391
392 num-=64;
393 if (num <= 0) break;
394
395 A=c->h0;
396 B=c->h1;
397 C=c->h2;
398 D=c->h3;
399 E=c->h4;
400
401 W+=16;
402 }
403 }
404
405void SHA_Final(md, c)
406unsigned char *md;
407SHA_CTX *c;
408 {
660c873b
DR
409 int i,j;
410 u_int32_t l;
411 u_int32_t *p;
984263bc
MD
412 static unsigned char end[4]={0x80,0x00,0x00,0x00};
413 unsigned char *cp=end;
414
415 /* c->num should definitly have room for at least one more byte. */
416 p=c->data;
417 j=c->num;
418 i=j>>2;
419#ifdef PURIFY
420 if ((j&0x03) == 0) p[i]=0;
421#endif
422 l=p[i];
423 M_p_c2nl(cp,l,j&0x03);
424 p[i]=l;
425 i++;
426 /* i is the next 'undefined word' */
427 if (c->num >= SHA_LAST_BLOCK)
428 {
429 for (; i<SHA_LBLOCK; i++)
430 p[i]=0;
431 sha_block(c,p,64);
432 i=0;
433 }
434 for (; i<(SHA_LBLOCK-2); i++)
435 p[i]=0;
436 p[SHA_LBLOCK-2]=c->Nh;
437 p[SHA_LBLOCK-1]=c->Nl;
438 sha_block(c,p,64);
439 cp=md;
440 l=c->h0; nl2c(l,cp);
441 l=c->h1; nl2c(l,cp);
442 l=c->h2; nl2c(l,cp);
443 l=c->h3; nl2c(l,cp);
444 l=c->h4; nl2c(l,cp);
445
446 /* clear stuff, sha_block may be leaving some stuff on the stack
447 * but I'm not worried :-) */
448 c->num=0;
449/* memset((char *)&c,0,sizeof(c));*/
450 }
451