circuituse.c 118 KB

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