tommath/bn_mp_mul_d.c

79 lines
1.9 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 18:07:18 -04:00
#ifdef BN_MP_MUL_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.
*
* Tom St Denis, tstdenis82@gmail.com, http://libtom.org
2003-02-28 11:08:34 -05:00
*/
/* multiply by a digit */
2017-09-20 10:59:43 -04:00
int mp_mul_d(const mp_int *a, mp_digit b, mp_int *c)
2003-02-28 11:08:34 -05:00
{
2017-08-30 13:11:35 -04:00
mp_digit u, *tmpa, *tmpc;
mp_word r;
int ix, res, olduse;
2003-02-28 11:08:34 -05:00
2017-08-30 13:11:35 -04:00
/* make sure c is big enough to hold a*b */
if (c->alloc < (a->used + 1)) {
if ((res = mp_grow(c, a->used + 1)) != MP_OKAY) {
return res;
}
}
2003-02-28 11:08:34 -05:00
2017-08-30 13:11:35 -04:00
/* get the original destinations used count */
olduse = c->used;
2003-05-17 08:33:54 -04:00
2017-08-30 13:11:35 -04:00
/* set the sign */
c->sign = a->sign;
2003-02-28 11:09:08 -05:00
2017-08-30 13:11:35 -04:00
/* alias for a->dp [source] */
tmpa = a->dp;
2003-02-28 11:09:08 -05:00
2017-08-30 13:11:35 -04:00
/* alias for c->dp [dest] */
tmpc = c->dp;
2003-05-17 08:33:54 -04:00
2017-08-30 13:11:35 -04:00
/* zero carry */
u = 0;
2003-02-28 11:09:08 -05:00
2017-08-30 13:11:35 -04:00
/* compute columns */
for (ix = 0; ix < a->used; ix++) {
/* compute product and carry sum for this term */
r = (mp_word)u + ((mp_word)*tmpa++ * (mp_word)b);
2003-05-17 08:33:54 -04:00
2017-08-30 13:11:35 -04:00
/* mask off higher bits to get a single digit */
2017-10-15 13:58:35 -04:00
*tmpc++ = (mp_digit)(r & (mp_word)MP_MASK);
2003-05-17 08:33:54 -04:00
2017-08-30 13:11:35 -04:00
/* send carry into next iteration */
2017-10-15 13:58:35 -04:00
u = (mp_digit)(r >> (mp_word)DIGIT_BIT);
2017-08-30 13:11:35 -04:00
}
2003-05-17 08:33:54 -04:00
2017-08-30 13:11:35 -04:00
/* store final carry [if any] and increment ix offset */
*tmpc++ = u;
++ix;
2003-09-19 18:43:07 -04:00
2017-08-30 13:11:35 -04:00
/* now zero digits above the top */
while (ix++ < olduse) {
*tmpc++ = 0;
}
2003-02-28 11:08:34 -05:00
2017-08-30 13:11:35 -04:00
/* set used count */
c->used = a->used + 1;
mp_clamp(c);
2003-09-19 18:43:07 -04:00
2017-08-30 13:11:35 -04:00
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$ */