rendclient.c 45 KB

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