circuituse.c 87 KB

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