circuituse.c 118 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132
  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. if (or_circ->p_chan && channel_is_client(or_circ->p_chan) &&
  1414. !circ->n_chan &&
  1415. !or_circ->n_streams && !or_circ->resolving_streams &&
  1416. channel_when_last_xmit(or_circ->p_chan) <= cutoff) {
  1417. log_info(LD_CIRC, "Closing circ_id %u (empty %d secs ago)",
  1418. (unsigned)or_circ->p_circ_id,
  1419. (int)(now - channel_when_last_xmit(or_circ->p_chan)));
  1420. circuit_mark_for_close(circ, END_CIRC_REASON_FINISHED);
  1421. }
  1422. }
  1423. SMARTLIST_FOREACH_END(circ);
  1424. }
  1425. /** Number of testing circuits we want open before testing our bandwidth. */
  1426. #define NUM_PARALLEL_TESTING_CIRCS 4
  1427. /** True iff we've ever had enough testing circuits open to test our
  1428. * bandwidth. */
  1429. static int have_performed_bandwidth_test = 0;
  1430. /** Reset have_performed_bandwidth_test, so we'll start building
  1431. * testing circuits again so we can exercise our bandwidth. */
  1432. void
  1433. reset_bandwidth_test(void)
  1434. {
  1435. have_performed_bandwidth_test = 0;
  1436. }
  1437. /** Return 1 if we've already exercised our bandwidth, or if we
  1438. * have fewer than NUM_PARALLEL_TESTING_CIRCS testing circuits
  1439. * established or on the way. Else return 0.
  1440. */
  1441. int
  1442. circuit_enough_testing_circs(void)
  1443. {
  1444. int num = 0;
  1445. if (have_performed_bandwidth_test)
  1446. return 1;
  1447. SMARTLIST_FOREACH_BEGIN(circuit_get_global_list(), circuit_t *, circ) {
  1448. if (!circ->marked_for_close && CIRCUIT_IS_ORIGIN(circ) &&
  1449. circ->purpose == CIRCUIT_PURPOSE_TESTING &&
  1450. circ->state == CIRCUIT_STATE_OPEN)
  1451. num++;
  1452. }
  1453. SMARTLIST_FOREACH_END(circ);
  1454. return num >= NUM_PARALLEL_TESTING_CIRCS;
  1455. }
  1456. /** A testing circuit has completed. Take whatever stats we want.
  1457. * Noticing reachability is taken care of in onionskin_answer(),
  1458. * so there's no need to record anything here. But if we still want
  1459. * to do the bandwidth test, and we now have enough testing circuits
  1460. * open, do it.
  1461. */
  1462. static void
  1463. circuit_testing_opened(origin_circuit_t *circ)
  1464. {
  1465. if (have_performed_bandwidth_test ||
  1466. !check_whether_orport_reachable(get_options())) {
  1467. /* either we've already done everything we want with testing circuits,
  1468. * or this testing circuit became open due to a fluke, e.g. we picked
  1469. * a last hop where we already had the connection open due to an
  1470. * outgoing local circuit. */
  1471. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_AT_ORIGIN);
  1472. } else if (circuit_enough_testing_circs()) {
  1473. router_perform_bandwidth_test(NUM_PARALLEL_TESTING_CIRCS, time(NULL));
  1474. have_performed_bandwidth_test = 1;
  1475. } else
  1476. router_do_reachability_checks(1, 0);
  1477. }
  1478. /** A testing circuit has failed to build. Take whatever stats we want. */
  1479. static void
  1480. circuit_testing_failed(origin_circuit_t *circ, int at_last_hop)
  1481. {
  1482. const or_options_t *options = get_options();
  1483. if (server_mode(options) && check_whether_orport_reachable(options))
  1484. return;
  1485. log_info(LD_GENERAL,
  1486. "Our testing circuit (to see if your ORPort is reachable) "
  1487. "has failed. I'll try again later.");
  1488. /* These aren't used yet. */
  1489. (void)circ;
  1490. (void)at_last_hop;
  1491. }
  1492. /** The circuit <b>circ</b> has just become open. Take the next
  1493. * step: for rendezvous circuits, we pass circ to the appropriate
  1494. * function in rendclient or rendservice. For general circuits, we
  1495. * call connection_ap_attach_pending, which looks for pending streams
  1496. * that could use circ.
  1497. */
  1498. void
  1499. circuit_has_opened(origin_circuit_t *circ)
  1500. {
  1501. control_event_circuit_status(circ, CIRC_EVENT_BUILT, 0);
  1502. /* Remember that this circuit has finished building. Now if we start
  1503. * it building again later (e.g. by extending it), we will know not
  1504. * to consider its build time. */
  1505. circ->has_opened = 1;
  1506. switch (TO_CIRCUIT(circ)->purpose) {
  1507. case CIRCUIT_PURPOSE_C_ESTABLISH_REND:
  1508. hs_client_circuit_has_opened(circ);
  1509. /* Start building an intro circ if we don't have one yet. */
  1510. connection_ap_attach_pending(1);
  1511. /* This isn't a call to circuit_try_attaching_streams because a
  1512. * circuit in _C_ESTABLISH_REND state isn't connected to its
  1513. * hidden service yet, thus we can't attach streams to it yet,
  1514. * thus circuit_try_attaching_streams would always clear the
  1515. * circuit's isolation state. circuit_try_attaching_streams is
  1516. * called later, when the rend circ enters _C_REND_JOINED
  1517. * state. */
  1518. break;
  1519. case CIRCUIT_PURPOSE_C_INTRODUCING:
  1520. hs_client_circuit_has_opened(circ);
  1521. break;
  1522. case CIRCUIT_PURPOSE_C_GENERAL:
  1523. case CIRCUIT_PURPOSE_C_HSDIR_GET:
  1524. case CIRCUIT_PURPOSE_S_HSDIR_POST:
  1525. /* Tell any AP connections that have been waiting for a new
  1526. * circuit that one is ready. */
  1527. circuit_try_attaching_streams(circ);
  1528. break;
  1529. case CIRCUIT_PURPOSE_S_ESTABLISH_INTRO:
  1530. /* at the service, waiting for introductions */
  1531. hs_service_circuit_has_opened(circ);
  1532. break;
  1533. case CIRCUIT_PURPOSE_S_CONNECT_REND:
  1534. /* at the service, connecting to rend point */
  1535. hs_service_circuit_has_opened(circ);
  1536. break;
  1537. case CIRCUIT_PURPOSE_TESTING:
  1538. circuit_testing_opened(circ);
  1539. break;
  1540. /* default:
  1541. * This won't happen in normal operation, but might happen if the
  1542. * controller did it. Just let it slide. */
  1543. }
  1544. }
  1545. /** If the stream-isolation state of <b>circ</b> can be cleared, clear
  1546. * it. Return non-zero iff <b>circ</b>'s isolation state was cleared. */
  1547. static int
  1548. circuit_try_clearing_isolation_state(origin_circuit_t *circ)
  1549. {
  1550. if (/* The circuit may have become non-open if it was cannibalized.*/
  1551. circ->base_.state == CIRCUIT_STATE_OPEN &&
  1552. /* If !isolation_values_set, there is nothing to clear. */
  1553. circ->isolation_values_set &&
  1554. /* It's not legal to clear a circuit's isolation info if it's ever had
  1555. * streams attached */
  1556. !circ->isolation_any_streams_attached) {
  1557. /* If we have any isolation information set on this circuit, and
  1558. * we didn't manage to attach any streams to it, then we can
  1559. * and should clear it and try again. */
  1560. circuit_clear_isolation(circ);
  1561. return 1;
  1562. } else {
  1563. return 0;
  1564. }
  1565. }
  1566. /** Called when a circuit becomes ready for streams to be attached to
  1567. * it. */
  1568. void
  1569. circuit_try_attaching_streams(origin_circuit_t *circ)
  1570. {
  1571. /* Attach streams to this circuit if we can. */
  1572. connection_ap_attach_pending(1);
  1573. /* The call to circuit_try_clearing_isolation_state here will do
  1574. * nothing and return 0 if we didn't attach any streams to circ
  1575. * above. */
  1576. if (circuit_try_clearing_isolation_state(circ)) {
  1577. /* Maybe *now* we can attach some streams to this circuit. */
  1578. connection_ap_attach_pending(1);
  1579. }
  1580. }
  1581. /** Called whenever a circuit could not be successfully built.
  1582. */
  1583. void
  1584. circuit_build_failed(origin_circuit_t *circ)
  1585. {
  1586. channel_t *n_chan = NULL;
  1587. /* we should examine circ and see if it failed because of
  1588. * the last hop or an earlier hop. then use this info below.
  1589. */
  1590. int failed_at_last_hop = 0;
  1591. /* First, check to see if this was a path failure, rather than build
  1592. * failure.
  1593. *
  1594. * Note that we deliberately use circuit_get_cpath_len() (and not
  1595. * circuit_get_cpath_opened_len()) because we only want to ensure
  1596. * that a full path is *chosen*. This is different than a full path
  1597. * being *built*. We only want to count *build* failures below.
  1598. *
  1599. * Path selection failures can happen spuriously for a number
  1600. * of reasons (such as aggressive/invalid user-specified path
  1601. * restrictions in the torrc, insufficient microdescriptors, and
  1602. * non-user reasons like exitpolicy issues), and so should not be
  1603. * counted as failures below.
  1604. */
  1605. if (circuit_get_cpath_len(circ) < circ->build_state->desired_path_len) {
  1606. static ratelim_t pathfail_limit = RATELIM_INIT(3600);
  1607. log_fn_ratelim(&pathfail_limit, LOG_NOTICE, LD_CIRC,
  1608. "Our circuit %u (id: %" PRIu32 ") died due to an invalid "
  1609. "selected path, purpose %s. This may be a torrc "
  1610. "configuration issue, or a bug.",
  1611. TO_CIRCUIT(circ)->n_circ_id, circ->global_identifier,
  1612. circuit_purpose_to_string(TO_CIRCUIT(circ)->purpose));
  1613. /* If the path failed on an RP, retry it. */
  1614. if (TO_CIRCUIT(circ)->purpose == CIRCUIT_PURPOSE_S_CONNECT_REND)
  1615. hs_circ_retry_service_rendezvous_point(circ);
  1616. /* In all other cases, just bail. The rest is just failure accounting
  1617. * that we don't want to do */
  1618. return;
  1619. }
  1620. /* If the last hop isn't open, and the second-to-last is, we failed
  1621. * at the last hop. */
  1622. if (circ->cpath &&
  1623. circ->cpath->prev->state != CPATH_STATE_OPEN &&
  1624. circ->cpath->prev->prev->state == CPATH_STATE_OPEN) {
  1625. failed_at_last_hop = 1;
  1626. }
  1627. /* Check if we failed at first hop */
  1628. if (circ->cpath &&
  1629. circ->cpath->state != CPATH_STATE_OPEN &&
  1630. ! circ->base_.received_destroy) {
  1631. /* We failed at the first hop for some reason other than a DESTROY cell.
  1632. * If there's an OR connection to blame, blame it. Also, avoid this relay
  1633. * for a while, and fail any one-hop directory fetches destined for it. */
  1634. const char *n_chan_ident = circ->cpath->extend_info->identity_digest;
  1635. tor_assert(n_chan_ident);
  1636. int already_marked = 0;
  1637. if (circ->base_.n_chan) {
  1638. n_chan = circ->base_.n_chan;
  1639. if (n_chan->is_bad_for_new_circs) {
  1640. /* We only want to blame this router when a fresh healthy
  1641. * connection fails. So don't mark this router as newly failed,
  1642. * since maybe this was just an old circuit attempt that's
  1643. * finally timing out now. Also, there's no need to blow away
  1644. * circuits/streams/etc, since the failure of an unhealthy conn
  1645. * doesn't tell us much about whether a healthy conn would
  1646. * succeed. */
  1647. already_marked = 1;
  1648. }
  1649. log_info(LD_OR,
  1650. "Our circuit %u (id: %" PRIu32 ") failed to get a response "
  1651. "from the first hop (%s). I'm going to try to rotate to a "
  1652. "better connection.",
  1653. TO_CIRCUIT(circ)->n_circ_id, circ->global_identifier,
  1654. channel_get_canonical_remote_descr(n_chan));
  1655. n_chan->is_bad_for_new_circs = 1;
  1656. } else {
  1657. log_info(LD_OR,
  1658. "Our circuit %u (id: %" PRIu32 ") died before the first hop "
  1659. "with no connection",
  1660. TO_CIRCUIT(circ)->n_circ_id, circ->global_identifier);
  1661. }
  1662. if (!already_marked) {
  1663. /*
  1664. * If we have guard state (new guard API) and our path selection
  1665. * code actually chose a full path, then blame the failure of this
  1666. * circuit on the guard.
  1667. */
  1668. if (circ->guard_state)
  1669. entry_guard_failed(&circ->guard_state);
  1670. /* if there are any one-hop streams waiting on this circuit, fail
  1671. * them now so they can retry elsewhere. */
  1672. connection_ap_fail_onehop(n_chan_ident, circ->build_state);
  1673. }
  1674. }
  1675. switch (circ->base_.purpose) {
  1676. case CIRCUIT_PURPOSE_C_HSDIR_GET:
  1677. case CIRCUIT_PURPOSE_S_HSDIR_POST:
  1678. case CIRCUIT_PURPOSE_C_GENERAL:
  1679. /* If we never built the circuit, note it as a failure. */
  1680. circuit_increment_failure_count();
  1681. if (failed_at_last_hop) {
  1682. /* Make sure any streams that demand our last hop as their exit
  1683. * know that it's unlikely to happen. */
  1684. circuit_discard_optional_exit_enclaves(circ->cpath->prev->extend_info);
  1685. }
  1686. break;
  1687. case CIRCUIT_PURPOSE_TESTING:
  1688. circuit_testing_failed(circ, failed_at_last_hop);
  1689. break;
  1690. case CIRCUIT_PURPOSE_S_ESTABLISH_INTRO:
  1691. /* at the service, waiting for introductions */
  1692. if (circ->base_.state != CIRCUIT_STATE_OPEN) {
  1693. circuit_increment_failure_count();
  1694. }
  1695. /* no need to care here, because the service will rebuild intro
  1696. * points periodically. */
  1697. break;
  1698. case CIRCUIT_PURPOSE_C_INTRODUCING:
  1699. /* at the client, connecting to intro point */
  1700. /* Don't increment failure count, since the service may have picked
  1701. * the introduction point maliciously */
  1702. /* The client will pick a new intro point when this one dies, if
  1703. * the stream in question still cares. No need to act here. */
  1704. break;
  1705. case CIRCUIT_PURPOSE_C_ESTABLISH_REND:
  1706. /* at the client, waiting for the service */
  1707. circuit_increment_failure_count();
  1708. /* the client will pick a new rend point when this one dies, if
  1709. * the stream in question still cares. No need to act here. */
  1710. break;
  1711. case CIRCUIT_PURPOSE_S_CONNECT_REND:
  1712. /* at the service, connecting to rend point */
  1713. /* Don't increment failure count, since the client may have picked
  1714. * the rendezvous point maliciously */
  1715. log_info(LD_REND,
  1716. "Couldn't connect to the client's chosen rend point %s "
  1717. "(%s hop failed).",
  1718. escaped(build_state_get_exit_nickname(circ->build_state)),
  1719. failed_at_last_hop?"last":"non-last");
  1720. hs_circ_retry_service_rendezvous_point(circ);
  1721. break;
  1722. /* default:
  1723. * This won't happen in normal operation, but might happen if the
  1724. * controller did it. Just let it slide. */
  1725. }
  1726. }
  1727. /** Number of consecutive failures so far; should only be touched by
  1728. * circuit_launch_new and circuit_*_failure_count.
  1729. */
  1730. static int n_circuit_failures = 0;
  1731. /** Before the last time we called circuit_reset_failure_count(), were
  1732. * there a lot of failures? */
  1733. static int did_circs_fail_last_period = 0;
  1734. /** Don't retry launching a new circuit if we try this many times with no
  1735. * success. */
  1736. #define MAX_CIRCUIT_FAILURES 5
  1737. /** Launch a new circuit; see circuit_launch_by_extend_info() for
  1738. * details on arguments. */
  1739. origin_circuit_t *
  1740. circuit_launch(uint8_t purpose, int flags)
  1741. {
  1742. return circuit_launch_by_extend_info(purpose, NULL, flags);
  1743. }
  1744. /* Do we have enough descriptors to build paths?
  1745. * If need_exit is true, return 1 if we can build exit paths.
  1746. * (We need at least one Exit in the consensus to build exit paths.)
  1747. * If need_exit is false, return 1 if we can build internal paths.
  1748. */
  1749. static int
  1750. have_enough_path_info(int need_exit)
  1751. {
  1752. if (need_exit)
  1753. return router_have_consensus_path() == CONSENSUS_PATH_EXIT;
  1754. else
  1755. return router_have_consensus_path() != CONSENSUS_PATH_UNKNOWN;
  1756. }
  1757. /**
  1758. * Tell us if a circuit is a hidden service circuit.
  1759. */
  1760. int
  1761. circuit_purpose_is_hidden_service(uint8_t purpose)
  1762. {
  1763. if (purpose == CIRCUIT_PURPOSE_HS_VANGUARDS) {
  1764. return 1;
  1765. }
  1766. /* Client-side purpose */
  1767. if (purpose >= CIRCUIT_PURPOSE_C_HS_MIN_ &&
  1768. purpose <= CIRCUIT_PURPOSE_C_HS_MAX_) {
  1769. return 1;
  1770. }
  1771. /* Service-side purpose */
  1772. if (purpose >= CIRCUIT_PURPOSE_S_HS_MIN_ &&
  1773. purpose <= CIRCUIT_PURPOSE_S_HS_MAX_) {
  1774. return 1;
  1775. }
  1776. return 0;
  1777. }
  1778. /**
  1779. * Return true if this circuit purpose should use vanguards
  1780. * or pinned Layer2 or Layer3 guards.
  1781. *
  1782. * This function takes both the circuit purpose and the
  1783. * torrc options for pinned middles/vanguards into account
  1784. * (ie: the circuit must be a hidden service circuit and
  1785. * vanguards/pinned middles must be enabled for it to return
  1786. * true).
  1787. */
  1788. int
  1789. circuit_should_use_vanguards(uint8_t purpose)
  1790. {
  1791. const or_options_t *options = get_options();
  1792. /* Only hidden service circuits use vanguards */
  1793. if (!circuit_purpose_is_hidden_service(purpose))
  1794. return 0;
  1795. /* Pinned middles are effectively vanguards */
  1796. if (options->HSLayer2Nodes || options->HSLayer3Nodes)
  1797. return 1;
  1798. return 0;
  1799. }
  1800. /**
  1801. * Return true for the set of conditions for which it is OK to use
  1802. * a cannibalized circuit.
  1803. *
  1804. * Don't cannibalize for onehops, or certain purposes.
  1805. */
  1806. static int
  1807. circuit_should_cannibalize_to_build(uint8_t purpose_to_build,
  1808. int has_extend_info,
  1809. int onehop_tunnel)
  1810. {
  1811. /* Do not try to cannibalize if this is a one hop circuit. */
  1812. if (onehop_tunnel) {
  1813. return 0;
  1814. }
  1815. /* Don't try to cannibalize for general purpose circuits that do not
  1816. * specify a custom exit. */
  1817. if (purpose_to_build == CIRCUIT_PURPOSE_C_GENERAL && !has_extend_info) {
  1818. return 0;
  1819. }
  1820. /* Don't cannibalize for testing circuits. We want to see if they
  1821. * complete normally. Also don't cannibalize for vanguard-purpose
  1822. * circuits, since those are specially pre-built for later
  1823. * cannibalization by the actual specific circuit types that need
  1824. * vanguards.
  1825. */
  1826. if (purpose_to_build == CIRCUIT_PURPOSE_TESTING ||
  1827. purpose_to_build == CIRCUIT_PURPOSE_HS_VANGUARDS) {
  1828. return 0;
  1829. }
  1830. /* For vanguards, the server-side intro circ is not cannibalized
  1831. * because we pre-build 4 hop HS circuits, and it only needs a 3 hop
  1832. * circuit. It is also long-lived, so it is more important that
  1833. * it have lower latency than get built fast.
  1834. */
  1835. if (circuit_should_use_vanguards(purpose_to_build) &&
  1836. purpose_to_build == CIRCUIT_PURPOSE_S_ESTABLISH_INTRO) {
  1837. return 0;
  1838. }
  1839. return 1;
  1840. }
  1841. /** Launch a new circuit with purpose <b>purpose</b> and exit node
  1842. * <b>extend_info</b> (or NULL to select a random exit node). If flags
  1843. * contains CIRCLAUNCH_NEED_UPTIME, choose among routers with high uptime. If
  1844. * CIRCLAUNCH_NEED_CAPACITY is set, choose among routers with high bandwidth.
  1845. * If CIRCLAUNCH_IS_INTERNAL is true, the last hop need not be an exit node.
  1846. * If CIRCLAUNCH_ONEHOP_TUNNEL is set, the circuit will have only one hop.
  1847. * Return the newly allocated circuit on success, or NULL on failure. */
  1848. origin_circuit_t *
  1849. circuit_launch_by_extend_info(uint8_t purpose,
  1850. extend_info_t *extend_info,
  1851. int flags)
  1852. {
  1853. origin_circuit_t *circ;
  1854. int onehop_tunnel = (flags & CIRCLAUNCH_ONEHOP_TUNNEL) != 0;
  1855. int have_path = have_enough_path_info(! (flags & CIRCLAUNCH_IS_INTERNAL) );
  1856. /* Keep some stats about our attempts to launch HS rendezvous circuits */
  1857. if (purpose == CIRCUIT_PURPOSE_S_CONNECT_REND) {
  1858. hs_stats_note_service_rendezvous_launch();
  1859. }
  1860. if (!onehop_tunnel && (!router_have_minimum_dir_info() || !have_path)) {
  1861. log_debug(LD_CIRC,"Haven't %s yet; canceling "
  1862. "circuit launch.",
  1863. !router_have_minimum_dir_info() ?
  1864. "fetched enough directory info" :
  1865. "received a consensus with exits");
  1866. return NULL;
  1867. }
  1868. /* If we can/should cannibalize another circuit to build this one,
  1869. * then do so. */
  1870. if (circuit_should_cannibalize_to_build(purpose,
  1871. extend_info != NULL,
  1872. onehop_tunnel)) {
  1873. /* see if there are appropriate circs available to cannibalize. */
  1874. /* XXX if we're planning to add a hop, perhaps we want to look for
  1875. * internal circs rather than exit circs? -RD */
  1876. circ = circuit_find_to_cannibalize(purpose, extend_info, flags);
  1877. if (circ) {
  1878. uint8_t old_purpose = circ->base_.purpose;
  1879. struct timeval old_timestamp_began = circ->base_.timestamp_began;
  1880. log_info(LD_CIRC, "Cannibalizing circ %u (id: %" PRIu32 ") for "
  1881. "purpose %d (%s)",
  1882. TO_CIRCUIT(circ)->n_circ_id, circ->global_identifier, purpose,
  1883. circuit_purpose_to_string(purpose));
  1884. if ((purpose == CIRCUIT_PURPOSE_S_CONNECT_REND ||
  1885. purpose == CIRCUIT_PURPOSE_C_INTRODUCING) &&
  1886. circ->path_state == PATH_STATE_BUILD_SUCCEEDED) {
  1887. /* Path bias: Cannibalized rends pre-emptively count as a
  1888. * successfully built but unused closed circuit. We don't
  1889. * wait until the extend (or the close) because the rend
  1890. * point could be malicious.
  1891. *
  1892. * Same deal goes for client side introductions. Clients
  1893. * can be manipulated to connect repeatedly to them
  1894. * (especially web clients).
  1895. *
  1896. * If we decide to probe the initial portion of these circs,
  1897. * (up to the adversary's final hop), we need to remove this,
  1898. * or somehow mark the circuit with a special path state.
  1899. */
  1900. /* This must be called before the purpose change */
  1901. pathbias_check_close(circ, END_CIRC_REASON_FINISHED);
  1902. }
  1903. circuit_change_purpose(TO_CIRCUIT(circ), purpose);
  1904. /* Reset the start date of this circ, else expire_building
  1905. * will see it and think it's been trying to build since it
  1906. * began.
  1907. *
  1908. * Technically, the code should reset this when the
  1909. * create cell is finally sent, but we're close enough
  1910. * here. */
  1911. tor_gettimeofday(&circ->base_.timestamp_began);
  1912. control_event_circuit_cannibalized(circ, old_purpose,
  1913. &old_timestamp_began);
  1914. switch (purpose) {
  1915. case CIRCUIT_PURPOSE_C_ESTABLISH_REND:
  1916. /* it's ready right now */
  1917. break;
  1918. case CIRCUIT_PURPOSE_C_INTRODUCING:
  1919. case CIRCUIT_PURPOSE_S_CONNECT_REND:
  1920. case CIRCUIT_PURPOSE_C_GENERAL:
  1921. case CIRCUIT_PURPOSE_S_HSDIR_POST:
  1922. case CIRCUIT_PURPOSE_C_HSDIR_GET:
  1923. case CIRCUIT_PURPOSE_S_ESTABLISH_INTRO:
  1924. /* need to add a new hop */
  1925. tor_assert(extend_info);
  1926. if (circuit_extend_to_new_exit(circ, extend_info) < 0)
  1927. return NULL;
  1928. break;
  1929. default:
  1930. log_warn(LD_BUG,
  1931. "unexpected purpose %d when cannibalizing a circ.",
  1932. purpose);
  1933. tor_fragile_assert();
  1934. return NULL;
  1935. }
  1936. return circ;
  1937. }
  1938. }
  1939. if (did_circs_fail_last_period &&
  1940. n_circuit_failures > MAX_CIRCUIT_FAILURES) {
  1941. /* too many failed circs in a row. don't try. */
  1942. // log_fn(LOG_INFO,"%d failures so far, not trying.",n_circuit_failures);
  1943. return NULL;
  1944. }
  1945. /* try a circ. if it fails, circuit_mark_for_close will increment
  1946. * n_circuit_failures */
  1947. return circuit_establish_circuit(purpose, extend_info, flags);
  1948. }
  1949. /** Record another failure at opening a general circuit. When we have
  1950. * too many, we'll stop trying for the remainder of this minute.
  1951. */
  1952. static void
  1953. circuit_increment_failure_count(void)
  1954. {
  1955. ++n_circuit_failures;
  1956. log_debug(LD_CIRC,"n_circuit_failures now %d.",n_circuit_failures);
  1957. }
  1958. /** Reset the failure count for opening general circuits. This means
  1959. * we will try MAX_CIRCUIT_FAILURES times more (if necessary) before
  1960. * stopping again.
  1961. */
  1962. void
  1963. circuit_reset_failure_count(int timeout)
  1964. {
  1965. if (timeout && n_circuit_failures > MAX_CIRCUIT_FAILURES)
  1966. did_circs_fail_last_period = 1;
  1967. else
  1968. did_circs_fail_last_period = 0;
  1969. n_circuit_failures = 0;
  1970. }
  1971. /** Find an open circ that we're happy to use for <b>conn</b> and return 1. If
  1972. * there isn't one, and there isn't one on the way, launch one and return
  1973. * 0. If it will never work, return -1.
  1974. *
  1975. * Write the found or in-progress or launched circ into *circp.
  1976. */
  1977. static int
  1978. circuit_get_open_circ_or_launch(entry_connection_t *conn,
  1979. uint8_t desired_circuit_purpose,
  1980. origin_circuit_t **circp)
  1981. {
  1982. origin_circuit_t *circ;
  1983. int check_exit_policy;
  1984. int need_uptime, need_internal;
  1985. int want_onehop;
  1986. const or_options_t *options = get_options();
  1987. tor_assert(conn);
  1988. tor_assert(circp);
  1989. if (ENTRY_TO_CONN(conn)->state != AP_CONN_STATE_CIRCUIT_WAIT) {
  1990. connection_t *c = ENTRY_TO_CONN(conn);
  1991. log_err(LD_BUG, "Connection state mismatch: wanted "
  1992. "AP_CONN_STATE_CIRCUIT_WAIT, but got %d (%s)",
  1993. c->state, conn_state_to_string(c->type, c->state));
  1994. }
  1995. tor_assert(ENTRY_TO_CONN(conn)->state == AP_CONN_STATE_CIRCUIT_WAIT);
  1996. /* Will the exit policy of the exit node apply to this stream? */
  1997. check_exit_policy =
  1998. conn->socks_request->command == SOCKS_COMMAND_CONNECT &&
  1999. !conn->use_begindir &&
  2000. !connection_edge_is_rendezvous_stream(ENTRY_TO_EDGE_CONN(conn));
  2001. /* Does this connection want a one-hop circuit? */
  2002. want_onehop = conn->want_onehop;
  2003. /* Do we need a high-uptime circuit? */
  2004. need_uptime = !conn->want_onehop && !conn->use_begindir &&
  2005. smartlist_contains_int_as_string(options->LongLivedPorts,
  2006. conn->socks_request->port);
  2007. /* Do we need an "internal" circuit? */
  2008. if (desired_circuit_purpose != CIRCUIT_PURPOSE_C_GENERAL)
  2009. need_internal = 1;
  2010. else if (conn->use_begindir || conn->want_onehop)
  2011. need_internal = 1;
  2012. else
  2013. need_internal = 0;
  2014. /* We now know what kind of circuit we need. See if there is an
  2015. * open circuit that we can use for this stream */
  2016. circ = circuit_get_best(conn, 1 /* Insist on open circuits */,
  2017. desired_circuit_purpose,
  2018. need_uptime, need_internal);
  2019. if (circ) {
  2020. /* We got a circuit that will work for this stream! We can return it. */
  2021. *circp = circ;
  2022. return 1; /* we're happy */
  2023. }
  2024. /* Okay, there's no circuit open that will work for this stream. Let's
  2025. * see if there's an in-progress circuit or if we have to launch one */
  2026. /* Do we know enough directory info to build circuits at all? */
  2027. int have_path = have_enough_path_info(!need_internal);
  2028. if (!want_onehop && (!router_have_minimum_dir_info() || !have_path)) {
  2029. /* If we don't have enough directory information, we can't build
  2030. * multihop circuits.
  2031. */
  2032. if (!connection_get_by_type(CONN_TYPE_DIR)) {
  2033. int severity = LOG_NOTICE;
  2034. /* Retry some stuff that might help the connection work. */
  2035. /* If we are configured with EntryNodes or UseBridges */
  2036. if (entry_list_is_constrained(options)) {
  2037. /* Retry all our guards / bridges.
  2038. * guards_retry_optimistic() always returns true here. */
  2039. int rv = guards_retry_optimistic(options);
  2040. tor_assert_nonfatal_once(rv);
  2041. log_fn(severity, LD_APP|LD_DIR,
  2042. "Application request when we haven't %s. "
  2043. "Optimistically trying known %s again.",
  2044. !router_have_minimum_dir_info() ?
  2045. "used client functionality lately" :
  2046. "received a consensus with exits",
  2047. options->UseBridges ? "bridges" : "entrynodes");
  2048. } else {
  2049. /* Getting directory documents doesn't help much if we have a limited
  2050. * number of guards */
  2051. tor_assert_nonfatal(!options->UseBridges);
  2052. tor_assert_nonfatal(!options->EntryNodes);
  2053. /* Retry our directory fetches, so we have a fresh set of guard info */
  2054. log_fn(severity, LD_APP|LD_DIR,
  2055. "Application request when we haven't %s. "
  2056. "Optimistically trying directory fetches again.",
  2057. !router_have_minimum_dir_info() ?
  2058. "used client functionality lately" :
  2059. "received a consensus with exits");
  2060. routerlist_retry_directory_downloads(time(NULL));
  2061. }
  2062. }
  2063. /* Since we didn't have enough directory info, we can't attach now. The
  2064. * stream will be dealt with when router_have_minimum_dir_info becomes 1,
  2065. * or when all directory attempts fail and directory_all_unreachable()
  2066. * kills it.
  2067. */
  2068. return 0;
  2069. }
  2070. /* Check whether the exit policy of the chosen exit, or the exit policies
  2071. * of _all_ nodes, would forbid this node. */
  2072. if (check_exit_policy) {
  2073. if (!conn->chosen_exit_name) {
  2074. struct in_addr in;
  2075. tor_addr_t addr, *addrp=NULL;
  2076. if (tor_inet_aton(conn->socks_request->address, &in)) {
  2077. tor_addr_from_in(&addr, &in);
  2078. addrp = &addr;
  2079. }
  2080. if (router_exit_policy_all_nodes_reject(addrp,
  2081. conn->socks_request->port,
  2082. need_uptime)) {
  2083. log_notice(LD_APP,
  2084. "No Tor server allows exit to %s:%d. Rejecting.",
  2085. safe_str_client(conn->socks_request->address),
  2086. conn->socks_request->port);
  2087. return -1;
  2088. }
  2089. } else {
  2090. /* XXXX Duplicates checks in connection_ap_handshake_attach_circuit:
  2091. * refactor into a single function. */
  2092. const node_t *node = node_get_by_nickname(conn->chosen_exit_name, 0);
  2093. int opt = conn->chosen_exit_optional;
  2094. if (node && !connection_ap_can_use_exit(conn, node)) {
  2095. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  2096. "Requested exit point '%s' is excluded or "
  2097. "would refuse request. %s.",
  2098. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  2099. if (opt) {
  2100. conn->chosen_exit_optional = 0;
  2101. tor_free(conn->chosen_exit_name);
  2102. /* Try again. */
  2103. return circuit_get_open_circ_or_launch(conn,
  2104. desired_circuit_purpose,
  2105. circp);
  2106. }
  2107. return -1;
  2108. }
  2109. }
  2110. }
  2111. /* Now, check whether there already a circuit on the way that could handle
  2112. * this stream. This check matches the one above, but this time we
  2113. * do not require that the circuit will work. */
  2114. circ = circuit_get_best(conn, 0 /* don't insist on open circuits */,
  2115. desired_circuit_purpose,
  2116. need_uptime, need_internal);
  2117. if (circ)
  2118. log_debug(LD_CIRC, "one on the way!");
  2119. if (!circ) {
  2120. /* No open or in-progress circuit could handle this stream! We
  2121. * will have to launch one!
  2122. */
  2123. /* The chosen exit node, if there is one. */
  2124. extend_info_t *extend_info=NULL;
  2125. const int n_pending = count_pending_general_client_circuits();
  2126. /* Do we have too many pending circuits? */
  2127. if (n_pending >= options->MaxClientCircuitsPending) {
  2128. static ratelim_t delay_limit = RATELIM_INIT(10*60);
  2129. char *m;
  2130. if ((m = rate_limit_log(&delay_limit, approx_time()))) {
  2131. log_notice(LD_APP, "We'd like to launch a circuit to handle a "
  2132. "connection, but we already have %d general-purpose client "
  2133. "circuits pending. Waiting until some finish.%s",
  2134. n_pending, m);
  2135. tor_free(m);
  2136. }
  2137. return 0;
  2138. }
  2139. /* If this is a hidden service trying to start an introduction point,
  2140. * handle that case. */
  2141. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT) {
  2142. const edge_connection_t *edge_conn = ENTRY_TO_EDGE_CONN(conn);
  2143. /* need to pick an intro point */
  2144. extend_info = hs_client_get_random_intro_from_edge(edge_conn);
  2145. if (!extend_info) {
  2146. log_info(LD_REND, "No intro points: re-fetching service descriptor.");
  2147. if (edge_conn->rend_data) {
  2148. rend_client_refetch_v2_renddesc(edge_conn->rend_data);
  2149. } else {
  2150. hs_client_refetch_hsdesc(&edge_conn->hs_ident->identity_pk);
  2151. }
  2152. connection_ap_mark_as_waiting_for_renddesc(conn);
  2153. return 0;
  2154. }
  2155. log_info(LD_REND,"Chose %s as intro point for '%s'.",
  2156. extend_info_describe(extend_info),
  2157. (edge_conn->rend_data) ?
  2158. safe_str_client(rend_data_get_address(edge_conn->rend_data)) :
  2159. "service");
  2160. }
  2161. /* If we have specified a particular exit node for our
  2162. * connection, then be sure to open a circuit to that exit node.
  2163. */
  2164. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_GENERAL ||
  2165. desired_circuit_purpose == CIRCUIT_PURPOSE_S_HSDIR_POST ||
  2166. desired_circuit_purpose == CIRCUIT_PURPOSE_C_HSDIR_GET) {
  2167. if (conn->chosen_exit_name) {
  2168. const node_t *r;
  2169. int opt = conn->chosen_exit_optional;
  2170. r = node_get_by_nickname(conn->chosen_exit_name, 0);
  2171. if (r && node_has_preferred_descriptor(r, conn->want_onehop ? 1 : 0)) {
  2172. /* We might want to connect to an IPv6 bridge for loading
  2173. descriptors so we use the preferred address rather than
  2174. the primary. */
  2175. extend_info = extend_info_from_node(r, conn->want_onehop ? 1 : 0);
  2176. if (!extend_info) {
  2177. log_warn(LD_CIRC,"Could not make a one-hop connection to %s. "
  2178. "Discarding this circuit.", conn->chosen_exit_name);
  2179. return -1;
  2180. }
  2181. } else { /* ! (r && node_has_preferred_descriptor(...)) */
  2182. log_debug(LD_DIR, "considering %d, %s",
  2183. want_onehop, conn->chosen_exit_name);
  2184. if (want_onehop && conn->chosen_exit_name[0] == '$') {
  2185. /* We're asking for a one-hop circuit to a router that
  2186. * we don't have a routerinfo about. Make up an extend_info. */
  2187. /* XXX prop220: we need to make chosen_exit_name able to
  2188. * encode both key formats. This is not absolutely critical
  2189. * since this is just for one-hop circuits, but we should
  2190. * still get it done */
  2191. char digest[DIGEST_LEN];
  2192. char *hexdigest = conn->chosen_exit_name+1;
  2193. tor_addr_t addr;
  2194. if (strlen(hexdigest) < HEX_DIGEST_LEN ||
  2195. base16_decode(digest,DIGEST_LEN,
  2196. hexdigest,HEX_DIGEST_LEN) != DIGEST_LEN) {
  2197. log_info(LD_DIR, "Broken exit digest on tunnel conn. Closing.");
  2198. return -1;
  2199. }
  2200. if (tor_addr_parse(&addr, conn->socks_request->address) < 0) {
  2201. log_info(LD_DIR, "Broken address %s on tunnel conn. Closing.",
  2202. escaped_safe_str_client(conn->socks_request->address));
  2203. return -1;
  2204. }
  2205. /* XXXX prop220 add a workaround for ed25519 ID below*/
  2206. extend_info = extend_info_new(conn->chosen_exit_name+1,
  2207. digest,
  2208. NULL, /* Ed25519 ID */
  2209. NULL, NULL, /* onion keys */
  2210. &addr, conn->socks_request->port);
  2211. } else { /* ! (want_onehop && conn->chosen_exit_name[0] == '$') */
  2212. /* We will need an onion key for the router, and we
  2213. * don't have one. Refuse or relax requirements. */
  2214. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  2215. "Requested exit point '%s' is not known. %s.",
  2216. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  2217. if (opt) {
  2218. conn->chosen_exit_optional = 0;
  2219. tor_free(conn->chosen_exit_name);
  2220. /* Try again with no requested exit */
  2221. return circuit_get_open_circ_or_launch(conn,
  2222. desired_circuit_purpose,
  2223. circp);
  2224. }
  2225. return -1;
  2226. }
  2227. }
  2228. }
  2229. } /* Done checking for general circutis with chosen exits. */
  2230. /* What purpose do we need to launch this circuit with? */
  2231. uint8_t new_circ_purpose;
  2232. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_REND_JOINED)
  2233. new_circ_purpose = CIRCUIT_PURPOSE_C_ESTABLISH_REND;
  2234. else if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT)
  2235. new_circ_purpose = CIRCUIT_PURPOSE_C_INTRODUCING;
  2236. else
  2237. new_circ_purpose = desired_circuit_purpose;
  2238. /* Determine what kind of a circuit to launch, and actually launch it. */
  2239. {
  2240. int flags = CIRCLAUNCH_NEED_CAPACITY;
  2241. if (want_onehop) flags |= CIRCLAUNCH_ONEHOP_TUNNEL;
  2242. if (need_uptime) flags |= CIRCLAUNCH_NEED_UPTIME;
  2243. if (need_internal) flags |= CIRCLAUNCH_IS_INTERNAL;
  2244. /* If we are about to pick a v3 RP right now, make sure we pick a
  2245. * rendezvous point that supports the v3 protocol! */
  2246. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_REND_JOINED &&
  2247. new_circ_purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND &&
  2248. ENTRY_TO_EDGE_CONN(conn)->hs_ident) {
  2249. flags |= CIRCLAUNCH_IS_V3_RP;
  2250. log_info(LD_GENERAL, "Getting rendezvous circuit to v3 service!");
  2251. }
  2252. circ = circuit_launch_by_extend_info(new_circ_purpose, extend_info,
  2253. flags);
  2254. }
  2255. extend_info_free(extend_info);
  2256. /* Now trigger things that need to happen when we launch circuits */
  2257. if (desired_circuit_purpose == CIRCUIT_PURPOSE_C_GENERAL ||
  2258. desired_circuit_purpose == CIRCUIT_PURPOSE_C_HSDIR_GET ||
  2259. desired_circuit_purpose == CIRCUIT_PURPOSE_S_HSDIR_POST) {
  2260. /* We just caused a circuit to get built because of this stream.
  2261. * If this stream has caused a _lot_ of circuits to be built, that's
  2262. * a bad sign: we should tell the user. */
  2263. if (conn->num_circuits_launched < NUM_CIRCUITS_LAUNCHED_THRESHOLD &&
  2264. ++conn->num_circuits_launched == NUM_CIRCUITS_LAUNCHED_THRESHOLD)
  2265. log_info(LD_CIRC, "The application request to %s:%d has launched "
  2266. "%d circuits without finding one it likes.",
  2267. escaped_safe_str_client(conn->socks_request->address),
  2268. conn->socks_request->port,
  2269. conn->num_circuits_launched);
  2270. } else {
  2271. /* help predict this next time */
  2272. rep_hist_note_used_internal(time(NULL), need_uptime, 1);
  2273. if (circ) {
  2274. const edge_connection_t *edge_conn = ENTRY_TO_EDGE_CONN(conn);
  2275. if (edge_conn->rend_data) {
  2276. /* write the service_id into circ */
  2277. circ->rend_data = rend_data_dup(edge_conn->rend_data);
  2278. } else if (edge_conn->hs_ident) {
  2279. circ->hs_ident =
  2280. hs_ident_circuit_new(&edge_conn->hs_ident->identity_pk,
  2281. HS_IDENT_CIRCUIT_INTRO);
  2282. }
  2283. if (circ->base_.purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND &&
  2284. circ->base_.state == CIRCUIT_STATE_OPEN)
  2285. circuit_has_opened(circ);
  2286. }
  2287. }
  2288. } /* endif (!circ) */
  2289. /* We either found a good circuit, or launched a new circuit, or failed to
  2290. * do so. Report success, and delay. */
  2291. if (circ) {
  2292. /* Mark the circuit with the isolation fields for this connection.
  2293. * When the circuit arrives, we'll clear these flags: this is
  2294. * just some internal bookkeeping to make sure that we have
  2295. * launched enough circuits.
  2296. */
  2297. connection_edge_update_circuit_isolation(conn, circ, 0);
  2298. } else {
  2299. log_info(LD_APP,
  2300. "No safe circuit (purpose %d) ready for edge "
  2301. "connection; delaying.",
  2302. desired_circuit_purpose);
  2303. }
  2304. *circp = circ;
  2305. return 0;
  2306. }
  2307. /** Return true iff <b>crypt_path</b> is one of the crypt_paths for
  2308. * <b>circ</b>. */
  2309. static int
  2310. cpath_is_on_circuit(origin_circuit_t *circ, crypt_path_t *crypt_path)
  2311. {
  2312. crypt_path_t *cpath, *cpath_next = NULL;
  2313. for (cpath = circ->cpath; cpath_next != circ->cpath; cpath = cpath_next) {
  2314. cpath_next = cpath->next;
  2315. if (crypt_path == cpath)
  2316. return 1;
  2317. }
  2318. return 0;
  2319. }
  2320. /** Return true iff client-side optimistic data is supported. */
  2321. static int
  2322. optimistic_data_enabled(void)
  2323. {
  2324. const or_options_t *options = get_options();
  2325. if (options->OptimisticData < 0) {
  2326. /* Note: this default was 0 before #18815 was merged. We can't take the
  2327. * parameter out of the consensus until versions before that are all
  2328. * obsolete. */
  2329. const int32_t enabled =
  2330. networkstatus_get_param(NULL, "UseOptimisticData", /*default*/ 1, 0, 1);
  2331. return (int)enabled;
  2332. }
  2333. return options->OptimisticData;
  2334. }
  2335. /** Attach the AP stream <b>apconn</b> to circ's linked list of
  2336. * p_streams. Also set apconn's cpath_layer to <b>cpath</b>, or to the last
  2337. * hop in circ's cpath if <b>cpath</b> is NULL.
  2338. */
  2339. static void
  2340. link_apconn_to_circ(entry_connection_t *apconn, origin_circuit_t *circ,
  2341. crypt_path_t *cpath)
  2342. {
  2343. const node_t *exitnode = NULL;
  2344. /* add it into the linked list of streams on this circuit */
  2345. log_debug(LD_APP|LD_CIRC, "attaching new conn to circ. n_circ_id %u.",
  2346. (unsigned)circ->base_.n_circ_id);
  2347. /* reset it, so we can measure circ timeouts */
  2348. ENTRY_TO_CONN(apconn)->timestamp_last_read_allowed = time(NULL);
  2349. ENTRY_TO_EDGE_CONN(apconn)->next_stream = circ->p_streams;
  2350. ENTRY_TO_EDGE_CONN(apconn)->on_circuit = TO_CIRCUIT(circ);
  2351. /* assert_connection_ok(conn, time(NULL)); */
  2352. circ->p_streams = ENTRY_TO_EDGE_CONN(apconn);
  2353. if (connection_edge_is_rendezvous_stream(ENTRY_TO_EDGE_CONN(apconn))) {
  2354. /* We are attaching a stream to a rendezvous circuit. That means
  2355. * that an attempt to connect to a hidden service just
  2356. * succeeded. Tell rendclient.c. */
  2357. hs_client_note_connection_attempt_succeeded(ENTRY_TO_EDGE_CONN(apconn));
  2358. }
  2359. if (cpath) { /* we were given one; use it */
  2360. tor_assert(cpath_is_on_circuit(circ, cpath));
  2361. } else {
  2362. /* use the last hop in the circuit */
  2363. tor_assert(circ->cpath);
  2364. tor_assert(circ->cpath->prev);
  2365. tor_assert(circ->cpath->prev->state == CPATH_STATE_OPEN);
  2366. cpath = circ->cpath->prev;
  2367. }
  2368. ENTRY_TO_EDGE_CONN(apconn)->cpath_layer = cpath;
  2369. circ->isolation_any_streams_attached = 1;
  2370. connection_edge_update_circuit_isolation(apconn, circ, 0);
  2371. /* Compute the exitnode if possible, for logging below */
  2372. if (cpath->extend_info)
  2373. exitnode = node_get_by_id(cpath->extend_info->identity_digest);
  2374. /* See if we can use optimistic data on this circuit */
  2375. if (optimistic_data_enabled() &&
  2376. (circ->base_.purpose == CIRCUIT_PURPOSE_C_GENERAL ||
  2377. circ->base_.purpose == CIRCUIT_PURPOSE_C_HSDIR_GET ||
  2378. circ->base_.purpose == CIRCUIT_PURPOSE_S_HSDIR_POST ||
  2379. circ->base_.purpose == CIRCUIT_PURPOSE_C_REND_JOINED))
  2380. apconn->may_use_optimistic_data = 1;
  2381. else
  2382. apconn->may_use_optimistic_data = 0;
  2383. log_info(LD_APP, "Looks like completed circuit to %s %s allow "
  2384. "optimistic data for connection to %s",
  2385. circ->base_.purpose == CIRCUIT_PURPOSE_C_GENERAL ?
  2386. /* node_describe() does the right thing if exitnode is NULL */
  2387. safe_str_client(node_describe(exitnode)) :
  2388. "hidden service",
  2389. apconn->may_use_optimistic_data ? "does" : "doesn't",
  2390. safe_str_client(apconn->socks_request->address));
  2391. }
  2392. /** Return true iff <b>address</b> is matched by one of the entries in
  2393. * TrackHostExits. */
  2394. int
  2395. hostname_in_track_host_exits(const or_options_t *options, const char *address)
  2396. {
  2397. if (!options->TrackHostExits)
  2398. return 0;
  2399. SMARTLIST_FOREACH_BEGIN(options->TrackHostExits, const char *, cp) {
  2400. if (cp[0] == '.') { /* match end */
  2401. if (cp[1] == '\0' ||
  2402. !strcasecmpend(address, cp) ||
  2403. !strcasecmp(address, &cp[1]))
  2404. return 1;
  2405. } else if (strcasecmp(cp, address) == 0) {
  2406. return 1;
  2407. }
  2408. } SMARTLIST_FOREACH_END(cp);
  2409. return 0;
  2410. }
  2411. /** If an exit wasn't explicitly specified for <b>conn</b>, consider saving
  2412. * the exit that we *did* choose for use by future connections to
  2413. * <b>conn</b>'s destination.
  2414. */
  2415. static void
  2416. consider_recording_trackhost(const entry_connection_t *conn,
  2417. const origin_circuit_t *circ)
  2418. {
  2419. const or_options_t *options = get_options();
  2420. char *new_address = NULL;
  2421. char fp[HEX_DIGEST_LEN+1];
  2422. /* Search the addressmap for this conn's destination. */
  2423. /* If they're not in the address map.. */
  2424. if (!options->TrackHostExits ||
  2425. addressmap_have_mapping(conn->socks_request->address,
  2426. options->TrackHostExitsExpire))
  2427. return; /* nothing to track, or already mapped */
  2428. if (!hostname_in_track_host_exits(options, conn->socks_request->address) ||
  2429. !circ->build_state->chosen_exit)
  2430. return;
  2431. /* write down the fingerprint of the chosen exit, not the nickname,
  2432. * because the chosen exit might not be named. */
  2433. base16_encode(fp, sizeof(fp),
  2434. circ->build_state->chosen_exit->identity_digest, DIGEST_LEN);
  2435. /* Add this exit/hostname pair to the addressmap. */
  2436. tor_asprintf(&new_address, "%s.%s.exit",
  2437. conn->socks_request->address, fp);
  2438. addressmap_register(conn->socks_request->address, new_address,
  2439. time(NULL) + options->TrackHostExitsExpire,
  2440. ADDRMAPSRC_TRACKEXIT, 0, 0);
  2441. }
  2442. /** Attempt to attach the connection <b>conn</b> to <b>circ</b>, and send a
  2443. * begin or resolve cell as appropriate. Return values are as for
  2444. * connection_ap_handshake_attach_circuit. The stream will exit from the hop
  2445. * indicated by <b>cpath</b>, or from the last hop in circ's cpath if
  2446. * <b>cpath</b> is NULL. */
  2447. int
  2448. connection_ap_handshake_attach_chosen_circuit(entry_connection_t *conn,
  2449. origin_circuit_t *circ,
  2450. crypt_path_t *cpath)
  2451. {
  2452. connection_t *base_conn = ENTRY_TO_CONN(conn);
  2453. tor_assert(conn);
  2454. tor_assert(base_conn->state == AP_CONN_STATE_CIRCUIT_WAIT ||
  2455. base_conn->state == AP_CONN_STATE_CONTROLLER_WAIT);
  2456. tor_assert(conn->socks_request);
  2457. tor_assert(circ);
  2458. tor_assert(circ->base_.state == CIRCUIT_STATE_OPEN);
  2459. base_conn->state = AP_CONN_STATE_CIRCUIT_WAIT;
  2460. if (!circ->base_.timestamp_dirty ||
  2461. ((conn->entry_cfg.isolation_flags & ISO_SOCKSAUTH) &&
  2462. (conn->entry_cfg.socks_iso_keep_alive) &&
  2463. (conn->socks_request->usernamelen ||
  2464. conn->socks_request->passwordlen))) {
  2465. /* When stream isolation is in use and controlled by an application
  2466. * we are willing to keep using the stream. */
  2467. circ->base_.timestamp_dirty = approx_time();
  2468. }
  2469. pathbias_count_use_attempt(circ);
  2470. /* Now, actually link the connection. */
  2471. link_apconn_to_circ(conn, circ, cpath);
  2472. tor_assert(conn->socks_request);
  2473. if (conn->socks_request->command == SOCKS_COMMAND_CONNECT) {
  2474. if (!conn->use_begindir)
  2475. consider_recording_trackhost(conn, circ);
  2476. if (connection_ap_handshake_send_begin(conn) < 0)
  2477. return -1;
  2478. } else {
  2479. if (connection_ap_handshake_send_resolve(conn) < 0)
  2480. return -1;
  2481. }
  2482. return 1;
  2483. }
  2484. /**
  2485. * Return an appropriate circuit purpose for non-rend streams.
  2486. * We don't handle rends here because a rend stream triggers two
  2487. * circuit builds with different purposes, so it is handled elsewhere.
  2488. *
  2489. * This function just figures out what type of hsdir activity this is,
  2490. * and tells us. Everything else is general.
  2491. */
  2492. static int
  2493. connection_ap_get_nonrend_circ_purpose(const entry_connection_t *conn)
  2494. {
  2495. const connection_t *base_conn = ENTRY_TO_CONN(conn);
  2496. tor_assert_nonfatal(!connection_edge_is_rendezvous_stream(
  2497. ENTRY_TO_EDGE_CONN(conn)));
  2498. if (base_conn->linked_conn &&
  2499. base_conn->linked_conn->type == CONN_TYPE_DIR) {
  2500. /* Set a custom purpose for hsdir activity */
  2501. if (base_conn->linked_conn->purpose == DIR_PURPOSE_UPLOAD_RENDDESC_V2 ||
  2502. base_conn->linked_conn->purpose == DIR_PURPOSE_UPLOAD_HSDESC) {
  2503. return CIRCUIT_PURPOSE_S_HSDIR_POST;
  2504. } else if (base_conn->linked_conn->purpose
  2505. == DIR_PURPOSE_FETCH_RENDDESC_V2 ||
  2506. base_conn->linked_conn->purpose
  2507. == DIR_PURPOSE_FETCH_HSDESC) {
  2508. return CIRCUIT_PURPOSE_C_HSDIR_GET;
  2509. }
  2510. }
  2511. /* All other purposes are general for now */
  2512. return CIRCUIT_PURPOSE_C_GENERAL;
  2513. }
  2514. /** Try to find a safe live circuit for stream <b>conn</b>. If we find one,
  2515. * attach the stream, send appropriate cells, and return 1. Otherwise,
  2516. * try to launch new circuit(s) for the stream. If we can launch
  2517. * circuits, return 0. Otherwise, if we simply can't proceed with
  2518. * this stream, return -1. (conn needs to die, and is maybe already marked).
  2519. */
  2520. /* XXXX this function should mark for close whenever it returns -1;
  2521. * its callers shouldn't have to worry about that. */
  2522. int
  2523. connection_ap_handshake_attach_circuit(entry_connection_t *conn)
  2524. {
  2525. connection_t *base_conn = ENTRY_TO_CONN(conn);
  2526. int retval;
  2527. int conn_age;
  2528. int want_onehop;
  2529. tor_assert(conn);
  2530. tor_assert(base_conn->state == AP_CONN_STATE_CIRCUIT_WAIT);
  2531. tor_assert(conn->socks_request);
  2532. want_onehop = conn->want_onehop;
  2533. conn_age = (int)(time(NULL) - base_conn->timestamp_created);
  2534. /* Is this connection so old that we should give up on it? */
  2535. if (conn_age >= get_options()->SocksTimeout) {
  2536. int severity = (tor_addr_is_null(&base_conn->addr) && !base_conn->port) ?
  2537. LOG_INFO : LOG_NOTICE;
  2538. log_fn(severity, LD_APP,
  2539. "Tried for %d seconds to get a connection to %s:%d. Giving up.",
  2540. conn_age, safe_str_client(conn->socks_request->address),
  2541. conn->socks_request->port);
  2542. return -1;
  2543. }
  2544. /* We handle "general" (non-onion) connections much more straightforwardly.
  2545. */
  2546. if (!connection_edge_is_rendezvous_stream(ENTRY_TO_EDGE_CONN(conn))) {
  2547. /* we're a general conn */
  2548. origin_circuit_t *circ=NULL;
  2549. /* Are we linked to a dir conn that aims to fetch a consensus?
  2550. * We check here because the conn might no longer be needed. */
  2551. if (base_conn->linked_conn &&
  2552. base_conn->linked_conn->type == CONN_TYPE_DIR &&
  2553. base_conn->linked_conn->purpose == DIR_PURPOSE_FETCH_CONSENSUS) {
  2554. /* Yes we are. Is there a consensus fetch farther along than us? */
  2555. if (networkstatus_consensus_is_already_downloading(
  2556. TO_DIR_CONN(base_conn->linked_conn)->requested_resource)) {
  2557. /* We're doing the "multiple consensus fetch attempts" game from
  2558. * proposal 210, and we're late to the party. Just close this conn.
  2559. * The circuit and TLS conn that we made will time out after a while
  2560. * if nothing else wants to use them. */
  2561. log_info(LD_DIR, "Closing extra consensus fetch (to %s) since one "
  2562. "is already downloading.", base_conn->linked_conn->address);
  2563. return -1;
  2564. }
  2565. }
  2566. /* If we have a chosen exit, we need to use a circuit that's
  2567. * open to that exit. See what exit we meant, and whether we can use it.
  2568. */
  2569. if (conn->chosen_exit_name) {
  2570. const node_t *node = node_get_by_nickname(conn->chosen_exit_name, 0);
  2571. int opt = conn->chosen_exit_optional;
  2572. if (!node && !want_onehop) {
  2573. /* We ran into this warning when trying to extend a circuit to a
  2574. * hidden service directory for which we didn't have a router
  2575. * descriptor. See flyspray task 767 for more details. We should
  2576. * keep this in mind when deciding to use BEGIN_DIR cells for other
  2577. * directory requests as well. -KL*/
  2578. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  2579. "Requested exit point '%s' is not known. %s.",
  2580. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  2581. if (opt) {
  2582. /* If we are allowed to ignore the .exit request, do so */
  2583. conn->chosen_exit_optional = 0;
  2584. tor_free(conn->chosen_exit_name);
  2585. return 0;
  2586. }
  2587. return -1;
  2588. }
  2589. if (node && !connection_ap_can_use_exit(conn, node)) {
  2590. log_fn(opt ? LOG_INFO : LOG_WARN, LD_APP,
  2591. "Requested exit point '%s' is excluded or "
  2592. "would refuse request. %s.",
  2593. conn->chosen_exit_name, opt ? "Trying others" : "Closing");
  2594. if (opt) {
  2595. /* If we are allowed to ignore the .exit request, do so */
  2596. conn->chosen_exit_optional = 0;
  2597. tor_free(conn->chosen_exit_name);
  2598. return 0;
  2599. }
  2600. return -1;
  2601. }
  2602. }
  2603. /* Find the circuit that we should use, if there is one. Otherwise
  2604. * launch it
  2605. */
  2606. retval = circuit_get_open_circ_or_launch(conn,
  2607. connection_ap_get_nonrend_circ_purpose(conn),
  2608. &circ);
  2609. if (retval < 1) {
  2610. /* We were either told "-1" (complete failure) or 0 (circuit in
  2611. * progress); we can't attach this stream yet. */
  2612. return retval;
  2613. }
  2614. log_debug(LD_APP|LD_CIRC,
  2615. "Attaching apconn to circ %u (stream %d sec old).",
  2616. (unsigned)circ->base_.n_circ_id, conn_age);
  2617. /* print the circ's path, so clients can figure out which circs are
  2618. * sucking. */
  2619. circuit_log_path(LOG_INFO,LD_APP|LD_CIRC,circ);
  2620. /* We have found a suitable circuit for our conn. Hurray. Do
  2621. * the attachment. */
  2622. return connection_ap_handshake_attach_chosen_circuit(conn, circ, NULL);
  2623. } else { /* we're a rendezvous conn */
  2624. origin_circuit_t *rendcirc=NULL, *introcirc=NULL;
  2625. tor_assert(!ENTRY_TO_EDGE_CONN(conn)->cpath_layer);
  2626. /* start by finding a rendezvous circuit for us */
  2627. retval = circuit_get_open_circ_or_launch(
  2628. conn, CIRCUIT_PURPOSE_C_REND_JOINED, &rendcirc);
  2629. if (retval < 0) return -1; /* failed */
  2630. if (retval > 0) {
  2631. tor_assert(rendcirc);
  2632. /* one is already established, attach */
  2633. log_info(LD_REND,
  2634. "rend joined circ %u (id: %" PRIu32 ") already here. "
  2635. "Attaching. (stream %d sec old)",
  2636. (unsigned) TO_CIRCUIT(rendcirc)->n_circ_id,
  2637. rendcirc->global_identifier, conn_age);
  2638. /* Mark rendezvous circuits as 'newly dirty' every time you use
  2639. * them, since the process of rebuilding a rendezvous circ is so
  2640. * expensive. There is a tradeoff between linkability and
  2641. * feasibility, at this point.
  2642. */
  2643. rendcirc->base_.timestamp_dirty = time(NULL);
  2644. /* We've also attempted to use them. If they fail, we need to
  2645. * probe them for path bias */
  2646. pathbias_count_use_attempt(rendcirc);
  2647. link_apconn_to_circ(conn, rendcirc, NULL);
  2648. if (connection_ap_handshake_send_begin(conn) < 0)
  2649. return 0; /* already marked, let them fade away */
  2650. return 1;
  2651. }
  2652. /* At this point we need to re-check the state, since it's possible that
  2653. * our call to circuit_get_open_circ_or_launch() changed the connection's
  2654. * state from "CIRCUIT_WAIT" to "RENDDESC_WAIT" because we decided to
  2655. * re-fetch the descriptor.
  2656. */
  2657. if (ENTRY_TO_CONN(conn)->state != AP_CONN_STATE_CIRCUIT_WAIT) {
  2658. log_info(LD_REND, "This connection is no longer ready to attach; its "
  2659. "state changed."
  2660. "(We probably have to re-fetch its descriptor.)");
  2661. return 0;
  2662. }
  2663. if (rendcirc && (rendcirc->base_.purpose ==
  2664. CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED)) {
  2665. log_info(LD_REND,
  2666. "pending-join circ %u (id: %" PRIu32 ") already here, with "
  2667. "intro ack. Stalling. (stream %d sec old)",
  2668. (unsigned) TO_CIRCUIT(rendcirc)->n_circ_id,
  2669. rendcirc->global_identifier, conn_age);
  2670. return 0;
  2671. }
  2672. /* it's on its way. find an intro circ. */
  2673. retval = circuit_get_open_circ_or_launch(
  2674. conn, CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT, &introcirc);
  2675. if (retval < 0) return -1; /* failed */
  2676. if (retval > 0) {
  2677. /* one has already sent the intro. keep waiting. */
  2678. tor_assert(introcirc);
  2679. log_info(LD_REND, "Intro circ %u (id: %" PRIu32 ") present and "
  2680. "awaiting ACK. Rend circuit %u (id: %" PRIu32 "). "
  2681. "Stalling. (stream %d sec old)",
  2682. (unsigned) TO_CIRCUIT(introcirc)->n_circ_id,
  2683. introcirc->global_identifier,
  2684. rendcirc ? (unsigned) TO_CIRCUIT(rendcirc)->n_circ_id : 0,
  2685. rendcirc ? rendcirc->global_identifier : 0,
  2686. conn_age);
  2687. return 0;
  2688. }
  2689. /* now rendcirc and introcirc are each either undefined or not finished */
  2690. if (rendcirc && introcirc &&
  2691. rendcirc->base_.purpose == CIRCUIT_PURPOSE_C_REND_READY) {
  2692. log_info(LD_REND,
  2693. "ready rend circ %u (id: %" PRIu32 ") already here. No"
  2694. "intro-ack yet on intro %u (id: %" PRIu32 "). "
  2695. "(stream %d sec old)",
  2696. (unsigned) TO_CIRCUIT(rendcirc)->n_circ_id,
  2697. rendcirc->global_identifier,
  2698. (unsigned) TO_CIRCUIT(introcirc)->n_circ_id,
  2699. introcirc->global_identifier, conn_age);
  2700. tor_assert(introcirc->base_.purpose == CIRCUIT_PURPOSE_C_INTRODUCING);
  2701. if (introcirc->base_.state == CIRCUIT_STATE_OPEN) {
  2702. int ret;
  2703. log_info(LD_REND, "Found open intro circ %u (id: %" PRIu32 "). "
  2704. "Rend circuit %u (id: %" PRIu32 "); Sending "
  2705. "introduction. (stream %d sec old)",
  2706. (unsigned) TO_CIRCUIT(introcirc)->n_circ_id,
  2707. introcirc->global_identifier,
  2708. (unsigned) TO_CIRCUIT(rendcirc)->n_circ_id,
  2709. rendcirc->global_identifier, conn_age);
  2710. ret = hs_client_send_introduce1(introcirc, rendcirc);
  2711. switch (ret) {
  2712. case 0: /* success */
  2713. rendcirc->base_.timestamp_dirty = time(NULL);
  2714. introcirc->base_.timestamp_dirty = time(NULL);
  2715. pathbias_count_use_attempt(introcirc);
  2716. pathbias_count_use_attempt(rendcirc);
  2717. assert_circuit_ok(TO_CIRCUIT(rendcirc));
  2718. assert_circuit_ok(TO_CIRCUIT(introcirc));
  2719. return 0;
  2720. case -1: /* transient error */
  2721. return 0;
  2722. case -2: /* permanent error */
  2723. return -1;
  2724. default: /* oops */
  2725. tor_fragile_assert();
  2726. return -1;
  2727. }
  2728. }
  2729. }
  2730. log_info(LD_REND, "Intro %u (id: %" PRIu32 ") and rend circuit %u "
  2731. "(id: %" PRIu32 ") circuits are not both ready. "
  2732. "Stalling conn. (%d sec old)",
  2733. introcirc ? (unsigned) TO_CIRCUIT(introcirc)->n_circ_id : 0,
  2734. introcirc ? introcirc->global_identifier : 0,
  2735. rendcirc ? (unsigned) TO_CIRCUIT(rendcirc)->n_circ_id : 0,
  2736. rendcirc ? rendcirc->global_identifier : 0, conn_age);
  2737. return 0;
  2738. }
  2739. }
  2740. /** Change <b>circ</b>'s purpose to <b>new_purpose</b>. */
  2741. void
  2742. circuit_change_purpose(circuit_t *circ, uint8_t new_purpose)
  2743. {
  2744. uint8_t old_purpose;
  2745. /* Don't allow an OR circ to become an origin circ or vice versa. */
  2746. tor_assert(!!(CIRCUIT_IS_ORIGIN(circ)) ==
  2747. !!(CIRCUIT_PURPOSE_IS_ORIGIN(new_purpose)));
  2748. if (circ->purpose == new_purpose) return;
  2749. if (CIRCUIT_IS_ORIGIN(circ)) {
  2750. char old_purpose_desc[80] = "";
  2751. strncpy(old_purpose_desc, circuit_purpose_to_string(circ->purpose), 80-1);
  2752. old_purpose_desc[80-1] = '\0';
  2753. log_debug(LD_CIRC,
  2754. "changing purpose of origin circ %d "
  2755. "from \"%s\" (%d) to \"%s\" (%d)",
  2756. TO_ORIGIN_CIRCUIT(circ)->global_identifier,
  2757. old_purpose_desc,
  2758. circ->purpose,
  2759. circuit_purpose_to_string(new_purpose),
  2760. new_purpose);
  2761. }
  2762. old_purpose = circ->purpose;
  2763. circ->purpose = new_purpose;
  2764. if (CIRCUIT_IS_ORIGIN(circ)) {
  2765. control_event_circuit_purpose_changed(TO_ORIGIN_CIRCUIT(circ),
  2766. old_purpose);
  2767. }
  2768. }
  2769. /** Mark <b>circ</b> so that no more connections can be attached to it. */
  2770. void
  2771. mark_circuit_unusable_for_new_conns(origin_circuit_t *circ)
  2772. {
  2773. const or_options_t *options = get_options();
  2774. tor_assert(circ);
  2775. /* XXXX This is a kludge; we're only keeping it around in case there's
  2776. * something that doesn't check unusable_for_new_conns, and to avoid
  2777. * deeper refactoring of our expiration logic. */
  2778. if (! circ->base_.timestamp_dirty)
  2779. circ->base_.timestamp_dirty = approx_time();
  2780. if (options->MaxCircuitDirtiness >= circ->base_.timestamp_dirty)
  2781. circ->base_.timestamp_dirty = 1; /* prevent underflow */
  2782. else
  2783. circ->base_.timestamp_dirty -= options->MaxCircuitDirtiness;
  2784. circ->unusable_for_new_conns = 1;
  2785. }
  2786. /**
  2787. * Add relay_body_len and RELAY_PAYLOAD_SIZE-relay_body_len to
  2788. * the valid delivered written fields and the overhead field,
  2789. * respectively.
  2790. */
  2791. void
  2792. circuit_sent_valid_data(origin_circuit_t *circ, uint16_t relay_body_len)
  2793. {
  2794. if (!circ) return;
  2795. tor_assert_nonfatal(relay_body_len <= RELAY_PAYLOAD_SIZE);
  2796. circ->n_delivered_written_circ_bw =
  2797. tor_add_u32_nowrap(circ->n_delivered_written_circ_bw, relay_body_len);
  2798. circ->n_overhead_written_circ_bw =
  2799. tor_add_u32_nowrap(circ->n_overhead_written_circ_bw,
  2800. RELAY_PAYLOAD_SIZE-relay_body_len);
  2801. }
  2802. /**
  2803. * Add relay_body_len and RELAY_PAYLOAD_SIZE-relay_body_len to
  2804. * the valid delivered read field and the overhead field,
  2805. * respectively.
  2806. */
  2807. void
  2808. circuit_read_valid_data(origin_circuit_t *circ, uint16_t relay_body_len)
  2809. {
  2810. if (!circ) return;
  2811. tor_assert_nonfatal(relay_body_len <= RELAY_PAYLOAD_SIZE);
  2812. circ->n_delivered_read_circ_bw =
  2813. tor_add_u32_nowrap(circ->n_delivered_read_circ_bw, relay_body_len);
  2814. circ->n_overhead_read_circ_bw =
  2815. tor_add_u32_nowrap(circ->n_overhead_read_circ_bw,
  2816. RELAY_PAYLOAD_SIZE-relay_body_len);
  2817. }