rendclient.c 45 KB

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