| /llvm-project-15.0.7/polly/lib/External/isl/imath/ |
| H A D | imrat.c | 217 return MP_OK; in mp_rat_recip() 257 MP_OK) { in mp_rat_div() 266 MP_OK) { in mp_rat_div() 270 MP_OK) { in mp_rat_div() 478 return MP_OK; in mp_rat_to_string() 761 return MP_OK; in mp_rat_read_cdecimal() 803 MP_OK) { in mp_rat_read_cdecimal() 811 MP_OK) { in mp_rat_read_cdecimal() 822 MP_OK) { in mp_rat_read_cdecimal() 859 return MP_OK; in s_rat_reduce() [all …]
|
| H A D | imdrover.c | 52 #define CHECK(X) VCHECK(X, MP_OK) 206 if (rval != NULL) *rval = MP_OK; /* default */ in parse_int_values() 227 if (read_int_value(reg, str) != MP_OK) { in parse_int_values() 277 if (rval != NULL) *rval = MP_OK; /* default */ in parse_rat_values() 298 if (read_rat_value(reg, str) != MP_OK) { in parse_rat_values() 353 *code = MP_OK; in parse_result_code() 417 assert(mp_int_init(g_zreg + i) == MP_OK); in init_testing() 418 assert(mp_rat_init(g_qreg + i) == MP_OK); in init_testing() 669 if (expect == MP_OK && in test_divv() 765 if (expect != MP_OK) return true; in test_egcd() [all …]
|
| H A D | iprime.c | 57 if ((res = mp_int_div_value(z, s_ptab[i], NULL, &rem)) != MP_OK) return res; in mp_int_is_prime() 67 if ((res = mp_int_init(&tmp)) != MP_OK) return res; in mp_int_is_prime() 70 if ((res = mp_int_exptmod_bvalue(s_ptab[i], z, z, &tmp)) != MP_OK) { in mp_int_is_prime() 86 if (mp_int_is_even(z) && ((res = mp_int_add_value(z, 1, z)) != MP_OK)) in mp_int_find_prime() 90 if ((res = mp_int_add_value(z, 2, z)) != MP_OK) break; in mp_int_find_prime()
|
| H A D | imath.c | 375 return MP_OK; in mp_int_init() 405 return MP_OK; in mp_int_init_size() 424 return MP_OK; in mp_int_init_copy() 493 return MP_OK; in mp_int_copy() 523 return MP_OK; in mp_int_abs() 534 return MP_OK; in mp_int_neg() 591 return MP_OK; in mp_int_add() 653 return MP_OK; in mp_int_sub() 712 return MP_OK; in mp_int_mul() 771 return MP_OK; in mp_int_sqr() [all …]
|
| H A D | rsamath.c | 46 return MP_OK; in rsa_i2osp() 111 return MP_OK; in rsa_pkcs1v15_encode() 136 return MP_OK; in rsa_pkcs1v15_decode()
|
| H A D | gmp_compat.c | 43 #define CHECK(res) assert(((res) == MP_OK) && "expected MP_OK") 352 return ((res == MP_OK) ? 0 : -1); in GMPZAPI() 382 if (resN != MP_OK || resD != MP_OK) { in GMPQAPI() 424 if (res == MP_OK) return out; in GMPZAPI() 428 CHECK(res == MP_RANGE ? MP_OK : MP_RANGE); in GMPZAPI() 442 if (res == MP_OK) return out; in GMPZAPI() 446 CHECK(res == MP_RANGE ? MP_OK : MP_RANGE); in GMPZAPI() 811 CHECK((res > 0) == MP_OK); in GMPZAPI()
|
| H A D | imtimer.c | 141 if (mp_int_init_size(out + i, prec) != MP_OK) { in alloc_values()
|
| H A D | doc.md.in | 43 | `MP_OK` | operation successful, all is well (= 0) | 44 | `MP_FALSE` | boolean false (= `MP_OK`) | 80 expected to return `MP_OK`, `MP_BADARG`, or `MP_MEMORY`. Other return values 268 /* Perform actions that must return MP_OK or fail. */ 285 return MP_OK;
|
| H A D | imath.h | 71 extern const mp_result MP_OK;
|
| /llvm-project-15.0.7/polly/lib/External/isl/imath/examples/ |
| H A D | imcalc.c | 498 return MP_OK; in state_init() 576 return MP_OK; in stack_push() 588 return MP_OK; in stack_pop() 660 return MP_OK; in mem_clear() 915 return MP_OK; in cf_pprint() 920 return MP_OK; in cf_print() 935 return MP_OK; in cf_pstack() 941 return MP_OK; in cf_clstk() 987 return MP_OK; in cf_copy() 996 return MP_OK; in cf_swap() [all …]
|
| H A D | pi.c | 80 if ((res = arctan(g_radix, 16, 5, ndigits, &sum1)) != MP_OK) { in main() 87 if ((res = arctan(g_radix, 4, 239, ndigits, &sum2)) != MP_OK) { in main() 94 if ((res = mp_int_sub(&sum1, &sum2, &sum1)) != MP_OK) { in main() 139 if ((res = mp_int_expt_value(radix, prec, &t)) != MP_OK || in arctan() 140 (res = mp_int_mul_value(&t, mul, &t)) != MP_OK || in arctan() 141 (res = mp_int_mul_value(&t, x, &t)) != MP_OK) in arctan() 148 if ((res = mp_int_div_value(&t, x, &t, &rem)) != MP_OK) goto CLEANUP; in arctan() 150 if ((res = mp_int_div_value(&t, coeff, &v, &rem)) != MP_OK) goto CLEANUP; in arctan() 158 if (res != MP_OK) goto CLEANUP; in arctan()
|
| H A D | randprime.c | 108 if ((res = mp_int_randomize(&value, modbits - 1)) != MP_OK) { in main() 154 mp_result res = MP_OK; in mp_int_randomize() 189 if ((res = mp_int_add_value(seed, 1, seed)) != MP_OK) { in find_prime() 200 if ((res = mp_int_add_value(seed, 2, seed)) != MP_OK) { in find_prime() 211 mp_result res = MP_OK; in find_strong_prime() 217 if (mp_int_copy(seed, &t) != MP_OK) break; in find_strong_prime() 219 if (mp_int_mul_pow2(&t, 1, &t) != MP_OK || in find_strong_prime() 220 mp_int_add_value(&t, 1, &t) != MP_OK) { in find_strong_prime() 233 if (mp_int_add_value(seed, 2, seed) != MP_OK) break; in find_strong_prime()
|
| H A D | rsakey.c | 115 if ((res = rsa_key_init(&the_key)) != MP_OK) { in main() 125 if ((res = mp_int_read_string(&(the_key.e), 10, expt)) != MP_OK) { in main() 134 if ((res = mp_int_randomize(&(the_key.p), (modbits / 2))) != MP_OK) { in main() 144 if ((res = mp_int_randomize(&(the_key.q), (modbits / 2))) != MP_OK) { in main() 164 (res = mp_int_randomize(&(the_key.e), (modbits / 2))) != MP_OK) { in main() 172 MP_OK) { in main() 180 if ((res = mp_int_randomize(&(the_key.e), (modbits / 2))) != MP_OK) { in main() 216 mp_result res = MP_OK; in mp_int_randomize() 251 if ((res = mp_int_add_value(seed, 1, seed)) != MP_OK) return res; in find_prime() 258 if ((res = mp_int_add_value(seed, 2, seed)) != MP_OK) return res; in find_prime() [all …]
|
| H A D | input.c | 55 if ((res = mp_rat_init(&value)) != MP_OK) { in main() 61 if ((res = mp_rat_read_ustring(&value, 0, argv[1], &endp)) != MP_OK) { in main() 84 if (res != MP_OK) { in main() 98 if (res != MP_OK) { in main()
|
| H A D | basecvt.c | 62 if ((res = mp_rat_init(&value)) != MP_OK) { in main() 73 if (res != MP_OK && res != MP_TRUNC) { in main() 101 if (res != MP_OK) { in main() 114 return (res != MP_OK); in main()
|
| H A D | rounding.c | 47 if ((res = mp_rat_init(&value)) != MP_OK) { in main() 63 if ((res = mp_rat_read_decimal(&value, radix, argv[4])) != MP_OK) { in main() 71 if ((res = mp_rat_to_decimal(&value, radix, prec, mode, buf, len)) != MP_OK) { in main()
|
| H A D | findprime.c | 46 if ((res = mp_int_read_string(&seed, 10, argv[1])) != MP_OK) { in main()
|
| /llvm-project-15.0.7/polly/lib/External/isl/imath/tests/ |
| H A D | bintest.c | 56 if (res != MP_OK) { in main() 69 if (res == MP_OK) { in main() 80 if (res == MP_OK) { in main() 95 if (res == MP_OK) { in main()
|
| H A D | rtest.c | 73 MP_OK) { in main() 83 if ((res = rsa_pkcs1v15_decode(buf, buf_len, 2, &msg_len)) != MP_OK) { in main()
|
| /llvm-project-15.0.7/polly/lib/External/isl/ |
| H A D | isl_test_imath.c | 40 assert(retval == MP_OK); in test_imath_internals() 47 assert(retval == MP_OK); in test_imath_internals() 54 assert(retval == MP_OK); in test_imath_internals() 61 assert(retval == MP_OK); in test_imath_internals()
|
| H A D | isl_imath.c | 21 return res == MP_OK; in isl_imath_fits_slong_p() 30 return res == MP_OK; in isl_imath_fits_ulong_p()
|
| H A D | isl_int_sioimath.h | 396 if (mp_int_to_int(isl_sioimath_get_big(*dst), &small) != MP_OK) in isl_sioimath_try_demote() 465 return mp_int_to_int(isl_sioimath_get_big(val), &dummy) == MP_OK; in isl_sioimath_fits_slong() 491 return mp_int_to_uint(isl_sioimath_get_big(val), &dummy) == MP_OK; in isl_sioimath_fits_ulong()
|
| /llvm-project-15.0.7/polly/lib/External/isl/imath_wrap/ |
| H A D | wrap.h | 9 #define MP_OK ISL_MP_OK macro
|