crypto/bf/bf_locl.h

   1 /* crypto/bf/bf_locl.org */
   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 /* WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
  60  *
  61  * Always modify bf_locl.org since bf_locl.h is automatically generated from
  62  * it during SSLeay configuration.
  63  *
  64  * WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
  65  */
  66
  67 /* Special defines which change the way the code is built depending on the
  68    CPU and OS.  For SGI machines you can use _MIPS_SZLONG (32 or 64) to find
  69    even newer MIPS CPU's, but at the moment one size fits all for
  70    optimization options.  Older Sparc's work better with only UNROLL, but
  71    there's no way to tell at compile time what it is you're running on */
  72
  73 #if defined( sun )                    /* Newer Sparc's */
  74 #  define BF_PTR
  75 #elif defined( __ultrix )     /* Older MIPS */
  76 #  define BF_PTR
  77 #elif defined( __osf1__ )     /* Alpha */
  78   /* None */
  79 #elif defined ( _AIX )                /* RS6000 */
  80   /* Unknown */
  81 #elif defined( __hpux )               /* HP-PA */
  82   /* None */
  83 #elif defined( __aux )                /* 68K */
  84   /* Unknown */
  85 #elif defined( __dgux )               /* 88K (but P6 in latest boxes) */
  86   /* Unknown */
  87 #elif defined( __sgi )                /* Newer MIPS */
  88 #  define BF_PTR
  89 #elif defined( i386 )         /* x86 boxes, should be gcc */
  90 #elif defined( _MSC_VER )     /* x86 boxes, Visual C */
  91 #endif /* Systems-specific speed defines */
  92
  93 #undef c2l
  94 #define c2l(c,l)        (l =((unsigned long)(*((c)++)))    , \
  95                          l|=((unsigned long)(*((c)++)))<< 8L, \
  96                          l|=((unsigned long)(*((c)++)))<<16L, \
  97                          l|=((unsigned long)(*((c)++)))<<24L)
  98
  99 /* NOTE - c is not incremented as per c2l */
 100 #undef c2ln
 101 #define c2ln(c,l1,l2,n) { \
 102                         c+=n; \
 103                         l1=l2=0; \
 104                         switch (n) { \
 105                         case 8: l2 =((unsigned long)(*(--(c))))<<24L; \
 106                         case 7: l2|=((unsigned long)(*(--(c))))<<16L; \
 107                         case 6: l2|=((unsigned long)(*(--(c))))<< 8L; \
 108                         case 5: l2|=((unsigned long)(*(--(c))));     \
 109                         case 4: l1 =((unsigned long)(*(--(c))))<<24L; \
 110                         case 3: l1|=((unsigned long)(*(--(c))))<<16L; \
 111                         case 2: l1|=((unsigned long)(*(--(c))))<< 8L; \
 112                         case 1: l1|=((unsigned long)(*(--(c))));     \
 113                                 } \
 114                         }
 115
 116 #undef l2c
 117 #define l2c(l,c)        (*((c)++)=(unsigned char)(((l)     )&0xff), \
 118                          *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
 119                          *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
 120                          *((c)++)=(unsigned char)(((l)>>24L)&0xff))
 121
 122 /* NOTE - c is not incremented as per l2c */
 123 #undef l2cn
 124 #define l2cn(l1,l2,c,n) { \
 125                         c+=n; \
 126                         switch (n) { \
 127                         case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
 128                         case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
 129                         case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
 130                         case 5: *(--(c))=(unsigned char)(((l2)     )&0xff); \
 131                         case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
 132                         case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
 133                         case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
 134                         case 1: *(--(c))=(unsigned char)(((l1)     )&0xff); \
 135                                 } \
 136                         }
 137
 138 /* NOTE - c is not incremented as per n2l */
 139 #define n2ln(c,l1,l2,n) { \
 140                         c+=n; \
 141                         l1=l2=0; \
 142                         switch (n) { \
 143                         case 8: l2 =((unsigned long)(*(--(c))))    ; \
 144                         case 7: l2|=((unsigned long)(*(--(c))))<< 8; \
 145                         case 6: l2|=((unsigned long)(*(--(c))))<<16; \
 146                         case 5: l2|=((unsigned long)(*(--(c))))<<24; \
 147                         case 4: l1 =((unsigned long)(*(--(c))))    ; \
 148                         case 3: l1|=((unsigned long)(*(--(c))))<< 8; \
 149                         case 2: l1|=((unsigned long)(*(--(c))))<<16; \
 150                         case 1: l1|=((unsigned long)(*(--(c))))<<24; \
 151                                 } \
 152                         }
 153
 154 /* NOTE - c is not incremented as per l2n */
 155 #define l2nn(l1,l2,c,n) { \
 156                         c+=n; \
 157                         switch (n) { \
 158                         case 8: *(--(c))=(unsigned char)(((l2)    )&0xff); \
 159                         case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
 160                         case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
 161                         case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
 162                         case 4: *(--(c))=(unsigned char)(((l1)    )&0xff); \
 163                         case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
 164                         case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
 165                         case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
 166                                 } \
 167                         }
 168
 169 #undef n2l
 170 #define n2l(c,l)        (l =((unsigned long)(*((c)++)))<<24L, \
 171                          l|=((unsigned long)(*((c)++)))<<16L, \
 172                          l|=((unsigned long)(*((c)++)))<< 8L, \
 173                          l|=((unsigned long)(*((c)++))))
 174
 175 #undef l2n
 176 #define l2n(l,c)        (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
 177                          *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
 178                          *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
 179                          *((c)++)=(unsigned char)(((l)     )&0xff))
 180
 181 /* This is actually a big endian algorithm, the most significate byte
 182  * is used to lookup array 0 */
 183
 184 /* use BF_PTR2 for intel boxes,
 185  * BF_PTR for sparc and MIPS/SGI
 186  * use nothing for Alpha and HP.
 187  */
 188 #if !defined(BF_PTR) && !defined(BF_PTR2)
 189 #undef BF_PTR
 190 #endif
 191
 192 #define BF_M    0x3fc
 193 #define BF_0    22L
 194 #define BF_1    14L
 195 #define BF_2     6L
 196 #define BF_3     2L /* left shift */
 197
 198 #if defined(BF_PTR2)
 199
 200 /* This is basically a special pentium verson */
 201 #define BF_ENC(LL,R,S,P) \
 202         { \
 203         BF_LONG t,u,v; \
 204         u=R>>BF_0; \
 205         v=R>>BF_1; \
 206         u&=BF_M; \
 207         v&=BF_M; \
 208         t=  *(BF_LONG *)((unsigned char *)&(S[  0])+u); \
 209         u=R>>BF_2; \
 210         t+= *(BF_LONG *)((unsigned char *)&(S[256])+v); \
 211         v=R<<BF_3; \
 212         u&=BF_M; \
 213         v&=BF_M; \
 214         t^= *(BF_LONG *)((unsigned char *)&(S[512])+u); \
 215         LL^=P; \
 216         t+= *(BF_LONG *)((unsigned char *)&(S[768])+v); \
 217         LL^=t; \
 218         }
 219
 220 #elif defined(BF_PTR)
 221
 222 /* This is normally very good */
 223
 224 #define BF_ENC(LL,R,S,P) \
 225         LL^=P; \
 226         LL^= (((*(BF_LONG *)((unsigned char *)&(S[  0])+((R>>BF_0)&BF_M))+ \
 227                 *(BF_LONG *)((unsigned char *)&(S[256])+((R>>BF_1)&BF_M)))^ \
 228                 *(BF_LONG *)((unsigned char *)&(S[512])+((R>>BF_2)&BF_M)))+ \
 229                 *(BF_LONG *)((unsigned char *)&(S[768])+((R<<BF_3)&BF_M)));
 230 #else
 231
 232 /* This will always work, even on 64 bit machines and strangly enough,
 233  * on the Alpha it is faster than the pointer versions (both 32 and 64
 234  * versions of BF_LONG) */
 235
 236 #define BF_ENC(LL,R,S,P) \
 237         LL^=P; \
 238         LL^=((( S[        (int)(R>>24L)      ] + \
 239                 S[0x0100+((int)(R>>16L)&0xff)])^ \
 240                 S[0x0200+((int)(R>> 8L)&0xff)])+ \
 241                 S[0x0300+((int)(R     )&0xff)])&0xffffffffL;
 242 #endif