[apple/security.git] / OSX / libsecurity_apple_csp / open_ssl / bf / bf_locl.h

/* crypto/bf/bf_locl.h */
/* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
 * All rights reserved.
 *
 * This package is an SSL implementation written
 * by Eric Young (eay@cryptsoft.com).
 * 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@cryptsoft.com).
 * 
 * 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@cryptsoft.com)"
 *    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@cryptsoft.com)"
 * 
 * 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.]
 */

#ifndef HEADER_BF_LOCL_H
#define HEADER_BF_LOCL_H
#include <openssl/opensslconf.h> /* BF_PTR, BF_PTR2 */

#undef c2l
#define c2l(c,l)	(l =(((BF_LONG))(*((c)++)))    , \
			 l|=(((BF_LONG))(*((c)++)))<< 8L, \
			 l|=(((BF_LONG))(*((c)++)))<<16L, \
			 l|=(((BF_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 =(((BF_LONG))(*(--(c))))<<24L; \
			case 7: l2|=(((BF_LONG))(*(--(c))))<<16L; \
			case 6: l2|=(((BF_LONG))(*(--(c))))<< 8L; \
			case 5: l2|=(((BF_LONG))(*(--(c))));     \
			case 4: l1 =(((BF_LONG))(*(--(c))))<<24L; \
			case 3: l1|=(((BF_LONG))(*(--(c))))<<16L; \
			case 2: l1|=(((BF_LONG))(*(--(c))))<< 8L; \
			case 1: l1|=(((BF_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 =((BF_LONG)(*(--(c))))    ; \
			case 7: l2|=((BF_LONG)(*(--(c))))<< 8; \
			case 6: l2|=((BF_LONG)(*(--(c))))<<16; \
			case 5: l2|=((BF_LONG)(*(--(c))))<<24; \
			case 4: l1 =((BF_LONG)(*(--(c))))    ; \
			case 3: l1|=((BF_LONG)(*(--(c))))<< 8; \
			case 2: l1|=((BF_LONG)(*(--(c))))<<16; \
			case 1: l1|=((BF_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
#if	defined(__GNUC__) && defined(__ppc__)
/* alignment tolerant big-endian optimization */
	#define n2l(c,l)	{ l= *(((BF_LONG) *)c); c += 4; }
#else
/* little endian, etc. */
	#define n2l(c,l)	(l =((BF_LONG)(*((c)++)))<<24L, \
                         l|=((BF_LONG)(*((c)++)))<<16L, \
                         l|=((BF_LONG)(*((c)++)))<< 8L, \
                         l|=((BF_LONG)(*((c)++))))
#endif

#undef l2n
#if	defined(__GNUC__) && defined(__ppc__)
	/* alignment tolerant big-endian optimization */
	#define l2n(l,c)	{ *(((BF_LONG) *)c) = l; c += 4; }
#else
	/* little endian, etc. */
	#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))

#endif	/* GNU, big endian */

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

#if defined(BF_PTR2)

/*
 * This is basically a special Intel version. Point is that Intel
 * doesn't have many registers, but offers a reach choice of addressing
 * modes. So we spare some registers by directly traversing BF_KEY
 * structure and hiring the most decorated addressing mode. The code
 * generated by EGCS is *perfectly* competitive with assembler
 * implementation!
 */
#define BF_ENC(LL,R,KEY,Pi) (\
	LL^=KEY[Pi], \
	t=  KEY[BF_ROUNDS+2 +   0 + ((R>>24)&0xFF)], \
	t+= KEY[BF_ROUNDS+2 + 256 + ((R>>16)&0xFF)], \
	t^= KEY[BF_ROUNDS+2 + 512 + ((R>>8 )&0xFF)], \
	t+= KEY[BF_ROUNDS+2 + 768 + ((R    )&0xFF)], \
	LL^=t \
	)

#elif defined(BF_PTR)

#ifndef BF_LONG_LOG2
#define BF_LONG_LOG2  2       /* default to BF_LONG being 32 bits */
#endif
#define BF_M  (0xFF<<BF_LONG_LOG2)
#define BF_0  (24-BF_LONG_LOG2)
#define BF_1  (16-BF_LONG_LOG2)
#define BF_2  ( 8-BF_LONG_LOG2)
#define BF_3  BF_LONG_LOG2 /* left shift */

/*
 * This is normally very good on RISC platforms where normally you
 * have to explicitly "multiply" array index by sizeof(BF_LONG)
 * in order to calculate the effective address. This implementation
 * excuses CPU from this extra work. Power[PC] uses should have most
 * fun as (R>>BF_i)&BF_M gets folded into a single instruction, namely
 * rlwinm. So let'em double-check if their compiler does it.
 */

#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 is a *generic* version. Seem to perform best on platforms that
 * offer explicit support for extraction of 8-bit nibbles preferably
 * complemented with "multiplying" of array index by sizeof(BF_LONG).
 * For the moment of this writing the list comprises Alpha CPU featuring
 * extbl and s[48]addq instructions.
 */

#define BF_ENC(LL,R,S,P) ( \
	LL^=P, \
	LL^=(((	S[       ((int)(R>>24)&0xff)] + \
		S[0x0100+((int)(R>>16)&0xff)])^ \
		S[0x0200+((int)(R>> 8)&0xff)])+ \
		S[0x0300+((int)(R    )&0xff)])&0xffffffffL \
	)
#endif

#endif
Commit	Line	Data
b1ab9ed8 A	1	/* crypto/bf/bf_locl.h */
	2	/* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
	3	* All rights reserved.
	4	*
	5	* This package is an SSL implementation written
	6	* by Eric Young (eay@cryptsoft.com).
	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@cryptsoft.com).
	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@cryptsoft.com)"
	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@cryptsoft.com)"
	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
	59	#ifndef HEADER_BF_LOCL_H
	60	#define HEADER_BF_LOCL_H
	61	#include <openssl/opensslconf.h> /* BF_PTR, BF_PTR2 */
	62
	63	#undef c2l
427c49bc A	64	#define c2l(c,l) (l =(((BF_LONG))(*((c)++))) , \
	65	l\|=(((BF_LONG))(*((c)++)))<< 8L, \
	66	l\|=(((BF_LONG))(*((c)++)))<<16L, \
	67	l\|=(((BF_LONG))(*((c)++)))<<24L)
b1ab9ed8 A	68
	69	/* NOTE - c is not incremented as per c2l */
	70	#undef c2ln
	71	#define c2ln(c,l1,l2,n) { \
	72	c+=n; \
	73	l1=l2=0; \
	74	switch (n) { \
427c49bc A	75	case 8: l2 =(((BF_LONG))(*(--(c))))<<24L; \
	76	case 7: l2\|=(((BF_LONG))(*(--(c))))<<16L; \
	77	case 6: l2\|=(((BF_LONG))(*(--(c))))<< 8L; \
	78	case 5: l2\|=(((BF_LONG))(*(--(c)))); \
	79	case 4: l1 =(((BF_LONG))(*(--(c))))<<24L; \
	80	case 3: l1\|=(((BF_LONG))(*(--(c))))<<16L; \
	81	case 2: l1\|=(((BF_LONG))(*(--(c))))<< 8L; \
	82	case 1: l1\|=(((BF_LONG))(*(--(c)))); \
b1ab9ed8 A	83	} \
	84	}
	85
	86	#undef l2c
	87	#define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
	88	*((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
	89	*((c)++)=(unsigned char)(((l)>>16L)&0xff), \
	90	*((c)++)=(unsigned char)(((l)>>24L)&0xff))
	91
	92	/* NOTE - c is not incremented as per l2c */
	93	#undef l2cn
	94	#define l2cn(l1,l2,c,n) { \
	95	c+=n; \
	96	switch (n) { \
	97	case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
	98	case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
	99	case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
	100	case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
	101	case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
	102	case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
	103	case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
	104	case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
	105	} \
	106	}
	107
	108	/* NOTE - c is not incremented as per n2l */
	109	#define n2ln(c,l1,l2,n) { \
	110	c+=n; \
	111	l1=l2=0; \
	112	switch (n) { \
427c49bc A	113	case 8: l2 =((BF_LONG)(*(--(c)))) ; \
	114	case 7: l2\|=((BF_LONG)(*(--(c))))<< 8; \
	115	case 6: l2\|=((BF_LONG)(*(--(c))))<<16; \
	116	case 5: l2\|=((BF_LONG)(*(--(c))))<<24; \
	117	case 4: l1 =((BF_LONG)(*(--(c)))) ; \
	118	case 3: l1\|=((BF_LONG)(*(--(c))))<< 8; \
	119	case 2: l1\|=((BF_LONG)(*(--(c))))<<16; \
	120	case 1: l1\|=((BF_LONG)(*(--(c))))<<24; \
b1ab9ed8 A	121	} \
	122	}
	123
	124	/* NOTE - c is not incremented as per l2n */
	125	#define l2nn(l1,l2,c,n) { \
	126	c+=n; \
	127	switch (n) { \
	128	case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \
	129	case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
	130	case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
	131	case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
	132	case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \
	133	case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
	134	case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
	135	case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
	136	} \
	137	}
	138
	139	#undef n2l
	140	#if defined(__GNUC__) && defined(__ppc__)
	141	/* alignment tolerant big-endian optimization */
427c49bc	142	#define n2l(c,l) { l= (((BF_LONG) )c); c += 4; }
b1ab9ed8 A	143	#else
b1ab9ed8 A	144	/* little endian, etc. */
427c49bc A	145	#define n2l(c,l) (l =((BF_LONG)(*((c)++)))<<24L, \
	146	l\|=((BF_LONG)(*((c)++)))<<16L, \
	147	l\|=((BF_LONG)(*((c)++)))<< 8L, \
	148	l\|=((BF_LONG)(*((c)++))))
b1ab9ed8 A	149	#endif
	150
	151	#undef l2n
	152	#if defined(__GNUC__) && defined(__ppc__)
	153	/* alignment tolerant big-endian optimization */
427c49bc	154	#define l2n(l,c) { (((BF_LONG) )c) = l; c += 4; }
b1ab9ed8 A	155	#else
	156	/* little endian, etc. */
	157	#define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
	158	*((c)++)=(unsigned char)(((l)>>16L)&0xff), \
	159	*((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
	160	*((c)++)=(unsigned char)(((l) )&0xff))
	161
	162	#endif /* GNU, big endian */
	163
	164	/* This is actually a big endian algorithm, the most significant byte
	165	* is used to lookup array 0 */
	166
	167	#if defined(BF_PTR2)
	168
	169	/*
	170	* This is basically a special Intel version. Point is that Intel
	171	* doesn't have many registers, but offers a reach choice of addressing
	172	* modes. So we spare some registers by directly traversing BF_KEY
	173	* structure and hiring the most decorated addressing mode. The code
	174	* generated by EGCS is perfectly competitive with assembler
	175	* implementation!
	176	*/
	177	#define BF_ENC(LL,R,KEY,Pi) (\
	178	LL^=KEY[Pi], \
	179	t= KEY[BF_ROUNDS+2 + 0 + ((R>>24)&0xFF)], \
	180	t+= KEY[BF_ROUNDS+2 + 256 + ((R>>16)&0xFF)], \
	181	t^= KEY[BF_ROUNDS+2 + 512 + ((R>>8 )&0xFF)], \
	182	t+= KEY[BF_ROUNDS+2 + 768 + ((R )&0xFF)], \
	183	LL^=t \
	184	)
	185
	186	#elif defined(BF_PTR)
	187
	188	#ifndef BF_LONG_LOG2
	189	#define BF_LONG_LOG2 2 /* default to BF_LONG being 32 bits */
	190	#endif
	191	#define BF_M (0xFF<<BF_LONG_LOG2)
	192	#define BF_0 (24-BF_LONG_LOG2)
	193	#define BF_1 (16-BF_LONG_LOG2)
	194	#define BF_2 ( 8-BF_LONG_LOG2)
	195	#define BF_3 BF_LONG_LOG2 /* left shift */
	196
	197	/*
	198	* This is normally very good on RISC platforms where normally you
	199	* have to explicitly "multiply" array index by sizeof(BF_LONG)
	200	* in order to calculate the effective address. This implementation
	201	* excuses CPU from this extra work. Power[PC] uses should have most
	202	* fun as (R>>BF_i)&BF_M gets folded into a single instruction, namely
	203	* rlwinm. So let'em double-check if their compiler does it.
	204	*/
	205
	206	#define BF_ENC(LL,R,S,P) ( \
	207	LL^=P, \
	208	LL^= ((((BF_LONG )((unsigned char *)&(S[ 0])+((R>>BF_0)&BF_M))+ \
	209	(BF_LONG )((unsigned char *)&(S[256])+((R>>BF_1)&BF_M)))^ \
	210	(BF_LONG )((unsigned char *)&(S[512])+((R>>BF_2)&BF_M)))+ \
	211	(BF_LONG )((unsigned char *)&(S[768])+((R<<BF_3)&BF_M))) \
	212	)
	213	#else
	214
	215	/*
	216	* This is a generic version. Seem to perform best on platforms that
	217	* offer explicit support for extraction of 8-bit nibbles preferably
	218	* complemented with "multiplying" of array index by sizeof(BF_LONG).
219	* For the moment of this writing the list comprises Alpha CPU featuring
220	* extbl and s[48]addq instructions.
221	*/
222
223	#define BF_ENC(LL,R,S,P) ( \
224	LL^=P, \
225	LL^=((( S[ ((int)(R>>24)&0xff)] + \
226	S[0x0100+((int)(R>>16)&0xff)])^ \
227	S[0x0200+((int)(R>> 8)&0xff)])+ \
228	S[0x0300+((int)(R )&0xff)])&0xffffffffL \
229	)
230	#endif
231
232	#endif