Searched refs:MP_NO (Results 1 – 17 of 17) sorted by relevance
26 return MP_NO; in mp_reduce_is_2k_l()36 return (iy >= (a->used/2)) ? MP_YES : MP_NO; in mp_reduce_is_2k_l()39 return MP_NO; in mp_reduce_is_2k_l()
13 int res = MP_NO; in mp_find_prime()29 if (res == MP_NO) { in mp_find_prime()
27 return MP_NO; in mp_reduce_is_2k()38 return MP_NO; in mp_reduce_is_2k()
33 *result = MP_NO; in mp_prime_is_prime()71 if (res == MP_NO) { in mp_prime_is_prime()
51 *ret = MP_NO; in mp_is_square()103 *ret = (mp_cmp_mag(&t,arg) == MP_EQ) ? MP_YES : MP_NO; in mp_is_square()
96 if (res == MP_NO) { in mp_prime_random_ex()108 } while (res == MP_NO); in mp_prime_random_ex()
27 int err, res = MP_NO, x, y; in mp_prime_next_prime()152 if (res == MP_NO) { in mp_prime_next_prime()
150 #define MP_NO 0 /* no response */ macro223 #define mp_iszero(a) (((a)->used == 0) ? MP_YES : MP_NO)224 #define mp_iseven(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 0)) ? MP_YES : MP_NO)225 #define mp_isodd(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 1)) ? MP_YES : MP_NO)226 #define mp_isneg(a) (((a)->sign) ? MP_YES : MP_NO)
31 *result = MP_NO; in mp_prime_is_divisible()
34 *result = MP_NO; in mp_prime_fermat()
62 while (mp_iszero (&t) == MP_NO) { in mp_radix_size()
33 *result = MP_NO; in mp_prime_miller_rabin()
41 while (mp_iszero(&v3) == MP_NO) { in mp_exteuclid()
81 #define MP_NO 0 macro1399 if (MP_ISZERO(&u) == MP_NO) { in fast_modular_inverse()1627 return MP_NO; in mp_reduce_is_2k_l()1640 return MP_NO; in mp_reduce_is_2k_l()3492 return MP_NO; in mp_reduce_is_2k()3505 return MP_NO; in mp_reduce_is_2k()4542 *result = MP_NO; in mp_prime_is_divisible()4782 *result = MP_NO; in mp_prime_miller_rabin()4868 *result = MP_NO; in mp_prime_is_prime()4906 if (res == MP_NO) { in mp_prime_is_prime()[all …]
77 #define MP_NO 0 macro1395 if (MP_ISZERO(&u) == MP_NO) { in fast_modular_inverse()1623 return MP_NO; in mp_reduce_is_2k_l()1636 return MP_NO; in mp_reduce_is_2k_l()3488 return MP_NO; in mp_reduce_is_2k()3501 return MP_NO; in mp_reduce_is_2k()4519 *result = MP_NO; in mp_prime_is_divisible()4759 *result = MP_NO; in mp_prime_miller_rabin()4845 *result = MP_NO; in mp_prime_is_prime()4883 if (res == MP_NO) { in mp_prime_is_prime()[all …]
84 #define MP_NO 0 macro1691 return MP_NO; in mp_reduce_is_2k_l()1701 return (iy >= (a->used/2)) ? MP_YES : MP_NO; in mp_reduce_is_2k_l()1704 return MP_NO; in mp_reduce_is_2k_l()3530 return MP_NO; in mp_reduce_is_2k()3541 return MP_NO; in mp_reduce_is_2k()4591 *result = MP_NO; in mp_prime_is_divisible()4829 *result = MP_NO; in mp_prime_miller_rabin()4912 *result = MP_NO; in mp_prime_is_prime()4950 if (res == MP_NO) { in mp_prime_is_prime()[all …]
106 #define MP_NO 0 /* no response */ macro133 #define mp_iszero(a) (((a)->used == 0) ? MP_YES : MP_NO)134 #define mp_iseven(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 0)) ? MP_YES : MP_NO)135 #define mp_isodd(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 1)) ? MP_YES : MP_NO)