circuituse.c 118 KB

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