circuituse.c 84 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264
  1. /* Copyright (c) 2001 Matej Pfajfar.
  2. * Copyright (c) 2001-2004, Roger Dingledine.
  3. * Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
  4. * Copyright (c) 2007-2012, The Tor Project, Inc. */
  5. /* See LICENSE for licensing information */
  6. /**
  7. * \file circuituse.c
  8. * \brief Launch the right sort of circuits and attach streams to them.
  9. **/
  10. #include "or.h"
  11. #include "addressmap.h"
  12. #include "channel.h"
  13. #include "circuitbuild.h"
  14. #include "circuitlist.h"
  15. #include "circuitstats.h"
  16. #include "circuituse.h"
  17. #include "config.h"
  18. #include "connection.h"
  19. #include "connection_edge.h"
  20. #include "control.h"
  21. #include "entrynodes.h"
  22. #include "nodelist.h"
  23. #include "networkstatus.h"
  24. #include "policies.h"
  25. #include "rendclient.h"
  26. #include "rendcommon.h"
  27. #include "rendservice.h"
  28. #include "rephist.h"
  29. #include "router.h"
  30. #include "routerlist.h"
  31. /********* START VARIABLES **********/
  32. extern circuit_t *global_circuitlist; /* from circuitlist.c */
  33. /********* END VARIABLES ************/
  34. static void circuit_expire_old_circuits_clientside(void);
  35. static void circuit_increment_failure_count(void);
  36. /** Return 1 if <b>circ</b> could be returned by circuit_get_best().
  37. * Else return 0.
  38. */
  39. static int
  40. circuit_is_acceptable(const origin_circuit_t *origin_circ,
  41. const entry_connection_t *conn,
  42. int must_be_open, uint8_t purpose,
  43. int need_uptime, int need_internal,
  44. time_t now)
  45. {
  46. const circuit_t *circ = TO_CIRCUIT(origin_circ);
  47. const node_t *exitnode;
  48. cpath_build_state_t *build_state;
  49. tor_assert(circ);
  50. tor_assert(conn);
  51. tor_assert(conn->socks_request);
  52. if (must_be_open && (circ->state != CIRCUIT_STATE_OPEN || !circ->n_chan))
  53. return 0; /* ignore non-open circs */
  54. if (circ->marked_for_close)
  55. return 0;
  56. /* if this circ isn't our purpose, skip. */
  57. if (purpose == CIRCUIT_PURPOSE_C_REND_JOINED && !must_be_open) {
  58. if (circ->purpose != CIRCUIT_PURPOSE_C_ESTABLISH_REND &&
  59. circ->purpose != CIRCUIT_PURPOSE_C_REND_READY &&
  60. circ->purpose != CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED &&
  61. circ->purpose != CIRCUIT_PURPOSE_C_REND_JOINED)
  62. return 0;
  63. } else if (purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT &&
  64. !must_be_open) {
  65. if (circ->purpose != CIRCUIT_PURPOSE_C_INTRODUCING &&
  66. circ->purpose != CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT)
  67. return 0;
  68. } else {
  69. if (purpose != circ->purpose)
  70. return 0;
  71. }
  72. /* If this is a timed-out hidden service circuit, skip it. */
  73. if (origin_circ->hs_circ_has_timed_out) {
  74. return 0;
  75. }
  76. if (purpose == CIRCUIT_PURPOSE_C_GENERAL ||
  77. purpose == CIRCUIT_PURPOSE_C_REND_JOINED)
  78. if (circ->timestamp_dirty &&
  79. circ->timestamp_dirty+get_options()->MaxCircuitDirtiness <= now)
  80. return 0;
  81. /* decide if this circ is suitable for this conn */
  82. /* for rend circs, circ->cpath->prev is not the last router in the
  83. * circuit, it's the magical extra bob hop. so just check the nickname
  84. * of the one we meant to finish at.
  85. */
  86. build_state = origin_circ->build_state;
  87. exitnode = build_state_get_exit_node(build_state);
  88. if (need_uptime && !build_state->need_uptime)
  89. return 0;
  90. if (need_internal != build_state->is_internal)
  91. return 0;
  92. if (purpose == CIRCUIT_PURPOSE_C_GENERAL) {
  93. if (!exitnode && !build_state->onehop_tunnel) {
  94. log_debug(LD_CIRC,"Not considering circuit with unknown router.");
  95. return 0; /* this circuit is screwed and doesn't know it yet,
  96. * or is a rendezvous circuit. */
  97. }
  98. if (build_state->onehop_tunnel) {
  99. if (!conn->want_onehop) {
  100. log_debug(LD_CIRC,"Skipping one-hop circuit.");
  101. return 0;
  102. }
  103. tor_assert(conn->chosen_exit_name);
  104. if (build_state->chosen_exit) {
  105. char digest[DIGEST_LEN];
  106. if (hexdigest_to_digest(conn->chosen_exit_name, digest) < 0)
  107. return 0; /* broken digest, we don't want it */
  108. if (tor_memneq(digest, build_state->chosen_exit->identity_digest,
  109. DIGEST_LEN))
  110. return 0; /* this is a circuit to somewhere else */
  111. if (tor_digest_is_zero(digest)) {
  112. /* we don't know the digest; have to compare addr:port */
  113. tor_addr_t addr;
  114. int r = tor_addr_parse(&addr, conn->socks_request->address);
  115. if (r < 0 ||
  116. !tor_addr_eq(&build_state->chosen_exit->addr, &addr) ||
  117. build_state->chosen_exit->port != conn->socks_request->port)
  118. return 0;
  119. }
  120. }
  121. } else {
  122. if (conn->want_onehop) {
  123. /* don't use three-hop circuits -- that could hurt our anonymity. */
  124. return 0;
  125. }
  126. }
  127. if (exitnode && !connection_ap_can_use_exit(conn, exitnode)) {
  128. /* can't exit from this router */
  129. return 0;
  130. }
  131. } else { /* not general */
  132. const edge_connection_t *edge_conn = ENTRY_TO_EDGE_CONN(conn);
  133. if ((edge_conn->rend_data && !origin_circ->rend_data) ||
  134. (!edge_conn->rend_data && origin_circ->rend_data) ||
  135. (edge_conn->rend_data && origin_circ->rend_data &&
  136. rend_cmp_service_ids(edge_conn->rend_data->onion_address,
  137. origin_circ->rend_data->onion_address))) {
  138. /* this circ is not for this conn */
  139. return 0;
  140. }
  141. }
  142. if (!connection_edge_compatible_with_circuit(conn, origin_circ)) {
  143. /* conn needs to be isolated from other conns that have already used
  144. * origin_circ */
  145. return 0;
  146. }
  147. return 1;
  148. }
  149. /** Return 1 if circuit <b>a</b> is better than circuit <b>b</b> for
  150. * <b>conn</b>, and return 0 otherwise. Used by circuit_get_best.
  151. */
  152. static int
  153. circuit_is_better(const origin_circuit_t *oa, const origin_circuit_t *ob,
  154. const entry_connection_t *conn)
  155. {
  156. const circuit_t *a = TO_CIRCUIT(oa);
  157. const circuit_t *b = TO_CIRCUIT(ob);
  158. const uint8_t purpose = ENTRY_TO_CONN(conn)->purpose;
  159. int a_bits, b_bits;
  160. /* If one of the circuits was allowed to live due to relaxing its timeout,
  161. * it is definitely worse (it's probably a much slower path). */
  162. if (oa->relaxed_timeout && !ob->relaxed_timeout)
  163. return 0; /* ob is better. It's not relaxed. */
  164. if (!oa->relaxed_timeout && ob->relaxed_timeout)
  165. return 1; /* oa is better. It's not relaxed. */
  166. switch (purpose) {
  167. case CIRCUIT_PURPOSE_C_GENERAL:
  168. /* if it's used but less dirty it's best;
  169. * else if it's more recently created it's best
  170. */
  171. if (b->timestamp_dirty) {
  172. if (a->timestamp_dirty &&
  173. a->timestamp_dirty > b->timestamp_dirty)
  174. return 1;
  175. } else {
  176. if (a->timestamp_dirty ||
  177. timercmp(&a->timestamp_began, &b->timestamp_began, >))
  178. return 1;
  179. if (ob->build_state->is_internal)
  180. /* XXX023 what the heck is this internal thing doing here. I
  181. * think we can get rid of it. circuit_is_acceptable() already
  182. * makes sure that is_internal is exactly what we need it to
  183. * be. -RD */
  184. return 1;
  185. }
  186. break;
  187. case CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT:
  188. /* the closer it is to ack_wait the better it is */
  189. if (a->purpose > b->purpose)
  190. return 1;
  191. break;
  192. case CIRCUIT_PURPOSE_C_REND_JOINED:
  193. /* the closer it is to rend_joined the better it is */
  194. if (a->purpose > b->purpose)
  195. return 1;
  196. break;
  197. }
  198. /* XXXX023 Maybe this check should get a higher priority to avoid
  199. * using up circuits too rapidly. */
  200. a_bits = connection_edge_update_circuit_isolation(conn,
  201. (origin_circuit_t*)oa, 1);
  202. b_bits = connection_edge_update_circuit_isolation(conn,
  203. (origin_circuit_t*)ob, 1);
  204. /* if x_bits < 0, then we have not used x for anything; better not to dirty
  205. * a connection if we can help it. */
  206. if (a_bits < 0) {
  207. return 0;
  208. } else if (b_bits < 0) {
  209. return 1;
  210. }
  211. a_bits &= ~ oa->isolation_flags_mixed;
  212. a_bits &= ~ ob->isolation_flags_mixed;
  213. if (n_bits_set_u8(a_bits) < n_bits_set_u8(b_bits)) {
  214. /* The fewer new restrictions we need to make on a circuit for stream
  215. * isolation, the better. */
  216. return 1;
  217. }
  218. return 0;
  219. }
  220. /** Find the best circ that conn can use, preferably one which is
  221. * dirty. Circ must not be too old.
  222. *
  223. * Conn must be defined.
  224. *
  225. * If must_be_open, ignore circs not in CIRCUIT_STATE_OPEN.
  226. *
  227. * circ_purpose specifies what sort of circuit we must have.
  228. * It can be C_GENERAL, C_INTRODUCE_ACK_WAIT, or C_REND_JOINED.
  229. *
  230. * If it's REND_JOINED and must_be_open==0, then return the closest
  231. * rendezvous-purposed circuit that you can find.
  232. *
  233. * If it's INTRODUCE_ACK_WAIT and must_be_open==0, then return the
  234. * closest introduce-purposed circuit that you can find.
  235. */
  236. static origin_circuit_t *
  237. circuit_get_best(const entry_connection_t *conn,
  238. int must_be_open, uint8_t purpose,
  239. int need_uptime, int need_internal)
  240. {
  241. circuit_t *circ;
  242. origin_circuit_t *best=NULL;
  243. struct timeval now;
  244. int intro_going_on_but_too_old = 0;
  245. tor_assert(conn);
  246. tor_assert(purpose == CIRCUIT_PURPOSE_C_GENERAL ||
  247. purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT ||
  248. purpose == CIRCUIT_PURPOSE_C_REND_JOINED);
  249. tor_gettimeofday(&now);
  250. for (circ=global_circuitlist;circ;circ = circ->next) {
  251. origin_circuit_t *origin_circ;
  252. if (!CIRCUIT_IS_ORIGIN(circ))
  253. continue;
  254. origin_circ = TO_ORIGIN_CIRCUIT(circ);
  255. /* Log an info message if we're going to launch a new intro circ in
  256. * parallel */
  257. if (purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT &&
  258. !must_be_open && origin_circ->hs_circ_has_timed_out) {
  259. intro_going_on_but_too_old = 1;
  260. continue;
  261. }
  262. if (!circuit_is_acceptable(origin_circ,conn,must_be_open,purpose,
  263. need_uptime,need_internal,now.tv_sec))
  264. continue;
  265. /* now this is an acceptable circ to hand back. but that doesn't
  266. * mean it's the *best* circ to hand back. try to decide.
  267. */
  268. if (!best || circuit_is_better(origin_circ,best,conn))
  269. best = origin_circ;
  270. }
  271. if (!best && intro_going_on_but_too_old)
  272. log_info(LD_REND|LD_CIRC, "There is an intro circuit being created "
  273. "right now, but it has already taken quite a while. Starting "
  274. "one in parallel.");
  275. return best;
  276. }
  277. /** Return the number of not-yet-open general-purpose origin circuits. */
  278. static int
  279. count_pending_general_client_circuits(void)
  280. {
  281. const circuit_t *circ;
  282. int count = 0;
  283. for (circ = global_circuitlist; circ; circ = circ->next) {
  284. if (circ->marked_for_close ||
  285. circ->state == CIRCUIT_STATE_OPEN ||
  286. circ->purpose != CIRCUIT_PURPOSE_C_GENERAL ||
  287. !CIRCUIT_IS_ORIGIN(circ))
  288. continue;
  289. ++count;
  290. }
  291. return count;
  292. }
  293. #if 0
  294. /** Check whether, according to the policies in <b>options</b>, the
  295. * circuit <b>circ</b> makes sense. */
  296. /* XXXX currently only checks Exclude{Exit}Nodes; it should check more.
  297. * Also, it doesn't have the right definition of an exit circuit. Also,
  298. * it's never called. */
  299. int
  300. circuit_conforms_to_options(const origin_circuit_t *circ,
  301. const or_options_t *options)
  302. {
  303. const crypt_path_t *cpath, *cpath_next = NULL;
  304. /* first check if it includes any excluded nodes */
  305. for (cpath = circ->cpath; cpath_next != circ->cpath; cpath = cpath_next) {
  306. cpath_next = cpath->next;
  307. if (routerset_contains_extendinfo(options->ExcludeNodes,
  308. cpath->extend_info))
  309. return 0;
  310. }
  311. /* then consider the final hop */
  312. if (routerset_contains_extendinfo(options->ExcludeExitNodes,
  313. circ->cpath->prev->extend_info))
  314. return 0;
  315. return 1;
  316. }
  317. #endif
  318. /** Close all circuits that start at us, aren't open, and were born
  319. * at least CircuitBuildTimeout seconds ago.
  320. */
  321. void
  322. circuit_expire_building(void)
  323. {
  324. circuit_t *victim, *next_circ = global_circuitlist;
  325. /* circ_times.timeout_ms and circ_times.close_ms are from
  326. * circuit_build_times_get_initial_timeout() if we haven't computed
  327. * custom timeouts yet */
  328. struct timeval general_cutoff, begindir_cutoff, fourhop_cutoff,
  329. close_cutoff, extremely_old_cutoff, hs_extremely_old_cutoff,
  330. cannibalized_cutoff, c_intro_cutoff, s_intro_cutoff, stream_cutoff;
  331. const or_options_t *options = get_options();
  332. struct timeval now;
  333. cpath_build_state_t *build_state;
  334. int any_opened_circs = 0;
  335. tor_gettimeofday(&now);
  336. /* Check to see if we have any opened circuits. If we don't,
  337. * we want to be more lenient with timeouts, in case the
  338. * user has relocated and/or changed network connections.
  339. * See bug #3443. */
  340. while (next_circ) {
  341. if (!CIRCUIT_IS_ORIGIN(next_circ) || /* didn't originate here */
  342. next_circ->marked_for_close) { /* don't mess with marked circs */
  343. next_circ = next_circ->next;
  344. continue;
  345. }
  346. if (TO_ORIGIN_CIRCUIT(next_circ)->has_opened &&
  347. next_circ->state == CIRCUIT_STATE_OPEN &&
  348. TO_ORIGIN_CIRCUIT(next_circ)->build_state &&
  349. TO_ORIGIN_CIRCUIT(next_circ)->build_state->desired_path_len
  350. == DEFAULT_ROUTE_LEN) {
  351. any_opened_circs = 1;
  352. break;
  353. }
  354. next_circ = next_circ->next;
  355. }
  356. next_circ = global_circuitlist;
  357. #define SET_CUTOFF(target, msec) do { \
  358. long ms = tor_lround(msec); \
  359. struct timeval diff; \
  360. diff.tv_sec = ms / 1000; \
  361. diff.tv_usec = (int)((ms % 1000) * 1000); \
  362. timersub(&now, &diff, &target); \
  363. } while (0)
  364. /**
  365. * OP --a--> A --b--> B --c--> C
  366. * OP --a--> A --b--> B --c--> C --d--> D
  367. *
  368. * Let h = a = b = c = d
  369. *
  370. * Three hops (general_cutoff)
  371. * RTTs = 3a + 2b + c
  372. * RTTs = 6h
  373. * Cannibalized:
  374. * RTTs = a+b+c+d
  375. * RTTs = 4h
  376. * Four hops:
  377. * RTTs = 4a + 3b + 2c + d
  378. * RTTs = 10h
  379. * Client INTRODUCE1+ACK: // XXX: correct?
  380. * RTTs = 5a + 4b + 3c + 2d
  381. * RTTs = 14h
  382. * Server intro:
  383. * RTTs = 4a + 3b + 2c
  384. * RTTs = 9h
  385. */
  386. SET_CUTOFF(general_cutoff, circ_times.timeout_ms);
  387. SET_CUTOFF(begindir_cutoff, circ_times.timeout_ms);
  388. /* > 3hop circs seem to have a 1.0 second delay on their cannibalized
  389. * 4th hop. */
  390. SET_CUTOFF(fourhop_cutoff, circ_times.timeout_ms * (10/6.0) + 1000);
  391. /* CIRCUIT_PURPOSE_C_ESTABLISH_REND behaves more like a RELAY cell.
  392. * Use the stream cutoff (more or less). */
  393. SET_CUTOFF(stream_cutoff, MAX(options->CircuitStreamTimeout,15)*1000 + 1000);
  394. /* Be lenient with cannibalized circs. They already survived the official
  395. * CBT, and they're usually not perf-critical. */
  396. SET_CUTOFF(cannibalized_cutoff,
  397. MAX(circ_times.close_ms*(4/6.0),
  398. options->CircuitStreamTimeout * 1000) + 1000);
  399. // Intro circs have an extra round trip (and are also 4 hops long)
  400. SET_CUTOFF(c_intro_cutoff, circ_times.timeout_ms * (14/6.0) + 1000);
  401. // Server intro circs have an extra round trip
  402. SET_CUTOFF(s_intro_cutoff, circ_times.timeout_ms * (9/6.0) + 1000);
  403. SET_CUTOFF(close_cutoff, circ_times.close_ms);
  404. SET_CUTOFF(extremely_old_cutoff, circ_times.close_ms*2 + 1000);
  405. SET_CUTOFF(hs_extremely_old_cutoff,
  406. MAX(circ_times.close_ms*2 + 1000,
  407. options->SocksTimeout * 1000));
  408. while (next_circ) {
  409. struct timeval cutoff;
  410. victim = next_circ;
  411. next_circ = next_circ->next;
  412. if (!CIRCUIT_IS_ORIGIN(victim) || /* didn't originate here */
  413. victim->marked_for_close) /* don't mess with marked circs */
  414. continue;
  415. /* If we haven't yet started the first hop, it means we don't have
  416. * any orconns available, and thus have not started counting time yet
  417. * for this circuit. See circuit_deliver_create_cell() and uses of
  418. * timestamp_began.
  419. *
  420. * Continue to wait in this case. The ORConn should timeout
  421. * independently and kill us then.
  422. */
  423. if (TO_ORIGIN_CIRCUIT(victim)->cpath->state == CPATH_STATE_CLOSED) {
  424. continue;
  425. }
  426. build_state = TO_ORIGIN_CIRCUIT(victim)->build_state;
  427. if (build_state && build_state->onehop_tunnel)
  428. cutoff = begindir_cutoff;
  429. else if (victim->purpose == CIRCUIT_PURPOSE_C_MEASURE_TIMEOUT)
  430. cutoff = close_cutoff;
  431. else if (victim->purpose == CIRCUIT_PURPOSE_C_INTRODUCING ||
  432. victim->purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT)
  433. cutoff = c_intro_cutoff;
  434. else if (victim->purpose == CIRCUIT_PURPOSE_S_ESTABLISH_INTRO)
  435. cutoff = s_intro_cutoff;
  436. else if (victim->purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND)
  437. cutoff = stream_cutoff;
  438. else if (victim->purpose == CIRCUIT_PURPOSE_PATH_BIAS_TESTING)
  439. cutoff = close_cutoff;
  440. else if (TO_ORIGIN_CIRCUIT(victim)->has_opened &&
  441. victim->state != CIRCUIT_STATE_OPEN)
  442. cutoff = cannibalized_cutoff;
  443. else if (build_state && build_state->desired_path_len >= 4)
  444. cutoff = fourhop_cutoff;
  445. else
  446. cutoff = general_cutoff;
  447. if (TO_ORIGIN_CIRCUIT(victim)->hs_circ_has_timed_out)
  448. cutoff = hs_extremely_old_cutoff;
  449. if (timercmp(&victim->timestamp_began, &cutoff, >))
  450. continue; /* it's still young, leave it alone */
  451. if (!any_opened_circs) {
  452. /* It's still young enough that we wouldn't close it, right? */
  453. if (timercmp(&victim->timestamp_began, &close_cutoff, >)) {
  454. if (!TO_ORIGIN_CIRCUIT(victim)->relaxed_timeout) {
  455. int first_hop_succeeded = TO_ORIGIN_CIRCUIT(victim)->cpath->state
  456. == CPATH_STATE_OPEN;
  457. log_info(LD_CIRC,
  458. "No circuits are opened. Relaxing timeout for "
  459. "a circuit with channel state %s. %d guards are live.",
  460. channel_state_to_string(victim->n_chan->state),
  461. num_live_entry_guards(0));
  462. /* We count the timeout here for CBT, because technically this
  463. * was a timeout, and the timeout value needs to reset if we
  464. * see enough of them. Note this means we also need to avoid
  465. * double-counting below, too. */
  466. circuit_build_times_count_timeout(&circ_times, first_hop_succeeded);
  467. TO_ORIGIN_CIRCUIT(victim)->relaxed_timeout = 1;
  468. }
  469. continue;
  470. } else {
  471. static ratelim_t relax_timeout_limit = RATELIM_INIT(3600);
  472. char *m;
  473. if ((m = rate_limit_log(&relax_timeout_limit, approx_time()))) {
  474. log_notice(LD_CIRC,
  475. "No circuits are opened. Relaxed timeout for "
  476. "a circuit with channel state %s to %ldms. "
  477. "However, it appears the circuit has timed out anyway. "
  478. "%d guards are live. %s",
  479. channel_state_to_string(victim->n_chan->state),
  480. (long)circ_times.close_ms, num_live_entry_guards(0), m);
  481. tor_free(m);
  482. }
  483. }
  484. }
  485. #if 0
  486. /* some debug logs, to help track bugs */
  487. if (victim->purpose >= CIRCUIT_PURPOSE_C_INTRODUCING &&
  488. victim->purpose <= CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED) {
  489. if (!victim->timestamp_dirty)
  490. log_fn(LOG_DEBUG,"Considering %sopen purpose %d to %s (circid %d)."
  491. "(clean).",
  492. victim->state == CIRCUIT_STATE_OPEN ? "" : "non",
  493. victim->purpose, victim->build_state->chosen_exit_name,
  494. victim->n_circ_id);
  495. else
  496. log_fn(LOG_DEBUG,"Considering %sopen purpose %d to %s (circid %d). "
  497. "%d secs since dirty.",
  498. victim->state == CIRCUIT_STATE_OPEN ? "" : "non",
  499. victim->purpose, victim->build_state->chosen_exit_name,
  500. victim->n_circ_id,
  501. (int)(now - victim->timestamp_dirty));
  502. }
  503. #endif
  504. /* if circ is !open, or if it's open but purpose is a non-finished
  505. * intro or rend, then mark it for close */
  506. if (victim->state == CIRCUIT_STATE_OPEN) {
  507. switch (victim->purpose) {
  508. default: /* most open circuits can be left alone. */
  509. continue; /* yes, continue inside a switch refers to the nearest
  510. * enclosing loop. C is smart. */
  511. case CIRCUIT_PURPOSE_S_ESTABLISH_INTRO:
  512. break; /* too old, need to die */
  513. case CIRCUIT_PURPOSE_C_REND_READY:
  514. /* it's a rend_ready circ -- has it already picked a query? */
  515. /* c_rend_ready circs measure age since timestamp_dirty,
  516. * because that's set when they switch purposes
  517. */
  518. if (TO_ORIGIN_CIRCUIT(victim)->rend_data ||
  519. victim->timestamp_dirty > cutoff.tv_sec)
  520. continue;
  521. break;
  522. case CIRCUIT_PURPOSE_PATH_BIAS_TESTING:
  523. /* Open path bias testing circuits are given a long
  524. * time to complete the test, but not forever */
  525. TO_ORIGIN_CIRCUIT(victim)->path_state = PATH_STATE_USE_FAILED;
  526. break;
  527. case CIRCUIT_PURPOSE_C_INTRODUCING:
  528. /* We keep old introducing circuits around for
  529. * a while in parallel, and they can end up "opened".
  530. * We decide below if we're going to mark them timed
  531. * out and eventually close them.
  532. */
  533. break;
  534. case CIRCUIT_PURPOSE_C_ESTABLISH_REND:
  535. case CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED:
  536. case CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT:
  537. /* rend and intro circs become dirty each time they
  538. * make an introduction attempt. so timestamp_dirty
  539. * will reflect the time since the last attempt.
  540. */
  541. if (victim->timestamp_dirty > cutoff.tv_sec)
  542. continue;
  543. break;
  544. }
  545. } else { /* circuit not open, consider recording failure as timeout */
  546. int first_hop_succeeded = TO_ORIGIN_CIRCUIT(victim)->cpath &&
  547. TO_ORIGIN_CIRCUIT(victim)->cpath->state == CPATH_STATE_OPEN;
  548. if (TO_ORIGIN_CIRCUIT(victim)->p_streams != NULL) {
  549. log_warn(LD_BUG, "Circuit %d (purpose %d, %s) has timed out, "
  550. "yet has attached streams!",
  551. TO_ORIGIN_CIRCUIT(victim)->global_identifier,
  552. victim->purpose,
  553. circuit_purpose_to_string(victim->purpose));
  554. tor_fragile_assert();
  555. continue;
  556. }
  557. if (circuit_timeout_want_to_count_circ(TO_ORIGIN_CIRCUIT(victim)) &&
  558. circuit_build_times_enough_to_compute(&circ_times)) {
  559. /* Circuits are allowed to last longer for measurement.
  560. * Switch their purpose and wait. */
  561. if (victim->purpose != CIRCUIT_PURPOSE_C_MEASURE_TIMEOUT) {
  562. control_event_circuit_status(TO_ORIGIN_CIRCUIT(victim),
  563. CIRC_EVENT_FAILED,
  564. END_CIRC_REASON_TIMEOUT);
  565. circuit_change_purpose(victim, CIRCUIT_PURPOSE_C_MEASURE_TIMEOUT);
  566. /* Record this failure to check for too many timeouts
  567. * in a row. This function does not record a time value yet
  568. * (we do that later); it only counts the fact that we did
  569. * have a timeout. We also want to avoid double-counting
  570. * already "relaxed" circuits, which are counted above. */
  571. if (!TO_ORIGIN_CIRCUIT(victim)->relaxed_timeout) {
  572. circuit_build_times_count_timeout(&circ_times,
  573. first_hop_succeeded);
  574. }
  575. continue;
  576. }
  577. /*
  578. * If the circuit build time is much greater than we would have cut
  579. * it off at, we probably had a suspend event along this codepath,
  580. * and we should discard the value.
  581. */
  582. if (timercmp(&victim->timestamp_began, &extremely_old_cutoff, <)) {
  583. log_notice(LD_CIRC,
  584. "Extremely large value for circuit build timeout: %lds. "
  585. "Assuming clock jump. Purpose %d (%s)",
  586. (long)(now.tv_sec - victim->timestamp_began.tv_sec),
  587. victim->purpose,
  588. circuit_purpose_to_string(victim->purpose));
  589. } else if (circuit_build_times_count_close(&circ_times,
  590. first_hop_succeeded,
  591. victim->timestamp_began.tv_sec)) {
  592. circuit_build_times_set_timeout(&circ_times);
  593. }
  594. }
  595. if (TO_ORIGIN_CIRCUIT(victim)->has_opened &&
  596. victim->purpose != CIRCUIT_PURPOSE_PATH_BIAS_TESTING) {
  597. /* For path bias: we want to let these guys live for a while
  598. * so we get a chance to test them. */
  599. log_info(LD_CIRC,
  600. "Allowing cannibalized circuit %d time to finish building as a "
  601. "pathbias testing circ.",
  602. TO_ORIGIN_CIRCUIT(victim)->global_identifier);
  603. circuit_change_purpose(victim, CIRCUIT_PURPOSE_PATH_BIAS_TESTING);
  604. continue; /* It now should have a longer timeout next time */
  605. }
  606. }
  607. /* If this is a hidden service client circuit which is far enough
  608. * along in connecting to its destination, and we haven't already
  609. * flagged it as 'timed out', and the user has not told us to
  610. * close such circs immediately on timeout, flag it as 'timed out'
  611. * so we'll launch another intro or rend circ, but don't mark it
  612. * for close yet.
  613. *
  614. * (Circs flagged as 'timed out' are given a much longer timeout
  615. * period above, so we won't close them in the next call to
  616. * circuit_expire_building.) */
  617. if (!(options->CloseHSClientCircuitsImmediatelyOnTimeout) &&
  618. !(TO_ORIGIN_CIRCUIT(victim)->hs_circ_has_timed_out)) {
  619. switch (victim->purpose) {
  620. case CIRCUIT_PURPOSE_C_REND_READY:
  621. /* We only want to spare a rend circ if it has been specified in
  622. * an INTRODUCE1 cell sent to a hidden service. A circ's
  623. * pending_final_cpath field is non-NULL iff it is a rend circ
  624. * and we have tried to send an INTRODUCE1 cell specifying it.
  625. * Thus, if the pending_final_cpath field *is* NULL, then we
  626. * want to not spare it. */
  627. if (TO_ORIGIN_CIRCUIT(victim)->build_state->pending_final_cpath ==
  628. NULL)
  629. break;
  630. /* fallthrough! */
  631. case CIRCUIT_PURPOSE_C_INTRODUCING:
  632. /* connection_ap_handshake_attach_circuit() will relaunch for us */
  633. case CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT:
  634. case CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED:
  635. /* If we have reached this line, we want to spare the circ for now. */
  636. log_info(LD_CIRC,"Marking circ %d (state %d:%s, purpose %d) "
  637. "as timed-out HS circ",
  638. victim->n_circ_id,
  639. victim->state, circuit_state_to_string(victim->state),
  640. victim->purpose);
  641. TO_ORIGIN_CIRCUIT(victim)->hs_circ_has_timed_out = 1;
  642. continue;
  643. default:
  644. break;
  645. }
  646. }
  647. /* If this is a service-side rendezvous circuit which is far
  648. * enough along in connecting to its destination, consider sparing
  649. * it. */
  650. if (!(options->CloseHSServiceRendCircuitsImmediatelyOnTimeout) &&
  651. !(TO_ORIGIN_CIRCUIT(victim)->hs_circ_has_timed_out) &&
  652. victim->purpose == CIRCUIT_PURPOSE_S_CONNECT_REND) {
  653. log_info(LD_CIRC,"Marking circ %d (state %d:%s, purpose %d) "
  654. "as timed-out HS circ; relaunching rendezvous attempt.",
  655. victim->n_circ_id,
  656. victim->state, circuit_state_to_string(victim->state),
  657. victim->purpose);
  658. TO_ORIGIN_CIRCUIT(victim)->hs_circ_has_timed_out = 1;
  659. rend_service_relaunch_rendezvous(TO_ORIGIN_CIRCUIT(victim));
  660. continue;
  661. }
  662. if (victim->n_chan)
  663. log_info(LD_CIRC,
  664. "Abandoning circ %u %s:%hd (state %d,%d:%s, purpose %hhd, "
  665. "len %d)", TO_ORIGIN_CIRCUIT(victim)->global_identifier,
  666. channel_get_canonical_remote_descr(victim->n_chan),
  667. victim->n_circ_id,
  668. TO_ORIGIN_CIRCUIT(victim)->has_opened,
  669. victim->state, circuit_state_to_string(victim->state),
  670. victim->purpose,
  671. TO_ORIGIN_CIRCUIT(victim)->build_state->desired_path_len);
  672. else
  673. log_info(LD_CIRC,
  674. "Abandoning circ %u %hd (state %d,%d:%s, purpose %hhd, len %d)",
  675. TO_ORIGIN_CIRCUIT(victim)->global_identifier,
  676. victim->n_circ_id, TO_ORIGIN_CIRCUIT(victim)->has_opened,
  677. victim->state,
  678. circuit_state_to_string(victim->state), victim->purpose,
  679. TO_ORIGIN_CIRCUIT(victim)->build_state->desired_path_len);
  680. circuit_log_path(LOG_INFO,LD_CIRC,TO_ORIGIN_CIRCUIT(victim));
  681. if (victim->purpose == CIRCUIT_PURPOSE_C_MEASURE_TIMEOUT)
  682. circuit_mark_for_close(victim, END_CIRC_REASON_MEASUREMENT_EXPIRED);
  683. else
  684. circuit_mark_for_close(victim, END_CIRC_REASON_TIMEOUT);
  685. pathbias_count_timeout(TO_ORIGIN_CIRCUIT(victim));
  686. }
  687. }
  688. /** Remove any elements in <b>needed_ports</b> that are handled by an
  689. * open or in-progress circuit.
  690. */
  691. void
  692. circuit_remove_handled_ports(smartlist_t *needed_ports)
  693. {
  694. int i;
  695. uint16_t *port;
  696. for (i = 0; i < smartlist_len(needed_ports); ++i) {
  697. port = smartlist_get(needed_ports, i);
  698. tor_assert(*port);
  699. if (circuit_stream_is_being_handled(NULL, *port,
  700. MIN_CIRCUITS_HANDLING_STREAM)) {
  701. // log_debug(LD_CIRC,"Port %d is already being handled; removing.", port);
  702. smartlist_del(needed_ports, i--);
  703. tor_free(port);
  704. } else {
  705. log_debug(LD_CIRC,"Port %d is not handled.", *port);
  706. }
  707. }
  708. }
  709. /** Return 1 if at least <b>min</b> general-purpose non-internal circuits
  710. * will have an acceptable exit node for exit stream <b>conn</b> if it
  711. * is defined, else for "*:port".
  712. * Else return 0.
  713. */
  714. int
  715. circuit_stream_is_being_handled(entry_connection_t *conn,
  716. uint16_t port, int min)
  717. {
  718. circuit_t *circ;
  719. const node_t *exitnode;
  720. int num=0;
  721. time_t now = time(NULL);
  722. int need_uptime = smartlist_string_num_isin(get_options()->LongLivedPorts,
  723. conn ? conn->socks_request->port : port);
  724. for (circ=global_circuitlist;circ;circ = circ->next) {
  725. if (CIRCUIT_IS_ORIGIN(circ) &&
  726. !circ->marked_for_close &&
  727. circ->purpose == CIRCUIT_PURPOSE_C_GENERAL &&
  728. (!circ->timestamp_dirty ||
  729. circ->timestamp_dirty + get_options()->MaxCircuitDirtiness > now)) {
  730. cpath_build_state_t *build_state = TO_ORIGIN_CIRCUIT(circ)->build_state;
  731. if (build_state->is_internal || build_state->onehop_tunnel)
  732. continue;
  733. exitnode = build_state_get_exit_node(build_state);
  734. if (exitnode && (!need_uptime || build_state->need_uptime)) {
  735. int ok;
  736. if (conn) {
  737. ok = connection_ap_can_use_exit(conn, exitnode);
  738. } else {
  739. addr_policy_result_t r;
  740. r = compare_tor_addr_to_node_policy(NULL, port, exitnode);
  741. ok = r != ADDR_POLICY_REJECTED && r != ADDR_POLICY_PROBABLY_REJECTED;
  742. }
  743. if (ok) {
  744. if (++num >= min)
  745. return 1;
  746. }
  747. }
  748. }
  749. }
  750. return 0;
  751. }
  752. /** Don't keep more than this many unused open circuits around. */
  753. #define MAX_UNUSED_OPEN_CIRCUITS 14
  754. /** Figure out how many circuits we have open that are clean. Make
  755. * sure it's enough for all the upcoming behaviors we predict we'll have.
  756. * But put an upper bound on the total number of circuits.
  757. */
  758. static void
  759. circuit_predict_and_launch_new(void)
  760. {
  761. circuit_t *circ;
  762. int num=0, num_internal=0, num_uptime_internal=0;
  763. int hidserv_needs_uptime=0, hidserv_needs_capacity=1;
  764. int port_needs_uptime=0, port_needs_capacity=1;
  765. time_t now = time(NULL);
  766. int flags = 0;
  767. /* First, count how many of each type of circuit we have already. */
  768. for (circ=global_circuitlist;circ;circ = circ->next) {
  769. cpath_build_state_t *build_state;
  770. if (!CIRCUIT_IS_ORIGIN(circ))
  771. continue;
  772. if (circ->marked_for_close)
  773. continue; /* don't mess with marked circs */
  774. if (circ->timestamp_dirty)
  775. continue; /* only count clean circs */
  776. if (circ->purpose != CIRCUIT_PURPOSE_C_GENERAL)
  777. continue; /* only pay attention to general-purpose circs */
  778. build_state = TO_ORIGIN_CIRCUIT(circ)->build_state;
  779. if (build_state->onehop_tunnel)
  780. continue;
  781. num++;
  782. if (build_state->is_internal)
  783. num_internal++;
  784. if (build_state->need_uptime && build_state->is_internal)
  785. num_uptime_internal++;
  786. }
  787. /* If that's enough, then stop now. */
  788. if (num >= MAX_UNUSED_OPEN_CIRCUITS)
  789. return; /* we already have many, making more probably will hurt */
  790. /* Second, see if we need any more exit circuits. */
  791. /* check if we know of a port that's been requested recently
  792. * and no circuit is currently available that can handle it. */
  793. if (!circuit_all_predicted_ports_handled(now, &port_needs_uptime,
  794. &port_needs_capacity)) {
  795. if (port_needs_uptime)
  796. flags |= CIRCLAUNCH_NEED_UPTIME;
  797. if (port_needs_capacity)
  798. flags |= CIRCLAUNCH_NEED_CAPACITY;
  799. log_info(LD_CIRC,
  800. "Have %d clean circs (%d internal), need another exit circ.",
  801. num, num_internal);
  802. circuit_launch(CIRCUIT_PURPOSE_C_GENERAL, flags);
  803. return;
  804. }
  805. /* Third, see if we need any more hidden service (server) circuits. */
  806. if (num_rend_services() && num_uptime_internal < 3) {
  807. flags = (CIRCLAUNCH_NEED_CAPACITY | CIRCLAUNCH_NEED_UPTIME |
  808. CIRCLAUNCH_IS_INTERNAL);
  809. log_info(LD_CIRC,
  810. "Have %d clean circs (%d internal), need another internal "
  811. "circ for my hidden service.",
  812. num, num_internal);
  813. circuit_launch(CIRCUIT_PURPOSE_C_GENERAL, flags);
  814. return;
  815. }
  816. /* Fourth, see if we need any more hidden service (client) circuits. */
  817. if (rep_hist_get_predicted_internal(now, &hidserv_needs_uptime,
  818. &hidserv_needs_capacity) &&
  819. ((num_uptime_internal<2 && hidserv_needs_uptime) ||
  820. num_internal<2)) {
  821. if (hidserv_needs_uptime)
  822. flags |= CIRCLAUNCH_NEED_UPTIME;
  823. if (hidserv_needs_capacity)
  824. flags |= CIRCLAUNCH_NEED_CAPACITY;
  825. flags |= CIRCLAUNCH_IS_INTERNAL;
  826. log_info(LD_CIRC,
  827. "Have %d clean circs (%d uptime-internal, %d internal), need"
  828. " another hidden service circ.",
  829. num, num_uptime_internal, num_internal);
  830. circuit_launch(CIRCUIT_PURPOSE_C_GENERAL, flags);
  831. return;
  832. }
  833. /* Finally, check to see if we still need more circuits to learn
  834. * a good build timeout. But if we're close to our max number we
  835. * want, don't do another -- we want to leave a few slots open so
  836. * we can still build circuits preemptively as needed. */
  837. if (num < MAX_UNUSED_OPEN_CIRCUITS-2 &&
  838. get_options()->LearnCircuitBuildTimeout &&
  839. circuit_build_times_needs_circuits_now(&circ_times)) {
  840. flags = CIRCLAUNCH_NEED_CAPACITY;
  841. log_info(LD_CIRC,
  842. "Have %d clean circs need another buildtime test circ.", num);
  843. circuit_launch(CIRCUIT_PURPOSE_C_GENERAL, flags);
  844. return;
  845. }
  846. }
  847. /** Build a new test circuit every 5 minutes */
  848. #define TESTING_CIRCUIT_INTERVAL 300
  849. /** This function is called once a second, if router_have_min_dir_info() is
  850. * true. Its job is to make sure all services we offer have enough circuits
  851. * available. Some services just want enough circuits for current tasks,
  852. * whereas others want a minimum set of idle circuits hanging around.
  853. */
  854. void
  855. circuit_build_needed_circs(time_t now)
  856. {
  857. static time_t time_to_new_circuit = 0;
  858. const or_options_t *options = get_options();
  859. /* launch a new circ for any pending streams that need one */
  860. connection_ap_attach_pending();
  861. /* make sure any hidden services have enough intro points */
  862. rend_services_introduce();
  863. if (time_to_new_circuit < now) {
  864. circuit_reset_failure_count(1);
  865. time_to_new_circuit = now + options->NewCircuitPeriod;
  866. if (proxy_mode(get_options()))
  867. addressmap_clean(now);
  868. circuit_expire_old_circuits_clientside();
  869. #if 0 /* disable for now, until predict-and-launch-new can cull leftovers */
  870. circ = circuit_get_youngest_clean_open(CIRCUIT_PURPOSE_C_GENERAL);
  871. if (get_options()->RunTesting &&
  872. circ &&
  873. circ->timestamp_began.tv_sec + TESTING_CIRCUIT_INTERVAL < now) {
  874. log_fn(LOG_INFO,"Creating a new testing circuit.");
  875. circuit_launch(CIRCUIT_PURPOSE_C_GENERAL, 0);
  876. }
  877. #endif
  878. }
  879. if (!options->DisablePredictedCircuits)
  880. circuit_predict_and_launch_new();
  881. }
  882. /** If the stream <b>conn</b> is a member of any of the linked
  883. * lists of <b>circ</b>, then remove it from the list.
  884. */
  885. void
  886. circuit_detach_stream(circuit_t *circ, edge_connection_t *conn)
  887. {
  888. edge_connection_t *prevconn;
  889. tor_assert(circ);
  890. tor_assert(conn);
  891. if (conn->base_.type == CONN_TYPE_AP) {
  892. entry_connection_t *entry_conn = EDGE_TO_ENTRY_CONN(conn);
  893. entry_conn->may_use_optimistic_data = 0;
  894. }
  895. conn->cpath_layer = NULL; /* don't keep a stale pointer */
  896. conn->on_circuit = NULL;
  897. if (CIRCUIT_IS_ORIGIN(circ)) {
  898. origin_circuit_t *origin_circ = TO_ORIGIN_CIRCUIT(circ);
  899. if (conn == origin_circ->p_streams) {
  900. origin_circ->p_streams = conn->next_stream;
  901. return;
  902. }
  903. for (prevconn = origin_circ->p_streams;
  904. prevconn && prevconn->next_stream && prevconn->next_stream != conn;
  905. prevconn = prevconn->next_stream)
  906. ;
  907. if (prevconn && prevconn->next_stream) {
  908. prevconn->next_stream = conn->next_stream;
  909. return;
  910. }
  911. } else {
  912. or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
  913. if (conn == or_circ->n_streams) {
  914. or_circ->n_streams = conn->next_stream;
  915. return;
  916. }
  917. if (conn == or_circ->resolving_streams) {
  918. or_circ->resolving_streams = conn->next_stream;
  919. return;
  920. }
  921. for (prevconn = or_circ->n_streams;
  922. prevconn && prevconn->next_stream && prevconn->next_stream != conn;
  923. prevconn = prevconn->next_stream)
  924. ;
  925. if (prevconn && prevconn->next_stream) {
  926. prevconn->next_stream = conn->next_stream;
  927. return;
  928. }
  929. for (prevconn = or_circ->resolving_streams;
  930. prevconn && prevconn->next_stream && prevconn->next_stream != conn;
  931. prevconn = prevconn->next_stream)
  932. ;
  933. if (prevconn && prevconn->next_stream) {
  934. prevconn->next_stream = conn->next_stream;
  935. return;
  936. }
  937. }
  938. log_warn(LD_BUG,"Edge connection not in circuit's list.");
  939. /* Don't give an error here; it's harmless. */
  940. tor_fragile_assert();
  941. }
  942. /** If we haven't yet decided on a good timeout value for circuit
  943. * building, we close idles circuits aggressively so we can get more
  944. * data points. */
  945. #define IDLE_TIMEOUT_WHILE_LEARNING (10*60)
  946. /** Find each circuit that has been unused for too long, or dirty
  947. * for too long and has no streams on it: mark it for close.
  948. */
  949. static void
  950. circuit_expire_old_circuits_clientside(void)
  951. {
  952. circuit_t *circ;
  953. struct timeval cutoff, now;
  954. tor_gettimeofday(&now);
  955. cutoff = now;
  956. if (get_options()->LearnCircuitBuildTimeout &&
  957. circuit_build_times_needs_circuits(&circ_times)) {
  958. /* Circuits should be shorter lived if we need more of them
  959. * for learning a good build timeout */
  960. cutoff.tv_sec -= IDLE_TIMEOUT_WHILE_LEARNING;
  961. } else {
  962. cutoff.tv_sec -= get_options()->CircuitIdleTimeout;
  963. }
  964. for (circ = global_circuitlist; circ; circ = circ->next) {
  965. if (circ->marked_for_close || !CIRCUIT_IS_ORIGIN(circ))
  966. continue;
  967. /* If the circuit has been dirty for too long, and there are no streams
  968. * on it, mark it for close.
  969. */
  970. if (circ->timestamp_dirty &&
  971. circ->timestamp_dirty + get_options()->MaxCircuitDirtiness <
  972. now.tv_sec &&
  973. !TO_ORIGIN_CIRCUIT(circ)->p_streams /* nothing attached */ ) {
  974. log_debug(LD_CIRC, "Closing n_circ_id %d (dirty %ld sec ago, "
  975. "purpose %d)",
  976. circ->n_circ_id, (long)(now.tv_sec - circ->timestamp_dirty),
  977. circ->purpose);
  978. circuit_mark_for_close(circ, END_CIRC_REASON_FINISHED);
  979. } else if (!circ->timestamp_dirty && circ->state == CIRCUIT_STATE_OPEN) {
  980. if (timercmp(&circ->timestamp_began, &cutoff, <)) {
  981. if (circ->purpose == CIRCUIT_PURPOSE_C_GENERAL ||
  982. circ->purpose == CIRCUIT_PURPOSE_C_MEASURE_TIMEOUT ||
  983. circ->purpose == CIRCUIT_PURPOSE_S_ESTABLISH_INTRO ||
  984. circ->purpose == CIRCUIT_PURPOSE_TESTING ||
  985. (circ->purpose >= CIRCUIT_PURPOSE_C_INTRODUCING &&
  986. circ->purpose <= CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED) ||
  987. circ->purpose == CIRCUIT_PURPOSE_S_CONNECT_REND) {
  988. log_debug(LD_CIRC,
  989. "Closing circuit that has been unused for %ld msec.",
  990. tv_mdiff(&circ->timestamp_began, &now));
  991. circuit_mark_for_close(circ, END_CIRC_REASON_FINISHED);
  992. } else if (!TO_ORIGIN_CIRCUIT(circ)->is_ancient) {
  993. /* Server-side rend joined circuits can end up really old, because
  994. * they are reused by clients for longer than normal. The client
  995. * controls their lifespan. (They never become dirty, because
  996. * connection_exit_begin_conn() never marks anything as dirty.)
  997. * Similarly, server-side intro circuits last a long time. */
  998. if (circ->purpose != CIRCUIT_PURPOSE_S_REND_JOINED &&
  999. circ->purpose != CIRCUIT_PURPOSE_S_INTRO) {
  1000. log_notice(LD_CIRC,
  1001. "Ancient non-dirty circuit %d is still around after "
  1002. "%ld milliseconds. Purpose: %d (%s)",
  1003. TO_ORIGIN_CIRCUIT(circ)->global_identifier,
  1004. tv_mdiff(&circ->timestamp_began, &now),
  1005. circ->purpose,
  1006. circuit_purpose_to_string(circ->purpose));
  1007. TO_ORIGIN_CIRCUIT(circ)->is_ancient = 1;
  1008. }
  1009. }
  1010. }
  1011. }
  1012. }
  1013. }
  1014. /** How long do we wait before killing circuits with the properties
  1015. * described below?
  1016. *
  1017. * Probably we could choose a number here as low as 5 to 10 seconds,
  1018. * since these circs are used for begindir, and a) generally you either
  1019. * ask another begindir question right after or you don't for a long time,
  1020. * b) clients at least through 0.2.1.x choose from the whole set of
  1021. * directory mirrors at each choice, and c) re-establishing a one-hop
  1022. * circuit via create-fast is a light operation assuming the TLS conn is
  1023. * still there.
  1024. *
  1025. * I expect "b" to go away one day when we move to using directory
  1026. * guards, but I think "a" and "c" are good enough reasons that a low
  1027. * number is safe even then.
  1028. */
  1029. #define IDLE_ONE_HOP_CIRC_TIMEOUT 60
  1030. /** Find each non-origin circuit that has been unused for too long,
  1031. * has no streams on it, used a create_fast, and ends here: mark it
  1032. * for close.
  1033. */
  1034. void
  1035. circuit_expire_old_circuits_serverside(time_t now)
  1036. {
  1037. circuit_t *circ;
  1038. or_circuit_t *or_circ;
  1039. time_t cutoff = now - IDLE_ONE_HOP_CIRC_TIMEOUT;
  1040. for (circ = global_circuitlist; circ; circ = circ->next) {
  1041. if (circ->marked_for_close || CIRCUIT_IS_ORIGIN(circ))
  1042. continue;
  1043. or_circ = TO_OR_CIRCUIT(circ);
  1044. /* If the circuit has been idle for too long, and there are no streams
  1045. * on it, and it ends here, and it used a create_fast, mark it for close.
  1046. */
  1047. if (or_circ->is_first_hop && !circ->n_chan &&
  1048. !or_circ->n_streams && !or_circ->resolving_streams &&
  1049. or_circ->p_chan &&
  1050. channel_when_last_xmit(or_circ->p_chan) <= cutoff) {
  1051. log_info(LD_CIRC, "Closing circ_id %d (empty %d secs ago)",
  1052. or_circ->p_circ_id,
  1053. (int)(now - channel_when_last_xmit(or_circ->p_chan)));
  1054. circuit_mark_for_close(circ, END_CIRC_REASON_FINISHED);
  1055. }
  1056. }
  1057. }
  1058. /** Number of testing circuits we want open before testing our bandwidth. */
  1059. #define NUM_PARALLEL_TESTING_CIRCS 4
  1060. /** True iff we've ever had enough testing circuits open to test our
  1061. * bandwidth. */
  1062. static int have_performed_bandwidth_test = 0;
  1063. /** Reset have_performed_bandwidth_test, so we'll start building
  1064. * testing circuits again so we can exercise our bandwidth. */
  1065. void
  1066. reset_bandwidth_test(void)
  1067. {
  1068. have_performed_bandwidth_test = 0;
  1069. }
  1070. /** Return 1 if we've already exercised our bandwidth, or if we
  1071. * have fewer than NUM_PARALLEL_TESTING_CIRCS testing circuits
  1072. * established or on the way. Else return 0.
  1073. */
  1074. int
  1075. circuit_enough_testing_circs(void)
  1076. {
  1077. circuit_t *circ;
  1078. int num = 0;
  1079. if (have_performed_bandwidth_test)
  1080. return 1;
  1081. for (circ = global_circuitlist; circ; circ = circ->next) {
  1082. if (!circ->marked_for_close && CIRCUIT_IS_ORIGIN(circ) &&
  1083. circ->purpose == CIRCUIT_PURPOSE_TESTING &&
  1084. circ->state == CIRCUIT_STATE_OPEN)
  1085. num++;
  1086. }
  1087. return num >= NUM_PARALLEL_TESTING_CIRCS;
  1088. }
  1089. /** A testing circuit has completed. Take whatever stats we want.
  1090. * Noticing reachability is taken care of in onionskin_answer(),
  1091. * so there's no need to record anything here. But if we still want
  1092. * to do the bandwidth test, and we now have enough testing circuits
  1093. * open, do it.
  1094. */
  1095. static void
  1096. circuit_testing_opened(origin_circuit_t *circ)
  1097. {
  1098. if (have_performed_bandwidth_test ||
  1099. !check_whether_orport_reachable()) {
  1100. /* either we've already done everything we want with testing circuits,
  1101. * or this testing circuit became open due to a fluke, e.g. we picked
  1102. * a last hop where we already had the connection open due to an
  1103. * outgoing local circuit. */
  1104. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_AT_ORIGIN);
  1105. } else if (circuit_enough_testing_circs()) {
  1106. router_perform_bandwidth_test(NUM_PARALLEL_TESTING_CIRCS, time(NULL));
  1107. have_performed_bandwidth_test = 1;
  1108. } else
  1109. consider_testing_reachability(1, 0);
  1110. }
  1111. /** A testing circuit has failed to build. Take whatever stats we want. */
  1112. static void
  1113. circuit_testing_failed(origin_circuit_t *circ, int at_last_hop)
  1114. {
  1115. if (server_mode(get_options()) && check_whether_orport_reachable())
  1116. return;
  1117. log_info(LD_GENERAL,
  1118. "Our testing circuit (to see if your ORPort is reachable) "
  1119. "has failed. I'll try again later.");
  1120. /* These aren't used yet. */
  1121. (void)circ;
  1122. (void)at_last_hop;
  1123. }
  1124. /** The circuit <b>circ</b> has just become open. Take the next
  1125. * step: for rendezvous circuits, we pass circ to the appropriate
  1126. * function in rendclient or rendservice. For general circuits, we
  1127. * call connection_ap_attach_pending, which looks for pending streams
  1128. * that could use circ.
  1129. */
  1130. void
  1131. circuit_has_opened(origin_circuit_t *circ)
  1132. {
  1133. control_event_circuit_status(circ, CIRC_EVENT_BUILT, 0);
  1134. /* Remember that this circuit has finished building. Now if we start
  1135. * it building again later (e.g. by extending it), we will know not
  1136. * to consider its build time. */
  1137. circ->has_opened = 1;
  1138. switch (TO_CIRCUIT(circ)->purpose) {
  1139. case CIRCUIT_PURPOSE_C_ESTABLISH_REND:
  1140. rend_client_rendcirc_has_opened(circ);
  1141. /* Start building an intro circ if we don't have one yet. */
  1142. connection_ap_attach_pending();
  1143. /* This isn't a call to circuit_try_attaching_streams because a
  1144. * circuit in _C_ESTABLISH_REND state isn't connected to its
  1145. * hidden service yet, thus we can't attach streams to it yet,
  1146. * thus circuit_try_attaching_streams would always clear the
  1147. * circuit's isolation state. circuit_try_attaching_streams is
  1148. * called later, when the rend circ enters _C_REND_JOINED
  1149. * state. */
  1150. break;
  1151. case CIRCUIT_PURPOSE_C_INTRODUCING:
  1152. rend_client_introcirc_has_opened(circ);
  1153. break;
  1154. case CIRCUIT_PURPOSE_C_GENERAL:
  1155. /* Tell any AP connections that have been waiting for a new
  1156. * circuit that one is ready. */
  1157. circuit_try_attaching_streams(circ);
  1158. break;
  1159. case CIRCUIT_PURPOSE_S_ESTABLISH_INTRO:
  1160. /* at Bob, waiting for introductions */
  1161. rend_service_intro_has_opened(circ);
  1162. break;
  1163. case CIRCUIT_PURPOSE_S_CONNECT_REND:
  1164. /* at Bob, connecting to rend point */
  1165. rend_service_rendezvous_has_opened(circ);
  1166. break;
  1167. case CIRCUIT_PURPOSE_TESTING:
  1168. circuit_testing_opened(circ);
  1169. break;
  1170. /* default:
  1171. * This won't happen in normal operation, but might happen if the
  1172. * controller did it. Just let it slide. */
  1173. }
  1174. }
  1175. /** If the stream-isolation state of <b>circ</b> can be cleared, clear
  1176. * it. Return non-zero iff <b>circ</b>'s isolation state was cleared. */
  1177. static int
  1178. circuit_try_clearing_isolation_state(origin_circuit_t *circ)
  1179. {
  1180. if (/* The circuit may have become non-open if it was cannibalized.*/
  1181. circ->base_.state == CIRCUIT_STATE_OPEN &&
  1182. /* If !isolation_values_set, there is nothing to clear. */
  1183. circ->isolation_values_set &&
  1184. /* It's not legal to clear a circuit's isolation info if it's ever had
  1185. * streams attached */
  1186. !circ->isolation_any_streams_attached) {
  1187. /* If we have any isolation information set on this circuit, and
  1188. * we didn't manage to attach any streams to it, then we can
  1189. * and should clear it and try again. */
  1190. circuit_clear_isolation(circ);
  1191. return 1;
  1192. } else {
  1193. return 0;
  1194. }
  1195. }
  1196. /** Called when a circuit becomes ready for streams to be attached to
  1197. * it. */
  1198. void
  1199. circuit_try_attaching_streams(origin_circuit_t *circ)
  1200. {
  1201. /* Attach streams to this circuit if we can. */
  1202. connection_ap_attach_pending();
  1203. /* The call to circuit_try_clearing_isolation_state here will do
  1204. * nothing and return 0 if we didn't attach any streams to circ
  1205. * above. */
  1206. if (circuit_try_clearing_isolation_state(circ)) {
  1207. /* Maybe *now* we can attach some streams to this circuit. */
  1208. connection_ap_attach_pending();
  1209. }
  1210. }
  1211. /** Called whenever a circuit could not be successfully built.
  1212. */
  1213. void
  1214. circuit_build_failed(origin_circuit_t *circ)
  1215. {
  1216. channel_t *n_chan = NULL;
  1217. /* we should examine circ and see if it failed because of
  1218. * the last hop or an earlier hop. then use this info below.
  1219. */
  1220. int failed_at_last_hop = 0;
  1221. /* If the last hop isn't open, and the second-to-last is, we failed
  1222. * at the last hop. */
  1223. if (circ->cpath &&
  1224. circ->cpath->prev->state != CPATH_STATE_OPEN &&
  1225. circ->cpath->prev->prev->state == CPATH_STATE_OPEN) {
  1226. failed_at_last_hop = 1;
  1227. }
  1228. if (circ->cpath &&
  1229. circ->cpath->state != CPATH_STATE_OPEN) {
  1230. /* We failed at the first hop. If there's an OR connection
  1231. * to blame, blame it. Also, avoid this relay for a while, and
  1232. * fail any one-hop directory fetches destined for it. */
  1233. const char *n_chan_id = circ->cpath->extend_info->identity_digest;
  1234. int already_marked = 0;
  1235. if (circ->base_.n_chan) {
  1236. n_chan = circ->base_.n_chan;
  1237. if (n_chan->is_bad_for_new_circs) {
  1238. /* We only want to blame this router when a fresh healthy
  1239. * connection fails. So don't mark this router as newly failed,
  1240. * since maybe this was just an old circuit attempt that's
  1241. * finally timing out now. Also, there's no need to blow away
  1242. * circuits/streams/etc, since the failure of an unhealthy conn
  1243. * doesn't tell us much about whether a healthy conn would
  1244. * succeed. */
  1245. already_marked = 1;
  1246. }
  1247. log_info(LD_OR,
  1248. "Our circuit failed to get a response from the first hop "
  1249. "(%s). I'm going to try to rotate to a better connection.",
  1250. channel_get_canonical_remote_descr(n_chan));
  1251. n_chan->is_bad_for_new_circs = 1;
  1252. } else {
  1253. log_info(LD_OR,
  1254. "Our circuit died before the first hop with no connection");
  1255. }
  1256. if (n_chan_id && !already_marked) {
  1257. entry_guard_register_connect_status(n_chan_id, 0, 1, time(NULL));
  1258. /* if there are any one-hop streams waiting on this circuit, fail
  1259. * them now so they can retry elsewhere. */
  1260. connection_ap_fail_onehop(n_chan_id, circ->build_state);
  1261. }
  1262. }
  1263. switch (circ->base_.purpose) {
  1264. case CIRCUIT_PURPOSE_C_GENERAL:
  1265. /* If we never built the circuit, note it as a failure. */
  1266. circuit_increment_failure_count();
  1267. if (failed_at_last_hop) {
  1268. /* Make sure any streams that demand our last hop as their exit
  1269. * know that it's unlikely to happen. */
  1270. circuit_discard_optional_exit_enclaves(circ->cpath->prev->extend_info);
  1271. }
  1272. break;
  1273. case CIRCUIT_PURPOSE_TESTING:
  1274. circuit_testing_failed(circ, failed_at_last_hop);
  1275. break;
  1276. case CIRCUIT_PURPOSE_S_ESTABLISH_INTRO:
  1277. /* at Bob, waiting for introductions */
  1278. if (circ->base_.state != CIRCUIT_STATE_OPEN) {
  1279. circuit_increment_failure_count();
  1280. }
  1281. /* no need to care here, because bob will rebuild intro
  1282. * points periodically. */
  1283. break;
  1284. case CIRCUIT_PURPOSE_C_INTRODUCING:
  1285. /* at Alice, connecting to intro point */
  1286. /* Don't increment failure count, since Bob may have picked
  1287. * the introduction point maliciously */
  1288. /* Alice will pick a new intro point when this one dies, if
  1289. * the stream in question still cares. No need to act here. */
  1290. break;
  1291. case CIRCUIT_PURPOSE_C_ESTABLISH_REND:
  1292. /* at Alice, waiting for Bob */
  1293. circuit_increment_failure_count();
  1294. /* Alice will pick a new rend point when this one dies, if
  1295. * the stream in question still cares. No need to act here. */
  1296. break;
  1297. case CIRCUIT_PURPOSE_S_CONNECT_REND:
  1298. /* at Bob, connecting to rend point */
  1299. /* Don't increment failure count, since Alice may have picked
  1300. * the rendezvous point maliciously */
  1301. log_info(LD_REND,
  1302. "Couldn't connect to Alice's chosen rend point %s "
  1303. "(%s hop failed).",
  1304. escaped(build_state_get_exit_nickname(circ->build_state)),
  1305. failed_at_last_hop?"last":"non-last");
  1306. rend_service_relaunch_rendezvous(circ);
  1307. break;
  1308. /* default:
  1309. * This won't happen in normal operation, but might happen if the
  1310. * controller did it. Just let it slide. */
  1311. }
  1312. }
  1313. /** Number of consecutive failures so far; should only be touched by
  1314. * circuit_launch_new and circuit_*_failure_count.
  1315. */
  1316. static int n_circuit_failures = 0;
  1317. /** Before the last time we called circuit_reset_failure_count(), were
  1318. * there a lot of failures? */
  1319. static int did_circs_fail_last_period = 0;
  1320. /** Don't retry launching a new circuit if we try this many times with no
  1321. * success. */
  1322. #define MAX_CIRCUIT_FAILURES 5
  1323. /** Launch a new circuit; see circuit_launch_by_extend_info() for
  1324. * details on arguments. */
  1325. origin_circuit_t *
  1326. circuit_launch(uint8_t purpose, int flags)
  1327. {
  1328. return circuit_launch_by_extend_info(purpose, NULL, flags);
  1329. }
  1330. /** Launch a new circuit with purpose <b>purpose</b> and exit node
  1331. * <b>extend_info</b> (or NULL to select a random exit node). If flags
  1332. * contains CIRCLAUNCH_NEED_UPTIME, choose among routers with high uptime. If
  1333. * CIRCLAUNCH_NEED_CAPACITY is set, choose among routers with high bandwidth.
  1334. * If CIRCLAUNCH_IS_INTERNAL is true, the last hop need not be an exit node.
  1335. * If CIRCLAUNCH_ONEHOP_TUNNEL is set, the circuit will have only one hop.
  1336. * Return the newly allocated circuit on success, or NULL on failure. */
  1337. origin_circuit_t *
  1338. circuit_launch_by_extend_info(uint8_t purpose,
  1339. extend_info_t *extend_info,
  1340. int flags)
  1341. {
  1342. origin_circuit_t *circ;
  1343. int onehop_tunnel = (flags & CIRCLAUNCH_ONEHOP_TUNNEL) != 0;
  1344. if (!onehop_tunnel && !router_have_minimum_dir_info()) {
  1345. log_debug(LD_CIRC,"Haven't fetched enough directory info yet; canceling "
  1346. "circuit launch.");
  1347. return NULL;
  1348. }
  1349. if ((extend_info || purpose != CIRCUIT_PURPOSE_C_GENERAL) &&
  1350. purpose != CIRCUIT_PURPOSE_TESTING && !onehop_tunnel) {
  1351. /* see if there are appropriate circs available to cannibalize. */
  1352. /* XXX if we're planning to add a hop, perhaps we want to look for
  1353. * internal circs rather than exit circs? -RD */
  1354. circ = circuit_find_to_cannibalize(purpose, extend_info, flags);
  1355. if (circ) {
  1356. uint8_t old_purpose = circ->base_.purpose;
  1357. struct timeval old_timestamp_began;
  1358. log_info(LD_CIRC,"Cannibalizing circ '%s' for purpose %d (%s)",
  1359. build_state_get_exit_nickname(circ->build_state), purpose,
  1360. circuit_purpose_to_string(purpose));
  1361. if ((purpose == CIRCUIT_PURPOSE_S_CONNECT_REND ||
  1362. purpose == CIRCUIT_PURPOSE_C_INTRODUCING) &&
  1363. circ->path_state == PATH_STATE_BUILD_SUCCEEDED) {
  1364. /* Path bias: Cannibalized rends pre-emptively count as a
  1365. * successfully used circ. We don't wait until the extend,
  1366. * because the rend point could be malicious.
  1367. *
  1368. * Same deal goes for client side introductions. Clients
  1369. * can be manipulated to connect repeatedly to them
  1370. * (especially web clients).
  1371. *
  1372. * If we decide to probe the initial portion of these circs,
  1373. * (up to the adversaries final hop), we need to remove this.
  1374. */
  1375. circ->path_state = PATH_STATE_USE_SUCCEEDED;
  1376. /* This must be called before the purpose change */
  1377. pathbias_check_close(circ, END_CIRC_REASON_FINISHED);
  1378. }
  1379. circuit_change_purpose(TO_CIRCUIT(circ), purpose);
  1380. /* Reset the start date of this circ, else expire_building
  1381. * will see it and think it's been trying to build since it
  1382. * began.
  1383. *
  1384. * Technically, the code should reset this when the
  1385. * create cell is finally sent, but we're close enough
  1386. * here. */
  1387. tor_gettimeofday(&circ->base_.timestamp_began);
  1388. control_event_circuit_cannibalized(circ, old_purpose,
  1389. &old_timestamp_began);
  1390. switch (purpose) {
  1391. case CIRCUIT_PURPOSE_C_ESTABLISH_REND:
  1392. case CIRCUIT_PURPOSE_S_ESTABLISH_INTRO:
  1393. /* it's ready right now */
  1394. break;
  1395. case CIRCUIT_PURPOSE_C_INTRODUCING:
  1396. case CIRCUIT_PURPOSE_S_CONNECT_REND:
  1397. case CIRCUIT_PURPOSE_C_GENERAL:
  1398. /* need to add a new hop */
  1399. tor_assert(extend_info);
  1400. if (circuit_extend_to_new_exit(circ, extend_info) < 0)
  1401. return NULL;
  1402. break;
  1403. default:
  1404. log_warn(LD_BUG,
  1405. "unexpected purpose %d when cannibalizing a circ.",
  1406. purpose);
  1407. tor_fragile_assert();
  1408. return NULL;
  1409. }
  1410. return circ;
  1411. }
  1412. }
  1413. if (did_circs_fail_last_period &&
  1414. n_circuit_failures > MAX_CIRCUIT_FAILURES) {
  1415. /* too many failed circs in a row. don't try. */
  1416. // log_fn(LOG_INFO,"%d failures so far, not trying.",n_circuit_failures);
  1417. return NULL;
  1418. }
  1419. /* try a circ. if it fails, circuit_mark_for_close will increment
  1420. * n_circuit_failures */
  1421. return circuit_establish_circuit(purpose, extend_info, flags);
  1422. }
  1423. /** Record another failure at opening a general circuit. When we have
  1424. * too many, we'll stop trying for the remainder of this minute.
  1425. */
  1426. static void
  1427. circuit_increment_failure_count(void)
  1428. {
  1429. ++n_circuit_failures;
  1430. log_debug(LD_CIRC,"n_circuit_failures now %d.",n_circuit_failures);
  1431. }
  1432. /** Reset the failure count for opening general circuits. This means
  1433. * we will try MAX_CIRCUIT_FAILURES times more (if necessary) before
  1434. * stopping again.
  1435. */
  1436. void
  1437. circuit_reset_failure_count(int timeout)
  1438. {
  1439. if (timeout && n_circuit_failures > MAX_CIRCUIT_FAILURES)
  1440. did_circs_fail_last_period = 1;
  1441. else
  1442. did_circs_fail_last_period = 0;
  1443. n_circuit_failures = 0;
  1444. }
  1445. /** Find an open circ that we're happy to use for <b>conn</b> and return 1. If
  1446. * there isn't one, and there isn't one on the way, launch one and return
  1447. * 0. If it will never work, return -1.
  1448. *
  1449. * Write the found or in-progress or launched circ into *circp.
  1450. */
  1451. static int
  1452. circuit_get_open_circ_or_launch(entry_connection_t *conn,
  1453. uint8_t desired_circuit_purpose,
  1454. origin_circuit_t **circp)
  1455. {
  1456. origin_circuit_t *circ;
  1457. int check_exit_policy;
  1458. int need_uptime, need_internal;
  1459. int want_onehop;
  1460. const or_options_t *options = get_options();
  1461. tor_assert(conn);
  1462. tor_assert(circp);
  1463. tor_assert(ENTRY_TO_CONN(conn)->state == AP_CONN_STATE_CIRCUIT_WAIT);
  1464. check_exit_policy =
  1465. conn->socks_request->command == SOCKS_COMMAND_CONNECT &&
  1466. !conn->use_begindir &&
  1467. !connection_edge_is_rendezvous_stream(ENTRY_TO_EDGE_CONN(conn));
  1468. want_onehop = conn->want_onehop;
  1469. need_uptime = !conn->want_onehop && !conn->use_begindir &&
  1470. smartlist_string_num_isin(options->LongLivedPorts,
  1471. conn->socks_request->port);
  1472. if (desired_circuit_purpose != CIRCUIT_PURPOSE_C_GENERAL)
  1473. need_internal = 1;
  1474. else if (conn->use_begindir || conn->want_onehop)
  1475. need_internal = 1;
  1476. else
  1477. need_internal = 0;
  1478. circ = circuit_get_best(conn, 1, desired_circuit_purpose,
  1479. need_uptime, need_internal);
  1480. if (circ) {
  1481. *circp = circ;
  1482. return 1; /* we're happy */
  1483. }
  1484. if (!want_onehop && !router_have_minimum_dir_info()) {
  1485. if (!connection_get_by_type(CONN_TYPE_DIR)) {
  1486. int severity = LOG_NOTICE;
  1487. /* FFFF if this is a tunneled directory fetch, don't yell
  1488. * as loudly. the user doesn't even know it's happening. */
  1489. if (entry_list_is_constrained(options) &&
  1490. entries_known_but_down(options)) {
  1491. log_fn(severity, LD_APP|LD_DIR,
  1492. "Application request when we haven't used client functionality "
  1493. "lately. Optimistically trying known %s again.",
  1494. options->UseBridges ? "bridges" : "entrynodes");
  1495. entries_retry_all(options);
  1496. } else if (!options->UseBridges || any_bridge_descriptors_known()) {
  1497. log_fn(severity, LD_APP|LD_DIR,
  1498. "Application request when we haven't used client functionality "
  1499. "lately. Optimistically trying directory fetches again.");
  1500. routerlist_retry_directory_downloads(time(NULL));
  1501. }
  1502. }
  1503. /* the stream will be dealt with when router_have_minimum_dir_info becomes
  1504. * 1, or when all directory attempts fail and directory_all_unreachable()
  1505. * kills it.
  1506. */
  1507. return 0;
  1508. }
  1509. /* Do we need to check exit policy? */
  1510. if (check_exit_policy) {
  1511. if (!conn->chosen_exit_name) {
  1512. struct in_addr in;
  1513. tor_addr_t addr, *addrp=NULL;
  1514. if (tor_inet_aton(conn->socks_request->address, &in)) {
  1515. tor_addr_from_in(&addr, &in);
  1516. addrp = &addr;
  1517. }
  1518. if (router_exit_policy_all_nodes_reject(addrp,
  1519. conn->socks_request->port,
  1520. need_uptime)) {
  1521. log_notice(LD_APP,
  1522. "No Tor server allows exit to %s:%d. Rejecting.",
  1523. safe_str_client(conn->socks_request->address),
  1524. conn->socks_request->port);
  1525. return -1;
  1526. }
  1527. } else {
  1528. /* XXXX024 Duplicates checks in connection_ap_handshake_attach_circuit:
  1529. * refactor into a single function? */
  1530. const node_t *node = node_get_by_nickname(conn->chosen_exit_name, 1);
  1531. int opt = conn->chosen_exit_optional;
  1532. if (node && !connection_ap_can_use_exit(conn, node)) {
  1533. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  1534. "Requested exit point '%s' is excluded or "
  1535. "would refuse request. %s.",
  1536. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  1537. if (opt) {
  1538. conn->chosen_exit_optional = 0;
  1539. tor_free(conn->chosen_exit_name);
  1540. /* Try again. */
  1541. return circuit_get_open_circ_or_launch(conn,
  1542. desired_circuit_purpose,
  1543. circp);
  1544. }
  1545. return -1;
  1546. }
  1547. }
  1548. }
  1549. /* is one already on the way? */
  1550. circ = circuit_get_best(conn, 0, desired_circuit_purpose,
  1551. need_uptime, need_internal);
  1552. if (circ)
  1553. log_debug(LD_CIRC, "one on the way!");
  1554. if (!circ) {
  1555. extend_info_t *extend_info=NULL;
  1556. uint8_t new_circ_purpose;
  1557. const int n_pending = count_pending_general_client_circuits();
  1558. if (n_pending >= options->MaxClientCircuitsPending) {
  1559. static ratelim_t delay_limit = RATELIM_INIT(10*60);
  1560. char *m;
  1561. if ((m = rate_limit_log(&delay_limit, approx_time()))) {
  1562. log_notice(LD_APP, "We'd like to launch a circuit to handle a "
  1563. "connection, but we already have %d general-purpose client "
  1564. "circuits pending. Waiting until some finish.%s",
  1565. n_pending, m);
  1566. tor_free(m);
  1567. }
  1568. return 0;
  1569. }
  1570. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT) {
  1571. /* need to pick an intro point */
  1572. rend_data_t *rend_data = ENTRY_TO_EDGE_CONN(conn)->rend_data;
  1573. tor_assert(rend_data);
  1574. extend_info = rend_client_get_random_intro(rend_data);
  1575. if (!extend_info) {
  1576. log_info(LD_REND,
  1577. "No intro points for '%s': re-fetching service descriptor.",
  1578. safe_str_client(rend_data->onion_address));
  1579. rend_client_refetch_v2_renddesc(rend_data);
  1580. ENTRY_TO_CONN(conn)->state = AP_CONN_STATE_RENDDESC_WAIT;
  1581. return 0;
  1582. }
  1583. log_info(LD_REND,"Chose %s as intro point for '%s'.",
  1584. extend_info_describe(extend_info),
  1585. safe_str_client(rend_data->onion_address));
  1586. }
  1587. /* If we have specified a particular exit node for our
  1588. * connection, then be sure to open a circuit to that exit node.
  1589. */
  1590. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_GENERAL) {
  1591. if (conn->chosen_exit_name) {
  1592. const node_t *r;
  1593. int opt = conn->chosen_exit_optional;
  1594. r = node_get_by_nickname(conn->chosen_exit_name, 1);
  1595. if (r && node_has_descriptor(r)) {
  1596. /* We might want to connect to an IPv6 bridge for loading
  1597. descriptors so we use the preferred address rather than
  1598. the primary. */
  1599. extend_info = extend_info_from_node(r, conn->want_onehop ? 1 : 0);
  1600. } else {
  1601. log_debug(LD_DIR, "considering %d, %s",
  1602. want_onehop, conn->chosen_exit_name);
  1603. if (want_onehop && conn->chosen_exit_name[0] == '$') {
  1604. /* We're asking for a one-hop circuit to a router that
  1605. * we don't have a routerinfo about. Make up an extend_info. */
  1606. char digest[DIGEST_LEN];
  1607. char *hexdigest = conn->chosen_exit_name+1;
  1608. tor_addr_t addr;
  1609. if (strlen(hexdigest) < HEX_DIGEST_LEN ||
  1610. base16_decode(digest,DIGEST_LEN,hexdigest,HEX_DIGEST_LEN)<0) {
  1611. log_info(LD_DIR, "Broken exit digest on tunnel conn. Closing.");
  1612. return -1;
  1613. }
  1614. if (tor_addr_parse(&addr, conn->socks_request->address) < 0) {
  1615. log_info(LD_DIR, "Broken address %s on tunnel conn. Closing.",
  1616. escaped_safe_str_client(conn->socks_request->address));
  1617. return -1;
  1618. }
  1619. extend_info = extend_info_new(conn->chosen_exit_name+1,
  1620. digest, NULL, NULL, &addr,
  1621. conn->socks_request->port);
  1622. } else {
  1623. /* We will need an onion key for the router, and we
  1624. * don't have one. Refuse or relax requirements. */
  1625. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  1626. "Requested exit point '%s' is not known. %s.",
  1627. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  1628. if (opt) {
  1629. conn->chosen_exit_optional = 0;
  1630. tor_free(conn->chosen_exit_name);
  1631. /* Try again with no requested exit */
  1632. return circuit_get_open_circ_or_launch(conn,
  1633. desired_circuit_purpose,
  1634. circp);
  1635. }
  1636. return -1;
  1637. }
  1638. }
  1639. }
  1640. }
  1641. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_REND_JOINED)
  1642. new_circ_purpose = CIRCUIT_PURPOSE_C_ESTABLISH_REND;
  1643. else if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT)
  1644. new_circ_purpose = CIRCUIT_PURPOSE_C_INTRODUCING;
  1645. else
  1646. new_circ_purpose = desired_circuit_purpose;
  1647. if (options->Tor2webMode &&
  1648. (new_circ_purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND ||
  1649. new_circ_purpose == CIRCUIT_PURPOSE_C_INTRODUCING)) {
  1650. want_onehop = 1;
  1651. }
  1652. {
  1653. int flags = CIRCLAUNCH_NEED_CAPACITY;
  1654. if (want_onehop) flags |= CIRCLAUNCH_ONEHOP_TUNNEL;
  1655. if (need_uptime) flags |= CIRCLAUNCH_NEED_UPTIME;
  1656. if (need_internal) flags |= CIRCLAUNCH_IS_INTERNAL;
  1657. circ = circuit_launch_by_extend_info(new_circ_purpose, extend_info,
  1658. flags);
  1659. }
  1660. extend_info_free(extend_info);
  1661. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_GENERAL) {
  1662. /* We just caused a circuit to get built because of this stream.
  1663. * If this stream has caused a _lot_ of circuits to be built, that's
  1664. * a bad sign: we should tell the user. */
  1665. if (conn->num_circuits_launched < NUM_CIRCUITS_LAUNCHED_THRESHOLD &&
  1666. ++conn->num_circuits_launched == NUM_CIRCUITS_LAUNCHED_THRESHOLD)
  1667. log_info(LD_CIRC, "The application request to %s:%d has launched "
  1668. "%d circuits without finding one it likes.",
  1669. escaped_safe_str_client(conn->socks_request->address),
  1670. conn->socks_request->port,
  1671. conn->num_circuits_launched);
  1672. } else {
  1673. /* help predict this next time */
  1674. rep_hist_note_used_internal(time(NULL), need_uptime, 1);
  1675. if (circ) {
  1676. /* write the service_id into circ */
  1677. circ->rend_data = rend_data_dup(ENTRY_TO_EDGE_CONN(conn)->rend_data);
  1678. if (circ->base_.purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND &&
  1679. circ->base_.state == CIRCUIT_STATE_OPEN)
  1680. rend_client_rendcirc_has_opened(circ);
  1681. }
  1682. }
  1683. } /* endif (!circ) */
  1684. if (circ) {
  1685. /* Mark the circuit with the isolation fields for this connection.
  1686. * When the circuit arrives, we'll clear these flags: this is
  1687. * just some internal bookkeeping to make sure that we have
  1688. * launched enough circuits.
  1689. */
  1690. connection_edge_update_circuit_isolation(conn, circ, 0);
  1691. } else {
  1692. log_info(LD_APP,
  1693. "No safe circuit (purpose %d) ready for edge "
  1694. "connection; delaying.",
  1695. desired_circuit_purpose);
  1696. }
  1697. *circp = circ;
  1698. return 0;
  1699. }
  1700. /** Return true iff <b>crypt_path</b> is one of the crypt_paths for
  1701. * <b>circ</b>. */
  1702. static int
  1703. cpath_is_on_circuit(origin_circuit_t *circ, crypt_path_t *crypt_path)
  1704. {
  1705. crypt_path_t *cpath, *cpath_next = NULL;
  1706. for (cpath = circ->cpath; cpath_next != circ->cpath; cpath = cpath_next) {
  1707. cpath_next = cpath->next;
  1708. if (crypt_path == cpath)
  1709. return 1;
  1710. }
  1711. return 0;
  1712. }
  1713. /** Return true iff client-side optimistic data is supported. */
  1714. static int
  1715. optimistic_data_enabled(void)
  1716. {
  1717. const or_options_t *options = get_options();
  1718. if (options->OptimisticData < 0) {
  1719. /* XXX023 consider having auto default to 1 rather than 0 before
  1720. * the 0.2.3 branch goes stable. See bug 3617. -RD */
  1721. const int32_t enabled =
  1722. networkstatus_get_param(NULL, "UseOptimisticData", 0, 0, 1);
  1723. return (int)enabled;
  1724. }
  1725. return options->OptimisticData;
  1726. }
  1727. /** Attach the AP stream <b>apconn</b> to circ's linked list of
  1728. * p_streams. Also set apconn's cpath_layer to <b>cpath</b>, or to the last
  1729. * hop in circ's cpath if <b>cpath</b> is NULL.
  1730. */
  1731. static void
  1732. link_apconn_to_circ(entry_connection_t *apconn, origin_circuit_t *circ,
  1733. crypt_path_t *cpath)
  1734. {
  1735. const node_t *exitnode;
  1736. /* add it into the linked list of streams on this circuit */
  1737. log_debug(LD_APP|LD_CIRC, "attaching new conn to circ. n_circ_id %d.",
  1738. circ->base_.n_circ_id);
  1739. /* reset it, so we can measure circ timeouts */
  1740. ENTRY_TO_CONN(apconn)->timestamp_lastread = time(NULL);
  1741. ENTRY_TO_EDGE_CONN(apconn)->next_stream = circ->p_streams;
  1742. ENTRY_TO_EDGE_CONN(apconn)->on_circuit = TO_CIRCUIT(circ);
  1743. /* assert_connection_ok(conn, time(NULL)); */
  1744. circ->p_streams = ENTRY_TO_EDGE_CONN(apconn);
  1745. if (connection_edge_is_rendezvous_stream(ENTRY_TO_EDGE_CONN(apconn))) {
  1746. /* We are attaching a stream to a rendezvous circuit. That means
  1747. * that an attempt to connect to a hidden service just
  1748. * succeeded. Tell rendclient.c. */
  1749. rend_client_note_connection_attempt_ended(
  1750. ENTRY_TO_EDGE_CONN(apconn)->rend_data->onion_address);
  1751. }
  1752. if (cpath) { /* we were given one; use it */
  1753. tor_assert(cpath_is_on_circuit(circ, cpath));
  1754. } else {
  1755. /* use the last hop in the circuit */
  1756. tor_assert(circ->cpath);
  1757. tor_assert(circ->cpath->prev);
  1758. tor_assert(circ->cpath->prev->state == CPATH_STATE_OPEN);
  1759. cpath = circ->cpath->prev;
  1760. }
  1761. ENTRY_TO_EDGE_CONN(apconn)->cpath_layer = cpath;
  1762. circ->isolation_any_streams_attached = 1;
  1763. connection_edge_update_circuit_isolation(apconn, circ, 0);
  1764. /* See if we can use optimistic data on this circuit */
  1765. if (cpath->extend_info &&
  1766. (exitnode = node_get_by_id(cpath->extend_info->identity_digest)) &&
  1767. exitnode->rs) {
  1768. /* Okay; we know what exit node this is. */
  1769. if (optimistic_data_enabled() &&
  1770. circ->base_.purpose == CIRCUIT_PURPOSE_C_GENERAL &&
  1771. exitnode->rs->version_supports_optimistic_data)
  1772. apconn->may_use_optimistic_data = 1;
  1773. else
  1774. apconn->may_use_optimistic_data = 0;
  1775. log_info(LD_APP, "Looks like completed circuit to %s %s allow "
  1776. "optimistic data for connection to %s",
  1777. safe_str_client(node_describe(exitnode)),
  1778. apconn->may_use_optimistic_data ? "does" : "doesn't",
  1779. safe_str_client(apconn->socks_request->address));
  1780. }
  1781. }
  1782. /** Return true iff <b>address</b> is matched by one of the entries in
  1783. * TrackHostExits. */
  1784. int
  1785. hostname_in_track_host_exits(const or_options_t *options, const char *address)
  1786. {
  1787. if (!options->TrackHostExits)
  1788. return 0;
  1789. SMARTLIST_FOREACH_BEGIN(options->TrackHostExits, const char *, cp) {
  1790. if (cp[0] == '.') { /* match end */
  1791. if (cp[1] == '\0' ||
  1792. !strcasecmpend(address, cp) ||
  1793. !strcasecmp(address, &cp[1]))
  1794. return 1;
  1795. } else if (strcasecmp(cp, address) == 0) {
  1796. return 1;
  1797. }
  1798. } SMARTLIST_FOREACH_END(cp);
  1799. return 0;
  1800. }
  1801. /** If an exit wasn't explicitly specified for <b>conn</b>, consider saving
  1802. * the exit that we *did* choose for use by future connections to
  1803. * <b>conn</b>'s destination.
  1804. */
  1805. static void
  1806. consider_recording_trackhost(const entry_connection_t *conn,
  1807. const origin_circuit_t *circ)
  1808. {
  1809. const or_options_t *options = get_options();
  1810. char *new_address = NULL;
  1811. char fp[HEX_DIGEST_LEN+1];
  1812. /* Search the addressmap for this conn's destination. */
  1813. /* If he's not in the address map.. */
  1814. if (!options->TrackHostExits ||
  1815. addressmap_have_mapping(conn->socks_request->address,
  1816. options->TrackHostExitsExpire))
  1817. return; /* nothing to track, or already mapped */
  1818. if (!hostname_in_track_host_exits(options, conn->socks_request->address) ||
  1819. !circ->build_state->chosen_exit)
  1820. return;
  1821. /* write down the fingerprint of the chosen exit, not the nickname,
  1822. * because the chosen exit might not be named. */
  1823. base16_encode(fp, sizeof(fp),
  1824. circ->build_state->chosen_exit->identity_digest, DIGEST_LEN);
  1825. /* Add this exit/hostname pair to the addressmap. */
  1826. tor_asprintf(&new_address, "%s.%s.exit",
  1827. conn->socks_request->address, fp);
  1828. addressmap_register(conn->socks_request->address, new_address,
  1829. time(NULL) + options->TrackHostExitsExpire,
  1830. ADDRMAPSRC_TRACKEXIT, 0, 0);
  1831. }
  1832. /** Attempt to attach the connection <b>conn</b> to <b>circ</b>, and send a
  1833. * begin or resolve cell as appropriate. Return values are as for
  1834. * connection_ap_handshake_attach_circuit. The stream will exit from the hop
  1835. * indicated by <b>cpath</b>, or from the last hop in circ's cpath if
  1836. * <b>cpath</b> is NULL. */
  1837. int
  1838. connection_ap_handshake_attach_chosen_circuit(entry_connection_t *conn,
  1839. origin_circuit_t *circ,
  1840. crypt_path_t *cpath)
  1841. {
  1842. connection_t *base_conn = ENTRY_TO_CONN(conn);
  1843. tor_assert(conn);
  1844. tor_assert(base_conn->state == AP_CONN_STATE_CIRCUIT_WAIT ||
  1845. base_conn->state == AP_CONN_STATE_CONTROLLER_WAIT);
  1846. tor_assert(conn->socks_request);
  1847. tor_assert(circ);
  1848. tor_assert(circ->base_.state == CIRCUIT_STATE_OPEN);
  1849. base_conn->state = AP_CONN_STATE_CIRCUIT_WAIT;
  1850. if (!circ->base_.timestamp_dirty)
  1851. circ->base_.timestamp_dirty = time(NULL);
  1852. link_apconn_to_circ(conn, circ, cpath);
  1853. tor_assert(conn->socks_request);
  1854. if (conn->socks_request->command == SOCKS_COMMAND_CONNECT) {
  1855. if (!conn->use_begindir)
  1856. consider_recording_trackhost(conn, circ);
  1857. if (connection_ap_handshake_send_begin(conn) < 0)
  1858. return -1;
  1859. } else {
  1860. if (connection_ap_handshake_send_resolve(conn) < 0)
  1861. return -1;
  1862. }
  1863. return 1;
  1864. }
  1865. /** Try to find a safe live circuit for CONN_TYPE_AP connection conn. If
  1866. * we don't find one: if conn cannot be handled by any known nodes,
  1867. * warn and return -1 (conn needs to die, and is maybe already marked);
  1868. * else launch new circuit (if necessary) and return 0.
  1869. * Otherwise, associate conn with a safe live circuit, do the
  1870. * right next step, and return 1.
  1871. */
  1872. /* XXXX this function should mark for close whenever it returns -1;
  1873. * its callers shouldn't have to worry about that. */
  1874. int
  1875. connection_ap_handshake_attach_circuit(entry_connection_t *conn)
  1876. {
  1877. connection_t *base_conn = ENTRY_TO_CONN(conn);
  1878. int retval;
  1879. int conn_age;
  1880. int want_onehop;
  1881. tor_assert(conn);
  1882. tor_assert(base_conn->state == AP_CONN_STATE_CIRCUIT_WAIT);
  1883. tor_assert(conn->socks_request);
  1884. want_onehop = conn->want_onehop;
  1885. conn_age = (int)(time(NULL) - base_conn->timestamp_created);
  1886. if (conn_age >= get_options()->SocksTimeout) {
  1887. int severity = (tor_addr_is_null(&base_conn->addr) && !base_conn->port) ?
  1888. LOG_INFO : LOG_NOTICE;
  1889. log_fn(severity, LD_APP,
  1890. "Tried for %d seconds to get a connection to %s:%d. Giving up.",
  1891. conn_age, safe_str_client(conn->socks_request->address),
  1892. conn->socks_request->port);
  1893. return -1;
  1894. }
  1895. if (!connection_edge_is_rendezvous_stream(ENTRY_TO_EDGE_CONN(conn))) {
  1896. /* we're a general conn */
  1897. origin_circuit_t *circ=NULL;
  1898. if (conn->chosen_exit_name) {
  1899. const node_t *node = node_get_by_nickname(conn->chosen_exit_name, 1);
  1900. int opt = conn->chosen_exit_optional;
  1901. if (!node && !want_onehop) {
  1902. /* We ran into this warning when trying to extend a circuit to a
  1903. * hidden service directory for which we didn't have a router
  1904. * descriptor. See flyspray task 767 for more details. We should
  1905. * keep this in mind when deciding to use BEGIN_DIR cells for other
  1906. * directory requests as well. -KL*/
  1907. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  1908. "Requested exit point '%s' is not known. %s.",
  1909. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  1910. if (opt) {
  1911. conn->chosen_exit_optional = 0;
  1912. tor_free(conn->chosen_exit_name);
  1913. return 0;
  1914. }
  1915. return -1;
  1916. }
  1917. if (node && !connection_ap_can_use_exit(conn, node)) {
  1918. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  1919. "Requested exit point '%s' is excluded or "
  1920. "would refuse request. %s.",
  1921. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  1922. if (opt) {
  1923. conn->chosen_exit_optional = 0;
  1924. tor_free(conn->chosen_exit_name);
  1925. return 0;
  1926. }
  1927. return -1;
  1928. }
  1929. }
  1930. /* find the circuit that we should use, if there is one. */
  1931. retval = circuit_get_open_circ_or_launch(
  1932. conn, CIRCUIT_PURPOSE_C_GENERAL, &circ);
  1933. if (retval < 1) // XXX023 if we totally fail, this still returns 0 -RD
  1934. return retval;
  1935. log_debug(LD_APP|LD_CIRC,
  1936. "Attaching apconn to circ %d (stream %d sec old).",
  1937. circ->base_.n_circ_id, conn_age);
  1938. /* print the circ's path, so people can figure out which circs are
  1939. * sucking. */
  1940. circuit_log_path(LOG_INFO,LD_APP|LD_CIRC,circ);
  1941. /* We have found a suitable circuit for our conn. Hurray. */
  1942. return connection_ap_handshake_attach_chosen_circuit(conn, circ, NULL);
  1943. } else { /* we're a rendezvous conn */
  1944. origin_circuit_t *rendcirc=NULL, *introcirc=NULL;
  1945. tor_assert(!ENTRY_TO_EDGE_CONN(conn)->cpath_layer);
  1946. /* start by finding a rendezvous circuit for us */
  1947. retval = circuit_get_open_circ_or_launch(
  1948. conn, CIRCUIT_PURPOSE_C_REND_JOINED, &rendcirc);
  1949. if (retval < 0) return -1; /* failed */
  1950. if (retval > 0) {
  1951. tor_assert(rendcirc);
  1952. /* one is already established, attach */
  1953. log_info(LD_REND,
  1954. "rend joined circ %d already here. attaching. "
  1955. "(stream %d sec old)",
  1956. rendcirc->base_.n_circ_id, conn_age);
  1957. /* Mark rendezvous circuits as 'newly dirty' every time you use
  1958. * them, since the process of rebuilding a rendezvous circ is so
  1959. * expensive. There is a tradeoff between linkability and
  1960. * feasibility, at this point.
  1961. */
  1962. rendcirc->base_.timestamp_dirty = time(NULL);
  1963. link_apconn_to_circ(conn, rendcirc, NULL);
  1964. if (connection_ap_handshake_send_begin(conn) < 0)
  1965. return 0; /* already marked, let them fade away */
  1966. return 1;
  1967. }
  1968. if (rendcirc && (rendcirc->base_.purpose ==
  1969. CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED)) {
  1970. log_info(LD_REND,
  1971. "pending-join circ %d already here, with intro ack. "
  1972. "Stalling. (stream %d sec old)",
  1973. rendcirc->base_.n_circ_id, conn_age);
  1974. return 0;
  1975. }
  1976. /* it's on its way. find an intro circ. */
  1977. retval = circuit_get_open_circ_or_launch(
  1978. conn, CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT, &introcirc);
  1979. if (retval < 0) return -1; /* failed */
  1980. if (retval > 0) {
  1981. /* one has already sent the intro. keep waiting. */
  1982. tor_assert(introcirc);
  1983. log_info(LD_REND, "Intro circ %d present and awaiting ack (rend %d). "
  1984. "Stalling. (stream %d sec old)",
  1985. introcirc->base_.n_circ_id,
  1986. rendcirc ? rendcirc->base_.n_circ_id : 0,
  1987. conn_age);
  1988. return 0;
  1989. }
  1990. /* now rendcirc and introcirc are each either undefined or not finished */
  1991. if (rendcirc && introcirc &&
  1992. rendcirc->base_.purpose == CIRCUIT_PURPOSE_C_REND_READY) {
  1993. log_info(LD_REND,
  1994. "ready rend circ %d already here (no intro-ack yet on "
  1995. "intro %d). (stream %d sec old)",
  1996. rendcirc->base_.n_circ_id,
  1997. introcirc->base_.n_circ_id, conn_age);
  1998. tor_assert(introcirc->base_.purpose == CIRCUIT_PURPOSE_C_INTRODUCING);
  1999. if (introcirc->base_.state == CIRCUIT_STATE_OPEN) {
  2000. log_info(LD_REND,"found open intro circ %d (rend %d); sending "
  2001. "introduction. (stream %d sec old)",
  2002. introcirc->base_.n_circ_id, rendcirc->base_.n_circ_id,
  2003. conn_age);
  2004. switch (rend_client_send_introduction(introcirc, rendcirc)) {
  2005. case 0: /* success */
  2006. rendcirc->base_.timestamp_dirty = time(NULL);
  2007. introcirc->base_.timestamp_dirty = time(NULL);
  2008. assert_circuit_ok(TO_CIRCUIT(rendcirc));
  2009. assert_circuit_ok(TO_CIRCUIT(introcirc));
  2010. return 0;
  2011. case -1: /* transient error */
  2012. return 0;
  2013. case -2: /* permanent error */
  2014. return -1;
  2015. default: /* oops */
  2016. tor_fragile_assert();
  2017. return -1;
  2018. }
  2019. }
  2020. }
  2021. log_info(LD_REND, "Intro (%d) and rend (%d) circs are not both ready. "
  2022. "Stalling conn. (%d sec old)",
  2023. introcirc ? introcirc->base_.n_circ_id : 0,
  2024. rendcirc ? rendcirc->base_.n_circ_id : 0, conn_age);
  2025. return 0;
  2026. }
  2027. }
  2028. /** Change <b>circ</b>'s purpose to <b>new_purpose</b>. */
  2029. void
  2030. circuit_change_purpose(circuit_t *circ, uint8_t new_purpose)
  2031. {
  2032. uint8_t old_purpose;
  2033. /* Don't allow an OR circ to become an origin circ or vice versa. */
  2034. tor_assert(!!(CIRCUIT_IS_ORIGIN(circ)) ==
  2035. !!(CIRCUIT_PURPOSE_IS_ORIGIN(new_purpose)));
  2036. if (circ->purpose == new_purpose) return;
  2037. if (CIRCUIT_IS_ORIGIN(circ)) {
  2038. char old_purpose_desc[80] = "";
  2039. strncpy(old_purpose_desc, circuit_purpose_to_string(circ->purpose), 80-1);
  2040. old_purpose_desc[80-1] = '\0';
  2041. log_debug(LD_CIRC,
  2042. "changing purpose of origin circ %d "
  2043. "from \"%s\" (%d) to \"%s\" (%d)",
  2044. TO_ORIGIN_CIRCUIT(circ)->global_identifier,
  2045. old_purpose_desc,
  2046. circ->purpose,
  2047. circuit_purpose_to_string(new_purpose),
  2048. new_purpose);
  2049. }
  2050. old_purpose = circ->purpose;
  2051. circ->purpose = new_purpose;
  2052. if (CIRCUIT_IS_ORIGIN(circ)) {
  2053. control_event_circuit_purpose_changed(TO_ORIGIN_CIRCUIT(circ),
  2054. old_purpose);
  2055. }
  2056. }