1/* lib/des/des_locl.h */
2/* Copyright (C) 1995-1996 Eric Young (eay@mincom.oz.au)
3 * All rights reserved.
4 *
5 * This file is part of an SSL implementation written
6 * by Eric Young (eay@mincom.oz.au).
7 * The implementation was written so as to conform with Netscapes SSL
8 * specification. This library and applications are
9 * FREE FOR COMMERCIAL AND NON-COMMERCIAL USE
10 * as long as the following conditions are aheared to.
11 *
12 * Copyright remains Eric Young's, and as such any Copyright notices in
13 * the code are not to be removed. If this code is used in a product,
14 * Eric Young should be given attribution as the author of the parts used.
15 * This can be in the form of a textual message at program startup or
16 * in documentation (online or textual) provided with the package.
17 *
18 * Redistribution and use in source and binary forms, with or without
19 * modification, are permitted provided that the following conditions
20 * are met:
21 * 1. Redistributions of source code must retain the copyright
22 * notice, this list of conditions and the following disclaimer.
23 * 2. Redistributions in binary form must reproduce the above copyright
24 * notice, this list of conditions and the following disclaimer in the
25 * documentation and/or other materials provided with the distribution.
26 * 3. All advertising materials mentioning features or use of this software
27 * must display the following acknowledgement:
28 * This product includes software developed by Eric Young (eay@mincom.oz.au)
29 *
30 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
31 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
32 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
33 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
34 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
35 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
36 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
37 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
38 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
39 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 * SUCH DAMAGE.
41 *
42 * The licence and distribution terms for any publically available version or
43 * derivative of this code cannot be changed. i.e. this code cannot simply be
44 * copied and put under another distribution licence
45 * [including the GNU Public Licence.]
46 *
47 * $FreeBSD: head/sys/crypto/des/des_locl.h 55206 1999-12-29 05:07:58Z peter $
48 */
49/* WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
50 *
51 * Always modify des_locl.org since des_locl.h is automatically generated from
52 * it during SSLeay configuration.
53 *
54 * WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
55 */
56
57#include <sys/param.h>
58#include <sys/malloc.h>
59#include <sys/mbuf.h>
60#include <sys/systm.h>
61
62#ifndef HEADER_DES_LOCL_H
63#define HEADER_DES_LOCL_H
64
65#if defined(WIN32) || defined(WIN16)
66#ifndef MSDOS
67#define MSDOS
68#endif
69#endif
70
71/*
72#include <stdio.h>
73#include <stdlib.h>
74#ifndef MSDOS
75#include <unistd.h>
76#endif
77*/
78#include <crypto/des/des.h>
79
80/* the following is tweaked from a config script, that is why it is a
81 * protected undef/define */
82#ifndef DES_PTR
83#undef DES_PTR
84#endif
85
86#ifdef 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#ifndef RAND
92#define RAND
93#endif
94#undef NOPROTO
95#endif
96
97#if !defined(_KERNEL) && (defined(__STDC__) || defined(VMS) || defined(M_XENIX) || defined(MSDOS))
98#ifndef __NetBSD__
99#include <string.h>
100#endif
101#endif
102
103#ifdef __NetBSD__
104#include <sys/systm.h>
105#endif
106
107#ifndef RAND
108#define RAND
109#endif
110
111#ifdef linux
112#undef RAND
113#endif
114
115#ifdef MSDOS
116#define getpid() 2
117#define RAND
118#undef NOPROTO
119#endif
120
121#if defined(NOCONST)
122#define const
123#endif
124
125#ifdef __STDC__
126#undef NOPROTO
127#endif
128
129#ifdef RAND
130#define srandom(s) srand(s)
131#define random rand
132#endif
133
134#define ITERATIONS 16
135#define HALF_ITERATIONS 8
136
137/* used in des_read and des_write */
138#define MAXWRITE (1024*16)
139#define BSIZE (MAXWRITE+4)
140
141#define c2l(c,l) (l =((DES_LONG)(*((c)++))) , \
142 l|=((DES_LONG)(*((c)++)))<< 8L, \
143 l|=((DES_LONG)(*((c)++)))<<16L, \
144 l|=((DES_LONG)(*((c)++)))<<24L)
145
146/* NOTE - c is not incremented as per c2l */
147#define c2ln(c,l1,l2,n) { \
148 c+=n; \
149 l1=l2=0; \
150 switch (n) { \
151 case 8: l2 =((DES_LONG)(*(--(c))))<<24L; \
152 case 7: l2|=((DES_LONG)(*(--(c))))<<16L; \
153 case 6: l2|=((DES_LONG)(*(--(c))))<< 8L; \
154 case 5: l2|=((DES_LONG)(*(--(c)))); \
155 case 4: l1 =((DES_LONG)(*(--(c))))<<24L; \
156 case 3: l1|=((DES_LONG)(*(--(c))))<<16L; \
157 case 2: l1|=((DES_LONG)(*(--(c))))<< 8L; \
158 case 1: l1|=((DES_LONG)(*(--(c)))); \
159 } \
160 }
161
162#define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
163 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
164 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
165 *((c)++)=(unsigned char)(((l)>>24L)&0xff))
166
167/* replacements for htonl and ntohl since I have no idea what to do
168 * when faced with machines with 8 byte longs. */
169#define HDRSIZE 4
170
171#define n2l(c,l) (l =((DES_LONG)(*((c)++)))<<24L, \
172 l|=((DES_LONG)(*((c)++)))<<16L, \
173 l|=((DES_LONG)(*((c)++)))<< 8L, \
174 l|=((DES_LONG)(*((c)++))))
175
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/* NOTE - c is not incremented as per l2c */
182#define l2cn(l1,l2,c,n) { \
183 c+=n; \
184 switch (n) { \
185 case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
186 case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
187 case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
188 case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
189 case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
190 case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
191 case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
192 case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
193 } \
194 }
195
196#if defined(WIN32)
197#define ROTATE(a,n) (_lrotr(a,n))
198#else
199#define ROTATE(a,n) (((a)>>(n))+((a)<<(32-(n))))
200#endif
201
202/* The changes to this macro may help or hinder, depending on the
203 * compiler and the achitecture. gcc2 always seems to do well :-).
204 * Inspired by Dana How <how@isl.stanford.edu>
205 * DO NOT use the alternative version on machines with 8 byte longs.
206 * It does not seem to work on the Alpha, even when DES_LONG is 4
207 * bytes, probably an issue of accessing non-word aligned objects :-( */
208#ifdef DES_PTR
209
210#define D_ENCRYPT(L,R,S) { \
211 u=((R^s[S ])<<2); \
212 t= R^s[S+1]; \
213 t=ROTATE(t,2); \
214 L^= (\
215 *(DES_LONG *)((unsigned char *)des_SP+0x100+((t )&0xfc))+ \
216 *(DES_LONG *)((unsigned char *)des_SP+0x300+((t>> 8)&0xfc))+ \
217 *(DES_LONG *)((unsigned char *)des_SP+0x500+((t>>16)&0xfc))+ \
218 *(DES_LONG *)((unsigned char *)des_SP+0x700+((t>>24)&0xfc))+ \
219 *(DES_LONG *)((unsigned char *)des_SP +((u )&0xfc))+ \
220 *(DES_LONG *)((unsigned char *)des_SP+0x200+((u>> 8)&0xfc))+ \
221 *(DES_LONG *)((unsigned char *)des_SP+0x400+((u>>16)&0xfc))+ \
222 *(DES_LONG *)((unsigned char *)des_SP+0x600+((u>>24)&0xfc))); }
223#else /* original version */
224#ifdef undef
225#define D_ENCRYPT(L,R,S) \
226 U.l=R^s[S+1]; \
227 T.s[0]=((U.s[0]>>4)|(U.s[1]<<12))&0x3f3f; \
228 T.s[1]=((U.s[1]>>4)|(U.s[0]<<12))&0x3f3f; \
229 U.l=(R^s[S ])&0x3f3f3f3fL; \
230 L^= des_SPtrans[1][(T.c[0])]| \
231 des_SPtrans[3][(T.c[1])]| \
232 des_SPtrans[5][(T.c[2])]| \
233 des_SPtrans[7][(T.c[3])]| \
234 des_SPtrans[0][(U.c[0])]| \
235 des_SPtrans[2][(U.c[1])]| \
236 des_SPtrans[4][(U.c[2])]| \
237 des_SPtrans[6][(U.c[3])];
238#else
239#define D_ENCRYPT(Q,R,S) {\
240 u=(R^s[S ]); \
241 t=R^s[S+1]; \
242 t=ROTATE(t,4); \
243 Q^= des_SPtrans[1][(t )&0x3f]| \
244 des_SPtrans[3][(t>> 8L)&0x3f]| \
245 des_SPtrans[5][(t>>16L)&0x3f]| \
246 des_SPtrans[7][(t>>24L)&0x3f]| \
247 des_SPtrans[0][(u )&0x3f]| \
248 des_SPtrans[2][(u>> 8L)&0x3f]| \
249 des_SPtrans[4][(u>>16L)&0x3f]| \
250 des_SPtrans[6][(u>>24L)&0x3f]; }
251#endif
252#endif
253
254 /* IP and FP
255 * The problem is more of a geometric problem that random bit fiddling.
256 0 1 2 3 4 5 6 7 62 54 46 38 30 22 14 6
257 8 9 10 11 12 13 14 15 60 52 44 36 28 20 12 4
258 16 17 18 19 20 21 22 23 58 50 42 34 26 18 10 2
259 24 25 26 27 28 29 30 31 to 56 48 40 32 24 16 8 0
260
261 32 33 34 35 36 37 38 39 63 55 47 39 31 23 15 7
262 40 41 42 43 44 45 46 47 61 53 45 37 29 21 13 5
263 48 49 50 51 52 53 54 55 59 51 43 35 27 19 11 3
264 56 57 58 59 60 61 62 63 57 49 41 33 25 17 9 1
265
266 The output has been subject to swaps of the form
267 0 1 -> 3 1 but the odd and even bits have been put into
268 2 3 2 0
269 different words. The main trick is to remember that
270 t=((l>>size)^r)&(mask);
271 r^=t;
272 l^=(t<<size);
273 can be used to swap and move bits between words.
274
275 So l = 0 1 2 3 r = 16 17 18 19
276 4 5 6 7 20 21 22 23
277 8 9 10 11 24 25 26 27
278 12 13 14 15 28 29 30 31
279 becomes (for size == 2 and mask == 0x3333)
280 t = 2^16 3^17 -- -- l = 0 1 16 17 r = 2 3 18 19
281 6^20 7^21 -- -- 4 5 20 21 6 7 22 23
282 10^24 11^25 -- -- 8 9 24 25 10 11 24 25
283 14^28 15^29 -- -- 12 13 28 29 14 15 28 29
284
285 Thanks for hints from Richard Outerbridge - he told me IP&FP
286 could be done in 15 xor, 10 shifts and 5 ands.
287 When I finally started to think of the problem in 2D
288 I first got ~42 operations without xors. When I remembered
289 how to use xors :-) I got it to its final state.
290 */
291#define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\
292 (b)^=(t),\
293 (a)^=((t)<<(n)))
294
295#define IP(l,r) \
296 { \
297 register DES_LONG tt; \
298 PERM_OP(r,l,tt, 4,0x0f0f0f0fL); \
299 PERM_OP(l,r,tt,16,0x0000ffffL); \
300 PERM_OP(r,l,tt, 2,0x33333333L); \
301 PERM_OP(l,r,tt, 8,0x00ff00ffL); \
302 PERM_OP(r,l,tt, 1,0x55555555L); \
303 }
304
305#define FP(l,r) \
306 { \
307 register DES_LONG tt; \
308 PERM_OP(l,r,tt, 1,0x55555555L); \
309 PERM_OP(r,l,tt, 8,0x00ff00ffL); \
310 PERM_OP(l,r,tt, 2,0x33333333L); \
311 PERM_OP(r,l,tt,16,0x0000ffffL); \
312 PERM_OP(l,r,tt, 4,0x0f0f0f0fL); \
313 }
314#endif
315
316
317/*
318#define mbuf2char(i_mbuf, i_index, in) \
319 { \
320 register int i; \
321 struct mbuf *m; \
322 char *buf; \
323 m = i_mbuf; \
324 for (i = 0; i < 8; i ++){ \
325 if (i_index + i == m->m_len){ \
326 m = m->m_next; \
327 } \
328 buf = mtod(m, char *); \
329 in[i] = *(buf + i); \
330 }
331
332
333#define char2mbuf(o_mbuf, o_index, out) \
334 { \
335 register int i; \
336 struct mbuf *m; \
337 char *buf; \
338 m = o_mbuf; \
339 for (i = 0; i < 8; i ++){ \
340 if (i_index + i == m->m_len){ \
341 m = m->m_next; \
342 } \
343 buf = mtod(m, char *); \
344 *(buf + i) = out[i]; \
345 }
346*/
347
2/* Copyright (C) 1995-1996 Eric Young (eay@mincom.oz.au)
3 * All rights reserved.
4 *
5 * This file is part of an SSL implementation written
6 * by Eric Young (eay@mincom.oz.au).
7 * The implementation was written so as to conform with Netscapes SSL
8 * specification. This library and applications are
9 * FREE FOR COMMERCIAL AND NON-COMMERCIAL USE
10 * as long as the following conditions are aheared to.
11 *
12 * Copyright remains Eric Young's, and as such any Copyright notices in
13 * the code are not to be removed. If this code is used in a product,
14 * Eric Young should be given attribution as the author of the parts used.
15 * This can be in the form of a textual message at program startup or
16 * in documentation (online or textual) provided with the package.
17 *
18 * Redistribution and use in source and binary forms, with or without
19 * modification, are permitted provided that the following conditions
20 * are met:
21 * 1. Redistributions of source code must retain the copyright
22 * notice, this list of conditions and the following disclaimer.
23 * 2. Redistributions in binary form must reproduce the above copyright
24 * notice, this list of conditions and the following disclaimer in the
25 * documentation and/or other materials provided with the distribution.
26 * 3. All advertising materials mentioning features or use of this software
27 * must display the following acknowledgement:
28 * This product includes software developed by Eric Young (eay@mincom.oz.au)
29 *
30 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
31 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
32 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
33 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
34 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
35 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
36 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
37 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
38 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
39 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 * SUCH DAMAGE.
41 *
42 * The licence and distribution terms for any publically available version or
43 * derivative of this code cannot be changed. i.e. this code cannot simply be
44 * copied and put under another distribution licence
45 * [including the GNU Public Licence.]
46 *
47 * $FreeBSD: head/sys/crypto/des/des_locl.h 55206 1999-12-29 05:07:58Z peter $
48 */
49/* WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
50 *
51 * Always modify des_locl.org since des_locl.h is automatically generated from
52 * it during SSLeay configuration.
53 *
54 * WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
55 */
56
57#include <sys/param.h>
58#include <sys/malloc.h>
59#include <sys/mbuf.h>
60#include <sys/systm.h>
61
62#ifndef HEADER_DES_LOCL_H
63#define HEADER_DES_LOCL_H
64
65#if defined(WIN32) || defined(WIN16)
66#ifndef MSDOS
67#define MSDOS
68#endif
69#endif
70
71/*
72#include <stdio.h>
73#include <stdlib.h>
74#ifndef MSDOS
75#include <unistd.h>
76#endif
77*/
78#include <crypto/des/des.h>
79
80/* the following is tweaked from a config script, that is why it is a
81 * protected undef/define */
82#ifndef DES_PTR
83#undef DES_PTR
84#endif
85
86#ifdef 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#ifndef RAND
92#define RAND
93#endif
94#undef NOPROTO
95#endif
96
97#if !defined(_KERNEL) && (defined(__STDC__) || defined(VMS) || defined(M_XENIX) || defined(MSDOS))
98#ifndef __NetBSD__
99#include <string.h>
100#endif
101#endif
102
103#ifdef __NetBSD__
104#include <sys/systm.h>
105#endif
106
107#ifndef RAND
108#define RAND
109#endif
110
111#ifdef linux
112#undef RAND
113#endif
114
115#ifdef MSDOS
116#define getpid() 2
117#define RAND
118#undef NOPROTO
119#endif
120
121#if defined(NOCONST)
122#define const
123#endif
124
125#ifdef __STDC__
126#undef NOPROTO
127#endif
128
129#ifdef RAND
130#define srandom(s) srand(s)
131#define random rand
132#endif
133
134#define ITERATIONS 16
135#define HALF_ITERATIONS 8
136
137/* used in des_read and des_write */
138#define MAXWRITE (1024*16)
139#define BSIZE (MAXWRITE+4)
140
141#define c2l(c,l) (l =((DES_LONG)(*((c)++))) , \
142 l|=((DES_LONG)(*((c)++)))<< 8L, \
143 l|=((DES_LONG)(*((c)++)))<<16L, \
144 l|=((DES_LONG)(*((c)++)))<<24L)
145
146/* NOTE - c is not incremented as per c2l */
147#define c2ln(c,l1,l2,n) { \
148 c+=n; \
149 l1=l2=0; \
150 switch (n) { \
151 case 8: l2 =((DES_LONG)(*(--(c))))<<24L; \
152 case 7: l2|=((DES_LONG)(*(--(c))))<<16L; \
153 case 6: l2|=((DES_LONG)(*(--(c))))<< 8L; \
154 case 5: l2|=((DES_LONG)(*(--(c)))); \
155 case 4: l1 =((DES_LONG)(*(--(c))))<<24L; \
156 case 3: l1|=((DES_LONG)(*(--(c))))<<16L; \
157 case 2: l1|=((DES_LONG)(*(--(c))))<< 8L; \
158 case 1: l1|=((DES_LONG)(*(--(c)))); \
159 } \
160 }
161
162#define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
163 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
164 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
165 *((c)++)=(unsigned char)(((l)>>24L)&0xff))
166
167/* replacements for htonl and ntohl since I have no idea what to do
168 * when faced with machines with 8 byte longs. */
169#define HDRSIZE 4
170
171#define n2l(c,l) (l =((DES_LONG)(*((c)++)))<<24L, \
172 l|=((DES_LONG)(*((c)++)))<<16L, \
173 l|=((DES_LONG)(*((c)++)))<< 8L, \
174 l|=((DES_LONG)(*((c)++))))
175
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/* NOTE - c is not incremented as per l2c */
182#define l2cn(l1,l2,c,n) { \
183 c+=n; \
184 switch (n) { \
185 case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
186 case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
187 case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
188 case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
189 case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
190 case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
191 case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
192 case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
193 } \
194 }
195
196#if defined(WIN32)
197#define ROTATE(a,n) (_lrotr(a,n))
198#else
199#define ROTATE(a,n) (((a)>>(n))+((a)<<(32-(n))))
200#endif
201
202/* The changes to this macro may help or hinder, depending on the
203 * compiler and the achitecture. gcc2 always seems to do well :-).
204 * Inspired by Dana How <how@isl.stanford.edu>
205 * DO NOT use the alternative version on machines with 8 byte longs.
206 * It does not seem to work on the Alpha, even when DES_LONG is 4
207 * bytes, probably an issue of accessing non-word aligned objects :-( */
208#ifdef DES_PTR
209
210#define D_ENCRYPT(L,R,S) { \
211 u=((R^s[S ])<<2); \
212 t= R^s[S+1]; \
213 t=ROTATE(t,2); \
214 L^= (\
215 *(DES_LONG *)((unsigned char *)des_SP+0x100+((t )&0xfc))+ \
216 *(DES_LONG *)((unsigned char *)des_SP+0x300+((t>> 8)&0xfc))+ \
217 *(DES_LONG *)((unsigned char *)des_SP+0x500+((t>>16)&0xfc))+ \
218 *(DES_LONG *)((unsigned char *)des_SP+0x700+((t>>24)&0xfc))+ \
219 *(DES_LONG *)((unsigned char *)des_SP +((u )&0xfc))+ \
220 *(DES_LONG *)((unsigned char *)des_SP+0x200+((u>> 8)&0xfc))+ \
221 *(DES_LONG *)((unsigned char *)des_SP+0x400+((u>>16)&0xfc))+ \
222 *(DES_LONG *)((unsigned char *)des_SP+0x600+((u>>24)&0xfc))); }
223#else /* original version */
224#ifdef undef
225#define D_ENCRYPT(L,R,S) \
226 U.l=R^s[S+1]; \
227 T.s[0]=((U.s[0]>>4)|(U.s[1]<<12))&0x3f3f; \
228 T.s[1]=((U.s[1]>>4)|(U.s[0]<<12))&0x3f3f; \
229 U.l=(R^s[S ])&0x3f3f3f3fL; \
230 L^= des_SPtrans[1][(T.c[0])]| \
231 des_SPtrans[3][(T.c[1])]| \
232 des_SPtrans[5][(T.c[2])]| \
233 des_SPtrans[7][(T.c[3])]| \
234 des_SPtrans[0][(U.c[0])]| \
235 des_SPtrans[2][(U.c[1])]| \
236 des_SPtrans[4][(U.c[2])]| \
237 des_SPtrans[6][(U.c[3])];
238#else
239#define D_ENCRYPT(Q,R,S) {\
240 u=(R^s[S ]); \
241 t=R^s[S+1]; \
242 t=ROTATE(t,4); \
243 Q^= des_SPtrans[1][(t )&0x3f]| \
244 des_SPtrans[3][(t>> 8L)&0x3f]| \
245 des_SPtrans[5][(t>>16L)&0x3f]| \
246 des_SPtrans[7][(t>>24L)&0x3f]| \
247 des_SPtrans[0][(u )&0x3f]| \
248 des_SPtrans[2][(u>> 8L)&0x3f]| \
249 des_SPtrans[4][(u>>16L)&0x3f]| \
250 des_SPtrans[6][(u>>24L)&0x3f]; }
251#endif
252#endif
253
254 /* IP and FP
255 * The problem is more of a geometric problem that random bit fiddling.
256 0 1 2 3 4 5 6 7 62 54 46 38 30 22 14 6
257 8 9 10 11 12 13 14 15 60 52 44 36 28 20 12 4
258 16 17 18 19 20 21 22 23 58 50 42 34 26 18 10 2
259 24 25 26 27 28 29 30 31 to 56 48 40 32 24 16 8 0
260
261 32 33 34 35 36 37 38 39 63 55 47 39 31 23 15 7
262 40 41 42 43 44 45 46 47 61 53 45 37 29 21 13 5
263 48 49 50 51 52 53 54 55 59 51 43 35 27 19 11 3
264 56 57 58 59 60 61 62 63 57 49 41 33 25 17 9 1
265
266 The output has been subject to swaps of the form
267 0 1 -> 3 1 but the odd and even bits have been put into
268 2 3 2 0
269 different words. The main trick is to remember that
270 t=((l>>size)^r)&(mask);
271 r^=t;
272 l^=(t<<size);
273 can be used to swap and move bits between words.
274
275 So l = 0 1 2 3 r = 16 17 18 19
276 4 5 6 7 20 21 22 23
277 8 9 10 11 24 25 26 27
278 12 13 14 15 28 29 30 31
279 becomes (for size == 2 and mask == 0x3333)
280 t = 2^16 3^17 -- -- l = 0 1 16 17 r = 2 3 18 19
281 6^20 7^21 -- -- 4 5 20 21 6 7 22 23
282 10^24 11^25 -- -- 8 9 24 25 10 11 24 25
283 14^28 15^29 -- -- 12 13 28 29 14 15 28 29
284
285 Thanks for hints from Richard Outerbridge - he told me IP&FP
286 could be done in 15 xor, 10 shifts and 5 ands.
287 When I finally started to think of the problem in 2D
288 I first got ~42 operations without xors. When I remembered
289 how to use xors :-) I got it to its final state.
290 */
291#define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\
292 (b)^=(t),\
293 (a)^=((t)<<(n)))
294
295#define IP(l,r) \
296 { \
297 register DES_LONG tt; \
298 PERM_OP(r,l,tt, 4,0x0f0f0f0fL); \
299 PERM_OP(l,r,tt,16,0x0000ffffL); \
300 PERM_OP(r,l,tt, 2,0x33333333L); \
301 PERM_OP(l,r,tt, 8,0x00ff00ffL); \
302 PERM_OP(r,l,tt, 1,0x55555555L); \
303 }
304
305#define FP(l,r) \
306 { \
307 register DES_LONG tt; \
308 PERM_OP(l,r,tt, 1,0x55555555L); \
309 PERM_OP(r,l,tt, 8,0x00ff00ffL); \
310 PERM_OP(l,r,tt, 2,0x33333333L); \
311 PERM_OP(r,l,tt,16,0x0000ffffL); \
312 PERM_OP(l,r,tt, 4,0x0f0f0f0fL); \
313 }
314#endif
315
316
317/*
318#define mbuf2char(i_mbuf, i_index, in) \
319 { \
320 register int i; \
321 struct mbuf *m; \
322 char *buf; \
323 m = i_mbuf; \
324 for (i = 0; i < 8; i ++){ \
325 if (i_index + i == m->m_len){ \
326 m = m->m_next; \
327 } \
328 buf = mtod(m, char *); \
329 in[i] = *(buf + i); \
330 }
331
332
333#define char2mbuf(o_mbuf, o_index, out) \
334 { \
335 register int i; \
336 struct mbuf *m; \
337 char *buf; \
338 m = o_mbuf; \
339 for (i = 0; i < 8; i ++){ \
340 if (i_index + i == m->m_len){ \
341 m = m->m_next; \
342 } \
343 buf = mtod(m, char *); \
344 *(buf + i) = out[i]; \
345 }
346*/
347