rendclient.c 46 KB

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