rendclient.c 57 KB

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