circuituse.c 119 KB

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