rendclient.c 57 KB

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