circuituse.c 118 KB

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