tommath/bn_mp_div_d.c

107 lines
2.1 KiB
C
Raw Normal View History

2004-10-29 18:07:18 -04:00
#include <tommath.h>
#ifdef BN_MP_DIV_D_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.
*
2003-03-12 21:11:11 -05:00
* Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org
2003-02-28 11:08:34 -05:00
*/
2003-07-12 10:31:43 -04:00
static int s_is_power_of_two(mp_digit b, int *p)
{
int x;
for (x = 1; x < DIGIT_BIT; x++) {
if (b == (((mp_digit)1)<<x)) {
*p = x;
return 1;
}
}
return 0;
}
2003-05-29 09:35:26 -04:00
/* single digit division (based on routine from MPI) */
2004-01-25 12:40:21 -05:00
int mp_div_d (mp_int * a, mp_digit b, mp_int * c, mp_digit * d)
2003-02-28 11:08:34 -05:00
{
2003-05-29 09:35:26 -04:00
mp_int q;
2003-06-19 06:04:50 -04:00
mp_word w;
mp_digit t;
2003-05-29 09:35:26 -04:00
int res, ix;
2003-07-12 10:31:43 -04:00
/* cannot divide by zero */
2003-05-29 09:35:26 -04:00
if (b == 0) {
return MP_VAL;
2003-02-28 11:08:34 -05:00
}
2003-07-12 10:31:43 -04:00
/* quick outs */
if (b == 1 || mp_iszero(a) == 1) {
if (d != NULL) {
*d = 0;
}
if (c != NULL) {
return mp_copy(a, c);
}
return MP_OKAY;
}
/* power of two ? */
if (s_is_power_of_two(b, &ix) == 1) {
if (d != NULL) {
2004-10-29 18:07:18 -04:00
*d = a->dp[0] & ((((mp_digit)1)<<ix) - 1);
2003-07-12 10:31:43 -04:00
}
if (c != NULL) {
return mp_div_2d(a, ix, c, NULL);
}
return MP_OKAY;
}
2004-10-29 18:07:18 -04:00
#ifdef BN_MP_DIV_3_C
2003-07-12 10:31:43 -04:00
/* three? */
2003-05-29 09:35:26 -04:00
if (b == 3) {
return mp_div_3(a, c, d);
2003-02-28 11:08:34 -05:00
}
2004-10-29 18:07:18 -04:00
#endif
2003-07-12 10:31:43 -04:00
/* no easy answer [c'est la vie]. Just division */
2003-05-29 09:35:26 -04:00
if ((res = mp_init_size(&q, a->used)) != MP_OKAY) {
return res;
}
q.used = a->used;
q.sign = a->sign;
w = 0;
for (ix = a->used - 1; ix >= 0; ix--) {
w = (w << ((mp_word)DIGIT_BIT)) | ((mp_word)a->dp[ix]);
if (w >= b) {
2003-06-19 06:04:50 -04:00
t = (mp_digit)(w / b);
2003-12-24 13:59:22 -05:00
w -= ((mp_word)t) * ((mp_word)b);
2003-05-29 09:35:26 -04:00
} else {
t = 0;
}
2003-06-19 06:04:50 -04:00
q.dp[ix] = (mp_digit)t;
2003-05-29 09:35:26 -04:00
}
2003-02-28 11:08:34 -05:00
if (d != NULL) {
2003-06-19 06:04:50 -04:00
*d = (mp_digit)w;
2003-02-28 11:08:34 -05:00
}
2003-05-29 09:35:26 -04:00
if (c != NULL) {
mp_clamp(&q);
mp_exch(&q, c);
}
mp_clear(&q);
2003-02-28 11:08:34 -05:00
return res;
}
2003-05-29 09:35:26 -04:00
2004-10-29 18:07:18 -04:00
#endif