35 lines
705 B
C
35 lines
705 B
C
|
/* 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.
|
||
|
|
*
|
||
|
|
* Tom St Denis, tomstdenis@gmail.com
|
||
|
|
*/
|
||
|
|
#include "bignum_fast.h"
|
||
|
|
|
||
|
|
/* c = a mod b, 0 <= c < b */
|
||
|
|
int fp_mod(fp_int *a, fp_int *b, fp_int *c)
|
||
|
|
{
|
||
|
|
fp_int t;
|
||
|
|
int err;
|
||
|
|
|
||
|
|
fp_zero(&t);
|
||
|
|
if ((err = fp_div(a, b, NULL, &t)) != FP_OKAY) {
|
||
|
|
return err;
|
||
|
|
}
|
||
|
|
if (t.sign != b->sign) {
|
||
|
|
fp_add(&t, b, c);
|
||
|
|
} else {
|
||
|
|
fp_copy(&t, c);
|
||
|
|
}
|
||
|
|
return FP_OKAY;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
/* $Source: /cvs/libtom/tomsfastmath/src/divide/fp_mod.c,v $ */
|
||
|
|
/* $Revision: 1.1 $ */
|
||
|
|
/* $Date: 2006/12/31 21:25:53 $ */
|