Searched refs:MP_GT (Results 1 - 15 of 15) sorted by relevance
| /barrelfish-2018-10-04/lib/tommath/ |
| H A D | bn_mp_cmp_d.c | 28 return MP_GT;
33 return MP_GT;
|
| H A D | bn_mp_cmp_mag.c | 26 return MP_GT;
42 return MP_GT;
|
| H A D | bn_mp_cmp.c | 27 return MP_GT;
|
| H A D | bn_mp_prime_fermat.c | 35 if (mp_cmp_d(b, 1) != MP_GT) {
|
| H A D | bn_mp_jacobi.c | 28 if (mp_cmp_d(p, 0) != MP_GT) {
|
| H A D | bn_mp_prime_miller_rabin.c | 34 if (mp_cmp_d(b, 1) != MP_GT) {
|
| H A D | bn_mp_sqrt.c | 68 } while (mp_cmp_mag(&t1,&t2) == MP_GT);
|
| H A D | bn_mp_gcd.c | 75 if (mp_cmp_mag(&u, &v) == MP_GT) {
|
| H A D | bn_mp_n_root.c | 103 if (mp_cmp (&t2, a) == MP_GT) {
|
| H A D | bn_mp_div.c | 60 if (mp_cmp(&tb, &ta) != MP_GT) {
227 } while (mp_cmp_mag(&t1, &t2) == MP_GT);
|
| H A D | tommath.h | 137 #define MP_GT 1 /* greater than */ macro
|
| H A D | bn.tex | 844 case MP_GT: printf("|number1| > |number2|"); break;
902 case MP_GT: printf("number1 > number2"); break;
952 case MP_GT: printf("number > 7"); break;
1012 case MP_GT: printf("2*number > 7"); break;
1024 case MP_GT: printf("2*number/2 > 7"); break;
|
| /barrelfish-2018-10-04/lib/tommath/mtest/ |
| H A D | mpi.c | 87 #define MP_GT 1 macro
1783 return MP_GT;
1828 return MP_GT;
1974 if(mp_cmp_z(&t) == MP_GT) {
3784 return MP_GT;
3793 return MP_GT;
3816 return MP_GT;
3821 return MP_GT;
|
| H A D | mpi.h | 19 #define MP_GT 1 macro
|
| /barrelfish-2018-10-04/lib/tommath/pre_gen/ |
| H A D | mpi.c | 1250 return MP_GT;
1298 return MP_GT;
1303 return MP_GT;
1344 return MP_GT;
1360 return MP_GT;
1615 if (mp_cmp(&tb, &ta) != MP_GT) {
1782 } while (mp_cmp_mag(&t1, &t2) == MP_GT);
3235 if (mp_cmp_mag(&u, &v) == MP_GT) {
4018 if (mp_cmp_d(p, 0) != MP_GT) {
5395 if (mp_cmp (&t2, a) == MP_GT) {
[all...] |
Completed in 75 milliseconds