No empty .Rs/.Re
[netbsd-mini2440.git] / sys / dev / pci / n8 / common / api / n8_precomp_sha_locl.h
blobadb642f0ff3d8a4dd99a8b6223766b377fd7bbad
1 /* crypto/sha/sha_locl.h */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3 * All rights reserved.
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).
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.
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)"
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.
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.]
58 03/06/02 brr Removed openssl includes.
59 02/22/02 spm Converted printf's to DBG's.
60 02/15/02 brr Modified include files to build in kernel context.
61 04/03/01 dws Original version, based on sha_locl.h. Provides private versions
62 of the SHA1 functions for the Simon behavioral model.
67 #define HMAC_DEBUG
69 #define NO_ASM
71 #include "n8_pub_types.h"
73 #ifndef SHA_LONG_LOG2
74 #define SHA_LONG_LOG2 2 /* default to 32 bits */
75 #endif
77 #define DATA_ORDER_IS_BIG_ENDIAN
79 #define HASH_LONG SHA_LONG
80 #define HASH_LONG_LOG2 SHA_LONG_LOG2
81 #define HASH_CTX SHA_CTX
82 #define HASH_CBLOCK SHA_CBLOCK
83 #define HASH_LBLOCK SHA_LBLOCK
84 #define HASH_MAKE_STRING(c,s) do { \
85 unsigned long ll; \
86 ll=(c)->h0; HOST_l2c(ll,(s)); \
87 ll=(c)->h1; HOST_l2c(ll,(s)); \
88 ll=(c)->h2; HOST_l2c(ll,(s)); \
89 ll=(c)->h3; HOST_l2c(ll,(s)); \
90 ll=(c)->h4; HOST_l2c(ll,(s)); \
91 } while (0)
93 #if defined(SHA_0)
95 # define HASH_UPDATE SHA_Update
96 # define HASH_TRANSFORM SHA_Transform
97 # define HASH_FINAL SHA_Final
98 # define HASH_INIT SHA_Init
99 # define HASH_BLOCK_HOST_ORDER sha_block_host_order
100 # define HASH_BLOCK_DATA_ORDER sha_block_data_order
101 # define Xupdate(a,ix,ia,ib,ic,id) (ix=(a)=(ia^ib^ic^id))
103 void sha_block_host_order (SHA_CTX *c, const void *p,int num);
104 void sha_block_data_order (SHA_CTX *c, const void *p,int num);
106 #elif defined(SHA_1)
108 # define HASH_UPDATE n8_precomp_SHA1_Update
109 # define HASH_TRANSFORM n8_precomp_SHA1_Transform
110 # define HASH_FINAL n8_precomp_SHA1_Final
111 # define HASH_INIT n8_precomp_SHA1_Init
112 # define HASH_BLOCK_HOST_ORDER n8_precomp_sha1_block_host_order
113 # define HASH_BLOCK_DATA_ORDER n8_precomp_sha1_block_data_order
114 # if defined(__MWERKS__) && defined(__MC68K__)
115 /* Metrowerks for Motorola fails otherwise:-( <appro@fy.chalmers.se> */
116 # define Xupdate(a,ix,ia,ib,ic,id) do { (a)=(ia^ib^ic^id); \
117 ix=(a)=ROTATE((a),1); \
118 } while (0)
119 # else
120 # define Xupdate(a,ix,ia,ib,ic,id) ( (a)=(ia^ib^ic^id), \
121 ix=(a)=ROTATE((a),1) \
123 # endif
125 # ifdef SHA1_ASM
126 # if defined(__i386) || defined(_M_IX86) || defined(__INTEL__)
127 # define sha1_block_host_order sha1_block_asm_host_order
128 # define DONT_IMPLEMENT_BLOCK_HOST_ORDER
129 # define sha1_block_data_order sha1_block_asm_data_order
130 # define DONT_IMPLEMENT_BLOCK_DATA_ORDER
131 # define HASH_BLOCK_DATA_ORDER_ALIGNED sha1_block_asm_data_order
132 # endif
133 # endif
134 void n8_precomp_sha1_block_host_order (SHA_CTX *c, const void *p,int num);
135 void n8_precomp_sha1_block_data_order (SHA_CTX *c, const void *p,int num);
137 #else
138 # error "Either SHA_0 or SHA_1 must be defined."
139 #endif
141 #include "md32_common.h"
143 #define INIT_DATA_h0 0x67452301UL
144 #define INIT_DATA_h1 0xefcdab89UL
145 #define INIT_DATA_h2 0x98badcfeUL
146 #define INIT_DATA_h3 0x10325476UL
147 #define INIT_DATA_h4 0xc3d2e1f0UL
149 void HASH_INIT (SHA_CTX *c);
150 void HASH_INIT (SHA_CTX *c)
152 c->h0=INIT_DATA_h0;
153 c->h1=INIT_DATA_h1;
154 c->h2=INIT_DATA_h2;
155 c->h3=INIT_DATA_h3;
156 c->h4=INIT_DATA_h4;
157 c->Nl=0;
158 c->Nh=0;
159 c->num=0;
162 #define K_00_19 0x5a827999UL
163 #define K_20_39 0x6ed9eba1UL
164 #define K_40_59 0x8f1bbcdcUL
165 #define K_60_79 0xca62c1d6UL
167 /* As pointed out by Wei Dai <weidai@eskimo.com>, F() below can be
168 * simplified to the code in F_00_19. Wei attributes these optimisations
169 * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
170 * #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z)))
171 * I've just become aware of another tweak to be made, again from Wei Dai,
172 * in F_40_59, (x&a)|(y&a) -> (x|y)&a
174 #define F_00_19(b,c,d) ((((c) ^ (d)) & (b)) ^ (d))
175 #define F_20_39(b,c,d) ((b) ^ (c) ^ (d))
176 #define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d)))
177 #define F_60_79(b,c,d) F_20_39(b,c,d)
179 #ifdef HMAC_DEBUG
180 #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)); \
182 (b)=ROTATE((b),30); \
183 DBG(("Step % 2d {A=%08lx B=%08lx C=%08lx D=%08lx E=%08lx T=%08lx}\n", i, A, B, C, D, E, T));
185 #define BODY_16_19(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
186 Xupdate(f,xi,xa,xb,xc,xd); \
187 (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
188 (b)=ROTATE((b),30); \
189 DBG(("Step % 2d {A=%08lx B=%08lx C=%08lx D=%08lx E=%08lx T=%08lx}\n", i, A, B, C, D, E, T));
191 #define BODY_20_31(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
192 Xupdate(f,xi,xa,xb,xc,xd); \
193 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
194 (b)=ROTATE((b),30); \
195 DBG(("Step % 2d {A=%08lx B=%08lx C=%08lx D=%08lx E=%08lx T=%08lx}\n", i, A, B, C, D, E, T));
197 #define BODY_32_39(i,a,b,c,d,e,f,xa,xb,xc,xd) \
198 Xupdate(f,xa,xa,xb,xc,xd); \
199 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
200 (b)=ROTATE((b),30); \
201 DBG(("Step % 2d {A=%08lx B=%08lx C=%08lx D=%08lx E=%08lx T=%08lx}\n", i, A, B, C, D, E, T));
203 #define BODY_40_59(i,a,b,c,d,e,f,xa,xb,xc,xd) \
204 Xupdate(f,xa,xa,xb,xc,xd); \
205 (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \
206 (b)=ROTATE((b),30); \
207 DBG(("Step % 2d {A=%08lx B=%08lx C=%08lx D=%08lx E=%08lx T=%08lx}\n", i, A, B, C, D, E, T));
209 #define BODY_60_79(i,a,b,c,d,e,f,xa,xb,xc,xd) \
210 Xupdate(f,xa,xa,xb,xc,xd); \
211 (f)=xa+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \
212 (b)=ROTATE((b),30); \
213 DBG(("Step % 2d {A=%08lx B=%08lx C=%08lx D=%08lx E=%08lx T=%08lx}\n", i, A, B, C, D, E, T));
214 #else
215 #define BODY_00_15(i,a,b,c,d,e,f,xi) \
216 (f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
217 (b)=ROTATE((b),30);
219 #define BODY_16_19(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
220 Xupdate(f,xi,xa,xb,xc,xd); \
221 (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
222 (b)=ROTATE((b),30);
224 #define BODY_20_31(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
225 Xupdate(f,xi,xa,xb,xc,xd); \
226 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
227 (b)=ROTATE((b),30);
229 #define BODY_32_39(i,a,b,c,d,e,f,xa,xb,xc,xd) \
230 Xupdate(f,xa,xa,xb,xc,xd); \
231 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
232 (b)=ROTATE((b),30);
234 #define BODY_40_59(i,a,b,c,d,e,f,xa,xb,xc,xd) \
235 Xupdate(f,xa,xa,xb,xc,xd); \
236 (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \
237 (b)=ROTATE((b),30);
239 #define BODY_60_79(i,a,b,c,d,e,f,xa,xb,xc,xd) \
240 Xupdate(f,xa,xa,xb,xc,xd); \
241 (f)=xa+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \
242 (b)=ROTATE((b),30);
243 #endif
245 #ifdef X
246 #undef X
247 #endif
248 #ifndef MD32_XARRAY
250 * Originally X was an array. As it's automatic it's natural
251 * to expect RISC compiler to accomodate at least part of it in
252 * the register bank, isn't it? Unfortunately not all compilers
253 * "find" this expectation reasonable:-( On order to make such
254 * compilers generate better code I replace X[] with a bunch of
255 * X0, X1, etc. See the function body below...
256 * <appro@fy.chalmers.se>
258 # define X(i) XX##i
259 #else
261 * However! Some compilers (most notably HP C) get overwhelmed by
262 * that many local variables so that we have to have the way to
263 * fall down to the original behavior.
265 # define X(i) XX[i]
266 #endif
268 #ifndef DONT_IMPLEMENT_BLOCK_HOST_ORDER
269 void HASH_BLOCK_HOST_ORDER (SHA_CTX *c, const void *d, int num);
270 void HASH_BLOCK_HOST_ORDER (SHA_CTX *c, const void *d, int num)
272 const SHA_LONG *W=d;
273 register unsigned long A,B,C,D,E,T;
274 #ifndef MD32_XARRAY
275 unsigned long XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
276 XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
277 #else
278 SHA_LONG XX[16];
279 #endif
281 #ifdef HMAC_DEBUG
282 DBG(("*********************************************************\n"));
283 DBG(("Entering sha1_block_host_order **************************\n"));
284 #endif
285 A=c->h0;
286 B=c->h1;
287 C=c->h2;
288 D=c->h3;
289 E=c->h4;
291 for (;;)
293 BODY_00_15( 0,A,B,C,D,E,T,W[ 0]);
294 BODY_00_15( 1,T,A,B,C,D,E,W[ 1]);
295 BODY_00_15( 2,E,T,A,B,C,D,W[ 2]);
296 BODY_00_15( 3,D,E,T,A,B,C,W[ 3]);
297 BODY_00_15( 4,C,D,E,T,A,B,W[ 4]);
298 BODY_00_15( 5,B,C,D,E,T,A,W[ 5]);
299 BODY_00_15( 6,A,B,C,D,E,T,W[ 6]);
300 BODY_00_15( 7,T,A,B,C,D,E,W[ 7]);
301 BODY_00_15( 8,E,T,A,B,C,D,W[ 8]);
302 BODY_00_15( 9,D,E,T,A,B,C,W[ 9]);
303 BODY_00_15(10,C,D,E,T,A,B,W[10]);
304 BODY_00_15(11,B,C,D,E,T,A,W[11]);
305 BODY_00_15(12,A,B,C,D,E,T,W[12]);
306 BODY_00_15(13,T,A,B,C,D,E,W[13]);
307 BODY_00_15(14,E,T,A,B,C,D,W[14]);
308 BODY_00_15(15,D,E,T,A,B,C,W[15]);
310 BODY_16_19(16,C,D,E,T,A,B,X( 0),W[ 0],W[ 2],W[ 8],W[13]);
311 BODY_16_19(17,B,C,D,E,T,A,X( 1),W[ 1],W[ 3],W[ 9],W[14]);
312 BODY_16_19(18,A,B,C,D,E,T,X( 2),W[ 2],W[ 4],W[10],W[15]);
313 BODY_16_19(19,T,A,B,C,D,E,X( 3),W[ 3],W[ 5],W[11],X( 0));
315 BODY_20_31(20,E,T,A,B,C,D,X( 4),W[ 4],W[ 6],W[12],X( 1));
316 BODY_20_31(21,D,E,T,A,B,C,X( 5),W[ 5],W[ 7],W[13],X( 2));
317 BODY_20_31(22,C,D,E,T,A,B,X( 6),W[ 6],W[ 8],W[14],X( 3));
318 BODY_20_31(23,B,C,D,E,T,A,X( 7),W[ 7],W[ 9],W[15],X( 4));
319 BODY_20_31(24,A,B,C,D,E,T,X( 8),W[ 8],W[10],X( 0),X( 5));
320 BODY_20_31(25,T,A,B,C,D,E,X( 9),W[ 9],W[11],X( 1),X( 6));
321 BODY_20_31(26,E,T,A,B,C,D,X(10),W[10],W[12],X( 2),X( 7));
322 BODY_20_31(27,D,E,T,A,B,C,X(11),W[11],W[13],X( 3),X( 8));
323 BODY_20_31(28,C,D,E,T,A,B,X(12),W[12],W[14],X( 4),X( 9));
324 BODY_20_31(29,B,C,D,E,T,A,X(13),W[13],W[15],X( 5),X(10));
325 BODY_20_31(30,A,B,C,D,E,T,X(14),W[14],X( 0),X( 6),X(11));
326 BODY_20_31(31,T,A,B,C,D,E,X(15),W[15],X( 1),X( 7),X(12));
328 BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13));
329 BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14));
330 BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15));
331 BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0));
332 BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1));
333 BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2));
334 BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3));
335 BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4));
337 BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5));
338 BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6));
339 BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7));
340 BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8));
341 BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9));
342 BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10));
343 BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11));
344 BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12));
345 BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13));
346 BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14));
347 BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15));
348 BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0));
349 BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1));
350 BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2));
351 BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3));
352 BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4));
353 BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5));
354 BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6));
355 BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7));
356 BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8));
358 BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9));
359 BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10));
360 BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11));
361 BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12));
362 BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13));
363 BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14));
364 BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15));
365 BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0));
366 BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1));
367 BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2));
368 BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3));
369 BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4));
370 BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5));
371 BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6));
372 BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7));
373 BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8));
374 BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9));
375 BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10));
376 BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11));
377 BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12));
379 c->h0=(c->h0+E)&0xffffffffL;
380 c->h1=(c->h1+T)&0xffffffffL;
381 c->h2=(c->h2+A)&0xffffffffL;
382 c->h3=(c->h3+B)&0xffffffffL;
383 c->h4=(c->h4+C)&0xffffffffL;
385 #ifdef HMAC_DEBUG
386 DBG(("Block end {h0=%08x h1=%08x h2=%08x h3=%08x h4=%08x}\n",
387 c->h0, c->h1, c->h2, c->h3, c->h4));
388 #endif
389 if (--num <= 0) break;
391 A=c->h0;
392 B=c->h1;
393 C=c->h2;
394 D=c->h3;
395 E=c->h4;
397 #ifdef HMAC_DEBUG
398 DBG(("Block end {A=%08lx B=%08lx C=%08lx D=%08lx E=%08lx}\n", A, B, C, D, E));
399 #endif
400 W+=SHA_LBLOCK;
402 #ifdef HMAC_DEBUG
403 DBG(("Leaving sha1_block_host_order ***************************\n"));
404 DBG(("*********************************************************\n"));
405 #endif
407 #endif
409 #ifndef DONT_IMPLEMENT_BLOCK_DATA_ORDER
410 void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, int num);
411 void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, int num)
413 const unsigned char *data=p;
414 register unsigned long A,B,C,D,E,T,l;
415 #ifndef MD32_XARRAY
416 unsigned long XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
417 XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
418 #else
419 SHA_LONG XX[16];
420 #endif
422 #ifdef HMAC_DEBUG
423 DBG(("*********************************************************\n"));
424 DBG(("Entering sha1_block_data_order **************************\n"));
425 #endif
426 A=c->h0;
427 B=c->h1;
428 C=c->h2;
429 D=c->h3;
430 E=c->h4;
432 for (;;)
435 HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l;
436 BODY_00_15( 0,A,B,C,D,E,T,X( 0)); HOST_c2l(data,l); X( 2)=l;
437 BODY_00_15( 1,T,A,B,C,D,E,X( 1)); HOST_c2l(data,l); X( 3)=l;
438 BODY_00_15( 2,E,T,A,B,C,D,X( 2)); HOST_c2l(data,l); X( 4)=l;
439 BODY_00_15( 3,D,E,T,A,B,C,X( 3)); HOST_c2l(data,l); X( 5)=l;
440 BODY_00_15( 4,C,D,E,T,A,B,X( 4)); HOST_c2l(data,l); X( 6)=l;
441 BODY_00_15( 5,B,C,D,E,T,A,X( 5)); HOST_c2l(data,l); X( 7)=l;
442 BODY_00_15( 6,A,B,C,D,E,T,X( 6)); HOST_c2l(data,l); X( 8)=l;
443 BODY_00_15( 7,T,A,B,C,D,E,X( 7)); HOST_c2l(data,l); X( 9)=l;
444 BODY_00_15( 8,E,T,A,B,C,D,X( 8)); HOST_c2l(data,l); X(10)=l;
445 BODY_00_15( 9,D,E,T,A,B,C,X( 9)); HOST_c2l(data,l); X(11)=l;
446 BODY_00_15(10,C,D,E,T,A,B,X(10)); HOST_c2l(data,l); X(12)=l;
447 BODY_00_15(11,B,C,D,E,T,A,X(11)); HOST_c2l(data,l); X(13)=l;
448 BODY_00_15(12,A,B,C,D,E,T,X(12)); HOST_c2l(data,l); X(14)=l;
449 BODY_00_15(13,T,A,B,C,D,E,X(13)); HOST_c2l(data,l); X(15)=l;
450 BODY_00_15(14,E,T,A,B,C,D,X(14));
451 BODY_00_15(15,D,E,T,A,B,C,X(15));
453 BODY_16_19(16,C,D,E,T,A,B,X( 0),X( 0),X( 2),X( 8),X(13));
454 BODY_16_19(17,B,C,D,E,T,A,X( 1),X( 1),X( 3),X( 9),X(14));
455 BODY_16_19(18,A,B,C,D,E,T,X( 2),X( 2),X( 4),X(10),X(15));
456 BODY_16_19(19,T,A,B,C,D,E,X( 3),X( 3),X( 5),X(11),X( 0));
458 BODY_20_31(20,E,T,A,B,C,D,X( 4),X( 4),X( 6),X(12),X( 1));
459 BODY_20_31(21,D,E,T,A,B,C,X( 5),X( 5),X( 7),X(13),X( 2));
460 BODY_20_31(22,C,D,E,T,A,B,X( 6),X( 6),X( 8),X(14),X( 3));
461 BODY_20_31(23,B,C,D,E,T,A,X( 7),X( 7),X( 9),X(15),X( 4));
462 BODY_20_31(24,A,B,C,D,E,T,X( 8),X( 8),X(10),X( 0),X( 5));
463 BODY_20_31(25,T,A,B,C,D,E,X( 9),X( 9),X(11),X( 1),X( 6));
464 BODY_20_31(26,E,T,A,B,C,D,X(10),X(10),X(12),X( 2),X( 7));
465 BODY_20_31(27,D,E,T,A,B,C,X(11),X(11),X(13),X( 3),X( 8));
466 BODY_20_31(28,C,D,E,T,A,B,X(12),X(12),X(14),X( 4),X( 9));
467 BODY_20_31(29,B,C,D,E,T,A,X(13),X(13),X(15),X( 5),X(10));
468 BODY_20_31(30,A,B,C,D,E,T,X(14),X(14),X( 0),X( 6),X(11));
469 BODY_20_31(31,T,A,B,C,D,E,X(15),X(15),X( 1),X( 7),X(12));
471 BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13));
472 BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14));
473 BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15));
474 BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0));
475 BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1));
476 BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2));
477 BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3));
478 BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4));
480 BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5));
481 BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6));
482 BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7));
483 BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8));
484 BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9));
485 BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10));
486 BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11));
487 BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12));
488 BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13));
489 BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14));
490 BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15));
491 BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0));
492 BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1));
493 BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2));
494 BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3));
495 BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4));
496 BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5));
497 BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6));
498 BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7));
499 BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8));
501 BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9));
502 BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10));
503 BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11));
504 BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12));
505 BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13));
506 BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14));
507 BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15));
508 BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0));
509 BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1));
510 BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2));
511 BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3));
512 BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4));
513 BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5));
514 BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6));
515 BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7));
516 BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8));
517 BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9));
518 BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10));
519 BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11));
520 BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12));
522 c->h0=(c->h0+E)&0xffffffffL;
523 c->h1=(c->h1+T)&0xffffffffL;
524 c->h2=(c->h2+A)&0xffffffffL;
525 c->h3=(c->h3+B)&0xffffffffL;
526 c->h4=(c->h4+C)&0xffffffffL;
528 #ifdef HMAC_DEBUG
529 DBG(("Block end {h0=%08x h1=%08x h2=%08x h3=%08x h4=%08x}\n",
530 c->h0, c->h1, c->h2, c->h3, c->h4));
531 #endif
532 if (--num <= 0) break;
534 A=c->h0;
535 B=c->h1;
536 C=c->h2;
537 D=c->h3;
538 E=c->h4;
540 #ifdef HMAC_DEBUG
541 DBG(("Block end {A=%08lx B=%08lx C=%08lx D=%08lx E=%08lx}\n", A, B, C, D, E));
542 #endif
544 #ifdef HMAC_DEBUG
545 DBG(("Leaving sha1_block_data_order ***************************\n"));
546 DBG(("*********************************************************\n"));
547 #endif
549 #endif