Commit baff51e9f26e7dd8e0bfa263dd9974780d37761a
2019-09-05T14:23:22
allow to run specific timing tests
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381
diff --git a/demo/timing.c b/demo/timing.c
index 75615a3..e960c3a 100644
--- a/demo/timing.c
+++ b/demo/timing.c
@@ -1,5 +1,7 @@
#include <tommath.h>
#include <time.h>
+#include <string.h>
+#include <stdlib.h>
#include <unistd.h>
#include <inttypes.h>
@@ -81,10 +83,14 @@ static uint64_t TIMFUNC(void)
#endif
}
+#if 1
#define DO(x) x; x;
-/*#define DO4(x) DO2(x); DO2(x);*/
-/*#define DO8(x) DO4(x); DO4(x);*/
-/*#define DO(x) DO8(x); DO8(x);*/
+#else
+#define DO2(x) x; x;
+#define DO4(x) DO2(x); DO2(x);
+#define DO8(x) DO4(x); DO4(x);
+#define DO(x) DO8(x); DO8(x);
+#endif
#ifdef TIMING_NO_LOGS
#define FOPEN(a, b) NULL
@@ -98,7 +104,21 @@ static uint64_t TIMFUNC(void)
#define FCLOSE(a) fclose(a)
#endif
-int main(void)
+static int should_test(const char *test, int argc, char **argv)
+{
+ int j;
+ if (argc > 1) {
+ for (j = 1; j < argc; ++j) {
+ if (strstr(test, argv[j]) != NULL) {
+ return 1;
+ }
+ }
+ if (j == argc) return 0;
+ }
+ return 1;
+}
+
+int main(int argc, char **argv)
{
uint64_t tt, gg, CLK_PER_SEC;
FILE *log, *logb, *logc, *logd;
@@ -127,99 +147,45 @@ int main(void)
printf("CLK_PER_SEC == %" PRIu64 "\n", CLK_PER_SEC);
#ifdef LTM_TIMING_PRIME_IS_PRIME
- for (m = 0; m < 2; ++m) {
- if (m == 0) {
- name = " Arnault";
- mp_read_radix(&a,
- "91xLNF3roobhzgTzoFIG6P13ZqhOVYSN60Fa7Cj2jVR1g0k89zdahO9/kAiRprpfO1VAp1aBHucLFV/qLKLFb+zonV7R2Vxp1K13ClwUXStpV0oxTNQVjwybmFb5NBEHImZ6V7P6+udRJuH8VbMEnS0H8/pSqQrg82OoQQ2fPpAk6G1hkjqoCv5s/Yr",
- 64);
- } else {
- name = "2^1119 + 53";
- mp_set(&a,1u);
- mp_mul_2d(&a,1119,&a);
- mp_add_d(&a,53,&a);
- }
- cnt = mp_prime_rabin_miller_trials(mp_count_bits(&a));
- ix = -cnt;
- for (; cnt >= ix; cnt += ix) {
- rr = 0u;
- tt = UINT64_MAX;
- do {
- gg = TIMFUNC();
- DO(mp_prime_is_prime(&a, cnt, &n));
- gg = (TIMFUNC() - gg) >> 1;
- if (tt > gg)
- tt = gg;
- if ((m == 0) && (n == MP_YES)) {
- printf("Arnault's pseudoprime is not prime but mp_prime_is_prime says it is.\n");
- return EXIT_FAILURE;
- }
- } while (++rr < 100u);
- printf("Prime-check\t%s(%2d) => %9" PRIu64 "/sec, %9" PRIu64 " cycles\n",
- name, cnt, CLK_PER_SEC / tt, tt);
+ if (should_test("prime", argc, argv)) {
+ for (m = 0; m < 2; ++m) {
+ if (m == 0) {
+ name = " Arnault";
+ mp_read_radix(&a,
+ "91xLNF3roobhzgTzoFIG6P13ZqhOVYSN60Fa7Cj2jVR1g0k89zdahO9/kAiRprpfO1VAp1aBHucLFV/qLKLFb+zonV7R2Vxp1K13ClwUXStpV0oxTNQVjwybmFb5NBEHImZ6V7P6+udRJuH8VbMEnS0H8/pSqQrg82OoQQ2fPpAk6G1hkjqoCv5s/Yr",
+ 64);
+ } else {
+ name = "2^1119 + 53";
+ mp_set(&a,1u);
+ mp_mul_2d(&a,1119,&a);
+ mp_add_d(&a,53,&a);
+ }
+ cnt = mp_prime_rabin_miller_trials(mp_count_bits(&a));
+ ix = -cnt;
+ for (; cnt >= ix; cnt += ix) {
+ rr = 0u;
+ tt = UINT64_MAX;
+ do {
+ gg = TIMFUNC();
+ DO(mp_prime_is_prime(&a, cnt, &n));
+ gg = (TIMFUNC() - gg) >> 1;
+ if (tt > gg)
+ tt = gg;
+ if ((m == 0) && (n == MP_YES)) {
+ printf("Arnault's pseudoprime is not prime but mp_prime_is_prime says it is.\n");
+ return EXIT_FAILURE;
+ }
+ } while (++rr < 100u);
+ printf("Prime-check\t%s(%2d) => %9" PRIu64 "/sec, %9" PRIu64 " cycles\n",
+ name, cnt, CLK_PER_SEC / tt, tt);
+ }
}
}
#endif
- log = FOPEN("logs/add.log", "w");
- for (cnt = 8; cnt <= 128; cnt += 8) {
- SLEEP;
- mp_rand(&a, cnt);
- mp_rand(&b, cnt);
- rr = 0u;
- tt = UINT64_MAX;
- do {
- gg = TIMFUNC();
- DO(mp_add(&a, &b, &c));
- gg = (TIMFUNC() - gg) >> 1;
- if (tt > gg)
- tt = gg;
- } while (++rr < 100000u);
- printf("Adding\t\t%4d-bit => %9" PRIu64 "/sec, %9" PRIu64 " cycles\n",
- mp_count_bits(&a), CLK_PER_SEC / tt, tt);
- FPRINTF(log, "%6d %9" PRIu64 "\n", cnt * MP_DIGIT_BIT, tt);
- FFLUSH(log);
- }
- FCLOSE(log);
-
- log = FOPEN("logs/sub.log", "w");
- for (cnt = 8; cnt <= 128; cnt += 8) {
- SLEEP;
- mp_rand(&a, cnt);
- mp_rand(&b, cnt);
- rr = 0u;
- tt = UINT64_MAX;
- do {
- gg = TIMFUNC();
- DO(mp_sub(&a, &b, &c));
- gg = (TIMFUNC() - gg) >> 1;
- if (tt > gg)
- tt = gg;
- } while (++rr < 100000u);
-
- printf("Subtracting\t\t%4d-bit => %9" PRIu64 "/sec, %9" PRIu64 " cycles\n",
- mp_count_bits(&a), CLK_PER_SEC / tt, tt);
- FPRINTF(log, "%6d %9" PRIu64 "\n", cnt * MP_DIGIT_BIT, tt);
- FFLUSH(log);
- }
- FCLOSE(log);
-
- /* do mult/square twice, first without karatsuba and second with */
- old_kara_m = KARATSUBA_MUL_CUTOFF;
- old_kara_s = KARATSUBA_SQR_CUTOFF;
- /* currently toom-cook cut-off is too high to kick in, so we just use the karatsuba values */
- old_toom_m = old_kara_m;
- old_toom_s = old_kara_m;
- for (ix = 0; ix < 3; ix++) {
- printf("With%s Karatsuba, With%s Toom\n", (ix == 1) ? "" : "out", (ix == 2) ? "" : "out");
-
- KARATSUBA_MUL_CUTOFF = (ix == 1) ? old_kara_m : 9999;
- KARATSUBA_SQR_CUTOFF = (ix == 1) ? old_kara_s : 9999;
- TOOM_MUL_CUTOFF = (ix == 2) ? old_toom_m : 9999;
- TOOM_SQR_CUTOFF = (ix == 2) ? old_toom_s : 9999;
-
- log = FOPEN((ix == 0) ? "logs/mult.log" : (ix == 1) ? "logs/mult_kara.log" : "logs/mult_toom.log", "w");
- for (cnt = 4; cnt <= (10240 / MP_DIGIT_BIT); cnt += 2) {
+ if (should_test("add", argc, argv)) {
+ log = FOPEN("logs/add.log", "w");
+ for (cnt = 8; cnt <= 128; cnt += 8) {
SLEEP;
mp_rand(&a, cnt);
mp_rand(&b, cnt);
@@ -227,41 +193,103 @@ int main(void)
tt = UINT64_MAX;
do {
gg = TIMFUNC();
- DO(mp_mul(&a, &b, &c));
+ DO(mp_add(&a, &b, &c));
gg = (TIMFUNC() - gg) >> 1;
if (tt > gg)
tt = gg;
- } while (++rr < 100u);
- printf("Multiplying\t%4d-bit => %9" PRIu64 "/sec, %9" PRIu64 " cycles\n",
+ } while (++rr < 100000u);
+ printf("Adding\t\t%4d-bit => %9" PRIu64 "/sec, %9" PRIu64 " cycles\n",
mp_count_bits(&a), CLK_PER_SEC / tt, tt);
- FPRINTF(log, "%6d %9" PRIu64 "\n", mp_count_bits(&a), tt);
+ FPRINTF(log, "%6d %9" PRIu64 "\n", cnt * MP_DIGIT_BIT, tt);
FFLUSH(log);
}
FCLOSE(log);
+ }
- log = FOPEN((ix == 0) ? "logs/sqr.log" : (ix == 1) ? "logs/sqr_kara.log" : "logs/sqr_toom.log", "w");
- for (cnt = 4; cnt <= (10240 / MP_DIGIT_BIT); cnt += 2) {
+ if (should_test("sub", argc, argv)) {
+ log = FOPEN("logs/sub.log", "w");
+ for (cnt = 8; cnt <= 128; cnt += 8) {
SLEEP;
mp_rand(&a, cnt);
+ mp_rand(&b, cnt);
rr = 0u;
tt = UINT64_MAX;
do {
gg = TIMFUNC();
- DO(mp_sqr(&a, &b));
+ DO(mp_sub(&a, &b, &c));
gg = (TIMFUNC() - gg) >> 1;
if (tt > gg)
tt = gg;
- } while (++rr < 100u);
- printf("Squaring\t%4d-bit => %9" PRIu64 "/sec, %9" PRIu64 " cycles\n",
+ } while (++rr < 100000u);
+
+ printf("Subtracting\t\t%4d-bit => %9" PRIu64 "/sec, %9" PRIu64 " cycles\n",
mp_count_bits(&a), CLK_PER_SEC / tt, tt);
- FPRINTF(log, "%6d %9" PRIu64 "\n", mp_count_bits(&a), tt);
+ FPRINTF(log, "%6d %9" PRIu64 "\n", cnt * MP_DIGIT_BIT, tt);
FFLUSH(log);
}
FCLOSE(log);
+ }
+ if (should_test("mulsqr", argc, argv)) {
+ /* do mult/square twice, first without karatsuba and second with */
+ old_kara_m = KARATSUBA_MUL_CUTOFF;
+ old_kara_s = KARATSUBA_SQR_CUTOFF;
+ /* currently toom-cook cut-off is too high to kick in, so we just use the karatsuba values */
+ old_toom_m = old_kara_m;
+ old_toom_s = old_kara_s;
+ for (ix = 0; ix < 3; ix++) {
+ printf("With%s Karatsuba, With%s Toom\n", (ix == 1) ? "" : "out", (ix == 2) ? "" : "out");
+
+ KARATSUBA_MUL_CUTOFF = (ix == 1) ? old_kara_m : 9999;
+ KARATSUBA_SQR_CUTOFF = (ix == 1) ? old_kara_s : 9999;
+ TOOM_MUL_CUTOFF = (ix == 2) ? old_toom_m : 9999;
+ TOOM_SQR_CUTOFF = (ix == 2) ? old_toom_s : 9999;
+
+ log = FOPEN((ix == 0) ? "logs/mult.log" : (ix == 1) ? "logs/mult_kara.log" : "logs/mult_toom.log", "w");
+ for (cnt = 4; cnt <= (10240 / MP_DIGIT_BIT); cnt += 2) {
+ SLEEP;
+ mp_rand(&a, cnt);
+ mp_rand(&b, cnt);
+ rr = 0u;
+ tt = UINT64_MAX;
+ do {
+ gg = TIMFUNC();
+ DO(mp_mul(&a, &b, &c));
+ gg = (TIMFUNC() - gg) >> 1;
+ if (tt > gg)
+ tt = gg;
+ } while (++rr < 100u);
+ printf("Multiplying\t%4d-bit => %9" PRIu64 "/sec, %9" PRIu64 " cycles\n",
+ mp_count_bits(&a), CLK_PER_SEC / tt, tt);
+ FPRINTF(log, "%6d %9" PRIu64 "\n", mp_count_bits(&a), tt);
+ FFLUSH(log);
+ }
+ FCLOSE(log);
+
+ log = FOPEN((ix == 0) ? "logs/sqr.log" : (ix == 1) ? "logs/sqr_kara.log" : "logs/sqr_toom.log", "w");
+ for (cnt = 4; cnt <= (10240 / MP_DIGIT_BIT); cnt += 2) {
+ SLEEP;
+ mp_rand(&a, cnt);
+ rr = 0u;
+ tt = UINT64_MAX;
+ do {
+ gg = TIMFUNC();
+ DO(mp_sqr(&a, &b));
+ gg = (TIMFUNC() - gg) >> 1;
+ if (tt > gg)
+ tt = gg;
+ } while (++rr < 100u);
+ printf("Squaring\t%4d-bit => %9" PRIu64 "/sec, %9" PRIu64 " cycles\n",
+ mp_count_bits(&a), CLK_PER_SEC / tt, tt);
+ FPRINTF(log, "%6d %9" PRIu64 "\n", mp_count_bits(&a), tt);
+ FFLUSH(log);
+ }
+ FCLOSE(log);
+
+ }
}
- {
+ if (should_test("expt", argc, argv)) {
const char *primes[] = {
/* 2K large moduli */
"179769313486231590772930519078902473361797697894230657273430081157732675805500963132708477322407536021120113879871393357658789768814416622492847430639474124377767893424865485276302219601246094119453082952085005768838150682342462881473913110540827237163350510684586239334100047359817950870678242457666208137217",
@@ -333,42 +361,44 @@ int main(void)
FPRINTF((n < 3) ? logd : (n < 9) ? logc : (n < 16) ? logb : log,
"%6d %9" PRIu64 "\n", mp_count_bits(&a), tt);
}
+ FCLOSE(log);
+ FCLOSE(logb);
+ FCLOSE(logc);
+ FCLOSE(logd);
}
- FCLOSE(log);
- FCLOSE(logb);
- FCLOSE(logc);
- FCLOSE(logd);
-
- log = FOPEN("logs/invmod.log", "w");
- for (cnt = 4; cnt <= 32; cnt += 4) {
- SLEEP;
- mp_rand(&a, cnt);
- mp_rand(&b, cnt);
-
- do {
- mp_add_d(&b, 1uL, &b);
- mp_gcd(&a, &b, &c);
- } while (mp_cmp_d(&c, 1uL) != MP_EQ);
-
- rr = 0u;
- tt = UINT64_MAX;
- do {
- gg = TIMFUNC();
- DO(mp_invmod(&b, &a, &c));
- gg = (TIMFUNC() - gg) >> 1;
- if (tt > gg)
- tt = gg;
- } while (++rr < 1000u);
- mp_mulmod(&b, &c, &a, &d);
- if (mp_cmp_d(&d, 1uL) != MP_EQ) {
- printf("Failed to invert\n");
- return 0;
+
+ if (should_test("invmod", argc, argv)) {
+ log = FOPEN("logs/invmod.log", "w");
+ for (cnt = 4; cnt <= 32; cnt += 4) {
+ SLEEP;
+ mp_rand(&a, cnt);
+ mp_rand(&b, cnt);
+
+ do {
+ mp_add_d(&b, 1uL, &b);
+ mp_gcd(&a, &b, &c);
+ } while (mp_cmp_d(&c, 1uL) != MP_EQ);
+
+ rr = 0u;
+ tt = UINT64_MAX;
+ do {
+ gg = TIMFUNC();
+ DO(mp_invmod(&b, &a, &c));
+ gg = (TIMFUNC() - gg) >> 1;
+ if (tt > gg)
+ tt = gg;
+ } while (++rr < 1000u);
+ mp_mulmod(&b, &c, &a, &d);
+ if (mp_cmp_d(&d, 1uL) != MP_EQ) {
+ printf("Failed to invert\n");
+ return 0;
+ }
+ printf("Inverting mod\t%4d-bit => %9" PRIu64 "/sec, %9" PRIu64 " cycles\n",
+ mp_count_bits(&a), CLK_PER_SEC / tt, tt);
+ FPRINTF(log, "%6d %9" PRIu64 "\n", cnt * MP_DIGIT_BIT, tt);
}
- printf("Inverting mod\t%4d-bit => %9" PRIu64 "/sec, %9" PRIu64 " cycles\n",
- mp_count_bits(&a), CLK_PER_SEC / tt, tt);
- FPRINTF(log, "%6d %9" PRIu64 "\n", cnt * MP_DIGIT_BIT, tt);
+ FCLOSE(log);
}
- FCLOSE(log);
return 0;
}