HomeSort by relevance Sort by last modified time
    Searched refs:MP_YES (Results 1 - 22 of 22) sorted by null

  /external/dropbear/libtommath/
bn_mp_reduce_is_2k.c 27 return MP_YES;
45 return MP_YES;
bn_mp_reduce_is_2k_l.c 26 return MP_YES;
34 return (iy >= (a->used/2)) ? MP_YES : MP_NO;
bn_mp_neg.c 28 if (mp_iszero(b) != MP_YES) {
bn_mp_prime_is_divisible.c 39 *result = MP_YES;
bn_mp_prime_is_prime.c 52 if (res == MP_YES) {
75 *result = MP_YES;
bn_mp_prime_fermat.c 51 *result = MP_YES;
bn_mp_radix_size.c 38 if (mp_iszero(a) == MP_YES) {
bn_mp_toradix_n.c 35 if (mp_iszero(a) == MP_YES) {
bn_mp_gcd.c 25 if (mp_iszero (a) == MP_YES) {
28 if (mp_iszero (b) == MP_YES) {
bn_mp_exptmod.c 70 if (mp_reduce_is_2k_l(P) == MP_YES) {
bn_mp_is_square.c 101 *ret = (mp_cmp_mag(&t,arg) == MP_EQ) ? MP_YES : MP_NO;
bn_mp_prime_miller_rabin.c 93 *result = MP_YES;
bn_mp_sqrt.c 30 if (mp_iszero(arg) == MP_YES) {
bn_mp_prime_next_prime.c 155 if (res == MP_YES) {
tommath.h 147 #define MP_YES 1 /* yes response */
221 #define mp_iszero(a) (((a)->used == 0) ? MP_YES : MP_NO)
222 #define mp_iseven(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 0)) ? MP_YES : MP_NO)
223 #define mp_isodd(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 1)) ? MP_YES : MP_NO)
bn_mp_div.c 77 c->sign = (mp_iszero(c) == MP_YES) ? MP_ZPOS : n2;
81 d->sign = (mp_iszero(d) == MP_YES) ? MP_ZPOS : n;
  /external/wpa_supplicant/
libtommath.c 71 #define MP_YES 1 /* yes response */
99 #define mp_iszero(a) (((a)->used == 0) ? MP_YES : MP_NO)
100 #define mp_iseven(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 0)) ? MP_YES : MP_NO)
101 #define mp_isodd(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 1)) ? MP_YES : MP_NO)
585 if (mp_reduce_is_2k_l(P) == MP_YES) {
    [all...]
  /external/dropbear/libtommath/pre_gen/
mpi.c     [all...]
  /external/dropbear/libtommath/mtest/
mpi.h 41 #define MP_YES 0 /* yes (boolean result) */
  /external/wpa_supplicant_6/wpa_supplicant/src/tls/
libtommath.c 94 #define MP_YES 1 /* yes response */
122 #define mp_iszero(a) (((a)->used == 0) ? MP_YES : MP_NO)
123 #define mp_iseven(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 0)) ? MP_YES : MP_NO)
124 #define mp_isodd(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 1)) ? MP_YES : MP_NO)
629 if (mp_reduce_is_2k_l(P) == MP_YES) {
    [all...]
  /external/dropbear/libtomcrypt/src/math/
ltm_desc.c 391 *b = (*b == MP_YES) ? LTC_MP_YES : LTC_MP_NO;
  /external/dropbear/libtommath/demo/
demo.c 214 if (cnt != MP_YES) {

Completed in 1404 milliseconds