tommath/bn_mp_div_2d.c

98 lines
2.1 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 18:07:18 -04:00
#ifdef BN_MP_DIV_2D_C
2003-02-28 11:08:34 -05:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-04 21:24:44 -04:00
* LibTomMath is a library that provides multiple-precision
2003-02-28 11:08:34 -05:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-04 21:24:44 -04:00
* The library was designed directly after the MPI library by
2003-02-28 11:08:34 -05:00
* Michael Fromberger but has been written from scratch with
* additional optimizations in place.
*
* The library is free for all purposes without any express
* guarantee it works.
*
* Tom St Denis, tstdenis82@gmail.com, http://libtom.org
2003-02-28 11:08:34 -05:00
*/
2003-05-29 09:35:26 -04:00
/* shift right by a certain bit count (store quotient in c, optional remainder in d) */
2003-12-24 13:59:22 -05:00
int mp_div_2d (mp_int * a, int b, mp_int * c, mp_int * d)
2003-02-28 11:08:34 -05:00
{
2003-02-28 11:09:08 -05:00
mp_digit D, r, rr;
int x, res;
mp_int t;
2003-02-28 11:08:34 -05:00
/* if the shift count is <= 0 then we do no work */
if (b <= 0) {
res = mp_copy (a, c);
if (d != NULL) {
mp_zero (d);
}
return res;
}
if ((res = mp_init (&t)) != MP_OKAY) {
return res;
}
/* get the remainder */
if (d != NULL) {
if ((res = mp_mod_2d (a, b, &t)) != MP_OKAY) {
mp_clear (&t);
return res;
}
}
/* copy */
if ((res = mp_copy (a, c)) != MP_OKAY) {
mp_clear (&t);
return res;
}
/* shift by as many digits in the bit count */
2003-05-17 08:33:54 -04:00
if (b >= (int)DIGIT_BIT) {
2003-03-22 10:10:20 -05:00
mp_rshd (c, b / DIGIT_BIT);
}
2003-02-28 11:08:34 -05:00
/* shift any bit count < DIGIT_BIT */
D = (mp_digit) (b % DIGIT_BIT);
if (D != 0) {
mp_digit *tmpc, mask, shift;
2003-05-17 08:33:54 -04:00
2003-03-29 13:16:01 -05:00
/* mask */
2003-05-17 08:33:54 -04:00
mask = (((mp_digit)1) << D) - 1;
2003-07-02 11:39:39 -04:00
/* shift for lsb */
shift = DIGIT_BIT - D;
2003-03-29 13:16:01 -05:00
/* alias */
tmpc = c->dp + (c->used - 1);
2003-05-17 08:33:54 -04:00
2003-03-29 13:16:01 -05:00
/* carry */
2003-02-28 11:08:34 -05:00
r = 0;
for (x = c->used - 1; x >= 0; x--) {
/* get the lower bits of this word in a temp */
2003-03-29 13:16:01 -05:00
rr = *tmpc & mask;
2003-02-28 11:08:34 -05:00
/* shift the current word and mix in the carry bits from the previous word */
2003-07-02 11:39:39 -04:00
*tmpc = (*tmpc >> D) | (r << shift);
2003-03-29 13:16:01 -05:00
--tmpc;
2003-02-28 11:08:34 -05:00
/* set the carry to the carry bits of the current word found above */
r = rr;
}
}
mp_clamp (c);
if (d != NULL) {
mp_exch (&t, d);
}
mp_clear (&t);
return MP_OKAY;
}
2004-10-29 18:07:18 -04:00
#endif
2005-08-01 12:37:28 -04:00
/* $Source$ */
/* $Revision$ */
/* $Date$ */