rendclient.c 56 KB

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