1 /* Modified to work without OPENSSL
2 * os_crypto (www.ossec.net/c/os_crypto)
3 * Daniel B. Cid, danielcid@gmail.com
6 /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
9 * This package is an SSL implementation written
10 * by Eric Young (eay@cryptsoft.com).
11 * The implementation was written so as to conform with Netscapes SSL.
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@cryptsoft.com).
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.
27 * Redistribution and use in source and binary forms, with or without
28 * modification, are permitted provided that the following conditions
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@cryptsoft.com)"
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@cryptsoft.com)"
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
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.]
63 #ifndef HEADER_BF_LOCL_H
64 #define HEADER_BF_LOCL_H
66 /* Only include if OPENSSL is present */
67 #ifdef LIBOPENSSL_ENABLED
68 #include <openssl/opensslconf.h> /* BF_PTR, BF_PTR2 */
72 #define c2l(c,l) (l =((unsigned long)(*((c)++))) , \
73 l|=((unsigned long)(*((c)++)))<< 8L, \
74 l|=((unsigned long)(*((c)++)))<<16L, \
75 l|=((unsigned long)(*((c)++)))<<24L)
77 /* NOTE - c is not incremented as per c2l */
79 #define c2ln(c,l1,l2,n) { \
83 case 8: l2 =((unsigned long)(*(--(c))))<<24L; \
84 case 7: l2|=((unsigned long)(*(--(c))))<<16L; \
85 case 6: l2|=((unsigned long)(*(--(c))))<< 8L; \
86 case 5: l2|=((unsigned long)(*(--(c)))); \
87 case 4: l1 =((unsigned long)(*(--(c))))<<24L; \
88 case 3: l1|=((unsigned long)(*(--(c))))<<16L; \
89 case 2: l1|=((unsigned long)(*(--(c))))<< 8L; \
90 case 1: l1|=((unsigned long)(*(--(c)))); \
95 #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
96 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
97 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
98 *((c)++)=(unsigned char)(((l)>>24L)&0xff))
100 /* NOTE - c is not incremented as per l2c */
102 #define l2cn(l1,l2,c,n) { \
105 case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
106 case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
107 case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
108 case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
109 case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
110 case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
111 case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
112 case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
116 /* NOTE - c is not incremented as per n2l */
117 #define n2ln(c,l1,l2,n) { \
121 case 8: l2 =((unsigned long)(*(--(c)))) ; \
122 case 7: l2|=((unsigned long)(*(--(c))))<< 8; \
123 case 6: l2|=((unsigned long)(*(--(c))))<<16; \
124 case 5: l2|=((unsigned long)(*(--(c))))<<24; \
125 case 4: l1 =((unsigned long)(*(--(c)))) ; \
126 case 3: l1|=((unsigned long)(*(--(c))))<< 8; \
127 case 2: l1|=((unsigned long)(*(--(c))))<<16; \
128 case 1: l1|=((unsigned long)(*(--(c))))<<24; \
132 /* NOTE - c is not incremented as per l2n */
133 #define l2nn(l1,l2,c,n) { \
136 case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \
137 case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
138 case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
139 case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
140 case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \
141 case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
142 case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
143 case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
148 #define n2l(c,l) (l =((unsigned long)(*((c)++)))<<24L, \
149 l|=((unsigned long)(*((c)++)))<<16L, \
150 l|=((unsigned long)(*((c)++)))<< 8L, \
151 l|=((unsigned long)(*((c)++))))
154 #define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
155 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
156 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
157 *((c)++)=(unsigned char)(((l) )&0xff))
159 /* This is actually a big endian algorithm, the most significant byte
160 * is used to lookup array 0 */
165 * This is basically a special Intel version. Point is that Intel
166 * doesn't have many registers, but offers a reach choice of addressing
167 * modes. So we spare some registers by directly traversing BF_KEY
168 * structure and hiring the most decorated addressing mode. The code
169 * generated by EGCS is *perfectly* competitive with assembler
172 #define BF_ENC(LL,R,KEY,Pi) (\
174 t= KEY[BF_ROUNDS+2 + 0 + ((R>>24)&0xFF)], \
175 t+= KEY[BF_ROUNDS+2 + 256 + ((R>>16)&0xFF)], \
176 t^= KEY[BF_ROUNDS+2 + 512 + ((R>>8 )&0xFF)], \
177 t+= KEY[BF_ROUNDS+2 + 768 + ((R )&0xFF)], \
181 #elif defined(BF_PTR)
184 #define BF_LONG_LOG2 2 /* default to BF_LONG being 32 bits */
186 #define BF_M (0xFF<<BF_LONG_LOG2)
187 #define BF_0 (24-BF_LONG_LOG2)
188 #define BF_1 (16-BF_LONG_LOG2)
189 #define BF_2 ( 8-BF_LONG_LOG2)
190 #define BF_3 BF_LONG_LOG2 /* left shift */
193 * This is normally very good on RISC platforms where normally you
194 * have to explicitly "multiply" array index by sizeof(BF_LONG)
195 * in order to calculate the effective address. This implementation
196 * excuses CPU from this extra work. Power[PC] uses should have most
197 * fun as (R>>BF_i)&BF_M gets folded into a single instruction, namely
198 * rlwinm. So let'em double-check if their compiler does it.
201 #define BF_ENC(LL,R,S,P) ( \
203 LL^= (((*(BF_LONG *)((unsigned char *)&(S[ 0])+((R>>BF_0)&BF_M))+ \
204 *(BF_LONG *)((unsigned char *)&(S[256])+((R>>BF_1)&BF_M)))^ \
205 *(BF_LONG *)((unsigned char *)&(S[512])+((R>>BF_2)&BF_M)))+ \
206 *(BF_LONG *)((unsigned char *)&(S[768])+((R<<BF_3)&BF_M))) \
211 * This is a *generic* version. Seem to perform best on platforms that
212 * offer explicit support for extraction of 8-bit nibbles preferably
213 * complemented with "multiplying" of array index by sizeof(BF_LONG).
214 * For the moment of this writing the list comprises Alpha CPU featuring
215 * extbl and s[48]addq instructions.
218 #define BF_ENC(LL,R,S,P) ( \
220 LL^=((( S[ ((int)(R>>24)&0xff)] + \
221 S[0x0100+((int)(R>>16)&0xff)])^ \
222 S[0x0200+((int)(R>> 8)&0xff)])+ \
223 S[0x0300+((int)(R )&0xff)])&0xffffffffL \