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/openssl_sha.h"
63
64 #define DATA_ORDER_IS_BIG_ENDIAN
65
66 #define HASH_LONG SHA_LONG
67 #define HASH_CTX SHA_CTX
68 #define HASH_CBLOCK SHA_CBLOCK
69 #define HASH_MAKE_STRING(c,s) do { \
70 unsigned long ll; \
71 ll=(c)->h0; HOST_l2c(ll,(s)); \
72 ll=(c)->h1; HOST_l2c(ll,(s)); \
73 ll=(c)->h2; HOST_l2c(ll,(s)); \
74 ll=(c)->h3; HOST_l2c(ll,(s)); \
75 ll=(c)->h4; HOST_l2c(ll,(s)); \
76 } while (0)
77
78 #if defined(SHA_0)
79
80 # define HASH_UPDATE SHA_Update
81 # define HASH_TRANSFORM SHA_Transform
82 # define HASH_FINAL SHA_Final
83 # define HASH_INIT SHA_Init
84 # define HASH_BLOCK_DATA_ORDER sha_block_data_order
85 # define Xupdate(a,ix,ia,ib,ic,id) (ix=(a)=(ia^ib^ic^id))
86
87 static void sha_block_data_order (SHA_CTX *c, const void *p,size_t num);
88
89 #elif defined(SHA_1)
90
91 # define HASH_UPDATE SHA1_Update
92 # define HASH_TRANSFORM SHA1_Transform
93 # define HASH_FINAL SHA1_Final
94 # define HASH_INIT SHA1_Init
95 # define HASH_BLOCK_DATA_ORDER sha1_block_data_order
96 # if defined(__MWERKS__) && defined(__MC68K__)
97 /* Metrowerks for Motorola fails otherwise:-( <appro@fy.chalmers.se> */
98 # define Xupdate(a,ix,ia,ib,ic,id) do { (a)=(ia^ib^ic^id); \
99 ix=(a)=ROTATE((a),1); \
100 } while (0)
101 # else
102 # define Xupdate(a,ix,ia,ib,ic,id) ( (a)=(ia^ib^ic^id), \
103 ix=(a)=ROTATE((a),1) \
104 )
105 # endif
106
107 #ifndef SHA1_ASM
108 static
109 #endif
110 void sha1_block_data_order (SHA_CTX *c, const void *p,size_t num);
111
112 #else
113 # error "Either SHA_0 or SHA_1 must be defined."
114 #endif
115
116 #include "openssl_md32_common.h"
117
118 #define INIT_DATA_h0 0x67452301UL
119 #define INIT_DATA_h1 0xefcdab89UL
120 #define INIT_DATA_h2 0x98badcfeUL
121 #define INIT_DATA_h3 0x10325476UL
122 #define INIT_DATA_h4 0xc3d2e1f0UL
123
HASH_INIT(SHA_CTX * c)124 int HASH_INIT (SHA_CTX *c)
125 {
126 memset (c,0,sizeof(*c));
127 c->h0=INIT_DATA_h0;
128 c->h1=INIT_DATA_h1;
129 c->h2=INIT_DATA_h2;
130 c->h3=INIT_DATA_h3;
131 c->h4=INIT_DATA_h4;
132 return 1;
133 }
134
135 #define K_00_19 0x5a827999UL
136 #define K_20_39 0x6ed9eba1UL
137 #define K_40_59 0x8f1bbcdcUL
138 #define K_60_79 0xca62c1d6UL
139
140 /* As pointed out by Wei Dai <weidai@eskimo.com>, F() below can be
141 * simplified to the code in F_00_19. Wei attributes these optimisations
142 * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
143 * #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z)))
144 * I've just become aware of another tweak to be made, again from Wei Dai,
145 * in F_40_59, (x&a)|(y&a) -> (x|y)&a
146 */
147 #define F_00_19(b,c,d) ((((c) ^ (d)) & (b)) ^ (d))
148 #define F_20_39(b,c,d) ((b) ^ (c) ^ (d))
149 #define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d)))
150 #define F_60_79(b,c,d) F_20_39(b,c,d)
151
152 #ifndef OPENSSL_SMALL_FOOTPRINT
153
154 #define BODY_00_15(i,a,b,c,d,e,f,xi) \
155 (f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
156 (b)=ROTATE((b),30);
157
158 #define BODY_16_19(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
159 Xupdate(f,xi,xa,xb,xc,xd); \
160 (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
161 (b)=ROTATE((b),30);
162
163 #define BODY_20_31(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
164 Xupdate(f,xi,xa,xb,xc,xd); \
165 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
166 (b)=ROTATE((b),30);
167
168 #define BODY_32_39(i,a,b,c,d,e,f,xa,xb,xc,xd) \
169 Xupdate(f,xa,xa,xb,xc,xd); \
170 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
171 (b)=ROTATE((b),30);
172
173 #define BODY_40_59(i,a,b,c,d,e,f,xa,xb,xc,xd) \
174 Xupdate(f,xa,xa,xb,xc,xd); \
175 (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \
176 (b)=ROTATE((b),30);
177
178 #define BODY_60_79(i,a,b,c,d,e,f,xa,xb,xc,xd) \
179 Xupdate(f,xa,xa,xb,xc,xd); \
180 (f)=xa+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \
181 (b)=ROTATE((b),30);
182
183 #ifdef X
184 #undef X
185 #endif
186 #ifndef MD32_XARRAY
187 /*
188 * Originally X was an array. As it's automatic it's natural
189 * to expect RISC compiler to accomodate at least part of it in
190 * the register bank, isn't it? Unfortunately not all compilers
191 * "find" this expectation reasonable:-( On order to make such
192 * compilers generate better code I replace X[] with a bunch of
193 * X0, X1, etc. See the function body below...
194 * <appro@fy.chalmers.se>
195 */
196 # define X(i) XX##i
197 #else
198 /*
199 * However! Some compilers (most notably HP C) get overwhelmed by
200 * that many local variables so that we have to have the way to
201 * fall down to the original behavior.
202 */
203 # define X(i) XX[i]
204 #endif
205
206 #if !defined(SHA_1) || !defined(SHA1_ASM)
HASH_BLOCK_DATA_ORDER(SHA_CTX * c,const void * p,size_t num)207 static void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, size_t num)
208 {
209 const unsigned char *data=p;
210 register unsigned MD32_REG_T A,B,C,D,E,T,l;
211 #ifndef MD32_XARRAY
212 unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
213 XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
214 #else
215 SHA_LONG XX[16];
216 #endif
217
218 A=c->h0;
219 B=c->h1;
220 C=c->h2;
221 D=c->h3;
222 E=c->h4;
223
224 for (;;)
225 {
226 const union { long one; char little; } is_endian = {1};
227
228 if (!is_endian.little && sizeof(SHA_LONG)==4 && ((size_t)p%4)==0)
229 {
230 const SHA_LONG *W=(const SHA_LONG *)data;
231
232 X( 0) = W[0]; X( 1) = W[ 1];
233 BODY_00_15( 0,A,B,C,D,E,T,X( 0)); X( 2) = W[ 2];
234 BODY_00_15( 1,T,A,B,C,D,E,X( 1)); X( 3) = W[ 3];
235 BODY_00_15( 2,E,T,A,B,C,D,X( 2)); X( 4) = W[ 4];
236 BODY_00_15( 3,D,E,T,A,B,C,X( 3)); X( 5) = W[ 5];
237 BODY_00_15( 4,C,D,E,T,A,B,X( 4)); X( 6) = W[ 6];
238 BODY_00_15( 5,B,C,D,E,T,A,X( 5)); X( 7) = W[ 7];
239 BODY_00_15( 6,A,B,C,D,E,T,X( 6)); X( 8) = W[ 8];
240 BODY_00_15( 7,T,A,B,C,D,E,X( 7)); X( 9) = W[ 9];
241 BODY_00_15( 8,E,T,A,B,C,D,X( 8)); X(10) = W[10];
242 BODY_00_15( 9,D,E,T,A,B,C,X( 9)); X(11) = W[11];
243 BODY_00_15(10,C,D,E,T,A,B,X(10)); X(12) = W[12];
244 BODY_00_15(11,B,C,D,E,T,A,X(11)); X(13) = W[13];
245 BODY_00_15(12,A,B,C,D,E,T,X(12)); X(14) = W[14];
246 BODY_00_15(13,T,A,B,C,D,E,X(13)); X(15) = W[15];
247 BODY_00_15(14,E,T,A,B,C,D,X(14));
248 BODY_00_15(15,D,E,T,A,B,C,X(15));
249
250 data += SHA_CBLOCK;
251 }
252 else
253 {
254 HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l;
255 BODY_00_15( 0,A,B,C,D,E,T,X( 0)); HOST_c2l(data,l); X( 2)=l;
256 BODY_00_15( 1,T,A,B,C,D,E,X( 1)); HOST_c2l(data,l); X( 3)=l;
257 BODY_00_15( 2,E,T,A,B,C,D,X( 2)); HOST_c2l(data,l); X( 4)=l;
258 BODY_00_15( 3,D,E,T,A,B,C,X( 3)); HOST_c2l(data,l); X( 5)=l;
259 BODY_00_15( 4,C,D,E,T,A,B,X( 4)); HOST_c2l(data,l); X( 6)=l;
260 BODY_00_15( 5,B,C,D,E,T,A,X( 5)); HOST_c2l(data,l); X( 7)=l;
261 BODY_00_15( 6,A,B,C,D,E,T,X( 6)); HOST_c2l(data,l); X( 8)=l;
262 BODY_00_15( 7,T,A,B,C,D,E,X( 7)); HOST_c2l(data,l); X( 9)=l;
263 BODY_00_15( 8,E,T,A,B,C,D,X( 8)); HOST_c2l(data,l); X(10)=l;
264 BODY_00_15( 9,D,E,T,A,B,C,X( 9)); HOST_c2l(data,l); X(11)=l;
265 BODY_00_15(10,C,D,E,T,A,B,X(10)); HOST_c2l(data,l); X(12)=l;
266 BODY_00_15(11,B,C,D,E,T,A,X(11)); HOST_c2l(data,l); X(13)=l;
267 BODY_00_15(12,A,B,C,D,E,T,X(12)); HOST_c2l(data,l); X(14)=l;
268 BODY_00_15(13,T,A,B,C,D,E,X(13)); HOST_c2l(data,l); X(15)=l;
269 BODY_00_15(14,E,T,A,B,C,D,X(14));
270 BODY_00_15(15,D,E,T,A,B,C,X(15));
271 }
272
273 BODY_16_19(16,C,D,E,T,A,B,X( 0),X( 0),X( 2),X( 8),X(13));
274 BODY_16_19(17,B,C,D,E,T,A,X( 1),X( 1),X( 3),X( 9),X(14));
275 BODY_16_19(18,A,B,C,D,E,T,X( 2),X( 2),X( 4),X(10),X(15));
276 BODY_16_19(19,T,A,B,C,D,E,X( 3),X( 3),X( 5),X(11),X( 0));
277
278 BODY_20_31(20,E,T,A,B,C,D,X( 4),X( 4),X( 6),X(12),X( 1));
279 BODY_20_31(21,D,E,T,A,B,C,X( 5),X( 5),X( 7),X(13),X( 2));
280 BODY_20_31(22,C,D,E,T,A,B,X( 6),X( 6),X( 8),X(14),X( 3));
281 BODY_20_31(23,B,C,D,E,T,A,X( 7),X( 7),X( 9),X(15),X( 4));
282 BODY_20_31(24,A,B,C,D,E,T,X( 8),X( 8),X(10),X( 0),X( 5));
283 BODY_20_31(25,T,A,B,C,D,E,X( 9),X( 9),X(11),X( 1),X( 6));
284 BODY_20_31(26,E,T,A,B,C,D,X(10),X(10),X(12),X( 2),X( 7));
285 BODY_20_31(27,D,E,T,A,B,C,X(11),X(11),X(13),X( 3),X( 8));
286 BODY_20_31(28,C,D,E,T,A,B,X(12),X(12),X(14),X( 4),X( 9));
287 BODY_20_31(29,B,C,D,E,T,A,X(13),X(13),X(15),X( 5),X(10));
288 BODY_20_31(30,A,B,C,D,E,T,X(14),X(14),X( 0),X( 6),X(11));
289 BODY_20_31(31,T,A,B,C,D,E,X(15),X(15),X( 1),X( 7),X(12));
290
291 BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13));
292 BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14));
293 BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15));
294 BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0));
295 BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1));
296 BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2));
297 BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3));
298 BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4));
299
300 BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5));
301 BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6));
302 BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7));
303 BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8));
304 BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9));
305 BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10));
306 BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11));
307 BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12));
308 BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13));
309 BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14));
310 BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15));
311 BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0));
312 BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1));
313 BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2));
314 BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3));
315 BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4));
316 BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5));
317 BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6));
318 BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7));
319 BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8));
320
321 BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9));
322 BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10));
323 BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11));
324 BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12));
325 BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13));
326 BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14));
327 BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15));
328 BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0));
329 BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1));
330 BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2));
331 BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3));
332 BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4));
333 BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5));
334 BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6));
335 BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7));
336 BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8));
337 BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9));
338 BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10));
339 BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11));
340 BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12));
341
342 c->h0=(c->h0+E)&0xffffffffL;
343 c->h1=(c->h1+T)&0xffffffffL;
344 c->h2=(c->h2+A)&0xffffffffL;
345 c->h3=(c->h3+B)&0xffffffffL;
346 c->h4=(c->h4+C)&0xffffffffL;
347
348 if (--num == 0) break;
349
350 A=c->h0;
351 B=c->h1;
352 C=c->h2;
353 D=c->h3;
354 E=c->h4;
355
356 }
357 }
358 #endif
359
360 #else /* OPENSSL_SMALL_FOOTPRINT */
361
362 #define BODY_00_15(xi) do { \
363 T=E+K_00_19+F_00_19(B,C,D); \
364 E=D, D=C, C=ROTATE(B,30), B=A; \
365 A=ROTATE(A,5)+T+xi; } while(0)
366
367 #define BODY_16_19(xa,xb,xc,xd) do { \
368 Xupdate(T,xa,xa,xb,xc,xd); \
369 T+=E+K_00_19+F_00_19(B,C,D); \
370 E=D, D=C, C=ROTATE(B,30), B=A; \
371 A=ROTATE(A,5)+T; } while(0)
372
373 #define BODY_20_39(xa,xb,xc,xd) do { \
374 Xupdate(T,xa,xa,xb,xc,xd); \
375 T+=E+K_20_39+F_20_39(B,C,D); \
376 E=D, D=C, C=ROTATE(B,30), B=A; \
377 A=ROTATE(A,5)+T; } while(0)
378
379 #define BODY_40_59(xa,xb,xc,xd) do { \
380 Xupdate(T,xa,xa,xb,xc,xd); \
381 T+=E+K_40_59+F_40_59(B,C,D); \
382 E=D, D=C, C=ROTATE(B,30), B=A; \
383 A=ROTATE(A,5)+T; } while(0)
384
385 #define BODY_60_79(xa,xb,xc,xd) do { \
386 Xupdate(T,xa,xa,xb,xc,xd); \
387 T=E+K_60_79+F_60_79(B,C,D); \
388 E=D, D=C, C=ROTATE(B,30), B=A; \
389 A=ROTATE(A,5)+T+xa; } while(0)
390
391 #if !defined(SHA_1) || !defined(SHA1_ASM)
HASH_BLOCK_DATA_ORDER(SHA_CTX * c,const void * p,size_t num)392 static void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, size_t num)
393 {
394 const unsigned char *data=p;
395 register unsigned MD32_REG_T A,B,C,D,E,T,l;
396 int i;
397 SHA_LONG X[16];
398
399 A=c->h0;
400 B=c->h1;
401 C=c->h2;
402 D=c->h3;
403 E=c->h4;
404
405 for (;;)
406 {
407 for (i=0;i<16;i++)
408 { HOST_c2l(data,l); X[i]=l; BODY_00_15(X[i]); }
409 for (i=0;i<4;i++)
410 { BODY_16_19(X[i], X[i+2], X[i+8], X[(i+13)&15]); }
411 for (;i<24;i++)
412 { BODY_20_39(X[i&15], X[(i+2)&15], X[(i+8)&15],X[(i+13)&15]); }
413 for (i=0;i<20;i++)
414 { BODY_40_59(X[(i+8)&15],X[(i+10)&15],X[i&15], X[(i+5)&15]); }
415 for (i=4;i<24;i++)
416 { BODY_60_79(X[(i+8)&15],X[(i+10)&15],X[i&15], X[(i+5)&15]); }
417
418 c->h0=(c->h0+A)&0xffffffffL;
419 c->h1=(c->h1+B)&0xffffffffL;
420 c->h2=(c->h2+C)&0xffffffffL;
421 c->h3=(c->h3+D)&0xffffffffL;
422 c->h4=(c->h4+E)&0xffffffffL;
423
424 if (--num == 0) break;
425
426 A=c->h0;
427 B=c->h1;
428 C=c->h2;
429 D=c->h3;
430 E=c->h4;
431
432 }
433 }
434 #endif
435
436 #endif
437