rendclient.c 48 KB

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