fix check
[openssl.git] / crypto / rc2 / rc2_locl.h
1 /* Copyright (C) 1995-1998 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.
7  *
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).
14  *
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.
21  *
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 :-).
36  * 4. If you include any Windows specific code (or a derivative thereof) from
37  *    the apps directory (application code) you must include an acknowledgement:
38  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
39  *
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.
51  *
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
58 #undef c2l
59 #define c2l(c,l)        (l =((unsigned long)(*((c)++)))    , \
60                          l|=((unsigned long)(*((c)++)))<< 8L, \
61                          l|=((unsigned long)(*((c)++)))<<16L, \
62                          l|=((unsigned long)(*((c)++)))<<24L)
63
64 /* NOTE - c is not incremented as per c2l */
65 #undef c2ln
66 #define c2ln(c,l1,l2,n) { \
67                         c+=n; \
68                         l1=l2=0; \
69                         switch (n) { \
70                         case 8: l2 =((unsigned long)(*(--(c))))<<24L; \
71                         case 7: l2|=((unsigned long)(*(--(c))))<<16L; \
72                         case 6: l2|=((unsigned long)(*(--(c))))<< 8L; \
73                         case 5: l2|=((unsigned long)(*(--(c))));     \
74                         case 4: l1 =((unsigned long)(*(--(c))))<<24L; \
75                         case 3: l1|=((unsigned long)(*(--(c))))<<16L; \
76                         case 2: l1|=((unsigned long)(*(--(c))))<< 8L; \
77                         case 1: l1|=((unsigned long)(*(--(c))));     \
78                                 } \
79                         }
80
81 #undef l2c
82 #define l2c(l,c)        (*((c)++)=(unsigned char)(((l)     )&0xff), \
83                          *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
84                          *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
85                          *((c)++)=(unsigned char)(((l)>>24L)&0xff))
86
87 /* NOTE - c is not incremented as per l2c */
88 #undef l2cn
89 #define l2cn(l1,l2,c,n) { \
90                         c+=n; \
91                         switch (n) { \
92                         case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
93                         case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
94                         case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
95                         case 5: *(--(c))=(unsigned char)(((l2)     )&0xff); \
96                         case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
97                         case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
98                         case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
99                         case 1: *(--(c))=(unsigned char)(((l1)     )&0xff); \
100                                 } \
101                         }
102
103 /* NOTE - c is not incremented as per n2l */
104 #define n2ln(c,l1,l2,n) { \
105                         c+=n; \
106                         l1=l2=0; \
107                         switch (n) { \
108                         case 8: l2 =((unsigned long)(*(--(c))))    ; \
109                         case 7: l2|=((unsigned long)(*(--(c))))<< 8; \
110                         case 6: l2|=((unsigned long)(*(--(c))))<<16; \
111                         case 5: l2|=((unsigned long)(*(--(c))))<<24; \
112                         case 4: l1 =((unsigned long)(*(--(c))))    ; \
113                         case 3: l1|=((unsigned long)(*(--(c))))<< 8; \
114                         case 2: l1|=((unsigned long)(*(--(c))))<<16; \
115                         case 1: l1|=((unsigned long)(*(--(c))))<<24; \
116                                 } \
117                         }
118
119 /* NOTE - c is not incremented as per l2n */
120 #define l2nn(l1,l2,c,n) { \
121                         c+=n; \
122                         switch (n) { \
123                         case 8: *(--(c))=(unsigned char)(((l2)    )&0xff); \
124                         case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
125                         case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
126                         case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
127                         case 4: *(--(c))=(unsigned char)(((l1)    )&0xff); \
128                         case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
129                         case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
130                         case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
131                                 } \
132                         }
133
134 #undef n2l
135 #define n2l(c,l)        (l =((unsigned long)(*((c)++)))<<24L, \
136                          l|=((unsigned long)(*((c)++)))<<16L, \
137                          l|=((unsigned long)(*((c)++)))<< 8L, \
138                          l|=((unsigned long)(*((c)++))))
139
140 #undef l2n
141 #define l2n(l,c)        (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
142                          *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
143                          *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
144                          *((c)++)=(unsigned char)(((l)     )&0xff))
145
146 #define C_RC2(n) \
147         t=(x0+(x1& ~x3)+(x2&x3)+ *(p0++))&0xffff; \
148         x0=(t<<1)|(t>>15); \
149         t=(x1+(x2& ~x0)+(x3&x0)+ *(p0++))&0xffff; \
150         x1=(t<<2)|(t>>14); \
151         t=(x2+(x3& ~x1)+(x0&x1)+ *(p0++))&0xffff; \
152         x2=(t<<3)|(t>>13); \
153         t=(x3+(x0& ~x2)+(x1&x2)+ *(p0++))&0xffff; \
154         x3=(t<<5)|(t>>11);