tommath/bn_mp_mul_2d.c

84 lines
2.0 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 18:07:18 -04:00
#ifdef BN_MP_MUL_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.
*/
/* shift left by a certain bit count */
int mp_mul_2d(const mp_int *a, int b, mp_int *c)
2003-02-28 11:08:34 -05:00
{
2017-08-30 13:11:35 -04:00
mp_digit d;
int res;
2003-02-28 11:08:34 -05:00
2017-08-30 13:11:35 -04:00
/* copy */
if (a != c) {
if ((res = mp_copy(a, c)) != MP_OKAY) {
return res;
}
}
2003-02-28 11:08:34 -05:00
2017-10-15 13:58:35 -04:00
if (c->alloc < (c->used + (b / DIGIT_BIT) + 1)) {
2017-08-30 13:11:35 -04:00
if ((res = mp_grow(c, c->used + (b / DIGIT_BIT) + 1)) != MP_OKAY) {
return res;
}
}
2003-02-28 11:08:34 -05:00
2017-08-30 13:11:35 -04:00
/* shift by as many digits in the bit count */
2017-10-15 13:58:35 -04:00
if (b >= DIGIT_BIT) {
2017-08-30 13:11:35 -04:00
if ((res = mp_lshd(c, b / DIGIT_BIT)) != MP_OKAY) {
return res;
}
}
2003-02-28 11:08:34 -05:00
2017-08-30 13:11:35 -04:00
/* shift any bit count < DIGIT_BIT */
d = (mp_digit)(b % DIGIT_BIT);
2017-10-15 13:57:12 -04:00
if (d != 0u) {
2017-08-30 13:11:35 -04:00
mp_digit *tmpc, shift, mask, r, rr;
int x;
2003-05-17 08:33:54 -04:00
2017-08-30 13:11:35 -04:00
/* bitmask for carries */
mask = ((mp_digit)1 << d) - (mp_digit)1;
2003-05-17 08:33:54 -04:00
2017-08-30 13:11:35 -04:00
/* shift for msbs */
2017-10-15 13:58:35 -04:00
shift = (mp_digit)DIGIT_BIT - d;
2003-07-02 11:39:39 -04:00
2017-08-30 13:11:35 -04:00
/* alias */
tmpc = c->dp;
2003-05-17 08:33:54 -04:00
2017-08-30 13:11:35 -04:00
/* carry */
r = 0;
for (x = 0; x < c->used; x++) {
/* get the higher bits of the current word */
rr = (*tmpc >> shift) & mask;
2003-02-28 11:08:34 -05:00
2017-08-30 13:11:35 -04:00
/* shift the current word and OR in the carry */
*tmpc = ((*tmpc << d) | r) & MP_MASK;
++tmpc;
2003-02-28 11:08:34 -05:00
2017-08-30 13:11:35 -04:00
/* set the carry to the carry bits of the current word */
r = rr;
}
2017-08-29 23:51:11 -04:00
2017-08-30 13:11:35 -04:00
/* set final carry */
2017-10-15 13:57:12 -04:00
if (r != 0u) {
2017-08-30 13:11:35 -04:00
c->dp[(c->used)++] = r;
}
}
mp_clamp(c);
return MP_OKAY;
2003-02-28 11:08:34 -05:00
}
2004-10-29 18:07:18 -04:00
#endif
2005-08-01 12:37:28 -04:00
2017-08-28 10:27:26 -04:00
/* ref: $Format:%D$ */
/* git commit: $Format:%H$ */
/* commit time: $Format:%ai$ */