Home
last modified time | relevance | path

Searched refs:MP_YES (Results 1 – 22 of 22) sorted by relevance

/external/dropbear/libtommath/
Dbn_mp_reduce_is_2k_l.c26 return MP_YES; in mp_reduce_is_2k_l()
34 return (iy >= (a->used/2)) ? MP_YES : MP_NO; in mp_reduce_is_2k_l()
Dbn_mp_reduce_is_2k.c27 return MP_YES; in mp_reduce_is_2k()
45 return MP_YES; in mp_reduce_is_2k()
Dbn_mp_prime_is_prime.c52 if (res == MP_YES) { in mp_prime_is_prime()
75 *result = MP_YES; in mp_prime_is_prime()
Dbn_mp_gcd.c25 if (mp_iszero (a) == MP_YES) { in mp_gcd()
28 if (mp_iszero (b) == MP_YES) { in mp_gcd()
Dtommath.h147 #define MP_YES 1 /* yes response */ macro
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)
Dbn_mp_prime_is_divisible.c39 *result = MP_YES; in mp_prime_is_divisible()
Dbn_mp_neg.c28 if (mp_iszero(b) != MP_YES) { in mp_neg()
Dbn_mp_prime_fermat.c51 *result = MP_YES; in mp_prime_fermat()
Dbn_mp_radix_size.c38 if (mp_iszero(a) == MP_YES) { in mp_radix_size()
Dbn_mp_toradix_n.c35 if (mp_iszero(a) == MP_YES) { in mp_toradix_n()
Dbn_mp_is_square.c101 *ret = (mp_cmp_mag(&t,arg) == MP_EQ) ? MP_YES : MP_NO; in mp_is_square()
Dbn_mp_sqrt.c30 if (mp_iszero(arg) == MP_YES) { in mp_sqrt()
Dbn_mp_div.c77 c->sign = (mp_iszero(c) == MP_YES) ? MP_ZPOS : n2; in mp_div()
81 d->sign = (mp_iszero(d) == MP_YES) ? MP_ZPOS : n; in mp_div()
Dbn_mp_prime_miller_rabin.c93 *result = MP_YES; in mp_prime_miller_rabin()
Dbn_mp_exptmod.c70 if (mp_reduce_is_2k_l(P) == MP_YES) { in mp_exptmod()
Dbn_mp_prime_next_prime.c155 if (res == MP_YES) { in mp_prime_next_prime()
/external/dropbear/libtommath/pre_gen/
Dmpi.c1632 c->sign = (mp_iszero(c) == MP_YES) ? MP_ZPOS : n2; in mp_div()
1636 d->sign = (mp_iszero(d) == MP_YES) ? MP_ZPOS : n; in mp_div()
2571 if (mp_reduce_is_2k_l(P) == MP_YES) { in mp_exptmod()
3180 if (mp_iszero (a) == MP_YES) { in mp_gcd()
3183 if (mp_iszero (b) == MP_YES) { in mp_gcd()
3973 *ret = (mp_cmp_mag(&t,arg) == MP_EQ) ? MP_YES : MP_NO; in mp_is_square()
5451 if (mp_iszero(b) != MP_YES) { in mp_neg()
5572 *result = MP_YES; in mp_prime_fermat()
5626 *result = MP_YES; in mp_prime_is_divisible()
5693 if (res == MP_YES) { in mp_prime_is_prime()
[all …]
/external/wpa_supplicant/
Dlibtommath.c71 #define MP_YES 1 /* yes response */ macro
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) { in mp_exptmod()
1592 c->sign = (mp_iszero(c) == MP_YES) ? MP_ZPOS : n2; in mp_div()
1596 d->sign = (mp_iszero(d) == MP_YES) ? MP_ZPOS : n; in mp_div()
/external/wpa_supplicant_6/wpa_supplicant/src/tls/
Dlibtommath.c94 #define MP_YES 1 /* yes response */ macro
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) { in mp_exptmod()
1650 c->sign = (mp_iszero(c) == MP_YES) ? MP_ZPOS : n2; in mp_div()
1654 d->sign = (mp_iszero(d) == MP_YES) ? MP_ZPOS : n; in mp_div()
/external/dropbear/libtommath/mtest/
Dmpi.h41 #define MP_YES 0 /* yes (boolean result) */ macro
/external/dropbear/libtomcrypt/src/math/
Dltm_desc.c391 *b = (*b == MP_YES) ? LTC_MP_YES : LTC_MP_NO; in isprime()
/external/dropbear/libtommath/demo/
Ddemo.c214 if (cnt != MP_YES) { in main()