circuituse.c 106 KB

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