tommath/bn_s_mp_add.c

106 lines
2.4 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.
*
2018-12-29 11:56:20 -05:00
* SPDX-License-Identifier: Unlicense
2003-02-28 11:08:34 -05:00
*/
/* low level addition, based on HAC pp.594, Algorithm 14.7 */
2017-09-20 10:59:43 -04:00
int s_mp_add(const mp_int *a, const mp_int *b, mp_int *c)
2003-02-28 11:08:34 -05:00
{
2017-09-20 10:59:43 -04:00
const mp_int *x;
2017-08-30 14:23:46 -04:00
int olduse, res, min, max;
/* 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;
} else {
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-02-28 11:09:08 -05:00
}
2017-08-30 14:23:46 -04:00
}
2003-02-28 11:09:08 -05:00
2017-08-30 14:23:46 -04:00
/* get old used digit count and set new one */
olduse = c->used;
c->used = max + 1;
2003-02-28 11:09:08 -05:00
2017-08-30 14:23:46 -04:00
{
mp_digit u, *tmpa, *tmpb, *tmpc;
int i;
2003-02-28 11:08:34 -05:00
2017-08-30 14:23:46 -04:00
/* alias for digit pointers */
/* first input */
tmpa = a->dp;
/* second input */
tmpb = b->dp;
/* destination */
tmpc = c->dp;
/* zero the carry */
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;
/* U = carry bit of T[i] */
2017-10-15 13:58:35 -04:00
u = *tmpc >> (mp_digit)DIGIT_BIT;
2017-08-30 14:23:46 -04:00
/* take away carry bit from T[i] */
*tmpc++ &= MP_MASK;
}
/* now copy higher words if any, that is in A+B
* if A or B has more digits add those in
*/
if (min != max) {
for (; i < max; i++) {
/* T[i] = X[i] + U */
*tmpc = x->dp[i] + u;
/* U = carry bit of T[i] */
2017-10-15 13:58:35 -04:00
u = *tmpc >> (mp_digit)DIGIT_BIT;
2017-08-30 14:23:46 -04:00
/* take away carry bit from T[i] */
*tmpc++ &= MP_MASK;
}
}
/* add carry */
*tmpc++ = u;
/* clear digits above oldused */
for (i = c->used; i < olduse; i++) {
*tmpc++ = 0;
}
}
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$ */