GCC Code Coverage Report
Directory: ./ Exec Total Coverage
File: lib/libcrypto/crypto/../../libssl/src/crypto/sha/sha_locl.h Lines: 8 8 100.0 %
Date: 2016-12-06 Branches: 0 0 0.0 %

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