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; (void)HOST_l2c(ll,(s)); \
73 ll=(c)->h1; (void)HOST_l2c(ll,(s)); \
74 ll=(c)->h2; (void)HOST_l2c(ll,(s)); \
75 ll=(c)->h3; (void)HOST_l2c(ll,(s)); \
76 ll=(c)->h4; (void)HOST_l2c(ll,(s)); \
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) \
89 static void sha1_block_data_order(SHA_CTX *c, const void *p, size_t num);
91 void sha1_block_data_order(SHA_CTX *c, const void *p, size_t num);
94 #include "internal/md32_common.h"
96 #define INIT_DATA_h0 0x67452301UL
97 #define INIT_DATA_h1 0xefcdab89UL
98 #define INIT_DATA_h2 0x98badcfeUL
99 #define INIT_DATA_h3 0x10325476UL
100 #define INIT_DATA_h4 0xc3d2e1f0UL
102 int HASH_INIT(SHA_CTX *c)
104 memset(c, 0, sizeof(*c));
105 c->h0 = INIT_DATA_h0;
106 c->h1 = INIT_DATA_h1;
107 c->h2 = INIT_DATA_h2;
108 c->h3 = INIT_DATA_h3;
109 c->h4 = INIT_DATA_h4;
113 #define K_00_19 0x5a827999UL
114 #define K_20_39 0x6ed9eba1UL
115 #define K_40_59 0x8f1bbcdcUL
116 #define K_60_79 0xca62c1d6UL
119 * As pointed out by Wei Dai <weidai@eskimo.com>, F() below can be simplified
120 * to the code in F_00_19. Wei attributes these optimisations to Peter
121 * Gutmann's SHS code, and he attributes it to Rich Schroeppel. #define
122 * F(x,y,z) (((x) & (y)) | ((~(x)) & (z))) I've just become aware of another
123 * tweak to be made, again from Wei Dai, in F_40_59, (x&a)|(y&a) -> (x|y)&a
125 #define F_00_19(b,c,d) ((((c) ^ (d)) & (b)) ^ (d))
126 #define F_20_39(b,c,d) ((b) ^ (c) ^ (d))
127 #define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d)))
128 #define F_60_79(b,c,d) F_20_39(b,c,d)
130 #ifndef OPENSSL_SMALL_FOOTPRINT
132 # define BODY_00_15(i,a,b,c,d,e,f,xi) \
133 (f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
136 # define BODY_16_19(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
137 Xupdate(f,xi,xa,xb,xc,xd); \
138 (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
141 # define BODY_20_31(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
142 Xupdate(f,xi,xa,xb,xc,xd); \
143 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
146 # define BODY_32_39(i,a,b,c,d,e,f,xa,xb,xc,xd) \
147 Xupdate(f,xa,xa,xb,xc,xd); \
148 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
151 # define BODY_40_59(i,a,b,c,d,e,f,xa,xb,xc,xd) \
152 Xupdate(f,xa,xa,xb,xc,xd); \
153 (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \
156 # define BODY_60_79(i,a,b,c,d,e,f,xa,xb,xc,xd) \
157 Xupdate(f,xa,xa,xb,xc,xd); \
158 (f)=xa+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \
166 * Originally X was an array. As it's automatic it's natural
167 * to expect RISC compiler to accomodate at least part of it in
168 * the register bank, isn't it? Unfortunately not all compilers
169 * "find" this expectation reasonable:-( On order to make such
170 * compilers generate better code I replace X[] with a bunch of
171 * X0, X1, etc. See the function body below...
172 * <appro@fy.chalmers.se>
177 * However! Some compilers (most notably HP C) get overwhelmed by
178 * that many local variables so that we have to have the way to
179 * fall down to the original behavior.
184 # if !defined(SHA1_ASM)
185 static void HASH_BLOCK_DATA_ORDER(SHA_CTX *c, const void *p, size_t num)
187 const unsigned char *data = p;
188 register unsigned MD32_REG_T A, B, C, D, E, T, l;
190 unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
191 XX8, XX9, XX10, XX11, XX12, XX13, XX14, XX15;
210 if (!is_endian.little && sizeof(SHA_LONG) == 4
211 && ((size_t)p % 4) == 0) {
212 const SHA_LONG *W = (const SHA_LONG *)data;
216 BODY_00_15(0, A, B, C, D, E, T, X(0));
218 BODY_00_15(1, T, A, B, C, D, E, X(1));
220 BODY_00_15(2, E, T, A, B, C, D, X(2));
222 BODY_00_15(3, D, E, T, A, B, C, X(3));
224 BODY_00_15(4, C, D, E, T, A, B, X(4));
226 BODY_00_15(5, B, C, D, E, T, A, X(5));
228 BODY_00_15(6, A, B, C, D, E, T, X(6));
230 BODY_00_15(7, T, A, B, C, D, E, X(7));
232 BODY_00_15(8, E, T, A, B, C, D, X(8));
234 BODY_00_15(9, D, E, T, A, B, C, X(9));
236 BODY_00_15(10, C, D, E, T, A, B, X(10));
238 BODY_00_15(11, B, C, D, E, T, A, X(11));
240 BODY_00_15(12, A, B, C, D, E, T, X(12));
242 BODY_00_15(13, T, A, B, C, D, E, X(13));
244 BODY_00_15(14, E, T, A, B, C, D, X(14));
245 BODY_00_15(15, D, E, T, A, B, C, X(15));
249 (void)HOST_c2l(data, l);
251 (void)HOST_c2l(data, l);
253 BODY_00_15(0, A, B, C, D, E, T, X(0));
254 (void)HOST_c2l(data, l);
256 BODY_00_15(1, T, A, B, C, D, E, X(1));
257 (void)HOST_c2l(data, l);
259 BODY_00_15(2, E, T, A, B, C, D, X(2));
260 (void)HOST_c2l(data, l);
262 BODY_00_15(3, D, E, T, A, B, C, X(3));
263 (void)HOST_c2l(data, l);
265 BODY_00_15(4, C, D, E, T, A, B, X(4));
266 (void)HOST_c2l(data, l);
268 BODY_00_15(5, B, C, D, E, T, A, X(5));
269 (void)HOST_c2l(data, l);
271 BODY_00_15(6, A, B, C, D, E, T, X(6));
272 (void)HOST_c2l(data, l);
274 BODY_00_15(7, T, A, B, C, D, E, X(7));
275 (void)HOST_c2l(data, l);
277 BODY_00_15(8, E, T, A, B, C, D, X(8));
278 (void)HOST_c2l(data, l);
280 BODY_00_15(9, D, E, T, A, B, C, X(9));
281 (void)HOST_c2l(data, l);
283 BODY_00_15(10, C, D, E, T, A, B, X(10));
284 (void)HOST_c2l(data, l);
286 BODY_00_15(11, B, C, D, E, T, A, X(11));
287 (void)HOST_c2l(data, l);
289 BODY_00_15(12, A, B, C, D, E, T, X(12));
290 (void)HOST_c2l(data, l);
292 BODY_00_15(13, T, A, B, C, D, E, X(13));
293 (void)HOST_c2l(data, l);
295 BODY_00_15(14, E, T, A, B, C, D, X(14));
296 BODY_00_15(15, D, E, T, A, B, C, X(15));
299 BODY_16_19(16, C, D, E, T, A, B, X(0), X(0), X(2), X(8), X(13));
300 BODY_16_19(17, B, C, D, E, T, A, X(1), X(1), X(3), X(9), X(14));
301 BODY_16_19(18, A, B, C, D, E, T, X(2), X(2), X(4), X(10), X(15));
302 BODY_16_19(19, T, A, B, C, D, E, X(3), X(3), X(5), X(11), X(0));
304 BODY_20_31(20, E, T, A, B, C, D, X(4), X(4), X(6), X(12), X(1));
305 BODY_20_31(21, D, E, T, A, B, C, X(5), X(5), X(7), X(13), X(2));
306 BODY_20_31(22, C, D, E, T, A, B, X(6), X(6), X(8), X(14), X(3));
307 BODY_20_31(23, B, C, D, E, T, A, X(7), X(7), X(9), X(15), X(4));
308 BODY_20_31(24, A, B, C, D, E, T, X(8), X(8), X(10), X(0), X(5));
309 BODY_20_31(25, T, A, B, C, D, E, X(9), X(9), X(11), X(1), X(6));
310 BODY_20_31(26, E, T, A, B, C, D, X(10), X(10), X(12), X(2), X(7));
311 BODY_20_31(27, D, E, T, A, B, C, X(11), X(11), X(13), X(3), X(8));
312 BODY_20_31(28, C, D, E, T, A, B, X(12), X(12), X(14), X(4), X(9));
313 BODY_20_31(29, B, C, D, E, T, A, X(13), X(13), X(15), X(5), X(10));
314 BODY_20_31(30, A, B, C, D, E, T, X(14), X(14), X(0), X(6), X(11));
315 BODY_20_31(31, T, A, B, C, D, E, X(15), X(15), X(1), X(7), X(12));
317 BODY_32_39(32, E, T, A, B, C, D, X(0), X(2), X(8), X(13));
318 BODY_32_39(33, D, E, T, A, B, C, X(1), X(3), X(9), X(14));
319 BODY_32_39(34, C, D, E, T, A, B, X(2), X(4), X(10), X(15));
320 BODY_32_39(35, B, C, D, E, T, A, X(3), X(5), X(11), X(0));
321 BODY_32_39(36, A, B, C, D, E, T, X(4), X(6), X(12), X(1));
322 BODY_32_39(37, T, A, B, C, D, E, X(5), X(7), X(13), X(2));
323 BODY_32_39(38, E, T, A, B, C, D, X(6), X(8), X(14), X(3));
324 BODY_32_39(39, D, E, T, A, B, C, X(7), X(9), X(15), X(4));
326 BODY_40_59(40, C, D, E, T, A, B, X(8), X(10), X(0), X(5));
327 BODY_40_59(41, B, C, D, E, T, A, X(9), X(11), X(1), X(6));
328 BODY_40_59(42, A, B, C, D, E, T, X(10), X(12), X(2), X(7));
329 BODY_40_59(43, T, A, B, C, D, E, X(11), X(13), X(3), X(8));
330 BODY_40_59(44, E, T, A, B, C, D, X(12), X(14), X(4), X(9));
331 BODY_40_59(45, D, E, T, A, B, C, X(13), X(15), X(5), X(10));
332 BODY_40_59(46, C, D, E, T, A, B, X(14), X(0), X(6), X(11));
333 BODY_40_59(47, B, C, D, E, T, A, X(15), X(1), X(7), X(12));
334 BODY_40_59(48, A, B, C, D, E, T, X(0), X(2), X(8), X(13));
335 BODY_40_59(49, T, A, B, C, D, E, X(1), X(3), X(9), X(14));
336 BODY_40_59(50, E, T, A, B, C, D, X(2), X(4), X(10), X(15));
337 BODY_40_59(51, D, E, T, A, B, C, X(3), X(5), X(11), X(0));
338 BODY_40_59(52, C, D, E, T, A, B, X(4), X(6), X(12), X(1));
339 BODY_40_59(53, B, C, D, E, T, A, X(5), X(7), X(13), X(2));
340 BODY_40_59(54, A, B, C, D, E, T, X(6), X(8), X(14), X(3));
341 BODY_40_59(55, T, A, B, C, D, E, X(7), X(9), X(15), X(4));
342 BODY_40_59(56, E, T, A, B, C, D, X(8), X(10), X(0), X(5));
343 BODY_40_59(57, D, E, T, A, B, C, X(9), X(11), X(1), X(6));
344 BODY_40_59(58, C, D, E, T, A, B, X(10), X(12), X(2), X(7));
345 BODY_40_59(59, B, C, D, E, T, A, X(11), X(13), X(3), X(8));
347 BODY_60_79(60, A, B, C, D, E, T, X(12), X(14), X(4), X(9));
348 BODY_60_79(61, T, A, B, C, D, E, X(13), X(15), X(5), X(10));
349 BODY_60_79(62, E, T, A, B, C, D, X(14), X(0), X(6), X(11));
350 BODY_60_79(63, D, E, T, A, B, C, X(15), X(1), X(7), X(12));
351 BODY_60_79(64, C, D, E, T, A, B, X(0), X(2), X(8), X(13));
352 BODY_60_79(65, B, C, D, E, T, A, X(1), X(3), X(9), X(14));
353 BODY_60_79(66, A, B, C, D, E, T, X(2), X(4), X(10), X(15));
354 BODY_60_79(67, T, A, B, C, D, E, X(3), X(5), X(11), X(0));
355 BODY_60_79(68, E, T, A, B, C, D, X(4), X(6), X(12), X(1));
356 BODY_60_79(69, D, E, T, A, B, C, X(5), X(7), X(13), X(2));
357 BODY_60_79(70, C, D, E, T, A, B, X(6), X(8), X(14), X(3));
358 BODY_60_79(71, B, C, D, E, T, A, X(7), X(9), X(15), X(4));
359 BODY_60_79(72, A, B, C, D, E, T, X(8), X(10), X(0), X(5));
360 BODY_60_79(73, T, A, B, C, D, E, X(9), X(11), X(1), X(6));
361 BODY_60_79(74, E, T, A, B, C, D, X(10), X(12), X(2), X(7));
362 BODY_60_79(75, D, E, T, A, B, C, X(11), X(13), X(3), X(8));
363 BODY_60_79(76, C, D, E, T, A, B, X(12), X(14), X(4), X(9));
364 BODY_60_79(77, B, C, D, E, T, A, X(13), X(15), X(5), X(10));
365 BODY_60_79(78, A, B, C, D, E, T, X(14), X(0), X(6), X(11));
366 BODY_60_79(79, T, A, B, C, D, E, X(15), X(1), X(7), X(12));
368 c->h0 = (c->h0 + E) & 0xffffffffL;
369 c->h1 = (c->h1 + T) & 0xffffffffL;
370 c->h2 = (c->h2 + A) & 0xffffffffL;
371 c->h3 = (c->h3 + B) & 0xffffffffL;
372 c->h4 = (c->h4 + C) & 0xffffffffL;
387 #else /* OPENSSL_SMALL_FOOTPRINT */
389 # define BODY_00_15(xi) do { \
390 T=E+K_00_19+F_00_19(B,C,D); \
391 E=D, D=C, C=ROTATE(B,30), B=A; \
392 A=ROTATE(A,5)+T+xi; } while(0)
394 # define BODY_16_19(xa,xb,xc,xd) do { \
395 Xupdate(T,xa,xa,xb,xc,xd); \
396 T+=E+K_00_19+F_00_19(B,C,D); \
397 E=D, D=C, C=ROTATE(B,30), B=A; \
398 A=ROTATE(A,5)+T; } while(0)
400 # define BODY_20_39(xa,xb,xc,xd) do { \
401 Xupdate(T,xa,xa,xb,xc,xd); \
402 T+=E+K_20_39+F_20_39(B,C,D); \
403 E=D, D=C, C=ROTATE(B,30), B=A; \
404 A=ROTATE(A,5)+T; } while(0)
406 # define BODY_40_59(xa,xb,xc,xd) do { \
407 Xupdate(T,xa,xa,xb,xc,xd); \
408 T+=E+K_40_59+F_40_59(B,C,D); \
409 E=D, D=C, C=ROTATE(B,30), B=A; \
410 A=ROTATE(A,5)+T; } while(0)
412 # define BODY_60_79(xa,xb,xc,xd) do { \
413 Xupdate(T,xa,xa,xb,xc,xd); \
414 T=E+K_60_79+F_60_79(B,C,D); \
415 E=D, D=C, C=ROTATE(B,30), B=A; \
416 A=ROTATE(A,5)+T+xa; } while(0)
418 # if !defined(SHA1_ASM)
419 static void HASH_BLOCK_DATA_ORDER(SHA_CTX *c, const void *p, size_t num)
421 const unsigned char *data = p;
422 register unsigned MD32_REG_T A, B, C, D, E, T, l;
433 for (i = 0; i < 16; i++) {
438 for (i = 0; i < 4; i++) {
439 BODY_16_19(X[i], X[i + 2], X[i + 8], X[(i + 13) & 15]);
441 for (; i < 24; i++) {
442 BODY_20_39(X[i & 15], X[(i + 2) & 15], X[(i + 8) & 15],
445 for (i = 0; i < 20; i++) {
446 BODY_40_59(X[(i + 8) & 15], X[(i + 10) & 15], X[i & 15],
449 for (i = 4; i < 24; i++) {
450 BODY_60_79(X[(i + 8) & 15], X[(i + 10) & 15], X[i & 15],
454 c->h0 = (c->h0 + A) & 0xffffffffL;
455 c->h1 = (c->h1 + B) & 0xffffffffL;
456 c->h2 = (c->h2 + C) & 0xffffffffL;
457 c->h3 = (c->h3 + D) & 0xffffffffL;
458 c->h4 = (c->h4 + E) & 0xffffffffL;