circuituse.c 108 KB

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