circuituse.c 87 KB

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