rendclient.c 57 KB

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