circuituse.c 85 KB

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