test_hs_client.c 21 KB

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