bench.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719
  1. /* Copyright (c) 2001-2004, Roger Dingledine.
  2. * Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
  3. * Copyright (c) 2007-2016, The Tor Project, Inc. */
  4. /* See LICENSE for licensing information */
  5. extern const char tor_git_revision[];
  6. /* Ordinarily defined in tor_main.c; this bit is just here to provide one
  7. * since we're not linking to tor_main.c */
  8. const char tor_git_revision[] = "";
  9. /**
  10. * \file bench.c
  11. * \brief Benchmarks for lower level Tor modules.
  12. **/
  13. #include "orconfig.h"
  14. #include "or.h"
  15. #include "onion_tap.h"
  16. #include "relay.h"
  17. #include <openssl/opensslv.h>
  18. #include <openssl/evp.h>
  19. #include <openssl/ec.h>
  20. #include <openssl/ecdh.h>
  21. #include <openssl/obj_mac.h>
  22. #include "config.h"
  23. #include "crypto_curve25519.h"
  24. #include "onion_ntor.h"
  25. #include "crypto_ed25519.h"
  26. #if defined(HAVE_CLOCK_GETTIME) && defined(CLOCK_PROCESS_CPUTIME_ID)
  27. static uint64_t nanostart;
  28. static inline uint64_t
  29. timespec_to_nsec(const struct timespec *ts)
  30. {
  31. return ((uint64_t)ts->tv_sec)*1000000000 + ts->tv_nsec;
  32. }
  33. static void
  34. reset_perftime(void)
  35. {
  36. struct timespec ts;
  37. int r;
  38. r = clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &ts);
  39. tor_assert(r == 0);
  40. nanostart = timespec_to_nsec(&ts);
  41. }
  42. static uint64_t
  43. perftime(void)
  44. {
  45. struct timespec ts;
  46. int r;
  47. r = clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &ts);
  48. tor_assert(r == 0);
  49. return timespec_to_nsec(&ts) - nanostart;
  50. }
  51. #else
  52. static struct timeval tv_start = { 0, 0 };
  53. static void
  54. reset_perftime(void)
  55. {
  56. tor_gettimeofday(&tv_start);
  57. }
  58. static uint64_t
  59. perftime(void)
  60. {
  61. struct timeval now, out;
  62. tor_gettimeofday(&now);
  63. timersub(&now, &tv_start, &out);
  64. return ((uint64_t)out.tv_sec)*1000000000 + out.tv_usec*1000;
  65. }
  66. #endif
  67. #define NANOCOUNT(start,end,iters) \
  68. ( ((double)((end)-(start))) / (iters) )
  69. #define MICROCOUNT(start,end,iters) \
  70. ( NANOCOUNT((start), (end), (iters)) / 1000.0 )
  71. /** Run AES performance benchmarks. */
  72. static void
  73. bench_aes(void)
  74. {
  75. int len, i;
  76. char *b1, *b2;
  77. crypto_cipher_t *c;
  78. uint64_t start, end;
  79. const int bytes_per_iter = (1<<24);
  80. reset_perftime();
  81. char key[CIPHER_KEY_LEN];
  82. crypto_rand(key, sizeof(key));
  83. c = crypto_cipher_new(key);
  84. for (len = 1; len <= 8192; len *= 2) {
  85. int iters = bytes_per_iter / len;
  86. b1 = tor_malloc_zero(len);
  87. b2 = tor_malloc_zero(len);
  88. start = perftime();
  89. for (i = 0; i < iters; ++i) {
  90. crypto_cipher_encrypt(c, b1, b2, len);
  91. }
  92. end = perftime();
  93. tor_free(b1);
  94. tor_free(b2);
  95. printf("%d bytes: %.2f nsec per byte\n", len,
  96. NANOCOUNT(start, end, iters*len));
  97. }
  98. crypto_cipher_free(c);
  99. }
  100. static void
  101. bench_onion_TAP(void)
  102. {
  103. const int iters = 1<<9;
  104. int i;
  105. crypto_pk_t *key, *key2;
  106. uint64_t start, end;
  107. char os[TAP_ONIONSKIN_CHALLENGE_LEN];
  108. char or[TAP_ONIONSKIN_REPLY_LEN];
  109. crypto_dh_t *dh_out = NULL;
  110. key = crypto_pk_new();
  111. key2 = crypto_pk_new();
  112. if (crypto_pk_generate_key_with_bits(key, 1024) < 0)
  113. goto done;
  114. if (crypto_pk_generate_key_with_bits(key2, 1024) < 0)
  115. goto done;
  116. reset_perftime();
  117. start = perftime();
  118. for (i = 0; i < iters; ++i) {
  119. onion_skin_TAP_create(key, &dh_out, os);
  120. crypto_dh_free(dh_out);
  121. }
  122. end = perftime();
  123. printf("Client-side, part 1: %f usec.\n", NANOCOUNT(start, end, iters)/1e3);
  124. onion_skin_TAP_create(key, &dh_out, os);
  125. start = perftime();
  126. for (i = 0; i < iters; ++i) {
  127. char key_out[CPATH_KEY_MATERIAL_LEN];
  128. onion_skin_TAP_server_handshake(os, key, NULL, or,
  129. key_out, sizeof(key_out));
  130. }
  131. end = perftime();
  132. printf("Server-side, key guessed right: %f usec\n",
  133. NANOCOUNT(start, end, iters)/1e3);
  134. start = perftime();
  135. for (i = 0; i < iters; ++i) {
  136. char key_out[CPATH_KEY_MATERIAL_LEN];
  137. onion_skin_TAP_server_handshake(os, key2, key, or,
  138. key_out, sizeof(key_out));
  139. }
  140. end = perftime();
  141. printf("Server-side, key guessed wrong: %f usec.\n",
  142. NANOCOUNT(start, end, iters)/1e3);
  143. start = perftime();
  144. for (i = 0; i < iters; ++i) {
  145. crypto_dh_t *dh;
  146. char key_out[CPATH_KEY_MATERIAL_LEN];
  147. int s;
  148. dh = crypto_dh_dup(dh_out);
  149. s = onion_skin_TAP_client_handshake(dh, or, key_out, sizeof(key_out),
  150. NULL);
  151. crypto_dh_free(dh);
  152. tor_assert(s == 0);
  153. }
  154. end = perftime();
  155. printf("Client-side, part 2: %f usec.\n",
  156. NANOCOUNT(start, end, iters)/1e3);
  157. done:
  158. crypto_dh_free(dh_out);
  159. crypto_pk_free(key);
  160. crypto_pk_free(key2);
  161. }
  162. static void
  163. bench_onion_ntor_impl(void)
  164. {
  165. const int iters = 1<<10;
  166. int i;
  167. curve25519_keypair_t keypair1, keypair2;
  168. uint64_t start, end;
  169. uint8_t os[NTOR_ONIONSKIN_LEN];
  170. uint8_t or[NTOR_REPLY_LEN];
  171. ntor_handshake_state_t *state = NULL;
  172. uint8_t nodeid[DIGEST_LEN];
  173. di_digest256_map_t *keymap = NULL;
  174. curve25519_secret_key_generate(&keypair1.seckey, 0);
  175. curve25519_public_key_generate(&keypair1.pubkey, &keypair1.seckey);
  176. curve25519_secret_key_generate(&keypair2.seckey, 0);
  177. curve25519_public_key_generate(&keypair2.pubkey, &keypair2.seckey);
  178. dimap_add_entry(&keymap, keypair1.pubkey.public_key, &keypair1);
  179. dimap_add_entry(&keymap, keypair2.pubkey.public_key, &keypair2);
  180. reset_perftime();
  181. start = perftime();
  182. for (i = 0; i < iters; ++i) {
  183. onion_skin_ntor_create(nodeid, &keypair1.pubkey, &state, os);
  184. ntor_handshake_state_free(state);
  185. state = NULL;
  186. }
  187. end = perftime();
  188. printf("Client-side, part 1: %f usec.\n", NANOCOUNT(start, end, iters)/1e3);
  189. state = NULL;
  190. onion_skin_ntor_create(nodeid, &keypair1.pubkey, &state, os);
  191. start = perftime();
  192. for (i = 0; i < iters; ++i) {
  193. uint8_t key_out[CPATH_KEY_MATERIAL_LEN];
  194. onion_skin_ntor_server_handshake(os, keymap, NULL, nodeid, or,
  195. key_out, sizeof(key_out));
  196. }
  197. end = perftime();
  198. printf("Server-side: %f usec\n",
  199. NANOCOUNT(start, end, iters)/1e3);
  200. start = perftime();
  201. for (i = 0; i < iters; ++i) {
  202. uint8_t key_out[CPATH_KEY_MATERIAL_LEN];
  203. int s;
  204. s = onion_skin_ntor_client_handshake(state, or, key_out, sizeof(key_out),
  205. NULL);
  206. tor_assert(s == 0);
  207. }
  208. end = perftime();
  209. printf("Client-side, part 2: %f usec.\n",
  210. NANOCOUNT(start, end, iters)/1e3);
  211. ntor_handshake_state_free(state);
  212. dimap_free(keymap, NULL);
  213. }
  214. static void
  215. bench_onion_ntor(void)
  216. {
  217. int ed;
  218. for (ed = 0; ed <= 1; ++ed) {
  219. printf("Ed25519-based basepoint multiply = %s.\n",
  220. (ed == 0) ? "disabled" : "enabled");
  221. curve25519_set_impl_params(ed);
  222. bench_onion_ntor_impl();
  223. }
  224. }
  225. static void
  226. bench_ed25519_impl(void)
  227. {
  228. uint64_t start, end;
  229. const int iters = 1<<12;
  230. int i;
  231. const uint8_t msg[] = "but leaving, could not tell what they had heard";
  232. ed25519_signature_t sig;
  233. ed25519_keypair_t kp;
  234. curve25519_keypair_t curve_kp;
  235. ed25519_public_key_t pubkey_tmp;
  236. ed25519_secret_key_generate(&kp.seckey, 0);
  237. start = perftime();
  238. for (i = 0; i < iters; ++i) {
  239. ed25519_public_key_generate(&kp.pubkey, &kp.seckey);
  240. }
  241. end = perftime();
  242. printf("Generate public key: %.2f usec\n",
  243. MICROCOUNT(start, end, iters));
  244. start = perftime();
  245. for (i = 0; i < iters; ++i) {
  246. ed25519_sign(&sig, msg, sizeof(msg), &kp);
  247. }
  248. end = perftime();
  249. printf("Sign a short message: %.2f usec\n",
  250. MICROCOUNT(start, end, iters));
  251. start = perftime();
  252. for (i = 0; i < iters; ++i) {
  253. ed25519_checksig(&sig, msg, sizeof(msg), &kp.pubkey);
  254. }
  255. end = perftime();
  256. printf("Verify signature: %.2f usec\n",
  257. MICROCOUNT(start, end, iters));
  258. curve25519_keypair_generate(&curve_kp, 0);
  259. start = perftime();
  260. for (i = 0; i < iters; ++i) {
  261. ed25519_public_key_from_curve25519_public_key(&pubkey_tmp,
  262. &curve_kp.pubkey, 1);
  263. }
  264. end = perftime();
  265. printf("Convert public point from curve25519: %.2f usec\n",
  266. MICROCOUNT(start, end, iters));
  267. curve25519_keypair_generate(&curve_kp, 0);
  268. start = perftime();
  269. for (i = 0; i < iters; ++i) {
  270. ed25519_public_blind(&pubkey_tmp, &kp.pubkey, msg);
  271. }
  272. end = perftime();
  273. printf("Blind a public key: %.2f usec\n",
  274. MICROCOUNT(start, end, iters));
  275. }
  276. static void
  277. bench_ed25519(void)
  278. {
  279. int donna;
  280. for (donna = 0; donna <= 1; ++donna) {
  281. printf("Ed25519-donna = %s.\n",
  282. (donna == 0) ? "disabled" : "enabled");
  283. ed25519_set_impl_params(donna);
  284. bench_ed25519_impl();
  285. }
  286. }
  287. static void
  288. bench_cell_aes(void)
  289. {
  290. uint64_t start, end;
  291. const int len = 509;
  292. const int iters = (1<<16);
  293. const int max_misalign = 15;
  294. char *b = tor_malloc(len+max_misalign);
  295. crypto_cipher_t *c;
  296. int i, misalign;
  297. char key[CIPHER_KEY_LEN];
  298. crypto_rand(key, sizeof(key));
  299. c = crypto_cipher_new(key);
  300. reset_perftime();
  301. for (misalign = 0; misalign <= max_misalign; ++misalign) {
  302. start = perftime();
  303. for (i = 0; i < iters; ++i) {
  304. crypto_cipher_crypt_inplace(c, b+misalign, len);
  305. }
  306. end = perftime();
  307. printf("%d bytes, misaligned by %d: %.2f nsec per byte\n", len, misalign,
  308. NANOCOUNT(start, end, iters*len));
  309. }
  310. crypto_cipher_free(c);
  311. tor_free(b);
  312. }
  313. /** Run digestmap_t performance benchmarks. */
  314. static void
  315. bench_dmap(void)
  316. {
  317. smartlist_t *sl = smartlist_new();
  318. smartlist_t *sl2 = smartlist_new();
  319. uint64_t start, end, pt2, pt3, pt4;
  320. int iters = 8192;
  321. const int elts = 4000;
  322. const int fpostests = 100000;
  323. char d[20];
  324. int i,n=0, fp = 0;
  325. digestmap_t *dm = digestmap_new();
  326. digestset_t *ds = digestset_new(elts);
  327. for (i = 0; i < elts; ++i) {
  328. crypto_rand(d, 20);
  329. smartlist_add(sl, tor_memdup(d, 20));
  330. }
  331. for (i = 0; i < elts; ++i) {
  332. crypto_rand(d, 20);
  333. smartlist_add(sl2, tor_memdup(d, 20));
  334. }
  335. printf("nbits=%d\n", ds->mask+1);
  336. reset_perftime();
  337. start = perftime();
  338. for (i = 0; i < iters; ++i) {
  339. SMARTLIST_FOREACH(sl, const char *, cp, digestmap_set(dm, cp, (void*)1));
  340. }
  341. pt2 = perftime();
  342. printf("digestmap_set: %.2f ns per element\n",
  343. NANOCOUNT(start, pt2, iters*elts));
  344. for (i = 0; i < iters; ++i) {
  345. SMARTLIST_FOREACH(sl, const char *, cp, digestmap_get(dm, cp));
  346. SMARTLIST_FOREACH(sl2, const char *, cp, digestmap_get(dm, cp));
  347. }
  348. pt3 = perftime();
  349. printf("digestmap_get: %.2f ns per element\n",
  350. NANOCOUNT(pt2, pt3, iters*elts*2));
  351. for (i = 0; i < iters; ++i) {
  352. SMARTLIST_FOREACH(sl, const char *, cp, digestset_add(ds, cp));
  353. }
  354. pt4 = perftime();
  355. printf("digestset_add: %.2f ns per element\n",
  356. NANOCOUNT(pt3, pt4, iters*elts));
  357. for (i = 0; i < iters; ++i) {
  358. SMARTLIST_FOREACH(sl, const char *, cp, n += digestset_contains(ds, cp));
  359. SMARTLIST_FOREACH(sl2, const char *, cp, n += digestset_contains(ds, cp));
  360. }
  361. end = perftime();
  362. printf("digestset_contains: %.2f ns per element.\n",
  363. NANOCOUNT(pt4, end, iters*elts*2));
  364. /* We need to use this, or else the whole loop gets optimized out. */
  365. printf("Hits == %d\n", n);
  366. for (i = 0; i < fpostests; ++i) {
  367. crypto_rand(d, 20);
  368. if (digestset_contains(ds, d)) ++fp;
  369. }
  370. printf("False positive rate on digestset: %.2f%%\n",
  371. (fp/(double)fpostests)*100);
  372. digestmap_free(dm, NULL);
  373. digestset_free(ds);
  374. SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
  375. SMARTLIST_FOREACH(sl2, char *, cp, tor_free(cp));
  376. smartlist_free(sl);
  377. smartlist_free(sl2);
  378. }
  379. static void
  380. bench_siphash(void)
  381. {
  382. char buf[128];
  383. int lens[] = { 7, 8, 15, 16, 20, 32, 111, 128, -1 };
  384. int i, j;
  385. uint64_t start, end;
  386. const int N = 300000;
  387. crypto_rand(buf, sizeof(buf));
  388. for (i = 0; lens[i] > 0; ++i) {
  389. reset_perftime();
  390. start = perftime();
  391. for (j = 0; j < N; ++j) {
  392. siphash24g(buf, lens[i]);
  393. }
  394. end = perftime();
  395. printf("siphash24g(%d): %.2f ns per call\n",
  396. lens[i], NANOCOUNT(start,end,N));
  397. }
  398. }
  399. static void
  400. bench_digest(void)
  401. {
  402. char buf[8192];
  403. char out[DIGEST512_LEN];
  404. const int lens[] = { 1, 16, 32, 64, 128, 512, 1024, 2048, -1 };
  405. const int N = 300000;
  406. uint64_t start, end;
  407. crypto_rand(buf, sizeof(buf));
  408. for (int alg = 0; alg < N_DIGEST_ALGORITHMS; alg++) {
  409. for (int i = 0; lens[i] > 0; ++i) {
  410. reset_perftime();
  411. start = perftime();
  412. for (int j = 0; j < N; ++j) {
  413. switch (alg) {
  414. case DIGEST_SHA1:
  415. crypto_digest(out, buf, lens[i]);
  416. break;
  417. case DIGEST_SHA256:
  418. case DIGEST_SHA3_256:
  419. crypto_digest256(out, buf, lens[i], alg);
  420. break;
  421. case DIGEST_SHA512:
  422. case DIGEST_SHA3_512:
  423. crypto_digest512(out, buf, lens[i], alg);
  424. break;
  425. default:
  426. tor_assert(0);
  427. }
  428. }
  429. end = perftime();
  430. printf("%s(%d): %.2f ns per call\n",
  431. crypto_digest_algorithm_get_name(alg),
  432. lens[i], NANOCOUNT(start,end,N));
  433. }
  434. }
  435. }
  436. static void
  437. bench_cell_ops(void)
  438. {
  439. const int iters = 1<<16;
  440. int i;
  441. /* benchmarks for cell ops at relay. */
  442. or_circuit_t *or_circ = tor_malloc_zero(sizeof(or_circuit_t));
  443. cell_t *cell = tor_malloc(sizeof(cell_t));
  444. int outbound;
  445. uint64_t start, end;
  446. crypto_rand((char*)cell->payload, sizeof(cell->payload));
  447. /* Mock-up or_circuit_t */
  448. or_circ->base_.magic = OR_CIRCUIT_MAGIC;
  449. or_circ->base_.purpose = CIRCUIT_PURPOSE_OR;
  450. /* Initialize crypto */
  451. char key1[CIPHER_KEY_LEN], key2[CIPHER_KEY_LEN];
  452. crypto_rand(key1, sizeof(key1));
  453. crypto_rand(key2, sizeof(key2));
  454. or_circ->p_crypto = crypto_cipher_new(key1);
  455. or_circ->n_crypto = crypto_cipher_new(key2);
  456. or_circ->p_digest = crypto_digest_new();
  457. or_circ->n_digest = crypto_digest_new();
  458. reset_perftime();
  459. for (outbound = 0; outbound <= 1; ++outbound) {
  460. cell_direction_t d = outbound ? CELL_DIRECTION_OUT : CELL_DIRECTION_IN;
  461. start = perftime();
  462. for (i = 0; i < iters; ++i) {
  463. char recognized = 0;
  464. crypt_path_t *layer_hint = NULL;
  465. relay_crypt(TO_CIRCUIT(or_circ), cell, d, &layer_hint, &recognized);
  466. }
  467. end = perftime();
  468. printf("%sbound cells: %.2f ns per cell. (%.2f ns per byte of payload)\n",
  469. outbound?"Out":" In",
  470. NANOCOUNT(start,end,iters),
  471. NANOCOUNT(start,end,iters*CELL_PAYLOAD_SIZE));
  472. }
  473. crypto_digest_free(or_circ->p_digest);
  474. crypto_digest_free(or_circ->n_digest);
  475. crypto_cipher_free(or_circ->p_crypto);
  476. crypto_cipher_free(or_circ->n_crypto);
  477. tor_free(or_circ);
  478. tor_free(cell);
  479. }
  480. static void
  481. bench_dh(void)
  482. {
  483. const int iters = 1<<10;
  484. int i;
  485. uint64_t start, end;
  486. reset_perftime();
  487. start = perftime();
  488. for (i = 0; i < iters; ++i) {
  489. char dh_pubkey_a[DH_BYTES], dh_pubkey_b[DH_BYTES];
  490. char secret_a[DH_BYTES], secret_b[DH_BYTES];
  491. ssize_t slen_a, slen_b;
  492. crypto_dh_t *dh_a = crypto_dh_new(DH_TYPE_TLS);
  493. crypto_dh_t *dh_b = crypto_dh_new(DH_TYPE_TLS);
  494. crypto_dh_generate_public(dh_a);
  495. crypto_dh_generate_public(dh_b);
  496. crypto_dh_get_public(dh_a, dh_pubkey_a, sizeof(dh_pubkey_a));
  497. crypto_dh_get_public(dh_b, dh_pubkey_b, sizeof(dh_pubkey_b));
  498. slen_a = crypto_dh_compute_secret(LOG_NOTICE,
  499. dh_a, dh_pubkey_b, sizeof(dh_pubkey_b),
  500. secret_a, sizeof(secret_a));
  501. slen_b = crypto_dh_compute_secret(LOG_NOTICE,
  502. dh_b, dh_pubkey_a, sizeof(dh_pubkey_a),
  503. secret_b, sizeof(secret_b));
  504. tor_assert(slen_a == slen_b);
  505. tor_assert(fast_memeq(secret_a, secret_b, slen_a));
  506. crypto_dh_free(dh_a);
  507. crypto_dh_free(dh_b);
  508. }
  509. end = perftime();
  510. printf("Complete DH handshakes (1024 bit, public and private ops):\n"
  511. " %f millisec each.\n", NANOCOUNT(start, end, iters)/1e6);
  512. }
  513. static void
  514. bench_ecdh_impl(int nid, const char *name)
  515. {
  516. const int iters = 1<<10;
  517. int i;
  518. uint64_t start, end;
  519. reset_perftime();
  520. start = perftime();
  521. for (i = 0; i < iters; ++i) {
  522. char secret_a[DH_BYTES], secret_b[DH_BYTES];
  523. ssize_t slen_a, slen_b;
  524. EC_KEY *dh_a = EC_KEY_new_by_curve_name(nid);
  525. EC_KEY *dh_b = EC_KEY_new_by_curve_name(nid);
  526. if (!dh_a || !dh_b) {
  527. puts("Skipping. (No implementation?)");
  528. return;
  529. }
  530. EC_KEY_generate_key(dh_a);
  531. EC_KEY_generate_key(dh_b);
  532. slen_a = ECDH_compute_key(secret_a, DH_BYTES,
  533. EC_KEY_get0_public_key(dh_b), dh_a,
  534. NULL);
  535. slen_b = ECDH_compute_key(secret_b, DH_BYTES,
  536. EC_KEY_get0_public_key(dh_a), dh_b,
  537. NULL);
  538. tor_assert(slen_a == slen_b);
  539. tor_assert(fast_memeq(secret_a, secret_b, slen_a));
  540. EC_KEY_free(dh_a);
  541. EC_KEY_free(dh_b);
  542. }
  543. end = perftime();
  544. printf("Complete ECDH %s handshakes (2 public and 2 private ops):\n"
  545. " %f millisec each.\n", name, NANOCOUNT(start, end, iters)/1e6);
  546. }
  547. static void
  548. bench_ecdh_p256(void)
  549. {
  550. bench_ecdh_impl(NID_X9_62_prime256v1, "P-256");
  551. }
  552. static void
  553. bench_ecdh_p224(void)
  554. {
  555. bench_ecdh_impl(NID_secp224r1, "P-224");
  556. }
  557. typedef void (*bench_fn)(void);
  558. typedef struct benchmark_t {
  559. const char *name;
  560. bench_fn fn;
  561. int enabled;
  562. } benchmark_t;
  563. #define ENT(s) { #s , bench_##s, 0 }
  564. static struct benchmark_t benchmarks[] = {
  565. ENT(dmap),
  566. ENT(siphash),
  567. ENT(digest),
  568. ENT(aes),
  569. ENT(onion_TAP),
  570. ENT(onion_ntor),
  571. ENT(ed25519),
  572. ENT(cell_aes),
  573. ENT(cell_ops),
  574. ENT(dh),
  575. ENT(ecdh_p256),
  576. ENT(ecdh_p224),
  577. {NULL,NULL,0}
  578. };
  579. static benchmark_t *
  580. find_benchmark(const char *name)
  581. {
  582. benchmark_t *b;
  583. for (b = benchmarks; b->name; ++b) {
  584. if (!strcmp(name, b->name)) {
  585. return b;
  586. }
  587. }
  588. return NULL;
  589. }
  590. /** Main entry point for benchmark code: parse the command line, and run
  591. * some benchmarks. */
  592. int
  593. main(int argc, const char **argv)
  594. {
  595. int i;
  596. int list=0, n_enabled=0;
  597. char *errmsg;
  598. or_options_t *options;
  599. tor_threads_init();
  600. for (i = 1; i < argc; ++i) {
  601. if (!strcmp(argv[i], "--list")) {
  602. list = 1;
  603. } else {
  604. benchmark_t *benchmark = find_benchmark(argv[i]);
  605. ++n_enabled;
  606. if (benchmark) {
  607. benchmark->enabled = 1;
  608. } else {
  609. printf("No such benchmark as %s\n", argv[i]);
  610. }
  611. }
  612. }
  613. reset_perftime();
  614. if (crypto_seed_rng() < 0) {
  615. printf("Couldn't seed RNG; exiting.\n");
  616. return 1;
  617. }
  618. crypto_init_siphash_key();
  619. options = options_new();
  620. init_logging(1);
  621. options->command = CMD_RUN_UNITTESTS;
  622. options->DataDirectory = tor_strdup("");
  623. options_init(options);
  624. if (set_options(options, &errmsg) < 0) {
  625. printf("Failed to set initial options: %s\n", errmsg);
  626. tor_free(errmsg);
  627. return 1;
  628. }
  629. for (benchmark_t *b = benchmarks; b->name; ++b) {
  630. if (b->enabled || n_enabled == 0) {
  631. printf("===== %s =====\n", b->name);
  632. if (!list)
  633. b->fn();
  634. }
  635. }
  636. return 0;
  637. }