rendclient.c 56 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540
  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. note_crypto_pk_op(REND_CLIENT);
  265. /*XXX maybe give crypto_pk_public_hybrid_encrypt a max_len arg,
  266. * to avoid buffer overflows? */
  267. r = crypto_pk_public_hybrid_encrypt(intro_key, payload+DIGEST_LEN,
  268. sizeof(payload)-DIGEST_LEN,
  269. tmp,
  270. (int)(dh_offset+DH_KEY_LEN),
  271. PK_PKCS1_OAEP_PADDING, 0);
  272. if (r<0) {
  273. log_warn(LD_BUG,"Internal error: hybrid pk encrypt failed.");
  274. status = -2;
  275. goto perm_err;
  276. }
  277. payload_len = DIGEST_LEN + r;
  278. tor_assert(payload_len <= RELAY_PAYLOAD_SIZE); /* we overran something */
  279. /* Copy the rendezvous cookie from rendcirc to introcirc, so that
  280. * when introcirc gets an ack, we can change the state of the right
  281. * rendezvous circuit. */
  282. memcpy(introcirc->rend_data->rend_cookie, rendcirc->rend_data->rend_cookie,
  283. REND_COOKIE_LEN);
  284. log_info(LD_REND, "Sending an INTRODUCE1 cell");
  285. if (relay_send_command_from_edge(0, TO_CIRCUIT(introcirc),
  286. RELAY_COMMAND_INTRODUCE1,
  287. payload, payload_len,
  288. introcirc->cpath->prev)<0) {
  289. /* introcirc is already marked for close. leave rendcirc alone. */
  290. log_warn(LD_BUG, "Couldn't send INTRODUCE1 cell");
  291. status = -2;
  292. goto cleanup;
  293. }
  294. /* Now, we wait for an ACK or NAK on this circuit. */
  295. circuit_change_purpose(TO_CIRCUIT(introcirc),
  296. CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT);
  297. /* Set timestamp_dirty, because circuit_expire_building expects it
  298. * to specify when a circuit entered the _C_INTRODUCE_ACK_WAIT
  299. * state. */
  300. introcirc->base_.timestamp_dirty = time(NULL);
  301. pathbias_count_use_attempt(introcirc);
  302. goto cleanup;
  303. perm_err:
  304. if (!introcirc->base_.marked_for_close)
  305. circuit_mark_for_close(TO_CIRCUIT(introcirc), END_CIRC_REASON_INTERNAL);
  306. circuit_mark_for_close(TO_CIRCUIT(rendcirc), END_CIRC_REASON_INTERNAL);
  307. cleanup:
  308. memwipe(payload, 0, sizeof(payload));
  309. memwipe(tmp, 0, sizeof(tmp));
  310. return status;
  311. }
  312. /** Called when a rendezvous circuit is open; sends a establish
  313. * rendezvous circuit as appropriate. */
  314. void
  315. rend_client_rendcirc_has_opened(origin_circuit_t *circ)
  316. {
  317. tor_assert(circ->base_.purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND);
  318. log_info(LD_REND,"rendcirc is open");
  319. /* generate a rendezvous cookie, store it in circ */
  320. if (rend_client_send_establish_rendezvous(circ) < 0) {
  321. return;
  322. }
  323. }
  324. /**
  325. * Called to close other intro circuits we launched in parallel.
  326. */
  327. static void
  328. rend_client_close_other_intros(const uint8_t *rend_pk_digest)
  329. {
  330. /* abort parallel intro circs, if any */
  331. SMARTLIST_FOREACH_BEGIN(circuit_get_global_list(), circuit_t *, c) {
  332. if ((c->purpose == CIRCUIT_PURPOSE_C_INTRODUCING ||
  333. c->purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT) &&
  334. !c->marked_for_close && CIRCUIT_IS_ORIGIN(c)) {
  335. origin_circuit_t *oc = TO_ORIGIN_CIRCUIT(c);
  336. if (oc->rend_data &&
  337. rend_circuit_pk_digest_eq(oc, rend_pk_digest)) {
  338. log_info(LD_REND|LD_CIRC, "Closing introduction circuit %d that we "
  339. "built in parallel (Purpose %d).", oc->global_identifier,
  340. c->purpose);
  341. circuit_mark_for_close(c, END_CIRC_REASON_IP_NOW_REDUNDANT);
  342. }
  343. }
  344. }
  345. SMARTLIST_FOREACH_END(c);
  346. }
  347. /** Called when get an ACK or a NAK for a REND_INTRODUCE1 cell.
  348. */
  349. int
  350. rend_client_introduction_acked(origin_circuit_t *circ,
  351. const uint8_t *request, size_t request_len)
  352. {
  353. const or_options_t *options = get_options();
  354. origin_circuit_t *rendcirc;
  355. (void) request; // XXXX Use this.
  356. if (circ->base_.purpose != CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT) {
  357. log_warn(LD_PROTOCOL,
  358. "Received REND_INTRODUCE_ACK on unexpected circuit %u.",
  359. (unsigned)circ->base_.n_circ_id);
  360. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  361. return -1;
  362. }
  363. tor_assert(circ->build_state);
  364. tor_assert(circ->build_state->chosen_exit);
  365. assert_circ_anonymity_ok(circ, options);
  366. tor_assert(circ->rend_data);
  367. /* For path bias: This circuit was used successfully. Valid
  368. * nacks and acks count. */
  369. pathbias_mark_use_success(circ);
  370. if (request_len == 0) {
  371. /* It's an ACK; the introduction point relayed our introduction request. */
  372. /* Locate the rend circ which is waiting to hear about this ack,
  373. * and tell it.
  374. */
  375. log_info(LD_REND,"Received ack. Telling rend circ...");
  376. rendcirc = circuit_get_ready_rend_circ_by_rend_data(circ->rend_data);
  377. if (rendcirc) { /* remember the ack */
  378. assert_circ_anonymity_ok(rendcirc, options);
  379. circuit_change_purpose(TO_CIRCUIT(rendcirc),
  380. CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED);
  381. /* Set timestamp_dirty, because circuit_expire_building expects
  382. * it to specify when a circuit entered the
  383. * _C_REND_READY_INTRO_ACKED state. */
  384. rendcirc->base_.timestamp_dirty = time(NULL);
  385. } else {
  386. log_info(LD_REND,"...Found no rend circ. Dropping on the floor.");
  387. }
  388. /* close the circuit: we won't need it anymore. */
  389. circuit_change_purpose(TO_CIRCUIT(circ),
  390. CIRCUIT_PURPOSE_C_INTRODUCE_ACKED);
  391. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_FINISHED);
  392. /* close any other intros launched in parallel */
  393. rend_client_close_other_intros(rend_data_get_pk_digest(circ->rend_data,
  394. NULL));
  395. } else {
  396. /* It's a NAK; the introduction point didn't relay our request. */
  397. circuit_change_purpose(TO_CIRCUIT(circ), CIRCUIT_PURPOSE_C_INTRODUCING);
  398. /* Remove this intro point from the set of viable introduction
  399. * points. If any remain, extend to a new one and try again.
  400. * If none remain, refetch the service descriptor.
  401. */
  402. log_info(LD_REND, "Got nack for %s from %s...",
  403. safe_str_client(rend_data_get_address(circ->rend_data)),
  404. safe_str_client(extend_info_describe(circ->build_state->chosen_exit)));
  405. if (rend_client_report_intro_point_failure(circ->build_state->chosen_exit,
  406. circ->rend_data,
  407. INTRO_POINT_FAILURE_GENERIC)>0) {
  408. /* There are introduction points left. Re-extend the circuit to
  409. * another intro point and try again. */
  410. int result = rend_client_reextend_intro_circuit(circ);
  411. /* XXXX If that call failed, should we close the rend circuit,
  412. * too? */
  413. return result;
  414. } else {
  415. /* Close circuit because no more intro points are usable thus not
  416. * useful anymore. Change it's purpose before so we don't report an
  417. * intro point failure again triggering an extra descriptor fetch. */
  418. circuit_change_purpose(TO_CIRCUIT(circ),
  419. CIRCUIT_PURPOSE_C_INTRODUCE_ACKED);
  420. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_FINISHED);
  421. }
  422. }
  423. return 0;
  424. }
  425. /** The period for which a hidden service directory cannot be queried for
  426. * the same descriptor ID again. */
  427. #define REND_HID_SERV_DIR_REQUERY_PERIOD (15 * 60)
  428. /** Test networks generate a new consensus every 5 or 10 seconds.
  429. * So allow them to requery HSDirs much faster. */
  430. #define REND_HID_SERV_DIR_REQUERY_PERIOD_TESTING (5)
  431. /** Return the period for which a hidden service directory cannot be queried
  432. * for the same descriptor ID again, taking TestingTorNetwork into account. */
  433. static time_t
  434. hsdir_requery_period(const or_options_t *options)
  435. {
  436. tor_assert(options);
  437. if (options->TestingTorNetwork) {
  438. return REND_HID_SERV_DIR_REQUERY_PERIOD_TESTING;
  439. } else {
  440. return REND_HID_SERV_DIR_REQUERY_PERIOD;
  441. }
  442. }
  443. /** Contains the last request times to hidden service directories for
  444. * certain queries; each key is a string consisting of the
  445. * concatenation of a base32-encoded HS directory identity digest and
  446. * base32-encoded HS descriptor ID; each value is a pointer to a time_t
  447. * holding the time of the last request for that descriptor ID to that
  448. * HS directory. */
  449. static strmap_t *last_hid_serv_requests_ = NULL;
  450. /** Returns last_hid_serv_requests_, initializing it to a new strmap if
  451. * necessary. */
  452. static strmap_t *
  453. get_last_hid_serv_requests(void)
  454. {
  455. if (!last_hid_serv_requests_)
  456. last_hid_serv_requests_ = strmap_new();
  457. return last_hid_serv_requests_;
  458. }
  459. #define LAST_HID_SERV_REQUEST_KEY_LEN (REND_DESC_ID_V2_LEN_BASE32 + \
  460. REND_DESC_ID_V2_LEN_BASE32)
  461. /** Look up the last request time to hidden service directory <b>hs_dir</b>
  462. * for descriptor ID <b>desc_id_base32</b>. If <b>set</b> is non-zero,
  463. * assign the current time <b>now</b> and return that. Otherwise, return the
  464. * most recent request time, or 0 if no such request has been sent before.
  465. */
  466. static time_t
  467. lookup_last_hid_serv_request(routerstatus_t *hs_dir,
  468. const char *desc_id_base32,
  469. time_t now, int set)
  470. {
  471. char hsdir_id_base32[REND_DESC_ID_V2_LEN_BASE32 + 1];
  472. char hsdir_desc_comb_id[LAST_HID_SERV_REQUEST_KEY_LEN + 1];
  473. time_t *last_request_ptr;
  474. strmap_t *last_hid_serv_requests = get_last_hid_serv_requests();
  475. base32_encode(hsdir_id_base32, sizeof(hsdir_id_base32),
  476. hs_dir->identity_digest, DIGEST_LEN);
  477. tor_snprintf(hsdir_desc_comb_id, sizeof(hsdir_desc_comb_id), "%s%s",
  478. hsdir_id_base32,
  479. desc_id_base32);
  480. /* XXX++?? tor_assert(strlen(hsdir_desc_comb_id) ==
  481. LAST_HID_SERV_REQUEST_KEY_LEN); */
  482. if (set) {
  483. time_t *oldptr;
  484. last_request_ptr = tor_malloc_zero(sizeof(time_t));
  485. *last_request_ptr = now;
  486. oldptr = strmap_set(last_hid_serv_requests, hsdir_desc_comb_id,
  487. last_request_ptr);
  488. tor_free(oldptr);
  489. } else
  490. last_request_ptr = strmap_get_lc(last_hid_serv_requests,
  491. hsdir_desc_comb_id);
  492. return (last_request_ptr) ? *last_request_ptr : 0;
  493. }
  494. /** Clean the history of request times to hidden service directories, so that
  495. * it does not contain requests older than REND_HID_SERV_DIR_REQUERY_PERIOD
  496. * seconds any more. */
  497. static void
  498. directory_clean_last_hid_serv_requests(time_t now)
  499. {
  500. strmap_iter_t *iter;
  501. time_t cutoff = now - hsdir_requery_period(get_options());
  502. strmap_t *last_hid_serv_requests = get_last_hid_serv_requests();
  503. for (iter = strmap_iter_init(last_hid_serv_requests);
  504. !strmap_iter_done(iter); ) {
  505. const char *key;
  506. void *val;
  507. time_t *ent;
  508. strmap_iter_get(iter, &key, &val);
  509. ent = (time_t *) val;
  510. if (*ent < cutoff) {
  511. iter = strmap_iter_next_rmv(last_hid_serv_requests, iter);
  512. tor_free(ent);
  513. } else {
  514. iter = strmap_iter_next(last_hid_serv_requests, iter);
  515. }
  516. }
  517. }
  518. /** Remove all requests related to the descriptor ID <b>desc_id</b> from the
  519. * history of times of requests to hidden service directories.
  520. * <b>desc_id</b> is an unencoded descriptor ID of size DIGEST_LEN.
  521. *
  522. * This is called from rend_client_note_connection_attempt_ended(), which
  523. * must be idempotent, so any future changes to this function must leave it
  524. * idempotent too. */
  525. static void
  526. purge_hid_serv_from_last_hid_serv_requests(const char *desc_id)
  527. {
  528. strmap_iter_t *iter;
  529. strmap_t *last_hid_serv_requests = get_last_hid_serv_requests();
  530. char desc_id_base32[REND_DESC_ID_V2_LEN_BASE32 + 1];
  531. /* Key is stored with the base32 encoded desc_id. */
  532. base32_encode(desc_id_base32, sizeof(desc_id_base32), desc_id,
  533. DIGEST_LEN);
  534. for (iter = strmap_iter_init(last_hid_serv_requests);
  535. !strmap_iter_done(iter); ) {
  536. const char *key;
  537. void *val;
  538. strmap_iter_get(iter, &key, &val);
  539. /* XXX++?? tor_assert(strlen(key) == LAST_HID_SERV_REQUEST_KEY_LEN); */
  540. if (tor_memeq(key + LAST_HID_SERV_REQUEST_KEY_LEN -
  541. REND_DESC_ID_V2_LEN_BASE32,
  542. desc_id_base32,
  543. REND_DESC_ID_V2_LEN_BASE32)) {
  544. iter = strmap_iter_next_rmv(last_hid_serv_requests, iter);
  545. tor_free(val);
  546. } else {
  547. iter = strmap_iter_next(last_hid_serv_requests, iter);
  548. }
  549. }
  550. }
  551. /** Purge the history of request times to hidden service directories,
  552. * so that future lookups of an HS descriptor will not fail because we
  553. * accessed all of the HSDir relays responsible for the descriptor
  554. * recently. */
  555. void
  556. rend_client_purge_last_hid_serv_requests(void)
  557. {
  558. /* Don't create the table if it doesn't exist yet (and it may very
  559. * well not exist if the user hasn't accessed any HSes)... */
  560. strmap_t *old_last_hid_serv_requests = last_hid_serv_requests_;
  561. /* ... and let get_last_hid_serv_requests re-create it for us if
  562. * necessary. */
  563. last_hid_serv_requests_ = NULL;
  564. if (old_last_hid_serv_requests != NULL) {
  565. log_info(LD_REND, "Purging client last-HS-desc-request-time table");
  566. strmap_free(old_last_hid_serv_requests, tor_free_);
  567. }
  568. }
  569. /** This returns a good valid hs dir that should be used for the given
  570. * descriptor id.
  571. *
  572. * Return NULL on error else the hsdir node pointer. */
  573. static routerstatus_t *
  574. pick_hsdir(const char *desc_id, const char *desc_id_base32)
  575. {
  576. smartlist_t *responsible_dirs = smartlist_new();
  577. smartlist_t *usable_responsible_dirs = smartlist_new();
  578. const or_options_t *options = get_options();
  579. routerstatus_t *hs_dir;
  580. time_t now = time(NULL);
  581. int excluded_some;
  582. tor_assert(desc_id);
  583. tor_assert(desc_id_base32);
  584. /* Determine responsible dirs. Even if we can't get all we want, work with
  585. * the ones we have. If it's empty, we'll notice below. */
  586. hid_serv_get_responsible_directories(responsible_dirs, desc_id);
  587. /* Clean request history first. */
  588. directory_clean_last_hid_serv_requests(now);
  589. /* Only select those hidden service directories to which we did not send a
  590. * request recently and for which we have a router descriptor here. */
  591. SMARTLIST_FOREACH_BEGIN(responsible_dirs, routerstatus_t *, dir) {
  592. time_t last = lookup_last_hid_serv_request(dir, desc_id_base32,
  593. 0, 0);
  594. const node_t *node = node_get_by_id(dir->identity_digest);
  595. if (last + hsdir_requery_period(options) >= now ||
  596. !node || !node_has_descriptor(node)) {
  597. SMARTLIST_DEL_CURRENT(responsible_dirs, dir);
  598. continue;
  599. }
  600. if (!routerset_contains_node(options->ExcludeNodes, node)) {
  601. smartlist_add(usable_responsible_dirs, dir);
  602. }
  603. } SMARTLIST_FOREACH_END(dir);
  604. excluded_some =
  605. smartlist_len(usable_responsible_dirs) < smartlist_len(responsible_dirs);
  606. hs_dir = smartlist_choose(usable_responsible_dirs);
  607. if (!hs_dir && !options->StrictNodes) {
  608. hs_dir = smartlist_choose(responsible_dirs);
  609. }
  610. smartlist_free(responsible_dirs);
  611. smartlist_free(usable_responsible_dirs);
  612. if (!hs_dir) {
  613. log_info(LD_REND, "Could not pick one of the responsible hidden "
  614. "service directories, because we requested them all "
  615. "recently without success.");
  616. if (options->StrictNodes && excluded_some) {
  617. log_warn(LD_REND, "Could not pick a hidden service directory for the "
  618. "requested hidden service: they are all either down or "
  619. "excluded, and StrictNodes is set.");
  620. }
  621. } else {
  622. /* Remember that we are requesting a descriptor from this hidden service
  623. * directory now. */
  624. lookup_last_hid_serv_request(hs_dir, desc_id_base32, now, 1);
  625. }
  626. return hs_dir;
  627. }
  628. /** Determine the responsible hidden service directories for <b>desc_id</b>
  629. * and fetch the descriptor with that ID from one of them. Only
  630. * send a request to a hidden service directory that we have not yet tried
  631. * during this attempt to connect to this hidden service; on success, return 1,
  632. * in the case that no hidden service directory is left to ask for the
  633. * descriptor, return 0, and in case of a failure -1. */
  634. static int
  635. directory_get_from_hs_dir(const char *desc_id,
  636. const rend_data_t *rend_query,
  637. routerstatus_t *rs_hsdir)
  638. {
  639. routerstatus_t *hs_dir = rs_hsdir;
  640. char *hsdir_fp;
  641. char desc_id_base32[REND_DESC_ID_V2_LEN_BASE32 + 1];
  642. char descriptor_cookie_base64[3*REND_DESC_COOKIE_LEN_BASE64];
  643. const rend_data_v2_t *rend_data;
  644. #ifdef ENABLE_TOR2WEB_MODE
  645. const int tor2web_mode = get_options()->Tor2webMode;
  646. const int how_to_fetch = tor2web_mode ? DIRIND_ONEHOP : DIRIND_ANONYMOUS;
  647. #else
  648. const int how_to_fetch = DIRIND_ANONYMOUS;
  649. #endif
  650. tor_assert(desc_id);
  651. tor_assert(rend_query);
  652. rend_data = TO_REND_DATA_V2(rend_query);
  653. base32_encode(desc_id_base32, sizeof(desc_id_base32),
  654. desc_id, DIGEST_LEN);
  655. /* Automatically pick an hs dir if none given. */
  656. if (!rs_hsdir) {
  657. hs_dir = pick_hsdir(desc_id, desc_id_base32);
  658. if (!hs_dir) {
  659. /* No suitable hs dir can be found, stop right now. */
  660. control_event_hs_descriptor_failed(rend_query, NULL, "QUERY_NO_HSDIR");
  661. control_event_hs_descriptor_content(rend_data_get_address(rend_query),
  662. desc_id_base32, NULL, NULL);
  663. return 0;
  664. }
  665. }
  666. /* Add a copy of the HSDir identity digest to the query so we can track it
  667. * on the control port. */
  668. hsdir_fp = tor_memdup(hs_dir->identity_digest,
  669. sizeof(hs_dir->identity_digest));
  670. smartlist_add(rend_query->hsdirs_fp, hsdir_fp);
  671. /* Encode descriptor cookie for logging purposes. Also, if the cookie is
  672. * malformed, no fetch is triggered thus this needs to be done before the
  673. * fetch request. */
  674. if (rend_data->auth_type != REND_NO_AUTH) {
  675. if (base64_encode(descriptor_cookie_base64,
  676. sizeof(descriptor_cookie_base64),
  677. rend_data->descriptor_cookie,
  678. REND_DESC_COOKIE_LEN,
  679. 0)<0) {
  680. log_warn(LD_BUG, "Could not base64-encode descriptor cookie.");
  681. control_event_hs_descriptor_failed(rend_query, hsdir_fp, "BAD_DESC");
  682. control_event_hs_descriptor_content(rend_data_get_address(rend_query),
  683. desc_id_base32, hsdir_fp, NULL);
  684. return 0;
  685. }
  686. /* Remove == signs. */
  687. descriptor_cookie_base64[strlen(descriptor_cookie_base64)-2] = '\0';
  688. } else {
  689. strlcpy(descriptor_cookie_base64, "(none)",
  690. sizeof(descriptor_cookie_base64));
  691. }
  692. /* Send fetch request. (Pass query and possibly descriptor cookie so that
  693. * they can be written to the directory connection and be referred to when
  694. * the response arrives. */
  695. directory_request_t *req =
  696. directory_request_new(DIR_PURPOSE_FETCH_RENDDESC_V2);
  697. directory_request_set_routerstatus(req, hs_dir);
  698. directory_request_set_indirection(req, how_to_fetch);
  699. directory_request_set_resource(req, desc_id_base32);
  700. directory_request_set_rend_query(req, rend_query);
  701. directory_initiate_request(req);
  702. directory_request_free(req);
  703. log_info(LD_REND, "Sending fetch request for v2 descriptor for "
  704. "service '%s' with descriptor ID '%s', auth type %d, "
  705. "and descriptor cookie '%s' to hidden service "
  706. "directory %s",
  707. rend_data->onion_address, desc_id_base32,
  708. rend_data->auth_type,
  709. (rend_data->auth_type == REND_NO_AUTH ? "[none]" :
  710. escaped_safe_str_client(descriptor_cookie_base64)),
  711. routerstatus_describe(hs_dir));
  712. control_event_hs_descriptor_requested(rend_query,
  713. hs_dir->identity_digest,
  714. desc_id_base32);
  715. return 1;
  716. }
  717. /** Fetch a v2 descriptor using the given descriptor id. If any hsdir(s) are
  718. * given, they will be used instead.
  719. *
  720. * On success, 1 is returned. If no hidden service is left to ask, return 0.
  721. * On error, -1 is returned. */
  722. static int
  723. fetch_v2_desc_by_descid(const char *desc_id,
  724. const rend_data_t *rend_query, smartlist_t *hsdirs)
  725. {
  726. int ret;
  727. tor_assert(rend_query);
  728. if (!hsdirs) {
  729. ret = directory_get_from_hs_dir(desc_id, rend_query, NULL);
  730. goto end; /* either success or failure, but we're done */
  731. }
  732. /* Using the given hsdir list, trigger a fetch on each of them. */
  733. SMARTLIST_FOREACH_BEGIN(hsdirs, routerstatus_t *, hs_dir) {
  734. /* This should always be a success. */
  735. ret = directory_get_from_hs_dir(desc_id, rend_query, hs_dir);
  736. tor_assert(ret);
  737. } SMARTLIST_FOREACH_END(hs_dir);
  738. /* Everything went well. */
  739. ret = 0;
  740. end:
  741. return ret;
  742. }
  743. /** Fetch a v2 descriptor using the onion address in the given query object.
  744. * This will compute the descriptor id for each replicas and fetch it on the
  745. * given hsdir(s) if any or the responsible ones that are choosen
  746. * automatically.
  747. *
  748. * On success, 1 is returned. If no hidden service is left to ask, return 0.
  749. * On error, -1 is returned. */
  750. static int
  751. fetch_v2_desc_by_addr(rend_data_t *rend_query, smartlist_t *hsdirs)
  752. {
  753. char descriptor_id[DIGEST_LEN];
  754. int replicas_left_to_try[REND_NUMBER_OF_NON_CONSECUTIVE_REPLICAS];
  755. int i, tries_left, ret;
  756. rend_data_v2_t *rend_data = TO_REND_DATA_V2(rend_query);
  757. /* Randomly iterate over the replicas until a descriptor can be fetched
  758. * from one of the consecutive nodes, or no options are left. */
  759. for (i = 0; i < REND_NUMBER_OF_NON_CONSECUTIVE_REPLICAS; i++) {
  760. replicas_left_to_try[i] = i;
  761. }
  762. tries_left = REND_NUMBER_OF_NON_CONSECUTIVE_REPLICAS;
  763. while (tries_left > 0) {
  764. int rand_val = crypto_rand_int(tries_left);
  765. int chosen_replica = replicas_left_to_try[rand_val];
  766. replicas_left_to_try[rand_val] = replicas_left_to_try[--tries_left];
  767. ret = rend_compute_v2_desc_id(descriptor_id,
  768. rend_data->onion_address,
  769. rend_data->auth_type == REND_STEALTH_AUTH ?
  770. rend_data->descriptor_cookie : NULL,
  771. time(NULL), chosen_replica);
  772. if (ret < 0) {
  773. /* Normally, on failure the descriptor_id is untouched but let's be
  774. * safe in general in case the function changes at some point. */
  775. goto end;
  776. }
  777. if (tor_memcmp(descriptor_id, rend_data->descriptor_id[chosen_replica],
  778. sizeof(descriptor_id)) != 0) {
  779. /* Not equal from what we currently have so purge the last hid serv
  780. * request cache and update the descriptor ID with the new value. */
  781. purge_hid_serv_from_last_hid_serv_requests(
  782. rend_data->descriptor_id[chosen_replica]);
  783. memcpy(rend_data->descriptor_id[chosen_replica], descriptor_id,
  784. sizeof(rend_data->descriptor_id[chosen_replica]));
  785. }
  786. /* Trigger the fetch with the computed descriptor ID. */
  787. ret = fetch_v2_desc_by_descid(descriptor_id, rend_query, hsdirs);
  788. if (ret != 0) {
  789. /* Either on success or failure, as long as we tried a fetch we are
  790. * done here. */
  791. goto end;
  792. }
  793. }
  794. /* If we come here, there are no hidden service directories left. */
  795. log_info(LD_REND, "Could not pick one of the responsible hidden "
  796. "service directories to fetch descriptors, because "
  797. "we already tried them all unsuccessfully.");
  798. ret = 0;
  799. end:
  800. memwipe(descriptor_id, 0, sizeof(descriptor_id));
  801. return ret;
  802. }
  803. /** Fetch a v2 descriptor using the given query. If any hsdir are specified,
  804. * use them for the fetch.
  805. *
  806. * On success, 1 is returned. If no hidden service is left to ask, return 0.
  807. * On error, -1 is returned. */
  808. int
  809. rend_client_fetch_v2_desc(rend_data_t *query, smartlist_t *hsdirs)
  810. {
  811. int ret;
  812. rend_data_v2_t *rend_data;
  813. const char *onion_address;
  814. tor_assert(query);
  815. /* Get the version 2 data structure of the query. */
  816. rend_data = TO_REND_DATA_V2(query);
  817. onion_address = rend_data_get_address(query);
  818. /* Depending on what's available in the rend data query object, we will
  819. * trigger a fetch by HS address or using a descriptor ID. */
  820. if (onion_address[0] != '\0') {
  821. ret = fetch_v2_desc_by_addr(query, hsdirs);
  822. } else if (!tor_digest_is_zero(rend_data->desc_id_fetch)) {
  823. ret = fetch_v2_desc_by_descid(rend_data->desc_id_fetch, query,
  824. hsdirs);
  825. } else {
  826. /* Query data is invalid. */
  827. ret = -1;
  828. goto error;
  829. }
  830. error:
  831. return ret;
  832. }
  833. /** Unless we already have a descriptor for <b>rend_query</b> with at least
  834. * one (possibly) working introduction point in it, start a connection to a
  835. * hidden service directory to fetch a v2 rendezvous service descriptor. */
  836. void
  837. rend_client_refetch_v2_renddesc(rend_data_t *rend_query)
  838. {
  839. rend_cache_entry_t *e = NULL;
  840. const char *onion_address = rend_data_get_address(rend_query);
  841. tor_assert(rend_query);
  842. /* Before fetching, check if we already have a usable descriptor here. */
  843. if (rend_cache_lookup_entry(onion_address, -1, &e) == 0 &&
  844. rend_client_any_intro_points_usable(e)) {
  845. log_info(LD_REND, "We would fetch a v2 rendezvous descriptor, but we "
  846. "already have a usable descriptor here. Not fetching.");
  847. return;
  848. }
  849. /* Are we configured to fetch descriptors? */
  850. if (!get_options()->FetchHidServDescriptors) {
  851. log_warn(LD_REND, "We received an onion address for a v2 rendezvous "
  852. "service descriptor, but are not fetching service descriptors.");
  853. return;
  854. }
  855. log_debug(LD_REND, "Fetching v2 rendezvous descriptor for service %s",
  856. safe_str_client(onion_address));
  857. rend_client_fetch_v2_desc(rend_query, NULL);
  858. /* We don't need to look the error code because either on failure or
  859. * success, the necessary steps to continue the HS connection will be
  860. * triggered once the descriptor arrives or if all fetch failed. */
  861. return;
  862. }
  863. /** Cancel all rendezvous descriptor fetches currently in progress.
  864. */
  865. void
  866. rend_client_cancel_descriptor_fetches(void)
  867. {
  868. smartlist_t *connection_array = get_connection_array();
  869. SMARTLIST_FOREACH_BEGIN(connection_array, connection_t *, conn) {
  870. if (conn->type == CONN_TYPE_DIR &&
  871. conn->purpose == DIR_PURPOSE_FETCH_RENDDESC_V2) {
  872. /* It's a rendezvous descriptor fetch in progress -- cancel it
  873. * by marking the connection for close.
  874. *
  875. * Even if this connection has already reached EOF, this is
  876. * enough to make sure that if the descriptor hasn't been
  877. * processed yet, it won't be. See the end of
  878. * connection_handle_read; connection_reached_eof (indirectly)
  879. * processes whatever response the connection received. */
  880. const rend_data_t *rd = (TO_DIR_CONN(conn))->rend_data;
  881. if (!rd) {
  882. log_warn(LD_BUG | LD_REND,
  883. "Marking for close dir conn fetching rendezvous "
  884. "descriptor for unknown service!");
  885. } else {
  886. log_debug(LD_REND, "Marking for close dir conn fetching "
  887. "rendezvous descriptor for service %s",
  888. safe_str(rend_data_get_address(rd)));
  889. }
  890. connection_mark_for_close(conn);
  891. }
  892. } SMARTLIST_FOREACH_END(conn);
  893. }
  894. /** Mark <b>failed_intro</b> as a failed introduction point for the
  895. * hidden service specified by <b>rend_query</b>. If the HS now has no
  896. * usable intro points, or we do not have an HS descriptor for it,
  897. * then launch a new renddesc fetch.
  898. *
  899. * If <b>failure_type</b> is INTRO_POINT_FAILURE_GENERIC, remove the
  900. * intro point from (our parsed copy of) the HS descriptor.
  901. *
  902. * If <b>failure_type</b> is INTRO_POINT_FAILURE_TIMEOUT, mark the
  903. * intro point as 'timed out'; it will not be retried until the
  904. * current hidden service connection attempt has ended or it has
  905. * appeared in a newly fetched rendezvous descriptor.
  906. *
  907. * If <b>failure_type</b> is INTRO_POINT_FAILURE_UNREACHABLE,
  908. * increment the intro point's reachability-failure count; if it has
  909. * now failed MAX_INTRO_POINT_REACHABILITY_FAILURES or more times,
  910. * remove the intro point from (our parsed copy of) the HS descriptor.
  911. *
  912. * Return -1 if error, 0 if no usable intro points remain or service
  913. * unrecognized, 1 if recognized and some intro points remain.
  914. */
  915. int
  916. rend_client_report_intro_point_failure(extend_info_t *failed_intro,
  917. rend_data_t *rend_data,
  918. unsigned int failure_type)
  919. {
  920. int i, r;
  921. rend_cache_entry_t *ent;
  922. connection_t *conn;
  923. const char *onion_address = rend_data_get_address(rend_data);
  924. r = rend_cache_lookup_entry(onion_address, -1, &ent);
  925. if (r < 0) {
  926. /* Either invalid onion address or cache entry not found. */
  927. switch (-r) {
  928. case EINVAL:
  929. log_warn(LD_BUG, "Malformed service ID %s.",
  930. escaped_safe_str_client(onion_address));
  931. return -1;
  932. case ENOENT:
  933. log_info(LD_REND, "Unknown service %s. Re-fetching descriptor.",
  934. escaped_safe_str_client(onion_address));
  935. rend_client_refetch_v2_renddesc(rend_data);
  936. return 0;
  937. default:
  938. log_warn(LD_BUG, "Unknown cache lookup returned code: %d", r);
  939. return -1;
  940. }
  941. }
  942. /* The intro points are not checked here if they are usable or not because
  943. * this is called when an intro point circuit is closed thus there must be
  944. * at least one intro point that is usable and is about to be flagged. */
  945. for (i = 0; i < smartlist_len(ent->parsed->intro_nodes); i++) {
  946. rend_intro_point_t *intro = smartlist_get(ent->parsed->intro_nodes, i);
  947. if (tor_memeq(failed_intro->identity_digest,
  948. intro->extend_info->identity_digest, DIGEST_LEN)) {
  949. switch (failure_type) {
  950. default:
  951. log_warn(LD_BUG, "Unknown failure type %u. Removing intro point.",
  952. failure_type);
  953. tor_fragile_assert();
  954. /* fall through */
  955. case INTRO_POINT_FAILURE_GENERIC:
  956. rend_cache_intro_failure_note(failure_type,
  957. (uint8_t *)failed_intro->identity_digest,
  958. onion_address);
  959. rend_intro_point_free(intro);
  960. smartlist_del(ent->parsed->intro_nodes, i);
  961. break;
  962. case INTRO_POINT_FAILURE_TIMEOUT:
  963. intro->timed_out = 1;
  964. break;
  965. case INTRO_POINT_FAILURE_UNREACHABLE:
  966. ++(intro->unreachable_count);
  967. {
  968. int zap_intro_point =
  969. intro->unreachable_count >= MAX_INTRO_POINT_REACHABILITY_FAILURES;
  970. log_info(LD_REND, "Failed to reach this intro point %u times.%s",
  971. intro->unreachable_count,
  972. zap_intro_point ? " Removing from descriptor.": "");
  973. if (zap_intro_point) {
  974. rend_cache_intro_failure_note(
  975. failure_type,
  976. (uint8_t *) failed_intro->identity_digest, onion_address);
  977. rend_intro_point_free(intro);
  978. smartlist_del(ent->parsed->intro_nodes, i);
  979. }
  980. }
  981. break;
  982. }
  983. break;
  984. }
  985. }
  986. if (! rend_client_any_intro_points_usable(ent)) {
  987. log_info(LD_REND,
  988. "No more intro points remain for %s. Re-fetching descriptor.",
  989. escaped_safe_str_client(onion_address));
  990. rend_client_refetch_v2_renddesc(rend_data);
  991. /* move all pending streams back to renddesc_wait */
  992. /* NOTE: We can now do this faster, if we use pending_entry_connections */
  993. while ((conn = connection_get_by_type_state_rendquery(CONN_TYPE_AP,
  994. AP_CONN_STATE_CIRCUIT_WAIT,
  995. onion_address))) {
  996. connection_ap_mark_as_non_pending_circuit(TO_ENTRY_CONN(conn));
  997. conn->state = AP_CONN_STATE_RENDDESC_WAIT;
  998. }
  999. return 0;
  1000. }
  1001. log_info(LD_REND,"%d options left for %s.",
  1002. smartlist_len(ent->parsed->intro_nodes),
  1003. escaped_safe_str_client(onion_address));
  1004. return 1;
  1005. }
  1006. /** Called when we receive a RENDEZVOUS_ESTABLISHED cell; changes the state of
  1007. * the circuit to C_REND_READY.
  1008. */
  1009. int
  1010. rend_client_rendezvous_acked(origin_circuit_t *circ, const uint8_t *request,
  1011. size_t request_len)
  1012. {
  1013. (void) request;
  1014. (void) request_len;
  1015. /* we just got an ack for our establish-rendezvous. switch purposes. */
  1016. if (circ->base_.purpose != CIRCUIT_PURPOSE_C_ESTABLISH_REND) {
  1017. log_warn(LD_PROTOCOL,"Got a rendezvous ack when we weren't expecting one. "
  1018. "Closing circ.");
  1019. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  1020. return -1;
  1021. }
  1022. log_info(LD_REND,"Got rendezvous ack. This circuit is now ready for "
  1023. "rendezvous.");
  1024. circuit_change_purpose(TO_CIRCUIT(circ), CIRCUIT_PURPOSE_C_REND_READY);
  1025. /* Set timestamp_dirty, because circuit_expire_building expects it
  1026. * to specify when a circuit entered the _C_REND_READY state. */
  1027. circ->base_.timestamp_dirty = time(NULL);
  1028. /* From a path bias point of view, this circuit is now successfully used.
  1029. * Waiting any longer opens us up to attacks from malicious hidden services.
  1030. * They could induce the client to attempt to connect to their hidden
  1031. * service and never reply to the client's rend requests */
  1032. pathbias_mark_use_success(circ);
  1033. /* XXXX++ This is a pretty brute-force approach. It'd be better to
  1034. * attach only the connections that are waiting on this circuit, rather
  1035. * than trying to attach them all. See comments bug 743. */
  1036. /* If we already have the introduction circuit built, make sure we send
  1037. * the INTRODUCE cell _now_ */
  1038. connection_ap_attach_pending(1);
  1039. return 0;
  1040. }
  1041. /** The service sent us a rendezvous cell; join the circuits. */
  1042. int
  1043. rend_client_receive_rendezvous(origin_circuit_t *circ, const uint8_t *request,
  1044. size_t request_len)
  1045. {
  1046. if ((circ->base_.purpose != CIRCUIT_PURPOSE_C_REND_READY &&
  1047. circ->base_.purpose != CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED)
  1048. || !circ->build_state->pending_final_cpath) {
  1049. log_warn(LD_PROTOCOL,"Got rendezvous2 cell from hidden service, but not "
  1050. "expecting it. Closing.");
  1051. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  1052. return -1;
  1053. }
  1054. if (request_len != DH_KEY_LEN+DIGEST_LEN) {
  1055. log_warn(LD_PROTOCOL,"Incorrect length (%d) on RENDEZVOUS2 cell.",
  1056. (int)request_len);
  1057. goto err;
  1058. }
  1059. log_info(LD_REND,"Got RENDEZVOUS2 cell from hidden service.");
  1060. if (hs_circuit_setup_e2e_rend_circ_legacy_client(circ, request) < 0) {
  1061. log_warn(LD_GENERAL, "Failed to setup circ");
  1062. goto err;
  1063. }
  1064. return 0;
  1065. err:
  1066. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  1067. return -1;
  1068. }
  1069. /** Find all the apconns in state AP_CONN_STATE_RENDDESC_WAIT that are
  1070. * waiting on <b>query</b>. If there's a working cache entry here with at
  1071. * least one intro point, move them to the next state. */
  1072. void
  1073. rend_client_desc_trynow(const char *query)
  1074. {
  1075. entry_connection_t *conn;
  1076. rend_cache_entry_t *entry;
  1077. const rend_data_t *rend_data;
  1078. time_t now = time(NULL);
  1079. smartlist_t *conns = get_connection_array();
  1080. SMARTLIST_FOREACH_BEGIN(conns, connection_t *, base_conn) {
  1081. if (base_conn->type != CONN_TYPE_AP ||
  1082. base_conn->state != AP_CONN_STATE_RENDDESC_WAIT ||
  1083. base_conn->marked_for_close)
  1084. continue;
  1085. conn = TO_ENTRY_CONN(base_conn);
  1086. rend_data = ENTRY_TO_EDGE_CONN(conn)->rend_data;
  1087. if (!rend_data)
  1088. continue;
  1089. const char *onion_address = rend_data_get_address(rend_data);
  1090. if (rend_cmp_service_ids(query, onion_address))
  1091. continue;
  1092. assert_connection_ok(base_conn, now);
  1093. if (rend_cache_lookup_entry(onion_address, -1,
  1094. &entry) == 0 &&
  1095. rend_client_any_intro_points_usable(entry)) {
  1096. /* either this fetch worked, or it failed but there was a
  1097. * valid entry from before which we should reuse */
  1098. log_info(LD_REND,"Rend desc is usable. Launching circuits.");
  1099. base_conn->state = AP_CONN_STATE_CIRCUIT_WAIT;
  1100. /* restart their timeout values, so they get a fair shake at
  1101. * connecting to the hidden service. */
  1102. base_conn->timestamp_created = now;
  1103. base_conn->timestamp_lastread = now;
  1104. base_conn->timestamp_lastwritten = now;
  1105. connection_ap_mark_as_pending_circuit(conn);
  1106. } else { /* 404, or fetch didn't get that far */
  1107. log_notice(LD_REND,"Closing stream for '%s.onion': hidden service is "
  1108. "unavailable (try again later).",
  1109. safe_str_client(query));
  1110. connection_mark_unattached_ap(conn, END_STREAM_REASON_RESOLVEFAILED);
  1111. rend_client_note_connection_attempt_ended(rend_data);
  1112. }
  1113. } SMARTLIST_FOREACH_END(base_conn);
  1114. }
  1115. /** Clear temporary state used only during an attempt to connect to the
  1116. * hidden service with <b>rend_data</b>. Called when a connection attempt
  1117. * has ended; it is possible for this to be called multiple times while
  1118. * handling an ended connection attempt, and any future changes to this
  1119. * function must ensure it remains idempotent. */
  1120. void
  1121. rend_client_note_connection_attempt_ended(const rend_data_t *rend_data)
  1122. {
  1123. unsigned int have_onion = 0;
  1124. rend_cache_entry_t *cache_entry = NULL;
  1125. const char *onion_address = rend_data_get_address(rend_data);
  1126. rend_data_v2_t *rend_data_v2 = TO_REND_DATA_V2(rend_data);
  1127. if (onion_address[0] != '\0') {
  1128. /* Ignore return value; we find an entry, or we don't. */
  1129. (void) rend_cache_lookup_entry(onion_address, -1, &cache_entry);
  1130. have_onion = 1;
  1131. }
  1132. /* Clear the timed_out flag on all remaining intro points for this HS. */
  1133. if (cache_entry != NULL) {
  1134. SMARTLIST_FOREACH(cache_entry->parsed->intro_nodes,
  1135. rend_intro_point_t *, ip,
  1136. ip->timed_out = 0; );
  1137. }
  1138. /* Remove the HS's entries in last_hid_serv_requests. */
  1139. if (have_onion) {
  1140. unsigned int replica;
  1141. for (replica = 0; replica < ARRAY_LENGTH(rend_data_v2->descriptor_id);
  1142. replica++) {
  1143. const char *desc_id = rend_data_v2->descriptor_id[replica];
  1144. purge_hid_serv_from_last_hid_serv_requests(desc_id);
  1145. }
  1146. log_info(LD_REND, "Connection attempt for %s has ended; "
  1147. "cleaning up temporary state.",
  1148. safe_str_client(onion_address));
  1149. } else {
  1150. /* We only have an ID for a fetch. Probably used by HSFETCH. */
  1151. purge_hid_serv_from_last_hid_serv_requests(rend_data_v2->desc_id_fetch);
  1152. }
  1153. }
  1154. /** Return a newly allocated extend_info_t* for a randomly chosen introduction
  1155. * point for the named hidden service. Return NULL if all introduction points
  1156. * have been tried and failed.
  1157. */
  1158. extend_info_t *
  1159. rend_client_get_random_intro(const rend_data_t *rend_query)
  1160. {
  1161. int ret;
  1162. extend_info_t *result;
  1163. rend_cache_entry_t *entry;
  1164. const char *onion_address = rend_data_get_address(rend_query);
  1165. ret = rend_cache_lookup_entry(onion_address, -1, &entry);
  1166. if (ret < 0 || !rend_client_any_intro_points_usable(entry)) {
  1167. log_warn(LD_REND,
  1168. "Query '%s' didn't have valid rend desc in cache. Failing.",
  1169. safe_str_client(onion_address));
  1170. /* XXX: Should we refetch the descriptor here if the IPs are not usable
  1171. * anymore ?. */
  1172. return NULL;
  1173. }
  1174. /* See if we can get a node that complies with ExcludeNodes */
  1175. if ((result = rend_client_get_random_intro_impl(entry, 1, 1)))
  1176. return result;
  1177. /* If not, and StrictNodes is not set, see if we can return any old node
  1178. */
  1179. if (!get_options()->StrictNodes)
  1180. return rend_client_get_random_intro_impl(entry, 0, 1);
  1181. return NULL;
  1182. }
  1183. /** As rend_client_get_random_intro, except assume that StrictNodes is set
  1184. * iff <b>strict</b> is true. If <b>warnings</b> is false, don't complain
  1185. * to the user when we're out of nodes, even if StrictNodes is true.
  1186. */
  1187. static extend_info_t *
  1188. rend_client_get_random_intro_impl(const rend_cache_entry_t *entry,
  1189. const int strict,
  1190. const int warnings)
  1191. {
  1192. int i;
  1193. rend_intro_point_t *intro;
  1194. const or_options_t *options = get_options();
  1195. smartlist_t *usable_nodes;
  1196. int n_excluded = 0;
  1197. /* We'll keep a separate list of the usable nodes. If this becomes empty,
  1198. * no nodes are usable. */
  1199. usable_nodes = smartlist_new();
  1200. smartlist_add_all(usable_nodes, entry->parsed->intro_nodes);
  1201. /* Remove the intro points that have timed out during this HS
  1202. * connection attempt from our list of usable nodes. */
  1203. SMARTLIST_FOREACH(usable_nodes, rend_intro_point_t *, ip,
  1204. if (ip->timed_out) {
  1205. SMARTLIST_DEL_CURRENT(usable_nodes, ip);
  1206. });
  1207. again:
  1208. if (smartlist_len(usable_nodes) == 0) {
  1209. if (n_excluded && get_options()->StrictNodes && warnings) {
  1210. /* We only want to warn if StrictNodes is really set. Otherwise
  1211. * we're just about to retry anyways.
  1212. */
  1213. log_warn(LD_REND, "All introduction points for hidden service are "
  1214. "at excluded relays, and StrictNodes is set. Skipping.");
  1215. }
  1216. smartlist_free(usable_nodes);
  1217. return NULL;
  1218. }
  1219. i = crypto_rand_int(smartlist_len(usable_nodes));
  1220. intro = smartlist_get(usable_nodes, i);
  1221. if (BUG(!intro->extend_info)) {
  1222. /* This should never happen, but it isn't fatal, just try another */
  1223. smartlist_del(usable_nodes, i);
  1224. goto again;
  1225. }
  1226. /* All version 2 HS descriptors come with a TAP onion key.
  1227. * Clients used to try to get the TAP onion key from the consensus, but this
  1228. * meant that hidden services could discover which consensus clients have. */
  1229. if (!extend_info_supports_tap(intro->extend_info)) {
  1230. log_info(LD_REND, "The HS descriptor is missing a TAP onion key for the "
  1231. "intro-point relay '%s'; trying another.",
  1232. safe_str_client(extend_info_describe(intro->extend_info)));
  1233. smartlist_del(usable_nodes, i);
  1234. goto again;
  1235. }
  1236. /* Check if we should refuse to talk to this router. */
  1237. if (strict &&
  1238. routerset_contains_extendinfo(options->ExcludeNodes,
  1239. intro->extend_info)) {
  1240. n_excluded++;
  1241. smartlist_del(usable_nodes, i);
  1242. goto again;
  1243. }
  1244. smartlist_free(usable_nodes);
  1245. return extend_info_dup(intro->extend_info);
  1246. }
  1247. /** Return true iff any introduction points still listed in <b>entry</b> are
  1248. * usable. */
  1249. int
  1250. rend_client_any_intro_points_usable(const rend_cache_entry_t *entry)
  1251. {
  1252. extend_info_t *extend_info =
  1253. rend_client_get_random_intro_impl(entry, get_options()->StrictNodes, 0);
  1254. int rv = (extend_info != NULL);
  1255. extend_info_free(extend_info);
  1256. return rv;
  1257. }
  1258. /** Client-side authorizations for hidden services; map of onion address to
  1259. * rend_service_authorization_t*. */
  1260. static strmap_t *auth_hid_servs = NULL;
  1261. /** Look up the client-side authorization for the hidden service with
  1262. * <b>onion_address</b>. Return NULL if no authorization is available for
  1263. * that address. */
  1264. rend_service_authorization_t*
  1265. rend_client_lookup_service_authorization(const char *onion_address)
  1266. {
  1267. tor_assert(onion_address);
  1268. if (!auth_hid_servs) return NULL;
  1269. return strmap_get(auth_hid_servs, onion_address);
  1270. }
  1271. /** Helper: Free storage held by rend_service_authorization_t. */
  1272. static void
  1273. rend_service_authorization_free(rend_service_authorization_t *auth)
  1274. {
  1275. tor_free(auth);
  1276. }
  1277. /** Helper for strmap_free. */
  1278. static void
  1279. rend_service_authorization_strmap_item_free(void *service_auth)
  1280. {
  1281. rend_service_authorization_free(service_auth);
  1282. }
  1283. /** Release all the storage held in auth_hid_servs.
  1284. */
  1285. void
  1286. rend_service_authorization_free_all(void)
  1287. {
  1288. if (!auth_hid_servs) {
  1289. return;
  1290. }
  1291. strmap_free(auth_hid_servs, rend_service_authorization_strmap_item_free);
  1292. auth_hid_servs = NULL;
  1293. }
  1294. /** Parse <b>config_line</b> as a client-side authorization for a hidden
  1295. * service and add it to the local map of hidden service authorizations.
  1296. * Return 0 for success and -1 for failure. */
  1297. int
  1298. rend_parse_service_authorization(const or_options_t *options,
  1299. int validate_only)
  1300. {
  1301. config_line_t *line;
  1302. int res = -1;
  1303. strmap_t *parsed = strmap_new();
  1304. smartlist_t *sl = smartlist_new();
  1305. rend_service_authorization_t *auth = NULL;
  1306. char *err_msg = NULL;
  1307. for (line = options->HidServAuth; line; line = line->next) {
  1308. char *onion_address, *descriptor_cookie;
  1309. auth = NULL;
  1310. SMARTLIST_FOREACH(sl, char *, c, tor_free(c););
  1311. smartlist_clear(sl);
  1312. smartlist_split_string(sl, line->value, " ",
  1313. SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 3);
  1314. if (smartlist_len(sl) < 2) {
  1315. log_warn(LD_CONFIG, "Configuration line does not consist of "
  1316. "\"onion-address authorization-cookie [service-name]\": "
  1317. "'%s'", line->value);
  1318. goto err;
  1319. }
  1320. auth = tor_malloc_zero(sizeof(rend_service_authorization_t));
  1321. /* Parse onion address. */
  1322. onion_address = smartlist_get(sl, 0);
  1323. if (strlen(onion_address) != REND_SERVICE_ADDRESS_LEN ||
  1324. strcmpend(onion_address, ".onion")) {
  1325. log_warn(LD_CONFIG, "Onion address has wrong format: '%s'",
  1326. onion_address);
  1327. goto err;
  1328. }
  1329. strlcpy(auth->onion_address, onion_address, REND_SERVICE_ID_LEN_BASE32+1);
  1330. if (!rend_valid_service_id(auth->onion_address)) {
  1331. log_warn(LD_CONFIG, "Onion address has wrong format: '%s'",
  1332. onion_address);
  1333. goto err;
  1334. }
  1335. /* Parse descriptor cookie. */
  1336. descriptor_cookie = smartlist_get(sl, 1);
  1337. if (rend_auth_decode_cookie(descriptor_cookie, auth->descriptor_cookie,
  1338. &auth->auth_type, &err_msg) < 0) {
  1339. tor_assert(err_msg);
  1340. log_warn(LD_CONFIG, "%s", err_msg);
  1341. tor_free(err_msg);
  1342. goto err;
  1343. }
  1344. if (strmap_get(parsed, auth->onion_address)) {
  1345. log_warn(LD_CONFIG, "Duplicate authorization for the same hidden "
  1346. "service.");
  1347. goto err;
  1348. }
  1349. strmap_set(parsed, auth->onion_address, auth);
  1350. auth = NULL;
  1351. }
  1352. res = 0;
  1353. goto done;
  1354. err:
  1355. res = -1;
  1356. done:
  1357. rend_service_authorization_free(auth);
  1358. SMARTLIST_FOREACH(sl, char *, c, tor_free(c););
  1359. smartlist_free(sl);
  1360. if (!validate_only && res == 0) {
  1361. rend_service_authorization_free_all();
  1362. auth_hid_servs = parsed;
  1363. } else {
  1364. strmap_free(parsed, rend_service_authorization_strmap_item_free);
  1365. }
  1366. return res;
  1367. }
  1368. /* Can Tor client code make direct (non-anonymous) connections to introduction
  1369. * or rendezvous points?
  1370. * Returns true if tor was compiled with NON_ANONYMOUS_MODE_ENABLED, and is
  1371. * configured in Tor2web mode. */
  1372. int
  1373. rend_client_allow_non_anonymous_connection(const or_options_t *options)
  1374. {
  1375. /* Tor2web support needs to be compiled in to a tor binary. */
  1376. #ifdef NON_ANONYMOUS_MODE_ENABLED
  1377. /* Tor2web */
  1378. return options->Tor2webMode ? 1 : 0;
  1379. #else
  1380. (void)options;
  1381. return 0;
  1382. #endif
  1383. }
  1384. /* At compile-time, was non-anonymous mode enabled via
  1385. * NON_ANONYMOUS_MODE_ENABLED ? */
  1386. int
  1387. rend_client_non_anonymous_mode_enabled(const or_options_t *options)
  1388. {
  1389. (void)options;
  1390. /* Tor2web support needs to be compiled in to a tor binary. */
  1391. #ifdef NON_ANONYMOUS_MODE_ENABLED
  1392. /* Tor2web */
  1393. return 1;
  1394. #else
  1395. return 0;
  1396. #endif
  1397. }