1*0Sstevel@tonic-gate /* crypto/bf/bf_locl.h */ 2*0Sstevel@tonic-gate /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com) 3*0Sstevel@tonic-gate * All rights reserved. 4*0Sstevel@tonic-gate * 5*0Sstevel@tonic-gate * This package is an SSL implementation written 6*0Sstevel@tonic-gate * by Eric Young (eay@cryptsoft.com). 7*0Sstevel@tonic-gate * The implementation was written so as to conform with Netscapes SSL. 8*0Sstevel@tonic-gate * 9*0Sstevel@tonic-gate * This library is free for commercial and non-commercial use as long as 10*0Sstevel@tonic-gate * the following conditions are aheared to. The following conditions 11*0Sstevel@tonic-gate * apply to all code found in this distribution, be it the RC4, RSA, 12*0Sstevel@tonic-gate * lhash, DES, etc., code; not just the SSL code. The SSL documentation 13*0Sstevel@tonic-gate * included with this distribution is covered by the same copyright terms 14*0Sstevel@tonic-gate * except that the holder is Tim Hudson (tjh@cryptsoft.com). 15*0Sstevel@tonic-gate * 16*0Sstevel@tonic-gate * Copyright remains Eric Young's, and as such any Copyright notices in 17*0Sstevel@tonic-gate * the code are not to be removed. 18*0Sstevel@tonic-gate * If this package is used in a product, Eric Young should be given attribution 19*0Sstevel@tonic-gate * as the author of the parts of the library used. 20*0Sstevel@tonic-gate * This can be in the form of a textual message at program startup or 21*0Sstevel@tonic-gate * in documentation (online or textual) provided with the package. 22*0Sstevel@tonic-gate * 23*0Sstevel@tonic-gate * Redistribution and use in source and binary forms, with or without 24*0Sstevel@tonic-gate * modification, are permitted provided that the following conditions 25*0Sstevel@tonic-gate * are met: 26*0Sstevel@tonic-gate * 1. Redistributions of source code must retain the copyright 27*0Sstevel@tonic-gate * notice, this list of conditions and the following disclaimer. 28*0Sstevel@tonic-gate * 2. Redistributions in binary form must reproduce the above copyright 29*0Sstevel@tonic-gate * notice, this list of conditions and the following disclaimer in the 30*0Sstevel@tonic-gate * documentation and/or other materials provided with the distribution. 31*0Sstevel@tonic-gate * 3. All advertising materials mentioning features or use of this software 32*0Sstevel@tonic-gate * must display the following acknowledgement: 33*0Sstevel@tonic-gate * "This product includes cryptographic software written by 34*0Sstevel@tonic-gate * Eric Young (eay@cryptsoft.com)" 35*0Sstevel@tonic-gate * The word 'cryptographic' can be left out if the rouines from the library 36*0Sstevel@tonic-gate * being used are not cryptographic related :-). 37*0Sstevel@tonic-gate * 4. If you include any Windows specific code (or a derivative thereof) from 38*0Sstevel@tonic-gate * the apps directory (application code) you must include an acknowledgement: 39*0Sstevel@tonic-gate * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" 40*0Sstevel@tonic-gate * 41*0Sstevel@tonic-gate * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 42*0Sstevel@tonic-gate * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 43*0Sstevel@tonic-gate * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 44*0Sstevel@tonic-gate * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 45*0Sstevel@tonic-gate * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 46*0Sstevel@tonic-gate * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 47*0Sstevel@tonic-gate * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 48*0Sstevel@tonic-gate * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 49*0Sstevel@tonic-gate * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 50*0Sstevel@tonic-gate * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 51*0Sstevel@tonic-gate * SUCH DAMAGE. 52*0Sstevel@tonic-gate * 53*0Sstevel@tonic-gate * The licence and distribution terms for any publically available version or 54*0Sstevel@tonic-gate * derivative of this code cannot be changed. i.e. this code cannot simply be 55*0Sstevel@tonic-gate * copied and put under another distribution licence 56*0Sstevel@tonic-gate * [including the GNU Public Licence.] 57*0Sstevel@tonic-gate */ 58*0Sstevel@tonic-gate 59*0Sstevel@tonic-gate #ifndef HEADER_BF_LOCL_H 60*0Sstevel@tonic-gate #define HEADER_BF_LOCL_H 61*0Sstevel@tonic-gate #include <openssl/opensslconf.h> /* BF_PTR, BF_PTR2 */ 62*0Sstevel@tonic-gate 63*0Sstevel@tonic-gate #undef c2l 64*0Sstevel@tonic-gate #define c2l(c,l) (l =((unsigned long)(*((c)++))) , \ 65*0Sstevel@tonic-gate l|=((unsigned long)(*((c)++)))<< 8L, \ 66*0Sstevel@tonic-gate l|=((unsigned long)(*((c)++)))<<16L, \ 67*0Sstevel@tonic-gate l|=((unsigned long)(*((c)++)))<<24L) 68*0Sstevel@tonic-gate 69*0Sstevel@tonic-gate /* NOTE - c is not incremented as per c2l */ 70*0Sstevel@tonic-gate #undef c2ln 71*0Sstevel@tonic-gate #define c2ln(c,l1,l2,n) { \ 72*0Sstevel@tonic-gate c+=n; \ 73*0Sstevel@tonic-gate l1=l2=0; \ 74*0Sstevel@tonic-gate switch (n) { \ 75*0Sstevel@tonic-gate case 8: l2 =((unsigned long)(*(--(c))))<<24L; \ 76*0Sstevel@tonic-gate case 7: l2|=((unsigned long)(*(--(c))))<<16L; \ 77*0Sstevel@tonic-gate case 6: l2|=((unsigned long)(*(--(c))))<< 8L; \ 78*0Sstevel@tonic-gate case 5: l2|=((unsigned long)(*(--(c)))); \ 79*0Sstevel@tonic-gate case 4: l1 =((unsigned long)(*(--(c))))<<24L; \ 80*0Sstevel@tonic-gate case 3: l1|=((unsigned long)(*(--(c))))<<16L; \ 81*0Sstevel@tonic-gate case 2: l1|=((unsigned long)(*(--(c))))<< 8L; \ 82*0Sstevel@tonic-gate case 1: l1|=((unsigned long)(*(--(c)))); \ 83*0Sstevel@tonic-gate } \ 84*0Sstevel@tonic-gate } 85*0Sstevel@tonic-gate 86*0Sstevel@tonic-gate #undef l2c 87*0Sstevel@tonic-gate #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ 88*0Sstevel@tonic-gate *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ 89*0Sstevel@tonic-gate *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ 90*0Sstevel@tonic-gate *((c)++)=(unsigned char)(((l)>>24L)&0xff)) 91*0Sstevel@tonic-gate 92*0Sstevel@tonic-gate /* NOTE - c is not incremented as per l2c */ 93*0Sstevel@tonic-gate #undef l2cn 94*0Sstevel@tonic-gate #define l2cn(l1,l2,c,n) { \ 95*0Sstevel@tonic-gate c+=n; \ 96*0Sstevel@tonic-gate switch (n) { \ 97*0Sstevel@tonic-gate case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \ 98*0Sstevel@tonic-gate case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \ 99*0Sstevel@tonic-gate case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \ 100*0Sstevel@tonic-gate case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \ 101*0Sstevel@tonic-gate case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \ 102*0Sstevel@tonic-gate case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \ 103*0Sstevel@tonic-gate case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \ 104*0Sstevel@tonic-gate case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \ 105*0Sstevel@tonic-gate } \ 106*0Sstevel@tonic-gate } 107*0Sstevel@tonic-gate 108*0Sstevel@tonic-gate /* NOTE - c is not incremented as per n2l */ 109*0Sstevel@tonic-gate #define n2ln(c,l1,l2,n) { \ 110*0Sstevel@tonic-gate c+=n; \ 111*0Sstevel@tonic-gate l1=l2=0; \ 112*0Sstevel@tonic-gate switch (n) { \ 113*0Sstevel@tonic-gate case 8: l2 =((unsigned long)(*(--(c)))) ; \ 114*0Sstevel@tonic-gate case 7: l2|=((unsigned long)(*(--(c))))<< 8; \ 115*0Sstevel@tonic-gate case 6: l2|=((unsigned long)(*(--(c))))<<16; \ 116*0Sstevel@tonic-gate case 5: l2|=((unsigned long)(*(--(c))))<<24; \ 117*0Sstevel@tonic-gate case 4: l1 =((unsigned long)(*(--(c)))) ; \ 118*0Sstevel@tonic-gate case 3: l1|=((unsigned long)(*(--(c))))<< 8; \ 119*0Sstevel@tonic-gate case 2: l1|=((unsigned long)(*(--(c))))<<16; \ 120*0Sstevel@tonic-gate case 1: l1|=((unsigned long)(*(--(c))))<<24; \ 121*0Sstevel@tonic-gate } \ 122*0Sstevel@tonic-gate } 123*0Sstevel@tonic-gate 124*0Sstevel@tonic-gate /* NOTE - c is not incremented as per l2n */ 125*0Sstevel@tonic-gate #define l2nn(l1,l2,c,n) { \ 126*0Sstevel@tonic-gate c+=n; \ 127*0Sstevel@tonic-gate switch (n) { \ 128*0Sstevel@tonic-gate case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \ 129*0Sstevel@tonic-gate case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \ 130*0Sstevel@tonic-gate case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \ 131*0Sstevel@tonic-gate case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \ 132*0Sstevel@tonic-gate case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \ 133*0Sstevel@tonic-gate case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \ 134*0Sstevel@tonic-gate case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \ 135*0Sstevel@tonic-gate case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \ 136*0Sstevel@tonic-gate } \ 137*0Sstevel@tonic-gate } 138*0Sstevel@tonic-gate 139*0Sstevel@tonic-gate #undef n2l 140*0Sstevel@tonic-gate #define n2l(c,l) (l =((unsigned long)(*((c)++)))<<24L, \ 141*0Sstevel@tonic-gate l|=((unsigned long)(*((c)++)))<<16L, \ 142*0Sstevel@tonic-gate l|=((unsigned long)(*((c)++)))<< 8L, \ 143*0Sstevel@tonic-gate l|=((unsigned long)(*((c)++)))) 144*0Sstevel@tonic-gate 145*0Sstevel@tonic-gate #undef l2n 146*0Sstevel@tonic-gate #define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \ 147*0Sstevel@tonic-gate *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ 148*0Sstevel@tonic-gate *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ 149*0Sstevel@tonic-gate *((c)++)=(unsigned char)(((l) )&0xff)) 150*0Sstevel@tonic-gate 151*0Sstevel@tonic-gate /* This is actually a big endian algorithm, the most significant byte 152*0Sstevel@tonic-gate * is used to lookup array 0 */ 153*0Sstevel@tonic-gate 154*0Sstevel@tonic-gate #if defined(BF_PTR2) 155*0Sstevel@tonic-gate 156*0Sstevel@tonic-gate /* 157*0Sstevel@tonic-gate * This is basically a special Intel version. Point is that Intel 158*0Sstevel@tonic-gate * doesn't have many registers, but offers a reach choice of addressing 159*0Sstevel@tonic-gate * modes. So we spare some registers by directly traversing BF_KEY 160*0Sstevel@tonic-gate * structure and hiring the most decorated addressing mode. The code 161*0Sstevel@tonic-gate * generated by EGCS is *perfectly* competitive with assembler 162*0Sstevel@tonic-gate * implementation! 163*0Sstevel@tonic-gate */ 164*0Sstevel@tonic-gate #define BF_ENC(LL,R,KEY,Pi) (\ 165*0Sstevel@tonic-gate LL^=KEY[Pi], \ 166*0Sstevel@tonic-gate t= KEY[BF_ROUNDS+2 + 0 + ((R>>24)&0xFF)], \ 167*0Sstevel@tonic-gate t+= KEY[BF_ROUNDS+2 + 256 + ((R>>16)&0xFF)], \ 168*0Sstevel@tonic-gate t^= KEY[BF_ROUNDS+2 + 512 + ((R>>8 )&0xFF)], \ 169*0Sstevel@tonic-gate t+= KEY[BF_ROUNDS+2 + 768 + ((R )&0xFF)], \ 170*0Sstevel@tonic-gate LL^=t \ 171*0Sstevel@tonic-gate ) 172*0Sstevel@tonic-gate 173*0Sstevel@tonic-gate #elif defined(BF_PTR) 174*0Sstevel@tonic-gate 175*0Sstevel@tonic-gate #ifndef BF_LONG_LOG2 176*0Sstevel@tonic-gate #define BF_LONG_LOG2 2 /* default to BF_LONG being 32 bits */ 177*0Sstevel@tonic-gate #endif 178*0Sstevel@tonic-gate #define BF_M (0xFF<<BF_LONG_LOG2) 179*0Sstevel@tonic-gate #define BF_0 (24-BF_LONG_LOG2) 180*0Sstevel@tonic-gate #define BF_1 (16-BF_LONG_LOG2) 181*0Sstevel@tonic-gate #define BF_2 ( 8-BF_LONG_LOG2) 182*0Sstevel@tonic-gate #define BF_3 BF_LONG_LOG2 /* left shift */ 183*0Sstevel@tonic-gate 184*0Sstevel@tonic-gate /* 185*0Sstevel@tonic-gate * This is normally very good on RISC platforms where normally you 186*0Sstevel@tonic-gate * have to explicitly "multiply" array index by sizeof(BF_LONG) 187*0Sstevel@tonic-gate * in order to calculate the effective address. This implementation 188*0Sstevel@tonic-gate * excuses CPU from this extra work. Power[PC] uses should have most 189*0Sstevel@tonic-gate * fun as (R>>BF_i)&BF_M gets folded into a single instruction, namely 190*0Sstevel@tonic-gate * rlwinm. So let'em double-check if their compiler does it. 191*0Sstevel@tonic-gate */ 192*0Sstevel@tonic-gate 193*0Sstevel@tonic-gate #define BF_ENC(LL,R,S,P) ( \ 194*0Sstevel@tonic-gate LL^=P, \ 195*0Sstevel@tonic-gate LL^= (((*(BF_LONG *)((unsigned char *)&(S[ 0])+((R>>BF_0)&BF_M))+ \ 196*0Sstevel@tonic-gate *(BF_LONG *)((unsigned char *)&(S[256])+((R>>BF_1)&BF_M)))^ \ 197*0Sstevel@tonic-gate *(BF_LONG *)((unsigned char *)&(S[512])+((R>>BF_2)&BF_M)))+ \ 198*0Sstevel@tonic-gate *(BF_LONG *)((unsigned char *)&(S[768])+((R<<BF_3)&BF_M))) \ 199*0Sstevel@tonic-gate ) 200*0Sstevel@tonic-gate #else 201*0Sstevel@tonic-gate 202*0Sstevel@tonic-gate /* 203*0Sstevel@tonic-gate * This is a *generic* version. Seem to perform best on platforms that 204*0Sstevel@tonic-gate * offer explicit support for extraction of 8-bit nibbles preferably 205*0Sstevel@tonic-gate * complemented with "multiplying" of array index by sizeof(BF_LONG). 206*0Sstevel@tonic-gate * For the moment of this writing the list comprises Alpha CPU featuring 207*0Sstevel@tonic-gate * extbl and s[48]addq instructions. 208*0Sstevel@tonic-gate */ 209*0Sstevel@tonic-gate 210*0Sstevel@tonic-gate #define BF_ENC(LL,R,S,P) ( \ 211*0Sstevel@tonic-gate LL^=P, \ 212*0Sstevel@tonic-gate LL^=((( S[ ((int)(R>>24)&0xff)] + \ 213*0Sstevel@tonic-gate S[0x0100+((int)(R>>16)&0xff)])^ \ 214*0Sstevel@tonic-gate S[0x0200+((int)(R>> 8)&0xff)])+ \ 215*0Sstevel@tonic-gate S[0x0300+((int)(R )&0xff)])&0xffffffffL \ 216*0Sstevel@tonic-gate ) 217*0Sstevel@tonic-gate #endif 218*0Sstevel@tonic-gate 219*0Sstevel@tonic-gate #endif 220