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.]
63 /* one or the other needs to be defined */
64 #ifndef SHA_1 /* FIPE 180-1 */
65 #define SHA_0 /* FIPS 180 */
70 #define c2nl(c,l) (l =(((unsigned long)(*((c)++)))<<24), \
71 l|=(((unsigned long)(*((c)++)))<<16), \
72 l|=(((unsigned long)(*((c)++)))<< 8), \
73 l|=(((unsigned long)(*((c)++))) ))
76 #define p_c2nl(c,l,n) { \
78 case 0: l =((unsigned long)(*((c)++)))<<24; \
79 case 1: l|=((unsigned long)(*((c)++)))<<16; \
80 case 2: l|=((unsigned long)(*((c)++)))<< 8; \
81 case 3: l|=((unsigned long)(*((c)++))); \
86 /* NOTE the pointer is not incremented at the end of this */
87 #define c2nl_p(c,l,n) { \
91 case 3: l =((unsigned long)(*(--(c))))<< 8; \
92 case 2: l|=((unsigned long)(*(--(c))))<<16; \
93 case 1: l|=((unsigned long)(*(--(c))))<<24; \
98 #define p_c2nl_p(c,l,sc,len) { \
101 case 0: l =((unsigned long)(*((c)++)))<<24; \
102 if (--len == 0) break; \
103 case 1: l|=((unsigned long)(*((c)++)))<<16; \
104 if (--len == 0) break; \
105 case 2: l|=((unsigned long)(*((c)++)))<< 8; \
110 #define nl2c(l,c) (*((c)++)=(unsigned char)(((l)>>24)&0xff), \
111 *((c)++)=(unsigned char)(((l)>>16)&0xff), \
112 *((c)++)=(unsigned char)(((l)>> 8)&0xff), \
113 *((c)++)=(unsigned char)(((l) )&0xff))
116 #define c2l(c,l) (l =(((unsigned long)(*((c)++))) ), \
117 l|=(((unsigned long)(*((c)++)))<< 8), \
118 l|=(((unsigned long)(*((c)++)))<<16), \
119 l|=(((unsigned long)(*((c)++)))<<24))
122 #define p_c2l(c,l,n) { \
124 case 0: l =((unsigned long)(*((c)++))); \
125 case 1: l|=((unsigned long)(*((c)++)))<< 8; \
126 case 2: l|=((unsigned long)(*((c)++)))<<16; \
127 case 3: l|=((unsigned long)(*((c)++)))<<24; \
132 /* NOTE the pointer is not incremented at the end of this */
133 #define c2l_p(c,l,n) { \
137 case 3: l =((unsigned long)(*(--(c))))<<16; \
138 case 2: l|=((unsigned long)(*(--(c))))<< 8; \
139 case 1: l|=((unsigned long)(*(--(c)))); \
144 #define p_c2l_p(c,l,sc,len) { \
147 case 0: l =((unsigned long)(*((c)++))); \
148 if (--len == 0) break; \
149 case 1: l|=((unsigned long)(*((c)++)))<< 8; \
150 if (--len == 0) break; \
151 case 2: l|=((unsigned long)(*((c)++)))<<16; \
156 #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
157 *((c)++)=(unsigned char)(((l)>> 8)&0xff), \
158 *((c)++)=(unsigned char)(((l)>>16)&0xff), \
159 *((c)++)=(unsigned char)(((l)>>24)&0xff))
161 #ifndef SHA_LONG_LOG2
162 #define SHA_LONG_LOG2 2 /* default to 32 bits */
166 #undef Endian_Reverse32
168 #define ROTATE(a,n) _lrotl(a,n)
169 #elif defined(__GNUC__)
170 /* some inline assembler templates by <appro@fy.chalmers.se> */
171 #if defined(__i386) && !defined(PEDANTIC)
172 #define ROTATE(a,n) ({ register unsigned int ret; \
180 #define Endian_Reverse32(a) \
181 { register unsigned int l=(a); \
183 : "=r"(l) : "0"(l)); \
187 #elif defined(__powerpc)
188 #define ROTATE(a,n) ({ register unsigned int ret; \
189 asm ("rlwinm %0,%1,%2,0,31" \
194 /* Endian_Reverse32 is not needed for PowerPC */
198 /* A nice byte order reversal from Wei Dai <weidai@eskimo.com> */
200 #ifndef Endian_Reverse32
201 /* 5 instructions with rotate instruction, else 9 */
202 #define Endian_Reverse32(a) \
204 unsigned long t=(a); \
205 (a)=((ROTATE(t,8)&0x00FF00FF)|(ROTATE((t&0x00FF00FF),24))); \
209 #define ROTATE(a,n) (((a)<<(n))|(((a)&0xffffffff)>>(32-(n))))
210 #ifndef Endian_Reverse32
211 /* 6 instructions with rotate instruction, else 8 */
212 #define Endian_Reverse32(a) \
214 unsigned long t=(a); \
215 t=(((t>>8)&0x00FF00FF)|((t&0x00FF00FF)<<8)); \
220 * Originally the middle line started with l=(((l&0xFF00FF00)>>8)|...
221 * It's rewritten as above for two reasons:
222 * - RISCs aren't good at long constants and have to explicitely
223 * compose 'em with several (well, usually 2) instructions in a
224 * register before performing the actual operation and (as you
225 * already realized:-) having same constant should inspire the
226 * compiler to permanently allocate the only register for it;
227 * - most modern CPUs have two ALUs, but usually only one has
228 * circuitry for shifts:-( this minor tweak inspires compiler
229 * to schedule shift instructions in a better way...
231 * <appro@fy.chalmers.se>
235 /* As pointed out by Wei Dai <weidai@eskimo.com>, F() below can be
236 * simplified to the code in F_00_19. Wei attributes these optimisations
237 * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
238 * #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z)))
239 * I've just become aware of another tweak to be made, again from Wei Dai,
240 * in F_40_59, (x&a)|(y&a) -> (x|y)&a
242 #define F_00_19(b,c,d) ((((c) ^ (d)) & (b)) ^ (d))
243 #define F_20_39(b,c,d) ((b) ^ (c) ^ (d))
244 #define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d)))
245 #define F_60_79(b,c,d) F_20_39(b,c,d)
249 #define Xupdate(a,i,ia,ib,ic,id) X[(i)&0x0f]=(a)=\
250 (ia[(i)&0x0f]^ib[((i)+2)&0x0f]^ic[((i)+8)&0x0f]^id[((i)+13)&0x0f]);
253 #define Xupdate(a,i,ia,ib,ic,id) (a)=\
254 (ia[(i)&0x0f]^ib[((i)+2)&0x0f]^ic[((i)+8)&0x0f]^id[((i)+13)&0x0f]);\
255 X[(i)&0x0f]=(a)=ROTATE((a),1);
258 #define BODY_00_15(i,a,b,c,d,e,f,xa) \
259 (f)=xa[i]+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
262 #define BODY_16_19(i,a,b,c,d,e,f,xa,xb,xc,xd) \
263 Xupdate(f,i,xa,xb,xc,xd); \
264 (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
267 #define BODY_20_31(i,a,b,c,d,e,f,xa,xb,xc,xd) \
268 Xupdate(f,i,xa,xb,xc,xd); \
269 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
272 #define BODY_32_39(i,a,b,c,d,e,f,xa) \
273 Xupdate(f,i,xa,xa,xa,xa); \
274 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
277 #define BODY_40_59(i,a,b,c,d,e,f,xa) \
278 Xupdate(f,i,xa,xa,xa,xa); \
279 (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \
282 #define BODY_60_79(i,a,b,c,d,e,f,xa) \
283 Xupdate(f,i,xa,xa,xa,xa); \
284 (f)=X[(i)&0x0f]+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \