diff options
| author | Charles.Forsyth <devnull@localhost> | 2006-12-22 17:07:39 +0000 |
|---|---|---|
| committer | Charles.Forsyth <devnull@localhost> | 2006-12-22 17:07:39 +0000 |
| commit | 37da2899f40661e3e9631e497da8dc59b971cbd0 (patch) | |
| tree | cbc6d4680e347d906f5fa7fca73214418741df72 /libmp/port/mpvecdigmuladd.c | |
| parent | 54bc8ff236ac10b3eaa928fd6bcfc0cdb2ba46ae (diff) | |
20060303a
Diffstat (limited to 'libmp/port/mpvecdigmuladd.c')
| -rw-r--r-- | libmp/port/mpvecdigmuladd.c | 103 |
1 files changed, 103 insertions, 0 deletions
diff --git a/libmp/port/mpvecdigmuladd.c b/libmp/port/mpvecdigmuladd.c new file mode 100644 index 00000000..6b6c6837 --- /dev/null +++ b/libmp/port/mpvecdigmuladd.c @@ -0,0 +1,103 @@ +#include "os.h" +#include <mp.h> +#include "dat.h" + +#define LO(x) ((x) & ((1<<(Dbits/2))-1)) +#define HI(x) ((x) >> (Dbits/2)) + +static void +mpdigmul(mpdigit a, mpdigit b, mpdigit *p) +{ + mpdigit x, ah, al, bh, bl, p1, p2, p3, p4; + int carry; + + // half digits + ah = HI(a); + al = LO(a); + bh = HI(b); + bl = LO(b); + + // partial products + p1 = ah*bl; + p2 = bh*al; + p3 = bl*al; + p4 = ah*bh; + + // p = ((p1+p2)<<(Dbits/2)) + (p4<<Dbits) + p3 + carry = 0; + x = p1<<(Dbits/2); + p3 += x; + if(p3 < x) + carry++; + x = p2<<(Dbits/2); + p3 += x; + if(p3 < x) + carry++; + p4 += carry + HI(p1) + HI(p2); // can't carry out of the high digit + p[0] = p3; + p[1] = p4; +} + +// prereq: p must have room for n+1 digits +void +mpvecdigmuladd(mpdigit *b, int n, mpdigit m, mpdigit *p) +{ + int i; + mpdigit carry, x, y, part[2]; + + carry = 0; + part[1] = 0; + for(i = 0; i < n; i++){ + x = part[1] + carry; + if(x < carry) + carry = 1; + else + carry = 0; + y = *p; + mpdigmul(*b++, m, part); + x += part[0]; + if(x < part[0]) + carry++; + x += y; + if(x < y) + carry++; + *p++ = x; + } + *p = part[1] + carry; +} + +// prereq: p must have room for n+1 digits +int +mpvecdigmulsub(mpdigit *b, int n, mpdigit m, mpdigit *p) +{ + int i; + mpdigit x, y, part[2], borrow; + + borrow = 0; + part[1] = 0; + for(i = 0; i < n; i++){ + x = *p; + y = x - borrow; + if(y > x) + borrow = 1; + else + borrow = 0; + x = part[1]; + mpdigmul(*b++, m, part); + x += part[0]; + if(x < part[0]) + borrow++; + x = y - x; + if(x > y) + borrow++; + *p++ = x; + } + + x = *p; + y = x - borrow - part[1]; + *p = y; + if(y > x) + return -1; + else + return 1; +} |
