rendclient.c 58 KB

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