routerlist.c 172 KB

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