forked from ibphoenix/tomsfastmath
17 lines
382 B
C
17 lines
382 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@iahu.ca
|
||
|
*/
|
||
|
#include <tfm.h>
|
||
|
|
||
|
/* c = a mod b, 0 <= c < b */
|
||
|
int fp_mod_d(fp_int *a, fp_digit b, fp_digit *c)
|
||
|
{
|
||
|
return fp_div_d(a, b, NULL, c);
|
||
|
}
|