Eneboo - Documentación para desarrolladores
src/libdigidoc/openssl/crypto/bf/bf_locl.h
Ir a la documentación de este archivo.
00001 /* crypto/bf/bf_locl.h */
00002 /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
00003  * All rights reserved.
00004  *
00005  * This package is an SSL implementation written
00006  * by Eric Young (eay@cryptsoft.com).
00007  * The implementation was written so as to conform with Netscapes SSL.
00008  * 
00009  * This library is free for commercial and non-commercial use as long as
00010  * the following conditions are aheared to.  The following conditions
00011  * apply to all code found in this distribution, be it the RC4, RSA,
00012  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
00013  * included with this distribution is covered by the same copyright terms
00014  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
00015  * 
00016  * Copyright remains Eric Young's, and as such any Copyright notices in
00017  * the code are not to be removed.
00018  * If this package is used in a product, Eric Young should be given attribution
00019  * as the author of the parts of the library used.
00020  * This can be in the form of a textual message at program startup or
00021  * in documentation (online or textual) provided with the package.
00022  * 
00023  * Redistribution and use in source and binary forms, with or without
00024  * modification, are permitted provided that the following conditions
00025  * are met:
00026  * 1. Redistributions of source code must retain the copyright
00027  *    notice, this list of conditions and the following disclaimer.
00028  * 2. Redistributions in binary form must reproduce the above copyright
00029  *    notice, this list of conditions and the following disclaimer in the
00030  *    documentation and/or other materials provided with the distribution.
00031  * 3. All advertising materials mentioning features or use of this software
00032  *    must display the following acknowledgement:
00033  *    "This product includes cryptographic software written by
00034  *     Eric Young (eay@cryptsoft.com)"
00035  *    The word 'cryptographic' can be left out if the rouines from the library
00036  *    being used are not cryptographic related :-).
00037  * 4. If you include any Windows specific code (or a derivative thereof) from 
00038  *    the apps directory (application code) you must include an acknowledgement:
00039  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
00040  * 
00041  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
00042  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00043  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
00044  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
00045  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
00046  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
00047  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
00048  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
00049  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
00050  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
00051  * SUCH DAMAGE.
00052  * 
00053  * The licence and distribution terms for any publically available version or
00054  * derivative of this code cannot be changed.  i.e. this code cannot simply be
00055  * copied and put under another distribution licence
00056  * [including the GNU Public Licence.]
00057  */
00058 
00059 #ifndef HEADER_BF_LOCL_H
00060 #define HEADER_BF_LOCL_H
00061 #include <openssl/opensslconf.h> /* BF_PTR, BF_PTR2 */
00062 
00063 #undef c2l
00064 #define c2l(c,l)        (l =((unsigned long)(*((c)++)))    , \
00065                          l|=((unsigned long)(*((c)++)))<< 8L, \
00066                          l|=((unsigned long)(*((c)++)))<<16L, \
00067                          l|=((unsigned long)(*((c)++)))<<24L)
00068 
00069 /* NOTE - c is not incremented as per c2l */
00070 #undef c2ln
00071 #define c2ln(c,l1,l2,n) { \
00072                         c+=n; \
00073                         l1=l2=0; \
00074                         switch (n) { \
00075                         case 8: l2 =((unsigned long)(*(--(c))))<<24L; \
00076                         case 7: l2|=((unsigned long)(*(--(c))))<<16L; \
00077                         case 6: l2|=((unsigned long)(*(--(c))))<< 8L; \
00078                         case 5: l2|=((unsigned long)(*(--(c))));     \
00079                         case 4: l1 =((unsigned long)(*(--(c))))<<24L; \
00080                         case 3: l1|=((unsigned long)(*(--(c))))<<16L; \
00081                         case 2: l1|=((unsigned long)(*(--(c))))<< 8L; \
00082                         case 1: l1|=((unsigned long)(*(--(c))));     \
00083                                 } \
00084                         }
00085 
00086 #undef l2c
00087 #define l2c(l,c)        (*((c)++)=(unsigned char)(((l)     )&0xff), \
00088                          *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
00089                          *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
00090                          *((c)++)=(unsigned char)(((l)>>24L)&0xff))
00091 
00092 /* NOTE - c is not incremented as per l2c */
00093 #undef l2cn
00094 #define l2cn(l1,l2,c,n) { \
00095                         c+=n; \
00096                         switch (n) { \
00097                         case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
00098                         case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
00099                         case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
00100                         case 5: *(--(c))=(unsigned char)(((l2)     )&0xff); \
00101                         case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
00102                         case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
00103                         case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
00104                         case 1: *(--(c))=(unsigned char)(((l1)     )&0xff); \
00105                                 } \
00106                         }
00107 
00108 /* NOTE - c is not incremented as per n2l */
00109 #define n2ln(c,l1,l2,n) { \
00110                         c+=n; \
00111                         l1=l2=0; \
00112                         switch (n) { \
00113                         case 8: l2 =((unsigned long)(*(--(c))))    ; \
00114                         case 7: l2|=((unsigned long)(*(--(c))))<< 8; \
00115                         case 6: l2|=((unsigned long)(*(--(c))))<<16; \
00116                         case 5: l2|=((unsigned long)(*(--(c))))<<24; \
00117                         case 4: l1 =((unsigned long)(*(--(c))))    ; \
00118                         case 3: l1|=((unsigned long)(*(--(c))))<< 8; \
00119                         case 2: l1|=((unsigned long)(*(--(c))))<<16; \
00120                         case 1: l1|=((unsigned long)(*(--(c))))<<24; \
00121                                 } \
00122                         }
00123 
00124 /* NOTE - c is not incremented as per l2n */
00125 #define l2nn(l1,l2,c,n) { \
00126                         c+=n; \
00127                         switch (n) { \
00128                         case 8: *(--(c))=(unsigned char)(((l2)    )&0xff); \
00129                         case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
00130                         case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
00131                         case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
00132                         case 4: *(--(c))=(unsigned char)(((l1)    )&0xff); \
00133                         case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
00134                         case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
00135                         case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
00136                                 } \
00137                         }
00138 
00139 #undef n2l
00140 #define n2l(c,l)        (l =((unsigned long)(*((c)++)))<<24L, \
00141                          l|=((unsigned long)(*((c)++)))<<16L, \
00142                          l|=((unsigned long)(*((c)++)))<< 8L, \
00143                          l|=((unsigned long)(*((c)++))))
00144 
00145 #undef l2n
00146 #define l2n(l,c)        (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
00147                          *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
00148                          *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
00149                          *((c)++)=(unsigned char)(((l)     )&0xff))
00150 
00151 /* This is actually a big endian algorithm, the most significant byte
00152  * is used to lookup array 0 */
00153 
00154 #if defined(BF_PTR2)
00155 
00156 /*
00157  * This is basically a special Intel version. Point is that Intel
00158  * doesn't have many registers, but offers a reach choice of addressing
00159  * modes. So we spare some registers by directly traversing BF_KEY
00160  * structure and hiring the most decorated addressing mode. The code
00161  * generated by EGCS is *perfectly* competitive with assembler
00162  * implementation!
00163  */
00164 #define BF_ENC(LL,R,KEY,Pi) (\
00165         LL^=KEY[Pi], \
00166         t=  KEY[BF_ROUNDS+2 +   0 + ((R>>24)&0xFF)], \
00167         t+= KEY[BF_ROUNDS+2 + 256 + ((R>>16)&0xFF)], \
00168         t^= KEY[BF_ROUNDS+2 + 512 + ((R>>8 )&0xFF)], \
00169         t+= KEY[BF_ROUNDS+2 + 768 + ((R    )&0xFF)], \
00170         LL^=t \
00171         )
00172 
00173 #elif defined(BF_PTR)
00174 
00175 #ifndef BF_LONG_LOG2
00176 #define BF_LONG_LOG2  2       /* default to BF_LONG being 32 bits */
00177 #endif
00178 #define BF_M  (0xFF<<BF_LONG_LOG2)
00179 #define BF_0  (24-BF_LONG_LOG2)
00180 #define BF_1  (16-BF_LONG_LOG2)
00181 #define BF_2  ( 8-BF_LONG_LOG2)
00182 #define BF_3  BF_LONG_LOG2 /* left shift */
00183 
00184 /*
00185  * This is normally very good on RISC platforms where normally you
00186  * have to explicitly "multiply" array index by sizeof(BF_LONG)
00187  * in order to calculate the effective address. This implementation
00188  * excuses CPU from this extra work. Power[PC] uses should have most
00189  * fun as (R>>BF_i)&BF_M gets folded into a single instruction, namely
00190  * rlwinm. So let'em double-check if their compiler does it.
00191  */
00192 
00193 #define BF_ENC(LL,R,S,P) ( \
00194         LL^=P, \
00195         LL^= (((*(BF_LONG *)((unsigned char *)&(S[  0])+((R>>BF_0)&BF_M))+ \
00196                 *(BF_LONG *)((unsigned char *)&(S[256])+((R>>BF_1)&BF_M)))^ \
00197                 *(BF_LONG *)((unsigned char *)&(S[512])+((R>>BF_2)&BF_M)))+ \
00198                 *(BF_LONG *)((unsigned char *)&(S[768])+((R<<BF_3)&BF_M))) \
00199         )
00200 #else
00201 
00202 /*
00203  * This is a *generic* version. Seem to perform best on platforms that
00204  * offer explicit support for extraction of 8-bit nibbles preferably
00205  * complemented with "multiplying" of array index by sizeof(BF_LONG).
00206  * For the moment of this writing the list comprises Alpha CPU featuring
00207  * extbl and s[48]addq instructions.
00208  */
00209 
00210 #define BF_ENC(LL,R,S,P) ( \
00211         LL^=P, \
00212         LL^=((( S[       ((int)(R>>24)&0xff)] + \
00213                 S[0x0100+((int)(R>>16)&0xff)])^ \
00214                 S[0x0200+((int)(R>> 8)&0xff)])+ \
00215                 S[0x0300+((int)(R    )&0xff)])&0xffffffffL \
00216         )
00217 #endif
00218 
00219 #endif
 Todo Clases Namespaces Archivos Funciones Variables 'typedefs' Enumeraciones Valores de enumeraciones Propiedades Amigas 'defines'