circuituse.c 93 KB

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