/external/dropbear/libtommath/ |
bn_mp_cmp_d.c | 28 return MP_GT; 33 return MP_GT;
|
bn_mp_cmp_mag.c | 26 return MP_GT; 42 return MP_GT;
|
bn_mp_cmp.c | 27 return MP_GT;
|
bn_mp_prime_fermat.c | 35 if (mp_cmp_d(b, 1) != MP_GT) {
|
bn_mp_jacobi.c | 28 if (mp_cmp_d(p, 0) != MP_GT) {
|
bn_mp_prime_miller_rabin.c | 34 if (mp_cmp_d(b, 1) != MP_GT) {
|
bn_mp_sqrt.c | 68 } while (mp_cmp_mag(&t1,&t2) == MP_GT);
|
bn_mp_gcd.c | 75 if (mp_cmp_mag(&u, &v) == MP_GT) {
|
bn_mp_n_root.c | 103 if (mp_cmp (&t2, a) == MP_GT) {
|
bn_mp_div.c | 60 if (mp_cmp(&tb, &ta) != MP_GT) { 227 } while (mp_cmp_mag(&t1, &t2) == MP_GT);
|
tommath.h | 137 #define MP_GT 1 /* greater than */
|
bn.tex | 844 case MP_GT: printf("|number1| > |number2|"); break; 902 case MP_GT: printf("number1 > number2"); break; [all...] |
/external/dropbear/ |
gendss.c | 180 } while (mp_cmp_d(key->g, 1) != MP_GT);
|
common-kex.c | 527 || mp_cmp_d(dh_pub_them, 0) != MP_GT) {
|
/external/dropbear/libtomcrypt/src/math/ |
ltm_desc.c | 128 case MP_GT: return LTC_MP_GT; 141 case MP_GT: return LTC_MP_GT;
|
/external/dropbear/libtommath/mtest/ |
mpi.c | 87 #define MP_GT 1 [all...] |
mpi.h | 19 #define MP_GT 1
|
/external/wpa_supplicant_8/src/tls/ |
libtommath.c | 96 #define MP_GT 1 /* greater than */ 693 return MP_GT; 717 return MP_GT; 722 return MP_GT; 934 return MP_GT; 950 return MP_GT; [all...] |
/external/dropbear/libtommath/pre_gen/ |
mpi.c | 1250 return MP_GT; 1298 return MP_GT; 1303 return MP_GT; [all...] |