rendclient.c 58 KB

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