1 /* crypto/sha/sha_locl.h */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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
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
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.]
62 #include <openssl/opensslconf.h>
63 #include <openssl/sha.h>
65 #define DATA_ORDER_IS_BIG_ENDIAN
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 { \
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)); \
81 # define HASH_UPDATE SHA_Update
82 # define HASH_TRANSFORM SHA_Transform
83 # define HASH_FINAL SHA_Final
84 # define HASH_INIT SHA_Init
85 # define HASH_BLOCK_DATA_ORDER sha_block_data_order
86 # define Xupdate(a,ix,ia,ib,ic,id) (ix=(a)=(ia^ib^ic^id))
88 static void sha_block_data_order (SHA_CTX *c, const void *p,size_t num);
92 # define HASH_UPDATE SHA1_Update
93 # define HASH_TRANSFORM SHA1_Transform
94 # define HASH_FINAL SHA1_Final
95 # define HASH_INIT SHA1_Init
96 # define HASH_BLOCK_DATA_ORDER sha1_block_data_order
97 # if defined(__MWERKS__) && defined(__MC68K__)
98 /* Metrowerks for Motorola fails otherwise:-( <appro@fy.chalmers.se> */
99 # define Xupdate(a,ix,ia,ib,ic,id) do { (a)=(ia^ib^ic^id); \
100 ix=(a)=ROTATE((a),1); \
103 # define Xupdate(a,ix,ia,ib,ic,id) ( (a)=(ia^ib^ic^id), \
104 ix=(a)=ROTATE((a),1) \
111 void sha1_block_data_order (SHA_CTX *c, const void *p,size_t num);
114 # error "Either SHA_0 or SHA_1 must be defined."
117 #include "md32_common.h"
119 #define INIT_DATA_h0 0x67452301UL
120 #define INIT_DATA_h1 0xefcdab89UL
121 #define INIT_DATA_h2 0x98badcfeUL
122 #define INIT_DATA_h3 0x10325476UL
123 #define INIT_DATA_h4 0xc3d2e1f0UL
125 int HASH_INIT (SHA_CTX *c)
127 memset (c,0,sizeof(*c));
136 #define K_00_19 0x5a827999UL
137 #define K_20_39 0x6ed9eba1UL
138 #define K_40_59 0x8f1bbcdcUL
139 #define K_60_79 0xca62c1d6UL
141 /* As pointed out by Wei Dai <weidai@eskimo.com>, F() below can be
142 * simplified to the code in F_00_19. Wei attributes these optimisations
143 * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
144 * #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z)))
145 * I've just become aware of another tweak to be made, again from Wei Dai,
146 * in F_40_59, (x&a)|(y&a) -> (x|y)&a
148 #define F_00_19(b,c,d) ((((c) ^ (d)) & (b)) ^ (d))
149 #define F_20_39(b,c,d) ((b) ^ (c) ^ (d))
150 #define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d)))
151 #define F_60_79(b,c,d) F_20_39(b,c,d)
153 #ifndef OPENSSL_SMALL_FOOTPRINT
155 #define BODY_00_15(i,a,b,c,d,e,f,xi) \
156 (f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
159 #define BODY_16_19(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
160 Xupdate(f,xi,xa,xb,xc,xd); \
161 (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
164 #define BODY_20_31(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
165 Xupdate(f,xi,xa,xb,xc,xd); \
166 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
169 #define BODY_32_39(i,a,b,c,d,e,f,xa,xb,xc,xd) \
170 Xupdate(f,xa,xa,xb,xc,xd); \
171 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
174 #define BODY_40_59(i,a,b,c,d,e,f,xa,xb,xc,xd) \
175 Xupdate(f,xa,xa,xb,xc,xd); \
176 (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \
179 #define BODY_60_79(i,a,b,c,d,e,f,xa,xb,xc,xd) \
180 Xupdate(f,xa,xa,xb,xc,xd); \
181 (f)=xa+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \
189 * Originally X was an array. As it's automatic it's natural
190 * to expect RISC compiler to accomodate at least part of it in
191 * the register bank, isn't it? Unfortunately not all compilers
192 * "find" this expectation reasonable:-( On order to make such
193 * compilers generate better code I replace X[] with a bunch of
194 * X0, X1, etc. See the function body below...
195 * <appro@fy.chalmers.se>
200 * However! Some compilers (most notably HP C) get overwhelmed by
201 * that many local variables so that we have to have the way to
202 * fall down to the original behavior.
207 #if !defined(SHA_1) || !defined(SHA1_ASM)
208 static void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, size_t num)
210 const unsigned char *data=p;
211 register unsigned MD32_REG_T A,B,C,D,E,T,l;
213 unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
214 XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
227 const union { long one; char little; } is_endian = {1};
229 if (!is_endian.little && sizeof(SHA_LONG)==4 && ((size_t)p%4)==0)
233 BODY_00_15( 0,A,B,C,D,E,T,W[ 0]);
234 BODY_00_15( 1,T,A,B,C,D,E,W[ 1]);
235 BODY_00_15( 2,E,T,A,B,C,D,W[ 2]);
236 BODY_00_15( 3,D,E,T,A,B,C,W[ 3]);
237 BODY_00_15( 4,C,D,E,T,A,B,W[ 4]);
238 BODY_00_15( 5,B,C,D,E,T,A,W[ 5]);
239 BODY_00_15( 6,A,B,C,D,E,T,W[ 6]);
240 BODY_00_15( 7,T,A,B,C,D,E,W[ 7]);
241 BODY_00_15( 8,E,T,A,B,C,D,W[ 8]);
242 BODY_00_15( 9,D,E,T,A,B,C,W[ 9]);
243 BODY_00_15(10,C,D,E,T,A,B,W[10]);
244 BODY_00_15(11,B,C,D,E,T,A,W[11]);
245 BODY_00_15(12,A,B,C,D,E,T,W[12]);
246 BODY_00_15(13,T,A,B,C,D,E,W[13]);
247 BODY_00_15(14,E,T,A,B,C,D,W[14]);
248 BODY_00_15(15,D,E,T,A,B,C,W[15]);
250 BODY_16_19(16,C,D,E,T,A,B,X( 0),W[ 0],W[ 2],W[ 8],W[13]);
251 BODY_16_19(17,B,C,D,E,T,A,X( 1),W[ 1],W[ 3],W[ 9],W[14]);
252 BODY_16_19(18,A,B,C,D,E,T,X( 2),W[ 2],W[ 4],W[10],W[15]);
253 BODY_16_19(19,T,A,B,C,D,E,X( 3),W[ 3],W[ 5],W[11],X( 0));
255 BODY_20_31(20,E,T,A,B,C,D,X( 4),W[ 4],W[ 6],W[12],X( 1));
256 BODY_20_31(21,D,E,T,A,B,C,X( 5),W[ 5],W[ 7],W[13],X( 2));
257 BODY_20_31(22,C,D,E,T,A,B,X( 6),W[ 6],W[ 8],W[14],X( 3));
258 BODY_20_31(23,B,C,D,E,T,A,X( 7),W[ 7],W[ 9],W[15],X( 4));
259 BODY_20_31(24,A,B,C,D,E,T,X( 8),W[ 8],W[10],X( 0),X( 5));
260 BODY_20_31(25,T,A,B,C,D,E,X( 9),W[ 9],W[11],X( 1),X( 6));
261 BODY_20_31(26,E,T,A,B,C,D,X(10),W[10],W[12],X( 2),X( 7));
262 BODY_20_31(27,D,E,T,A,B,C,X(11),W[11],W[13],X( 3),X( 8));
263 BODY_20_31(28,C,D,E,T,A,B,X(12),W[12],W[14],X( 4),X( 9));
264 BODY_20_31(29,B,C,D,E,T,A,X(13),W[13],W[15],X( 5),X(10));
265 BODY_20_31(30,A,B,C,D,E,T,X(14),W[14],X( 0),X( 6),X(11));
266 BODY_20_31(31,T,A,B,C,D,E,X(15),W[15],X( 1),X( 7),X(12));
270 HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l;
271 BODY_00_15( 0,A,B,C,D,E,T,X( 0)); HOST_c2l(data,l); X( 2)=l;
272 BODY_00_15( 1,T,A,B,C,D,E,X( 1)); HOST_c2l(data,l); X( 3)=l;
273 BODY_00_15( 2,E,T,A,B,C,D,X( 2)); HOST_c2l(data,l); X( 4)=l;
274 BODY_00_15( 3,D,E,T,A,B,C,X( 3)); HOST_c2l(data,l); X( 5)=l;
275 BODY_00_15( 4,C,D,E,T,A,B,X( 4)); HOST_c2l(data,l); X( 6)=l;
276 BODY_00_15( 5,B,C,D,E,T,A,X( 5)); HOST_c2l(data,l); X( 7)=l;
277 BODY_00_15( 6,A,B,C,D,E,T,X( 6)); HOST_c2l(data,l); X( 8)=l;
278 BODY_00_15( 7,T,A,B,C,D,E,X( 7)); HOST_c2l(data,l); X( 9)=l;
279 BODY_00_15( 8,E,T,A,B,C,D,X( 8)); HOST_c2l(data,l); X(10)=l;
280 BODY_00_15( 9,D,E,T,A,B,C,X( 9)); HOST_c2l(data,l); X(11)=l;
281 BODY_00_15(10,C,D,E,T,A,B,X(10)); HOST_c2l(data,l); X(12)=l;
282 BODY_00_15(11,B,C,D,E,T,A,X(11)); HOST_c2l(data,l); X(13)=l;
283 BODY_00_15(12,A,B,C,D,E,T,X(12)); HOST_c2l(data,l); X(14)=l;
284 BODY_00_15(13,T,A,B,C,D,E,X(13)); HOST_c2l(data,l); X(15)=l;
285 BODY_00_15(14,E,T,A,B,C,D,X(14));
286 BODY_00_15(15,D,E,T,A,B,C,X(15));
288 BODY_16_19(16,C,D,E,T,A,B,X( 0),X( 0),X( 2),X( 8),X(13));
289 BODY_16_19(17,B,C,D,E,T,A,X( 1),X( 1),X( 3),X( 9),X(14));
290 BODY_16_19(18,A,B,C,D,E,T,X( 2),X( 2),X( 4),X(10),X(15));
291 BODY_16_19(19,T,A,B,C,D,E,X( 3),X( 3),X( 5),X(11),X( 0));
293 BODY_20_31(20,E,T,A,B,C,D,X( 4),X( 4),X( 6),X(12),X( 1));
294 BODY_20_31(21,D,E,T,A,B,C,X( 5),X( 5),X( 7),X(13),X( 2));
295 BODY_20_31(22,C,D,E,T,A,B,X( 6),X( 6),X( 8),X(14),X( 3));
296 BODY_20_31(23,B,C,D,E,T,A,X( 7),X( 7),X( 9),X(15),X( 4));
297 BODY_20_31(24,A,B,C,D,E,T,X( 8),X( 8),X(10),X( 0),X( 5));
298 BODY_20_31(25,T,A,B,C,D,E,X( 9),X( 9),X(11),X( 1),X( 6));
299 BODY_20_31(26,E,T,A,B,C,D,X(10),X(10),X(12),X( 2),X( 7));
300 BODY_20_31(27,D,E,T,A,B,C,X(11),X(11),X(13),X( 3),X( 8));
301 BODY_20_31(28,C,D,E,T,A,B,X(12),X(12),X(14),X( 4),X( 9));
302 BODY_20_31(29,B,C,D,E,T,A,X(13),X(13),X(15),X( 5),X(10));
303 BODY_20_31(30,A,B,C,D,E,T,X(14),X(14),X( 0),X( 6),X(11));
304 BODY_20_31(31,T,A,B,C,D,E,X(15),X(15),X( 1),X( 7),X(12));
307 BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13));
308 BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14));
309 BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15));
310 BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0));
311 BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1));
312 BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2));
313 BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3));
314 BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4));
316 BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5));
317 BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6));
318 BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7));
319 BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8));
320 BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9));
321 BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10));
322 BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11));
323 BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12));
324 BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13));
325 BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14));
326 BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15));
327 BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0));
328 BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1));
329 BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2));
330 BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3));
331 BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4));
332 BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5));
333 BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6));
334 BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7));
335 BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8));
337 BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9));
338 BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10));
339 BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11));
340 BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12));
341 BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13));
342 BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14));
343 BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15));
344 BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0));
345 BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1));
346 BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2));
347 BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3));
348 BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4));
349 BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5));
350 BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6));
351 BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7));
352 BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8));
353 BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9));
354 BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10));
355 BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11));
356 BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12));
358 c->h0=(c->h0+E)&0xffffffffL;
359 c->h1=(c->h1+T)&0xffffffffL;
360 c->h2=(c->h2+A)&0xffffffffL;
361 c->h3=(c->h3+B)&0xffffffffL;
362 c->h4=(c->h4+C)&0xffffffffL;
364 if (--num == 0) break;
376 #else /* OPENSSL_SMALL_FOOTPRINT */
378 #define BODY_00_15(xi) do { \
379 T=E+K_00_19+F_00_19(B,C,D); \
380 E=D, D=C, C=ROTATE(B,30), B=A; \
381 A=ROTATE(A,5)+T+xi; } while(0)
383 #define BODY_16_19(xa,xb,xc,xd) do { \
384 Xupdate(T,xa,xa,xb,xc,xd); \
385 T+=E+K_00_19+F_00_19(B,C,D); \
386 E=D, D=C, C=ROTATE(B,30), B=A; \
387 A=ROTATE(A,5)+T; } while(0)
389 #define BODY_20_39(xa,xb,xc,xd) do { \
390 Xupdate(T,xa,xa,xb,xc,xd); \
391 T+=E+K_20_39+F_20_39(B,C,D); \
392 E=D, D=C, C=ROTATE(B,30), B=A; \
393 A=ROTATE(A,5)+T; } while(0)
395 #define BODY_40_59(xa,xb,xc,xd) do { \
396 Xupdate(T,xa,xa,xb,xc,xd); \
397 T+=E+K_40_59+F_40_59(B,C,D); \
398 E=D, D=C, C=ROTATE(B,30), B=A; \
399 A=ROTATE(A,5)+T; } while(0)
401 #define BODY_60_79(xa,xb,xc,xd) do { \
402 Xupdate(T,xa,xa,xb,xc,xd); \
403 T=E+K_60_79+F_60_79(B,C,D); \
404 E=D, D=C, C=ROTATE(B,30), B=A; \
405 A=ROTATE(A,5)+T+xa; } while(0)
407 #if !defined(SHA_1) || !defined(SHA1_ASM)
408 static void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, size_t num)
410 const unsigned char *data=p;
411 register unsigned MD32_REG_T A,B,C,D,E,T,l;
424 { HOST_c2l(data,l); X[i]=l; BODY_00_15(X[i]); }
426 { BODY_16_19(X[i], X[i+2], X[i+8], X[(i+13)&15]); }
428 { BODY_20_39(X[i&15], X[(i+2)&15], X[(i+8)&15],X[(i+13)&15]); }
430 { BODY_40_59(X[(i+8)&15],X[(i+10)&15],X[i&15], X[(i+5)&15]); }
432 { BODY_60_79(X[(i+8)&15],X[(i+10)&15],X[i&15], X[(i+5)&15]); }
434 c->h0=(c->h0+A)&0xffffffffL;
435 c->h1=(c->h1+B)&0xffffffffL;
436 c->h2=(c->h2+C)&0xffffffffL;
437 c->h3=(c->h3+D)&0xffffffffL;
438 c->h4=(c->h4+E)&0xffffffffL;
440 if (--num == 0) break;