test_hs_client.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606
  1. /* Copyright (c) 2016-2017, The Tor Project, Inc. */
  2. /* See LICENSE for licensing information */
  3. /**
  4. * \file test_hs_client.c
  5. * \brief Test prop224 HS client functionality.
  6. */
  7. #define CRYPTO_PRIVATE
  8. #define MAIN_PRIVATE
  9. #define HS_CLIENT_PRIVATE
  10. #define TOR_CHANNEL_INTERNAL_
  11. #define CIRCUITBUILD_PRIVATE
  12. #define CIRCUITLIST_PRIVATE
  13. #define CONNECTION_PRIVATE
  14. #include "test.h"
  15. #include "test_helpers.h"
  16. #include "log_test_helpers.h"
  17. #include "rend_test_helpers.h"
  18. #include "hs_test_helpers.h"
  19. #include "config.h"
  20. #include "crypto.h"
  21. #include "channeltls.h"
  22. #include "main.h"
  23. #include "nodelist.h"
  24. #include "routerset.h"
  25. #include "hs_circuit.h"
  26. #include "hs_client.h"
  27. #include "hs_ident.h"
  28. #include "hs_cache.h"
  29. #include "circuitlist.h"
  30. #include "circuitbuild.h"
  31. #include "connection.h"
  32. #include "connection_edge.h"
  33. #include "networkstatus.h"
  34. #include "dir_connection_st.h"
  35. #include "entry_connection_st.h"
  36. static int
  37. mock_connection_ap_handshake_send_begin(entry_connection_t *ap_conn)
  38. {
  39. (void) ap_conn;
  40. return 0;
  41. }
  42. static networkstatus_t mock_ns;
  43. /* Always return NULL. */
  44. static networkstatus_t *
  45. mock_networkstatus_get_live_consensus_false(time_t now)
  46. {
  47. (void) now;
  48. return NULL;
  49. }
  50. static networkstatus_t *
  51. mock_networkstatus_get_live_consensus(time_t now)
  52. {
  53. (void) now;
  54. return &mock_ns;
  55. }
  56. /* Test helper function: Setup a circuit and a stream with the same hidden
  57. * service destination, and put them in <b>circ_out</b> and
  58. * <b>conn_out</b>. Make the stream wait for circuits to be established to the
  59. * hidden service. */
  60. static int
  61. helper_get_circ_and_stream_for_test(origin_circuit_t **circ_out,
  62. connection_t **conn_out,
  63. int is_legacy)
  64. {
  65. int retval;
  66. channel_tls_t *n_chan=NULL;
  67. rend_data_t *conn_rend_data = NULL;
  68. origin_circuit_t *or_circ = NULL;
  69. connection_t *conn = NULL;
  70. ed25519_public_key_t service_pk;
  71. /* Make a dummy connection stream and make it wait for our circuit */
  72. conn = test_conn_get_connection(AP_CONN_STATE_CIRCUIT_WAIT,
  73. CONN_TYPE_AP /* ??? */,
  74. 0);
  75. if (is_legacy) {
  76. /* Legacy: Setup rend_data of stream */
  77. char service_id[REND_SERVICE_ID_LEN_BASE32+1] = {0};
  78. TO_EDGE_CONN(conn)->rend_data = mock_rend_data(service_id);
  79. conn_rend_data = TO_EDGE_CONN(conn)->rend_data;
  80. } else {
  81. /* prop224: Setup hs conn identifier on the stream */
  82. ed25519_secret_key_t sk;
  83. tt_int_op(0, OP_EQ, ed25519_secret_key_generate(&sk, 0));
  84. tt_int_op(0, OP_EQ, ed25519_public_key_generate(&service_pk, &sk));
  85. /* Setup hs_conn_identifier of stream */
  86. TO_EDGE_CONN(conn)->hs_ident = hs_ident_edge_conn_new(&service_pk);
  87. }
  88. /* Make it wait for circuit */
  89. connection_ap_mark_as_pending_circuit(TO_ENTRY_CONN(conn));
  90. /* This is needed to silence a BUG warning from
  91. connection_edge_update_circuit_isolation() */
  92. TO_ENTRY_CONN(conn)->original_dest_address =
  93. tor_strdup(TO_ENTRY_CONN(conn)->socks_request->address);
  94. /****************************************************/
  95. /* Now make dummy circuit */
  96. or_circ = origin_circuit_new();
  97. or_circ->base_.purpose = CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED;
  98. or_circ->build_state = tor_malloc_zero(sizeof(cpath_build_state_t));
  99. or_circ->build_state->is_internal = 1;
  100. if (is_legacy) {
  101. /* Legacy: Setup rend data and final cpath */
  102. or_circ->build_state->pending_final_cpath =
  103. tor_malloc_zero(sizeof(crypt_path_t));
  104. or_circ->build_state->pending_final_cpath->magic = CRYPT_PATH_MAGIC;
  105. or_circ->build_state->pending_final_cpath->rend_dh_handshake_state =
  106. crypto_dh_new(DH_TYPE_REND);
  107. tt_assert(
  108. or_circ->build_state->pending_final_cpath->rend_dh_handshake_state);
  109. retval = crypto_dh_generate_public(
  110. or_circ->build_state->pending_final_cpath->rend_dh_handshake_state);
  111. tt_int_op(retval, OP_EQ, 0);
  112. or_circ->rend_data = rend_data_dup(conn_rend_data);
  113. } else {
  114. /* prop224: Setup hs ident on the circuit */
  115. or_circ->hs_ident = hs_ident_circuit_new(&service_pk,
  116. HS_IDENT_CIRCUIT_RENDEZVOUS);
  117. }
  118. TO_CIRCUIT(or_circ)->state = CIRCUIT_STATE_OPEN;
  119. /* fake n_chan */
  120. n_chan = tor_malloc_zero(sizeof(channel_tls_t));
  121. n_chan->base_.global_identifier = 1;
  122. or_circ->base_.n_chan = &(n_chan->base_);
  123. *circ_out = or_circ;
  124. *conn_out = conn;
  125. return 0;
  126. done:
  127. /* something failed */
  128. return -1;
  129. }
  130. /* Test: Ensure that setting up legacy e2e rendezvous circuits works
  131. * correctly. */
  132. static void
  133. test_e2e_rend_circuit_setup_legacy(void *arg)
  134. {
  135. ssize_t retval;
  136. origin_circuit_t *or_circ = NULL;
  137. connection_t *conn = NULL;
  138. (void) arg;
  139. /** In this test we create a v2 legacy HS stream and a circuit with the same
  140. * hidden service destination. We make the stream wait for circuits to be
  141. * established to the hidden service, and then we complete the circuit using
  142. * the hs_circuit_setup_e2e_rend_circ_legacy_client() function. We then
  143. * check that the end-to-end cpath was setup correctly and that the stream
  144. * was attached to the circuit as expected. */
  145. MOCK(connection_ap_handshake_send_begin,
  146. mock_connection_ap_handshake_send_begin);
  147. /* Setup */
  148. retval = helper_get_circ_and_stream_for_test( &or_circ, &conn, 1);
  149. tt_int_op(retval, OP_EQ, 0);
  150. tt_assert(or_circ);
  151. tt_assert(conn);
  152. /* Check number of hops */
  153. retval = cpath_get_n_hops(&or_circ->cpath);
  154. tt_int_op(retval, OP_EQ, 0);
  155. /* Check that our stream is not attached on any circuits */
  156. tt_ptr_op(TO_EDGE_CONN(conn)->on_circuit, OP_EQ, NULL);
  157. /********************************************** */
  158. /* Make a good RENDEZVOUS1 cell body because it needs to pass key exchange
  159. * digest verification... */
  160. uint8_t rend_cell_body[DH_KEY_LEN+DIGEST_LEN] = {2};
  161. {
  162. char keys[DIGEST_LEN+CPATH_KEY_MATERIAL_LEN];
  163. crypto_dh_t *dh_state =
  164. or_circ->build_state->pending_final_cpath->rend_dh_handshake_state;
  165. /* compute and overwrite digest of cell body with the right value */
  166. retval = crypto_dh_compute_secret(LOG_PROTOCOL_WARN, dh_state,
  167. (char*)rend_cell_body, DH_KEY_LEN,
  168. keys, DIGEST_LEN+CPATH_KEY_MATERIAL_LEN);
  169. tt_int_op(retval, OP_GT, 0);
  170. memcpy(rend_cell_body+DH_KEY_LEN, keys, DIGEST_LEN);
  171. }
  172. /* Setup the circuit */
  173. retval = hs_circuit_setup_e2e_rend_circ_legacy_client(or_circ,
  174. rend_cell_body);
  175. tt_int_op(retval, OP_EQ, 0);
  176. /**********************************************/
  177. /* See that a hop was added to the circuit's cpath */
  178. retval = cpath_get_n_hops(&or_circ->cpath);
  179. tt_int_op(retval, OP_EQ, 1);
  180. /* Check the digest algo */
  181. tt_int_op(crypto_digest_get_algorithm(or_circ->cpath->crypto.f_digest),
  182. OP_EQ, DIGEST_SHA1);
  183. tt_int_op(crypto_digest_get_algorithm(or_circ->cpath->crypto.b_digest),
  184. OP_EQ, DIGEST_SHA1);
  185. tt_assert(or_circ->cpath->crypto.f_crypto);
  186. tt_assert(or_circ->cpath->crypto.b_crypto);
  187. /* Ensure that circ purpose was changed */
  188. tt_int_op(or_circ->base_.purpose, OP_EQ, CIRCUIT_PURPOSE_C_REND_JOINED);
  189. /* Test that stream got attached */
  190. tt_ptr_op(TO_EDGE_CONN(conn)->on_circuit, OP_EQ, TO_CIRCUIT(or_circ));
  191. done:
  192. connection_free_minimal(conn);
  193. if (or_circ)
  194. tor_free(TO_CIRCUIT(or_circ)->n_chan);
  195. circuit_free_(TO_CIRCUIT(or_circ));
  196. }
  197. /* Test: Ensure that setting up v3 rendezvous circuits works correctly. */
  198. static void
  199. test_e2e_rend_circuit_setup(void *arg)
  200. {
  201. uint8_t ntor_key_seed[DIGEST256_LEN] = {0};
  202. origin_circuit_t *or_circ = NULL;
  203. int retval;
  204. connection_t *conn = NULL;
  205. (void) arg;
  206. /** In this test we create a prop224 v3 HS stream and a circuit with the same
  207. * hidden service destination. We make the stream wait for circuits to be
  208. * established to the hidden service, and then we complete the circuit using
  209. * the hs_circuit_setup_e2e_rend_circ() function. We then check that the
  210. * end-to-end cpath was setup correctly and that the stream was attached to
  211. * the circuit as expected. */
  212. MOCK(connection_ap_handshake_send_begin,
  213. mock_connection_ap_handshake_send_begin);
  214. /* Setup */
  215. retval = helper_get_circ_and_stream_for_test( &or_circ, &conn, 0);
  216. tt_int_op(retval, OP_EQ, 0);
  217. tt_assert(or_circ);
  218. tt_assert(conn);
  219. /* Check number of hops: There should be no hops yet to this circ */
  220. retval = cpath_get_n_hops(&or_circ->cpath);
  221. tt_int_op(retval, OP_EQ, 0);
  222. tt_ptr_op(or_circ->cpath, OP_EQ, NULL);
  223. /* Check that our stream is not attached on any circuits */
  224. tt_ptr_op(TO_EDGE_CONN(conn)->on_circuit, OP_EQ, NULL);
  225. /**********************************************/
  226. /* Setup the circuit */
  227. retval = hs_circuit_setup_e2e_rend_circ(or_circ,
  228. ntor_key_seed, sizeof(ntor_key_seed),
  229. 0);
  230. tt_int_op(retval, OP_EQ, 0);
  231. /**********************************************/
  232. /* See that a hop was added to the circuit's cpath */
  233. retval = cpath_get_n_hops(&or_circ->cpath);
  234. tt_int_op(retval, OP_EQ, 1);
  235. /* Check that the crypt path has prop224 algorithm parameters */
  236. tt_int_op(crypto_digest_get_algorithm(or_circ->cpath->crypto.f_digest),
  237. OP_EQ, DIGEST_SHA3_256);
  238. tt_int_op(crypto_digest_get_algorithm(or_circ->cpath->crypto.b_digest),
  239. OP_EQ, DIGEST_SHA3_256);
  240. tt_assert(or_circ->cpath->crypto.f_crypto);
  241. tt_assert(or_circ->cpath->crypto.b_crypto);
  242. /* Ensure that circ purpose was changed */
  243. tt_int_op(or_circ->base_.purpose, OP_EQ, CIRCUIT_PURPOSE_C_REND_JOINED);
  244. /* Test that stream got attached */
  245. tt_ptr_op(TO_EDGE_CONN(conn)->on_circuit, OP_EQ, TO_CIRCUIT(or_circ));
  246. done:
  247. connection_free_minimal(conn);
  248. if (or_circ)
  249. tor_free(TO_CIRCUIT(or_circ)->n_chan);
  250. circuit_free_(TO_CIRCUIT(or_circ));
  251. }
  252. /** Test client logic for picking intro points from a descriptor. Also test how
  253. * ExcludeNodes and intro point failures affect picking intro points. */
  254. static void
  255. test_client_pick_intro(void *arg)
  256. {
  257. int ret;
  258. ed25519_keypair_t service_kp;
  259. hs_descriptor_t *desc = NULL;
  260. MOCK(networkstatus_get_live_consensus,
  261. mock_networkstatus_get_live_consensus);
  262. (void) arg;
  263. hs_init();
  264. /* Generate service keypair */
  265. tt_int_op(0, OP_EQ, ed25519_keypair_generate(&service_kp, 0));
  266. /* Set time */
  267. ret = parse_rfc1123_time("Sat, 26 Oct 1985 13:00:00 UTC",
  268. &mock_ns.valid_after);
  269. tt_int_op(ret, OP_EQ, 0);
  270. ret = parse_rfc1123_time("Sat, 26 Oct 1985 14:00:00 UTC",
  271. &mock_ns.fresh_until);
  272. tt_int_op(ret, OP_EQ, 0);
  273. update_approx_time(mock_ns.fresh_until-10);
  274. time_t now = approx_time();
  275. /* Test logic:
  276. *
  277. * 1) Add our desc with intro points to the HS cache.
  278. *
  279. * 2) Mark all descriptor intro points except _the chosen one_ as
  280. * failed. Then query the desc to get a random intro: check that we got
  281. * _the chosen one_. Then fail the chosen one as well, and see that no
  282. * intros are returned.
  283. *
  284. * 3) Then clean the intro state cache and get an intro point.
  285. *
  286. * 4) Try fetching an intro with the wrong service key: shouldn't work
  287. *
  288. * 5) Set StrictNodes and put all our intro points in ExcludeNodes: see that
  289. * nothing is returned.
  290. */
  291. /* 1) Add desc to HS cache */
  292. {
  293. char *encoded = NULL;
  294. desc = hs_helper_build_hs_desc_with_ip(&service_kp);
  295. ret = hs_desc_encode_descriptor(desc, &service_kp, &encoded);
  296. tt_int_op(ret, OP_EQ, 0);
  297. tt_assert(encoded);
  298. /* store it */
  299. hs_cache_store_as_client(encoded, &service_kp.pubkey);
  300. /* fetch it to make sure it works */
  301. const hs_descriptor_t *fetched_desc =
  302. hs_cache_lookup_as_client(&service_kp.pubkey);
  303. tt_assert(fetched_desc);
  304. tt_mem_op(fetched_desc->subcredential, OP_EQ, desc->subcredential,
  305. DIGEST256_LEN);
  306. tt_assert(!tor_mem_is_zero((char*)fetched_desc->subcredential,
  307. DIGEST256_LEN));
  308. tor_free(encoded);
  309. }
  310. /* 2) Mark all intro points except _the chosen one_ as failed. Then query the
  311. * desc and get a random intro: check that we got _the chosen one_. */
  312. {
  313. /* Pick the chosen intro point and get its ei */
  314. hs_desc_intro_point_t *chosen_intro_point =
  315. smartlist_get(desc->encrypted_data.intro_points, 0);
  316. extend_info_t *chosen_intro_ei =
  317. desc_intro_point_to_extend_info(chosen_intro_point);
  318. tt_assert(chosen_intro_point);
  319. tt_assert(chosen_intro_ei);
  320. /* Now mark all other intro points as failed */
  321. SMARTLIST_FOREACH_BEGIN(desc->encrypted_data.intro_points,
  322. hs_desc_intro_point_t *, ip) {
  323. /* Skip the chosen intro point */
  324. if (ip == chosen_intro_point) {
  325. continue;
  326. }
  327. ed25519_public_key_t *intro_auth_key = &ip->auth_key_cert->signed_key;
  328. hs_cache_client_intro_state_note(&service_kp.pubkey,
  329. intro_auth_key,
  330. INTRO_POINT_FAILURE_GENERIC);
  331. } SMARTLIST_FOREACH_END(ip);
  332. /* Try to get a random intro: Should return the chosen one! */
  333. /* (We try several times, to make sure this behavior is consistent, and to
  334. * cover the different cases of client_get_random_intro().) */
  335. for (int i = 0; i < 64; ++i) {
  336. extend_info_t *ip = client_get_random_intro(&service_kp.pubkey);
  337. tor_assert(ip);
  338. tt_assert(!tor_mem_is_zero((char*)ip->identity_digest, DIGEST_LEN));
  339. tt_mem_op(ip->identity_digest, OP_EQ, chosen_intro_ei->identity_digest,
  340. DIGEST_LEN);
  341. extend_info_free(ip);
  342. }
  343. extend_info_free(chosen_intro_ei);
  344. /* Now also mark the chosen one as failed: See that we can't get any intro
  345. points anymore. */
  346. hs_cache_client_intro_state_note(&service_kp.pubkey,
  347. &chosen_intro_point->auth_key_cert->signed_key,
  348. INTRO_POINT_FAILURE_TIMEOUT);
  349. extend_info_t *ip = client_get_random_intro(&service_kp.pubkey);
  350. tor_assert(!ip);
  351. }
  352. /* 3) Clean the intro state cache and get an intro point */
  353. {
  354. /* Pretend we are 5 mins in the future and order a cleanup of the intro
  355. * state. This should clean up the intro point failures and allow us to get
  356. * an intro. */
  357. hs_cache_client_intro_state_clean(now + 5*60);
  358. /* Get an intro. It should work! */
  359. extend_info_t *ip = client_get_random_intro(&service_kp.pubkey);
  360. tor_assert(ip);
  361. extend_info_free(ip);
  362. }
  363. /* 4) Try fetching an intro with the wrong service key: shouldn't work */
  364. {
  365. ed25519_keypair_t dummy_kp;
  366. tt_int_op(0, OP_EQ, ed25519_keypair_generate(&dummy_kp, 0));
  367. extend_info_t *ip = client_get_random_intro(&dummy_kp.pubkey);
  368. tor_assert(!ip);
  369. }
  370. /* 5) Set StrictNodes and put all our intro points in ExcludeNodes: see that
  371. * nothing is returned. */
  372. {
  373. get_options_mutable()->ExcludeNodes = routerset_new();
  374. get_options_mutable()->StrictNodes = 1;
  375. SMARTLIST_FOREACH_BEGIN(desc->encrypted_data.intro_points,
  376. hs_desc_intro_point_t *, ip) {
  377. extend_info_t *intro_ei = desc_intro_point_to_extend_info(ip);
  378. if (intro_ei) {
  379. const char *ptr;
  380. char ip_addr[TOR_ADDR_BUF_LEN];
  381. /* We need to decorate in case it is an IPv6 else routerset_parse()
  382. * doesn't like it. */
  383. ptr = tor_addr_to_str(ip_addr, &intro_ei->addr, sizeof(ip_addr), 1);
  384. tt_assert(ptr == ip_addr);
  385. ret = routerset_parse(get_options_mutable()->ExcludeNodes,
  386. ip_addr, "");
  387. tt_int_op(ret, OP_EQ, 0);
  388. extend_info_free(intro_ei);
  389. }
  390. } SMARTLIST_FOREACH_END(ip);
  391. extend_info_t *ip = client_get_random_intro(&service_kp.pubkey);
  392. tt_assert(!ip);
  393. }
  394. done:
  395. hs_descriptor_free(desc);
  396. }
  397. static int
  398. mock_router_have_minimum_dir_info_false(void)
  399. {
  400. return 0;
  401. }
  402. static int
  403. mock_router_have_minimum_dir_info_true(void)
  404. {
  405. return 1;
  406. }
  407. static hs_client_fetch_status_t
  408. mock_fetch_v3_desc_error(const ed25519_public_key_t *key)
  409. {
  410. (void) key;
  411. return HS_CLIENT_FETCH_ERROR;
  412. }
  413. static void
  414. mock_connection_mark_unattached_ap_(entry_connection_t *conn, int endreason,
  415. int line, const char *file)
  416. {
  417. (void) line;
  418. (void) file;
  419. conn->edge_.end_reason = endreason;
  420. }
  421. static void
  422. test_descriptor_fetch(void *arg)
  423. {
  424. int ret;
  425. entry_connection_t *ec = NULL;
  426. ed25519_public_key_t service_pk;
  427. ed25519_secret_key_t service_sk;
  428. (void) arg;
  429. hs_init();
  430. memset(&service_sk, 'A', sizeof(service_sk));
  431. ret = ed25519_public_key_generate(&service_pk, &service_sk);
  432. tt_int_op(ret, OP_EQ, 0);
  433. /* Initialize this so get_voting_interval() doesn't freak out. */
  434. ret = parse_rfc1123_time("Sat, 26 Oct 1985 13:00:00 UTC",
  435. &mock_ns.valid_after);
  436. tt_int_op(ret, OP_EQ, 0);
  437. ret = parse_rfc1123_time("Sat, 26 Oct 1985 14:00:00 UTC",
  438. &mock_ns.fresh_until);
  439. tt_int_op(ret, OP_EQ, 0);
  440. ec = entry_connection_new(CONN_TYPE_AP, AF_INET);
  441. tt_assert(ec);
  442. ENTRY_TO_EDGE_CONN(ec)->hs_ident = hs_ident_edge_conn_new(&service_pk);
  443. tt_assert(ENTRY_TO_EDGE_CONN(ec)->hs_ident);
  444. TO_CONN(ENTRY_TO_EDGE_CONN(ec))->state = AP_CONN_STATE_RENDDESC_WAIT;
  445. smartlist_add(get_connection_array(), &ec->edge_.base_);
  446. /* 1. FetchHidServDescriptors is false so we shouldn't be able to fetch. */
  447. get_options_mutable()->FetchHidServDescriptors = 0;
  448. ret = hs_client_refetch_hsdesc(&service_pk);
  449. tt_int_op(ret, OP_EQ, HS_CLIENT_FETCH_NOT_ALLOWED);
  450. get_options_mutable()->FetchHidServDescriptors = 1;
  451. /* 2. We don't have a live consensus. */
  452. MOCK(networkstatus_get_live_consensus,
  453. mock_networkstatus_get_live_consensus_false);
  454. ret = hs_client_refetch_hsdesc(&service_pk);
  455. UNMOCK(networkstatus_get_live_consensus);
  456. tt_int_op(ret, OP_EQ, HS_CLIENT_FETCH_MISSING_INFO);
  457. /* From now on, return a live consensus. */
  458. MOCK(networkstatus_get_live_consensus,
  459. mock_networkstatus_get_live_consensus);
  460. /* 3. Not enough dir information. */
  461. MOCK(router_have_minimum_dir_info,
  462. mock_router_have_minimum_dir_info_false);
  463. ret = hs_client_refetch_hsdesc(&service_pk);
  464. UNMOCK(router_have_minimum_dir_info);
  465. tt_int_op(ret, OP_EQ, HS_CLIENT_FETCH_MISSING_INFO);
  466. /* From now on, we do have enough directory information. */
  467. MOCK(router_have_minimum_dir_info,
  468. mock_router_have_minimum_dir_info_true);
  469. /* 4. We do have a pending directory request. */
  470. {
  471. dir_connection_t *dir_conn = dir_connection_new(AF_INET);
  472. dir_conn->hs_ident = tor_malloc_zero(sizeof(hs_ident_dir_conn_t));
  473. TO_CONN(dir_conn)->purpose = DIR_PURPOSE_FETCH_HSDESC;
  474. ed25519_pubkey_copy(&dir_conn->hs_ident->identity_pk, &service_pk);
  475. smartlist_add(get_connection_array(), TO_CONN(dir_conn));
  476. ret = hs_client_refetch_hsdesc(&service_pk);
  477. smartlist_remove(get_connection_array(), TO_CONN(dir_conn));
  478. connection_free_minimal(TO_CONN(dir_conn));
  479. tt_int_op(ret, OP_EQ, HS_CLIENT_FETCH_PENDING);
  480. }
  481. /* 5. We'll trigger an error on the fetch_desc_v3 and force to close all
  482. * pending SOCKS request. */
  483. MOCK(router_have_minimum_dir_info,
  484. mock_router_have_minimum_dir_info_true);
  485. MOCK(fetch_v3_desc, mock_fetch_v3_desc_error);
  486. MOCK(connection_mark_unattached_ap_,
  487. mock_connection_mark_unattached_ap_);
  488. ret = hs_client_refetch_hsdesc(&service_pk);
  489. UNMOCK(fetch_v3_desc);
  490. UNMOCK(connection_mark_unattached_ap_);
  491. tt_int_op(ret, OP_EQ, HS_CLIENT_FETCH_ERROR);
  492. /* The close waiting for descriptor function has been called. */
  493. tt_int_op(ec->edge_.end_reason, OP_EQ, END_STREAM_REASON_RESOLVEFAILED);
  494. done:
  495. connection_free_minimal(ENTRY_TO_CONN(ec));
  496. UNMOCK(networkstatus_get_live_consensus);
  497. UNMOCK(router_have_minimum_dir_info);
  498. hs_free_all();
  499. }
  500. struct testcase_t hs_client_tests[] = {
  501. { "e2e_rend_circuit_setup_legacy", test_e2e_rend_circuit_setup_legacy,
  502. TT_FORK, NULL, NULL },
  503. { "e2e_rend_circuit_setup", test_e2e_rend_circuit_setup,
  504. TT_FORK, NULL, NULL },
  505. { "client_pick_intro", test_client_pick_intro,
  506. TT_FORK, NULL, NULL },
  507. { "descriptor_fetch", test_descriptor_fetch,
  508. TT_FORK, NULL, NULL },
  509. END_OF_TESTCASES
  510. };