circuituse.c 118 KB

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