rendclient.c 56 KB

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