1 /* $FreeBSD: src/sys/crypto/blowfish/bf_locl.h,v 1.1.2.3 2002/03/26 10:12:23 ume Exp $ */ 2 /* $DragonFly: src/sys/crypto/blowfish/bf_locl.h,v 1.2 2003/06/17 04:28:20 dillon Exp $ */ 3 /* $KAME: bf_locl.h,v 1.6 2001/09/10 04:03:56 itojun Exp $ */ 4 5 /* crypto/bf/bf_local.h */ 6 /* Copyright (C) 1995-1997 Eric Young (eay@mincom.oz.au) 7 * All rights reserved. 8 * 9 * This package is an SSL implementation written 10 * by Eric Young (eay@mincom.oz.au). 11 * The implementation was written so as to conform with Netscapes SSL. 12 * 13 * This library is free for commercial and non-commercial use as long as 14 * the following conditions are aheared to. The following conditions 15 * apply to all code found in this distribution, be it the RC4, RSA, 16 * lhash, DES, etc., code; not just the SSL code. The SSL documentation 17 * included with this distribution is covered by the same copyright terms 18 * except that the holder is Tim Hudson (tjh@mincom.oz.au). 19 * 20 * Copyright remains Eric Young's, and as such any Copyright notices in 21 * the code are not to be removed. 22 * If this package is used in a product, Eric Young should be given attribution 23 * as the author of the parts of the library used. 24 * This can be in the form of a textual message at program startup or 25 * in documentation (online or textual) provided with the package. 26 * 27 * Redistribution and use in source and binary forms, with or without 28 * modification, are permitted provided that the following conditions 29 * are met: 30 * 1. Redistributions of source code must retain the copyright 31 * notice, this list of conditions and the following disclaimer. 32 * 2. Redistributions in binary form must reproduce the above copyright 33 * notice, this list of conditions and the following disclaimer in the 34 * documentation and/or other materials provided with the distribution. 35 * 3. All advertising materials mentioning features or use of this software 36 * must display the following acknowledgement: 37 * "This product includes cryptographic software written by 38 * Eric Young (eay@mincom.oz.au)" 39 * The word 'cryptographic' can be left out if the rouines from the library 40 * being used are not cryptographic related :-). 41 * 4. If you include any Windows specific code (or a derivative thereof) from 42 * the apps directory (application code) you must include an acknowledgement: 43 * "This product includes software written by Tim Hudson (tjh@mincom.oz.au)" 44 * 45 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 46 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 47 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 48 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 49 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 50 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 51 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 52 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 53 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 54 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 55 * SUCH DAMAGE. 56 * 57 * The licence and distribution terms for any publically available version or 58 * derivative of this code cannot be changed. i.e. this code cannot simply be 59 * copied and put under another distribution licence 60 * [including the GNU Public Licence.] 61 */ 62 /* WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING 63 * 64 * Always modify bf_locl.org since bf_locl.h is automatically generated from 65 * it during SSLeay configuration. 66 * 67 * WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING 68 */ 69 70 #undef c2l 71 #define c2l(c,l) (l =((BF_LONG)(*((c)++))) , \ 72 l|=((BF_LONG)(*((c)++)))<< 8L, \ 73 l|=((BF_LONG)(*((c)++)))<<16L, \ 74 l|=((BF_LONG)(*((c)++)))<<24L) 75 76 /* NOTE - c is not incremented as per c2l */ 77 #undef c2ln 78 #define c2ln(c,l1,l2,n) { \ 79 c+=n; \ 80 l1=l2=0; \ 81 switch (n) { \ 82 case 8: l2 =((BF_LONG)(*(--(c))))<<24L; \ 83 case 7: l2|=((BF_LONG)(*(--(c))))<<16L; \ 84 case 6: l2|=((BF_LONG)(*(--(c))))<< 8L; \ 85 case 5: l2|=((BF_LONG)(*(--(c)))); \ 86 case 4: l1 =((BF_LONG)(*(--(c))))<<24L; \ 87 case 3: l1|=((BF_LONG)(*(--(c))))<<16L; \ 88 case 2: l1|=((BF_LONG)(*(--(c))))<< 8L; \ 89 case 1: l1|=((BF_LONG)(*(--(c)))); \ 90 } \ 91 } 92 93 #undef l2c 94 #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ 95 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ 96 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ 97 *((c)++)=(unsigned char)(((l)>>24L)&0xff)) 98 99 /* NOTE - c is not incremented as per l2c */ 100 #undef l2cn 101 #define l2cn(l1,l2,c,n) { \ 102 c+=n; \ 103 switch (n) { \ 104 case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \ 105 case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \ 106 case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \ 107 case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \ 108 case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \ 109 case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \ 110 case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \ 111 case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \ 112 } \ 113 } 114 115 /* NOTE - c is not incremented as per n2l */ 116 #define n2ln(c,l1,l2,n) { \ 117 c+=n; \ 118 l1=l2=0; \ 119 switch (n) { \ 120 case 8: l2 =((BF_LONG)(*(--(c)))) ; \ 121 case 7: l2|=((BF_LONG)(*(--(c))))<< 8; \ 122 case 6: l2|=((BF_LONG)(*(--(c))))<<16; \ 123 case 5: l2|=((BF_LONG)(*(--(c))))<<24; \ 124 case 4: l1 =((BF_LONG)(*(--(c)))) ; \ 125 case 3: l1|=((BF_LONG)(*(--(c))))<< 8; \ 126 case 2: l1|=((BF_LONG)(*(--(c))))<<16; \ 127 case 1: l1|=((BF_LONG)(*(--(c))))<<24; \ 128 } \ 129 } 130 131 /* NOTE - c is not incremented as per l2n */ 132 #define l2nn(l1,l2,c,n) { \ 133 c+=n; \ 134 switch (n) { \ 135 case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \ 136 case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \ 137 case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \ 138 case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \ 139 case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \ 140 case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \ 141 case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \ 142 case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \ 143 } \ 144 } 145 146 #undef n2l 147 #define n2l(c,l) (l =((BF_LONG)(*((c)++)))<<24L, \ 148 l|=((BF_LONG)(*((c)++)))<<16L, \ 149 l|=((BF_LONG)(*((c)++)))<< 8L, \ 150 l|=((BF_LONG)(*((c)++)))) 151 152 #undef l2n 153 #define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \ 154 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ 155 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ 156 *((c)++)=(unsigned char)(((l) )&0xff)) 157 158 /* This is actually a big endian algorithm, the most significate byte 159 * is used to lookup array 0 */ 160 161 /* use BF_PTR2 for intel boxes, 162 * BF_PTR for sparc and MIPS/SGI 163 * use nothing for Alpha and HP. 164 */ 165 #undef BF_PTR 166 #undef BF_PTR2 167 #ifdef __i386__ 168 #define BF_PTR2 169 #else 170 #ifdef __mips__ 171 #define BF_PTR 172 #endif 173 #endif 174 175 #define BF_M 0x3fc 176 #define BF_0 22L 177 #define BF_1 14L 178 #define BF_2 6L 179 #define BF_3 2L /* left shift */ 180 181 #if defined(BF_PTR2) 182 183 /* This is basically a special pentium verson */ 184 #define BF_ENC(LL,R,S,P) \ 185 { \ 186 BF_LONG t,u,v; \ 187 u=R>>BF_0; \ 188 v=R>>BF_1; \ 189 u&=BF_M; \ 190 v&=BF_M; \ 191 t= *(BF_LONG *)((unsigned char *)&(S[ 0])+u); \ 192 u=R>>BF_2; \ 193 t+= *(BF_LONG *)((unsigned char *)&(S[256])+v); \ 194 v=R<<BF_3; \ 195 u&=BF_M; \ 196 v&=BF_M; \ 197 t^= *(BF_LONG *)((unsigned char *)&(S[512])+u); \ 198 LL^=P; \ 199 t+= *(BF_LONG *)((unsigned char *)&(S[768])+v); \ 200 LL^=t; \ 201 } 202 203 #elif defined(BF_PTR) 204 205 /* This is normally very good */ 206 207 #define BF_ENC(LL,R,S,P) \ 208 LL^=P; \ 209 LL^= (((*(BF_LONG *)((unsigned char *)&(S[ 0])+((R>>BF_0)&BF_M))+ \ 210 *(BF_LONG *)((unsigned char *)&(S[256])+((R>>BF_1)&BF_M)))^ \ 211 *(BF_LONG *)((unsigned char *)&(S[512])+((R>>BF_2)&BF_M)))+ \ 212 *(BF_LONG *)((unsigned char *)&(S[768])+((R<<BF_3)&BF_M))); 213 #else 214 215 /* This will always work, even on 64 bit machines and strangly enough, 216 * on the Alpha it is faster than the pointer versions (both 32 and 64 217 * versions of BF_LONG) */ 218 219 #define BF_ENC(LL,R,S,P) \ 220 LL^=P; \ 221 LL^=((( S[ (R>>24L) ] + \ 222 S[0x0100+((R>>16L)&0xff)])^ \ 223 S[0x0200+((R>> 8L)&0xff)])+ \ 224 S[0x0300+((R )&0xff)])&0xffffffff; 225 #endif 226