diff options
Diffstat (limited to 'src/lib/libcrypto/cast/cast_lcl.h')
| -rw-r--r-- | src/lib/libcrypto/cast/cast_lcl.h | 215 |
1 files changed, 0 insertions, 215 deletions
diff --git a/src/lib/libcrypto/cast/cast_lcl.h b/src/lib/libcrypto/cast/cast_lcl.h deleted file mode 100644 index 6ae6c23d71..0000000000 --- a/src/lib/libcrypto/cast/cast_lcl.h +++ /dev/null | |||
| @@ -1,215 +0,0 @@ | |||
| 1 | /* $OpenBSD: cast_lcl.h,v 1.10 2014/06/12 15:49:28 deraadt Exp $ */ | ||
| 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 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 | #undef c2l | ||
| 60 | #define c2l(c,l) (l =((unsigned long)(*((c)++))) , \ | ||
| 61 | l|=((unsigned long)(*((c)++)))<< 8L, \ | ||
| 62 | l|=((unsigned long)(*((c)++)))<<16L, \ | ||
| 63 | l|=((unsigned long)(*((c)++)))<<24L) | ||
| 64 | |||
| 65 | /* NOTE - c is not incremented as per c2l */ | ||
| 66 | #undef c2ln | ||
| 67 | #define c2ln(c,l1,l2,n) { \ | ||
| 68 | c+=n; \ | ||
| 69 | l1=l2=0; \ | ||
| 70 | switch (n) { \ | ||
| 71 | case 8: l2 =((unsigned long)(*(--(c))))<<24L; \ | ||
| 72 | case 7: l2|=((unsigned long)(*(--(c))))<<16L; \ | ||
| 73 | case 6: l2|=((unsigned long)(*(--(c))))<< 8L; \ | ||
| 74 | case 5: l2|=((unsigned long)(*(--(c)))); \ | ||
| 75 | case 4: l1 =((unsigned long)(*(--(c))))<<24L; \ | ||
| 76 | case 3: l1|=((unsigned long)(*(--(c))))<<16L; \ | ||
| 77 | case 2: l1|=((unsigned long)(*(--(c))))<< 8L; \ | ||
| 78 | case 1: l1|=((unsigned long)(*(--(c)))); \ | ||
| 79 | } \ | ||
| 80 | } | ||
| 81 | |||
| 82 | #undef l2c | ||
| 83 | #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ | ||
| 84 | *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ | ||
| 85 | *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ | ||
| 86 | *((c)++)=(unsigned char)(((l)>>24L)&0xff)) | ||
| 87 | |||
| 88 | /* NOTE - c is not incremented as per l2c */ | ||
| 89 | #undef l2cn | ||
| 90 | #define l2cn(l1,l2,c,n) { \ | ||
| 91 | c+=n; \ | ||
| 92 | switch (n) { \ | ||
| 93 | case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \ | ||
| 94 | case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \ | ||
| 95 | case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \ | ||
| 96 | case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \ | ||
| 97 | case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \ | ||
| 98 | case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \ | ||
| 99 | case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \ | ||
| 100 | case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \ | ||
| 101 | } \ | ||
| 102 | } | ||
| 103 | |||
| 104 | /* NOTE - c is not incremented as per n2l */ | ||
| 105 | #define n2ln(c,l1,l2,n) { \ | ||
| 106 | c+=n; \ | ||
| 107 | l1=l2=0; \ | ||
| 108 | switch (n) { \ | ||
| 109 | case 8: l2 =((unsigned long)(*(--(c)))) ; \ | ||
| 110 | case 7: l2|=((unsigned long)(*(--(c))))<< 8; \ | ||
| 111 | case 6: l2|=((unsigned long)(*(--(c))))<<16; \ | ||
| 112 | case 5: l2|=((unsigned long)(*(--(c))))<<24; \ | ||
| 113 | case 4: l1 =((unsigned long)(*(--(c)))) ; \ | ||
| 114 | case 3: l1|=((unsigned long)(*(--(c))))<< 8; \ | ||
| 115 | case 2: l1|=((unsigned long)(*(--(c))))<<16; \ | ||
| 116 | case 1: l1|=((unsigned long)(*(--(c))))<<24; \ | ||
| 117 | } \ | ||
| 118 | } | ||
| 119 | |||
| 120 | /* NOTE - c is not incremented as per l2n */ | ||
| 121 | #define l2nn(l1,l2,c,n) { \ | ||
| 122 | c+=n; \ | ||
| 123 | switch (n) { \ | ||
| 124 | case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \ | ||
| 125 | case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \ | ||
| 126 | case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \ | ||
| 127 | case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \ | ||
| 128 | case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \ | ||
| 129 | case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \ | ||
| 130 | case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \ | ||
| 131 | case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \ | ||
| 132 | } \ | ||
| 133 | } | ||
| 134 | |||
| 135 | #undef n2l | ||
| 136 | #define n2l(c,l) (l =((unsigned long)(*((c)++)))<<24L, \ | ||
| 137 | l|=((unsigned long)(*((c)++)))<<16L, \ | ||
| 138 | l|=((unsigned long)(*((c)++)))<< 8L, \ | ||
| 139 | l|=((unsigned long)(*((c)++)))) | ||
| 140 | |||
| 141 | #undef l2n | ||
| 142 | #define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \ | ||
| 143 | *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ | ||
| 144 | *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ | ||
| 145 | *((c)++)=(unsigned char)(((l) )&0xff)) | ||
| 146 | |||
| 147 | #define ROTL(a,n) ((((a)<<(n))&0xffffffffL)|((a)>>(32-(n)))) | ||
| 148 | |||
| 149 | #define C_M 0x3fc | ||
| 150 | #define C_0 22L | ||
| 151 | #define C_1 14L | ||
| 152 | #define C_2 6L | ||
| 153 | #define C_3 2L /* left shift */ | ||
| 154 | |||
| 155 | /* The rotate has an extra 16 added to it to help the x86 asm */ | ||
| 156 | #if defined(CAST_PTR) | ||
| 157 | #define E_CAST(n,key,L,R,OP1,OP2,OP3) \ | ||
| 158 | { \ | ||
| 159 | int i; \ | ||
| 160 | t=(key[n*2] OP1 R)&0xffffffffL; \ | ||
| 161 | i=key[n*2+1]; \ | ||
| 162 | t=ROTL(t,i); \ | ||
| 163 | L^= (((((*(CAST_LONG *)((unsigned char *) \ | ||
| 164 | CAST_S_table0+((t>>C_2)&C_M)) OP2 \ | ||
| 165 | *(CAST_LONG *)((unsigned char *) \ | ||
| 166 | CAST_S_table1+((t<<C_3)&C_M)))&0xffffffffL) OP3 \ | ||
| 167 | *(CAST_LONG *)((unsigned char *) \ | ||
| 168 | CAST_S_table2+((t>>C_0)&C_M)))&0xffffffffL) OP1 \ | ||
| 169 | *(CAST_LONG *)((unsigned char *) \ | ||
| 170 | CAST_S_table3+((t>>C_1)&C_M)))&0xffffffffL; \ | ||
| 171 | } | ||
| 172 | #elif defined(CAST_PTR2) | ||
| 173 | #define E_CAST(n,key,L,R,OP1,OP2,OP3) \ | ||
| 174 | { \ | ||
| 175 | int i; \ | ||
| 176 | CAST_LONG u,v,w; \ | ||
| 177 | w=(key[n*2] OP1 R)&0xffffffffL; \ | ||
| 178 | i=key[n*2+1]; \ | ||
| 179 | w=ROTL(w,i); \ | ||
| 180 | u=w>>C_2; \ | ||
| 181 | v=w<<C_3; \ | ||
| 182 | u&=C_M; \ | ||
| 183 | v&=C_M; \ | ||
| 184 | t= *(CAST_LONG *)((unsigned char *)CAST_S_table0+u); \ | ||
| 185 | u=w>>C_0; \ | ||
| 186 | t=(t OP2 *(CAST_LONG *)((unsigned char *)CAST_S_table1+v))&0xffffffffL;\ | ||
| 187 | v=w>>C_1; \ | ||
| 188 | u&=C_M; \ | ||
| 189 | v&=C_M; \ | ||
| 190 | t=(t OP3 *(CAST_LONG *)((unsigned char *)CAST_S_table2+u)&0xffffffffL);\ | ||
| 191 | t=(t OP1 *(CAST_LONG *)((unsigned char *)CAST_S_table3+v)&0xffffffffL);\ | ||
| 192 | L^=(t&0xffffffff); \ | ||
| 193 | } | ||
| 194 | #else | ||
| 195 | #define E_CAST(n,key,L,R,OP1,OP2,OP3) \ | ||
| 196 | { \ | ||
| 197 | CAST_LONG a,b,c,d; \ | ||
| 198 | t=(key[n*2] OP1 R)&0xffffffff; \ | ||
| 199 | t=ROTL(t,(key[n*2+1])); \ | ||
| 200 | a=CAST_S_table0[(t>> 8)&0xff]; \ | ||
| 201 | b=CAST_S_table1[(t )&0xff]; \ | ||
| 202 | c=CAST_S_table2[(t>>24)&0xff]; \ | ||
| 203 | d=CAST_S_table3[(t>>16)&0xff]; \ | ||
| 204 | L^=(((((a OP2 b)&0xffffffffL) OP3 c)&0xffffffffL) OP1 d)&0xffffffffL; \ | ||
| 205 | } | ||
| 206 | #endif | ||
| 207 | |||
| 208 | extern const CAST_LONG CAST_S_table0[256]; | ||
| 209 | extern const CAST_LONG CAST_S_table1[256]; | ||
| 210 | extern const CAST_LONG CAST_S_table2[256]; | ||
| 211 | extern const CAST_LONG CAST_S_table3[256]; | ||
| 212 | extern const CAST_LONG CAST_S_table4[256]; | ||
| 213 | extern const CAST_LONG CAST_S_table5[256]; | ||
| 214 | extern const CAST_LONG CAST_S_table6[256]; | ||
| 215 | extern const CAST_LONG CAST_S_table7[256]; | ||
