circuituse.c 105 KB

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