circuituse.c 102 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680
  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. */
  740. void
  741. circuit_log_ancient_one_hop_circuits(int age)
  742. {
  743. #define MAX_ANCIENT_ONEHOP_CIRCUITS_TO_LOG 10
  744. time_t now = time(NULL);
  745. time_t cutoff = now - age;
  746. int n_found = 0;
  747. smartlist_t *log_these = smartlist_new();
  748. SMARTLIST_FOREACH_BEGIN(circuit_get_global_list(), circuit_t *, circ) {
  749. const origin_circuit_t *ocirc;
  750. if (! CIRCUIT_IS_ORIGIN(circ))
  751. continue;
  752. if (circ->timestamp_created.tv_sec >= cutoff)
  753. continue;
  754. ocirc = CONST_TO_ORIGIN_CIRCUIT(circ);
  755. if (ocirc->build_state && ocirc->build_state->onehop_tunnel) {
  756. ++n_found;
  757. if (smartlist_len(log_these) < MAX_ANCIENT_ONEHOP_CIRCUITS_TO_LOG)
  758. smartlist_add(log_these, (origin_circuit_t*) ocirc);
  759. }
  760. }
  761. SMARTLIST_FOREACH_END(circ);
  762. if (n_found == 0)
  763. goto done;
  764. log_notice(LD_HEARTBEAT,
  765. "Diagnostic for issue 8387: Found %d one-hop circuits more "
  766. "than %d seconds old! Logging %d...",
  767. n_found, age, smartlist_len(log_these));
  768. SMARTLIST_FOREACH_BEGIN(log_these, const origin_circuit_t *, ocirc) {
  769. char created[ISO_TIME_LEN+1];
  770. int stream_num;
  771. const edge_connection_t *conn;
  772. char *dirty = NULL;
  773. const circuit_t *circ = TO_CIRCUIT(ocirc);
  774. format_local_iso_time(created,
  775. (time_t)circ->timestamp_created.tv_sec);
  776. if (circ->timestamp_dirty) {
  777. char dirty_since[ISO_TIME_LEN+1];
  778. format_local_iso_time(dirty_since, circ->timestamp_dirty);
  779. tor_asprintf(&dirty, "Dirty since %s (%ld seconds vs %ld-second cutoff)",
  780. dirty_since, (long)(now - circ->timestamp_dirty),
  781. (long) get_options()->MaxCircuitDirtiness);
  782. } else {
  783. dirty = tor_strdup("Not marked dirty");
  784. }
  785. log_notice(LD_HEARTBEAT, " #%d created at %s. %s, %s. %s for close. "
  786. "Package window: %d. "
  787. "%s for new conns. %s.",
  788. ocirc_sl_idx,
  789. created,
  790. circuit_state_to_string(circ->state),
  791. circuit_purpose_to_string(circ->purpose),
  792. circ->marked_for_close ? "Marked" : "Not marked",
  793. circ->package_window,
  794. ocirc->unusable_for_new_conns ? "Not usable" : "usable",
  795. dirty);
  796. tor_free(dirty);
  797. stream_num = 0;
  798. for (conn = ocirc->p_streams; conn; conn = conn->next_stream) {
  799. const connection_t *c = TO_CONN(conn);
  800. char stream_created[ISO_TIME_LEN+1];
  801. if (++stream_num >= 5)
  802. break;
  803. format_local_iso_time(stream_created, c->timestamp_created);
  804. log_notice(LD_HEARTBEAT, " Stream#%d created at %s. "
  805. "%s conn in state %s. "
  806. "It is %slinked and %sreading from a linked connection %p. "
  807. "Package window %d. "
  808. "%s for close (%s:%d). Hold-open is %sset. "
  809. "Has %ssent RELAY_END. %s on circuit.",
  810. stream_num,
  811. stream_created,
  812. conn_type_to_string(c->type),
  813. conn_state_to_string(c->type, c->state),
  814. c->linked ? "" : "not ",
  815. c->reading_from_linked_conn ? "": "not",
  816. c->linked_conn,
  817. conn->package_window,
  818. c->marked_for_close ? "Marked" : "Not marked",
  819. c->marked_for_close_file ? c->marked_for_close_file : "--",
  820. c->marked_for_close,
  821. c->hold_open_until_flushed ? "" : "not ",
  822. conn->edge_has_sent_end ? "" : "not ",
  823. conn->edge_blocked_on_circ ? "Blocked" : "Not blocked");
  824. if (! c->linked_conn)
  825. continue;
  826. c = c->linked_conn;
  827. log_notice(LD_HEARTBEAT, " Linked to %s connection in state %s "
  828. "(Purpose %d). %s for close (%s:%d). Hold-open is %sset. ",
  829. conn_type_to_string(c->type),
  830. conn_state_to_string(c->type, c->state),
  831. c->purpose,
  832. c->marked_for_close ? "Marked" : "Not marked",
  833. c->marked_for_close_file ? c->marked_for_close_file : "--",
  834. c->marked_for_close,
  835. c->hold_open_until_flushed ? "" : "not ");
  836. }
  837. } SMARTLIST_FOREACH_END(ocirc);
  838. log_notice(LD_HEARTBEAT, "It has been %ld seconds since I last called "
  839. "circuit_expire_old_circuits_clientside().",
  840. (long)(now - last_expired_clientside_circuits));
  841. done:
  842. smartlist_free(log_these);
  843. }
  844. /** Remove any elements in <b>needed_ports</b> that are handled by an
  845. * open or in-progress circuit.
  846. */
  847. void
  848. circuit_remove_handled_ports(smartlist_t *needed_ports)
  849. {
  850. int i;
  851. uint16_t *port;
  852. for (i = 0; i < smartlist_len(needed_ports); ++i) {
  853. port = smartlist_get(needed_ports, i);
  854. tor_assert(*port);
  855. if (circuit_stream_is_being_handled(NULL, *port,
  856. MIN_CIRCUITS_HANDLING_STREAM)) {
  857. // log_debug(LD_CIRC,"Port %d is already being handled; removing.", port);
  858. smartlist_del(needed_ports, i--);
  859. tor_free(port);
  860. } else {
  861. log_debug(LD_CIRC,"Port %d is not handled.", *port);
  862. }
  863. }
  864. }
  865. /** Return 1 if at least <b>min</b> general-purpose non-internal circuits
  866. * will have an acceptable exit node for exit stream <b>conn</b> if it
  867. * is defined, else for "*:port".
  868. * Else return 0.
  869. */
  870. int
  871. circuit_stream_is_being_handled(entry_connection_t *conn,
  872. uint16_t port, int min)
  873. {
  874. const node_t *exitnode;
  875. int num=0;
  876. time_t now = time(NULL);
  877. int need_uptime = smartlist_contains_int_as_string(
  878. get_options()->LongLivedPorts,
  879. conn ? conn->socks_request->port : port);
  880. SMARTLIST_FOREACH_BEGIN(circuit_get_global_list(), circuit_t *, circ) {
  881. if (CIRCUIT_IS_ORIGIN(circ) &&
  882. !circ->marked_for_close &&
  883. circ->purpose == CIRCUIT_PURPOSE_C_GENERAL &&
  884. (!circ->timestamp_dirty ||
  885. circ->timestamp_dirty + get_options()->MaxCircuitDirtiness > now)) {
  886. origin_circuit_t *origin_circ = TO_ORIGIN_CIRCUIT(circ);
  887. cpath_build_state_t *build_state = origin_circ->build_state;
  888. if (build_state->is_internal || build_state->onehop_tunnel)
  889. continue;
  890. if (origin_circ->unusable_for_new_conns)
  891. continue;
  892. exitnode = build_state_get_exit_node(build_state);
  893. if (exitnode && (!need_uptime || build_state->need_uptime)) {
  894. int ok;
  895. if (conn) {
  896. ok = connection_ap_can_use_exit(conn, exitnode);
  897. } else {
  898. addr_policy_result_t r;
  899. r = compare_tor_addr_to_node_policy(NULL, port, exitnode);
  900. ok = r != ADDR_POLICY_REJECTED && r != ADDR_POLICY_PROBABLY_REJECTED;
  901. }
  902. if (ok) {
  903. if (++num >= min)
  904. return 1;
  905. }
  906. }
  907. }
  908. }
  909. SMARTLIST_FOREACH_END(circ);
  910. return 0;
  911. }
  912. /** Don't keep more than this many unused open circuits around. */
  913. #define MAX_UNUSED_OPEN_CIRCUITS 14
  914. /** Figure out how many circuits we have open that are clean. Make
  915. * sure it's enough for all the upcoming behaviors we predict we'll have.
  916. * But put an upper bound on the total number of circuits.
  917. */
  918. static void
  919. circuit_predict_and_launch_new(void)
  920. {
  921. int num=0, num_internal=0, num_uptime_internal=0;
  922. int hidserv_needs_uptime=0, hidserv_needs_capacity=1;
  923. int port_needs_uptime=0, port_needs_capacity=1;
  924. time_t now = time(NULL);
  925. int flags = 0;
  926. /* First, count how many of each type of circuit we have already. */
  927. SMARTLIST_FOREACH_BEGIN(circuit_get_global_list(), circuit_t *, circ) {
  928. cpath_build_state_t *build_state;
  929. origin_circuit_t *origin_circ;
  930. if (!CIRCUIT_IS_ORIGIN(circ))
  931. continue;
  932. if (circ->marked_for_close)
  933. continue; /* don't mess with marked circs */
  934. if (circ->timestamp_dirty)
  935. continue; /* only count clean circs */
  936. if (circ->purpose != CIRCUIT_PURPOSE_C_GENERAL)
  937. continue; /* only pay attention to general-purpose circs */
  938. origin_circ = TO_ORIGIN_CIRCUIT(circ);
  939. if (origin_circ->unusable_for_new_conns)
  940. continue;
  941. build_state = origin_circ->build_state;
  942. if (build_state->onehop_tunnel)
  943. continue;
  944. num++;
  945. if (build_state->is_internal)
  946. num_internal++;
  947. if (build_state->need_uptime && build_state->is_internal)
  948. num_uptime_internal++;
  949. }
  950. SMARTLIST_FOREACH_END(circ);
  951. /* If that's enough, then stop now. */
  952. if (num >= MAX_UNUSED_OPEN_CIRCUITS)
  953. return; /* we already have many, making more probably will hurt */
  954. /* Second, see if we need any more exit circuits. */
  955. /* check if we know of a port that's been requested recently
  956. * and no circuit is currently available that can handle it.
  957. * Exits (obviously) require an exit circuit. */
  958. if (!circuit_all_predicted_ports_handled(now, &port_needs_uptime,
  959. &port_needs_capacity)
  960. && router_have_consensus_path() == CONSENSUS_PATH_EXIT) {
  961. if (port_needs_uptime)
  962. flags |= CIRCLAUNCH_NEED_UPTIME;
  963. if (port_needs_capacity)
  964. flags |= CIRCLAUNCH_NEED_CAPACITY;
  965. log_info(LD_CIRC,
  966. "Have %d clean circs (%d internal), need another exit circ.",
  967. num, num_internal);
  968. circuit_launch(CIRCUIT_PURPOSE_C_GENERAL, flags);
  969. return;
  970. }
  971. /* Third, see if we need any more hidden service (server) circuits.
  972. * HS servers only need an internal circuit. */
  973. if (num_rend_services() && num_uptime_internal < 3
  974. && router_have_consensus_path() != CONSENSUS_PATH_UNKNOWN) {
  975. flags = (CIRCLAUNCH_NEED_CAPACITY | CIRCLAUNCH_NEED_UPTIME |
  976. CIRCLAUNCH_IS_INTERNAL);
  977. log_info(LD_CIRC,
  978. "Have %d clean circs (%d internal), need another internal "
  979. "circ for my hidden service.",
  980. num, num_internal);
  981. circuit_launch(CIRCUIT_PURPOSE_C_GENERAL, flags);
  982. return;
  983. }
  984. /* Fourth, see if we need any more hidden service (client) circuits.
  985. * HS clients only need an internal circuit. */
  986. if (rep_hist_get_predicted_internal(now, &hidserv_needs_uptime,
  987. &hidserv_needs_capacity) &&
  988. ((num_uptime_internal<2 && hidserv_needs_uptime) ||
  989. num_internal<3)
  990. && router_have_consensus_path() != CONSENSUS_PATH_UNKNOWN) {
  991. if (hidserv_needs_uptime)
  992. flags |= CIRCLAUNCH_NEED_UPTIME;
  993. if (hidserv_needs_capacity)
  994. flags |= CIRCLAUNCH_NEED_CAPACITY;
  995. flags |= CIRCLAUNCH_IS_INTERNAL;
  996. log_info(LD_CIRC,
  997. "Have %d clean circs (%d uptime-internal, %d internal), need"
  998. " another hidden service circ.",
  999. num, num_uptime_internal, num_internal);
  1000. circuit_launch(CIRCUIT_PURPOSE_C_GENERAL, flags);
  1001. return;
  1002. }
  1003. /* Finally, check to see if we still need more circuits to learn
  1004. * a good build timeout. But if we're close to our max number we
  1005. * want, don't do another -- we want to leave a few slots open so
  1006. * we can still build circuits preemptively as needed.
  1007. * XXXX make the assumption that build timeout streams should be
  1008. * created whenever we can build internal circuits. */
  1009. if (router_have_consensus_path() != CONSENSUS_PATH_UNKNOWN) {
  1010. if (num < MAX_UNUSED_OPEN_CIRCUITS-2 &&
  1011. ! circuit_build_times_disabled() &&
  1012. circuit_build_times_needs_circuits_now(get_circuit_build_times())) {
  1013. flags = CIRCLAUNCH_NEED_CAPACITY;
  1014. /* if there are no exits in the consensus, make timeout
  1015. * circuits internal */
  1016. if (router_have_consensus_path() == CONSENSUS_PATH_INTERNAL)
  1017. flags |= CIRCLAUNCH_IS_INTERNAL;
  1018. log_info(LD_CIRC,
  1019. "Have %d clean circs need another buildtime test circ.", num);
  1020. circuit_launch(CIRCUIT_PURPOSE_C_GENERAL, flags);
  1021. return;
  1022. }
  1023. }
  1024. }
  1025. /** Build a new test circuit every 5 minutes */
  1026. #define TESTING_CIRCUIT_INTERVAL 300
  1027. /** This function is called once a second, if router_have_min_dir_info() is
  1028. * true. Its job is to make sure all services we offer have enough circuits
  1029. * available. Some services just want enough circuits for current tasks,
  1030. * whereas others want a minimum set of idle circuits hanging around.
  1031. */
  1032. void
  1033. circuit_build_needed_circs(time_t now)
  1034. {
  1035. const or_options_t *options = get_options();
  1036. /* launch a new circ for any pending streams that need one
  1037. * XXXX make the assumption that (some) AP streams (i.e. HS clients)
  1038. * don't require an exit circuit, review in #13814.
  1039. * This allows HSs to function in a consensus without exits. */
  1040. if (router_have_consensus_path() != CONSENSUS_PATH_UNKNOWN)
  1041. connection_ap_rescan_and_attach_pending();
  1042. /* make sure any hidden services have enough intro points
  1043. * HS intro point streams only require an internal circuit */
  1044. if (router_have_consensus_path() != CONSENSUS_PATH_UNKNOWN)
  1045. rend_consider_services_intro_points();
  1046. circuit_expire_old_circs_as_needed(now);
  1047. if (!options->DisablePredictedCircuits)
  1048. circuit_predict_and_launch_new();
  1049. }
  1050. /**
  1051. * Called once a second either directly or from
  1052. * circuit_build_needed_circs(). As appropriate (once per NewCircuitPeriod)
  1053. * resets failure counts and expires old circuits.
  1054. */
  1055. void
  1056. circuit_expire_old_circs_as_needed(time_t now)
  1057. {
  1058. static time_t time_to_expire_and_reset = 0;
  1059. if (time_to_expire_and_reset < now) {
  1060. circuit_reset_failure_count(1);
  1061. time_to_expire_and_reset = now + get_options()->NewCircuitPeriod;
  1062. if (proxy_mode(get_options()))
  1063. addressmap_clean(now);
  1064. circuit_expire_old_circuits_clientside();
  1065. #if 0 /* disable for now, until predict-and-launch-new can cull leftovers */
  1066. /* If we ever re-enable, this has to move into
  1067. * circuit_build_needed_circs */
  1068. circ = circuit_get_youngest_clean_open(CIRCUIT_PURPOSE_C_GENERAL);
  1069. if (get_options()->RunTesting &&
  1070. circ &&
  1071. circ->timestamp_began.tv_sec + TESTING_CIRCUIT_INTERVAL < now) {
  1072. log_fn(LOG_INFO,"Creating a new testing circuit.");
  1073. circuit_launch(CIRCUIT_PURPOSE_C_GENERAL, 0);
  1074. }
  1075. #endif
  1076. }
  1077. }
  1078. /** If the stream <b>conn</b> is a member of any of the linked
  1079. * lists of <b>circ</b>, then remove it from the list.
  1080. */
  1081. void
  1082. circuit_detach_stream(circuit_t *circ, edge_connection_t *conn)
  1083. {
  1084. edge_connection_t *prevconn;
  1085. tor_assert(circ);
  1086. tor_assert(conn);
  1087. if (conn->base_.type == CONN_TYPE_AP) {
  1088. entry_connection_t *entry_conn = EDGE_TO_ENTRY_CONN(conn);
  1089. entry_conn->may_use_optimistic_data = 0;
  1090. }
  1091. conn->cpath_layer = NULL; /* don't keep a stale pointer */
  1092. conn->on_circuit = NULL;
  1093. if (CIRCUIT_IS_ORIGIN(circ)) {
  1094. origin_circuit_t *origin_circ = TO_ORIGIN_CIRCUIT(circ);
  1095. int removed = 0;
  1096. if (conn == origin_circ->p_streams) {
  1097. origin_circ->p_streams = conn->next_stream;
  1098. removed = 1;
  1099. } else {
  1100. for (prevconn = origin_circ->p_streams;
  1101. prevconn && prevconn->next_stream && prevconn->next_stream != conn;
  1102. prevconn = prevconn->next_stream)
  1103. ;
  1104. if (prevconn && prevconn->next_stream) {
  1105. prevconn->next_stream = conn->next_stream;
  1106. removed = 1;
  1107. }
  1108. }
  1109. if (removed) {
  1110. log_debug(LD_APP, "Removing stream %d from circ %u",
  1111. conn->stream_id, (unsigned)circ->n_circ_id);
  1112. /* If the stream was removed, and it was a rend stream, decrement the
  1113. * number of streams on the circuit associated with the rend service.
  1114. */
  1115. if (circ->purpose == CIRCUIT_PURPOSE_S_REND_JOINED) {
  1116. tor_assert(origin_circ->rend_data);
  1117. origin_circ->rend_data->nr_streams--;
  1118. }
  1119. return;
  1120. }
  1121. } else {
  1122. or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
  1123. if (conn == or_circ->n_streams) {
  1124. or_circ->n_streams = conn->next_stream;
  1125. return;
  1126. }
  1127. if (conn == or_circ->resolving_streams) {
  1128. or_circ->resolving_streams = conn->next_stream;
  1129. return;
  1130. }
  1131. for (prevconn = or_circ->n_streams;
  1132. prevconn && prevconn->next_stream && prevconn->next_stream != conn;
  1133. prevconn = prevconn->next_stream)
  1134. ;
  1135. if (prevconn && prevconn->next_stream) {
  1136. prevconn->next_stream = conn->next_stream;
  1137. return;
  1138. }
  1139. for (prevconn = or_circ->resolving_streams;
  1140. prevconn && prevconn->next_stream && prevconn->next_stream != conn;
  1141. prevconn = prevconn->next_stream)
  1142. ;
  1143. if (prevconn && prevconn->next_stream) {
  1144. prevconn->next_stream = conn->next_stream;
  1145. return;
  1146. }
  1147. }
  1148. log_warn(LD_BUG,"Edge connection not in circuit's list.");
  1149. /* Don't give an error here; it's harmless. */
  1150. tor_fragile_assert();
  1151. }
  1152. /** If we haven't yet decided on a good timeout value for circuit
  1153. * building, we close idles circuits aggressively so we can get more
  1154. * data points. */
  1155. #define IDLE_TIMEOUT_WHILE_LEARNING (10*60)
  1156. /** Find each circuit that has been unused for too long, or dirty
  1157. * for too long and has no streams on it: mark it for close.
  1158. */
  1159. static void
  1160. circuit_expire_old_circuits_clientside(void)
  1161. {
  1162. struct timeval cutoff, now;
  1163. tor_gettimeofday(&now);
  1164. cutoff = now;
  1165. last_expired_clientside_circuits = now.tv_sec;
  1166. if (! circuit_build_times_disabled() &&
  1167. circuit_build_times_needs_circuits(get_circuit_build_times())) {
  1168. /* Circuits should be shorter lived if we need more of them
  1169. * for learning a good build timeout */
  1170. cutoff.tv_sec -= IDLE_TIMEOUT_WHILE_LEARNING;
  1171. } else {
  1172. cutoff.tv_sec -= get_options()->CircuitIdleTimeout;
  1173. }
  1174. SMARTLIST_FOREACH_BEGIN(circuit_get_global_list(), circuit_t *, circ) {
  1175. if (circ->marked_for_close || !CIRCUIT_IS_ORIGIN(circ))
  1176. continue;
  1177. /* If the circuit has been dirty for too long, and there are no streams
  1178. * on it, mark it for close.
  1179. */
  1180. if (circ->timestamp_dirty &&
  1181. circ->timestamp_dirty + get_options()->MaxCircuitDirtiness <
  1182. now.tv_sec &&
  1183. !TO_ORIGIN_CIRCUIT(circ)->p_streams /* nothing attached */ ) {
  1184. log_debug(LD_CIRC, "Closing n_circ_id %u (dirty %ld sec ago, "
  1185. "purpose %d)",
  1186. (unsigned)circ->n_circ_id,
  1187. (long)(now.tv_sec - circ->timestamp_dirty),
  1188. circ->purpose);
  1189. /* Don't do this magic for testing circuits. Their death is governed
  1190. * by circuit_expire_building */
  1191. if (circ->purpose != CIRCUIT_PURPOSE_PATH_BIAS_TESTING)
  1192. circuit_mark_for_close(circ, END_CIRC_REASON_FINISHED);
  1193. } else if (!circ->timestamp_dirty && circ->state == CIRCUIT_STATE_OPEN) {
  1194. if (timercmp(&circ->timestamp_began, &cutoff, OP_LT)) {
  1195. if (circ->purpose == CIRCUIT_PURPOSE_C_GENERAL ||
  1196. circ->purpose == CIRCUIT_PURPOSE_C_MEASURE_TIMEOUT ||
  1197. circ->purpose == CIRCUIT_PURPOSE_S_ESTABLISH_INTRO ||
  1198. circ->purpose == CIRCUIT_PURPOSE_TESTING ||
  1199. (circ->purpose >= CIRCUIT_PURPOSE_C_INTRODUCING &&
  1200. circ->purpose <= CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED) ||
  1201. circ->purpose == CIRCUIT_PURPOSE_S_CONNECT_REND) {
  1202. log_debug(LD_CIRC,
  1203. "Closing circuit that has been unused for %ld msec.",
  1204. tv_mdiff(&circ->timestamp_began, &now));
  1205. circuit_mark_for_close(circ, END_CIRC_REASON_FINISHED);
  1206. } else if (!TO_ORIGIN_CIRCUIT(circ)->is_ancient) {
  1207. /* Server-side rend joined circuits can end up really old, because
  1208. * they are reused by clients for longer than normal. The client
  1209. * controls their lifespan. (They never become dirty, because
  1210. * connection_exit_begin_conn() never marks anything as dirty.)
  1211. * Similarly, server-side intro circuits last a long time. */
  1212. if (circ->purpose != CIRCUIT_PURPOSE_S_REND_JOINED &&
  1213. circ->purpose != CIRCUIT_PURPOSE_S_INTRO) {
  1214. log_notice(LD_CIRC,
  1215. "Ancient non-dirty circuit %d is still around after "
  1216. "%ld milliseconds. Purpose: %d (%s)",
  1217. TO_ORIGIN_CIRCUIT(circ)->global_identifier,
  1218. tv_mdiff(&circ->timestamp_began, &now),
  1219. circ->purpose,
  1220. circuit_purpose_to_string(circ->purpose));
  1221. TO_ORIGIN_CIRCUIT(circ)->is_ancient = 1;
  1222. }
  1223. }
  1224. }
  1225. }
  1226. } SMARTLIST_FOREACH_END(circ);
  1227. }
  1228. /** How long do we wait before killing circuits with the properties
  1229. * described below?
  1230. *
  1231. * Probably we could choose a number here as low as 5 to 10 seconds,
  1232. * since these circs are used for begindir, and a) generally you either
  1233. * ask another begindir question right after or you don't for a long time,
  1234. * b) clients at least through 0.2.1.x choose from the whole set of
  1235. * directory mirrors at each choice, and c) re-establishing a one-hop
  1236. * circuit via create-fast is a light operation assuming the TLS conn is
  1237. * still there.
  1238. *
  1239. * I expect "b" to go away one day when we move to using directory
  1240. * guards, but I think "a" and "c" are good enough reasons that a low
  1241. * number is safe even then.
  1242. */
  1243. #define IDLE_ONE_HOP_CIRC_TIMEOUT 60
  1244. /** Find each non-origin circuit that has been unused for too long,
  1245. * has no streams on it, used a create_fast, and ends here: mark it
  1246. * for close.
  1247. */
  1248. void
  1249. circuit_expire_old_circuits_serverside(time_t now)
  1250. {
  1251. or_circuit_t *or_circ;
  1252. time_t cutoff = now - IDLE_ONE_HOP_CIRC_TIMEOUT;
  1253. SMARTLIST_FOREACH_BEGIN(circuit_get_global_list(), circuit_t *, circ) {
  1254. if (circ->marked_for_close || CIRCUIT_IS_ORIGIN(circ))
  1255. continue;
  1256. or_circ = TO_OR_CIRCUIT(circ);
  1257. /* If the circuit has been idle for too long, and there are no streams
  1258. * on it, and it ends here, and it used a create_fast, mark it for close.
  1259. */
  1260. if (or_circ->is_first_hop && !circ->n_chan &&
  1261. !or_circ->n_streams && !or_circ->resolving_streams &&
  1262. or_circ->p_chan &&
  1263. channel_when_last_xmit(or_circ->p_chan) <= cutoff) {
  1264. log_info(LD_CIRC, "Closing circ_id %u (empty %d secs ago)",
  1265. (unsigned)or_circ->p_circ_id,
  1266. (int)(now - channel_when_last_xmit(or_circ->p_chan)));
  1267. circuit_mark_for_close(circ, END_CIRC_REASON_FINISHED);
  1268. }
  1269. }
  1270. SMARTLIST_FOREACH_END(circ);
  1271. }
  1272. /** Number of testing circuits we want open before testing our bandwidth. */
  1273. #define NUM_PARALLEL_TESTING_CIRCS 4
  1274. /** True iff we've ever had enough testing circuits open to test our
  1275. * bandwidth. */
  1276. static int have_performed_bandwidth_test = 0;
  1277. /** Reset have_performed_bandwidth_test, so we'll start building
  1278. * testing circuits again so we can exercise our bandwidth. */
  1279. void
  1280. reset_bandwidth_test(void)
  1281. {
  1282. have_performed_bandwidth_test = 0;
  1283. }
  1284. /** Return 1 if we've already exercised our bandwidth, or if we
  1285. * have fewer than NUM_PARALLEL_TESTING_CIRCS testing circuits
  1286. * established or on the way. Else return 0.
  1287. */
  1288. int
  1289. circuit_enough_testing_circs(void)
  1290. {
  1291. int num = 0;
  1292. if (have_performed_bandwidth_test)
  1293. return 1;
  1294. SMARTLIST_FOREACH_BEGIN(circuit_get_global_list(), circuit_t *, circ) {
  1295. if (!circ->marked_for_close && CIRCUIT_IS_ORIGIN(circ) &&
  1296. circ->purpose == CIRCUIT_PURPOSE_TESTING &&
  1297. circ->state == CIRCUIT_STATE_OPEN)
  1298. num++;
  1299. }
  1300. SMARTLIST_FOREACH_END(circ);
  1301. return num >= NUM_PARALLEL_TESTING_CIRCS;
  1302. }
  1303. /** A testing circuit has completed. Take whatever stats we want.
  1304. * Noticing reachability is taken care of in onionskin_answer(),
  1305. * so there's no need to record anything here. But if we still want
  1306. * to do the bandwidth test, and we now have enough testing circuits
  1307. * open, do it.
  1308. */
  1309. static void
  1310. circuit_testing_opened(origin_circuit_t *circ)
  1311. {
  1312. if (have_performed_bandwidth_test ||
  1313. !check_whether_orport_reachable(get_options())) {
  1314. /* either we've already done everything we want with testing circuits,
  1315. * or this testing circuit became open due to a fluke, e.g. we picked
  1316. * a last hop where we already had the connection open due to an
  1317. * outgoing local circuit. */
  1318. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_AT_ORIGIN);
  1319. } else if (circuit_enough_testing_circs()) {
  1320. router_perform_bandwidth_test(NUM_PARALLEL_TESTING_CIRCS, time(NULL));
  1321. have_performed_bandwidth_test = 1;
  1322. } else
  1323. consider_testing_reachability(1, 0);
  1324. }
  1325. /** A testing circuit has failed to build. Take whatever stats we want. */
  1326. static void
  1327. circuit_testing_failed(origin_circuit_t *circ, int at_last_hop)
  1328. {
  1329. const or_options_t *options = get_options();
  1330. if (server_mode(options) && check_whether_orport_reachable(options))
  1331. return;
  1332. log_info(LD_GENERAL,
  1333. "Our testing circuit (to see if your ORPort is reachable) "
  1334. "has failed. I'll try again later.");
  1335. /* These aren't used yet. */
  1336. (void)circ;
  1337. (void)at_last_hop;
  1338. }
  1339. /** The circuit <b>circ</b> has just become open. Take the next
  1340. * step: for rendezvous circuits, we pass circ to the appropriate
  1341. * function in rendclient or rendservice. For general circuits, we
  1342. * call connection_ap_attach_pending, which looks for pending streams
  1343. * that could use circ.
  1344. */
  1345. void
  1346. circuit_has_opened(origin_circuit_t *circ)
  1347. {
  1348. control_event_circuit_status(circ, CIRC_EVENT_BUILT, 0);
  1349. /* Remember that this circuit has finished building. Now if we start
  1350. * it building again later (e.g. by extending it), we will know not
  1351. * to consider its build time. */
  1352. circ->has_opened = 1;
  1353. switch (TO_CIRCUIT(circ)->purpose) {
  1354. case CIRCUIT_PURPOSE_C_ESTABLISH_REND:
  1355. rend_client_rendcirc_has_opened(circ);
  1356. /* Start building an intro circ if we don't have one yet. */
  1357. connection_ap_attach_pending(1);
  1358. /* This isn't a call to circuit_try_attaching_streams because a
  1359. * circuit in _C_ESTABLISH_REND state isn't connected to its
  1360. * hidden service yet, thus we can't attach streams to it yet,
  1361. * thus circuit_try_attaching_streams would always clear the
  1362. * circuit's isolation state. circuit_try_attaching_streams is
  1363. * called later, when the rend circ enters _C_REND_JOINED
  1364. * state. */
  1365. break;
  1366. case CIRCUIT_PURPOSE_C_INTRODUCING:
  1367. rend_client_introcirc_has_opened(circ);
  1368. break;
  1369. case CIRCUIT_PURPOSE_C_GENERAL:
  1370. /* Tell any AP connections that have been waiting for a new
  1371. * circuit that one is ready. */
  1372. circuit_try_attaching_streams(circ);
  1373. break;
  1374. case CIRCUIT_PURPOSE_S_ESTABLISH_INTRO:
  1375. /* at the service, waiting for introductions */
  1376. rend_service_intro_has_opened(circ);
  1377. break;
  1378. case CIRCUIT_PURPOSE_S_CONNECT_REND:
  1379. /* at the service, connecting to rend point */
  1380. rend_service_rendezvous_has_opened(circ);
  1381. break;
  1382. case CIRCUIT_PURPOSE_TESTING:
  1383. circuit_testing_opened(circ);
  1384. break;
  1385. /* default:
  1386. * This won't happen in normal operation, but might happen if the
  1387. * controller did it. Just let it slide. */
  1388. }
  1389. }
  1390. /** If the stream-isolation state of <b>circ</b> can be cleared, clear
  1391. * it. Return non-zero iff <b>circ</b>'s isolation state was cleared. */
  1392. static int
  1393. circuit_try_clearing_isolation_state(origin_circuit_t *circ)
  1394. {
  1395. if (/* The circuit may have become non-open if it was cannibalized.*/
  1396. circ->base_.state == CIRCUIT_STATE_OPEN &&
  1397. /* If !isolation_values_set, there is nothing to clear. */
  1398. circ->isolation_values_set &&
  1399. /* It's not legal to clear a circuit's isolation info if it's ever had
  1400. * streams attached */
  1401. !circ->isolation_any_streams_attached) {
  1402. /* If we have any isolation information set on this circuit, and
  1403. * we didn't manage to attach any streams to it, then we can
  1404. * and should clear it and try again. */
  1405. circuit_clear_isolation(circ);
  1406. return 1;
  1407. } else {
  1408. return 0;
  1409. }
  1410. }
  1411. /** Called when a circuit becomes ready for streams to be attached to
  1412. * it. */
  1413. void
  1414. circuit_try_attaching_streams(origin_circuit_t *circ)
  1415. {
  1416. /* Attach streams to this circuit if we can. */
  1417. connection_ap_attach_pending(1);
  1418. /* The call to circuit_try_clearing_isolation_state here will do
  1419. * nothing and return 0 if we didn't attach any streams to circ
  1420. * above. */
  1421. if (circuit_try_clearing_isolation_state(circ)) {
  1422. /* Maybe *now* we can attach some streams to this circuit. */
  1423. connection_ap_attach_pending(1);
  1424. }
  1425. }
  1426. /** Called whenever a circuit could not be successfully built.
  1427. */
  1428. void
  1429. circuit_build_failed(origin_circuit_t *circ)
  1430. {
  1431. channel_t *n_chan = NULL;
  1432. /* we should examine circ and see if it failed because of
  1433. * the last hop or an earlier hop. then use this info below.
  1434. */
  1435. int failed_at_last_hop = 0;
  1436. /* If the last hop isn't open, and the second-to-last is, we failed
  1437. * at the last hop. */
  1438. if (circ->cpath &&
  1439. circ->cpath->prev->state != CPATH_STATE_OPEN &&
  1440. circ->cpath->prev->prev->state == CPATH_STATE_OPEN) {
  1441. failed_at_last_hop = 1;
  1442. }
  1443. if (circ->cpath &&
  1444. circ->cpath->state != CPATH_STATE_OPEN &&
  1445. ! circ->base_.received_destroy) {
  1446. /* We failed at the first hop for some reason other than a DESTROY cell.
  1447. * If there's an OR connection to blame, blame it. Also, avoid this relay
  1448. * for a while, and fail any one-hop directory fetches destined for it. */
  1449. const char *n_chan_id = circ->cpath->extend_info->identity_digest;
  1450. int already_marked = 0;
  1451. if (circ->base_.n_chan) {
  1452. n_chan = circ->base_.n_chan;
  1453. if (n_chan->is_bad_for_new_circs) {
  1454. /* We only want to blame this router when a fresh healthy
  1455. * connection fails. So don't mark this router as newly failed,
  1456. * since maybe this was just an old circuit attempt that's
  1457. * finally timing out now. Also, there's no need to blow away
  1458. * circuits/streams/etc, since the failure of an unhealthy conn
  1459. * doesn't tell us much about whether a healthy conn would
  1460. * succeed. */
  1461. already_marked = 1;
  1462. }
  1463. log_info(LD_OR,
  1464. "Our circuit failed to get a response from the first hop "
  1465. "(%s). I'm going to try to rotate to a better connection.",
  1466. channel_get_canonical_remote_descr(n_chan));
  1467. n_chan->is_bad_for_new_circs = 1;
  1468. } else {
  1469. log_info(LD_OR,
  1470. "Our circuit died before the first hop with no connection");
  1471. }
  1472. if (n_chan_id && !already_marked) {
  1473. entry_guard_register_connect_status(n_chan_id, 0, 1, time(NULL));
  1474. /* if there are any one-hop streams waiting on this circuit, fail
  1475. * them now so they can retry elsewhere. */
  1476. connection_ap_fail_onehop(n_chan_id, circ->build_state);
  1477. }
  1478. }
  1479. switch (circ->base_.purpose) {
  1480. case CIRCUIT_PURPOSE_C_GENERAL:
  1481. /* If we never built the circuit, note it as a failure. */
  1482. circuit_increment_failure_count();
  1483. if (failed_at_last_hop) {
  1484. /* Make sure any streams that demand our last hop as their exit
  1485. * know that it's unlikely to happen. */
  1486. circuit_discard_optional_exit_enclaves(circ->cpath->prev->extend_info);
  1487. }
  1488. break;
  1489. case CIRCUIT_PURPOSE_TESTING:
  1490. circuit_testing_failed(circ, failed_at_last_hop);
  1491. break;
  1492. case CIRCUIT_PURPOSE_S_ESTABLISH_INTRO:
  1493. /* at the service, waiting for introductions */
  1494. if (circ->base_.state != CIRCUIT_STATE_OPEN) {
  1495. circuit_increment_failure_count();
  1496. }
  1497. /* no need to care here, because the service will rebuild intro
  1498. * points periodically. */
  1499. break;
  1500. case CIRCUIT_PURPOSE_C_INTRODUCING:
  1501. /* at the client, connecting to intro point */
  1502. /* Don't increment failure count, since the service may have picked
  1503. * the introduction point maliciously */
  1504. /* The client will pick a new intro point when this one dies, if
  1505. * the stream in question still cares. No need to act here. */
  1506. break;
  1507. case CIRCUIT_PURPOSE_C_ESTABLISH_REND:
  1508. /* at the client, waiting for the service */
  1509. circuit_increment_failure_count();
  1510. /* the client will pick a new rend point when this one dies, if
  1511. * the stream in question still cares. No need to act here. */
  1512. break;
  1513. case CIRCUIT_PURPOSE_S_CONNECT_REND:
  1514. /* at the service, connecting to rend point */
  1515. /* Don't increment failure count, since the client may have picked
  1516. * the rendezvous point maliciously */
  1517. log_info(LD_REND,
  1518. "Couldn't connect to the client's chosen rend point %s "
  1519. "(%s hop failed).",
  1520. escaped(build_state_get_exit_nickname(circ->build_state)),
  1521. failed_at_last_hop?"last":"non-last");
  1522. rend_service_relaunch_rendezvous(circ);
  1523. break;
  1524. /* default:
  1525. * This won't happen in normal operation, but might happen if the
  1526. * controller did it. Just let it slide. */
  1527. }
  1528. }
  1529. /** Number of consecutive failures so far; should only be touched by
  1530. * circuit_launch_new and circuit_*_failure_count.
  1531. */
  1532. static int n_circuit_failures = 0;
  1533. /** Before the last time we called circuit_reset_failure_count(), were
  1534. * there a lot of failures? */
  1535. static int did_circs_fail_last_period = 0;
  1536. /** Don't retry launching a new circuit if we try this many times with no
  1537. * success. */
  1538. #define MAX_CIRCUIT_FAILURES 5
  1539. /** Launch a new circuit; see circuit_launch_by_extend_info() for
  1540. * details on arguments. */
  1541. origin_circuit_t *
  1542. circuit_launch(uint8_t purpose, int flags)
  1543. {
  1544. return circuit_launch_by_extend_info(purpose, NULL, flags);
  1545. }
  1546. /* Do we have enough descriptors to build paths?
  1547. * If need_exit is true, return 1 if we can build exit paths.
  1548. * (We need at least one Exit in the consensus to build exit paths.)
  1549. * If need_exit is false, return 1 if we can build internal paths.
  1550. */
  1551. static int
  1552. have_enough_path_info(int need_exit)
  1553. {
  1554. if (need_exit)
  1555. return router_have_consensus_path() == CONSENSUS_PATH_EXIT;
  1556. else
  1557. return router_have_consensus_path() != CONSENSUS_PATH_UNKNOWN;
  1558. }
  1559. /** Launch a new circuit with purpose <b>purpose</b> and exit node
  1560. * <b>extend_info</b> (or NULL to select a random exit node). If flags
  1561. * contains CIRCLAUNCH_NEED_UPTIME, choose among routers with high uptime. If
  1562. * CIRCLAUNCH_NEED_CAPACITY is set, choose among routers with high bandwidth.
  1563. * If CIRCLAUNCH_IS_INTERNAL is true, the last hop need not be an exit node.
  1564. * If CIRCLAUNCH_ONEHOP_TUNNEL is set, the circuit will have only one hop.
  1565. * Return the newly allocated circuit on success, or NULL on failure. */
  1566. origin_circuit_t *
  1567. circuit_launch_by_extend_info(uint8_t purpose,
  1568. extend_info_t *extend_info,
  1569. int flags)
  1570. {
  1571. origin_circuit_t *circ;
  1572. int onehop_tunnel = (flags & CIRCLAUNCH_ONEHOP_TUNNEL) != 0;
  1573. int have_path = have_enough_path_info(! (flags & CIRCLAUNCH_IS_INTERNAL) );
  1574. int need_specific_rp = 0;
  1575. if (!onehop_tunnel && (!router_have_minimum_dir_info() || !have_path)) {
  1576. log_debug(LD_CIRC,"Haven't %s yet; canceling "
  1577. "circuit launch.",
  1578. !router_have_minimum_dir_info() ?
  1579. "fetched enough directory info" :
  1580. "received a consensus with exits");
  1581. return NULL;
  1582. }
  1583. /* If Tor2webRendezvousPoints is enabled and we are dealing with an
  1584. RP circuit, we want a specific RP node so we shouldn't canibalize
  1585. an already existing circuit. */
  1586. if (get_options()->Tor2webRendezvousPoints &&
  1587. purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND) {
  1588. need_specific_rp = 1;
  1589. }
  1590. if ((extend_info || purpose != CIRCUIT_PURPOSE_C_GENERAL) &&
  1591. purpose != CIRCUIT_PURPOSE_TESTING &&
  1592. !onehop_tunnel && !need_specific_rp) {
  1593. /* see if there are appropriate circs available to cannibalize. */
  1594. /* XXX if we're planning to add a hop, perhaps we want to look for
  1595. * internal circs rather than exit circs? -RD */
  1596. circ = circuit_find_to_cannibalize(purpose, extend_info, flags);
  1597. if (circ) {
  1598. uint8_t old_purpose = circ->base_.purpose;
  1599. struct timeval old_timestamp_began = circ->base_.timestamp_began;
  1600. log_info(LD_CIRC,"Cannibalizing circ '%s' for purpose %d (%s)",
  1601. build_state_get_exit_nickname(circ->build_state), purpose,
  1602. circuit_purpose_to_string(purpose));
  1603. if ((purpose == CIRCUIT_PURPOSE_S_CONNECT_REND ||
  1604. purpose == CIRCUIT_PURPOSE_C_INTRODUCING) &&
  1605. circ->path_state == PATH_STATE_BUILD_SUCCEEDED) {
  1606. /* Path bias: Cannibalized rends pre-emptively count as a
  1607. * successfully built but unused closed circuit. We don't
  1608. * wait until the extend (or the close) because the rend
  1609. * point could be malicious.
  1610. *
  1611. * Same deal goes for client side introductions. Clients
  1612. * can be manipulated to connect repeatedly to them
  1613. * (especially web clients).
  1614. *
  1615. * If we decide to probe the initial portion of these circs,
  1616. * (up to the adversary's final hop), we need to remove this,
  1617. * or somehow mark the circuit with a special path state.
  1618. */
  1619. /* This must be called before the purpose change */
  1620. pathbias_check_close(circ, END_CIRC_REASON_FINISHED);
  1621. }
  1622. circuit_change_purpose(TO_CIRCUIT(circ), purpose);
  1623. /* Reset the start date of this circ, else expire_building
  1624. * will see it and think it's been trying to build since it
  1625. * began.
  1626. *
  1627. * Technically, the code should reset this when the
  1628. * create cell is finally sent, but we're close enough
  1629. * here. */
  1630. tor_gettimeofday(&circ->base_.timestamp_began);
  1631. control_event_circuit_cannibalized(circ, old_purpose,
  1632. &old_timestamp_began);
  1633. switch (purpose) {
  1634. case CIRCUIT_PURPOSE_C_ESTABLISH_REND:
  1635. /* it's ready right now */
  1636. break;
  1637. case CIRCUIT_PURPOSE_C_INTRODUCING:
  1638. case CIRCUIT_PURPOSE_S_CONNECT_REND:
  1639. case CIRCUIT_PURPOSE_C_GENERAL:
  1640. case CIRCUIT_PURPOSE_S_ESTABLISH_INTRO:
  1641. /* need to add a new hop */
  1642. tor_assert(extend_info);
  1643. if (circuit_extend_to_new_exit(circ, extend_info) < 0)
  1644. return NULL;
  1645. break;
  1646. default:
  1647. log_warn(LD_BUG,
  1648. "unexpected purpose %d when cannibalizing a circ.",
  1649. purpose);
  1650. tor_fragile_assert();
  1651. return NULL;
  1652. }
  1653. return circ;
  1654. }
  1655. }
  1656. if (did_circs_fail_last_period &&
  1657. n_circuit_failures > MAX_CIRCUIT_FAILURES) {
  1658. /* too many failed circs in a row. don't try. */
  1659. // log_fn(LOG_INFO,"%d failures so far, not trying.",n_circuit_failures);
  1660. return NULL;
  1661. }
  1662. /* try a circ. if it fails, circuit_mark_for_close will increment
  1663. * n_circuit_failures */
  1664. return circuit_establish_circuit(purpose, extend_info, flags);
  1665. }
  1666. /** Record another failure at opening a general circuit. When we have
  1667. * too many, we'll stop trying for the remainder of this minute.
  1668. */
  1669. static void
  1670. circuit_increment_failure_count(void)
  1671. {
  1672. ++n_circuit_failures;
  1673. log_debug(LD_CIRC,"n_circuit_failures now %d.",n_circuit_failures);
  1674. }
  1675. /** Reset the failure count for opening general circuits. This means
  1676. * we will try MAX_CIRCUIT_FAILURES times more (if necessary) before
  1677. * stopping again.
  1678. */
  1679. void
  1680. circuit_reset_failure_count(int timeout)
  1681. {
  1682. if (timeout && n_circuit_failures > MAX_CIRCUIT_FAILURES)
  1683. did_circs_fail_last_period = 1;
  1684. else
  1685. did_circs_fail_last_period = 0;
  1686. n_circuit_failures = 0;
  1687. }
  1688. /** Find an open circ that we're happy to use for <b>conn</b> and return 1. If
  1689. * there isn't one, and there isn't one on the way, launch one and return
  1690. * 0. If it will never work, return -1.
  1691. *
  1692. * Write the found or in-progress or launched circ into *circp.
  1693. */
  1694. static int
  1695. circuit_get_open_circ_or_launch(entry_connection_t *conn,
  1696. uint8_t desired_circuit_purpose,
  1697. origin_circuit_t **circp)
  1698. {
  1699. origin_circuit_t *circ;
  1700. int check_exit_policy;
  1701. int need_uptime, need_internal;
  1702. int want_onehop;
  1703. const or_options_t *options = get_options();
  1704. tor_assert(conn);
  1705. tor_assert(circp);
  1706. if (ENTRY_TO_CONN(conn)->state != AP_CONN_STATE_CIRCUIT_WAIT) {
  1707. connection_t *c = ENTRY_TO_CONN(conn);
  1708. log_err(LD_BUG, "Connection state mismatch: wanted "
  1709. "AP_CONN_STATE_CIRCUIT_WAIT, but got %d (%s)",
  1710. c->state, conn_state_to_string(c->type, c->state));
  1711. }
  1712. tor_assert(ENTRY_TO_CONN(conn)->state == AP_CONN_STATE_CIRCUIT_WAIT);
  1713. /* Will the exit policy of the exit node apply to this stream? */
  1714. check_exit_policy =
  1715. conn->socks_request->command == SOCKS_COMMAND_CONNECT &&
  1716. !conn->use_begindir &&
  1717. !connection_edge_is_rendezvous_stream(ENTRY_TO_EDGE_CONN(conn));
  1718. /* Does this connection want a one-hop circuit? */
  1719. want_onehop = conn->want_onehop;
  1720. /* Do we need a high-uptime circuit? */
  1721. need_uptime = !conn->want_onehop && !conn->use_begindir &&
  1722. smartlist_contains_int_as_string(options->LongLivedPorts,
  1723. conn->socks_request->port);
  1724. /* Do we need an "internal" circuit? */
  1725. if (desired_circuit_purpose != CIRCUIT_PURPOSE_C_GENERAL)
  1726. need_internal = 1;
  1727. else if (conn->use_begindir || conn->want_onehop)
  1728. need_internal = 1;
  1729. else
  1730. need_internal = 0;
  1731. /* We now know what kind of circuit we need. See if there is an
  1732. * open circuit that we can use for this stream */
  1733. circ = circuit_get_best(conn, 1 /* Insist on open circuits */,
  1734. desired_circuit_purpose,
  1735. need_uptime, need_internal);
  1736. if (circ) {
  1737. /* We got a circuit that will work for this stream! We can return it. */
  1738. *circp = circ;
  1739. return 1; /* we're happy */
  1740. }
  1741. /* Okay, there's no circuit open that will work for this stream. Let's
  1742. * see if there's an in-progress circuit or if we have to launch one */
  1743. /* Do we know enough directory info to build circuits at all? */
  1744. int have_path = have_enough_path_info(!need_internal);
  1745. if (!want_onehop && (!router_have_minimum_dir_info() || !have_path)) {
  1746. /* If we don't have enough directory information, we can't build
  1747. * multihop circuits.
  1748. */
  1749. if (!connection_get_by_type(CONN_TYPE_DIR)) {
  1750. int severity = LOG_NOTICE;
  1751. /* Retry some stuff that might help the connection work. */
  1752. if (entry_list_is_constrained(options) &&
  1753. entries_known_but_down(options)) {
  1754. log_fn(severity, LD_APP|LD_DIR,
  1755. "Application request when we haven't %s. "
  1756. "Optimistically trying known %s again.",
  1757. !router_have_minimum_dir_info() ?
  1758. "used client functionality lately" :
  1759. "received a consensus with exits",
  1760. options->UseBridges ? "bridges" : "entrynodes");
  1761. entries_retry_all(options);
  1762. } else if (!options->UseBridges || any_bridge_descriptors_known()) {
  1763. log_fn(severity, LD_APP|LD_DIR,
  1764. "Application request when we haven't %s. "
  1765. "Optimistically trying directory fetches again.",
  1766. !router_have_minimum_dir_info() ?
  1767. "used client functionality lately" :
  1768. "received a consensus with exits");
  1769. routerlist_retry_directory_downloads(time(NULL));
  1770. }
  1771. }
  1772. /* Since we didn't have enough directory info, we can't attach now. The
  1773. * stream will be dealt with when router_have_minimum_dir_info becomes 1,
  1774. * or when all directory attempts fail and directory_all_unreachable()
  1775. * kills it.
  1776. */
  1777. return 0;
  1778. }
  1779. /* Check whether the exit policy of the chosen exit, or the exit policies
  1780. * of _all_ nodes, would forbid this node. */
  1781. if (check_exit_policy) {
  1782. if (!conn->chosen_exit_name) {
  1783. struct in_addr in;
  1784. tor_addr_t addr, *addrp=NULL;
  1785. if (tor_inet_aton(conn->socks_request->address, &in)) {
  1786. tor_addr_from_in(&addr, &in);
  1787. addrp = &addr;
  1788. }
  1789. if (router_exit_policy_all_nodes_reject(addrp,
  1790. conn->socks_request->port,
  1791. need_uptime)) {
  1792. log_notice(LD_APP,
  1793. "No Tor server allows exit to %s:%d. Rejecting.",
  1794. safe_str_client(conn->socks_request->address),
  1795. conn->socks_request->port);
  1796. return -1;
  1797. }
  1798. } else {
  1799. /* XXXX Duplicates checks in connection_ap_handshake_attach_circuit:
  1800. * refactor into a single function. */
  1801. const node_t *node = node_get_by_nickname(conn->chosen_exit_name, 1);
  1802. int opt = conn->chosen_exit_optional;
  1803. if (node && !connection_ap_can_use_exit(conn, node)) {
  1804. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  1805. "Requested exit point '%s' is excluded or "
  1806. "would refuse request. %s.",
  1807. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  1808. if (opt) {
  1809. conn->chosen_exit_optional = 0;
  1810. tor_free(conn->chosen_exit_name);
  1811. /* Try again. */
  1812. return circuit_get_open_circ_or_launch(conn,
  1813. desired_circuit_purpose,
  1814. circp);
  1815. }
  1816. return -1;
  1817. }
  1818. }
  1819. }
  1820. /* Now, check whether there already a circuit on the way that could handle
  1821. * this stream. This check matches the one above, but this time we
  1822. * do not require that the circuit will work. */
  1823. circ = circuit_get_best(conn, 0 /* don't insist on open circuits */,
  1824. desired_circuit_purpose,
  1825. need_uptime, need_internal);
  1826. if (circ)
  1827. log_debug(LD_CIRC, "one on the way!");
  1828. if (!circ) {
  1829. /* No open or in-progress circuit could handle this stream! We
  1830. * will have to launch one!
  1831. */
  1832. /* THe chosen exit node, if there is one. */
  1833. extend_info_t *extend_info=NULL;
  1834. const int n_pending = count_pending_general_client_circuits();
  1835. /* Do we have too many pending circuits? */
  1836. if (n_pending >= options->MaxClientCircuitsPending) {
  1837. static ratelim_t delay_limit = RATELIM_INIT(10*60);
  1838. char *m;
  1839. if ((m = rate_limit_log(&delay_limit, approx_time()))) {
  1840. log_notice(LD_APP, "We'd like to launch a circuit to handle a "
  1841. "connection, but we already have %d general-purpose client "
  1842. "circuits pending. Waiting until some finish.%s",
  1843. n_pending, m);
  1844. tor_free(m);
  1845. }
  1846. return 0;
  1847. }
  1848. /* If this is a hidden service trying to start an introduction point,
  1849. * handle that case. */
  1850. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT) {
  1851. /* need to pick an intro point */
  1852. rend_data_t *rend_data = ENTRY_TO_EDGE_CONN(conn)->rend_data;
  1853. tor_assert(rend_data);
  1854. extend_info = rend_client_get_random_intro(rend_data);
  1855. if (!extend_info) {
  1856. log_info(LD_REND,
  1857. "No intro points for '%s': re-fetching service descriptor.",
  1858. safe_str_client(rend_data_get_address(rend_data)));
  1859. rend_client_refetch_v2_renddesc(rend_data);
  1860. connection_ap_mark_as_non_pending_circuit(conn);
  1861. ENTRY_TO_CONN(conn)->state = AP_CONN_STATE_RENDDESC_WAIT;
  1862. return 0;
  1863. }
  1864. log_info(LD_REND,"Chose %s as intro point for '%s'.",
  1865. extend_info_describe(extend_info),
  1866. safe_str_client(rend_data_get_address(rend_data)));
  1867. }
  1868. /* If we have specified a particular exit node for our
  1869. * connection, then be sure to open a circuit to that exit node.
  1870. */
  1871. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_GENERAL) {
  1872. if (conn->chosen_exit_name) {
  1873. const node_t *r;
  1874. int opt = conn->chosen_exit_optional;
  1875. r = node_get_by_nickname(conn->chosen_exit_name, 1);
  1876. if (r && node_has_descriptor(r)) {
  1877. /* We might want to connect to an IPv6 bridge for loading
  1878. descriptors so we use the preferred address rather than
  1879. the primary. */
  1880. extend_info = extend_info_from_node(r, conn->want_onehop ? 1 : 0);
  1881. if (!extend_info) {
  1882. log_warn(LD_CIRC,"Could not make a one-hop connection to %s. "
  1883. "Discarding this circuit.", conn->chosen_exit_name);
  1884. return -1;
  1885. }
  1886. } else { /* ! (r && node_has_descriptor(r)) */
  1887. log_debug(LD_DIR, "considering %d, %s",
  1888. want_onehop, conn->chosen_exit_name);
  1889. if (want_onehop && conn->chosen_exit_name[0] == '$') {
  1890. /* We're asking for a one-hop circuit to a router that
  1891. * we don't have a routerinfo about. Make up an extend_info. */
  1892. char digest[DIGEST_LEN];
  1893. char *hexdigest = conn->chosen_exit_name+1;
  1894. tor_addr_t addr;
  1895. if (strlen(hexdigest) < HEX_DIGEST_LEN ||
  1896. base16_decode(digest,DIGEST_LEN,
  1897. hexdigest,HEX_DIGEST_LEN) != DIGEST_LEN) {
  1898. log_info(LD_DIR, "Broken exit digest on tunnel conn. Closing.");
  1899. return -1;
  1900. }
  1901. if (tor_addr_parse(&addr, conn->socks_request->address) < 0) {
  1902. log_info(LD_DIR, "Broken address %s on tunnel conn. Closing.",
  1903. escaped_safe_str_client(conn->socks_request->address));
  1904. return -1;
  1905. }
  1906. extend_info = extend_info_new(conn->chosen_exit_name+1,
  1907. digest, NULL, NULL, &addr,
  1908. conn->socks_request->port);
  1909. } else { /* ! (want_onehop && conn->chosen_exit_name[0] == '$') */
  1910. /* We will need an onion key for the router, and we
  1911. * don't have one. Refuse or relax requirements. */
  1912. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  1913. "Requested exit point '%s' is not known. %s.",
  1914. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  1915. if (opt) {
  1916. conn->chosen_exit_optional = 0;
  1917. tor_free(conn->chosen_exit_name);
  1918. /* Try again with no requested exit */
  1919. return circuit_get_open_circ_or_launch(conn,
  1920. desired_circuit_purpose,
  1921. circp);
  1922. }
  1923. return -1;
  1924. }
  1925. }
  1926. }
  1927. } /* Done checking for general circutis with chosen exits. */
  1928. /* What purpose do we need to launch this circuit with? */
  1929. uint8_t new_circ_purpose;
  1930. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_REND_JOINED)
  1931. new_circ_purpose = CIRCUIT_PURPOSE_C_ESTABLISH_REND;
  1932. else if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT)
  1933. new_circ_purpose = CIRCUIT_PURPOSE_C_INTRODUCING;
  1934. else
  1935. new_circ_purpose = desired_circuit_purpose;
  1936. #ifdef ENABLE_TOR2WEB_MODE
  1937. /* If tor2Web is on, then hidden service requests should be one-hop.
  1938. */
  1939. if (options->Tor2webMode &&
  1940. (new_circ_purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND ||
  1941. new_circ_purpose == CIRCUIT_PURPOSE_C_INTRODUCING)) {
  1942. want_onehop = 1;
  1943. }
  1944. #endif
  1945. /* Determine what kind of a circuit to launch, and actually launch it. */
  1946. {
  1947. int flags = CIRCLAUNCH_NEED_CAPACITY;
  1948. if (want_onehop) flags |= CIRCLAUNCH_ONEHOP_TUNNEL;
  1949. if (need_uptime) flags |= CIRCLAUNCH_NEED_UPTIME;
  1950. if (need_internal) flags |= CIRCLAUNCH_IS_INTERNAL;
  1951. circ = circuit_launch_by_extend_info(new_circ_purpose, extend_info,
  1952. flags);
  1953. }
  1954. extend_info_free(extend_info);
  1955. /* Now trigger things that need to happen when we launch circuits */
  1956. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_GENERAL) {
  1957. /* We just caused a circuit to get built because of this stream.
  1958. * If this stream has caused a _lot_ of circuits to be built, that's
  1959. * a bad sign: we should tell the user. */
  1960. if (conn->num_circuits_launched < NUM_CIRCUITS_LAUNCHED_THRESHOLD &&
  1961. ++conn->num_circuits_launched == NUM_CIRCUITS_LAUNCHED_THRESHOLD)
  1962. log_info(LD_CIRC, "The application request to %s:%d has launched "
  1963. "%d circuits without finding one it likes.",
  1964. escaped_safe_str_client(conn->socks_request->address),
  1965. conn->socks_request->port,
  1966. conn->num_circuits_launched);
  1967. } else {
  1968. /* help predict this next time */
  1969. rep_hist_note_used_internal(time(NULL), need_uptime, 1);
  1970. if (circ) {
  1971. /* write the service_id into circ */
  1972. circ->rend_data = rend_data_dup(ENTRY_TO_EDGE_CONN(conn)->rend_data);
  1973. if (circ->base_.purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND &&
  1974. circ->base_.state == CIRCUIT_STATE_OPEN)
  1975. circuit_has_opened(circ);
  1976. }
  1977. }
  1978. } /* endif (!circ) */
  1979. /* We either found a good circuit, or launched a new circuit, or failed to
  1980. * do so. Report success, and delay. */
  1981. if (circ) {
  1982. /* Mark the circuit with the isolation fields for this connection.
  1983. * When the circuit arrives, we'll clear these flags: this is
  1984. * just some internal bookkeeping to make sure that we have
  1985. * launched enough circuits.
  1986. */
  1987. connection_edge_update_circuit_isolation(conn, circ, 0);
  1988. } else {
  1989. log_info(LD_APP,
  1990. "No safe circuit (purpose %d) ready for edge "
  1991. "connection; delaying.",
  1992. desired_circuit_purpose);
  1993. }
  1994. *circp = circ;
  1995. return 0;
  1996. }
  1997. /** Return true iff <b>crypt_path</b> is one of the crypt_paths for
  1998. * <b>circ</b>. */
  1999. static int
  2000. cpath_is_on_circuit(origin_circuit_t *circ, crypt_path_t *crypt_path)
  2001. {
  2002. crypt_path_t *cpath, *cpath_next = NULL;
  2003. for (cpath = circ->cpath; cpath_next != circ->cpath; cpath = cpath_next) {
  2004. cpath_next = cpath->next;
  2005. if (crypt_path == cpath)
  2006. return 1;
  2007. }
  2008. return 0;
  2009. }
  2010. /** Return true iff client-side optimistic data is supported. */
  2011. static int
  2012. optimistic_data_enabled(void)
  2013. {
  2014. const or_options_t *options = get_options();
  2015. if (options->OptimisticData < 0) {
  2016. /* Note: this default was 0 before #18815 was merged. We can't take the
  2017. * parameter out of the consensus until versions before that are all
  2018. * obsolete. */
  2019. const int32_t enabled =
  2020. networkstatus_get_param(NULL, "UseOptimisticData", /*default*/ 1, 0, 1);
  2021. return (int)enabled;
  2022. }
  2023. return options->OptimisticData;
  2024. }
  2025. /** Attach the AP stream <b>apconn</b> to circ's linked list of
  2026. * p_streams. Also set apconn's cpath_layer to <b>cpath</b>, or to the last
  2027. * hop in circ's cpath if <b>cpath</b> is NULL.
  2028. */
  2029. static void
  2030. link_apconn_to_circ(entry_connection_t *apconn, origin_circuit_t *circ,
  2031. crypt_path_t *cpath)
  2032. {
  2033. const node_t *exitnode = NULL;
  2034. /* add it into the linked list of streams on this circuit */
  2035. log_debug(LD_APP|LD_CIRC, "attaching new conn to circ. n_circ_id %u.",
  2036. (unsigned)circ->base_.n_circ_id);
  2037. /* reset it, so we can measure circ timeouts */
  2038. ENTRY_TO_CONN(apconn)->timestamp_lastread = time(NULL);
  2039. ENTRY_TO_EDGE_CONN(apconn)->next_stream = circ->p_streams;
  2040. ENTRY_TO_EDGE_CONN(apconn)->on_circuit = TO_CIRCUIT(circ);
  2041. /* assert_connection_ok(conn, time(NULL)); */
  2042. circ->p_streams = ENTRY_TO_EDGE_CONN(apconn);
  2043. if (connection_edge_is_rendezvous_stream(ENTRY_TO_EDGE_CONN(apconn))) {
  2044. /* We are attaching a stream to a rendezvous circuit. That means
  2045. * that an attempt to connect to a hidden service just
  2046. * succeeded. Tell rendclient.c. */
  2047. rend_client_note_connection_attempt_ended(
  2048. ENTRY_TO_EDGE_CONN(apconn)->rend_data);
  2049. }
  2050. if (cpath) { /* we were given one; use it */
  2051. tor_assert(cpath_is_on_circuit(circ, cpath));
  2052. } else {
  2053. /* use the last hop in the circuit */
  2054. tor_assert(circ->cpath);
  2055. tor_assert(circ->cpath->prev);
  2056. tor_assert(circ->cpath->prev->state == CPATH_STATE_OPEN);
  2057. cpath = circ->cpath->prev;
  2058. }
  2059. ENTRY_TO_EDGE_CONN(apconn)->cpath_layer = cpath;
  2060. circ->isolation_any_streams_attached = 1;
  2061. connection_edge_update_circuit_isolation(apconn, circ, 0);
  2062. /* Compute the exitnode if possible, for logging below */
  2063. if (cpath->extend_info)
  2064. exitnode = node_get_by_id(cpath->extend_info->identity_digest);
  2065. /* See if we can use optimistic data on this circuit */
  2066. if (optimistic_data_enabled() &&
  2067. (circ->base_.purpose == CIRCUIT_PURPOSE_C_GENERAL ||
  2068. circ->base_.purpose == CIRCUIT_PURPOSE_C_REND_JOINED))
  2069. apconn->may_use_optimistic_data = 1;
  2070. else
  2071. apconn->may_use_optimistic_data = 0;
  2072. log_info(LD_APP, "Looks like completed circuit to %s %s allow "
  2073. "optimistic data for connection to %s",
  2074. circ->base_.purpose == CIRCUIT_PURPOSE_C_GENERAL ?
  2075. /* node_describe() does the right thing if exitnode is NULL */
  2076. safe_str_client(node_describe(exitnode)) :
  2077. "hidden service",
  2078. apconn->may_use_optimistic_data ? "does" : "doesn't",
  2079. safe_str_client(apconn->socks_request->address));
  2080. }
  2081. /** Return true iff <b>address</b> is matched by one of the entries in
  2082. * TrackHostExits. */
  2083. int
  2084. hostname_in_track_host_exits(const or_options_t *options, const char *address)
  2085. {
  2086. if (!options->TrackHostExits)
  2087. return 0;
  2088. SMARTLIST_FOREACH_BEGIN(options->TrackHostExits, const char *, cp) {
  2089. if (cp[0] == '.') { /* match end */
  2090. if (cp[1] == '\0' ||
  2091. !strcasecmpend(address, cp) ||
  2092. !strcasecmp(address, &cp[1]))
  2093. return 1;
  2094. } else if (strcasecmp(cp, address) == 0) {
  2095. return 1;
  2096. }
  2097. } SMARTLIST_FOREACH_END(cp);
  2098. return 0;
  2099. }
  2100. /** If an exit wasn't explicitly specified for <b>conn</b>, consider saving
  2101. * the exit that we *did* choose for use by future connections to
  2102. * <b>conn</b>'s destination.
  2103. */
  2104. static void
  2105. consider_recording_trackhost(const entry_connection_t *conn,
  2106. const origin_circuit_t *circ)
  2107. {
  2108. const or_options_t *options = get_options();
  2109. char *new_address = NULL;
  2110. char fp[HEX_DIGEST_LEN+1];
  2111. /* Search the addressmap for this conn's destination. */
  2112. /* If they're not in the address map.. */
  2113. if (!options->TrackHostExits ||
  2114. addressmap_have_mapping(conn->socks_request->address,
  2115. options->TrackHostExitsExpire))
  2116. return; /* nothing to track, or already mapped */
  2117. if (!hostname_in_track_host_exits(options, conn->socks_request->address) ||
  2118. !circ->build_state->chosen_exit)
  2119. return;
  2120. /* write down the fingerprint of the chosen exit, not the nickname,
  2121. * because the chosen exit might not be named. */
  2122. base16_encode(fp, sizeof(fp),
  2123. circ->build_state->chosen_exit->identity_digest, DIGEST_LEN);
  2124. /* Add this exit/hostname pair to the addressmap. */
  2125. tor_asprintf(&new_address, "%s.%s.exit",
  2126. conn->socks_request->address, fp);
  2127. addressmap_register(conn->socks_request->address, new_address,
  2128. time(NULL) + options->TrackHostExitsExpire,
  2129. ADDRMAPSRC_TRACKEXIT, 0, 0);
  2130. }
  2131. /** Attempt to attach the connection <b>conn</b> to <b>circ</b>, and send a
  2132. * begin or resolve cell as appropriate. Return values are as for
  2133. * connection_ap_handshake_attach_circuit. The stream will exit from the hop
  2134. * indicated by <b>cpath</b>, or from the last hop in circ's cpath if
  2135. * <b>cpath</b> is NULL. */
  2136. int
  2137. connection_ap_handshake_attach_chosen_circuit(entry_connection_t *conn,
  2138. origin_circuit_t *circ,
  2139. crypt_path_t *cpath)
  2140. {
  2141. connection_t *base_conn = ENTRY_TO_CONN(conn);
  2142. tor_assert(conn);
  2143. tor_assert(base_conn->state == AP_CONN_STATE_CIRCUIT_WAIT ||
  2144. base_conn->state == AP_CONN_STATE_CONTROLLER_WAIT);
  2145. tor_assert(conn->socks_request);
  2146. tor_assert(circ);
  2147. tor_assert(circ->base_.state == CIRCUIT_STATE_OPEN);
  2148. base_conn->state = AP_CONN_STATE_CIRCUIT_WAIT;
  2149. if (!circ->base_.timestamp_dirty ||
  2150. ((conn->entry_cfg.isolation_flags & ISO_SOCKSAUTH) &&
  2151. (conn->entry_cfg.socks_iso_keep_alive) &&
  2152. (conn->socks_request->usernamelen ||
  2153. conn->socks_request->passwordlen))) {
  2154. /* When stream isolation is in use and controlled by an application
  2155. * we are willing to keep using the stream. */
  2156. circ->base_.timestamp_dirty = approx_time();
  2157. }
  2158. pathbias_count_use_attempt(circ);
  2159. /* Now, actually link the connection. */
  2160. link_apconn_to_circ(conn, circ, cpath);
  2161. tor_assert(conn->socks_request);
  2162. if (conn->socks_request->command == SOCKS_COMMAND_CONNECT) {
  2163. if (!conn->use_begindir)
  2164. consider_recording_trackhost(conn, circ);
  2165. if (connection_ap_handshake_send_begin(conn) < 0)
  2166. return -1;
  2167. } else {
  2168. if (connection_ap_handshake_send_resolve(conn) < 0)
  2169. return -1;
  2170. }
  2171. return 1;
  2172. }
  2173. /** Try to find a safe live circuit for stream <b>conn</b>. If we find one,
  2174. * attach the stream, send appropriate cells, and return 1. Otherwise,
  2175. * try to launch new circuit(s) for the stream. If we can launch
  2176. * circuits, return 0. Otherwise, if we simply can't proceed with
  2177. * this stream, return -1. (conn needs to die, and is maybe already marked).
  2178. */
  2179. /* XXXX this function should mark for close whenever it returns -1;
  2180. * its callers shouldn't have to worry about that. */
  2181. int
  2182. connection_ap_handshake_attach_circuit(entry_connection_t *conn)
  2183. {
  2184. connection_t *base_conn = ENTRY_TO_CONN(conn);
  2185. int retval;
  2186. int conn_age;
  2187. int want_onehop;
  2188. tor_assert(conn);
  2189. tor_assert(base_conn->state == AP_CONN_STATE_CIRCUIT_WAIT);
  2190. tor_assert(conn->socks_request);
  2191. want_onehop = conn->want_onehop;
  2192. conn_age = (int)(time(NULL) - base_conn->timestamp_created);
  2193. /* Is this connection so old that we should give up on it? */
  2194. if (conn_age >= get_options()->SocksTimeout) {
  2195. int severity = (tor_addr_is_null(&base_conn->addr) && !base_conn->port) ?
  2196. LOG_INFO : LOG_NOTICE;
  2197. log_fn(severity, LD_APP,
  2198. "Tried for %d seconds to get a connection to %s:%d. Giving up.",
  2199. conn_age, safe_str_client(conn->socks_request->address),
  2200. conn->socks_request->port);
  2201. return -1;
  2202. }
  2203. /* We handle "general" (non-onion) connections much more straightforwardly.
  2204. */
  2205. if (!connection_edge_is_rendezvous_stream(ENTRY_TO_EDGE_CONN(conn))) {
  2206. /* we're a general conn */
  2207. origin_circuit_t *circ=NULL;
  2208. /* Are we linked to a dir conn that aims to fetch a consensus?
  2209. * We check here because the conn might no longer be needed. */
  2210. if (base_conn->linked_conn &&
  2211. base_conn->linked_conn->type == CONN_TYPE_DIR &&
  2212. base_conn->linked_conn->purpose == DIR_PURPOSE_FETCH_CONSENSUS) {
  2213. /* Yes we are. Is there a consensus fetch farther along than us? */
  2214. if (networkstatus_consensus_is_already_downloading(
  2215. TO_DIR_CONN(base_conn->linked_conn)->requested_resource)) {
  2216. /* We're doing the "multiple consensus fetch attempts" game from
  2217. * proposal 210, and we're late to the party. Just close this conn.
  2218. * The circuit and TLS conn that we made will time out after a while
  2219. * if nothing else wants to use them. */
  2220. log_info(LD_DIR, "Closing extra consensus fetch (to %s) since one "
  2221. "is already downloading.", base_conn->linked_conn->address);
  2222. return -1;
  2223. }
  2224. }
  2225. /* If we have a chosen exit, we need to use a circuit that's
  2226. * open to that exit. See what exit we meant, and whether we can use it.
  2227. */
  2228. if (conn->chosen_exit_name) {
  2229. const node_t *node = node_get_by_nickname(conn->chosen_exit_name, 1);
  2230. int opt = conn->chosen_exit_optional;
  2231. if (!node && !want_onehop) {
  2232. /* We ran into this warning when trying to extend a circuit to a
  2233. * hidden service directory for which we didn't have a router
  2234. * descriptor. See flyspray task 767 for more details. We should
  2235. * keep this in mind when deciding to use BEGIN_DIR cells for other
  2236. * directory requests as well. -KL*/
  2237. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  2238. "Requested exit point '%s' is not known. %s.",
  2239. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  2240. if (opt) {
  2241. /* If we are allowed to ignore the .exit request, do so */
  2242. conn->chosen_exit_optional = 0;
  2243. tor_free(conn->chosen_exit_name);
  2244. return 0;
  2245. }
  2246. return -1;
  2247. }
  2248. if (node && !connection_ap_can_use_exit(conn, node)) {
  2249. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  2250. "Requested exit point '%s' is excluded or "
  2251. "would refuse request. %s.",
  2252. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  2253. if (opt) {
  2254. /* If we are allowed to ignore the .exit request, do so */
  2255. conn->chosen_exit_optional = 0;
  2256. tor_free(conn->chosen_exit_name);
  2257. return 0;
  2258. }
  2259. return -1;
  2260. }
  2261. }
  2262. /* Find the circuit that we should use, if there is one. Otherwise
  2263. * launch it. */
  2264. retval = circuit_get_open_circ_or_launch(
  2265. conn, CIRCUIT_PURPOSE_C_GENERAL, &circ);
  2266. if (retval < 1) {
  2267. /* We were either told "-1" (complete failure) or 0 (circuit in
  2268. * progress); we can't attach this stream yet. */
  2269. return retval;
  2270. }
  2271. log_debug(LD_APP|LD_CIRC,
  2272. "Attaching apconn to circ %u (stream %d sec old).",
  2273. (unsigned)circ->base_.n_circ_id, conn_age);
  2274. /* print the circ's path, so people can figure out which circs are
  2275. * sucking. */
  2276. circuit_log_path(LOG_INFO,LD_APP|LD_CIRC,circ);
  2277. /* We have found a suitable circuit for our conn. Hurray. Do
  2278. * the attachment. */
  2279. return connection_ap_handshake_attach_chosen_circuit(conn, circ, NULL);
  2280. } else { /* we're a rendezvous conn */
  2281. origin_circuit_t *rendcirc=NULL, *introcirc=NULL;
  2282. tor_assert(!ENTRY_TO_EDGE_CONN(conn)->cpath_layer);
  2283. /* start by finding a rendezvous circuit for us */
  2284. retval = circuit_get_open_circ_or_launch(
  2285. conn, CIRCUIT_PURPOSE_C_REND_JOINED, &rendcirc);
  2286. if (retval < 0) return -1; /* failed */
  2287. if (retval > 0) {
  2288. tor_assert(rendcirc);
  2289. /* one is already established, attach */
  2290. log_info(LD_REND,
  2291. "rend joined circ %u already here. attaching. "
  2292. "(stream %d sec old)",
  2293. (unsigned)rendcirc->base_.n_circ_id, conn_age);
  2294. /* Mark rendezvous circuits as 'newly dirty' every time you use
  2295. * them, since the process of rebuilding a rendezvous circ is so
  2296. * expensive. There is a tradeoff between linkability and
  2297. * feasibility, at this point.
  2298. */
  2299. rendcirc->base_.timestamp_dirty = time(NULL);
  2300. /* We've also attempted to use them. If they fail, we need to
  2301. * probe them for path bias */
  2302. pathbias_count_use_attempt(rendcirc);
  2303. link_apconn_to_circ(conn, rendcirc, NULL);
  2304. if (connection_ap_handshake_send_begin(conn) < 0)
  2305. return 0; /* already marked, let them fade away */
  2306. return 1;
  2307. }
  2308. /* At this point we need to re-check the state, since it's possible that
  2309. * our call to circuit_get_open_circ_or_launch() changed the connection's
  2310. * state from "CIRCUIT_WAIT" to "RENDDESC_WAIT" because we decided to
  2311. * re-fetch the descriptor.
  2312. */
  2313. if (ENTRY_TO_CONN(conn)->state != AP_CONN_STATE_CIRCUIT_WAIT) {
  2314. log_info(LD_REND, "This connection is no longer ready to attach; its "
  2315. "state changed."
  2316. "(We probably have to re-fetch its descriptor.)");
  2317. return 0;
  2318. }
  2319. if (rendcirc && (rendcirc->base_.purpose ==
  2320. CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED)) {
  2321. log_info(LD_REND,
  2322. "pending-join circ %u already here, with intro ack. "
  2323. "Stalling. (stream %d sec old)",
  2324. (unsigned)rendcirc->base_.n_circ_id, conn_age);
  2325. return 0;
  2326. }
  2327. /* it's on its way. find an intro circ. */
  2328. retval = circuit_get_open_circ_or_launch(
  2329. conn, CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT, &introcirc);
  2330. if (retval < 0) return -1; /* failed */
  2331. if (retval > 0) {
  2332. /* one has already sent the intro. keep waiting. */
  2333. tor_assert(introcirc);
  2334. log_info(LD_REND, "Intro circ %u present and awaiting ack (rend %u). "
  2335. "Stalling. (stream %d sec old)",
  2336. (unsigned)introcirc->base_.n_circ_id,
  2337. rendcirc ? (unsigned)rendcirc->base_.n_circ_id : 0,
  2338. conn_age);
  2339. return 0;
  2340. }
  2341. /* now rendcirc and introcirc are each either undefined or not finished */
  2342. if (rendcirc && introcirc &&
  2343. rendcirc->base_.purpose == CIRCUIT_PURPOSE_C_REND_READY) {
  2344. log_info(LD_REND,
  2345. "ready rend circ %u already here (no intro-ack yet on "
  2346. "intro %u). (stream %d sec old)",
  2347. (unsigned)rendcirc->base_.n_circ_id,
  2348. (unsigned)introcirc->base_.n_circ_id, conn_age);
  2349. tor_assert(introcirc->base_.purpose == CIRCUIT_PURPOSE_C_INTRODUCING);
  2350. if (introcirc->base_.state == CIRCUIT_STATE_OPEN) {
  2351. log_info(LD_REND,"found open intro circ %u (rend %u); sending "
  2352. "introduction. (stream %d sec old)",
  2353. (unsigned)introcirc->base_.n_circ_id,
  2354. (unsigned)rendcirc->base_.n_circ_id,
  2355. conn_age);
  2356. switch (rend_client_send_introduction(introcirc, rendcirc)) {
  2357. case 0: /* success */
  2358. rendcirc->base_.timestamp_dirty = time(NULL);
  2359. introcirc->base_.timestamp_dirty = time(NULL);
  2360. pathbias_count_use_attempt(introcirc);
  2361. pathbias_count_use_attempt(rendcirc);
  2362. assert_circuit_ok(TO_CIRCUIT(rendcirc));
  2363. assert_circuit_ok(TO_CIRCUIT(introcirc));
  2364. return 0;
  2365. case -1: /* transient error */
  2366. return 0;
  2367. case -2: /* permanent error */
  2368. return -1;
  2369. default: /* oops */
  2370. tor_fragile_assert();
  2371. return -1;
  2372. }
  2373. }
  2374. }
  2375. log_info(LD_REND, "Intro (%u) and rend (%u) circs are not both ready. "
  2376. "Stalling conn. (%d sec old)",
  2377. introcirc ? (unsigned)introcirc->base_.n_circ_id : 0,
  2378. rendcirc ? (unsigned)rendcirc->base_.n_circ_id : 0, conn_age);
  2379. return 0;
  2380. }
  2381. }
  2382. /** Change <b>circ</b>'s purpose to <b>new_purpose</b>. */
  2383. void
  2384. circuit_change_purpose(circuit_t *circ, uint8_t new_purpose)
  2385. {
  2386. uint8_t old_purpose;
  2387. /* Don't allow an OR circ to become an origin circ or vice versa. */
  2388. tor_assert(!!(CIRCUIT_IS_ORIGIN(circ)) ==
  2389. !!(CIRCUIT_PURPOSE_IS_ORIGIN(new_purpose)));
  2390. if (circ->purpose == new_purpose) return;
  2391. if (CIRCUIT_IS_ORIGIN(circ)) {
  2392. char old_purpose_desc[80] = "";
  2393. strncpy(old_purpose_desc, circuit_purpose_to_string(circ->purpose), 80-1);
  2394. old_purpose_desc[80-1] = '\0';
  2395. log_debug(LD_CIRC,
  2396. "changing purpose of origin circ %d "
  2397. "from \"%s\" (%d) to \"%s\" (%d)",
  2398. TO_ORIGIN_CIRCUIT(circ)->global_identifier,
  2399. old_purpose_desc,
  2400. circ->purpose,
  2401. circuit_purpose_to_string(new_purpose),
  2402. new_purpose);
  2403. }
  2404. old_purpose = circ->purpose;
  2405. circ->purpose = new_purpose;
  2406. if (CIRCUIT_IS_ORIGIN(circ)) {
  2407. control_event_circuit_purpose_changed(TO_ORIGIN_CIRCUIT(circ),
  2408. old_purpose);
  2409. }
  2410. }
  2411. /** Mark <b>circ</b> so that no more connections can be attached to it. */
  2412. void
  2413. mark_circuit_unusable_for_new_conns(origin_circuit_t *circ)
  2414. {
  2415. const or_options_t *options = get_options();
  2416. tor_assert(circ);
  2417. /* XXXX This is a kludge; we're only keeping it around in case there's
  2418. * something that doesn't check unusable_for_new_conns, and to avoid
  2419. * deeper refactoring of our expiration logic. */
  2420. if (! circ->base_.timestamp_dirty)
  2421. circ->base_.timestamp_dirty = approx_time();
  2422. if (options->MaxCircuitDirtiness >= circ->base_.timestamp_dirty)
  2423. circ->base_.timestamp_dirty = 1; /* prevent underflow */
  2424. else
  2425. circ->base_.timestamp_dirty -= options->MaxCircuitDirtiness;
  2426. circ->unusable_for_new_conns = 1;
  2427. }