rendclient.c 58 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584
  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. set_uint16(tmp+v3_shift+7+DIGEST_LEN, htons(klen));
  246. memcpy(tmp+v3_shift+7+DIGEST_LEN+2+klen, rendcirc->rend_data->rend_cookie,
  247. REND_COOKIE_LEN);
  248. dh_offset = v3_shift+7+DIGEST_LEN+2+klen+REND_COOKIE_LEN;
  249. } else {
  250. /* Version 0. */
  251. strncpy(tmp, rendcirc->build_state->chosen_exit->nickname,
  252. (MAX_NICKNAME_LEN+1)); /* nul pads */
  253. memcpy(tmp+MAX_NICKNAME_LEN+1, rendcirc->rend_data->rend_cookie,
  254. REND_COOKIE_LEN);
  255. dh_offset = MAX_NICKNAME_LEN+1+REND_COOKIE_LEN;
  256. }
  257. if (crypto_dh_get_public(cpath->rend_dh_handshake_state, tmp+dh_offset,
  258. DH_KEY_LEN)<0) {
  259. log_warn(LD_BUG, "Internal error: couldn't extract g^x.");
  260. status = -2;
  261. goto perm_err;
  262. }
  263. note_crypto_pk_op(REND_CLIENT);
  264. /*XXX maybe give crypto_pk_public_hybrid_encrypt a max_len arg,
  265. * to avoid buffer overflows? */
  266. r = crypto_pk_public_hybrid_encrypt(intro_key, payload+DIGEST_LEN,
  267. sizeof(payload)-DIGEST_LEN,
  268. tmp,
  269. (int)(dh_offset+DH_KEY_LEN),
  270. PK_PKCS1_OAEP_PADDING, 0);
  271. if (r<0) {
  272. log_warn(LD_BUG,"Internal error: hybrid pk encrypt failed.");
  273. status = -2;
  274. goto perm_err;
  275. }
  276. payload_len = DIGEST_LEN + r;
  277. tor_assert(payload_len <= RELAY_PAYLOAD_SIZE); /* we overran something */
  278. /* Copy the rendezvous cookie from rendcirc to introcirc, so that
  279. * when introcirc gets an ack, we can change the state of the right
  280. * rendezvous circuit. */
  281. memcpy(introcirc->rend_data->rend_cookie, rendcirc->rend_data->rend_cookie,
  282. REND_COOKIE_LEN);
  283. log_info(LD_REND, "Sending an INTRODUCE1 cell");
  284. if (relay_send_command_from_edge(0, TO_CIRCUIT(introcirc),
  285. RELAY_COMMAND_INTRODUCE1,
  286. payload, payload_len,
  287. introcirc->cpath->prev)<0) {
  288. /* introcirc is already marked for close. leave rendcirc alone. */
  289. log_warn(LD_BUG, "Couldn't send INTRODUCE1 cell");
  290. status = -2;
  291. goto cleanup;
  292. }
  293. /* Now, we wait for an ACK or NAK on this circuit. */
  294. circuit_change_purpose(TO_CIRCUIT(introcirc),
  295. CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT);
  296. /* Set timestamp_dirty, because circuit_expire_building expects it
  297. * to specify when a circuit entered the _C_INTRODUCE_ACK_WAIT
  298. * state. */
  299. introcirc->base_.timestamp_dirty = time(NULL);
  300. pathbias_count_use_attempt(introcirc);
  301. goto cleanup;
  302. perm_err:
  303. if (!introcirc->base_.marked_for_close)
  304. circuit_mark_for_close(TO_CIRCUIT(introcirc), END_CIRC_REASON_INTERNAL);
  305. circuit_mark_for_close(TO_CIRCUIT(rendcirc), END_CIRC_REASON_INTERNAL);
  306. cleanup:
  307. memwipe(payload, 0, sizeof(payload));
  308. memwipe(tmp, 0, sizeof(tmp));
  309. return status;
  310. }
  311. /** Called when a rendezvous circuit is open; sends a establish
  312. * rendezvous circuit as appropriate. */
  313. void
  314. rend_client_rendcirc_has_opened(origin_circuit_t *circ)
  315. {
  316. tor_assert(circ->base_.purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND);
  317. log_info(LD_REND,"rendcirc is open");
  318. /* generate a rendezvous cookie, store it in circ */
  319. if (rend_client_send_establish_rendezvous(circ) < 0) {
  320. return;
  321. }
  322. }
  323. /**
  324. * Called to close other intro circuits we launched in parallel.
  325. */
  326. static void
  327. rend_client_close_other_intros(const uint8_t *rend_pk_digest)
  328. {
  329. /* abort parallel intro circs, if any */
  330. SMARTLIST_FOREACH_BEGIN(circuit_get_global_list(), circuit_t *, c) {
  331. if ((c->purpose == CIRCUIT_PURPOSE_C_INTRODUCING ||
  332. c->purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT) &&
  333. !c->marked_for_close && CIRCUIT_IS_ORIGIN(c)) {
  334. origin_circuit_t *oc = TO_ORIGIN_CIRCUIT(c);
  335. if (oc->rend_data &&
  336. rend_circuit_pk_digest_eq(oc, rend_pk_digest)) {
  337. log_info(LD_REND|LD_CIRC, "Closing introduction circuit %d that we "
  338. "built in parallel (Purpose %d).", oc->global_identifier,
  339. c->purpose);
  340. circuit_mark_for_close(c, END_CIRC_REASON_IP_NOW_REDUNDANT);
  341. }
  342. }
  343. }
  344. SMARTLIST_FOREACH_END(c);
  345. }
  346. /** Called when get an ACK or a NAK for a REND_INTRODUCE1 cell.
  347. */
  348. int
  349. rend_client_introduction_acked(origin_circuit_t *circ,
  350. const uint8_t *request, size_t request_len)
  351. {
  352. const or_options_t *options = get_options();
  353. origin_circuit_t *rendcirc;
  354. (void) request; // XXXX Use this.
  355. if (circ->base_.purpose != CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT) {
  356. log_warn(LD_PROTOCOL,
  357. "Received REND_INTRODUCE_ACK on unexpected circuit %u.",
  358. (unsigned)circ->base_.n_circ_id);
  359. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  360. return -1;
  361. }
  362. tor_assert(circ->build_state);
  363. tor_assert(circ->build_state->chosen_exit);
  364. assert_circ_anonymity_ok(circ, options);
  365. tor_assert(circ->rend_data);
  366. /* For path bias: This circuit was used successfully. Valid
  367. * nacks and acks count. */
  368. pathbias_mark_use_success(circ);
  369. if (request_len == 0) {
  370. /* It's an ACK; the introduction point relayed our introduction request. */
  371. /* Locate the rend circ which is waiting to hear about this ack,
  372. * and tell it.
  373. */
  374. log_info(LD_REND,"Received ack. Telling rend circ...");
  375. rendcirc = circuit_get_ready_rend_circ_by_rend_data(circ->rend_data);
  376. if (rendcirc) { /* remember the ack */
  377. assert_circ_anonymity_ok(rendcirc, options);
  378. circuit_change_purpose(TO_CIRCUIT(rendcirc),
  379. CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED);
  380. /* Set timestamp_dirty, because circuit_expire_building expects
  381. * it to specify when a circuit entered the
  382. * _C_REND_READY_INTRO_ACKED state. */
  383. rendcirc->base_.timestamp_dirty = time(NULL);
  384. } else {
  385. log_info(LD_REND,"...Found no rend circ. Dropping on the floor.");
  386. }
  387. /* close the circuit: we won't need it anymore. */
  388. circuit_change_purpose(TO_CIRCUIT(circ),
  389. CIRCUIT_PURPOSE_C_INTRODUCE_ACKED);
  390. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_FINISHED);
  391. /* close any other intros launched in parallel */
  392. rend_client_close_other_intros(rend_data_get_pk_digest(circ->rend_data,
  393. NULL));
  394. } else {
  395. /* It's a NAK; the introduction point didn't relay our request. */
  396. circuit_change_purpose(TO_CIRCUIT(circ), CIRCUIT_PURPOSE_C_INTRODUCING);
  397. /* Remove this intro point from the set of viable introduction
  398. * points. If any remain, extend to a new one and try again.
  399. * If none remain, refetch the service descriptor.
  400. */
  401. log_info(LD_REND, "Got nack for %s from %s...",
  402. safe_str_client(rend_data_get_address(circ->rend_data)),
  403. safe_str_client(extend_info_describe(circ->build_state->chosen_exit)));
  404. if (rend_client_report_intro_point_failure(circ->build_state->chosen_exit,
  405. circ->rend_data,
  406. INTRO_POINT_FAILURE_GENERIC)>0) {
  407. /* There are introduction points left. Re-extend the circuit to
  408. * another intro point and try again. */
  409. int result = rend_client_reextend_intro_circuit(circ);
  410. /* XXXX If that call failed, should we close the rend circuit,
  411. * too? */
  412. return result;
  413. } else {
  414. /* Close circuit because no more intro points are usable thus not
  415. * useful anymore. Change it's purpose before so we don't report an
  416. * intro point failure again triggering an extra descriptor fetch. */
  417. circuit_change_purpose(TO_CIRCUIT(circ),
  418. CIRCUIT_PURPOSE_C_INTRODUCE_ACKED);
  419. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_FINISHED);
  420. }
  421. }
  422. return 0;
  423. }
  424. /** The period for which a hidden service directory cannot be queried for
  425. * the same descriptor ID again. */
  426. #define REND_HID_SERV_DIR_REQUERY_PERIOD (15 * 60)
  427. /** Test networks generate a new consensus every 5 or 10 seconds.
  428. * So allow them to requery HSDirs much faster. */
  429. #define REND_HID_SERV_DIR_REQUERY_PERIOD_TESTING (5)
  430. /** Return the period for which a hidden service directory cannot be queried
  431. * for the same descriptor ID again, taking TestingTorNetwork into account. */
  432. static time_t
  433. hsdir_requery_period(const or_options_t *options)
  434. {
  435. tor_assert(options);
  436. if (options->TestingTorNetwork) {
  437. return REND_HID_SERV_DIR_REQUERY_PERIOD_TESTING;
  438. } else {
  439. return REND_HID_SERV_DIR_REQUERY_PERIOD;
  440. }
  441. }
  442. /** Contains the last request times to hidden service directories for
  443. * certain queries; each key is a string consisting of the
  444. * concatenation of a base32-encoded HS directory identity digest and
  445. * base32-encoded HS descriptor ID; each value is a pointer to a time_t
  446. * holding the time of the last request for that descriptor ID to that
  447. * HS directory. */
  448. static strmap_t *last_hid_serv_requests_ = NULL;
  449. /** Returns last_hid_serv_requests_, initializing it to a new strmap if
  450. * necessary. */
  451. static strmap_t *
  452. get_last_hid_serv_requests(void)
  453. {
  454. if (!last_hid_serv_requests_)
  455. last_hid_serv_requests_ = strmap_new();
  456. return last_hid_serv_requests_;
  457. }
  458. #define LAST_HID_SERV_REQUEST_KEY_LEN (REND_DESC_ID_V2_LEN_BASE32 + \
  459. REND_DESC_ID_V2_LEN_BASE32)
  460. /** Look up the last request time to hidden service directory <b>hs_dir</b>
  461. * for descriptor ID <b>desc_id_base32</b>. If <b>set</b> is non-zero,
  462. * assign the current time <b>now</b> and return that. Otherwise, return the
  463. * most recent request time, or 0 if no such request has been sent before.
  464. */
  465. static time_t
  466. lookup_last_hid_serv_request(routerstatus_t *hs_dir,
  467. const char *desc_id_base32,
  468. time_t now, int set)
  469. {
  470. char hsdir_id_base32[REND_DESC_ID_V2_LEN_BASE32 + 1];
  471. char hsdir_desc_comb_id[LAST_HID_SERV_REQUEST_KEY_LEN + 1];
  472. time_t *last_request_ptr;
  473. strmap_t *last_hid_serv_requests = get_last_hid_serv_requests();
  474. base32_encode(hsdir_id_base32, sizeof(hsdir_id_base32),
  475. hs_dir->identity_digest, DIGEST_LEN);
  476. tor_snprintf(hsdir_desc_comb_id, sizeof(hsdir_desc_comb_id), "%s%s",
  477. hsdir_id_base32,
  478. desc_id_base32);
  479. /* XXX++?? tor_assert(strlen(hsdir_desc_comb_id) ==
  480. LAST_HID_SERV_REQUEST_KEY_LEN); */
  481. if (set) {
  482. time_t *oldptr;
  483. last_request_ptr = tor_malloc_zero(sizeof(time_t));
  484. *last_request_ptr = now;
  485. oldptr = strmap_set(last_hid_serv_requests, hsdir_desc_comb_id,
  486. last_request_ptr);
  487. tor_free(oldptr);
  488. } else
  489. last_request_ptr = strmap_get_lc(last_hid_serv_requests,
  490. hsdir_desc_comb_id);
  491. return (last_request_ptr) ? *last_request_ptr : 0;
  492. }
  493. /** Clean the history of request times to hidden service directories, so that
  494. * it does not contain requests older than REND_HID_SERV_DIR_REQUERY_PERIOD
  495. * seconds any more. */
  496. static void
  497. directory_clean_last_hid_serv_requests(time_t now)
  498. {
  499. strmap_iter_t *iter;
  500. time_t cutoff = now - hsdir_requery_period(get_options());
  501. strmap_t *last_hid_serv_requests = get_last_hid_serv_requests();
  502. for (iter = strmap_iter_init(last_hid_serv_requests);
  503. !strmap_iter_done(iter); ) {
  504. const char *key;
  505. void *val;
  506. time_t *ent;
  507. strmap_iter_get(iter, &key, &val);
  508. ent = (time_t *) val;
  509. if (*ent < cutoff) {
  510. iter = strmap_iter_next_rmv(last_hid_serv_requests, iter);
  511. tor_free(ent);
  512. } else {
  513. iter = strmap_iter_next(last_hid_serv_requests, iter);
  514. }
  515. }
  516. }
  517. /** Remove all requests related to the descriptor ID <b>desc_id</b> from the
  518. * history of times of requests to hidden service directories.
  519. * <b>desc_id</b> is an unencoded descriptor ID of size DIGEST_LEN.
  520. *
  521. * This is called from rend_client_note_connection_attempt_ended(), which
  522. * must be idempotent, so any future changes to this function must leave it
  523. * idempotent too. */
  524. static void
  525. purge_hid_serv_from_last_hid_serv_requests(const char *desc_id)
  526. {
  527. strmap_iter_t *iter;
  528. strmap_t *last_hid_serv_requests = get_last_hid_serv_requests();
  529. char desc_id_base32[REND_DESC_ID_V2_LEN_BASE32 + 1];
  530. /* Key is stored with the base32 encoded desc_id. */
  531. base32_encode(desc_id_base32, sizeof(desc_id_base32), desc_id,
  532. DIGEST_LEN);
  533. for (iter = strmap_iter_init(last_hid_serv_requests);
  534. !strmap_iter_done(iter); ) {
  535. const char *key;
  536. void *val;
  537. strmap_iter_get(iter, &key, &val);
  538. /* XXX++?? tor_assert(strlen(key) == LAST_HID_SERV_REQUEST_KEY_LEN); */
  539. if (tor_memeq(key + LAST_HID_SERV_REQUEST_KEY_LEN -
  540. REND_DESC_ID_V2_LEN_BASE32,
  541. desc_id_base32,
  542. REND_DESC_ID_V2_LEN_BASE32)) {
  543. iter = strmap_iter_next_rmv(last_hid_serv_requests, iter);
  544. tor_free(val);
  545. } else {
  546. iter = strmap_iter_next(last_hid_serv_requests, iter);
  547. }
  548. }
  549. }
  550. /** Purge the history of request times to hidden service directories,
  551. * so that future lookups of an HS descriptor will not fail because we
  552. * accessed all of the HSDir relays responsible for the descriptor
  553. * recently. */
  554. void
  555. rend_client_purge_last_hid_serv_requests(void)
  556. {
  557. /* Don't create the table if it doesn't exist yet (and it may very
  558. * well not exist if the user hasn't accessed any HSes)... */
  559. strmap_t *old_last_hid_serv_requests = last_hid_serv_requests_;
  560. /* ... and let get_last_hid_serv_requests re-create it for us if
  561. * necessary. */
  562. last_hid_serv_requests_ = NULL;
  563. if (old_last_hid_serv_requests != NULL) {
  564. log_info(LD_REND, "Purging client last-HS-desc-request-time table");
  565. strmap_free(old_last_hid_serv_requests, tor_free_);
  566. }
  567. }
  568. /** This returns a good valid hs dir that should be used for the given
  569. * descriptor id.
  570. *
  571. * Return NULL on error else the hsdir node pointer. */
  572. static routerstatus_t *
  573. pick_hsdir(const char *desc_id, const char *desc_id_base32)
  574. {
  575. smartlist_t *responsible_dirs = smartlist_new();
  576. smartlist_t *usable_responsible_dirs = smartlist_new();
  577. const or_options_t *options = get_options();
  578. routerstatus_t *hs_dir;
  579. time_t now = time(NULL);
  580. int excluded_some;
  581. tor_assert(desc_id);
  582. tor_assert(desc_id_base32);
  583. /* Determine responsible dirs. Even if we can't get all we want, work with
  584. * the ones we have. If it's empty, we'll notice below. */
  585. hid_serv_get_responsible_directories(responsible_dirs, desc_id);
  586. /* Clean request history first. */
  587. directory_clean_last_hid_serv_requests(now);
  588. /* Only select those hidden service directories to which we did not send a
  589. * request recently and for which we have a router descriptor here. */
  590. SMARTLIST_FOREACH_BEGIN(responsible_dirs, routerstatus_t *, dir) {
  591. time_t last = lookup_last_hid_serv_request(dir, desc_id_base32,
  592. 0, 0);
  593. const node_t *node = node_get_by_id(dir->identity_digest);
  594. if (last + hsdir_requery_period(options) >= now ||
  595. !node || !node_has_descriptor(node)) {
  596. SMARTLIST_DEL_CURRENT(responsible_dirs, dir);
  597. continue;
  598. }
  599. if (!routerset_contains_node(options->ExcludeNodes, node)) {
  600. smartlist_add(usable_responsible_dirs, dir);
  601. }
  602. } SMARTLIST_FOREACH_END(dir);
  603. excluded_some =
  604. smartlist_len(usable_responsible_dirs) < smartlist_len(responsible_dirs);
  605. hs_dir = smartlist_choose(usable_responsible_dirs);
  606. if (!hs_dir && !options->StrictNodes) {
  607. hs_dir = smartlist_choose(responsible_dirs);
  608. }
  609. smartlist_free(responsible_dirs);
  610. smartlist_free(usable_responsible_dirs);
  611. if (!hs_dir) {
  612. log_info(LD_REND, "Could not pick one of the responsible hidden "
  613. "service directories, because we requested them all "
  614. "recently without success.");
  615. if (options->StrictNodes && excluded_some) {
  616. log_warn(LD_REND, "Could not pick a hidden service directory for the "
  617. "requested hidden service: they are all either down or "
  618. "excluded, and StrictNodes is set.");
  619. }
  620. } else {
  621. /* Remember that we are requesting a descriptor from this hidden service
  622. * directory now. */
  623. lookup_last_hid_serv_request(hs_dir, desc_id_base32, now, 1);
  624. }
  625. return hs_dir;
  626. }
  627. /** Determine the responsible hidden service directories for <b>desc_id</b>
  628. * and fetch the descriptor with that ID from one of them. Only
  629. * send a request to a hidden service directory that we have not yet tried
  630. * during this attempt to connect to this hidden service; on success, return 1,
  631. * in the case that no hidden service directory is left to ask for the
  632. * descriptor, return 0, and in case of a failure -1. */
  633. static int
  634. directory_get_from_hs_dir(const char *desc_id,
  635. const rend_data_t *rend_query,
  636. routerstatus_t *rs_hsdir)
  637. {
  638. routerstatus_t *hs_dir = rs_hsdir;
  639. char *hsdir_fp;
  640. char desc_id_base32[REND_DESC_ID_V2_LEN_BASE32 + 1];
  641. char descriptor_cookie_base64[3*REND_DESC_COOKIE_LEN_BASE64];
  642. const rend_data_v2_t *rend_data;
  643. #ifdef ENABLE_TOR2WEB_MODE
  644. const int tor2web_mode = get_options()->Tor2webMode;
  645. const int how_to_fetch = tor2web_mode ? DIRIND_ONEHOP : DIRIND_ANONYMOUS;
  646. #else
  647. const int how_to_fetch = DIRIND_ANONYMOUS;
  648. #endif
  649. tor_assert(desc_id);
  650. tor_assert(rend_query);
  651. rend_data = TO_REND_DATA_V2(rend_query);
  652. base32_encode(desc_id_base32, sizeof(desc_id_base32),
  653. desc_id, DIGEST_LEN);
  654. /* Automatically pick an hs dir if none given. */
  655. if (!rs_hsdir) {
  656. hs_dir = pick_hsdir(desc_id, desc_id_base32);
  657. if (!hs_dir) {
  658. /* No suitable hs dir can be found, stop right now. */
  659. control_event_hs_descriptor_failed(rend_query, NULL, "QUERY_NO_HSDIR");
  660. control_event_hs_descriptor_content(rend_data_get_address(rend_query),
  661. desc_id_base32, NULL, NULL);
  662. return 0;
  663. }
  664. }
  665. /* Add a copy of the HSDir identity digest to the query so we can track it
  666. * on the control port. */
  667. hsdir_fp = tor_memdup(hs_dir->identity_digest,
  668. sizeof(hs_dir->identity_digest));
  669. smartlist_add(rend_query->hsdirs_fp, hsdir_fp);
  670. /* Encode descriptor cookie for logging purposes. Also, if the cookie is
  671. * malformed, no fetch is triggered thus this needs to be done before the
  672. * fetch request. */
  673. if (rend_data->auth_type != REND_NO_AUTH) {
  674. if (base64_encode(descriptor_cookie_base64,
  675. sizeof(descriptor_cookie_base64),
  676. rend_data->descriptor_cookie,
  677. REND_DESC_COOKIE_LEN,
  678. 0)<0) {
  679. log_warn(LD_BUG, "Could not base64-encode descriptor cookie.");
  680. control_event_hs_descriptor_failed(rend_query, hsdir_fp, "BAD_DESC");
  681. control_event_hs_descriptor_content(rend_data_get_address(rend_query),
  682. desc_id_base32, hsdir_fp, NULL);
  683. return 0;
  684. }
  685. /* Remove == signs. */
  686. descriptor_cookie_base64[strlen(descriptor_cookie_base64)-2] = '\0';
  687. } else {
  688. strlcpy(descriptor_cookie_base64, "(none)",
  689. sizeof(descriptor_cookie_base64));
  690. }
  691. /* Send fetch request. (Pass query and possibly descriptor cookie so that
  692. * they can be written to the directory connection and be referred to when
  693. * the response arrives. */
  694. directory_request_t *req =
  695. directory_request_new(DIR_PURPOSE_FETCH_RENDDESC_V2);
  696. directory_request_set_routerstatus(req, hs_dir);
  697. directory_request_set_indirection(req, how_to_fetch);
  698. directory_request_set_resource(req, desc_id_base32);
  699. directory_request_set_rend_query(req, rend_query);
  700. directory_initiate_request(req);
  701. directory_request_free(req);
  702. log_info(LD_REND, "Sending fetch request for v2 descriptor for "
  703. "service '%s' with descriptor ID '%s', auth type %d, "
  704. "and descriptor cookie '%s' to hidden service "
  705. "directory %s",
  706. rend_data->onion_address, desc_id_base32,
  707. rend_data->auth_type,
  708. (rend_data->auth_type == REND_NO_AUTH ? "[none]" :
  709. escaped_safe_str_client(descriptor_cookie_base64)),
  710. routerstatus_describe(hs_dir));
  711. control_event_hs_descriptor_requested(rend_query,
  712. hs_dir->identity_digest,
  713. desc_id_base32);
  714. return 1;
  715. }
  716. /** Fetch a v2 descriptor using the given descriptor id. If any hsdir(s) are
  717. * given, they will be used instead.
  718. *
  719. * On success, 1 is returned. If no hidden service is left to ask, return 0.
  720. * On error, -1 is returned. */
  721. static int
  722. fetch_v2_desc_by_descid(const char *desc_id,
  723. const rend_data_t *rend_query, smartlist_t *hsdirs)
  724. {
  725. int ret;
  726. tor_assert(rend_query);
  727. if (!hsdirs) {
  728. ret = directory_get_from_hs_dir(desc_id, rend_query, NULL);
  729. goto end; /* either success or failure, but we're done */
  730. }
  731. /* Using the given hsdir list, trigger a fetch on each of them. */
  732. SMARTLIST_FOREACH_BEGIN(hsdirs, routerstatus_t *, hs_dir) {
  733. /* This should always be a success. */
  734. ret = directory_get_from_hs_dir(desc_id, rend_query, hs_dir);
  735. tor_assert(ret);
  736. } SMARTLIST_FOREACH_END(hs_dir);
  737. /* Everything went well. */
  738. ret = 0;
  739. end:
  740. return ret;
  741. }
  742. /** Fetch a v2 descriptor using the onion address in the given query object.
  743. * This will compute the descriptor id for each replicas and fetch it on the
  744. * given hsdir(s) if any or the responsible ones that are choosen
  745. * automatically.
  746. *
  747. * On success, 1 is returned. If no hidden service is left to ask, return 0.
  748. * On error, -1 is returned. */
  749. static int
  750. fetch_v2_desc_by_addr(rend_data_t *rend_query, smartlist_t *hsdirs)
  751. {
  752. char descriptor_id[DIGEST_LEN];
  753. int replicas_left_to_try[REND_NUMBER_OF_NON_CONSECUTIVE_REPLICAS];
  754. int i, tries_left, ret;
  755. rend_data_v2_t *rend_data = TO_REND_DATA_V2(rend_query);
  756. /* Randomly iterate over the replicas until a descriptor can be fetched
  757. * from one of the consecutive nodes, or no options are left. */
  758. for (i = 0; i < REND_NUMBER_OF_NON_CONSECUTIVE_REPLICAS; i++) {
  759. replicas_left_to_try[i] = i;
  760. }
  761. tries_left = REND_NUMBER_OF_NON_CONSECUTIVE_REPLICAS;
  762. while (tries_left > 0) {
  763. int rand_val = crypto_rand_int(tries_left);
  764. int chosen_replica = replicas_left_to_try[rand_val];
  765. replicas_left_to_try[rand_val] = replicas_left_to_try[--tries_left];
  766. ret = rend_compute_v2_desc_id(descriptor_id,
  767. rend_data->onion_address,
  768. rend_data->auth_type == REND_STEALTH_AUTH ?
  769. rend_data->descriptor_cookie : NULL,
  770. time(NULL), chosen_replica);
  771. if (ret < 0) {
  772. /* Normally, on failure the descriptor_id is untouched but let's be
  773. * safe in general in case the function changes at some point. */
  774. goto end;
  775. }
  776. if (tor_memcmp(descriptor_id, rend_data->descriptor_id[chosen_replica],
  777. sizeof(descriptor_id)) != 0) {
  778. /* Not equal from what we currently have so purge the last hid serv
  779. * request cache and update the descriptor ID with the new value. */
  780. purge_hid_serv_from_last_hid_serv_requests(
  781. rend_data->descriptor_id[chosen_replica]);
  782. memcpy(rend_data->descriptor_id[chosen_replica], descriptor_id,
  783. sizeof(rend_data->descriptor_id[chosen_replica]));
  784. }
  785. /* Trigger the fetch with the computed descriptor ID. */
  786. ret = fetch_v2_desc_by_descid(descriptor_id, rend_query, hsdirs);
  787. if (ret != 0) {
  788. /* Either on success or failure, as long as we tried a fetch we are
  789. * done here. */
  790. goto end;
  791. }
  792. }
  793. /* If we come here, there are no hidden service directories left. */
  794. log_info(LD_REND, "Could not pick one of the responsible hidden "
  795. "service directories to fetch descriptors, because "
  796. "we already tried them all unsuccessfully.");
  797. ret = 0;
  798. end:
  799. memwipe(descriptor_id, 0, sizeof(descriptor_id));
  800. return ret;
  801. }
  802. /** Fetch a v2 descriptor using the given query. If any hsdir are specified,
  803. * use them for the fetch.
  804. *
  805. * On success, 1 is returned. If no hidden service is left to ask, return 0.
  806. * On error, -1 is returned. */
  807. int
  808. rend_client_fetch_v2_desc(rend_data_t *query, smartlist_t *hsdirs)
  809. {
  810. int ret;
  811. rend_data_v2_t *rend_data;
  812. const char *onion_address;
  813. tor_assert(query);
  814. /* Get the version 2 data structure of the query. */
  815. rend_data = TO_REND_DATA_V2(query);
  816. onion_address = rend_data_get_address(query);
  817. /* Depending on what's available in the rend data query object, we will
  818. * trigger a fetch by HS address or using a descriptor ID. */
  819. if (onion_address[0] != '\0') {
  820. ret = fetch_v2_desc_by_addr(query, hsdirs);
  821. } else if (!tor_digest_is_zero(rend_data->desc_id_fetch)) {
  822. ret = fetch_v2_desc_by_descid(rend_data->desc_id_fetch, query,
  823. hsdirs);
  824. } else {
  825. /* Query data is invalid. */
  826. ret = -1;
  827. goto error;
  828. }
  829. error:
  830. return ret;
  831. }
  832. /** Unless we already have a descriptor for <b>rend_query</b> with at least
  833. * one (possibly) working introduction point in it, start a connection to a
  834. * hidden service directory to fetch a v2 rendezvous service descriptor. */
  835. void
  836. rend_client_refetch_v2_renddesc(rend_data_t *rend_query)
  837. {
  838. rend_cache_entry_t *e = NULL;
  839. const char *onion_address = rend_data_get_address(rend_query);
  840. tor_assert(rend_query);
  841. /* Before fetching, check if we already have a usable descriptor here. */
  842. if (rend_cache_lookup_entry(onion_address, -1, &e) == 0 &&
  843. rend_client_any_intro_points_usable(e)) {
  844. log_info(LD_REND, "We would fetch a v2 rendezvous descriptor, but we "
  845. "already have a usable descriptor here. Not fetching.");
  846. return;
  847. }
  848. /* Are we configured to fetch descriptors? */
  849. if (!get_options()->FetchHidServDescriptors) {
  850. log_warn(LD_REND, "We received an onion address for a v2 rendezvous "
  851. "service descriptor, but are not fetching service descriptors.");
  852. return;
  853. }
  854. log_debug(LD_REND, "Fetching v2 rendezvous descriptor for service %s",
  855. safe_str_client(onion_address));
  856. rend_client_fetch_v2_desc(rend_query, NULL);
  857. /* We don't need to look the error code because either on failure or
  858. * success, the necessary steps to continue the HS connection will be
  859. * triggered once the descriptor arrives or if all fetch failed. */
  860. return;
  861. }
  862. /** Cancel all rendezvous descriptor fetches currently in progress.
  863. */
  864. void
  865. rend_client_cancel_descriptor_fetches(void)
  866. {
  867. smartlist_t *connection_array = get_connection_array();
  868. SMARTLIST_FOREACH_BEGIN(connection_array, connection_t *, conn) {
  869. if (conn->type == CONN_TYPE_DIR &&
  870. conn->purpose == DIR_PURPOSE_FETCH_RENDDESC_V2) {
  871. /* It's a rendezvous descriptor fetch in progress -- cancel it
  872. * by marking the connection for close.
  873. *
  874. * Even if this connection has already reached EOF, this is
  875. * enough to make sure that if the descriptor hasn't been
  876. * processed yet, it won't be. See the end of
  877. * connection_handle_read; connection_reached_eof (indirectly)
  878. * processes whatever response the connection received. */
  879. const rend_data_t *rd = (TO_DIR_CONN(conn))->rend_data;
  880. if (!rd) {
  881. log_warn(LD_BUG | LD_REND,
  882. "Marking for close dir conn fetching rendezvous "
  883. "descriptor for unknown service!");
  884. } else {
  885. log_debug(LD_REND, "Marking for close dir conn fetching "
  886. "rendezvous descriptor for service %s",
  887. safe_str(rend_data_get_address(rd)));
  888. }
  889. connection_mark_for_close(conn);
  890. }
  891. } SMARTLIST_FOREACH_END(conn);
  892. }
  893. /** Mark <b>failed_intro</b> as a failed introduction point for the
  894. * hidden service specified by <b>rend_query</b>. If the HS now has no
  895. * usable intro points, or we do not have an HS descriptor for it,
  896. * then launch a new renddesc fetch.
  897. *
  898. * If <b>failure_type</b> is INTRO_POINT_FAILURE_GENERIC, remove the
  899. * intro point from (our parsed copy of) the HS descriptor.
  900. *
  901. * If <b>failure_type</b> is INTRO_POINT_FAILURE_TIMEOUT, mark the
  902. * intro point as 'timed out'; it will not be retried until the
  903. * current hidden service connection attempt has ended or it has
  904. * appeared in a newly fetched rendezvous descriptor.
  905. *
  906. * If <b>failure_type</b> is INTRO_POINT_FAILURE_UNREACHABLE,
  907. * increment the intro point's reachability-failure count; if it has
  908. * now failed MAX_INTRO_POINT_REACHABILITY_FAILURES or more times,
  909. * remove the intro point from (our parsed copy of) the HS descriptor.
  910. *
  911. * Return -1 if error, 0 if no usable intro points remain or service
  912. * unrecognized, 1 if recognized and some intro points remain.
  913. */
  914. int
  915. rend_client_report_intro_point_failure(extend_info_t *failed_intro,
  916. rend_data_t *rend_data,
  917. unsigned int failure_type)
  918. {
  919. int i, r;
  920. rend_cache_entry_t *ent;
  921. connection_t *conn;
  922. const char *onion_address = rend_data_get_address(rend_data);
  923. r = rend_cache_lookup_entry(onion_address, -1, &ent);
  924. if (r < 0) {
  925. /* Either invalid onion address or cache entry not found. */
  926. switch (-r) {
  927. case EINVAL:
  928. log_warn(LD_BUG, "Malformed service ID %s.",
  929. escaped_safe_str_client(onion_address));
  930. return -1;
  931. case ENOENT:
  932. log_info(LD_REND, "Unknown service %s. Re-fetching descriptor.",
  933. escaped_safe_str_client(onion_address));
  934. rend_client_refetch_v2_renddesc(rend_data);
  935. return 0;
  936. default:
  937. log_warn(LD_BUG, "Unknown cache lookup returned code: %d", r);
  938. return -1;
  939. }
  940. }
  941. /* The intro points are not checked here if they are usable or not because
  942. * this is called when an intro point circuit is closed thus there must be
  943. * at least one intro point that is usable and is about to be flagged. */
  944. for (i = 0; i < smartlist_len(ent->parsed->intro_nodes); i++) {
  945. rend_intro_point_t *intro = smartlist_get(ent->parsed->intro_nodes, i);
  946. if (tor_memeq(failed_intro->identity_digest,
  947. intro->extend_info->identity_digest, DIGEST_LEN)) {
  948. switch (failure_type) {
  949. default:
  950. log_warn(LD_BUG, "Unknown failure type %u. Removing intro point.",
  951. failure_type);
  952. tor_fragile_assert();
  953. /* fall through */
  954. case INTRO_POINT_FAILURE_GENERIC:
  955. rend_cache_intro_failure_note(failure_type,
  956. (uint8_t *)failed_intro->identity_digest,
  957. onion_address);
  958. rend_intro_point_free(intro);
  959. smartlist_del(ent->parsed->intro_nodes, i);
  960. break;
  961. case INTRO_POINT_FAILURE_TIMEOUT:
  962. intro->timed_out = 1;
  963. break;
  964. case INTRO_POINT_FAILURE_UNREACHABLE:
  965. ++(intro->unreachable_count);
  966. {
  967. int zap_intro_point =
  968. intro->unreachable_count >= MAX_INTRO_POINT_REACHABILITY_FAILURES;
  969. log_info(LD_REND, "Failed to reach this intro point %u times.%s",
  970. intro->unreachable_count,
  971. zap_intro_point ? " Removing from descriptor.": "");
  972. if (zap_intro_point) {
  973. rend_cache_intro_failure_note(
  974. failure_type,
  975. (uint8_t *) failed_intro->identity_digest, onion_address);
  976. rend_intro_point_free(intro);
  977. smartlist_del(ent->parsed->intro_nodes, i);
  978. }
  979. }
  980. break;
  981. }
  982. break;
  983. }
  984. }
  985. if (! rend_client_any_intro_points_usable(ent)) {
  986. log_info(LD_REND,
  987. "No more intro points remain for %s. Re-fetching descriptor.",
  988. escaped_safe_str_client(onion_address));
  989. rend_client_refetch_v2_renddesc(rend_data);
  990. /* move all pending streams back to renddesc_wait */
  991. /* NOTE: We can now do this faster, if we use pending_entry_connections */
  992. while ((conn = connection_get_by_type_state_rendquery(CONN_TYPE_AP,
  993. AP_CONN_STATE_CIRCUIT_WAIT,
  994. onion_address))) {
  995. connection_ap_mark_as_non_pending_circuit(TO_ENTRY_CONN(conn));
  996. conn->state = AP_CONN_STATE_RENDDESC_WAIT;
  997. }
  998. return 0;
  999. }
  1000. log_info(LD_REND,"%d options left for %s.",
  1001. smartlist_len(ent->parsed->intro_nodes),
  1002. escaped_safe_str_client(onion_address));
  1003. return 1;
  1004. }
  1005. /** Called when we receive a RENDEZVOUS_ESTABLISHED cell; changes the state of
  1006. * the circuit to C_REND_READY.
  1007. */
  1008. int
  1009. rend_client_rendezvous_acked(origin_circuit_t *circ, const uint8_t *request,
  1010. size_t request_len)
  1011. {
  1012. (void) request;
  1013. (void) request_len;
  1014. /* we just got an ack for our establish-rendezvous. switch purposes. */
  1015. if (circ->base_.purpose != CIRCUIT_PURPOSE_C_ESTABLISH_REND) {
  1016. log_warn(LD_PROTOCOL,"Got a rendezvous ack when we weren't expecting one. "
  1017. "Closing circ.");
  1018. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  1019. return -1;
  1020. }
  1021. log_info(LD_REND,"Got rendezvous ack. This circuit is now ready for "
  1022. "rendezvous.");
  1023. circuit_change_purpose(TO_CIRCUIT(circ), CIRCUIT_PURPOSE_C_REND_READY);
  1024. /* Set timestamp_dirty, because circuit_expire_building expects it
  1025. * to specify when a circuit entered the _C_REND_READY state. */
  1026. circ->base_.timestamp_dirty = time(NULL);
  1027. /* From a path bias point of view, this circuit is now successfully used.
  1028. * Waiting any longer opens us up to attacks from malicious hidden services.
  1029. * They could induce the client to attempt to connect to their hidden
  1030. * service and never reply to the client's rend requests */
  1031. pathbias_mark_use_success(circ);
  1032. /* XXXX++ This is a pretty brute-force approach. It'd be better to
  1033. * attach only the connections that are waiting on this circuit, rather
  1034. * than trying to attach them all. See comments bug 743. */
  1035. /* If we already have the introduction circuit built, make sure we send
  1036. * the INTRODUCE cell _now_ */
  1037. connection_ap_attach_pending(1);
  1038. return 0;
  1039. }
  1040. /** The service sent us a rendezvous cell; join the circuits. */
  1041. int
  1042. rend_client_receive_rendezvous(origin_circuit_t *circ, const uint8_t *request,
  1043. size_t request_len)
  1044. {
  1045. crypt_path_t *hop;
  1046. char keys[DIGEST_LEN+CPATH_KEY_MATERIAL_LEN];
  1047. if ((circ->base_.purpose != CIRCUIT_PURPOSE_C_REND_READY &&
  1048. circ->base_.purpose != CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED)
  1049. || !circ->build_state->pending_final_cpath) {
  1050. log_warn(LD_PROTOCOL,"Got rendezvous2 cell from hidden service, but not "
  1051. "expecting it. Closing.");
  1052. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  1053. return -1;
  1054. }
  1055. if (request_len != DH_KEY_LEN+DIGEST_LEN) {
  1056. log_warn(LD_PROTOCOL,"Incorrect length (%d) on RENDEZVOUS2 cell.",
  1057. (int)request_len);
  1058. goto err;
  1059. }
  1060. log_info(LD_REND,"Got RENDEZVOUS2 cell from hidden service.");
  1061. /* first DH_KEY_LEN bytes are g^y from the service. Finish the dh
  1062. * handshake...*/
  1063. tor_assert(circ->build_state);
  1064. tor_assert(circ->build_state->pending_final_cpath);
  1065. hop = circ->build_state->pending_final_cpath;
  1066. tor_assert(hop->rend_dh_handshake_state);
  1067. if (crypto_dh_compute_secret(LOG_PROTOCOL_WARN,
  1068. hop->rend_dh_handshake_state, (char*)request,
  1069. DH_KEY_LEN,
  1070. keys, DIGEST_LEN+CPATH_KEY_MATERIAL_LEN)<0) {
  1071. log_warn(LD_GENERAL, "Couldn't complete DH handshake.");
  1072. goto err;
  1073. }
  1074. /* ... and set up cpath. */
  1075. if (circuit_init_cpath_crypto(hop, keys+DIGEST_LEN, 0)<0)
  1076. goto err;
  1077. /* Check whether the digest is right... */
  1078. if (tor_memneq(keys, request+DH_KEY_LEN, DIGEST_LEN)) {
  1079. log_warn(LD_PROTOCOL, "Incorrect digest of key material.");
  1080. goto err;
  1081. }
  1082. crypto_dh_free(hop->rend_dh_handshake_state);
  1083. hop->rend_dh_handshake_state = NULL;
  1084. /* All is well. Extend the circuit. */
  1085. circuit_change_purpose(TO_CIRCUIT(circ), CIRCUIT_PURPOSE_C_REND_JOINED);
  1086. hop->state = CPATH_STATE_OPEN;
  1087. /* set the windows to default. these are the windows
  1088. * that the client thinks the service has.
  1089. */
  1090. hop->package_window = circuit_initial_package_window();
  1091. hop->deliver_window = CIRCWINDOW_START;
  1092. /* Now that this circuit has finished connecting to its destination,
  1093. * make sure circuit_get_open_circ_or_launch is willing to return it
  1094. * so we can actually use it. */
  1095. circ->hs_circ_has_timed_out = 0;
  1096. onion_append_to_cpath(&circ->cpath, hop);
  1097. circ->build_state->pending_final_cpath = NULL; /* prevent double-free */
  1098. circuit_try_attaching_streams(circ);
  1099. memwipe(keys, 0, sizeof(keys));
  1100. return 0;
  1101. err:
  1102. memwipe(keys, 0, sizeof(keys));
  1103. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  1104. return -1;
  1105. }
  1106. /** Find all the apconns in state AP_CONN_STATE_RENDDESC_WAIT that are
  1107. * waiting on <b>query</b>. If there's a working cache entry here with at
  1108. * least one intro point, move them to the next state. */
  1109. void
  1110. rend_client_desc_trynow(const char *query)
  1111. {
  1112. entry_connection_t *conn;
  1113. rend_cache_entry_t *entry;
  1114. const rend_data_t *rend_data;
  1115. time_t now = time(NULL);
  1116. smartlist_t *conns = get_connection_array();
  1117. SMARTLIST_FOREACH_BEGIN(conns, connection_t *, base_conn) {
  1118. if (base_conn->type != CONN_TYPE_AP ||
  1119. base_conn->state != AP_CONN_STATE_RENDDESC_WAIT ||
  1120. base_conn->marked_for_close)
  1121. continue;
  1122. conn = TO_ENTRY_CONN(base_conn);
  1123. rend_data = ENTRY_TO_EDGE_CONN(conn)->rend_data;
  1124. if (!rend_data)
  1125. continue;
  1126. const char *onion_address = rend_data_get_address(rend_data);
  1127. if (rend_cmp_service_ids(query, onion_address))
  1128. continue;
  1129. assert_connection_ok(base_conn, now);
  1130. if (rend_cache_lookup_entry(onion_address, -1,
  1131. &entry) == 0 &&
  1132. rend_client_any_intro_points_usable(entry)) {
  1133. /* either this fetch worked, or it failed but there was a
  1134. * valid entry from before which we should reuse */
  1135. log_info(LD_REND,"Rend desc is usable. Launching circuits.");
  1136. base_conn->state = AP_CONN_STATE_CIRCUIT_WAIT;
  1137. /* restart their timeout values, so they get a fair shake at
  1138. * connecting to the hidden service. */
  1139. base_conn->timestamp_created = now;
  1140. base_conn->timestamp_lastread = now;
  1141. base_conn->timestamp_lastwritten = now;
  1142. connection_ap_mark_as_pending_circuit(conn);
  1143. } else { /* 404, or fetch didn't get that far */
  1144. log_notice(LD_REND,"Closing stream for '%s.onion': hidden service is "
  1145. "unavailable (try again later).",
  1146. safe_str_client(query));
  1147. connection_mark_unattached_ap(conn, END_STREAM_REASON_RESOLVEFAILED);
  1148. rend_client_note_connection_attempt_ended(rend_data);
  1149. }
  1150. } SMARTLIST_FOREACH_END(base_conn);
  1151. }
  1152. /** Clear temporary state used only during an attempt to connect to the
  1153. * hidden service with <b>rend_data</b>. Called when a connection attempt
  1154. * has ended; it is possible for this to be called multiple times while
  1155. * handling an ended connection attempt, and any future changes to this
  1156. * function must ensure it remains idempotent. */
  1157. void
  1158. rend_client_note_connection_attempt_ended(const rend_data_t *rend_data)
  1159. {
  1160. unsigned int have_onion = 0;
  1161. rend_cache_entry_t *cache_entry = NULL;
  1162. const char *onion_address = rend_data_get_address(rend_data);
  1163. rend_data_v2_t *rend_data_v2 = TO_REND_DATA_V2(rend_data);
  1164. if (onion_address[0] != '\0') {
  1165. /* Ignore return value; we find an entry, or we don't. */
  1166. (void) rend_cache_lookup_entry(onion_address, -1, &cache_entry);
  1167. have_onion = 1;
  1168. }
  1169. /* Clear the timed_out flag on all remaining intro points for this HS. */
  1170. if (cache_entry != NULL) {
  1171. SMARTLIST_FOREACH(cache_entry->parsed->intro_nodes,
  1172. rend_intro_point_t *, ip,
  1173. ip->timed_out = 0; );
  1174. }
  1175. /* Remove the HS's entries in last_hid_serv_requests. */
  1176. if (have_onion) {
  1177. unsigned int replica;
  1178. for (replica = 0; replica < ARRAY_LENGTH(rend_data_v2->descriptor_id);
  1179. replica++) {
  1180. const char *desc_id = rend_data_v2->descriptor_id[replica];
  1181. purge_hid_serv_from_last_hid_serv_requests(desc_id);
  1182. }
  1183. log_info(LD_REND, "Connection attempt for %s has ended; "
  1184. "cleaning up temporary state.",
  1185. safe_str_client(onion_address));
  1186. } else {
  1187. /* We only have an ID for a fetch. Probably used by HSFETCH. */
  1188. purge_hid_serv_from_last_hid_serv_requests(rend_data_v2->desc_id_fetch);
  1189. }
  1190. }
  1191. /** Return a newly allocated extend_info_t* for a randomly chosen introduction
  1192. * point for the named hidden service. Return NULL if all introduction points
  1193. * have been tried and failed.
  1194. */
  1195. extend_info_t *
  1196. rend_client_get_random_intro(const rend_data_t *rend_query)
  1197. {
  1198. int ret;
  1199. extend_info_t *result;
  1200. rend_cache_entry_t *entry;
  1201. const char *onion_address = rend_data_get_address(rend_query);
  1202. ret = rend_cache_lookup_entry(onion_address, -1, &entry);
  1203. if (ret < 0 || !rend_client_any_intro_points_usable(entry)) {
  1204. log_warn(LD_REND,
  1205. "Query '%s' didn't have valid rend desc in cache. Failing.",
  1206. safe_str_client(onion_address));
  1207. /* XXX: Should we refetch the descriptor here if the IPs are not usable
  1208. * anymore ?. */
  1209. return NULL;
  1210. }
  1211. /* See if we can get a node that complies with ExcludeNodes */
  1212. if ((result = rend_client_get_random_intro_impl(entry, 1, 1)))
  1213. return result;
  1214. /* If not, and StrictNodes is not set, see if we can return any old node
  1215. */
  1216. if (!get_options()->StrictNodes)
  1217. return rend_client_get_random_intro_impl(entry, 0, 1);
  1218. return NULL;
  1219. }
  1220. /** As rend_client_get_random_intro, except assume that StrictNodes is set
  1221. * iff <b>strict</b> is true. If <b>warnings</b> is false, don't complain
  1222. * to the user when we're out of nodes, even if StrictNodes is true.
  1223. */
  1224. static extend_info_t *
  1225. rend_client_get_random_intro_impl(const rend_cache_entry_t *entry,
  1226. const int strict,
  1227. const int warnings)
  1228. {
  1229. int i;
  1230. rend_intro_point_t *intro;
  1231. const or_options_t *options = get_options();
  1232. smartlist_t *usable_nodes;
  1233. int n_excluded = 0;
  1234. /* We'll keep a separate list of the usable nodes. If this becomes empty,
  1235. * no nodes are usable. */
  1236. usable_nodes = smartlist_new();
  1237. smartlist_add_all(usable_nodes, entry->parsed->intro_nodes);
  1238. /* Remove the intro points that have timed out during this HS
  1239. * connection attempt from our list of usable nodes. */
  1240. SMARTLIST_FOREACH(usable_nodes, rend_intro_point_t *, ip,
  1241. if (ip->timed_out) {
  1242. SMARTLIST_DEL_CURRENT(usable_nodes, ip);
  1243. });
  1244. again:
  1245. if (smartlist_len(usable_nodes) == 0) {
  1246. if (n_excluded && get_options()->StrictNodes && warnings) {
  1247. /* We only want to warn if StrictNodes is really set. Otherwise
  1248. * we're just about to retry anyways.
  1249. */
  1250. log_warn(LD_REND, "All introduction points for hidden service are "
  1251. "at excluded relays, and StrictNodes is set. Skipping.");
  1252. }
  1253. smartlist_free(usable_nodes);
  1254. return NULL;
  1255. }
  1256. i = crypto_rand_int(smartlist_len(usable_nodes));
  1257. intro = smartlist_get(usable_nodes, i);
  1258. if (BUG(!intro->extend_info)) {
  1259. /* This should never happen, but it isn't fatal, just try another */
  1260. smartlist_del(usable_nodes, i);
  1261. goto again;
  1262. }
  1263. /* All version 2 HS descriptors come with a TAP onion key.
  1264. * Clients used to try to get the TAP onion key from the consensus, but this
  1265. * meant that hidden services could discover which consensus clients have. */
  1266. if (!extend_info_supports_tap(intro->extend_info)) {
  1267. log_info(LD_REND, "The HS descriptor is missing a TAP onion key for the "
  1268. "intro-point relay '%s'; trying another.",
  1269. safe_str_client(extend_info_describe(intro->extend_info)));
  1270. smartlist_del(usable_nodes, i);
  1271. goto again;
  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. }