routerlist.c 160 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745
  1. /* Copyright (c) 2001 Matej Pfajfar.
  2. * Copyright (c) 2001-2004, Roger Dingledine.
  3. * Copyright (c) 2004-2007, Roger Dingledine, Nick Mathewson. */
  4. /* See LICENSE for licensing information */
  5. /* $Id$ */
  6. const char routerlist_c_id[] =
  7. "$Id$";
  8. /**
  9. * \file routerlist.c
  10. * \brief Code to
  11. * maintain and access the global list of routerinfos for known
  12. * servers.
  13. **/
  14. #include "or.h"
  15. /****************************************************************************/
  16. /* static function prototypes */
  17. static routerstatus_t *router_pick_directory_server_impl(int requireother,
  18. int fascistfirewall,
  19. int prefer_tunnel,
  20. int for_v2_directory);
  21. static routerstatus_t *router_pick_trusteddirserver_impl(
  22. authority_type_t type, int requireother,
  23. int fascistfirewall, int prefer_tunnel);
  24. static void mark_all_trusteddirservers_up(void);
  25. static int router_nickname_matches(routerinfo_t *router, const char *nickname);
  26. static void routerstatus_list_update_from_networkstatus(time_t now);
  27. static void local_routerstatus_free(local_routerstatus_t *rs);
  28. static void trusted_dir_server_free(trusted_dir_server_t *ds);
  29. static void update_networkstatus_cache_downloads(time_t now);
  30. static void update_networkstatus_client_downloads(time_t now);
  31. static int signed_desc_digest_is_recognized(signed_descriptor_t *desc);
  32. static int have_tried_downloading_all_statuses(int n_failures);
  33. static routerstatus_t *networkstatus_find_entry(networkstatus_t *ns,
  34. const char *digest);
  35. static local_routerstatus_t *router_get_combined_status_by_nickname(
  36. const char *nickname,
  37. int warn_if_unnamed);
  38. static void update_router_have_minimum_dir_info(void);
  39. static void router_dir_info_changed(void);
  40. /****************************************************************************/
  41. /** Global list of a trusted_dir_server_t object for each trusted directory
  42. * server. */
  43. static smartlist_t *trusted_dir_servers = NULL;
  44. /** Global list of all of the routers that we know about. */
  45. static routerlist_t *routerlist = NULL;
  46. /** Global list of all of the current network_status documents that we know
  47. * about. This list is kept sorted by published_on. */
  48. static smartlist_t *networkstatus_list = NULL;
  49. /** Global list of local_routerstatus_t for each router, known or unknown.
  50. * Kept sorted by digest. */
  51. static smartlist_t *routerstatus_list = NULL;
  52. /** Map from lowercase nickname to digest of named server, if any. */
  53. static strmap_t *named_server_map = NULL;
  54. /** True iff any member of networkstatus_list has changed since the last time
  55. * we called routerstatus_list_update_from_networkstatus(). */
  56. static int networkstatus_list_has_changed = 0;
  57. /** True iff any element of routerstatus_list has changed since the last
  58. * time we called routers_update_all_from_networkstatus().*/
  59. static int routerstatus_list_has_changed = 0;
  60. /** List of strings for nicknames we've already warned about and that are
  61. * still unknown / unavailable. */
  62. static smartlist_t *warned_nicknames = NULL;
  63. /** List of strings for nicknames or fingerprints we've already warned about
  64. * and that are still conflicted. */
  65. static smartlist_t *warned_conflicts = NULL;
  66. /** The last time we tried to download any routerdesc, or 0 for "never". We
  67. * use this to rate-limit download attempts when the number of routerdescs to
  68. * download is low. */
  69. static time_t last_routerdesc_download_attempted = 0;
  70. /** The last time we tried to download a networkstatus, or 0 for "never". We
  71. * use this to rate-limit download attempts for directory caches (including
  72. * mirrors). Clients don't use this now. */
  73. static time_t last_networkstatus_download_attempted = 0;
  74. /** True iff we have logged a warning about this OR not being valid or
  75. * not being named. */
  76. static int have_warned_about_invalid_status = 0;
  77. /** True iff we have logged a warning about this OR's version being older than
  78. * listed by the authorities */
  79. static int have_warned_about_old_version = 0;
  80. /** True iff we have logged a warning about this OR's version being newer than
  81. * listed by the authorities */
  82. static int have_warned_about_new_version = 0;
  83. /** Return the number of v2 directory authorities */
  84. static INLINE int
  85. get_n_v2_authorities(void)
  86. {
  87. int n = 0;
  88. if (!trusted_dir_servers)
  89. return 0;
  90. SMARTLIST_FOREACH(trusted_dir_servers, trusted_dir_server_t *, ds,
  91. if (ds->is_v2_authority)
  92. ++n);
  93. return n;
  94. }
  95. /** Repopulate our list of network_status_t objects from the list cached on
  96. * disk. Return 0 on success, -1 on failure. */
  97. int
  98. router_reload_networkstatus(void)
  99. {
  100. char filename[512];
  101. smartlist_t *entries;
  102. struct stat st;
  103. char *s;
  104. tor_assert(get_options()->DataDirectory);
  105. if (!networkstatus_list)
  106. networkstatus_list = smartlist_create();
  107. tor_snprintf(filename,sizeof(filename),"%s"PATH_SEPARATOR"cached-status",
  108. get_options()->DataDirectory);
  109. entries = tor_listdir(filename);
  110. SMARTLIST_FOREACH(entries, const char *, fn, {
  111. char buf[DIGEST_LEN];
  112. if (strlen(fn) != HEX_DIGEST_LEN ||
  113. base16_decode(buf, sizeof(buf), fn, strlen(fn))) {
  114. log_info(LD_DIR,
  115. "Skipping cached-status file with unexpected name \"%s\"",fn);
  116. continue;
  117. }
  118. tor_snprintf(filename,sizeof(filename),
  119. "%s"PATH_SEPARATOR"cached-status"PATH_SEPARATOR"%s",
  120. get_options()->DataDirectory, fn);
  121. s = read_file_to_str(filename, 0, &st);
  122. if (s) {
  123. if (router_set_networkstatus(s, st.st_mtime, NS_FROM_CACHE, NULL)<0) {
  124. log_warn(LD_FS, "Couldn't load networkstatus from \"%s\"",filename);
  125. }
  126. tor_free(s);
  127. }
  128. });
  129. SMARTLIST_FOREACH(entries, char *, fn, tor_free(fn));
  130. smartlist_free(entries);
  131. networkstatus_list_clean(time(NULL));
  132. routers_update_all_from_networkstatus();
  133. return 0;
  134. }
  135. /* Router descriptor storage.
  136. *
  137. * Routerdescs are stored in a big file, named "cached-routers". As new
  138. * routerdescs arrive, we append them to a journal file named
  139. * "cached-routers.new".
  140. *
  141. * From time to time, we replace "cached-routers" with a new file containing
  142. * only the live, non-superseded descriptors, and clear cached-routers.new.
  143. *
  144. * On startup, we read both files.
  145. */
  146. /** The size of the router log, in bytes. */
  147. static size_t router_journal_len = 0;
  148. /** The size of the router store, in bytes. */
  149. static size_t router_store_len = 0;
  150. /** Total bytes dropped since last rebuild. */
  151. static size_t router_bytes_dropped = 0;
  152. /** Helper: return 1 iff the router log is so big we want to rebuild the
  153. * store. */
  154. static int
  155. router_should_rebuild_store(void)
  156. {
  157. if (router_store_len > (1<<16))
  158. return (router_journal_len > router_store_len / 2 ||
  159. router_bytes_dropped > router_store_len / 2);
  160. else
  161. return router_journal_len > (1<<15);
  162. }
  163. /** Add the router descriptor in <b>desc</b> to the router
  164. * journal; change its saved_location to SAVED_IN_JOURNAL and set its
  165. * offset appropriately.
  166. *
  167. * If <b>purpose</b> isn't ROUTER_PURPOSE_GENERAL, just do nothing. */
  168. static int
  169. router_append_to_journal(signed_descriptor_t *desc, uint8_t purpose)
  170. {
  171. or_options_t *options = get_options();
  172. size_t fname_len = strlen(options->DataDirectory)+32;
  173. char *fname;
  174. const char *body = signed_descriptor_get_body(desc);
  175. size_t len = desc->signed_descriptor_len;
  176. if (purpose != ROUTER_PURPOSE_GENERAL) {
  177. /* we shouldn't cache it. be happy and return. */
  178. return 0;
  179. }
  180. fname = tor_malloc(fname_len);
  181. tor_snprintf(fname, fname_len, "%s"PATH_SEPARATOR"cached-routers.new",
  182. options->DataDirectory);
  183. tor_assert(len == strlen(body));
  184. if (append_bytes_to_file(fname, body, len, 1)) {
  185. log_warn(LD_FS, "Unable to store router descriptor");
  186. tor_free(fname);
  187. return -1;
  188. }
  189. desc->saved_location = SAVED_IN_JOURNAL;
  190. desc->saved_offset = router_journal_len;
  191. tor_free(fname);
  192. router_journal_len += len;
  193. return 0;
  194. }
  195. /** Sorting helper: return &lt;0, 0, or &gt;0 depending on whether the
  196. * signed_descriptor_t* in *<b>a</b> is older, the same age as, or newer than
  197. * the signed_descriptor_t* in *<b>b</b>. */
  198. static int
  199. _compare_old_routers_by_age(const void **_a, const void **_b)
  200. {
  201. const signed_descriptor_t *r1 = *_a, *r2 = *_b;
  202. return r1->published_on - r2->published_on;
  203. }
  204. /** Sorting helper: return &lt;0, 0, or &gt;0 depending on whether the
  205. * routerinfo_t* in *<b>a</b> is older, the same age as, or newer than
  206. * the routerinfo_t* in *<b>b</b>. */
  207. static int
  208. _compare_routers_by_age(const void **_a, const void **_b)
  209. {
  210. const routerinfo_t *r1 = *_a, *r2 = *_b;
  211. return r1->cache_info.published_on - r2->cache_info.published_on;
  212. }
  213. /** If the journal is too long, or if <b>force</b> is true, then atomically
  214. * replace the router store with the routers currently in our routerlist, and
  215. * clear the journal. Return 0 on success, -1 on failure.
  216. */
  217. static int
  218. router_rebuild_store(int force)
  219. {
  220. size_t len = 0;
  221. or_options_t *options;
  222. size_t fname_len;
  223. smartlist_t *chunk_list = NULL;
  224. char *fname = NULL, *fname_tmp = NULL;
  225. int r = -1, i;
  226. off_t offset = 0;
  227. smartlist_t *old_routers, *routers;
  228. if (!force && !router_should_rebuild_store())
  229. return 0;
  230. if (!routerlist)
  231. return 0;
  232. /* Don't save deadweight. */
  233. routerlist_remove_old_routers();
  234. log_info(LD_DIR, "Rebuilding router descriptor cache");
  235. options = get_options();
  236. fname_len = strlen(options->DataDirectory)+32;
  237. fname = tor_malloc(fname_len);
  238. fname_tmp = tor_malloc(fname_len);
  239. tor_snprintf(fname, fname_len, "%s"PATH_SEPARATOR"cached-routers",
  240. options->DataDirectory);
  241. tor_snprintf(fname_tmp, fname_len, "%s"PATH_SEPARATOR"cached-routers.tmp",
  242. options->DataDirectory);
  243. chunk_list = smartlist_create();
  244. /* We sort the routers by age to enhance locality on disk. */
  245. old_routers = smartlist_create();
  246. smartlist_add_all(old_routers, routerlist->old_routers);
  247. smartlist_sort(old_routers, _compare_old_routers_by_age);
  248. routers = smartlist_create();
  249. smartlist_add_all(routers, routerlist->routers);
  250. smartlist_sort(routers, _compare_routers_by_age);
  251. for (i = 0; i < 2; ++i) {
  252. smartlist_t *lst = (i == 0) ? old_routers : routers;
  253. /* Now, add the appropriate members to chunk_list */
  254. SMARTLIST_FOREACH(lst, void *, ptr,
  255. {
  256. signed_descriptor_t *sd = (i==0) ?
  257. ((signed_descriptor_t*)ptr): &((routerinfo_t*)ptr)->cache_info;
  258. sized_chunk_t *c;
  259. const char *body = signed_descriptor_get_body(sd);
  260. if (!body) {
  261. log_warn(LD_BUG, "No descriptor available for router.");
  262. goto done;
  263. }
  264. if (i==1 && ((routerinfo_t*)ptr)->purpose != ROUTER_PURPOSE_GENERAL)
  265. continue;
  266. c = tor_malloc(sizeof(sized_chunk_t));
  267. c->bytes = body;
  268. c->len = sd->signed_descriptor_len;
  269. smartlist_add(chunk_list, c);
  270. });
  271. }
  272. if (write_chunks_to_file(fname_tmp, chunk_list, 1)<0) {
  273. log_warn(LD_FS, "Error writing router store to disk.");
  274. goto done;
  275. }
  276. /* Our mmap is now invalid. */
  277. if (routerlist->mmap_descriptors) {
  278. tor_munmap_file(routerlist->mmap_descriptors);
  279. }
  280. if (replace_file(fname_tmp, fname)<0) {
  281. log_warn(LD_FS, "Error replacing old router store.");
  282. goto done;
  283. }
  284. routerlist->mmap_descriptors = tor_mmap_file(fname);
  285. if (! routerlist->mmap_descriptors)
  286. log_warn(LD_FS, "Unable to mmap new descriptor file at '%s'.",fname);
  287. offset = 0;
  288. for (i = 0; i < 2; ++i) {
  289. smartlist_t *lst = (i == 0) ? old_routers : routers;
  290. SMARTLIST_FOREACH(lst, void *, ptr,
  291. {
  292. signed_descriptor_t *sd = (i==0) ?
  293. ((signed_descriptor_t*)ptr): &((routerinfo_t*)ptr)->cache_info;
  294. if (i==1 && ((routerinfo_t*)ptr)->purpose != ROUTER_PURPOSE_GENERAL)
  295. continue;
  296. sd->saved_location = SAVED_IN_CACHE;
  297. if (routerlist->mmap_descriptors) {
  298. tor_free(sd->signed_descriptor_body); // sets it to null
  299. sd->saved_offset = offset;
  300. }
  301. offset += sd->signed_descriptor_len;
  302. signed_descriptor_get_body(sd);
  303. });
  304. }
  305. tor_snprintf(fname, fname_len, "%s"PATH_SEPARATOR"cached-routers.new",
  306. options->DataDirectory);
  307. write_str_to_file(fname, "", 1);
  308. r = 0;
  309. router_store_len = len;
  310. router_journal_len = 0;
  311. router_bytes_dropped = 0;
  312. done:
  313. smartlist_free(old_routers);
  314. smartlist_free(routers);
  315. tor_free(fname);
  316. SMARTLIST_FOREACH(chunk_list, sized_chunk_t *, c, tor_free(c));
  317. smartlist_free(chunk_list);
  318. return r;
  319. }
  320. /** Load all cached router descriptors from the store. Return 0 on success and
  321. * -1 on failure.
  322. */
  323. int
  324. router_reload_router_list(void)
  325. {
  326. or_options_t *options = get_options();
  327. size_t fname_len = strlen(options->DataDirectory)+32;
  328. char *fname = tor_malloc(fname_len), *contents = NULL;
  329. if (!routerlist)
  330. router_get_routerlist(); /* mallocs and inits it in place */
  331. router_journal_len = router_store_len = 0;
  332. tor_snprintf(fname, fname_len, "%s"PATH_SEPARATOR"cached-routers",
  333. options->DataDirectory);
  334. if (routerlist->mmap_descriptors) /* get rid of it first */
  335. tor_munmap_file(routerlist->mmap_descriptors);
  336. routerlist->mmap_descriptors = tor_mmap_file(fname);
  337. if (routerlist->mmap_descriptors) {
  338. router_store_len = routerlist->mmap_descriptors->size;
  339. router_load_routers_from_string(routerlist->mmap_descriptors->data,
  340. SAVED_IN_CACHE, NULL);
  341. }
  342. tor_snprintf(fname, fname_len, "%s"PATH_SEPARATOR"cached-routers.new",
  343. options->DataDirectory);
  344. if (file_status(fname) == FN_FILE)
  345. contents = read_file_to_str(fname, RFTS_BIN|RFTS_IGNORE_MISSING, NULL);
  346. if (contents) {
  347. router_load_routers_from_string(contents,
  348. SAVED_IN_JOURNAL, NULL);
  349. tor_free(contents);
  350. }
  351. tor_free(fname);
  352. if (router_journal_len) {
  353. /* Always clear the journal on startup.*/
  354. router_rebuild_store(1);
  355. } else {
  356. /* Don't cache expired routers. (This is in an else because
  357. * router_rebuild_store() also calls remove_old_routers().) */
  358. routerlist_remove_old_routers();
  359. }
  360. return 0;
  361. }
  362. /** Return a smartlist containing a list of trusted_dir_server_t * for all
  363. * known trusted dirservers. Callers must not modify the list or its
  364. * contents.
  365. */
  366. smartlist_t *
  367. router_get_trusted_dir_servers(void)
  368. {
  369. if (!trusted_dir_servers)
  370. trusted_dir_servers = smartlist_create();
  371. return trusted_dir_servers;
  372. }
  373. /** Try to find a running dirserver. If there are no running dirservers
  374. * in our routerlist and <b>retry_if_no_servers</b> is non-zero,
  375. * set all the authoritative ones as running again, and pick one;
  376. * if there are then no dirservers at all in our routerlist,
  377. * reload the routerlist and try one last time. If for_runningrouters is
  378. * true, then only pick a dirserver that can answer runningrouters queries
  379. * (that is, a trusted dirserver, or one running 0.0.9rc5-cvs or later).
  380. * Don't pick an authority if any non-authority is viable.
  381. * Other args are as in router_pick_directory_server_impl().
  382. */
  383. routerstatus_t *
  384. router_pick_directory_server(int requireother,
  385. int fascistfirewall,
  386. int for_v2_directory,
  387. int retry_if_no_servers)
  388. {
  389. routerstatus_t *choice;
  390. int prefer_tunnel = get_options()->PreferTunneledDirConns;
  391. if (!routerlist)
  392. return NULL;
  393. choice = router_pick_directory_server_impl(requireother, fascistfirewall,
  394. prefer_tunnel, for_v2_directory);
  395. if (choice || !retry_if_no_servers)
  396. return choice;
  397. log_info(LD_DIR,
  398. "No reachable router entries for dirservers. "
  399. "Trying them all again.");
  400. /* mark all authdirservers as up again */
  401. mark_all_trusteddirservers_up();
  402. /* try again */
  403. choice = router_pick_directory_server_impl(requireother, fascistfirewall,
  404. prefer_tunnel, for_v2_directory);
  405. if (choice)
  406. return choice;
  407. log_info(LD_DIR,"Still no %s router entries. Reloading and trying again.",
  408. fascistfirewall ? "reachable" : "known");
  409. if (router_reload_router_list()) {
  410. return NULL;
  411. }
  412. /* give it one last try */
  413. choice = router_pick_directory_server_impl(requireother, fascistfirewall,
  414. prefer_tunnel, for_v2_directory);
  415. return choice;
  416. }
  417. /** Return the trusted_dir_server_t for the directory authority whose identity
  418. * key hashes to <b>digest</b>, or NULL if no such authority is known.
  419. */
  420. trusted_dir_server_t *
  421. router_get_trusteddirserver_by_digest(const char *digest)
  422. {
  423. if (!trusted_dir_servers)
  424. return NULL;
  425. SMARTLIST_FOREACH(trusted_dir_servers, trusted_dir_server_t *, ds,
  426. {
  427. if (!memcmp(ds->digest, digest, DIGEST_LEN))
  428. return ds;
  429. });
  430. return NULL;
  431. }
  432. /** Try to find a running trusted dirserver. If there are no running
  433. * trusted dirservers and <b>retry_if_no_servers</b> is non-zero,
  434. * set them all as running again, and try again.
  435. * If <b>need_v1_authority</b> is set, return only trusted servers
  436. * that are authorities for the V1 directory protocol.
  437. * Other args are as in router_pick_trusteddirserver_impl().
  438. */
  439. routerstatus_t *
  440. router_pick_trusteddirserver(authority_type_t type,
  441. int requireother,
  442. int fascistfirewall,
  443. int retry_if_no_servers)
  444. {
  445. routerstatus_t *choice;
  446. int prefer_tunnel = get_options()->PreferTunneledDirConns;
  447. choice = router_pick_trusteddirserver_impl(type, requireother,
  448. fascistfirewall, prefer_tunnel);
  449. if (choice || !retry_if_no_servers)
  450. return choice;
  451. log_info(LD_DIR,
  452. "No trusted dirservers are reachable. Trying them all again.");
  453. mark_all_trusteddirservers_up();
  454. return router_pick_trusteddirserver_impl(type, requireother,
  455. fascistfirewall, prefer_tunnel);
  456. }
  457. /** How long do we avoid using a directory server after it's given us a 503? */
  458. #define DIR_503_TIMEOUT (60*60)
  459. /** Pick a random running valid directory server/mirror from our
  460. * routerlist. Don't pick an authority if any non-authorities are viable.
  461. * If <b>fascistfirewall</b>, make sure the router we pick is allowed
  462. * by our firewall options.
  463. * If <b>requireother</b>, it cannot be us. If <b>for_v2_directory</b>,
  464. * choose a directory server new enough to support the v2 directory
  465. * functionality.
  466. * If <b>prefer_tunnel</b>, choose a directory server that is reachable
  467. * and supports BEGIN_DIR cells, if possible.
  468. * Try to avoid using servers that are overloaded (have returned 503
  469. * recently).
  470. */
  471. static routerstatus_t *
  472. router_pick_directory_server_impl(int requireother, int fascistfirewall,
  473. int prefer_tunnel, int for_v2_directory)
  474. {
  475. routerstatus_t *result;
  476. smartlist_t *direct, *tunnel;
  477. smartlist_t *trusted_direct, *trusted_tunnel;
  478. smartlist_t *overloaded_direct, *overloaded_tunnel;
  479. time_t now = time(NULL);
  480. if (!routerstatus_list)
  481. return NULL;
  482. direct = smartlist_create();
  483. tunnel = smartlist_create();
  484. trusted_direct = smartlist_create();
  485. trusted_tunnel = smartlist_create();
  486. overloaded_direct = smartlist_create();
  487. overloaded_tunnel = smartlist_create();
  488. /* Find all the running dirservers we know about. */
  489. SMARTLIST_FOREACH(routerstatus_list, local_routerstatus_t *, _local_status,
  490. {
  491. routerstatus_t *status = &(_local_status->status);
  492. int is_trusted;
  493. int is_overloaded = _local_status->last_dir_503_at + DIR_503_TIMEOUT > now;
  494. if (!status->is_running || !status->dir_port || !status->is_valid)
  495. continue;
  496. if (status->is_bad_directory)
  497. continue;
  498. if (requireother && router_digest_is_me(status->identity_digest))
  499. continue;
  500. is_trusted = router_digest_is_trusted_dir(status->identity_digest);
  501. if (for_v2_directory && !(status->is_v2_dir || is_trusted))
  502. continue;
  503. if (prefer_tunnel &&
  504. status->version_supports_begindir &&
  505. (!fascistfirewall ||
  506. fascist_firewall_allows_address_or(status->addr, status->or_port)))
  507. smartlist_add(is_trusted ? trusted_tunnel :
  508. is_overloaded ? overloaded_tunnel : tunnel, status);
  509. else if (!fascistfirewall ||
  510. fascist_firewall_allows_address_dir(status->addr,
  511. status->dir_port))
  512. smartlist_add(is_trusted ? trusted_direct :
  513. is_overloaded ? overloaded_direct : direct, status);
  514. });
  515. if (smartlist_len(tunnel)) {
  516. result = routerstatus_sl_choose_by_bandwidth(tunnel);
  517. } else if (smartlist_len(overloaded_tunnel)) {
  518. result = routerstatus_sl_choose_by_bandwidth(overloaded_tunnel);
  519. } else if (smartlist_len(trusted_tunnel)) {
  520. /* FFFF We don't distinguish between trusteds and overloaded trusteds
  521. * yet. Maybe one day we should. */
  522. /* FFFF We also don't load balance over authorities yet. I think this
  523. * is a feature, but it could easily be a bug. -RD */
  524. result = smartlist_choose(trusted_tunnel);
  525. } else if (smartlist_len(direct)) {
  526. result = routerstatus_sl_choose_by_bandwidth(direct);
  527. } else if (smartlist_len(overloaded_direct)) {
  528. result = routerstatus_sl_choose_by_bandwidth(overloaded_direct);
  529. } else {
  530. result = smartlist_choose(trusted_direct);
  531. }
  532. smartlist_free(direct);
  533. smartlist_free(tunnel);
  534. smartlist_free(trusted_direct);
  535. smartlist_free(trusted_tunnel);
  536. smartlist_free(overloaded_direct);
  537. smartlist_free(overloaded_tunnel);
  538. return result;
  539. }
  540. /** Choose randomly from among the trusted dirservers that are up. If
  541. * <b>fascistfirewall</b>, make sure the port we pick is allowed by our
  542. * firewall options. If <b>requireother</b>, it cannot be us. If
  543. * <b>need_v1_authority</b>, choose a trusted authority for the v1 directory
  544. * system.
  545. */
  546. static routerstatus_t *
  547. router_pick_trusteddirserver_impl(authority_type_t type,
  548. int requireother, int fascistfirewall,
  549. int prefer_tunnel)
  550. {
  551. smartlist_t *direct, *tunnel;
  552. smartlist_t *overloaded_direct, *overloaded_tunnel;
  553. routerinfo_t *me = router_get_my_routerinfo();
  554. routerstatus_t *result;
  555. time_t now = time(NULL);
  556. direct = smartlist_create();
  557. tunnel = smartlist_create();
  558. overloaded_direct = smartlist_create();
  559. overloaded_tunnel = smartlist_create();
  560. if (!trusted_dir_servers)
  561. return NULL;
  562. SMARTLIST_FOREACH(trusted_dir_servers, trusted_dir_server_t *, d,
  563. {
  564. int is_overloaded =
  565. d->fake_status.last_dir_503_at + DIR_503_TIMEOUT > now;
  566. if (!d->is_running) continue;
  567. if (type == V1_AUTHORITY && !d->is_v1_authority)
  568. continue;
  569. if (type == V2_AUTHORITY && !d->is_v2_authority)
  570. continue;
  571. if (type == HIDSERV_AUTHORITY && !d->is_hidserv_authority)
  572. continue;
  573. if (requireother && me && router_digest_is_me(d->digest))
  574. continue;
  575. if (prefer_tunnel &&
  576. d->or_port &&
  577. (!fascistfirewall ||
  578. fascist_firewall_allows_address_or(d->addr, d->or_port)))
  579. smartlist_add(is_overloaded ? overloaded_tunnel : tunnel,
  580. &d->fake_status.status);
  581. else if (!fascistfirewall ||
  582. fascist_firewall_allows_address_dir(d->addr, d->dir_port))
  583. smartlist_add(is_overloaded ? overloaded_direct : direct,
  584. &d->fake_status.status);
  585. });
  586. if (smartlist_len(tunnel)) {
  587. result = smartlist_choose(tunnel);
  588. } else if (smartlist_len(overloaded_tunnel)) {
  589. result = smartlist_choose(overloaded_tunnel);
  590. } else if (smartlist_len(direct)) {
  591. result = smartlist_choose(direct);
  592. } else {
  593. result = smartlist_choose(overloaded_direct);
  594. }
  595. smartlist_free(direct);
  596. smartlist_free(tunnel);
  597. smartlist_free(overloaded_direct);
  598. smartlist_free(overloaded_tunnel);
  599. return result;
  600. }
  601. /** Go through and mark the authoritative dirservers as up. */
  602. static void
  603. mark_all_trusteddirservers_up(void)
  604. {
  605. if (routerlist) {
  606. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, router,
  607. if (router_digest_is_trusted_dir(router->cache_info.identity_digest) &&
  608. router->dir_port > 0) {
  609. router->is_running = 1;
  610. });
  611. }
  612. if (trusted_dir_servers) {
  613. SMARTLIST_FOREACH(trusted_dir_servers, trusted_dir_server_t *, dir,
  614. {
  615. local_routerstatus_t *rs;
  616. dir->is_running = 1;
  617. dir->n_networkstatus_failures = 0;
  618. dir->fake_status.last_dir_503_at = 0;
  619. rs = router_get_combined_status_by_digest(dir->digest);
  620. if (rs && !rs->status.is_running) {
  621. rs->status.is_running = 1;
  622. rs->last_dir_503_at = 0;
  623. control_event_networkstatus_changed_single(rs);
  624. }
  625. });
  626. }
  627. last_networkstatus_download_attempted = 0;
  628. router_dir_info_changed();
  629. }
  630. /** Reset all internal variables used to count failed downloads of network
  631. * status objects. */
  632. void
  633. router_reset_status_download_failures(void)
  634. {
  635. mark_all_trusteddirservers_up();
  636. }
  637. /** Look through the routerlist and identify routers that
  638. * advertise the same /16 network address as <b>router</b>.
  639. * Add each of them to <b>sl</b>.
  640. */
  641. static void
  642. routerlist_add_network_family(smartlist_t *sl, routerinfo_t *router)
  643. {
  644. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, r,
  645. {
  646. if (router != r &&
  647. (router->addr & 0xffff0000) == (r->addr & 0xffff0000))
  648. smartlist_add(sl, r);
  649. });
  650. }
  651. /** Add all the family of <b>router</b> to the smartlist <b>sl</b>.
  652. * This is used to make sure we don't pick siblings in a single path.
  653. */
  654. void
  655. routerlist_add_family(smartlist_t *sl, routerinfo_t *router)
  656. {
  657. routerinfo_t *r;
  658. config_line_t *cl;
  659. or_options_t *options = get_options();
  660. /* First, add any routers with similar network addresses. */
  661. if (options->EnforceDistinctSubnets)
  662. routerlist_add_network_family(sl, router);
  663. if (!router->declared_family)
  664. return;
  665. /* Add every r such that router declares familyness with r, and r
  666. * declares familyhood with router. */
  667. SMARTLIST_FOREACH(router->declared_family, const char *, n,
  668. {
  669. if (!(r = router_get_by_nickname(n, 0)))
  670. continue;
  671. if (!r->declared_family)
  672. continue;
  673. SMARTLIST_FOREACH(r->declared_family, const char *, n2,
  674. {
  675. if (router_nickname_matches(router, n2))
  676. smartlist_add(sl, r);
  677. });
  678. });
  679. /* If the user declared any families locally, honor those too. */
  680. for (cl = get_options()->NodeFamilies; cl; cl = cl->next) {
  681. if (router_nickname_is_in_list(router, cl->value)) {
  682. add_nickname_list_to_smartlist(sl, cl->value, 0);
  683. }
  684. }
  685. }
  686. /** Given a (possibly NULL) comma-and-whitespace separated list of nicknames,
  687. * see which nicknames in <b>list</b> name routers in our routerlist, and add
  688. * the routerinfos for those routers to <b>sl</b>. If <b>must_be_running</b>,
  689. * only include routers that we think are running.
  690. * Warn if any non-Named routers are specified by nickname.
  691. */
  692. void
  693. add_nickname_list_to_smartlist(smartlist_t *sl, const char *list,
  694. int must_be_running)
  695. {
  696. routerinfo_t *router;
  697. smartlist_t *nickname_list;
  698. int have_dir_info = router_have_minimum_dir_info();
  699. if (!list)
  700. return; /* nothing to do */
  701. tor_assert(sl);
  702. nickname_list = smartlist_create();
  703. if (!warned_nicknames)
  704. warned_nicknames = smartlist_create();
  705. smartlist_split_string(nickname_list, list, ",",
  706. SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 0);
  707. SMARTLIST_FOREACH(nickname_list, const char *, nick, {
  708. int warned;
  709. if (!is_legal_nickname_or_hexdigest(nick)) {
  710. log_warn(LD_CONFIG, "Nickname '%s' is misformed; skipping", nick);
  711. continue;
  712. }
  713. router = router_get_by_nickname(nick, 1);
  714. warned = smartlist_string_isin(warned_nicknames, nick);
  715. if (router) {
  716. if (!must_be_running || router->is_running) {
  717. smartlist_add(sl,router);
  718. }
  719. } else if (!router_get_combined_status_by_nickname(nick,1)) {
  720. if (!warned) {
  721. log_fn(have_dir_info ? LOG_WARN : LOG_INFO, LD_CONFIG,
  722. "Nickname list includes '%s' which isn't a known router.",nick);
  723. smartlist_add(warned_nicknames, tor_strdup(nick));
  724. }
  725. }
  726. });
  727. SMARTLIST_FOREACH(nickname_list, char *, nick, tor_free(nick));
  728. smartlist_free(nickname_list);
  729. }
  730. /** Return 1 iff any member of the (possibly NULL) comma-separated list
  731. * <b>list</b> is an acceptable nickname or hexdigest for <b>router</b>. Else
  732. * return 0.
  733. */
  734. int
  735. router_nickname_is_in_list(routerinfo_t *router, const char *list)
  736. {
  737. smartlist_t *nickname_list;
  738. int v = 0;
  739. if (!list)
  740. return 0; /* definitely not */
  741. tor_assert(router);
  742. nickname_list = smartlist_create();
  743. smartlist_split_string(nickname_list, list, ",",
  744. SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 0);
  745. SMARTLIST_FOREACH(nickname_list, const char *, cp,
  746. if (router_nickname_matches(router, cp)) {v=1;break;});
  747. SMARTLIST_FOREACH(nickname_list, char *, cp, tor_free(cp));
  748. smartlist_free(nickname_list);
  749. return v;
  750. }
  751. /** Add every suitable router from our routerlist to <b>sl</b>, so that
  752. * we can pick a node for a circuit.
  753. */
  754. static void
  755. router_add_running_routers_to_smartlist(smartlist_t *sl, int allow_invalid,
  756. int need_uptime, int need_capacity,
  757. int need_guard)
  758. {
  759. if (!routerlist)
  760. return;
  761. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, router,
  762. {
  763. if (router->is_running &&
  764. router->purpose == ROUTER_PURPOSE_GENERAL &&
  765. (router->is_valid || allow_invalid) &&
  766. !router_is_unreliable(router, need_uptime,
  767. need_capacity, need_guard)) {
  768. /* If it's running, and it's suitable according to the
  769. * other flags we had in mind */
  770. smartlist_add(sl, router);
  771. }
  772. });
  773. }
  774. /** Look through the routerlist until we find a router that has my key.
  775. Return it. */
  776. routerinfo_t *
  777. routerlist_find_my_routerinfo(void)
  778. {
  779. if (!routerlist)
  780. return NULL;
  781. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, router,
  782. {
  783. if (router_is_me(router))
  784. return router;
  785. });
  786. return NULL;
  787. }
  788. /** Find a router that's up, that has this IP address, and
  789. * that allows exit to this address:port, or return NULL if there
  790. * isn't a good one.
  791. */
  792. routerinfo_t *
  793. router_find_exact_exit_enclave(const char *address, uint16_t port)
  794. {
  795. uint32_t addr;
  796. struct in_addr in;
  797. if (!tor_inet_aton(address, &in))
  798. return NULL; /* it's not an IP already */
  799. addr = ntohl(in.s_addr);
  800. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, router,
  801. {
  802. if (router->is_running &&
  803. router->addr == addr &&
  804. compare_addr_to_addr_policy(addr, port, router->exit_policy) ==
  805. ADDR_POLICY_ACCEPTED)
  806. return router;
  807. });
  808. return NULL;
  809. }
  810. /** Return 1 if <b>router</b> is not suitable for these parameters, else 0.
  811. * If <b>need_uptime</b> is non-zero, we require a minimum uptime.
  812. * If <b>need_capacity</b> is non-zero, we require a minimum advertised
  813. * bandwidth.
  814. * If <b>need_guard</b>, we require that the router is a possible entry guard.
  815. */
  816. int
  817. router_is_unreliable(routerinfo_t *router, int need_uptime,
  818. int need_capacity, int need_guard)
  819. {
  820. if (need_uptime && !router->is_stable)
  821. return 1;
  822. if (need_capacity && !router->is_fast)
  823. return 1;
  824. if (need_guard && !router->is_possible_guard)
  825. return 1;
  826. return 0;
  827. }
  828. /** Return the smaller of the router's configured BandwidthRate
  829. * and its advertised capacity. */
  830. uint32_t
  831. router_get_advertised_bandwidth(routerinfo_t *router)
  832. {
  833. if (router->bandwidthcapacity < router->bandwidthrate)
  834. return router->bandwidthcapacity;
  835. return router->bandwidthrate;
  836. }
  837. /** Do not weight any declared bandwidth more than this much when picking
  838. * routers by bandwidth. */
  839. #define MAX_BELIEVABLE_BANDWIDTH 1500000 /* 1.5 MB/sec */
  840. /** Helper function:
  841. * choose a random element of smartlist <b>sl</b>, weighted by
  842. * the advertised bandwidth of each element.
  843. *
  844. * If <b>statuses</b> is zero, then <b>sl</b> is a list of
  845. * routerinfo_t's. Otherwise it's a list of routerstatus_t's.
  846. *
  847. * If <b>for_exit</b>, we're picking an exit node: consider all nodes'
  848. * bandwidth equally regardless of their Exit status. If not <b>for_exit</b>,
  849. * we're picking a non-exit node: weight exit-node's bandwidth downwards
  850. * depending on the smallness of the fraction of Exit-to-total bandwidth.
  851. */
  852. static void *
  853. smartlist_choose_by_bandwidth(smartlist_t *sl, int for_exit, int statuses)
  854. {
  855. int i;
  856. routerinfo_t *router;
  857. routerstatus_t *status;
  858. int32_t *bandwidths;
  859. int is_exit;
  860. uint64_t total_nonexit_bw = 0, total_exit_bw = 0, total_bw = 0;
  861. uint64_t rand_bw, tmp;
  862. double exit_weight;
  863. int n_unknown = 0;
  864. /* First count the total bandwidth weight, and make a list
  865. * of each value. <0 means "unknown; no routerinfo." We use the
  866. * bits of negative values to remember whether the router was fast (-x)&1
  867. * and whether it was an exit (-x)&2. Yes, it's a hack. */
  868. bandwidths = tor_malloc(sizeof(int32_t)*smartlist_len(sl));
  869. /* Iterate over all the routerinfo_t or routerstatus_t, and */
  870. for (i = 0; i < smartlist_len(sl); ++i) {
  871. /* first, learn what bandwidth we think i has */
  872. int is_known = 1;
  873. int32_t flags = 0;
  874. uint32_t this_bw = 0;
  875. if (statuses) {
  876. /* need to extract router info */
  877. status = smartlist_get(sl, i);
  878. router = router_get_by_digest(status->identity_digest);
  879. is_exit = status->is_exit;
  880. if (router) {
  881. this_bw = router_get_advertised_bandwidth(router);
  882. } else { /* guess */
  883. is_known = 0;
  884. flags = status->is_fast ? 1 : 0;
  885. flags |= is_exit ? 2 : 0;
  886. }
  887. } else {
  888. router = smartlist_get(sl, i);
  889. is_exit = router->is_exit;
  890. this_bw = router_get_advertised_bandwidth(router);
  891. }
  892. /* if they claim something huge, don't believe it */
  893. if (this_bw > MAX_BELIEVABLE_BANDWIDTH)
  894. this_bw = MAX_BELIEVABLE_BANDWIDTH;
  895. if (is_known) {
  896. bandwidths[i] = (int32_t) this_bw; // safe since MAX_BELIEVABLE<INT32_MAX
  897. if (is_exit)
  898. total_exit_bw += this_bw;
  899. else
  900. total_nonexit_bw += this_bw;
  901. } else {
  902. ++n_unknown;
  903. bandwidths[i] = -flags;
  904. }
  905. }
  906. /* Now, fill in the unknown values. */
  907. if (n_unknown) {
  908. int32_t avg_fast, avg_slow;
  909. if (total_exit_bw+total_nonexit_bw) {
  910. /* if there's some bandwidth, there's at least one known router,
  911. * so no worries about div by 0 here */
  912. int n_known = smartlist_len(sl)-n_unknown;
  913. avg_fast = avg_slow = (int32_t)
  914. ((total_exit_bw+total_nonexit_bw)/((uint64_t) n_known));
  915. } else {
  916. avg_fast = 40000;
  917. avg_slow = 20000;
  918. }
  919. for (i=0; i<smartlist_len(sl); ++i) {
  920. int32_t bw = bandwidths[i];
  921. if (bw>=0)
  922. continue;
  923. is_exit = ((-bw)&2);
  924. bandwidths[i] = ((-bw)&1) ? avg_fast : avg_slow;
  925. if (is_exit)
  926. total_exit_bw += bandwidths[i];
  927. else
  928. total_nonexit_bw += bandwidths[i];
  929. }
  930. }
  931. /* If there's no bandwidth at all, pick at random. */
  932. if (!(total_exit_bw+total_nonexit_bw)) {
  933. tor_free(bandwidths);
  934. return smartlist_choose(sl);
  935. }
  936. /* Figure out how to weight exits. */
  937. if (for_exit) {
  938. /* If we're choosing an exit node, exit bandwidth counts fully. */
  939. exit_weight = 1.0;
  940. total_bw = total_exit_bw + total_nonexit_bw;
  941. } else if (total_exit_bw < total_nonexit_bw / 2) {
  942. /* If we're choosing a relay and exits are greatly outnumbered, ignore
  943. * them. */
  944. exit_weight = 0.0;
  945. total_bw = total_nonexit_bw;
  946. } else {
  947. /* If we're choosing a relay and exits aren't outnumbered use the formula
  948. * from path-spec. */
  949. uint64_t leftover = (total_exit_bw - total_nonexit_bw / 2);
  950. exit_weight = U64_TO_DBL(leftover) /
  951. U64_TO_DBL(leftover + total_nonexit_bw);
  952. total_bw = total_nonexit_bw +
  953. DBL_TO_U64(exit_weight * U64_TO_DBL(total_exit_bw));
  954. }
  955. /*
  956. log_debug(LD_CIRC, "Total bw = "U64_FORMAT", total exit bw = "U64_FORMAT
  957. ", total nonexit bw = "U64_FORMAT", exit weight = %lf "
  958. "(for exit == %d)",
  959. U64_PRINTF_ARG(total_bw), U64_PRINTF_ARG(total_exit_bw),
  960. U64_PRINTF_ARG(total_nonexit_bw), exit_weight, for_exit);
  961. */
  962. /* Almost done: choose a random value from the bandwidth weights. */
  963. rand_bw = crypto_rand_uint64(total_bw);
  964. /* Last, count through sl until we get to the element we picked */
  965. tmp = 0;
  966. for (i=0; i < smartlist_len(sl); i++) {
  967. if (statuses) {
  968. status = smartlist_get(sl, i);
  969. is_exit = status->is_exit;
  970. } else {
  971. router = smartlist_get(sl, i);
  972. is_exit = router->is_exit;
  973. }
  974. if (is_exit)
  975. tmp += ((uint64_t)(bandwidths[i] * exit_weight));
  976. else
  977. tmp += bandwidths[i];
  978. if (tmp >= rand_bw)
  979. break;
  980. }
  981. tor_free(bandwidths);
  982. return smartlist_get(sl, i);
  983. }
  984. /** Choose a random element of router list <b>sl</b>, weighted by
  985. * the advertised bandwidth of each router.
  986. */
  987. routerinfo_t *
  988. routerlist_sl_choose_by_bandwidth(smartlist_t *sl, int for_exit)
  989. {
  990. return smartlist_choose_by_bandwidth(sl, for_exit, 0);
  991. }
  992. /** Choose a random element of status list <b>sl</b>, weighted by
  993. * the advertised bandwidth of each status.
  994. */
  995. routerstatus_t *
  996. routerstatus_sl_choose_by_bandwidth(smartlist_t *sl)
  997. {
  998. return smartlist_choose_by_bandwidth(sl, 1, 1);
  999. }
  1000. /** Return a random running router from the routerlist. If any node
  1001. * named in <b>preferred</b> is available, pick one of those. Never
  1002. * pick a node named in <b>excluded</b>, or whose routerinfo is in
  1003. * <b>excludedsmartlist</b>, even if they are the only nodes
  1004. * available. If <b>strict</b> is true, never pick any node besides
  1005. * those in <b>preferred</b>.
  1006. * If <b>need_uptime</b> is non-zero and any router has more than
  1007. * a minimum uptime, return one of those.
  1008. * If <b>need_capacity</b> is non-zero, weight your choice by the
  1009. * advertised capacity of each router.
  1010. * If ! <b>allow_invalid</b>, consider only Valid routers.
  1011. * If <b>need_guard</b>, consider only Guard routers.
  1012. * If <b>weight_for_exit</b>, we weight bandwidths as if picking an exit node,
  1013. * otherwise we weight bandwidths for picking a relay node (that is, possibly
  1014. * discounting exit nodes).
  1015. */
  1016. routerinfo_t *
  1017. router_choose_random_node(const char *preferred,
  1018. const char *excluded,
  1019. smartlist_t *excludedsmartlist,
  1020. int need_uptime, int need_capacity,
  1021. int need_guard,
  1022. int allow_invalid, int strict,
  1023. int weight_for_exit)
  1024. {
  1025. smartlist_t *sl, *excludednodes;
  1026. routerinfo_t *choice = NULL;
  1027. excludednodes = smartlist_create();
  1028. add_nickname_list_to_smartlist(excludednodes,excluded,0);
  1029. /* Try the preferred nodes first. Ignore need_uptime and need_capacity
  1030. * and need_guard, since the user explicitly asked for these nodes. */
  1031. if (preferred) {
  1032. sl = smartlist_create();
  1033. add_nickname_list_to_smartlist(sl,preferred,1);
  1034. smartlist_subtract(sl,excludednodes);
  1035. if (excludedsmartlist)
  1036. smartlist_subtract(sl,excludedsmartlist);
  1037. choice = smartlist_choose(sl);
  1038. smartlist_free(sl);
  1039. }
  1040. if (!choice && !strict) {
  1041. /* Then give up on our preferred choices: any node
  1042. * will do that has the required attributes. */
  1043. sl = smartlist_create();
  1044. router_add_running_routers_to_smartlist(sl, allow_invalid,
  1045. need_uptime, need_capacity,
  1046. need_guard);
  1047. smartlist_subtract(sl,excludednodes);
  1048. if (excludedsmartlist)
  1049. smartlist_subtract(sl,excludedsmartlist);
  1050. if (need_capacity)
  1051. choice = routerlist_sl_choose_by_bandwidth(sl, weight_for_exit);
  1052. else
  1053. choice = smartlist_choose(sl);
  1054. smartlist_free(sl);
  1055. if (!choice && (need_uptime || need_capacity || need_guard)) {
  1056. /* try once more -- recurse but with fewer restrictions. */
  1057. log_info(LD_CIRC,
  1058. "We couldn't find any live%s%s%s routers; falling back "
  1059. "to list of all routers.",
  1060. need_capacity?", fast":"",
  1061. need_uptime?", stable":"",
  1062. need_guard?", guard":"");
  1063. choice = router_choose_random_node(
  1064. NULL, excluded, excludedsmartlist,
  1065. 0, 0, 0, allow_invalid, 0, weight_for_exit);
  1066. }
  1067. }
  1068. smartlist_free(excludednodes);
  1069. if (!choice) {
  1070. if (strict) {
  1071. log_warn(LD_CIRC, "All preferred nodes were down when trying to choose "
  1072. "node, and the Strict[...]Nodes option is set. Failing.");
  1073. } else {
  1074. log_warn(LD_CIRC,
  1075. "No available nodes when trying to choose node. Failing.");
  1076. }
  1077. }
  1078. return choice;
  1079. }
  1080. /** Return true iff the digest of <b>router</b>'s identity key,
  1081. * encoded in hexadecimal, matches <b>hexdigest</b> (which is
  1082. * optionally prefixed with a single dollar sign). Return false if
  1083. * <b>hexdigest</b> is malformed, or it doesn't match. */
  1084. static INLINE int
  1085. router_hex_digest_matches(routerinfo_t *router, const char *hexdigest)
  1086. {
  1087. char digest[DIGEST_LEN];
  1088. size_t len;
  1089. tor_assert(hexdigest);
  1090. if (hexdigest[0] == '$')
  1091. ++hexdigest;
  1092. len = strlen(hexdigest);
  1093. if (len < HEX_DIGEST_LEN)
  1094. return 0;
  1095. else if (len > HEX_DIGEST_LEN &&
  1096. (hexdigest[HEX_DIGEST_LEN] == '=' ||
  1097. hexdigest[HEX_DIGEST_LEN] == '~')) {
  1098. if (strcasecmp(hexdigest+HEX_DIGEST_LEN+1, router->nickname))
  1099. return 0;
  1100. if (hexdigest[HEX_DIGEST_LEN] == '=' && !router->is_named)
  1101. return 0;
  1102. }
  1103. if (base16_decode(digest, DIGEST_LEN, hexdigest, HEX_DIGEST_LEN)<0)
  1104. return 0;
  1105. return (!memcmp(digest, router->cache_info.identity_digest, DIGEST_LEN));
  1106. }
  1107. /** Return true if <b>router</b>'s nickname matches <b>nickname</b>
  1108. * (case-insensitive), or if <b>router's</b> identity key digest
  1109. * matches a hexadecimal value stored in <b>nickname</b>. Return
  1110. * false otherwise. */
  1111. static int
  1112. router_nickname_matches(routerinfo_t *router, const char *nickname)
  1113. {
  1114. if (nickname[0]!='$' && !strcasecmp(router->nickname, nickname))
  1115. return 1;
  1116. return router_hex_digest_matches(router, nickname);
  1117. }
  1118. /** Return the router in our routerlist whose (case-insensitive)
  1119. * nickname or (case-sensitive) hexadecimal key digest is
  1120. * <b>nickname</b>. Return NULL if no such router is known.
  1121. */
  1122. routerinfo_t *
  1123. router_get_by_nickname(const char *nickname, int warn_if_unnamed)
  1124. {
  1125. int maybedigest;
  1126. char digest[DIGEST_LEN];
  1127. routerinfo_t *best_match=NULL;
  1128. int n_matches = 0;
  1129. char *named_digest = NULL;
  1130. tor_assert(nickname);
  1131. if (!routerlist)
  1132. return NULL;
  1133. if (nickname[0] == '$')
  1134. return router_get_by_hexdigest(nickname);
  1135. if (!strcasecmp(nickname, UNNAMED_ROUTER_NICKNAME))
  1136. return NULL;
  1137. if (server_mode(get_options()) &&
  1138. !strcasecmp(nickname, get_options()->Nickname))
  1139. return router_get_my_routerinfo();
  1140. maybedigest = (strlen(nickname) >= HEX_DIGEST_LEN) &&
  1141. (base16_decode(digest,DIGEST_LEN,nickname,HEX_DIGEST_LEN) == 0);
  1142. if (named_server_map &&
  1143. (named_digest = strmap_get_lc(named_server_map, nickname))) {
  1144. return digestmap_get(routerlist->identity_map, named_digest);
  1145. }
  1146. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, router,
  1147. {
  1148. if (!strcasecmp(router->nickname, nickname)) {
  1149. ++n_matches;
  1150. if (n_matches <= 1 || router->is_running)
  1151. best_match = router;
  1152. } else if (maybedigest &&
  1153. !memcmp(digest, router->cache_info.identity_digest, DIGEST_LEN)
  1154. ) {
  1155. if (router_hex_digest_matches(router, nickname))
  1156. return router;
  1157. else
  1158. best_match = router; // XXXX NM not exactly right.
  1159. }
  1160. });
  1161. if (best_match) {
  1162. if (warn_if_unnamed && n_matches > 1) {
  1163. smartlist_t *fps = smartlist_create();
  1164. int any_unwarned = 0;
  1165. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, router,
  1166. {
  1167. local_routerstatus_t *rs;
  1168. char *desc;
  1169. size_t dlen;
  1170. char fp[HEX_DIGEST_LEN+1];
  1171. if (strcasecmp(router->nickname, nickname))
  1172. continue;
  1173. rs = router_get_combined_status_by_digest(
  1174. router->cache_info.identity_digest);
  1175. if (rs && !rs->name_lookup_warned) {
  1176. rs->name_lookup_warned = 1;
  1177. any_unwarned = 1;
  1178. }
  1179. base16_encode(fp, sizeof(fp),
  1180. router->cache_info.identity_digest, DIGEST_LEN);
  1181. dlen = 32 + HEX_DIGEST_LEN + strlen(router->address);
  1182. desc = tor_malloc(dlen);
  1183. tor_snprintf(desc, dlen, "\"$%s\" for the one at %s:%d",
  1184. fp, router->address, router->or_port);
  1185. smartlist_add(fps, desc);
  1186. });
  1187. if (any_unwarned) {
  1188. char *alternatives = smartlist_join_strings(fps, "; ",0,NULL);
  1189. log_warn(LD_CONFIG,
  1190. "There are multiple matches for the nickname \"%s\","
  1191. " but none is listed as named by the directory authorities. "
  1192. "Choosing one arbitrarily. If you meant one in particular, "
  1193. "you should say %s.", nickname, alternatives);
  1194. tor_free(alternatives);
  1195. }
  1196. SMARTLIST_FOREACH(fps, char *, cp, tor_free(cp));
  1197. smartlist_free(fps);
  1198. } else if (warn_if_unnamed) {
  1199. local_routerstatus_t *rs = router_get_combined_status_by_digest(
  1200. best_match->cache_info.identity_digest);
  1201. if (rs && !rs->name_lookup_warned) {
  1202. char fp[HEX_DIGEST_LEN+1];
  1203. base16_encode(fp, sizeof(fp),
  1204. best_match->cache_info.identity_digest, DIGEST_LEN);
  1205. log_warn(LD_CONFIG, "You specified a server \"%s\" by name, but this "
  1206. "name is not registered, so it could be used by any server, "
  1207. "not just the one you meant. "
  1208. "To make sure you get the same server in the future, refer to "
  1209. "it by key, as \"$%s\".", nickname, fp);
  1210. rs->name_lookup_warned = 1;
  1211. }
  1212. }
  1213. return best_match;
  1214. }
  1215. return NULL;
  1216. }
  1217. /** Try to find a routerinfo for <b>digest</b>. If we don't have one,
  1218. * return 1. If we do, ask tor_version_as_new_as() for the answer.
  1219. */
  1220. int
  1221. router_digest_version_as_new_as(const char *digest, const char *cutoff)
  1222. {
  1223. routerinfo_t *router = router_get_by_digest(digest);
  1224. if (!router)
  1225. return 1;
  1226. return tor_version_as_new_as(router->platform, cutoff);
  1227. }
  1228. /** Return true iff <b>digest</b> is the digest of the identity key of
  1229. * a trusted directory. */
  1230. int
  1231. router_digest_is_trusted_dir(const char *digest)
  1232. {
  1233. if (!trusted_dir_servers)
  1234. return 0;
  1235. if (get_options()->AuthoritativeDir &&
  1236. router_digest_is_me(digest))
  1237. return 1;
  1238. SMARTLIST_FOREACH(trusted_dir_servers, trusted_dir_server_t *, ent,
  1239. if (!memcmp(digest, ent->digest, DIGEST_LEN)) return 1);
  1240. return 0;
  1241. }
  1242. /** If hexdigest is correctly formed, base16_decode it into
  1243. * digest, which must have DIGEST_LEN space in it.
  1244. * Return 0 on success, -1 on failure.
  1245. */
  1246. int
  1247. hexdigest_to_digest(const char *hexdigest, char *digest)
  1248. {
  1249. if (hexdigest[0]=='$')
  1250. ++hexdigest;
  1251. if (strlen(hexdigest) < HEX_DIGEST_LEN ||
  1252. base16_decode(digest,DIGEST_LEN,hexdigest,HEX_DIGEST_LEN) < 0)
  1253. return -1;
  1254. return 0;
  1255. }
  1256. /** Return the router in our routerlist whose hexadecimal key digest
  1257. * is <b>hexdigest</b>. Return NULL if no such router is known. */
  1258. routerinfo_t *
  1259. router_get_by_hexdigest(const char *hexdigest)
  1260. {
  1261. char digest[DIGEST_LEN];
  1262. size_t len;
  1263. routerinfo_t *ri;
  1264. tor_assert(hexdigest);
  1265. if (!routerlist)
  1266. return NULL;
  1267. if (hexdigest[0]=='$')
  1268. ++hexdigest;
  1269. len = strlen(hexdigest);
  1270. if (hexdigest_to_digest(hexdigest, digest) < 0)
  1271. return NULL;
  1272. ri = router_get_by_digest(digest);
  1273. if (len > HEX_DIGEST_LEN) {
  1274. if (hexdigest[HEX_DIGEST_LEN] == '=') {
  1275. if (strcasecmp(ri->nickname, hexdigest+HEX_DIGEST_LEN+1) ||
  1276. !ri->is_named)
  1277. return NULL;
  1278. } else if (hexdigest[HEX_DIGEST_LEN] == '~') {
  1279. if (strcasecmp(ri->nickname, hexdigest+HEX_DIGEST_LEN+1))
  1280. return NULL;
  1281. } else {
  1282. return NULL;
  1283. }
  1284. }
  1285. return ri;
  1286. }
  1287. /** Return the router in our routerlist whose 20-byte key digest
  1288. * is <b>digest</b>. Return NULL if no such router is known. */
  1289. routerinfo_t *
  1290. router_get_by_digest(const char *digest)
  1291. {
  1292. tor_assert(digest);
  1293. if (!routerlist) return NULL;
  1294. // routerlist_assert_ok(routerlist);
  1295. return digestmap_get(routerlist->identity_map, digest);
  1296. }
  1297. /** Return the router in our routerlist whose 20-byte descriptor
  1298. * is <b>digest</b>. Return NULL if no such router is known. */
  1299. signed_descriptor_t *
  1300. router_get_by_descriptor_digest(const char *digest)
  1301. {
  1302. tor_assert(digest);
  1303. if (!routerlist) return NULL;
  1304. return digestmap_get(routerlist->desc_digest_map, digest);
  1305. }
  1306. /** DOCDOC */
  1307. signed_descriptor_t *
  1308. extrainfo_get_by_descriptor_digest(const char *digest)
  1309. {
  1310. extrainfo_t *ei;
  1311. tor_assert(digest);
  1312. if (!routerlist) return NULL;
  1313. ei = digestmap_get(routerlist->extra_info_map, digest);
  1314. return ei ? &ei->cache_info : NULL;
  1315. }
  1316. /** Return a pointer to the signed textual representation of a descriptor.
  1317. * The returned string is not guaranteed to be NUL-terminated: the string's
  1318. * length will be in desc-\>signed_descriptor_len. */
  1319. const char *
  1320. signed_descriptor_get_body(signed_descriptor_t *desc)
  1321. {
  1322. const char *r;
  1323. size_t len = desc->signed_descriptor_len;
  1324. tor_assert(len > 32);
  1325. if (desc->saved_location == SAVED_IN_CACHE && routerlist &&
  1326. routerlist->mmap_descriptors) {
  1327. tor_assert(desc->saved_offset + len <= routerlist->mmap_descriptors->size);
  1328. r = routerlist->mmap_descriptors->data + desc->saved_offset;
  1329. } else {
  1330. r = desc->signed_descriptor_body;
  1331. }
  1332. tor_assert(r);
  1333. tor_assert(!memcmp("router ", r, 7) || !memcmp("extra-info ", r, 11));
  1334. #if 0
  1335. tor_assert(!memcmp("\n-----END SIGNATURE-----\n",
  1336. r + len - 25, 25));
  1337. #endif
  1338. return r;
  1339. }
  1340. /** Return the current list of all known routers. */
  1341. routerlist_t *
  1342. router_get_routerlist(void)
  1343. {
  1344. if (!routerlist) {
  1345. routerlist = tor_malloc_zero(sizeof(routerlist_t));
  1346. routerlist->routers = smartlist_create();
  1347. routerlist->old_routers = smartlist_create();
  1348. routerlist->identity_map = digestmap_new();
  1349. routerlist->desc_digest_map = digestmap_new();
  1350. routerlist->extra_info_map = digestmap_new();
  1351. }
  1352. return routerlist;
  1353. }
  1354. /** Free all storage held by <b>router</b>. */
  1355. void
  1356. routerinfo_free(routerinfo_t *router)
  1357. {
  1358. if (!router)
  1359. return;
  1360. tor_free(router->cache_info.signed_descriptor_body);
  1361. tor_free(router->address);
  1362. tor_free(router->nickname);
  1363. tor_free(router->platform);
  1364. tor_free(router->contact_info);
  1365. if (router->onion_pkey)
  1366. crypto_free_pk_env(router->onion_pkey);
  1367. if (router->identity_pkey)
  1368. crypto_free_pk_env(router->identity_pkey);
  1369. if (router->declared_family) {
  1370. SMARTLIST_FOREACH(router->declared_family, char *, s, tor_free(s));
  1371. smartlist_free(router->declared_family);
  1372. }
  1373. addr_policy_free(router->exit_policy);
  1374. tor_free(router);
  1375. }
  1376. /** DOCDOC */
  1377. void
  1378. extrainfo_free(extrainfo_t *extrainfo)
  1379. {
  1380. if (!extrainfo)
  1381. return;
  1382. tor_free(extrainfo->cache_info.signed_descriptor_body);
  1383. tor_free(extrainfo->pending_sig);
  1384. tor_free(extrainfo);
  1385. }
  1386. /** Release storage held by <b>sd</b>. */
  1387. static void
  1388. signed_descriptor_free(signed_descriptor_t *sd)
  1389. {
  1390. tor_free(sd->signed_descriptor_body);
  1391. tor_free(sd);
  1392. }
  1393. /** Extract a signed_descriptor_t from a routerinfo, and free the routerinfo.
  1394. */
  1395. static signed_descriptor_t *
  1396. signed_descriptor_from_routerinfo(routerinfo_t *ri)
  1397. {
  1398. signed_descriptor_t *sd = tor_malloc_zero(sizeof(signed_descriptor_t));
  1399. memcpy(sd, &(ri->cache_info), sizeof(signed_descriptor_t));
  1400. ri->cache_info.signed_descriptor_body = NULL;
  1401. routerinfo_free(ri);
  1402. return sd;
  1403. }
  1404. /** DOCDOC */
  1405. static void
  1406. _extrainfo_free(void *e)
  1407. {
  1408. extrainfo_free(e);
  1409. }
  1410. /** Free all storage held by a routerlist <b>rl</b> */
  1411. void
  1412. routerlist_free(routerlist_t *rl)
  1413. {
  1414. tor_assert(rl);
  1415. digestmap_free(rl->identity_map, NULL);
  1416. digestmap_free(rl->desc_digest_map, NULL);
  1417. digestmap_free(rl->extra_info_map, _extrainfo_free);
  1418. SMARTLIST_FOREACH(rl->routers, routerinfo_t *, r,
  1419. routerinfo_free(r));
  1420. SMARTLIST_FOREACH(rl->old_routers, signed_descriptor_t *, sd,
  1421. signed_descriptor_free(sd));
  1422. smartlist_free(rl->routers);
  1423. smartlist_free(rl->old_routers);
  1424. if (routerlist->mmap_descriptors)
  1425. tor_munmap_file(routerlist->mmap_descriptors);
  1426. tor_free(rl);
  1427. router_dir_info_changed();
  1428. }
  1429. void
  1430. dump_routerlist_mem_usage(int severity)
  1431. {
  1432. uint64_t livedescs = 0;
  1433. uint64_t olddescs = 0;
  1434. if (!routerlist)
  1435. return;
  1436. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, r,
  1437. livedescs += r->cache_info.signed_descriptor_len);
  1438. SMARTLIST_FOREACH(routerlist->old_routers, signed_descriptor_t *, sd,
  1439. olddescs += sd->signed_descriptor_len);
  1440. log(severity, LD_GENERAL,
  1441. "In %d live descriptors: "U64_FORMAT" bytes. "
  1442. "In %d old descriptors: "U64_FORMAT" bytes.",
  1443. smartlist_len(routerlist->routers), U64_PRINTF_ARG(livedescs),
  1444. smartlist_len(routerlist->old_routers), U64_PRINTF_ARG(olddescs));
  1445. }
  1446. /** Return the greatest number of routerdescs we'll hold for any given router.
  1447. */
  1448. static int
  1449. max_descriptors_per_router(void)
  1450. {
  1451. int n_authorities = get_n_v2_authorities();
  1452. return (n_authorities < 5) ? 5 : n_authorities;
  1453. }
  1454. /** Return non-zero if we have a lot of extra descriptors in our
  1455. * routerlist, and should get rid of some of them. Else return 0.
  1456. *
  1457. * We should be careful to not return true too eagerly, since we
  1458. * could churn. By using "+1" below, we make sure this function
  1459. * only returns true at most every smartlist_len(rl-\>routers)
  1460. * new descriptors.
  1461. */
  1462. static INLINE int
  1463. routerlist_is_overfull(routerlist_t *rl)
  1464. {
  1465. return smartlist_len(rl->old_routers) >
  1466. smartlist_len(rl->routers)*(max_descriptors_per_router()+1);
  1467. }
  1468. static INLINE int
  1469. _routerlist_find_elt(smartlist_t *sl, void *ri, int idx)
  1470. {
  1471. if (idx < 0 || smartlist_get(sl, idx) != ri) {
  1472. idx = -1;
  1473. SMARTLIST_FOREACH(sl, routerinfo_t *, r,
  1474. if (r == ri) {
  1475. idx = r_sl_idx;
  1476. break;
  1477. });
  1478. }
  1479. return idx;
  1480. }
  1481. /** Insert an item <b>ri</b> into the routerlist <b>rl</b>, updating indices
  1482. * as needed. There must be no previous member of <b>rl</b> with the same
  1483. * identity digest as <b>ri</b>: If there is, call routerlist_replace
  1484. * instead.
  1485. */
  1486. static void
  1487. routerlist_insert(routerlist_t *rl, routerinfo_t *ri)
  1488. {
  1489. routerinfo_t *ri_old;
  1490. ri_old = digestmap_set(rl->identity_map, ri->cache_info.identity_digest, ri);
  1491. tor_assert(!ri_old);
  1492. digestmap_set(rl->desc_digest_map, ri->cache_info.signed_descriptor_digest,
  1493. &(ri->cache_info));
  1494. smartlist_add(rl->routers, ri);
  1495. ri->routerlist_index = smartlist_len(rl->routers) - 1;
  1496. router_dir_info_changed();
  1497. // routerlist_assert_ok(rl);
  1498. }
  1499. /**DOCDOC*/
  1500. static void
  1501. extrainfo_insert(routerlist_t *rl, extrainfo_t *ei)
  1502. {
  1503. routerinfo_t *ri = digestmap_get(rl->identity_map,
  1504. ei->cache_info.identity_digest);
  1505. extrainfo_t *ei_tmp;
  1506. if (!ri || routerinfo_incompatible_with_extrainfo(ri,ei)) {
  1507. int found = 0;
  1508. if (ei->pending_sig || ei->bad_sig) {
  1509. extrainfo_free(ei);
  1510. return;
  1511. }
  1512. /* The signature checks out; let's see if one of the old routers
  1513. * matches. */
  1514. SMARTLIST_FOREACH(rl->old_routers, signed_descriptor_t *, sd, {
  1515. if (!memcmp(ei->cache_info.identity_digest,
  1516. sd->identity_digest, DIGEST_LEN) &&
  1517. !memcmp(ei->cache_info.signed_descriptor_digest,
  1518. sd->extra_info_digest, DIGEST_LEN) &&
  1519. sd->published_on == ei->cache_info.published_on) {
  1520. found = 1;
  1521. break;
  1522. }
  1523. });
  1524. if (!found) {
  1525. extrainfo_free(ei);
  1526. return;
  1527. }
  1528. }
  1529. ei_tmp = digestmap_set(rl->extra_info_map,
  1530. ei->cache_info.signed_descriptor_digest,
  1531. ei);
  1532. if (ei_tmp)
  1533. extrainfo_free(ei_tmp);
  1534. }
  1535. /** If we're a directory cache and routerlist <b>rl</b> doesn't have
  1536. * a copy of router <b>ri</b> yet, add it to the list of old (not
  1537. * recommended but still served) descriptors. Else free it. */
  1538. static void
  1539. routerlist_insert_old(routerlist_t *rl, routerinfo_t *ri)
  1540. {
  1541. if (get_options()->DirPort &&
  1542. ri->purpose == ROUTER_PURPOSE_GENERAL &&
  1543. !digestmap_get(rl->desc_digest_map,
  1544. ri->cache_info.signed_descriptor_digest)) {
  1545. signed_descriptor_t *sd = signed_descriptor_from_routerinfo(ri);
  1546. digestmap_set(rl->desc_digest_map, sd->signed_descriptor_digest, sd);
  1547. smartlist_add(rl->old_routers, sd);
  1548. } else {
  1549. routerinfo_free(ri);
  1550. }
  1551. // routerlist_assert_ok(rl);
  1552. }
  1553. /** Remove an item <b>ri</b> from the routerlist <b>rl</b>, updating indices
  1554. * as needed. If <b>idx</b> is nonnegative and smartlist_get(rl-&gt;routers,
  1555. * idx) == ri, we don't need to do a linear search over the list to decide
  1556. * which to remove. We fill the gap in rl-&gt;routers with a later element in
  1557. * the list, if any exists. <b>ri</b> is freed.
  1558. *
  1559. * If <b>make_old</b> is true, instead of deleting the router, we try adding
  1560. * it to rl-&gt;old_routers. */
  1561. void
  1562. routerlist_remove(routerlist_t *rl, routerinfo_t *ri, int idx, int make_old)
  1563. {
  1564. routerinfo_t *ri_tmp;
  1565. extrainfo_t *ei_tmp;
  1566. idx = _routerlist_find_elt(rl->routers, ri, idx);
  1567. if (idx < 0)
  1568. return;
  1569. ri->routerlist_index = -1;
  1570. smartlist_del(rl->routers, idx);
  1571. if (idx < smartlist_len(rl->routers)) {
  1572. routerinfo_t *r = smartlist_get(rl->routers, idx);
  1573. r->routerlist_index = idx;
  1574. }
  1575. ri_tmp = digestmap_remove(rl->identity_map, ri->cache_info.identity_digest);
  1576. router_dir_info_changed();
  1577. tor_assert(ri_tmp == ri);
  1578. if (make_old && get_options()->DirPort &&
  1579. ri->purpose == ROUTER_PURPOSE_GENERAL) {
  1580. signed_descriptor_t *sd;
  1581. sd = signed_descriptor_from_routerinfo(ri);
  1582. smartlist_add(rl->old_routers, sd);
  1583. digestmap_set(rl->desc_digest_map, sd->signed_descriptor_digest, sd);
  1584. } else {
  1585. ri_tmp = digestmap_remove(rl->desc_digest_map,
  1586. ri->cache_info.signed_descriptor_digest);
  1587. tor_assert(ri_tmp == ri);
  1588. router_bytes_dropped += ri->cache_info.signed_descriptor_len;
  1589. routerinfo_free(ri);
  1590. ei_tmp = digestmap_remove(rl->extra_info_map,
  1591. ri->cache_info.extra_info_digest);
  1592. if (ei_tmp)
  1593. extrainfo_free(ei_tmp);
  1594. }
  1595. // routerlist_assert_ok(rl);
  1596. }
  1597. /** DOCDOC */
  1598. static void
  1599. routerlist_remove_old(routerlist_t *rl, signed_descriptor_t *sd, int idx)
  1600. {
  1601. signed_descriptor_t *sd_tmp;
  1602. extrainfo_t *ei_tmp;
  1603. idx = _routerlist_find_elt(rl->old_routers, sd, idx);
  1604. if (idx < 0)
  1605. return;
  1606. smartlist_del(rl->old_routers, idx);
  1607. sd_tmp = digestmap_remove(rl->desc_digest_map,
  1608. sd->signed_descriptor_digest);
  1609. tor_assert(sd_tmp == sd);
  1610. router_bytes_dropped += sd->signed_descriptor_len;
  1611. signed_descriptor_free(sd);
  1612. ei_tmp = digestmap_remove(rl->extra_info_map,
  1613. sd->extra_info_digest);
  1614. if (ei_tmp)
  1615. extrainfo_free(ei_tmp);
  1616. // routerlist_assert_ok(rl);
  1617. }
  1618. /** Remove <b>ri_old</b> from the routerlist <b>rl</b>, and replace it with
  1619. * <b>ri_new</b>, updating all index info. If <b>idx</b> is nonnegative and
  1620. * smartlist_get(rl-&gt;routers, idx) == ri, we don't need to do a linear
  1621. * search over the list to decide which to remove. We put ri_new in the same
  1622. * index as ri_old, if possible. ri is freed as appropriate.
  1623. *
  1624. * If <b>make_old</b> is true, instead of deleting the router, we try adding
  1625. * it to rl-&gt;old_routers. */
  1626. static void
  1627. routerlist_replace(routerlist_t *rl, routerinfo_t *ri_old,
  1628. routerinfo_t *ri_new, int idx, int make_old)
  1629. {
  1630. routerinfo_t *ri_tmp;
  1631. extrainfo_t *ei_tmp;
  1632. tor_assert(ri_old != ri_new);
  1633. idx = _routerlist_find_elt(rl->routers, ri_old, idx);
  1634. router_dir_info_changed();
  1635. if (idx >= 0) {
  1636. smartlist_set(rl->routers, idx, ri_new);
  1637. ri_old->routerlist_index = -1;
  1638. ri_new->routerlist_index = idx;
  1639. } else {
  1640. log_warn(LD_BUG, "Appending entry from routerlist_replace.");
  1641. routerlist_insert(rl, ri_new);
  1642. return;
  1643. }
  1644. if (memcmp(ri_old->cache_info.identity_digest,
  1645. ri_new->cache_info.identity_digest, DIGEST_LEN)) {
  1646. /* digests don't match; digestmap_set won't replace */
  1647. digestmap_remove(rl->identity_map, ri_old->cache_info.identity_digest);
  1648. }
  1649. ri_tmp = digestmap_set(rl->identity_map,
  1650. ri_new->cache_info.identity_digest, ri_new);
  1651. tor_assert(!ri_tmp || ri_tmp == ri_old);
  1652. digestmap_set(rl->desc_digest_map,
  1653. ri_new->cache_info.signed_descriptor_digest, &(ri_new->cache_info));
  1654. if (make_old && get_options()->DirPort &&
  1655. ri_old->purpose == ROUTER_PURPOSE_GENERAL) {
  1656. signed_descriptor_t *sd = signed_descriptor_from_routerinfo(ri_old);
  1657. smartlist_add(rl->old_routers, sd);
  1658. digestmap_set(rl->desc_digest_map, sd->signed_descriptor_digest, sd);
  1659. } else {
  1660. if (memcmp(ri_old->cache_info.signed_descriptor_digest,
  1661. ri_new->cache_info.signed_descriptor_digest,
  1662. DIGEST_LEN)) {
  1663. /* digests don't match; digestmap_set didn't replace */
  1664. digestmap_remove(rl->desc_digest_map,
  1665. ri_old->cache_info.signed_descriptor_digest);
  1666. ei_tmp = digestmap_remove(rl->extra_info_map,
  1667. ri_old->cache_info.extra_info_digest);
  1668. if (ei_tmp) {
  1669. extrainfo_free(ei_tmp);
  1670. }
  1671. }
  1672. routerinfo_free(ri_old);
  1673. }
  1674. // routerlist_assert_ok(rl);
  1675. }
  1676. /** Free all memory held by the routerlist module. */
  1677. void
  1678. routerlist_free_all(void)
  1679. {
  1680. if (routerlist)
  1681. routerlist_free(routerlist);
  1682. routerlist = NULL;
  1683. if (warned_nicknames) {
  1684. SMARTLIST_FOREACH(warned_nicknames, char *, cp, tor_free(cp));
  1685. smartlist_free(warned_nicknames);
  1686. warned_nicknames = NULL;
  1687. }
  1688. if (warned_conflicts) {
  1689. SMARTLIST_FOREACH(warned_conflicts, char *, cp, tor_free(cp));
  1690. smartlist_free(warned_conflicts);
  1691. warned_conflicts = NULL;
  1692. }
  1693. if (trusted_dir_servers) {
  1694. SMARTLIST_FOREACH(trusted_dir_servers, trusted_dir_server_t *, ds,
  1695. trusted_dir_server_free(ds));
  1696. smartlist_free(trusted_dir_servers);
  1697. trusted_dir_servers = NULL;
  1698. }
  1699. if (networkstatus_list) {
  1700. SMARTLIST_FOREACH(networkstatus_list, networkstatus_t *, ns,
  1701. networkstatus_free(ns));
  1702. smartlist_free(networkstatus_list);
  1703. networkstatus_list = NULL;
  1704. }
  1705. if (routerstatus_list) {
  1706. SMARTLIST_FOREACH(routerstatus_list, local_routerstatus_t *, rs,
  1707. local_routerstatus_free(rs));
  1708. smartlist_free(routerstatus_list);
  1709. routerstatus_list = NULL;
  1710. }
  1711. if (named_server_map) {
  1712. strmap_free(named_server_map, _tor_free);
  1713. }
  1714. }
  1715. /** Free all storage held by the routerstatus object <b>rs</b>. */
  1716. void
  1717. routerstatus_free(routerstatus_t *rs)
  1718. {
  1719. tor_free(rs);
  1720. }
  1721. /** Free all storage held by the local_routerstatus object <b>rs</b>. */
  1722. static void
  1723. local_routerstatus_free(local_routerstatus_t *rs)
  1724. {
  1725. tor_free(rs);
  1726. }
  1727. /** Free all storage held by the networkstatus object <b>ns</b>. */
  1728. void
  1729. networkstatus_free(networkstatus_t *ns)
  1730. {
  1731. tor_free(ns->source_address);
  1732. tor_free(ns->contact);
  1733. if (ns->signing_key)
  1734. crypto_free_pk_env(ns->signing_key);
  1735. tor_free(ns->client_versions);
  1736. tor_free(ns->server_versions);
  1737. if (ns->entries) {
  1738. SMARTLIST_FOREACH(ns->entries, routerstatus_t *, rs,
  1739. routerstatus_free(rs));
  1740. smartlist_free(ns->entries);
  1741. }
  1742. tor_free(ns);
  1743. }
  1744. /** Forget that we have issued any router-related warnings, so that we'll
  1745. * warn again if we see the same errors. */
  1746. void
  1747. routerlist_reset_warnings(void)
  1748. {
  1749. if (!warned_nicknames)
  1750. warned_nicknames = smartlist_create();
  1751. SMARTLIST_FOREACH(warned_nicknames, char *, cp, tor_free(cp));
  1752. smartlist_clear(warned_nicknames); /* now the list is empty. */
  1753. if (!warned_conflicts)
  1754. warned_conflicts = smartlist_create();
  1755. SMARTLIST_FOREACH(warned_conflicts, char *, cp, tor_free(cp));
  1756. smartlist_clear(warned_conflicts); /* now the list is empty. */
  1757. if (!routerstatus_list)
  1758. routerstatus_list = smartlist_create();
  1759. SMARTLIST_FOREACH(routerstatus_list, local_routerstatus_t *, rs,
  1760. rs->name_lookup_warned = 0);
  1761. have_warned_about_invalid_status = 0;
  1762. have_warned_about_old_version = 0;
  1763. have_warned_about_new_version = 0;
  1764. }
  1765. /** Mark the router with ID <b>digest</b> as running or non-running
  1766. * in our routerlist. */
  1767. void
  1768. router_set_status(const char *digest, int up)
  1769. {
  1770. routerinfo_t *router;
  1771. local_routerstatus_t *status;
  1772. tor_assert(digest);
  1773. SMARTLIST_FOREACH(trusted_dir_servers, trusted_dir_server_t *, d,
  1774. if (!memcmp(d->digest, digest, DIGEST_LEN))
  1775. d->is_running = up);
  1776. router = router_get_by_digest(digest);
  1777. if (router) {
  1778. log_debug(LD_DIR,"Marking router '%s' as %s.",
  1779. router->nickname, up ? "up" : "down");
  1780. if (!up && router_is_me(router) && !we_are_hibernating())
  1781. log_warn(LD_NET, "We just marked ourself as down. Are your external "
  1782. "addresses reachable?");
  1783. router->is_running = up;
  1784. }
  1785. status = router_get_combined_status_by_digest(digest);
  1786. if (status && status->status.is_running != up) {
  1787. status->status.is_running = up;
  1788. control_event_networkstatus_changed_single(status);
  1789. }
  1790. router_dir_info_changed();
  1791. }
  1792. /** Add <b>router</b> to the routerlist, if we don't already have it. Replace
  1793. * older entries (if any) with the same key. Note: Callers should not hold
  1794. * their pointers to <b>router</b> if this function fails; <b>router</b>
  1795. * will either be inserted into the routerlist or freed.
  1796. *
  1797. * Returns >= 0 if the router was added; less than 0 if it was not.
  1798. *
  1799. * If we're returning non-zero, then assign to *<b>msg</b> a static string
  1800. * describing the reason for not liking the routerinfo.
  1801. *
  1802. * If the return value is less than -1, there was a problem with the
  1803. * routerinfo. If the return value is equal to -1, then the routerinfo was
  1804. * fine, but out-of-date. If the return value is equal to 1, the
  1805. * routerinfo was accepted, but we should notify the generator of the
  1806. * descriptor using the message *<b>msg</b>.
  1807. *
  1808. * If <b>from_cache</b>, this descriptor came from our disk cache. If
  1809. * <b>from_fetch</b>, we received it in response to a request we made.
  1810. * (If both are false, that means it was uploaded to us as an auth dir
  1811. * server or via the controller.)
  1812. *
  1813. * This function should be called *after*
  1814. * routers_update_status_from_networkstatus; subsequently, you should call
  1815. * router_rebuild_store and control_event_descriptors_changed.
  1816. */
  1817. int
  1818. router_add_to_routerlist(routerinfo_t *router, const char **msg,
  1819. int from_cache, int from_fetch)
  1820. {
  1821. const char *id_digest;
  1822. int authdir = get_options()->AuthoritativeDir;
  1823. int authdir_believes_valid = 0;
  1824. routerinfo_t *old_router;
  1825. tor_assert(msg);
  1826. if (!routerlist)
  1827. router_get_routerlist();
  1828. if (!networkstatus_list)
  1829. networkstatus_list = smartlist_create();
  1830. id_digest = router->cache_info.identity_digest;
  1831. /* Make sure that we haven't already got this exact descriptor. */
  1832. if (digestmap_get(routerlist->desc_digest_map,
  1833. router->cache_info.signed_descriptor_digest)) {
  1834. log_info(LD_DIR,
  1835. "Dropping descriptor that we already have for router '%s'",
  1836. router->nickname);
  1837. *msg = "Router descriptor was not new.";
  1838. routerinfo_free(router);
  1839. return -1;
  1840. }
  1841. if (routerlist_is_overfull(routerlist))
  1842. routerlist_remove_old_routers();
  1843. if (authdir) {
  1844. if (authdir_wants_to_reject_router(router, msg,
  1845. !from_cache && !from_fetch)) {
  1846. tor_assert(*msg);
  1847. routerinfo_free(router);
  1848. return -2;
  1849. }
  1850. authdir_believes_valid = router->is_valid;
  1851. } else if (from_fetch) {
  1852. /* Only check the descriptor digest against the network statuses when
  1853. * we are receiving in response to a fetch. */
  1854. if (!signed_desc_digest_is_recognized(&router->cache_info)) {
  1855. /* We asked for it, so some networkstatus must have listed it when we
  1856. * did. Save it if we're a cache in case somebody else asks for it. */
  1857. log_info(LD_DIR,
  1858. "Received a no-longer-recognized descriptor for router '%s'",
  1859. router->nickname);
  1860. *msg = "Router descriptor is not referenced by any network-status.";
  1861. /* Only journal this desc if we'll be serving it. */
  1862. if (!from_cache && get_options()->DirPort)
  1863. router_append_to_journal(&router->cache_info, router->purpose);
  1864. routerlist_insert_old(routerlist, router);
  1865. return -1;
  1866. }
  1867. }
  1868. /* We no longer need a router with this descriptor digest. */
  1869. SMARTLIST_FOREACH(networkstatus_list, networkstatus_t *, ns,
  1870. {
  1871. routerstatus_t *rs =
  1872. networkstatus_find_entry(ns, router->cache_info.identity_digest);
  1873. if (rs && !memcmp(rs->descriptor_digest,
  1874. router->cache_info.signed_descriptor_digest,
  1875. DIGEST_LEN))
  1876. rs->need_to_mirror = 0;
  1877. });
  1878. /* If we have a router with the same identity key, choose the newer one. */
  1879. old_router = digestmap_get(routerlist->identity_map,
  1880. router->cache_info.identity_digest);
  1881. if (old_router) {
  1882. int pos = old_router->routerlist_index;
  1883. tor_assert(smartlist_get(routerlist->routers, pos) == old_router);
  1884. if (router->cache_info.published_on <=
  1885. old_router->cache_info.published_on) {
  1886. /* Same key, but old */
  1887. log_debug(LD_DIR, "Skipping not-new descriptor for router '%s'",
  1888. router->nickname);
  1889. /* Only journal this desc if we'll be serving it. */
  1890. if (!from_cache && get_options()->DirPort)
  1891. router_append_to_journal(&router->cache_info, router->purpose);
  1892. routerlist_insert_old(routerlist, router);
  1893. *msg = "Router descriptor was not new.";
  1894. return -1;
  1895. } else {
  1896. /* Same key, new. */
  1897. int unreachable = 0;
  1898. log_debug(LD_DIR, "Replacing entry for router '%s/%s' [%s]",
  1899. router->nickname, old_router->nickname,
  1900. hex_str(id_digest,DIGEST_LEN));
  1901. if (router->addr == old_router->addr &&
  1902. router->or_port == old_router->or_port) {
  1903. /* these carry over when the address and orport are unchanged.*/
  1904. router->last_reachable = old_router->last_reachable;
  1905. router->testing_since = old_router->testing_since;
  1906. router->num_unreachable_notifications =
  1907. old_router->num_unreachable_notifications;
  1908. }
  1909. if (authdir && !from_cache && !from_fetch &&
  1910. router_have_minimum_dir_info() &&
  1911. dirserv_thinks_router_is_blatantly_unreachable(router,
  1912. time(NULL))) {
  1913. if (router->num_unreachable_notifications >= 3) {
  1914. unreachable = 1;
  1915. log_notice(LD_DIR, "Notifying server '%s' that it's unreachable. "
  1916. "(ContactInfo '%s', platform '%s').",
  1917. router->nickname,
  1918. router->contact_info ? router->contact_info : "",
  1919. router->platform ? router->platform : "");
  1920. } else {
  1921. log_info(LD_DIR,"'%s' may be unreachable -- the %d previous "
  1922. "descriptors were thought to be unreachable.",
  1923. router->nickname, router->num_unreachable_notifications);
  1924. router->num_unreachable_notifications++;
  1925. }
  1926. }
  1927. routerlist_replace(routerlist, old_router, router, pos, 1);
  1928. if (!from_cache) {
  1929. router_append_to_journal(&router->cache_info, router->purpose);
  1930. }
  1931. directory_set_dirty();
  1932. *msg = unreachable ? "Dirserver believes your ORPort is unreachable" :
  1933. authdir_believes_valid ? "Valid server updated" :
  1934. ("Invalid server updated. (This dirserver is marking your "
  1935. "server as unapproved.)");
  1936. return unreachable ? 1 : 0;
  1937. }
  1938. }
  1939. /* We haven't seen a router with this identity before. Add it to the end of
  1940. * the list. */
  1941. routerlist_insert(routerlist, router);
  1942. if (!from_cache)
  1943. router_append_to_journal(&router->cache_info, router->purpose);
  1944. directory_set_dirty();
  1945. return 0;
  1946. }
  1947. /** DOCDOC */
  1948. void
  1949. router_add_extrainfo_to_routerlist(extrainfo_t *ei, const char **msg,
  1950. int from_cache, int from_fetch)
  1951. {
  1952. /* XXXX020 cache on disk */
  1953. (void)from_cache;
  1954. (void)from_fetch;
  1955. (void)msg;
  1956. extrainfo_insert(router_get_routerlist(), ei);
  1957. }
  1958. /** Sorting helper: return &lt;0, 0, or &gt;0 depending on whether the
  1959. * signed_descriptor_t* in *<b>a</b> has an identity digest preceding, equal
  1960. * to, or later than that of *<b>b</b>. */
  1961. static int
  1962. _compare_old_routers_by_identity(const void **_a, const void **_b)
  1963. {
  1964. int i;
  1965. const signed_descriptor_t *r1 = *_a, *r2 = *_b;
  1966. if ((i = memcmp(r1->identity_digest, r2->identity_digest, DIGEST_LEN)))
  1967. return i;
  1968. return r1->published_on - r2->published_on;
  1969. }
  1970. /** Internal type used to represent how long an old descriptor was valid,
  1971. * where it appeared in the list of old descriptors, and whether it's extra
  1972. * old. Used only by routerlist_remove_old_cached_routers_with_id(). */
  1973. struct duration_idx_t {
  1974. int duration;
  1975. int idx;
  1976. int old;
  1977. };
  1978. /** Sorting helper: compare two duration_idx_t by their duration. */
  1979. static int
  1980. _compare_duration_idx(const void *_d1, const void *_d2)
  1981. {
  1982. const struct duration_idx_t *d1 = _d1;
  1983. const struct duration_idx_t *d2 = _d2;
  1984. return d1->duration - d2->duration;
  1985. }
  1986. /** The range <b>lo</b> through <b>hi</b> inclusive of routerlist->old_routers
  1987. * must contain routerinfo_t with the same identity and with publication time
  1988. * in ascending order. Remove members from this range until there are no more
  1989. * than max_descriptors_per_router() remaining. Start by removing the oldest
  1990. * members from before <b>cutoff</b>, then remove members which were current
  1991. * for the lowest amount of time. The order of members of old_routers at
  1992. * indices <b>lo</b> or higher may be changed.
  1993. */
  1994. static void
  1995. routerlist_remove_old_cached_routers_with_id(time_t cutoff, int lo, int hi,
  1996. digestmap_t *retain)
  1997. {
  1998. int i, n = hi-lo+1, n_extra;
  1999. int n_rmv = 0;
  2000. struct duration_idx_t *lifespans;
  2001. uint8_t *rmv, *must_keep;
  2002. smartlist_t *lst = routerlist->old_routers;
  2003. #if 1
  2004. const char *ident;
  2005. tor_assert(hi < smartlist_len(lst));
  2006. tor_assert(lo <= hi);
  2007. ident = ((signed_descriptor_t*)smartlist_get(lst, lo))->identity_digest;
  2008. for (i = lo+1; i <= hi; ++i) {
  2009. signed_descriptor_t *r = smartlist_get(lst, i);
  2010. tor_assert(!memcmp(ident, r->identity_digest, DIGEST_LEN));
  2011. }
  2012. #endif
  2013. /* Check whether we need to do anything at all. */
  2014. n_extra = n - max_descriptors_per_router();
  2015. if (n_extra <= 0)
  2016. return;
  2017. lifespans = tor_malloc_zero(sizeof(struct duration_idx_t)*n);
  2018. rmv = tor_malloc_zero(sizeof(uint8_t)*n);
  2019. must_keep = tor_malloc_zero(sizeof(uint8_t)*n);
  2020. /* Set lifespans to contain the lifespan and index of each server. */
  2021. /* Set rmv[i-lo]=1 if we're going to remove a server for being too old. */
  2022. for (i = lo; i <= hi; ++i) {
  2023. signed_descriptor_t *r = smartlist_get(lst, i);
  2024. signed_descriptor_t *r_next;
  2025. lifespans[i-lo].idx = i;
  2026. if (retain && digestmap_get(retain, r->signed_descriptor_digest)) {
  2027. must_keep[i-lo] = 1;
  2028. }
  2029. if (i < hi) {
  2030. r_next = smartlist_get(lst, i+1);
  2031. tor_assert(r->published_on <= r_next->published_on);
  2032. lifespans[i-lo].duration = (r_next->published_on - r->published_on);
  2033. } else {
  2034. r_next = NULL;
  2035. lifespans[i-lo].duration = INT_MAX;
  2036. }
  2037. if (!must_keep[i-lo] && r->published_on < cutoff && n_rmv < n_extra) {
  2038. ++n_rmv;
  2039. lifespans[i-lo].old = 1;
  2040. rmv[i-lo] = 1;
  2041. }
  2042. }
  2043. if (n_rmv < n_extra) {
  2044. /**
  2045. * We aren't removing enough servers for being old. Sort lifespans by
  2046. * the duration of liveness, and remove the ones we're not already going to
  2047. * remove based on how long they were alive.
  2048. **/
  2049. qsort(lifespans, n, sizeof(struct duration_idx_t), _compare_duration_idx);
  2050. for (i = 0; i < n && n_rmv < n_extra; ++i) {
  2051. if (!must_keep[lifespans[i].idx-lo] && !lifespans[i].old) {
  2052. rmv[lifespans[i].idx-lo] = 1;
  2053. ++n_rmv;
  2054. }
  2055. }
  2056. }
  2057. for (i = hi; i >= lo; --i) {
  2058. if (rmv[i-lo])
  2059. routerlist_remove_old(routerlist, smartlist_get(lst, i), i);
  2060. }
  2061. tor_free(must_keep);
  2062. tor_free(rmv);
  2063. tor_free(lifespans);
  2064. }
  2065. /** Deactivate any routers from the routerlist that are more than
  2066. * ROUTER_MAX_AGE seconds old and not recommended by any networkstatuses;
  2067. * remove old routers from the list of cached routers if we have too many.
  2068. */
  2069. void
  2070. routerlist_remove_old_routers(void)
  2071. {
  2072. int i, hi=-1;
  2073. const char *cur_id = NULL;
  2074. time_t now = time(NULL);
  2075. time_t cutoff;
  2076. routerinfo_t *router;
  2077. signed_descriptor_t *sd;
  2078. digestmap_t *retain;
  2079. if (!routerlist || !networkstatus_list)
  2080. return;
  2081. routerlist_assert_ok(routerlist);
  2082. retain = digestmap_new();
  2083. cutoff = now - OLD_ROUTER_DESC_MAX_AGE;
  2084. /* Build a list of all the descriptors that _anybody_ recommends. */
  2085. SMARTLIST_FOREACH(networkstatus_list, networkstatus_t *, ns,
  2086. {
  2087. /* XXXX The inner loop here gets pretty expensive, and actually shows up
  2088. * on some profiles. It may be the reason digestmap_set shows up in
  2089. * profiles too. If instead we kept a per-descriptor digest count of
  2090. * how many networkstatuses recommended each descriptor, and changed
  2091. * that only when the networkstatuses changed, that would be a speed
  2092. * improvement, possibly 1-4% if it also removes digestmap_set from the
  2093. * profile. Not worth it for 0.1.2.x, though. The new directory
  2094. * system will obsolete this whole thing in 0.2.0.x. */
  2095. SMARTLIST_FOREACH(ns->entries, routerstatus_t *, rs,
  2096. if (rs->published_on >= cutoff)
  2097. digestmap_set(retain, rs->descriptor_digest, (void*)1));
  2098. });
  2099. /* If we have a bunch of networkstatuses, we should consider pruning current
  2100. * routers that are too old and that nobody recommends. (If we don't have
  2101. * enough networkstatuses, then we should get more before we decide to kill
  2102. * routers.) */
  2103. if (smartlist_len(networkstatus_list) > get_n_v2_authorities() / 2) {
  2104. cutoff = now - ROUTER_MAX_AGE;
  2105. /* Remove too-old unrecommended members of routerlist->routers. */
  2106. for (i = 0; i < smartlist_len(routerlist->routers); ++i) {
  2107. router = smartlist_get(routerlist->routers, i);
  2108. if (router->cache_info.published_on <= cutoff &&
  2109. !digestmap_get(retain,router->cache_info.signed_descriptor_digest)) {
  2110. /* Too old: remove it. (If we're a cache, just move it into
  2111. * old_routers.) */
  2112. log_info(LD_DIR,
  2113. "Forgetting obsolete (too old) routerinfo for router '%s'",
  2114. router->nickname);
  2115. routerlist_remove(routerlist, router, i--, 1);
  2116. }
  2117. }
  2118. }
  2119. routerlist_assert_ok(routerlist);
  2120. /* Remove far-too-old members of routerlist->old_routers. */
  2121. cutoff = now - OLD_ROUTER_DESC_MAX_AGE;
  2122. for (i = 0; i < smartlist_len(routerlist->old_routers); ++i) {
  2123. sd = smartlist_get(routerlist->old_routers, i);
  2124. if (sd->published_on <= cutoff &&
  2125. !digestmap_get(retain, sd->signed_descriptor_digest)) {
  2126. /* Too old. Remove it. */
  2127. routerlist_remove_old(routerlist, sd, i--);
  2128. }
  2129. }
  2130. routerlist_assert_ok(routerlist);
  2131. /* Now we might have to look at routerlist->old_routers for extraneous
  2132. * members. (We'd keep all the members if we could, but we need to save
  2133. * space.) First, check whether we have too many router descriptors, total.
  2134. * We're okay with having too many for some given router, so long as the
  2135. * total number doesn't approach max_descriptors_per_router()*len(router).
  2136. */
  2137. if (smartlist_len(routerlist->old_routers) <
  2138. smartlist_len(routerlist->routers) * (max_descriptors_per_router() - 1))
  2139. goto done;
  2140. smartlist_sort(routerlist->old_routers, _compare_old_routers_by_identity);
  2141. /* Iterate through the list from back to front, so when we remove descriptors
  2142. * we don't mess up groups we haven't gotten to. */
  2143. for (i = smartlist_len(routerlist->old_routers)-1; i >= 0; --i) {
  2144. signed_descriptor_t *r = smartlist_get(routerlist->old_routers, i);
  2145. if (!cur_id) {
  2146. cur_id = r->identity_digest;
  2147. hi = i;
  2148. }
  2149. if (memcmp(cur_id, r->identity_digest, DIGEST_LEN)) {
  2150. routerlist_remove_old_cached_routers_with_id(cutoff, i+1, hi, retain);
  2151. cur_id = r->identity_digest;
  2152. hi = i;
  2153. }
  2154. }
  2155. if (hi>=0)
  2156. routerlist_remove_old_cached_routers_with_id(cutoff, 0, hi, retain);
  2157. routerlist_assert_ok(routerlist);
  2158. done:
  2159. digestmap_free(retain, NULL);
  2160. }
  2161. /**
  2162. * Code to parse a single router descriptor and insert it into the
  2163. * routerlist. Return -1 if the descriptor was ill-formed; 0 if the
  2164. * descriptor was well-formed but could not be added; and 1 if the
  2165. * descriptor was added.
  2166. *
  2167. * If we don't add it and <b>msg</b> is not NULL, then assign to
  2168. * *<b>msg</b> a static string describing the reason for refusing the
  2169. * descriptor.
  2170. *
  2171. * This is used only by the controller.
  2172. */
  2173. int
  2174. router_load_single_router(const char *s, uint8_t purpose, const char **msg)
  2175. {
  2176. routerinfo_t *ri;
  2177. int r;
  2178. smartlist_t *lst;
  2179. tor_assert(msg);
  2180. *msg = NULL;
  2181. if (!(ri = router_parse_entry_from_string(s, NULL, 1))) {
  2182. log_warn(LD_DIR, "Error parsing router descriptor; dropping.");
  2183. *msg = "Couldn't parse router descriptor.";
  2184. return -1;
  2185. }
  2186. ri->purpose = purpose;
  2187. if (router_is_me(ri)) {
  2188. log_warn(LD_DIR, "Router's identity key matches mine; dropping.");
  2189. *msg = "Router's identity key matches mine.";
  2190. routerinfo_free(ri);
  2191. return 0;
  2192. }
  2193. lst = smartlist_create();
  2194. smartlist_add(lst, ri);
  2195. routers_update_status_from_networkstatus(lst, 0);
  2196. if ((r=router_add_to_routerlist(ri, msg, 0, 0))<0) {
  2197. /* we've already assigned to *msg now, and ri is already freed */
  2198. tor_assert(*msg);
  2199. if (r < -1)
  2200. log_warn(LD_DIR, "Couldn't add router to list: %s Dropping.", *msg);
  2201. smartlist_free(lst);
  2202. return 0;
  2203. } else {
  2204. control_event_descriptors_changed(lst);
  2205. smartlist_free(lst);
  2206. log_debug(LD_DIR, "Added router to list");
  2207. return 1;
  2208. }
  2209. }
  2210. /** Given a string <b>s</b> containing some routerdescs, parse it and put the
  2211. * routers into our directory. If saved_location is SAVED_NOWHERE, the routers
  2212. * are in response to a query to the network: cache them by adding them to
  2213. * the journal.
  2214. *
  2215. * If <b>requested_fingerprints</b> is provided, it must contain a list of
  2216. * uppercased identity fingerprints. Do not update any router whose
  2217. * fingerprint is not on the list; after updating a router, remove its
  2218. * fingerprint from the list.
  2219. */
  2220. void
  2221. router_load_routers_from_string(const char *s, saved_location_t saved_location,
  2222. smartlist_t *requested_fingerprints)
  2223. {
  2224. smartlist_t *routers = smartlist_create(), *changed = smartlist_create();
  2225. char fp[HEX_DIGEST_LEN+1];
  2226. const char *msg;
  2227. int from_cache = (saved_location != SAVED_NOWHERE);
  2228. router_parse_list_from_string(&s, routers, saved_location);
  2229. routers_update_status_from_networkstatus(routers, !from_cache);
  2230. log_info(LD_DIR, "%d elements to add", smartlist_len(routers));
  2231. SMARTLIST_FOREACH(routers, routerinfo_t *, ri,
  2232. {
  2233. base16_encode(fp, sizeof(fp), ri->cache_info.signed_descriptor_digest,
  2234. DIGEST_LEN);
  2235. if (requested_fingerprints) {
  2236. if (smartlist_string_isin(requested_fingerprints, fp)) {
  2237. smartlist_string_remove(requested_fingerprints, fp);
  2238. } else {
  2239. char *requested =
  2240. smartlist_join_strings(requested_fingerprints," ",0,NULL);
  2241. log_warn(LD_DIR,
  2242. "We received a router descriptor with a fingerprint (%s) "
  2243. "that we never requested. (We asked for: %s.) Dropping.",
  2244. fp, requested);
  2245. tor_free(requested);
  2246. routerinfo_free(ri);
  2247. continue;
  2248. }
  2249. }
  2250. if (router_add_to_routerlist(ri, &msg, from_cache, !from_cache) >= 0)
  2251. smartlist_add(changed, ri);
  2252. });
  2253. if (smartlist_len(changed))
  2254. control_event_descriptors_changed(changed);
  2255. routerlist_assert_ok(routerlist);
  2256. router_rebuild_store(0);
  2257. smartlist_free(routers);
  2258. smartlist_free(changed);
  2259. }
  2260. /** Helper: return a newly allocated string containing the name of the filename
  2261. * where we plan to cache the network status with the given identity digest. */
  2262. char *
  2263. networkstatus_get_cache_filename(const char *identity_digest)
  2264. {
  2265. const char *datadir = get_options()->DataDirectory;
  2266. size_t len = strlen(datadir)+64;
  2267. char fp[HEX_DIGEST_LEN+1];
  2268. char *fn = tor_malloc(len+1);
  2269. base16_encode(fp, HEX_DIGEST_LEN+1, identity_digest, DIGEST_LEN);
  2270. tor_snprintf(fn, len, "%s"PATH_SEPARATOR"cached-status"PATH_SEPARATOR"%s",
  2271. datadir,fp);
  2272. return fn;
  2273. }
  2274. /** Helper for smartlist_sort: Compare two networkstatus objects by
  2275. * publication date. */
  2276. static int
  2277. _compare_networkstatus_published_on(const void **_a, const void **_b)
  2278. {
  2279. const networkstatus_t *a = *_a, *b = *_b;
  2280. if (a->published_on < b->published_on)
  2281. return -1;
  2282. else if (a->published_on > b->published_on)
  2283. return 1;
  2284. else
  2285. return 0;
  2286. }
  2287. /** Add the parsed neworkstatus in <b>ns</b> (with original document in
  2288. * <b>s</b> to the disk cache (and the in-memory directory server cache) as
  2289. * appropriate. */
  2290. static int
  2291. add_networkstatus_to_cache(const char *s,
  2292. networkstatus_source_t source,
  2293. networkstatus_t *ns)
  2294. {
  2295. if (source != NS_FROM_CACHE) {
  2296. char *fn = networkstatus_get_cache_filename(ns->identity_digest);
  2297. if (write_str_to_file(fn, s, 0)<0) {
  2298. log_notice(LD_FS, "Couldn't write cached network status to \"%s\"", fn);
  2299. }
  2300. tor_free(fn);
  2301. }
  2302. if (get_options()->DirPort)
  2303. dirserv_set_cached_networkstatus_v2(s,
  2304. ns->identity_digest,
  2305. ns->published_on);
  2306. return 0;
  2307. }
  2308. /** How far in the future do we allow a network-status to get before removing
  2309. * it? (seconds) */
  2310. #define NETWORKSTATUS_ALLOW_SKEW (24*60*60)
  2311. /** Given a string <b>s</b> containing a network status that we received at
  2312. * <b>arrived_at</b> from <b>source</b>, try to parse it, see if we want to
  2313. * store it, and put it into our cache as necessary.
  2314. *
  2315. * If <b>source</b> is NS_FROM_DIR or NS_FROM_CACHE, do not replace our
  2316. * own networkstatus_t (if we're an authoritative directory server).
  2317. *
  2318. * If <b>source</b> is NS_FROM_CACHE, do not write our networkstatus_t to the
  2319. * cache.
  2320. *
  2321. * If <b>requested_fingerprints</b> is provided, it must contain a list of
  2322. * uppercased identity fingerprints. Do not update any networkstatus whose
  2323. * fingerprint is not on the list; after updating a networkstatus, remove its
  2324. * fingerprint from the list.
  2325. *
  2326. * Return 0 on success, -1 on failure.
  2327. *
  2328. * Callers should make sure that routers_update_all_from_networkstatus() is
  2329. * invoked after this function succeeds.
  2330. */
  2331. int
  2332. router_set_networkstatus(const char *s, time_t arrived_at,
  2333. networkstatus_source_t source, smartlist_t *requested_fingerprints)
  2334. {
  2335. networkstatus_t *ns;
  2336. int i, found;
  2337. time_t now;
  2338. int skewed = 0;
  2339. trusted_dir_server_t *trusted_dir = NULL;
  2340. const char *source_desc = NULL;
  2341. char fp[HEX_DIGEST_LEN+1];
  2342. char published[ISO_TIME_LEN+1];
  2343. ns = networkstatus_parse_from_string(s);
  2344. if (!ns) {
  2345. log_warn(LD_DIR, "Couldn't parse network status.");
  2346. return -1;
  2347. }
  2348. base16_encode(fp, HEX_DIGEST_LEN+1, ns->identity_digest, DIGEST_LEN);
  2349. if (!(trusted_dir =
  2350. router_get_trusteddirserver_by_digest(ns->identity_digest)) ||
  2351. !trusted_dir->is_v2_authority) {
  2352. log_info(LD_DIR, "Network status was signed, but not by an authoritative "
  2353. "directory we recognize.");
  2354. if (!get_options()->DirPort) {
  2355. networkstatus_free(ns);
  2356. return 0;
  2357. }
  2358. source_desc = fp;
  2359. } else {
  2360. source_desc = trusted_dir->description;
  2361. }
  2362. now = time(NULL);
  2363. if (arrived_at > now)
  2364. arrived_at = now;
  2365. ns->received_on = arrived_at;
  2366. format_iso_time(published, ns->published_on);
  2367. if (ns->published_on > now + NETWORKSTATUS_ALLOW_SKEW) {
  2368. log_warn(LD_GENERAL, "Network status from %s was published in the future "
  2369. "(%s GMT). Somebody is skewed here: check your clock. "
  2370. "Not caching.",
  2371. source_desc, published);
  2372. control_event_general_status(LOG_WARN,
  2373. "CLOCK_SKEW SOURCE=NETWORKSTATUS:%s:%d",
  2374. ns->source_address, ns->source_dirport);
  2375. skewed = 1;
  2376. }
  2377. if (!networkstatus_list)
  2378. networkstatus_list = smartlist_create();
  2379. if ( (source == NS_FROM_DIR_BY_FP || source == NS_FROM_DIR_ALL) &&
  2380. router_digest_is_me(ns->identity_digest)) {
  2381. /* Don't replace our own networkstatus when we get it from somebody else.*/
  2382. networkstatus_free(ns);
  2383. return 0;
  2384. }
  2385. if (requested_fingerprints) {
  2386. if (smartlist_string_isin(requested_fingerprints, fp)) {
  2387. smartlist_string_remove(requested_fingerprints, fp);
  2388. } else {
  2389. if (source != NS_FROM_DIR_ALL) {
  2390. char *requested =
  2391. smartlist_join_strings(requested_fingerprints," ",0,NULL);
  2392. log_warn(LD_DIR,
  2393. "We received a network status with a fingerprint (%s) that we "
  2394. "never requested. (We asked for: %s.) Dropping.",
  2395. fp, requested);
  2396. tor_free(requested);
  2397. return 0;
  2398. }
  2399. }
  2400. }
  2401. if (!trusted_dir) {
  2402. if (!skewed && get_options()->DirPort) {
  2403. /* We got a non-trusted networkstatus, and we're a directory cache.
  2404. * This means that we asked an authority, and it told us about another
  2405. * authority we didn't recognize. */
  2406. log_info(LD_DIR,
  2407. "We do not recognize authority (%s) but we are willing "
  2408. "to cache it", fp);
  2409. add_networkstatus_to_cache(s, source, ns);
  2410. networkstatus_free(ns);
  2411. }
  2412. return 0;
  2413. }
  2414. if (source != NS_FROM_CACHE && trusted_dir)
  2415. trusted_dir->n_networkstatus_failures = 0;
  2416. found = 0;
  2417. for (i=0; i < smartlist_len(networkstatus_list); ++i) {
  2418. networkstatus_t *old_ns = smartlist_get(networkstatus_list, i);
  2419. if (!memcmp(old_ns->identity_digest, ns->identity_digest, DIGEST_LEN)) {
  2420. if (!memcmp(old_ns->networkstatus_digest,
  2421. ns->networkstatus_digest, DIGEST_LEN)) {
  2422. /* Same one we had before. */
  2423. networkstatus_free(ns);
  2424. log_info(LD_DIR,
  2425. "Not replacing network-status from %s (published %s); "
  2426. "we already have it.",
  2427. trusted_dir->description, published);
  2428. if (old_ns->received_on < arrived_at) {
  2429. if (source != NS_FROM_CACHE) {
  2430. char *fn;
  2431. fn = networkstatus_get_cache_filename(old_ns->identity_digest);
  2432. /* We use mtime to tell when it arrived, so update that. */
  2433. touch_file(fn);
  2434. tor_free(fn);
  2435. }
  2436. old_ns->received_on = arrived_at;
  2437. }
  2438. return 0;
  2439. } else if (old_ns->published_on >= ns->published_on) {
  2440. char old_published[ISO_TIME_LEN+1];
  2441. format_iso_time(old_published, old_ns->published_on);
  2442. log_info(LD_DIR,
  2443. "Not replacing network-status from %s (published %s);"
  2444. " we have a newer one (published %s) for this authority.",
  2445. trusted_dir->description, published,
  2446. old_published);
  2447. networkstatus_free(ns);
  2448. return 0;
  2449. } else {
  2450. networkstatus_free(old_ns);
  2451. smartlist_set(networkstatus_list, i, ns);
  2452. found = 1;
  2453. break;
  2454. }
  2455. }
  2456. }
  2457. if (!found)
  2458. smartlist_add(networkstatus_list, ns);
  2459. SMARTLIST_FOREACH(ns->entries, routerstatus_t *, rs,
  2460. {
  2461. if (!router_get_by_descriptor_digest(rs->descriptor_digest))
  2462. rs->need_to_mirror = 1;
  2463. });
  2464. log_info(LD_DIR, "Setting networkstatus %s %s (published %s)",
  2465. source == NS_FROM_CACHE?"cached from":
  2466. ((source == NS_FROM_DIR_BY_FP || source == NS_FROM_DIR_ALL) ?
  2467. "downloaded from":"generated for"),
  2468. trusted_dir->description, published);
  2469. networkstatus_list_has_changed = 1;
  2470. router_dir_info_changed();
  2471. smartlist_sort(networkstatus_list, _compare_networkstatus_published_on);
  2472. if (!skewed)
  2473. add_networkstatus_to_cache(s, source, ns);
  2474. networkstatus_list_update_recent(now);
  2475. return 0;
  2476. }
  2477. /** How old do we allow a network-status to get before removing it
  2478. * completely? */
  2479. #define MAX_NETWORKSTATUS_AGE (10*24*60*60)
  2480. /** Remove all very-old network_status_t objects from memory and from the
  2481. * disk cache. */
  2482. void
  2483. networkstatus_list_clean(time_t now)
  2484. {
  2485. int i;
  2486. if (!networkstatus_list)
  2487. return;
  2488. for (i = 0; i < smartlist_len(networkstatus_list); ++i) {
  2489. networkstatus_t *ns = smartlist_get(networkstatus_list, i);
  2490. char *fname = NULL;
  2491. if (ns->published_on + MAX_NETWORKSTATUS_AGE > now)
  2492. continue;
  2493. /* Okay, this one is too old. Remove it from the list, and delete it
  2494. * from the cache. */
  2495. smartlist_del(networkstatus_list, i--);
  2496. fname = networkstatus_get_cache_filename(ns->identity_digest);
  2497. if (file_status(fname) == FN_FILE) {
  2498. log_info(LD_DIR, "Removing too-old networkstatus in %s", fname);
  2499. unlink(fname);
  2500. }
  2501. tor_free(fname);
  2502. if (get_options()->DirPort) {
  2503. dirserv_set_cached_networkstatus_v2(NULL, ns->identity_digest, 0);
  2504. }
  2505. networkstatus_free(ns);
  2506. router_dir_info_changed();
  2507. }
  2508. /* And now go through the directory cache for any cached untrusted
  2509. * networkstatuses and other network info. */
  2510. dirserv_clear_old_networkstatuses(now - MAX_NETWORKSTATUS_AGE);
  2511. dirserv_clear_old_v1_info(now);
  2512. }
  2513. /** Helper for bsearching a list of routerstatus_t pointers.*/
  2514. static int
  2515. _compare_digest_to_routerstatus_entry(const void *_key, const void **_member)
  2516. {
  2517. const char *key = _key;
  2518. const routerstatus_t *rs = *_member;
  2519. return memcmp(key, rs->identity_digest, DIGEST_LEN);
  2520. }
  2521. /** Return the entry in <b>ns</b> for the identity digest <b>digest</b>, or
  2522. * NULL if none was found. */
  2523. static routerstatus_t *
  2524. networkstatus_find_entry(networkstatus_t *ns, const char *digest)
  2525. {
  2526. return smartlist_bsearch(ns->entries, digest,
  2527. _compare_digest_to_routerstatus_entry);
  2528. }
  2529. /** Return the consensus view of the status of the router whose digest is
  2530. * <b>digest</b>, or NULL if we don't know about any such router. */
  2531. local_routerstatus_t *
  2532. router_get_combined_status_by_digest(const char *digest)
  2533. {
  2534. if (!routerstatus_list)
  2535. return NULL;
  2536. return smartlist_bsearch(routerstatus_list, digest,
  2537. _compare_digest_to_routerstatus_entry);
  2538. }
  2539. /** Given a nickname (possibly verbose, possibly a hexadecimal digest), return
  2540. * the corresponding local_routerstatus_t, or NULL if none exists. Warn the
  2541. * user if <b>warn_if_unnamed</b> is set, and they have specified a router by
  2542. * nickname, but the Named flag isn't set for that router. */
  2543. static local_routerstatus_t *
  2544. router_get_combined_status_by_nickname(const char *nickname,
  2545. int warn_if_unnamed)
  2546. {
  2547. char digest[DIGEST_LEN];
  2548. local_routerstatus_t *best=NULL;
  2549. smartlist_t *matches=NULL;
  2550. if (!routerstatus_list || !nickname)
  2551. return NULL;
  2552. if (nickname[0] == '$') {
  2553. if (base16_decode(digest, DIGEST_LEN, nickname+1, strlen(nickname))<0)
  2554. return NULL;
  2555. return router_get_combined_status_by_digest(digest);
  2556. } else if (strlen(nickname) == HEX_DIGEST_LEN &&
  2557. (base16_decode(digest, DIGEST_LEN, nickname+1, strlen(nickname))==0)) {
  2558. return router_get_combined_status_by_digest(digest);
  2559. }
  2560. matches = smartlist_create();
  2561. SMARTLIST_FOREACH(routerstatus_list, local_routerstatus_t *, lrs,
  2562. {
  2563. if (!strcasecmp(lrs->status.nickname, nickname)) {
  2564. if (lrs->status.is_named) {
  2565. smartlist_free(matches);
  2566. return lrs;
  2567. } else {
  2568. smartlist_add(matches, lrs);
  2569. best = lrs;
  2570. }
  2571. }
  2572. });
  2573. if (smartlist_len(matches)>1 && warn_if_unnamed) {
  2574. int any_unwarned=0;
  2575. SMARTLIST_FOREACH(matches, local_routerstatus_t *, lrs,
  2576. {
  2577. if (! lrs->name_lookup_warned) {
  2578. lrs->name_lookup_warned=1;
  2579. any_unwarned=1;
  2580. }
  2581. });
  2582. if (any_unwarned) {
  2583. log_warn(LD_CONFIG,"There are multiple matches for the nickname \"%s\","
  2584. " but none is listed as named by the directory authorites. "
  2585. "Choosing one arbitrarily.", nickname);
  2586. }
  2587. } else if (warn_if_unnamed && best && !best->name_lookup_warned) {
  2588. char fp[HEX_DIGEST_LEN+1];
  2589. base16_encode(fp, sizeof(fp),
  2590. best->status.identity_digest, DIGEST_LEN);
  2591. log_warn(LD_CONFIG,
  2592. "When looking up a status, you specified a server \"%s\" by name, "
  2593. "but the directory authorities do not have any key registered for "
  2594. "this nickname -- so it could be used by any server, "
  2595. "not just the one you meant. "
  2596. "To make sure you get the same server in the future, refer to "
  2597. "it by key, as \"$%s\".", nickname, fp);
  2598. best->name_lookup_warned = 1;
  2599. }
  2600. smartlist_free(matches);
  2601. return best;
  2602. }
  2603. /** Find a routerstatus_t that corresponds to <b>hexdigest</b>, if
  2604. * any. Prefer ones that belong to authorities. */
  2605. routerstatus_t *
  2606. routerstatus_get_by_hexdigest(const char *hexdigest)
  2607. {
  2608. char digest[DIGEST_LEN];
  2609. local_routerstatus_t *rs;
  2610. trusted_dir_server_t *ds;
  2611. if (strlen(hexdigest) < HEX_DIGEST_LEN ||
  2612. base16_decode(digest,DIGEST_LEN,hexdigest,HEX_DIGEST_LEN) < 0)
  2613. return NULL;
  2614. if ((ds = router_get_trusteddirserver_by_digest(digest)))
  2615. return &(ds->fake_status.status);
  2616. if ((rs = router_get_combined_status_by_digest(digest)))
  2617. return &(rs->status);
  2618. return NULL;
  2619. }
  2620. /** Return true iff any networkstatus includes a descriptor whose digest
  2621. * is that of <b>desc</b>. */
  2622. static int
  2623. signed_desc_digest_is_recognized(signed_descriptor_t *desc)
  2624. {
  2625. routerstatus_t *rs;
  2626. if (!networkstatus_list)
  2627. return 0;
  2628. SMARTLIST_FOREACH(networkstatus_list, networkstatus_t *, ns,
  2629. {
  2630. if (!(rs = networkstatus_find_entry(ns, desc->identity_digest)))
  2631. continue;
  2632. if (!memcmp(rs->descriptor_digest,
  2633. desc->signed_descriptor_digest, DIGEST_LEN))
  2634. return 1;
  2635. });
  2636. return 0;
  2637. }
  2638. /** How frequently do directory authorities re-download fresh networkstatus
  2639. * documents? */
  2640. #define AUTHORITY_NS_CACHE_INTERVAL (5*60)
  2641. /** How frequently do non-authority directory caches re-download fresh
  2642. * networkstatus documents? */
  2643. #define NONAUTHORITY_NS_CACHE_INTERVAL (15*60)
  2644. /** We are a directory server, and so cache network_status documents.
  2645. * Initiate downloads as needed to update them. For authorities, this means
  2646. * asking each trusted directory for its network-status. For caches, this
  2647. * means asking a random authority for all network-statuses.
  2648. */
  2649. static void
  2650. update_networkstatus_cache_downloads(time_t now)
  2651. {
  2652. int authority = authdir_mode(get_options());
  2653. int interval =
  2654. authority ? AUTHORITY_NS_CACHE_INTERVAL : NONAUTHORITY_NS_CACHE_INTERVAL;
  2655. if (last_networkstatus_download_attempted + interval >= now)
  2656. return;
  2657. if (!trusted_dir_servers)
  2658. return;
  2659. last_networkstatus_download_attempted = now;
  2660. if (authority) {
  2661. /* An authority launches a separate connection for everybody. */
  2662. SMARTLIST_FOREACH(trusted_dir_servers, trusted_dir_server_t *, ds,
  2663. {
  2664. char resource[HEX_DIGEST_LEN+6]; /* fp/hexdigit.z\0 */
  2665. if (!ds->is_v2_authority)
  2666. continue;
  2667. if (router_digest_is_me(ds->digest))
  2668. continue;
  2669. if (connection_get_by_type_addr_port_purpose(
  2670. CONN_TYPE_DIR, ds->addr, ds->dir_port,
  2671. DIR_PURPOSE_FETCH_NETWORKSTATUS)) {
  2672. /* We are already fetching this one. */
  2673. continue;
  2674. }
  2675. strlcpy(resource, "fp/", sizeof(resource));
  2676. base16_encode(resource+3, sizeof(resource)-3, ds->digest, DIGEST_LEN);
  2677. strlcat(resource, ".z", sizeof(resource));
  2678. directory_initiate_command_routerstatus(
  2679. &ds->fake_status.status, DIR_PURPOSE_FETCH_NETWORKSTATUS,
  2680. 0, /* Not private */
  2681. resource,
  2682. NULL, 0 /* No payload. */);
  2683. });
  2684. } else {
  2685. /* A non-authority cache launches one connection to a random authority. */
  2686. /* (Check whether we're currently fetching network-status objects.) */
  2687. if (!connection_get_by_type_purpose(CONN_TYPE_DIR,
  2688. DIR_PURPOSE_FETCH_NETWORKSTATUS))
  2689. directory_get_from_dirserver(DIR_PURPOSE_FETCH_NETWORKSTATUS,"all.z",1);
  2690. }
  2691. }
  2692. /** How long (in seconds) does a client wait after getting a network status
  2693. * before downloading the next in sequence? */
  2694. #define NETWORKSTATUS_CLIENT_DL_INTERVAL (30*60)
  2695. /** How many times do we allow a networkstatus download to fail before we
  2696. * assume that the authority isn't publishing? */
  2697. #define NETWORKSTATUS_N_ALLOWABLE_FAILURES 3
  2698. /** We are not a directory cache or authority. Update our network-status list
  2699. * by launching a new directory fetch for enough network-status documents "as
  2700. * necessary". See function comments for implementation details.
  2701. */
  2702. static void
  2703. update_networkstatus_client_downloads(time_t now)
  2704. {
  2705. int n_live = 0, n_dirservers, n_running_dirservers, needed = 0;
  2706. int fetch_latest = 0;
  2707. int most_recent_idx = -1;
  2708. trusted_dir_server_t *most_recent = NULL;
  2709. time_t most_recent_received = 0;
  2710. char *resource, *cp;
  2711. size_t resource_len;
  2712. smartlist_t *missing;
  2713. if (connection_get_by_type_purpose(CONN_TYPE_DIR,
  2714. DIR_PURPOSE_FETCH_NETWORKSTATUS))
  2715. return;
  2716. /* This is a little tricky. We want to download enough network-status
  2717. * objects so that we have all of them under
  2718. * NETWORKSTATUS_MAX_AGE publication time. We want to download a new
  2719. * *one* if the most recent one's publication time is under
  2720. * NETWORKSTATUS_CLIENT_DL_INTERVAL.
  2721. */
  2722. if (!get_n_v2_authorities())
  2723. return;
  2724. n_dirservers = n_running_dirservers = 0;
  2725. missing = smartlist_create();
  2726. SMARTLIST_FOREACH(trusted_dir_servers, trusted_dir_server_t *, ds,
  2727. {
  2728. networkstatus_t *ns = networkstatus_get_by_digest(ds->digest);
  2729. if (!ds->is_v2_authority)
  2730. continue;
  2731. ++n_dirservers;
  2732. if (ds->n_networkstatus_failures > NETWORKSTATUS_N_ALLOWABLE_FAILURES)
  2733. continue;
  2734. ++n_running_dirservers;
  2735. if (ns && ns->published_on > now-NETWORKSTATUS_MAX_AGE)
  2736. ++n_live;
  2737. else
  2738. smartlist_add(missing, ds->digest);
  2739. if (ns && (!most_recent || ns->received_on > most_recent_received)) {
  2740. most_recent_idx = ds_sl_idx; /* magic variable from FOREACH */
  2741. most_recent = ds;
  2742. most_recent_received = ns->received_on;
  2743. }
  2744. });
  2745. /* Also, download at least 1 every NETWORKSTATUS_CLIENT_DL_INTERVAL. */
  2746. if (!smartlist_len(missing) &&
  2747. most_recent_received < now-NETWORKSTATUS_CLIENT_DL_INTERVAL) {
  2748. log_info(LD_DIR, "Our most recent network-status document (from %s) "
  2749. "is %d seconds old; downloading another.",
  2750. most_recent?most_recent->description:"nobody",
  2751. (int)(now-most_recent_received));
  2752. fetch_latest = 1;
  2753. needed = 1;
  2754. } else if (smartlist_len(missing)) {
  2755. log_info(LD_DIR, "For %d/%d running directory servers, we have %d live"
  2756. " network-status documents. Downloading %d.",
  2757. n_running_dirservers, n_dirservers, n_live,
  2758. smartlist_len(missing));
  2759. needed = smartlist_len(missing);
  2760. } else {
  2761. smartlist_free(missing);
  2762. return;
  2763. }
  2764. /* If no networkstatus was found, choose a dirserver at random as "most
  2765. * recent". */
  2766. if (most_recent_idx<0)
  2767. most_recent_idx = crypto_rand_int(n_dirservers);
  2768. if (fetch_latest) {
  2769. int i;
  2770. int n_failed = 0;
  2771. for (i = most_recent_idx + 1; 1; ++i) {
  2772. trusted_dir_server_t *ds;
  2773. if (i >= n_dirservers)
  2774. i = 0;
  2775. ds = smartlist_get(trusted_dir_servers, i);
  2776. if (! ds->is_v2_authority)
  2777. continue;
  2778. if (n_failed < n_dirservers &&
  2779. ds->n_networkstatus_failures > NETWORKSTATUS_N_ALLOWABLE_FAILURES) {
  2780. ++n_failed;
  2781. continue;
  2782. }
  2783. smartlist_add(missing, ds->digest);
  2784. break;
  2785. }
  2786. }
  2787. /* Build a request string for all the resources we want. */
  2788. resource_len = smartlist_len(missing) * (HEX_DIGEST_LEN+1) + 6;
  2789. resource = tor_malloc(resource_len);
  2790. memcpy(resource, "fp/", 3);
  2791. cp = resource+3;
  2792. smartlist_sort_digests(missing);
  2793. needed = smartlist_len(missing);
  2794. SMARTLIST_FOREACH(missing, const char *, d,
  2795. {
  2796. base16_encode(cp, HEX_DIGEST_LEN+1, d, DIGEST_LEN);
  2797. cp += HEX_DIGEST_LEN;
  2798. --needed;
  2799. if (needed)
  2800. *cp++ = '+';
  2801. });
  2802. memcpy(cp, ".z", 3);
  2803. directory_get_from_dirserver(DIR_PURPOSE_FETCH_NETWORKSTATUS, resource, 1);
  2804. tor_free(resource);
  2805. smartlist_free(missing);
  2806. }
  2807. /** Launch requests for networkstatus documents as appropriate. */
  2808. void
  2809. update_networkstatus_downloads(time_t now)
  2810. {
  2811. or_options_t *options = get_options();
  2812. if (options->DirPort)
  2813. update_networkstatus_cache_downloads(now);
  2814. else
  2815. update_networkstatus_client_downloads(now);
  2816. }
  2817. /** Return 1 if all running sufficiently-stable routers will reject
  2818. * addr:port, return 0 if any might accept it. */
  2819. int
  2820. router_exit_policy_all_routers_reject(uint32_t addr, uint16_t port,
  2821. int need_uptime)
  2822. {
  2823. addr_policy_result_t r;
  2824. if (!routerlist) return 1;
  2825. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, router,
  2826. {
  2827. if (router->is_running &&
  2828. !router_is_unreliable(router, need_uptime, 0, 0)) {
  2829. r = compare_addr_to_addr_policy(addr, port, router->exit_policy);
  2830. if (r != ADDR_POLICY_REJECTED && r != ADDR_POLICY_PROBABLY_REJECTED)
  2831. return 0; /* this one could be ok. good enough. */
  2832. }
  2833. });
  2834. return 1; /* all will reject. */
  2835. }
  2836. /** Return true iff <b>router</b> does not permit exit streams.
  2837. */
  2838. int
  2839. router_exit_policy_rejects_all(routerinfo_t *router)
  2840. {
  2841. return compare_addr_to_addr_policy(0, 0, router->exit_policy)
  2842. == ADDR_POLICY_REJECTED;
  2843. }
  2844. /** Add to the list of authorized directory servers one at
  2845. * <b>address</b>:<b>port</b>, with identity key <b>digest</b>. If
  2846. * <b>address</b> is NULL, add ourself. */
  2847. void
  2848. add_trusted_dir_server(const char *nickname, const char *address,
  2849. uint16_t dir_port, uint16_t or_port,
  2850. const char *digest, int is_v1_authority,
  2851. int is_v2_authority, int is_hidserv_authority)
  2852. {
  2853. trusted_dir_server_t *ent;
  2854. uint32_t a;
  2855. char *hostname = NULL;
  2856. size_t dlen;
  2857. if (!trusted_dir_servers)
  2858. trusted_dir_servers = smartlist_create();
  2859. if (!address) { /* The address is us; we should guess. */
  2860. if (resolve_my_address(LOG_WARN, get_options(), &a, &hostname) < 0) {
  2861. log_warn(LD_CONFIG,
  2862. "Couldn't find a suitable address when adding ourself as a "
  2863. "trusted directory server.");
  2864. return;
  2865. }
  2866. } else {
  2867. if (tor_lookup_hostname(address, &a)) {
  2868. log_warn(LD_CONFIG,
  2869. "Unable to lookup address for directory server at '%s'",
  2870. address);
  2871. return;
  2872. }
  2873. hostname = tor_strdup(address);
  2874. a = ntohl(a);
  2875. }
  2876. ent = tor_malloc_zero(sizeof(trusted_dir_server_t));
  2877. ent->nickname = nickname ? tor_strdup(nickname) : NULL;
  2878. ent->address = hostname;
  2879. ent->addr = a;
  2880. ent->dir_port = dir_port;
  2881. ent->or_port = or_port;
  2882. ent->is_running = 1;
  2883. ent->is_v1_authority = is_v1_authority;
  2884. ent->is_v2_authority = is_v2_authority;
  2885. ent->is_hidserv_authority = is_hidserv_authority;
  2886. memcpy(ent->digest, digest, DIGEST_LEN);
  2887. dlen = 64 + strlen(hostname) + (nickname?strlen(nickname):0);
  2888. ent->description = tor_malloc(dlen);
  2889. if (nickname)
  2890. tor_snprintf(ent->description, dlen, "directory server \"%s\" at %s:%d",
  2891. nickname, hostname, (int)dir_port);
  2892. else
  2893. tor_snprintf(ent->description, dlen, "directory server at %s:%d",
  2894. hostname, (int)dir_port);
  2895. ent->fake_status.status.addr = ent->addr;
  2896. memcpy(ent->fake_status.status.identity_digest, digest, DIGEST_LEN);
  2897. if (nickname)
  2898. strlcpy(ent->fake_status.status.nickname, nickname,
  2899. sizeof(ent->fake_status.status.nickname));
  2900. else
  2901. ent->fake_status.status.nickname[0] = '\0';
  2902. ent->fake_status.status.dir_port = ent->dir_port;
  2903. ent->fake_status.status.or_port = ent->or_port;
  2904. if (ent->or_port)
  2905. ent->fake_status.status.version_supports_begindir = 1;
  2906. smartlist_add(trusted_dir_servers, ent);
  2907. router_dir_info_changed();
  2908. }
  2909. /** Free storage held in <b>ds</b> */
  2910. static void
  2911. trusted_dir_server_free(trusted_dir_server_t *ds)
  2912. {
  2913. tor_free(ds->nickname);
  2914. tor_free(ds->description);
  2915. tor_free(ds->address);
  2916. tor_free(ds);
  2917. }
  2918. /** Remove all members from the list of trusted dir servers. */
  2919. void
  2920. clear_trusted_dir_servers(void)
  2921. {
  2922. if (trusted_dir_servers) {
  2923. SMARTLIST_FOREACH(trusted_dir_servers, trusted_dir_server_t *, ent,
  2924. trusted_dir_server_free(ent));
  2925. smartlist_clear(trusted_dir_servers);
  2926. } else {
  2927. trusted_dir_servers = smartlist_create();
  2928. }
  2929. router_dir_info_changed();
  2930. }
  2931. /** Return 1 if any trusted dir server supports v1 directories,
  2932. * else return 0. */
  2933. int
  2934. any_trusted_dir_is_v1_authority(void)
  2935. {
  2936. if (trusted_dir_servers)
  2937. SMARTLIST_FOREACH(trusted_dir_servers, trusted_dir_server_t *, ent,
  2938. if (ent->is_v1_authority) return 1);
  2939. return 0;
  2940. }
  2941. /** Return the network status with a given identity digest. */
  2942. networkstatus_t *
  2943. networkstatus_get_by_digest(const char *digest)
  2944. {
  2945. SMARTLIST_FOREACH(networkstatus_list, networkstatus_t *, ns,
  2946. {
  2947. if (!memcmp(ns->identity_digest, digest, DIGEST_LEN))
  2948. return ns;
  2949. });
  2950. return NULL;
  2951. }
  2952. /** We believe networkstatuses more recent than this when they tell us that
  2953. * our server is broken, invalid, obsolete, etc. */
  2954. #define SELF_OPINION_INTERVAL (90*60)
  2955. /** Result of checking whether a version is recommended. */
  2956. typedef struct combined_version_status_t {
  2957. /** How many networkstatuses claim to know about versions? */
  2958. int n_versioning;
  2959. /** What do the majority of networkstatuses believe about this version? */
  2960. version_status_t consensus;
  2961. /** How many networkstatuses constitute the majority? */
  2962. int n_concurring;
  2963. } combined_version_status_t;
  2964. /** Return a string naming the versions of Tor recommended by
  2965. * more than half the versioning networkstatuses. */
  2966. static char *
  2967. compute_recommended_versions(time_t now, int client,
  2968. const char *my_version,
  2969. combined_version_status_t *status_out)
  2970. {
  2971. int n_seen;
  2972. char *current;
  2973. smartlist_t *combined, *recommended;
  2974. int n_versioning, n_recommending;
  2975. char *result;
  2976. /** holds the compromise status taken among all non-recommending
  2977. * authorities */
  2978. version_status_t consensus = VS_RECOMMENDED;
  2979. (void) now; /* right now, we consider *all* statuses, regardless of age. */
  2980. tor_assert(my_version);
  2981. tor_assert(status_out);
  2982. memset(status_out, 0, sizeof(combined_version_status_t));
  2983. if (!networkstatus_list)
  2984. return tor_strdup("<none>");
  2985. combined = smartlist_create();
  2986. n_versioning = n_recommending = 0;
  2987. SMARTLIST_FOREACH(networkstatus_list, networkstatus_t *, ns,
  2988. {
  2989. const char *vers;
  2990. smartlist_t *versions;
  2991. version_status_t status;
  2992. if (! ns->recommends_versions)
  2993. continue;
  2994. n_versioning++;
  2995. vers = client ? ns->client_versions : ns->server_versions;
  2996. if (!vers)
  2997. continue;
  2998. versions = smartlist_create();
  2999. smartlist_split_string(versions, vers, ",",
  3000. SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 0);
  3001. sort_version_list(versions, 1);
  3002. smartlist_add_all(combined, versions);
  3003. smartlist_free(versions);
  3004. /* now, check _our_ version */
  3005. status = tor_version_is_obsolete(my_version, vers);
  3006. if (status == VS_RECOMMENDED)
  3007. n_recommending++;
  3008. consensus = version_status_join(status, consensus);
  3009. });
  3010. sort_version_list(combined, 0);
  3011. current = NULL;
  3012. n_seen = 0;
  3013. recommended = smartlist_create();
  3014. SMARTLIST_FOREACH(combined, char *, cp,
  3015. {
  3016. if (current && !strcmp(cp, current)) {
  3017. ++n_seen;
  3018. } else {
  3019. if (n_seen > n_versioning/2 && current)
  3020. smartlist_add(recommended, current);
  3021. n_seen = 0;
  3022. current = cp;
  3023. }
  3024. });
  3025. if (n_seen > n_versioning/2 && current)
  3026. smartlist_add(recommended, current);
  3027. result = smartlist_join_strings(recommended, ", ", 0, NULL);
  3028. SMARTLIST_FOREACH(combined, char *, cp, tor_free(cp));
  3029. smartlist_free(combined);
  3030. smartlist_free(recommended);
  3031. status_out->n_versioning = n_versioning;
  3032. if (n_recommending > n_versioning/2) {
  3033. status_out->consensus = VS_RECOMMENDED;
  3034. status_out->n_concurring = n_recommending;
  3035. } else {
  3036. status_out->consensus = consensus;
  3037. status_out->n_concurring = n_versioning - n_recommending;
  3038. }
  3039. return result;
  3040. }
  3041. /** How many times do we have to fail at getting a networkstatus we can't find
  3042. * before we're willing to believe it's okay to set up router statuses? */
  3043. #define N_NS_ATTEMPTS_TO_SET_ROUTERS 4
  3044. /** How many times do we have to fail at getting a networkstatus we can't find
  3045. * before we're willing to believe it's okay to check our version? */
  3046. #define N_NS_ATTEMPTS_TO_CHECK_VERSION 4
  3047. /** If the network-status list has changed since the last time we called this
  3048. * function, update the status of every routerinfo from the network-status
  3049. * list.
  3050. */
  3051. void
  3052. routers_update_all_from_networkstatus(void)
  3053. {
  3054. routerinfo_t *me;
  3055. time_t now;
  3056. if (!routerlist || !networkstatus_list ||
  3057. (!networkstatus_list_has_changed && !routerstatus_list_has_changed))
  3058. return;
  3059. router_dir_info_changed();
  3060. now = time(NULL);
  3061. if (networkstatus_list_has_changed)
  3062. routerstatus_list_update_from_networkstatus(now);
  3063. routers_update_status_from_networkstatus(routerlist->routers, 0);
  3064. me = router_get_my_routerinfo();
  3065. if (me && !have_warned_about_invalid_status &&
  3066. have_tried_downloading_all_statuses(N_NS_ATTEMPTS_TO_SET_ROUTERS)) {
  3067. int n_recent = 0, n_listing = 0, n_valid = 0, n_named = 0, n_naming = 0;
  3068. routerstatus_t *rs;
  3069. SMARTLIST_FOREACH(networkstatus_list, networkstatus_t *, ns,
  3070. {
  3071. if (ns->received_on + SELF_OPINION_INTERVAL < now)
  3072. continue;
  3073. ++n_recent;
  3074. if (ns->binds_names)
  3075. ++n_naming;
  3076. if (!(rs = networkstatus_find_entry(ns, me->cache_info.identity_digest)))
  3077. continue;
  3078. ++n_listing;
  3079. if (rs->is_valid)
  3080. ++n_valid;
  3081. if (rs->is_named)
  3082. ++n_named;
  3083. });
  3084. if (n_listing) {
  3085. if (n_valid <= n_listing/2) {
  3086. log_info(LD_GENERAL,
  3087. "%d/%d recent statements from directory authorities list us "
  3088. "as unapproved. Are you misconfigured?",
  3089. n_listing-n_valid, n_listing);
  3090. have_warned_about_invalid_status = 1;
  3091. } else if (n_naming && !n_named) {
  3092. log_info(LD_GENERAL, "0/%d name-binding directory authorities "
  3093. "recognize your nickname. Please consider sending your "
  3094. "nickname and identity fingerprint to the tor-ops.",
  3095. n_naming);
  3096. have_warned_about_invalid_status = 1;
  3097. }
  3098. }
  3099. }
  3100. entry_guards_compute_status();
  3101. if (!have_warned_about_old_version &&
  3102. have_tried_downloading_all_statuses(N_NS_ATTEMPTS_TO_CHECK_VERSION)) {
  3103. combined_version_status_t st;
  3104. int is_server = server_mode(get_options());
  3105. char *recommended;
  3106. recommended = compute_recommended_versions(now, !is_server, VERSION, &st);
  3107. if (st.n_versioning) {
  3108. if (st.consensus == VS_RECOMMENDED) {
  3109. log_info(LD_GENERAL, "%d/%d statements from version-listing "
  3110. "directory authorities say my version is ok.",
  3111. st.n_concurring, st.n_versioning);
  3112. } else if (st.consensus == VS_NEW || st.consensus == VS_NEW_IN_SERIES) {
  3113. if (!have_warned_about_new_version) {
  3114. log_notice(LD_GENERAL, "This version of Tor (%s) is newer than any "
  3115. "recommended version%s, according to %d/%d version-listing "
  3116. "network statuses. Versions recommended by more than %d "
  3117. "authorit%s are: %s",
  3118. VERSION,
  3119. st.consensus == VS_NEW_IN_SERIES ? " in its series" : "",
  3120. st.n_concurring, st.n_versioning, st.n_versioning/2,
  3121. st.n_versioning/2 > 1 ? "ies" : "y", recommended);
  3122. have_warned_about_new_version = 1;
  3123. control_event_general_status(LOG_WARN, "DANGEROUS_VERSION "
  3124. "CURRENT=%s REASON=%s RECOMMENDED=\"%s\"",
  3125. VERSION, "NEW", recommended);
  3126. }
  3127. } else {
  3128. log_warn(LD_GENERAL, "Please upgrade! "
  3129. "This version of Tor (%s) is %s, according to %d/%d version-"
  3130. "listing network statuses. Versions recommended by "
  3131. "at least %d authorit%s are: %s",
  3132. VERSION,
  3133. st.consensus == VS_OLD ? "obsolete" : "not recommended",
  3134. st.n_concurring, st.n_versioning, st.n_versioning/2,
  3135. st.n_versioning/2 > 1 ? "ies" : "y", recommended);
  3136. have_warned_about_old_version = 1;
  3137. control_event_general_status(LOG_WARN, "DANGEROUS_VERSION "
  3138. "CURRENT=%s REASON=%s RECOMMENDED=\"%s\"",
  3139. VERSION, st.consensus == VS_OLD ? "OLD" : "UNRECOMMENDED",
  3140. recommended);
  3141. }
  3142. }
  3143. tor_free(recommended);
  3144. }
  3145. routerstatus_list_has_changed = 0;
  3146. }
  3147. /** Allow any network-status newer than this to influence our view of who's
  3148. * running. */
  3149. #define DEFAULT_RUNNING_INTERVAL (60*60)
  3150. /** If possible, always allow at least this many network-statuses to influence
  3151. * our view of who's running. */
  3152. #define MIN_TO_INFLUENCE_RUNNING 3
  3153. /** Change the is_recent field of each member of networkstatus_list so that
  3154. * all members more recent than DEFAULT_RUNNING_INTERVAL are recent, and
  3155. * at least the MIN_TO_INFLUENCE_RUNNING most recent members are recent, and no
  3156. * others are recent. Set networkstatus_list_has_changed if anything happened.
  3157. */
  3158. void
  3159. networkstatus_list_update_recent(time_t now)
  3160. {
  3161. int n_statuses, n_recent, changed, i;
  3162. char published[ISO_TIME_LEN+1];
  3163. if (!networkstatus_list)
  3164. return;
  3165. n_statuses = smartlist_len(networkstatus_list);
  3166. n_recent = 0;
  3167. changed = 0;
  3168. for (i=n_statuses-1; i >= 0; --i) {
  3169. networkstatus_t *ns = smartlist_get(networkstatus_list, i);
  3170. trusted_dir_server_t *ds =
  3171. router_get_trusteddirserver_by_digest(ns->identity_digest);
  3172. const char *src = ds?ds->description:ns->source_address;
  3173. if (n_recent < MIN_TO_INFLUENCE_RUNNING ||
  3174. ns->published_on + DEFAULT_RUNNING_INTERVAL > now) {
  3175. if (!ns->is_recent) {
  3176. format_iso_time(published, ns->published_on);
  3177. log_info(LD_DIR,
  3178. "Networkstatus from %s (published %s) is now \"recent\"",
  3179. src, published);
  3180. changed = 1;
  3181. }
  3182. ns->is_recent = 1;
  3183. ++n_recent;
  3184. } else {
  3185. if (ns->is_recent) {
  3186. format_iso_time(published, ns->published_on);
  3187. log_info(LD_DIR,
  3188. "Networkstatus from %s (published %s) is "
  3189. "no longer \"recent\"",
  3190. src, published);
  3191. changed = 1;
  3192. ns->is_recent = 0;
  3193. }
  3194. }
  3195. }
  3196. if (changed) {
  3197. networkstatus_list_has_changed = 1;
  3198. router_dir_info_changed();
  3199. }
  3200. }
  3201. /** Helper for routerstatus_list_update_from_networkstatus: remember how many
  3202. * authorities recommend a given descriptor digest. */
  3203. typedef struct {
  3204. routerstatus_t *rs;
  3205. int count;
  3206. } desc_digest_count_t;
  3207. /** Update our view of router status (as stored in routerstatus_list) from the
  3208. * current set of network status documents (as stored in networkstatus_list).
  3209. * Do nothing unless the network status list has changed since the last time
  3210. * this function was called.
  3211. */
  3212. static void
  3213. routerstatus_list_update_from_networkstatus(time_t now)
  3214. {
  3215. or_options_t *options = get_options();
  3216. int n_trusted, n_statuses, n_recent = 0, n_naming = 0;
  3217. int n_listing_bad_exits = 0, n_listing_bad_directories = 0;
  3218. int i, j, warned;
  3219. int *index, *size;
  3220. networkstatus_t **networkstatus;
  3221. smartlist_t *result, *changed_list;
  3222. strmap_t *name_map;
  3223. char conflict[DIGEST_LEN]; /* Sentinel value */
  3224. desc_digest_count_t *digest_counts = NULL;
  3225. /* compute which network statuses will have a vote now */
  3226. networkstatus_list_update_recent(now);
  3227. router_dir_info_changed();
  3228. if (!networkstatus_list_has_changed)
  3229. return;
  3230. if (!networkstatus_list)
  3231. networkstatus_list = smartlist_create();
  3232. if (!routerstatus_list)
  3233. routerstatus_list = smartlist_create();
  3234. if (!trusted_dir_servers)
  3235. trusted_dir_servers = smartlist_create();
  3236. if (!warned_conflicts)
  3237. warned_conflicts = smartlist_create();
  3238. n_statuses = smartlist_len(networkstatus_list);
  3239. n_trusted = get_n_v2_authorities();
  3240. if (n_statuses <= n_trusted/2) {
  3241. /* Not enough statuses to adjust status. */
  3242. log_info(LD_DIR,
  3243. "Not enough statuses to update router status list. (%d/%d)",
  3244. n_statuses, n_trusted);
  3245. return;
  3246. }
  3247. log_info(LD_DIR, "Rebuilding router status list.");
  3248. index = tor_malloc(sizeof(int)*n_statuses);
  3249. size = tor_malloc(sizeof(int)*n_statuses);
  3250. networkstatus = tor_malloc(sizeof(networkstatus_t *)*n_statuses);
  3251. for (i = 0; i < n_statuses; ++i) {
  3252. index[i] = 0;
  3253. networkstatus[i] = smartlist_get(networkstatus_list, i);
  3254. size[i] = smartlist_len(networkstatus[i]->entries);
  3255. if (networkstatus[i]->binds_names)
  3256. ++n_naming;
  3257. if (networkstatus[i]->is_recent)
  3258. ++n_recent;
  3259. if (networkstatus[i]->lists_bad_exits)
  3260. ++n_listing_bad_exits;
  3261. if (networkstatus[i]->lists_bad_directories)
  3262. ++n_listing_bad_directories;
  3263. }
  3264. /** Iterate over all entries in all networkstatuses, and build
  3265. * name_map as a map from lc nickname to identity digest. If there
  3266. * is a conflict on that nickname, map the lc nickname to conflict.
  3267. */
  3268. name_map = strmap_new();
  3269. /* Clear the global map... */
  3270. if (named_server_map)
  3271. strmap_free(named_server_map, _tor_free);
  3272. named_server_map = strmap_new();
  3273. memset(conflict, 0xff, sizeof(conflict));
  3274. for (i = 0; i < n_statuses; ++i) {
  3275. if (!networkstatus[i]->binds_names)
  3276. continue;
  3277. SMARTLIST_FOREACH(networkstatus[i]->entries, routerstatus_t *, rs,
  3278. {
  3279. const char *other_digest;
  3280. if (!rs->is_named)
  3281. continue;
  3282. other_digest = strmap_get_lc(name_map, rs->nickname);
  3283. warned = smartlist_string_isin(warned_conflicts, rs->nickname);
  3284. if (!other_digest) {
  3285. strmap_set_lc(name_map, rs->nickname, rs->identity_digest);
  3286. strmap_set_lc(named_server_map, rs->nickname,
  3287. tor_memdup(rs->identity_digest, DIGEST_LEN));
  3288. if (warned)
  3289. smartlist_string_remove(warned_conflicts, rs->nickname);
  3290. } else if (memcmp(other_digest, rs->identity_digest, DIGEST_LEN) &&
  3291. other_digest != conflict) {
  3292. if (!warned) {
  3293. char *d;
  3294. int should_warn = options->DirPort && options->AuthoritativeDir;
  3295. char fp1[HEX_DIGEST_LEN+1];
  3296. char fp2[HEX_DIGEST_LEN+1];
  3297. base16_encode(fp1, sizeof(fp1), other_digest, DIGEST_LEN);
  3298. base16_encode(fp2, sizeof(fp2), rs->identity_digest, DIGEST_LEN);
  3299. log_fn(should_warn ? LOG_WARN : LOG_INFO, LD_DIR,
  3300. "Naming authorities disagree about which key goes with %s. "
  3301. "($%s vs $%s)",
  3302. rs->nickname, fp1, fp2);
  3303. strmap_set_lc(name_map, rs->nickname, conflict);
  3304. d = strmap_remove_lc(named_server_map, rs->nickname);
  3305. tor_free(d);
  3306. smartlist_add(warned_conflicts, tor_strdup(rs->nickname));
  3307. }
  3308. } else {
  3309. if (warned)
  3310. smartlist_string_remove(warned_conflicts, rs->nickname);
  3311. }
  3312. });
  3313. }
  3314. result = smartlist_create();
  3315. changed_list = smartlist_create();
  3316. digest_counts = tor_malloc_zero(sizeof(desc_digest_count_t)*n_statuses);
  3317. /* Iterate through all of the sorted routerstatus lists in lockstep.
  3318. * Invariants:
  3319. * - For 0 <= i < n_statuses: index[i] is an index into
  3320. * networkstatus[i]->entries, which has size[i] elements.
  3321. * - For i1, i2, j such that 0 <= i1 < n_statuses, 0 <= i2 < n_statues, 0 <=
  3322. * j < index[i1]: networkstatus[i1]->entries[j]->identity_digest <
  3323. * networkstatus[i2]->entries[index[i2]]->identity_digest.
  3324. *
  3325. * (That is, the indices are always advanced past lower digest before
  3326. * higher.)
  3327. */
  3328. while (1) {
  3329. int n_running=0, n_named=0, n_valid=0, n_listing=0;
  3330. int n_v2_dir=0, n_fast=0, n_stable=0, n_exit=0, n_guard=0, n_bad_exit=0;
  3331. int n_bad_directory=0;
  3332. int n_version_known=0, n_supports_begindir=0;
  3333. int n_desc_digests=0, highest_count=0;
  3334. const char *the_name = NULL;
  3335. local_routerstatus_t *rs_out, *rs_old;
  3336. routerstatus_t *rs, *most_recent;
  3337. networkstatus_t *ns;
  3338. const char *lowest = NULL;
  3339. /* Find out which of the digests appears first. */
  3340. for (i = 0; i < n_statuses; ++i) {
  3341. if (index[i] < size[i]) {
  3342. rs = smartlist_get(networkstatus[i]->entries, index[i]);
  3343. if (!lowest || memcmp(rs->identity_digest, lowest, DIGEST_LEN)<0)
  3344. lowest = rs->identity_digest;
  3345. }
  3346. }
  3347. if (!lowest) {
  3348. /* We're out of routers. Great! */
  3349. break;
  3350. }
  3351. /* Okay. The routers at networkstatus[i]->entries[index[i]] whose digests
  3352. * match "lowest" are next in order. Iterate over them, incrementing those
  3353. * index[i] as we go. */
  3354. for (i = 0; i < n_statuses; ++i) {
  3355. if (index[i] >= size[i])
  3356. continue;
  3357. ns = networkstatus[i];
  3358. rs = smartlist_get(ns->entries, index[i]);
  3359. if (memcmp(rs->identity_digest, lowest, DIGEST_LEN))
  3360. continue;
  3361. /* At this point, we know that we're looking at a routersatus with
  3362. * identity "lowest".
  3363. */
  3364. ++index[i];
  3365. ++n_listing;
  3366. /* Should we name this router? Only if all the names from naming
  3367. * authorities match. */
  3368. if (rs->is_named && ns->binds_names) {
  3369. if (!the_name)
  3370. the_name = rs->nickname;
  3371. if (!strcasecmp(rs->nickname, the_name)) {
  3372. ++n_named;
  3373. } else if (strcmp(the_name,"**mismatch**")) {
  3374. char hd[HEX_DIGEST_LEN+1];
  3375. base16_encode(hd, HEX_DIGEST_LEN+1, rs->identity_digest, DIGEST_LEN);
  3376. if (! smartlist_string_isin(warned_conflicts, hd)) {
  3377. log_warn(LD_DIR,
  3378. "Naming authorities disagree about nicknames for $%s "
  3379. "(\"%s\" vs \"%s\")",
  3380. hd, the_name, rs->nickname);
  3381. smartlist_add(warned_conflicts, tor_strdup(hd));
  3382. }
  3383. the_name = "**mismatch**";
  3384. }
  3385. }
  3386. /* Keep a running count of how often which descriptor digests
  3387. * appear. */
  3388. for (j = 0; j < n_desc_digests; ++j) {
  3389. if (!memcmp(rs->descriptor_digest,
  3390. digest_counts[j].rs->descriptor_digest, DIGEST_LEN)) {
  3391. if (++digest_counts[j].count > highest_count)
  3392. highest_count = digest_counts[j].count;
  3393. goto found;
  3394. }
  3395. }
  3396. digest_counts[n_desc_digests].rs = rs;
  3397. digest_counts[n_desc_digests].count = 1;
  3398. if (!highest_count)
  3399. highest_count = 1;
  3400. ++n_desc_digests;
  3401. found:
  3402. /* Now tally up the easily-tallied flags. */
  3403. if (rs->is_valid)
  3404. ++n_valid;
  3405. if (rs->is_running && ns->is_recent)
  3406. ++n_running;
  3407. if (rs->is_exit)
  3408. ++n_exit;
  3409. if (rs->is_fast)
  3410. ++n_fast;
  3411. if (rs->is_possible_guard)
  3412. ++n_guard;
  3413. if (rs->is_stable)
  3414. ++n_stable;
  3415. if (rs->is_v2_dir)
  3416. ++n_v2_dir;
  3417. if (rs->is_bad_exit)
  3418. ++n_bad_exit;
  3419. if (rs->is_bad_directory)
  3420. ++n_bad_directory;
  3421. if (rs->version_known)
  3422. ++n_version_known;
  3423. if (rs->version_supports_begindir)
  3424. ++n_supports_begindir;
  3425. }
  3426. /* Go over the descriptor digests and figure out which descriptor we
  3427. * want. */
  3428. most_recent = NULL;
  3429. for (i = 0; i < n_desc_digests; ++i) {
  3430. /* If any digest appears twice or more, ignore those that don't.*/
  3431. if (highest_count >= 2 && digest_counts[i].count < 2)
  3432. continue;
  3433. if (!most_recent ||
  3434. digest_counts[i].rs->published_on > most_recent->published_on)
  3435. most_recent = digest_counts[i].rs;
  3436. }
  3437. rs_out = tor_malloc_zero(sizeof(local_routerstatus_t));
  3438. memcpy(&rs_out->status, most_recent, sizeof(routerstatus_t));
  3439. /* Copy status info about this router, if we had any before. */
  3440. if ((rs_old = router_get_combined_status_by_digest(lowest))) {
  3441. if (!memcmp(rs_out->status.descriptor_digest,
  3442. most_recent->descriptor_digest, DIGEST_LEN)) {
  3443. rs_out->n_download_failures = rs_old->n_download_failures;
  3444. rs_out->next_attempt_at = rs_old->next_attempt_at;
  3445. }
  3446. rs_out->name_lookup_warned = rs_old->name_lookup_warned;
  3447. rs_out->last_dir_503_at = rs_old->last_dir_503_at;
  3448. }
  3449. smartlist_add(result, rs_out);
  3450. log_debug(LD_DIR, "Router '%s' is listed by %d/%d directories, "
  3451. "named by %d/%d, validated by %d/%d, and %d/%d recent "
  3452. "directories think it's running.",
  3453. rs_out->status.nickname,
  3454. n_listing, n_statuses, n_named, n_naming, n_valid, n_statuses,
  3455. n_running, n_recent);
  3456. rs_out->status.is_named = 0;
  3457. if (the_name && strcmp(the_name, "**mismatch**") && n_named > 0) {
  3458. const char *d = strmap_get_lc(name_map, the_name);
  3459. if (d && d != conflict)
  3460. rs_out->status.is_named = 1;
  3461. if (smartlist_string_isin(warned_conflicts, rs_out->status.nickname))
  3462. smartlist_string_remove(warned_conflicts, rs_out->status.nickname);
  3463. }
  3464. if (rs_out->status.is_named)
  3465. strlcpy(rs_out->status.nickname, the_name,
  3466. sizeof(rs_out->status.nickname));
  3467. rs_out->status.is_valid = n_valid > n_statuses/2;
  3468. rs_out->status.is_running = n_running > n_recent/2;
  3469. rs_out->status.is_exit = n_exit > n_statuses/2;
  3470. rs_out->status.is_fast = n_fast > n_statuses/2;
  3471. rs_out->status.is_possible_guard = n_guard > n_statuses/2;
  3472. rs_out->status.is_stable = n_stable > n_statuses/2;
  3473. rs_out->status.is_v2_dir = n_v2_dir > n_statuses/2;
  3474. rs_out->status.is_bad_exit = n_bad_exit > n_listing_bad_exits/2;
  3475. rs_out->status.is_bad_directory =
  3476. n_bad_directory > n_listing_bad_directories/2;
  3477. rs_out->status.version_known = n_version_known > 0;
  3478. rs_out->status.version_supports_begindir =
  3479. n_supports_begindir > n_version_known/2;
  3480. if (!rs_old || memcmp(rs_old, rs_out, sizeof(local_routerstatus_t)))
  3481. smartlist_add(changed_list, rs_out);
  3482. }
  3483. SMARTLIST_FOREACH(routerstatus_list, local_routerstatus_t *, rs,
  3484. local_routerstatus_free(rs));
  3485. smartlist_free(routerstatus_list);
  3486. routerstatus_list = result;
  3487. tor_free(networkstatus);
  3488. tor_free(index);
  3489. tor_free(size);
  3490. tor_free(digest_counts);
  3491. strmap_free(name_map, NULL);
  3492. networkstatus_list_has_changed = 0;
  3493. routerstatus_list_has_changed = 1;
  3494. control_event_networkstatus_changed(changed_list);
  3495. smartlist_free(changed_list);
  3496. }
  3497. /** Given a list <b>routers</b> of routerinfo_t *, update each routers's
  3498. * is_named, is_valid, and is_running fields according to our current
  3499. * networkstatus_t documents. */
  3500. void
  3501. routers_update_status_from_networkstatus(smartlist_t *routers,
  3502. int reset_failures)
  3503. {
  3504. trusted_dir_server_t *ds;
  3505. local_routerstatus_t *rs;
  3506. or_options_t *options = get_options();
  3507. int authdir = options->AuthoritativeDir;
  3508. int namingdir = options->AuthoritativeDir &&
  3509. options->NamingAuthoritativeDir;
  3510. if (!routerstatus_list)
  3511. return;
  3512. SMARTLIST_FOREACH(routers, routerinfo_t *, router,
  3513. {
  3514. const char *digest = router->cache_info.identity_digest;
  3515. rs = router_get_combined_status_by_digest(digest);
  3516. ds = router_get_trusteddirserver_by_digest(digest);
  3517. if (!rs)
  3518. continue;
  3519. if (!namingdir)
  3520. router->is_named = rs->status.is_named;
  3521. if (!authdir) {
  3522. /* If we're not an authdir, believe others. */
  3523. router->is_valid = rs->status.is_valid;
  3524. router->is_running = rs->status.is_running;
  3525. router->is_fast = rs->status.is_fast;
  3526. router->is_stable = rs->status.is_stable;
  3527. router->is_possible_guard = rs->status.is_possible_guard;
  3528. router->is_exit = rs->status.is_exit;
  3529. router->is_bad_exit = rs->status.is_bad_exit;
  3530. }
  3531. if (router->is_running && ds) {
  3532. ds->n_networkstatus_failures = 0;
  3533. }
  3534. if (reset_failures) {
  3535. rs->n_download_failures = 0;
  3536. rs->next_attempt_at = 0;
  3537. }
  3538. });
  3539. router_dir_info_changed();
  3540. }
  3541. /** For every router descriptor we are currently downloading by descriptor
  3542. * digest, set result[d] to 1. */
  3543. static void
  3544. list_pending_descriptor_downloads(digestmap_t *result)
  3545. {
  3546. const char *prefix = "d/";
  3547. size_t p_len = strlen(prefix);
  3548. int i, n_conns;
  3549. connection_t **carray;
  3550. smartlist_t *tmp = smartlist_create();
  3551. tor_assert(result);
  3552. get_connection_array(&carray, &n_conns);
  3553. for (i = 0; i < n_conns; ++i) {
  3554. connection_t *conn = carray[i];
  3555. if (conn->type == CONN_TYPE_DIR &&
  3556. conn->purpose == DIR_PURPOSE_FETCH_SERVERDESC &&
  3557. !conn->marked_for_close) {
  3558. const char *resource = TO_DIR_CONN(conn)->requested_resource;
  3559. if (!strcmpstart(resource, prefix))
  3560. dir_split_resource_into_fingerprints(resource + p_len,
  3561. tmp, NULL, 1, 0);
  3562. }
  3563. }
  3564. SMARTLIST_FOREACH(tmp, char *, d,
  3565. {
  3566. digestmap_set(result, d, (void*)1);
  3567. tor_free(d);
  3568. });
  3569. smartlist_free(tmp);
  3570. }
  3571. /** Launch downloads for all the descriptors whose digests are listed
  3572. * as digests[i] for lo <= i < hi. (Lo and hi may be out of range.)
  3573. * If <b>source</b> is given, download from <b>source</b>; otherwise,
  3574. * download from an appropriate random directory server.
  3575. */
  3576. static void
  3577. initiate_descriptor_downloads(routerstatus_t *source,
  3578. smartlist_t *digests,
  3579. int lo, int hi)
  3580. {
  3581. int i, n = hi-lo;
  3582. char *resource, *cp;
  3583. size_t r_len;
  3584. if (n <= 0)
  3585. return;
  3586. if (lo < 0)
  3587. lo = 0;
  3588. if (hi > smartlist_len(digests))
  3589. hi = smartlist_len(digests);
  3590. r_len = 8 + (HEX_DIGEST_LEN+1)*n;
  3591. cp = resource = tor_malloc(r_len);
  3592. memcpy(cp, "d/", 2);
  3593. cp += 2;
  3594. for (i = lo; i < hi; ++i) {
  3595. base16_encode(cp, r_len-(cp-resource),
  3596. smartlist_get(digests,i), DIGEST_LEN);
  3597. cp += HEX_DIGEST_LEN;
  3598. *cp++ = '+';
  3599. }
  3600. memcpy(cp-1, ".z", 3);
  3601. if (source) {
  3602. /* We know which authority we want. */
  3603. directory_initiate_command_routerstatus(source,
  3604. DIR_PURPOSE_FETCH_SERVERDESC,
  3605. 0, /* not private */
  3606. resource, NULL, 0);
  3607. } else {
  3608. directory_get_from_dirserver(DIR_PURPOSE_FETCH_SERVERDESC,
  3609. resource,
  3610. 1);
  3611. }
  3612. tor_free(resource);
  3613. }
  3614. /** Clients don't download any descriptor this recent, since it will probably
  3615. * not have propageted to enough caches. */
  3616. #define ESTIMATED_PROPAGATION_TIME (10*60)
  3617. /** Return 0 if this routerstatus is obsolete, too new, isn't
  3618. * running, or otherwise not a descriptor that we would make any
  3619. * use of even if we had it. Else return 1. */
  3620. static INLINE int
  3621. client_would_use_router(routerstatus_t *rs, time_t now, or_options_t *options)
  3622. {
  3623. if (!rs->is_running && !options->FetchUselessDescriptors) {
  3624. /* If we had this router descriptor, we wouldn't even bother using it.
  3625. * But, if we want to have a complete list, fetch it anyway. */
  3626. return 0;
  3627. }
  3628. if (rs->published_on + ESTIMATED_PROPAGATION_TIME > now) {
  3629. /* Most caches probably don't have this descriptor yet. */
  3630. return 0;
  3631. }
  3632. return 1;
  3633. }
  3634. /** Return new list of ID fingerprints for routers that we (as a client) would
  3635. * like to download.
  3636. */
  3637. static smartlist_t *
  3638. router_list_client_downloadable(void)
  3639. {
  3640. int n_downloadable = 0;
  3641. smartlist_t *downloadable = smartlist_create();
  3642. digestmap_t *downloading;
  3643. time_t now = time(NULL);
  3644. /* these are just used for logging */
  3645. int n_not_ready = 0, n_in_progress = 0, n_uptodate = 0, n_wouldnt_use = 0;
  3646. or_options_t *options = get_options();
  3647. if (!routerstatus_list)
  3648. return downloadable;
  3649. downloading = digestmap_new();
  3650. list_pending_descriptor_downloads(downloading);
  3651. routerstatus_list_update_from_networkstatus(now);
  3652. SMARTLIST_FOREACH(routerstatus_list, local_routerstatus_t *, rs,
  3653. {
  3654. routerinfo_t *ri;
  3655. if (router_get_by_descriptor_digest(rs->status.descriptor_digest)) {
  3656. /* We have the 'best' descriptor for this router. */
  3657. ++n_uptodate;
  3658. } else if (!client_would_use_router(&rs->status, now, options)) {
  3659. /* We wouldn't want this descriptor even if we got it. */
  3660. ++n_wouldnt_use;
  3661. } else if (digestmap_get(downloading, rs->status.descriptor_digest)) {
  3662. /* We're downloading this one now. */
  3663. ++n_in_progress;
  3664. } else if ((ri = router_get_by_digest(rs->status.identity_digest)) &&
  3665. ri->cache_info.published_on > rs->status.published_on) {
  3666. /* Oddly, we have a descriptor more recent than the 'best' one, but it
  3667. was once best. So that's okay. */
  3668. ++n_uptodate;
  3669. } else if (rs->next_attempt_at > now) {
  3670. /* We failed too recently to try again. */
  3671. ++n_not_ready;
  3672. } else {
  3673. /* Okay, time to try it. */
  3674. smartlist_add(downloadable, rs->status.descriptor_digest);
  3675. ++n_downloadable;
  3676. }
  3677. });
  3678. #if 0
  3679. log_info(LD_DIR,
  3680. "%d router descriptors are downloadable. "
  3681. "%d are in progress. %d are up-to-date. "
  3682. "%d are non-useful. %d failed too recently to retry.",
  3683. n_downloadable, n_in_progress, n_uptodate,
  3684. n_wouldnt_use, n_not_ready);
  3685. #endif
  3686. digestmap_free(downloading, NULL);
  3687. return downloadable;
  3688. }
  3689. /** Initiate new router downloads as needed, using the strategy for
  3690. * non-directory-servers.
  3691. *
  3692. * We don't launch any downloads if there are fewer than MAX_DL_TO_DELAY
  3693. * descriptors to get and less than MAX_CLIENT_INTERVAL_WITHOUT_REQUEST
  3694. * seconds have passed.
  3695. *
  3696. * Otherwise, we ask for all descriptors that we think are different from what
  3697. * we have, and that we don't currently have an in-progress download attempt
  3698. * for. */
  3699. static void
  3700. update_router_descriptor_client_downloads(time_t now)
  3701. {
  3702. /** Max amount of hashes to download per request.
  3703. * Since squid does not like URLs >= 4096 bytes we limit it to 96.
  3704. * 4096 - strlen(http://255.255.255.255/tor/server/d/.z) == 4058
  3705. * 4058/41 (40 for the hash and 1 for the + that separates them) => 98
  3706. * So use 96 because it's a nice number.
  3707. */
  3708. #define MAX_DL_PER_REQUEST 96
  3709. /** Don't split our requests so finely that we are requesting fewer than
  3710. * this number per server. */
  3711. #define MIN_DL_PER_REQUEST 4
  3712. /** To prevent a single screwy cache from confusing us by selective reply,
  3713. * try to split our requests into at least this this many requests. */
  3714. #define MIN_REQUESTS 3
  3715. /** If we want fewer than this many descriptors, wait until we
  3716. * want more, or until MAX_CLIENT_INTERVAL_WITHOUT_REQUEST has
  3717. * passed. */
  3718. #define MAX_DL_TO_DELAY 16
  3719. /** When directory clients have only a few servers to request, they batch
  3720. * them until they have more, or until this amount of time has passed. */
  3721. #define MAX_CLIENT_INTERVAL_WITHOUT_REQUEST (10*60)
  3722. smartlist_t *downloadable = NULL;
  3723. int should_delay, n_downloadable;
  3724. or_options_t *options = get_options();
  3725. if (options->DirPort) {
  3726. log_warn(LD_BUG,
  3727. "Called router_descriptor_client_downloads() on a dir mirror?");
  3728. }
  3729. if (rep_hist_circbuilding_dormant(now)) {
  3730. // log_info(LD_CIRC, "Skipping descriptor downloads: we haven't needed "
  3731. // "any circuits lately.");
  3732. return;
  3733. }
  3734. if (networkstatus_list &&
  3735. smartlist_len(networkstatus_list) <= get_n_v2_authorities()/2) {
  3736. log_info(LD_DIR,
  3737. "Not enough networkstatus documents to launch requests.");
  3738. return;
  3739. }
  3740. downloadable = router_list_client_downloadable();
  3741. n_downloadable = smartlist_len(downloadable);
  3742. if (n_downloadable >= MAX_DL_TO_DELAY) {
  3743. log_debug(LD_DIR,
  3744. "There are enough downloadable routerdescs to launch requests.");
  3745. should_delay = 0;
  3746. } else if (n_downloadable == 0) {
  3747. // log_debug(LD_DIR, "No routerdescs need to be downloaded.");
  3748. should_delay = 1;
  3749. } else {
  3750. should_delay = (last_routerdesc_download_attempted +
  3751. MAX_CLIENT_INTERVAL_WITHOUT_REQUEST) > now;
  3752. if (!should_delay) {
  3753. if (last_routerdesc_download_attempted) {
  3754. log_info(LD_DIR,
  3755. "There are not many downloadable routerdescs, but we've "
  3756. "been waiting long enough (%d seconds). Downloading.",
  3757. (int)(now-last_routerdesc_download_attempted));
  3758. } else {
  3759. log_info(LD_DIR,
  3760. "There are not many downloadable routerdescs, but we haven't "
  3761. "tried downloading descriptors recently. Downloading.");
  3762. }
  3763. }
  3764. }
  3765. if (! should_delay) {
  3766. int i, n_per_request;
  3767. n_per_request = (n_downloadable+MIN_REQUESTS-1) / MIN_REQUESTS;
  3768. if (n_per_request > MAX_DL_PER_REQUEST)
  3769. n_per_request = MAX_DL_PER_REQUEST;
  3770. if (n_per_request < MIN_DL_PER_REQUEST)
  3771. n_per_request = MIN_DL_PER_REQUEST;
  3772. log_info(LD_DIR,
  3773. "Launching %d request%s for %d router%s, %d at a time",
  3774. (n_downloadable+n_per_request-1)/n_per_request,
  3775. n_downloadable>n_per_request?"s":"",
  3776. n_downloadable, n_downloadable>1?"s":"", n_per_request);
  3777. smartlist_sort_digests(downloadable);
  3778. for (i=0; i < n_downloadable; i += n_per_request) {
  3779. initiate_descriptor_downloads(NULL, downloadable, i, i+n_per_request);
  3780. }
  3781. last_routerdesc_download_attempted = now;
  3782. }
  3783. smartlist_free(downloadable);
  3784. }
  3785. /** Launch downloads for router status as needed, using the strategy used by
  3786. * authorities and caches: download every descriptor we don't have but would
  3787. * serve, from a random authority that lists it. */
  3788. static void
  3789. update_router_descriptor_cache_downloads(time_t now)
  3790. {
  3791. smartlist_t **downloadable; /* For each authority, what can we dl from it? */
  3792. smartlist_t **download_from; /* ... and, what will we dl from it? */
  3793. digestmap_t *map; /* Which descs are in progress, or assigned? */
  3794. int i, j, n;
  3795. int n_download;
  3796. or_options_t *options = get_options();
  3797. (void) now;
  3798. if (!options->DirPort) {
  3799. log_warn(LD_BUG, "Called update_router_descriptor_cache_downloads() "
  3800. "on a non-dir-mirror?");
  3801. }
  3802. if (!networkstatus_list || !smartlist_len(networkstatus_list))
  3803. return;
  3804. map = digestmap_new();
  3805. n = smartlist_len(networkstatus_list);
  3806. downloadable = tor_malloc_zero(sizeof(smartlist_t*) * n);
  3807. download_from = tor_malloc_zero(sizeof(smartlist_t*) * n);
  3808. /* Set map[d]=1 for the digest of every descriptor that we are currently
  3809. * downloading. */
  3810. list_pending_descriptor_downloads(map);
  3811. /* For the digest of every descriptor that we don't have, and that we aren't
  3812. * downloading, add d to downloadable[i] if the i'th networkstatus knows
  3813. * about that descriptor, and we haven't already failed to get that
  3814. * descriptor from the corresponding authority.
  3815. */
  3816. n_download = 0;
  3817. SMARTLIST_FOREACH(networkstatus_list, networkstatus_t *, ns,
  3818. {
  3819. smartlist_t *dl;
  3820. dl = downloadable[ns_sl_idx] = smartlist_create();
  3821. download_from[ns_sl_idx] = smartlist_create();
  3822. if (ns->published_on + MAX_NETWORKSTATUS_AGE+10*60 < now) {
  3823. /* Don't download if the networkstatus is almost ancient. */
  3824. /* Actually, I suspect what's happening here is that we ask
  3825. * for the descriptor when we have a given networkstatus,
  3826. * and then we get a newer networkstatus, and then we receive
  3827. * the descriptor. Having a networkstatus actually expire is
  3828. * probably a rare event, and we'll probably be happiest if
  3829. * we take this clause out. -RD */
  3830. continue;
  3831. }
  3832. { /* XXX temporary hack so I can debug other stuff without bug 384
  3833. * filling up my logs. */
  3834. trusted_dir_server_t *ds;
  3835. ds = router_get_trusteddirserver_by_digest(ns->identity_digest);
  3836. if (ds && !ds->is_running)
  3837. continue;
  3838. }
  3839. SMARTLIST_FOREACH(ns->entries, routerstatus_t * , rs,
  3840. {
  3841. if (!rs->need_to_mirror)
  3842. continue;
  3843. if (router_get_by_descriptor_digest(rs->descriptor_digest)) {
  3844. log_warn(LD_BUG,
  3845. "We have a router descriptor, but need_to_mirror=1.");
  3846. rs->need_to_mirror = 0;
  3847. continue;
  3848. }
  3849. if (options->AuthoritativeDir && dirserv_would_reject_router(rs)) {
  3850. rs->need_to_mirror = 0;
  3851. continue;
  3852. }
  3853. if (digestmap_get(map, rs->descriptor_digest)) {
  3854. /* We're downloading it already. */
  3855. continue;
  3856. } else {
  3857. /* We could download it from this guy. */
  3858. smartlist_add(dl, rs->descriptor_digest);
  3859. ++n_download;
  3860. }
  3861. });
  3862. });
  3863. /* At random, assign descriptors to authorities such that:
  3864. * - if d is a member of some downloadable[x], d is a member of some
  3865. * download_from[y]. (Everything we want to download, we try to download
  3866. * from somebody.)
  3867. * - If d is a member of download_from[y], d is a member of downloadable[y].
  3868. * (We only try to download descriptors from authorities who claim to have
  3869. * them.)
  3870. * - No d is a member of download_from[x] and download_from[y] s.t. x != y.
  3871. * (We don't try to download anything from two authorities concurrently.)
  3872. */
  3873. while (n_download) {
  3874. int which_ns = crypto_rand_int(n);
  3875. smartlist_t *dl = downloadable[which_ns];
  3876. int idx;
  3877. char *d;
  3878. if (!smartlist_len(dl))
  3879. continue;
  3880. idx = crypto_rand_int(smartlist_len(dl));
  3881. d = smartlist_get(dl, idx);
  3882. if (! digestmap_get(map, d)) {
  3883. smartlist_add(download_from[which_ns], d);
  3884. digestmap_set(map, d, (void*) 1);
  3885. }
  3886. smartlist_del(dl, idx);
  3887. --n_download;
  3888. }
  3889. /* Now, we can actually launch our requests. */
  3890. for (i=0; i<n; ++i) {
  3891. networkstatus_t *ns = smartlist_get(networkstatus_list, i);
  3892. trusted_dir_server_t *ds =
  3893. router_get_trusteddirserver_by_digest(ns->identity_digest);
  3894. smartlist_t *dl = download_from[i];
  3895. if (!ds) {
  3896. log_warn(LD_BUG, "Networkstatus with no corresponding authority!");
  3897. continue;
  3898. }
  3899. if (! smartlist_len(dl))
  3900. continue;
  3901. log_info(LD_DIR, "Requesting %d descriptors from authority \"%s\"",
  3902. smartlist_len(dl), ds->nickname);
  3903. for (j=0; j < smartlist_len(dl); j += MAX_DL_PER_REQUEST) {
  3904. initiate_descriptor_downloads(&(ds->fake_status.status), dl, j,
  3905. j+MAX_DL_PER_REQUEST);
  3906. }
  3907. }
  3908. for (i=0; i<n; ++i) {
  3909. smartlist_free(download_from[i]);
  3910. smartlist_free(downloadable[i]);
  3911. }
  3912. tor_free(download_from);
  3913. tor_free(downloadable);
  3914. digestmap_free(map,NULL);
  3915. }
  3916. /** Launch downloads for router status as needed. */
  3917. void
  3918. update_router_descriptor_downloads(time_t now)
  3919. {
  3920. or_options_t *options = get_options();
  3921. if (options->DirPort) {
  3922. update_router_descriptor_cache_downloads(now);
  3923. } else {
  3924. update_router_descriptor_client_downloads(now);
  3925. }
  3926. }
  3927. /** Return the number of routerstatus_t in <b>entries</b> that we'd actually
  3928. * use. */
  3929. static int
  3930. routerstatus_count_usable_entries(smartlist_t *entries)
  3931. {
  3932. int count = 0;
  3933. time_t now = time(NULL);
  3934. or_options_t *options = get_options();
  3935. SMARTLIST_FOREACH(entries, routerstatus_t *, rs,
  3936. if (client_would_use_router(rs, now, options)) count++);
  3937. return count;
  3938. }
  3939. /** True iff, the last time we checked whether we had enough directory info
  3940. * to build circuits, the answer was "yes". */
  3941. static int have_min_dir_info = 0;
  3942. /** True iff enough has changed since the last time we checked whether we had
  3943. * enough directory info to build circuits that our old answer can no longer
  3944. * be trusted. */
  3945. static int need_to_update_have_min_dir_info = 1;
  3946. /** Return true iff we have enough networkstatus and router information to
  3947. * start building circuits. Right now, this means "more than half the
  3948. * networkstatus documents, and at least 1/4 of expected routers." */
  3949. //XXX should consider whether we have enough exiting nodes here.
  3950. int
  3951. router_have_minimum_dir_info(void)
  3952. {
  3953. if (PREDICT_UNLIKELY(need_to_update_have_min_dir_info)) {
  3954. update_router_have_minimum_dir_info();
  3955. need_to_update_have_min_dir_info = 0;
  3956. }
  3957. return have_min_dir_info;
  3958. }
  3959. /** Called when our internal view of the directory has changed. This can be
  3960. * when the authorities change, networkstatuses change, the list of routerdescs
  3961. * changes, or number of running routers changes.
  3962. */
  3963. static void
  3964. router_dir_info_changed(void)
  3965. {
  3966. need_to_update_have_min_dir_info = 1;
  3967. }
  3968. /** Change the value of have_min_dir_info, setting it true iff we have enough
  3969. * network and router information to build circuits. Clear the value of
  3970. * need_to_update_have_min_dir_info. */
  3971. static void
  3972. update_router_have_minimum_dir_info(void)
  3973. {
  3974. int tot = 0, num_running = 0;
  3975. int n_ns, n_authorities, res, avg;
  3976. time_t now = time(NULL);
  3977. if (!networkstatus_list || !routerlist) {
  3978. res = 0;
  3979. goto done;
  3980. }
  3981. routerlist_remove_old_routers();
  3982. networkstatus_list_clean(now);
  3983. n_authorities = get_n_v2_authorities();
  3984. n_ns = smartlist_len(networkstatus_list);
  3985. if (n_ns<=n_authorities/2) {
  3986. log_info(LD_DIR,
  3987. "We have %d of %d network statuses, and we want "
  3988. "more than %d.", n_ns, n_authorities, n_authorities/2);
  3989. res = 0;
  3990. goto done;
  3991. }
  3992. SMARTLIST_FOREACH(networkstatus_list, networkstatus_t *, ns,
  3993. tot += routerstatus_count_usable_entries(ns->entries));
  3994. avg = tot / n_ns;
  3995. if (!routerstatus_list)
  3996. routerstatus_list = smartlist_create();
  3997. SMARTLIST_FOREACH(routerstatus_list, local_routerstatus_t *, rs,
  3998. {
  3999. if (rs->status.is_running)
  4000. num_running++;
  4001. });
  4002. res = smartlist_len(routerlist->routers) >= (avg/4) && num_running > 2;
  4003. done:
  4004. if (res && !have_min_dir_info) {
  4005. log(LOG_NOTICE, LD_DIR,
  4006. "We now have enough directory information to build circuits.");
  4007. control_event_client_status(LOG_NOTICE, "ENOUGH_DIR_INFO");
  4008. }
  4009. if (!res && have_min_dir_info) {
  4010. log(LOG_NOTICE, LD_DIR,"Our directory information is no longer up-to-date "
  4011. "enough to build circuits.%s",
  4012. num_running > 2 ? "" : " (Not enough servers seem reachable -- "
  4013. "is your network connection down?)");
  4014. control_event_client_status(LOG_NOTICE, "NOT_ENOUGH_DIR_INFO");
  4015. }
  4016. have_min_dir_info = res;
  4017. }
  4018. /** Return true iff we have downloaded, or attempted to download at least
  4019. * n_failures times, a network status for each authority. */
  4020. static int
  4021. have_tried_downloading_all_statuses(int n_failures)
  4022. {
  4023. if (!trusted_dir_servers)
  4024. return 0;
  4025. SMARTLIST_FOREACH(trusted_dir_servers, trusted_dir_server_t *, ds,
  4026. {
  4027. if (!ds->is_v2_authority)
  4028. continue;
  4029. /* If we don't have the status, and we haven't failed to get the status,
  4030. * we haven't tried to get the status. */
  4031. if (!networkstatus_get_by_digest(ds->digest) &&
  4032. ds->n_networkstatus_failures <= n_failures)
  4033. return 0;
  4034. });
  4035. return 1;
  4036. }
  4037. /** Reset the descriptor download failure count on all routers, so that we
  4038. * can retry any long-failed routers immediately.
  4039. */
  4040. void
  4041. router_reset_descriptor_download_failures(void)
  4042. {
  4043. if (!routerstatus_list)
  4044. return;
  4045. SMARTLIST_FOREACH(routerstatus_list, local_routerstatus_t *, rs,
  4046. {
  4047. rs->n_download_failures = 0;
  4048. rs->next_attempt_at = 0;
  4049. });
  4050. tor_assert(networkstatus_list);
  4051. SMARTLIST_FOREACH(networkstatus_list, networkstatus_t *, ns,
  4052. SMARTLIST_FOREACH(ns->entries, routerstatus_t *, rs,
  4053. {
  4054. if (!router_get_by_descriptor_digest(rs->descriptor_digest))
  4055. rs->need_to_mirror = 1;
  4056. }));
  4057. last_routerdesc_download_attempted = 0;
  4058. }
  4059. /** Any changes in a router descriptor's publication time larger than this are
  4060. * automatically non-cosmetic. */
  4061. #define ROUTER_MAX_COSMETIC_TIME_DIFFERENCE (12*60*60)
  4062. /** We allow uptime to vary from how much it ought to be by this much. */
  4063. #define ROUTER_ALLOW_UPTIME_DRIFT (6*60*60)
  4064. /** Return true iff the only differences between r1 and r2 are such that
  4065. * would not cause a recent (post 0.1.1.6) dirserver to republish.
  4066. */
  4067. int
  4068. router_differences_are_cosmetic(routerinfo_t *r1, routerinfo_t *r2)
  4069. {
  4070. time_t r1pub, r2pub;
  4071. int time_difference;
  4072. tor_assert(r1 && r2);
  4073. /* r1 should be the one that was published first. */
  4074. if (r1->cache_info.published_on > r2->cache_info.published_on) {
  4075. routerinfo_t *ri_tmp = r2;
  4076. r2 = r1;
  4077. r1 = ri_tmp;
  4078. }
  4079. /* If any key fields differ, they're different. */
  4080. if (strcasecmp(r1->address, r2->address) ||
  4081. strcasecmp(r1->nickname, r2->nickname) ||
  4082. r1->or_port != r2->or_port ||
  4083. r1->dir_port != r2->dir_port ||
  4084. crypto_pk_cmp_keys(r1->onion_pkey, r2->onion_pkey) ||
  4085. crypto_pk_cmp_keys(r1->identity_pkey, r2->identity_pkey) ||
  4086. strcasecmp(r1->platform, r2->platform) ||
  4087. (r1->contact_info && !r2->contact_info) || /* contact_info is optional */
  4088. (!r1->contact_info && r2->contact_info) ||
  4089. (r1->contact_info && r2->contact_info &&
  4090. strcasecmp(r1->contact_info, r2->contact_info)) ||
  4091. r1->is_hibernating != r2->is_hibernating ||
  4092. r1->has_old_dnsworkers != r2->has_old_dnsworkers ||
  4093. cmp_addr_policies(r1->exit_policy, r2->exit_policy))
  4094. return 0;
  4095. if ((r1->declared_family == NULL) != (r2->declared_family == NULL))
  4096. return 0;
  4097. if (r1->declared_family && r2->declared_family) {
  4098. int i, n;
  4099. if (smartlist_len(r1->declared_family)!=smartlist_len(r2->declared_family))
  4100. return 0;
  4101. n = smartlist_len(r1->declared_family);
  4102. for (i=0; i < n; ++i) {
  4103. if (strcasecmp(smartlist_get(r1->declared_family, i),
  4104. smartlist_get(r2->declared_family, i)))
  4105. return 0;
  4106. }
  4107. }
  4108. /* Did bandwidth change a lot? */
  4109. if ((r1->bandwidthcapacity < r2->bandwidthcapacity/2) ||
  4110. (r2->bandwidthcapacity < r1->bandwidthcapacity/2))
  4111. return 0;
  4112. /* Did more than 12 hours pass? */
  4113. if (r1->cache_info.published_on + ROUTER_MAX_COSMETIC_TIME_DIFFERENCE
  4114. < r2->cache_info.published_on)
  4115. return 0;
  4116. /* Did uptime fail to increase by approximately the amount we would think,
  4117. * give or take some slop? */
  4118. r1pub = r1->cache_info.published_on;
  4119. r2pub = r2->cache_info.published_on;
  4120. time_difference = abs(r2->uptime - (r1->uptime + (r2pub - r1pub)));
  4121. if (time_difference > ROUTER_ALLOW_UPTIME_DRIFT &&
  4122. time_difference > r1->uptime * .05 &&
  4123. time_difference > r2->uptime * .05)
  4124. return 0;
  4125. /* Otherwise, the difference is cosmetic. */
  4126. return 1;
  4127. }
  4128. /** DOCDOC */
  4129. int
  4130. routerinfo_incompatible_with_extrainfo(routerinfo_t *ri, extrainfo_t *ei)
  4131. {
  4132. tor_assert(ri);
  4133. tor_assert(ei);
  4134. if (ei->bad_sig)
  4135. return 1;
  4136. if (strcmp(ri->nickname, ei->nickname) ||
  4137. memcmp(ri->cache_info.identity_digest, ei->cache_info.identity_digest,
  4138. DIGEST_LEN))
  4139. return 1; /* different servers */
  4140. if (ei->pending_sig) {
  4141. char signed_digest[128];
  4142. if (crypto_pk_public_checksig(ri->identity_pkey, signed_digest,
  4143. ei->pending_sig, 128) != 20 ||
  4144. memcmp(signed_digest, ei->cache_info.signed_descriptor_digest,
  4145. DIGEST_LEN)) {
  4146. ei->bad_sig = 1;
  4147. tor_free(ei->pending_sig);
  4148. return 1; /* Bad signature, or no match. */
  4149. }
  4150. tor_free(ei->pending_sig);
  4151. }
  4152. if (ei->cache_info.published_on < ei->cache_info.published_on)
  4153. return 1;
  4154. else if (ei->cache_info.published_on > ei->cache_info.published_on)
  4155. return -1;
  4156. return 0;
  4157. }
  4158. /** Generate networkstatus lines for a single routerstatus_t object, and
  4159. * return the result in a newly allocated string. Used only by controller
  4160. * interface (for now.) */
  4161. /* XXXX This should eventually merge into generate_v2_networkstatus() */
  4162. char *
  4163. networkstatus_getinfo_helper_single(routerstatus_t *rs)
  4164. {
  4165. char buf[192];
  4166. int r;
  4167. struct in_addr in;
  4168. int f_authority;
  4169. char published[ISO_TIME_LEN+1];
  4170. char ipaddr[INET_NTOA_BUF_LEN];
  4171. char identity64[BASE64_DIGEST_LEN+1];
  4172. char digest64[BASE64_DIGEST_LEN+1];
  4173. format_iso_time(published, rs->published_on);
  4174. digest_to_base64(identity64, rs->identity_digest);
  4175. digest_to_base64(digest64, rs->descriptor_digest);
  4176. in.s_addr = htonl(rs->addr);
  4177. tor_inet_ntoa(&in, ipaddr, sizeof(ipaddr));
  4178. f_authority = router_digest_is_trusted_dir(rs->identity_digest);
  4179. r = tor_snprintf(buf, sizeof(buf),
  4180. "r %s %s %s %s %s %d %d\n"
  4181. "s%s%s%s%s%s%s%s%s%s%s\n",
  4182. rs->nickname,
  4183. identity64,
  4184. digest64,
  4185. published,
  4186. ipaddr,
  4187. (int)rs->or_port,
  4188. (int)rs->dir_port,
  4189. f_authority?" Authority":"",
  4190. rs->is_bad_exit?" BadExit":"",
  4191. rs->is_exit?" Exit":"",
  4192. rs->is_fast?" Fast":"",
  4193. rs->is_possible_guard?" Guard":"",
  4194. rs->is_named?" Named":"",
  4195. rs->is_stable?" Stable":"",
  4196. rs->is_running?" Running":"",
  4197. rs->is_valid?" Valid":"",
  4198. rs->is_v2_dir?" V2Dir":"");
  4199. if (r<0)
  4200. log_warn(LD_BUG, "Not enough space in buffer.");
  4201. return tor_strdup(buf);
  4202. }
  4203. /** If <b>question</b> is a string beginning with "ns/" in a format the
  4204. * control interface expects for a GETINFO question, set *<b>answer</b> to a
  4205. * newly-allocated string containing networkstatus lines for the appropriate
  4206. * ORs. Return 0 on success, -1 on unrecognized question format. */
  4207. int
  4208. getinfo_helper_networkstatus(control_connection_t *conn,
  4209. const char *question, char **answer)
  4210. {
  4211. local_routerstatus_t *status;
  4212. (void) conn;
  4213. if (!routerstatus_list) {
  4214. *answer = tor_strdup("");
  4215. return 0;
  4216. }
  4217. if (!strcmp(question, "ns/all")) {
  4218. smartlist_t *statuses = smartlist_create();
  4219. SMARTLIST_FOREACH(routerstatus_list, local_routerstatus_t *, lrs,
  4220. {
  4221. routerstatus_t *rs = &(lrs->status);
  4222. smartlist_add(statuses, networkstatus_getinfo_helper_single(rs));
  4223. });
  4224. *answer = smartlist_join_strings(statuses, "", 0, NULL);
  4225. SMARTLIST_FOREACH(statuses, char *, cp, tor_free(cp));
  4226. smartlist_free(statuses);
  4227. return 0;
  4228. } else if (!strcmpstart(question, "ns/id/")) {
  4229. char d[DIGEST_LEN];
  4230. if (base16_decode(d, DIGEST_LEN, question+6, strlen(question+6)))
  4231. return -1;
  4232. status = router_get_combined_status_by_digest(d);
  4233. } else if (!strcmpstart(question, "ns/name/")) {
  4234. status = router_get_combined_status_by_nickname(question+8, 0);
  4235. } else {
  4236. return -1;
  4237. }
  4238. if (status) {
  4239. *answer = networkstatus_getinfo_helper_single(&status->status);
  4240. }
  4241. return 0;
  4242. }
  4243. /** Assert that the internal representation of <b>rl</b> is
  4244. * self-consistent. */
  4245. void
  4246. routerlist_assert_ok(routerlist_t *rl)
  4247. {
  4248. digestmap_iter_t *iter;
  4249. routerinfo_t *r2;
  4250. signed_descriptor_t *sd2;
  4251. if (!rl)
  4252. return;
  4253. SMARTLIST_FOREACH(rl->routers, routerinfo_t *, r,
  4254. {
  4255. r2 = digestmap_get(rl->identity_map, r->cache_info.identity_digest);
  4256. tor_assert(r == r2);
  4257. sd2 = digestmap_get(rl->desc_digest_map,
  4258. r->cache_info.signed_descriptor_digest);
  4259. tor_assert(&(r->cache_info) == sd2);
  4260. tor_assert(r->routerlist_index == r_sl_idx);
  4261. });
  4262. SMARTLIST_FOREACH(rl->old_routers, signed_descriptor_t *, sd,
  4263. {
  4264. r2 = digestmap_get(rl->identity_map, sd->identity_digest);
  4265. tor_assert(sd != &(r2->cache_info));
  4266. sd2 = digestmap_get(rl->desc_digest_map, sd->signed_descriptor_digest);
  4267. tor_assert(sd == sd2);
  4268. });
  4269. iter = digestmap_iter_init(rl->identity_map);
  4270. while (!digestmap_iter_done(iter)) {
  4271. const char *d;
  4272. void *_r;
  4273. routerinfo_t *r;
  4274. digestmap_iter_get(iter, &d, &_r);
  4275. r = _r;
  4276. tor_assert(!memcmp(r->cache_info.identity_digest, d, DIGEST_LEN));
  4277. iter = digestmap_iter_next(rl->identity_map, iter);
  4278. }
  4279. iter = digestmap_iter_init(rl->desc_digest_map);
  4280. while (!digestmap_iter_done(iter)) {
  4281. const char *d;
  4282. void *_sd;
  4283. signed_descriptor_t *sd;
  4284. digestmap_iter_get(iter, &d, &_sd);
  4285. sd = _sd;
  4286. tor_assert(!memcmp(sd->signed_descriptor_digest, d, DIGEST_LEN));
  4287. iter = digestmap_iter_next(rl->desc_digest_map, iter);
  4288. }
  4289. }
  4290. /** Allocate and return a new string representing the contact info
  4291. * and platform string for <b>router</b>,
  4292. * surrounded by quotes and using standard C escapes.
  4293. *
  4294. * THIS FUNCTION IS NOT REENTRANT. Don't call it from outside the main
  4295. * thread. Also, each call invalidates the last-returned value, so don't
  4296. * try log_warn(LD_GENERAL, "%s %s", esc_router_info(a), esc_router_info(b));
  4297. */
  4298. const char *
  4299. esc_router_info(routerinfo_t *router)
  4300. {
  4301. static char *info;
  4302. char *esc_contact, *esc_platform;
  4303. size_t len;
  4304. if (info)
  4305. tor_free(info);
  4306. esc_contact = esc_for_log(router->contact_info);
  4307. esc_platform = esc_for_log(router->platform);
  4308. len = strlen(esc_contact)+strlen(esc_platform)+32;
  4309. info = tor_malloc(len);
  4310. tor_snprintf(info, len, "Contact %s, Platform %s", esc_contact,
  4311. esc_platform);
  4312. tor_free(esc_contact);
  4313. tor_free(esc_platform);
  4314. return info;
  4315. }