| 1/* $FreeBSD: head/sys/crypto/blowfish/bf_locl.h 62587 2000-07-04 16:35:15Z itojun $ */
2/* $KAME: bf_locl.h,v 1.3 2000/03/27 04:36:26 sumikawa Exp $ */
3
|
1/* crypto/bf/bf_local.h */
2/* Copyright (C) 1995-1997 Eric Young (eay@mincom.oz.au)
3 * All rights reserved.
4 *
5 * This package is 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 *
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@mincom.oz.au).
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@mincom.oz.au)"
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@mincom.oz.au)"
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.]
| 4/* crypto/bf/bf_local.h */
5/* Copyright (C) 1995-1997 Eric Young (eay@mincom.oz.au)
6 * All rights reserved.
7 *
8 * This package is an SSL implementation written
9 * by Eric Young (eay@mincom.oz.au).
10 * The implementation was written so as to conform with Netscapes SSL.
11 *
12 * This library is free for commercial and non-commercial use as long as
13 * the following conditions are aheared to. The following conditions
14 * apply to all code found in this distribution, be it the RC4, RSA,
15 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
16 * included with this distribution is covered by the same copyright terms
17 * except that the holder is Tim Hudson (tjh@mincom.oz.au).
18 *
19 * Copyright remains Eric Young's, and as such any Copyright notices in
20 * the code are not to be removed.
21 * If this package is used in a product, Eric Young should be given attribution
22 * as the author of the parts of the library used.
23 * This can be in the form of a textual message at program startup or
24 * in documentation (online or textual) provided with the package.
25 *
26 * Redistribution and use in source and binary forms, with or without
27 * modification, are permitted provided that the following conditions
28 * are met:
29 * 1. Redistributions of source code must retain the copyright
30 * notice, this list of conditions and the following disclaimer.
31 * 2. Redistributions in binary form must reproduce the above copyright
32 * notice, this list of conditions and the following disclaimer in the
33 * documentation and/or other materials provided with the distribution.
34 * 3. All advertising materials mentioning features or use of this software
35 * must display the following acknowledgement:
36 * "This product includes cryptographic software written by
37 * Eric Young (eay@mincom.oz.au)"
38 * The word 'cryptographic' can be left out if the rouines from the library
39 * being used are not cryptographic related :-).
40 * 4. If you include any Windows specific code (or a derivative thereof) from
41 * the apps directory (application code) you must include an acknowledgement:
42 * "This product includes software written by Tim Hudson (tjh@mincom.oz.au)"
43 *
44 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
45 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
46 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
47 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
48 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
49 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
50 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
51 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
52 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
53 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
54 * SUCH DAMAGE.
55 *
56 * The licence and distribution terms for any publically available version or
57 * derivative of this code cannot be changed. i.e. this code cannot simply be
58 * copied and put under another distribution licence
59 * [including the GNU Public Licence.]
|
57 *
58 * $FreeBSD: head/sys/crypto/blowfish/bf_locl.h 55009 1999-12-22 19:13:38Z shin $
| |
59 */
60/* WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
61 *
62 * Always modify bf_locl.org since bf_locl.h is automatically generated from
63 * it during SSLeay configuration.
64 *
65 * WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
66 */
67
68#undef c2l
| 60 */
61/* WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
62 *
63 * Always modify bf_locl.org since bf_locl.h is automatically generated from
64 * it during SSLeay configuration.
65 *
66 * WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
67 */
68
69#undef c2l
|
69#define c2l(c,l) (l =((unsigned long)(*((c)++))) , \
| 70#define c2l(c,l) (l =((unsigned long)(*((c)++))) , \
|
70 l|=((unsigned long)(*((c)++)))<< 8L, \
71 l|=((unsigned long)(*((c)++)))<<16L, \
72 l|=((unsigned long)(*((c)++)))<<24L)
73
74/* NOTE - c is not incremented as per c2l */
75#undef c2ln
| 71 l|=((unsigned long)(*((c)++)))<< 8L, \
72 l|=((unsigned long)(*((c)++)))<<16L, \
73 l|=((unsigned long)(*((c)++)))<<24L)
74
75/* NOTE - c is not incremented as per c2l */
76#undef c2ln
|
76#define c2ln(c,l1,l2,n) { \
| 77#define c2ln(c,l1,l2,n) { \
|
77 c+=n; \
78 l1=l2=0; \
79 switch (n) { \
80 case 8: l2 =((unsigned long)(*(--(c))))<<24L; \
81 case 7: l2|=((unsigned long)(*(--(c))))<<16L; \
82 case 6: l2|=((unsigned long)(*(--(c))))<< 8L; \
83 case 5: l2|=((unsigned long)(*(--(c)))); \
84 case 4: l1 =((unsigned long)(*(--(c))))<<24L; \
85 case 3: l1|=((unsigned long)(*(--(c))))<<16L; \
86 case 2: l1|=((unsigned long)(*(--(c))))<< 8L; \
87 case 1: l1|=((unsigned long)(*(--(c)))); \
88 } \
89 }
90
91#undef l2c
| 78 c+=n; \
79 l1=l2=0; \
80 switch (n) { \
81 case 8: l2 =((unsigned long)(*(--(c))))<<24L; \
82 case 7: l2|=((unsigned long)(*(--(c))))<<16L; \
83 case 6: l2|=((unsigned long)(*(--(c))))<< 8L; \
84 case 5: l2|=((unsigned long)(*(--(c)))); \
85 case 4: l1 =((unsigned long)(*(--(c))))<<24L; \
86 case 3: l1|=((unsigned long)(*(--(c))))<<16L; \
87 case 2: l1|=((unsigned long)(*(--(c))))<< 8L; \
88 case 1: l1|=((unsigned long)(*(--(c)))); \
89 } \
90 }
91
92#undef l2c
|
92#define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
| 93#define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
|
93 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
94 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
95 *((c)++)=(unsigned char)(((l)>>24L)&0xff))
96
97/* NOTE - c is not incremented as per l2c */
98#undef l2cn
| 94 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
95 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
96 *((c)++)=(unsigned char)(((l)>>24L)&0xff))
97
98/* NOTE - c is not incremented as per l2c */
99#undef l2cn
|
99#define l2cn(l1,l2,c,n) { \
| 100#define l2cn(l1,l2,c,n) { \
|
100 c+=n; \
101 switch (n) { \
102 case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
103 case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
104 case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
105 case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
106 case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
107 case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
108 case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
109 case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
110 } \
111 }
112
113/* NOTE - c is not incremented as per n2l */
| 101 c+=n; \
102 switch (n) { \
103 case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
104 case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
105 case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
106 case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
107 case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
108 case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
109 case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
110 case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
111 } \
112 }
113
114/* NOTE - c is not incremented as per n2l */
|
114#define n2ln(c,l1,l2,n) { \
| 115#define n2ln(c,l1,l2,n) { \
|
115 c+=n; \
116 l1=l2=0; \
117 switch (n) { \
118 case 8: l2 =((unsigned long)(*(--(c)))) ; \
119 case 7: l2|=((unsigned long)(*(--(c))))<< 8; \
120 case 6: l2|=((unsigned long)(*(--(c))))<<16; \
121 case 5: l2|=((unsigned long)(*(--(c))))<<24; \
122 case 4: l1 =((unsigned long)(*(--(c)))) ; \
123 case 3: l1|=((unsigned long)(*(--(c))))<< 8; \
124 case 2: l1|=((unsigned long)(*(--(c))))<<16; \
125 case 1: l1|=((unsigned long)(*(--(c))))<<24; \
126 } \
127 }
128
129/* NOTE - c is not incremented as per l2n */
| 116 c+=n; \
117 l1=l2=0; \
118 switch (n) { \
119 case 8: l2 =((unsigned long)(*(--(c)))) ; \
120 case 7: l2|=((unsigned long)(*(--(c))))<< 8; \
121 case 6: l2|=((unsigned long)(*(--(c))))<<16; \
122 case 5: l2|=((unsigned long)(*(--(c))))<<24; \
123 case 4: l1 =((unsigned long)(*(--(c)))) ; \
124 case 3: l1|=((unsigned long)(*(--(c))))<< 8; \
125 case 2: l1|=((unsigned long)(*(--(c))))<<16; \
126 case 1: l1|=((unsigned long)(*(--(c))))<<24; \
127 } \
128 }
129
130/* NOTE - c is not incremented as per l2n */
|
130#define l2nn(l1,l2,c,n) { \
| 131#define l2nn(l1,l2,c,n) { \
|
131 c+=n; \
132 switch (n) { \
133 case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \
134 case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
135 case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
136 case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
137 case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \
138 case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
139 case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
140 case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
141 } \
142 }
143
144#undef n2l
| 132 c+=n; \
133 switch (n) { \
134 case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \
135 case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
136 case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
137 case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
138 case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \
139 case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
140 case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
141 case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
142 } \
143 }
144
145#undef n2l
|
145#define n2l(c,l) (l =((unsigned long)(*((c)++)))<<24L, \
| 146#define n2l(c,l) (l =((unsigned long)(*((c)++)))<<24L, \
|
146 l|=((unsigned long)(*((c)++)))<<16L, \
147 l|=((unsigned long)(*((c)++)))<< 8L, \
148 l|=((unsigned long)(*((c)++))))
149
150#undef l2n
| 147 l|=((unsigned long)(*((c)++)))<<16L, \
148 l|=((unsigned long)(*((c)++)))<< 8L, \
149 l|=((unsigned long)(*((c)++))))
150
151#undef l2n
|
151#define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
| 152#define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
|
152 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
153 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
154 *((c)++)=(unsigned char)(((l) )&0xff))
155
156/* This is actually a big endian algorithm, the most significate byte
157 * is used to lookup array 0 */
158
159/* use BF_PTR2 for intel boxes,
160 * BF_PTR for sparc and MIPS/SGI
161 * use nothing for Alpha and HP.
162 */
163#if !defined(BF_PTR) && !defined(BF_PTR2)
164#undef BF_PTR
165#endif
166
| 153 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
154 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
155 *((c)++)=(unsigned char)(((l) )&0xff))
156
157/* This is actually a big endian algorithm, the most significate byte
158 * is used to lookup array 0 */
159
160/* use BF_PTR2 for intel boxes,
161 * BF_PTR for sparc and MIPS/SGI
162 * use nothing for Alpha and HP.
163 */
164#if !defined(BF_PTR) && !defined(BF_PTR2)
165#undef BF_PTR
166#endif
167
|
167#define BF_M 0x3fc
168#define BF_0 22L
169#define BF_1 14L
170#define BF_2 6L
171#define BF_3 2L /* left shift */
| 168#define BF_M 0x3fc
169#define BF_0 22L
170#define BF_1 14L
171#define BF_2 6L
172#define BF_3 2L /* left shift */
|
172
173#if defined(BF_PTR2)
174
175/* This is basically a special pentium verson */
| 173
174#if defined(BF_PTR2)
175
176/* This is basically a special pentium verson */
|
176#define BF_ENC(LL,R,S,P) \
| 177#define BF_ENC(LL,R,S,P) \
|
177 { \
178 BF_LONG t,u,v; \
179 u=R>>BF_0; \
180 v=R>>BF_1; \
181 u&=BF_M; \
182 v&=BF_M; \
183 t= *(BF_LONG *)((unsigned char *)&(S[ 0])+u); \
184 u=R>>BF_2; \
185 t+= *(BF_LONG *)((unsigned char *)&(S[256])+v); \
186 v=R<<BF_3; \
187 u&=BF_M; \
188 v&=BF_M; \
189 t^= *(BF_LONG *)((unsigned char *)&(S[512])+u); \
190 LL^=P; \
191 t+= *(BF_LONG *)((unsigned char *)&(S[768])+v); \
192 LL^=t; \
193 }
194
195#elif defined(BF_PTR)
196
197/* This is normally very good */
198
| 178 { \
179 BF_LONG t,u,v; \
180 u=R>>BF_0; \
181 v=R>>BF_1; \
182 u&=BF_M; \
183 v&=BF_M; \
184 t= *(BF_LONG *)((unsigned char *)&(S[ 0])+u); \
185 u=R>>BF_2; \
186 t+= *(BF_LONG *)((unsigned char *)&(S[256])+v); \
187 v=R<<BF_3; \
188 u&=BF_M; \
189 v&=BF_M; \
190 t^= *(BF_LONG *)((unsigned char *)&(S[512])+u); \
191 LL^=P; \
192 t+= *(BF_LONG *)((unsigned char *)&(S[768])+v); \
193 LL^=t; \
194 }
195
196#elif defined(BF_PTR)
197
198/* This is normally very good */
199
|
199#define BF_ENC(LL,R,S,P) \
| 200#define BF_ENC(LL,R,S,P) \
|
200 LL^=P; \
201 LL^= (((*(BF_LONG *)((unsigned char *)&(S[ 0])+((R>>BF_0)&BF_M))+ \
202 *(BF_LONG *)((unsigned char *)&(S[256])+((R>>BF_1)&BF_M)))^ \
203 *(BF_LONG *)((unsigned char *)&(S[512])+((R>>BF_2)&BF_M)))+ \
204 *(BF_LONG *)((unsigned char *)&(S[768])+((R<<BF_3)&BF_M)));
205#else
206
207/* This will always work, even on 64 bit machines and strangly enough,
208 * on the Alpha it is faster than the pointer versions (both 32 and 64
209 * versions of BF_LONG) */
210
| 201 LL^=P; \
202 LL^= (((*(BF_LONG *)((unsigned char *)&(S[ 0])+((R>>BF_0)&BF_M))+ \
203 *(BF_LONG *)((unsigned char *)&(S[256])+((R>>BF_1)&BF_M)))^ \
204 *(BF_LONG *)((unsigned char *)&(S[512])+((R>>BF_2)&BF_M)))+ \
205 *(BF_LONG *)((unsigned char *)&(S[768])+((R<<BF_3)&BF_M)));
206#else
207
208/* This will always work, even on 64 bit machines and strangly enough,
209 * on the Alpha it is faster than the pointer versions (both 32 and 64
210 * versions of BF_LONG) */
211
|
211#define BF_ENC(LL,R,S,P) \
| 212#define BF_ENC(LL,R,S,P) \
|
212 LL^=P; \
213 LL^=((( S[ (R>>24L) ] + \
214 S[0x0100+((R>>16L)&0xff)])^ \
215 S[0x0200+((R>> 8L)&0xff)])+ \
216 S[0x0300+((R )&0xff)])&0xffffffff;
217#endif
| 213 LL^=P; \
214 LL^=((( S[ (R>>24L) ] + \
215 S[0x0100+((R>>16L)&0xff)])^ \
216 S[0x0200+((R>> 8L)&0xff)])+ \
217 S[0x0300+((R )&0xff)])&0xffffffff;
218#endif
|