circuituse.c 106 KB

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