projects / apple / xnu.git / blame
| Commit | Line | Data |
|---|---|---|
| fe8ab488 A |
1 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
| 2 | * All rights reserved. | |
| 3 | * | |
| 4 | * This package is an SSL implementation written | |
| 5 | * by Eric Young (eay@cryptsoft.com). | |
| 6 | * The implementation was written so as to conform with Netscapes SSL. | |
| 7 | * | |
| 8 | * This library is free for commercial and non-commercial use as long as | |
| 9 | * the following conditions are aheared to. The following conditions | |
| 10 | * apply to all code found in this distribution, be it the RC4, RSA, | |
| 11 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | |
| 12 | * included with this distribution is covered by the same copyright terms | |
| 13 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | |
| 14 | * | |
| 15 | * Copyright remains Eric Young's, and as such any Copyright notices in | |
| 16 | * the code are not to be removed. | |
| 17 | * If this package is used in a product, Eric Young should be given attribution | |
| 18 | * as the author of the parts of the library used. | |
| 19 | * This can be in the form of a textual message at program startup or | |
| 20 | * in documentation (online or textual) provided with the package. | |
| 21 | * | |
| 22 | * Redistribution and use in source and binary forms, with or without | |
| 23 | * modification, are permitted provided that the following conditions | |
| 24 | * are met: | |
| 25 | * 1. Redistributions of source code must retain the copyright | |
| 26 | * notice, this list of conditions and the following disclaimer. | |
| 27 | * 2. Redistributions in binary form must reproduce the above copyright | |
| 28 | * notice, this list of conditions and the following disclaimer in the | |
| 29 | * documentation and/or other materials provided with the distribution. | |
| 30 | * 3. All advertising materials mentioning features or use of this software | |
| 31 | * must display the following acknowledgement: | |
| 32 | * "This product includes cryptographic software written by | |
| 33 | * Eric Young (eay@cryptsoft.com)" | |
| 34 | * The word 'cryptographic' can be left out if the rouines from the library | |
| 35 | * being used are not cryptographic related :-). | |
| 36 | * 4. If you include any Windows specific code (or a derivative thereof) from | |
| 37 | * the apps directory (application code) you must include an acknowledgement: | |
| 38 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
| 39 | * | |
| 40 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | |
| 41 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
| 42 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
| 43 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | |
| 44 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
| 45 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
| 46 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
| 48 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
| 49 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
| 50 | * SUCH DAMAGE. | |
| 51 | * | |
| 52 | * The licence and distribution terms for any publically available version or | |
| 53 | * derivative of this code cannot be changed. i.e. this code cannot simply be | |
| 54 | * copied and put under another distribution licence | |
| 55 | * [including the GNU Public Licence.] | |
| 56 | */ | |
| 57 | ||
| 39037602 | 58 | |
| fe8ab488 A |
59 | #include <corecrypto/ccsha1.h> |
| 60 | #include <corecrypto/cc_priv.h> | |
| 61 | #include <corecrypto/ccdigest_priv.h> | |
| 62 | ||
| 63 | ||
| 64 | #ifndef SHA_LONG_LOG2 | |
| 65 | #define SHA_LONG_LOG2 2 /* default to 32 bits */ | |
| 66 | #endif | |
| 67 | ||
| 68 | ||
| 69 | #define ROTATE(b, n) CC_ROLc(b, n) | |
| 70 | ||
| 71 | #define Xupdate(a,ix,ia,ib,ic,id) ( (a)=(ia^ib^ic^id), \ | |
| 72 | ix=(a)=ROTATE((a),1) \ | |
| 73 | ) | |
| 74 | ||
| 75 | #define MD32_REG_T uint32_t | |
| 76 | ||
| 77 | #define HOST_c2l(data, l) CC_LOAD32_BE(l, data); data+=4; | |
| 78 | ||
| 79 | #define K_00_19 0x5a827999 | |
| 80 | #define K_20_39 0x6ed9eba1 | |
| 81 | #define K_40_59 0x8f1bbcdc | |
| 82 | #define K_60_79 0xca62c1d6 | |
| 83 | ||
| 84 | /* As pointed out by Wei Dai <weidai@eskimo.com>, F() below can be | |
| 85 | * simplified to the code in F_00_19. Wei attributes these optimisations | |
| 86 | * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel. | |
| 87 | * #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z))) | |
| 88 | * I've just become aware of another tweak to be made, again from Wei Dai, | |
| 89 | * in F_40_59, (x&a)|(y&a) -> (x|y)&a | |
| 90 | */ | |
| 91 | #define F_00_19(b,c,d) ((((c) ^ (d)) & (b)) ^ (d)) | |
| 92 | #define F_20_39(b,c,d) ((b) ^ (c) ^ (d)) | |
| 93 | #define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d))) | |
| 94 | #define F_60_79(b,c,d) F_20_39(b,c,d) | |
| 95 | ||
| 96 | #define BODY_00_15(i,a,b,c,d,e,f,xi) \ | |
| 97 | (f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \ | |
| 98 | (b)=ROTATE((b),30); | |
| 99 | ||
| 100 | #define BODY_16_19(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \ | |
| 101 | Xupdate(f,xi,xa,xb,xc,xd); \ | |
| 102 | (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \ | |
| 103 | (b)=ROTATE((b),30); | |
| 104 | ||
| 105 | #define BODY_20_31(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \ | |
| 106 | Xupdate(f,xi,xa,xb,xc,xd); \ | |
| 107 | (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \ | |
| 108 | (b)=ROTATE((b),30); | |
| 109 | ||
| 110 | #define BODY_32_39(i,a,b,c,d,e,f,xa,xb,xc,xd) \ | |
| 111 | Xupdate(f,xa,xa,xb,xc,xd); \ | |
| 112 | (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \ | |
| 113 | (b)=ROTATE((b),30); | |
| 114 | ||
| 115 | #define BODY_40_59(i,a,b,c,d,e,f,xa,xb,xc,xd) \ | |
| 116 | Xupdate(f,xa,xa,xb,xc,xd); \ | |
| 117 | (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \ | |
| 118 | (b)=ROTATE((b),30); | |
| 119 | ||
| 120 | #define BODY_60_79(i,a,b,c,d,e,f,xa,xb,xc,xd) \ | |
| 121 | Xupdate(f,xa,xa,xb,xc,xd); \ | |
| 122 | (f)=xa+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \ | |
| 123 | (b)=ROTATE((b),30); | |
| 124 | ||
| 125 | #ifdef X | |
| 126 | #undef X | |
| 127 | #endif | |
| 128 | ||
| 129 | #ifndef MD32_XARRAY | |
| 130 | /* | |
| 131 | * Originally X was an array. As it's automatic it's natural | |
| 132 | * to expect RISC compiler to accomodate at least part of it in | |
| 133 | * the register bank, isn't it? Unfortunately not all compilers | |
| 134 | * "find" this expectation reasonable:-( On order to make such | |
| 135 | * compilers generate better code I replace X[] with a bunch of | |
| 136 | * X0, X1, etc. See the function body below... | |
| 137 | * <appro@fy.chalmers.se> | |
| 138 | */ | |
| 139 | # define X(i) XX##i | |
| 140 | #else | |
| 141 | /* | |
| 142 | * However! Some compilers (most notably HP C) get overwhelmed by | |
| 143 | * that many local variables so that we have to have the way to | |
| 144 | * fall down to the original behavior. | |
| 145 | */ | |
| 146 | # define X(i) XX[i] | |
| 147 | #endif | |
| 148 | ||
| 39037602 | 149 | static void sha1_compress(ccdigest_state_t s, size_t num, const void *buf) |
| fe8ab488 A |
150 | { |
| 151 | const unsigned char *data=buf; | |
| 152 | register uint32_t A,B,C,D,E,T,l; | |
| 153 | #ifndef MD32_XARRAY | |
| 154 | uint32_t XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7, | |
| 155 | XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15; | |
| 156 | #else | |
| 157 | uint32_t XX[16]; | |
| 158 | #endif | |
| 159 | uint32_t *state=ccdigest_u32(s); | |
| 160 | ||
| 161 | A=state[0]; | |
| 162 | B=state[1]; | |
| 163 | C=state[2]; | |
| 164 | D=state[3]; | |
| 165 | E=state[4]; | |
| 166 | ||
| 167 | for (;;) | |
| 168 | { | |
| 169 | ||
| 170 | HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l; | |
| 171 | BODY_00_15( 0,A,B,C,D,E,T,X( 0)); HOST_c2l(data,l); X( 2)=l; | |
| 172 | BODY_00_15( 1,T,A,B,C,D,E,X( 1)); HOST_c2l(data,l); X( 3)=l; | |
| 173 | BODY_00_15( 2,E,T,A,B,C,D,X( 2)); HOST_c2l(data,l); X( 4)=l; | |
| 174 | BODY_00_15( 3,D,E,T,A,B,C,X( 3)); HOST_c2l(data,l); X( 5)=l; | |
| 175 | BODY_00_15( 4,C,D,E,T,A,B,X( 4)); HOST_c2l(data,l); X( 6)=l; | |
| 176 | BODY_00_15( 5,B,C,D,E,T,A,X( 5)); HOST_c2l(data,l); X( 7)=l; | |
| 177 | BODY_00_15( 6,A,B,C,D,E,T,X( 6)); HOST_c2l(data,l); X( 8)=l; | |
| 178 | BODY_00_15( 7,T,A,B,C,D,E,X( 7)); HOST_c2l(data,l); X( 9)=l; | |
| 179 | BODY_00_15( 8,E,T,A,B,C,D,X( 8)); HOST_c2l(data,l); X(10)=l; | |
| 180 | BODY_00_15( 9,D,E,T,A,B,C,X( 9)); HOST_c2l(data,l); X(11)=l; | |
| 181 | BODY_00_15(10,C,D,E,T,A,B,X(10)); HOST_c2l(data,l); X(12)=l; | |
| 182 | BODY_00_15(11,B,C,D,E,T,A,X(11)); HOST_c2l(data,l); X(13)=l; | |
| 183 | BODY_00_15(12,A,B,C,D,E,T,X(12)); HOST_c2l(data,l); X(14)=l; | |
| 184 | BODY_00_15(13,T,A,B,C,D,E,X(13)); HOST_c2l(data,l); X(15)=l; | |
| 185 | BODY_00_15(14,E,T,A,B,C,D,X(14)); | |
| 186 | BODY_00_15(15,D,E,T,A,B,C,X(15)); | |
| 187 | ||
| 188 | BODY_16_19(16,C,D,E,T,A,B,X( 0),X( 0),X( 2),X( 8),X(13)); | |
| 189 | BODY_16_19(17,B,C,D,E,T,A,X( 1),X( 1),X( 3),X( 9),X(14)); | |
| 190 | BODY_16_19(18,A,B,C,D,E,T,X( 2),X( 2),X( 4),X(10),X(15)); | |
| 191 | BODY_16_19(19,T,A,B,C,D,E,X( 3),X( 3),X( 5),X(11),X( 0)); | |
| 192 | ||
| 193 | BODY_20_31(20,E,T,A,B,C,D,X( 4),X( 4),X( 6),X(12),X( 1)); | |
| 194 | BODY_20_31(21,D,E,T,A,B,C,X( 5),X( 5),X( 7),X(13),X( 2)); | |
| 195 | BODY_20_31(22,C,D,E,T,A,B,X( 6),X( 6),X( 8),X(14),X( 3)); | |
| 196 | BODY_20_31(23,B,C,D,E,T,A,X( 7),X( 7),X( 9),X(15),X( 4)); | |
| 197 | BODY_20_31(24,A,B,C,D,E,T,X( 8),X( 8),X(10),X( 0),X( 5)); | |
| 198 | BODY_20_31(25,T,A,B,C,D,E,X( 9),X( 9),X(11),X( 1),X( 6)); | |
| 199 | BODY_20_31(26,E,T,A,B,C,D,X(10),X(10),X(12),X( 2),X( 7)); | |
| 200 | BODY_20_31(27,D,E,T,A,B,C,X(11),X(11),X(13),X( 3),X( 8)); | |
| 201 | BODY_20_31(28,C,D,E,T,A,B,X(12),X(12),X(14),X( 4),X( 9)); | |
| 202 | BODY_20_31(29,B,C,D,E,T,A,X(13),X(13),X(15),X( 5),X(10)); | |
| 203 | BODY_20_31(30,A,B,C,D,E,T,X(14),X(14),X( 0),X( 6),X(11)); | |
| 204 | BODY_20_31(31,T,A,B,C,D,E,X(15),X(15),X( 1),X( 7),X(12)); | |
| 205 | ||
| 206 | BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13)); | |
| 207 | BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14)); | |
| 208 | BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15)); | |
| 209 | BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0)); | |
| 210 | BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1)); | |
| 211 | BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2)); | |
| 212 | BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3)); | |
| 213 | BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4)); | |
| 214 | ||
| 215 | BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5)); | |
| 216 | BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6)); | |
| 217 | BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7)); | |
| 218 | BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8)); | |
| 219 | BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9)); | |
| 220 | BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10)); | |
| 221 | BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11)); | |
| 222 | BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12)); | |
| 223 | BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13)); | |
| 224 | BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14)); | |
| 225 | BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15)); | |
| 226 | BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0)); | |
| 227 | BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1)); | |
| 228 | BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2)); | |
| 229 | BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3)); | |
| 230 | BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4)); | |
| 231 | BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5)); | |
| 232 | BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6)); | |
| 233 | BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7)); | |
| 234 | BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8)); | |
| 235 | ||
| 236 | BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9)); | |
| 237 | BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10)); | |
| 238 | BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11)); | |
| 239 | BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12)); | |
| 240 | BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13)); | |
| 241 | BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14)); | |
| 242 | BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15)); | |
| 243 | BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0)); | |
| 244 | BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1)); | |
| 245 | BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2)); | |
| 246 | BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3)); | |
| 247 | BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4)); | |
| 248 | BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5)); | |
| 249 | BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6)); | |
| 250 | BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7)); | |
| 251 | BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8)); | |
| 252 | BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9)); | |
| 253 | BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10)); | |
| 254 | BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11)); | |
| 255 | BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12)); | |
| 256 | ||
| 257 | state[0]=(state[0]+E)&0xffffffff; | |
| 258 | state[1]=(state[1]+T)&0xffffffff; | |
| 259 | state[2]=(state[2]+A)&0xffffffff; | |
| 260 | state[3]=(state[3]+B)&0xffffffff; | |
| 261 | state[4]=(state[4]+C)&0xffffffff; | |
| 262 | ||
| 263 | if (--num <= 0) break; | |
| 264 | ||
| 265 | A=state[0]; | |
| 266 | B=state[1]; | |
| 267 | C=state[2]; | |
| 268 | D=state[3]; | |
| 269 | E=state[4]; | |
| 270 | ||
| 271 | } | |
| 272 | } | |
| 273 | ||
| 274 | const struct ccdigest_info ccsha1_eay_di = { | |
| 275 | .output_size = CCSHA1_OUTPUT_SIZE, | |
| 276 | .state_size = CCSHA1_STATE_SIZE, | |
| 277 | .block_size = CCSHA1_BLOCK_SIZE, | |
| 278 | .oid_size = ccoid_sha1_len, | |
| 279 | .oid = CC_DIGEST_OID_SHA1, | |
| 280 | .initial_state = ccsha1_initial_state, | |
| 281 | .compress = sha1_compress, | |
| 282 | .final = ccdigest_final_64be, | |
| 283 | }; |