| /minix3/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/ |
| H A D | bn_mp_cmp_d.c | 25 return MP_LT; in mp_cmp_d() 37 return MP_LT; in mp_cmp_d()
|
| H A D | bn_mp_cmp_mag.c | 32 return MP_LT; in mp_cmp_mag() 48 return MP_LT; in mp_cmp_mag()
|
| H A D | bn_mp_invmod_slow.c | 113 if (mp_cmp (&u, &v) != MP_LT) { in mp_invmod_slow() 154 while (mp_cmp_d(&C, 0) == MP_LT) { in mp_invmod_slow() 161 while (mp_cmp_mag(&C, b) != MP_LT) { in mp_invmod_slow()
|
| H A D | bn_mp_reduce.c | 78 if (mp_cmp_d (x, 0) == MP_LT) { in mp_reduce() 87 while (mp_cmp (x, m) != MP_LT) { in mp_reduce()
|
| H A D | bn_mp_prime_next_prime.c | 40 if (mp_cmp_d(a, ltm_prime_tab[PRIME_SIZE-1]) == MP_LT) { in mp_prime_next_prime() 43 if (mp_cmp_d(a, ltm_prime_tab[x]) != MP_LT) { in mp_prime_next_prime()
|
| H A D | bn_mp_cmp.c | 27 return MP_LT; in mp_cmp()
|
| H A D | bn_mp_add.c | 40 if (mp_cmp_mag (a, b) == MP_LT) { in mp_add()
|
| H A D | bn_mp_montgomery_calc_normalization.c | 48 if (mp_cmp_mag (a, b) != MP_LT) { in mp_montgomery_calc_normalization()
|
| H A D | bn_mp_sub.c | 41 if (mp_cmp_mag (a, b) != MP_LT) { in mp_sub()
|
| H A D | bn_mp_reduce_2k.c | 49 if (mp_cmp_mag(a, n) != MP_LT) { in mp_reduce_2k()
|
| H A D | bn_mp_reduce_2k_l.c | 50 if (mp_cmp_mag(a, n) != MP_LT) { in mp_reduce_2k_l()
|
| H A D | bn_mp_lcm.c | 37 if (mp_cmp_mag(a, b) == MP_LT) { in mp_lcm()
|
| H A D | bn_mp_div.c | 34 if (mp_cmp_mag (a, b) == MP_LT) { in mp_div() 116 if (mp_cmp_mag (a, b) == MP_LT) { in mp_div() 176 while (mp_cmp (&x, &y) != MP_LT) { in mp_div()
|
| H A D | bn_mp_dr_reduce.c | 86 if (mp_cmp_mag (x, n) != MP_LT) { in mp_dr_reduce()
|
| H A D | bn_mp_montgomery_reduce.c | 110 if (mp_cmp_mag (x, n) != MP_LT) { in mp_montgomery_reduce()
|
| H A D | bn_fast_mp_montgomery_reduce.c | 165 if (mp_cmp_mag (x, n) != MP_LT) { in fast_mp_montgomery_reduce()
|
| H A D | bn_fast_mp_invmod.c | 99 if (mp_cmp (&u, &v) != MP_LT) { in fast_mp_invmod()
|
| H A D | tommath.h | 137 #define MP_LT -1 /* less than */ macro
|
| H A D | bn.tex | 846 case MP_LT: printf("|number1| < |number2|"); break; 904 case MP_LT: printf("number1 < number2"); break; 954 case MP_LT: printf("number < 7"); break; 1014 case MP_LT: printf("2*number < 7"); break; 1026 case MP_LT: printf("2*number/2 < 7"); break;
|
| /minix3/crypto/external/bsd/netpgp/dist/src/libbn/ |
| H A D | bignum.c | 411 return MP_LT; in mp_cmp_mag() 427 return MP_LT; in mp_cmp_mag() 440 return MP_LT; in mp_cmp() 764 if (mp_cmp_mag (a, b) != MP_LT) { in mp_sub() 910 if (mp_cmp_mag (a, b) == MP_LT) { in mp_add() 1069 if (mp_cmp_mag (a, b) == MP_LT) { in mp_div() 1129 while (mp_cmp (&x, &y) != MP_LT) { in mp_div() 1328 return MP_LT; in mp_cmp_d() 1340 return MP_LT; in mp_cmp_d() 1438 if (mp_cmp (&u, &v) != MP_LT) { in fast_mp_invmod() [all …]
|
| H A D | bn.h | 69 #define MP_LT -1 macro
|
| /minix3/crypto/external/bsd/netpgp/dist/src/netpgpverify/ |
| H A D | bn.h | 69 #define MP_LT -1 macro
|
| H A D | bignum.c | 378 return MP_LT; in compare_magnitude() 394 return MP_LT; in compare_magnitude() 406 return (a->sign == MP_NEG) ? MP_LT : MP_GT; in signed_compare() 708 if (compare_magnitude(a, b) != MP_LT) { in signed_subtract() 834 if (compare_magnitude(a, b) == MP_LT) { in signed_add() 994 if (compare_magnitude(a, b) == MP_LT) { in signed_divide() 1054 while (signed_compare(&x, &y) != MP_LT) { in signed_divide() 1261 return MP_LT; in compare_digit() 1273 return MP_LT; in compare_digit() 1373 if (signed_compare(&u, &v) != MP_LT) { in fast_modular_inverse() [all …]
|
| /minix3/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/mtest/ |
| H A D | mpi.c | 87 #define MP_LT -1 macro 1781 return MP_LT; in mp_cmp_z() 1804 return MP_LT; in mp_cmp_d() 1832 return MP_LT; in mp_cmp() 3788 return MP_LT; in s_mp_cmp() 3797 return MP_LT; in s_mp_cmp() 3821 return MP_LT; in s_mp_cmp_d()
|
| H A D | mpi.h | 19 #define MP_LT -1 macro
|