tomsfastmath/src/addsub/s_fp_add.c

43 lines
839 B
C
Raw Normal View History

2004-08-25 04:43:43 +02:00
/* TomsFastMath, a fast ISO C bignum library.
*
* This project is meant to fill in where LibTomMath
* falls short. That is speed ;-)
*
* This project is public domain and free for all purposes.
*
2005-07-23 12:43:03 +02:00
* Tom St Denis, tomstdenis@gmail.com
2004-08-25 04:43:43 +02:00
*/
#include <tfm.h>
/* unsigned addition */
void s_fp_add(fp_int *a, fp_int *b, fp_int *c)
{
int x, y, oldused;
2006-11-01 08:42:37 +01:00
register fp_word t;
2004-08-25 04:43:43 +02:00
y = MAX(a->used, b->used);
oldused = c->used;
c->used = y;
t = 0;
for (x = 0; x < y; x++) {
t += ((fp_word)a->dp[x]) + ((fp_word)b->dp[x]);
c->dp[x] = (fp_digit)t;
t >>= DIGIT_BIT;
}
2005-10-31 16:32:05 +01:00
if (t != 0 && x < FP_SIZE) {
2004-08-25 04:43:43 +02:00
c->dp[c->used++] = (fp_digit)t;
++x;
}
2006-11-01 08:42:37 +01:00
2005-10-31 16:32:05 +01:00
c->used = x;
2004-08-25 04:43:43 +02:00
for (; x < oldused; x++) {
c->dp[x] = 0;
}
fp_clamp(c);
}
2005-07-23 12:43:03 +02:00
/* $Source$ */
/* $Revision$ */
/* $Date$ */