circuituse.c 102 KB

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