hs_client.c 40 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149
  1. /* Copyright (c) 2016-2017, The Tor Project, Inc. */
  2. /* See LICENSE for licensing information */
  3. /**
  4. * \file hs_client.c
  5. * \brief Implement next generation hidden service client functionality
  6. **/
  7. #include "or.h"
  8. #include "hs_circuit.h"
  9. #include "hs_ident.h"
  10. #include "connection_edge.h"
  11. #include "container.h"
  12. #include "rendclient.h"
  13. #include "hs_descriptor.h"
  14. #include "hs_cache.h"
  15. #include "hs_cell.h"
  16. #include "hs_ident.h"
  17. #include "config.h"
  18. #include "directory.h"
  19. #include "hs_client.h"
  20. #include "router.h"
  21. #include "routerset.h"
  22. #include "circuitlist.h"
  23. #include "circuituse.h"
  24. #include "connection.h"
  25. #include "circpathbias.h"
  26. #include "connection.h"
  27. #include "hs_ntor.h"
  28. #include "circuitbuild.h"
  29. /* Get all connections that are waiting on a circuit and flag them back to
  30. * waiting for a hidden service descriptor for the given service key
  31. * service_identity_pk. */
  32. static void
  33. flag_all_conn_wait_desc(const ed25519_public_key_t *service_identity_pk)
  34. {
  35. tor_assert(service_identity_pk);
  36. smartlist_t *conns =
  37. connection_list_by_type_state(CONN_TYPE_AP, AP_CONN_STATE_CIRCUIT_WAIT);
  38. SMARTLIST_FOREACH_BEGIN(conns, connection_t *, conn) {
  39. edge_connection_t *edge_conn;
  40. if (BUG(!CONN_IS_EDGE(conn))) {
  41. continue;
  42. }
  43. edge_conn = TO_EDGE_CONN(conn);
  44. if (edge_conn->hs_ident &&
  45. ed25519_pubkey_eq(&edge_conn->hs_ident->identity_pk,
  46. service_identity_pk)) {
  47. connection_ap_mark_as_non_pending_circuit(TO_ENTRY_CONN(conn));
  48. conn->state = AP_CONN_STATE_RENDDESC_WAIT;
  49. }
  50. } SMARTLIST_FOREACH_END(conn);
  51. smartlist_free(conns);
  52. }
  53. /* A v3 HS circuit successfully connected to the hidden service. Update the
  54. * stream state at <b>hs_conn_ident</b> appropriately. */
  55. static void
  56. note_connection_attempt_succeeded(const hs_ident_edge_conn_t *hs_conn_ident)
  57. {
  58. (void) hs_conn_ident;
  59. /* TODO: When implementing client side */
  60. return;
  61. }
  62. /* Given the pubkey of a hidden service in <b>onion_identity_pk</b>, fetch its
  63. * descriptor by launching a dir connection to <b>hsdir</b>. Return 1 on
  64. * success or -1 on error. */
  65. static int
  66. directory_launch_v3_desc_fetch(const ed25519_public_key_t *onion_identity_pk,
  67. const routerstatus_t *hsdir)
  68. {
  69. uint64_t current_time_period = hs_get_time_period_num(approx_time());
  70. ed25519_public_key_t blinded_pubkey;
  71. char base64_blinded_pubkey[ED25519_BASE64_LEN + 1];
  72. hs_ident_dir_conn_t hs_conn_dir_ident;
  73. int retval;
  74. tor_assert(hsdir);
  75. tor_assert(onion_identity_pk);
  76. /* Get blinded pubkey */
  77. hs_build_blinded_pubkey(onion_identity_pk, NULL, 0,
  78. current_time_period, &blinded_pubkey);
  79. /* ...and base64 it. */
  80. retval = ed25519_public_to_base64(base64_blinded_pubkey, &blinded_pubkey);
  81. if (BUG(retval < 0)) {
  82. return -1;
  83. }
  84. /* Copy onion pk to a dir_ident so that we attach it to the dir conn */
  85. ed25519_pubkey_copy(&hs_conn_dir_ident.identity_pk, onion_identity_pk);
  86. /* Setup directory request */
  87. directory_request_t *req =
  88. directory_request_new(DIR_PURPOSE_FETCH_HSDESC);
  89. directory_request_set_routerstatus(req, hsdir);
  90. directory_request_set_indirection(req, DIRIND_ANONYMOUS);
  91. directory_request_set_resource(req, base64_blinded_pubkey);
  92. directory_request_fetch_set_hs_ident(req, &hs_conn_dir_ident);
  93. directory_initiate_request(req);
  94. directory_request_free(req);
  95. log_info(LD_REND, "Descriptor fetch request for service %s with blinded "
  96. "key %s to directory %s",
  97. safe_str_client(ed25519_fmt(onion_identity_pk)),
  98. safe_str_client(base64_blinded_pubkey),
  99. safe_str_client(routerstatus_describe(hsdir)));
  100. /* Cleanup memory. */
  101. memwipe(&blinded_pubkey, 0, sizeof(blinded_pubkey));
  102. memwipe(base64_blinded_pubkey, 0, sizeof(base64_blinded_pubkey));
  103. memwipe(&hs_conn_dir_ident, 0, sizeof(hs_conn_dir_ident));
  104. return 1;
  105. }
  106. /** Return the HSDir we should use to fetch the descriptor of the hidden
  107. * service with identity key <b>onion_identity_pk</b>. */
  108. static routerstatus_t *
  109. pick_hsdir_v3(const ed25519_public_key_t *onion_identity_pk)
  110. {
  111. int retval;
  112. char base64_blinded_pubkey[ED25519_BASE64_LEN + 1];
  113. uint64_t current_time_period = hs_get_time_period_num(approx_time());
  114. smartlist_t *responsible_hsdirs;
  115. ed25519_public_key_t blinded_pubkey;
  116. routerstatus_t *hsdir_rs = NULL;
  117. tor_assert(onion_identity_pk);
  118. responsible_hsdirs = smartlist_new();
  119. /* Get blinded pubkey of hidden service */
  120. hs_build_blinded_pubkey(onion_identity_pk, NULL, 0,
  121. current_time_period, &blinded_pubkey);
  122. /* ...and base64 it. */
  123. retval = ed25519_public_to_base64(base64_blinded_pubkey, &blinded_pubkey);
  124. if (BUG(retval < 0)) {
  125. return NULL;
  126. }
  127. /* Get responsible hsdirs of service for this time period */
  128. hs_get_responsible_hsdirs(&blinded_pubkey, current_time_period, 0, 1,
  129. responsible_hsdirs);
  130. log_debug(LD_REND, "Found %d responsible HSDirs and about to pick one.",
  131. smartlist_len(responsible_hsdirs));
  132. /* Pick an HSDir from the responsible ones. The ownership of
  133. * responsible_hsdirs is given to this function so no need to free it. */
  134. hsdir_rs = hs_pick_hsdir(responsible_hsdirs, base64_blinded_pubkey);
  135. return hsdir_rs;
  136. }
  137. /** Fetch a v3 descriptor using the given <b>onion_identity_pk</b>.
  138. *
  139. * On success, 1 is returned. If no hidden service is left to ask, return 0.
  140. * On error, -1 is returned. */
  141. static int
  142. fetch_v3_desc(const ed25519_public_key_t *onion_identity_pk)
  143. {
  144. routerstatus_t *hsdir_rs =NULL;
  145. tor_assert(onion_identity_pk);
  146. hsdir_rs = pick_hsdir_v3(onion_identity_pk);
  147. if (!hsdir_rs) {
  148. log_info(LD_REND, "Couldn't pick a v3 hsdir.");
  149. return 0;
  150. }
  151. return directory_launch_v3_desc_fetch(onion_identity_pk, hsdir_rs);
  152. }
  153. /* Make sure that the given origin circuit circ is a valid correct
  154. * introduction circuit. This asserts on validation failure. */
  155. static void
  156. assert_intro_circ_ok(const origin_circuit_t *circ)
  157. {
  158. tor_assert(circ);
  159. tor_assert(circ->base_.purpose == CIRCUIT_PURPOSE_C_INTRODUCING);
  160. tor_assert(circ->hs_ident);
  161. tor_assert(hs_ident_intro_circ_is_valid(circ->hs_ident));
  162. assert_circ_anonymity_ok(circ, get_options());
  163. }
  164. /* Find a descriptor intro point object that matches the given ident in the
  165. * given descriptor desc. Return NULL if not found. */
  166. static const hs_desc_intro_point_t *
  167. find_desc_intro_point_by_ident(const hs_ident_circuit_t *ident,
  168. const hs_descriptor_t *desc)
  169. {
  170. const hs_desc_intro_point_t *intro_point = NULL;
  171. tor_assert(ident);
  172. tor_assert(desc);
  173. SMARTLIST_FOREACH_BEGIN(desc->encrypted_data.intro_points,
  174. const hs_desc_intro_point_t *, ip) {
  175. if (ed25519_pubkey_eq(&ident->intro_auth_pk,
  176. &ip->auth_key_cert->signed_key)) {
  177. intro_point = ip;
  178. break;
  179. }
  180. } SMARTLIST_FOREACH_END(ip);
  181. return intro_point;
  182. }
  183. /* Send an INTRODUCE1 cell along the intro circuit and populate the rend
  184. * circuit identifier with the needed key material for the e2e encryption.
  185. * Return 0 on success, -1 if there is a transient error such that an action
  186. * has been taken to recover and -2 if there is a permanent error indicating
  187. * that both circuits were closed. */
  188. static int
  189. send_introduce1(origin_circuit_t *intro_circ,
  190. origin_circuit_t *rend_circ)
  191. {
  192. int status;
  193. char onion_address[HS_SERVICE_ADDR_LEN_BASE32 + 1];
  194. const ed25519_public_key_t *service_identity_pk = NULL;
  195. const hs_desc_intro_point_t *ip;
  196. assert_intro_circ_ok(intro_circ);
  197. tor_assert(rend_circ);
  198. service_identity_pk = &intro_circ->hs_ident->identity_pk;
  199. /* For logging purposes. There will be a time where the hs_ident will have a
  200. * version number but for now there is none because it's all v3. */
  201. hs_build_address(service_identity_pk, HS_VERSION_THREE, onion_address);
  202. log_info(LD_REND, "Sending INTRODUCE1 cell to service %s on circuit %u",
  203. safe_str_client(onion_address), TO_CIRCUIT(intro_circ)->n_circ_id);
  204. /* 1) Get descriptor from our cache. */
  205. const hs_descriptor_t *desc =
  206. hs_cache_lookup_as_client(service_identity_pk);
  207. if (desc == NULL || !hs_client_any_intro_points_usable(service_identity_pk,
  208. desc)) {
  209. log_info(LD_REND, "Request to %s %s. Trying to fetch a new descriptor.",
  210. safe_str_client(onion_address),
  211. (desc) ? "didn't have usable intro points" :
  212. "didn't have a descriptor");
  213. hs_client_refetch_hsdesc(service_identity_pk);
  214. /* We just triggered a refetch, make sure every connections are back
  215. * waiting for that descriptor. */
  216. flag_all_conn_wait_desc(service_identity_pk);
  217. /* We just asked for a refetch so this is a transient error. */
  218. goto tran_err;
  219. }
  220. /* We need to find which intro point in the descriptor we are connected to
  221. * on intro_circ. */
  222. ip = find_desc_intro_point_by_ident(intro_circ->hs_ident, desc);
  223. if (BUG(ip == NULL)) {
  224. /* If we can find a descriptor from this introduction circuit ident, we
  225. * must have a valid intro point object. Permanent error. */
  226. goto perm_err;
  227. }
  228. /* Send the INTRODUCE1 cell. */
  229. if (hs_circ_send_introduce1(intro_circ, rend_circ, ip,
  230. desc->subcredential) < 0) {
  231. /* Unable to send the cell, the intro circuit has been marked for close so
  232. * this is a permanent error. */
  233. tor_assert_nonfatal(TO_CIRCUIT(intro_circ)->marked_for_close);
  234. goto perm_err;
  235. }
  236. /* Cell has been sent successfully. Copy the introduction point
  237. * authentication and encryption key in the rendezvous circuit identifier so
  238. * we can compute the ntor keys when we receive the RENDEZVOUS2 cell. */
  239. memcpy(&rend_circ->hs_ident->intro_enc_pk, &ip->enc_key,
  240. sizeof(rend_circ->hs_ident->intro_enc_pk));
  241. ed25519_pubkey_copy(&rend_circ->hs_ident->intro_auth_pk,
  242. &intro_circ->hs_ident->intro_auth_pk);
  243. /* Now, we wait for an ACK or NAK on this circuit. */
  244. circuit_change_purpose(TO_CIRCUIT(intro_circ),
  245. CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT);
  246. /* Set timestamp_dirty, because circuit_expire_building expects it to
  247. * specify when a circuit entered the _C_INTRODUCE_ACK_WAIT state. */
  248. TO_CIRCUIT(intro_circ)->timestamp_dirty = time(NULL);
  249. pathbias_count_use_attempt(intro_circ);
  250. /* Success. */
  251. status = 0;
  252. goto end;
  253. perm_err:
  254. /* Permanent error: it is possible that the intro circuit was closed prior
  255. * because we weren't able to send the cell. Make sure we don't double close
  256. * it which would result in a warning. */
  257. if (!TO_CIRCUIT(intro_circ)->marked_for_close) {
  258. circuit_mark_for_close(TO_CIRCUIT(intro_circ), END_CIRC_REASON_INTERNAL);
  259. }
  260. circuit_mark_for_close(TO_CIRCUIT(rend_circ), END_CIRC_REASON_INTERNAL);
  261. status = -2;
  262. goto end;
  263. tran_err:
  264. status = -1;
  265. end:
  266. memwipe(onion_address, 0, sizeof(onion_address));
  267. return status;
  268. }
  269. /* Using the introduction circuit circ, setup the authentication key of the
  270. * intro point this circuit has extended to. */
  271. static void
  272. setup_intro_circ_auth_key(origin_circuit_t *circ)
  273. {
  274. const hs_descriptor_t *desc;
  275. tor_assert(circ);
  276. desc = hs_cache_lookup_as_client(&circ->hs_ident->identity_pk);
  277. if (BUG(desc == NULL)) {
  278. /* Opening intro circuit without the descriptor is no good... */
  279. goto end;
  280. }
  281. /* We will go over every intro point and try to find which one is linked to
  282. * that circuit. Those lists are small so it's not that expensive. */
  283. SMARTLIST_FOREACH_BEGIN(desc->encrypted_data.intro_points,
  284. const hs_desc_intro_point_t *, ip) {
  285. SMARTLIST_FOREACH_BEGIN(ip->link_specifiers,
  286. const hs_desc_link_specifier_t *, lspec) {
  287. /* Not all tor node have an ed25519 identity key so we still rely on the
  288. * legacy identity digest. */
  289. if (lspec->type != LS_LEGACY_ID) {
  290. continue;
  291. }
  292. if (fast_memneq(circ->build_state->chosen_exit->identity_digest,
  293. lspec->u.legacy_id, DIGEST_LEN)) {
  294. break;
  295. }
  296. /* We got it, copy its authentication key to the identifier. */
  297. ed25519_pubkey_copy(&circ->hs_ident->intro_auth_pk,
  298. &ip->auth_key_cert->signed_key);
  299. goto end;
  300. } SMARTLIST_FOREACH_END(lspec);
  301. } SMARTLIST_FOREACH_END(ip);
  302. /* Reaching this point means we didn't find any intro point for this circuit
  303. * which is not suppose to happen. */
  304. tor_assert_nonfatal_unreached();
  305. end:
  306. return;
  307. }
  308. /* Called when an introduction circuit has opened. */
  309. static void
  310. client_intro_circ_has_opened(origin_circuit_t *circ)
  311. {
  312. tor_assert(circ);
  313. tor_assert(TO_CIRCUIT(circ)->purpose == CIRCUIT_PURPOSE_C_INTRODUCING);
  314. log_info(LD_REND, "Introduction circuit %u has opened. Attaching streams.",
  315. (unsigned int) TO_CIRCUIT(circ)->n_circ_id);
  316. /* This is an introduction circuit so we'll attach the correct
  317. * authentication key to the circuit identifier so it can be identified
  318. * properly later on. */
  319. setup_intro_circ_auth_key(circ);
  320. connection_ap_attach_pending(1);
  321. }
  322. /* Called when a rendezvous circuit has opened. */
  323. static void
  324. client_rendezvous_circ_has_opened(origin_circuit_t *circ)
  325. {
  326. tor_assert(circ);
  327. tor_assert(TO_CIRCUIT(circ)->purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND);
  328. log_info(LD_REND, "Rendezvous circuit has opened to %s.",
  329. safe_str_client(
  330. extend_info_describe(circ->build_state->chosen_exit)));
  331. /* Ignore returned value, nothing we can really do. On failure, the circuit
  332. * will be marked for close. */
  333. hs_circ_send_establish_rendezvous(circ);
  334. }
  335. /* This is an helper function that convert a descriptor intro point object ip
  336. * to a newly allocated extend_info_t object fully initialized. Return NULL if
  337. * we can't convert it for which chances are that we are missing or malformed
  338. * link specifiers. */
  339. static extend_info_t *
  340. desc_intro_point_to_extend_info(const hs_desc_intro_point_t *ip)
  341. {
  342. extend_info_t *ei;
  343. smartlist_t *lspecs = smartlist_new();
  344. tor_assert(ip);
  345. /* We first encode the descriptor link specifiers into the binary
  346. * representation which is a trunnel object. */
  347. SMARTLIST_FOREACH_BEGIN(ip->link_specifiers,
  348. const hs_desc_link_specifier_t *, desc_lspec) {
  349. link_specifier_t *lspec = hs_desc_encode_lspec(desc_lspec);
  350. smartlist_add(lspecs, lspec);
  351. } SMARTLIST_FOREACH_END(desc_lspec);
  352. /* Explicitely put the direct connection option to 0 because this is client
  353. * side and there is no such thing as a non anonymous client. */
  354. ei = hs_get_extend_info_from_lspecs(lspecs, &ip->onion_key, 0);
  355. SMARTLIST_FOREACH(lspecs, link_specifier_t *, ls, link_specifier_free(ls));
  356. smartlist_free(lspecs);
  357. return ei;
  358. }
  359. /* Return true iff the intro point ip for the service service_pk is usable.
  360. * This function checks if the intro point is in the client intro state cache
  361. * and checks at the failures. It is considered usable if:
  362. * - No error happened (INTRO_POINT_FAILURE_GENERIC)
  363. * - It is not flagged as timed out (INTRO_POINT_FAILURE_TIMEOUT)
  364. * - The unreachable count is lower than
  365. * MAX_INTRO_POINT_REACHABILITY_FAILURES (INTRO_POINT_FAILURE_UNREACHABLE)
  366. */
  367. static int
  368. intro_point_is_usable(const ed25519_public_key_t *service_pk,
  369. const hs_desc_intro_point_t *ip)
  370. {
  371. const hs_cache_intro_state_t *state;
  372. tor_assert(service_pk);
  373. tor_assert(ip);
  374. state = hs_cache_client_intro_state_find(service_pk,
  375. &ip->auth_key_cert->signed_key);
  376. if (state == NULL) {
  377. /* This means we've never encountered any problem thus usable. */
  378. goto usable;
  379. }
  380. if (state->error) {
  381. log_info(LD_REND, "Intro point with auth key %s had an error. Not usable",
  382. safe_str_client(ed25519_fmt(&ip->auth_key_cert->signed_key)));
  383. goto not_usable;
  384. }
  385. if (state->timed_out) {
  386. log_info(LD_REND, "Intro point with auth key %s timed out. Not usable",
  387. safe_str_client(ed25519_fmt(&ip->auth_key_cert->signed_key)));
  388. goto not_usable;
  389. }
  390. if (state->unreachable_count >= MAX_INTRO_POINT_REACHABILITY_FAILURES) {
  391. log_info(LD_REND, "Intro point with auth key %s unreachable. Not usable",
  392. safe_str_client(ed25519_fmt(&ip->auth_key_cert->signed_key)));
  393. goto not_usable;
  394. }
  395. usable:
  396. return 1;
  397. not_usable:
  398. return 0;
  399. }
  400. /* Using a descriptor desc, return a newly allocated extend_info_t object of a
  401. * randomly picked introduction point from its list. Return NULL if none are
  402. * usable. */
  403. static extend_info_t *
  404. client_get_random_intro(const ed25519_public_key_t *service_pk)
  405. {
  406. extend_info_t *ei = NULL, *ei_excluded = NULL;
  407. smartlist_t *usable_ips = NULL;
  408. const hs_descriptor_t *desc;
  409. const hs_desc_encrypted_data_t *enc_data;
  410. const or_options_t *options = get_options();
  411. tor_assert(service_pk);
  412. desc = hs_cache_lookup_as_client(service_pk);
  413. if (desc == NULL || !hs_client_any_intro_points_usable(service_pk,
  414. desc)) {
  415. log_info(LD_REND, "Unable to randomly select an introduction point "
  416. "because descriptor %s.",
  417. (desc) ? "doesn't have usable intro point" : "is missing");
  418. goto end;
  419. }
  420. enc_data = &desc->encrypted_data;
  421. usable_ips = smartlist_new();
  422. smartlist_add_all(usable_ips, enc_data->intro_points);
  423. while (smartlist_len(usable_ips) != 0) {
  424. int idx;
  425. const hs_desc_intro_point_t *ip;
  426. /* Pick a random intro point and immediately remove it from the usable
  427. * list so we don't pick it again if we have to iterate more. */
  428. idx = crypto_rand_int(smartlist_len(usable_ips));
  429. ip = smartlist_get(usable_ips, idx);
  430. smartlist_del(usable_ips, idx);
  431. /* We need to make sure we have a usable intro points which is in a good
  432. * state in our cache. */
  433. if (!intro_point_is_usable(service_pk, ip)) {
  434. continue;
  435. }
  436. /* Generate an extend info object from the intro point object. */
  437. ei = desc_intro_point_to_extend_info(ip);
  438. if (ei == NULL) {
  439. /* We can get here for instance if the intro point is a private address
  440. * and we aren't allowed to extend to those. */
  441. continue;
  442. }
  443. /* Test the pick against ExcludeNodes. */
  444. if (routerset_contains_extendinfo(options->ExcludeNodes, ei)) {
  445. /* If this pick is in the ExcludeNodes list, we keep its reference so if
  446. * we ever end up not being able to pick anything else and StrictNodes is
  447. * unset, we'll use it. */
  448. ei_excluded = ei;
  449. continue;
  450. }
  451. /* Good pick! Let's go with this. */
  452. goto end;
  453. }
  454. /* Reaching this point means a couple of things. Either we can't use any of
  455. * the intro point listed because the IP address can't be extended to or it
  456. * is listed in the ExcludeNodes list. In the later case, if StrictNodes is
  457. * set, we are forced to not use anything. */
  458. ei = ei_excluded;
  459. if (options->StrictNodes) {
  460. log_warn(LD_REND, "Every introduction points are in the ExcludeNodes set "
  461. "and StrictNodes is set. We can't connect.");
  462. ei = NULL;
  463. }
  464. end:
  465. smartlist_free(usable_ips);
  466. return ei;
  467. }
  468. /* For this introduction circuit, we'll look at if we have any usable
  469. * introduction point left for this service. If so, we'll use the circuit to
  470. * re-extend to a new intro point. Else, we'll close the circuit and its
  471. * corresponding rendezvous circuit. Return 0 if we are re-extending else -1
  472. * if we are closing the circuits.
  473. *
  474. * This is called when getting an INTRODUCE_ACK cell with a NACK. */
  475. static int
  476. close_or_reextend_intro_circ(origin_circuit_t *intro_circ)
  477. {
  478. int ret = -1;
  479. const hs_descriptor_t *desc;
  480. origin_circuit_t *rend_circ;
  481. tor_assert(intro_circ);
  482. desc = hs_cache_lookup_as_client(&intro_circ->hs_ident->identity_pk);
  483. if (BUG(desc == NULL)) {
  484. /* We can't continue without a descriptor. */
  485. goto close;
  486. }
  487. /* We still have the descriptor, great! Let's try to see if we can
  488. * re-extend by looking up if there are any usable intro points. */
  489. if (!hs_client_any_intro_points_usable(&intro_circ->hs_ident->identity_pk,
  490. desc)) {
  491. goto close;
  492. }
  493. /* Try to re-extend now. */
  494. if (hs_client_reextend_intro_circuit(intro_circ) < 0) {
  495. goto close;
  496. }
  497. /* Success on re-extending. Don't return an error. */
  498. ret = 0;
  499. goto end;
  500. close:
  501. /* Change the intro circuit purpose before so we don't report an intro point
  502. * failure again triggering an extra descriptor fetch. The circuit can
  503. * already be closed on failure to re-extend. */
  504. if (!TO_CIRCUIT(intro_circ)->marked_for_close) {
  505. circuit_change_purpose(TO_CIRCUIT(intro_circ),
  506. CIRCUIT_PURPOSE_C_INTRODUCE_ACKED);
  507. circuit_mark_for_close(TO_CIRCUIT(intro_circ), END_CIRC_REASON_FINISHED);
  508. }
  509. /* Close the related rendezvous circuit. */
  510. rend_circ = hs_circuitmap_get_rend_circ_client_side(
  511. intro_circ->hs_ident->rendezvous_cookie);
  512. /* The rendezvous circuit might have collapsed while the INTRODUCE_ACK was
  513. * inflight so we can't expect one every time. */
  514. if (rend_circ) {
  515. circuit_mark_for_close(TO_CIRCUIT(rend_circ), END_CIRC_REASON_FINISHED);
  516. }
  517. end:
  518. return ret;
  519. }
  520. /* Called when we get an INTRODUCE_ACK success status code. Do the appropriate
  521. * actions for the rendezvous point and finally close intro_circ. */
  522. static void
  523. handle_introduce_ack_success(origin_circuit_t *intro_circ)
  524. {
  525. origin_circuit_t *rend_circ = NULL;
  526. tor_assert(intro_circ);
  527. log_info(LD_REND, "Received INTRODUCE_ACK ack! Informing rendezvous");
  528. /* Get the rendezvous circuit for this rendezvous cookie. */
  529. uint8_t *rendezvous_cookie = intro_circ->hs_ident->rendezvous_cookie;
  530. rend_circ = hs_circuitmap_get_rend_circ_client_side(rendezvous_cookie);
  531. if (rend_circ == NULL) {
  532. log_warn(LD_REND, "Can't find any rendezvous circuit. Stopping");
  533. goto end;
  534. }
  535. assert_circ_anonymity_ok(rend_circ, get_options());
  536. circuit_change_purpose(TO_CIRCUIT(rend_circ),
  537. CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED);
  538. /* Set timestamp_dirty, because circuit_expire_building expects it to
  539. * specify when a circuit entered the
  540. * CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED state. */
  541. TO_CIRCUIT(rend_circ)->timestamp_dirty = time(NULL);
  542. end:
  543. /* We don't need the intro circuit anymore. It did what it had to do! */
  544. circuit_change_purpose(TO_CIRCUIT(intro_circ),
  545. CIRCUIT_PURPOSE_C_INTRODUCE_ACKED);
  546. circuit_mark_for_close(TO_CIRCUIT(intro_circ), END_CIRC_REASON_FINISHED);
  547. /* XXX: Close pending intro circuits we might have in parallel. */
  548. return;
  549. }
  550. /* Called when we get an INTRODUCE_ACK failure status code. Depending on our
  551. * failure cache status, either close the circuit or re-extend to a new
  552. * introduction point. */
  553. static void
  554. handle_introduce_ack_bad(origin_circuit_t *circ, int status)
  555. {
  556. tor_assert(circ);
  557. log_info(LD_REND, "Received INTRODUCE_ACK nack by %s. Reason: %u",
  558. safe_str_client(extend_info_describe(circ->build_state->chosen_exit)),
  559. status);
  560. /* It's a NAK. The introduction point didn't relay our request. */
  561. circuit_change_purpose(TO_CIRCUIT(circ), CIRCUIT_PURPOSE_C_INTRODUCING);
  562. /* Note down this failure in the intro point failure cache. Depending on how
  563. * many times we've tried this intro point, close it or reextend. */
  564. hs_cache_client_intro_state_note(&circ->hs_ident->identity_pk,
  565. &circ->hs_ident->intro_auth_pk,
  566. INTRO_POINT_FAILURE_GENERIC);
  567. }
  568. /* Called when we get an INTRODUCE_ACK on the intro circuit circ. The encoded
  569. * cell is in payload of length payload_len. Return 0 on success else a
  570. * negative value. The circuit is either close or reuse to re-extend to a new
  571. * introduction point. */
  572. static int
  573. handle_introduce_ack(origin_circuit_t *circ, const uint8_t *payload,
  574. size_t payload_len)
  575. {
  576. int status, ret = -1;
  577. tor_assert(circ);
  578. tor_assert(circ->build_state);
  579. tor_assert(circ->build_state->chosen_exit);
  580. assert_circ_anonymity_ok(circ, get_options());
  581. tor_assert(payload);
  582. status = hs_cell_parse_introduce_ack(payload, payload_len);
  583. switch (status) {
  584. case HS_CELL_INTRO_ACK_SUCCESS:
  585. ret = 0;
  586. handle_introduce_ack_success(circ);
  587. goto end;
  588. case HS_CELL_INTRO_ACK_FAILURE:
  589. case HS_CELL_INTRO_ACK_BADFMT:
  590. case HS_CELL_INTRO_ACK_NORELAY:
  591. handle_introduce_ack_bad(circ, status);
  592. /* We are going to see if we have to close the circuits (IP and RP) or we
  593. * can re-extend to a new intro point. */
  594. ret = close_or_reextend_intro_circ(circ);
  595. break;
  596. default:
  597. log_info(LD_PROTOCOL, "Unknown INTRODUCE_ACK status code %u from %s",
  598. status,
  599. safe_str_client(extend_info_describe(circ->build_state->chosen_exit)));
  600. break;
  601. }
  602. end:
  603. return ret;
  604. }
  605. /* Called when we get a RENDEZVOUS2 cell on the rendezvous circuit circ. The
  606. * encoded cell is in payload of length payload_len. Return 0 on success or a
  607. * negative value on error. On error, the circuit is marked for close. */
  608. static int
  609. handle_rendezvous2(origin_circuit_t *circ, const uint8_t *payload,
  610. size_t payload_len)
  611. {
  612. int ret = -1;
  613. curve25519_public_key_t server_pk;
  614. uint8_t auth_mac[DIGEST256_LEN] = {0};
  615. uint8_t handshake_info[CURVE25519_PUBKEY_LEN + sizeof(auth_mac)] = {0};
  616. hs_ntor_rend_cell_keys_t keys;
  617. const hs_ident_circuit_t *ident;
  618. tor_assert(circ);
  619. tor_assert(payload);
  620. /* Make things easier. */
  621. ident = circ->hs_ident;
  622. tor_assert(ident);
  623. if (hs_cell_parse_rendezvous2(payload, payload_len, handshake_info,
  624. sizeof(handshake_info)) < 0) {
  625. goto err;
  626. }
  627. /* Get from the handshake info the SERVER_PK and AUTH_MAC. */
  628. memcpy(&server_pk, handshake_info, CURVE25519_PUBKEY_LEN);
  629. memcpy(auth_mac, handshake_info + CURVE25519_PUBKEY_LEN, sizeof(auth_mac));
  630. /* Generate the handshake info. */
  631. if (hs_ntor_client_get_rendezvous1_keys(&ident->intro_auth_pk,
  632. &ident->rendezvous_client_kp,
  633. &ident->intro_enc_pk, &server_pk,
  634. &keys) < 0) {
  635. log_info(LD_REND, "Unable to compute the rendezvous keys.");
  636. goto err;
  637. }
  638. /* Critical check, make sure that the MAC matches what we got with what we
  639. * computed just above. */
  640. if (!hs_ntor_client_rendezvous2_mac_is_good(&keys, auth_mac)) {
  641. log_info(LD_REND, "Invalid MAC in RENDEZVOUS2. Rejecting cell.");
  642. goto err;
  643. }
  644. /* Setup the e2e encryption on the circuit and finalize its state. */
  645. if (hs_circuit_setup_e2e_rend_circ(circ, keys.ntor_key_seed,
  646. sizeof(keys.ntor_key_seed), 0) < 0) {
  647. log_info(LD_REND, "Unable to setup the e2e encryption.");
  648. goto err;
  649. }
  650. /* Success. Hidden service connection finalized! */
  651. ret = 0;
  652. goto end;
  653. err:
  654. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  655. end:
  656. memwipe(&keys, 0, sizeof(keys));
  657. return ret;
  658. }
  659. /* ========== */
  660. /* Public API */
  661. /* ========== */
  662. /** A circuit just finished connecting to a hidden service that the stream
  663. * <b>conn</b> has been waiting for. Let the HS subsystem know about this. */
  664. void
  665. hs_client_note_connection_attempt_succeeded(const edge_connection_t *conn)
  666. {
  667. tor_assert(connection_edge_is_rendezvous_stream(conn));
  668. if (BUG(conn->rend_data && conn->hs_ident)) {
  669. log_warn(LD_BUG, "Stream had both rend_data and hs_ident..."
  670. "Prioritizing hs_ident");
  671. }
  672. if (conn->hs_ident) { /* It's v3: pass it to the prop224 handler */
  673. note_connection_attempt_succeeded(conn->hs_ident);
  674. return;
  675. } else if (conn->rend_data) { /* It's v2: pass it to the legacy handler */
  676. rend_client_note_connection_attempt_ended(conn->rend_data);
  677. return;
  678. }
  679. }
  680. /* With the given encoded descriptor in desc_str and the service key in
  681. * service_identity_pk, decode the descriptor and set the desc pointer with a
  682. * newly allocated descriptor object.
  683. *
  684. * Return 0 on success else a negative value and desc is set to NULL. */
  685. int
  686. hs_client_decode_descriptor(const char *desc_str,
  687. const ed25519_public_key_t *service_identity_pk,
  688. hs_descriptor_t **desc)
  689. {
  690. int ret;
  691. uint8_t subcredential[DIGEST256_LEN];
  692. tor_assert(desc_str);
  693. tor_assert(service_identity_pk);
  694. tor_assert(desc);
  695. /* Create subcredential for this HS so that we can decrypt */
  696. {
  697. ed25519_public_key_t blinded_pubkey;
  698. uint64_t current_time_period = hs_get_time_period_num(approx_time());
  699. hs_build_blinded_pubkey(service_identity_pk, NULL, 0, current_time_period,
  700. &blinded_pubkey);
  701. hs_get_subcredential(service_identity_pk, &blinded_pubkey, subcredential);
  702. }
  703. /* Parse descriptor */
  704. ret = hs_desc_decode_descriptor(desc_str, subcredential, desc);
  705. memwipe(subcredential, 0, sizeof(subcredential));
  706. if (ret < 0) {
  707. log_warn(LD_GENERAL, "Could not parse received descriptor as client");
  708. goto err;
  709. }
  710. return 0;
  711. err:
  712. return -1;
  713. }
  714. /* Return true iff there are at least one usable intro point in the service
  715. * descriptor desc. */
  716. int
  717. hs_client_any_intro_points_usable(const ed25519_public_key_t *service_pk,
  718. const hs_descriptor_t *desc)
  719. {
  720. tor_assert(service_pk);
  721. tor_assert(desc);
  722. SMARTLIST_FOREACH_BEGIN(desc->encrypted_data.intro_points,
  723. const hs_desc_intro_point_t *, ip) {
  724. if (intro_point_is_usable(service_pk, ip)) {
  725. goto usable;
  726. }
  727. } SMARTLIST_FOREACH_END(ip);
  728. return 0;
  729. usable:
  730. return 1;
  731. }
  732. /** Launch a connection to a hidden service directory to fetch a hidden
  733. * service descriptor using <b>identity_pk</b> to get the necessary keys.
  734. *
  735. * On success, 1 is returned. If no hidden service is left to ask, return 0.
  736. * On error, -1 is returned. (retval is only used by unittests right now) */
  737. int
  738. hs_client_refetch_hsdesc(const ed25519_public_key_t *identity_pk)
  739. {
  740. tor_assert(identity_pk);
  741. /* Are we configured to fetch descriptors? */
  742. if (!get_options()->FetchHidServDescriptors) {
  743. log_warn(LD_REND, "We received an onion address for a hidden service "
  744. "descriptor but we are configured to not fetch.");
  745. return 0;
  746. }
  747. /* Check if fetching a desc for this HS is useful to us right now */
  748. {
  749. const hs_descriptor_t *cached_desc = NULL;
  750. cached_desc = hs_cache_lookup_as_client(identity_pk);
  751. if (cached_desc && hs_client_any_intro_points_usable(identity_pk,
  752. cached_desc)) {
  753. log_warn(LD_GENERAL, "We would fetch a v3 hidden service descriptor "
  754. "but we already have a useable descriprot.");
  755. return 0;
  756. }
  757. }
  758. return fetch_v3_desc(identity_pk);
  759. }
  760. /* This is called when we are trying to attach an AP connection to these
  761. * hidden service circuits from connection_ap_handshake_attach_circuit().
  762. * Return 0 on success, -1 for a transient error that is actions were
  763. * triggered to recover or -2 for a permenent error where both circuits will
  764. * marked for close.
  765. *
  766. * The following supports every hidden service version. */
  767. int
  768. hs_client_send_introduce1(origin_circuit_t *intro_circ,
  769. origin_circuit_t *rend_circ)
  770. {
  771. return (intro_circ->hs_ident) ? send_introduce1(intro_circ, rend_circ) :
  772. rend_client_send_introduction(intro_circ,
  773. rend_circ);
  774. }
  775. /* Called when the client circuit circ has been established. It can be either
  776. * an introduction or rendezvous circuit. This function handles all hidden
  777. * service versions. */
  778. void
  779. hs_client_circuit_has_opened(origin_circuit_t *circ)
  780. {
  781. tor_assert(circ);
  782. /* Handle both version. v2 uses rend_data and v3 uses the hs circuit
  783. * identifier hs_ident. Can't be both. */
  784. switch (TO_CIRCUIT(circ)->purpose) {
  785. case CIRCUIT_PURPOSE_C_INTRODUCING:
  786. if (circ->hs_ident) {
  787. client_intro_circ_has_opened(circ);
  788. } else {
  789. rend_client_introcirc_has_opened(circ);
  790. }
  791. break;
  792. case CIRCUIT_PURPOSE_C_ESTABLISH_REND:
  793. if (circ->hs_ident) {
  794. client_rendezvous_circ_has_opened(circ);
  795. } else {
  796. rend_client_rendcirc_has_opened(circ);
  797. }
  798. break;
  799. default:
  800. tor_assert_nonfatal_unreached();
  801. }
  802. }
  803. /* Called when we receive a RENDEZVOUS_ESTABLISHED cell. Change the state of
  804. * the circuit to CIRCUIT_PURPOSE_C_REND_READY. Return 0 on success else a
  805. * negative value and the circuit marked for close. */
  806. int
  807. hs_client_receive_rendezvous_acked(origin_circuit_t *circ,
  808. const uint8_t *payload, size_t payload_len)
  809. {
  810. tor_assert(circ);
  811. tor_assert(payload);
  812. (void) payload_len;
  813. if (TO_CIRCUIT(circ)->purpose != CIRCUIT_PURPOSE_C_ESTABLISH_REND) {
  814. log_warn(LD_PROTOCOL, "Got a RENDEZVOUS_ESTABLISHED but we were not "
  815. "expecting one. Closing circuit.");
  816. goto err;
  817. }
  818. log_info(LD_REND, "Received an RENDEZVOUS_ESTABLISHED. This circuit is "
  819. "now ready for rendezvous.");
  820. circuit_change_purpose(TO_CIRCUIT(circ), CIRCUIT_PURPOSE_C_REND_READY);
  821. /* Set timestamp_dirty, because circuit_expire_building expects it to
  822. * specify when a circuit entered the _C_REND_READY state. */
  823. TO_CIRCUIT(circ)->timestamp_dirty = time(NULL);
  824. /* From a path bias point of view, this circuit is now successfully used.
  825. * Waiting any longer opens us up to attacks from malicious hidden services.
  826. * They could induce the client to attempt to connect to their hidden
  827. * service and never reply to the client's rend requests */
  828. pathbias_mark_use_success(circ);
  829. /* If we already have the introduction circuit built, make sure we send
  830. * the INTRODUCE cell _now_ */
  831. connection_ap_attach_pending(1);
  832. return 0;
  833. err:
  834. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  835. return -1;
  836. }
  837. /* This is called when a descriptor has arrived following a fetch request and
  838. * has been stored in the client cache. Every entry connection that matches
  839. * the service identity key in the ident will get attached to the hidden
  840. * service circuit. */
  841. void
  842. hs_client_desc_has_arrived(const hs_ident_dir_conn_t *ident)
  843. {
  844. time_t now = time(NULL);
  845. smartlist_t *conns = NULL;
  846. tor_assert(ident);
  847. conns = connection_list_by_type_state(CONN_TYPE_AP,
  848. AP_CONN_STATE_RENDDESC_WAIT);
  849. SMARTLIST_FOREACH_BEGIN(conns, connection_t *, base_conn) {
  850. const hs_descriptor_t *desc;
  851. entry_connection_t *entry_conn = TO_ENTRY_CONN(base_conn);
  852. const edge_connection_t *edge_conn = ENTRY_TO_EDGE_CONN(entry_conn);
  853. /* Only consider the entry connections that matches the service for which
  854. * we just fetched its descriptor. */
  855. if (!edge_conn->hs_ident ||
  856. !ed25519_pubkey_eq(&ident->identity_pk,
  857. &edge_conn->hs_ident->identity_pk)) {
  858. continue;
  859. }
  860. assert_connection_ok(base_conn, now);
  861. /* We were just called because we stored the descriptor for this service
  862. * so not finding a descriptor means we have a bigger problem. */
  863. desc = hs_cache_lookup_as_client(&ident->identity_pk);
  864. if (BUG(desc == NULL)) {
  865. goto end;
  866. }
  867. if (!hs_client_any_intro_points_usable(&ident->identity_pk, desc)) {
  868. log_info(LD_REND, "Hidden service descriptor is unusable. "
  869. "Closing streams.");
  870. connection_mark_unattached_ap(entry_conn,
  871. END_STREAM_REASON_RESOLVEFAILED);
  872. /* XXX: Note the connection attempt. */
  873. goto end;
  874. }
  875. log_info(LD_REND, "Descriptor has arrived. Launching circuits.");
  876. /* Restart their timeout values, so they get a fair shake at connecting to
  877. * the hidden service. XXX: Improve comment on why this is needed. */
  878. base_conn->timestamp_created = now;
  879. base_conn->timestamp_lastread = now;
  880. base_conn->timestamp_lastwritten = now;
  881. /* Change connection's state into waiting for a circuit. */
  882. base_conn->state = AP_CONN_STATE_CIRCUIT_WAIT;
  883. connection_ap_mark_as_pending_circuit(entry_conn);
  884. } SMARTLIST_FOREACH_END(base_conn);
  885. end:
  886. /* We don't have ownership of the objects in this list. */
  887. smartlist_free(conns);
  888. }
  889. /* Return a newly allocated extend_info_t for a randomly chosen introduction
  890. * point for the given edge connection identifier ident. Return NULL if we
  891. * can't pick any usable introduction points. */
  892. extend_info_t *
  893. hs_client_get_random_intro_from_edge(const edge_connection_t *edge_conn)
  894. {
  895. tor_assert(edge_conn);
  896. return (edge_conn->hs_ident) ?
  897. client_get_random_intro(&edge_conn->hs_ident->identity_pk) :
  898. rend_client_get_random_intro(edge_conn->rend_data);
  899. }
  900. /* Called when get an INTRODUCE_ACK cell on the introduction circuit circ.
  901. * Return 0 on success else a negative value is returned. The circuit will be
  902. * closed or reuse to extend again to another intro point. */
  903. int
  904. hs_client_receive_introduce_ack(origin_circuit_t *circ,
  905. const uint8_t *payload, size_t payload_len)
  906. {
  907. int ret = -1;
  908. tor_assert(circ);
  909. tor_assert(payload);
  910. if (TO_CIRCUIT(circ)->purpose != CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT) {
  911. log_warn(LD_PROTOCOL, "Unexpected INTRODUCE_ACK on circuit %u.",
  912. (unsigned int) TO_CIRCUIT(circ)->n_circ_id);
  913. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  914. goto end;
  915. }
  916. ret = (circ->hs_ident) ? handle_introduce_ack(circ, payload, payload_len) :
  917. rend_client_introduction_acked(circ, payload,
  918. payload_len);
  919. /* For path bias: This circuit was used successfully. NACK or ACK counts. */
  920. pathbias_mark_use_success(circ);
  921. end:
  922. return ret;
  923. }
  924. /* Called when get a RENDEZVOUS2 cell on the rendezvous circuit circ. Return
  925. * 0 on success else a negative value is returned. The circuit will be closed
  926. * on error. */
  927. int
  928. hs_client_receive_rendezvous2(origin_circuit_t *circ,
  929. const uint8_t *payload, size_t payload_len)
  930. {
  931. int ret = -1;
  932. tor_assert(circ);
  933. tor_assert(payload);
  934. /* Circuit can possibly be in both state because we could receive a
  935. * RENDEZVOUS2 cell before the INTRODUCE_ACK has been received. */
  936. if (TO_CIRCUIT(circ)->purpose != CIRCUIT_PURPOSE_C_REND_READY &&
  937. TO_CIRCUIT(circ)->purpose != CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED) {
  938. log_warn(LD_PROTOCOL, "Unexpected RENDEZVOUS2 cell on circuit %u. "
  939. "Closing circuit.",
  940. (unsigned int) TO_CIRCUIT(circ)->n_circ_id);
  941. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  942. goto end;
  943. }
  944. log_info(LD_REND, "Got RENDEZVOUS2 cell from hidden service on circuit %u.",
  945. TO_CIRCUIT(circ)->n_circ_id);
  946. ret = (circ->hs_ident) ? handle_rendezvous2(circ, payload, payload_len) :
  947. rend_client_receive_rendezvous(circ, payload,
  948. payload_len);
  949. end:
  950. return ret;
  951. }
  952. /* Extend the introduction circuit circ to another valid introduction point
  953. * for the hidden service it is trying to connect to, or mark it and launch a
  954. * new circuit if we can't extend it. Return 0 on success or possible
  955. * success. Return -1 and mark the introduction circuit for close on permanent
  956. * failure.
  957. *
  958. * On failure, the caller is responsible for marking the associated rendezvous
  959. * circuit for close. */
  960. int
  961. hs_client_reextend_intro_circuit(origin_circuit_t *circ)
  962. {
  963. int ret = -1;
  964. extend_info_t *ei;
  965. tor_assert(circ);
  966. ei = (circ->hs_ident) ?
  967. client_get_random_intro(&circ->hs_ident->identity_pk) :
  968. rend_client_get_random_intro(circ->rend_data);
  969. if (ei == NULL) {
  970. log_warn(LD_REND, "No usable introduction points left. Closing.");
  971. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_INTERNAL);
  972. goto end;
  973. }
  974. if (circ->remaining_relay_early_cells) {
  975. log_info(LD_REND, "Re-extending circ %u, this time to %s.",
  976. (unsigned int) TO_CIRCUIT(circ)->n_circ_id,
  977. safe_str_client(extend_info_describe(ei)));
  978. ret = circuit_extend_to_new_exit(circ, ei);
  979. } else {
  980. log_info(LD_REND, "Closing intro circ %u (out of RELAY_EARLY cells).",
  981. (unsigned int) TO_CIRCUIT(circ)->n_circ_id);
  982. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_FINISHED);
  983. /* connection_ap_handshake_attach_circuit will launch a new intro circ. */
  984. ret = 0;
  985. }
  986. end:
  987. extend_info_free(ei);
  988. return ret;
  989. }