diff options
Diffstat (limited to 'src/lib/libcrypto/sha')
-rw-r--r-- | src/lib/libcrypto/sha/asm/sha1-586.pl | 472 | ||||
-rw-r--r-- | src/lib/libcrypto/sha/sha.h | 90 | ||||
-rw-r--r-- | src/lib/libcrypto/sha/sha1_one.c | 4 | ||||
-rw-r--r-- | src/lib/libcrypto/sha/sha1dgst.c | 11 | ||||
-rw-r--r-- | src/lib/libcrypto/sha/sha1test.c | 12 | ||||
-rw-r--r-- | src/lib/libcrypto/sha/sha_dgst.c | 3 | ||||
-rw-r--r-- | src/lib/libcrypto/sha/sha_locl.h | 306 | ||||
-rw-r--r-- | src/lib/libcrypto/sha/sha_one.c | 2 | ||||
-rw-r--r-- | src/lib/libcrypto/sha/shatest.c | 12 |
9 files changed, 369 insertions, 543 deletions
diff --git a/src/lib/libcrypto/sha/asm/sha1-586.pl b/src/lib/libcrypto/sha/asm/sha1-586.pl index 041acc0348..0b4dab2bd5 100644 --- a/src/lib/libcrypto/sha/asm/sha1-586.pl +++ b/src/lib/libcrypto/sha/asm/sha1-586.pl | |||
@@ -1,4 +1,16 @@ | |||
1 | #!/usr/local/bin/perl | 1 | #!/usr/bin/env perl |
2 | |||
3 | # ==================================================================== | ||
4 | # [Re]written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL | ||
5 | # project. The module is, however, dual licensed under OpenSSL and | ||
6 | # CRYPTOGAMS licenses depending on where you obtain it. For further | ||
7 | # details see http://www.openssl.org/~appro/cryptogams/. | ||
8 | # ==================================================================== | ||
9 | |||
10 | # "[Re]written" was achieved in two major overhauls. In 2004 BODY_* | ||
11 | # functions were re-implemented to address P4 performance issue [see | ||
12 | # commentary below], and in 2006 the rest was rewritten in order to | ||
13 | # gain freedom to liberate licensing terms. | ||
2 | 14 | ||
3 | # It was noted that Intel IA-32 C compiler generates code which | 15 | # It was noted that Intel IA-32 C compiler generates code which |
4 | # performs ~30% *faster* on P4 CPU than original *hand-coded* | 16 | # performs ~30% *faster* on P4 CPU than original *hand-coded* |
@@ -9,7 +21,7 @@ | |||
9 | # | 21 | # |
10 | # compared with original compared with Intel cc | 22 | # compared with original compared with Intel cc |
11 | # assembler impl. generated code | 23 | # assembler impl. generated code |
12 | # Pentium -25% +37% | 24 | # Pentium -16% +48% |
13 | # PIII/AMD +8% +16% | 25 | # PIII/AMD +8% +16% |
14 | # P4 +85%(!) +45% | 26 | # P4 +85%(!) +45% |
15 | # | 27 | # |
@@ -17,174 +29,115 @@ | |||
17 | # improvement on P4 outweights the loss and incorporate this | 29 | # improvement on P4 outweights the loss and incorporate this |
18 | # re-tuned code to 0.9.7 and later. | 30 | # re-tuned code to 0.9.7 and later. |
19 | # ---------------------------------------------------------------- | 31 | # ---------------------------------------------------------------- |
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> | 32 | # <appro@fy.chalmers.se> |
27 | 33 | ||
28 | $normal=0; | 34 | $0 =~ m/(.*[\/\\])[^\/\\]+$/; $dir=$1; |
29 | 35 | push(@INC,"${dir}","${dir}../../perlasm"); | |
30 | push(@INC,"perlasm","../../perlasm"); | ||
31 | require "x86asm.pl"; | 36 | require "x86asm.pl"; |
32 | 37 | ||
33 | &asm_init($ARGV[0],"sha1-586.pl",$ARGV[$#ARGV] eq "386"); | 38 | &asm_init($ARGV[0],"sha1-586.pl",$ARGV[$#ARGV] eq "386"); |
34 | 39 | ||
35 | $A="eax"; | 40 | $A="eax"; |
36 | $B="ecx"; | 41 | $B="ebx"; |
37 | $C="ebx"; | 42 | $C="ecx"; |
38 | $D="edx"; | 43 | $D="edx"; |
39 | $E="edi"; | 44 | $E="edi"; |
40 | $T="esi"; | 45 | $T="esi"; |
41 | $tmp1="ebp"; | 46 | $tmp1="ebp"; |
42 | 47 | ||
43 | $off=9*4; | 48 | @V=($A,$B,$C,$D,$E,$T); |
44 | |||
45 | @K=(0x5a827999,0x6ed9eba1,0x8f1bbcdc,0xca62c1d6); | ||
46 | |||
47 | &sha1_block_data("sha1_block_asm_data_order"); | ||
48 | |||
49 | &asm_finish(); | ||
50 | |||
51 | sub 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 | |||
58 | sub 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 | |||
66 | sub 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 | |||
76 | sub 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 | 49 | ||
101 | sub BODY_00_15 | 50 | sub BODY_00_15 |
102 | { | 51 | { |
103 | local($pos,$K,$X,$n,$a,$b,$c,$d,$e,$f)=@_; | 52 | local($n,$a,$b,$c,$d,$e,$f)=@_; |
104 | 53 | ||
105 | &comment("00_15 $n"); | 54 | &comment("00_15 $n"); |
106 | 55 | ||
107 | &mov($tmp1,$a); | 56 | &mov($f,$c); # f to hold F_00_19(b,c,d) |
108 | &mov($f,$c); # f to hold F_00_19(b,c,d) | 57 | if ($n==0) { &mov($tmp1,$a); } |
58 | else { &mov($a,$tmp1); } | ||
109 | &rotl($tmp1,5); # tmp1=ROTATE(a,5) | 59 | &rotl($tmp1,5); # tmp1=ROTATE(a,5) |
110 | &xor($f,$d); | 60 | &xor($f,$d); |
111 | &and($f,$b); | ||
112 | &rotr($b,2); # b=ROTATE(b,30) | ||
113 | &add($tmp1,$e); # tmp1+=e; | 61 | &add($tmp1,$e); # tmp1+=e; |
114 | &mov($e,&swtmp($n)); # e becomes volatile and | 62 | &and($f,$b); |
115 | # is loaded with xi | 63 | &mov($e,&swtmp($n%16)); # e becomes volatile and is loaded |
116 | &xor($f,$d); # f holds F_00_19(b,c,d) | 64 | # with xi, also note that e becomes |
117 | &lea($tmp1,&DWP($K,$tmp1,$e,1));# tmp1+=K_00_19+xi | 65 | # f in next round... |
118 | 66 | &xor($f,$d); # f holds F_00_19(b,c,d) | |
119 | &add($f,$tmp1); # f+=tmp1 | 67 | &rotr($b,2); # b=ROTATE(b,30) |
68 | &lea($tmp1,&DWP(0x5a827999,$tmp1,$e)); # tmp1+=K_00_19+xi | ||
69 | |||
70 | if ($n==15) { &add($f,$tmp1); } # f+=tmp1 | ||
71 | else { &add($tmp1,$f); } # f becomes a in next round | ||
120 | } | 72 | } |
121 | 73 | ||
122 | sub BODY_16_19 | 74 | sub BODY_16_19 |
123 | { | 75 | { |
124 | local($pos,$K,$X,$n,$a,$b,$c,$d,$e,$f)=@_; | 76 | local($n,$a,$b,$c,$d,$e,$f)=@_; |
125 | local($n0,$n1,$n2,$n3,$np)=&Na($n); | ||
126 | 77 | ||
127 | &comment("16_19 $n"); | 78 | &comment("16_19 $n"); |
128 | 79 | ||
129 | &mov($f,&swtmp($n1)); # f to hold Xupdate(xi,xa,xb,xc,xd) | 80 | &mov($f,&swtmp($n%16)); # f to hold Xupdate(xi,xa,xb,xc,xd) |
130 | &mov($tmp1,$c); # tmp1 to hold F_00_19(b,c,d) | 81 | &mov($tmp1,$c); # tmp1 to hold F_00_19(b,c,d) |
131 | &xor($f,&swtmp($n0)); | 82 | &xor($f,&swtmp(($n+2)%16)); |
132 | &xor($tmp1,$d); | 83 | &xor($tmp1,$d); |
133 | &xor($f,&swtmp($n2)); | 84 | &xor($f,&swtmp(($n+8)%16)); |
134 | &and($tmp1,$b); # tmp1 holds F_00_19(b,c,d) | 85 | &and($tmp1,$b); # tmp1 holds F_00_19(b,c,d) |
135 | &xor($f,&swtmp($n3)); # f holds xa^xb^xc^xd | 86 | &rotr($b,2); # b=ROTATE(b,30) |
136 | &rotr($b,2); # b=ROTATE(b,30) | 87 | &xor($f,&swtmp(($n+13)%16)); # f holds xa^xb^xc^xd |
137 | &xor($tmp1,$d); # tmp1=F_00_19(b,c,d) | 88 | &rotl($f,1); # f=ROTATE(f,1) |
138 | &rotl($f,1); # f=ROATE(f,1) | 89 | &xor($tmp1,$d); # tmp1=F_00_19(b,c,d) |
139 | &mov(&swtmp($n0),$f); # xi=f | 90 | &mov(&swtmp($n%16),$f); # xi=f |
140 | &lea($f,&DWP($K,$f,$e,1)); # f+=K_00_19+e | 91 | &lea($f,&DWP(0x5a827999,$f,$e));# f+=K_00_19+e |
141 | &mov($e,$a); # e becomes volatile | 92 | &mov($e,$a); # e becomes volatile |
142 | &add($f,$tmp1); # f+=F_00_19(b,c,d) | 93 | &rotl($e,5); # e=ROTATE(a,5) |
143 | &rotl($e,5); # e=ROTATE(a,5) | 94 | &add($f,$tmp1); # f+=F_00_19(b,c,d) |
144 | &add($f,$e); # f+=ROTATE(a,5) | 95 | &add($f,$e); # f+=ROTATE(a,5) |
145 | } | 96 | } |
146 | 97 | ||
147 | sub BODY_20_39 | 98 | sub BODY_20_39 |
148 | { | 99 | { |
149 | local($pos,$K,$X,$n,$a,$b,$c,$d,$e,$f)=@_; | 100 | local($n,$a,$b,$c,$d,$e,$f)=@_; |
101 | local $K=($n<40)?0x6ed9eba1:0xca62c1d6; | ||
150 | 102 | ||
151 | &comment("20_39 $n"); | 103 | &comment("20_39 $n"); |
152 | local($n0,$n1,$n2,$n3,$np)=&Na($n); | ||
153 | 104 | ||
154 | &mov($f,&swtmp($n0)); # f to hold Xupdate(xi,xa,xb,xc,xd) | 105 | &mov($tmp1,$b); # tmp1 to hold F_20_39(b,c,d) |
155 | &mov($tmp1,$b); # tmp1 to hold F_20_39(b,c,d) | 106 | &mov($f,&swtmp($n%16)); # f to hold Xupdate(xi,xa,xb,xc,xd) |
156 | &xor($f,&swtmp($n1)); | 107 | &rotr($b,2); # b=ROTATE(b,30) |
157 | &rotr($b,2); # b=ROTATE(b,30) | 108 | &xor($f,&swtmp(($n+2)%16)); |
158 | &xor($f,&swtmp($n2)); | 109 | &xor($tmp1,$c); |
159 | &xor($tmp1,$c); | 110 | &xor($f,&swtmp(($n+8)%16)); |
160 | &xor($f,&swtmp($n3)); # f holds xa^xb^xc^xd | 111 | &xor($tmp1,$d); # tmp1 holds F_20_39(b,c,d) |
161 | &xor($tmp1,$d); # tmp1 holds F_20_39(b,c,d) | 112 | &xor($f,&swtmp(($n+13)%16)); # f holds xa^xb^xc^xd |
162 | &rotl($f,1); # f=ROTATE(f,1) | 113 | &rotl($f,1); # f=ROTATE(f,1) |
163 | &mov(&swtmp($n0),$f); # xi=f | 114 | &add($tmp1,$e); |
164 | &lea($f,&DWP($K,$f,$e,1)); # f+=K_20_39+e | 115 | &mov(&swtmp($n%16),$f); # xi=f |
165 | &mov($e,$a); # e becomes volatile | 116 | &mov($e,$a); # e becomes volatile |
166 | &rotl($e,5); # e=ROTATE(a,5) | 117 | &rotl($e,5); # e=ROTATE(a,5) |
167 | &add($f,$tmp1); # f+=F_20_39(b,c,d) | 118 | &lea($f,&DWP($K,$f,$tmp1)); # f+=K_20_39+e |
168 | &add($f,$e); # f+=ROTATE(a,5) | 119 | &add($f,$e); # f+=ROTATE(a,5) |
169 | } | 120 | } |
170 | 121 | ||
171 | sub BODY_40_59 | 122 | sub BODY_40_59 |
172 | { | 123 | { |
173 | local($pos,$K,$X,$n,$a,$b,$c,$d,$e,$f)=@_; | 124 | local($n,$a,$b,$c,$d,$e,$f)=@_; |
174 | 125 | ||
175 | &comment("40_59 $n"); | 126 | &comment("40_59 $n"); |
176 | local($n0,$n1,$n2,$n3,$np)=&Na($n); | ||
177 | 127 | ||
178 | &mov($f,&swtmp($n0)); # f to hold Xupdate(xi,xa,xb,xc,xd) | 128 | &mov($f,&swtmp($n%16)); # f to hold Xupdate(xi,xa,xb,xc,xd) |
129 | &mov($tmp1,&swtmp(($n+2)%16)); | ||
130 | &xor($f,$tmp1); | ||
131 | &mov($tmp1,&swtmp(($n+8)%16)); | ||
132 | &xor($f,$tmp1); | ||
133 | &mov($tmp1,&swtmp(($n+13)%16)); | ||
134 | &xor($f,$tmp1); # f holds xa^xb^xc^xd | ||
179 | &mov($tmp1,$b); # tmp1 to hold F_40_59(b,c,d) | 135 | &mov($tmp1,$b); # tmp1 to hold F_40_59(b,c,d) |
180 | &xor($f,&swtmp($n1)); | 136 | &rotl($f,1); # f=ROTATE(f,1) |
181 | &or($tmp1,$c); | 137 | &or($tmp1,$c); |
182 | &xor($f,&swtmp($n2)); | 138 | &mov(&swtmp($n%16),$f); # xi=f |
183 | &and($tmp1,$d); | 139 | &and($tmp1,$d); |
184 | &xor($f,&swtmp($n3)); # f holds xa^xb^xc^xd | 140 | &lea($f,&DWP(0x8f1bbcdc,$f,$e));# f+=K_40_59+e |
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 | 141 | &mov($e,$b); # e becomes volatile and is used |
189 | # to calculate F_40_59(b,c,d) | 142 | # to calculate F_40_59(b,c,d) |
190 | &rotr($b,2); # b=ROTATE(b,30) | 143 | &rotr($b,2); # b=ROTATE(b,30) |
@@ -192,234 +145,75 @@ sub BODY_40_59 | |||
192 | &or($tmp1,$e); # tmp1 holds F_40_59(b,c,d) | 145 | &or($tmp1,$e); # tmp1 holds F_40_59(b,c,d) |
193 | &mov($e,$a); | 146 | &mov($e,$a); |
194 | &rotl($e,5); # e=ROTATE(a,5) | 147 | &rotl($e,5); # e=ROTATE(a,5) |
195 | &add($tmp1,$e); # tmp1+=ROTATE(a,5) | 148 | &add($f,$tmp1); # f+=tmp1; |
196 | &add($f,$tmp1); # f+=tmp1; | 149 | &add($f,$e); # f+=ROTATE(a,5) |
197 | } | ||
198 | |||
199 | sub BODY_60_79 | ||
200 | { | ||
201 | &BODY_20_39(@_); | ||
202 | } | 150 | } |
203 | 151 | ||
204 | sub sha1_block_host | 152 | &function_begin("sha1_block_data_order",16); |
205 | { | 153 | &mov($tmp1,&wparam(0)); # SHA_CTX *c |
206 | local($name, $sclabel)=@_; | 154 | &mov($T,&wparam(1)); # const void *input |
155 | &mov($A,&wparam(2)); # size_t num | ||
156 | &stack_push(16); # allocate X[16] | ||
157 | &shl($A,6); | ||
158 | &add($A,$T); | ||
159 | &mov(&wparam(2),$A); # pointer beyond the end of input | ||
160 | &mov($E,&DWP(16,$tmp1));# pre-load E | ||
207 | 161 | ||
208 | &function_begin_B($name,""); | 162 | &set_label("loop",16); |
209 | 163 | ||
210 | # parameter 1 is the MD5_CTX structure. | 164 | # copy input chunk to X, but reversing byte order! |
211 | # A 0 | 165 | for ($i=0; $i<16; $i+=4) |
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 | { | 166 | { |
236 | &mov($A,&DWP(($i+0)*4,"esi","",0));# unless $i == 0; | 167 | &mov($A,&DWP(4*($i+0),$T)); |
237 | &mov($B,&DWP(($i+1)*4,"esi","",0)); | 168 | &mov($B,&DWP(4*($i+1),$T)); |
169 | &mov($C,&DWP(4*($i+2),$T)); | ||
170 | &mov($D,&DWP(4*($i+3),$T)); | ||
171 | &bswap($A); | ||
172 | &bswap($B); | ||
173 | &bswap($C); | ||
174 | &bswap($D); | ||
238 | &mov(&swtmp($i+0),$A); | 175 | &mov(&swtmp($i+0),$A); |
239 | &mov(&swtmp($i+1),$B); | 176 | &mov(&swtmp($i+1),$B); |
177 | &mov(&swtmp($i+2),$C); | ||
178 | &mov(&swtmp($i+3),$D); | ||
240 | } | 179 | } |
241 | &jmp($sclabel); | 180 | &mov(&wparam(1),$T); # redundant in 1st spin |
242 | &function_end_B($name); | 181 | |
243 | } | 182 | &mov($A,&DWP(0,$tmp1)); # load SHA_CTX |
244 | 183 | &mov($B,&DWP(4,$tmp1)); | |
245 | 184 | &mov($C,&DWP(8,$tmp1)); | |
246 | sub sha1_block_data | 185 | &mov($D,&DWP(12,$tmp1)); |
247 | { | 186 | # E is pre-loaded |
248 | local($name)=@_; | 187 | |
249 | 188 | for($i=0;$i<16;$i++) { &BODY_00_15($i,@V); unshift(@V,pop(@V)); } | |
250 | &function_begin_B($name,""); | 189 | for(;$i<20;$i++) { &BODY_16_19($i,@V); unshift(@V,pop(@V)); } |
251 | 190 | for(;$i<40;$i++) { &BODY_20_39($i,@V); unshift(@V,pop(@V)); } | |
252 | # parameter 1 is the MD5_CTX structure. | 191 | for(;$i<60;$i++) { &BODY_40_59($i,@V); unshift(@V,pop(@V)); } |
253 | # A 0 | 192 | for(;$i<80;$i++) { &BODY_20_39($i,@V); unshift(@V,pop(@V)); } |
254 | # B 4 | 193 | |
255 | # C 8 | 194 | (($V[5] eq $D) and ($V[0] eq $E)) or die; # double-check |
256 | # D 12 | 195 | |
257 | # E 16 | 196 | &mov($tmp1,&wparam(0)); # re-load SHA_CTX* |
258 | 197 | &mov($D,&wparam(1)); # D is last "T" and is discarded | |
259 | &mov("ecx", &wparam(2)); | 198 | |
260 | &push("esi"); | 199 | &add($E,&DWP(0,$tmp1)); # E is last "A"... |
261 | &shl("ecx",6); | 200 | &add($T,&DWP(4,$tmp1)); |
262 | &mov("esi", &wparam(1)); | 201 | &add($A,&DWP(8,$tmp1)); |
263 | &push("ebp"); | 202 | &add($B,&DWP(12,$tmp1)); |
264 | &add("ecx","esi"); # offset to leave on | 203 | &add($C,&DWP(16,$tmp1)); |
265 | &push("ebx"); | 204 | |
266 | &mov("ebp", &wparam(0)); | 205 | &mov(&DWP(0,$tmp1),$E); # update SHA_CTX |
267 | &push("edi"); | 206 | &add($D,64); # advance input pointer |
268 | &mov($D, &DWP(12,"ebp","",0)); | 207 | &mov(&DWP(4,$tmp1),$T); |
269 | &stack_push(18+9); | 208 | &cmp($D,&wparam(2)); # have we reached the end yet? |
270 | &mov($E, &DWP(16,"ebp","",0)); | 209 | &mov(&DWP(8,$tmp1),$A); |
271 | &mov($C, &DWP( 8,"ebp","",0)); | 210 | &mov($E,$C); # C is last "E" which needs to be "pre-loaded" |
272 | &mov(&swtmp(17),"ecx"); | 211 | &mov(&DWP(12,$tmp1),$B); |
273 | 212 | &mov($T,$D); # input pointer | |
274 | &comment("First we need to setup the X array"); | 213 | &mov(&DWP(16,$tmp1),$C); |
275 | 214 | &jb(&label("loop")); | |
276 | &set_label("start") unless $normal; | 215 | |
277 | 216 | &stack_pop(16); | |
278 | &X_expand("esi"); | 217 | &function_end("sha1_block_data_order"); |
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 | &jb(&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 | 218 | ||
219 | &asm_finish(); | ||
diff --git a/src/lib/libcrypto/sha/sha.h b/src/lib/libcrypto/sha/sha.h index 79c07b0fd1..eed44d7f94 100644 --- a/src/lib/libcrypto/sha/sha.h +++ b/src/lib/libcrypto/sha/sha.h | |||
@@ -60,6 +60,7 @@ | |||
60 | #define HEADER_SHA_H | 60 | #define HEADER_SHA_H |
61 | 61 | ||
62 | #include <openssl/e_os2.h> | 62 | #include <openssl/e_os2.h> |
63 | #include <stddef.h> | ||
63 | 64 | ||
64 | #ifdef __cplusplus | 65 | #ifdef __cplusplus |
65 | extern "C" { | 66 | extern "C" { |
@@ -70,7 +71,7 @@ extern "C" { | |||
70 | #endif | 71 | #endif |
71 | 72 | ||
72 | #if defined(OPENSSL_FIPS) | 73 | #if defined(OPENSSL_FIPS) |
73 | #define FIPS_SHA_SIZE_T unsigned long | 74 | #define FIPS_SHA_SIZE_T size_t |
74 | #endif | 75 | #endif |
75 | 76 | ||
76 | /* | 77 | /* |
@@ -101,26 +102,97 @@ typedef struct SHAstate_st | |||
101 | SHA_LONG h0,h1,h2,h3,h4; | 102 | SHA_LONG h0,h1,h2,h3,h4; |
102 | SHA_LONG Nl,Nh; | 103 | SHA_LONG Nl,Nh; |
103 | SHA_LONG data[SHA_LBLOCK]; | 104 | SHA_LONG data[SHA_LBLOCK]; |
104 | int num; | 105 | unsigned int num; |
105 | } SHA_CTX; | 106 | } SHA_CTX; |
106 | 107 | ||
107 | #ifndef OPENSSL_NO_SHA0 | 108 | #ifndef OPENSSL_NO_SHA0 |
108 | #ifdef OPENSSL_FIPS | ||
109 | int private_SHA_Init(SHA_CTX *c); | ||
110 | #endif | ||
111 | int SHA_Init(SHA_CTX *c); | 109 | int SHA_Init(SHA_CTX *c); |
112 | int SHA_Update(SHA_CTX *c, const void *data, unsigned long len); | 110 | int SHA_Update(SHA_CTX *c, const void *data, size_t len); |
113 | int SHA_Final(unsigned char *md, SHA_CTX *c); | 111 | int SHA_Final(unsigned char *md, SHA_CTX *c); |
114 | unsigned char *SHA(const unsigned char *d, unsigned long n,unsigned char *md); | 112 | unsigned char *SHA(const unsigned char *d, size_t n, unsigned char *md); |
115 | void SHA_Transform(SHA_CTX *c, const unsigned char *data); | 113 | void SHA_Transform(SHA_CTX *c, const unsigned char *data); |
116 | #endif | 114 | #endif |
117 | #ifndef OPENSSL_NO_SHA1 | 115 | #ifndef OPENSSL_NO_SHA1 |
118 | int SHA1_Init(SHA_CTX *c); | 116 | int SHA1_Init(SHA_CTX *c); |
119 | int SHA1_Update(SHA_CTX *c, const void *data, unsigned long len); | 117 | int SHA1_Update(SHA_CTX *c, const void *data, size_t len); |
120 | int SHA1_Final(unsigned char *md, SHA_CTX *c); | 118 | int SHA1_Final(unsigned char *md, SHA_CTX *c); |
121 | unsigned char *SHA1(const unsigned char *d, unsigned long n,unsigned char *md); | 119 | unsigned char *SHA1(const unsigned char *d, size_t n, unsigned char *md); |
122 | void SHA1_Transform(SHA_CTX *c, const unsigned char *data); | 120 | void SHA1_Transform(SHA_CTX *c, const unsigned char *data); |
123 | #endif | 121 | #endif |
122 | |||
123 | #define SHA256_CBLOCK (SHA_LBLOCK*4) /* SHA-256 treats input data as a | ||
124 | * contiguous array of 32 bit | ||
125 | * wide big-endian values. */ | ||
126 | #define SHA224_DIGEST_LENGTH 28 | ||
127 | #define SHA256_DIGEST_LENGTH 32 | ||
128 | |||
129 | typedef struct SHA256state_st | ||
130 | { | ||
131 | SHA_LONG h[8]; | ||
132 | SHA_LONG Nl,Nh; | ||
133 | SHA_LONG data[SHA_LBLOCK]; | ||
134 | unsigned int num,md_len; | ||
135 | } SHA256_CTX; | ||
136 | |||
137 | #ifndef OPENSSL_NO_SHA256 | ||
138 | int SHA224_Init(SHA256_CTX *c); | ||
139 | int SHA224_Update(SHA256_CTX *c, const void *data, size_t len); | ||
140 | int SHA224_Final(unsigned char *md, SHA256_CTX *c); | ||
141 | unsigned char *SHA224(const unsigned char *d, size_t n,unsigned char *md); | ||
142 | int SHA256_Init(SHA256_CTX *c); | ||
143 | int SHA256_Update(SHA256_CTX *c, const void *data, size_t len); | ||
144 | int SHA256_Final(unsigned char *md, SHA256_CTX *c); | ||
145 | unsigned char *SHA256(const unsigned char *d, size_t n,unsigned char *md); | ||
146 | void SHA256_Transform(SHA256_CTX *c, const unsigned char *data); | ||
147 | #endif | ||
148 | |||
149 | #define SHA384_DIGEST_LENGTH 48 | ||
150 | #define SHA512_DIGEST_LENGTH 64 | ||
151 | |||
152 | #ifndef OPENSSL_NO_SHA512 | ||
153 | /* | ||
154 | * Unlike 32-bit digest algorithms, SHA-512 *relies* on SHA_LONG64 | ||
155 | * being exactly 64-bit wide. See Implementation Notes in sha512.c | ||
156 | * for further details. | ||
157 | */ | ||
158 | #define SHA512_CBLOCK (SHA_LBLOCK*8) /* SHA-512 treats input data as a | ||
159 | * contiguous array of 64 bit | ||
160 | * wide big-endian values. */ | ||
161 | #if (defined(_WIN32) || defined(_WIN64)) && !defined(__MINGW32__) | ||
162 | #define SHA_LONG64 unsigned __int64 | ||
163 | #define U64(C) C##UI64 | ||
164 | #elif defined(__arch64__) | ||
165 | #define SHA_LONG64 unsigned long | ||
166 | #define U64(C) C##UL | ||
167 | #else | ||
168 | #define SHA_LONG64 unsigned long long | ||
169 | #define U64(C) C##ULL | ||
170 | #endif | ||
171 | |||
172 | typedef struct SHA512state_st | ||
173 | { | ||
174 | SHA_LONG64 h[8]; | ||
175 | SHA_LONG64 Nl,Nh; | ||
176 | union { | ||
177 | SHA_LONG64 d[SHA_LBLOCK]; | ||
178 | unsigned char p[SHA512_CBLOCK]; | ||
179 | } u; | ||
180 | unsigned int num,md_len; | ||
181 | } SHA512_CTX; | ||
182 | #endif | ||
183 | |||
184 | #ifndef OPENSSL_NO_SHA512 | ||
185 | int SHA384_Init(SHA512_CTX *c); | ||
186 | int SHA384_Update(SHA512_CTX *c, const void *data, size_t len); | ||
187 | int SHA384_Final(unsigned char *md, SHA512_CTX *c); | ||
188 | unsigned char *SHA384(const unsigned char *d, size_t n,unsigned char *md); | ||
189 | int SHA512_Init(SHA512_CTX *c); | ||
190 | int SHA512_Update(SHA512_CTX *c, const void *data, size_t len); | ||
191 | int SHA512_Final(unsigned char *md, SHA512_CTX *c); | ||
192 | unsigned char *SHA512(const unsigned char *d, size_t n,unsigned char *md); | ||
193 | void SHA512_Transform(SHA512_CTX *c, const unsigned char *data); | ||
194 | #endif | ||
195 | |||
124 | #ifdef __cplusplus | 196 | #ifdef __cplusplus |
125 | } | 197 | } |
126 | #endif | 198 | #endif |
diff --git a/src/lib/libcrypto/sha/sha1_one.c b/src/lib/libcrypto/sha/sha1_one.c index f4694b701b..7c65b60276 100644 --- a/src/lib/libcrypto/sha/sha1_one.c +++ b/src/lib/libcrypto/sha/sha1_one.c | |||
@@ -61,8 +61,8 @@ | |||
61 | #include <openssl/sha.h> | 61 | #include <openssl/sha.h> |
62 | #include <openssl/crypto.h> | 62 | #include <openssl/crypto.h> |
63 | 63 | ||
64 | #if !defined(OPENSSL_NO_SHA1) && !defined(OPENSSL_FIPS) | 64 | #ifndef OPENSSL_NO_SHA1 |
65 | unsigned char *SHA1(const unsigned char *d, unsigned long n, unsigned char *md) | 65 | unsigned char *SHA1(const unsigned char *d, size_t n, unsigned char *md) |
66 | { | 66 | { |
67 | SHA_CTX c; | 67 | SHA_CTX c; |
68 | static unsigned char m[SHA_DIGEST_LENGTH]; | 68 | static unsigned char m[SHA_DIGEST_LENGTH]; |
diff --git a/src/lib/libcrypto/sha/sha1dgst.c b/src/lib/libcrypto/sha/sha1dgst.c index 1e2009b760..50d1925cde 100644 --- a/src/lib/libcrypto/sha/sha1dgst.c +++ b/src/lib/libcrypto/sha/sha1dgst.c | |||
@@ -56,26 +56,19 @@ | |||
56 | * [including the GNU Public Licence.] | 56 | * [including the GNU Public Licence.] |
57 | */ | 57 | */ |
58 | 58 | ||
59 | #include <openssl/opensslconf.h> | ||
59 | #if !defined(OPENSSL_NO_SHA1) && !defined(OPENSSL_NO_SHA) | 60 | #if !defined(OPENSSL_NO_SHA1) && !defined(OPENSSL_NO_SHA) |
60 | 61 | ||
61 | #undef SHA_0 | 62 | #undef SHA_0 |
62 | #define SHA_1 | 63 | #define SHA_1 |
63 | 64 | ||
64 | #include <openssl/opensslv.h> | 65 | #include <openssl/opensslv.h> |
65 | #include <openssl/opensslconf.h> | ||
66 | 66 | ||
67 | #ifndef OPENSSL_FIPS | 67 | const char SHA1_version[]="SHA1" OPENSSL_VERSION_PTEXT; |
68 | const char *SHA1_version="SHA1" OPENSSL_VERSION_PTEXT; | ||
69 | 68 | ||
70 | /* The implementation is in ../md32_common.h */ | 69 | /* The implementation is in ../md32_common.h */ |
71 | 70 | ||
72 | #include "sha_locl.h" | 71 | #include "sha_locl.h" |
73 | 72 | ||
74 | #else /* ndef OPENSSL_FIPS */ | ||
75 | |||
76 | static void *dummy=&dummy; | ||
77 | |||
78 | #endif /* ndef OPENSSL_FIPS */ | ||
79 | |||
80 | #endif | 73 | #endif |
81 | 74 | ||
diff --git a/src/lib/libcrypto/sha/sha1test.c b/src/lib/libcrypto/sha/sha1test.c index 4f2e4ada2d..6feb3964c7 100644 --- a/src/lib/libcrypto/sha/sha1test.c +++ b/src/lib/libcrypto/sha/sha1test.c | |||
@@ -106,7 +106,7 @@ static char *pt(unsigned char *md); | |||
106 | int main(int argc, char *argv[]) | 106 | int main(int argc, char *argv[]) |
107 | { | 107 | { |
108 | int i,err=0; | 108 | int i,err=0; |
109 | unsigned char **P,**R; | 109 | char **P,**R; |
110 | static unsigned char buf[1000]; | 110 | static unsigned char buf[1000]; |
111 | char *p,*r; | 111 | char *p,*r; |
112 | EVP_MD_CTX c; | 112 | EVP_MD_CTX c; |
@@ -118,12 +118,12 @@ int main(int argc, char *argv[]) | |||
118 | #endif | 118 | #endif |
119 | 119 | ||
120 | EVP_MD_CTX_init(&c); | 120 | EVP_MD_CTX_init(&c); |
121 | P=(unsigned char **)test; | 121 | P=test; |
122 | R=(unsigned char **)ret; | 122 | R=ret; |
123 | i=1; | 123 | i=1; |
124 | while (*P != NULL) | 124 | while (*P != NULL) |
125 | { | 125 | { |
126 | EVP_Digest(*P,(unsigned long)strlen((char *)*P),md,NULL,EVP_sha1(), NULL); | 126 | EVP_Digest(*P,strlen((char *)*P),md,NULL,EVP_sha1(), NULL); |
127 | p=pt(md); | 127 | p=pt(md); |
128 | if (strcmp(p,(char *)*R) != 0) | 128 | if (strcmp(p,(char *)*R) != 0) |
129 | { | 129 | { |
@@ -157,6 +157,10 @@ int main(int argc, char *argv[]) | |||
157 | } | 157 | } |
158 | else | 158 | else |
159 | printf("test 3 ok\n"); | 159 | printf("test 3 ok\n"); |
160 | |||
161 | #ifdef OPENSSL_SYS_NETWARE | ||
162 | if (err) printf("ERROR: %d\n", err); | ||
163 | #endif | ||
160 | EXIT(err); | 164 | EXIT(err); |
161 | EVP_MD_CTX_cleanup(&c); | 165 | EVP_MD_CTX_cleanup(&c); |
162 | return(0); | 166 | return(0); |
diff --git a/src/lib/libcrypto/sha/sha_dgst.c b/src/lib/libcrypto/sha/sha_dgst.c index 5a4b3ab204..70eb56032c 100644 --- a/src/lib/libcrypto/sha/sha_dgst.c +++ b/src/lib/libcrypto/sha/sha_dgst.c | |||
@@ -56,6 +56,7 @@ | |||
56 | * [including the GNU Public Licence.] | 56 | * [including the GNU Public Licence.] |
57 | */ | 57 | */ |
58 | 58 | ||
59 | #include <openssl/opensslconf.h> | ||
59 | #if !defined(OPENSSL_NO_SHA0) && !defined(OPENSSL_NO_SHA) | 60 | #if !defined(OPENSSL_NO_SHA0) && !defined(OPENSSL_NO_SHA) |
60 | 61 | ||
61 | #undef SHA_1 | 62 | #undef SHA_1 |
@@ -63,7 +64,7 @@ | |||
63 | 64 | ||
64 | #include <openssl/opensslv.h> | 65 | #include <openssl/opensslv.h> |
65 | 66 | ||
66 | const char *SHA_version="SHA" OPENSSL_VERSION_PTEXT; | 67 | const char SHA_version[]="SHA" OPENSSL_VERSION_PTEXT; |
67 | 68 | ||
68 | /* The implementation is in ../md32_common.h */ | 69 | /* The implementation is in ../md32_common.h */ |
69 | 70 | ||
diff --git a/src/lib/libcrypto/sha/sha_locl.h b/src/lib/libcrypto/sha/sha_locl.h index a3623f72da..e37e5726e3 100644 --- a/src/lib/libcrypto/sha/sha_locl.h +++ b/src/lib/libcrypto/sha/sha_locl.h | |||
@@ -62,17 +62,11 @@ | |||
62 | #include <openssl/opensslconf.h> | 62 | #include <openssl/opensslconf.h> |
63 | #include <openssl/sha.h> | 63 | #include <openssl/sha.h> |
64 | 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 | 65 | #define DATA_ORDER_IS_BIG_ENDIAN |
70 | 66 | ||
71 | #define HASH_LONG SHA_LONG | 67 | #define HASH_LONG SHA_LONG |
72 | #define HASH_LONG_LOG2 SHA_LONG_LOG2 | ||
73 | #define HASH_CTX SHA_CTX | 68 | #define HASH_CTX SHA_CTX |
74 | #define HASH_CBLOCK SHA_CBLOCK | 69 | #define HASH_CBLOCK SHA_CBLOCK |
75 | #define HASH_LBLOCK SHA_LBLOCK | ||
76 | #define HASH_MAKE_STRING(c,s) do { \ | 70 | #define HASH_MAKE_STRING(c,s) do { \ |
77 | unsigned long ll; \ | 71 | unsigned long ll; \ |
78 | ll=(c)->h0; HOST_l2c(ll,(s)); \ | 72 | ll=(c)->h0; HOST_l2c(ll,(s)); \ |
@@ -88,12 +82,10 @@ | |||
88 | # define HASH_TRANSFORM SHA_Transform | 82 | # define HASH_TRANSFORM SHA_Transform |
89 | # define HASH_FINAL SHA_Final | 83 | # define HASH_FINAL SHA_Final |
90 | # define HASH_INIT SHA_Init | 84 | # 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 | 85 | # define HASH_BLOCK_DATA_ORDER sha_block_data_order |
93 | # define Xupdate(a,ix,ia,ib,ic,id) (ix=(a)=(ia^ib^ic^id)) | 86 | # define Xupdate(a,ix,ia,ib,ic,id) (ix=(a)=(ia^ib^ic^id)) |
94 | 87 | ||
95 | void sha_block_host_order (SHA_CTX *c, const void *p,int num); | 88 | static void sha_block_data_order (SHA_CTX *c, const void *p,size_t num); |
96 | void sha_block_data_order (SHA_CTX *c, const void *p,int num); | ||
97 | 89 | ||
98 | #elif defined(SHA_1) | 90 | #elif defined(SHA_1) |
99 | 91 | ||
@@ -101,7 +93,6 @@ | |||
101 | # define HASH_TRANSFORM SHA1_Transform | 93 | # define HASH_TRANSFORM SHA1_Transform |
102 | # define HASH_FINAL SHA1_Final | 94 | # define HASH_FINAL SHA1_Final |
103 | # define HASH_INIT SHA1_Init | 95 | # 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 | 96 | # define HASH_BLOCK_DATA_ORDER sha1_block_data_order |
106 | # if defined(__MWERKS__) && defined(__MC68K__) | 97 | # if defined(__MWERKS__) && defined(__MC68K__) |
107 | /* Metrowerks for Motorola fails otherwise:-( <appro@fy.chalmers.se> */ | 98 | /* Metrowerks for Motorola fails otherwise:-( <appro@fy.chalmers.se> */ |
@@ -114,22 +105,10 @@ | |||
114 | ) | 105 | ) |
115 | # endif | 106 | # endif |
116 | 107 | ||
117 | # ifdef SHA1_ASM | 108 | #ifndef SHA1_ASM |
118 | # if defined(__i386) || defined(__i386__) || defined(_M_IX86) || defined(__INTEL__) | 109 | static |
119 | # define sha1_block_host_order sha1_block_asm_host_order | 110 | #endif |
120 | # define DONT_IMPLEMENT_BLOCK_HOST_ORDER | 111 | void sha1_block_data_order (SHA_CTX *c, const void *p,size_t num); |
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 | # elif defined(__ia64) || defined(__ia64__) || defined(_M_IA64) | ||
125 | # define sha1_block_host_order sha1_block_asm_host_order | ||
126 | # define DONT_IMPLEMENT_BLOCK_HOST_ORDER | ||
127 | # define sha1_block_data_order sha1_block_asm_data_order | ||
128 | # define DONT_IMPLEMENT_BLOCK_DATA_ORDER | ||
129 | # endif | ||
130 | # endif | ||
131 | void sha1_block_host_order (SHA_CTX *c, const void *p,int num); | ||
132 | void sha1_block_data_order (SHA_CTX *c, const void *p,int num); | ||
133 | 112 | ||
134 | #else | 113 | #else |
135 | # error "Either SHA_0 or SHA_1 must be defined." | 114 | # error "Either SHA_0 or SHA_1 must be defined." |
@@ -143,11 +122,7 @@ | |||
143 | #define INIT_DATA_h3 0x10325476UL | 122 | #define INIT_DATA_h3 0x10325476UL |
144 | #define INIT_DATA_h4 0xc3d2e1f0UL | 123 | #define INIT_DATA_h4 0xc3d2e1f0UL |
145 | 124 | ||
146 | #if defined(SHA_0) && defined(OPENSSL_FIPS) | ||
147 | FIPS_NON_FIPS_MD_Init(SHA) | ||
148 | #else | ||
149 | int HASH_INIT (SHA_CTX *c) | 125 | int HASH_INIT (SHA_CTX *c) |
150 | #endif | ||
151 | { | 126 | { |
152 | c->h0=INIT_DATA_h0; | 127 | c->h0=INIT_DATA_h0; |
153 | c->h1=INIT_DATA_h1; | 128 | c->h1=INIT_DATA_h1; |
@@ -177,6 +152,8 @@ int HASH_INIT (SHA_CTX *c) | |||
177 | #define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d))) | 152 | #define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d))) |
178 | #define F_60_79(b,c,d) F_20_39(b,c,d) | 153 | #define F_60_79(b,c,d) F_20_39(b,c,d) |
179 | 154 | ||
155 | #ifndef OPENSSL_SMALL_FOOTPRINT | ||
156 | |||
180 | #define BODY_00_15(i,a,b,c,d,e,f,xi) \ | 157 | #define BODY_00_15(i,a,b,c,d,e,f,xi) \ |
181 | (f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \ | 158 | (f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \ |
182 | (b)=ROTATE((b),30); | 159 | (b)=ROTATE((b),30); |
@@ -229,11 +206,11 @@ int HASH_INIT (SHA_CTX *c) | |||
229 | # define X(i) XX[i] | 206 | # define X(i) XX[i] |
230 | #endif | 207 | #endif |
231 | 208 | ||
232 | #ifndef DONT_IMPLEMENT_BLOCK_HOST_ORDER | 209 | #if !defined(SHA_1) || !defined(SHA1_ASM) |
233 | void HASH_BLOCK_HOST_ORDER (SHA_CTX *c, const void *d, int num) | 210 | static void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, size_t num) |
234 | { | 211 | { |
235 | const SHA_LONG *W=d; | 212 | const unsigned char *data=p; |
236 | register unsigned MD32_REG_T A,B,C,D,E,T; | 213 | register unsigned MD32_REG_T A,B,C,D,E,T,l; |
237 | #ifndef MD32_XARRAY | 214 | #ifndef MD32_XARRAY |
238 | unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7, | 215 | unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7, |
239 | XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15; | 216 | XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15; |
@@ -248,41 +225,71 @@ void HASH_BLOCK_HOST_ORDER (SHA_CTX *c, const void *d, int num) | |||
248 | E=c->h4; | 225 | E=c->h4; |
249 | 226 | ||
250 | for (;;) | 227 | for (;;) |
228 | { | ||
229 | const union { long one; char little; } is_endian = {1}; | ||
230 | |||
231 | if (!is_endian.little && sizeof(SHA_LONG)==4 && ((size_t)p%4)==0) | ||
232 | { | ||
233 | const SHA_LONG *W=(const SHA_LONG *)data; | ||
234 | |||
235 | X( 0) = W[0]; X( 1) = W[ 1]; | ||
236 | BODY_00_15( 0,A,B,C,D,E,T,X( 0)); X( 2) = W[ 2]; | ||
237 | BODY_00_15( 1,T,A,B,C,D,E,X( 1)); X( 3) = W[ 3]; | ||
238 | BODY_00_15( 2,E,T,A,B,C,D,X( 2)); X( 4) = W[ 4]; | ||
239 | BODY_00_15( 3,D,E,T,A,B,C,X( 3)); X( 5) = W[ 5]; | ||
240 | BODY_00_15( 4,C,D,E,T,A,B,X( 4)); X( 6) = W[ 6]; | ||
241 | BODY_00_15( 5,B,C,D,E,T,A,X( 5)); X( 7) = W[ 7]; | ||
242 | BODY_00_15( 6,A,B,C,D,E,T,X( 6)); X( 8) = W[ 8]; | ||
243 | BODY_00_15( 7,T,A,B,C,D,E,X( 7)); X( 9) = W[ 9]; | ||
244 | BODY_00_15( 8,E,T,A,B,C,D,X( 8)); X(10) = W[10]; | ||
245 | BODY_00_15( 9,D,E,T,A,B,C,X( 9)); X(11) = W[11]; | ||
246 | BODY_00_15(10,C,D,E,T,A,B,X(10)); X(12) = W[12]; | ||
247 | BODY_00_15(11,B,C,D,E,T,A,X(11)); X(13) = W[13]; | ||
248 | BODY_00_15(12,A,B,C,D,E,T,X(12)); X(14) = W[14]; | ||
249 | BODY_00_15(13,T,A,B,C,D,E,X(13)); X(15) = W[15]; | ||
250 | BODY_00_15(14,E,T,A,B,C,D,X(14)); | ||
251 | BODY_00_15(15,D,E,T,A,B,C,X(15)); | ||
252 | |||
253 | data += SHA_CBLOCK; | ||
254 | } | ||
255 | else | ||
251 | { | 256 | { |
252 | BODY_00_15( 0,A,B,C,D,E,T,W[ 0]); | 257 | HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l; |
253 | BODY_00_15( 1,T,A,B,C,D,E,W[ 1]); | 258 | BODY_00_15( 0,A,B,C,D,E,T,X( 0)); HOST_c2l(data,l); X( 2)=l; |
254 | BODY_00_15( 2,E,T,A,B,C,D,W[ 2]); | 259 | BODY_00_15( 1,T,A,B,C,D,E,X( 1)); HOST_c2l(data,l); X( 3)=l; |
255 | BODY_00_15( 3,D,E,T,A,B,C,W[ 3]); | 260 | BODY_00_15( 2,E,T,A,B,C,D,X( 2)); HOST_c2l(data,l); X( 4)=l; |
256 | BODY_00_15( 4,C,D,E,T,A,B,W[ 4]); | 261 | BODY_00_15( 3,D,E,T,A,B,C,X( 3)); HOST_c2l(data,l); X( 5)=l; |
257 | BODY_00_15( 5,B,C,D,E,T,A,W[ 5]); | 262 | BODY_00_15( 4,C,D,E,T,A,B,X( 4)); HOST_c2l(data,l); X( 6)=l; |
258 | BODY_00_15( 6,A,B,C,D,E,T,W[ 6]); | 263 | BODY_00_15( 5,B,C,D,E,T,A,X( 5)); HOST_c2l(data,l); X( 7)=l; |
259 | BODY_00_15( 7,T,A,B,C,D,E,W[ 7]); | 264 | BODY_00_15( 6,A,B,C,D,E,T,X( 6)); HOST_c2l(data,l); X( 8)=l; |
260 | BODY_00_15( 8,E,T,A,B,C,D,W[ 8]); | 265 | BODY_00_15( 7,T,A,B,C,D,E,X( 7)); HOST_c2l(data,l); X( 9)=l; |
261 | BODY_00_15( 9,D,E,T,A,B,C,W[ 9]); | 266 | BODY_00_15( 8,E,T,A,B,C,D,X( 8)); HOST_c2l(data,l); X(10)=l; |
262 | BODY_00_15(10,C,D,E,T,A,B,W[10]); | 267 | BODY_00_15( 9,D,E,T,A,B,C,X( 9)); HOST_c2l(data,l); X(11)=l; |
263 | BODY_00_15(11,B,C,D,E,T,A,W[11]); | 268 | BODY_00_15(10,C,D,E,T,A,B,X(10)); HOST_c2l(data,l); X(12)=l; |
264 | BODY_00_15(12,A,B,C,D,E,T,W[12]); | 269 | BODY_00_15(11,B,C,D,E,T,A,X(11)); HOST_c2l(data,l); X(13)=l; |
265 | BODY_00_15(13,T,A,B,C,D,E,W[13]); | 270 | BODY_00_15(12,A,B,C,D,E,T,X(12)); HOST_c2l(data,l); X(14)=l; |
266 | BODY_00_15(14,E,T,A,B,C,D,W[14]); | 271 | BODY_00_15(13,T,A,B,C,D,E,X(13)); HOST_c2l(data,l); X(15)=l; |
267 | BODY_00_15(15,D,E,T,A,B,C,W[15]); | 272 | BODY_00_15(14,E,T,A,B,C,D,X(14)); |
268 | 273 | BODY_00_15(15,D,E,T,A,B,C,X(15)); | |
269 | BODY_16_19(16,C,D,E,T,A,B,X( 0),W[ 0],W[ 2],W[ 8],W[13]); | 274 | } |
270 | BODY_16_19(17,B,C,D,E,T,A,X( 1),W[ 1],W[ 3],W[ 9],W[14]); | 275 | |
271 | BODY_16_19(18,A,B,C,D,E,T,X( 2),W[ 2],W[ 4],W[10],W[15]); | 276 | BODY_16_19(16,C,D,E,T,A,B,X( 0),X( 0),X( 2),X( 8),X(13)); |
272 | BODY_16_19(19,T,A,B,C,D,E,X( 3),W[ 3],W[ 5],W[11],X( 0)); | 277 | BODY_16_19(17,B,C,D,E,T,A,X( 1),X( 1),X( 3),X( 9),X(14)); |
273 | 278 | BODY_16_19(18,A,B,C,D,E,T,X( 2),X( 2),X( 4),X(10),X(15)); | |
274 | BODY_20_31(20,E,T,A,B,C,D,X( 4),W[ 4],W[ 6],W[12],X( 1)); | 279 | BODY_16_19(19,T,A,B,C,D,E,X( 3),X( 3),X( 5),X(11),X( 0)); |
275 | BODY_20_31(21,D,E,T,A,B,C,X( 5),W[ 5],W[ 7],W[13],X( 2)); | 280 | |
276 | BODY_20_31(22,C,D,E,T,A,B,X( 6),W[ 6],W[ 8],W[14],X( 3)); | 281 | BODY_20_31(20,E,T,A,B,C,D,X( 4),X( 4),X( 6),X(12),X( 1)); |
277 | BODY_20_31(23,B,C,D,E,T,A,X( 7),W[ 7],W[ 9],W[15],X( 4)); | 282 | BODY_20_31(21,D,E,T,A,B,C,X( 5),X( 5),X( 7),X(13),X( 2)); |
278 | BODY_20_31(24,A,B,C,D,E,T,X( 8),W[ 8],W[10],X( 0),X( 5)); | 283 | BODY_20_31(22,C,D,E,T,A,B,X( 6),X( 6),X( 8),X(14),X( 3)); |
279 | BODY_20_31(25,T,A,B,C,D,E,X( 9),W[ 9],W[11],X( 1),X( 6)); | 284 | BODY_20_31(23,B,C,D,E,T,A,X( 7),X( 7),X( 9),X(15),X( 4)); |
280 | BODY_20_31(26,E,T,A,B,C,D,X(10),W[10],W[12],X( 2),X( 7)); | 285 | BODY_20_31(24,A,B,C,D,E,T,X( 8),X( 8),X(10),X( 0),X( 5)); |
281 | BODY_20_31(27,D,E,T,A,B,C,X(11),W[11],W[13],X( 3),X( 8)); | 286 | BODY_20_31(25,T,A,B,C,D,E,X( 9),X( 9),X(11),X( 1),X( 6)); |
282 | BODY_20_31(28,C,D,E,T,A,B,X(12),W[12],W[14],X( 4),X( 9)); | 287 | BODY_20_31(26,E,T,A,B,C,D,X(10),X(10),X(12),X( 2),X( 7)); |
283 | BODY_20_31(29,B,C,D,E,T,A,X(13),W[13],W[15],X( 5),X(10)); | 288 | BODY_20_31(27,D,E,T,A,B,C,X(11),X(11),X(13),X( 3),X( 8)); |
284 | BODY_20_31(30,A,B,C,D,E,T,X(14),W[14],X( 0),X( 6),X(11)); | 289 | BODY_20_31(28,C,D,E,T,A,B,X(12),X(12),X(14),X( 4),X( 9)); |
285 | BODY_20_31(31,T,A,B,C,D,E,X(15),W[15],X( 1),X( 7),X(12)); | 290 | BODY_20_31(29,B,C,D,E,T,A,X(13),X(13),X(15),X( 5),X(10)); |
291 | BODY_20_31(30,A,B,C,D,E,T,X(14),X(14),X( 0),X( 6),X(11)); | ||
292 | BODY_20_31(31,T,A,B,C,D,E,X(15),X(15),X( 1),X( 7),X(12)); | ||
286 | 293 | ||
287 | BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13)); | 294 | BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13)); |
288 | BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14)); | 295 | BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14)); |
@@ -341,7 +348,7 @@ void HASH_BLOCK_HOST_ORDER (SHA_CTX *c, const void *d, int num) | |||
341 | c->h3=(c->h3+B)&0xffffffffL; | 348 | c->h3=(c->h3+B)&0xffffffffL; |
342 | c->h4=(c->h4+C)&0xffffffffL; | 349 | c->h4=(c->h4+C)&0xffffffffL; |
343 | 350 | ||
344 | if (--num <= 0) break; | 351 | if (--num == 0) break; |
345 | 352 | ||
346 | A=c->h0; | 353 | A=c->h0; |
347 | B=c->h1; | 354 | B=c->h1; |
@@ -349,22 +356,48 @@ void HASH_BLOCK_HOST_ORDER (SHA_CTX *c, const void *d, int num) | |||
349 | D=c->h3; | 356 | D=c->h3; |
350 | E=c->h4; | 357 | E=c->h4; |
351 | 358 | ||
352 | W+=SHA_LBLOCK; | 359 | } |
353 | } | ||
354 | } | 360 | } |
355 | #endif | 361 | #endif |
356 | 362 | ||
357 | #ifndef DONT_IMPLEMENT_BLOCK_DATA_ORDER | 363 | #else /* OPENSSL_SMALL_FOOTPRINT */ |
358 | void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, int num) | 364 | |
365 | #define BODY_00_15(xi) do { \ | ||
366 | T=E+K_00_19+F_00_19(B,C,D); \ | ||
367 | E=D, D=C, C=ROTATE(B,30), B=A; \ | ||
368 | A=ROTATE(A,5)+T+xi; } while(0) | ||
369 | |||
370 | #define BODY_16_19(xa,xb,xc,xd) do { \ | ||
371 | Xupdate(T,xa,xa,xb,xc,xd); \ | ||
372 | T+=E+K_00_19+F_00_19(B,C,D); \ | ||
373 | E=D, D=C, C=ROTATE(B,30), B=A; \ | ||
374 | A=ROTATE(A,5)+T; } while(0) | ||
375 | |||
376 | #define BODY_20_39(xa,xb,xc,xd) do { \ | ||
377 | Xupdate(T,xa,xa,xb,xc,xd); \ | ||
378 | T+=E+K_20_39+F_20_39(B,C,D); \ | ||
379 | E=D, D=C, C=ROTATE(B,30), B=A; \ | ||
380 | A=ROTATE(A,5)+T; } while(0) | ||
381 | |||
382 | #define BODY_40_59(xa,xb,xc,xd) do { \ | ||
383 | Xupdate(T,xa,xa,xb,xc,xd); \ | ||
384 | T+=E+K_40_59+F_40_59(B,C,D); \ | ||
385 | E=D, D=C, C=ROTATE(B,30), B=A; \ | ||
386 | A=ROTATE(A,5)+T; } while(0) | ||
387 | |||
388 | #define BODY_60_79(xa,xb,xc,xd) do { \ | ||
389 | Xupdate(T,xa,xa,xb,xc,xd); \ | ||
390 | T=E+K_60_79+F_60_79(B,C,D); \ | ||
391 | E=D, D=C, C=ROTATE(B,30), B=A; \ | ||
392 | A=ROTATE(A,5)+T+xa; } while(0) | ||
393 | |||
394 | #if !defined(SHA_1) || !defined(SHA1_ASM) | ||
395 | static void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, size_t num) | ||
359 | { | 396 | { |
360 | const unsigned char *data=p; | 397 | const unsigned char *data=p; |
361 | register unsigned MD32_REG_T A,B,C,D,E,T,l; | 398 | register unsigned MD32_REG_T A,B,C,D,E,T,l; |
362 | #ifndef MD32_XARRAY | 399 | int i; |
363 | unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7, | 400 | SHA_LONG X[16]; |
364 | XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15; | ||
365 | #else | ||
366 | SHA_LONG XX[16]; | ||
367 | #endif | ||
368 | 401 | ||
369 | A=c->h0; | 402 | A=c->h0; |
370 | B=c->h1; | 403 | B=c->h1; |
@@ -374,101 +407,24 @@ void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, int num) | |||
374 | 407 | ||
375 | for (;;) | 408 | for (;;) |
376 | { | 409 | { |
377 | 410 | for (i=0;i<16;i++) | |
378 | HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l; | 411 | { HOST_c2l(data,l); X[i]=l; BODY_00_15(X[i]); } |
379 | BODY_00_15( 0,A,B,C,D,E,T,X( 0)); HOST_c2l(data,l); X( 2)=l; | 412 | for (i=0;i<4;i++) |
380 | BODY_00_15( 1,T,A,B,C,D,E,X( 1)); HOST_c2l(data,l); X( 3)=l; | 413 | { BODY_16_19(X[i], X[i+2], X[i+8], X[(i+13)&15]); } |
381 | BODY_00_15( 2,E,T,A,B,C,D,X( 2)); HOST_c2l(data,l); X( 4)=l; | 414 | for (;i<24;i++) |
382 | BODY_00_15( 3,D,E,T,A,B,C,X( 3)); HOST_c2l(data,l); X( 5)=l; | 415 | { BODY_20_39(X[i&15], X[(i+2)&15], X[(i+8)&15],X[(i+13)&15]); } |
383 | BODY_00_15( 4,C,D,E,T,A,B,X( 4)); HOST_c2l(data,l); X( 6)=l; | 416 | for (i=0;i<20;i++) |
384 | BODY_00_15( 5,B,C,D,E,T,A,X( 5)); HOST_c2l(data,l); X( 7)=l; | 417 | { BODY_40_59(X[(i+8)&15],X[(i+10)&15],X[i&15], X[(i+5)&15]); } |
385 | BODY_00_15( 6,A,B,C,D,E,T,X( 6)); HOST_c2l(data,l); X( 8)=l; | 418 | for (i=4;i<24;i++) |
386 | BODY_00_15( 7,T,A,B,C,D,E,X( 7)); HOST_c2l(data,l); X( 9)=l; | 419 | { BODY_60_79(X[(i+8)&15],X[(i+10)&15],X[i&15], X[(i+5)&15]); } |
387 | BODY_00_15( 8,E,T,A,B,C,D,X( 8)); HOST_c2l(data,l); X(10)=l; | 420 | |
388 | BODY_00_15( 9,D,E,T,A,B,C,X( 9)); HOST_c2l(data,l); X(11)=l; | 421 | c->h0=(c->h0+A)&0xffffffffL; |
389 | BODY_00_15(10,C,D,E,T,A,B,X(10)); HOST_c2l(data,l); X(12)=l; | 422 | c->h1=(c->h1+B)&0xffffffffL; |
390 | BODY_00_15(11,B,C,D,E,T,A,X(11)); HOST_c2l(data,l); X(13)=l; | 423 | c->h2=(c->h2+C)&0xffffffffL; |
391 | BODY_00_15(12,A,B,C,D,E,T,X(12)); HOST_c2l(data,l); X(14)=l; | 424 | c->h3=(c->h3+D)&0xffffffffL; |
392 | BODY_00_15(13,T,A,B,C,D,E,X(13)); HOST_c2l(data,l); X(15)=l; | 425 | c->h4=(c->h4+E)&0xffffffffL; |
393 | BODY_00_15(14,E,T,A,B,C,D,X(14)); | 426 | |
394 | BODY_00_15(15,D,E,T,A,B,C,X(15)); | 427 | if (--num == 0) break; |
395 | |||
396 | BODY_16_19(16,C,D,E,T,A,B,X( 0),X( 0),X( 2),X( 8),X(13)); | ||
397 | BODY_16_19(17,B,C,D,E,T,A,X( 1),X( 1),X( 3),X( 9),X(14)); | ||
398 | BODY_16_19(18,A,B,C,D,E,T,X( 2),X( 2),X( 4),X(10),X(15)); | ||
399 | BODY_16_19(19,T,A,B,C,D,E,X( 3),X( 3),X( 5),X(11),X( 0)); | ||
400 | |||
401 | BODY_20_31(20,E,T,A,B,C,D,X( 4),X( 4),X( 6),X(12),X( 1)); | ||
402 | BODY_20_31(21,D,E,T,A,B,C,X( 5),X( 5),X( 7),X(13),X( 2)); | ||
403 | BODY_20_31(22,C,D,E,T,A,B,X( 6),X( 6),X( 8),X(14),X( 3)); | ||
404 | BODY_20_31(23,B,C,D,E,T,A,X( 7),X( 7),X( 9),X(15),X( 4)); | ||
405 | BODY_20_31(24,A,B,C,D,E,T,X( 8),X( 8),X(10),X( 0),X( 5)); | ||
406 | BODY_20_31(25,T,A,B,C,D,E,X( 9),X( 9),X(11),X( 1),X( 6)); | ||
407 | BODY_20_31(26,E,T,A,B,C,D,X(10),X(10),X(12),X( 2),X( 7)); | ||
408 | BODY_20_31(27,D,E,T,A,B,C,X(11),X(11),X(13),X( 3),X( 8)); | ||
409 | BODY_20_31(28,C,D,E,T,A,B,X(12),X(12),X(14),X( 4),X( 9)); | ||
410 | BODY_20_31(29,B,C,D,E,T,A,X(13),X(13),X(15),X( 5),X(10)); | ||
411 | BODY_20_31(30,A,B,C,D,E,T,X(14),X(14),X( 0),X( 6),X(11)); | ||
412 | BODY_20_31(31,T,A,B,C,D,E,X(15),X(15),X( 1),X( 7),X(12)); | ||
413 | |||
414 | BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13)); | ||
415 | BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14)); | ||
416 | BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15)); | ||
417 | BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0)); | ||
418 | BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1)); | ||
419 | BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2)); | ||
420 | BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3)); | ||
421 | BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4)); | ||
422 | |||
423 | BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5)); | ||
424 | BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6)); | ||
425 | BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7)); | ||
426 | BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8)); | ||
427 | BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9)); | ||
428 | BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10)); | ||
429 | BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11)); | ||
430 | BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12)); | ||
431 | BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13)); | ||
432 | BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14)); | ||
433 | BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15)); | ||
434 | BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0)); | ||
435 | BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1)); | ||
436 | BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2)); | ||
437 | BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3)); | ||
438 | BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4)); | ||
439 | BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5)); | ||
440 | BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6)); | ||
441 | BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7)); | ||
442 | BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8)); | ||
443 | |||
444 | BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9)); | ||
445 | BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10)); | ||
446 | BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11)); | ||
447 | BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12)); | ||
448 | BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13)); | ||
449 | BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14)); | ||
450 | BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15)); | ||
451 | BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0)); | ||
452 | BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1)); | ||
453 | BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2)); | ||
454 | BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3)); | ||
455 | BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4)); | ||
456 | BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5)); | ||
457 | BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6)); | ||
458 | BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7)); | ||
459 | BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8)); | ||
460 | BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9)); | ||
461 | BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10)); | ||
462 | BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11)); | ||
463 | BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12)); | ||
464 | |||
465 | c->h0=(c->h0+E)&0xffffffffL; | ||
466 | c->h1=(c->h1+T)&0xffffffffL; | ||
467 | c->h2=(c->h2+A)&0xffffffffL; | ||
468 | c->h3=(c->h3+B)&0xffffffffL; | ||
469 | c->h4=(c->h4+C)&0xffffffffL; | ||
470 | |||
471 | if (--num <= 0) break; | ||
472 | 428 | ||
473 | A=c->h0; | 429 | A=c->h0; |
474 | B=c->h1; | 430 | B=c->h1; |
@@ -479,3 +435,5 @@ void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, int num) | |||
479 | } | 435 | } |
480 | } | 436 | } |
481 | #endif | 437 | #endif |
438 | |||
439 | #endif | ||
diff --git a/src/lib/libcrypto/sha/sha_one.c b/src/lib/libcrypto/sha/sha_one.c index d4f4d344df..3bae623ce8 100644 --- a/src/lib/libcrypto/sha/sha_one.c +++ b/src/lib/libcrypto/sha/sha_one.c | |||
@@ -62,7 +62,7 @@ | |||
62 | #include <openssl/crypto.h> | 62 | #include <openssl/crypto.h> |
63 | 63 | ||
64 | #ifndef OPENSSL_NO_SHA0 | 64 | #ifndef OPENSSL_NO_SHA0 |
65 | unsigned char *SHA(const unsigned char *d, unsigned long n, unsigned char *md) | 65 | unsigned char *SHA(const unsigned char *d, size_t n, unsigned char *md) |
66 | { | 66 | { |
67 | SHA_CTX c; | 67 | SHA_CTX c; |
68 | static unsigned char m[SHA_DIGEST_LENGTH]; | 68 | static unsigned char m[SHA_DIGEST_LENGTH]; |
diff --git a/src/lib/libcrypto/sha/shatest.c b/src/lib/libcrypto/sha/shatest.c index ff702aa53e..ed0fe06a7b 100644 --- a/src/lib/libcrypto/sha/shatest.c +++ b/src/lib/libcrypto/sha/shatest.c | |||
@@ -106,7 +106,7 @@ static char *pt(unsigned char *md); | |||
106 | int main(int argc, char *argv[]) | 106 | int main(int argc, char *argv[]) |
107 | { | 107 | { |
108 | int i,err=0; | 108 | int i,err=0; |
109 | unsigned char **P,**R; | 109 | char **P,**R; |
110 | static unsigned char buf[1000]; | 110 | static unsigned char buf[1000]; |
111 | char *p,*r; | 111 | char *p,*r; |
112 | EVP_MD_CTX c; | 112 | EVP_MD_CTX c; |
@@ -118,12 +118,12 @@ int main(int argc, char *argv[]) | |||
118 | #endif | 118 | #endif |
119 | 119 | ||
120 | EVP_MD_CTX_init(&c); | 120 | EVP_MD_CTX_init(&c); |
121 | P=(unsigned char **)test; | 121 | P=test; |
122 | R=(unsigned char **)ret; | 122 | R=ret; |
123 | i=1; | 123 | i=1; |
124 | while (*P != NULL) | 124 | while (*P != NULL) |
125 | { | 125 | { |
126 | EVP_Digest(*P,(unsigned long)strlen((char *)*P),md,NULL,EVP_sha(), NULL); | 126 | EVP_Digest(*P,strlen((char *)*P),md,NULL,EVP_sha(), NULL); |
127 | p=pt(md); | 127 | p=pt(md); |
128 | if (strcmp(p,(char *)*R) != 0) | 128 | if (strcmp(p,(char *)*R) != 0) |
129 | { | 129 | { |
@@ -157,6 +157,10 @@ int main(int argc, char *argv[]) | |||
157 | } | 157 | } |
158 | else | 158 | else |
159 | printf("test 3 ok\n"); | 159 | printf("test 3 ok\n"); |
160 | |||
161 | #ifdef OPENSSL_SYS_NETWARE | ||
162 | if (err) printf("ERROR: %d\n", err); | ||
163 | #endif | ||
160 | EVP_MD_CTX_cleanup(&c); | 164 | EVP_MD_CTX_cleanup(&c); |
161 | EXIT(err); | 165 | EXIT(err); |
162 | return(0); | 166 | return(0); |