rendclient.c 44 KB

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