]>
Commit | Line | Data |
---|---|---|
d02b48c6 | 1 | /* crypto/bn/bn_lcl.h */ |
58964a49 | 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
d02b48c6 RE |
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_BN_LCL_H | |
60 | #define HEADER_BN_LCL_H | |
61 | ||
62 | #include "bn.h" | |
63 | ||
64 | #ifdef __cplusplus | |
65 | extern "C" { | |
66 | #endif | |
67 | ||
dfeab068 RE |
68 | /* Pentium pro 16,16,16,32,64 */ |
69 | /* Alpha 16,16,16,16.64 */ | |
70 | #define BN_MULL_SIZE_NORMAL (16) // 32 | |
71 | #define BN_MUL_RECURSIVE_SIZE_NORMAL (16) // 32 /* less than */ | |
72 | #define BN_SQR_RECURSIVE_SIZE_NORMAL (16) // 32 | |
73 | #define BN_MUL_LOW_RECURSIVE_SIZE_NORMAL (32) // 32 | |
74 | #define BN_MONT_CTX_SET_SIZE_WORD (64) // 32 | |
75 | ||
76 | #ifndef BN_MUL_COMBA | |
77 | #define bn_mul_comba8(r,a,b) bn_mul_normal(r,a,8,b,8) | |
78 | #define bn_mul_comba4(r,a,b) bn_mul_normal(r,a,4,b,4) | |
79 | /* This is probably faster than using the C code - I need to check */ | |
80 | #define bn_sqr_comba8(r,a) bn_mul_normal(r,a,8,a,8) | |
81 | #define bn_sqr_comba4(r,a) bn_mul_normal(r,a,4,a,4) | |
82 | #endif | |
83 | ||
d02b48c6 RE |
84 | /************************************************************* |
85 | * Using the long long type | |
86 | */ | |
87 | #define Lw(t) (((BN_ULONG)(t))&BN_MASK2) | |
88 | #define Hw(t) (((BN_ULONG)((t)>>BN_BITS2))&BN_MASK2) | |
89 | ||
dfeab068 RE |
90 | /* These are used for internal error checking and are not normally used */ |
91 | #ifdef BN_DEBUG | |
92 | #define bn_check_top(a) \ | |
93 | { if (((a)->top < 0) || ((a)->top > (a)->max)) \ | |
94 | { char *nullp=NULL; *nullp='z'; } } | |
95 | #define bn_check_num(a) if ((a) < 0) { char *nullp=NULL; *nullp='z'; } | |
96 | #else | |
97 | #define bn_check_top(a) | |
98 | #define bn_check_num(a) | |
99 | #endif | |
100 | ||
101 | /* This macro is to add extra stuff for development checking */ | |
102 | #ifdef BN_DEBUG | |
103 | #define bn_set_max(r) ((r)->max=(r)->top,BN_set_flags((r),BN_FLG_STATIC_DATA)) | |
104 | #else | |
105 | #define bn_set_max(r) | |
106 | #endif | |
107 | ||
108 | /* These macros are used to 'take' a section of a bignum for read only use */ | |
109 | #define bn_set_low(r,a,n) \ | |
110 | { \ | |
111 | (r)->top=((a)->top > (n))?(n):(a)->top; \ | |
112 | (r)->d=(a)->d; \ | |
113 | (r)->neg=(a)->neg; \ | |
114 | (r)->flags|=BN_FLG_STATIC_DATA; \ | |
115 | bn_set_max(r); \ | |
116 | } | |
117 | ||
118 | #define bn_set_high(r,a,n) \ | |
119 | { \ | |
120 | if ((a)->top > (n)) \ | |
121 | { \ | |
122 | (r)->top=(a)->top-n; \ | |
123 | (r)->d= &((a)->d[n]); \ | |
124 | } \ | |
125 | else \ | |
126 | (r)->top=0; \ | |
127 | (r)->neg=(a)->neg; \ | |
128 | (r)->flags|=BN_FLG_STATIC_DATA; \ | |
129 | bn_set_max(r); \ | |
d02b48c6 RE |
130 | } |
131 | ||
58964a49 | 132 | /* #define bn_expand(n,b) ((((b)/BN_BITS2) <= (n)->max)?(n):bn_expand2((n),(b))) */ |
d02b48c6 RE |
133 | |
134 | #ifdef BN_LLONG | |
135 | #define mul_add(r,a,w,c) { \ | |
136 | BN_ULLONG t; \ | |
137 | t=(BN_ULLONG)w * (a) + (r) + (c); \ | |
58964a49 | 138 | (r)= Lw(t); \ |
d02b48c6 RE |
139 | (c)= Hw(t); \ |
140 | } | |
141 | ||
142 | #define mul(r,a,w,c) { \ | |
143 | BN_ULLONG t; \ | |
144 | t=(BN_ULLONG)w * (a) + (c); \ | |
58964a49 | 145 | (r)= Lw(t); \ |
d02b48c6 RE |
146 | (c)= Hw(t); \ |
147 | } | |
148 | ||
d02b48c6 RE |
149 | #else |
150 | /************************************************************* | |
151 | * No long long type | |
152 | */ | |
153 | ||
154 | #define LBITS(a) ((a)&BN_MASK2l) | |
155 | #define HBITS(a) (((a)>>BN_BITS4)&BN_MASK2l) | |
156 | #define L2HBITS(a) ((BN_ULONG)((a)&BN_MASK2l)<<BN_BITS4) | |
157 | ||
158 | #define LLBITS(a) ((a)&BN_MASKl) | |
159 | #define LHBITS(a) (((a)>>BN_BITS2)&BN_MASKl) | |
160 | #define LL2HBITS(a) ((BN_ULLONG)((a)&BN_MASKl)<<BN_BITS2) | |
161 | ||
162 | #define mul64(l,h,bl,bh) \ | |
163 | { \ | |
164 | BN_ULONG m,m1,lt,ht; \ | |
165 | \ | |
166 | lt=l; \ | |
167 | ht=h; \ | |
168 | m =(bh)*(lt); \ | |
169 | lt=(bl)*(lt); \ | |
170 | m1=(bl)*(ht); \ | |
171 | ht =(bh)*(ht); \ | |
58964a49 | 172 | m=(m+m1)&BN_MASK2; if (m < m1) ht+=L2HBITS(1L); \ |
d02b48c6 RE |
173 | ht+=HBITS(m); \ |
174 | m1=L2HBITS(m); \ | |
58964a49 | 175 | lt=(lt+m1)&BN_MASK2; if (lt < m1) ht++; \ |
d02b48c6 RE |
176 | (l)=lt; \ |
177 | (h)=ht; \ | |
178 | } | |
179 | ||
180 | #define sqr64(lo,ho,in) \ | |
181 | { \ | |
182 | BN_ULONG l,h,m; \ | |
183 | \ | |
184 | h=(in); \ | |
185 | l=LBITS(h); \ | |
186 | h=HBITS(h); \ | |
187 | m =(l)*(h); \ | |
188 | l*=l; \ | |
189 | h*=h; \ | |
190 | h+=(m&BN_MASK2h1)>>(BN_BITS4-1); \ | |
191 | m =(m&BN_MASK2l)<<(BN_BITS4+1); \ | |
58964a49 | 192 | l=(l+m)&BN_MASK2; if (l < m) h++; \ |
d02b48c6 RE |
193 | (lo)=l; \ |
194 | (ho)=h; \ | |
195 | } | |
196 | ||
197 | #define mul_add(r,a,bl,bh,c) { \ | |
198 | BN_ULONG l,h; \ | |
199 | \ | |
200 | h= (a); \ | |
201 | l=LBITS(h); \ | |
202 | h=HBITS(h); \ | |
203 | mul64(l,h,(bl),(bh)); \ | |
204 | \ | |
205 | /* non-multiply part */ \ | |
58964a49 | 206 | l=(l+(c))&BN_MASK2; if (l < (c)) h++; \ |
d02b48c6 | 207 | (c)=(r); \ |
58964a49 | 208 | l=(l+(c))&BN_MASK2; if (l < (c)) h++; \ |
d02b48c6 | 209 | (c)=h&BN_MASK2; \ |
58964a49 | 210 | (r)=l; \ |
d02b48c6 RE |
211 | } |
212 | ||
213 | #define mul(r,a,bl,bh,c) { \ | |
214 | BN_ULONG l,h; \ | |
215 | \ | |
216 | h= (a); \ | |
217 | l=LBITS(h); \ | |
218 | h=HBITS(h); \ | |
219 | mul64(l,h,(bl),(bh)); \ | |
220 | \ | |
221 | /* non-multiply part */ \ | |
222 | l+=(c); if ((l&BN_MASK2) < (c)) h++; \ | |
223 | (c)=h&BN_MASK2; \ | |
224 | (r)=l&BN_MASK2; \ | |
225 | } | |
226 | ||
d02b48c6 RE |
227 | #endif |
228 | ||
dfeab068 RE |
229 | extern int bn_limit_bits; |
230 | extern int bn_limit_num; /* (1<<bn_limit_bits) */ | |
231 | /* Recursive 'low' limit */ | |
232 | extern int bn_limit_bits_low; | |
233 | extern int bn_limit_num_low; /* (1<<bn_limit_bits_low) */ | |
234 | /* Do modified 'high' part calculation' */ | |
235 | extern int bn_limit_bits_high; | |
236 | extern int bn_limit_num_high; /* (1<<bn_limit_bits_high) */ | |
237 | extern int bn_limit_bits_mont; | |
238 | extern int bn_limit_num_mont; /* (1<<bn_limit_bits_mont) */ | |
239 | ||
d02b48c6 RE |
240 | #ifndef NOPROTO |
241 | ||
242 | BIGNUM *bn_expand2(BIGNUM *b, int bits); | |
243 | ||
58964a49 RE |
244 | #ifdef X86_ASM |
245 | void bn_add_words(BN_ULONG *r,BN_ULONG *a,int num); | |
246 | #endif | |
247 | ||
d02b48c6 RE |
248 | #else |
249 | ||
250 | BIGNUM *bn_expand2(); | |
58964a49 RE |
251 | #ifdef X86_ASM |
252 | BN_ULONG bn_add_words(); | |
253 | #endif | |
d02b48c6 RE |
254 | |
255 | #endif | |
256 | ||
257 | #ifdef __cplusplus | |
258 | } | |
259 | #endif | |
260 | ||
261 | #endif | |
dfeab068 RE |
262 | |
263 | void bn_mul_low_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2,BN_ULONG *t); | |
264 | void bn_mul_high(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,BN_ULONG *l,int n2, BN_ULONG *t); | |
265 | ||
266 |