summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/sha
diff options
context:
space:
mode:
authorcvs2svn <admin@example.com>2005-03-12 00:02:08 +0000
committercvs2svn <admin@example.com>2005-03-12 00:02:08 +0000
commit259e36b1c57849c281afb8526bab11e7ba2592e2 (patch)
treed0e478b7669f593934b32e564b5611b40796a4b1 /src/lib/libcrypto/sha
parent9a03506f8308b6023a12f108a2072feb958607a6 (diff)
downloadopenbsd-OPENBSD_3_7_BASE.tar.gz
openbsd-OPENBSD_3_7_BASE.tar.bz2
openbsd-OPENBSD_3_7_BASE.zip
This commit was manufactured by cvs2git to create tag 'OPENBSD_3_7_BASE'.OPENBSD_3_7_BASE
Diffstat (limited to 'src/lib/libcrypto/sha')
-rw-r--r--src/lib/libcrypto/sha/asm/sha1-586.pl425
-rw-r--r--src/lib/libcrypto/sha/sha.h121
-rw-r--r--src/lib/libcrypto/sha/sha1_one.c77
-rw-r--r--src/lib/libcrypto/sha/sha1dgst.c73
-rw-r--r--src/lib/libcrypto/sha/sha_locl.h472
5 files changed, 0 insertions, 1168 deletions
diff --git a/src/lib/libcrypto/sha/asm/sha1-586.pl b/src/lib/libcrypto/sha/asm/sha1-586.pl
deleted file mode 100644
index e00f709553..0000000000
--- a/src/lib/libcrypto/sha/asm/sha1-586.pl
+++ /dev/null
@@ -1,425 +0,0 @@
1#!/usr/local/bin/perl
2
3# It was noted that Intel IA-32 C compiler generates code which
4# performs ~30% *faster* on P4 CPU than original *hand-coded*
5# SHA1 assembler implementation. To address this problem (and
6# prove that humans are still better than machines:-), the
7# original code was overhauled, which resulted in following
8# performance changes:
9#
10# compared with original compared with Intel cc
11# assembler impl. generated code
12# Pentium -25% +37%
13# PIII/AMD +8% +16%
14# P4 +85%(!) +45%
15#
16# As you can see Pentium came out as looser:-( Yet I reckoned that
17# improvement on P4 outweights the loss and incorporate this
18# re-tuned code to 0.9.7 and later.
19# ----------------------------------------------------------------
20# Those who for any particular reason absolutely must score on
21# Pentium can replace this module with one from 0.9.6 distribution.
22# This "offer" shall be revoked the moment programming interface to
23# this module is changed, in which case this paragraph should be
24# removed.
25# ----------------------------------------------------------------
26# <appro@fy.chalmers.se>
27
28$normal=0;
29
30push(@INC,"perlasm","../../perlasm");
31require "x86asm.pl";
32
33&asm_init($ARGV[0],"sha1-586.pl",$ARGV[$#ARGV] eq "386");
34
35$A="eax";
36$B="ecx";
37$C="ebx";
38$D="edx";
39$E="edi";
40$T="esi";
41$tmp1="ebp";
42
43$off=9*4;
44
45@K=(0x5a827999,0x6ed9eba1,0x8f1bbcdc,0xca62c1d6);
46
47&sha1_block_data("sha1_block_asm_data_order");
48
49&asm_finish();
50
51sub Nn
52 {
53 local($p)=@_;
54 local(%n)=($A,$T,$B,$A,$C,$B,$D,$C,$E,$D,$T,$E);
55 return($n{$p});
56 }
57
58sub Np
59 {
60 local($p)=@_;
61 local(%n)=($A,$T,$B,$A,$C,$B,$D,$C,$E,$D,$T,$E);
62 local(%n)=($A,$B,$B,$C,$C,$D,$D,$E,$E,$T,$T,$A);
63 return($n{$p});
64 }
65
66sub Na
67 {
68 local($n)=@_;
69 return( (($n )&0x0f),
70 (($n+ 2)&0x0f),
71 (($n+ 8)&0x0f),
72 (($n+13)&0x0f),
73 (($n+ 1)&0x0f));
74 }
75
76sub X_expand
77 {
78 local($in)=@_;
79
80 &comment("First, load the words onto the stack in network byte order");
81 for ($i=0; $i<16; $i+=2)
82 {
83 &mov($A,&DWP(($i+0)*4,$in,"",0));# unless $i == 0;
84 &mov($B,&DWP(($i+1)*4,$in,"",0));
85 &bswap($A);
86 &bswap($B);
87 &mov(&swtmp($i+0),$A);
88 &mov(&swtmp($i+1),$B);
89 }
90
91 &comment("We now have the X array on the stack");
92 &comment("starting at sp-4");
93 }
94
95# Rules of engagement
96# F is always trashable at the start, the running total.
97# E becomes the next F so it can be trashed after it has been 'accumulated'
98# F becomes A in the next round. We don't need to access it much.
99# During the X update part, the result ends up in $X[$n0].
100
101sub BODY_00_15
102 {
103 local($pos,$K,$X,$n,$a,$b,$c,$d,$e,$f)=@_;
104
105 &comment("00_15 $n");
106
107 &mov($tmp1,$a);
108 &mov($f,$c); # f to hold F_00_19(b,c,d)
109 &rotl($tmp1,5); # tmp1=ROTATE(a,5)
110 &xor($f,$d);
111 &and($f,$b);
112 &rotr($b,2); # b=ROTATE(b,30)
113 &add($tmp1,$e); # tmp1+=e;
114 &mov($e,&swtmp($n)); # e becomes volatile and
115 # is loaded with xi
116 &xor($f,$d); # f holds F_00_19(b,c,d)
117 &lea($tmp1,&DWP($K,$tmp1,$e,1));# tmp1+=K_00_19+xi
118
119 &add($f,$tmp1); # f+=tmp1
120 }
121
122sub BODY_16_19
123 {
124 local($pos,$K,$X,$n,$a,$b,$c,$d,$e,$f)=@_;
125 local($n0,$n1,$n2,$n3,$np)=&Na($n);
126
127 &comment("16_19 $n");
128
129 &mov($f,&swtmp($n1)); # f to hold Xupdate(xi,xa,xb,xc,xd)
130 &mov($tmp1,$c); # tmp1 to hold F_00_19(b,c,d)
131 &xor($f,&swtmp($n0));
132 &xor($tmp1,$d);
133 &xor($f,&swtmp($n2));
134 &and($tmp1,$b); # tmp1 holds F_00_19(b,c,d)
135 &xor($f,&swtmp($n3)); # f holds xa^xb^xc^xd
136 &rotr($b,2); # b=ROTATE(b,30)
137 &xor($tmp1,$d); # tmp1=F_00_19(b,c,d)
138 &rotl($f,1); # f=ROATE(f,1)
139 &mov(&swtmp($n0),$f); # xi=f
140 &lea($f,&DWP($K,$f,$e,1)); # f+=K_00_19+e
141 &mov($e,$a); # e becomes volatile
142 &add($f,$tmp1); # f+=F_00_19(b,c,d)
143 &rotl($e,5); # e=ROTATE(a,5)
144 &add($f,$e); # f+=ROTATE(a,5)
145 }
146
147sub BODY_20_39
148 {
149 local($pos,$K,$X,$n,$a,$b,$c,$d,$e,$f)=@_;
150
151 &comment("20_39 $n");
152 local($n0,$n1,$n2,$n3,$np)=&Na($n);
153
154 &mov($f,&swtmp($n0)); # f to hold Xupdate(xi,xa,xb,xc,xd)
155 &mov($tmp1,$b); # tmp1 to hold F_20_39(b,c,d)
156 &xor($f,&swtmp($n1));
157 &rotr($b,2); # b=ROTATE(b,30)
158 &xor($f,&swtmp($n2));
159 &xor($tmp1,$c);
160 &xor($f,&swtmp($n3)); # f holds xa^xb^xc^xd
161 &xor($tmp1,$d); # tmp1 holds F_20_39(b,c,d)
162 &rotl($f,1); # f=ROTATE(f,1)
163 &mov(&swtmp($n0),$f); # xi=f
164 &lea($f,&DWP($K,$f,$e,1)); # f+=K_20_39+e
165 &mov($e,$a); # e becomes volatile
166 &rotl($e,5); # e=ROTATE(a,5)
167 &add($f,$tmp1); # f+=F_20_39(b,c,d)
168 &add($f,$e); # f+=ROTATE(a,5)
169 }
170
171sub BODY_40_59
172 {
173 local($pos,$K,$X,$n,$a,$b,$c,$d,$e,$f)=@_;
174
175 &comment("40_59 $n");
176 local($n0,$n1,$n2,$n3,$np)=&Na($n);
177
178 &mov($f,&swtmp($n0)); # f to hold Xupdate(xi,xa,xb,xc,xd)
179 &mov($tmp1,$b); # tmp1 to hold F_40_59(b,c,d)
180 &xor($f,&swtmp($n1));
181 &or($tmp1,$c);
182 &xor($f,&swtmp($n2));
183 &and($tmp1,$d);
184 &xor($f,&swtmp($n3)); # f holds xa^xb^xc^xd
185 &rotl($f,1); # f=ROTATE(f,1)
186 &mov(&swtmp($n0),$f); # xi=f
187 &lea($f,&DWP($K,$f,$e,1)); # f+=K_40_59+e
188 &mov($e,$b); # e becomes volatile and is used
189 # to calculate F_40_59(b,c,d)
190 &rotr($b,2); # b=ROTATE(b,30)
191 &and($e,$c);
192 &or($tmp1,$e); # tmp1 holds F_40_59(b,c,d)
193 &mov($e,$a);
194 &rotl($e,5); # e=ROTATE(a,5)
195 &add($tmp1,$e); # tmp1+=ROTATE(a,5)
196 &add($f,$tmp1); # f+=tmp1;
197 }
198
199sub BODY_60_79
200 {
201 &BODY_20_39(@_);
202 }
203
204sub sha1_block_host
205 {
206 local($name, $sclabel)=@_;
207
208 &function_begin_B($name,"");
209
210 # parameter 1 is the MD5_CTX structure.
211 # A 0
212 # B 4
213 # C 8
214 # D 12
215 # E 16
216
217 &mov("ecx", &wparam(2));
218 &push("esi");
219 &shl("ecx",6);
220 &mov("esi", &wparam(1));
221 &push("ebp");
222 &add("ecx","esi"); # offset to leave on
223 &push("ebx");
224 &mov("ebp", &wparam(0));
225 &push("edi");
226 &mov($D, &DWP(12,"ebp","",0));
227 &stack_push(18+9);
228 &mov($E, &DWP(16,"ebp","",0));
229 &mov($C, &DWP( 8,"ebp","",0));
230 &mov(&swtmp(17),"ecx");
231
232 &comment("First we need to setup the X array");
233
234 for ($i=0; $i<16; $i+=2)
235 {
236 &mov($A,&DWP(($i+0)*4,"esi","",0));# unless $i == 0;
237 &mov($B,&DWP(($i+1)*4,"esi","",0));
238 &mov(&swtmp($i+0),$A);
239 &mov(&swtmp($i+1),$B);
240 }
241 &jmp($sclabel);
242 &function_end_B($name);
243 }
244
245
246sub sha1_block_data
247 {
248 local($name)=@_;
249
250 &function_begin_B($name,"");
251
252 # parameter 1 is the MD5_CTX structure.
253 # A 0
254 # B 4
255 # C 8
256 # D 12
257 # E 16
258
259 &mov("ecx", &wparam(2));
260 &push("esi");
261 &shl("ecx",6);
262 &mov("esi", &wparam(1));
263 &push("ebp");
264 &add("ecx","esi"); # offset to leave on
265 &push("ebx");
266 &mov("ebp", &wparam(0));
267 &push("edi");
268 &mov($D, &DWP(12,"ebp","",0));
269 &stack_push(18+9);
270 &mov($E, &DWP(16,"ebp","",0));
271 &mov($C, &DWP( 8,"ebp","",0));
272 &mov(&swtmp(17),"ecx");
273
274 &comment("First we need to setup the X array");
275
276 &set_label("start") unless $normal;
277
278 &X_expand("esi");
279 &mov(&wparam(1),"esi");
280
281 &set_label("shortcut", 0, 1);
282 &comment("");
283 &comment("Start processing");
284
285 # odd start
286 &mov($A, &DWP( 0,"ebp","",0));
287 &mov($B, &DWP( 4,"ebp","",0));
288 $X="esp";
289 &BODY_00_15(-2,$K[0],$X, 0,$A,$B,$C,$D,$E,$T);
290 &BODY_00_15( 0,$K[0],$X, 1,$T,$A,$B,$C,$D,$E);
291 &BODY_00_15( 0,$K[0],$X, 2,$E,$T,$A,$B,$C,$D);
292 &BODY_00_15( 0,$K[0],$X, 3,$D,$E,$T,$A,$B,$C);
293 &BODY_00_15( 0,$K[0],$X, 4,$C,$D,$E,$T,$A,$B);
294 &BODY_00_15( 0,$K[0],$X, 5,$B,$C,$D,$E,$T,$A);
295 &BODY_00_15( 0,$K[0],$X, 6,$A,$B,$C,$D,$E,$T);
296 &BODY_00_15( 0,$K[0],$X, 7,$T,$A,$B,$C,$D,$E);
297 &BODY_00_15( 0,$K[0],$X, 8,$E,$T,$A,$B,$C,$D);
298 &BODY_00_15( 0,$K[0],$X, 9,$D,$E,$T,$A,$B,$C);
299 &BODY_00_15( 0,$K[0],$X,10,$C,$D,$E,$T,$A,$B);
300 &BODY_00_15( 0,$K[0],$X,11,$B,$C,$D,$E,$T,$A);
301 &BODY_00_15( 0,$K[0],$X,12,$A,$B,$C,$D,$E,$T);
302 &BODY_00_15( 0,$K[0],$X,13,$T,$A,$B,$C,$D,$E);
303 &BODY_00_15( 0,$K[0],$X,14,$E,$T,$A,$B,$C,$D);
304 &BODY_00_15( 1,$K[0],$X,15,$D,$E,$T,$A,$B,$C);
305 &BODY_16_19(-1,$K[0],$X,16,$C,$D,$E,$T,$A,$B);
306 &BODY_16_19( 0,$K[0],$X,17,$B,$C,$D,$E,$T,$A);
307 &BODY_16_19( 0,$K[0],$X,18,$A,$B,$C,$D,$E,$T);
308 &BODY_16_19( 1,$K[0],$X,19,$T,$A,$B,$C,$D,$E);
309
310 &BODY_20_39(-1,$K[1],$X,20,$E,$T,$A,$B,$C,$D);
311 &BODY_20_39( 0,$K[1],$X,21,$D,$E,$T,$A,$B,$C);
312 &BODY_20_39( 0,$K[1],$X,22,$C,$D,$E,$T,$A,$B);
313 &BODY_20_39( 0,$K[1],$X,23,$B,$C,$D,$E,$T,$A);
314 &BODY_20_39( 0,$K[1],$X,24,$A,$B,$C,$D,$E,$T);
315 &BODY_20_39( 0,$K[1],$X,25,$T,$A,$B,$C,$D,$E);
316 &BODY_20_39( 0,$K[1],$X,26,$E,$T,$A,$B,$C,$D);
317 &BODY_20_39( 0,$K[1],$X,27,$D,$E,$T,$A,$B,$C);
318 &BODY_20_39( 0,$K[1],$X,28,$C,$D,$E,$T,$A,$B);
319 &BODY_20_39( 0,$K[1],$X,29,$B,$C,$D,$E,$T,$A);
320 &BODY_20_39( 0,$K[1],$X,30,$A,$B,$C,$D,$E,$T);
321 &BODY_20_39( 0,$K[1],$X,31,$T,$A,$B,$C,$D,$E);
322 &BODY_20_39( 0,$K[1],$X,32,$E,$T,$A,$B,$C,$D);
323 &BODY_20_39( 0,$K[1],$X,33,$D,$E,$T,$A,$B,$C);
324 &BODY_20_39( 0,$K[1],$X,34,$C,$D,$E,$T,$A,$B);
325 &BODY_20_39( 0,$K[1],$X,35,$B,$C,$D,$E,$T,$A);
326 &BODY_20_39( 0,$K[1],$X,36,$A,$B,$C,$D,$E,$T);
327 &BODY_20_39( 0,$K[1],$X,37,$T,$A,$B,$C,$D,$E);
328 &BODY_20_39( 0,$K[1],$X,38,$E,$T,$A,$B,$C,$D);
329 &BODY_20_39( 1,$K[1],$X,39,$D,$E,$T,$A,$B,$C);
330
331 &BODY_40_59(-1,$K[2],$X,40,$C,$D,$E,$T,$A,$B);
332 &BODY_40_59( 0,$K[2],$X,41,$B,$C,$D,$E,$T,$A);
333 &BODY_40_59( 0,$K[2],$X,42,$A,$B,$C,$D,$E,$T);
334 &BODY_40_59( 0,$K[2],$X,43,$T,$A,$B,$C,$D,$E);
335 &BODY_40_59( 0,$K[2],$X,44,$E,$T,$A,$B,$C,$D);
336 &BODY_40_59( 0,$K[2],$X,45,$D,$E,$T,$A,$B,$C);
337 &BODY_40_59( 0,$K[2],$X,46,$C,$D,$E,$T,$A,$B);
338 &BODY_40_59( 0,$K[2],$X,47,$B,$C,$D,$E,$T,$A);
339 &BODY_40_59( 0,$K[2],$X,48,$A,$B,$C,$D,$E,$T);
340 &BODY_40_59( 0,$K[2],$X,49,$T,$A,$B,$C,$D,$E);
341 &BODY_40_59( 0,$K[2],$X,50,$E,$T,$A,$B,$C,$D);
342 &BODY_40_59( 0,$K[2],$X,51,$D,$E,$T,$A,$B,$C);
343 &BODY_40_59( 0,$K[2],$X,52,$C,$D,$E,$T,$A,$B);
344 &BODY_40_59( 0,$K[2],$X,53,$B,$C,$D,$E,$T,$A);
345 &BODY_40_59( 0,$K[2],$X,54,$A,$B,$C,$D,$E,$T);
346 &BODY_40_59( 0,$K[2],$X,55,$T,$A,$B,$C,$D,$E);
347 &BODY_40_59( 0,$K[2],$X,56,$E,$T,$A,$B,$C,$D);
348 &BODY_40_59( 0,$K[2],$X,57,$D,$E,$T,$A,$B,$C);
349 &BODY_40_59( 0,$K[2],$X,58,$C,$D,$E,$T,$A,$B);
350 &BODY_40_59( 1,$K[2],$X,59,$B,$C,$D,$E,$T,$A);
351
352 &BODY_60_79(-1,$K[3],$X,60,$A,$B,$C,$D,$E,$T);
353 &BODY_60_79( 0,$K[3],$X,61,$T,$A,$B,$C,$D,$E);
354 &BODY_60_79( 0,$K[3],$X,62,$E,$T,$A,$B,$C,$D);
355 &BODY_60_79( 0,$K[3],$X,63,$D,$E,$T,$A,$B,$C);
356 &BODY_60_79( 0,$K[3],$X,64,$C,$D,$E,$T,$A,$B);
357 &BODY_60_79( 0,$K[3],$X,65,$B,$C,$D,$E,$T,$A);
358 &BODY_60_79( 0,$K[3],$X,66,$A,$B,$C,$D,$E,$T);
359 &BODY_60_79( 0,$K[3],$X,67,$T,$A,$B,$C,$D,$E);
360 &BODY_60_79( 0,$K[3],$X,68,$E,$T,$A,$B,$C,$D);
361 &BODY_60_79( 0,$K[3],$X,69,$D,$E,$T,$A,$B,$C);
362 &BODY_60_79( 0,$K[3],$X,70,$C,$D,$E,$T,$A,$B);
363 &BODY_60_79( 0,$K[3],$X,71,$B,$C,$D,$E,$T,$A);
364 &BODY_60_79( 0,$K[3],$X,72,$A,$B,$C,$D,$E,$T);
365 &BODY_60_79( 0,$K[3],$X,73,$T,$A,$B,$C,$D,$E);
366 &BODY_60_79( 0,$K[3],$X,74,$E,$T,$A,$B,$C,$D);
367 &BODY_60_79( 0,$K[3],$X,75,$D,$E,$T,$A,$B,$C);
368 &BODY_60_79( 0,$K[3],$X,76,$C,$D,$E,$T,$A,$B);
369 &BODY_60_79( 0,$K[3],$X,77,$B,$C,$D,$E,$T,$A);
370 &BODY_60_79( 0,$K[3],$X,78,$A,$B,$C,$D,$E,$T);
371 &BODY_60_79( 2,$K[3],$X,79,$T,$A,$B,$C,$D,$E);
372
373 &comment("End processing");
374 &comment("");
375 # D is the tmp value
376
377 # E -> A
378 # T -> B
379 # A -> C
380 # B -> D
381 # C -> E
382 # D -> T
383
384 &mov($tmp1,&wparam(0));
385
386 &mov($D, &DWP(12,$tmp1,"",0));
387 &add($D,$B);
388 &mov($B, &DWP( 4,$tmp1,"",0));
389 &add($B,$T);
390 &mov($T, $A);
391 &mov($A, &DWP( 0,$tmp1,"",0));
392 &mov(&DWP(12,$tmp1,"",0),$D);
393
394 &add($A,$E);
395 &mov($E, &DWP(16,$tmp1,"",0));
396 &add($E,$C);
397 &mov($C, &DWP( 8,$tmp1,"",0));
398 &add($C,$T);
399
400 &mov(&DWP( 0,$tmp1,"",0),$A);
401 &mov("esi",&wparam(1));
402 &mov(&DWP( 8,$tmp1,"",0),$C);
403 &add("esi",64);
404 &mov("eax",&swtmp(17));
405 &mov(&DWP(16,$tmp1,"",0),$E);
406 &cmp("esi","eax");
407 &mov(&DWP( 4,$tmp1,"",0),$B);
408 &jl(&label("start"));
409
410 &stack_pop(18+9);
411 &pop("edi");
412 &pop("ebx");
413 &pop("ebp");
414 &pop("esi");
415 &ret();
416
417 # keep a note of shortcut label so it can be used outside
418 # block.
419 my $sclabel = &label("shortcut");
420
421 &function_end_B($name);
422 # Putting this here avoids problems with MASM in debugging mode
423 &sha1_block_host("sha1_block_asm_host_order", $sclabel);
424 }
425
diff --git a/src/lib/libcrypto/sha/sha.h b/src/lib/libcrypto/sha/sha.h
deleted file mode 100644
index 3fd54a10cc..0000000000
--- a/src/lib/libcrypto/sha/sha.h
+++ /dev/null
@@ -1,121 +0,0 @@
1/* crypto/sha/sha.h */
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#ifndef HEADER_SHA_H
60#define HEADER_SHA_H
61
62#include <openssl/e_os2.h>
63
64#ifdef __cplusplus
65extern "C" {
66#endif
67
68#if defined(OPENSSL_NO_SHA) || (defined(OPENSSL_NO_SHA0) && defined(OPENSSL_NO_SHA1))
69#error SHA is disabled.
70#endif
71
72/*
73 * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
74 * ! SHA_LONG has to be at least 32 bits wide. If it's wider, then !
75 * ! SHA_LONG_LOG2 has to be defined along. !
76 * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
77 */
78
79#if defined(OPENSSL_SYS_WIN16) || defined(__LP32__)
80#define SHA_LONG unsigned long
81#elif defined(OPENSSL_SYS_CRAY) || defined(__ILP64__)
82#define SHA_LONG unsigned long
83#define SHA_LONG_LOG2 3
84#else
85#define SHA_LONG unsigned int
86#endif
87
88#define SHA_LBLOCK 16
89#define SHA_CBLOCK (SHA_LBLOCK*4) /* SHA treats input data as a
90 * contiguous array of 32 bit
91 * wide big-endian values. */
92#define SHA_LAST_BLOCK (SHA_CBLOCK-8)
93#define SHA_DIGEST_LENGTH 20
94
95typedef struct SHAstate_st
96 {
97 SHA_LONG h0,h1,h2,h3,h4;
98 SHA_LONG Nl,Nh;
99 SHA_LONG data[SHA_LBLOCK];
100 int num;
101 } SHA_CTX;
102
103#ifndef OPENSSL_NO_SHA0
104int SHA_Init(SHA_CTX *c);
105int SHA_Update(SHA_CTX *c, const void *data, unsigned long len);
106int SHA_Final(unsigned char *md, SHA_CTX *c);
107unsigned char *SHA(const unsigned char *d, unsigned long n,unsigned char *md);
108void SHA_Transform(SHA_CTX *c, const unsigned char *data);
109#endif
110#ifndef OPENSSL_NO_SHA1
111int SHA1_Init(SHA_CTX *c);
112int SHA1_Update(SHA_CTX *c, const void *data, unsigned long len);
113int SHA1_Final(unsigned char *md, SHA_CTX *c);
114unsigned char *SHA1(const unsigned char *d, unsigned long n,unsigned char *md);
115void SHA1_Transform(SHA_CTX *c, const unsigned char *data);
116#endif
117#ifdef __cplusplus
118}
119#endif
120
121#endif
diff --git a/src/lib/libcrypto/sha/sha1_one.c b/src/lib/libcrypto/sha/sha1_one.c
deleted file mode 100644
index 20e660c71d..0000000000
--- a/src/lib/libcrypto/sha/sha1_one.c
+++ /dev/null
@@ -1,77 +0,0 @@
1/* crypto/sha/sha1_one.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 <string.h>
61#include <openssl/sha.h>
62#include <openssl/crypto.h>
63
64#ifndef OPENSSL_NO_SHA1
65unsigned char *SHA1(const unsigned char *d, unsigned long n, unsigned char *md)
66 {
67 SHA_CTX c;
68 static unsigned char m[SHA_DIGEST_LENGTH];
69
70 if (md == NULL) md=m;
71 SHA1_Init(&c);
72 SHA1_Update(&c,d,n);
73 SHA1_Final(md,&c);
74 OPENSSL_cleanse(&c,sizeof(c));
75 return(md);
76 }
77#endif
diff --git a/src/lib/libcrypto/sha/sha1dgst.c b/src/lib/libcrypto/sha/sha1dgst.c
deleted file mode 100644
index 182f65982a..0000000000
--- a/src/lib/libcrypto/sha/sha1dgst.c
+++ /dev/null
@@ -1,73 +0,0 @@
1/* crypto/sha/sha1dgst.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#if !defined(OPENSSL_NO_SHA1) && !defined(OPENSSL_NO_SHA)
60
61#undef SHA_0
62#define SHA_1
63
64#include <openssl/opensslv.h>
65
66const char *SHA1_version="SHA1" OPENSSL_VERSION_PTEXT;
67
68/* The implementation is in ../md32_common.h */
69
70#include "sha_locl.h"
71
72#endif
73
diff --git a/src/lib/libcrypto/sha/sha_locl.h b/src/lib/libcrypto/sha/sha_locl.h
deleted file mode 100644
index 2dd63a62a6..0000000000
--- a/src/lib/libcrypto/sha/sha_locl.h
+++ /dev/null
@@ -1,472 +0,0 @@
1/* crypto/sha/sha_locl.h */
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 <stdlib.h>
60#include <string.h>
61
62#include <openssl/opensslconf.h>
63#include <openssl/sha.h>
64
65#ifndef SHA_LONG_LOG2
66#define SHA_LONG_LOG2 2 /* default to 32 bits */
67#endif
68
69#define DATA_ORDER_IS_BIG_ENDIAN
70
71#define HASH_LONG SHA_LONG
72#define HASH_LONG_LOG2 SHA_LONG_LOG2
73#define HASH_CTX SHA_CTX
74#define HASH_CBLOCK SHA_CBLOCK
75#define HASH_LBLOCK SHA_LBLOCK
76#define HASH_MAKE_STRING(c,s) do { \
77 unsigned long ll; \
78 ll=(c)->h0; HOST_l2c(ll,(s)); \
79 ll=(c)->h1; HOST_l2c(ll,(s)); \
80 ll=(c)->h2; HOST_l2c(ll,(s)); \
81 ll=(c)->h3; HOST_l2c(ll,(s)); \
82 ll=(c)->h4; HOST_l2c(ll,(s)); \
83 } while (0)
84
85#if defined(SHA_0)
86
87# define HASH_UPDATE SHA_Update
88# define HASH_TRANSFORM SHA_Transform
89# define HASH_FINAL SHA_Final
90# define HASH_INIT SHA_Init
91# define HASH_BLOCK_HOST_ORDER sha_block_host_order
92# define HASH_BLOCK_DATA_ORDER sha_block_data_order
93# define Xupdate(a,ix,ia,ib,ic,id) (ix=(a)=(ia^ib^ic^id))
94
95 void sha_block_host_order (SHA_CTX *c, const void *p,int num);
96 void sha_block_data_order (SHA_CTX *c, const void *p,int num);
97
98#elif defined(SHA_1)
99
100# define HASH_UPDATE SHA1_Update
101# define HASH_TRANSFORM SHA1_Transform
102# define HASH_FINAL SHA1_Final
103# define HASH_INIT SHA1_Init
104# define HASH_BLOCK_HOST_ORDER sha1_block_host_order
105# define HASH_BLOCK_DATA_ORDER sha1_block_data_order
106# if defined(__MWERKS__) && defined(__MC68K__)
107 /* Metrowerks for Motorola fails otherwise:-( <appro@fy.chalmers.se> */
108# define Xupdate(a,ix,ia,ib,ic,id) do { (a)=(ia^ib^ic^id); \
109 ix=(a)=ROTATE((a),1); \
110 } while (0)
111# else
112# define Xupdate(a,ix,ia,ib,ic,id) ( (a)=(ia^ib^ic^id), \
113 ix=(a)=ROTATE((a),1) \
114 )
115# endif
116
117# ifdef SHA1_ASM
118# if defined(__i386) || defined(__i386__) || defined(_M_IX86) || defined(__INTEL__)
119# define sha1_block_host_order sha1_block_asm_host_order
120# define DONT_IMPLEMENT_BLOCK_HOST_ORDER
121# define sha1_block_data_order sha1_block_asm_data_order
122# define DONT_IMPLEMENT_BLOCK_DATA_ORDER
123# define HASH_BLOCK_DATA_ORDER_ALIGNED sha1_block_asm_data_order
124# endif
125# endif
126 void sha1_block_host_order (SHA_CTX *c, const void *p,int num);
127 void sha1_block_data_order (SHA_CTX *c, const void *p,int num);
128
129#else
130# error "Either SHA_0 or SHA_1 must be defined."
131#endif
132
133#include "md32_common.h"
134
135#define INIT_DATA_h0 0x67452301UL
136#define INIT_DATA_h1 0xefcdab89UL
137#define INIT_DATA_h2 0x98badcfeUL
138#define INIT_DATA_h3 0x10325476UL
139#define INIT_DATA_h4 0xc3d2e1f0UL
140
141int HASH_INIT (SHA_CTX *c)
142 {
143 c->h0=INIT_DATA_h0;
144 c->h1=INIT_DATA_h1;
145 c->h2=INIT_DATA_h2;
146 c->h3=INIT_DATA_h3;
147 c->h4=INIT_DATA_h4;
148 c->Nl=0;
149 c->Nh=0;
150 c->num=0;
151 return 1;
152 }
153
154#define K_00_19 0x5a827999UL
155#define K_20_39 0x6ed9eba1UL
156#define K_40_59 0x8f1bbcdcUL
157#define K_60_79 0xca62c1d6UL
158
159/* As pointed out by Wei Dai <weidai@eskimo.com>, F() below can be
160 * simplified to the code in F_00_19. Wei attributes these optimisations
161 * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
162 * #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z)))
163 * I've just become aware of another tweak to be made, again from Wei Dai,
164 * in F_40_59, (x&a)|(y&a) -> (x|y)&a
165 */
166#define F_00_19(b,c,d) ((((c) ^ (d)) & (b)) ^ (d))
167#define F_20_39(b,c,d) ((b) ^ (c) ^ (d))
168#define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d)))
169#define F_60_79(b,c,d) F_20_39(b,c,d)
170
171#define BODY_00_15(i,a,b,c,d,e,f,xi) \
172 (f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
173 (b)=ROTATE((b),30);
174
175#define BODY_16_19(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
176 Xupdate(f,xi,xa,xb,xc,xd); \
177 (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
178 (b)=ROTATE((b),30);
179
180#define BODY_20_31(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
181 Xupdate(f,xi,xa,xb,xc,xd); \
182 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
183 (b)=ROTATE((b),30);
184
185#define BODY_32_39(i,a,b,c,d,e,f,xa,xb,xc,xd) \
186 Xupdate(f,xa,xa,xb,xc,xd); \
187 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
188 (b)=ROTATE((b),30);
189
190#define BODY_40_59(i,a,b,c,d,e,f,xa,xb,xc,xd) \
191 Xupdate(f,xa,xa,xb,xc,xd); \
192 (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \
193 (b)=ROTATE((b),30);
194
195#define BODY_60_79(i,a,b,c,d,e,f,xa,xb,xc,xd) \
196 Xupdate(f,xa,xa,xb,xc,xd); \
197 (f)=xa+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \
198 (b)=ROTATE((b),30);
199
200#ifdef X
201#undef X
202#endif
203#ifndef MD32_XARRAY
204 /*
205 * Originally X was an array. As it's automatic it's natural
206 * to expect RISC compiler to accomodate at least part of it in
207 * the register bank, isn't it? Unfortunately not all compilers
208 * "find" this expectation reasonable:-( On order to make such
209 * compilers generate better code I replace X[] with a bunch of
210 * X0, X1, etc. See the function body below...
211 * <appro@fy.chalmers.se>
212 */
213# define X(i) XX##i
214#else
215 /*
216 * However! Some compilers (most notably HP C) get overwhelmed by
217 * that many local variables so that we have to have the way to
218 * fall down to the original behavior.
219 */
220# define X(i) XX[i]
221#endif
222
223#ifndef DONT_IMPLEMENT_BLOCK_HOST_ORDER
224void HASH_BLOCK_HOST_ORDER (SHA_CTX *c, const void *d, int num)
225 {
226 const SHA_LONG *W=d;
227 register unsigned MD32_REG_T A,B,C,D,E,T;
228#ifndef MD32_XARRAY
229 unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
230 XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
231#else
232 SHA_LONG XX[16];
233#endif
234
235 A=c->h0;
236 B=c->h1;
237 C=c->h2;
238 D=c->h3;
239 E=c->h4;
240
241 for (;;)
242 {
243 BODY_00_15( 0,A,B,C,D,E,T,W[ 0]);
244 BODY_00_15( 1,T,A,B,C,D,E,W[ 1]);
245 BODY_00_15( 2,E,T,A,B,C,D,W[ 2]);
246 BODY_00_15( 3,D,E,T,A,B,C,W[ 3]);
247 BODY_00_15( 4,C,D,E,T,A,B,W[ 4]);
248 BODY_00_15( 5,B,C,D,E,T,A,W[ 5]);
249 BODY_00_15( 6,A,B,C,D,E,T,W[ 6]);
250 BODY_00_15( 7,T,A,B,C,D,E,W[ 7]);
251 BODY_00_15( 8,E,T,A,B,C,D,W[ 8]);
252 BODY_00_15( 9,D,E,T,A,B,C,W[ 9]);
253 BODY_00_15(10,C,D,E,T,A,B,W[10]);
254 BODY_00_15(11,B,C,D,E,T,A,W[11]);
255 BODY_00_15(12,A,B,C,D,E,T,W[12]);
256 BODY_00_15(13,T,A,B,C,D,E,W[13]);
257 BODY_00_15(14,E,T,A,B,C,D,W[14]);
258 BODY_00_15(15,D,E,T,A,B,C,W[15]);
259
260 BODY_16_19(16,C,D,E,T,A,B,X( 0),W[ 0],W[ 2],W[ 8],W[13]);
261 BODY_16_19(17,B,C,D,E,T,A,X( 1),W[ 1],W[ 3],W[ 9],W[14]);
262 BODY_16_19(18,A,B,C,D,E,T,X( 2),W[ 2],W[ 4],W[10],W[15]);
263 BODY_16_19(19,T,A,B,C,D,E,X( 3),W[ 3],W[ 5],W[11],X( 0));
264
265 BODY_20_31(20,E,T,A,B,C,D,X( 4),W[ 4],W[ 6],W[12],X( 1));
266 BODY_20_31(21,D,E,T,A,B,C,X( 5),W[ 5],W[ 7],W[13],X( 2));
267 BODY_20_31(22,C,D,E,T,A,B,X( 6),W[ 6],W[ 8],W[14],X( 3));
268 BODY_20_31(23,B,C,D,E,T,A,X( 7),W[ 7],W[ 9],W[15],X( 4));
269 BODY_20_31(24,A,B,C,D,E,T,X( 8),W[ 8],W[10],X( 0),X( 5));
270 BODY_20_31(25,T,A,B,C,D,E,X( 9),W[ 9],W[11],X( 1),X( 6));
271 BODY_20_31(26,E,T,A,B,C,D,X(10),W[10],W[12],X( 2),X( 7));
272 BODY_20_31(27,D,E,T,A,B,C,X(11),W[11],W[13],X( 3),X( 8));
273 BODY_20_31(28,C,D,E,T,A,B,X(12),W[12],W[14],X( 4),X( 9));
274 BODY_20_31(29,B,C,D,E,T,A,X(13),W[13],W[15],X( 5),X(10));
275 BODY_20_31(30,A,B,C,D,E,T,X(14),W[14],X( 0),X( 6),X(11));
276 BODY_20_31(31,T,A,B,C,D,E,X(15),W[15],X( 1),X( 7),X(12));
277
278 BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13));
279 BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14));
280 BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15));
281 BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0));
282 BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1));
283 BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2));
284 BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3));
285 BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4));
286
287 BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5));
288 BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6));
289 BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7));
290 BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8));
291 BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9));
292 BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10));
293 BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11));
294 BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12));
295 BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13));
296 BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14));
297 BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15));
298 BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0));
299 BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1));
300 BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2));
301 BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3));
302 BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4));
303 BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5));
304 BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6));
305 BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7));
306 BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8));
307
308 BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9));
309 BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10));
310 BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11));
311 BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12));
312 BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13));
313 BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14));
314 BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15));
315 BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0));
316 BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1));
317 BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2));
318 BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3));
319 BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4));
320 BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5));
321 BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6));
322 BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7));
323 BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8));
324 BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9));
325 BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10));
326 BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11));
327 BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12));
328
329 c->h0=(c->h0+E)&0xffffffffL;
330 c->h1=(c->h1+T)&0xffffffffL;
331 c->h2=(c->h2+A)&0xffffffffL;
332 c->h3=(c->h3+B)&0xffffffffL;
333 c->h4=(c->h4+C)&0xffffffffL;
334
335 if (--num <= 0) break;
336
337 A=c->h0;
338 B=c->h1;
339 C=c->h2;
340 D=c->h3;
341 E=c->h4;
342
343 W+=SHA_LBLOCK;
344 }
345 }
346#endif
347
348#ifndef DONT_IMPLEMENT_BLOCK_DATA_ORDER
349void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, int num)
350 {
351 const unsigned char *data=p;
352 register unsigned MD32_REG_T A,B,C,D,E,T,l;
353#ifndef MD32_XARRAY
354 unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
355 XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
356#else
357 SHA_LONG XX[16];
358#endif
359
360 A=c->h0;
361 B=c->h1;
362 C=c->h2;
363 D=c->h3;
364 E=c->h4;
365
366 for (;;)
367 {
368
369 HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l;
370 BODY_00_15( 0,A,B,C,D,E,T,X( 0)); HOST_c2l(data,l); X( 2)=l;
371 BODY_00_15( 1,T,A,B,C,D,E,X( 1)); HOST_c2l(data,l); X( 3)=l;
372 BODY_00_15( 2,E,T,A,B,C,D,X( 2)); HOST_c2l(data,l); X( 4)=l;
373 BODY_00_15( 3,D,E,T,A,B,C,X( 3)); HOST_c2l(data,l); X( 5)=l;
374 BODY_00_15( 4,C,D,E,T,A,B,X( 4)); HOST_c2l(data,l); X( 6)=l;
375 BODY_00_15( 5,B,C,D,E,T,A,X( 5)); HOST_c2l(data,l); X( 7)=l;
376 BODY_00_15( 6,A,B,C,D,E,T,X( 6)); HOST_c2l(data,l); X( 8)=l;
377 BODY_00_15( 7,T,A,B,C,D,E,X( 7)); HOST_c2l(data,l); X( 9)=l;
378 BODY_00_15( 8,E,T,A,B,C,D,X( 8)); HOST_c2l(data,l); X(10)=l;
379 BODY_00_15( 9,D,E,T,A,B,C,X( 9)); HOST_c2l(data,l); X(11)=l;
380 BODY_00_15(10,C,D,E,T,A,B,X(10)); HOST_c2l(data,l); X(12)=l;
381 BODY_00_15(11,B,C,D,E,T,A,X(11)); HOST_c2l(data,l); X(13)=l;
382 BODY_00_15(12,A,B,C,D,E,T,X(12)); HOST_c2l(data,l); X(14)=l;
383 BODY_00_15(13,T,A,B,C,D,E,X(13)); HOST_c2l(data,l); X(15)=l;
384 BODY_00_15(14,E,T,A,B,C,D,X(14));
385 BODY_00_15(15,D,E,T,A,B,C,X(15));
386
387 BODY_16_19(16,C,D,E,T,A,B,X( 0),X( 0),X( 2),X( 8),X(13));
388 BODY_16_19(17,B,C,D,E,T,A,X( 1),X( 1),X( 3),X( 9),X(14));
389 BODY_16_19(18,A,B,C,D,E,T,X( 2),X( 2),X( 4),X(10),X(15));
390 BODY_16_19(19,T,A,B,C,D,E,X( 3),X( 3),X( 5),X(11),X( 0));
391
392 BODY_20_31(20,E,T,A,B,C,D,X( 4),X( 4),X( 6),X(12),X( 1));
393 BODY_20_31(21,D,E,T,A,B,C,X( 5),X( 5),X( 7),X(13),X( 2));
394 BODY_20_31(22,C,D,E,T,A,B,X( 6),X( 6),X( 8),X(14),X( 3));
395 BODY_20_31(23,B,C,D,E,T,A,X( 7),X( 7),X( 9),X(15),X( 4));
396 BODY_20_31(24,A,B,C,D,E,T,X( 8),X( 8),X(10),X( 0),X( 5));
397 BODY_20_31(25,T,A,B,C,D,E,X( 9),X( 9),X(11),X( 1),X( 6));
398 BODY_20_31(26,E,T,A,B,C,D,X(10),X(10),X(12),X( 2),X( 7));
399 BODY_20_31(27,D,E,T,A,B,C,X(11),X(11),X(13),X( 3),X( 8));
400 BODY_20_31(28,C,D,E,T,A,B,X(12),X(12),X(14),X( 4),X( 9));
401 BODY_20_31(29,B,C,D,E,T,A,X(13),X(13),X(15),X( 5),X(10));
402 BODY_20_31(30,A,B,C,D,E,T,X(14),X(14),X( 0),X( 6),X(11));
403 BODY_20_31(31,T,A,B,C,D,E,X(15),X(15),X( 1),X( 7),X(12));
404
405 BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13));
406 BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14));
407 BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15));
408 BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0));
409 BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1));
410 BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2));
411 BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3));
412 BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4));
413
414 BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5));
415 BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6));
416 BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7));
417 BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8));
418 BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9));
419 BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10));
420 BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11));
421 BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12));
422 BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13));
423 BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14));
424 BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15));
425 BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0));
426 BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1));
427 BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2));
428 BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3));
429 BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4));
430 BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5));
431 BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6));
432 BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7));
433 BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8));
434
435 BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9));
436 BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10));
437 BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11));
438 BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12));
439 BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13));
440 BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14));
441 BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15));
442 BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0));
443 BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1));
444 BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2));
445 BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3));
446 BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4));
447 BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5));
448 BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6));
449 BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7));
450 BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8));
451 BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9));
452 BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10));
453 BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11));
454 BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12));
455
456 c->h0=(c->h0+E)&0xffffffffL;
457 c->h1=(c->h1+T)&0xffffffffL;
458 c->h2=(c->h2+A)&0xffffffffL;
459 c->h3=(c->h3+B)&0xffffffffL;
460 c->h4=(c->h4+C)&0xffffffffL;
461
462 if (--num <= 0) break;
463
464 A=c->h0;
465 B=c->h1;
466 C=c->h2;
467 D=c->h3;
468 E=c->h4;
469
470 }
471 }
472#endif
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-03-19 18:06:27 +0000