]>
Commit | Line | Data |
---|---|---|
d02b48c6 | 1 | /* crypto/bn/bn_div.c */ |
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 | #include <stdio.h> | |
84c15db5 | 60 | #include <openssl/bn.h> |
d02b48c6 RE |
61 | #include "cryptlib.h" |
62 | #include "bn_lcl.h" | |
63 | ||
64 | /* The old slow way */ | |
9b141126 | 65 | #if 1 |
0bde1089 UM |
66 | int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, |
67 | BN_CTX *ctx) | |
d02b48c6 RE |
68 | { |
69 | int i,nm,nd; | |
9b141126 | 70 | int ret = 0; |
d02b48c6 RE |
71 | BIGNUM *D; |
72 | ||
dfeab068 RE |
73 | bn_check_top(m); |
74 | bn_check_top(d); | |
d02b48c6 RE |
75 | if (BN_is_zero(d)) |
76 | { | |
77 | BNerr(BN_F_BN_DIV,BN_R_DIV_BY_ZERO); | |
78 | return(0); | |
79 | } | |
80 | ||
81 | if (BN_ucmp(m,d) < 0) | |
82 | { | |
83 | if (rem != NULL) | |
84 | { if (BN_copy(rem,m) == NULL) return(0); } | |
85 | if (dv != NULL) BN_zero(dv); | |
86 | return(1); | |
87 | } | |
88 | ||
9b141126 UM |
89 | BN_CTX_start(ctx); |
90 | D = BN_CTX_get(ctx); | |
91 | if (dv == NULL) dv = BN_CTX_get(ctx); | |
92 | if (rem == NULL) rem = BN_CTX_get(ctx); | |
93 | if (D == NULL || dv == NULL || rem == NULL) | |
94 | goto end; | |
d02b48c6 RE |
95 | |
96 | nd=BN_num_bits(d); | |
97 | nm=BN_num_bits(m); | |
9b141126 UM |
98 | if (BN_copy(D,d) == NULL) goto end; |
99 | if (BN_copy(rem,m) == NULL) goto end; | |
d02b48c6 RE |
100 | |
101 | /* The next 2 are needed so we can do a dv->d[0]|=1 later | |
102 | * since BN_lshift1 will only work once there is a value :-) */ | |
103 | BN_zero(dv); | |
dfeab068 | 104 | bn_wexpand(dv,1); |
d02b48c6 RE |
105 | dv->top=1; |
106 | ||
9b141126 | 107 | if (!BN_lshift(D,D,nm-nd)) goto end; |
d02b48c6 RE |
108 | for (i=nm-nd; i>=0; i--) |
109 | { | |
9b141126 | 110 | if (!BN_lshift1(dv,dv)) goto end; |
d02b48c6 RE |
111 | if (BN_ucmp(rem,D) >= 0) |
112 | { | |
113 | dv->d[0]|=1; | |
9b141126 | 114 | if (!BN_usub(rem,rem,D)) goto end; |
d02b48c6 RE |
115 | } |
116 | /* CAN IMPROVE (and have now :=) */ | |
9b141126 | 117 | if (!BN_rshift1(D,D)) goto end; |
d02b48c6 RE |
118 | } |
119 | rem->neg=BN_is_zero(rem)?0:m->neg; | |
120 | dv->neg=m->neg^d->neg; | |
9b141126 UM |
121 | ret = 1; |
122 | end: | |
123 | BN_CTX_end(ctx); | |
124 | return(ret); | |
d02b48c6 RE |
125 | } |
126 | ||
127 | #else | |
128 | ||
84c15db5 BL |
129 | int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor, |
130 | BN_CTX *ctx) | |
d02b48c6 RE |
131 | { |
132 | int norm_shift,i,j,loop; | |
133 | BIGNUM *tmp,wnum,*snum,*sdiv,*res; | |
134 | BN_ULONG *resp,*wnump; | |
135 | BN_ULONG d0,d1; | |
136 | int num_n,div_n; | |
137 | ||
dfeab068 RE |
138 | bn_check_top(num); |
139 | bn_check_top(divisor); | |
140 | ||
58964a49 | 141 | if (BN_is_zero(divisor)) |
d02b48c6 RE |
142 | { |
143 | BNerr(BN_F_BN_DIV,BN_R_DIV_BY_ZERO); | |
144 | return(0); | |
145 | } | |
146 | ||
147 | if (BN_ucmp(num,divisor) < 0) | |
148 | { | |
149 | if (rm != NULL) | |
150 | { if (BN_copy(rm,num) == NULL) return(0); } | |
151 | if (dv != NULL) BN_zero(dv); | |
152 | return(1); | |
153 | } | |
154 | ||
9b141126 UM |
155 | BN_CTX_start(ctx); |
156 | tmp=BN_CTX_get(ctx); | |
d02b48c6 | 157 | tmp->neg=0; |
9b141126 UM |
158 | snum=BN_CTX_get(ctx); |
159 | sdiv=BN_CTX_get(ctx); | |
d02b48c6 | 160 | if (dv == NULL) |
9b141126 | 161 | res=BN_CTX_get(ctx); |
d02b48c6 | 162 | else res=dv; |
9b141126 | 163 | if (res == NULL) goto err; |
d02b48c6 RE |
164 | |
165 | /* First we normalise the numbers */ | |
166 | norm_shift=BN_BITS2-((BN_num_bits(divisor))%BN_BITS2); | |
167 | BN_lshift(sdiv,divisor,norm_shift); | |
168 | sdiv->neg=0; | |
169 | norm_shift+=BN_BITS2; | |
170 | BN_lshift(snum,num,norm_shift); | |
171 | snum->neg=0; | |
172 | div_n=sdiv->top; | |
173 | num_n=snum->top; | |
174 | loop=num_n-div_n; | |
175 | ||
176 | /* Lets setup a 'window' into snum | |
177 | * This is the part that corresponds to the current | |
178 | * 'area' being divided */ | |
dfeab068 | 179 | BN_init(&wnum); |
d02b48c6 RE |
180 | wnum.d= &(snum->d[loop]); |
181 | wnum.top= div_n; | |
dfeab068 | 182 | wnum.max= snum->max+1; /* a bit of a lie */ |
d02b48c6 RE |
183 | |
184 | /* Get the top 2 words of sdiv */ | |
185 | /* i=sdiv->top; */ | |
186 | d0=sdiv->d[div_n-1]; | |
187 | d1=(div_n == 1)?0:sdiv->d[div_n-2]; | |
188 | ||
189 | /* pointer to the 'top' of snum */ | |
190 | wnump= &(snum->d[num_n-1]); | |
191 | ||
192 | /* Setup to 'res' */ | |
193 | res->neg= (num->neg^divisor->neg); | |
58964a49 | 194 | if (!bn_wexpand(res,(loop+1))) goto err; |
dfeab068 | 195 | res->top=loop; |
d02b48c6 RE |
196 | resp= &(res->d[loop-1]); |
197 | ||
198 | /* space for temp */ | |
58964a49 | 199 | if (!bn_wexpand(tmp,(div_n+1))) goto err; |
d02b48c6 RE |
200 | |
201 | if (BN_ucmp(&wnum,sdiv) >= 0) | |
202 | { | |
dfeab068 | 203 | if (!BN_usub(&wnum,&wnum,sdiv)) goto err; |
d02b48c6 RE |
204 | *resp=1; |
205 | res->d[res->top-1]=1; | |
206 | } | |
207 | else | |
208 | res->top--; | |
209 | resp--; | |
210 | ||
211 | for (i=0; i<loop-1; i++) | |
212 | { | |
0dd25e36 AP |
213 | BN_ULONG q,l0; |
214 | #ifdef BN_DIV3W | |
0bbd0352 | 215 | q=bn_div_3_words(wnump,d1,d0); |
0dd25e36 | 216 | #else |
4c22909e | 217 | |
97e84e38 | 218 | #if !defined(NO_ASM) && !defined(PEDANTIC) |
4c22909e | 219 | # if defined(__GNUC__) && __GNUC__>=2 |
3b14cb71 | 220 | # if defined(__i386) |
4c22909e AP |
221 | /* |
222 | * There were two reasons for implementing this template: | |
223 | * - GNU C generates a call to a function (__udivdi3 to be exact) | |
224 | * in reply to ((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0 (I fail to | |
225 | * understand why...); | |
226 | * - divl doesn't only calculate quotient, but also leaves | |
227 | * remainder in %edx which we can definitely use here:-) | |
228 | * | |
229 | * <appro@fy.chalmers.se> | |
230 | */ | |
231 | # define bn_div_words(n0,n1,d0) \ | |
232 | ({ asm volatile ( \ | |
233 | "divl %4" \ | |
234 | : "=a"(q), "=d"(rem) \ | |
235 | : "a"(n1), "d"(n0), "g"(d0) \ | |
236 | : "cc"); \ | |
237 | q; \ | |
238 | }) | |
fe7cd164 | 239 | # define REMAINDER_IS_ALREADY_CALCULATED |
4c22909e AP |
240 | # endif /* __<cpu> */ |
241 | # endif /* __GNUC__ */ | |
242 | #endif /* NO_ASM */ | |
243 | BN_ULONG n0,n1,rem=0; | |
d02b48c6 | 244 | |
d02b48c6 RE |
245 | n0=wnump[0]; |
246 | n1=wnump[-1]; | |
247 | if (n0 == d0) | |
cb5b7850 | 248 | { |
d02b48c6 | 249 | q=BN_MASK2; |
cb5b7850 BM |
250 | #ifdef REMAINDER_IS_ALREADY_CALCULATED /* in this case it isn't */ |
251 | rem=(n1-q*d0)&BN_MASK2; | |
252 | #endif | |
253 | } | |
254 | else /* n0 < d0 */ | |
4c22909e | 255 | #if defined(BN_LLONG) && defined(BN_DIV2W) && !defined(bn_div_words) |
8e1589ec | 256 | q=(BN_ULONG)(((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0); |
0dd25e36 | 257 | #else |
dfeab068 | 258 | q=bn_div_words(n0,n1,d0); |
0dd25e36 | 259 | #endif |
d02b48c6 RE |
260 | { |
261 | #ifdef BN_LLONG | |
0dd25e36 AP |
262 | BN_ULLONG t2; |
263 | ||
fe7cd164 | 264 | #ifndef REMAINDER_IS_ALREADY_CALCULATED |
0dd25e36 AP |
265 | /* |
266 | * rem doesn't have to be BN_ULLONG. The least we | |
267 | * know it's less that d0, isn't it? | |
268 | */ | |
269 | rem=(n1-q*d0)&BN_MASK2; | |
4c22909e | 270 | #endif |
0dd25e36 | 271 | t2=(BN_ULLONG)d1*q; |
4c22909e | 272 | |
d02b48c6 RE |
273 | for (;;) |
274 | { | |
0dd25e36 | 275 | if (t2 <= ((((BN_ULLONG)rem)<<BN_BITS2)|wnump[-2])) |
d02b48c6 RE |
276 | break; |
277 | q--; | |
0dd25e36 AP |
278 | rem += d0; |
279 | if (rem < d0) break; /* don't let rem overflow */ | |
280 | t2 -= d1; | |
d02b48c6 RE |
281 | } |
282 | #else | |
0dd25e36 AP |
283 | BN_ULONG t2l,t2h,ql,qh; |
284 | ||
fe7cd164 | 285 | #ifndef REMAINDER_IS_ALREADY_CALCULATED |
0dd25e36 AP |
286 | /* |
287 | * It's more than enough with the only multiplication. | |
288 | * See the comment above in BN_LLONG section... | |
289 | */ | |
290 | rem=(n1-q*d0)&BN_MASK2; | |
4c22909e | 291 | #endif |
fb81ac5e AP |
292 | #ifdef BN_UMULT_HIGH |
293 | t2l = d1 * q; | |
294 | t2h = BN_UMULT_HIGH(d1,q); | |
295 | #else | |
0dd25e36 AP |
296 | t2l=LBITS(d1); t2h=HBITS(d1); |
297 | ql =LBITS(q); qh =HBITS(q); | |
298 | mul64(t2l,t2h,ql,qh); /* t2=(BN_ULLONG)d1*q; */ | |
fb81ac5e | 299 | #endif |
0dd25e36 | 300 | |
d02b48c6 RE |
301 | for (;;) |
302 | { | |
0dd25e36 AP |
303 | if ((t2h < rem) || |
304 | ((t2h == rem) && (t2l <= wnump[-2]))) | |
305 | break; | |
d02b48c6 | 306 | q--; |
0dd25e36 AP |
307 | rem += d0; |
308 | if (rem < d0) break; /* don't let rem overflow */ | |
309 | if (t2l < d1) t2h--; t2l -= d1; | |
d02b48c6 RE |
310 | } |
311 | #endif | |
312 | } | |
4c22909e | 313 | #endif /* !BN_DIV3W */ |
58964a49 | 314 | l0=bn_mul_words(tmp->d,sdiv->d,div_n,q); |
0bbd0352 | 315 | wnum.d--; wnum.top++; |
d02b48c6 RE |
316 | tmp->d[div_n]=l0; |
317 | for (j=div_n+1; j>0; j--) | |
318 | if (tmp->d[j-1]) break; | |
319 | tmp->top=j; | |
320 | ||
321 | j=wnum.top; | |
322 | BN_sub(&wnum,&wnum,tmp); | |
323 | ||
324 | snum->top=snum->top+wnum.top-j; | |
325 | ||
326 | if (wnum.neg) | |
327 | { | |
328 | q--; | |
329 | j=wnum.top; | |
330 | BN_add(&wnum,&wnum,sdiv); | |
331 | snum->top+=wnum.top-j; | |
332 | } | |
333 | *(resp--)=q; | |
334 | wnump--; | |
335 | } | |
336 | if (rm != NULL) | |
337 | { | |
338 | BN_rshift(rm,snum,norm_shift); | |
339 | rm->neg=num->neg; | |
340 | } | |
9b141126 | 341 | BN_CTX_end(ctx); |
d02b48c6 RE |
342 | return(1); |
343 | err: | |
9b141126 | 344 | BN_CX_end(ctx); |
d02b48c6 RE |
345 | return(0); |
346 | } | |
347 | ||
348 | #endif | |
dfeab068 RE |
349 | |
350 | /* rem != m */ | |
84c15db5 | 351 | int BN_mod(BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx) |
dfeab068 RE |
352 | { |
353 | #if 0 /* The old slow way */ | |
354 | int i,nm,nd; | |
355 | BIGNUM *dv; | |
356 | ||
357 | if (BN_ucmp(m,d) < 0) | |
358 | return((BN_copy(rem,m) == NULL)?0:1); | |
359 | ||
9b141126 UM |
360 | BN_CTX_start(ctx); |
361 | dv=BN_CTX_get(ctx); | |
dfeab068 | 362 | |
9b141126 | 363 | if (!BN_copy(rem,m)) goto err; |
dfeab068 RE |
364 | |
365 | nm=BN_num_bits(rem); | |
366 | nd=BN_num_bits(d); | |
9b141126 | 367 | if (!BN_lshift(dv,d,nm-nd)) goto err; |
dfeab068 RE |
368 | for (i=nm-nd; i>=0; i--) |
369 | { | |
370 | if (BN_cmp(rem,dv) >= 0) | |
371 | { | |
9b141126 | 372 | if (!BN_sub(rem,rem,dv)) goto err; |
dfeab068 | 373 | } |
9b141126 | 374 | if (!BN_rshift1(dv,dv)) goto err; |
dfeab068 | 375 | } |
9b141126 | 376 | BN_CTX_end(ctx); |
dfeab068 | 377 | return(1); |
9b141126 UM |
378 | err: |
379 | BN_CTX_end(ctx); | |
380 | return(0); | |
dfeab068 RE |
381 | #else |
382 | return(BN_div(NULL,rem,m,d,ctx)); | |
383 | #endif | |
384 | } | |
385 |