circuituse.c 105 KB

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