Searched refs:mul2_n (Results 1 – 2 of 2) sorted by relevance
| /dports/math/libtommath/libtommath-1.2.0/demo/ |
| H A D | mtest_opponent.c | 28 gcd_n, lcm_n, inv_n, div2_n, mul2_n, add_d_n, sub_d_n; in mtest_opponent() local
35 div2_n = mul2_n = inv_n = expt_n = lcm_n = gcd_n = add_n = in mtest_opponent()
78 expt_n, inv_n, div2_n, mul2_n, add_d_n, sub_d_n); in mtest_opponent()
334 ++mul2_n; in mtest_opponent()
341 printf("mul_2 %lu failure\n", mul2_n); in mtest_opponent()
|
| /dports/math/tomsfastmath/tomsfastmath-0.13.1/demo/ |
| H A D | test.c | 41 div2_n, mul2_n, add_d_n, sub_d_n, mul_d_n, cnt, rr; local
195 div2_n = mul2_n = inv_n = expt_n = lcm_n = gcd_n = add_n =
199 …_n, div_n, sqr_n, mul2d_n, div2d_n, gcd_n, lcm_n, expt_n, inv_n, div2_n, mul2_n, add_d_n, sub_d_n,…
380 } else if (!strcmp(cmd, "mul2")) { ++mul2_n;
385 printf("\nmul_2 %lu failure\n", mul2_n);
|