circuituse.c 85 KB

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