circuituse.c 87 KB

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