Import OpenSSL 0.9.8e.
[dragonfly.git] / crypto / openssl-0.9 / crypto / bn / bn_div.c
CommitLineData
56276539
SS
1/* crypto/bn/bn_div.c */
2/* Copyright (C) 1995-1998 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#include <stdio.h>
60#include <openssl/bn.h>
61#include "cryptlib.h"
62#include "bn_lcl.h"
63
64
65/* The old slow way */
66#if 0
67int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,
68 BN_CTX *ctx)
69 {
70 int i,nm,nd;
71 int ret = 0;
72 BIGNUM *D;
73
74 bn_check_top(m);
75 bn_check_top(d);
76 if (BN_is_zero(d))
77 {
78 BNerr(BN_F_BN_DIV,BN_R_DIV_BY_ZERO);
79 return(0);
80 }
81
82 if (BN_ucmp(m,d) < 0)
83 {
84 if (rem != NULL)
85 { if (BN_copy(rem,m) == NULL) return(0); }
86 if (dv != NULL) BN_zero(dv);
87 return(1);
88 }
89
90 BN_CTX_start(ctx);
91 D = BN_CTX_get(ctx);
92 if (dv == NULL) dv = BN_CTX_get(ctx);
93 if (rem == NULL) rem = BN_CTX_get(ctx);
94 if (D == NULL || dv == NULL || rem == NULL)
95 goto end;
96
97 nd=BN_num_bits(d);
98 nm=BN_num_bits(m);
99 if (BN_copy(D,d) == NULL) goto end;
100 if (BN_copy(rem,m) == NULL) goto end;
101
102 /* The next 2 are needed so we can do a dv->d[0]|=1 later
103 * since BN_lshift1 will only work once there is a value :-) */
104 BN_zero(dv);
105 bn_wexpand(dv,1);
106 dv->top=1;
107
108 if (!BN_lshift(D,D,nm-nd)) goto end;
109 for (i=nm-nd; i>=0; i--)
110 {
111 if (!BN_lshift1(dv,dv)) goto end;
112 if (BN_ucmp(rem,D) >= 0)
113 {
114 dv->d[0]|=1;
115 if (!BN_usub(rem,rem,D)) goto end;
116 }
117/* CAN IMPROVE (and have now :=) */
118 if (!BN_rshift1(D,D)) goto end;
119 }
120 rem->neg=BN_is_zero(rem)?0:m->neg;
121 dv->neg=m->neg^d->neg;
122 ret = 1;
123 end:
124 BN_CTX_end(ctx);
125 return(ret);
126 }
127
128#else
129
130#if !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM) \
131 && !defined(PEDANTIC) && !defined(BN_DIV3W)
132# if defined(__GNUC__) && __GNUC__>=2
133# if defined(__i386) || defined (__i386__)
134 /*
135 * There were two reasons for implementing this template:
136 * - GNU C generates a call to a function (__udivdi3 to be exact)
137 * in reply to ((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0 (I fail to
138 * understand why...);
139 * - divl doesn't only calculate quotient, but also leaves
140 * remainder in %edx which we can definitely use here:-)
141 *
142 * <appro@fy.chalmers.se>
143 */
144# define bn_div_words(n0,n1,d0) \
145 ({ asm volatile ( \
146 "divl %4" \
147 : "=a"(q), "=d"(rem) \
148 : "a"(n1), "d"(n0), "g"(d0) \
149 : "cc"); \
150 q; \
151 })
152# define REMAINDER_IS_ALREADY_CALCULATED
153# elif defined(__x86_64) && defined(SIXTY_FOUR_BIT_LONG)
154 /*
155 * Same story here, but it's 128-bit by 64-bit division. Wow!
156 * <appro@fy.chalmers.se>
157 */
158# define bn_div_words(n0,n1,d0) \
159 ({ asm volatile ( \
160 "divq %4" \
161 : "=a"(q), "=d"(rem) \
162 : "a"(n1), "d"(n0), "g"(d0) \
163 : "cc"); \
164 q; \
165 })
166# define REMAINDER_IS_ALREADY_CALCULATED
167# endif /* __<cpu> */
168# endif /* __GNUC__ */
169#endif /* OPENSSL_NO_ASM */
170
171
172/* BN_div computes dv := num / divisor, rounding towards zero, and sets up
173 * rm such that dv*divisor + rm = num holds.
174 * Thus:
175 * dv->neg == num->neg ^ divisor->neg (unless the result is zero)
176 * rm->neg == num->neg (unless the remainder is zero)
177 * If 'dv' or 'rm' is NULL, the respective value is not returned.
178 */
179int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
180 BN_CTX *ctx)
181 {
182 int norm_shift,i,loop;
183 BIGNUM *tmp,wnum,*snum,*sdiv,*res;
184 BN_ULONG *resp,*wnump;
185 BN_ULONG d0,d1;
186 int num_n,div_n;
187
5bd86ce5
SS
188 bn_check_top(dv);
189 bn_check_top(rm);
56276539
SS
190 bn_check_top(num);
191 bn_check_top(divisor);
192
193 if (BN_is_zero(divisor))
194 {
195 BNerr(BN_F_BN_DIV,BN_R_DIV_BY_ZERO);
196 return(0);
197 }
198
199 if (BN_ucmp(num,divisor) < 0)
200 {
201 if (rm != NULL)
202 { if (BN_copy(rm,num) == NULL) return(0); }
203 if (dv != NULL) BN_zero(dv);
204 return(1);
205 }
206
207 BN_CTX_start(ctx);
208 tmp=BN_CTX_get(ctx);
209 snum=BN_CTX_get(ctx);
210 sdiv=BN_CTX_get(ctx);
211 if (dv == NULL)
212 res=BN_CTX_get(ctx);
213 else res=dv;
214 if (sdiv == NULL || res == NULL) goto err;
215
216 /* First we normalise the numbers */
217 norm_shift=BN_BITS2-((BN_num_bits(divisor))%BN_BITS2);
218 if (!(BN_lshift(sdiv,divisor,norm_shift))) goto err;
219 sdiv->neg=0;
220 norm_shift+=BN_BITS2;
221 if (!(BN_lshift(snum,num,norm_shift))) goto err;
222 snum->neg=0;
223 div_n=sdiv->top;
224 num_n=snum->top;
225 loop=num_n-div_n;
226 /* Lets setup a 'window' into snum
227 * This is the part that corresponds to the current
228 * 'area' being divided */
229 wnum.neg = 0;
230 wnum.d = &(snum->d[loop]);
231 wnum.top = div_n;
232 /* only needed when BN_ucmp messes up the values between top and max */
233 wnum.dmax = snum->dmax - loop; /* so we don't step out of bounds */
234
235 /* Get the top 2 words of sdiv */
236 /* div_n=sdiv->top; */
237 d0=sdiv->d[div_n-1];
238 d1=(div_n == 1)?0:sdiv->d[div_n-2];
239
240 /* pointer to the 'top' of snum */
241 wnump= &(snum->d[num_n-1]);
242
243 /* Setup to 'res' */
244 res->neg= (num->neg^divisor->neg);
245 if (!bn_wexpand(res,(loop+1))) goto err;
246 res->top=loop;
247 resp= &(res->d[loop-1]);
248
249 /* space for temp */
250 if (!bn_wexpand(tmp,(div_n+1))) goto err;
251
252 if (BN_ucmp(&wnum,sdiv) >= 0)
253 {
254 /* If BN_DEBUG_RAND is defined BN_ucmp changes (via
255 * bn_pollute) the const bignum arguments =>
256 * clean the values between top and max again */
257 bn_clear_top2max(&wnum);
258 bn_sub_words(wnum.d, wnum.d, sdiv->d, div_n);
259 *resp=1;
260 }
261 else
262 res->top--;
263 /* if res->top == 0 then clear the neg value otherwise decrease
264 * the resp pointer */
265 if (res->top == 0)
266 res->neg = 0;
267 else
268 resp--;
269
270 for (i=0; i<loop-1; i++, wnump--, resp--)
271 {
272 BN_ULONG q,l0;
273 /* the first part of the loop uses the top two words of
274 * snum and sdiv to calculate a BN_ULONG q such that
275 * | wnum - sdiv * q | < sdiv */
276#if defined(BN_DIV3W) && !defined(OPENSSL_NO_ASM)
277 BN_ULONG bn_div_3_words(BN_ULONG*,BN_ULONG,BN_ULONG);
278 q=bn_div_3_words(wnump,d1,d0);
279#else
280 BN_ULONG n0,n1,rem=0;
281
282 n0=wnump[0];
283 n1=wnump[-1];
284 if (n0 == d0)
285 q=BN_MASK2;
286 else /* n0 < d0 */
287 {
288#ifdef BN_LLONG
289 BN_ULLONG t2;
290
291#if defined(BN_LLONG) && defined(BN_DIV2W) && !defined(bn_div_words)
292 q=(BN_ULONG)(((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0);
293#else
294 q=bn_div_words(n0,n1,d0);
295#ifdef BN_DEBUG_LEVITTE
296 fprintf(stderr,"DEBUG: bn_div_words(0x%08X,0x%08X,0x%08\
297X) -> 0x%08X\n",
298 n0, n1, d0, q);
299#endif
300#endif
301
302#ifndef REMAINDER_IS_ALREADY_CALCULATED
303 /*
304 * rem doesn't have to be BN_ULLONG. The least we
305 * know it's less that d0, isn't it?
306 */
307 rem=(n1-q*d0)&BN_MASK2;
308#endif
309 t2=(BN_ULLONG)d1*q;
310
311 for (;;)
312 {
313 if (t2 <= ((((BN_ULLONG)rem)<<BN_BITS2)|wnump[-2]))
314 break;
315 q--;
316 rem += d0;
317 if (rem < d0) break; /* don't let rem overflow */
318 t2 -= d1;
319 }
320#else /* !BN_LLONG */
321 BN_ULONG t2l,t2h,ql,qh;
322
323 q=bn_div_words(n0,n1,d0);
324#ifdef BN_DEBUG_LEVITTE
325 fprintf(stderr,"DEBUG: bn_div_words(0x%08X,0x%08X,0x%08\
326X) -> 0x%08X\n",
327 n0, n1, d0, q);
328#endif
329#ifndef REMAINDER_IS_ALREADY_CALCULATED
330 rem=(n1-q*d0)&BN_MASK2;
331#endif
332
333#if defined(BN_UMULT_LOHI)
334 BN_UMULT_LOHI(t2l,t2h,d1,q);
335#elif defined(BN_UMULT_HIGH)
336 t2l = d1 * q;
337 t2h = BN_UMULT_HIGH(d1,q);
338#else
339 t2l=LBITS(d1); t2h=HBITS(d1);
340 ql =LBITS(q); qh =HBITS(q);
341 mul64(t2l,t2h,ql,qh); /* t2=(BN_ULLONG)d1*q; */
342#endif
343
344 for (;;)
345 {
346 if ((t2h < rem) ||
347 ((t2h == rem) && (t2l <= wnump[-2])))
348 break;
349 q--;
350 rem += d0;
351 if (rem < d0) break; /* don't let rem overflow */
352 if (t2l < d1) t2h--; t2l -= d1;
353 }
354#endif /* !BN_LLONG */
355 }
356#endif /* !BN_DIV3W */
357
358 l0=bn_mul_words(tmp->d,sdiv->d,div_n,q);
359 tmp->d[div_n]=l0;
360 wnum.d--;
361 /* ingore top values of the bignums just sub the two
362 * BN_ULONG arrays with bn_sub_words */
363 if (bn_sub_words(wnum.d, wnum.d, tmp->d, div_n+1))
364 {
365 /* Note: As we have considered only the leading
366 * two BN_ULONGs in the calculation of q, sdiv * q
367 * might be greater than wnum (but then (q-1) * sdiv
368 * is less or equal than wnum)
369 */
370 q--;
371 if (bn_add_words(wnum.d, wnum.d, sdiv->d, div_n))
372 /* we can't have an overflow here (assuming
373 * that q != 0, but if q == 0 then tmp is
374 * zero anyway) */
375 (*wnump)++;
376 }
377 /* store part of the result */
378 *resp = q;
379 }
380 bn_correct_top(snum);
381 if (rm != NULL)
382 {
383 /* Keep a copy of the neg flag in num because if rm==num
384 * BN_rshift() will overwrite it.
385 */
386 int neg = num->neg;
387 BN_rshift(rm,snum,norm_shift);
388 if (!BN_is_zero(rm))
389 rm->neg = neg;
390 bn_check_top(rm);
391 }
392 BN_CTX_end(ctx);
393 return(1);
394err:
5bd86ce5 395 bn_check_top(rm);
56276539
SS
396 BN_CTX_end(ctx);
397 return(0);
398 }
399
400#endif