tommath/bn_mp_mul_d.c

80 lines
1.8 KiB
C
Raw Normal View History

2004-10-29 18:07:18 -04:00
#include <tommath.h>
#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.
*
2006-04-06 15:49:59 -04:00
* Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
2003-02-28 11:08:34 -05:00
*/
/* multiply by a digit */
int
mp_mul_d (mp_int * a, mp_digit b, mp_int * c)
{
2003-09-19 18:43:07 -04:00
mp_digit u, *tmpa, *tmpc;
mp_word r;
int ix, res, olduse;
2003-02-28 11:08:34 -05:00
2003-05-17 08:33:54 -04:00
/* make sure c is big enough to hold a*b */
2003-09-19 18:43:07 -04:00
if (c->alloc < a->used + 1) {
if ((res = mp_grow (c, a->used + 1)) != MP_OKAY) {
2003-02-28 11:09:08 -05:00
return res;
}
2003-02-28 11:08:34 -05:00
}
2003-05-17 08:33:54 -04:00
/* get the original destinations used count */
2003-02-28 11:09:08 -05:00
olduse = c->used;
2003-05-17 08:33:54 -04:00
2003-09-19 18:43:07 -04:00
/* set the sign */
2003-06-19 06:04:50 -04:00
c->sign = a->sign;
2003-02-28 11:09:08 -05:00
2003-09-19 18:43:07 -04:00
/* alias for a->dp [source] */
tmpa = a->dp;
2003-02-28 11:09:08 -05:00
2003-09-19 18:43:07 -04:00
/* alias for c->dp [dest] */
tmpc = c->dp;
2003-05-17 08:33:54 -04:00
2003-09-19 18:43:07 -04:00
/* zero carry */
u = 0;
2003-02-28 11:09:08 -05:00
2003-09-19 18:43:07 -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
2003-09-19 18:43:07 -04:00
/* mask off higher bits to get a single digit */
*tmpc++ = (mp_digit) (r & ((mp_word) MP_MASK));
2003-05-17 08:33:54 -04:00
2003-09-19 18:43:07 -04:00
/* send carry into next iteration */
u = (mp_digit) (r >> ((mp_word) DIGIT_BIT));
}
2003-05-17 08:33:54 -04:00
2005-02-12 03:40:15 -05:00
/* store final carry [if any] and increment ix offset */
2003-09-19 18:43:07 -04:00
*tmpc++ = u;
2005-02-12 03:40:15 -05:00
++ix;
2003-09-19 18:43:07 -04:00
/* now zero digits above the top */
while (ix++ < olduse) {
*tmpc++ = 0;
2003-02-28 11:08:34 -05:00
}
2003-09-19 18:43:07 -04:00
/* set used count */
c->used = a->used + 1;
mp_clamp(c);
2003-02-28 11:08:34 -05:00
return MP_OKAY;
}
2004-10-29 18:07:18 -04:00
#endif
2005-08-01 12:37:28 -04:00
/* $Source$ */
/* $Revision$ */
/* $Date$ */