test.c 33 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928
  1. /* Copyright (c) 2001-2004, Roger Dingledine.
  2. * Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
  3. * Copyright (c) 2007-2018, The Tor Project, Inc. */
  4. /* See LICENSE for licensing information */
  5. /**
  6. * \file test.c
  7. * \brief Unit tests for many pieces of the lower level Tor modules.
  8. **/
  9. #include "orconfig.h"
  10. #include "lib/crypt_ops/crypto_dh.h"
  11. #include "lib/crypt_ops/crypto_rand.h"
  12. #include "app/config/or_state_st.h"
  13. #include <stdio.h>
  14. #ifdef HAVE_FCNTL_H
  15. #include <fcntl.h>
  16. #endif
  17. #ifdef _WIN32
  18. /* For mkdir() */
  19. #include <direct.h>
  20. #else
  21. #include <dirent.h>
  22. #endif /* defined(_WIN32) */
  23. /* These macros pull in declarations for some functions and structures that
  24. * are typically file-private. */
  25. #define ROUTER_PRIVATE
  26. #define CIRCUITSTATS_PRIVATE
  27. #define CIRCUITLIST_PRIVATE
  28. #define MAIN_PRIVATE
  29. #define STATEFILE_PRIVATE
  30. /*
  31. * Linux doesn't provide lround in math.h by default, but mac os does...
  32. * It's best just to leave math.h out of the picture entirely.
  33. */
  34. //#include <math.h>
  35. long int lround(double x);
  36. double fabs(double x);
  37. #include "core/or/or.h"
  38. #include "lib/err/backtrace.h"
  39. #include "lib/container/buffers.h"
  40. #include "core/or/circuitlist.h"
  41. #include "core/or/circuitstats.h"
  42. #include "lib/compress/compress.h"
  43. #include "app/config/config.h"
  44. #include "core/or/connection_edge.h"
  45. #include "feature/rend/rendcommon.h"
  46. #include "feature/rend/rendcache.h"
  47. #include "test/test.h"
  48. #include "core/mainloop/main.h"
  49. #include "lib/memarea/memarea.h"
  50. #include "core/crypto/onion.h"
  51. #include "core/crypto/onion_ntor.h"
  52. #include "core/crypto/onion_fast.h"
  53. #include "core/crypto/onion_tap.h"
  54. #include "core/or/policies.h"
  55. #include "feature/stats/rephist.h"
  56. #include "feature/nodelist/routerparse.h"
  57. #include "app/config/statefile.h"
  58. #include "lib/crypt_ops/crypto_curve25519.h"
  59. #include "core/or/extend_info_st.h"
  60. #include "core/or/or_circuit_st.h"
  61. #include "feature/rend/rend_encoded_v2_service_descriptor_st.h"
  62. #include "feature/rend/rend_intro_point_st.h"
  63. #include "feature/rend/rend_service_descriptor_st.h"
  64. /** Run unit tests for the onion handshake code. */
  65. static void
  66. test_onion_handshake(void *arg)
  67. {
  68. /* client-side */
  69. crypto_dh_t *c_dh = NULL;
  70. char c_buf[TAP_ONIONSKIN_CHALLENGE_LEN];
  71. char c_keys[40];
  72. /* server-side */
  73. char s_buf[TAP_ONIONSKIN_REPLY_LEN];
  74. char s_keys[40];
  75. int i;
  76. /* shared */
  77. crypto_pk_t *pk = NULL, *pk2 = NULL;
  78. (void)arg;
  79. pk = pk_generate(0);
  80. pk2 = pk_generate(1);
  81. /* client handshake 1. */
  82. memset(c_buf, 0, TAP_ONIONSKIN_CHALLENGE_LEN);
  83. tt_assert(! onion_skin_TAP_create(pk, &c_dh, c_buf));
  84. for (i = 1; i <= 3; ++i) {
  85. crypto_pk_t *k1, *k2;
  86. if (i==1) {
  87. /* server handshake: only one key known. */
  88. k1 = pk; k2 = NULL;
  89. } else if (i==2) {
  90. /* server handshake: try the right key first. */
  91. k1 = pk; k2 = pk2;
  92. } else {
  93. /* server handshake: try the right key second. */
  94. k1 = pk2; k2 = pk;
  95. }
  96. memset(s_buf, 0, TAP_ONIONSKIN_REPLY_LEN);
  97. memset(s_keys, 0, 40);
  98. tt_assert(! onion_skin_TAP_server_handshake(c_buf, k1, k2,
  99. s_buf, s_keys, 40));
  100. /* client handshake 2 */
  101. memset(c_keys, 0, 40);
  102. tt_assert(! onion_skin_TAP_client_handshake(c_dh, s_buf, c_keys,
  103. 40, NULL));
  104. tt_mem_op(c_keys,OP_EQ, s_keys, 40);
  105. memset(s_buf, 0, 40);
  106. tt_mem_op(c_keys,OP_NE, s_buf, 40);
  107. }
  108. done:
  109. crypto_dh_free(c_dh);
  110. crypto_pk_free(pk);
  111. crypto_pk_free(pk2);
  112. }
  113. static void
  114. test_bad_onion_handshake(void *arg)
  115. {
  116. char junk_buf[TAP_ONIONSKIN_CHALLENGE_LEN];
  117. char junk_buf2[TAP_ONIONSKIN_CHALLENGE_LEN];
  118. /* client-side */
  119. crypto_dh_t *c_dh = NULL;
  120. char c_buf[TAP_ONIONSKIN_CHALLENGE_LEN];
  121. char c_keys[40];
  122. /* server-side */
  123. char s_buf[TAP_ONIONSKIN_REPLY_LEN];
  124. char s_keys[40];
  125. /* shared */
  126. crypto_pk_t *pk = NULL, *pk2 = NULL;
  127. (void)arg;
  128. pk = pk_generate(0);
  129. pk2 = pk_generate(1);
  130. /* Server: Case 1: the encrypted data is degenerate. */
  131. memset(junk_buf, 0, sizeof(junk_buf));
  132. crypto_pk_obsolete_public_hybrid_encrypt(pk,
  133. junk_buf2, TAP_ONIONSKIN_CHALLENGE_LEN,
  134. junk_buf, DH1024_KEY_LEN,
  135. PK_PKCS1_OAEP_PADDING, 1);
  136. tt_int_op(-1, OP_EQ,
  137. onion_skin_TAP_server_handshake(junk_buf2, pk, NULL,
  138. s_buf, s_keys, 40));
  139. /* Server: Case 2: the encrypted data is not long enough. */
  140. memset(junk_buf, 0, sizeof(junk_buf));
  141. memset(junk_buf2, 0, sizeof(junk_buf2));
  142. crypto_pk_public_encrypt(pk, junk_buf2, sizeof(junk_buf2),
  143. junk_buf, 48, PK_PKCS1_OAEP_PADDING);
  144. tt_int_op(-1, OP_EQ,
  145. onion_skin_TAP_server_handshake(junk_buf2, pk, NULL,
  146. s_buf, s_keys, 40));
  147. /* client handshake 1: do it straight. */
  148. memset(c_buf, 0, TAP_ONIONSKIN_CHALLENGE_LEN);
  149. tt_assert(! onion_skin_TAP_create(pk, &c_dh, c_buf));
  150. /* Server: Case 3: we just don't have the right key. */
  151. tt_int_op(-1, OP_EQ,
  152. onion_skin_TAP_server_handshake(c_buf, pk2, NULL,
  153. s_buf, s_keys, 40));
  154. /* Server: Case 4: The RSA-encrypted portion is corrupt. */
  155. c_buf[64] ^= 33;
  156. tt_int_op(-1, OP_EQ,
  157. onion_skin_TAP_server_handshake(c_buf, pk, NULL,
  158. s_buf, s_keys, 40));
  159. c_buf[64] ^= 33;
  160. /* (Let the server proceed) */
  161. tt_int_op(0, OP_EQ,
  162. onion_skin_TAP_server_handshake(c_buf, pk, NULL,
  163. s_buf, s_keys, 40));
  164. /* Client: Case 1: The server sent back junk. */
  165. const char *msg = NULL;
  166. s_buf[64] ^= 33;
  167. tt_int_op(-1, OP_EQ,
  168. onion_skin_TAP_client_handshake(c_dh, s_buf, c_keys, 40, &msg));
  169. s_buf[64] ^= 33;
  170. tt_str_op(msg, OP_EQ, "Digest DOES NOT MATCH on onion handshake. "
  171. "Bug or attack.");
  172. /* Let the client finish; make sure it can. */
  173. msg = NULL;
  174. tt_int_op(0, OP_EQ,
  175. onion_skin_TAP_client_handshake(c_dh, s_buf, c_keys, 40, &msg));
  176. tt_mem_op(s_keys,OP_EQ, c_keys, 40);
  177. tt_ptr_op(msg, OP_EQ, NULL);
  178. /* Client: Case 2: The server sent back a degenerate DH. */
  179. memset(s_buf, 0, sizeof(s_buf));
  180. tt_int_op(-1, OP_EQ,
  181. onion_skin_TAP_client_handshake(c_dh, s_buf, c_keys, 40, &msg));
  182. tt_str_op(msg, OP_EQ, "DH computation failed.");
  183. done:
  184. crypto_dh_free(c_dh);
  185. crypto_pk_free(pk);
  186. crypto_pk_free(pk2);
  187. }
  188. static void
  189. test_ntor_handshake(void *arg)
  190. {
  191. /* client-side */
  192. ntor_handshake_state_t *c_state = NULL;
  193. uint8_t c_buf[NTOR_ONIONSKIN_LEN];
  194. uint8_t c_keys[400];
  195. /* server-side */
  196. di_digest256_map_t *s_keymap=NULL;
  197. curve25519_keypair_t s_keypair;
  198. uint8_t s_buf[NTOR_REPLY_LEN];
  199. uint8_t s_keys[400];
  200. /* shared */
  201. const curve25519_public_key_t *server_pubkey;
  202. uint8_t node_id[20] = "abcdefghijklmnopqrst";
  203. (void) arg;
  204. /* Make the server some keys */
  205. curve25519_secret_key_generate(&s_keypair.seckey, 0);
  206. curve25519_public_key_generate(&s_keypair.pubkey, &s_keypair.seckey);
  207. dimap_add_entry(&s_keymap, s_keypair.pubkey.public_key, &s_keypair);
  208. server_pubkey = &s_keypair.pubkey;
  209. /* client handshake 1. */
  210. memset(c_buf, 0, NTOR_ONIONSKIN_LEN);
  211. tt_int_op(0, OP_EQ, onion_skin_ntor_create(node_id, server_pubkey,
  212. &c_state, c_buf));
  213. /* server handshake */
  214. memset(s_buf, 0, NTOR_REPLY_LEN);
  215. memset(s_keys, 0, 40);
  216. tt_int_op(0, OP_EQ, onion_skin_ntor_server_handshake(c_buf, s_keymap, NULL,
  217. node_id,
  218. s_buf, s_keys, 400));
  219. /* client handshake 2 */
  220. memset(c_keys, 0, 40);
  221. tt_int_op(0, OP_EQ, onion_skin_ntor_client_handshake(c_state, s_buf,
  222. c_keys, 400, NULL));
  223. tt_mem_op(c_keys,OP_EQ, s_keys, 400);
  224. memset(s_buf, 0, 40);
  225. tt_mem_op(c_keys,OP_NE, s_buf, 40);
  226. /* Now try with a bogus server response. Zero input should trigger
  227. * All The Problems. */
  228. memset(c_keys, 0, 400);
  229. memset(s_buf, 0, NTOR_REPLY_LEN);
  230. const char *msg = NULL;
  231. tt_int_op(-1, OP_EQ, onion_skin_ntor_client_handshake(c_state, s_buf,
  232. c_keys, 400, &msg));
  233. tt_str_op(msg, OP_EQ, "Zero output from curve25519 handshake");
  234. done:
  235. ntor_handshake_state_free(c_state);
  236. dimap_free(s_keymap, NULL);
  237. }
  238. static void
  239. test_fast_handshake(void *arg)
  240. {
  241. /* tests for the obsolete "CREATE_FAST" handshake. */
  242. (void) arg;
  243. fast_handshake_state_t *state = NULL;
  244. uint8_t client_handshake[CREATE_FAST_LEN];
  245. uint8_t server_handshake[CREATED_FAST_LEN];
  246. uint8_t s_keys[100], c_keys[100];
  247. /* First, test an entire handshake. */
  248. memset(client_handshake, 0, sizeof(client_handshake));
  249. tt_int_op(0, OP_EQ, fast_onionskin_create(&state, client_handshake));
  250. tt_assert(! tor_mem_is_zero((char*)client_handshake,
  251. sizeof(client_handshake)));
  252. tt_int_op(0, OP_EQ,
  253. fast_server_handshake(client_handshake, server_handshake,
  254. s_keys, 100));
  255. const char *msg = NULL;
  256. tt_int_op(0, OP_EQ,
  257. fast_client_handshake(state, server_handshake, c_keys, 100, &msg));
  258. tt_ptr_op(msg, OP_EQ, NULL);
  259. tt_mem_op(s_keys, OP_EQ, c_keys, 100);
  260. /* Now test a failing handshake. */
  261. server_handshake[0] ^= 3;
  262. tt_int_op(-1, OP_EQ,
  263. fast_client_handshake(state, server_handshake, c_keys, 100, &msg));
  264. tt_str_op(msg, OP_EQ, "Digest DOES NOT MATCH on fast handshake. "
  265. "Bug or attack.");
  266. done:
  267. fast_handshake_state_free(state);
  268. }
  269. /** Run unit tests for the onion queues. */
  270. static void
  271. test_onion_queues(void *arg)
  272. {
  273. uint8_t buf1[TAP_ONIONSKIN_CHALLENGE_LEN] = {0};
  274. uint8_t buf2[NTOR_ONIONSKIN_LEN] = {0};
  275. or_circuit_t *circ1 = or_circuit_new(0, NULL);
  276. or_circuit_t *circ2 = or_circuit_new(0, NULL);
  277. create_cell_t *onionskin = NULL, *create2_ptr;
  278. create_cell_t *create1 = tor_malloc_zero(sizeof(create_cell_t));
  279. create_cell_t *create2 = tor_malloc_zero(sizeof(create_cell_t));
  280. (void)arg;
  281. create2_ptr = create2; /* remember, but do not free */
  282. create_cell_init(create1, CELL_CREATE, ONION_HANDSHAKE_TYPE_TAP,
  283. TAP_ONIONSKIN_CHALLENGE_LEN, buf1);
  284. create_cell_init(create2, CELL_CREATE, ONION_HANDSHAKE_TYPE_NTOR,
  285. NTOR_ONIONSKIN_LEN, buf2);
  286. tt_int_op(0,OP_EQ, onion_num_pending(ONION_HANDSHAKE_TYPE_TAP));
  287. tt_int_op(0,OP_EQ, onion_pending_add(circ1, create1));
  288. create1 = NULL;
  289. tt_int_op(1,OP_EQ, onion_num_pending(ONION_HANDSHAKE_TYPE_TAP));
  290. tt_int_op(0,OP_EQ, onion_num_pending(ONION_HANDSHAKE_TYPE_NTOR));
  291. tt_int_op(0,OP_EQ, onion_pending_add(circ2, create2));
  292. create2 = NULL;
  293. tt_int_op(1,OP_EQ, onion_num_pending(ONION_HANDSHAKE_TYPE_NTOR));
  294. tt_ptr_op(circ2,OP_EQ, onion_next_task(&onionskin));
  295. tt_int_op(1,OP_EQ, onion_num_pending(ONION_HANDSHAKE_TYPE_TAP));
  296. tt_int_op(0,OP_EQ, onion_num_pending(ONION_HANDSHAKE_TYPE_NTOR));
  297. tt_ptr_op(onionskin, OP_EQ, create2_ptr);
  298. clear_pending_onions();
  299. tt_int_op(0,OP_EQ, onion_num_pending(ONION_HANDSHAKE_TYPE_TAP));
  300. tt_int_op(0,OP_EQ, onion_num_pending(ONION_HANDSHAKE_TYPE_NTOR));
  301. done:
  302. circuit_free_(TO_CIRCUIT(circ1));
  303. circuit_free_(TO_CIRCUIT(circ2));
  304. tor_free(create1);
  305. tor_free(create2);
  306. tor_free(onionskin);
  307. }
  308. static crypto_cipher_t *crypto_rand_aes_cipher = NULL;
  309. // Mock replacement for crypto_rand: Generates bytes from a provided AES_CTR
  310. // cipher in <b>crypto_rand_aes_cipher</b>.
  311. static void
  312. crypto_rand_deterministic_aes(char *out, size_t n)
  313. {
  314. tor_assert(crypto_rand_aes_cipher);
  315. memset(out, 0, n);
  316. crypto_cipher_crypt_inplace(crypto_rand_aes_cipher, out, n);
  317. }
  318. static void
  319. test_circuit_timeout(void *arg)
  320. {
  321. /* Plan:
  322. * 1. Generate 1000 samples
  323. * 2. Estimate parameters
  324. * 3. If difference, repeat
  325. * 4. Save state
  326. * 5. load state
  327. * 6. Estimate parameters
  328. * 7. compare differences
  329. */
  330. circuit_build_times_t initial;
  331. circuit_build_times_t estimate;
  332. circuit_build_times_t final;
  333. double timeout1, timeout2;
  334. or_state_t *state=NULL;
  335. int i, runs;
  336. double close_ms;
  337. (void)arg;
  338. initialize_periodic_events();
  339. circuit_build_times_init(&initial);
  340. circuit_build_times_init(&estimate);
  341. circuit_build_times_init(&final);
  342. state = or_state_new();
  343. // Use a deterministic RNG here, or else we'll get nondeterministic
  344. // coverage in some of the circuitstats functions.
  345. MOCK(crypto_rand, crypto_rand_deterministic_aes);
  346. crypto_rand_aes_cipher = crypto_cipher_new("xyzzyplughplover");
  347. circuitbuild_running_unit_tests();
  348. #define timeout0 (build_time_t)(30*1000.0)
  349. initial.Xm = 3000;
  350. circuit_build_times_initial_alpha(&initial,
  351. CBT_DEFAULT_QUANTILE_CUTOFF/100.0,
  352. timeout0);
  353. close_ms = MAX(circuit_build_times_calculate_timeout(&initial,
  354. CBT_DEFAULT_CLOSE_QUANTILE/100.0),
  355. CBT_DEFAULT_TIMEOUT_INITIAL_VALUE);
  356. do {
  357. for (i=0; i < CBT_DEFAULT_MIN_CIRCUITS_TO_OBSERVE; i++) {
  358. build_time_t sample = circuit_build_times_generate_sample(&initial,0,1);
  359. if (sample > close_ms) {
  360. circuit_build_times_add_time(&estimate, CBT_BUILD_ABANDONED);
  361. } else {
  362. circuit_build_times_add_time(&estimate, sample);
  363. }
  364. }
  365. circuit_build_times_update_alpha(&estimate);
  366. timeout1 = circuit_build_times_calculate_timeout(&estimate,
  367. CBT_DEFAULT_QUANTILE_CUTOFF/100.0);
  368. circuit_build_times_set_timeout(&estimate);
  369. log_notice(LD_CIRC, "Timeout1 is %f, Xm is %d", timeout1, estimate.Xm);
  370. /* 2% error */
  371. } while (fabs(circuit_build_times_cdf(&initial, timeout0) -
  372. circuit_build_times_cdf(&initial, timeout1)) > 0.02);
  373. tt_int_op(estimate.total_build_times, OP_LE, CBT_NCIRCUITS_TO_OBSERVE);
  374. circuit_build_times_update_state(&estimate, state);
  375. circuit_build_times_free_timeouts(&final);
  376. tt_int_op(circuit_build_times_parse_state(&final, state), OP_EQ, 0);
  377. circuit_build_times_update_alpha(&final);
  378. timeout2 = circuit_build_times_calculate_timeout(&final,
  379. CBT_DEFAULT_QUANTILE_CUTOFF/100.0);
  380. circuit_build_times_set_timeout(&final);
  381. log_notice(LD_CIRC, "Timeout2 is %f, Xm is %d", timeout2, final.Xm);
  382. /* 5% here because some accuracy is lost due to histogram conversion */
  383. tt_assert(fabs(circuit_build_times_cdf(&initial, timeout0) -
  384. circuit_build_times_cdf(&initial, timeout2)) < 0.05);
  385. for (runs = 0; runs < 50; runs++) {
  386. int build_times_idx = 0;
  387. int total_build_times = 0;
  388. final.close_ms = final.timeout_ms = CBT_DEFAULT_TIMEOUT_INITIAL_VALUE;
  389. estimate.close_ms = estimate.timeout_ms
  390. = CBT_DEFAULT_TIMEOUT_INITIAL_VALUE;
  391. for (i = 0; i < CBT_DEFAULT_RECENT_CIRCUITS*2; i++) {
  392. circuit_build_times_network_circ_success(&estimate);
  393. circuit_build_times_add_time(&estimate,
  394. circuit_build_times_generate_sample(&estimate, 0,
  395. CBT_DEFAULT_QUANTILE_CUTOFF/100.0));
  396. circuit_build_times_network_circ_success(&estimate);
  397. circuit_build_times_add_time(&final,
  398. circuit_build_times_generate_sample(&final, 0,
  399. CBT_DEFAULT_QUANTILE_CUTOFF/100.0));
  400. }
  401. tt_assert(!circuit_build_times_network_check_changed(&estimate));
  402. tt_assert(!circuit_build_times_network_check_changed(&final));
  403. /* Reset liveness to be non-live */
  404. final.liveness.network_last_live = 0;
  405. estimate.liveness.network_last_live = 0;
  406. build_times_idx = estimate.build_times_idx;
  407. total_build_times = estimate.total_build_times;
  408. tt_assert(circuit_build_times_network_check_live(&estimate));
  409. tt_assert(circuit_build_times_network_check_live(&final));
  410. circuit_build_times_count_close(&estimate, 0,
  411. (time_t)(approx_time()-estimate.close_ms/1000.0-1));
  412. circuit_build_times_count_close(&final, 0,
  413. (time_t)(approx_time()-final.close_ms/1000.0-1));
  414. tt_assert(!circuit_build_times_network_check_live(&estimate));
  415. tt_assert(!circuit_build_times_network_check_live(&final));
  416. log_info(LD_CIRC, "idx: %d %d, tot: %d %d",
  417. build_times_idx, estimate.build_times_idx,
  418. total_build_times, estimate.total_build_times);
  419. /* Check rollback index. Should match top of loop. */
  420. tt_assert(build_times_idx == estimate.build_times_idx);
  421. // This can fail if estimate.total_build_times == 1000, because
  422. // in that case, rewind actually causes us to lose timeouts
  423. if (total_build_times != CBT_NCIRCUITS_TO_OBSERVE)
  424. tt_assert(total_build_times == estimate.total_build_times);
  425. /* Now simulate that the network has become live and we need
  426. * a change */
  427. circuit_build_times_network_is_live(&estimate);
  428. circuit_build_times_network_is_live(&final);
  429. for (i = 0; i < CBT_DEFAULT_MAX_RECENT_TIMEOUT_COUNT; i++) {
  430. circuit_build_times_count_timeout(&estimate, 1);
  431. if (i < CBT_DEFAULT_MAX_RECENT_TIMEOUT_COUNT-1) {
  432. circuit_build_times_count_timeout(&final, 1);
  433. }
  434. }
  435. tt_int_op(estimate.liveness.after_firsthop_idx, OP_EQ, 0);
  436. tt_assert(final.liveness.after_firsthop_idx ==
  437. CBT_DEFAULT_MAX_RECENT_TIMEOUT_COUNT-1);
  438. tt_assert(circuit_build_times_network_check_live(&estimate));
  439. tt_assert(circuit_build_times_network_check_live(&final));
  440. circuit_build_times_count_timeout(&final, 1);
  441. /* Ensure return value for degenerate cases are clamped correctly */
  442. initial.alpha = INT32_MAX;
  443. tt_assert(circuit_build_times_calculate_timeout(&initial, .99999999) <=
  444. INT32_MAX);
  445. initial.alpha = 0;
  446. tt_assert(circuit_build_times_calculate_timeout(&initial, .5) <=
  447. INT32_MAX);
  448. }
  449. done:
  450. circuit_build_times_free_timeouts(&initial);
  451. circuit_build_times_free_timeouts(&estimate);
  452. circuit_build_times_free_timeouts(&final);
  453. or_state_free(state);
  454. teardown_periodic_events();
  455. UNMOCK(crypto_rand);
  456. crypto_cipher_free(crypto_rand_aes_cipher);
  457. }
  458. /** Test encoding and parsing of rendezvous service descriptors. */
  459. static void
  460. test_rend_fns(void *arg)
  461. {
  462. rend_service_descriptor_t *generated = NULL, *parsed = NULL;
  463. char service_id[DIGEST_LEN];
  464. char service_id_base32[REND_SERVICE_ID_LEN_BASE32+1];
  465. const char *next_desc;
  466. smartlist_t *descs = smartlist_new();
  467. char computed_desc_id[DIGEST_LEN];
  468. char parsed_desc_id[DIGEST_LEN];
  469. crypto_pk_t *pk1 = NULL, *pk2 = NULL;
  470. time_t now;
  471. char *intro_points_encrypted = NULL;
  472. size_t intro_points_size;
  473. size_t encoded_size;
  474. int i;
  475. (void)arg;
  476. /* Initialize the service cache. */
  477. rend_cache_init();
  478. pk1 = pk_generate(0);
  479. pk2 = pk_generate(1);
  480. generated = tor_malloc_zero(sizeof(rend_service_descriptor_t));
  481. generated->pk = crypto_pk_dup_key(pk1);
  482. crypto_pk_get_digest(generated->pk, service_id);
  483. base32_encode(service_id_base32, REND_SERVICE_ID_LEN_BASE32+1,
  484. service_id, REND_SERVICE_ID_LEN);
  485. now = time(NULL);
  486. generated->timestamp = now;
  487. generated->version = 2;
  488. generated->protocols = 42;
  489. generated->intro_nodes = smartlist_new();
  490. for (i = 0; i < 3; i++) {
  491. rend_intro_point_t *intro = tor_malloc_zero(sizeof(rend_intro_point_t));
  492. crypto_pk_t *okey = pk_generate(2 + i);
  493. intro->extend_info = tor_malloc_zero(sizeof(extend_info_t));
  494. intro->extend_info->onion_key = okey;
  495. crypto_pk_get_digest(intro->extend_info->onion_key,
  496. intro->extend_info->identity_digest);
  497. //crypto_rand(info->identity_digest, DIGEST_LEN); /* Would this work? */
  498. intro->extend_info->nickname[0] = '$';
  499. base16_encode(intro->extend_info->nickname + 1,
  500. sizeof(intro->extend_info->nickname) - 1,
  501. intro->extend_info->identity_digest, DIGEST_LEN);
  502. /* Does not cover all IP addresses. */
  503. tor_addr_from_ipv4h(&intro->extend_info->addr, crypto_rand_int(65536));
  504. intro->extend_info->port = 1 + crypto_rand_int(65535);
  505. intro->intro_key = crypto_pk_dup_key(pk2);
  506. smartlist_add(generated->intro_nodes, intro);
  507. }
  508. int rv = rend_encode_v2_descriptors(descs, generated, now, 0,
  509. REND_NO_AUTH, NULL, NULL);
  510. tt_int_op(rv, OP_GT, 0);
  511. rv = rend_compute_v2_desc_id(computed_desc_id, service_id_base32, NULL,
  512. now, 0);
  513. tt_int_op(rv, OP_EQ, 0);
  514. tt_mem_op(((rend_encoded_v2_service_descriptor_t *)
  515. smartlist_get(descs, 0))->desc_id, OP_EQ,
  516. computed_desc_id, DIGEST_LEN);
  517. rv = rend_parse_v2_service_descriptor(&parsed, parsed_desc_id,
  518. &intro_points_encrypted, &intro_points_size, &encoded_size,
  519. &next_desc,
  520. ((rend_encoded_v2_service_descriptor_t *)smartlist_get(descs, 0))
  521. ->desc_str, 1);
  522. tt_int_op(rv, OP_EQ, 0);
  523. tt_assert(parsed);
  524. tt_mem_op(((rend_encoded_v2_service_descriptor_t *)
  525. smartlist_get(descs, 0))->desc_id,OP_EQ, parsed_desc_id, DIGEST_LEN);
  526. tt_int_op(rend_parse_introduction_points(parsed, intro_points_encrypted,
  527. intro_points_size),OP_EQ, 3);
  528. tt_assert(!crypto_pk_cmp_keys(generated->pk, parsed->pk));
  529. tt_int_op(parsed->timestamp,OP_EQ, now);
  530. tt_int_op(parsed->version,OP_EQ, 2);
  531. tt_int_op(parsed->protocols,OP_EQ, 42);
  532. tt_int_op(smartlist_len(parsed->intro_nodes),OP_EQ, 3);
  533. for (i = 0; i < smartlist_len(parsed->intro_nodes); i++) {
  534. rend_intro_point_t *par_intro = smartlist_get(parsed->intro_nodes, i),
  535. *gen_intro = smartlist_get(generated->intro_nodes, i);
  536. extend_info_t *par_info = par_intro->extend_info;
  537. extend_info_t *gen_info = gen_intro->extend_info;
  538. tt_assert(!crypto_pk_cmp_keys(gen_info->onion_key, par_info->onion_key));
  539. tt_mem_op(gen_info->identity_digest,OP_EQ, par_info->identity_digest,
  540. DIGEST_LEN);
  541. tt_str_op(gen_info->nickname,OP_EQ, par_info->nickname);
  542. tt_assert(tor_addr_eq(&gen_info->addr, &par_info->addr));
  543. tt_int_op(gen_info->port,OP_EQ, par_info->port);
  544. }
  545. rend_service_descriptor_free(parsed);
  546. rend_service_descriptor_free(generated);
  547. parsed = generated = NULL;
  548. done:
  549. if (descs) {
  550. for (i = 0; i < smartlist_len(descs); i++)
  551. rend_encoded_v2_service_descriptor_free_(smartlist_get(descs, i));
  552. smartlist_free(descs);
  553. }
  554. if (parsed)
  555. rend_service_descriptor_free(parsed);
  556. if (generated)
  557. rend_service_descriptor_free(generated);
  558. if (pk1)
  559. crypto_pk_free(pk1);
  560. if (pk2)
  561. crypto_pk_free(pk2);
  562. tor_free(intro_points_encrypted);
  563. }
  564. /** Run unit tests for stats code. */
  565. static void
  566. test_stats(void *arg)
  567. {
  568. time_t now = 1281533250; /* 2010-08-11 13:27:30 UTC */
  569. char *s = NULL;
  570. int i;
  571. /* Start with testing exit port statistics; we shouldn't collect exit
  572. * stats without initializing them. */
  573. (void)arg;
  574. rep_hist_note_exit_stream_opened(80);
  575. rep_hist_note_exit_bytes(80, 100, 10000);
  576. s = rep_hist_format_exit_stats(now + 86400);
  577. tt_ptr_op(s, OP_EQ, NULL);
  578. /* Initialize stats, note some streams and bytes, and generate history
  579. * string. */
  580. rep_hist_exit_stats_init(now);
  581. rep_hist_note_exit_stream_opened(80);
  582. rep_hist_note_exit_bytes(80, 100, 10000);
  583. rep_hist_note_exit_stream_opened(443);
  584. rep_hist_note_exit_bytes(443, 100, 10000);
  585. rep_hist_note_exit_bytes(443, 100, 10000);
  586. s = rep_hist_format_exit_stats(now + 86400);
  587. tt_str_op("exit-stats-end 2010-08-12 13:27:30 (86400 s)\n"
  588. "exit-kibibytes-written 80=1,443=1,other=0\n"
  589. "exit-kibibytes-read 80=10,443=20,other=0\n"
  590. "exit-streams-opened 80=4,443=4,other=0\n",OP_EQ, s);
  591. tor_free(s);
  592. /* Add a few bytes on 10 more ports and ensure that only the top 10
  593. * ports are contained in the history string. */
  594. for (i = 50; i < 60; i++) {
  595. rep_hist_note_exit_bytes(i, i, i);
  596. rep_hist_note_exit_stream_opened(i);
  597. }
  598. s = rep_hist_format_exit_stats(now + 86400);
  599. tt_str_op("exit-stats-end 2010-08-12 13:27:30 (86400 s)\n"
  600. "exit-kibibytes-written 52=1,53=1,54=1,55=1,56=1,57=1,58=1,"
  601. "59=1,80=1,443=1,other=1\n"
  602. "exit-kibibytes-read 52=1,53=1,54=1,55=1,56=1,57=1,58=1,"
  603. "59=1,80=10,443=20,other=1\n"
  604. "exit-streams-opened 52=4,53=4,54=4,55=4,56=4,57=4,58=4,"
  605. "59=4,80=4,443=4,other=4\n",OP_EQ, s);
  606. tor_free(s);
  607. /* Stop collecting stats, add some bytes, and ensure we don't generate
  608. * a history string. */
  609. rep_hist_exit_stats_term();
  610. rep_hist_note_exit_bytes(80, 100, 10000);
  611. s = rep_hist_format_exit_stats(now + 86400);
  612. tt_ptr_op(s, OP_EQ, NULL);
  613. /* Re-start stats, add some bytes, reset stats, and see what history we
  614. * get when observing no streams or bytes at all. */
  615. rep_hist_exit_stats_init(now);
  616. rep_hist_note_exit_stream_opened(80);
  617. rep_hist_note_exit_bytes(80, 100, 10000);
  618. rep_hist_reset_exit_stats(now);
  619. s = rep_hist_format_exit_stats(now + 86400);
  620. tt_str_op("exit-stats-end 2010-08-12 13:27:30 (86400 s)\n"
  621. "exit-kibibytes-written other=0\n"
  622. "exit-kibibytes-read other=0\n"
  623. "exit-streams-opened other=0\n",OP_EQ, s);
  624. tor_free(s);
  625. /* Continue with testing connection statistics; we shouldn't collect
  626. * conn stats without initializing them. */
  627. rep_hist_note_or_conn_bytes(1, 20, 400, now);
  628. s = rep_hist_format_conn_stats(now + 86400);
  629. tt_ptr_op(s, OP_EQ, NULL);
  630. /* Initialize stats, note bytes, and generate history string. */
  631. rep_hist_conn_stats_init(now);
  632. rep_hist_note_or_conn_bytes(1, 30000, 400000, now);
  633. rep_hist_note_or_conn_bytes(1, 30000, 400000, now + 5);
  634. rep_hist_note_or_conn_bytes(2, 400000, 30000, now + 10);
  635. rep_hist_note_or_conn_bytes(2, 400000, 30000, now + 15);
  636. s = rep_hist_format_conn_stats(now + 86400);
  637. tt_str_op("conn-bi-direct 2010-08-12 13:27:30 (86400 s) 0,0,1,0\n",OP_EQ, s);
  638. tor_free(s);
  639. /* Stop collecting stats, add some bytes, and ensure we don't generate
  640. * a history string. */
  641. rep_hist_conn_stats_term();
  642. rep_hist_note_or_conn_bytes(2, 400000, 30000, now + 15);
  643. s = rep_hist_format_conn_stats(now + 86400);
  644. tt_ptr_op(s, OP_EQ, NULL);
  645. /* Re-start stats, add some bytes, reset stats, and see what history we
  646. * get when observing no bytes at all. */
  647. rep_hist_conn_stats_init(now);
  648. rep_hist_note_or_conn_bytes(1, 30000, 400000, now);
  649. rep_hist_note_or_conn_bytes(1, 30000, 400000, now + 5);
  650. rep_hist_note_or_conn_bytes(2, 400000, 30000, now + 10);
  651. rep_hist_note_or_conn_bytes(2, 400000, 30000, now + 15);
  652. rep_hist_reset_conn_stats(now);
  653. s = rep_hist_format_conn_stats(now + 86400);
  654. tt_str_op("conn-bi-direct 2010-08-12 13:27:30 (86400 s) 0,0,0,0\n",OP_EQ, s);
  655. tor_free(s);
  656. /* Continue with testing buffer statistics; we shouldn't collect buffer
  657. * stats without initializing them. */
  658. rep_hist_add_buffer_stats(2.0, 2.0, 20);
  659. s = rep_hist_format_buffer_stats(now + 86400);
  660. tt_ptr_op(s, OP_EQ, NULL);
  661. /* Initialize stats, add statistics for a single circuit, and generate
  662. * the history string. */
  663. rep_hist_buffer_stats_init(now);
  664. rep_hist_add_buffer_stats(2.0, 2.0, 20);
  665. s = rep_hist_format_buffer_stats(now + 86400);
  666. tt_str_op("cell-stats-end 2010-08-12 13:27:30 (86400 s)\n"
  667. "cell-processed-cells 20,0,0,0,0,0,0,0,0,0\n"
  668. "cell-queued-cells 2.00,0.00,0.00,0.00,0.00,0.00,0.00,0.00,"
  669. "0.00,0.00\n"
  670. "cell-time-in-queue 2,0,0,0,0,0,0,0,0,0\n"
  671. "cell-circuits-per-decile 1\n",OP_EQ, s);
  672. tor_free(s);
  673. /* Add nineteen more circuit statistics to the one that's already in the
  674. * history to see that the math works correctly. */
  675. for (i = 21; i < 30; i++)
  676. rep_hist_add_buffer_stats(2.0, 2.0, i);
  677. for (i = 20; i < 30; i++)
  678. rep_hist_add_buffer_stats(3.5, 3.5, i);
  679. s = rep_hist_format_buffer_stats(now + 86400);
  680. tt_str_op("cell-stats-end 2010-08-12 13:27:30 (86400 s)\n"
  681. "cell-processed-cells 29,28,27,26,25,24,23,22,21,20\n"
  682. "cell-queued-cells 2.75,2.75,2.75,2.75,2.75,2.75,2.75,2.75,"
  683. "2.75,2.75\n"
  684. "cell-time-in-queue 3,3,3,3,3,3,3,3,3,3\n"
  685. "cell-circuits-per-decile 2\n",OP_EQ, s);
  686. tor_free(s);
  687. /* Stop collecting stats, add statistics for one circuit, and ensure we
  688. * don't generate a history string. */
  689. rep_hist_buffer_stats_term();
  690. rep_hist_add_buffer_stats(2.0, 2.0, 20);
  691. s = rep_hist_format_buffer_stats(now + 86400);
  692. tt_ptr_op(s, OP_EQ, NULL);
  693. /* Re-start stats, add statistics for one circuit, reset stats, and make
  694. * sure that the history has all zeros. */
  695. rep_hist_buffer_stats_init(now);
  696. rep_hist_add_buffer_stats(2.0, 2.0, 20);
  697. rep_hist_reset_buffer_stats(now);
  698. s = rep_hist_format_buffer_stats(now + 86400);
  699. tt_str_op("cell-stats-end 2010-08-12 13:27:30 (86400 s)\n"
  700. "cell-processed-cells 0,0,0,0,0,0,0,0,0,0\n"
  701. "cell-queued-cells 0.00,0.00,0.00,0.00,0.00,0.00,0.00,0.00,"
  702. "0.00,0.00\n"
  703. "cell-time-in-queue 0,0,0,0,0,0,0,0,0,0\n"
  704. "cell-circuits-per-decile 0\n",OP_EQ, s);
  705. done:
  706. tor_free(s);
  707. }
  708. #define ENT(name) \
  709. { #name, test_ ## name , 0, NULL, NULL }
  710. #define FORK(name) \
  711. { #name, test_ ## name , TT_FORK, NULL, NULL }
  712. static struct testcase_t test_array[] = {
  713. ENT(onion_handshake),
  714. { "bad_onion_handshake", test_bad_onion_handshake, 0, NULL, NULL },
  715. ENT(onion_queues),
  716. { "ntor_handshake", test_ntor_handshake, 0, NULL, NULL },
  717. { "fast_handshake", test_fast_handshake, 0, NULL, NULL },
  718. FORK(circuit_timeout),
  719. FORK(rend_fns),
  720. FORK(stats),
  721. END_OF_TESTCASES
  722. };
  723. struct testgroup_t testgroups[] = {
  724. { "", test_array },
  725. { "accounting/", accounting_tests },
  726. { "addr/", addr_tests },
  727. { "address/", address_tests },
  728. { "address_set/", address_set_tests },
  729. { "bridges/", bridges_tests },
  730. { "buffer/", buffer_tests },
  731. { "bwmgt/", bwmgt_tests },
  732. { "cellfmt/", cell_format_tests },
  733. { "cellqueue/", cell_queue_tests },
  734. { "channel/", channel_tests },
  735. { "channelpadding/", channelpadding_tests },
  736. { "channeltls/", channeltls_tests },
  737. { "checkdir/", checkdir_tests },
  738. { "circuitbuild/", circuitbuild_tests },
  739. { "circuitlist/", circuitlist_tests },
  740. { "circuitmux/", circuitmux_tests },
  741. { "circuituse/", circuituse_tests },
  742. { "circuitstats/", circuitstats_tests },
  743. { "compat/libevent/", compat_libevent_tests },
  744. { "config/", config_tests },
  745. { "connection/", connection_tests },
  746. { "conscache/", conscache_tests },
  747. { "consdiff/", consdiff_tests },
  748. { "consdiffmgr/", consdiffmgr_tests },
  749. { "container/", container_tests },
  750. { "control/", controller_tests },
  751. { "control/event/", controller_event_tests },
  752. { "crypto/", crypto_tests },
  753. { "crypto/openssl/", crypto_openssl_tests },
  754. { "dir/", dir_tests },
  755. { "dir_handle_get/", dir_handle_get_tests },
  756. { "dir/md/", microdesc_tests },
  757. { "dir/voting-schedule/", voting_schedule_tests },
  758. { "dos/", dos_tests },
  759. { "entryconn/", entryconn_tests },
  760. { "entrynodes/", entrynodes_tests },
  761. { "guardfraction/", guardfraction_tests },
  762. { "extorport/", extorport_tests },
  763. { "geoip/", geoip_tests },
  764. { "legacy_hs/", hs_tests },
  765. { "hs_cache/", hs_cache },
  766. { "hs_cell/", hs_cell_tests },
  767. { "hs_common/", hs_common_tests },
  768. { "hs_config/", hs_config_tests },
  769. { "hs_control/", hs_control_tests },
  770. { "hs_descriptor/", hs_descriptor },
  771. { "hs_ntor/", hs_ntor_tests },
  772. { "hs_service/", hs_service_tests },
  773. { "hs_client/", hs_client_tests },
  774. { "hs_intropoint/", hs_intropoint_tests },
  775. { "introduce/", introduce_tests },
  776. { "keypin/", keypin_tests },
  777. { "link-handshake/", link_handshake_tests },
  778. { "mainloop/", mainloop_tests },
  779. { "nodelist/", nodelist_tests },
  780. { "oom/", oom_tests },
  781. { "oos/", oos_tests },
  782. { "options/", options_tests },
  783. { "periodic-event/" , periodic_event_tests },
  784. { "policy/" , policy_tests },
  785. { "procmon/", procmon_tests },
  786. { "proto/http/", proto_http_tests },
  787. { "proto/misc/", proto_misc_tests },
  788. { "protover/", protover_tests },
  789. { "pt/", pt_tests },
  790. { "relay/" , relay_tests },
  791. { "relaycell/", relaycell_tests },
  792. { "relaycrypt/", relaycrypt_tests },
  793. { "rend_cache/", rend_cache_tests },
  794. { "replaycache/", replaycache_tests },
  795. { "router/", router_tests },
  796. { "routerkeys/", routerkeys_tests },
  797. { "routerlist/", routerlist_tests },
  798. { "routerset/" , routerset_tests },
  799. { "scheduler/", scheduler_tests },
  800. { "socks/", socks_tests },
  801. { "shared-random/", sr_tests },
  802. { "status/" , status_tests },
  803. { "storagedir/", storagedir_tests },
  804. { "tortls/", tortls_tests },
  805. { "util/", util_tests },
  806. { "util/format/", util_format_tests },
  807. { "util/logging/", logging_tests },
  808. { "util/process/", util_process_tests },
  809. { "util/thread/", thread_tests },
  810. { "util/handle/", handle_tests },
  811. { "dns/", dns_tests },
  812. END_OF_GROUPS
  813. };