src/netpgpverify/bignum.c

1178 modulo(mp_int * a, mp_int * b, mp_int * c)
1326 	if ((res = modulo(a, b, &y)) != MP_OKAY) {
1446 	if ((res = modulo(a, b, &x)) != MP_OKAY) {
2682 /* reduces a modulo n where n is of the form 2**p - d
3303 	if ((err = modulo(G, P, &M[1])) != MP_OKAY) {
3321 		/* reduce modulo P */
3537 	res = modulo(&t, c, d);
3556 	res = modulo(&t, c, d);
3874 /* reduce "x" in place modulo "n" using the Diminished Radix algorithm.
3982 /* reduces a modulo n where n is of the form 2**p - d */
4161 		if ((err = modulo(G, P, &M[1])) != MP_OKAY) {
4770 	res = modulo(&t, b, c);
5137 	res = modulo(&t, c, d);
5686 	return modulo(rnd, range, rnd) == MP_OKAY;