1 /* crypto/sha/sha_locl.h */ 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 routines 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 #ifdef undef 60 /* one or the other needs to be defined */ 61 #ifndef SHA_1 /* FIPE 180-1 */ 62 #define SHA_0 /* FIPS 180 */ 63 #endif 64 #endif 65 66 #define ULONG unsigned long 67 #define UCHAR unsigned char 68 #define UINT unsigned int 69 70 #ifdef NOCONST 71 #define const 72 #endif 73 74 #undef c2nl 75 #define c2nl(c,l) (l =(((unsigned long)(*((c)++)))<<24), \ 76 l|=(((unsigned long)(*((c)++)))<<16), \ 77 l|=(((unsigned long)(*((c)++)))<< 8), \ 78 l|=(((unsigned long)(*((c)++))) )) 79 80 #undef p_c2nl 81 #define p_c2nl(c,l,n) { \ 82 switch (n) { \ 83 case 0: l =((unsigned long)(*((c)++)))<<24; \ 84 case 1: l|=((unsigned long)(*((c)++)))<<16; \ 85 case 2: l|=((unsigned long)(*((c)++)))<< 8; \ 86 case 3: l|=((unsigned long)(*((c)++))); \ 87 } \ 88 } 89 90 #undef c2nl_p 91 /* NOTE the pointer is not incremented at the end of this */ 92 #define c2nl_p(c,l,n) { \ 93 l=0; \ 94 (c)+=n; \ 95 switch (n) { \ 96 case 3: l =((unsigned long)(*(--(c))))<< 8; \ 97 case 2: l|=((unsigned long)(*(--(c))))<<16; \ 98 case 1: l|=((unsigned long)(*(--(c))))<<24; \ 99 } \ 100 } 101 102 #undef p_c2nl_p 103 #define p_c2nl_p(c,l,sc,len) { \ 104 switch (sc) \ 105 { \ 106 case 0: l =((unsigned long)(*((c)++)))<<24; \ 107 if (--len == 0) break; \ 108 case 1: l|=((unsigned long)(*((c)++)))<<16; \ 109 if (--len == 0) break; \ 110 case 2: l|=((unsigned long)(*((c)++)))<< 8; \ 111 } \ 112 } 113 114 #undef nl2c 115 #define nl2c(l,c) (*((c)++)=(unsigned char)(((l)>>24)&0xff), \ 116 *((c)++)=(unsigned char)(((l)>>16)&0xff), \ 117 *((c)++)=(unsigned char)(((l)>> 8)&0xff), \ 118 *((c)++)=(unsigned char)(((l) )&0xff)) 119 120 #undef c2l 121 #define c2l(c,l) (l =(((unsigned long)(*((c)++))) ), \ 122 l|=(((unsigned long)(*((c)++)))<< 8), \ 123 l|=(((unsigned long)(*((c)++)))<<16), \ 124 l|=(((unsigned long)(*((c)++)))<<24)) 125 126 #undef p_c2l 127 #define p_c2l(c,l,n) { \ 128 switch (n) { \ 129 case 0: l =((unsigned long)(*((c)++))); \ 130 case 1: l|=((unsigned long)(*((c)++)))<< 8; \ 131 case 2: l|=((unsigned long)(*((c)++)))<<16; \ 132 case 3: l|=((unsigned long)(*((c)++)))<<24; \ 133 } \ 134 } 135 136 #undef c2l_p 137 /* NOTE the pointer is not incremented at the end of this */ 138 #define c2l_p(c,l,n) { \ 139 l=0; \ 140 (c)+=n; \ 141 switch (n) { \ 142 case 3: l =((unsigned long)(*(--(c))))<<16; \ 143 case 2: l|=((unsigned long)(*(--(c))))<< 8; \ 144 case 1: l|=((unsigned long)(*(--(c)))); \ 145 } \ 146 } 147 148 #undef p_c2l_p 149 #define p_c2l_p(c,l,sc,len) { \ 150 switch (sc) \ 151 { \ 152 case 0: l =((unsigned long)(*((c)++))); \ 153 if (--len == 0) break; \ 154 case 1: l|=((unsigned long)(*((c)++)))<< 8; \ 155 if (--len == 0) break; \ 156 case 2: l|=((unsigned long)(*((c)++)))<<16; \ 157 } \ 158 } 159 160 #undef l2c 161 #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ 162 *((c)++)=(unsigned char)(((l)>> 8)&0xff), \ 163 *((c)++)=(unsigned char)(((l)>>16)&0xff), \ 164 *((c)++)=(unsigned char)(((l)>>24)&0xff)) 165 166 #undef ROTATE 167 #if defined(WIN32) 168 #define ROTATE(a,n) _lrotl(a,n) 169 #else 170 #define ROTATE(a,n) (((a)<<(n))|(((a)&0xffffffff)>>(32-(n)))) 171 #endif 172 173 /* A nice byte order reversal from Wei Dai <weidai@eskimo.com> */ 174 #if defined(WIN32) 175 /* 5 instructions with rotate instruction, else 9 */ 176 #define Endian_Reverse32(a) \ 177 { \ 178 unsigned long l=(a); \ 179 (a)=((ROTATE(l,8)&0x00FF00FF)|(ROTATE(l,24)&0xFF00FF00)); \ 180 } 181 #else 182 /* 6 instructions with rotate instruction, else 8 */ 183 #define Endian_Reverse32(a) \ 184 { \ 185 unsigned long l=(a); \ 186 l=(((l&0xFF00FF00)>>8L)|((l&0x00FF00FF)<<8L)); \ 187 (a)=ROTATE(l,16L); \ 188 } 189 #endif 190 191 /* As pointed out by Wei Dai <weidai@eskimo.com>, F() below can be 192 * simplified to the code in F_00_19. Wei attributes these optimisations 193 * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel. 194 * #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z))) 195 * I've just become aware of another tweak to be made, again from Wei Dai, 196 * in F_40_59, (x&a)|(y&a) -> (x|y)&a 197 */ 198 #define F_00_19(b,c,d) ((((c) ^ (d)) & (b)) ^ (d)) 199 #define F_20_39(b,c,d) ((b) ^ (c) ^ (d)) 200 #define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d))) 201 #define F_60_79(b,c,d) F_20_39(b,c,d) 202 203 #ifdef SHA_0 204 #undef Xupdate 205 #define Xupdate(a,i,ia,ib,ic,id) X[(i)&0x0f]=(a)=\ 206 (ia[(i)&0x0f]^ib[((i)+2)&0x0f]^ic[((i)+8)&0x0f]^id[((i)+13)&0x0f]); 207 #endif 208 #ifdef SHA_1 209 #undef Xupdate 210 #define Xupdate(a,i,ia,ib,ic,id) (a)=\ 211 (ia[(i)&0x0f]^ib[((i)+2)&0x0f]^ic[((i)+8)&0x0f]^id[((i)+13)&0x0f]);\ 212 X[(i)&0x0f]=(a)=ROTATE((a),1); 213 #endif 214 215 #define BODY_00_15(i,a,b,c,d,e,f,xa) \ 216 (f)=xa[i]+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \ 217 (b)=ROTATE((b),30); 218 219 #define BODY_16_19(i,a,b,c,d,e,f,xa,xb,xc,xd) \ 220 Xupdate(f,i,xa,xb,xc,xd); \ 221 (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \ 222 (b)=ROTATE((b),30); 223 224 #define BODY_20_31(i,a,b,c,d,e,f,xa,xb,xc,xd) \ 225 Xupdate(f,i,xa,xb,xc,xd); \ 226 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \ 227 (b)=ROTATE((b),30); 228 229 #define BODY_32_39(i,a,b,c,d,e,f,xa) \ 230 Xupdate(f,i,xa,xa,xa,xa); \ 231 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \ 232 (b)=ROTATE((b),30); 233 234 #define BODY_40_59(i,a,b,c,d,e,f,xa) \ 235 Xupdate(f,i,xa,xa,xa,xa); \ 236 (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \ 237 (b)=ROTATE((b),30); 238 239 #define BODY_60_79(i,a,b,c,d,e,f,xa) \ 240 Xupdate(f,i,xa,xa,xa,xa); \ 241 (f)=X[(i)&0x0f]+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \ 242 (b)=ROTATE((b),30); 243 244