summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/sha
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/sha')
-rw-r--r--src/lib/libcrypto/sha/asm/sha1-586.pl540
-rw-r--r--src/lib/libcrypto/sha/sha.h119
-rw-r--r--src/lib/libcrypto/sha/sha1_one.c76
-rw-r--r--src/lib/libcrypto/sha/sha1dgst.c73
-rw-r--r--src/lib/libcrypto/sha/sha_locl.h471
5 files changed, 0 insertions, 1279 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 fe51fd0794..0000000000
--- a/src/lib/libcrypto/sha/asm/sha1-586.pl
+++ /dev/null
@@ -1,540 +0,0 @@
1#!/usr/local/bin/perl
2
3$normal=0;
4
5push(@INC,"perlasm","../../perlasm");
6require "x86asm.pl";
7
8&asm_init($ARGV[0],"sha1-586.pl",$ARGV[$#ARGV] eq "386");
9
10$A="eax";
11$B="ecx";
12$C="ebx";
13$D="edx";
14$E="edi";
15$T="esi";
16$tmp1="ebp";
17
18$off=9*4;
19
20@K=(0x5a827999,0x6ed9eba1,0x8f1bbcdc,0xca62c1d6);
21
22&sha1_block_data("sha1_block_asm_data_order");
23
24&asm_finish();
25
26sub Nn
27 {
28 local($p)=@_;
29 local(%n)=($A,$T,$B,$A,$C,$B,$D,$C,$E,$D,$T,$E);
30 return($n{$p});
31 }
32
33sub Np
34 {
35 local($p)=@_;
36 local(%n)=($A,$T,$B,$A,$C,$B,$D,$C,$E,$D,$T,$E);
37 local(%n)=($A,$B,$B,$C,$C,$D,$D,$E,$E,$T,$T,$A);
38 return($n{$p});
39 }
40
41sub Na
42 {
43 local($n)=@_;
44 return( (($n )&0x0f),
45 (($n+ 2)&0x0f),
46 (($n+ 8)&0x0f),
47 (($n+13)&0x0f),
48 (($n+ 1)&0x0f));
49 }
50
51sub X_expand
52 {
53 local($in)=@_;
54
55 &comment("First, load the words onto the stack in network byte order");
56 for ($i=0; $i<16; $i+=2)
57 {
58 &mov($A,&DWP(($i+0)*4,$in,"",0));# unless $i == 0;
59 &mov($B,&DWP(($i+1)*4,$in,"",0));
60 &bswap($A);
61 &bswap($B);
62 &mov(&swtmp($i+0),$A);
63 &mov(&swtmp($i+1),$B);
64 }
65
66 &comment("We now have the X array on the stack");
67 &comment("starting at sp-4");
68 }
69
70# Rules of engagement
71# F is always trashable at the start, the running total.
72# E becomes the next F so it can be trashed after it has been 'accumulated'
73# F becomes A in the next round. We don't need to access it much.
74# During the X update part, the result ends up in $X[$n0].
75
76sub BODY_00_15
77 {
78 local($pos,$K,$X,$n,$a,$b,$c,$d,$e,$f)=@_;
79
80return if $n & 1;
81 &comment("00_15 $n");
82
83 &mov($f,$c);
84
85 &mov($tmp1,$a);
86 &xor($f,$d); # F2
87
88 &rotl($tmp1,5); # A2
89
90 &and($f,$b); # F3
91 &add($tmp1,$e);
92
93 &rotr($b,1); # B1 <- F
94 &mov($e,&swtmp($n)); # G1
95
96 &rotr($b,1); # B1 <- F
97 &xor($f,$d); # F4
98
99 &lea($tmp1,&DWP($K,$tmp1,$e,1));
100
101############################
102# &BODY_40_59( 0,$K[2],$X,42,$A,$B,$C,$D,$E,$T);
103# &BODY_40_59( 0,$K[2],$X,43,$T,$A,$B,$C,$D,$E);
104$n++;
105 local($n0,$n1,$n2,$n3,$np)=&Na($n);
106 ($b,$c,$d,$e,$f,$a)=($a,$b,$c,$d,$e,$f);
107
108 &mov($f,$c);
109
110 &add($a,$tmp1); # MOVED DOWN
111 &xor($f,$d); # F2
112
113 &mov($tmp1,$a);
114 &and($f,$b); # F3
115
116 &rotl($tmp1,5); # A2
117
118 &add($tmp1,$e);
119 &mov($e,&swtmp($n)); # G1
120
121 &rotr($b,1); # B1 <- F
122 &xor($f,$d); # F4
123
124 &rotr($b,1); # B1 <- F
125 &lea($tmp1,&DWP($K,$tmp1,$e,1));
126
127 &add($f,$tmp1);
128 }
129
130sub BODY_16_19
131 {
132 local($pos,$K,$X,$n,$a,$b,$c,$d,$e,$f)=@_;
133 local($n0,$n1,$n2,$n3,$np)=&Na($n);
134
135return if $n & 1;
136 &comment("16_19 $n");
137
138 &nop() if ($pos < 0);
139&mov($tmp1,&swtmp($n0)); # X1
140 &mov($f,&swtmp($n1)); # X2
141&xor($f,$tmp1); # X3
142 &mov($tmp1,&swtmp($n2)); # X4
143&xor($f,$tmp1); # X5
144 &mov($tmp1,&swtmp($n3)); # X6
145&xor($f,$tmp1); # X7 - slot
146 &mov($tmp1,$c); # F1
147&rotl($f,1); # X8 - slot
148 &xor($tmp1,$d); # F2
149&mov(&swtmp($n0),$f); # X9 - anytime
150 &and($tmp1,$b); # F3
151&lea($f,&DWP($K,$f,$e,1)); # tot=X+K+e
152 &xor($tmp1,$d); # F4
153&mov($e,$a); # A1
154 &add($f,$tmp1); # tot+=F();
155
156&rotl($e,5); # A2
157
158&rotr($b,1); # B1 <- F
159 &add($f,$e); # tot+=a
160
161############################
162# &BODY_40_59( 0,$K[2],$X,42,$A,$B,$C,$D,$E,$T);
163# &BODY_40_59( 0,$K[2],$X,43,$T,$A,$B,$C,$D,$E);
164$n++;
165 local($n0,$n1,$n2,$n3,$np)=&Na($n);
166 ($b,$c,$d,$e,$f,$a)=($a,$b,$c,$d,$e,$f);
167
168
169&mov($f,&swtmp($n0)); # X1
170 &mov($tmp1,&swtmp($n1)); # X2
171&xor($f,$tmp1); # X3
172 &mov($tmp1,&swtmp($n2)); # X4
173&xor($f,$tmp1); # X5
174 &mov($tmp1,&swtmp($n3)); # X6
175&rotr($c,1); #&rotr($b,1); # B1 <- F # MOVED DOWN
176 &xor($f,$tmp1); # X7 - slot
177&rotl($f,1); # X8 - slot
178 &mov($tmp1,$c); # F1
179&xor($tmp1,$d); # F2
180 &mov(&swtmp($n0),$f); # X9 - anytime
181&and($tmp1,$b); # F3
182 &lea($f,&DWP($K,$f,$e,1)); # tot=X+K+e
183
184&xor($tmp1,$d); # F4
185 &mov($e,$a); # A1
186
187&rotl($e,5); # A2
188
189&rotr($b,1); # B1 <- F
190 &add($f,$e); # tot+=a
191
192&rotr($b,1); # B1 <- F
193 &add($f,$tmp1); # tot+=F();
194
195 }
196
197sub BODY_20_39
198 {
199 local($pos,$K,$X,$n,$a,$b,$c,$d,$e,$f)=@_;
200
201 &comment("20_39 $n");
202 local($n0,$n1,$n2,$n3,$np)=&Na($n);
203
204&mov($f,&swtmp($n0)); # X1
205 &mov($tmp1,&swtmp($n1)); # X2
206&xor($f,$tmp1); # X3
207 &mov($tmp1,&swtmp($n2)); # X4
208&xor($f,$tmp1); # X5
209 &mov($tmp1,&swtmp($n3)); # X6
210&xor($f,$tmp1); # X7 - slot
211 &mov($tmp1,$b); # F1
212&rotl($f,1); # X8 - slot
213 &xor($tmp1,$c); # F2
214&mov(&swtmp($n0),$f); # X9 - anytime
215 &xor($tmp1,$d); # F3
216
217&lea($f,&DWP($K,$f,$e,1)); # tot=X+K+e
218 &mov($e,$a); # A1
219
220&rotl($e,5); # A2
221
222if ($n != 79) # last loop
223 {
224 &rotr($b,1); # B1 <- F
225 &add($e,$tmp1); # tmp1=F()+a
226
227 &rotr($b,1); # B2 <- F
228 &add($f,$e); # tot+=tmp1;
229 }
230else
231 {
232 &add($e,$tmp1); # tmp1=F()+a
233 &mov($tmp1,&wparam(0));
234
235 &rotr($b,1); # B1 <- F
236 &add($f,$e); # tot+=tmp1;
237
238 &rotr($b,1); # B2 <- F
239 }
240 }
241
242sub BODY_40_59
243 {
244 local($pos,$K,$X,$n,$a,$b,$c,$d,$e,$f)=@_;
245
246 &comment("40_59 $n");
247 return if $n & 1;
248 local($n0,$n1,$n2,$n3,$np)=&Na($n);
249
250&mov($f,&swtmp($n0)); # X1
251 &mov($tmp1,&swtmp($n1)); # X2
252&xor($f,$tmp1); # X3
253 &mov($tmp1,&swtmp($n2)); # X4
254&xor($f,$tmp1); # X5
255 &mov($tmp1,&swtmp($n3)); # X6
256&xor($f,$tmp1); # X7 - slot
257 &mov($tmp1,$b); # F1
258&rotl($f,1); # X8 - slot
259 &or($tmp1,$c); # F2
260&mov(&swtmp($n0),$f); # X9 - anytime
261 &and($tmp1,$d); # F3
262
263&lea($f,&DWP($K,$f,$e,1)); # tot=X+K+e
264 &mov($e,$b); # F4
265
266&rotr($b,1); # B1 <- F
267 &and($e,$c); # F5
268
269&or($tmp1,$e); # F6
270 &mov($e,$a); # A1
271
272&rotl($e,5); # A2
273
274&add($tmp1,$e); # tmp1=F()+a
275
276############################
277# &BODY_40_59( 0,$K[2],$X,42,$A,$B,$C,$D,$E,$T);
278# &BODY_40_59( 0,$K[2],$X,43,$T,$A,$B,$C,$D,$E);
279$n++;
280 local($n0,$n1,$n2,$n3,$np)=&Na($n);
281 ($b,$c,$d,$e,$f,$a)=($a,$b,$c,$d,$e,$f);
282
283 &mov($f,&swtmp($n0)); # X1
284&add($a,$tmp1); # tot+=tmp1; # moved was add f,tmp1
285 &mov($tmp1,&swtmp($n1)); # X2
286&xor($f,$tmp1); # X3
287 &mov($tmp1,&swtmp($n2)); # X4
288&xor($f,$tmp1); # X5
289 &mov($tmp1,&swtmp($n3)); # X6
290&rotr($c,1); # B2 <- F # moved was rotr b,1
291 &xor($f,$tmp1); # X7 - slot
292&rotl($f,1); # X8 - slot
293 &mov($tmp1,$b); # F1
294&mov(&swtmp($n0),$f); # X9 - anytime
295 &or($tmp1,$c); # F2
296&lea($f,&DWP($K,$f,$e,1)); # tot=X+K+e
297 &mov($e,$b); # F4
298&and($tmp1,$d); # F3
299 &and($e,$c); # F5
300
301&or($tmp1,$e); # F6
302 &mov($e,$a); # A1
303
304&rotl($e,5); # A2
305
306&rotr($b,1); # B1 <- F
307 &add($tmp1,$e); # tmp1=F()+a
308
309&rotr($b,1); # B2 <- F
310 &add($f,$tmp1); # tot+=tmp1;
311 }
312
313sub BODY_60_79
314 {
315 &BODY_20_39(@_);
316 }
317
318sub sha1_block_host
319 {
320 local($name, $sclabel)=@_;
321
322 &function_begin_B($name,"");
323
324 # parameter 1 is the MD5_CTX structure.
325 # A 0
326 # B 4
327 # C 8
328 # D 12
329 # E 16
330
331 &mov("ecx", &wparam(2));
332 &push("esi");
333 &shl("ecx",6);
334 &mov("esi", &wparam(1));
335 &push("ebp");
336 &add("ecx","esi"); # offset to leave on
337 &push("ebx");
338 &mov("ebp", &wparam(0));
339 &push("edi");
340 &mov($D, &DWP(12,"ebp","",0));
341 &stack_push(18+9);
342 &mov($E, &DWP(16,"ebp","",0));
343 &mov($C, &DWP( 8,"ebp","",0));
344 &mov(&swtmp(17),"ecx");
345
346 &comment("First we need to setup the X array");
347
348 for ($i=0; $i<16; $i+=2)
349 {
350 &mov($A,&DWP(($i+0)*4,"esi","",0));# unless $i == 0;
351 &mov($B,&DWP(($i+1)*4,"esi","",0));
352 &mov(&swtmp($i+0),$A);
353 &mov(&swtmp($i+1),$B);
354 }
355 &jmp($sclabel);
356 &function_end_B($name);
357 }
358
359
360sub sha1_block_data
361 {
362 local($name)=@_;
363
364 &function_begin_B($name,"");
365
366 # parameter 1 is the MD5_CTX structure.
367 # A 0
368 # B 4
369 # C 8
370 # D 12
371 # E 16
372
373 &mov("ecx", &wparam(2));
374 &push("esi");
375 &shl("ecx",6);
376 &mov("esi", &wparam(1));
377 &push("ebp");
378 &add("ecx","esi"); # offset to leave on
379 &push("ebx");
380 &mov("ebp", &wparam(0));
381 &push("edi");
382 &mov($D, &DWP(12,"ebp","",0));
383 &stack_push(18+9);
384 &mov($E, &DWP(16,"ebp","",0));
385 &mov($C, &DWP( 8,"ebp","",0));
386 &mov(&swtmp(17),"ecx");
387
388 &comment("First we need to setup the X array");
389
390 &set_label("start") unless $normal;
391
392 &X_expand("esi");
393 &mov(&wparam(1),"esi");
394
395 &set_label("shortcut", 0, 1);
396 &comment("");
397 &comment("Start processing");
398
399 # odd start
400 &mov($A, &DWP( 0,"ebp","",0));
401 &mov($B, &DWP( 4,"ebp","",0));
402 $X="esp";
403 &BODY_00_15(-2,$K[0],$X, 0,$A,$B,$C,$D,$E,$T);
404 &BODY_00_15( 0,$K[0],$X, 1,$T,$A,$B,$C,$D,$E);
405 &BODY_00_15( 0,$K[0],$X, 2,$E,$T,$A,$B,$C,$D);
406 &BODY_00_15( 0,$K[0],$X, 3,$D,$E,$T,$A,$B,$C);
407 &BODY_00_15( 0,$K[0],$X, 4,$C,$D,$E,$T,$A,$B);
408 &BODY_00_15( 0,$K[0],$X, 5,$B,$C,$D,$E,$T,$A);
409 &BODY_00_15( 0,$K[0],$X, 6,$A,$B,$C,$D,$E,$T);
410 &BODY_00_15( 0,$K[0],$X, 7,$T,$A,$B,$C,$D,$E);
411 &BODY_00_15( 0,$K[0],$X, 8,$E,$T,$A,$B,$C,$D);
412 &BODY_00_15( 0,$K[0],$X, 9,$D,$E,$T,$A,$B,$C);
413 &BODY_00_15( 0,$K[0],$X,10,$C,$D,$E,$T,$A,$B);
414 &BODY_00_15( 0,$K[0],$X,11,$B,$C,$D,$E,$T,$A);
415 &BODY_00_15( 0,$K[0],$X,12,$A,$B,$C,$D,$E,$T);
416 &BODY_00_15( 0,$K[0],$X,13,$T,$A,$B,$C,$D,$E);
417 &BODY_00_15( 0,$K[0],$X,14,$E,$T,$A,$B,$C,$D);
418 &BODY_00_15( 1,$K[0],$X,15,$D,$E,$T,$A,$B,$C);
419 &BODY_16_19(-1,$K[0],$X,16,$C,$D,$E,$T,$A,$B);
420 &BODY_16_19( 0,$K[0],$X,17,$B,$C,$D,$E,$T,$A);
421 &BODY_16_19( 0,$K[0],$X,18,$A,$B,$C,$D,$E,$T);
422 &BODY_16_19( 1,$K[0],$X,19,$T,$A,$B,$C,$D,$E);
423
424 &BODY_20_39(-1,$K[1],$X,20,$E,$T,$A,$B,$C,$D);
425 &BODY_20_39( 0,$K[1],$X,21,$D,$E,$T,$A,$B,$C);
426 &BODY_20_39( 0,$K[1],$X,22,$C,$D,$E,$T,$A,$B);
427 &BODY_20_39( 0,$K[1],$X,23,$B,$C,$D,$E,$T,$A);
428 &BODY_20_39( 0,$K[1],$X,24,$A,$B,$C,$D,$E,$T);
429 &BODY_20_39( 0,$K[1],$X,25,$T,$A,$B,$C,$D,$E);
430 &BODY_20_39( 0,$K[1],$X,26,$E,$T,$A,$B,$C,$D);
431 &BODY_20_39( 0,$K[1],$X,27,$D,$E,$T,$A,$B,$C);
432 &BODY_20_39( 0,$K[1],$X,28,$C,$D,$E,$T,$A,$B);
433 &BODY_20_39( 0,$K[1],$X,29,$B,$C,$D,$E,$T,$A);
434 &BODY_20_39( 0,$K[1],$X,30,$A,$B,$C,$D,$E,$T);
435 &BODY_20_39( 0,$K[1],$X,31,$T,$A,$B,$C,$D,$E);
436 &BODY_20_39( 0,$K[1],$X,32,$E,$T,$A,$B,$C,$D);
437 &BODY_20_39( 0,$K[1],$X,33,$D,$E,$T,$A,$B,$C);
438 &BODY_20_39( 0,$K[1],$X,34,$C,$D,$E,$T,$A,$B);
439 &BODY_20_39( 0,$K[1],$X,35,$B,$C,$D,$E,$T,$A);
440 &BODY_20_39( 0,$K[1],$X,36,$A,$B,$C,$D,$E,$T);
441 &BODY_20_39( 0,$K[1],$X,37,$T,$A,$B,$C,$D,$E);
442 &BODY_20_39( 0,$K[1],$X,38,$E,$T,$A,$B,$C,$D);
443 &BODY_20_39( 1,$K[1],$X,39,$D,$E,$T,$A,$B,$C);
444
445 &BODY_40_59(-1,$K[2],$X,40,$C,$D,$E,$T,$A,$B);
446 &BODY_40_59( 0,$K[2],$X,41,$B,$C,$D,$E,$T,$A);
447 &BODY_40_59( 0,$K[2],$X,42,$A,$B,$C,$D,$E,$T);
448 &BODY_40_59( 0,$K[2],$X,43,$T,$A,$B,$C,$D,$E);
449 &BODY_40_59( 0,$K[2],$X,44,$E,$T,$A,$B,$C,$D);
450 &BODY_40_59( 0,$K[2],$X,45,$D,$E,$T,$A,$B,$C);
451 &BODY_40_59( 0,$K[2],$X,46,$C,$D,$E,$T,$A,$B);
452 &BODY_40_59( 0,$K[2],$X,47,$B,$C,$D,$E,$T,$A);
453 &BODY_40_59( 0,$K[2],$X,48,$A,$B,$C,$D,$E,$T);
454 &BODY_40_59( 0,$K[2],$X,49,$T,$A,$B,$C,$D,$E);
455 &BODY_40_59( 0,$K[2],$X,50,$E,$T,$A,$B,$C,$D);
456 &BODY_40_59( 0,$K[2],$X,51,$D,$E,$T,$A,$B,$C);
457 &BODY_40_59( 0,$K[2],$X,52,$C,$D,$E,$T,$A,$B);
458 &BODY_40_59( 0,$K[2],$X,53,$B,$C,$D,$E,$T,$A);
459 &BODY_40_59( 0,$K[2],$X,54,$A,$B,$C,$D,$E,$T);
460 &BODY_40_59( 0,$K[2],$X,55,$T,$A,$B,$C,$D,$E);
461 &BODY_40_59( 0,$K[2],$X,56,$E,$T,$A,$B,$C,$D);
462 &BODY_40_59( 0,$K[2],$X,57,$D,$E,$T,$A,$B,$C);
463 &BODY_40_59( 0,$K[2],$X,58,$C,$D,$E,$T,$A,$B);
464 &BODY_40_59( 1,$K[2],$X,59,$B,$C,$D,$E,$T,$A);
465
466 &BODY_60_79(-1,$K[3],$X,60,$A,$B,$C,$D,$E,$T);
467 &BODY_60_79( 0,$K[3],$X,61,$T,$A,$B,$C,$D,$E);
468 &BODY_60_79( 0,$K[3],$X,62,$E,$T,$A,$B,$C,$D);
469 &BODY_60_79( 0,$K[3],$X,63,$D,$E,$T,$A,$B,$C);
470 &BODY_60_79( 0,$K[3],$X,64,$C,$D,$E,$T,$A,$B);
471 &BODY_60_79( 0,$K[3],$X,65,$B,$C,$D,$E,$T,$A);
472 &BODY_60_79( 0,$K[3],$X,66,$A,$B,$C,$D,$E,$T);
473 &BODY_60_79( 0,$K[3],$X,67,$T,$A,$B,$C,$D,$E);
474 &BODY_60_79( 0,$K[3],$X,68,$E,$T,$A,$B,$C,$D);
475 &BODY_60_79( 0,$K[3],$X,69,$D,$E,$T,$A,$B,$C);
476 &BODY_60_79( 0,$K[3],$X,70,$C,$D,$E,$T,$A,$B);
477 &BODY_60_79( 0,$K[3],$X,71,$B,$C,$D,$E,$T,$A);
478 &BODY_60_79( 0,$K[3],$X,72,$A,$B,$C,$D,$E,$T);
479 &BODY_60_79( 0,$K[3],$X,73,$T,$A,$B,$C,$D,$E);
480 &BODY_60_79( 0,$K[3],$X,74,$E,$T,$A,$B,$C,$D);
481 &BODY_60_79( 0,$K[3],$X,75,$D,$E,$T,$A,$B,$C);
482 &BODY_60_79( 0,$K[3],$X,76,$C,$D,$E,$T,$A,$B);
483 &BODY_60_79( 0,$K[3],$X,77,$B,$C,$D,$E,$T,$A);
484 &BODY_60_79( 0,$K[3],$X,78,$A,$B,$C,$D,$E,$T);
485 &BODY_60_79( 2,$K[3],$X,79,$T,$A,$B,$C,$D,$E);
486
487 &comment("End processing");
488 &comment("");
489 # D is the tmp value
490
491 # E -> A
492 # T -> B
493 # A -> C
494 # B -> D
495 # C -> E
496 # D -> T
497
498 # The last 2 have been moved into the last loop
499 # &mov($tmp1,&wparam(0));
500
501 &mov($D, &DWP(12,$tmp1,"",0));
502 &add($D,$B);
503 &mov($B, &DWP( 4,$tmp1,"",0));
504 &add($B,$T);
505 &mov($T, $A);
506 &mov($A, &DWP( 0,$tmp1,"",0));
507 &mov(&DWP(12,$tmp1,"",0),$D);
508
509 &add($A,$E);
510 &mov($E, &DWP(16,$tmp1,"",0));
511 &add($E,$C);
512 &mov($C, &DWP( 8,$tmp1,"",0));
513 &add($C,$T);
514
515 &mov(&DWP( 0,$tmp1,"",0),$A);
516 &mov("esi",&wparam(1));
517 &mov(&DWP( 8,$tmp1,"",0),$C);
518 &add("esi",64);
519 &mov("eax",&swtmp(17));
520 &mov(&DWP(16,$tmp1,"",0),$E);
521 &cmp("esi","eax");
522 &mov(&DWP( 4,$tmp1,"",0),$B);
523 &jl(&label("start"));
524
525 &stack_pop(18+9);
526 &pop("edi");
527 &pop("ebx");
528 &pop("ebp");
529 &pop("esi");
530 &ret();
531
532 # keep a note of shortcut label so it can be used outside
533 # block.
534 my $sclabel = &label("shortcut");
535
536 &function_end_B($name);
537 # Putting this here avoids problems with MASM in debugging mode
538 &sha1_block_host("sha1_block_asm_host_order", $sclabel);
539 }
540
diff --git a/src/lib/libcrypto/sha/sha.h b/src/lib/libcrypto/sha/sha.h
deleted file mode 100644
index 77f6d9695e..0000000000
--- a/src/lib/libcrypto/sha/sha.h
+++ /dev/null
@@ -1,119 +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#ifdef __cplusplus
63extern "C" {
64#endif
65
66#if defined(NO_SHA) || (defined(NO_SHA0) && defined(NO_SHA1))
67#error SHA is disabled.
68#endif
69
70/*
71 * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
72 * ! SHA_LONG has to be at least 32 bits wide. If it's wider, then !
73 * ! SHA_LONG_LOG2 has to be defined along. !
74 * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
75 */
76
77#if defined(WIN16) || defined(__LP32__)
78#define SHA_LONG unsigned long
79#elif defined(_CRAY) || defined(__ILP64__)
80#define SHA_LONG unsigned long
81#define SHA_LONG_LOG2 3
82#else
83#define SHA_LONG unsigned int
84#endif
85
86#define SHA_LBLOCK 16
87#define SHA_CBLOCK (SHA_LBLOCK*4) /* SHA treats input data as a
88 * contiguous array of 32 bit
89 * wide big-endian values. */
90#define SHA_LAST_BLOCK (SHA_CBLOCK-8)
91#define SHA_DIGEST_LENGTH 20
92
93typedef struct SHAstate_st
94 {
95 SHA_LONG h0,h1,h2,h3,h4;
96 SHA_LONG Nl,Nh;
97 SHA_LONG data[SHA_LBLOCK];
98 int num;
99 } SHA_CTX;
100
101#ifndef NO_SHA0
102void SHA_Init(SHA_CTX *c);
103void SHA_Update(SHA_CTX *c, const void *data, unsigned long len);
104void SHA_Final(unsigned char *md, SHA_CTX *c);
105unsigned char *SHA(const unsigned char *d, unsigned long n,unsigned char *md);
106void SHA_Transform(SHA_CTX *c, const unsigned char *data);
107#endif
108#ifndef NO_SHA1
109void SHA1_Init(SHA_CTX *c);
110void SHA1_Update(SHA_CTX *c, const void *data, unsigned long len);
111void SHA1_Final(unsigned char *md, SHA_CTX *c);
112unsigned char *SHA1(const unsigned char *d, unsigned long n,unsigned char *md);
113void SHA1_Transform(SHA_CTX *c, const unsigned char *data);
114#endif
115#ifdef __cplusplus
116}
117#endif
118
119#endif
diff --git a/src/lib/libcrypto/sha/sha1_one.c b/src/lib/libcrypto/sha/sha1_one.c
deleted file mode 100644
index 861752eaa7..0000000000
--- a/src/lib/libcrypto/sha/sha1_one.c
+++ /dev/null
@@ -1,76 +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
63#ifndef NO_SHA1
64unsigned char *SHA1(const unsigned char *d, unsigned long n, unsigned char *md)
65 {
66 SHA_CTX c;
67 static unsigned char m[SHA_DIGEST_LENGTH];
68
69 if (md == NULL) md=m;
70 SHA1_Init(&c);
71 SHA1_Update(&c,d,n);
72 SHA1_Final(md,&c);
73 memset(&c,0,sizeof(c));
74 return(md);
75 }
76#endif
diff --git a/src/lib/libcrypto/sha/sha1dgst.c b/src/lib/libcrypto/sha/sha1dgst.c
deleted file mode 100644
index c09edb4cd7..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(NO_SHA1) && !defined(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 2f8aef83f3..0000000000
--- a/src/lib/libcrypto/sha/sha_locl.h
+++ /dev/null
@@ -1,471 +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(_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
141void 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 }
152
153#define K_00_19 0x5a827999UL
154#define K_20_39 0x6ed9eba1UL
155#define K_40_59 0x8f1bbcdcUL
156#define K_60_79 0xca62c1d6UL
157
158/* As pointed out by Wei Dai <weidai@eskimo.com>, F() below can be
159 * simplified to the code in F_00_19. Wei attributes these optimisations
160 * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
161 * #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z)))
162 * I've just become aware of another tweak to be made, again from Wei Dai,
163 * in F_40_59, (x&a)|(y&a) -> (x|y)&a
164 */
165#define F_00_19(b,c,d) ((((c) ^ (d)) & (b)) ^ (d))
166#define F_20_39(b,c,d) ((b) ^ (c) ^ (d))
167#define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d)))
168#define F_60_79(b,c,d) F_20_39(b,c,d)
169
170#define BODY_00_15(i,a,b,c,d,e,f,xi) \
171 (f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
172 (b)=ROTATE((b),30);
173
174#define BODY_16_19(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
175 Xupdate(f,xi,xa,xb,xc,xd); \
176 (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
177 (b)=ROTATE((b),30);
178
179#define BODY_20_31(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
180 Xupdate(f,xi,xa,xb,xc,xd); \
181 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
182 (b)=ROTATE((b),30);
183
184#define BODY_32_39(i,a,b,c,d,e,f,xa,xb,xc,xd) \
185 Xupdate(f,xa,xa,xb,xc,xd); \
186 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
187 (b)=ROTATE((b),30);
188
189#define BODY_40_59(i,a,b,c,d,e,f,xa,xb,xc,xd) \
190 Xupdate(f,xa,xa,xb,xc,xd); \
191 (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \
192 (b)=ROTATE((b),30);
193
194#define BODY_60_79(i,a,b,c,d,e,f,xa,xb,xc,xd) \
195 Xupdate(f,xa,xa,xb,xc,xd); \
196 (f)=xa+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \
197 (b)=ROTATE((b),30);
198
199#ifdef X
200#undef X
201#endif
202#ifndef MD32_XARRAY
203 /*
204 * Originally X was an array. As it's automatic it's natural
205 * to expect RISC compiler to accomodate at least part of it in
206 * the register bank, isn't it? Unfortunately not all compilers
207 * "find" this expectation reasonable:-( On order to make such
208 * compilers generate better code I replace X[] with a bunch of
209 * X0, X1, etc. See the function body below...
210 * <appro@fy.chalmers.se>
211 */
212# define X(i) XX##i
213#else
214 /*
215 * However! Some compilers (most notably HP C) get overwhelmed by
216 * that many local variables so that we have to have the way to
217 * fall down to the original behavior.
218 */
219# define X(i) XX[i]
220#endif
221
222#ifndef DONT_IMPLEMENT_BLOCK_HOST_ORDER
223void HASH_BLOCK_HOST_ORDER (SHA_CTX *c, const void *d, int num)
224 {
225 const SHA_LONG *W=d;
226 register unsigned long A,B,C,D,E,T;
227#ifndef MD32_XARRAY
228 unsigned long XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
229 XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
230#else
231 SHA_LONG XX[16];
232#endif
233
234 A=c->h0;
235 B=c->h1;
236 C=c->h2;
237 D=c->h3;
238 E=c->h4;
239
240 for (;;)
241 {
242 BODY_00_15( 0,A,B,C,D,E,T,W[ 0]);
243 BODY_00_15( 1,T,A,B,C,D,E,W[ 1]);
244 BODY_00_15( 2,E,T,A,B,C,D,W[ 2]);
245 BODY_00_15( 3,D,E,T,A,B,C,W[ 3]);
246 BODY_00_15( 4,C,D,E,T,A,B,W[ 4]);
247 BODY_00_15( 5,B,C,D,E,T,A,W[ 5]);
248 BODY_00_15( 6,A,B,C,D,E,T,W[ 6]);
249 BODY_00_15( 7,T,A,B,C,D,E,W[ 7]);
250 BODY_00_15( 8,E,T,A,B,C,D,W[ 8]);
251 BODY_00_15( 9,D,E,T,A,B,C,W[ 9]);
252 BODY_00_15(10,C,D,E,T,A,B,W[10]);
253 BODY_00_15(11,B,C,D,E,T,A,W[11]);
254 BODY_00_15(12,A,B,C,D,E,T,W[12]);
255 BODY_00_15(13,T,A,B,C,D,E,W[13]);
256 BODY_00_15(14,E,T,A,B,C,D,W[14]);
257 BODY_00_15(15,D,E,T,A,B,C,W[15]);
258
259 BODY_16_19(16,C,D,E,T,A,B,X( 0),W[ 0],W[ 2],W[ 8],W[13]);
260 BODY_16_19(17,B,C,D,E,T,A,X( 1),W[ 1],W[ 3],W[ 9],W[14]);
261 BODY_16_19(18,A,B,C,D,E,T,X( 2),W[ 2],W[ 4],W[10],W[15]);
262 BODY_16_19(19,T,A,B,C,D,E,X( 3),W[ 3],W[ 5],W[11],X( 0));
263
264 BODY_20_31(20,E,T,A,B,C,D,X( 4),W[ 4],W[ 6],W[12],X( 1));
265 BODY_20_31(21,D,E,T,A,B,C,X( 5),W[ 5],W[ 7],W[13],X( 2));
266 BODY_20_31(22,C,D,E,T,A,B,X( 6),W[ 6],W[ 8],W[14],X( 3));
267 BODY_20_31(23,B,C,D,E,T,A,X( 7),W[ 7],W[ 9],W[15],X( 4));
268 BODY_20_31(24,A,B,C,D,E,T,X( 8),W[ 8],W[10],X( 0),X( 5));
269 BODY_20_31(25,T,A,B,C,D,E,X( 9),W[ 9],W[11],X( 1),X( 6));
270 BODY_20_31(26,E,T,A,B,C,D,X(10),W[10],W[12],X( 2),X( 7));
271 BODY_20_31(27,D,E,T,A,B,C,X(11),W[11],W[13],X( 3),X( 8));
272 BODY_20_31(28,C,D,E,T,A,B,X(12),W[12],W[14],X( 4),X( 9));
273 BODY_20_31(29,B,C,D,E,T,A,X(13),W[13],W[15],X( 5),X(10));
274 BODY_20_31(30,A,B,C,D,E,T,X(14),W[14],X( 0),X( 6),X(11));
275 BODY_20_31(31,T,A,B,C,D,E,X(15),W[15],X( 1),X( 7),X(12));
276
277 BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13));
278 BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14));
279 BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15));
280 BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0));
281 BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1));
282 BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2));
283 BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3));
284 BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4));
285
286 BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5));
287 BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6));
288 BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7));
289 BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8));
290 BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9));
291 BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10));
292 BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11));
293 BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12));
294 BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13));
295 BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14));
296 BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15));
297 BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0));
298 BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1));
299 BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2));
300 BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3));
301 BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4));
302 BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5));
303 BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6));
304 BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7));
305 BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8));
306
307 BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9));
308 BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10));
309 BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11));
310 BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12));
311 BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13));
312 BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14));
313 BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15));
314 BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0));
315 BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1));
316 BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2));
317 BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3));
318 BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4));
319 BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5));
320 BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6));
321 BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7));
322 BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8));
323 BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9));
324 BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10));
325 BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11));
326 BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12));
327
328 c->h0=(c->h0+E)&0xffffffffL;
329 c->h1=(c->h1+T)&0xffffffffL;
330 c->h2=(c->h2+A)&0xffffffffL;
331 c->h3=(c->h3+B)&0xffffffffL;
332 c->h4=(c->h4+C)&0xffffffffL;
333
334 if (--num <= 0) break;
335
336 A=c->h0;
337 B=c->h1;
338 C=c->h2;
339 D=c->h3;
340 E=c->h4;
341
342 W+=SHA_LBLOCK;
343 }
344 }
345#endif
346
347#ifndef DONT_IMPLEMENT_BLOCK_DATA_ORDER
348void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, int num)
349 {
350 const unsigned char *data=p;
351 register unsigned long A,B,C,D,E,T,l;
352#ifndef MD32_XARRAY
353 unsigned long XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
354 XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
355#else
356 SHA_LONG XX[16];
357#endif
358
359 A=c->h0;
360 B=c->h1;
361 C=c->h2;
362 D=c->h3;
363 E=c->h4;
364
365 for (;;)
366 {
367
368 HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l;
369 BODY_00_15( 0,A,B,C,D,E,T,X( 0)); HOST_c2l(data,l); X( 2)=l;
370 BODY_00_15( 1,T,A,B,C,D,E,X( 1)); HOST_c2l(data,l); X( 3)=l;
371 BODY_00_15( 2,E,T,A,B,C,D,X( 2)); HOST_c2l(data,l); X( 4)=l;
372 BODY_00_15( 3,D,E,T,A,B,C,X( 3)); HOST_c2l(data,l); X( 5)=l;
373 BODY_00_15( 4,C,D,E,T,A,B,X( 4)); HOST_c2l(data,l); X( 6)=l;
374 BODY_00_15( 5,B,C,D,E,T,A,X( 5)); HOST_c2l(data,l); X( 7)=l;
375 BODY_00_15( 6,A,B,C,D,E,T,X( 6)); HOST_c2l(data,l); X( 8)=l;
376 BODY_00_15( 7,T,A,B,C,D,E,X( 7)); HOST_c2l(data,l); X( 9)=l;
377 BODY_00_15( 8,E,T,A,B,C,D,X( 8)); HOST_c2l(data,l); X(10)=l;
378 BODY_00_15( 9,D,E,T,A,B,C,X( 9)); HOST_c2l(data,l); X(11)=l;
379 BODY_00_15(10,C,D,E,T,A,B,X(10)); HOST_c2l(data,l); X(12)=l;
380 BODY_00_15(11,B,C,D,E,T,A,X(11)); HOST_c2l(data,l); X(13)=l;
381 BODY_00_15(12,A,B,C,D,E,T,X(12)); HOST_c2l(data,l); X(14)=l;
382 BODY_00_15(13,T,A,B,C,D,E,X(13)); HOST_c2l(data,l); X(15)=l;
383 BODY_00_15(14,E,T,A,B,C,D,X(14));
384 BODY_00_15(15,D,E,T,A,B,C,X(15));
385
386 BODY_16_19(16,C,D,E,T,A,B,X( 0),X( 0),X( 2),X( 8),X(13));
387 BODY_16_19(17,B,C,D,E,T,A,X( 1),X( 1),X( 3),X( 9),X(14));
388 BODY_16_19(18,A,B,C,D,E,T,X( 2),X( 2),X( 4),X(10),X(15));
389 BODY_16_19(19,T,A,B,C,D,E,X( 3),X( 3),X( 5),X(11),X( 0));
390
391 BODY_20_31(20,E,T,A,B,C,D,X( 4),X( 4),X( 6),X(12),X( 1));
392 BODY_20_31(21,D,E,T,A,B,C,X( 5),X( 5),X( 7),X(13),X( 2));
393 BODY_20_31(22,C,D,E,T,A,B,X( 6),X( 6),X( 8),X(14),X( 3));
394 BODY_20_31(23,B,C,D,E,T,A,X( 7),X( 7),X( 9),X(15),X( 4));
395 BODY_20_31(24,A,B,C,D,E,T,X( 8),X( 8),X(10),X( 0),X( 5));
396 BODY_20_31(25,T,A,B,C,D,E,X( 9),X( 9),X(11),X( 1),X( 6));
397 BODY_20_31(26,E,T,A,B,C,D,X(10),X(10),X(12),X( 2),X( 7));
398 BODY_20_31(27,D,E,T,A,B,C,X(11),X(11),X(13),X( 3),X( 8));
399 BODY_20_31(28,C,D,E,T,A,B,X(12),X(12),X(14),X( 4),X( 9));
400 BODY_20_31(29,B,C,D,E,T,A,X(13),X(13),X(15),X( 5),X(10));
401 BODY_20_31(30,A,B,C,D,E,T,X(14),X(14),X( 0),X( 6),X(11));
402 BODY_20_31(31,T,A,B,C,D,E,X(15),X(15),X( 1),X( 7),X(12));
403
404 BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13));
405 BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14));
406 BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15));
407 BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0));
408 BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1));
409 BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2));
410 BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3));
411 BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4));
412
413 BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5));
414 BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6));
415 BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7));
416 BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8));
417 BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9));
418 BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10));
419 BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11));
420 BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12));
421 BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13));
422 BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14));
423 BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15));
424 BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0));
425 BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1));
426 BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2));
427 BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3));
428 BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4));
429 BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5));
430 BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6));
431 BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7));
432 BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8));
433
434 BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9));
435 BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10));
436 BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11));
437 BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12));
438 BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13));
439 BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14));
440 BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15));
441 BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0));
442 BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1));
443 BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2));
444 BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3));
445 BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4));
446 BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5));
447 BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6));
448 BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7));
449 BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8));
450 BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9));
451 BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10));
452 BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11));
453 BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12));
454
455 c->h0=(c->h0+E)&0xffffffffL;
456 c->h1=(c->h1+T)&0xffffffffL;
457 c->h2=(c->h2+A)&0xffffffffL;
458 c->h3=(c->h3+B)&0xffffffffL;
459 c->h4=(c->h4+C)&0xffffffffL;
460
461 if (--num <= 0) break;
462
463 A=c->h0;
464 B=c->h1;
465 C=c->h2;
466 D=c->h3;
467 E=c->h4;
468
469 }
470 }
471#endif
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-03-19 20:08:50 +0000