[apple/xnu.git] / bsd / crypto / blowfish / bf_locl.h

/* crypto/bf/bf_local.h */
/* Copyright (C) 1995-1997 Eric Young (eay@mincom.oz.au)
 * All rights reserved.
 *
 * This package is an SSL implementation written
 * by Eric Young (eay@mincom.oz.au).
 * The implementation was written so as to conform with Netscapes SSL.
 *
 * This library is free for commercial and non-commercial use as long as
 * the following conditions are aheared to.  The following conditions
 * apply to all code found in this distribution, be it the RC4, RSA,
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
 * included with this distribution is covered by the same copyright terms
 * except that the holder is Tim Hudson (tjh@mincom.oz.au).
 *
 * Copyright remains Eric Young's, and as such any Copyright notices in
 * the code are not to be removed.
 * If this package is used in a product, Eric Young should be given attribution
 * as the author of the parts of the library used.
 * This can be in the form of a textual message at program startup or
 * in documentation (online or textual) provided with the package.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    "This product includes cryptographic software written by
 *     Eric Young (eay@mincom.oz.au)"
 *    The word 'cryptographic' can be left out if the rouines from the library
 *    being used are not cryptographic related :-).
 * 4. If you include any Windows specific code (or a derivative thereof) from
 *    the apps directory (application code) you must include an acknowledgement:
 *    "This product includes software written by Tim Hudson (tjh@mincom.oz.au)"
 *
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 * The licence and distribution terms for any publically available version or
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
 * copied and put under another distribution licence
 * [including the GNU Public Licence.]
 */
/* WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
 *
 * Always modify bf_locl.org since bf_locl.h is automatically generated from
 * it during SSLeay configuration.
 *
 * WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
 */

#undef c2l
#define c2l(c,l)	(l =((unsigned long)(*((c)++)))    , \
			 l|=((unsigned long)(*((c)++)))<< 8L, \
			 l|=((unsigned long)(*((c)++)))<<16L, \
			 l|=((unsigned long)(*((c)++)))<<24L)

/* NOTE - c is not incremented as per c2l */
#undef c2ln
#define c2ln(c,l1,l2,n)	{ \
			c+=n; \
			l1=l2=0; \
			switch (n) { \
			case 8: l2 =((unsigned long)(*(--(c))))<<24L; \
			case 7: l2|=((unsigned long)(*(--(c))))<<16L; \
			case 6: l2|=((unsigned long)(*(--(c))))<< 8L; \
			case 5: l2|=((unsigned long)(*(--(c))));     \
			case 4: l1 =((unsigned long)(*(--(c))))<<24L; \
			case 3: l1|=((unsigned long)(*(--(c))))<<16L; \
			case 2: l1|=((unsigned long)(*(--(c))))<< 8L; \
			case 1: l1|=((unsigned long)(*(--(c))));     \
				} \
			}

#undef l2c
#define l2c(l,c)	(*((c)++)=(unsigned char)(((l)     )&0xff), \
			 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
			 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
			 *((c)++)=(unsigned char)(((l)>>24L)&0xff))

/* NOTE - c is not incremented as per l2c */
#undef l2cn
#define l2cn(l1,l2,c,n)	{ \
			c+=n; \
			switch (n) { \
			case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
			case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
			case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
			case 5: *(--(c))=(unsigned char)(((l2)     )&0xff); \
			case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
			case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
			case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
			case 1: *(--(c))=(unsigned char)(((l1)     )&0xff); \
				} \
			}

/* NOTE - c is not incremented as per n2l */
#define n2ln(c,l1,l2,n)	{ \
			c+=n; \
			l1=l2=0; \
			switch (n) { \
			case 8: l2 =((unsigned long)(*(--(c))))    ; \
			case 7: l2|=((unsigned long)(*(--(c))))<< 8; \
			case 6: l2|=((unsigned long)(*(--(c))))<<16; \
			case 5: l2|=((unsigned long)(*(--(c))))<<24; \
			case 4: l1 =((unsigned long)(*(--(c))))    ; \
			case 3: l1|=((unsigned long)(*(--(c))))<< 8; \
			case 2: l1|=((unsigned long)(*(--(c))))<<16; \
			case 1: l1|=((unsigned long)(*(--(c))))<<24; \
				} \
			}

/* NOTE - c is not incremented as per l2n */
#define l2nn(l1,l2,c,n)	{ \
			c+=n; \
			switch (n) { \
			case 8: *(--(c))=(unsigned char)(((l2)    )&0xff); \
			case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
			case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
			case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
			case 4: *(--(c))=(unsigned char)(((l1)    )&0xff); \
			case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
			case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
			case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
				} \
			}

#undef n2l
#define n2l(c,l)        (l =((unsigned long)(*((c)++)))<<24L, \
                         l|=((unsigned long)(*((c)++)))<<16L, \
                         l|=((unsigned long)(*((c)++)))<< 8L, \
                         l|=((unsigned long)(*((c)++))))

#undef l2n
#define l2n(l,c)        (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
                         *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
                         *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
                         *((c)++)=(unsigned char)(((l)     )&0xff))

/* This is actually a big endian algorithm, the most significate byte
 * is used to lookup array 0 */

/* use BF_PTR2 for intel boxes,
 * BF_PTR for sparc and MIPS/SGI
 * use nothing for Alpha and HP.
 */
#if !defined(BF_PTR) && !defined(BF_PTR2)
#undef BF_PTR
#endif

#define BF_M	0x3fc
#define BF_0	22L
#define BF_1	14L
#define BF_2	 6L
#define BF_3	 2L /* left shift */

#if defined(BF_PTR2)

/* This is basically a special pentium verson */
#define BF_ENC(LL,R,S,P) \
	{ \
	BF_LONG t,u,v; \
	u=R>>BF_0; \
	v=R>>BF_1; \
	u&=BF_M; \
	v&=BF_M; \
	t=  *(BF_LONG *)((unsigned char *)&(S[  0])+u); \
	u=R>>BF_2; \
	t+= *(BF_LONG *)((unsigned char *)&(S[256])+v); \
	v=R<<BF_3; \
	u&=BF_M; \
	v&=BF_M; \
	t^= *(BF_LONG *)((unsigned char *)&(S[512])+u); \
	LL^=P; \
	t+= *(BF_LONG *)((unsigned char *)&(S[768])+v); \
	LL^=t; \
	}

#elif defined(BF_PTR)

/* This is normally very good */

#define BF_ENC(LL,R,S,P) \
	LL^=P; \
	LL^= (((*(BF_LONG *)((unsigned char *)&(S[  0])+((R>>BF_0)&BF_M))+ \
		*(BF_LONG *)((unsigned char *)&(S[256])+((R>>BF_1)&BF_M)))^ \
		*(BF_LONG *)((unsigned char *)&(S[512])+((R>>BF_2)&BF_M)))+ \
		*(BF_LONG *)((unsigned char *)&(S[768])+((R<<BF_3)&BF_M)));
#else

/* This will always work, even on 64 bit machines and strangly enough,
 * on the Alpha it is faster than the pointer versions (both 32 and 64
 * versions of BF_LONG) */

#define BF_ENC(LL,R,S,P) \
	LL^=P; \
	LL^=(((	S[        (R>>24L)      ] + \
		S[0x0100+((R>>16L)&0xff)])^ \
		S[0x0200+((R>> 8L)&0xff)])+ \
		S[0x0300+((R     )&0xff)])&0xffffffff;
#endif
Commit	Line	Data
1c79356b A	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.]
	57	*/
	58	/* WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
	59	*
	60	* Always modify bf_locl.org since bf_locl.h is automatically generated from
	61	* it during SSLeay configuration.
	62	*
	63	* WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
	64	*/
65
66	#undef c2l
67	#define c2l(c,l) (l =((unsigned long)(*((c)++))) , \
68	l\|=((unsigned long)(*((c)++)))<< 8L, \
69	l\|=((unsigned long)(*((c)++)))<<16L, \
70	l\|=((unsigned long)(*((c)++)))<<24L)
71
72	/* NOTE - c is not incremented as per c2l */
73	#undef c2ln
74	#define c2ln(c,l1,l2,n) { \
75	c+=n; \
76	l1=l2=0; \
77	switch (n) { \
78	case 8: l2 =((unsigned long)(*(--(c))))<<24L; \
79	case 7: l2\|=((unsigned long)(*(--(c))))<<16L; \
80	case 6: l2\|=((unsigned long)(*(--(c))))<< 8L; \
81	case 5: l2\|=((unsigned long)(*(--(c)))); \
82	case 4: l1 =((unsigned long)(*(--(c))))<<24L; \
83	case 3: l1\|=((unsigned long)(*(--(c))))<<16L; \
84	case 2: l1\|=((unsigned long)(*(--(c))))<< 8L; \
85	case 1: l1\|=((unsigned long)(*(--(c)))); \
86	} \
87	}
88
89	#undef l2c
90	#define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
91	*((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
92	*((c)++)=(unsigned char)(((l)>>16L)&0xff), \
93	*((c)++)=(unsigned char)(((l)>>24L)&0xff))
94
95	/* NOTE - c is not incremented as per l2c */
96	#undef l2cn
97	#define l2cn(l1,l2,c,n) { \
98	c+=n; \
99	switch (n) { \
100	case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
101	case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
102	case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
103	case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
104	case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
105	case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
106	case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
107	case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
108	} \
109	}
110
111	/* NOTE - c is not incremented as per n2l */
112	#define n2ln(c,l1,l2,n) { \
113	c+=n; \
114	l1=l2=0; \
115	switch (n) { \
116	case 8: l2 =((unsigned long)(*(--(c)))) ; \
117	case 7: l2\|=((unsigned long)(*(--(c))))<< 8; \
118	case 6: l2\|=((unsigned long)(*(--(c))))<<16; \
119	case 5: l2\|=((unsigned long)(*(--(c))))<<24; \
120	case 4: l1 =((unsigned long)(*(--(c)))) ; \
121	case 3: l1\|=((unsigned long)(*(--(c))))<< 8; \
122	case 2: l1\|=((unsigned long)(*(--(c))))<<16; \
123	case 1: l1\|=((unsigned long)(*(--(c))))<<24; \
124	} \
125	}
126
127	/* NOTE - c is not incremented as per l2n */
128	#define l2nn(l1,l2,c,n) { \
129	c+=n; \
130	switch (n) { \
131	case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \
132	case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
133	case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
134	case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
135	case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \
136	case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
137	case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
138	case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
139	} \
140	}
141
142	#undef n2l
143	#define n2l(c,l) (l =((unsigned long)(*((c)++)))<<24L, \
144	l\|=((unsigned long)(*((c)++)))<<16L, \
145	l\|=((unsigned long)(*((c)++)))<< 8L, \
146	l\|=((unsigned long)(*((c)++))))
147
148	#undef l2n
149	#define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
150	*((c)++)=(unsigned char)(((l)>>16L)&0xff), \
151	*((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
152	*((c)++)=(unsigned char)(((l) )&0xff))
153
154	/* This is actually a big endian algorithm, the most significate byte
155	* is used to lookup array 0 */
156
157	/* use BF_PTR2 for intel boxes,
158	* BF_PTR for sparc and MIPS/SGI
159	* use nothing for Alpha and HP.
160	*/
161	#if !defined(BF_PTR) && !defined(BF_PTR2)
162	#undef BF_PTR
163	#endif
164
165	#define BF_M 0x3fc
166	#define BF_0 22L
167	#define BF_1 14L
168	#define BF_2 6L
169	#define BF_3 2L /* left shift */
170
171	#if defined(BF_PTR2)
172
173	/* This is basically a special pentium verson */
174	#define BF_ENC(LL,R,S,P) \
175	{ \
176	BF_LONG t,u,v; \
177	u=R>>BF_0; \
178	v=R>>BF_1; \
179	u&=BF_M; \
180	v&=BF_M; \
181	t= (BF_LONG )((unsigned char *)&(S[ 0])+u); \
182	u=R>>BF_2; \
183	t+= (BF_LONG )((unsigned char *)&(S[256])+v); \
184	v=R<<BF_3; \
185	u&=BF_M; \
186	v&=BF_M; \
187	t^= (BF_LONG )((unsigned char *)&(S[512])+u); \
188	LL^=P; \
189	t+= (BF_LONG )((unsigned char *)&(S[768])+v); \
190	LL^=t; \
191	}
192
193	#elif defined(BF_PTR)
194
195	/* This is normally very good */
196
197	#define BF_ENC(LL,R,S,P) \
198	LL^=P; \
199	LL^= ((((BF_LONG )((unsigned char *)&(S[ 0])+((R>>BF_0)&BF_M))+ \
200	(BF_LONG )((unsigned char *)&(S[256])+((R>>BF_1)&BF_M)))^ \
201	(BF_LONG )((unsigned char *)&(S[512])+((R>>BF_2)&BF_M)))+ \
202	(BF_LONG )((unsigned char *)&(S[768])+((R<<BF_3)&BF_M)));
203	#else
204
205	/* This will always work, even on 64 bit machines and strangly enough,
206	* on the Alpha it is faster than the pointer versions (both 32 and 64
207	* versions of BF_LONG) */
208
209	#define BF_ENC(LL,R,S,P) \
210	LL^=P; \
211	LL^=((( S[ (R>>24L) ] + \
212	S[0x0100+((R>>16L)&0xff)])^ \
213	S[0x0200+((R>> 8L)&0xff)])+ \
214	S[0x0300+((R )&0xff)])&0xffffffff;
215	#endif