circuituse.c 118 KB

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