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