Mercurial > dropbear
comparison tomsfastmath/src/divide/fp_mod.c @ 643:a362b62d38b2 dropbear-tfm
Add tomsfastmath from git rev bfa4582842bc3bab42e4be4aed5703437049502a
with Makefile.in renamed
| author | Matt Johnston <matt@ucc.asn.au> |
|---|---|
| date | Wed, 23 Nov 2011 18:10:20 +0700 |
| parents | |
| children |
comparison
equal
deleted
inserted
replaced
| 642:33fd2f3499d2 | 643:a362b62d38b2 |
|---|---|
| 1 /* TomsFastMath, a fast ISO C bignum library. | |
| 2 * | |
| 3 * This project is meant to fill in where LibTomMath | |
| 4 * falls short. That is speed ;-) | |
| 5 * | |
| 6 * This project is public domain and free for all purposes. | |
| 7 * | |
| 8 * Tom St Denis, [email protected] | |
| 9 */ | |
| 10 #include <tfm.h> | |
| 11 | |
| 12 /* c = a mod b, 0 <= c < b */ | |
| 13 int fp_mod(fp_int *a, fp_int *b, fp_int *c) | |
| 14 { | |
| 15 fp_int t; | |
| 16 int err; | |
| 17 | |
| 18 fp_zero(&t); | |
| 19 if ((err = fp_div(a, b, NULL, &t)) != FP_OKAY) { | |
| 20 return err; | |
| 21 } | |
| 22 if (t.sign != b->sign) { | |
| 23 fp_add(&t, b, c); | |
| 24 } else { | |
| 25 fp_copy(&t, c); | |
| 26 } | |
| 27 return FP_OKAY; | |
| 28 } | |
| 29 | |
| 30 | |
| 31 | |
| 32 /* $Source$ */ | |
| 33 /* $Revision$ */ | |
| 34 /* $Date$ */ |