]>
git.ipfire.org Git - thirdparty/openssl.git/blob - crypto/bn/bn_div.c
1 /* crypto/bn/bn_div.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
60 #include <openssl/bn.h>
64 /* The old slow way */
66 int BN_div(BIGNUM
*dv
, BIGNUM
*rem
, BIGNUM
*m
, BIGNUM
*d
, BN_CTX
*ctx
)
75 BNerr(BN_F_BN_DIV
,BN_R_DIV_BY_ZERO
);
82 { if (BN_copy(rem
,m
) == NULL
) return(0); }
83 if (dv
!= NULL
) BN_zero(dv
);
87 D
= &(ctx
->bn
[ctx
->tos
]);
88 if (dv
== NULL
) dv
= &(ctx
->bn
[ctx
->tos
+1]);
89 if (rem
== NULL
) rem
= &(ctx
->bn
[ctx
->tos
+2]);
93 if (BN_copy(D
,d
) == NULL
) return(0);
94 if (BN_copy(rem
,m
) == NULL
) return(0);
96 /* The next 2 are needed so we can do a dv->d[0]|=1 later
97 * since BN_lshift1 will only work once there is a value :-) */
102 if (!BN_lshift(D
,D
,nm
-nd
)) return(0);
103 for (i
=nm
-nd
; i
>=0; i
--)
105 if (!BN_lshift1(dv
,dv
)) return(0);
106 if (BN_ucmp(rem
,D
) >= 0)
109 if (!BN_usub(rem
,rem
,D
)) return(0);
111 /* CAN IMPROVE (and have now :=) */
112 if (!BN_rshift1(D
,D
)) return(0);
114 rem
->neg
=BN_is_zero(rem
)?0:m
->neg
;
115 dv
->neg
=m
->neg
^d
->neg
;
121 int BN_div(BIGNUM
*dv
, BIGNUM
*rm
, const BIGNUM
*num
, const BIGNUM
*divisor
,
124 int norm_shift
,i
,j
,loop
;
125 BIGNUM
*tmp
,wnum
,*snum
,*sdiv
,*res
;
126 BN_ULONG
*resp
,*wnump
;
131 bn_check_top(divisor
);
133 if (BN_is_zero(divisor
))
135 BNerr(BN_F_BN_DIV
,BN_R_DIV_BY_ZERO
);
139 if (BN_ucmp(num
,divisor
) < 0)
142 { if (BN_copy(rm
,num
) == NULL
) return(0); }
143 if (dv
!= NULL
) BN_zero(dv
);
147 tmp
= &(ctx
->bn
[ctx
->tos
]);
149 snum
= &(ctx
->bn
[ctx
->tos
+1]);
150 sdiv
= &(ctx
->bn
[ctx
->tos
+2]);
152 res
= &(ctx
->bn
[ctx
->tos
+3]);
155 /* First we normalise the numbers */
156 norm_shift
=BN_BITS2
-((BN_num_bits(divisor
))%BN_BITS2
);
157 BN_lshift(sdiv
,divisor
,norm_shift
);
159 norm_shift
+=BN_BITS2
;
160 BN_lshift(snum
,num
,norm_shift
);
166 /* Lets setup a 'window' into snum
167 * This is the part that corresponds to the current
168 * 'area' being divided */
170 wnum
.d
= &(snum
->d
[loop
]);
172 wnum
.max
= snum
->max
+1; /* a bit of a lie */
174 /* Get the top 2 words of sdiv */
177 d1
=(div_n
== 1)?0:sdiv
->d
[div_n
-2];
179 /* pointer to the 'top' of snum */
180 wnump
= &(snum
->d
[num_n
-1]);
183 res
->neg
= (num
->neg
^divisor
->neg
);
184 if (!bn_wexpand(res
,(loop
+1))) goto err
;
186 resp
= &(res
->d
[loop
-1]);
189 if (!bn_wexpand(tmp
,(div_n
+1))) goto err
;
191 if (BN_ucmp(&wnum
,sdiv
) >= 0)
193 if (!BN_usub(&wnum
,&wnum
,sdiv
)) goto err
;
195 res
->d
[res
->top
-1]=1;
201 for (i
=0; i
<loop
-1; i
++)
205 q
=bn_div_3_words(wnump
,d0
,d1
);
214 #if defined(BN_LLONG) && defined(BN_DIV2W)
215 q
=((((BN_ULLONG
)n0
)<<BN_BITS2
)|n1
)/((BN_ULLONG
)d0
);
217 q
=bn_div_words(n0
,n1
,d0
);
224 * rem doesn't have to be BN_ULLONG. The least we
225 * know it's less that d0, isn't it?
227 rem
=(n1
-q
*d0
)&BN_MASK2
;
232 if (t2
<= ((((BN_ULLONG
)rem
)<<BN_BITS2
)|wnump
[-2]))
236 if (rem
< d0
) break; /* don't let rem overflow */
240 BN_ULONG t2l
,t2h
,ql
,qh
;
243 * It's more than enough with the only multiplication.
244 * See the comment above in BN_LLONG section...
246 rem
=(n1
-q
*d0
)&BN_MASK2
;
248 t2l
=LBITS(d1
); t2h
=HBITS(d1
);
249 ql
=LBITS(q
); qh
=HBITS(q
);
250 mul64(t2l
,t2h
,ql
,qh
); /* t2=(BN_ULLONG)d1*q; */
255 ((t2h
== rem
) && (t2l
<= wnump
[-2])))
259 if (rem
< d0
) break; /* don't let rem overflow */
260 if (t2l
< d1
) t2h
--; t2l
-= d1
;
264 #endif /* BN_DIV3W */
265 wnum
.d
--; wnum
.top
++;
266 l0
=bn_mul_words(tmp
->d
,sdiv
->d
,div_n
,q
);
268 for (j
=div_n
+1; j
>0; j
--)
269 if (tmp
->d
[j
-1]) break;
273 BN_sub(&wnum
,&wnum
,tmp
);
275 snum
->top
=snum
->top
+wnum
.top
-j
;
281 BN_add(&wnum
,&wnum
,sdiv
);
282 snum
->top
+=wnum
.top
-j
;
289 BN_rshift(rm
,snum
,norm_shift
);
300 int BN_mod(BIGNUM
*rem
, const BIGNUM
*m
, const BIGNUM
*d
, BN_CTX
*ctx
)
302 #if 0 /* The old slow way */
306 if (BN_ucmp(m
,d
) < 0)
307 return((BN_copy(rem
,m
) == NULL
)?0:1);
309 dv
= &(ctx
->bn
[ctx
->tos
]);
311 if (!BN_copy(rem
,m
)) return(0);
315 if (!BN_lshift(dv
,d
,nm
-nd
)) return(0);
316 for (i
=nm
-nd
; i
>=0; i
--)
318 if (BN_cmp(rem
,dv
) >= 0)
320 if (!BN_sub(rem
,rem
,dv
)) return(0);
322 if (!BN_rshift1(dv
,dv
)) return(0);
326 return(BN_div(NULL
,rem
,m
,d
,ctx
));