circuituse.c 99 KB

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