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