tommath/bn_s_mp_add.c

110 lines
2.3 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 18:07:18 -04:00
#ifdef BN_S_MP_ADD_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
*/
/* low level addition, based on HAC pp.594, Algorithm 14.7 */
int
s_mp_add (mp_int * a, mp_int * b, mp_int * c)
{
2003-02-28 11:09:08 -05:00
mp_int *x;
int olduse, res, min, max;
2003-02-28 11:08:34 -05:00
/* find sizes, we let |a| <= |b| which means we have to sort
* them. "x" will point to the input with the most digits
*/
if (a->used > b->used) {
min = b->used;
max = a->used;
x = a;
2003-05-17 08:33:54 -04:00
} else {
2003-02-28 11:08:34 -05:00
min = a->used;
max = b->used;
x = b;
}
/* init result */
if (c->alloc < max + 1) {
if ((res = mp_grow (c, max + 1)) != MP_OKAY) {
return res;
}
}
2003-05-17 08:33:54 -04:00
/* get old used digit count and set new one */
2003-02-28 11:08:34 -05:00
olduse = c->used;
c->used = max + 1;
2003-02-28 11:09:08 -05:00
{
register mp_digit u, *tmpa, *tmpb, *tmpc;
register int i;
2003-02-28 11:08:34 -05:00
2003-02-28 11:09:08 -05:00
/* alias for digit pointers */
2003-03-22 10:10:20 -05:00
2003-03-12 21:11:11 -05:00
/* first input */
2003-02-28 11:09:08 -05:00
tmpa = a->dp;
2003-03-22 10:10:20 -05:00
2003-03-12 21:11:11 -05:00
/* second input */
2003-02-28 11:09:08 -05:00
tmpb = b->dp;
2003-03-22 10:10:20 -05:00
2003-03-12 21:11:11 -05:00
/* destination */
2003-02-28 11:09:08 -05:00
tmpc = c->dp;
2003-02-28 11:08:34 -05:00
2003-05-17 08:33:54 -04:00
/* zero the carry */
2003-02-28 11:09:08 -05:00
u = 0;
for (i = 0; i < min; i++) {
/* Compute the sum at one digit, T[i] = A[i] + B[i] + U */
*tmpc = *tmpa++ + *tmpb++ + u;
2003-02-28 11:08:34 -05:00
/* U = carry bit of T[i] */
2003-05-17 08:33:54 -04:00
u = *tmpc >> ((mp_digit)DIGIT_BIT);
2003-02-28 11:08:34 -05:00
/* take away carry bit from T[i] */
2003-02-28 11:09:08 -05:00
*tmpc++ &= MP_MASK;
2003-02-28 11:08:34 -05:00
}
2003-05-17 08:33:54 -04:00
/* now copy higher words if any, that is in A+B
* if A or B has more digits add those in
*/
2003-02-28 11:09:08 -05:00
if (min != max) {
for (; i < max; i++) {
2003-05-17 08:33:54 -04:00
/* T[i] = X[i] + U */
*tmpc = x->dp[i] + u;
2003-02-28 11:09:08 -05:00
2003-05-17 08:33:54 -04:00
/* U = carry bit of T[i] */
u = *tmpc >> ((mp_digit)DIGIT_BIT);
2003-02-28 11:08:34 -05:00
2003-05-17 08:33:54 -04:00
/* take away carry bit from T[i] */
*tmpc++ &= MP_MASK;
2003-02-28 11:09:08 -05:00
}
}
/* add carry */
*tmpc++ = u;
2003-05-17 08:33:54 -04:00
/* clear digits above oldused */
2003-02-28 11:09:08 -05:00
for (i = c->used; i < olduse; i++) {
*tmpc++ = 0;
}
2003-02-28 11:08:34 -05:00
}
mp_clamp (c);
return MP_OKAY;
}
2004-10-29 18:07:18 -04:00
#endif
2005-08-01 12:37:28 -04:00
/* $Source$ */
/* $Revision$ */
/* $Date$ */