circuituse.c 87 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329
  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. get_options()->LearnCircuitBuildTimeout &&
  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 (get_options()->LearnCircuitBuildTimeout &&
  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. /* We failed at the first hop. If there's an OR connection
  1262. * to blame, blame it. Also, avoid this relay for a while, and
  1263. * fail any one-hop directory fetches destined for it. */
  1264. const char *n_chan_id = circ->cpath->extend_info->identity_digest;
  1265. int already_marked = 0;
  1266. if (circ->base_.n_chan) {
  1267. n_chan = circ->base_.n_chan;
  1268. if (n_chan->is_bad_for_new_circs) {
  1269. /* We only want to blame this router when a fresh healthy
  1270. * connection fails. So don't mark this router as newly failed,
  1271. * since maybe this was just an old circuit attempt that's
  1272. * finally timing out now. Also, there's no need to blow away
  1273. * circuits/streams/etc, since the failure of an unhealthy conn
  1274. * doesn't tell us much about whether a healthy conn would
  1275. * succeed. */
  1276. already_marked = 1;
  1277. }
  1278. log_info(LD_OR,
  1279. "Our circuit failed to get a response from the first hop "
  1280. "(%s). I'm going to try to rotate to a better connection.",
  1281. channel_get_canonical_remote_descr(n_chan));
  1282. n_chan->is_bad_for_new_circs = 1;
  1283. } else {
  1284. log_info(LD_OR,
  1285. "Our circuit died before the first hop with no connection");
  1286. }
  1287. if (n_chan_id && !already_marked) {
  1288. entry_guard_register_connect_status(n_chan_id, 0, 1, time(NULL));
  1289. /* if there are any one-hop streams waiting on this circuit, fail
  1290. * them now so they can retry elsewhere. */
  1291. connection_ap_fail_onehop(n_chan_id, circ->build_state);
  1292. }
  1293. }
  1294. switch (circ->base_.purpose) {
  1295. case CIRCUIT_PURPOSE_C_GENERAL:
  1296. /* If we never built the circuit, note it as a failure. */
  1297. circuit_increment_failure_count();
  1298. if (failed_at_last_hop) {
  1299. /* Make sure any streams that demand our last hop as their exit
  1300. * know that it's unlikely to happen. */
  1301. circuit_discard_optional_exit_enclaves(circ->cpath->prev->extend_info);
  1302. }
  1303. break;
  1304. case CIRCUIT_PURPOSE_TESTING:
  1305. circuit_testing_failed(circ, failed_at_last_hop);
  1306. break;
  1307. case CIRCUIT_PURPOSE_S_ESTABLISH_INTRO:
  1308. /* at Bob, waiting for introductions */
  1309. if (circ->base_.state != CIRCUIT_STATE_OPEN) {
  1310. circuit_increment_failure_count();
  1311. }
  1312. /* no need to care here, because bob will rebuild intro
  1313. * points periodically. */
  1314. break;
  1315. case CIRCUIT_PURPOSE_C_INTRODUCING:
  1316. /* at Alice, connecting to intro point */
  1317. /* Don't increment failure count, since Bob may have picked
  1318. * the introduction point maliciously */
  1319. /* Alice will pick a new intro point when this one dies, if
  1320. * the stream in question still cares. No need to act here. */
  1321. break;
  1322. case CIRCUIT_PURPOSE_C_ESTABLISH_REND:
  1323. /* at Alice, waiting for Bob */
  1324. circuit_increment_failure_count();
  1325. /* Alice will pick a new rend point when this one dies, if
  1326. * the stream in question still cares. No need to act here. */
  1327. break;
  1328. case CIRCUIT_PURPOSE_S_CONNECT_REND:
  1329. /* at Bob, connecting to rend point */
  1330. /* Don't increment failure count, since Alice may have picked
  1331. * the rendezvous point maliciously */
  1332. log_info(LD_REND,
  1333. "Couldn't connect to Alice's chosen rend point %s "
  1334. "(%s hop failed).",
  1335. escaped(build_state_get_exit_nickname(circ->build_state)),
  1336. failed_at_last_hop?"last":"non-last");
  1337. rend_service_relaunch_rendezvous(circ);
  1338. break;
  1339. /* default:
  1340. * This won't happen in normal operation, but might happen if the
  1341. * controller did it. Just let it slide. */
  1342. }
  1343. }
  1344. /** Number of consecutive failures so far; should only be touched by
  1345. * circuit_launch_new and circuit_*_failure_count.
  1346. */
  1347. static int n_circuit_failures = 0;
  1348. /** Before the last time we called circuit_reset_failure_count(), were
  1349. * there a lot of failures? */
  1350. static int did_circs_fail_last_period = 0;
  1351. /** Don't retry launching a new circuit if we try this many times with no
  1352. * success. */
  1353. #define MAX_CIRCUIT_FAILURES 5
  1354. /** Launch a new circuit; see circuit_launch_by_extend_info() for
  1355. * details on arguments. */
  1356. origin_circuit_t *
  1357. circuit_launch(uint8_t purpose, int flags)
  1358. {
  1359. return circuit_launch_by_extend_info(purpose, NULL, flags);
  1360. }
  1361. /** Launch a new circuit with purpose <b>purpose</b> and exit node
  1362. * <b>extend_info</b> (or NULL to select a random exit node). If flags
  1363. * contains CIRCLAUNCH_NEED_UPTIME, choose among routers with high uptime. If
  1364. * CIRCLAUNCH_NEED_CAPACITY is set, choose among routers with high bandwidth.
  1365. * If CIRCLAUNCH_IS_INTERNAL is true, the last hop need not be an exit node.
  1366. * If CIRCLAUNCH_ONEHOP_TUNNEL is set, the circuit will have only one hop.
  1367. * Return the newly allocated circuit on success, or NULL on failure. */
  1368. origin_circuit_t *
  1369. circuit_launch_by_extend_info(uint8_t purpose,
  1370. extend_info_t *extend_info,
  1371. int flags)
  1372. {
  1373. origin_circuit_t *circ;
  1374. int onehop_tunnel = (flags & CIRCLAUNCH_ONEHOP_TUNNEL) != 0;
  1375. if (!onehop_tunnel && !router_have_minimum_dir_info()) {
  1376. log_debug(LD_CIRC,"Haven't fetched enough directory info yet; canceling "
  1377. "circuit launch.");
  1378. return NULL;
  1379. }
  1380. if ((extend_info || purpose != CIRCUIT_PURPOSE_C_GENERAL) &&
  1381. purpose != CIRCUIT_PURPOSE_TESTING && !onehop_tunnel) {
  1382. /* see if there are appropriate circs available to cannibalize. */
  1383. /* XXX if we're planning to add a hop, perhaps we want to look for
  1384. * internal circs rather than exit circs? -RD */
  1385. circ = circuit_find_to_cannibalize(purpose, extend_info, flags);
  1386. if (circ) {
  1387. uint8_t old_purpose = circ->base_.purpose;
  1388. struct timeval old_timestamp_began;
  1389. log_info(LD_CIRC,"Cannibalizing circ '%s' for purpose %d (%s)",
  1390. build_state_get_exit_nickname(circ->build_state), purpose,
  1391. circuit_purpose_to_string(purpose));
  1392. if ((purpose == CIRCUIT_PURPOSE_S_CONNECT_REND ||
  1393. purpose == CIRCUIT_PURPOSE_C_INTRODUCING) &&
  1394. circ->path_state == PATH_STATE_BUILD_SUCCEEDED) {
  1395. /* Path bias: Cannibalized rends pre-emptively count as a
  1396. * successfully built but unused closed circuit. We don't
  1397. * wait until the extend (or the close) because the rend
  1398. * point could be malicious.
  1399. *
  1400. * Same deal goes for client side introductions. Clients
  1401. * can be manipulated to connect repeatedly to them
  1402. * (especially web clients).
  1403. *
  1404. * If we decide to probe the initial portion of these circs,
  1405. * (up to the adversary's final hop), we need to remove this,
  1406. * or somehow mark the circuit with a special path state.
  1407. */
  1408. /* This must be called before the purpose change */
  1409. pathbias_check_close(circ, END_CIRC_REASON_FINISHED);
  1410. }
  1411. circuit_change_purpose(TO_CIRCUIT(circ), purpose);
  1412. /* Reset the start date of this circ, else expire_building
  1413. * will see it and think it's been trying to build since it
  1414. * began.
  1415. *
  1416. * Technically, the code should reset this when the
  1417. * create cell is finally sent, but we're close enough
  1418. * here. */
  1419. tor_gettimeofday(&circ->base_.timestamp_began);
  1420. control_event_circuit_cannibalized(circ, old_purpose,
  1421. &old_timestamp_began);
  1422. switch (purpose) {
  1423. case CIRCUIT_PURPOSE_C_ESTABLISH_REND:
  1424. case CIRCUIT_PURPOSE_S_ESTABLISH_INTRO:
  1425. /* it's ready right now */
  1426. break;
  1427. case CIRCUIT_PURPOSE_C_INTRODUCING:
  1428. case CIRCUIT_PURPOSE_S_CONNECT_REND:
  1429. case CIRCUIT_PURPOSE_C_GENERAL:
  1430. /* need to add a new hop */
  1431. tor_assert(extend_info);
  1432. if (circuit_extend_to_new_exit(circ, extend_info) < 0)
  1433. return NULL;
  1434. break;
  1435. default:
  1436. log_warn(LD_BUG,
  1437. "unexpected purpose %d when cannibalizing a circ.",
  1438. purpose);
  1439. tor_fragile_assert();
  1440. return NULL;
  1441. }
  1442. return circ;
  1443. }
  1444. }
  1445. if (did_circs_fail_last_period &&
  1446. n_circuit_failures > MAX_CIRCUIT_FAILURES) {
  1447. /* too many failed circs in a row. don't try. */
  1448. // log_fn(LOG_INFO,"%d failures so far, not trying.",n_circuit_failures);
  1449. return NULL;
  1450. }
  1451. /* try a circ. if it fails, circuit_mark_for_close will increment
  1452. * n_circuit_failures */
  1453. return circuit_establish_circuit(purpose, extend_info, flags);
  1454. }
  1455. /** Record another failure at opening a general circuit. When we have
  1456. * too many, we'll stop trying for the remainder of this minute.
  1457. */
  1458. static void
  1459. circuit_increment_failure_count(void)
  1460. {
  1461. ++n_circuit_failures;
  1462. log_debug(LD_CIRC,"n_circuit_failures now %d.",n_circuit_failures);
  1463. }
  1464. /** Reset the failure count for opening general circuits. This means
  1465. * we will try MAX_CIRCUIT_FAILURES times more (if necessary) before
  1466. * stopping again.
  1467. */
  1468. void
  1469. circuit_reset_failure_count(int timeout)
  1470. {
  1471. if (timeout && n_circuit_failures > MAX_CIRCUIT_FAILURES)
  1472. did_circs_fail_last_period = 1;
  1473. else
  1474. did_circs_fail_last_period = 0;
  1475. n_circuit_failures = 0;
  1476. }
  1477. /** Find an open circ that we're happy to use for <b>conn</b> and return 1. If
  1478. * there isn't one, and there isn't one on the way, launch one and return
  1479. * 0. If it will never work, return -1.
  1480. *
  1481. * Write the found or in-progress or launched circ into *circp.
  1482. */
  1483. static int
  1484. circuit_get_open_circ_or_launch(entry_connection_t *conn,
  1485. uint8_t desired_circuit_purpose,
  1486. origin_circuit_t **circp)
  1487. {
  1488. origin_circuit_t *circ;
  1489. int check_exit_policy;
  1490. int need_uptime, need_internal;
  1491. int want_onehop;
  1492. const or_options_t *options = get_options();
  1493. tor_assert(conn);
  1494. tor_assert(circp);
  1495. tor_assert(ENTRY_TO_CONN(conn)->state == AP_CONN_STATE_CIRCUIT_WAIT);
  1496. check_exit_policy =
  1497. conn->socks_request->command == SOCKS_COMMAND_CONNECT &&
  1498. !conn->use_begindir &&
  1499. !connection_edge_is_rendezvous_stream(ENTRY_TO_EDGE_CONN(conn));
  1500. want_onehop = conn->want_onehop;
  1501. need_uptime = !conn->want_onehop && !conn->use_begindir &&
  1502. smartlist_contains_int_as_string(options->LongLivedPorts,
  1503. conn->socks_request->port);
  1504. if (desired_circuit_purpose != CIRCUIT_PURPOSE_C_GENERAL)
  1505. need_internal = 1;
  1506. else if (conn->use_begindir || conn->want_onehop)
  1507. need_internal = 1;
  1508. else
  1509. need_internal = 0;
  1510. circ = circuit_get_best(conn, 1, desired_circuit_purpose,
  1511. need_uptime, need_internal);
  1512. if (circ) {
  1513. *circp = circ;
  1514. return 1; /* we're happy */
  1515. }
  1516. if (!want_onehop && !router_have_minimum_dir_info()) {
  1517. if (!connection_get_by_type(CONN_TYPE_DIR)) {
  1518. int severity = LOG_NOTICE;
  1519. /* FFFF if this is a tunneled directory fetch, don't yell
  1520. * as loudly. the user doesn't even know it's happening. */
  1521. if (entry_list_is_constrained(options) &&
  1522. entries_known_but_down(options)) {
  1523. log_fn(severity, LD_APP|LD_DIR,
  1524. "Application request when we haven't used client functionality "
  1525. "lately. Optimistically trying known %s again.",
  1526. options->UseBridges ? "bridges" : "entrynodes");
  1527. entries_retry_all(options);
  1528. } else if (!options->UseBridges || any_bridge_descriptors_known()) {
  1529. log_fn(severity, LD_APP|LD_DIR,
  1530. "Application request when we haven't used client functionality "
  1531. "lately. Optimistically trying directory fetches again.");
  1532. routerlist_retry_directory_downloads(time(NULL));
  1533. }
  1534. }
  1535. /* the stream will be dealt with when router_have_minimum_dir_info becomes
  1536. * 1, or when all directory attempts fail and directory_all_unreachable()
  1537. * kills it.
  1538. */
  1539. return 0;
  1540. }
  1541. /* Do we need to check exit policy? */
  1542. if (check_exit_policy) {
  1543. if (!conn->chosen_exit_name) {
  1544. struct in_addr in;
  1545. tor_addr_t addr, *addrp=NULL;
  1546. if (tor_inet_aton(conn->socks_request->address, &in)) {
  1547. tor_addr_from_in(&addr, &in);
  1548. addrp = &addr;
  1549. }
  1550. if (router_exit_policy_all_nodes_reject(addrp,
  1551. conn->socks_request->port,
  1552. need_uptime)) {
  1553. log_notice(LD_APP,
  1554. "No Tor server allows exit to %s:%d. Rejecting.",
  1555. safe_str_client(conn->socks_request->address),
  1556. conn->socks_request->port);
  1557. return -1;
  1558. }
  1559. } else {
  1560. /* XXXX024 Duplicates checks in connection_ap_handshake_attach_circuit:
  1561. * refactor into a single function? */
  1562. const node_t *node = node_get_by_nickname(conn->chosen_exit_name, 1);
  1563. int opt = conn->chosen_exit_optional;
  1564. if (node && !connection_ap_can_use_exit(conn, node)) {
  1565. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  1566. "Requested exit point '%s' is excluded or "
  1567. "would refuse request. %s.",
  1568. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  1569. if (opt) {
  1570. conn->chosen_exit_optional = 0;
  1571. tor_free(conn->chosen_exit_name);
  1572. /* Try again. */
  1573. return circuit_get_open_circ_or_launch(conn,
  1574. desired_circuit_purpose,
  1575. circp);
  1576. }
  1577. return -1;
  1578. }
  1579. }
  1580. }
  1581. /* is one already on the way? */
  1582. circ = circuit_get_best(conn, 0, desired_circuit_purpose,
  1583. need_uptime, need_internal);
  1584. if (circ)
  1585. log_debug(LD_CIRC, "one on the way!");
  1586. if (!circ) {
  1587. extend_info_t *extend_info=NULL;
  1588. uint8_t new_circ_purpose;
  1589. const int n_pending = count_pending_general_client_circuits();
  1590. if (n_pending >= options->MaxClientCircuitsPending) {
  1591. static ratelim_t delay_limit = RATELIM_INIT(10*60);
  1592. char *m;
  1593. if ((m = rate_limit_log(&delay_limit, approx_time()))) {
  1594. log_notice(LD_APP, "We'd like to launch a circuit to handle a "
  1595. "connection, but we already have %d general-purpose client "
  1596. "circuits pending. Waiting until some finish.%s",
  1597. n_pending, m);
  1598. tor_free(m);
  1599. }
  1600. return 0;
  1601. }
  1602. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT) {
  1603. /* need to pick an intro point */
  1604. rend_data_t *rend_data = ENTRY_TO_EDGE_CONN(conn)->rend_data;
  1605. tor_assert(rend_data);
  1606. extend_info = rend_client_get_random_intro(rend_data);
  1607. if (!extend_info) {
  1608. log_info(LD_REND,
  1609. "No intro points for '%s': re-fetching service descriptor.",
  1610. safe_str_client(rend_data->onion_address));
  1611. rend_client_refetch_v2_renddesc(rend_data);
  1612. ENTRY_TO_CONN(conn)->state = AP_CONN_STATE_RENDDESC_WAIT;
  1613. return 0;
  1614. }
  1615. log_info(LD_REND,"Chose %s as intro point for '%s'.",
  1616. extend_info_describe(extend_info),
  1617. safe_str_client(rend_data->onion_address));
  1618. }
  1619. /* If we have specified a particular exit node for our
  1620. * connection, then be sure to open a circuit to that exit node.
  1621. */
  1622. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_GENERAL) {
  1623. if (conn->chosen_exit_name) {
  1624. const node_t *r;
  1625. int opt = conn->chosen_exit_optional;
  1626. r = node_get_by_nickname(conn->chosen_exit_name, 1);
  1627. if (r && node_has_descriptor(r)) {
  1628. /* We might want to connect to an IPv6 bridge for loading
  1629. descriptors so we use the preferred address rather than
  1630. the primary. */
  1631. extend_info = extend_info_from_node(r, conn->want_onehop ? 1 : 0);
  1632. } else {
  1633. log_debug(LD_DIR, "considering %d, %s",
  1634. want_onehop, conn->chosen_exit_name);
  1635. if (want_onehop && conn->chosen_exit_name[0] == '$') {
  1636. /* We're asking for a one-hop circuit to a router that
  1637. * we don't have a routerinfo about. Make up an extend_info. */
  1638. char digest[DIGEST_LEN];
  1639. char *hexdigest = conn->chosen_exit_name+1;
  1640. tor_addr_t addr;
  1641. if (strlen(hexdigest) < HEX_DIGEST_LEN ||
  1642. base16_decode(digest,DIGEST_LEN,hexdigest,HEX_DIGEST_LEN)<0) {
  1643. log_info(LD_DIR, "Broken exit digest on tunnel conn. Closing.");
  1644. return -1;
  1645. }
  1646. if (tor_addr_parse(&addr, conn->socks_request->address) < 0) {
  1647. log_info(LD_DIR, "Broken address %s on tunnel conn. Closing.",
  1648. escaped_safe_str_client(conn->socks_request->address));
  1649. return -1;
  1650. }
  1651. extend_info = extend_info_new(conn->chosen_exit_name+1,
  1652. digest, NULL, NULL, &addr,
  1653. conn->socks_request->port);
  1654. } else {
  1655. /* We will need an onion key for the router, and we
  1656. * don't have one. Refuse or relax requirements. */
  1657. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  1658. "Requested exit point '%s' is not known. %s.",
  1659. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  1660. if (opt) {
  1661. conn->chosen_exit_optional = 0;
  1662. tor_free(conn->chosen_exit_name);
  1663. /* Try again with no requested exit */
  1664. return circuit_get_open_circ_or_launch(conn,
  1665. desired_circuit_purpose,
  1666. circp);
  1667. }
  1668. return -1;
  1669. }
  1670. }
  1671. }
  1672. }
  1673. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_REND_JOINED)
  1674. new_circ_purpose = CIRCUIT_PURPOSE_C_ESTABLISH_REND;
  1675. else if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT)
  1676. new_circ_purpose = CIRCUIT_PURPOSE_C_INTRODUCING;
  1677. else
  1678. new_circ_purpose = desired_circuit_purpose;
  1679. if (options->Tor2webMode &&
  1680. (new_circ_purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND ||
  1681. new_circ_purpose == CIRCUIT_PURPOSE_C_INTRODUCING)) {
  1682. want_onehop = 1;
  1683. }
  1684. {
  1685. int flags = CIRCLAUNCH_NEED_CAPACITY;
  1686. if (want_onehop) flags |= CIRCLAUNCH_ONEHOP_TUNNEL;
  1687. if (need_uptime) flags |= CIRCLAUNCH_NEED_UPTIME;
  1688. if (need_internal) flags |= CIRCLAUNCH_IS_INTERNAL;
  1689. circ = circuit_launch_by_extend_info(new_circ_purpose, extend_info,
  1690. flags);
  1691. }
  1692. extend_info_free(extend_info);
  1693. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_GENERAL) {
  1694. /* We just caused a circuit to get built because of this stream.
  1695. * If this stream has caused a _lot_ of circuits to be built, that's
  1696. * a bad sign: we should tell the user. */
  1697. if (conn->num_circuits_launched < NUM_CIRCUITS_LAUNCHED_THRESHOLD &&
  1698. ++conn->num_circuits_launched == NUM_CIRCUITS_LAUNCHED_THRESHOLD)
  1699. log_info(LD_CIRC, "The application request to %s:%d has launched "
  1700. "%d circuits without finding one it likes.",
  1701. escaped_safe_str_client(conn->socks_request->address),
  1702. conn->socks_request->port,
  1703. conn->num_circuits_launched);
  1704. } else {
  1705. /* help predict this next time */
  1706. rep_hist_note_used_internal(time(NULL), need_uptime, 1);
  1707. if (circ) {
  1708. /* write the service_id into circ */
  1709. circ->rend_data = rend_data_dup(ENTRY_TO_EDGE_CONN(conn)->rend_data);
  1710. if (circ->base_.purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND &&
  1711. circ->base_.state == CIRCUIT_STATE_OPEN)
  1712. rend_client_rendcirc_has_opened(circ);
  1713. }
  1714. }
  1715. } /* endif (!circ) */
  1716. if (circ) {
  1717. /* Mark the circuit with the isolation fields for this connection.
  1718. * When the circuit arrives, we'll clear these flags: this is
  1719. * just some internal bookkeeping to make sure that we have
  1720. * launched enough circuits.
  1721. */
  1722. connection_edge_update_circuit_isolation(conn, circ, 0);
  1723. } else {
  1724. log_info(LD_APP,
  1725. "No safe circuit (purpose %d) ready for edge "
  1726. "connection; delaying.",
  1727. desired_circuit_purpose);
  1728. }
  1729. *circp = circ;
  1730. return 0;
  1731. }
  1732. /** Return true iff <b>crypt_path</b> is one of the crypt_paths for
  1733. * <b>circ</b>. */
  1734. static int
  1735. cpath_is_on_circuit(origin_circuit_t *circ, crypt_path_t *crypt_path)
  1736. {
  1737. crypt_path_t *cpath, *cpath_next = NULL;
  1738. for (cpath = circ->cpath; cpath_next != circ->cpath; cpath = cpath_next) {
  1739. cpath_next = cpath->next;
  1740. if (crypt_path == cpath)
  1741. return 1;
  1742. }
  1743. return 0;
  1744. }
  1745. /** Return true iff client-side optimistic data is supported. */
  1746. static int
  1747. optimistic_data_enabled(void)
  1748. {
  1749. const or_options_t *options = get_options();
  1750. if (options->OptimisticData < 0) {
  1751. /* XXX023 consider having auto default to 1 rather than 0 before
  1752. * the 0.2.3 branch goes stable. See bug 3617. -RD */
  1753. const int32_t enabled =
  1754. networkstatus_get_param(NULL, "UseOptimisticData", 0, 0, 1);
  1755. return (int)enabled;
  1756. }
  1757. return options->OptimisticData;
  1758. }
  1759. /** Attach the AP stream <b>apconn</b> to circ's linked list of
  1760. * p_streams. Also set apconn's cpath_layer to <b>cpath</b>, or to the last
  1761. * hop in circ's cpath if <b>cpath</b> is NULL.
  1762. */
  1763. static void
  1764. link_apconn_to_circ(entry_connection_t *apconn, origin_circuit_t *circ,
  1765. crypt_path_t *cpath)
  1766. {
  1767. const node_t *exitnode;
  1768. /* add it into the linked list of streams on this circuit */
  1769. log_debug(LD_APP|LD_CIRC, "attaching new conn to circ. n_circ_id %u.",
  1770. (unsigned)circ->base_.n_circ_id);
  1771. /* reset it, so we can measure circ timeouts */
  1772. ENTRY_TO_CONN(apconn)->timestamp_lastread = time(NULL);
  1773. ENTRY_TO_EDGE_CONN(apconn)->next_stream = circ->p_streams;
  1774. ENTRY_TO_EDGE_CONN(apconn)->on_circuit = TO_CIRCUIT(circ);
  1775. /* assert_connection_ok(conn, time(NULL)); */
  1776. circ->p_streams = ENTRY_TO_EDGE_CONN(apconn);
  1777. if (connection_edge_is_rendezvous_stream(ENTRY_TO_EDGE_CONN(apconn))) {
  1778. /* We are attaching a stream to a rendezvous circuit. That means
  1779. * that an attempt to connect to a hidden service just
  1780. * succeeded. Tell rendclient.c. */
  1781. rend_client_note_connection_attempt_ended(
  1782. ENTRY_TO_EDGE_CONN(apconn)->rend_data->onion_address);
  1783. }
  1784. if (cpath) { /* we were given one; use it */
  1785. tor_assert(cpath_is_on_circuit(circ, cpath));
  1786. } else {
  1787. /* use the last hop in the circuit */
  1788. tor_assert(circ->cpath);
  1789. tor_assert(circ->cpath->prev);
  1790. tor_assert(circ->cpath->prev->state == CPATH_STATE_OPEN);
  1791. cpath = circ->cpath->prev;
  1792. }
  1793. ENTRY_TO_EDGE_CONN(apconn)->cpath_layer = cpath;
  1794. circ->isolation_any_streams_attached = 1;
  1795. connection_edge_update_circuit_isolation(apconn, circ, 0);
  1796. /* See if we can use optimistic data on this circuit */
  1797. if (cpath->extend_info &&
  1798. (exitnode = node_get_by_id(cpath->extend_info->identity_digest)) &&
  1799. exitnode->rs) {
  1800. /* Okay; we know what exit node this is. */
  1801. if (optimistic_data_enabled() &&
  1802. circ->base_.purpose == CIRCUIT_PURPOSE_C_GENERAL &&
  1803. exitnode->rs->version_supports_optimistic_data)
  1804. apconn->may_use_optimistic_data = 1;
  1805. else
  1806. apconn->may_use_optimistic_data = 0;
  1807. log_info(LD_APP, "Looks like completed circuit to %s %s allow "
  1808. "optimistic data for connection to %s",
  1809. safe_str_client(node_describe(exitnode)),
  1810. apconn->may_use_optimistic_data ? "does" : "doesn't",
  1811. safe_str_client(apconn->socks_request->address));
  1812. }
  1813. }
  1814. /** Return true iff <b>address</b> is matched by one of the entries in
  1815. * TrackHostExits. */
  1816. int
  1817. hostname_in_track_host_exits(const or_options_t *options, const char *address)
  1818. {
  1819. if (!options->TrackHostExits)
  1820. return 0;
  1821. SMARTLIST_FOREACH_BEGIN(options->TrackHostExits, const char *, cp) {
  1822. if (cp[0] == '.') { /* match end */
  1823. if (cp[1] == '\0' ||
  1824. !strcasecmpend(address, cp) ||
  1825. !strcasecmp(address, &cp[1]))
  1826. return 1;
  1827. } else if (strcasecmp(cp, address) == 0) {
  1828. return 1;
  1829. }
  1830. } SMARTLIST_FOREACH_END(cp);
  1831. return 0;
  1832. }
  1833. /** If an exit wasn't explicitly specified for <b>conn</b>, consider saving
  1834. * the exit that we *did* choose for use by future connections to
  1835. * <b>conn</b>'s destination.
  1836. */
  1837. static void
  1838. consider_recording_trackhost(const entry_connection_t *conn,
  1839. const origin_circuit_t *circ)
  1840. {
  1841. const or_options_t *options = get_options();
  1842. char *new_address = NULL;
  1843. char fp[HEX_DIGEST_LEN+1];
  1844. /* Search the addressmap for this conn's destination. */
  1845. /* If he's not in the address map.. */
  1846. if (!options->TrackHostExits ||
  1847. addressmap_have_mapping(conn->socks_request->address,
  1848. options->TrackHostExitsExpire))
  1849. return; /* nothing to track, or already mapped */
  1850. if (!hostname_in_track_host_exits(options, conn->socks_request->address) ||
  1851. !circ->build_state->chosen_exit)
  1852. return;
  1853. /* write down the fingerprint of the chosen exit, not the nickname,
  1854. * because the chosen exit might not be named. */
  1855. base16_encode(fp, sizeof(fp),
  1856. circ->build_state->chosen_exit->identity_digest, DIGEST_LEN);
  1857. /* Add this exit/hostname pair to the addressmap. */
  1858. tor_asprintf(&new_address, "%s.%s.exit",
  1859. conn->socks_request->address, fp);
  1860. addressmap_register(conn->socks_request->address, new_address,
  1861. time(NULL) + options->TrackHostExitsExpire,
  1862. ADDRMAPSRC_TRACKEXIT, 0, 0);
  1863. }
  1864. /** Attempt to attach the connection <b>conn</b> to <b>circ</b>, and send a
  1865. * begin or resolve cell as appropriate. Return values are as for
  1866. * connection_ap_handshake_attach_circuit. The stream will exit from the hop
  1867. * indicated by <b>cpath</b>, or from the last hop in circ's cpath if
  1868. * <b>cpath</b> is NULL. */
  1869. int
  1870. connection_ap_handshake_attach_chosen_circuit(entry_connection_t *conn,
  1871. origin_circuit_t *circ,
  1872. crypt_path_t *cpath)
  1873. {
  1874. connection_t *base_conn = ENTRY_TO_CONN(conn);
  1875. tor_assert(conn);
  1876. tor_assert(base_conn->state == AP_CONN_STATE_CIRCUIT_WAIT ||
  1877. base_conn->state == AP_CONN_STATE_CONTROLLER_WAIT);
  1878. tor_assert(conn->socks_request);
  1879. tor_assert(circ);
  1880. tor_assert(circ->base_.state == CIRCUIT_STATE_OPEN);
  1881. base_conn->state = AP_CONN_STATE_CIRCUIT_WAIT;
  1882. if (!circ->base_.timestamp_dirty)
  1883. circ->base_.timestamp_dirty = time(NULL);
  1884. pathbias_count_use_attempt(circ);
  1885. link_apconn_to_circ(conn, circ, cpath);
  1886. tor_assert(conn->socks_request);
  1887. if (conn->socks_request->command == SOCKS_COMMAND_CONNECT) {
  1888. if (!conn->use_begindir)
  1889. consider_recording_trackhost(conn, circ);
  1890. if (connection_ap_handshake_send_begin(conn) < 0)
  1891. return -1;
  1892. } else {
  1893. if (connection_ap_handshake_send_resolve(conn) < 0)
  1894. return -1;
  1895. }
  1896. return 1;
  1897. }
  1898. /** Try to find a safe live circuit for CONN_TYPE_AP connection conn. If
  1899. * we don't find one: if conn cannot be handled by any known nodes,
  1900. * warn and return -1 (conn needs to die, and is maybe already marked);
  1901. * else launch new circuit (if necessary) and return 0.
  1902. * Otherwise, associate conn with a safe live circuit, do the
  1903. * right next step, and return 1.
  1904. */
  1905. /* XXXX this function should mark for close whenever it returns -1;
  1906. * its callers shouldn't have to worry about that. */
  1907. int
  1908. connection_ap_handshake_attach_circuit(entry_connection_t *conn)
  1909. {
  1910. connection_t *base_conn = ENTRY_TO_CONN(conn);
  1911. int retval;
  1912. int conn_age;
  1913. int want_onehop;
  1914. tor_assert(conn);
  1915. tor_assert(base_conn->state == AP_CONN_STATE_CIRCUIT_WAIT);
  1916. tor_assert(conn->socks_request);
  1917. want_onehop = conn->want_onehop;
  1918. conn_age = (int)(time(NULL) - base_conn->timestamp_created);
  1919. if (conn_age >= get_options()->SocksTimeout) {
  1920. int severity = (tor_addr_is_null(&base_conn->addr) && !base_conn->port) ?
  1921. LOG_INFO : LOG_NOTICE;
  1922. log_fn(severity, LD_APP,
  1923. "Tried for %d seconds to get a connection to %s:%d. Giving up.",
  1924. conn_age, safe_str_client(conn->socks_request->address),
  1925. conn->socks_request->port);
  1926. return -1;
  1927. }
  1928. if (!connection_edge_is_rendezvous_stream(ENTRY_TO_EDGE_CONN(conn))) {
  1929. /* we're a general conn */
  1930. origin_circuit_t *circ=NULL;
  1931. if (conn->chosen_exit_name) {
  1932. const node_t *node = node_get_by_nickname(conn->chosen_exit_name, 1);
  1933. int opt = conn->chosen_exit_optional;
  1934. if (!node && !want_onehop) {
  1935. /* We ran into this warning when trying to extend a circuit to a
  1936. * hidden service directory for which we didn't have a router
  1937. * descriptor. See flyspray task 767 for more details. We should
  1938. * keep this in mind when deciding to use BEGIN_DIR cells for other
  1939. * directory requests as well. -KL*/
  1940. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  1941. "Requested exit point '%s' is not known. %s.",
  1942. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  1943. if (opt) {
  1944. conn->chosen_exit_optional = 0;
  1945. tor_free(conn->chosen_exit_name);
  1946. return 0;
  1947. }
  1948. return -1;
  1949. }
  1950. if (node && !connection_ap_can_use_exit(conn, node)) {
  1951. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  1952. "Requested exit point '%s' is excluded or "
  1953. "would refuse request. %s.",
  1954. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  1955. if (opt) {
  1956. conn->chosen_exit_optional = 0;
  1957. tor_free(conn->chosen_exit_name);
  1958. return 0;
  1959. }
  1960. return -1;
  1961. }
  1962. }
  1963. /* find the circuit that we should use, if there is one. */
  1964. retval = circuit_get_open_circ_or_launch(
  1965. conn, CIRCUIT_PURPOSE_C_GENERAL, &circ);
  1966. if (retval < 1) // XXX023 if we totally fail, this still returns 0 -RD
  1967. return retval;
  1968. log_debug(LD_APP|LD_CIRC,
  1969. "Attaching apconn to circ %u (stream %d sec old).",
  1970. (unsigned)circ->base_.n_circ_id, conn_age);
  1971. /* print the circ's path, so people can figure out which circs are
  1972. * sucking. */
  1973. circuit_log_path(LOG_INFO,LD_APP|LD_CIRC,circ);
  1974. /* We have found a suitable circuit for our conn. Hurray. */
  1975. return connection_ap_handshake_attach_chosen_circuit(conn, circ, NULL);
  1976. } else { /* we're a rendezvous conn */
  1977. origin_circuit_t *rendcirc=NULL, *introcirc=NULL;
  1978. tor_assert(!ENTRY_TO_EDGE_CONN(conn)->cpath_layer);
  1979. /* start by finding a rendezvous circuit for us */
  1980. retval = circuit_get_open_circ_or_launch(
  1981. conn, CIRCUIT_PURPOSE_C_REND_JOINED, &rendcirc);
  1982. if (retval < 0) return -1; /* failed */
  1983. if (retval > 0) {
  1984. tor_assert(rendcirc);
  1985. /* one is already established, attach */
  1986. log_info(LD_REND,
  1987. "rend joined circ %d already here. attaching. "
  1988. "(stream %d sec old)",
  1989. (unsigned)rendcirc->base_.n_circ_id, conn_age);
  1990. /* Mark rendezvous circuits as 'newly dirty' every time you use
  1991. * them, since the process of rebuilding a rendezvous circ is so
  1992. * expensive. There is a tradeoff between linkability and
  1993. * feasibility, at this point.
  1994. */
  1995. rendcirc->base_.timestamp_dirty = time(NULL);
  1996. /* We've also attempted to use them. If they fail, we need to
  1997. * probe them for path bias */
  1998. pathbias_count_use_attempt(rendcirc);
  1999. link_apconn_to_circ(conn, rendcirc, NULL);
  2000. if (connection_ap_handshake_send_begin(conn) < 0)
  2001. return 0; /* already marked, let them fade away */
  2002. return 1;
  2003. }
  2004. if (rendcirc && (rendcirc->base_.purpose ==
  2005. CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED)) {
  2006. log_info(LD_REND,
  2007. "pending-join circ %u already here, with intro ack. "
  2008. "Stalling. (stream %d sec old)",
  2009. (unsigned)rendcirc->base_.n_circ_id, conn_age);
  2010. return 0;
  2011. }
  2012. /* it's on its way. find an intro circ. */
  2013. retval = circuit_get_open_circ_or_launch(
  2014. conn, CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT, &introcirc);
  2015. if (retval < 0) return -1; /* failed */
  2016. if (retval > 0) {
  2017. /* one has already sent the intro. keep waiting. */
  2018. tor_assert(introcirc);
  2019. log_info(LD_REND, "Intro circ %u present and awaiting ack (rend %u). "
  2020. "Stalling. (stream %d sec old)",
  2021. (unsigned)introcirc->base_.n_circ_id,
  2022. rendcirc ? (unsigned)rendcirc->base_.n_circ_id : 0,
  2023. conn_age);
  2024. return 0;
  2025. }
  2026. /* now rendcirc and introcirc are each either undefined or not finished */
  2027. if (rendcirc && introcirc &&
  2028. rendcirc->base_.purpose == CIRCUIT_PURPOSE_C_REND_READY) {
  2029. log_info(LD_REND,
  2030. "ready rend circ %u already here (no intro-ack yet on "
  2031. "intro %u). (stream %d sec old)",
  2032. (unsigned)rendcirc->base_.n_circ_id,
  2033. (unsigned)introcirc->base_.n_circ_id, conn_age);
  2034. tor_assert(introcirc->base_.purpose == CIRCUIT_PURPOSE_C_INTRODUCING);
  2035. if (introcirc->base_.state == CIRCUIT_STATE_OPEN) {
  2036. log_info(LD_REND,"found open intro circ %u (rend %u); sending "
  2037. "introduction. (stream %d sec old)",
  2038. (unsigned)introcirc->base_.n_circ_id,
  2039. (unsigned)rendcirc->base_.n_circ_id,
  2040. conn_age);
  2041. switch (rend_client_send_introduction(introcirc, rendcirc)) {
  2042. case 0: /* success */
  2043. rendcirc->base_.timestamp_dirty = time(NULL);
  2044. introcirc->base_.timestamp_dirty = time(NULL);
  2045. pathbias_count_use_attempt(introcirc);
  2046. pathbias_count_use_attempt(rendcirc);
  2047. assert_circuit_ok(TO_CIRCUIT(rendcirc));
  2048. assert_circuit_ok(TO_CIRCUIT(introcirc));
  2049. return 0;
  2050. case -1: /* transient error */
  2051. return 0;
  2052. case -2: /* permanent error */
  2053. return -1;
  2054. default: /* oops */
  2055. tor_fragile_assert();
  2056. return -1;
  2057. }
  2058. }
  2059. }
  2060. log_info(LD_REND, "Intro (%u) and rend (%u) circs are not both ready. "
  2061. "Stalling conn. (%d sec old)",
  2062. introcirc ? (unsigned)introcirc->base_.n_circ_id : 0,
  2063. rendcirc ? (unsigned)rendcirc->base_.n_circ_id : 0, conn_age);
  2064. return 0;
  2065. }
  2066. }
  2067. /** Change <b>circ</b>'s purpose to <b>new_purpose</b>. */
  2068. void
  2069. circuit_change_purpose(circuit_t *circ, uint8_t new_purpose)
  2070. {
  2071. uint8_t old_purpose;
  2072. /* Don't allow an OR circ to become an origin circ or vice versa. */
  2073. tor_assert(!!(CIRCUIT_IS_ORIGIN(circ)) ==
  2074. !!(CIRCUIT_PURPOSE_IS_ORIGIN(new_purpose)));
  2075. if (circ->purpose == new_purpose) return;
  2076. if (CIRCUIT_IS_ORIGIN(circ)) {
  2077. char old_purpose_desc[80] = "";
  2078. strncpy(old_purpose_desc, circuit_purpose_to_string(circ->purpose), 80-1);
  2079. old_purpose_desc[80-1] = '\0';
  2080. log_debug(LD_CIRC,
  2081. "changing purpose of origin circ %d "
  2082. "from \"%s\" (%d) to \"%s\" (%d)",
  2083. TO_ORIGIN_CIRCUIT(circ)->global_identifier,
  2084. old_purpose_desc,
  2085. circ->purpose,
  2086. circuit_purpose_to_string(new_purpose),
  2087. new_purpose);
  2088. }
  2089. old_purpose = circ->purpose;
  2090. circ->purpose = new_purpose;
  2091. if (CIRCUIT_IS_ORIGIN(circ)) {
  2092. control_event_circuit_purpose_changed(TO_ORIGIN_CIRCUIT(circ),
  2093. old_purpose);
  2094. }
  2095. }
  2096. /** Mark <b>circ</b> so that no more connections can be attached to it. */
  2097. void
  2098. mark_circuit_unusable_for_new_conns(origin_circuit_t *circ)
  2099. {
  2100. const or_options_t *options = get_options();
  2101. tor_assert(circ);
  2102. /* XXXX025 This is a kludge; we're only keeping it around in case there's
  2103. * something that doesn't check unusable_for_new_conns, and to avoid
  2104. * deeper refactoring of our expiration logic. */
  2105. if (! circ->base_.timestamp_dirty)
  2106. circ->base_.timestamp_dirty = approx_time();
  2107. if (options->MaxCircuitDirtiness >= circ->base_.timestamp_dirty)
  2108. circ->base_.timestamp_dirty = 1; /* prevent underflow */
  2109. else
  2110. circ->base_.timestamp_dirty -= options->MaxCircuitDirtiness;
  2111. circ->unusable_for_new_conns = 1;
  2112. }