circuituse.c 91 KB

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