rendclient.c 46 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240
  1. /* Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
  2. * Copyright (c) 2007-2019, The Tor Project, Inc. */
  3. /* See LICENSE for licensing information */
  4. /**
  5. * \file rendclient.c
  6. * \brief Client code to access location-hidden services.
  7. **/
  8. #include "core/or/or.h"
  9. #include "app/config/config.h"
  10. #include "core/mainloop/connection.h"
  11. #include "core/mainloop/mainloop.h"
  12. #include "core/or/circuitbuild.h"
  13. #include "core/or/circuitlist.h"
  14. #include "core/or/circuituse.h"
  15. #include "core/or/connection_edge.h"
  16. #include "core/or/relay.h"
  17. #include "feature/client/circpathbias.h"
  18. #include "feature/control/control_events.h"
  19. #include "feature/dirclient/dirclient.h"
  20. #include "feature/dircommon/directory.h"
  21. #include "feature/hs/hs_circuit.h"
  22. #include "feature/hs/hs_client.h"
  23. #include "feature/hs/hs_common.h"
  24. #include "feature/nodelist/describe.h"
  25. #include "feature/nodelist/networkstatus.h"
  26. #include "feature/nodelist/nodelist.h"
  27. #include "feature/nodelist/routerlist.h"
  28. #include "feature/nodelist/routerset.h"
  29. #include "feature/rend/rendclient.h"
  30. #include "feature/rend/rendcommon.h"
  31. #include "feature/stats/rephist.h"
  32. #include "lib/crypt_ops/crypto_dh.h"
  33. #include "lib/crypt_ops/crypto_rand.h"
  34. #include "lib/crypt_ops/crypto_util.h"
  35. #include "lib/encoding/confline.h"
  36. #include "core/or/cpath_build_state_st.h"
  37. #include "core/or/crypt_path_st.h"
  38. #include "feature/dircommon/dir_connection_st.h"
  39. #include "core/or/entry_connection_st.h"
  40. #include "core/or/extend_info_st.h"
  41. #include "core/or/origin_circuit_st.h"
  42. #include "feature/rend/rend_intro_point_st.h"
  43. #include "feature/rend/rend_service_descriptor_st.h"
  44. #include "feature/nodelist/routerstatus_st.h"
  45. static extend_info_t *rend_client_get_random_intro_impl(
  46. const rend_cache_entry_t *rend_query,
  47. const int strict, const int warnings);
  48. /** Purge all potentially remotely-detectable state held in the hidden
  49. * service client code. Called on SIGNAL NEWNYM. */
  50. void
  51. rend_client_purge_state(void)
  52. {
  53. rend_cache_purge();
  54. rend_cache_failure_purge();
  55. rend_client_cancel_descriptor_fetches();
  56. hs_purge_last_hid_serv_requests();
  57. }
  58. /** Called when we've established a circuit to an introduction point:
  59. * send the introduction request. */
  60. void
  61. rend_client_introcirc_has_opened(origin_circuit_t *circ)
  62. {
  63. tor_assert(circ->base_.purpose == CIRCUIT_PURPOSE_C_INTRODUCING);
  64. tor_assert(circ->cpath);
  65. log_info(LD_REND,"introcirc is open");
  66. connection_ap_attach_pending(1);
  67. }
  68. /** Send the establish-rendezvous cell along a rendezvous circuit. if
  69. * it fails, mark the circ for close and return -1. else return 0.
  70. */
  71. static int
  72. rend_client_send_establish_rendezvous(origin_circuit_t *circ)
  73. {
  74. tor_assert(circ->base_.purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND);
  75. tor_assert(circ->rend_data);
  76. log_info(LD_REND, "Sending an ESTABLISH_RENDEZVOUS cell");
  77. crypto_rand(circ->rend_data->rend_cookie, REND_COOKIE_LEN);
  78. /* Set timestamp_dirty, because circuit_expire_building expects it,
  79. * and the rend cookie also means we've used the circ. */
  80. circ->base_.timestamp_dirty = time(NULL);
  81. /* We've attempted to use this circuit. Probe it if we fail */
  82. pathbias_count_use_attempt(circ);
  83. if (relay_send_command_from_edge(0, TO_CIRCUIT(circ),
  84. RELAY_COMMAND_ESTABLISH_RENDEZVOUS,
  85. circ->rend_data->rend_cookie,
  86. REND_COOKIE_LEN,
  87. circ->cpath->prev)<0) {
  88. /* circ is already marked for close */
  89. log_warn(LD_GENERAL, "Couldn't send ESTABLISH_RENDEZVOUS cell");
  90. return -1;
  91. }
  92. return 0;
  93. }
  94. /** Called when we're trying to connect an ap conn; sends an INTRODUCE1 cell
  95. * down introcirc if possible.
  96. */
  97. int
  98. rend_client_send_introduction(origin_circuit_t *introcirc,
  99. origin_circuit_t *rendcirc)
  100. {
  101. const or_options_t *options = get_options();
  102. size_t payload_len;
  103. int r, v3_shift = 0;
  104. char payload[RELAY_PAYLOAD_SIZE];
  105. char tmp[RELAY_PAYLOAD_SIZE];
  106. rend_cache_entry_t *entry = NULL;
  107. crypt_path_t *cpath;
  108. ptrdiff_t dh_offset;
  109. crypto_pk_t *intro_key = NULL;
  110. int status = 0;
  111. const char *onion_address;
  112. tor_assert(introcirc->base_.purpose == CIRCUIT_PURPOSE_C_INTRODUCING);
  113. tor_assert(rendcirc->base_.purpose == CIRCUIT_PURPOSE_C_REND_READY);
  114. tor_assert(introcirc->rend_data);
  115. tor_assert(rendcirc->rend_data);
  116. tor_assert(!rend_cmp_service_ids(rend_data_get_address(introcirc->rend_data),
  117. rend_data_get_address(rendcirc->rend_data)));
  118. assert_circ_anonymity_ok(introcirc, options);
  119. assert_circ_anonymity_ok(rendcirc, options);
  120. onion_address = rend_data_get_address(introcirc->rend_data);
  121. r = rend_cache_lookup_entry(onion_address, -1, &entry);
  122. /* An invalid onion address is not possible else we have a big issue. */
  123. tor_assert(r != -EINVAL);
  124. if (r < 0 || !rend_client_any_intro_points_usable(entry)) {
  125. /* If the descriptor is not found or the intro points are not usable
  126. * anymore, trigger a fetch. */
  127. log_info(LD_REND,
  128. "query %s didn't have valid rend desc in cache. "
  129. "Refetching descriptor.",
  130. safe_str_client(onion_address));
  131. rend_client_refetch_v2_renddesc(introcirc->rend_data);
  132. {
  133. connection_t *conn;
  134. while ((conn = connection_get_by_type_state_rendquery(CONN_TYPE_AP,
  135. AP_CONN_STATE_CIRCUIT_WAIT, onion_address))) {
  136. connection_ap_mark_as_waiting_for_renddesc(TO_ENTRY_CONN(conn));
  137. }
  138. }
  139. status = -1;
  140. goto cleanup;
  141. }
  142. /* first 20 bytes of payload are the hash of the service's pk */
  143. intro_key = NULL;
  144. SMARTLIST_FOREACH(entry->parsed->intro_nodes, rend_intro_point_t *,
  145. intro, {
  146. if (tor_memeq(introcirc->build_state->chosen_exit->identity_digest,
  147. intro->extend_info->identity_digest, DIGEST_LEN)) {
  148. intro_key = intro->intro_key;
  149. break;
  150. }
  151. });
  152. if (!intro_key) {
  153. log_info(LD_REND, "Could not find intro key for %s at %s; we "
  154. "have a v2 rend desc with %d intro points. "
  155. "Trying a different intro point...",
  156. safe_str_client(onion_address),
  157. safe_str_client(extend_info_describe(
  158. introcirc->build_state->chosen_exit)),
  159. smartlist_len(entry->parsed->intro_nodes));
  160. if (hs_client_reextend_intro_circuit(introcirc)) {
  161. status = -2;
  162. goto perm_err;
  163. } else {
  164. status = -1;
  165. goto cleanup;
  166. }
  167. }
  168. if (crypto_pk_get_digest(intro_key, payload)<0) {
  169. log_warn(LD_BUG, "Internal error: couldn't hash public key.");
  170. status = -2;
  171. goto perm_err;
  172. }
  173. /* Initialize the pending_final_cpath and start the DH handshake. */
  174. cpath = rendcirc->build_state->pending_final_cpath;
  175. if (!cpath) {
  176. cpath = rendcirc->build_state->pending_final_cpath =
  177. tor_malloc_zero(sizeof(crypt_path_t));
  178. cpath->magic = CRYPT_PATH_MAGIC;
  179. if (!(cpath->rend_dh_handshake_state = crypto_dh_new(DH_TYPE_REND))) {
  180. log_warn(LD_BUG, "Internal error: couldn't allocate DH.");
  181. status = -2;
  182. goto perm_err;
  183. }
  184. if (crypto_dh_generate_public(cpath->rend_dh_handshake_state)<0) {
  185. log_warn(LD_BUG, "Internal error: couldn't generate g^x.");
  186. status = -2;
  187. goto perm_err;
  188. }
  189. }
  190. /* If version is 3, write (optional) auth data and timestamp. */
  191. if (entry->parsed->protocols & (1<<3)) {
  192. tmp[0] = 3; /* version 3 of the cell format */
  193. /* auth type, if any */
  194. tmp[1] = (uint8_t) TO_REND_DATA_V2(introcirc->rend_data)->auth_type;
  195. v3_shift = 1;
  196. if (tmp[1] != REND_NO_AUTH) {
  197. set_uint16(tmp+2, htons(REND_DESC_COOKIE_LEN));
  198. memcpy(tmp+4, TO_REND_DATA_V2(introcirc->rend_data)->descriptor_cookie,
  199. REND_DESC_COOKIE_LEN);
  200. v3_shift += 2+REND_DESC_COOKIE_LEN;
  201. }
  202. /* Once this held a timestamp. */
  203. set_uint32(tmp+v3_shift+1, 0);
  204. v3_shift += 4;
  205. } /* if version 2 only write version number */
  206. else if (entry->parsed->protocols & (1<<2)) {
  207. tmp[0] = 2; /* version 2 of the cell format */
  208. }
  209. /* write the remaining items into tmp */
  210. if (entry->parsed->protocols & (1<<3) || entry->parsed->protocols & (1<<2)) {
  211. /* version 2 format */
  212. extend_info_t *extend_info = rendcirc->build_state->chosen_exit;
  213. int klen;
  214. /* nul pads */
  215. set_uint32(tmp+v3_shift+1, tor_addr_to_ipv4n(&extend_info->addr));
  216. set_uint16(tmp+v3_shift+5, htons(extend_info->port));
  217. memcpy(tmp+v3_shift+7, extend_info->identity_digest, DIGEST_LEN);
  218. klen = crypto_pk_asn1_encode(extend_info->onion_key,
  219. tmp+v3_shift+7+DIGEST_LEN+2,
  220. sizeof(tmp)-(v3_shift+7+DIGEST_LEN+2));
  221. if (klen < 0) {
  222. log_warn(LD_BUG,"Internal error: can't encode public key.");
  223. status = -2;
  224. goto perm_err;
  225. }
  226. set_uint16(tmp+v3_shift+7+DIGEST_LEN, htons(klen));
  227. memcpy(tmp+v3_shift+7+DIGEST_LEN+2+klen, rendcirc->rend_data->rend_cookie,
  228. REND_COOKIE_LEN);
  229. dh_offset = v3_shift+7+DIGEST_LEN+2+klen+REND_COOKIE_LEN;
  230. } else {
  231. /* Version 0. */
  232. /* Some compilers are smart enough to work out that nickname can be more
  233. * than 19 characters, when it's a hexdigest. They warn that strncpy()
  234. * will truncate hexdigests without NUL-terminating them. But we only put
  235. * hexdigests in HSDir and general circuit exits. */
  236. if (BUG(strlen(rendcirc->build_state->chosen_exit->nickname)
  237. > MAX_NICKNAME_LEN)) {
  238. goto perm_err;
  239. }
  240. strncpy(tmp, rendcirc->build_state->chosen_exit->nickname,
  241. (MAX_NICKNAME_LEN+1)); /* nul pads */
  242. memcpy(tmp+MAX_NICKNAME_LEN+1, rendcirc->rend_data->rend_cookie,
  243. REND_COOKIE_LEN);
  244. dh_offset = MAX_NICKNAME_LEN+1+REND_COOKIE_LEN;
  245. }
  246. if (crypto_dh_get_public(cpath->rend_dh_handshake_state, tmp+dh_offset,
  247. DH1024_KEY_LEN)<0) {
  248. log_warn(LD_BUG, "Internal error: couldn't extract g^x.");
  249. status = -2;
  250. goto perm_err;
  251. }
  252. /*XXX maybe give crypto_pk_obsolete_public_hybrid_encrypt a max_len arg,
  253. * to avoid buffer overflows? */
  254. r = crypto_pk_obsolete_public_hybrid_encrypt(intro_key, payload+DIGEST_LEN,
  255. sizeof(payload)-DIGEST_LEN,
  256. tmp,
  257. (int)(dh_offset+DH1024_KEY_LEN),
  258. PK_PKCS1_OAEP_PADDING, 0);
  259. if (r<0) {
  260. log_warn(LD_BUG,"Internal error: hybrid pk encrypt failed.");
  261. status = -2;
  262. goto perm_err;
  263. }
  264. payload_len = DIGEST_LEN + r;
  265. tor_assert(payload_len <= RELAY_PAYLOAD_SIZE); /* we overran something */
  266. /* Copy the rendezvous cookie from rendcirc to introcirc, so that
  267. * when introcirc gets an ack, we can change the state of the right
  268. * rendezvous circuit. */
  269. memcpy(introcirc->rend_data->rend_cookie, rendcirc->rend_data->rend_cookie,
  270. REND_COOKIE_LEN);
  271. log_info(LD_REND, "Sending an INTRODUCE1 cell");
  272. if (relay_send_command_from_edge(0, TO_CIRCUIT(introcirc),
  273. RELAY_COMMAND_INTRODUCE1,
  274. payload, payload_len,
  275. introcirc->cpath->prev)<0) {
  276. /* introcirc is already marked for close. leave rendcirc alone. */
  277. log_warn(LD_BUG, "Couldn't send INTRODUCE1 cell");
  278. status = -2;
  279. goto cleanup;
  280. }
  281. /* Now, we wait for an ACK or NAK on this circuit. */
  282. circuit_change_purpose(TO_CIRCUIT(introcirc),
  283. CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT);
  284. /* Set timestamp_dirty, because circuit_expire_building expects it
  285. * to specify when a circuit entered the _C_INTRODUCE_ACK_WAIT
  286. * state. */
  287. introcirc->base_.timestamp_dirty = time(NULL);
  288. pathbias_count_use_attempt(introcirc);
  289. goto cleanup;
  290. perm_err:
  291. if (!introcirc->base_.marked_for_close)
  292. circuit_mark_for_close(TO_CIRCUIT(introcirc), END_CIRC_REASON_INTERNAL);
  293. circuit_mark_for_close(TO_CIRCUIT(rendcirc), END_CIRC_REASON_INTERNAL);
  294. cleanup:
  295. memwipe(payload, 0, sizeof(payload));
  296. memwipe(tmp, 0, sizeof(tmp));
  297. return status;
  298. }
  299. /** Called when a rendezvous circuit is open; sends a establish
  300. * rendezvous circuit as appropriate. */
  301. void
  302. rend_client_rendcirc_has_opened(origin_circuit_t *circ)
  303. {
  304. tor_assert(circ->base_.purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND);
  305. log_info(LD_REND,"rendcirc is open");
  306. /* generate a rendezvous cookie, store it in circ */
  307. if (rend_client_send_establish_rendezvous(circ) < 0) {
  308. return;
  309. }
  310. }
  311. /**
  312. * Called to close other intro circuits we launched in parallel.
  313. */
  314. static void
  315. rend_client_close_other_intros(const uint8_t *rend_pk_digest)
  316. {
  317. /* abort parallel intro circs, if any */
  318. SMARTLIST_FOREACH_BEGIN(circuit_get_global_list(), circuit_t *, c) {
  319. if ((c->purpose == CIRCUIT_PURPOSE_C_INTRODUCING ||
  320. c->purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT) &&
  321. !c->marked_for_close && CIRCUIT_IS_ORIGIN(c)) {
  322. origin_circuit_t *oc = TO_ORIGIN_CIRCUIT(c);
  323. if (oc->rend_data &&
  324. rend_circuit_pk_digest_eq(oc, rend_pk_digest)) {
  325. log_info(LD_REND|LD_CIRC, "Closing introduction circuit %d that we "
  326. "built in parallel (Purpose %d).", oc->global_identifier,
  327. c->purpose);
  328. circuit_mark_for_close(c, END_CIRC_REASON_IP_NOW_REDUNDANT);
  329. }
  330. }
  331. }
  332. SMARTLIST_FOREACH_END(c);
  333. }
  334. /** Called when get an ACK or a NAK for a REND_INTRODUCE1 cell.
  335. */
  336. int
  337. rend_client_introduction_acked(origin_circuit_t *circ,
  338. const uint8_t *request, size_t request_len)
  339. {
  340. const or_options_t *options = get_options();
  341. origin_circuit_t *rendcirc;
  342. (void) request; // XXXX Use this.
  343. tor_assert(circ->build_state);
  344. tor_assert(circ->build_state->chosen_exit);
  345. assert_circ_anonymity_ok(circ, options);
  346. tor_assert(circ->rend_data);
  347. if (request_len == 0) {
  348. /* It's an ACK; the introduction point relayed our introduction request. */
  349. /* Locate the rend circ which is waiting to hear about this ack,
  350. * and tell it.
  351. */
  352. log_info(LD_REND,"Received ack. Telling rend circ...");
  353. rendcirc = circuit_get_ready_rend_circ_by_rend_data(circ->rend_data);
  354. if (rendcirc) { /* remember the ack */
  355. assert_circ_anonymity_ok(rendcirc, options);
  356. circuit_change_purpose(TO_CIRCUIT(rendcirc),
  357. CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED);
  358. /* Set timestamp_dirty, because circuit_expire_building expects
  359. * it to specify when a circuit entered the
  360. * _C_REND_READY_INTRO_ACKED state. */
  361. rendcirc->base_.timestamp_dirty = time(NULL);
  362. } else {
  363. log_info(LD_REND,"...Found no rend circ. Dropping on the floor.");
  364. }
  365. /* Save the rend data digest to a temporary object so that we don't access
  366. * it after we mark the circuit for close. */
  367. const uint8_t *rend_digest_tmp = NULL;
  368. size_t digest_len;
  369. uint8_t *cached_rend_digest = NULL;
  370. rend_digest_tmp = rend_data_get_pk_digest(circ->rend_data, &digest_len);
  371. cached_rend_digest = tor_malloc_zero(digest_len);
  372. memcpy(cached_rend_digest, rend_digest_tmp, digest_len);
  373. /* close the circuit: we won't need it anymore. */
  374. circuit_change_purpose(TO_CIRCUIT(circ),
  375. CIRCUIT_PURPOSE_C_INTRODUCE_ACKED);
  376. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_FINISHED);
  377. /* close any other intros launched in parallel */
  378. rend_client_close_other_intros(cached_rend_digest);
  379. tor_free(cached_rend_digest); /* free the temporary digest */
  380. } else {
  381. /* It's a NAK; the introduction point didn't relay our request. */
  382. circuit_change_purpose(TO_CIRCUIT(circ), CIRCUIT_PURPOSE_C_INTRODUCING);
  383. /* Remove this intro point from the set of viable introduction
  384. * points. If any remain, extend to a new one and try again.
  385. * If none remain, refetch the service descriptor.
  386. */
  387. log_info(LD_REND, "Got nack for %s from %s...",
  388. safe_str_client(rend_data_get_address(circ->rend_data)),
  389. safe_str_client(extend_info_describe(circ->build_state->chosen_exit)));
  390. if (rend_client_report_intro_point_failure(circ->build_state->chosen_exit,
  391. circ->rend_data,
  392. INTRO_POINT_FAILURE_GENERIC)>0) {
  393. /* There are introduction points left. Re-extend the circuit to
  394. * another intro point and try again. */
  395. int result = hs_client_reextend_intro_circuit(circ);
  396. /* XXXX If that call failed, should we close the rend circuit,
  397. * too? */
  398. return result;
  399. } else {
  400. /* Close circuit because no more intro points are usable thus not
  401. * useful anymore. Change it's purpose before so we don't report an
  402. * intro point failure again triggering an extra descriptor fetch. */
  403. circuit_change_purpose(TO_CIRCUIT(circ),
  404. CIRCUIT_PURPOSE_C_INTRODUCE_ACKED);
  405. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_FINISHED);
  406. }
  407. }
  408. return 0;
  409. }
  410. /** Determine the responsible hidden service directories for <b>desc_id</b>
  411. * and fetch the descriptor with that ID from one of them. Only
  412. * send a request to a hidden service directory that we have not yet tried
  413. * during this attempt to connect to this hidden service; on success, return 1,
  414. * in the case that no hidden service directory is left to ask for the
  415. * descriptor, return 0, and in case of a failure -1. */
  416. static int
  417. directory_get_from_hs_dir(const char *desc_id,
  418. const rend_data_t *rend_query,
  419. routerstatus_t *rs_hsdir)
  420. {
  421. routerstatus_t *hs_dir = rs_hsdir;
  422. char *hsdir_fp;
  423. char desc_id_base32[REND_DESC_ID_V2_LEN_BASE32 + 1];
  424. char descriptor_cookie_base64[3*REND_DESC_COOKIE_LEN_BASE64];
  425. const rend_data_v2_t *rend_data;
  426. const int how_to_fetch = DIRIND_ANONYMOUS;
  427. tor_assert(desc_id);
  428. tor_assert(rend_query);
  429. rend_data = TO_REND_DATA_V2(rend_query);
  430. base32_encode(desc_id_base32, sizeof(desc_id_base32),
  431. desc_id, DIGEST_LEN);
  432. /* Automatically pick an hs dir if none given. */
  433. if (!rs_hsdir) {
  434. bool rate_limited = false;
  435. /* Determine responsible dirs. Even if we can't get all we want, work with
  436. * the ones we have. If it's empty, we'll notice in hs_pick_hsdir(). */
  437. smartlist_t *responsible_dirs = smartlist_new();
  438. hid_serv_get_responsible_directories(responsible_dirs, desc_id);
  439. hs_dir = hs_pick_hsdir(responsible_dirs, desc_id_base32, &rate_limited);
  440. if (!hs_dir) {
  441. /* No suitable hs dir can be found, stop right now. */
  442. const char *query_response = (rate_limited) ? "QUERY_RATE_LIMITED" :
  443. "QUERY_NO_HSDIR";
  444. control_event_hsv2_descriptor_failed(rend_query, NULL, query_response);
  445. control_event_hs_descriptor_content(rend_data_get_address(rend_query),
  446. desc_id_base32, NULL, NULL);
  447. return 0;
  448. }
  449. }
  450. /* Add a copy of the HSDir identity digest to the query so we can track it
  451. * on the control port. */
  452. hsdir_fp = tor_memdup(hs_dir->identity_digest,
  453. sizeof(hs_dir->identity_digest));
  454. smartlist_add(rend_query->hsdirs_fp, hsdir_fp);
  455. /* Encode descriptor cookie for logging purposes. Also, if the cookie is
  456. * malformed, no fetch is triggered thus this needs to be done before the
  457. * fetch request. */
  458. if (rend_data->auth_type != REND_NO_AUTH) {
  459. if (base64_encode(descriptor_cookie_base64,
  460. sizeof(descriptor_cookie_base64),
  461. rend_data->descriptor_cookie,
  462. REND_DESC_COOKIE_LEN,
  463. 0)<0) {
  464. log_warn(LD_BUG, "Could not base64-encode descriptor cookie.");
  465. control_event_hsv2_descriptor_failed(rend_query, hsdir_fp, "BAD_DESC");
  466. control_event_hs_descriptor_content(rend_data_get_address(rend_query),
  467. desc_id_base32, hsdir_fp, NULL);
  468. return 0;
  469. }
  470. /* Remove == signs. */
  471. descriptor_cookie_base64[strlen(descriptor_cookie_base64)-2] = '\0';
  472. } else {
  473. strlcpy(descriptor_cookie_base64, "(none)",
  474. sizeof(descriptor_cookie_base64));
  475. }
  476. /* Send fetch request. (Pass query and possibly descriptor cookie so that
  477. * they can be written to the directory connection and be referred to when
  478. * the response arrives. */
  479. directory_request_t *req =
  480. directory_request_new(DIR_PURPOSE_FETCH_RENDDESC_V2);
  481. directory_request_set_routerstatus(req, hs_dir);
  482. directory_request_set_indirection(req, how_to_fetch);
  483. directory_request_set_resource(req, desc_id_base32);
  484. directory_request_set_rend_query(req, rend_query);
  485. directory_initiate_request(req);
  486. directory_request_free(req);
  487. log_info(LD_REND, "Sending fetch request for v2 descriptor for "
  488. "service '%s' with descriptor ID '%s', auth type %d, "
  489. "and descriptor cookie '%s' to hidden service "
  490. "directory %s",
  491. rend_data->onion_address, desc_id_base32,
  492. rend_data->auth_type,
  493. (rend_data->auth_type == REND_NO_AUTH ? "[none]" :
  494. escaped_safe_str_client(descriptor_cookie_base64)),
  495. routerstatus_describe(hs_dir));
  496. control_event_hs_descriptor_requested(rend_data->onion_address,
  497. rend_data->auth_type,
  498. hs_dir->identity_digest,
  499. desc_id_base32, NULL);
  500. return 1;
  501. }
  502. /** Remove tracked HSDir requests from our history for this hidden service
  503. * descriptor <b>desc_id</b> (of size DIGEST_LEN) */
  504. static void
  505. purge_v2_hidserv_req(const char *desc_id)
  506. {
  507. char desc_id_base32[REND_DESC_ID_V2_LEN_BASE32 + 1];
  508. /* The hsdir request tracker stores v2 keys using the base32 encoded
  509. desc_id. Do it: */
  510. base32_encode(desc_id_base32, sizeof(desc_id_base32), desc_id,
  511. DIGEST_LEN);
  512. hs_purge_hid_serv_from_last_hid_serv_requests(desc_id_base32);
  513. }
  514. /** Fetch a v2 descriptor using the given descriptor id. If any hsdir(s) are
  515. * given, they will be used instead.
  516. *
  517. * On success, 1 is returned. If no hidden service is left to ask, return 0.
  518. * On error, -1 is returned. */
  519. static int
  520. fetch_v2_desc_by_descid(const char *desc_id,
  521. const rend_data_t *rend_query, smartlist_t *hsdirs)
  522. {
  523. int ret;
  524. tor_assert(rend_query);
  525. if (!hsdirs) {
  526. ret = directory_get_from_hs_dir(desc_id, rend_query, NULL);
  527. goto end; /* either success or failure, but we're done */
  528. }
  529. /* Using the given hsdir list, trigger a fetch on each of them. */
  530. SMARTLIST_FOREACH_BEGIN(hsdirs, routerstatus_t *, hs_dir) {
  531. /* This should always be a success. */
  532. ret = directory_get_from_hs_dir(desc_id, rend_query, hs_dir);
  533. tor_assert(ret);
  534. } SMARTLIST_FOREACH_END(hs_dir);
  535. /* Everything went well. */
  536. ret = 0;
  537. end:
  538. return ret;
  539. }
  540. /** Fetch a v2 descriptor using the onion address in the given query object.
  541. * This will compute the descriptor id for each replicas and fetch it on the
  542. * given hsdir(s) if any or the responsible ones that are chosen
  543. * automatically.
  544. *
  545. * On success, 1 is returned. If no hidden service is left to ask, return 0.
  546. * On error, -1 is returned. */
  547. static int
  548. fetch_v2_desc_by_addr(rend_data_t *rend_query, smartlist_t *hsdirs)
  549. {
  550. char descriptor_id[DIGEST_LEN];
  551. int replicas_left_to_try[REND_NUMBER_OF_NON_CONSECUTIVE_REPLICAS];
  552. int i, tries_left, ret;
  553. rend_data_v2_t *rend_data = TO_REND_DATA_V2(rend_query);
  554. /* Randomly iterate over the replicas until a descriptor can be fetched
  555. * from one of the consecutive nodes, or no options are left. */
  556. for (i = 0; i < REND_NUMBER_OF_NON_CONSECUTIVE_REPLICAS; i++) {
  557. replicas_left_to_try[i] = i;
  558. }
  559. tries_left = REND_NUMBER_OF_NON_CONSECUTIVE_REPLICAS;
  560. while (tries_left > 0) {
  561. int rand_val = crypto_rand_int(tries_left);
  562. int chosen_replica = replicas_left_to_try[rand_val];
  563. replicas_left_to_try[rand_val] = replicas_left_to_try[--tries_left];
  564. ret = rend_compute_v2_desc_id(descriptor_id,
  565. rend_data->onion_address,
  566. rend_data->auth_type == REND_STEALTH_AUTH ?
  567. rend_data->descriptor_cookie : NULL,
  568. time(NULL), chosen_replica);
  569. if (ret < 0) {
  570. /* Normally, on failure the descriptor_id is untouched but let's be
  571. * safe in general in case the function changes at some point. */
  572. goto end;
  573. }
  574. if (tor_memcmp(descriptor_id, rend_data->descriptor_id[chosen_replica],
  575. sizeof(descriptor_id)) != 0) {
  576. /* Not equal from what we currently have so purge the last hid serv
  577. * request cache and update the descriptor ID with the new value. */
  578. purge_v2_hidserv_req(rend_data->descriptor_id[chosen_replica]);
  579. memcpy(rend_data->descriptor_id[chosen_replica], descriptor_id,
  580. sizeof(rend_data->descriptor_id[chosen_replica]));
  581. }
  582. /* Trigger the fetch with the computed descriptor ID. */
  583. ret = fetch_v2_desc_by_descid(descriptor_id, rend_query, hsdirs);
  584. if (ret != 0) {
  585. /* Either on success or failure, as long as we tried a fetch we are
  586. * done here. */
  587. goto end;
  588. }
  589. }
  590. /* If we come here, there are no hidden service directories left. */
  591. log_info(LD_REND, "Could not pick one of the responsible hidden "
  592. "service directories to fetch descriptors, because "
  593. "we already tried them all unsuccessfully.");
  594. ret = 0;
  595. end:
  596. memwipe(descriptor_id, 0, sizeof(descriptor_id));
  597. return ret;
  598. }
  599. /** Fetch a v2 descriptor using the given query. If any hsdir are specified,
  600. * use them for the fetch.
  601. *
  602. * On success, 1 is returned. If no hidden service is left to ask, return 0.
  603. * On error, -1 is returned. */
  604. int
  605. rend_client_fetch_v2_desc(rend_data_t *query, smartlist_t *hsdirs)
  606. {
  607. int ret;
  608. rend_data_v2_t *rend_data;
  609. const char *onion_address;
  610. tor_assert(query);
  611. /* Get the version 2 data structure of the query. */
  612. rend_data = TO_REND_DATA_V2(query);
  613. onion_address = rend_data_get_address(query);
  614. /* Depending on what's available in the rend data query object, we will
  615. * trigger a fetch by HS address or using a descriptor ID. */
  616. if (onion_address[0] != '\0') {
  617. ret = fetch_v2_desc_by_addr(query, hsdirs);
  618. } else if (!tor_digest_is_zero(rend_data->desc_id_fetch)) {
  619. ret = fetch_v2_desc_by_descid(rend_data->desc_id_fetch, query,
  620. hsdirs);
  621. } else {
  622. /* Query data is invalid. */
  623. ret = -1;
  624. goto error;
  625. }
  626. error:
  627. return ret;
  628. }
  629. /** Unless we already have a descriptor for <b>rend_query</b> with at least
  630. * one (possibly) working introduction point in it, start a connection to a
  631. * hidden service directory to fetch a v2 rendezvous service descriptor. */
  632. void
  633. rend_client_refetch_v2_renddesc(rend_data_t *rend_query)
  634. {
  635. rend_cache_entry_t *e = NULL;
  636. const char *onion_address = rend_data_get_address(rend_query);
  637. tor_assert(rend_query);
  638. /* Before fetching, check if we already have a usable descriptor here. */
  639. if (rend_cache_lookup_entry(onion_address, -1, &e) == 0 &&
  640. rend_client_any_intro_points_usable(e)) {
  641. log_info(LD_REND, "We would fetch a v2 rendezvous descriptor, but we "
  642. "already have a usable descriptor here. Not fetching.");
  643. return;
  644. }
  645. /* Are we configured to fetch descriptors? */
  646. if (!get_options()->FetchHidServDescriptors) {
  647. log_warn(LD_REND, "We received an onion address for a v2 rendezvous "
  648. "service descriptor, but are not fetching service descriptors.");
  649. return;
  650. }
  651. log_debug(LD_REND, "Fetching v2 rendezvous descriptor for service %s",
  652. safe_str_client(onion_address));
  653. rend_client_fetch_v2_desc(rend_query, NULL);
  654. /* We don't need to look the error code because either on failure or
  655. * success, the necessary steps to continue the HS connection will be
  656. * triggered once the descriptor arrives or if all fetch failed. */
  657. return;
  658. }
  659. /** Cancel all rendezvous descriptor fetches currently in progress.
  660. */
  661. void
  662. rend_client_cancel_descriptor_fetches(void)
  663. {
  664. smartlist_t *connection_array = get_connection_array();
  665. SMARTLIST_FOREACH_BEGIN(connection_array, connection_t *, conn) {
  666. if (conn->type == CONN_TYPE_DIR &&
  667. conn->purpose == DIR_PURPOSE_FETCH_RENDDESC_V2) {
  668. /* It's a rendezvous descriptor fetch in progress -- cancel it
  669. * by marking the connection for close.
  670. *
  671. * Even if this connection has already reached EOF, this is
  672. * enough to make sure that if the descriptor hasn't been
  673. * processed yet, it won't be. See the end of
  674. * connection_handle_read; connection_reached_eof (indirectly)
  675. * processes whatever response the connection received. */
  676. const rend_data_t *rd = (TO_DIR_CONN(conn))->rend_data;
  677. if (!rd) {
  678. log_warn(LD_BUG | LD_REND,
  679. "Marking for close dir conn fetching rendezvous "
  680. "descriptor for unknown service!");
  681. } else {
  682. log_debug(LD_REND, "Marking for close dir conn fetching "
  683. "rendezvous descriptor for service %s",
  684. safe_str(rend_data_get_address(rd)));
  685. }
  686. connection_mark_for_close(conn);
  687. }
  688. } SMARTLIST_FOREACH_END(conn);
  689. }
  690. /** Mark <b>failed_intro</b> as a failed introduction point for the
  691. * hidden service specified by <b>rend_query</b>. If the HS now has no
  692. * usable intro points, or we do not have an HS descriptor for it,
  693. * then launch a new renddesc fetch.
  694. *
  695. * If <b>failure_type</b> is INTRO_POINT_FAILURE_GENERIC, remove the
  696. * intro point from (our parsed copy of) the HS descriptor.
  697. *
  698. * If <b>failure_type</b> is INTRO_POINT_FAILURE_TIMEOUT, mark the
  699. * intro point as 'timed out'; it will not be retried until the
  700. * current hidden service connection attempt has ended or it has
  701. * appeared in a newly fetched rendezvous descriptor.
  702. *
  703. * If <b>failure_type</b> is INTRO_POINT_FAILURE_UNREACHABLE,
  704. * increment the intro point's reachability-failure count; if it has
  705. * now failed MAX_INTRO_POINT_REACHABILITY_FAILURES or more times,
  706. * remove the intro point from (our parsed copy of) the HS descriptor.
  707. *
  708. * Return -1 if error, 0 if no usable intro points remain or service
  709. * unrecognized, 1 if recognized and some intro points remain.
  710. */
  711. int
  712. rend_client_report_intro_point_failure(extend_info_t *failed_intro,
  713. rend_data_t *rend_data,
  714. unsigned int failure_type)
  715. {
  716. int i, r;
  717. rend_cache_entry_t *ent;
  718. connection_t *conn;
  719. const char *onion_address = rend_data_get_address(rend_data);
  720. r = rend_cache_lookup_entry(onion_address, -1, &ent);
  721. if (r < 0) {
  722. /* Either invalid onion address or cache entry not found. */
  723. switch (-r) {
  724. case EINVAL:
  725. log_warn(LD_BUG, "Malformed service ID %s.",
  726. escaped_safe_str_client(onion_address));
  727. return -1;
  728. case ENOENT:
  729. log_info(LD_REND, "Unknown service %s. Re-fetching descriptor.",
  730. escaped_safe_str_client(onion_address));
  731. rend_client_refetch_v2_renddesc(rend_data);
  732. return 0;
  733. default:
  734. log_warn(LD_BUG, "Unknown cache lookup returned code: %d", r);
  735. return -1;
  736. }
  737. }
  738. /* The intro points are not checked here if they are usable or not because
  739. * this is called when an intro point circuit is closed thus there must be
  740. * at least one intro point that is usable and is about to be flagged. */
  741. for (i = 0; i < smartlist_len(ent->parsed->intro_nodes); i++) {
  742. rend_intro_point_t *intro = smartlist_get(ent->parsed->intro_nodes, i);
  743. if (tor_memeq(failed_intro->identity_digest,
  744. intro->extend_info->identity_digest, DIGEST_LEN)) {
  745. switch (failure_type) {
  746. default:
  747. log_warn(LD_BUG, "Unknown failure type %u. Removing intro point.",
  748. failure_type);
  749. tor_fragile_assert();
  750. /* fall through */
  751. case INTRO_POINT_FAILURE_GENERIC:
  752. rend_cache_intro_failure_note(failure_type,
  753. (uint8_t *)failed_intro->identity_digest,
  754. onion_address);
  755. rend_intro_point_free(intro);
  756. smartlist_del(ent->parsed->intro_nodes, i);
  757. break;
  758. case INTRO_POINT_FAILURE_TIMEOUT:
  759. intro->timed_out = 1;
  760. break;
  761. case INTRO_POINT_FAILURE_UNREACHABLE:
  762. ++(intro->unreachable_count);
  763. {
  764. int zap_intro_point =
  765. intro->unreachable_count >= MAX_INTRO_POINT_REACHABILITY_FAILURES;
  766. log_info(LD_REND, "Failed to reach this intro point %u times.%s",
  767. intro->unreachable_count,
  768. zap_intro_point ? " Removing from descriptor.": "");
  769. if (zap_intro_point) {
  770. rend_cache_intro_failure_note(
  771. failure_type,
  772. (uint8_t *) failed_intro->identity_digest, onion_address);
  773. rend_intro_point_free(intro);
  774. smartlist_del(ent->parsed->intro_nodes, i);
  775. }
  776. }
  777. break;
  778. }
  779. break;
  780. }
  781. }
  782. if (! rend_client_any_intro_points_usable(ent)) {
  783. log_info(LD_REND,
  784. "No more intro points remain for %s. Re-fetching descriptor.",
  785. escaped_safe_str_client(onion_address));
  786. rend_client_refetch_v2_renddesc(rend_data);
  787. /* move all pending streams back to renddesc_wait */
  788. /* NOTE: We can now do this faster, if we use pending_entry_connections */
  789. while ((conn = connection_get_by_type_state_rendquery(CONN_TYPE_AP,
  790. AP_CONN_STATE_CIRCUIT_WAIT,
  791. onion_address))) {
  792. connection_ap_mark_as_waiting_for_renddesc(TO_ENTRY_CONN(conn));
  793. }
  794. return 0;
  795. }
  796. log_info(LD_REND,"%d options left for %s.",
  797. smartlist_len(ent->parsed->intro_nodes),
  798. escaped_safe_str_client(onion_address));
  799. return 1;
  800. }
  801. /** The service sent us a rendezvous cell; join the circuits. */
  802. int
  803. rend_client_receive_rendezvous(origin_circuit_t *circ, const uint8_t *request,
  804. size_t request_len)
  805. {
  806. if (request_len != DH1024_KEY_LEN+DIGEST_LEN) {
  807. log_warn(LD_PROTOCOL,"Incorrect length (%d) on RENDEZVOUS2 cell.",
  808. (int)request_len);
  809. goto err;
  810. }
  811. if (hs_circuit_setup_e2e_rend_circ_legacy_client(circ, request) < 0) {
  812. log_warn(LD_GENERAL, "Failed to setup circ");
  813. goto err;
  814. }
  815. return 0;
  816. err:
  817. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  818. return -1;
  819. }
  820. /** Find all the apconns in state AP_CONN_STATE_RENDDESC_WAIT that are
  821. * waiting on <b>query</b>. If there's a working cache entry here with at
  822. * least one intro point, move them to the next state. */
  823. void
  824. rend_client_desc_trynow(const char *query)
  825. {
  826. entry_connection_t *conn;
  827. rend_cache_entry_t *entry;
  828. const rend_data_t *rend_data;
  829. time_t now = time(NULL);
  830. smartlist_t *conns = get_connection_array();
  831. SMARTLIST_FOREACH_BEGIN(conns, connection_t *, base_conn) {
  832. if (base_conn->type != CONN_TYPE_AP ||
  833. base_conn->state != AP_CONN_STATE_RENDDESC_WAIT ||
  834. base_conn->marked_for_close)
  835. continue;
  836. conn = TO_ENTRY_CONN(base_conn);
  837. rend_data = ENTRY_TO_EDGE_CONN(conn)->rend_data;
  838. if (!rend_data)
  839. continue;
  840. const char *onion_address = rend_data_get_address(rend_data);
  841. if (rend_cmp_service_ids(query, onion_address))
  842. continue;
  843. assert_connection_ok(base_conn, now);
  844. if (rend_cache_lookup_entry(onion_address, -1,
  845. &entry) == 0 &&
  846. rend_client_any_intro_points_usable(entry)) {
  847. /* either this fetch worked, or it failed but there was a
  848. * valid entry from before which we should reuse */
  849. log_info(LD_REND,"Rend desc is usable. Launching circuits.");
  850. base_conn->state = AP_CONN_STATE_CIRCUIT_WAIT;
  851. /* restart their timeout values, so they get a fair shake at
  852. * connecting to the hidden service. */
  853. base_conn->timestamp_created = now;
  854. base_conn->timestamp_last_read_allowed = now;
  855. base_conn->timestamp_last_write_allowed = now;
  856. connection_ap_mark_as_pending_circuit(conn);
  857. } else { /* 404, or fetch didn't get that far */
  858. log_notice(LD_REND,"Closing stream for '%s.onion': hidden service is "
  859. "unavailable (try again later).",
  860. safe_str_client(query));
  861. connection_mark_unattached_ap(conn, END_STREAM_REASON_RESOLVEFAILED);
  862. rend_client_note_connection_attempt_ended(rend_data);
  863. }
  864. } SMARTLIST_FOREACH_END(base_conn);
  865. }
  866. /** Clear temporary state used only during an attempt to connect to the
  867. * hidden service with <b>rend_data</b>. Called when a connection attempt
  868. * has ended; it is possible for this to be called multiple times while
  869. * handling an ended connection attempt, and any future changes to this
  870. * function must ensure it remains idempotent. */
  871. void
  872. rend_client_note_connection_attempt_ended(const rend_data_t *rend_data)
  873. {
  874. unsigned int have_onion = 0;
  875. rend_cache_entry_t *cache_entry = NULL;
  876. const char *onion_address = rend_data_get_address(rend_data);
  877. rend_data_v2_t *rend_data_v2 = TO_REND_DATA_V2(rend_data);
  878. if (onion_address[0] != '\0') {
  879. /* Ignore return value; we find an entry, or we don't. */
  880. (void) rend_cache_lookup_entry(onion_address, -1, &cache_entry);
  881. have_onion = 1;
  882. }
  883. /* Clear the timed_out flag on all remaining intro points for this HS. */
  884. if (cache_entry != NULL) {
  885. SMARTLIST_FOREACH(cache_entry->parsed->intro_nodes,
  886. rend_intro_point_t *, ip,
  887. ip->timed_out = 0; );
  888. }
  889. /* Remove the HS's entries in last_hid_serv_requests. */
  890. if (have_onion) {
  891. unsigned int replica;
  892. for (replica = 0; replica < ARRAY_LENGTH(rend_data_v2->descriptor_id);
  893. replica++) {
  894. const char *desc_id = rend_data_v2->descriptor_id[replica];
  895. purge_v2_hidserv_req(desc_id);
  896. }
  897. log_info(LD_REND, "Connection attempt for %s has ended; "
  898. "cleaning up temporary state.",
  899. safe_str_client(onion_address));
  900. } else {
  901. /* We only have an ID for a fetch. Probably used by HSFETCH. */
  902. purge_v2_hidserv_req(rend_data_v2->desc_id_fetch);
  903. }
  904. }
  905. /** Return a newly allocated extend_info_t* for a randomly chosen introduction
  906. * point for the named hidden service. Return NULL if all introduction points
  907. * have been tried and failed.
  908. */
  909. extend_info_t *
  910. rend_client_get_random_intro(const rend_data_t *rend_query)
  911. {
  912. int ret;
  913. extend_info_t *result;
  914. rend_cache_entry_t *entry;
  915. const char *onion_address = rend_data_get_address(rend_query);
  916. ret = rend_cache_lookup_entry(onion_address, -1, &entry);
  917. if (ret < 0 || !rend_client_any_intro_points_usable(entry)) {
  918. log_warn(LD_REND,
  919. "Query '%s' didn't have valid rend desc in cache. Failing.",
  920. safe_str_client(onion_address));
  921. /* XXX: Should we refetch the descriptor here if the IPs are not usable
  922. * anymore ?. */
  923. return NULL;
  924. }
  925. /* See if we can get a node that complies with ExcludeNodes */
  926. if ((result = rend_client_get_random_intro_impl(entry, 1, 1)))
  927. return result;
  928. /* If not, and StrictNodes is not set, see if we can return any old node
  929. */
  930. if (!get_options()->StrictNodes)
  931. return rend_client_get_random_intro_impl(entry, 0, 1);
  932. return NULL;
  933. }
  934. /** As rend_client_get_random_intro, except assume that StrictNodes is set
  935. * iff <b>strict</b> is true. If <b>warnings</b> is false, don't complain
  936. * to the user when we're out of nodes, even if StrictNodes is true.
  937. */
  938. static extend_info_t *
  939. rend_client_get_random_intro_impl(const rend_cache_entry_t *entry,
  940. const int strict,
  941. const int warnings)
  942. {
  943. int i;
  944. rend_intro_point_t *intro;
  945. const or_options_t *options = get_options();
  946. smartlist_t *usable_nodes;
  947. int n_excluded = 0;
  948. /* We'll keep a separate list of the usable nodes. If this becomes empty,
  949. * no nodes are usable. */
  950. usable_nodes = smartlist_new();
  951. smartlist_add_all(usable_nodes, entry->parsed->intro_nodes);
  952. /* Remove the intro points that have timed out during this HS
  953. * connection attempt from our list of usable nodes. */
  954. SMARTLIST_FOREACH(usable_nodes, rend_intro_point_t *, ip,
  955. if (ip->timed_out) {
  956. SMARTLIST_DEL_CURRENT(usable_nodes, ip);
  957. });
  958. again:
  959. if (smartlist_len(usable_nodes) == 0) {
  960. if (n_excluded && get_options()->StrictNodes && warnings) {
  961. /* We only want to warn if StrictNodes is really set. Otherwise
  962. * we're just about to retry anyways.
  963. */
  964. log_warn(LD_REND, "All introduction points for hidden service are "
  965. "at excluded relays, and StrictNodes is set. Skipping.");
  966. }
  967. smartlist_free(usable_nodes);
  968. return NULL;
  969. }
  970. i = crypto_rand_int(smartlist_len(usable_nodes));
  971. intro = smartlist_get(usable_nodes, i);
  972. if (BUG(!intro->extend_info)) {
  973. /* This should never happen, but it isn't fatal, just try another */
  974. smartlist_del(usable_nodes, i);
  975. goto again;
  976. }
  977. /* All version 2 HS descriptors come with a TAP onion key.
  978. * Clients used to try to get the TAP onion key from the consensus, but this
  979. * meant that hidden services could discover which consensus clients have. */
  980. if (!extend_info_supports_tap(intro->extend_info)) {
  981. log_info(LD_REND, "The HS descriptor is missing a TAP onion key for the "
  982. "intro-point relay '%s'; trying another.",
  983. safe_str_client(extend_info_describe(intro->extend_info)));
  984. smartlist_del(usable_nodes, i);
  985. goto again;
  986. }
  987. /* Check if we should refuse to talk to this router. */
  988. if (strict &&
  989. routerset_contains_extendinfo(options->ExcludeNodes,
  990. intro->extend_info)) {
  991. n_excluded++;
  992. smartlist_del(usable_nodes, i);
  993. goto again;
  994. }
  995. smartlist_free(usable_nodes);
  996. return extend_info_dup(intro->extend_info);
  997. }
  998. /** Return true iff any introduction points still listed in <b>entry</b> are
  999. * usable. */
  1000. int
  1001. rend_client_any_intro_points_usable(const rend_cache_entry_t *entry)
  1002. {
  1003. extend_info_t *extend_info =
  1004. rend_client_get_random_intro_impl(entry, get_options()->StrictNodes, 0);
  1005. int rv = (extend_info != NULL);
  1006. extend_info_free(extend_info);
  1007. return rv;
  1008. }
  1009. /** Client-side authorizations for hidden services; map of onion address to
  1010. * rend_service_authorization_t*. */
  1011. static strmap_t *auth_hid_servs = NULL;
  1012. /** Look up the client-side authorization for the hidden service with
  1013. * <b>onion_address</b>. Return NULL if no authorization is available for
  1014. * that address. */
  1015. rend_service_authorization_t*
  1016. rend_client_lookup_service_authorization(const char *onion_address)
  1017. {
  1018. tor_assert(onion_address);
  1019. if (!auth_hid_servs) return NULL;
  1020. return strmap_get(auth_hid_servs, onion_address);
  1021. }
  1022. #define rend_service_authorization_free(val) \
  1023. FREE_AND_NULL(rend_service_authorization_t, \
  1024. rend_service_authorization_free_, (val))
  1025. /** Helper: Free storage held by rend_service_authorization_t. */
  1026. static void
  1027. rend_service_authorization_free_(rend_service_authorization_t *auth)
  1028. {
  1029. tor_free(auth);
  1030. }
  1031. /** Helper for strmap_free. */
  1032. static void
  1033. rend_service_authorization_free_void(void *service_auth)
  1034. {
  1035. rend_service_authorization_free_(service_auth);
  1036. }
  1037. /** Release all the storage held in auth_hid_servs.
  1038. */
  1039. void
  1040. rend_service_authorization_free_all(void)
  1041. {
  1042. if (!auth_hid_servs) {
  1043. return;
  1044. }
  1045. strmap_free(auth_hid_servs, rend_service_authorization_free_void);
  1046. auth_hid_servs = NULL;
  1047. }
  1048. /** Parse <b>config_line</b> as a client-side authorization for a hidden
  1049. * service and add it to the local map of hidden service authorizations.
  1050. * Return 0 for success and -1 for failure. */
  1051. int
  1052. rend_parse_service_authorization(const or_options_t *options,
  1053. int validate_only)
  1054. {
  1055. config_line_t *line;
  1056. int res = -1;
  1057. strmap_t *parsed = strmap_new();
  1058. smartlist_t *sl = smartlist_new();
  1059. rend_service_authorization_t *auth = NULL;
  1060. char *err_msg = NULL;
  1061. for (line = options->HidServAuth; line; line = line->next) {
  1062. char *onion_address, *descriptor_cookie;
  1063. auth = NULL;
  1064. SMARTLIST_FOREACH(sl, char *, c, tor_free(c););
  1065. smartlist_clear(sl);
  1066. smartlist_split_string(sl, line->value, " ",
  1067. SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 3);
  1068. if (smartlist_len(sl) < 2) {
  1069. log_warn(LD_CONFIG, "Configuration line does not consist of "
  1070. "\"onion-address authorization-cookie [service-name]\": "
  1071. "'%s'", line->value);
  1072. goto err;
  1073. }
  1074. auth = tor_malloc_zero(sizeof(rend_service_authorization_t));
  1075. /* Parse onion address. */
  1076. onion_address = smartlist_get(sl, 0);
  1077. if (strlen(onion_address) != REND_SERVICE_ADDRESS_LEN ||
  1078. strcmpend(onion_address, ".onion")) {
  1079. log_warn(LD_CONFIG, "Onion address has wrong format: '%s'",
  1080. onion_address);
  1081. goto err;
  1082. }
  1083. strlcpy(auth->onion_address, onion_address, REND_SERVICE_ID_LEN_BASE32+1);
  1084. if (!rend_valid_v2_service_id(auth->onion_address)) {
  1085. log_warn(LD_CONFIG, "Onion address has wrong format: '%s'",
  1086. onion_address);
  1087. goto err;
  1088. }
  1089. /* Parse descriptor cookie. */
  1090. descriptor_cookie = smartlist_get(sl, 1);
  1091. if (rend_auth_decode_cookie(descriptor_cookie, auth->descriptor_cookie,
  1092. &auth->auth_type, &err_msg) < 0) {
  1093. tor_assert(err_msg);
  1094. log_warn(LD_CONFIG, "%s", err_msg);
  1095. tor_free(err_msg);
  1096. goto err;
  1097. }
  1098. if (strmap_get(parsed, auth->onion_address)) {
  1099. log_warn(LD_CONFIG, "Duplicate authorization for the same hidden "
  1100. "service.");
  1101. goto err;
  1102. }
  1103. strmap_set(parsed, auth->onion_address, auth);
  1104. auth = NULL;
  1105. }
  1106. res = 0;
  1107. goto done;
  1108. err:
  1109. res = -1;
  1110. done:
  1111. rend_service_authorization_free(auth);
  1112. SMARTLIST_FOREACH(sl, char *, c, tor_free(c););
  1113. smartlist_free(sl);
  1114. if (!validate_only && res == 0) {
  1115. rend_service_authorization_free_all();
  1116. auth_hid_servs = parsed;
  1117. } else {
  1118. strmap_free(parsed, rend_service_authorization_free_void);
  1119. }
  1120. return res;
  1121. }