circuituse.c 105 KB

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