nodelist.c 73 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333
  1. /* Copyright (c) 2001 Matej Pfajfar.
  2. * Copyright (c) 2001-2004, Roger Dingledine.
  3. * Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
  4. * Copyright (c) 2007-2017, The Tor Project, Inc. */
  5. /* See LICENSE for licensing information */
  6. /**
  7. * \file nodelist.c
  8. *
  9. * \brief Structures and functions for tracking what we know about the routers
  10. * on the Tor network, and correlating information from networkstatus,
  11. * routerinfo, and microdescs.
  12. *
  13. * The key structure here is node_t: that's the canonical way to refer
  14. * to a Tor relay that we might want to build a circuit through. Every
  15. * node_t has either a routerinfo_t, or a routerstatus_t from the current
  16. * networkstatus consensus. If it has a routerstatus_t, it will also
  17. * need to have a microdesc_t before you can use it for circuits.
  18. *
  19. * The nodelist_t is a global singleton that maps identities to node_t
  20. * objects. Access them with the node_get_*() functions. The nodelist_t
  21. * is maintained by calls throughout the codebase
  22. *
  23. * Generally, other code should not have to reach inside a node_t to
  24. * see what information it has. Instead, you should call one of the
  25. * many accessor functions that works on a generic node_t. If there
  26. * isn't one that does what you need, it's better to make such a function,
  27. * and then use it.
  28. *
  29. * For historical reasons, some of the functions that select a node_t
  30. * from the list of all usable node_t objects are in the routerlist.c
  31. * module, since they originally selected a routerinfo_t. (TODO: They
  32. * should move!)
  33. *
  34. * (TODO: Perhaps someday we should abstract the remaining ways of
  35. * talking about a relay to also be node_t instances. Those would be
  36. * routerstatus_t as used for directory requests, and dir_server_t as
  37. * used for authorities and fallback directories.)
  38. */
  39. #include "or.h"
  40. #include "address.h"
  41. #include "config.h"
  42. #include "control.h"
  43. #include "dirserv.h"
  44. #include "entrynodes.h"
  45. #include "geoip.h"
  46. #include "hs_common.h"
  47. #include "main.h"
  48. #include "microdesc.h"
  49. #include "networkstatus.h"
  50. #include "nodelist.h"
  51. #include "policies.h"
  52. #include "protover.h"
  53. #include "rendservice.h"
  54. #include "router.h"
  55. #include "routerlist.h"
  56. #include "routerparse.h"
  57. #include "routerset.h"
  58. #include "torcert.h"
  59. #include <string.h>
  60. static void nodelist_drop_node(node_t *node, int remove_from_ht);
  61. static void node_free(node_t *node);
  62. /** count_usable_descriptors counts descriptors with these flag(s)
  63. */
  64. typedef enum {
  65. /* All descriptors regardless of flags */
  66. USABLE_DESCRIPTOR_ALL = 0,
  67. /* Only descriptors with the Exit flag */
  68. USABLE_DESCRIPTOR_EXIT_ONLY = 1
  69. } usable_descriptor_t;
  70. static void count_usable_descriptors(int *num_present,
  71. int *num_usable,
  72. smartlist_t *descs_out,
  73. const networkstatus_t *consensus,
  74. time_t now,
  75. routerset_t *in_set,
  76. usable_descriptor_t exit_only);
  77. static void update_router_have_minimum_dir_info(void);
  78. static double get_frac_paths_needed_for_circs(const or_options_t *options,
  79. const networkstatus_t *ns);
  80. /** A nodelist_t holds a node_t object for every router we're "willing to use
  81. * for something". Specifically, it should hold a node_t for every node that
  82. * is currently in the routerlist, or currently in the consensus we're using.
  83. */
  84. typedef struct nodelist_t {
  85. /* A list of all the nodes. */
  86. smartlist_t *nodes;
  87. /* Hash table to map from node ID digest to node. */
  88. HT_HEAD(nodelist_map, node_t) nodes_by_id;
  89. /* Hash table to map from node Ed25519 ID to node.
  90. *
  91. * Whenever a node's routerinfo or microdescriptor is about to change,
  92. * you should remove it from this map with node_remove_from_ed25519_map().
  93. * Whenever a node's routerinfo or microdescriptor has just chaned,
  94. * you should add it to this map with node_add_to_ed25519_map().
  95. */
  96. HT_HEAD(nodelist_ed_map, node_t) nodes_by_ed_id;
  97. } nodelist_t;
  98. static inline unsigned int
  99. node_id_hash(const node_t *node)
  100. {
  101. return (unsigned) siphash24g(node->identity, DIGEST_LEN);
  102. }
  103. static inline unsigned int
  104. node_id_eq(const node_t *node1, const node_t *node2)
  105. {
  106. return tor_memeq(node1->identity, node2->identity, DIGEST_LEN);
  107. }
  108. HT_PROTOTYPE(nodelist_map, node_t, ht_ent, node_id_hash, node_id_eq)
  109. HT_GENERATE2(nodelist_map, node_t, ht_ent, node_id_hash, node_id_eq,
  110. 0.6, tor_reallocarray_, tor_free_)
  111. static inline unsigned int
  112. node_ed_id_hash(const node_t *node)
  113. {
  114. return (unsigned) siphash24g(node->ed25519_id.pubkey, ED25519_PUBKEY_LEN);
  115. }
  116. static inline unsigned int
  117. node_ed_id_eq(const node_t *node1, const node_t *node2)
  118. {
  119. return ed25519_pubkey_eq(&node1->ed25519_id, &node2->ed25519_id);
  120. }
  121. HT_PROTOTYPE(nodelist_ed_map, node_t, ed_ht_ent, node_ed_id_hash,
  122. node_ed_id_eq)
  123. HT_GENERATE2(nodelist_ed_map, node_t, ed_ht_ent, node_ed_id_hash,
  124. node_ed_id_eq, 0.6, tor_reallocarray_, tor_free_)
  125. /** The global nodelist. */
  126. static nodelist_t *the_nodelist=NULL;
  127. /** Create an empty nodelist if we haven't done so already. */
  128. static void
  129. init_nodelist(void)
  130. {
  131. if (PREDICT_UNLIKELY(the_nodelist == NULL)) {
  132. the_nodelist = tor_malloc_zero(sizeof(nodelist_t));
  133. HT_INIT(nodelist_map, &the_nodelist->nodes_by_id);
  134. HT_INIT(nodelist_ed_map, &the_nodelist->nodes_by_ed_id);
  135. the_nodelist->nodes = smartlist_new();
  136. }
  137. }
  138. /** As node_get_by_id, but returns a non-const pointer */
  139. node_t *
  140. node_get_mutable_by_id(const char *identity_digest)
  141. {
  142. node_t search, *node;
  143. if (PREDICT_UNLIKELY(the_nodelist == NULL))
  144. return NULL;
  145. memcpy(&search.identity, identity_digest, DIGEST_LEN);
  146. node = HT_FIND(nodelist_map, &the_nodelist->nodes_by_id, &search);
  147. return node;
  148. }
  149. /** As node_get_by_ed25519_id, but returns a non-const pointer */
  150. node_t *
  151. node_get_mutable_by_ed25519_id(const ed25519_public_key_t *ed_id)
  152. {
  153. node_t search, *node;
  154. if (PREDICT_UNLIKELY(the_nodelist == NULL))
  155. return NULL;
  156. if (BUG(ed_id == NULL) || BUG(ed25519_public_key_is_zero(ed_id)))
  157. return NULL;
  158. memcpy(&search.ed25519_id, ed_id, sizeof(search.ed25519_id));
  159. node = HT_FIND(nodelist_ed_map, &the_nodelist->nodes_by_ed_id, &search);
  160. return node;
  161. }
  162. /** Return the node_t whose identity is <b>identity_digest</b>, or NULL
  163. * if no such node exists. */
  164. MOCK_IMPL(const node_t *,
  165. node_get_by_id,(const char *identity_digest))
  166. {
  167. return node_get_mutable_by_id(identity_digest);
  168. }
  169. /** Return the node_t whose ed25519 identity is <b>ed_id</b>, or NULL
  170. * if no such node exists. */
  171. MOCK_IMPL(const node_t *,
  172. node_get_by_ed25519_id,(const ed25519_public_key_t *ed_id))
  173. {
  174. return node_get_mutable_by_ed25519_id(ed_id);
  175. }
  176. /** Internal: return the node_t whose identity_digest is
  177. * <b>identity_digest</b>. If none exists, create a new one, add it to the
  178. * nodelist, and return it.
  179. *
  180. * Requires that the nodelist be initialized.
  181. */
  182. static node_t *
  183. node_get_or_create(const char *identity_digest)
  184. {
  185. node_t *node;
  186. if ((node = node_get_mutable_by_id(identity_digest)))
  187. return node;
  188. node = tor_malloc_zero(sizeof(node_t));
  189. memcpy(node->identity, identity_digest, DIGEST_LEN);
  190. HT_INSERT(nodelist_map, &the_nodelist->nodes_by_id, node);
  191. smartlist_add(the_nodelist->nodes, node);
  192. node->nodelist_idx = smartlist_len(the_nodelist->nodes) - 1;
  193. node->hsdir_index = tor_malloc_zero(sizeof(hsdir_index_t));
  194. node->country = -1;
  195. return node;
  196. }
  197. /** Remove <b>node</b> from the ed25519 map (if it present), and
  198. * set its ed25519_id field to zero. */
  199. static int
  200. node_remove_from_ed25519_map(node_t *node)
  201. {
  202. tor_assert(the_nodelist);
  203. tor_assert(node);
  204. if (ed25519_public_key_is_zero(&node->ed25519_id)) {
  205. return 0;
  206. }
  207. int rv = 0;
  208. node_t *search =
  209. HT_FIND(nodelist_ed_map, &the_nodelist->nodes_by_ed_id, node);
  210. if (BUG(search != node)) {
  211. goto clear_and_return;
  212. }
  213. search = HT_REMOVE(nodelist_ed_map, &the_nodelist->nodes_by_ed_id, node);
  214. tor_assert(search == node);
  215. rv = 1;
  216. clear_and_return:
  217. memset(&node->ed25519_id, 0, sizeof(node->ed25519_id));
  218. return rv;
  219. }
  220. /** If <b>node</b> has an ed25519 id, and it is not already in the ed25519 id
  221. * map, set its ed25519_id field, and add it to the ed25519 map.
  222. */
  223. static int
  224. node_add_to_ed25519_map(node_t *node)
  225. {
  226. tor_assert(the_nodelist);
  227. tor_assert(node);
  228. if (! ed25519_public_key_is_zero(&node->ed25519_id)) {
  229. return 0;
  230. }
  231. const ed25519_public_key_t *key = node_get_ed25519_id(node);
  232. if (!key) {
  233. return 0;
  234. }
  235. node_t *old;
  236. memcpy(&node->ed25519_id, key, sizeof(node->ed25519_id));
  237. old = HT_FIND(nodelist_ed_map, &the_nodelist->nodes_by_ed_id, node);
  238. if (BUG(old)) {
  239. /* XXXX order matters here, and this may mean that authorities aren't
  240. * pinning. */
  241. if (old != node)
  242. memset(&node->ed25519_id, 0, sizeof(node->ed25519_id));
  243. return 0;
  244. }
  245. HT_INSERT(nodelist_ed_map, &the_nodelist->nodes_by_ed_id, node);
  246. return 1;
  247. }
  248. /* For a given <b>node</b> for the consensus <b>ns</b>, set the hsdir index
  249. * for the node, both current and next if possible. This can only fails if the
  250. * node_t ed25519 identity key can't be found which would be a bug. */
  251. static void
  252. node_set_hsdir_index(node_t *node, const networkstatus_t *ns)
  253. {
  254. time_t now = approx_time();
  255. const ed25519_public_key_t *node_identity_pk;
  256. uint8_t *next_hsdir_index_srv = NULL, *current_hsdir_index_srv = NULL;
  257. uint64_t next_time_period_num, current_time_period_num;
  258. tor_assert(node);
  259. tor_assert(ns);
  260. if (!networkstatus_is_live(ns, now)) {
  261. log_info(LD_GENERAL, "Not setting hsdir index with a non-live consensus.");
  262. goto done;
  263. }
  264. node_identity_pk = node_get_ed25519_id(node);
  265. if (node_identity_pk == NULL) {
  266. log_debug(LD_GENERAL, "ed25519 identity public key not found when "
  267. "trying to build the hsdir indexes for node %s",
  268. node_describe(node));
  269. goto done;
  270. }
  271. /* Get the current and next time period number, we might use them both. */
  272. current_time_period_num = hs_get_time_period_num(now);
  273. next_time_period_num = hs_get_next_time_period_num(now);
  274. if (hs_overlap_mode_is_active(ns, now)) {
  275. /* We are in overlap mode, this means that our consensus has just cycled
  276. * from current SRV to previous SRV so for the _next_ upcoming time
  277. * period, we have to use the current SRV and use the previous SRV for the
  278. * current time period. If the current or previous SRV can't be found, the
  279. * disaster one is returned. */
  280. next_hsdir_index_srv = hs_get_current_srv(next_time_period_num, ns);
  281. /* The following can be confusing so again, in overlap mode, we use our
  282. * previous SRV for our _current_ hsdir index. */
  283. current_hsdir_index_srv = hs_get_previous_srv(current_time_period_num, ns);
  284. } else {
  285. /* If NOT in overlap mode, we only need to compute the current hsdir index
  286. * for the ongoing time period and thus the current SRV. If it can't be
  287. * found, the disaster one is returned. */
  288. current_hsdir_index_srv = hs_get_current_srv(current_time_period_num, ns);
  289. }
  290. /* Build the current hsdir index. */
  291. hs_build_hsdir_index(node_identity_pk, current_hsdir_index_srv,
  292. current_time_period_num, node->hsdir_index->current);
  293. if (next_hsdir_index_srv) {
  294. /* Build the next hsdir index if we have a next SRV that we can use. */
  295. hs_build_hsdir_index(node_identity_pk, next_hsdir_index_srv,
  296. next_time_period_num, node->hsdir_index->next);
  297. } else {
  298. memset(node->hsdir_index->next, 0, sizeof(node->hsdir_index->next));
  299. }
  300. done:
  301. tor_free(current_hsdir_index_srv);
  302. tor_free(next_hsdir_index_srv);
  303. return;
  304. }
  305. /** Called when a node's address changes. */
  306. static void
  307. node_addrs_changed(node_t *node)
  308. {
  309. node->last_reachable = node->last_reachable6 = 0;
  310. node->country = -1;
  311. }
  312. /** Add <b>ri</b> to an appropriate node in the nodelist. If we replace an
  313. * old routerinfo, and <b>ri_old_out</b> is not NULL, set *<b>ri_old_out</b>
  314. * to the previous routerinfo.
  315. */
  316. node_t *
  317. nodelist_set_routerinfo(routerinfo_t *ri, routerinfo_t **ri_old_out)
  318. {
  319. node_t *node;
  320. const char *id_digest;
  321. int had_router = 0;
  322. tor_assert(ri);
  323. init_nodelist();
  324. id_digest = ri->cache_info.identity_digest;
  325. node = node_get_or_create(id_digest);
  326. node_remove_from_ed25519_map(node);
  327. if (node->ri) {
  328. if (!routers_have_same_or_addrs(node->ri, ri)) {
  329. node_addrs_changed(node);
  330. }
  331. had_router = 1;
  332. if (ri_old_out)
  333. *ri_old_out = node->ri;
  334. } else {
  335. if (ri_old_out)
  336. *ri_old_out = NULL;
  337. }
  338. node->ri = ri;
  339. node_add_to_ed25519_map(node);
  340. if (node->country == -1)
  341. node_set_country(node);
  342. if (authdir_mode(get_options()) && !had_router) {
  343. const char *discard=NULL;
  344. uint32_t status = dirserv_router_get_status(ri, &discard, LOG_INFO);
  345. dirserv_set_node_flags_from_authoritative_status(node, status);
  346. }
  347. /* Setting the HSDir index requires the ed25519 identity key which can
  348. * only be found either in the ri or md. This is why this is called here.
  349. * Only nodes supporting HSDir=2 protocol version needs this index. */
  350. if (node->rs && node->rs->supports_v3_hsdir) {
  351. node_set_hsdir_index(node,
  352. networkstatus_get_latest_consensus());
  353. }
  354. return node;
  355. }
  356. /** Set the appropriate node_t to use <b>md</b> as its microdescriptor.
  357. *
  358. * Called when a new microdesc has arrived and the usable consensus flavor
  359. * is "microdesc".
  360. **/
  361. node_t *
  362. nodelist_add_microdesc(microdesc_t *md)
  363. {
  364. networkstatus_t *ns =
  365. networkstatus_get_latest_consensus_by_flavor(FLAV_MICRODESC);
  366. const routerstatus_t *rs;
  367. node_t *node;
  368. if (ns == NULL)
  369. return NULL;
  370. init_nodelist();
  371. /* Microdescriptors don't carry an identity digest, so we need to figure
  372. * it out by looking up the routerstatus. */
  373. rs = router_get_consensus_status_by_descriptor_digest(ns, md->digest);
  374. if (rs == NULL)
  375. return NULL;
  376. node = node_get_mutable_by_id(rs->identity_digest);
  377. if (node) {
  378. node_remove_from_ed25519_map(node);
  379. if (node->md)
  380. node->md->held_by_nodes--;
  381. node->md = md;
  382. md->held_by_nodes++;
  383. /* Setting the HSDir index requires the ed25519 identity key which can
  384. * only be found either in the ri or md. This is why this is called here.
  385. * Only nodes supporting HSDir=2 protocol version needs this index. */
  386. if (rs->supports_v3_hsdir) {
  387. node_set_hsdir_index(node, ns);
  388. }
  389. node_add_to_ed25519_map(node);
  390. }
  391. return node;
  392. }
  393. /** Tell the nodelist that the current usable consensus is <b>ns</b>.
  394. * This makes the nodelist change all of the routerstatus entries for
  395. * the nodes, drop nodes that no longer have enough info to get used,
  396. * and grab microdescriptors into nodes as appropriate.
  397. */
  398. void
  399. nodelist_set_consensus(networkstatus_t *ns)
  400. {
  401. const or_options_t *options = get_options();
  402. int authdir = authdir_mode_v3(options);
  403. init_nodelist();
  404. if (ns->flavor == FLAV_MICRODESC)
  405. (void) get_microdesc_cache(); /* Make sure it exists first. */
  406. SMARTLIST_FOREACH(the_nodelist->nodes, node_t *, node,
  407. node->rs = NULL);
  408. SMARTLIST_FOREACH_BEGIN(ns->routerstatus_list, routerstatus_t *, rs) {
  409. node_t *node = node_get_or_create(rs->identity_digest);
  410. node->rs = rs;
  411. if (ns->flavor == FLAV_MICRODESC) {
  412. if (node->md == NULL ||
  413. tor_memneq(node->md->digest,rs->descriptor_digest,DIGEST256_LEN)) {
  414. node_remove_from_ed25519_map(node);
  415. if (node->md)
  416. node->md->held_by_nodes--;
  417. node->md = microdesc_cache_lookup_by_digest256(NULL,
  418. rs->descriptor_digest);
  419. if (node->md)
  420. node->md->held_by_nodes++;
  421. node_add_to_ed25519_map(node);
  422. }
  423. }
  424. if (rs->supports_v3_hsdir) {
  425. node_set_hsdir_index(node, ns);
  426. }
  427. node_set_country(node);
  428. /* If we're not an authdir, believe others. */
  429. if (!authdir) {
  430. node->is_valid = rs->is_valid;
  431. node->is_running = rs->is_flagged_running;
  432. node->is_fast = rs->is_fast;
  433. node->is_stable = rs->is_stable;
  434. node->is_possible_guard = rs->is_possible_guard;
  435. node->is_exit = rs->is_exit;
  436. node->is_bad_exit = rs->is_bad_exit;
  437. node->is_hs_dir = rs->is_hs_dir;
  438. node->ipv6_preferred = 0;
  439. if (fascist_firewall_prefer_ipv6_orport(options) &&
  440. (tor_addr_is_null(&rs->ipv6_addr) == 0 ||
  441. (node->md && tor_addr_is_null(&node->md->ipv6_addr) == 0)))
  442. node->ipv6_preferred = 1;
  443. }
  444. } SMARTLIST_FOREACH_END(rs);
  445. nodelist_purge();
  446. if (! authdir) {
  447. SMARTLIST_FOREACH_BEGIN(the_nodelist->nodes, node_t *, node) {
  448. /* We have no routerstatus for this router. Clear flags so we can skip
  449. * it, maybe.*/
  450. if (!node->rs) {
  451. tor_assert(node->ri); /* if it had only an md, or nothing, purge
  452. * would have removed it. */
  453. if (node->ri->purpose == ROUTER_PURPOSE_GENERAL) {
  454. /* Clear all flags. */
  455. node->is_valid = node->is_running = node->is_hs_dir =
  456. node->is_fast = node->is_stable =
  457. node->is_possible_guard = node->is_exit =
  458. node->is_bad_exit = node->ipv6_preferred = 0;
  459. }
  460. }
  461. } SMARTLIST_FOREACH_END(node);
  462. }
  463. }
  464. /** Helper: return true iff a node has a usable amount of information*/
  465. static inline int
  466. node_is_usable(const node_t *node)
  467. {
  468. return (node->rs) || (node->ri);
  469. }
  470. /** Tell the nodelist that <b>md</b> is no longer a microdescriptor for the
  471. * node with <b>identity_digest</b>. */
  472. void
  473. nodelist_remove_microdesc(const char *identity_digest, microdesc_t *md)
  474. {
  475. node_t *node = node_get_mutable_by_id(identity_digest);
  476. if (node && node->md == md) {
  477. node->md = NULL;
  478. md->held_by_nodes--;
  479. if (! node_get_ed25519_id(node)) {
  480. node_remove_from_ed25519_map(node);
  481. }
  482. }
  483. }
  484. /** Tell the nodelist that <b>ri</b> is no longer in the routerlist. */
  485. void
  486. nodelist_remove_routerinfo(routerinfo_t *ri)
  487. {
  488. node_t *node = node_get_mutable_by_id(ri->cache_info.identity_digest);
  489. if (node && node->ri == ri) {
  490. node->ri = NULL;
  491. if (! node_is_usable(node)) {
  492. nodelist_drop_node(node, 1);
  493. node_free(node);
  494. }
  495. }
  496. }
  497. /** Remove <b>node</b> from the nodelist. (Asserts that it was there to begin
  498. * with.) */
  499. static void
  500. nodelist_drop_node(node_t *node, int remove_from_ht)
  501. {
  502. node_t *tmp;
  503. int idx;
  504. if (remove_from_ht) {
  505. tmp = HT_REMOVE(nodelist_map, &the_nodelist->nodes_by_id, node);
  506. tor_assert(tmp == node);
  507. }
  508. node_remove_from_ed25519_map(node);
  509. idx = node->nodelist_idx;
  510. tor_assert(idx >= 0);
  511. tor_assert(node == smartlist_get(the_nodelist->nodes, idx));
  512. smartlist_del(the_nodelist->nodes, idx);
  513. if (idx < smartlist_len(the_nodelist->nodes)) {
  514. tmp = smartlist_get(the_nodelist->nodes, idx);
  515. tmp->nodelist_idx = idx;
  516. }
  517. node->nodelist_idx = -1;
  518. }
  519. /** Return a newly allocated smartlist of the nodes that have <b>md</b> as
  520. * their microdescriptor. */
  521. smartlist_t *
  522. nodelist_find_nodes_with_microdesc(const microdesc_t *md)
  523. {
  524. smartlist_t *result = smartlist_new();
  525. if (the_nodelist == NULL)
  526. return result;
  527. SMARTLIST_FOREACH_BEGIN(the_nodelist->nodes, node_t *, node) {
  528. if (node->md == md) {
  529. smartlist_add(result, node);
  530. }
  531. } SMARTLIST_FOREACH_END(node);
  532. return result;
  533. }
  534. /** Release storage held by <b>node</b> */
  535. static void
  536. node_free(node_t *node)
  537. {
  538. if (!node)
  539. return;
  540. if (node->md)
  541. node->md->held_by_nodes--;
  542. tor_assert(node->nodelist_idx == -1);
  543. tor_free(node->hsdir_index);
  544. tor_free(node);
  545. }
  546. /** Remove all entries from the nodelist that don't have enough info to be
  547. * usable for anything. */
  548. void
  549. nodelist_purge(void)
  550. {
  551. node_t **iter;
  552. if (PREDICT_UNLIKELY(the_nodelist == NULL))
  553. return;
  554. /* Remove the non-usable nodes. */
  555. for (iter = HT_START(nodelist_map, &the_nodelist->nodes_by_id); iter; ) {
  556. node_t *node = *iter;
  557. if (node->md && !node->rs) {
  558. /* An md is only useful if there is an rs. */
  559. node->md->held_by_nodes--;
  560. node->md = NULL;
  561. }
  562. if (node_is_usable(node)) {
  563. iter = HT_NEXT(nodelist_map, &the_nodelist->nodes_by_id, iter);
  564. } else {
  565. iter = HT_NEXT_RMV(nodelist_map, &the_nodelist->nodes_by_id, iter);
  566. nodelist_drop_node(node, 0);
  567. node_free(node);
  568. }
  569. }
  570. nodelist_assert_ok();
  571. }
  572. /** Release all storage held by the nodelist. */
  573. void
  574. nodelist_free_all(void)
  575. {
  576. if (PREDICT_UNLIKELY(the_nodelist == NULL))
  577. return;
  578. HT_CLEAR(nodelist_map, &the_nodelist->nodes_by_id);
  579. HT_CLEAR(nodelist_ed_map, &the_nodelist->nodes_by_ed_id);
  580. SMARTLIST_FOREACH_BEGIN(the_nodelist->nodes, node_t *, node) {
  581. node->nodelist_idx = -1;
  582. node_free(node);
  583. } SMARTLIST_FOREACH_END(node);
  584. smartlist_free(the_nodelist->nodes);
  585. tor_free(the_nodelist);
  586. }
  587. /** Check that the nodelist is internally consistent, and consistent with
  588. * the directory info it's derived from.
  589. */
  590. void
  591. nodelist_assert_ok(void)
  592. {
  593. routerlist_t *rl = router_get_routerlist();
  594. networkstatus_t *ns = networkstatus_get_latest_consensus();
  595. digestmap_t *dm;
  596. if (!the_nodelist)
  597. return;
  598. dm = digestmap_new();
  599. /* every routerinfo in rl->routers should be in the nodelist. */
  600. if (rl) {
  601. SMARTLIST_FOREACH_BEGIN(rl->routers, routerinfo_t *, ri) {
  602. const node_t *node = node_get_by_id(ri->cache_info.identity_digest);
  603. tor_assert(node && node->ri == ri);
  604. tor_assert(fast_memeq(ri->cache_info.identity_digest,
  605. node->identity, DIGEST_LEN));
  606. tor_assert(! digestmap_get(dm, node->identity));
  607. digestmap_set(dm, node->identity, (void*)node);
  608. } SMARTLIST_FOREACH_END(ri);
  609. }
  610. /* every routerstatus in ns should be in the nodelist */
  611. if (ns) {
  612. SMARTLIST_FOREACH_BEGIN(ns->routerstatus_list, routerstatus_t *, rs) {
  613. const node_t *node = node_get_by_id(rs->identity_digest);
  614. tor_assert(node && node->rs == rs);
  615. tor_assert(fast_memeq(rs->identity_digest, node->identity, DIGEST_LEN));
  616. digestmap_set(dm, node->identity, (void*)node);
  617. if (ns->flavor == FLAV_MICRODESC) {
  618. /* If it's a microdesc consensus, every entry that has a
  619. * microdescriptor should be in the nodelist.
  620. */
  621. microdesc_t *md =
  622. microdesc_cache_lookup_by_digest256(NULL, rs->descriptor_digest);
  623. tor_assert(md == node->md);
  624. if (md)
  625. tor_assert(md->held_by_nodes >= 1);
  626. }
  627. } SMARTLIST_FOREACH_END(rs);
  628. }
  629. /* The nodelist should have no other entries, and its entries should be
  630. * well-formed. */
  631. SMARTLIST_FOREACH_BEGIN(the_nodelist->nodes, node_t *, node) {
  632. tor_assert(digestmap_get(dm, node->identity) != NULL);
  633. tor_assert(node_sl_idx == node->nodelist_idx);
  634. } SMARTLIST_FOREACH_END(node);
  635. /* Every node listed with an ed25519 identity should be listed by that
  636. * identity.
  637. */
  638. SMARTLIST_FOREACH_BEGIN(the_nodelist->nodes, node_t *, node) {
  639. if (!ed25519_public_key_is_zero(&node->ed25519_id)) {
  640. tor_assert(node == node_get_by_ed25519_id(&node->ed25519_id));
  641. }
  642. } SMARTLIST_FOREACH_END(node);
  643. node_t **idx;
  644. HT_FOREACH(idx, nodelist_ed_map, &the_nodelist->nodes_by_ed_id) {
  645. node_t *node = *idx;
  646. tor_assert(node == node_get_by_ed25519_id(&node->ed25519_id));
  647. }
  648. tor_assert((long)smartlist_len(the_nodelist->nodes) ==
  649. (long)HT_SIZE(&the_nodelist->nodes_by_id));
  650. tor_assert((long)smartlist_len(the_nodelist->nodes) >=
  651. (long)HT_SIZE(&the_nodelist->nodes_by_ed_id));
  652. digestmap_free(dm, NULL);
  653. }
  654. /** Return a list of a node_t * for every node we know about. The caller
  655. * MUST NOT modify the list. (You can set and clear flags in the nodes if
  656. * you must, but you must not add or remove nodes.) */
  657. MOCK_IMPL(smartlist_t *,
  658. nodelist_get_list,(void))
  659. {
  660. init_nodelist();
  661. return the_nodelist->nodes;
  662. }
  663. /** Given a hex-encoded nickname of the format DIGEST, $DIGEST, $DIGEST=name,
  664. * or $DIGEST~name, return the node with the matching identity digest and
  665. * nickname (if any). Return NULL if no such node exists, or if <b>hex_id</b>
  666. * is not well-formed. */
  667. const node_t *
  668. node_get_by_hex_id(const char *hex_id)
  669. {
  670. char digest_buf[DIGEST_LEN];
  671. char nn_buf[MAX_NICKNAME_LEN+1];
  672. char nn_char='\0';
  673. if (hex_digest_nickname_decode(hex_id, digest_buf, &nn_char, nn_buf)==0) {
  674. const node_t *node = node_get_by_id(digest_buf);
  675. if (!node)
  676. return NULL;
  677. if (nn_char) {
  678. const char *real_name = node_get_nickname(node);
  679. if (!real_name || strcasecmp(real_name, nn_buf))
  680. return NULL;
  681. if (nn_char == '=') {
  682. const char *named_id =
  683. networkstatus_get_router_digest_by_nickname(nn_buf);
  684. if (!named_id || tor_memneq(named_id, digest_buf, DIGEST_LEN))
  685. return NULL;
  686. }
  687. }
  688. return node;
  689. }
  690. return NULL;
  691. }
  692. /** Given a nickname (possibly verbose, possibly a hexadecimal digest), return
  693. * the corresponding node_t, or NULL if none exists. Warn the user if
  694. * <b>warn_if_unnamed</b> is set, and they have specified a router by
  695. * nickname, but the Named flag isn't set for that router. */
  696. MOCK_IMPL(const node_t *,
  697. node_get_by_nickname,(const char *nickname, int warn_if_unnamed))
  698. {
  699. if (!the_nodelist)
  700. return NULL;
  701. /* Handle these cases: DIGEST, $DIGEST, $DIGEST=name, $DIGEST~name. */
  702. {
  703. const node_t *node;
  704. if ((node = node_get_by_hex_id(nickname)) != NULL)
  705. return node;
  706. }
  707. if (!strcasecmp(nickname, UNNAMED_ROUTER_NICKNAME))
  708. return NULL;
  709. /* Okay, so if we get here, the nickname is just a nickname. Is there
  710. * a binding for it in the consensus? */
  711. {
  712. const char *named_id =
  713. networkstatus_get_router_digest_by_nickname(nickname);
  714. if (named_id)
  715. return node_get_by_id(named_id);
  716. }
  717. /* Is it marked as owned-by-someone-else? */
  718. if (networkstatus_nickname_is_unnamed(nickname)) {
  719. log_info(LD_GENERAL, "The name %s is listed as Unnamed: there is some "
  720. "router that holds it, but not one listed in the current "
  721. "consensus.", escaped(nickname));
  722. return NULL;
  723. }
  724. /* Okay, so the name is not canonical for anybody. */
  725. {
  726. smartlist_t *matches = smartlist_new();
  727. const node_t *choice = NULL;
  728. SMARTLIST_FOREACH_BEGIN(the_nodelist->nodes, node_t *, node) {
  729. if (!strcasecmp(node_get_nickname(node), nickname))
  730. smartlist_add(matches, node);
  731. } SMARTLIST_FOREACH_END(node);
  732. if (smartlist_len(matches)>1 && warn_if_unnamed) {
  733. int any_unwarned = 0;
  734. SMARTLIST_FOREACH_BEGIN(matches, node_t *, node) {
  735. if (!node->name_lookup_warned) {
  736. node->name_lookup_warned = 1;
  737. any_unwarned = 1;
  738. }
  739. } SMARTLIST_FOREACH_END(node);
  740. if (any_unwarned) {
  741. log_warn(LD_CONFIG, "There are multiple matches for the name %s, "
  742. "but none is listed as Named in the directory consensus. "
  743. "Choosing one arbitrarily.", nickname);
  744. }
  745. } else if (smartlist_len(matches)==1 && warn_if_unnamed) {
  746. char fp[HEX_DIGEST_LEN+1];
  747. node_t *node = smartlist_get(matches, 0);
  748. if (! node->name_lookup_warned) {
  749. base16_encode(fp, sizeof(fp), node->identity, DIGEST_LEN);
  750. log_warn(LD_CONFIG,
  751. "You specified a relay \"%s\" by name, but nicknames can be "
  752. "used by any relay, not just the one you meant. "
  753. "To make sure you get the same relay in the future, refer "
  754. "to it by key, as \"$%s\".", nickname, fp);
  755. node->name_lookup_warned = 1;
  756. }
  757. }
  758. if (smartlist_len(matches))
  759. choice = smartlist_get(matches, 0);
  760. smartlist_free(matches);
  761. return choice;
  762. }
  763. }
  764. /** Return the Ed25519 identity key for the provided node, or NULL if it
  765. * doesn't have one. */
  766. const ed25519_public_key_t *
  767. node_get_ed25519_id(const node_t *node)
  768. {
  769. const ed25519_public_key_t *ri_pk = NULL;
  770. const ed25519_public_key_t *md_pk = NULL;
  771. if (node->ri) {
  772. if (node->ri->cache_info.signing_key_cert) {
  773. ri_pk = &node->ri->cache_info.signing_key_cert->signing_key;
  774. if (BUG(ed25519_public_key_is_zero(ri_pk)))
  775. ri_pk = NULL;
  776. }
  777. }
  778. if (node->md) {
  779. if (node->md->ed25519_identity_pkey) {
  780. md_pk = node->md->ed25519_identity_pkey;
  781. }
  782. }
  783. if (ri_pk && md_pk) {
  784. if (ed25519_pubkey_eq(ri_pk, md_pk)) {
  785. return ri_pk;
  786. } else {
  787. log_warn(LD_GENERAL, "Inconsistent ed25519 identities in the nodelist");
  788. return NULL;
  789. }
  790. } else if (ri_pk) {
  791. return ri_pk;
  792. } else {
  793. return md_pk;
  794. }
  795. }
  796. /** Return true iff this node's Ed25519 identity matches <b>id</b>.
  797. * (An absent Ed25519 identity matches NULL or zero.) */
  798. int
  799. node_ed25519_id_matches(const node_t *node, const ed25519_public_key_t *id)
  800. {
  801. const ed25519_public_key_t *node_id = node_get_ed25519_id(node);
  802. if (node_id == NULL || ed25519_public_key_is_zero(node_id)) {
  803. return id == NULL || ed25519_public_key_is_zero(id);
  804. } else {
  805. return id && ed25519_pubkey_eq(node_id, id);
  806. }
  807. }
  808. /** Return true iff <b>node</b> supports authenticating itself
  809. * by ed25519 ID during the link handshake in a way that we can understand
  810. * when we probe it. */
  811. int
  812. node_supports_ed25519_link_authentication(const node_t *node)
  813. {
  814. /* XXXX Oh hm. What if some day in the future there are link handshake
  815. * versions that aren't 3 but which are ed25519 */
  816. if (! node_get_ed25519_id(node))
  817. return 0;
  818. if (node->ri) {
  819. const char *protos = node->ri->protocol_list;
  820. if (protos == NULL)
  821. return 0;
  822. return protocol_list_supports_protocol(protos, PRT_LINKAUTH, 3);
  823. }
  824. if (node->rs) {
  825. return node->rs->supports_ed25519_link_handshake;
  826. }
  827. tor_assert_nonfatal_unreached_once();
  828. return 0;
  829. }
  830. /** Return true iff <b>node</b> supports the hidden service directory version
  831. * 3 protocol (proposal 224). */
  832. int
  833. node_supports_v3_hsdir(const node_t *node)
  834. {
  835. tor_assert(node);
  836. if (node->rs) {
  837. return node->rs->supports_v3_hsdir;
  838. }
  839. if (node->ri) {
  840. if (node->ri->protocol_list == NULL) {
  841. return 0;
  842. }
  843. /* Bug #22447 forces us to filter on tor version:
  844. * If platform is a Tor version, and older than 0.3.0.8, return False.
  845. * Else, obey the protocol list. */
  846. if (node->ri->platform) {
  847. if (!strcmpstart(node->ri->platform, "Tor ") &&
  848. !tor_version_as_new_as(node->ri->platform, "0.3.0.8")) {
  849. return 0;
  850. }
  851. }
  852. return protocol_list_supports_protocol(node->ri->protocol_list,
  853. PRT_HSDIR, PROTOVER_HSDIR_V3);
  854. }
  855. tor_assert_nonfatal_unreached_once();
  856. return 0;
  857. }
  858. /** Return true iff <b>node</b> supports ed25519 authentication as an hidden
  859. * service introduction point.*/
  860. int
  861. node_supports_ed25519_hs_intro(const node_t *node)
  862. {
  863. tor_assert(node);
  864. if (node->rs) {
  865. return node->rs->supports_ed25519_hs_intro;
  866. }
  867. if (node->ri) {
  868. if (node->ri->protocol_list == NULL) {
  869. return 0;
  870. }
  871. return protocol_list_supports_protocol(node->ri->protocol_list,
  872. PRT_HSINTRO, PROTOVER_HS_INTRO_V3);
  873. }
  874. tor_assert_nonfatal_unreached_once();
  875. return 0;
  876. }
  877. /** Return the RSA ID key's SHA1 digest for the provided node. */
  878. const uint8_t *
  879. node_get_rsa_id_digest(const node_t *node)
  880. {
  881. tor_assert(node);
  882. return (const uint8_t*)node->identity;
  883. }
  884. /** Return the nickname of <b>node</b>, or NULL if we can't find one. */
  885. const char *
  886. node_get_nickname(const node_t *node)
  887. {
  888. tor_assert(node);
  889. if (node->rs)
  890. return node->rs->nickname;
  891. else if (node->ri)
  892. return node->ri->nickname;
  893. else
  894. return NULL;
  895. }
  896. /** Return true iff the nickname of <b>node</b> is canonical, based on the
  897. * latest consensus. */
  898. int
  899. node_is_named(const node_t *node)
  900. {
  901. const char *named_id;
  902. const char *nickname = node_get_nickname(node);
  903. if (!nickname)
  904. return 0;
  905. named_id = networkstatus_get_router_digest_by_nickname(nickname);
  906. if (!named_id)
  907. return 0;
  908. return tor_memeq(named_id, node->identity, DIGEST_LEN);
  909. }
  910. /** Return true iff <b>node</b> appears to be a directory authority or
  911. * directory cache */
  912. int
  913. node_is_dir(const node_t *node)
  914. {
  915. if (node->rs) {
  916. routerstatus_t * rs = node->rs;
  917. /* This is true if supports_tunnelled_dir_requests is true which
  918. * indicates that we support directory request tunnelled or through the
  919. * DirPort. */
  920. return rs->is_v2_dir;
  921. } else if (node->ri) {
  922. routerinfo_t * ri = node->ri;
  923. /* Both tunnelled request is supported or DirPort is set. */
  924. return ri->supports_tunnelled_dir_requests;
  925. } else {
  926. return 0;
  927. }
  928. }
  929. /** Return true iff <b>node</b> has either kind of usable descriptor -- that
  930. * is, a routerdescriptor or a microdescriptor. */
  931. int
  932. node_has_descriptor(const node_t *node)
  933. {
  934. return (node->ri ||
  935. (node->rs && node->md));
  936. }
  937. /** Return the router_purpose of <b>node</b>. */
  938. int
  939. node_get_purpose(const node_t *node)
  940. {
  941. if (node->ri)
  942. return node->ri->purpose;
  943. else
  944. return ROUTER_PURPOSE_GENERAL;
  945. }
  946. /** Compute the verbose ("extended") nickname of <b>node</b> and store it
  947. * into the MAX_VERBOSE_NICKNAME_LEN+1 character buffer at
  948. * <b>verbose_name_out</b> */
  949. void
  950. node_get_verbose_nickname(const node_t *node,
  951. char *verbose_name_out)
  952. {
  953. const char *nickname = node_get_nickname(node);
  954. int is_named = node_is_named(node);
  955. verbose_name_out[0] = '$';
  956. base16_encode(verbose_name_out+1, HEX_DIGEST_LEN+1, node->identity,
  957. DIGEST_LEN);
  958. if (!nickname)
  959. return;
  960. verbose_name_out[1+HEX_DIGEST_LEN] = is_named ? '=' : '~';
  961. strlcpy(verbose_name_out+1+HEX_DIGEST_LEN+1, nickname, MAX_NICKNAME_LEN+1);
  962. }
  963. /** Compute the verbose ("extended") nickname of node with
  964. * given <b>id_digest</b> and store it into the MAX_VERBOSE_NICKNAME_LEN+1
  965. * character buffer at <b>verbose_name_out</b>
  966. *
  967. * If node_get_by_id() returns NULL, base 16 encoding of
  968. * <b>id_digest</b> is returned instead. */
  969. void
  970. node_get_verbose_nickname_by_id(const char *id_digest,
  971. char *verbose_name_out)
  972. {
  973. const node_t *node = node_get_by_id(id_digest);
  974. if (!node) {
  975. verbose_name_out[0] = '$';
  976. base16_encode(verbose_name_out+1, HEX_DIGEST_LEN+1, id_digest, DIGEST_LEN);
  977. } else {
  978. node_get_verbose_nickname(node, verbose_name_out);
  979. }
  980. }
  981. /** Return true iff it seems that <b>node</b> allows circuits to exit
  982. * through it directlry from the client. */
  983. int
  984. node_allows_single_hop_exits(const node_t *node)
  985. {
  986. if (node && node->ri)
  987. return node->ri->allow_single_hop_exits;
  988. else
  989. return 0;
  990. }
  991. /** Return true iff it seems that <b>node</b> has an exit policy that doesn't
  992. * actually permit anything to exit, or we don't know its exit policy */
  993. int
  994. node_exit_policy_rejects_all(const node_t *node)
  995. {
  996. if (node->rejects_all)
  997. return 1;
  998. if (node->ri)
  999. return node->ri->policy_is_reject_star;
  1000. else if (node->md)
  1001. return node->md->exit_policy == NULL ||
  1002. short_policy_is_reject_star(node->md->exit_policy);
  1003. else
  1004. return 1;
  1005. }
  1006. /** Return true iff the exit policy for <b>node</b> is such that we can treat
  1007. * rejecting an address of type <b>family</b> unexpectedly as a sign of that
  1008. * node's failure. */
  1009. int
  1010. node_exit_policy_is_exact(const node_t *node, sa_family_t family)
  1011. {
  1012. if (family == AF_UNSPEC) {
  1013. return 1; /* Rejecting an address but not telling us what address
  1014. * is a bad sign. */
  1015. } else if (family == AF_INET) {
  1016. return node->ri != NULL;
  1017. } else if (family == AF_INET6) {
  1018. return 0;
  1019. }
  1020. tor_fragile_assert();
  1021. return 1;
  1022. }
  1023. /* Check if the "addr" and port_field fields from r are a valid non-listening
  1024. * address/port. If so, set valid to true and add a newly allocated
  1025. * tor_addr_port_t containing "addr" and port_field to sl.
  1026. * "addr" is an IPv4 host-order address and port_field is a uint16_t.
  1027. * r is typically a routerinfo_t or routerstatus_t.
  1028. */
  1029. #define SL_ADD_NEW_IPV4_AP(r, port_field, sl, valid) \
  1030. STMT_BEGIN \
  1031. if (tor_addr_port_is_valid_ipv4h((r)->addr, (r)->port_field, 0)) { \
  1032. valid = 1; \
  1033. tor_addr_port_t *ap = tor_malloc(sizeof(tor_addr_port_t)); \
  1034. tor_addr_from_ipv4h(&ap->addr, (r)->addr); \
  1035. ap->port = (r)->port_field; \
  1036. smartlist_add((sl), ap); \
  1037. } \
  1038. STMT_END
  1039. /* Check if the "addr" and port_field fields from r are a valid non-listening
  1040. * address/port. If so, set valid to true and add a newly allocated
  1041. * tor_addr_port_t containing "addr" and port_field to sl.
  1042. * "addr" is a tor_addr_t and port_field is a uint16_t.
  1043. * r is typically a routerinfo_t or routerstatus_t.
  1044. */
  1045. #define SL_ADD_NEW_IPV6_AP(r, port_field, sl, valid) \
  1046. STMT_BEGIN \
  1047. if (tor_addr_port_is_valid(&(r)->ipv6_addr, (r)->port_field, 0)) { \
  1048. valid = 1; \
  1049. tor_addr_port_t *ap = tor_malloc(sizeof(tor_addr_port_t)); \
  1050. tor_addr_copy(&ap->addr, &(r)->ipv6_addr); \
  1051. ap->port = (r)->port_field; \
  1052. smartlist_add((sl), ap); \
  1053. } \
  1054. STMT_END
  1055. /** Return list of tor_addr_port_t with all OR ports (in the sense IP
  1056. * addr + TCP port) for <b>node</b>. Caller must free all elements
  1057. * using tor_free() and free the list using smartlist_free().
  1058. *
  1059. * XXX this is potentially a memory fragmentation hog -- if on
  1060. * critical path consider the option of having the caller allocate the
  1061. * memory
  1062. */
  1063. smartlist_t *
  1064. node_get_all_orports(const node_t *node)
  1065. {
  1066. smartlist_t *sl = smartlist_new();
  1067. int valid = 0;
  1068. /* Find a valid IPv4 address and port */
  1069. if (node->ri != NULL) {
  1070. SL_ADD_NEW_IPV4_AP(node->ri, or_port, sl, valid);
  1071. }
  1072. /* If we didn't find a valid address/port in the ri, try the rs */
  1073. if (!valid && node->rs != NULL) {
  1074. SL_ADD_NEW_IPV4_AP(node->rs, or_port, sl, valid);
  1075. }
  1076. /* Find a valid IPv6 address and port */
  1077. valid = 0;
  1078. if (node->ri != NULL) {
  1079. SL_ADD_NEW_IPV6_AP(node->ri, ipv6_orport, sl, valid);
  1080. }
  1081. if (!valid && node->rs != NULL) {
  1082. SL_ADD_NEW_IPV6_AP(node->rs, ipv6_orport, sl, valid);
  1083. }
  1084. if (!valid && node->md != NULL) {
  1085. SL_ADD_NEW_IPV6_AP(node->md, ipv6_orport, sl, valid);
  1086. }
  1087. return sl;
  1088. }
  1089. #undef SL_ADD_NEW_IPV4_AP
  1090. #undef SL_ADD_NEW_IPV6_AP
  1091. /** Wrapper around node_get_prim_orport for backward
  1092. compatibility. */
  1093. void
  1094. node_get_addr(const node_t *node, tor_addr_t *addr_out)
  1095. {
  1096. tor_addr_port_t ap;
  1097. node_get_prim_orport(node, &ap);
  1098. tor_addr_copy(addr_out, &ap.addr);
  1099. }
  1100. /** Return the host-order IPv4 address for <b>node</b>, or 0 if it doesn't
  1101. * seem to have one. */
  1102. uint32_t
  1103. node_get_prim_addr_ipv4h(const node_t *node)
  1104. {
  1105. /* Don't check the ORPort or DirPort, as this function isn't port-specific,
  1106. * and the node might have a valid IPv4 address, yet have a zero
  1107. * ORPort or DirPort.
  1108. */
  1109. if (node->ri && tor_addr_is_valid_ipv4h(node->ri->addr, 0)) {
  1110. return node->ri->addr;
  1111. } else if (node->rs && tor_addr_is_valid_ipv4h(node->rs->addr, 0)) {
  1112. return node->rs->addr;
  1113. }
  1114. return 0;
  1115. }
  1116. /** Copy a string representation of an IP address for <b>node</b> into
  1117. * the <b>len</b>-byte buffer at <b>buf</b>. */
  1118. void
  1119. node_get_address_string(const node_t *node, char *buf, size_t len)
  1120. {
  1121. uint32_t ipv4_addr = node_get_prim_addr_ipv4h(node);
  1122. if (tor_addr_is_valid_ipv4h(ipv4_addr, 0)) {
  1123. tor_addr_t addr;
  1124. tor_addr_from_ipv4h(&addr, ipv4_addr);
  1125. tor_addr_to_str(buf, &addr, len, 0);
  1126. } else if (len > 0) {
  1127. buf[0] = '\0';
  1128. }
  1129. }
  1130. /** Return <b>node</b>'s declared uptime, or -1 if it doesn't seem to have
  1131. * one. */
  1132. long
  1133. node_get_declared_uptime(const node_t *node)
  1134. {
  1135. if (node->ri)
  1136. return node->ri->uptime;
  1137. else
  1138. return -1;
  1139. }
  1140. /** Return <b>node</b>'s platform string, or NULL if we don't know it. */
  1141. const char *
  1142. node_get_platform(const node_t *node)
  1143. {
  1144. /* If we wanted, we could record the version in the routerstatus_t, since
  1145. * the consensus lists it. We don't, though, so this function just won't
  1146. * work with microdescriptors. */
  1147. if (node->ri)
  1148. return node->ri->platform;
  1149. else
  1150. return NULL;
  1151. }
  1152. /** Return true iff <b>node</b> is one representing this router. */
  1153. int
  1154. node_is_me(const node_t *node)
  1155. {
  1156. return router_digest_is_me(node->identity);
  1157. }
  1158. /** Return <b>node</b> declared family (as a list of names), or NULL if
  1159. * the node didn't declare a family. */
  1160. const smartlist_t *
  1161. node_get_declared_family(const node_t *node)
  1162. {
  1163. if (node->ri && node->ri->declared_family)
  1164. return node->ri->declared_family;
  1165. else if (node->md && node->md->family)
  1166. return node->md->family;
  1167. else
  1168. return NULL;
  1169. }
  1170. /* Does this node have a valid IPv6 address?
  1171. * Prefer node_has_ipv6_orport() or node_has_ipv6_dirport() for
  1172. * checking specific ports. */
  1173. int
  1174. node_has_ipv6_addr(const node_t *node)
  1175. {
  1176. /* Don't check the ORPort or DirPort, as this function isn't port-specific,
  1177. * and the node might have a valid IPv6 address, yet have a zero
  1178. * ORPort or DirPort.
  1179. */
  1180. if (node->ri && tor_addr_is_valid(&node->ri->ipv6_addr, 0))
  1181. return 1;
  1182. if (node->rs && tor_addr_is_valid(&node->rs->ipv6_addr, 0))
  1183. return 1;
  1184. if (node->md && tor_addr_is_valid(&node->md->ipv6_addr, 0))
  1185. return 1;
  1186. return 0;
  1187. }
  1188. /* Does this node have a valid IPv6 ORPort? */
  1189. int
  1190. node_has_ipv6_orport(const node_t *node)
  1191. {
  1192. tor_addr_port_t ipv6_orport;
  1193. node_get_pref_ipv6_orport(node, &ipv6_orport);
  1194. return tor_addr_port_is_valid_ap(&ipv6_orport, 0);
  1195. }
  1196. /* Does this node have a valid IPv6 DirPort? */
  1197. int
  1198. node_has_ipv6_dirport(const node_t *node)
  1199. {
  1200. tor_addr_port_t ipv6_dirport;
  1201. node_get_pref_ipv6_dirport(node, &ipv6_dirport);
  1202. return tor_addr_port_is_valid_ap(&ipv6_dirport, 0);
  1203. }
  1204. /** Return 1 if we prefer the IPv6 address and OR TCP port of
  1205. * <b>node</b>, else 0.
  1206. *
  1207. * We prefer the IPv6 address if the router has an IPv6 address,
  1208. * and we can use IPv6 addresses, and:
  1209. * i) the node_t says that it prefers IPv6
  1210. * or
  1211. * ii) the router has no IPv4 OR address.
  1212. *
  1213. * If you don't have a node, consider looking it up.
  1214. * If there is no node, use fascist_firewall_prefer_ipv6_orport().
  1215. */
  1216. int
  1217. node_ipv6_or_preferred(const node_t *node)
  1218. {
  1219. const or_options_t *options = get_options();
  1220. tor_addr_port_t ipv4_addr;
  1221. node_assert_ok(node);
  1222. /* XX/teor - node->ipv6_preferred is set from
  1223. * fascist_firewall_prefer_ipv6_orport() each time the consensus is loaded.
  1224. */
  1225. if (!fascist_firewall_use_ipv6(options)) {
  1226. return 0;
  1227. } else if (node->ipv6_preferred || node_get_prim_orport(node, &ipv4_addr)) {
  1228. return node_has_ipv6_orport(node);
  1229. }
  1230. return 0;
  1231. }
  1232. #define RETURN_IPV4_AP(r, port_field, ap_out) \
  1233. STMT_BEGIN \
  1234. if (r && tor_addr_port_is_valid_ipv4h((r)->addr, (r)->port_field, 0)) { \
  1235. tor_addr_from_ipv4h(&(ap_out)->addr, (r)->addr); \
  1236. (ap_out)->port = (r)->port_field; \
  1237. return 0; \
  1238. } \
  1239. STMT_END
  1240. /** Copy the primary (IPv4) OR port (IP address and TCP port) for
  1241. * <b>node</b> into *<b>ap_out</b>. Return 0 if a valid address and
  1242. * port was copied, else return non-zero.*/
  1243. int
  1244. node_get_prim_orport(const node_t *node, tor_addr_port_t *ap_out)
  1245. {
  1246. node_assert_ok(node);
  1247. tor_assert(ap_out);
  1248. /* Check ri first, because rewrite_node_address_for_bridge() updates
  1249. * node->ri with the configured bridge address. */
  1250. RETURN_IPV4_AP(node->ri, or_port, ap_out);
  1251. RETURN_IPV4_AP(node->rs, or_port, ap_out);
  1252. /* Microdescriptors only have an IPv6 address */
  1253. return -1;
  1254. }
  1255. /** Copy the preferred OR port (IP address and TCP port) for
  1256. * <b>node</b> into *<b>ap_out</b>. */
  1257. void
  1258. node_get_pref_orport(const node_t *node, tor_addr_port_t *ap_out)
  1259. {
  1260. tor_assert(ap_out);
  1261. if (node_ipv6_or_preferred(node)) {
  1262. node_get_pref_ipv6_orport(node, ap_out);
  1263. } else {
  1264. /* the primary ORPort is always on IPv4 */
  1265. node_get_prim_orport(node, ap_out);
  1266. }
  1267. }
  1268. /** Copy the preferred IPv6 OR port (IP address and TCP port) for
  1269. * <b>node</b> into *<b>ap_out</b>. */
  1270. void
  1271. node_get_pref_ipv6_orport(const node_t *node, tor_addr_port_t *ap_out)
  1272. {
  1273. node_assert_ok(node);
  1274. tor_assert(ap_out);
  1275. /* Check ri first, because rewrite_node_address_for_bridge() updates
  1276. * node->ri with the configured bridge address.
  1277. * Prefer rs over md for consistency with the fascist_firewall_* functions.
  1278. * Check if the address or port are valid, and try another alternative
  1279. * if they are not. */
  1280. if (node->ri && tor_addr_port_is_valid(&node->ri->ipv6_addr,
  1281. node->ri->ipv6_orport, 0)) {
  1282. tor_addr_copy(&ap_out->addr, &node->ri->ipv6_addr);
  1283. ap_out->port = node->ri->ipv6_orport;
  1284. } else if (node->rs && tor_addr_port_is_valid(&node->rs->ipv6_addr,
  1285. node->rs->ipv6_orport, 0)) {
  1286. tor_addr_copy(&ap_out->addr, &node->rs->ipv6_addr);
  1287. ap_out->port = node->rs->ipv6_orport;
  1288. } else if (node->md && tor_addr_port_is_valid(&node->md->ipv6_addr,
  1289. node->md->ipv6_orport, 0)) {
  1290. tor_addr_copy(&ap_out->addr, &node->md->ipv6_addr);
  1291. ap_out->port = node->md->ipv6_orport;
  1292. } else {
  1293. tor_addr_make_null(&ap_out->addr, AF_INET6);
  1294. ap_out->port = 0;
  1295. }
  1296. }
  1297. /** Return 1 if we prefer the IPv6 address and Dir TCP port of
  1298. * <b>node</b>, else 0.
  1299. *
  1300. * We prefer the IPv6 address if the router has an IPv6 address,
  1301. * and we can use IPv6 addresses, and:
  1302. * i) the router has no IPv4 Dir address.
  1303. * or
  1304. * ii) our preference is for IPv6 Dir addresses.
  1305. *
  1306. * If there is no node, use fascist_firewall_prefer_ipv6_dirport().
  1307. */
  1308. int
  1309. node_ipv6_dir_preferred(const node_t *node)
  1310. {
  1311. const or_options_t *options = get_options();
  1312. tor_addr_port_t ipv4_addr;
  1313. node_assert_ok(node);
  1314. /* node->ipv6_preferred is set from fascist_firewall_prefer_ipv6_orport(),
  1315. * so we can't use it to determine DirPort IPv6 preference.
  1316. * This means that bridge clients will use IPv4 DirPorts by default.
  1317. */
  1318. if (!fascist_firewall_use_ipv6(options)) {
  1319. return 0;
  1320. } else if (node_get_prim_dirport(node, &ipv4_addr)
  1321. || fascist_firewall_prefer_ipv6_dirport(get_options())) {
  1322. return node_has_ipv6_dirport(node);
  1323. }
  1324. return 0;
  1325. }
  1326. /** Copy the primary (IPv4) Dir port (IP address and TCP port) for
  1327. * <b>node</b> into *<b>ap_out</b>. Return 0 if a valid address and
  1328. * port was copied, else return non-zero.*/
  1329. int
  1330. node_get_prim_dirport(const node_t *node, tor_addr_port_t *ap_out)
  1331. {
  1332. node_assert_ok(node);
  1333. tor_assert(ap_out);
  1334. /* Check ri first, because rewrite_node_address_for_bridge() updates
  1335. * node->ri with the configured bridge address. */
  1336. RETURN_IPV4_AP(node->ri, dir_port, ap_out);
  1337. RETURN_IPV4_AP(node->rs, dir_port, ap_out);
  1338. /* Microdescriptors only have an IPv6 address */
  1339. return -1;
  1340. }
  1341. #undef RETURN_IPV4_AP
  1342. /** Copy the preferred Dir port (IP address and TCP port) for
  1343. * <b>node</b> into *<b>ap_out</b>. */
  1344. void
  1345. node_get_pref_dirport(const node_t *node, tor_addr_port_t *ap_out)
  1346. {
  1347. tor_assert(ap_out);
  1348. if (node_ipv6_dir_preferred(node)) {
  1349. node_get_pref_ipv6_dirport(node, ap_out);
  1350. } else {
  1351. /* the primary DirPort is always on IPv4 */
  1352. node_get_prim_dirport(node, ap_out);
  1353. }
  1354. }
  1355. /** Copy the preferred IPv6 Dir port (IP address and TCP port) for
  1356. * <b>node</b> into *<b>ap_out</b>. */
  1357. void
  1358. node_get_pref_ipv6_dirport(const node_t *node, tor_addr_port_t *ap_out)
  1359. {
  1360. node_assert_ok(node);
  1361. tor_assert(ap_out);
  1362. /* Check ri first, because rewrite_node_address_for_bridge() updates
  1363. * node->ri with the configured bridge address.
  1364. * Prefer rs over md for consistency with the fascist_firewall_* functions.
  1365. * Check if the address or port are valid, and try another alternative
  1366. * if they are not. */
  1367. /* Assume IPv4 and IPv6 dirports are the same */
  1368. if (node->ri && tor_addr_port_is_valid(&node->ri->ipv6_addr,
  1369. node->ri->dir_port, 0)) {
  1370. tor_addr_copy(&ap_out->addr, &node->ri->ipv6_addr);
  1371. ap_out->port = node->ri->dir_port;
  1372. } else if (node->rs && tor_addr_port_is_valid(&node->rs->ipv6_addr,
  1373. node->rs->dir_port, 0)) {
  1374. tor_addr_copy(&ap_out->addr, &node->rs->ipv6_addr);
  1375. ap_out->port = node->rs->dir_port;
  1376. } else {
  1377. tor_addr_make_null(&ap_out->addr, AF_INET6);
  1378. ap_out->port = 0;
  1379. }
  1380. }
  1381. /** Return true iff <b>md</b> has a curve25519 onion key.
  1382. * Use node_has_curve25519_onion_key() instead of calling this directly. */
  1383. static int
  1384. microdesc_has_curve25519_onion_key(const microdesc_t *md)
  1385. {
  1386. if (!md) {
  1387. return 0;
  1388. }
  1389. if (!md->onion_curve25519_pkey) {
  1390. return 0;
  1391. }
  1392. if (tor_mem_is_zero((const char*)md->onion_curve25519_pkey->public_key,
  1393. CURVE25519_PUBKEY_LEN)) {
  1394. return 0;
  1395. }
  1396. return 1;
  1397. }
  1398. /** Return true iff <b>node</b> has a curve25519 onion key. */
  1399. int
  1400. node_has_curve25519_onion_key(const node_t *node)
  1401. {
  1402. if (!node)
  1403. return 0;
  1404. if (node->ri)
  1405. return routerinfo_has_curve25519_onion_key(node->ri);
  1406. else if (node->md)
  1407. return microdesc_has_curve25519_onion_key(node->md);
  1408. else
  1409. return 0;
  1410. }
  1411. /** Refresh the country code of <b>ri</b>. This function MUST be called on
  1412. * each router when the GeoIP database is reloaded, and on all new routers. */
  1413. void
  1414. node_set_country(node_t *node)
  1415. {
  1416. tor_addr_t addr = TOR_ADDR_NULL;
  1417. /* XXXXipv6 */
  1418. if (node->rs)
  1419. tor_addr_from_ipv4h(&addr, node->rs->addr);
  1420. else if (node->ri)
  1421. tor_addr_from_ipv4h(&addr, node->ri->addr);
  1422. node->country = geoip_get_country_by_addr(&addr);
  1423. }
  1424. /** Set the country code of all routers in the routerlist. */
  1425. void
  1426. nodelist_refresh_countries(void)
  1427. {
  1428. smartlist_t *nodes = nodelist_get_list();
  1429. SMARTLIST_FOREACH(nodes, node_t *, node,
  1430. node_set_country(node));
  1431. }
  1432. /** Return true iff router1 and router2 have similar enough network addresses
  1433. * that we should treat them as being in the same family */
  1434. int
  1435. addrs_in_same_network_family(const tor_addr_t *a1,
  1436. const tor_addr_t *a2)
  1437. {
  1438. return 0 == tor_addr_compare_masked(a1, a2, 16, CMP_SEMANTIC);
  1439. }
  1440. /** Return true if <b>node</b>'s nickname matches <b>nickname</b>
  1441. * (case-insensitive), or if <b>node's</b> identity key digest
  1442. * matches a hexadecimal value stored in <b>nickname</b>. Return
  1443. * false otherwise. */
  1444. static int
  1445. node_nickname_matches(const node_t *node, const char *nickname)
  1446. {
  1447. const char *n = node_get_nickname(node);
  1448. if (n && nickname[0]!='$' && !strcasecmp(n, nickname))
  1449. return 1;
  1450. return hex_digest_nickname_matches(nickname,
  1451. node->identity,
  1452. n,
  1453. node_is_named(node));
  1454. }
  1455. /** Return true iff <b>node</b> is named by some nickname in <b>lst</b>. */
  1456. static inline int
  1457. node_in_nickname_smartlist(const smartlist_t *lst, const node_t *node)
  1458. {
  1459. if (!lst) return 0;
  1460. SMARTLIST_FOREACH(lst, const char *, name, {
  1461. if (node_nickname_matches(node, name))
  1462. return 1;
  1463. });
  1464. return 0;
  1465. }
  1466. /** Return true iff r1 and r2 are in the same family, but not the same
  1467. * router. */
  1468. int
  1469. nodes_in_same_family(const node_t *node1, const node_t *node2)
  1470. {
  1471. const or_options_t *options = get_options();
  1472. /* Are they in the same family because of their addresses? */
  1473. if (options->EnforceDistinctSubnets) {
  1474. tor_addr_t a1, a2;
  1475. node_get_addr(node1, &a1);
  1476. node_get_addr(node2, &a2);
  1477. if (addrs_in_same_network_family(&a1, &a2))
  1478. return 1;
  1479. }
  1480. /* Are they in the same family because the agree they are? */
  1481. {
  1482. const smartlist_t *f1, *f2;
  1483. f1 = node_get_declared_family(node1);
  1484. f2 = node_get_declared_family(node2);
  1485. if (f1 && f2 &&
  1486. node_in_nickname_smartlist(f1, node2) &&
  1487. node_in_nickname_smartlist(f2, node1))
  1488. return 1;
  1489. }
  1490. /* Are they in the same option because the user says they are? */
  1491. if (options->NodeFamilySets) {
  1492. SMARTLIST_FOREACH(options->NodeFamilySets, const routerset_t *, rs, {
  1493. if (routerset_contains_node(rs, node1) &&
  1494. routerset_contains_node(rs, node2))
  1495. return 1;
  1496. });
  1497. }
  1498. return 0;
  1499. }
  1500. /**
  1501. * Add all the family of <b>node</b>, including <b>node</b> itself, to
  1502. * the smartlist <b>sl</b>.
  1503. *
  1504. * This is used to make sure we don't pick siblings in a single path, or
  1505. * pick more than one relay from a family for our entry guard list.
  1506. * Note that a node may be added to <b>sl</b> more than once if it is
  1507. * part of <b>node</b>'s family for more than one reason.
  1508. */
  1509. void
  1510. nodelist_add_node_and_family(smartlist_t *sl, const node_t *node)
  1511. {
  1512. const smartlist_t *all_nodes = nodelist_get_list();
  1513. const smartlist_t *declared_family;
  1514. const or_options_t *options = get_options();
  1515. tor_assert(node);
  1516. declared_family = node_get_declared_family(node);
  1517. /* Let's make sure that we have the node itself, if it's a real node. */
  1518. {
  1519. const node_t *real_node = node_get_by_id(node->identity);
  1520. if (real_node)
  1521. smartlist_add(sl, (node_t*)real_node);
  1522. }
  1523. /* First, add any nodes with similar network addresses. */
  1524. if (options->EnforceDistinctSubnets) {
  1525. tor_addr_t node_addr;
  1526. node_get_addr(node, &node_addr);
  1527. SMARTLIST_FOREACH_BEGIN(all_nodes, const node_t *, node2) {
  1528. tor_addr_t a;
  1529. node_get_addr(node2, &a);
  1530. if (addrs_in_same_network_family(&a, &node_addr))
  1531. smartlist_add(sl, (void*)node2);
  1532. } SMARTLIST_FOREACH_END(node2);
  1533. }
  1534. /* Now, add all nodes in the declared_family of this node, if they
  1535. * also declare this node to be in their family. */
  1536. if (declared_family) {
  1537. /* Add every r such that router declares familyness with node, and node
  1538. * declares familyhood with router. */
  1539. SMARTLIST_FOREACH_BEGIN(declared_family, const char *, name) {
  1540. const node_t *node2;
  1541. const smartlist_t *family2;
  1542. if (!(node2 = node_get_by_nickname(name, 0)))
  1543. continue;
  1544. if (!(family2 = node_get_declared_family(node2)))
  1545. continue;
  1546. SMARTLIST_FOREACH_BEGIN(family2, const char *, name2) {
  1547. if (node_nickname_matches(node, name2)) {
  1548. smartlist_add(sl, (void*)node2);
  1549. break;
  1550. }
  1551. } SMARTLIST_FOREACH_END(name2);
  1552. } SMARTLIST_FOREACH_END(name);
  1553. }
  1554. /* If the user declared any families locally, honor those too. */
  1555. if (options->NodeFamilySets) {
  1556. SMARTLIST_FOREACH(options->NodeFamilySets, const routerset_t *, rs, {
  1557. if (routerset_contains_node(rs, node)) {
  1558. routerset_get_all_nodes(sl, rs, NULL, 0);
  1559. }
  1560. });
  1561. }
  1562. }
  1563. /** Find a router that's up, that has this IP address, and
  1564. * that allows exit to this address:port, or return NULL if there
  1565. * isn't a good one.
  1566. * Don't exit enclave to excluded relays -- it wouldn't actually
  1567. * hurt anything, but this way there are fewer confused users.
  1568. */
  1569. const node_t *
  1570. router_find_exact_exit_enclave(const char *address, uint16_t port)
  1571. {/*XXXX MOVE*/
  1572. uint32_t addr;
  1573. struct in_addr in;
  1574. tor_addr_t a;
  1575. const or_options_t *options = get_options();
  1576. if (!tor_inet_aton(address, &in))
  1577. return NULL; /* it's not an IP already */
  1578. addr = ntohl(in.s_addr);
  1579. tor_addr_from_ipv4h(&a, addr);
  1580. SMARTLIST_FOREACH(nodelist_get_list(), const node_t *, node, {
  1581. if (node_get_addr_ipv4h(node) == addr &&
  1582. node->is_running &&
  1583. compare_tor_addr_to_node_policy(&a, port, node) ==
  1584. ADDR_POLICY_ACCEPTED &&
  1585. !routerset_contains_node(options->ExcludeExitNodesUnion_, node))
  1586. return node;
  1587. });
  1588. return NULL;
  1589. }
  1590. /** Return 1 if <b>router</b> is not suitable for these parameters, else 0.
  1591. * If <b>need_uptime</b> is non-zero, we require a minimum uptime.
  1592. * If <b>need_capacity</b> is non-zero, we require a minimum advertised
  1593. * bandwidth.
  1594. * If <b>need_guard</b>, we require that the router is a possible entry guard.
  1595. */
  1596. int
  1597. node_is_unreliable(const node_t *node, int need_uptime,
  1598. int need_capacity, int need_guard)
  1599. {
  1600. if (need_uptime && !node->is_stable)
  1601. return 1;
  1602. if (need_capacity && !node->is_fast)
  1603. return 1;
  1604. if (need_guard && !node->is_possible_guard)
  1605. return 1;
  1606. return 0;
  1607. }
  1608. /** Return 1 if all running sufficiently-stable routers we can use will reject
  1609. * addr:port. Return 0 if any might accept it. */
  1610. int
  1611. router_exit_policy_all_nodes_reject(const tor_addr_t *addr, uint16_t port,
  1612. int need_uptime)
  1613. {
  1614. addr_policy_result_t r;
  1615. SMARTLIST_FOREACH_BEGIN(nodelist_get_list(), const node_t *, node) {
  1616. if (node->is_running &&
  1617. !node_is_unreliable(node, need_uptime, 0, 0)) {
  1618. r = compare_tor_addr_to_node_policy(addr, port, node);
  1619. if (r != ADDR_POLICY_REJECTED && r != ADDR_POLICY_PROBABLY_REJECTED)
  1620. return 0; /* this one could be ok. good enough. */
  1621. }
  1622. } SMARTLIST_FOREACH_END(node);
  1623. return 1; /* all will reject. */
  1624. }
  1625. /** Mark the router with ID <b>digest</b> as running or non-running
  1626. * in our routerlist. */
  1627. void
  1628. router_set_status(const char *digest, int up)
  1629. {
  1630. node_t *node;
  1631. tor_assert(digest);
  1632. SMARTLIST_FOREACH(router_get_fallback_dir_servers(),
  1633. dir_server_t *, d,
  1634. if (tor_memeq(d->digest, digest, DIGEST_LEN))
  1635. d->is_running = up);
  1636. SMARTLIST_FOREACH(router_get_trusted_dir_servers(),
  1637. dir_server_t *, d,
  1638. if (tor_memeq(d->digest, digest, DIGEST_LEN))
  1639. d->is_running = up);
  1640. node = node_get_mutable_by_id(digest);
  1641. if (node) {
  1642. #if 0
  1643. log_debug(LD_DIR,"Marking router %s as %s.",
  1644. node_describe(node), up ? "up" : "down");
  1645. #endif
  1646. if (!up && node_is_me(node) && !net_is_disabled())
  1647. log_warn(LD_NET, "We just marked ourself as down. Are your external "
  1648. "addresses reachable?");
  1649. if (bool_neq(node->is_running, up))
  1650. router_dir_info_changed();
  1651. node->is_running = up;
  1652. }
  1653. }
  1654. /** True iff, the last time we checked whether we had enough directory info
  1655. * to build circuits, the answer was "yes". If there are no exits in the
  1656. * consensus, we act as if we have 100% of the exit directory info. */
  1657. static int have_min_dir_info = 0;
  1658. /** Does the consensus contain nodes that can exit? */
  1659. static consensus_path_type_t have_consensus_path = CONSENSUS_PATH_UNKNOWN;
  1660. /** True iff enough has changed since the last time we checked whether we had
  1661. * enough directory info to build circuits that our old answer can no longer
  1662. * be trusted. */
  1663. static int need_to_update_have_min_dir_info = 1;
  1664. /** String describing what we're missing before we have enough directory
  1665. * info. */
  1666. static char dir_info_status[512] = "";
  1667. /** Return true iff we have enough consensus information to
  1668. * start building circuits. Right now, this means "a consensus that's
  1669. * less than a day old, and at least 60% of router descriptors (configurable),
  1670. * weighted by bandwidth. Treat the exit fraction as 100% if there are
  1671. * no exits in the consensus."
  1672. * To obtain the final weighted bandwidth, we multiply the
  1673. * weighted bandwidth fraction for each position (guard, middle, exit). */
  1674. int
  1675. router_have_minimum_dir_info(void)
  1676. {
  1677. static int logged_delay=0;
  1678. const char *delay_fetches_msg = NULL;
  1679. if (should_delay_dir_fetches(get_options(), &delay_fetches_msg)) {
  1680. if (!logged_delay)
  1681. log_notice(LD_DIR, "Delaying directory fetches: %s", delay_fetches_msg);
  1682. logged_delay=1;
  1683. strlcpy(dir_info_status, delay_fetches_msg, sizeof(dir_info_status));
  1684. return 0;
  1685. }
  1686. logged_delay = 0; /* reset it if we get this far */
  1687. if (PREDICT_UNLIKELY(need_to_update_have_min_dir_info)) {
  1688. update_router_have_minimum_dir_info();
  1689. }
  1690. return have_min_dir_info;
  1691. }
  1692. /** Set to CONSENSUS_PATH_EXIT if there is at least one exit node
  1693. * in the consensus. We update this flag in compute_frac_paths_available if
  1694. * there is at least one relay that has an Exit flag in the consensus.
  1695. * Used to avoid building exit circuits when they will almost certainly fail.
  1696. * Set to CONSENSUS_PATH_INTERNAL if there are no exits in the consensus.
  1697. * (This situation typically occurs during bootstrap of a test network.)
  1698. * Set to CONSENSUS_PATH_UNKNOWN if we have never checked, or have
  1699. * reason to believe our last known value was invalid or has expired.
  1700. * If we're in a network with TestingDirAuthVoteExit set,
  1701. * this can cause router_have_consensus_path() to be set to
  1702. * CONSENSUS_PATH_EXIT, even if there are no nodes with accept exit policies.
  1703. */
  1704. MOCK_IMPL(consensus_path_type_t,
  1705. router_have_consensus_path, (void))
  1706. {
  1707. return have_consensus_path;
  1708. }
  1709. /** Called when our internal view of the directory has changed. This can be
  1710. * when the authorities change, networkstatuses change, the list of routerdescs
  1711. * changes, or number of running routers changes.
  1712. */
  1713. void
  1714. router_dir_info_changed(void)
  1715. {
  1716. need_to_update_have_min_dir_info = 1;
  1717. rend_hsdir_routers_changed();
  1718. }
  1719. /** Return a string describing what we're missing before we have enough
  1720. * directory info. */
  1721. const char *
  1722. get_dir_info_status_string(void)
  1723. {
  1724. return dir_info_status;
  1725. }
  1726. /** Iterate over the servers listed in <b>consensus</b>, and count how many of
  1727. * them seem like ones we'd use (store this in *<b>num_usable</b>), and how
  1728. * many of <em>those</em> we have descriptors for (store this in
  1729. * *<b>num_present</b>).
  1730. *
  1731. * If <b>in_set</b> is non-NULL, only consider those routers in <b>in_set</b>.
  1732. * If <b>exit_only</b> is USABLE_DESCRIPTOR_EXIT_ONLY, only consider nodes
  1733. * with the Exit flag.
  1734. * If *<b>descs_out</b> is present, add a node_t for each usable descriptor
  1735. * to it.
  1736. */
  1737. static void
  1738. count_usable_descriptors(int *num_present, int *num_usable,
  1739. smartlist_t *descs_out,
  1740. const networkstatus_t *consensus,
  1741. time_t now,
  1742. routerset_t *in_set,
  1743. usable_descriptor_t exit_only)
  1744. {
  1745. const int md = (consensus->flavor == FLAV_MICRODESC);
  1746. *num_present = 0, *num_usable = 0;
  1747. SMARTLIST_FOREACH_BEGIN(consensus->routerstatus_list, routerstatus_t *, rs)
  1748. {
  1749. const node_t *node = node_get_by_id(rs->identity_digest);
  1750. if (!node)
  1751. continue; /* This would be a bug: every entry in the consensus is
  1752. * supposed to have a node. */
  1753. if (exit_only == USABLE_DESCRIPTOR_EXIT_ONLY && ! rs->is_exit)
  1754. continue;
  1755. if (in_set && ! routerset_contains_routerstatus(in_set, rs, -1))
  1756. continue;
  1757. if (client_would_use_router(rs, now)) {
  1758. const char * const digest = rs->descriptor_digest;
  1759. int present;
  1760. ++*num_usable; /* the consensus says we want it. */
  1761. if (md)
  1762. present = NULL != microdesc_cache_lookup_by_digest256(NULL, digest);
  1763. else
  1764. present = NULL != router_get_by_descriptor_digest(digest);
  1765. if (present) {
  1766. /* we have the descriptor listed in the consensus. */
  1767. ++*num_present;
  1768. }
  1769. if (descs_out)
  1770. smartlist_add(descs_out, (node_t*)node);
  1771. }
  1772. }
  1773. SMARTLIST_FOREACH_END(rs);
  1774. log_debug(LD_DIR, "%d usable, %d present (%s%s).",
  1775. *num_usable, *num_present,
  1776. md ? "microdesc" : "desc",
  1777. exit_only == USABLE_DESCRIPTOR_EXIT_ONLY ? " exits" : "s");
  1778. }
  1779. /** Return an estimate of which fraction of usable paths through the Tor
  1780. * network we have available for use. Count how many routers seem like ones
  1781. * we'd use (store this in *<b>num_usable_out</b>), and how many of
  1782. * <em>those</em> we have descriptors for (store this in
  1783. * *<b>num_present_out</b>.)
  1784. *
  1785. * If **<b>status_out</b> is present, allocate a new string and print the
  1786. * available percentages of guard, middle, and exit nodes to it, noting
  1787. * whether there are exits in the consensus.
  1788. * If there are no exits in the consensus, we treat the exit fraction as 100%,
  1789. * but set router_have_consensus_path() so that we can only build internal
  1790. * paths. */
  1791. static double
  1792. compute_frac_paths_available(const networkstatus_t *consensus,
  1793. const or_options_t *options, time_t now,
  1794. int *num_present_out, int *num_usable_out,
  1795. char **status_out)
  1796. {
  1797. smartlist_t *guards = smartlist_new();
  1798. smartlist_t *mid = smartlist_new();
  1799. smartlist_t *exits = smartlist_new();
  1800. double f_guard, f_mid, f_exit;
  1801. double f_path = 0.0;
  1802. /* Used to determine whether there are any exits in the consensus */
  1803. int np = 0;
  1804. /* Used to determine whether there are any exits with descriptors */
  1805. int nu = 0;
  1806. const int authdir = authdir_mode_v3(options);
  1807. count_usable_descriptors(num_present_out, num_usable_out,
  1808. mid, consensus, now, NULL,
  1809. USABLE_DESCRIPTOR_ALL);
  1810. if (options->EntryNodes) {
  1811. count_usable_descriptors(&np, &nu, guards, consensus, now,
  1812. options->EntryNodes, USABLE_DESCRIPTOR_ALL);
  1813. } else {
  1814. SMARTLIST_FOREACH(mid, const node_t *, node, {
  1815. if (authdir) {
  1816. if (node->rs && node->rs->is_possible_guard)
  1817. smartlist_add(guards, (node_t*)node);
  1818. } else {
  1819. if (node->is_possible_guard)
  1820. smartlist_add(guards, (node_t*)node);
  1821. }
  1822. });
  1823. }
  1824. /* All nodes with exit flag
  1825. * If we're in a network with TestingDirAuthVoteExit set,
  1826. * this can cause false positives on have_consensus_path,
  1827. * incorrectly setting it to CONSENSUS_PATH_EXIT. This is
  1828. * an unavoidable feature of forcing authorities to declare
  1829. * certain nodes as exits.
  1830. */
  1831. count_usable_descriptors(&np, &nu, exits, consensus, now,
  1832. NULL, USABLE_DESCRIPTOR_EXIT_ONLY);
  1833. log_debug(LD_NET,
  1834. "%s: %d present, %d usable",
  1835. "exits",
  1836. np,
  1837. nu);
  1838. /* We need at least 1 exit present in the consensus to consider
  1839. * building exit paths */
  1840. /* Update our understanding of whether the consensus has exits */
  1841. consensus_path_type_t old_have_consensus_path = have_consensus_path;
  1842. have_consensus_path = ((nu > 0) ?
  1843. CONSENSUS_PATH_EXIT :
  1844. CONSENSUS_PATH_INTERNAL);
  1845. if (have_consensus_path == CONSENSUS_PATH_INTERNAL
  1846. && old_have_consensus_path != have_consensus_path) {
  1847. log_notice(LD_NET,
  1848. "The current consensus has no exit nodes. "
  1849. "Tor can only build internal paths, "
  1850. "such as paths to hidden services.");
  1851. /* However, exit nodes can reachability self-test using this consensus,
  1852. * join the network, and appear in a later consensus. This will allow
  1853. * the network to build exit paths, such as paths for world wide web
  1854. * browsing (as distinct from hidden service web browsing). */
  1855. }
  1856. f_guard = frac_nodes_with_descriptors(guards, WEIGHT_FOR_GUARD);
  1857. f_mid = frac_nodes_with_descriptors(mid, WEIGHT_FOR_MID);
  1858. f_exit = frac_nodes_with_descriptors(exits, WEIGHT_FOR_EXIT);
  1859. log_debug(LD_NET,
  1860. "f_guard: %.2f, f_mid: %.2f, f_exit: %.2f",
  1861. f_guard,
  1862. f_mid,
  1863. f_exit);
  1864. smartlist_free(guards);
  1865. smartlist_free(mid);
  1866. smartlist_free(exits);
  1867. if (options->ExitNodes) {
  1868. double f_myexit, f_myexit_unflagged;
  1869. smartlist_t *myexits= smartlist_new();
  1870. smartlist_t *myexits_unflagged = smartlist_new();
  1871. /* All nodes with exit flag in ExitNodes option */
  1872. count_usable_descriptors(&np, &nu, myexits, consensus, now,
  1873. options->ExitNodes, USABLE_DESCRIPTOR_EXIT_ONLY);
  1874. log_debug(LD_NET,
  1875. "%s: %d present, %d usable",
  1876. "myexits",
  1877. np,
  1878. nu);
  1879. /* Now compute the nodes in the ExitNodes option where which we don't know
  1880. * what their exit policy is, or we know it permits something. */
  1881. count_usable_descriptors(&np, &nu, myexits_unflagged,
  1882. consensus, now,
  1883. options->ExitNodes, USABLE_DESCRIPTOR_ALL);
  1884. log_debug(LD_NET,
  1885. "%s: %d present, %d usable",
  1886. "myexits_unflagged (initial)",
  1887. np,
  1888. nu);
  1889. SMARTLIST_FOREACH_BEGIN(myexits_unflagged, const node_t *, node) {
  1890. if (node_has_descriptor(node) && node_exit_policy_rejects_all(node)) {
  1891. SMARTLIST_DEL_CURRENT(myexits_unflagged, node);
  1892. /* this node is not actually an exit */
  1893. np--;
  1894. /* this node is unusable as an exit */
  1895. nu--;
  1896. }
  1897. } SMARTLIST_FOREACH_END(node);
  1898. log_debug(LD_NET,
  1899. "%s: %d present, %d usable",
  1900. "myexits_unflagged (final)",
  1901. np,
  1902. nu);
  1903. f_myexit= frac_nodes_with_descriptors(myexits,WEIGHT_FOR_EXIT);
  1904. f_myexit_unflagged=
  1905. frac_nodes_with_descriptors(myexits_unflagged,WEIGHT_FOR_EXIT);
  1906. log_debug(LD_NET,
  1907. "f_exit: %.2f, f_myexit: %.2f, f_myexit_unflagged: %.2f",
  1908. f_exit,
  1909. f_myexit,
  1910. f_myexit_unflagged);
  1911. /* If our ExitNodes list has eliminated every possible Exit node, and there
  1912. * were some possible Exit nodes, then instead consider nodes that permit
  1913. * exiting to some ports. */
  1914. if (smartlist_len(myexits) == 0 &&
  1915. smartlist_len(myexits_unflagged)) {
  1916. f_myexit = f_myexit_unflagged;
  1917. }
  1918. smartlist_free(myexits);
  1919. smartlist_free(myexits_unflagged);
  1920. /* This is a tricky point here: we don't want to make it easy for a
  1921. * directory to trickle exits to us until it learns which exits we have
  1922. * configured, so require that we have a threshold both of total exits
  1923. * and usable exits. */
  1924. if (f_myexit < f_exit)
  1925. f_exit = f_myexit;
  1926. }
  1927. /* if the consensus has no exits, treat the exit fraction as 100% */
  1928. if (router_have_consensus_path() != CONSENSUS_PATH_EXIT) {
  1929. f_exit = 1.0;
  1930. }
  1931. f_path = f_guard * f_mid * f_exit;
  1932. if (status_out)
  1933. tor_asprintf(status_out,
  1934. "%d%% of guards bw, "
  1935. "%d%% of midpoint bw, and "
  1936. "%d%% of exit bw%s = "
  1937. "%d%% of path bw",
  1938. (int)(f_guard*100),
  1939. (int)(f_mid*100),
  1940. (int)(f_exit*100),
  1941. (router_have_consensus_path() == CONSENSUS_PATH_EXIT ?
  1942. "" :
  1943. " (no exits in consensus)"),
  1944. (int)(f_path*100));
  1945. return f_path;
  1946. }
  1947. /** We just fetched a new set of descriptors. Compute how far through
  1948. * the "loading descriptors" bootstrapping phase we are, so we can inform
  1949. * the controller of our progress. */
  1950. int
  1951. count_loading_descriptors_progress(void)
  1952. {
  1953. int num_present = 0, num_usable=0;
  1954. time_t now = time(NULL);
  1955. const or_options_t *options = get_options();
  1956. const networkstatus_t *consensus =
  1957. networkstatus_get_reasonably_live_consensus(now,usable_consensus_flavor());
  1958. double paths, fraction;
  1959. if (!consensus)
  1960. return 0; /* can't count descriptors if we have no list of them */
  1961. paths = compute_frac_paths_available(consensus, options, now,
  1962. &num_present, &num_usable,
  1963. NULL);
  1964. fraction = paths / get_frac_paths_needed_for_circs(options,consensus);
  1965. if (fraction > 1.0)
  1966. return 0; /* it's not the number of descriptors holding us back */
  1967. return BOOTSTRAP_STATUS_LOADING_DESCRIPTORS + (int)
  1968. (fraction*(BOOTSTRAP_STATUS_CONN_OR-1 -
  1969. BOOTSTRAP_STATUS_LOADING_DESCRIPTORS));
  1970. }
  1971. /** Return the fraction of paths needed before we're willing to build
  1972. * circuits, as configured in <b>options</b>, or in the consensus <b>ns</b>. */
  1973. static double
  1974. get_frac_paths_needed_for_circs(const or_options_t *options,
  1975. const networkstatus_t *ns)
  1976. {
  1977. #define DFLT_PCT_USABLE_NEEDED 60
  1978. if (options->PathsNeededToBuildCircuits >= 0.0) {
  1979. return options->PathsNeededToBuildCircuits;
  1980. } else {
  1981. return networkstatus_get_param(ns, "min_paths_for_circs_pct",
  1982. DFLT_PCT_USABLE_NEEDED,
  1983. 25, 95)/100.0;
  1984. }
  1985. }
  1986. /** Change the value of have_min_dir_info, setting it true iff we have enough
  1987. * network and router information to build circuits. Clear the value of
  1988. * need_to_update_have_min_dir_info. */
  1989. static void
  1990. update_router_have_minimum_dir_info(void)
  1991. {
  1992. time_t now = time(NULL);
  1993. int res;
  1994. const or_options_t *options = get_options();
  1995. const networkstatus_t *consensus =
  1996. networkstatus_get_reasonably_live_consensus(now,usable_consensus_flavor());
  1997. int using_md;
  1998. if (!consensus) {
  1999. if (!networkstatus_get_latest_consensus())
  2000. strlcpy(dir_info_status, "We have no usable consensus.",
  2001. sizeof(dir_info_status));
  2002. else
  2003. strlcpy(dir_info_status, "We have no recent usable consensus.",
  2004. sizeof(dir_info_status));
  2005. res = 0;
  2006. goto done;
  2007. }
  2008. using_md = consensus->flavor == FLAV_MICRODESC;
  2009. if (! entry_guards_have_enough_dir_info_to_build_circuits()) {
  2010. strlcpy(dir_info_status, "We're missing descriptors for some of our "
  2011. "primary entry guards", sizeof(dir_info_status));
  2012. res = 0;
  2013. goto done;
  2014. }
  2015. /* Check fraction of available paths */
  2016. {
  2017. char *status = NULL;
  2018. int num_present=0, num_usable=0;
  2019. double paths = compute_frac_paths_available(consensus, options, now,
  2020. &num_present, &num_usable,
  2021. &status);
  2022. if (paths < get_frac_paths_needed_for_circs(options,consensus)) {
  2023. tor_snprintf(dir_info_status, sizeof(dir_info_status),
  2024. "We need more %sdescriptors: we have %d/%d, and "
  2025. "can only build %d%% of likely paths. (We have %s.)",
  2026. using_md?"micro":"", num_present, num_usable,
  2027. (int)(paths*100), status);
  2028. tor_free(status);
  2029. res = 0;
  2030. control_event_bootstrap(BOOTSTRAP_STATUS_REQUESTING_DESCRIPTORS, 0);
  2031. goto done;
  2032. }
  2033. tor_free(status);
  2034. res = 1;
  2035. }
  2036. done:
  2037. /* If paths have just become available in this update. */
  2038. if (res && !have_min_dir_info) {
  2039. control_event_client_status(LOG_NOTICE, "ENOUGH_DIR_INFO");
  2040. if (control_event_bootstrap(BOOTSTRAP_STATUS_CONN_OR, 0) == 0) {
  2041. log_notice(LD_DIR,
  2042. "We now have enough directory information to build circuits.");
  2043. }
  2044. }
  2045. /* If paths have just become unavailable in this update. */
  2046. if (!res && have_min_dir_info) {
  2047. int quiet = directory_too_idle_to_fetch_descriptors(options, now);
  2048. tor_log(quiet ? LOG_INFO : LOG_NOTICE, LD_DIR,
  2049. "Our directory information is no longer up-to-date "
  2050. "enough to build circuits: %s", dir_info_status);
  2051. /* a) make us log when we next complete a circuit, so we know when Tor
  2052. * is back up and usable, and b) disable some activities that Tor
  2053. * should only do while circuits are working, like reachability tests
  2054. * and fetching bridge descriptors only over circuits. */
  2055. note_that_we_maybe_cant_complete_circuits();
  2056. have_consensus_path = CONSENSUS_PATH_UNKNOWN;
  2057. control_event_client_status(LOG_NOTICE, "NOT_ENOUGH_DIR_INFO");
  2058. }
  2059. have_min_dir_info = res;
  2060. need_to_update_have_min_dir_info = 0;
  2061. }