]>
Commit | Line | Data |
---|---|---|
d02b48c6 RE |
1 | /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com) |
2 | * All rights reserved. | |
3 | * | |
4 | * This package is an SSL implementation written | |
5 | * by Eric Young (eay@cryptsoft.com). | |
6 | * The implementation was written so as to conform with Netscapes SSL. | |
0f113f3e | 7 | * |
d02b48c6 RE |
8 | * This library is free for commercial and non-commercial use as long as |
9 | * the following conditions are aheared to. The following conditions | |
10 | * apply to all code found in this distribution, be it the RC4, RSA, | |
11 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | |
12 | * included with this distribution is covered by the same copyright terms | |
13 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | |
0f113f3e | 14 | * |
d02b48c6 RE |
15 | * Copyright remains Eric Young's, and as such any Copyright notices in |
16 | * the code are not to be removed. | |
17 | * If this package is used in a product, Eric Young should be given attribution | |
18 | * as the author of the parts of the library used. | |
19 | * This can be in the form of a textual message at program startup or | |
20 | * in documentation (online or textual) provided with the package. | |
0f113f3e | 21 | * |
d02b48c6 RE |
22 | * Redistribution and use in source and binary forms, with or without |
23 | * modification, are permitted provided that the following conditions | |
24 | * are met: | |
25 | * 1. Redistributions of source code must retain the copyright | |
26 | * notice, this list of conditions and the following disclaimer. | |
27 | * 2. Redistributions in binary form must reproduce the above copyright | |
28 | * notice, this list of conditions and the following disclaimer in the | |
29 | * documentation and/or other materials provided with the distribution. | |
30 | * 3. All advertising materials mentioning features or use of this software | |
31 | * must display the following acknowledgement: | |
32 | * "This product includes cryptographic software written by | |
33 | * Eric Young (eay@cryptsoft.com)" | |
34 | * The word 'cryptographic' can be left out if the rouines from the library | |
35 | * being used are not cryptographic related :-). | |
0f113f3e | 36 | * 4. If you include any Windows specific code (or a derivative thereof) from |
d02b48c6 RE |
37 | * the apps directory (application code) you must include an acknowledgement: |
38 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
0f113f3e | 39 | * |
d02b48c6 RE |
40 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND |
41 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
42 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
43 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | |
44 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
45 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
46 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
48 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
49 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
50 | * SUCH DAMAGE. | |
0f113f3e | 51 | * |
d02b48c6 RE |
52 | * The licence and distribution terms for any publically available version or |
53 | * derivative of this code cannot be changed. i.e. this code cannot simply be | |
54 | * copied and put under another distribution licence | |
55 | * [including the GNU Public Licence.] | |
56 | */ | |
57 | ||
d02b48c6 | 58 | #ifndef HEADER_DES_LOCL_H |
0f113f3e | 59 | # define HEADER_DES_LOCL_H |
d02b48c6 | 60 | |
0f113f3e | 61 | # include <openssl/e_os2.h> |
a5bc1e85 | 62 | |
dc193c9c RS |
63 | # include "internal/des_conf.h" |
64 | ||
0f113f3e MC |
65 | # if defined(OPENSSL_SYS_WIN32) |
66 | # ifndef OPENSSL_SYS_MSDOS | |
67 | # define OPENSSL_SYS_MSDOS | |
68 | # endif | |
69 | # endif | |
e766a681 | 70 | |
0f113f3e MC |
71 | # include <stdio.h> |
72 | # include <stdlib.h> | |
73 | ||
74 | # ifndef OPENSSL_SYS_MSDOS | |
75 | # if !defined(OPENSSL_SYS_VMS) || defined(__DECC) | |
76 | # ifdef OPENSSL_UNISTD | |
77 | # include OPENSSL_UNISTD | |
78 | # else | |
79 | # include <unistd.h> | |
80 | # endif | |
81 | # include <math.h> | |
82 | # endif | |
83 | # endif | |
84 | # include <openssl/des.h> | |
d02b48c6 | 85 | |
0f113f3e MC |
86 | # ifdef OPENSSL_SYS_MSDOS /* Visual C++ 2.1 (Windows NT/95) */ |
87 | # include <stdlib.h> | |
88 | # include <errno.h> | |
89 | # include <time.h> | |
90 | # include <io.h> | |
91 | # endif | |
7d7d2cbc | 92 | |
0f113f3e MC |
93 | # if defined(__STDC__) || defined(OPENSSL_SYS_VMS) || defined(M_XENIX) || defined(OPENSSL_SYS_MSDOS) |
94 | # include <string.h> | |
95 | # endif | |
a5a01e90 | 96 | |
0f113f3e MC |
97 | # ifdef OPENSSL_BUILD_SHLIBCRYPTO |
98 | # undef OPENSSL_EXTERN | |
99 | # define OPENSSL_EXTERN OPENSSL_EXPORT | |
100 | # endif | |
26da3e65 | 101 | |
0f113f3e MC |
102 | # define ITERATIONS 16 |
103 | # define HALF_ITERATIONS 8 | |
d02b48c6 RE |
104 | |
105 | /* used in des_read and des_write */ | |
0f113f3e MC |
106 | # define MAXWRITE (1024*16) |
107 | # define BSIZE (MAXWRITE+4) | |
d02b48c6 | 108 | |
0f113f3e MC |
109 | # define c2l(c,l) (l =((DES_LONG)(*((c)++))) , \ |
110 | l|=((DES_LONG)(*((c)++)))<< 8L, \ | |
111 | l|=((DES_LONG)(*((c)++)))<<16L, \ | |
112 | l|=((DES_LONG)(*((c)++)))<<24L) | |
d02b48c6 RE |
113 | |
114 | /* NOTE - c is not incremented as per c2l */ | |
0f113f3e MC |
115 | # define c2ln(c,l1,l2,n) { \ |
116 | c+=n; \ | |
117 | l1=l2=0; \ | |
118 | switch (n) { \ | |
119 | case 8: l2 =((DES_LONG)(*(--(c))))<<24L; \ | |
120 | case 7: l2|=((DES_LONG)(*(--(c))))<<16L; \ | |
121 | case 6: l2|=((DES_LONG)(*(--(c))))<< 8L; \ | |
122 | case 5: l2|=((DES_LONG)(*(--(c)))); \ | |
123 | case 4: l1 =((DES_LONG)(*(--(c))))<<24L; \ | |
124 | case 3: l1|=((DES_LONG)(*(--(c))))<<16L; \ | |
125 | case 2: l1|=((DES_LONG)(*(--(c))))<< 8L; \ | |
126 | case 1: l1|=((DES_LONG)(*(--(c)))); \ | |
127 | } \ | |
128 | } | |
129 | ||
130 | # define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ | |
131 | *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ | |
132 | *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ | |
133 | *((c)++)=(unsigned char)(((l)>>24L)&0xff)) | |
134 | ||
135 | /* | |
136 | * replacements for htonl and ntohl since I have no idea what to do when | |
137 | * faced with machines with 8 byte longs. | |
138 | */ | |
139 | # define HDRSIZE 4 | |
d02b48c6 | 140 | |
0f113f3e MC |
141 | # define n2l(c,l) (l =((DES_LONG)(*((c)++)))<<24L, \ |
142 | l|=((DES_LONG)(*((c)++)))<<16L, \ | |
143 | l|=((DES_LONG)(*((c)++)))<< 8L, \ | |
144 | l|=((DES_LONG)(*((c)++)))) | |
d02b48c6 | 145 | |
0f113f3e MC |
146 | # define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \ |
147 | *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ | |
148 | *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ | |
149 | *((c)++)=(unsigned char)(((l) )&0xff)) | |
d02b48c6 | 150 | |
0f113f3e MC |
151 | /* NOTE - c is not incremented as per l2c */ |
152 | # define l2cn(l1,l2,c,n) { \ | |
153 | c+=n; \ | |
154 | switch (n) { \ | |
155 | case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \ | |
156 | case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \ | |
157 | case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \ | |
158 | case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \ | |
159 | case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \ | |
160 | case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \ | |
161 | case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \ | |
162 | case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \ | |
163 | } \ | |
164 | } | |
165 | ||
166 | # if (defined(OPENSSL_SYS_WIN32) && defined(_MSC_VER)) | |
167 | # define ROTATE(a,n) (_lrotr(a,n)) | |
168 | # elif defined(__ICC) | |
169 | # define ROTATE(a,n) (_rotr(a,n)) | |
170 | # elif defined(__GNUC__) && __GNUC__>=2 && !defined(__STRICT_ANSI__) && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM) && !defined(PEDANTIC) | |
171 | # if defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__) | |
172 | # define ROTATE(a,n) ({ register unsigned int ret; \ | |
173 | asm ("rorl %1,%0" \ | |
174 | : "=r"(ret) \ | |
175 | : "I"(n),"0"(a) \ | |
176 | : "cc"); \ | |
177 | ret; \ | |
178 | }) | |
179 | # endif | |
180 | # endif | |
181 | # ifndef ROTATE | |
182 | # define ROTATE(a,n) (((a)>>(n))+((a)<<(32-(n)))) | |
183 | # endif | |
d02b48c6 | 184 | |
0f113f3e MC |
185 | /* |
186 | * Don't worry about the LOAD_DATA() stuff, that is used by fcrypt() to add | |
187 | * it's little bit to the front | |
188 | */ | |
d02b48c6 | 189 | |
0f113f3e MC |
190 | # ifdef DES_FCRYPT |
191 | ||
192 | # define LOAD_DATA_tmp(R,S,u,t,E0,E1) \ | |
193 | { DES_LONG tmp; LOAD_DATA(R,S,u,t,E0,E1,tmp); } | |
194 | ||
195 | # define LOAD_DATA(R,S,u,t,E0,E1,tmp) \ | |
196 | t=R^(R>>16L); \ | |
197 | u=t&E0; t&=E1; \ | |
198 | tmp=(u<<16); u^=R^s[S ]; u^=tmp; \ | |
199 | tmp=(t<<16); t^=R^s[S+1]; t^=tmp | |
200 | # else | |
201 | # define LOAD_DATA_tmp(a,b,c,d,e,f) LOAD_DATA(a,b,c,d,e,f,g) | |
202 | # define LOAD_DATA(R,S,u,t,E0,E1,tmp) \ | |
203 | u=R^s[S ]; \ | |
204 | t=R^s[S+1] | |
205 | # endif | |
d02b48c6 | 206 | |
0f113f3e MC |
207 | /* |
208 | * The changes to this macro may help or hinder, depending on the compiler | |
209 | * and the architecture. gcc2 always seems to do well :-). Inspired by Dana | |
210 | * How <how@isl.stanford.edu> DO NOT use the alternative version on machines | |
211 | * with 8 byte longs. It does not seem to work on the Alpha, even when | |
212 | * DES_LONG is 4 bytes, probably an issue of accessing non-word aligned | |
213 | * objects :-( | |
214 | */ | |
215 | # ifdef DES_PTR | |
d02b48c6 | 216 | |
0f113f3e MC |
217 | /* |
218 | * It recently occurred to me that 0^0^0^0^0^0^0 == 0, so there is no reason | |
219 | * to not xor all the sub items together. This potentially saves a register | |
220 | * since things can be xored directly into L | |
221 | */ | |
d02b48c6 | 222 | |
0f113f3e MC |
223 | # if defined(DES_RISC1) || defined(DES_RISC2) |
224 | # ifdef DES_RISC1 | |
225 | # define D_ENCRYPT(LL,R,S) { \ | |
226 | unsigned int u1,u2,u3; \ | |
227 | LOAD_DATA(R,S,u,t,E0,E1,u1); \ | |
228 | u2=(int)u>>8L; \ | |
229 | u1=(int)u&0xfc; \ | |
230 | u2&=0xfc; \ | |
231 | t=ROTATE(t,4); \ | |
232 | u>>=16L; \ | |
233 | LL^= *(const DES_LONG *)(des_SP +u1); \ | |
234 | LL^= *(const DES_LONG *)(des_SP+0x200+u2); \ | |
235 | u3=(int)(u>>8L); \ | |
236 | u1=(int)u&0xfc; \ | |
237 | u3&=0xfc; \ | |
238 | LL^= *(const DES_LONG *)(des_SP+0x400+u1); \ | |
239 | LL^= *(const DES_LONG *)(des_SP+0x600+u3); \ | |
240 | u2=(int)t>>8L; \ | |
241 | u1=(int)t&0xfc; \ | |
242 | u2&=0xfc; \ | |
243 | t>>=16L; \ | |
244 | LL^= *(const DES_LONG *)(des_SP+0x100+u1); \ | |
245 | LL^= *(const DES_LONG *)(des_SP+0x300+u2); \ | |
246 | u3=(int)t>>8L; \ | |
247 | u1=(int)t&0xfc; \ | |
248 | u3&=0xfc; \ | |
249 | LL^= *(const DES_LONG *)(des_SP+0x500+u1); \ | |
250 | LL^= *(const DES_LONG *)(des_SP+0x700+u3); } | |
251 | # endif | |
252 | # ifdef DES_RISC2 | |
253 | # define D_ENCRYPT(LL,R,S) { \ | |
254 | unsigned int u1,u2,s1,s2; \ | |
255 | LOAD_DATA(R,S,u,t,E0,E1,u1); \ | |
256 | u2=(int)u>>8L; \ | |
257 | u1=(int)u&0xfc; \ | |
258 | u2&=0xfc; \ | |
259 | t=ROTATE(t,4); \ | |
260 | LL^= *(const DES_LONG *)(des_SP +u1); \ | |
261 | LL^= *(const DES_LONG *)(des_SP+0x200+u2); \ | |
262 | s1=(int)(u>>16L); \ | |
263 | s2=(int)(u>>24L); \ | |
264 | s1&=0xfc; \ | |
265 | s2&=0xfc; \ | |
266 | LL^= *(const DES_LONG *)(des_SP+0x400+s1); \ | |
267 | LL^= *(const DES_LONG *)(des_SP+0x600+s2); \ | |
268 | u2=(int)t>>8L; \ | |
269 | u1=(int)t&0xfc; \ | |
270 | u2&=0xfc; \ | |
271 | LL^= *(const DES_LONG *)(des_SP+0x100+u1); \ | |
272 | LL^= *(const DES_LONG *)(des_SP+0x300+u2); \ | |
273 | s1=(int)(t>>16L); \ | |
274 | s2=(int)(t>>24L); \ | |
275 | s1&=0xfc; \ | |
276 | s2&=0xfc; \ | |
277 | LL^= *(const DES_LONG *)(des_SP+0x500+s1); \ | |
278 | LL^= *(const DES_LONG *)(des_SP+0x700+s2); } | |
279 | # endif | |
280 | # else | |
281 | # define D_ENCRYPT(LL,R,S) { \ | |
282 | LOAD_DATA_tmp(R,S,u,t,E0,E1); \ | |
283 | t=ROTATE(t,4); \ | |
284 | LL^= \ | |
285 | *(const DES_LONG *)(des_SP +((u )&0xfc))^ \ | |
286 | *(const DES_LONG *)(des_SP+0x200+((u>> 8L)&0xfc))^ \ | |
287 | *(const DES_LONG *)(des_SP+0x400+((u>>16L)&0xfc))^ \ | |
288 | *(const DES_LONG *)(des_SP+0x600+((u>>24L)&0xfc))^ \ | |
289 | *(const DES_LONG *)(des_SP+0x100+((t )&0xfc))^ \ | |
290 | *(const DES_LONG *)(des_SP+0x300+((t>> 8L)&0xfc))^ \ | |
291 | *(const DES_LONG *)(des_SP+0x500+((t>>16L)&0xfc))^ \ | |
292 | *(const DES_LONG *)(des_SP+0x700+((t>>24L)&0xfc)); } | |
293 | # endif | |
294 | ||
295 | # else /* original version */ | |
296 | ||
297 | # if defined(DES_RISC1) || defined(DES_RISC2) | |
298 | # ifdef DES_RISC1 | |
299 | # define D_ENCRYPT(LL,R,S) {\ | |
300 | unsigned int u1,u2,u3; \ | |
301 | LOAD_DATA(R,S,u,t,E0,E1,u1); \ | |
302 | u>>=2L; \ | |
303 | t=ROTATE(t,6); \ | |
304 | u2=(int)u>>8L; \ | |
305 | u1=(int)u&0x3f; \ | |
306 | u2&=0x3f; \ | |
307 | u>>=16L; \ | |
308 | LL^=DES_SPtrans[0][u1]; \ | |
309 | LL^=DES_SPtrans[2][u2]; \ | |
310 | u3=(int)u>>8L; \ | |
311 | u1=(int)u&0x3f; \ | |
312 | u3&=0x3f; \ | |
313 | LL^=DES_SPtrans[4][u1]; \ | |
314 | LL^=DES_SPtrans[6][u3]; \ | |
315 | u2=(int)t>>8L; \ | |
316 | u1=(int)t&0x3f; \ | |
317 | u2&=0x3f; \ | |
318 | t>>=16L; \ | |
319 | LL^=DES_SPtrans[1][u1]; \ | |
320 | LL^=DES_SPtrans[3][u2]; \ | |
321 | u3=(int)t>>8L; \ | |
322 | u1=(int)t&0x3f; \ | |
323 | u3&=0x3f; \ | |
324 | LL^=DES_SPtrans[5][u1]; \ | |
325 | LL^=DES_SPtrans[7][u3]; } | |
326 | # endif | |
327 | # ifdef DES_RISC2 | |
328 | # define D_ENCRYPT(LL,R,S) {\ | |
329 | unsigned int u1,u2,s1,s2; \ | |
330 | LOAD_DATA(R,S,u,t,E0,E1,u1); \ | |
331 | u>>=2L; \ | |
332 | t=ROTATE(t,6); \ | |
333 | u2=(int)u>>8L; \ | |
334 | u1=(int)u&0x3f; \ | |
335 | u2&=0x3f; \ | |
336 | LL^=DES_SPtrans[0][u1]; \ | |
337 | LL^=DES_SPtrans[2][u2]; \ | |
338 | s1=(int)u>>16L; \ | |
339 | s2=(int)u>>24L; \ | |
340 | s1&=0x3f; \ | |
341 | s2&=0x3f; \ | |
342 | LL^=DES_SPtrans[4][s1]; \ | |
343 | LL^=DES_SPtrans[6][s2]; \ | |
344 | u2=(int)t>>8L; \ | |
345 | u1=(int)t&0x3f; \ | |
346 | u2&=0x3f; \ | |
347 | LL^=DES_SPtrans[1][u1]; \ | |
348 | LL^=DES_SPtrans[3][u2]; \ | |
349 | s1=(int)t>>16; \ | |
350 | s2=(int)t>>24L; \ | |
351 | s1&=0x3f; \ | |
352 | s2&=0x3f; \ | |
353 | LL^=DES_SPtrans[5][s1]; \ | |
354 | LL^=DES_SPtrans[7][s2]; } | |
355 | # endif | |
356 | ||
357 | # else | |
358 | ||
359 | # define D_ENCRYPT(LL,R,S) {\ | |
360 | LOAD_DATA_tmp(R,S,u,t,E0,E1); \ | |
361 | t=ROTATE(t,4); \ | |
362 | LL^=\ | |
363 | DES_SPtrans[0][(u>> 2L)&0x3f]^ \ | |
364 | DES_SPtrans[2][(u>>10L)&0x3f]^ \ | |
365 | DES_SPtrans[4][(u>>18L)&0x3f]^ \ | |
366 | DES_SPtrans[6][(u>>26L)&0x3f]^ \ | |
367 | DES_SPtrans[1][(t>> 2L)&0x3f]^ \ | |
368 | DES_SPtrans[3][(t>>10L)&0x3f]^ \ | |
369 | DES_SPtrans[5][(t>>18L)&0x3f]^ \ | |
370 | DES_SPtrans[7][(t>>26L)&0x3f]; } | |
371 | # endif | |
372 | # endif | |
d02b48c6 | 373 | |
0f113f3e MC |
374 | /*- |
375 | * IP and FP | |
376 | * The problem is more of a geometric problem that random bit fiddling. | |
377 | 0 1 2 3 4 5 6 7 62 54 46 38 30 22 14 6 | |
378 | 8 9 10 11 12 13 14 15 60 52 44 36 28 20 12 4 | |
379 | 16 17 18 19 20 21 22 23 58 50 42 34 26 18 10 2 | |
380 | 24 25 26 27 28 29 30 31 to 56 48 40 32 24 16 8 0 | |
381 | ||
382 | 32 33 34 35 36 37 38 39 63 55 47 39 31 23 15 7 | |
383 | 40 41 42 43 44 45 46 47 61 53 45 37 29 21 13 5 | |
384 | 48 49 50 51 52 53 54 55 59 51 43 35 27 19 11 3 | |
385 | 56 57 58 59 60 61 62 63 57 49 41 33 25 17 9 1 | |
386 | ||
387 | The output has been subject to swaps of the form | |
388 | 0 1 -> 3 1 but the odd and even bits have been put into | |
389 | 2 3 2 0 | |
390 | different words. The main trick is to remember that | |
391 | t=((l>>size)^r)&(mask); | |
392 | r^=t; | |
393 | l^=(t<<size); | |
394 | can be used to swap and move bits between words. | |
395 | ||
396 | So l = 0 1 2 3 r = 16 17 18 19 | |
397 | 4 5 6 7 20 21 22 23 | |
398 | 8 9 10 11 24 25 26 27 | |
399 | 12 13 14 15 28 29 30 31 | |
400 | becomes (for size == 2 and mask == 0x3333) | |
401 | t = 2^16 3^17 -- -- l = 0 1 16 17 r = 2 3 18 19 | |
402 | 6^20 7^21 -- -- 4 5 20 21 6 7 22 23 | |
403 | 10^24 11^25 -- -- 8 9 24 25 10 11 24 25 | |
404 | 14^28 15^29 -- -- 12 13 28 29 14 15 28 29 | |
405 | ||
406 | Thanks for hints from Richard Outerbridge - he told me IP&FP | |
407 | could be done in 15 xor, 10 shifts and 5 ands. | |
408 | When I finally started to think of the problem in 2D | |
409 | I first got ~42 operations without xors. When I remembered | |
410 | how to use xors :-) I got it to its final state. | |
411 | */ | |
412 | # define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\ | |
413 | (b)^=(t),\ | |
414 | (a)^=((t)<<(n))) | |
415 | ||
416 | # define IP(l,r) \ | |
417 | { \ | |
418 | register DES_LONG tt; \ | |
419 | PERM_OP(r,l,tt, 4,0x0f0f0f0fL); \ | |
420 | PERM_OP(l,r,tt,16,0x0000ffffL); \ | |
421 | PERM_OP(r,l,tt, 2,0x33333333L); \ | |
422 | PERM_OP(l,r,tt, 8,0x00ff00ffL); \ | |
423 | PERM_OP(r,l,tt, 1,0x55555555L); \ | |
424 | } | |
425 | ||
426 | # define FP(l,r) \ | |
427 | { \ | |
428 | register DES_LONG tt; \ | |
429 | PERM_OP(l,r,tt, 1,0x55555555L); \ | |
430 | PERM_OP(r,l,tt, 8,0x00ff00ffL); \ | |
431 | PERM_OP(l,r,tt, 2,0x33333333L); \ | |
432 | PERM_OP(r,l,tt,16,0x0000ffffL); \ | |
433 | PERM_OP(l,r,tt, 4,0x0f0f0f0fL); \ | |
434 | } | |
d02b48c6 | 435 | |
e62991a0 | 436 | extern const DES_LONG DES_SPtrans[8][64]; |
d02b48c6 | 437 | |
0f113f3e MC |
438 | void fcrypt_body(DES_LONG *out, DES_key_schedule *ks, |
439 | DES_LONG Eswap0, DES_LONG Eswap1); | |
3d6312e8 | 440 | |
0f113f3e MC |
441 | # ifdef OPENSSL_SMALL_FOOTPRINT |
442 | # undef DES_UNROLL | |
443 | # endif | |
d02b48c6 | 444 | #endif |