circuituse.c 111 KB

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