libtommath/bn_mp_mul_2d.c

86 lines
1.9 KiB
C
Raw Normal View History

2004-10-29 22:07:18 +00:00
#include <tommath.h>
#ifdef BN_MP_MUL_2D_C
2003-02-28 16:08:34 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-05 01:24:44 +00:00
* LibTomMath is a library that provides multiple-precision
2003-02-28 16:08:34 +00:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-05 01:24:44 +00:00
* The library was designed directly after the MPI library by
2003-02-28 16:08:34 +00: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.
*
2007-04-18 09:58:18 +00:00
* Tom St Denis, tomstdenis@gmail.com, http://libtom.org
2003-02-28 16:08:34 +00:00
*/
/* shift left by a certain bit count */
2003-12-24 18:59:22 +00:00
int mp_mul_2d (mp_int * a, int b, mp_int * c)
2003-02-28 16:08:34 +00:00
{
2003-05-17 12:33:54 +00:00
mp_digit d;
int res;
2003-02-28 16:08:34 +00:00
/* copy */
2003-05-17 12:33:54 +00:00
if (a != c) {
if ((res = mp_copy (a, c)) != MP_OKAY) {
return res;
}
2003-02-28 16:08:34 +00:00
}
2003-07-02 15:39:39 +00:00
if (c->alloc < (int)(c->used + b/DIGIT_BIT + 1)) {
if ((res = mp_grow (c, c->used + b / DIGIT_BIT + 1)) != MP_OKAY) {
2003-05-17 12:33:54 +00:00
return res;
}
2003-02-28 16:08:34 +00:00
}
/* shift by as many digits in the bit count */
2003-05-17 12:33:54 +00:00
if (b >= (int)DIGIT_BIT) {
2003-03-22 15:10:20 +00:00
if ((res = mp_lshd (c, b / DIGIT_BIT)) != MP_OKAY) {
return res;
}
}
2003-02-28 16:08:34 +00:00
/* shift any bit count < DIGIT_BIT */
d = (mp_digit) (b % DIGIT_BIT);
if (d != 0) {
2003-07-02 15:39:39 +00:00
register mp_digit *tmpc, shift, mask, r, rr;
2003-05-17 12:33:54 +00:00
register int x;
2003-03-29 18:16:01 +00:00
/* bitmask for carries */
2003-05-17 12:33:54 +00:00
mask = (((mp_digit)1) << d) - 1;
2003-07-02 15:39:39 +00:00
/* shift for msbs */
shift = DIGIT_BIT - d;
2003-03-29 18:16:01 +00:00
/* alias */
tmpc = c->dp;
2003-05-17 12:33:54 +00:00
2003-03-29 18:16:01 +00:00
/* carry */
r = 0;
2003-02-28 16:08:34 +00:00
for (x = 0; x < c->used; x++) {
/* get the higher bits of the current word */
2003-07-02 15:39:39 +00:00
rr = (*tmpc >> shift) & mask;
2003-02-28 16:08:34 +00:00
/* shift the current word and OR in the carry */
2003-03-29 18:16:01 +00:00
*tmpc = ((*tmpc << d) | r) & MP_MASK;
++tmpc;
2003-02-28 16:08:34 +00:00
/* set the carry to the carry bits of the current word */
r = rr;
}
2003-07-02 15:39:39 +00:00
/* set final carry */
if (r != 0) {
2003-08-05 01:24:44 +00:00
c->dp[(c->used)++] = r;
2003-07-02 15:39:39 +00:00
}
2003-02-28 16:08:34 +00:00
}
mp_clamp (c);
return MP_OKAY;
}
2004-10-29 22:07:18 +00:00
#endif
2005-08-01 16:37:28 +00:00
/* $Source$ */
/* $Revision$ */
/* $Date$ */