rendclient.c 57 KB

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