circuituse.c 87 KB

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