circuituse.c 84 KB

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