circuituse.c 109 KB

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