circuituse.c 84 KB

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