circuituse.c 109 KB

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