rendclient.c 47 KB

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