|
sl@0
|
1 |
/* crypto/rc2/rc2_locl.h */
|
|
sl@0
|
2 |
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
|
|
sl@0
|
3 |
* All rights reserved.
|
|
sl@0
|
4 |
*
|
|
sl@0
|
5 |
* This package is an SSL implementation written
|
|
sl@0
|
6 |
* by Eric Young (eay@cryptsoft.com).
|
|
sl@0
|
7 |
* The implementation was written so as to conform with Netscapes SSL.
|
|
sl@0
|
8 |
*
|
|
sl@0
|
9 |
* This library is free for commercial and non-commercial use as long as
|
|
sl@0
|
10 |
* the following conditions are aheared to. The following conditions
|
|
sl@0
|
11 |
* apply to all code found in this distribution, be it the RC4, RSA,
|
|
sl@0
|
12 |
* lhash, DES, etc., code; not just the SSL code. The SSL documentation
|
|
sl@0
|
13 |
* included with this distribution is covered by the same copyright terms
|
|
sl@0
|
14 |
* except that the holder is Tim Hudson (tjh@cryptsoft.com).
|
|
sl@0
|
15 |
*
|
|
sl@0
|
16 |
* Copyright remains Eric Young's, and as such any Copyright notices in
|
|
sl@0
|
17 |
* the code are not to be removed.
|
|
sl@0
|
18 |
* If this package is used in a product, Eric Young should be given attribution
|
|
sl@0
|
19 |
* as the author of the parts of the library used.
|
|
sl@0
|
20 |
* This can be in the form of a textual message at program startup or
|
|
sl@0
|
21 |
* in documentation (online or textual) provided with the package.
|
|
sl@0
|
22 |
*
|
|
sl@0
|
23 |
* Redistribution and use in source and binary forms, with or without
|
|
sl@0
|
24 |
* modification, are permitted provided that the following conditions
|
|
sl@0
|
25 |
* are met:
|
|
sl@0
|
26 |
* 1. Redistributions of source code must retain the copyright
|
|
sl@0
|
27 |
* notice, this list of conditions and the following disclaimer.
|
|
sl@0
|
28 |
* 2. Redistributions in binary form must reproduce the above copyright
|
|
sl@0
|
29 |
* notice, this list of conditions and the following disclaimer in the
|
|
sl@0
|
30 |
* documentation and/or other materials provided with the distribution.
|
|
sl@0
|
31 |
* 3. All advertising materials mentioning features or use of this software
|
|
sl@0
|
32 |
* must display the following acknowledgement:
|
|
sl@0
|
33 |
* "This product includes cryptographic software written by
|
|
sl@0
|
34 |
* Eric Young (eay@cryptsoft.com)"
|
|
sl@0
|
35 |
* The word 'cryptographic' can be left out if the rouines from the library
|
|
sl@0
|
36 |
* being used are not cryptographic related :-).
|
|
sl@0
|
37 |
* 4. If you include any Windows specific code (or a derivative thereof) from
|
|
sl@0
|
38 |
* the apps directory (application code) you must include an acknowledgement:
|
|
sl@0
|
39 |
* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
|
|
sl@0
|
40 |
*
|
|
sl@0
|
41 |
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
|
|
sl@0
|
42 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
sl@0
|
43 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
sl@0
|
44 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
sl@0
|
45 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
sl@0
|
46 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
sl@0
|
47 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
sl@0
|
48 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
sl@0
|
49 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
sl@0
|
50 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
sl@0
|
51 |
* SUCH DAMAGE.
|
|
sl@0
|
52 |
*
|
|
sl@0
|
53 |
* The licence and distribution terms for any publically available version or
|
|
sl@0
|
54 |
* derivative of this code cannot be changed. i.e. this code cannot simply be
|
|
sl@0
|
55 |
* copied and put under another distribution licence
|
|
sl@0
|
56 |
* [including the GNU Public Licence.]
|
|
sl@0
|
57 |
*/
|
|
sl@0
|
58 |
|
|
sl@0
|
59 |
#undef c2l
|
|
sl@0
|
60 |
#define c2l(c,l) (l =((unsigned long)(*((c)++))) , \
|
|
sl@0
|
61 |
l|=((unsigned long)(*((c)++)))<< 8L, \
|
|
sl@0
|
62 |
l|=((unsigned long)(*((c)++)))<<16L, \
|
|
sl@0
|
63 |
l|=((unsigned long)(*((c)++)))<<24L)
|
|
sl@0
|
64 |
|
|
sl@0
|
65 |
/* NOTE - c is not incremented as per c2l */
|
|
sl@0
|
66 |
#undef c2ln
|
|
sl@0
|
67 |
#define c2ln(c,l1,l2,n) { \
|
|
sl@0
|
68 |
c+=n; \
|
|
sl@0
|
69 |
l1=l2=0; \
|
|
sl@0
|
70 |
switch (n) { \
|
|
sl@0
|
71 |
case 8: l2 =((unsigned long)(*(--(c))))<<24L; \
|
|
sl@0
|
72 |
case 7: l2|=((unsigned long)(*(--(c))))<<16L; \
|
|
sl@0
|
73 |
case 6: l2|=((unsigned long)(*(--(c))))<< 8L; \
|
|
sl@0
|
74 |
case 5: l2|=((unsigned long)(*(--(c)))); \
|
|
sl@0
|
75 |
case 4: l1 =((unsigned long)(*(--(c))))<<24L; \
|
|
sl@0
|
76 |
case 3: l1|=((unsigned long)(*(--(c))))<<16L; \
|
|
sl@0
|
77 |
case 2: l1|=((unsigned long)(*(--(c))))<< 8L; \
|
|
sl@0
|
78 |
case 1: l1|=((unsigned long)(*(--(c)))); \
|
|
sl@0
|
79 |
} \
|
|
sl@0
|
80 |
}
|
|
sl@0
|
81 |
|
|
sl@0
|
82 |
#undef l2c
|
|
sl@0
|
83 |
#define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
|
|
sl@0
|
84 |
*((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
|
|
sl@0
|
85 |
*((c)++)=(unsigned char)(((l)>>16L)&0xff), \
|
|
sl@0
|
86 |
*((c)++)=(unsigned char)(((l)>>24L)&0xff))
|
|
sl@0
|
87 |
|
|
sl@0
|
88 |
/* NOTE - c is not incremented as per l2c */
|
|
sl@0
|
89 |
#undef l2cn
|
|
sl@0
|
90 |
#define l2cn(l1,l2,c,n) { \
|
|
sl@0
|
91 |
c+=n; \
|
|
sl@0
|
92 |
switch (n) { \
|
|
sl@0
|
93 |
case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
|
|
sl@0
|
94 |
case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
|
|
sl@0
|
95 |
case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
|
|
sl@0
|
96 |
case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
|
|
sl@0
|
97 |
case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
|
|
sl@0
|
98 |
case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
|
|
sl@0
|
99 |
case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
|
|
sl@0
|
100 |
case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
|
|
sl@0
|
101 |
} \
|
|
sl@0
|
102 |
}
|
|
sl@0
|
103 |
|
|
sl@0
|
104 |
/* NOTE - c is not incremented as per n2l */
|
|
sl@0
|
105 |
#define n2ln(c,l1,l2,n) { \
|
|
sl@0
|
106 |
c+=n; \
|
|
sl@0
|
107 |
l1=l2=0; \
|
|
sl@0
|
108 |
switch (n) { \
|
|
sl@0
|
109 |
case 8: l2 =((unsigned long)(*(--(c)))) ; \
|
|
sl@0
|
110 |
case 7: l2|=((unsigned long)(*(--(c))))<< 8; \
|
|
sl@0
|
111 |
case 6: l2|=((unsigned long)(*(--(c))))<<16; \
|
|
sl@0
|
112 |
case 5: l2|=((unsigned long)(*(--(c))))<<24; \
|
|
sl@0
|
113 |
case 4: l1 =((unsigned long)(*(--(c)))) ; \
|
|
sl@0
|
114 |
case 3: l1|=((unsigned long)(*(--(c))))<< 8; \
|
|
sl@0
|
115 |
case 2: l1|=((unsigned long)(*(--(c))))<<16; \
|
|
sl@0
|
116 |
case 1: l1|=((unsigned long)(*(--(c))))<<24; \
|
|
sl@0
|
117 |
} \
|
|
sl@0
|
118 |
}
|
|
sl@0
|
119 |
|
|
sl@0
|
120 |
/* NOTE - c is not incremented as per l2n */
|
|
sl@0
|
121 |
#define l2nn(l1,l2,c,n) { \
|
|
sl@0
|
122 |
c+=n; \
|
|
sl@0
|
123 |
switch (n) { \
|
|
sl@0
|
124 |
case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \
|
|
sl@0
|
125 |
case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
|
|
sl@0
|
126 |
case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
|
|
sl@0
|
127 |
case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
|
|
sl@0
|
128 |
case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \
|
|
sl@0
|
129 |
case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
|
|
sl@0
|
130 |
case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
|
|
sl@0
|
131 |
case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
|
|
sl@0
|
132 |
} \
|
|
sl@0
|
133 |
}
|
|
sl@0
|
134 |
|
|
sl@0
|
135 |
#undef n2l
|
|
sl@0
|
136 |
#define n2l(c,l) (l =((unsigned long)(*((c)++)))<<24L, \
|
|
sl@0
|
137 |
l|=((unsigned long)(*((c)++)))<<16L, \
|
|
sl@0
|
138 |
l|=((unsigned long)(*((c)++)))<< 8L, \
|
|
sl@0
|
139 |
l|=((unsigned long)(*((c)++))))
|
|
sl@0
|
140 |
|
|
sl@0
|
141 |
#undef l2n
|
|
sl@0
|
142 |
#define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
|
|
sl@0
|
143 |
*((c)++)=(unsigned char)(((l)>>16L)&0xff), \
|
|
sl@0
|
144 |
*((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
|
|
sl@0
|
145 |
*((c)++)=(unsigned char)(((l) )&0xff))
|
|
sl@0
|
146 |
|
|
sl@0
|
147 |
#define C_RC2(n) \
|
|
sl@0
|
148 |
t=(x0+(x1& ~x3)+(x2&x3)+ *(p0++))&0xffff; \
|
|
sl@0
|
149 |
x0=(t<<1)|(t>>15); \
|
|
sl@0
|
150 |
t=(x1+(x2& ~x0)+(x3&x0)+ *(p0++))&0xffff; \
|
|
sl@0
|
151 |
x1=(t<<2)|(t>>14); \
|
|
sl@0
|
152 |
t=(x2+(x3& ~x1)+(x0&x1)+ *(p0++))&0xffff; \
|
|
sl@0
|
153 |
x2=(t<<3)|(t>>13); \
|
|
sl@0
|
154 |
t=(x3+(x0& ~x2)+(x1&x2)+ *(p0++))&0xffff; \
|
|
sl@0
|
155 |
x3=(t<<5)|(t>>11);
|
|
sl@0
|
156 |
|