routerlist.c 175 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208
  1. /* Copyright (c) 2001 Matej Pfajfar.
  2. * Copyright (c) 2001-2004, Roger Dingledine.
  3. * Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
  4. * Copyright (c) 2007-2014, The Tor Project, Inc. */
  5. /* See LICENSE for licensing information */
  6. /**
  7. * \file routerlist.c
  8. * \brief Code to
  9. * maintain and access the global list of routerinfos for known
  10. * servers.
  11. **/
  12. #define ROUTERLIST_PRIVATE
  13. #include "or.h"
  14. #include "circuitstats.h"
  15. #include "config.h"
  16. #include "connection.h"
  17. #include "control.h"
  18. #include "directory.h"
  19. #include "dirserv.h"
  20. #include "dirvote.h"
  21. #include "entrynodes.h"
  22. #include "fp_pair.h"
  23. #include "geoip.h"
  24. #include "hibernate.h"
  25. #include "main.h"
  26. #include "microdesc.h"
  27. #include "networkstatus.h"
  28. #include "nodelist.h"
  29. #include "policies.h"
  30. #include "reasons.h"
  31. #include "rendcommon.h"
  32. #include "rendservice.h"
  33. #include "rephist.h"
  34. #include "router.h"
  35. #include "routerlist.h"
  36. #include "routerparse.h"
  37. #include "routerset.h"
  38. #include "../common/sandbox.h"
  39. // #define DEBUG_ROUTERLIST
  40. /****************************************************************************/
  41. DECLARE_TYPED_DIGESTMAP_FNS(sdmap_, digest_sd_map_t, signed_descriptor_t)
  42. DECLARE_TYPED_DIGESTMAP_FNS(rimap_, digest_ri_map_t, routerinfo_t)
  43. DECLARE_TYPED_DIGESTMAP_FNS(eimap_, digest_ei_map_t, extrainfo_t)
  44. DECLARE_TYPED_DIGESTMAP_FNS(dsmap_, digest_ds_map_t, download_status_t)
  45. #define SDMAP_FOREACH(map, keyvar, valvar) \
  46. DIGESTMAP_FOREACH(sdmap_to_digestmap(map), keyvar, signed_descriptor_t *, \
  47. valvar)
  48. #define RIMAP_FOREACH(map, keyvar, valvar) \
  49. DIGESTMAP_FOREACH(rimap_to_digestmap(map), keyvar, routerinfo_t *, valvar)
  50. #define EIMAP_FOREACH(map, keyvar, valvar) \
  51. DIGESTMAP_FOREACH(eimap_to_digestmap(map), keyvar, extrainfo_t *, valvar)
  52. #define DSMAP_FOREACH(map, keyvar, valvar) \
  53. DIGESTMAP_FOREACH(dsmap_to_digestmap(map), keyvar, download_status_t *, \
  54. valvar)
  55. /* Forward declaration for cert_list_t */
  56. typedef struct cert_list_t cert_list_t;
  57. /* static function prototypes */
  58. static int compute_weighted_bandwidths(const smartlist_t *sl,
  59. bandwidth_weight_rule_t rule,
  60. u64_dbl_t **bandwidths_out);
  61. static const routerstatus_t *router_pick_directory_server_impl(
  62. dirinfo_type_t auth, int flags);
  63. static const routerstatus_t *router_pick_trusteddirserver_impl(
  64. const smartlist_t *sourcelist, dirinfo_type_t auth,
  65. int flags, int *n_busy_out);
  66. static const routerstatus_t *router_pick_dirserver_generic(
  67. smartlist_t *sourcelist,
  68. dirinfo_type_t type, int flags);
  69. static void mark_all_dirservers_up(smartlist_t *server_list);
  70. static void dir_server_free(dir_server_t *ds);
  71. static int signed_desc_digest_is_recognized(signed_descriptor_t *desc);
  72. static const char *signed_descriptor_get_body_impl(
  73. const signed_descriptor_t *desc,
  74. int with_annotations);
  75. static void list_pending_downloads(digestmap_t *result,
  76. digest256map_t *result256,
  77. int purpose, const char *prefix);
  78. static void list_pending_fpsk_downloads(fp_pair_map_t *result);
  79. static void launch_dummy_descriptor_download_as_needed(time_t now,
  80. const or_options_t *options);
  81. static void download_status_reset_by_sk_in_cl(cert_list_t *cl,
  82. const char *digest);
  83. static int download_status_is_ready_by_sk_in_cl(cert_list_t *cl,
  84. const char *digest,
  85. time_t now, int max_failures);
  86. /****************************************************************************/
  87. /** Global list of a dir_server_t object for each directory
  88. * authority. */
  89. static smartlist_t *trusted_dir_servers = NULL;
  90. /** Global list of dir_server_t objects for all directory authorities
  91. * and all fallback directory servers. */
  92. static smartlist_t *fallback_dir_servers = NULL;
  93. /** List of certificates for a single authority, and download status for
  94. * latest certificate.
  95. */
  96. struct cert_list_t {
  97. /*
  98. * The keys of download status map are cert->signing_key_digest for pending
  99. * downloads by (identity digest/signing key digest) pair; functions such
  100. * as authority_cert_get_by_digest() already assume these are unique.
  101. */
  102. struct digest_ds_map_t *dl_status_map;
  103. /* There is also a dlstatus for the download by identity key only */
  104. download_status_t dl_status_by_id;
  105. smartlist_t *certs;
  106. };
  107. /** Map from v3 identity key digest to cert_list_t. */
  108. static digestmap_t *trusted_dir_certs = NULL;
  109. /** True iff any key certificate in at least one member of
  110. * <b>trusted_dir_certs</b> has changed since we last flushed the
  111. * certificates to disk. */
  112. static int trusted_dir_servers_certs_changed = 0;
  113. /** Global list of all of the routers that we know about. */
  114. static routerlist_t *routerlist = NULL;
  115. /** List of strings for nicknames we've already warned about and that are
  116. * still unknown / unavailable. */
  117. static smartlist_t *warned_nicknames = NULL;
  118. /** The last time we tried to download any routerdesc, or 0 for "never". We
  119. * use this to rate-limit download attempts when the number of routerdescs to
  120. * download is low. */
  121. static time_t last_descriptor_download_attempted = 0;
  122. /** Return the number of directory authorities whose type matches some bit set
  123. * in <b>type</b> */
  124. int
  125. get_n_authorities(dirinfo_type_t type)
  126. {
  127. int n = 0;
  128. if (!trusted_dir_servers)
  129. return 0;
  130. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ds,
  131. if (ds->type & type)
  132. ++n);
  133. return n;
  134. }
  135. /** Reset the download status of a specified element in a dsmap */
  136. static void
  137. download_status_reset_by_sk_in_cl(cert_list_t *cl, const char *digest)
  138. {
  139. download_status_t *dlstatus = NULL;
  140. tor_assert(cl);
  141. tor_assert(digest);
  142. /* Make sure we have a dsmap */
  143. if (!(cl->dl_status_map)) {
  144. cl->dl_status_map = dsmap_new();
  145. }
  146. /* Look for a download_status_t in the map with this digest */
  147. dlstatus = dsmap_get(cl->dl_status_map, digest);
  148. /* Got one? */
  149. if (!dlstatus) {
  150. /* Insert before we reset */
  151. dlstatus = tor_malloc_zero(sizeof(*dlstatus));
  152. dsmap_set(cl->dl_status_map, digest, dlstatus);
  153. }
  154. tor_assert(dlstatus);
  155. /* Go ahead and reset it */
  156. download_status_reset(dlstatus);
  157. }
  158. /**
  159. * Return true if the download for this signing key digest in cl is ready
  160. * to be re-attempted.
  161. */
  162. static int
  163. download_status_is_ready_by_sk_in_cl(cert_list_t *cl,
  164. const char *digest,
  165. time_t now, int max_failures)
  166. {
  167. int rv = 0;
  168. download_status_t *dlstatus = NULL;
  169. tor_assert(cl);
  170. tor_assert(digest);
  171. /* Make sure we have a dsmap */
  172. if (!(cl->dl_status_map)) {
  173. cl->dl_status_map = dsmap_new();
  174. }
  175. /* Look for a download_status_t in the map with this digest */
  176. dlstatus = dsmap_get(cl->dl_status_map, digest);
  177. /* Got one? */
  178. if (dlstatus) {
  179. /* Use download_status_is_ready() */
  180. rv = download_status_is_ready(dlstatus, now, max_failures);
  181. } else {
  182. /*
  183. * If we don't know anything about it, return 1, since we haven't
  184. * tried this one before. We need to create a new entry here,
  185. * too.
  186. */
  187. dlstatus = tor_malloc_zero(sizeof(*dlstatus));
  188. download_status_reset(dlstatus);
  189. dsmap_set(cl->dl_status_map, digest, dlstatus);
  190. rv = 1;
  191. }
  192. return rv;
  193. }
  194. /** Helper: Return the cert_list_t for an authority whose authority ID is
  195. * <b>id_digest</b>, allocating a new list if necessary. */
  196. static cert_list_t *
  197. get_cert_list(const char *id_digest)
  198. {
  199. cert_list_t *cl;
  200. if (!trusted_dir_certs)
  201. trusted_dir_certs = digestmap_new();
  202. cl = digestmap_get(trusted_dir_certs, id_digest);
  203. if (!cl) {
  204. cl = tor_malloc_zero(sizeof(cert_list_t));
  205. cl->dl_status_by_id.schedule = DL_SCHED_CONSENSUS;
  206. cl->certs = smartlist_new();
  207. cl->dl_status_map = dsmap_new();
  208. digestmap_set(trusted_dir_certs, id_digest, cl);
  209. }
  210. return cl;
  211. }
  212. /** Release all space held by a cert_list_t */
  213. static void
  214. cert_list_free(cert_list_t *cl)
  215. {
  216. if (!cl)
  217. return;
  218. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, cert,
  219. authority_cert_free(cert));
  220. smartlist_free(cl->certs);
  221. dsmap_free(cl->dl_status_map, tor_free_);
  222. tor_free(cl);
  223. }
  224. /** Wrapper for cert_list_free so we can pass it to digestmap_free */
  225. static void
  226. cert_list_free_(void *cl)
  227. {
  228. cert_list_free(cl);
  229. }
  230. /** Reload the cached v3 key certificates from the cached-certs file in
  231. * the data directory. Return 0 on success, -1 on failure. */
  232. int
  233. trusted_dirs_reload_certs(void)
  234. {
  235. char *filename;
  236. char *contents;
  237. int r;
  238. filename = get_datadir_fname("cached-certs");
  239. contents = read_file_to_str(filename, RFTS_IGNORE_MISSING, NULL);
  240. tor_free(filename);
  241. if (!contents)
  242. return 0;
  243. r = trusted_dirs_load_certs_from_string(
  244. contents,
  245. TRUSTED_DIRS_CERTS_SRC_FROM_STORE, 1);
  246. tor_free(contents);
  247. return r;
  248. }
  249. /** Helper: return true iff we already have loaded the exact cert
  250. * <b>cert</b>. */
  251. static INLINE int
  252. already_have_cert(authority_cert_t *cert)
  253. {
  254. cert_list_t *cl = get_cert_list(cert->cache_info.identity_digest);
  255. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, c,
  256. {
  257. if (tor_memeq(c->cache_info.signed_descriptor_digest,
  258. cert->cache_info.signed_descriptor_digest,
  259. DIGEST_LEN))
  260. return 1;
  261. });
  262. return 0;
  263. }
  264. /** Load a bunch of new key certificates from the string <b>contents</b>. If
  265. * <b>source</b> is TRUSTED_DIRS_CERTS_SRC_FROM_STORE, the certificates are
  266. * from the cache, and we don't need to flush them to disk. If we are a
  267. * dirauth loading our own cert, source is TRUSTED_DIRS_CERTS_SRC_SELF.
  268. * Otherwise, source is download type: TRUSTED_DIRS_CERTS_SRC_DL_BY_ID_DIGEST
  269. * or TRUSTED_DIRS_CERTS_SRC_DL_BY_ID_SK_DIGEST. If <b>flush</b> is true, we
  270. * need to flush any changed certificates to disk now. Return 0 on success,
  271. * -1 if any certs fail to parse.
  272. */
  273. int
  274. trusted_dirs_load_certs_from_string(const char *contents, int source,
  275. int flush)
  276. {
  277. dir_server_t *ds;
  278. const char *s, *eos;
  279. int failure_code = 0;
  280. int from_store = (source == TRUSTED_DIRS_CERTS_SRC_FROM_STORE);
  281. for (s = contents; *s; s = eos) {
  282. authority_cert_t *cert = authority_cert_parse_from_string(s, &eos);
  283. cert_list_t *cl;
  284. if (!cert) {
  285. failure_code = -1;
  286. break;
  287. }
  288. ds = trusteddirserver_get_by_v3_auth_digest(
  289. cert->cache_info.identity_digest);
  290. log_debug(LD_DIR, "Parsed certificate for %s",
  291. ds ? ds->nickname : "unknown authority");
  292. if (already_have_cert(cert)) {
  293. /* we already have this one. continue. */
  294. log_info(LD_DIR, "Skipping %s certificate for %s that we "
  295. "already have.",
  296. from_store ? "cached" : "downloaded",
  297. ds ? ds->nickname : "an old or new authority");
  298. /*
  299. * A duplicate on download should be treated as a failure, so we call
  300. * authority_cert_dl_failed() to reset the download status to make sure
  301. * we can't try again. Since we've implemented the fp-sk mechanism
  302. * to download certs by signing key, this should be much rarer than it
  303. * was and is perhaps cause for concern.
  304. */
  305. if (!from_store) {
  306. if (authdir_mode(get_options())) {
  307. log_warn(LD_DIR,
  308. "Got a certificate for %s, but we already have it. "
  309. "Maybe they haven't updated it. Waiting for a while.",
  310. ds ? ds->nickname : "an old or new authority");
  311. } else {
  312. log_info(LD_DIR,
  313. "Got a certificate for %s, but we already have it. "
  314. "Maybe they haven't updated it. Waiting for a while.",
  315. ds ? ds->nickname : "an old or new authority");
  316. }
  317. /*
  318. * This is where we care about the source; authority_cert_dl_failed()
  319. * needs to know whether the download was by fp or (fp,sk) pair to
  320. * twiddle the right bit in the download map.
  321. */
  322. if (source == TRUSTED_DIRS_CERTS_SRC_DL_BY_ID_DIGEST) {
  323. authority_cert_dl_failed(cert->cache_info.identity_digest,
  324. NULL, 404);
  325. } else if (source == TRUSTED_DIRS_CERTS_SRC_DL_BY_ID_SK_DIGEST) {
  326. authority_cert_dl_failed(cert->cache_info.identity_digest,
  327. cert->signing_key_digest, 404);
  328. }
  329. }
  330. authority_cert_free(cert);
  331. continue;
  332. }
  333. if (ds) {
  334. log_info(LD_DIR, "Adding %s certificate for directory authority %s with "
  335. "signing key %s", from_store ? "cached" : "downloaded",
  336. ds->nickname, hex_str(cert->signing_key_digest,DIGEST_LEN));
  337. } else {
  338. int adding = directory_caches_unknown_auth_certs(get_options());
  339. log_info(LD_DIR, "%s %s certificate for unrecognized directory "
  340. "authority with signing key %s",
  341. adding ? "Adding" : "Not adding",
  342. from_store ? "cached" : "downloaded",
  343. hex_str(cert->signing_key_digest,DIGEST_LEN));
  344. if (!adding) {
  345. authority_cert_free(cert);
  346. continue;
  347. }
  348. }
  349. cl = get_cert_list(cert->cache_info.identity_digest);
  350. smartlist_add(cl->certs, cert);
  351. if (ds && cert->cache_info.published_on > ds->addr_current_at) {
  352. /* Check to see whether we should update our view of the authority's
  353. * address. */
  354. if (cert->addr && cert->dir_port &&
  355. (ds->addr != cert->addr ||
  356. ds->dir_port != cert->dir_port)) {
  357. char *a = tor_dup_ip(cert->addr);
  358. log_notice(LD_DIR, "Updating address for directory authority %s "
  359. "from %s:%d to %s:%d based on certificate.",
  360. ds->nickname, ds->address, (int)ds->dir_port,
  361. a, cert->dir_port);
  362. tor_free(a);
  363. ds->addr = cert->addr;
  364. ds->dir_port = cert->dir_port;
  365. }
  366. ds->addr_current_at = cert->cache_info.published_on;
  367. }
  368. if (!from_store)
  369. trusted_dir_servers_certs_changed = 1;
  370. }
  371. if (flush)
  372. trusted_dirs_flush_certs_to_disk();
  373. /* call this even if failure_code is <0, since some certs might have
  374. * succeeded. */
  375. networkstatus_note_certs_arrived();
  376. return failure_code;
  377. }
  378. /** Save all v3 key certificates to the cached-certs file. */
  379. void
  380. trusted_dirs_flush_certs_to_disk(void)
  381. {
  382. char *filename;
  383. smartlist_t *chunks;
  384. if (!trusted_dir_servers_certs_changed || !trusted_dir_certs)
  385. return;
  386. chunks = smartlist_new();
  387. DIGESTMAP_FOREACH(trusted_dir_certs, key, cert_list_t *, cl) {
  388. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, cert,
  389. {
  390. sized_chunk_t *c = tor_malloc(sizeof(sized_chunk_t));
  391. c->bytes = cert->cache_info.signed_descriptor_body;
  392. c->len = cert->cache_info.signed_descriptor_len;
  393. smartlist_add(chunks, c);
  394. });
  395. } DIGESTMAP_FOREACH_END;
  396. filename = get_datadir_fname("cached-certs");
  397. if (write_chunks_to_file(filename, chunks, 0, 0)) {
  398. log_warn(LD_FS, "Error writing certificates to disk.");
  399. }
  400. tor_free(filename);
  401. SMARTLIST_FOREACH(chunks, sized_chunk_t *, c, tor_free(c));
  402. smartlist_free(chunks);
  403. trusted_dir_servers_certs_changed = 0;
  404. }
  405. /** Remove all expired v3 authority certificates that have been superseded for
  406. * more than 48 hours or, if not expired, that were published more than 7 days
  407. * before being superseded. (If the most recent cert was published more than 48
  408. * hours ago, then we aren't going to get any consensuses signed with older
  409. * keys.) */
  410. static void
  411. trusted_dirs_remove_old_certs(void)
  412. {
  413. time_t now = time(NULL);
  414. #define DEAD_CERT_LIFETIME (2*24*60*60)
  415. #define OLD_CERT_LIFETIME (7*24*60*60)
  416. if (!trusted_dir_certs)
  417. return;
  418. DIGESTMAP_FOREACH(trusted_dir_certs, key, cert_list_t *, cl) {
  419. authority_cert_t *newest = NULL;
  420. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, cert,
  421. if (!newest || (cert->cache_info.published_on >
  422. newest->cache_info.published_on))
  423. newest = cert);
  424. if (newest) {
  425. const time_t newest_published = newest->cache_info.published_on;
  426. SMARTLIST_FOREACH_BEGIN(cl->certs, authority_cert_t *, cert) {
  427. int expired;
  428. time_t cert_published;
  429. if (newest == cert)
  430. continue;
  431. /* resolve spurious clang shallow analysis null pointer errors */
  432. tor_assert(cert);
  433. expired = now > cert->expires;
  434. cert_published = cert->cache_info.published_on;
  435. /* Store expired certs for 48 hours after a newer arrives;
  436. */
  437. if (expired ?
  438. (newest_published + DEAD_CERT_LIFETIME < now) :
  439. (cert_published + OLD_CERT_LIFETIME < newest_published)) {
  440. SMARTLIST_DEL_CURRENT(cl->certs, cert);
  441. authority_cert_free(cert);
  442. trusted_dir_servers_certs_changed = 1;
  443. }
  444. } SMARTLIST_FOREACH_END(cert);
  445. }
  446. } DIGESTMAP_FOREACH_END;
  447. #undef DEAD_CERT_LIFETIME
  448. #undef OLD_CERT_LIFETIME
  449. trusted_dirs_flush_certs_to_disk();
  450. }
  451. /** Return the newest v3 authority certificate whose v3 authority identity key
  452. * has digest <b>id_digest</b>. Return NULL if no such authority is known,
  453. * or it has no certificate. */
  454. authority_cert_t *
  455. authority_cert_get_newest_by_id(const char *id_digest)
  456. {
  457. cert_list_t *cl;
  458. authority_cert_t *best = NULL;
  459. if (!trusted_dir_certs ||
  460. !(cl = digestmap_get(trusted_dir_certs, id_digest)))
  461. return NULL;
  462. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, cert,
  463. {
  464. if (!best || cert->cache_info.published_on > best->cache_info.published_on)
  465. best = cert;
  466. });
  467. return best;
  468. }
  469. /** Return the newest v3 authority certificate whose directory signing key has
  470. * digest <b>sk_digest</b>. Return NULL if no such certificate is known.
  471. */
  472. authority_cert_t *
  473. authority_cert_get_by_sk_digest(const char *sk_digest)
  474. {
  475. authority_cert_t *c;
  476. if (!trusted_dir_certs)
  477. return NULL;
  478. if ((c = get_my_v3_authority_cert()) &&
  479. tor_memeq(c->signing_key_digest, sk_digest, DIGEST_LEN))
  480. return c;
  481. if ((c = get_my_v3_legacy_cert()) &&
  482. tor_memeq(c->signing_key_digest, sk_digest, DIGEST_LEN))
  483. return c;
  484. DIGESTMAP_FOREACH(trusted_dir_certs, key, cert_list_t *, cl) {
  485. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, cert,
  486. {
  487. if (tor_memeq(cert->signing_key_digest, sk_digest, DIGEST_LEN))
  488. return cert;
  489. });
  490. } DIGESTMAP_FOREACH_END;
  491. return NULL;
  492. }
  493. /** Return the v3 authority certificate with signing key matching
  494. * <b>sk_digest</b>, for the authority with identity digest <b>id_digest</b>.
  495. * Return NULL if no such authority is known. */
  496. authority_cert_t *
  497. authority_cert_get_by_digests(const char *id_digest,
  498. const char *sk_digest)
  499. {
  500. cert_list_t *cl;
  501. if (!trusted_dir_certs ||
  502. !(cl = digestmap_get(trusted_dir_certs, id_digest)))
  503. return NULL;
  504. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, cert,
  505. if (tor_memeq(cert->signing_key_digest, sk_digest, DIGEST_LEN))
  506. return cert; );
  507. return NULL;
  508. }
  509. /** Add every known authority_cert_t to <b>certs_out</b>. */
  510. void
  511. authority_cert_get_all(smartlist_t *certs_out)
  512. {
  513. tor_assert(certs_out);
  514. if (!trusted_dir_certs)
  515. return;
  516. DIGESTMAP_FOREACH(trusted_dir_certs, key, cert_list_t *, cl) {
  517. SMARTLIST_FOREACH(cl->certs, authority_cert_t *, c,
  518. smartlist_add(certs_out, c));
  519. } DIGESTMAP_FOREACH_END;
  520. }
  521. /** Called when an attempt to download a certificate with the authority with
  522. * ID <b>id_digest</b> and, if not NULL, signed with key signing_key_digest
  523. * fails with HTTP response code <b>status</b>: remember the failure, so we
  524. * don't try again immediately. */
  525. void
  526. authority_cert_dl_failed(const char *id_digest,
  527. const char *signing_key_digest, int status)
  528. {
  529. cert_list_t *cl;
  530. download_status_t *dlstatus = NULL;
  531. char id_digest_str[2*DIGEST_LEN+1];
  532. char sk_digest_str[2*DIGEST_LEN+1];
  533. if (!trusted_dir_certs ||
  534. !(cl = digestmap_get(trusted_dir_certs, id_digest)))
  535. return;
  536. /*
  537. * Are we noting a failed download of the latest cert for the id digest,
  538. * or of a download by (id, signing key) digest pair?
  539. */
  540. if (!signing_key_digest) {
  541. /* Just by id digest */
  542. download_status_failed(&cl->dl_status_by_id, status);
  543. } else {
  544. /* Reset by (id, signing key) digest pair
  545. *
  546. * Look for a download_status_t in the map with this digest
  547. */
  548. dlstatus = dsmap_get(cl->dl_status_map, signing_key_digest);
  549. /* Got one? */
  550. if (dlstatus) {
  551. download_status_failed(dlstatus, status);
  552. } else {
  553. /*
  554. * Do this rather than hex_str(), since hex_str clobbers
  555. * old results and we call twice in the param list.
  556. */
  557. base16_encode(id_digest_str, sizeof(id_digest_str),
  558. id_digest, DIGEST_LEN);
  559. base16_encode(sk_digest_str, sizeof(sk_digest_str),
  560. signing_key_digest, DIGEST_LEN);
  561. log_warn(LD_BUG,
  562. "Got failure for cert fetch with (fp,sk) = (%s,%s), with "
  563. "status %d, but knew nothing about the download.",
  564. id_digest_str, sk_digest_str, status);
  565. }
  566. }
  567. }
  568. static const char *BAD_SIGNING_KEYS[] = {
  569. "09CD84F751FD6E955E0F8ADB497D5401470D697E", // Expires 2015-01-11 16:26:31
  570. "0E7E9C07F0969D0468AD741E172A6109DC289F3C", // Expires 2014-08-12 10:18:26
  571. "57B85409891D3FB32137F642FDEDF8B7F8CDFDCD", // Expires 2015-02-11 17:19:09
  572. "87326329007AF781F587AF5B594E540B2B6C7630", // Expires 2014-07-17 11:10:09
  573. "98CC82342DE8D298CF99D3F1A396475901E0D38E", // Expires 2014-11-10 13:18:56
  574. "9904B52336713A5ADCB13E4FB14DC919E0D45571", // Expires 2014-04-20 20:01:01
  575. "9DCD8E3F1DD1597E2AD476BBA28A1A89F3095227", // Expires 2015-01-16 03:52:30
  576. "A61682F34B9BB9694AC98491FE1ABBFE61923941", // Expires 2014-06-11 09:25:09
  577. "B59F6E99C575113650C99F1C425BA7B20A8C071D", // Expires 2014-07-31 13:22:10
  578. "D27178388FA75B96D37FA36E0B015227DDDBDA51", // Expires 2014-08-04 04:01:57
  579. NULL,
  580. };
  581. /** DOCDOC */
  582. int
  583. authority_cert_is_blacklisted(const authority_cert_t *cert)
  584. {
  585. char hex_digest[HEX_DIGEST_LEN+1];
  586. int i;
  587. base16_encode(hex_digest, sizeof(hex_digest),
  588. cert->signing_key_digest, sizeof(cert->signing_key_digest));
  589. for (i = 0; BAD_SIGNING_KEYS[i]; ++i) {
  590. if (!strcasecmp(hex_digest, BAD_SIGNING_KEYS[i])) {
  591. return 1;
  592. }
  593. }
  594. return 0;
  595. }
  596. /** Return true iff when we've been getting enough failures when trying to
  597. * download the certificate with ID digest <b>id_digest</b> that we're willing
  598. * to start bugging the user about it. */
  599. int
  600. authority_cert_dl_looks_uncertain(const char *id_digest)
  601. {
  602. #define N_AUTH_CERT_DL_FAILURES_TO_BUG_USER 2
  603. cert_list_t *cl;
  604. int n_failures;
  605. if (!trusted_dir_certs ||
  606. !(cl = digestmap_get(trusted_dir_certs, id_digest)))
  607. return 0;
  608. n_failures = download_status_get_n_failures(&cl->dl_status_by_id);
  609. return n_failures >= N_AUTH_CERT_DL_FAILURES_TO_BUG_USER;
  610. }
  611. /** Try to download any v3 authority certificates that we may be missing. If
  612. * <b>status</b> is provided, try to get all the ones that were used to sign
  613. * <b>status</b>. Additionally, try to have a non-expired certificate for
  614. * every V3 authority in trusted_dir_servers. Don't fetch certificates we
  615. * already have.
  616. **/
  617. void
  618. authority_certs_fetch_missing(networkstatus_t *status, time_t now)
  619. {
  620. /*
  621. * The pending_id digestmap tracks pending certificate downloads by
  622. * identity digest; the pending_cert digestmap tracks pending downloads
  623. * by (identity digest, signing key digest) pairs.
  624. */
  625. digestmap_t *pending_id;
  626. fp_pair_map_t *pending_cert;
  627. authority_cert_t *cert;
  628. /*
  629. * The missing_id_digests smartlist will hold a list of id digests
  630. * we want to fetch the newest cert for; the missing_cert_digests
  631. * smartlist will hold a list of fp_pair_t with an identity and
  632. * signing key digest.
  633. */
  634. smartlist_t *missing_cert_digests, *missing_id_digests;
  635. char *resource = NULL;
  636. cert_list_t *cl;
  637. const int cache = directory_caches_unknown_auth_certs(get_options());
  638. fp_pair_t *fp_tmp = NULL;
  639. char id_digest_str[2*DIGEST_LEN+1];
  640. char sk_digest_str[2*DIGEST_LEN+1];
  641. if (should_delay_dir_fetches(get_options(), NULL))
  642. return;
  643. pending_cert = fp_pair_map_new();
  644. pending_id = digestmap_new();
  645. missing_cert_digests = smartlist_new();
  646. missing_id_digests = smartlist_new();
  647. /*
  648. * First, we get the lists of already pending downloads so we don't
  649. * duplicate effort.
  650. */
  651. list_pending_downloads(pending_id, NULL,
  652. DIR_PURPOSE_FETCH_CERTIFICATE, "fp/");
  653. list_pending_fpsk_downloads(pending_cert);
  654. /*
  655. * Now, we download any trusted authority certs we don't have by
  656. * identity digest only. This gets the latest cert for that authority.
  657. */
  658. SMARTLIST_FOREACH_BEGIN(trusted_dir_servers, dir_server_t *, ds) {
  659. int found = 0;
  660. if (!(ds->type & V3_DIRINFO))
  661. continue;
  662. if (smartlist_contains_digest(missing_id_digests,
  663. ds->v3_identity_digest))
  664. continue;
  665. cl = get_cert_list(ds->v3_identity_digest);
  666. SMARTLIST_FOREACH_BEGIN(cl->certs, authority_cert_t *, cert) {
  667. if (now < cert->expires) {
  668. /* It's not expired, and we weren't looking for something to
  669. * verify a consensus with. Call it done. */
  670. download_status_reset(&(cl->dl_status_by_id));
  671. /* No sense trying to download it specifically by signing key hash */
  672. download_status_reset_by_sk_in_cl(cl, cert->signing_key_digest);
  673. found = 1;
  674. break;
  675. }
  676. } SMARTLIST_FOREACH_END(cert);
  677. if (!found &&
  678. download_status_is_ready(&(cl->dl_status_by_id), now,
  679. get_options()->TestingCertMaxDownloadTries) &&
  680. !digestmap_get(pending_id, ds->v3_identity_digest)) {
  681. log_info(LD_DIR,
  682. "No current certificate known for authority %s "
  683. "(ID digest %s); launching request.",
  684. ds->nickname, hex_str(ds->v3_identity_digest, DIGEST_LEN));
  685. smartlist_add(missing_id_digests, ds->v3_identity_digest);
  686. }
  687. } SMARTLIST_FOREACH_END(ds);
  688. /*
  689. * Next, if we have a consensus, scan through it and look for anything
  690. * signed with a key from a cert we don't have. Those get downloaded
  691. * by (fp,sk) pair, but if we don't know any certs at all for the fp
  692. * (identity digest), and it's one of the trusted dir server certs
  693. * we started off above or a pending download in pending_id, don't
  694. * try to get it yet. Most likely, the one we'll get for that will
  695. * have the right signing key too, and we'd just be downloading
  696. * redundantly.
  697. */
  698. if (status) {
  699. SMARTLIST_FOREACH_BEGIN(status->voters, networkstatus_voter_info_t *,
  700. voter) {
  701. if (!smartlist_len(voter->sigs))
  702. continue; /* This authority never signed this consensus, so don't
  703. * go looking for a cert with key digest 0000000000. */
  704. if (!cache &&
  705. !trusteddirserver_get_by_v3_auth_digest(voter->identity_digest))
  706. continue; /* We are not a cache, and we don't know this authority.*/
  707. /*
  708. * If we don't know *any* cert for this authority, and a download by ID
  709. * is pending or we added it to missing_id_digests above, skip this
  710. * one for now to avoid duplicate downloads.
  711. */
  712. cl = get_cert_list(voter->identity_digest);
  713. if (smartlist_len(cl->certs) == 0) {
  714. /* We have no certs at all for this one */
  715. /* Do we have a download of one pending? */
  716. if (digestmap_get(pending_id, voter->identity_digest))
  717. continue;
  718. /*
  719. * Are we about to launch a download of one due to the trusted
  720. * dir server check above?
  721. */
  722. if (smartlist_contains_digest(missing_id_digests,
  723. voter->identity_digest))
  724. continue;
  725. }
  726. SMARTLIST_FOREACH_BEGIN(voter->sigs, document_signature_t *, sig) {
  727. cert = authority_cert_get_by_digests(voter->identity_digest,
  728. sig->signing_key_digest);
  729. if (cert) {
  730. if (now < cert->expires)
  731. download_status_reset_by_sk_in_cl(cl, sig->signing_key_digest);
  732. continue;
  733. }
  734. if (download_status_is_ready_by_sk_in_cl(
  735. cl, sig->signing_key_digest,
  736. now, get_options()->TestingCertMaxDownloadTries) &&
  737. !fp_pair_map_get_by_digests(pending_cert,
  738. voter->identity_digest,
  739. sig->signing_key_digest)) {
  740. /*
  741. * Do this rather than hex_str(), since hex_str clobbers
  742. * old results and we call twice in the param list.
  743. */
  744. base16_encode(id_digest_str, sizeof(id_digest_str),
  745. voter->identity_digest, DIGEST_LEN);
  746. base16_encode(sk_digest_str, sizeof(sk_digest_str),
  747. sig->signing_key_digest, DIGEST_LEN);
  748. if (voter->nickname) {
  749. log_info(LD_DIR,
  750. "We're missing a certificate from authority %s "
  751. "(ID digest %s) with signing key %s: "
  752. "launching request.",
  753. voter->nickname, id_digest_str, sk_digest_str);
  754. } else {
  755. log_info(LD_DIR,
  756. "We're missing a certificate from authority ID digest "
  757. "%s with signing key %s: launching request.",
  758. id_digest_str, sk_digest_str);
  759. }
  760. /* Allocate a new fp_pair_t to append */
  761. fp_tmp = tor_malloc(sizeof(*fp_tmp));
  762. memcpy(fp_tmp->first, voter->identity_digest, sizeof(fp_tmp->first));
  763. memcpy(fp_tmp->second, sig->signing_key_digest,
  764. sizeof(fp_tmp->second));
  765. smartlist_add(missing_cert_digests, fp_tmp);
  766. }
  767. } SMARTLIST_FOREACH_END(sig);
  768. } SMARTLIST_FOREACH_END(voter);
  769. }
  770. /* Do downloads by identity digest */
  771. if (smartlist_len(missing_id_digests) > 0) {
  772. int need_plus = 0;
  773. smartlist_t *fps = smartlist_new();
  774. smartlist_add(fps, tor_strdup("fp/"));
  775. SMARTLIST_FOREACH_BEGIN(missing_id_digests, const char *, d) {
  776. char *fp = NULL;
  777. if (digestmap_get(pending_id, d))
  778. continue;
  779. base16_encode(id_digest_str, sizeof(id_digest_str),
  780. d, DIGEST_LEN);
  781. if (need_plus) {
  782. tor_asprintf(&fp, "+%s", id_digest_str);
  783. } else {
  784. /* No need for tor_asprintf() in this case; first one gets no '+' */
  785. fp = tor_strdup(id_digest_str);
  786. need_plus = 1;
  787. }
  788. smartlist_add(fps, fp);
  789. } SMARTLIST_FOREACH_END(d);
  790. if (smartlist_len(fps) > 1) {
  791. resource = smartlist_join_strings(fps, "", 0, NULL);
  792. directory_get_from_dirserver(DIR_PURPOSE_FETCH_CERTIFICATE, 0,
  793. resource, PDS_RETRY_IF_NO_SERVERS);
  794. tor_free(resource);
  795. }
  796. /* else we didn't add any: they were all pending */
  797. SMARTLIST_FOREACH(fps, char *, cp, tor_free(cp));
  798. smartlist_free(fps);
  799. }
  800. /* Do downloads by identity digest/signing key pair */
  801. if (smartlist_len(missing_cert_digests) > 0) {
  802. int need_plus = 0;
  803. smartlist_t *fp_pairs = smartlist_new();
  804. smartlist_add(fp_pairs, tor_strdup("fp-sk/"));
  805. SMARTLIST_FOREACH_BEGIN(missing_cert_digests, const fp_pair_t *, d) {
  806. char *fp_pair = NULL;
  807. if (fp_pair_map_get(pending_cert, d))
  808. continue;
  809. /* Construct string encodings of the digests */
  810. base16_encode(id_digest_str, sizeof(id_digest_str),
  811. d->first, DIGEST_LEN);
  812. base16_encode(sk_digest_str, sizeof(sk_digest_str),
  813. d->second, DIGEST_LEN);
  814. /* Now tor_asprintf() */
  815. if (need_plus) {
  816. tor_asprintf(&fp_pair, "+%s-%s", id_digest_str, sk_digest_str);
  817. } else {
  818. /* First one in the list doesn't get a '+' */
  819. tor_asprintf(&fp_pair, "%s-%s", id_digest_str, sk_digest_str);
  820. need_plus = 1;
  821. }
  822. /* Add it to the list of pairs to request */
  823. smartlist_add(fp_pairs, fp_pair);
  824. } SMARTLIST_FOREACH_END(d);
  825. if (smartlist_len(fp_pairs) > 1) {
  826. resource = smartlist_join_strings(fp_pairs, "", 0, NULL);
  827. directory_get_from_dirserver(DIR_PURPOSE_FETCH_CERTIFICATE, 0,
  828. resource, PDS_RETRY_IF_NO_SERVERS);
  829. tor_free(resource);
  830. }
  831. /* else they were all pending */
  832. SMARTLIST_FOREACH(fp_pairs, char *, p, tor_free(p));
  833. smartlist_free(fp_pairs);
  834. }
  835. smartlist_free(missing_id_digests);
  836. SMARTLIST_FOREACH(missing_cert_digests, fp_pair_t *, p, tor_free(p));
  837. smartlist_free(missing_cert_digests);
  838. digestmap_free(pending_id, NULL);
  839. fp_pair_map_free(pending_cert, NULL);
  840. }
  841. /* Router descriptor storage.
  842. *
  843. * Routerdescs are stored in a big file, named "cached-descriptors". As new
  844. * routerdescs arrive, we append them to a journal file named
  845. * "cached-descriptors.new".
  846. *
  847. * From time to time, we replace "cached-descriptors" with a new file
  848. * containing only the live, non-superseded descriptors, and clear
  849. * cached-routers.new.
  850. *
  851. * On startup, we read both files.
  852. */
  853. /** Helper: return 1 iff the router log is so big we want to rebuild the
  854. * store. */
  855. static int
  856. router_should_rebuild_store(desc_store_t *store)
  857. {
  858. if (store->store_len > (1<<16))
  859. return (store->journal_len > store->store_len / 2 ||
  860. store->bytes_dropped > store->store_len / 2);
  861. else
  862. return store->journal_len > (1<<15);
  863. }
  864. /** Return the desc_store_t in <b>rl</b> that should be used to store
  865. * <b>sd</b>. */
  866. static INLINE desc_store_t *
  867. desc_get_store(routerlist_t *rl, const signed_descriptor_t *sd)
  868. {
  869. if (sd->is_extrainfo)
  870. return &rl->extrainfo_store;
  871. else
  872. return &rl->desc_store;
  873. }
  874. /** Add the signed_descriptor_t in <b>desc</b> to the router
  875. * journal; change its saved_location to SAVED_IN_JOURNAL and set its
  876. * offset appropriately. */
  877. static int
  878. signed_desc_append_to_journal(signed_descriptor_t *desc,
  879. desc_store_t *store)
  880. {
  881. char *fname = get_datadir_fname_suffix(store->fname_base, ".new");
  882. const char *body = signed_descriptor_get_body_impl(desc,1);
  883. size_t len = desc->signed_descriptor_len + desc->annotations_len;
  884. if (append_bytes_to_file(fname, body, len, 1)) {
  885. log_warn(LD_FS, "Unable to store router descriptor");
  886. tor_free(fname);
  887. return -1;
  888. }
  889. desc->saved_location = SAVED_IN_JOURNAL;
  890. tor_free(fname);
  891. desc->saved_offset = store->journal_len;
  892. store->journal_len += len;
  893. return 0;
  894. }
  895. /** Sorting helper: return &lt;0, 0, or &gt;0 depending on whether the
  896. * signed_descriptor_t* in *<b>a</b> is older, the same age as, or newer than
  897. * the signed_descriptor_t* in *<b>b</b>. */
  898. static int
  899. compare_signed_descriptors_by_age_(const void **_a, const void **_b)
  900. {
  901. const signed_descriptor_t *r1 = *_a, *r2 = *_b;
  902. return (int)(r1->published_on - r2->published_on);
  903. }
  904. #define RRS_FORCE 1
  905. #define RRS_DONT_REMOVE_OLD 2
  906. /** If the journal of <b>store</b> is too long, or if RRS_FORCE is set in
  907. * <b>flags</b>, then atomically replace the saved router store with the
  908. * routers currently in our routerlist, and clear the journal. Unless
  909. * RRS_DONT_REMOVE_OLD is set in <b>flags</b>, delete expired routers before
  910. * rebuilding the store. Return 0 on success, -1 on failure.
  911. */
  912. static int
  913. router_rebuild_store(int flags, desc_store_t *store)
  914. {
  915. smartlist_t *chunk_list = NULL;
  916. char *fname = NULL, *fname_tmp = NULL;
  917. int r = -1;
  918. off_t offset = 0;
  919. smartlist_t *signed_descriptors = NULL;
  920. int nocache=0;
  921. size_t total_expected_len = 0;
  922. int had_any;
  923. int force = flags & RRS_FORCE;
  924. if (!force && !router_should_rebuild_store(store)) {
  925. r = 0;
  926. goto done;
  927. }
  928. if (!routerlist) {
  929. r = 0;
  930. goto done;
  931. }
  932. if (store->type == EXTRAINFO_STORE)
  933. had_any = !eimap_isempty(routerlist->extra_info_map);
  934. else
  935. had_any = (smartlist_len(routerlist->routers)+
  936. smartlist_len(routerlist->old_routers))>0;
  937. /* Don't save deadweight. */
  938. if (!(flags & RRS_DONT_REMOVE_OLD))
  939. routerlist_remove_old_routers();
  940. log_info(LD_DIR, "Rebuilding %s cache", store->description);
  941. fname = get_datadir_fname(store->fname_base);
  942. fname_tmp = get_datadir_fname_suffix(store->fname_base, ".tmp");
  943. chunk_list = smartlist_new();
  944. /* We sort the routers by age to enhance locality on disk. */
  945. signed_descriptors = smartlist_new();
  946. if (store->type == EXTRAINFO_STORE) {
  947. eimap_iter_t *iter;
  948. for (iter = eimap_iter_init(routerlist->extra_info_map);
  949. !eimap_iter_done(iter);
  950. iter = eimap_iter_next(routerlist->extra_info_map, iter)) {
  951. const char *key;
  952. extrainfo_t *ei;
  953. eimap_iter_get(iter, &key, &ei);
  954. smartlist_add(signed_descriptors, &ei->cache_info);
  955. }
  956. } else {
  957. SMARTLIST_FOREACH(routerlist->old_routers, signed_descriptor_t *, sd,
  958. smartlist_add(signed_descriptors, sd));
  959. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, ri,
  960. smartlist_add(signed_descriptors, &ri->cache_info));
  961. }
  962. smartlist_sort(signed_descriptors, compare_signed_descriptors_by_age_);
  963. /* Now, add the appropriate members to chunk_list */
  964. SMARTLIST_FOREACH_BEGIN(signed_descriptors, signed_descriptor_t *, sd) {
  965. sized_chunk_t *c;
  966. const char *body = signed_descriptor_get_body_impl(sd, 1);
  967. if (!body) {
  968. log_warn(LD_BUG, "No descriptor available for router.");
  969. goto done;
  970. }
  971. if (sd->do_not_cache) {
  972. ++nocache;
  973. continue;
  974. }
  975. c = tor_malloc(sizeof(sized_chunk_t));
  976. c->bytes = body;
  977. c->len = sd->signed_descriptor_len + sd->annotations_len;
  978. total_expected_len += c->len;
  979. smartlist_add(chunk_list, c);
  980. } SMARTLIST_FOREACH_END(sd);
  981. if (write_chunks_to_file(fname_tmp, chunk_list, 1, 1)<0) {
  982. log_warn(LD_FS, "Error writing router store to disk.");
  983. goto done;
  984. }
  985. /* Our mmap is now invalid. */
  986. if (store->mmap) {
  987. int res = tor_munmap_file(store->mmap);
  988. store->mmap = NULL;
  989. if (res != 0) {
  990. log_warn(LD_FS, "Unable to munmap route store in %s", fname);
  991. }
  992. }
  993. if (replace_file(fname_tmp, fname)<0) {
  994. log_warn(LD_FS, "Error replacing old router store: %s", strerror(errno));
  995. goto done;
  996. }
  997. errno = 0;
  998. store->mmap = tor_mmap_file(fname);
  999. if (! store->mmap) {
  1000. if (errno == ERANGE) {
  1001. /* empty store.*/
  1002. if (total_expected_len) {
  1003. log_warn(LD_FS, "We wrote some bytes to a new descriptor file at '%s',"
  1004. " but when we went to mmap it, it was empty!", fname);
  1005. } else if (had_any) {
  1006. log_info(LD_FS, "We just removed every descriptor in '%s'. This is "
  1007. "okay if we're just starting up after a long time. "
  1008. "Otherwise, it's a bug.", fname);
  1009. }
  1010. } else {
  1011. log_warn(LD_FS, "Unable to mmap new descriptor file at '%s'.",fname);
  1012. }
  1013. }
  1014. log_info(LD_DIR, "Reconstructing pointers into cache");
  1015. offset = 0;
  1016. SMARTLIST_FOREACH_BEGIN(signed_descriptors, signed_descriptor_t *, sd) {
  1017. if (sd->do_not_cache)
  1018. continue;
  1019. sd->saved_location = SAVED_IN_CACHE;
  1020. if (store->mmap) {
  1021. tor_free(sd->signed_descriptor_body); // sets it to null
  1022. sd->saved_offset = offset;
  1023. }
  1024. offset += sd->signed_descriptor_len + sd->annotations_len;
  1025. signed_descriptor_get_body(sd); /* reconstruct and assert */
  1026. } SMARTLIST_FOREACH_END(sd);
  1027. tor_free(fname);
  1028. fname = get_datadir_fname_suffix(store->fname_base, ".new");
  1029. write_str_to_file(fname, "", 1);
  1030. r = 0;
  1031. store->store_len = (size_t) offset;
  1032. store->journal_len = 0;
  1033. store->bytes_dropped = 0;
  1034. done:
  1035. smartlist_free(signed_descriptors);
  1036. tor_free(fname);
  1037. tor_free(fname_tmp);
  1038. if (chunk_list) {
  1039. SMARTLIST_FOREACH(chunk_list, sized_chunk_t *, c, tor_free(c));
  1040. smartlist_free(chunk_list);
  1041. }
  1042. return r;
  1043. }
  1044. /** Helper: Reload a cache file and its associated journal, setting metadata
  1045. * appropriately. If <b>extrainfo</b> is true, reload the extrainfo store;
  1046. * else reload the router descriptor store. */
  1047. static int
  1048. router_reload_router_list_impl(desc_store_t *store)
  1049. {
  1050. char *fname = NULL, *contents = NULL;
  1051. struct stat st;
  1052. int extrainfo = (store->type == EXTRAINFO_STORE);
  1053. store->journal_len = store->store_len = 0;
  1054. fname = get_datadir_fname(store->fname_base);
  1055. if (store->mmap) {
  1056. /* get rid of it first */
  1057. int res = tor_munmap_file(store->mmap);
  1058. store->mmap = NULL;
  1059. if (res != 0) {
  1060. log_warn(LD_FS, "Failed to munmap %s", fname);
  1061. tor_free(fname);
  1062. return -1;
  1063. }
  1064. }
  1065. store->mmap = tor_mmap_file(fname);
  1066. if (store->mmap) {
  1067. store->store_len = store->mmap->size;
  1068. if (extrainfo)
  1069. router_load_extrainfo_from_string(store->mmap->data,
  1070. store->mmap->data+store->mmap->size,
  1071. SAVED_IN_CACHE, NULL, 0);
  1072. else
  1073. router_load_routers_from_string(store->mmap->data,
  1074. store->mmap->data+store->mmap->size,
  1075. SAVED_IN_CACHE, NULL, 0, NULL);
  1076. }
  1077. tor_free(fname);
  1078. fname = get_datadir_fname_suffix(store->fname_base, ".new");
  1079. if (file_status(fname) == FN_FILE)
  1080. contents = read_file_to_str(fname, RFTS_BIN|RFTS_IGNORE_MISSING, &st);
  1081. if (contents) {
  1082. if (extrainfo)
  1083. router_load_extrainfo_from_string(contents, NULL,SAVED_IN_JOURNAL,
  1084. NULL, 0);
  1085. else
  1086. router_load_routers_from_string(contents, NULL, SAVED_IN_JOURNAL,
  1087. NULL, 0, NULL);
  1088. store->journal_len = (size_t) st.st_size;
  1089. tor_free(contents);
  1090. }
  1091. tor_free(fname);
  1092. if (store->journal_len) {
  1093. /* Always clear the journal on startup.*/
  1094. router_rebuild_store(RRS_FORCE, store);
  1095. } else if (!extrainfo) {
  1096. /* Don't cache expired routers. (This is in an else because
  1097. * router_rebuild_store() also calls remove_old_routers().) */
  1098. routerlist_remove_old_routers();
  1099. }
  1100. return 0;
  1101. }
  1102. /** Load all cached router descriptors and extra-info documents from the
  1103. * store. Return 0 on success and -1 on failure.
  1104. */
  1105. int
  1106. router_reload_router_list(void)
  1107. {
  1108. routerlist_t *rl = router_get_routerlist();
  1109. if (router_reload_router_list_impl(&rl->desc_store))
  1110. return -1;
  1111. if (router_reload_router_list_impl(&rl->extrainfo_store))
  1112. return -1;
  1113. return 0;
  1114. }
  1115. /** Return a smartlist containing a list of dir_server_t * for all
  1116. * known trusted dirservers. Callers must not modify the list or its
  1117. * contents.
  1118. */
  1119. const smartlist_t *
  1120. router_get_trusted_dir_servers(void)
  1121. {
  1122. if (!trusted_dir_servers)
  1123. trusted_dir_servers = smartlist_new();
  1124. return trusted_dir_servers;
  1125. }
  1126. const smartlist_t *
  1127. router_get_fallback_dir_servers(void)
  1128. {
  1129. if (!fallback_dir_servers)
  1130. fallback_dir_servers = smartlist_new();
  1131. return fallback_dir_servers;
  1132. }
  1133. /** Try to find a running dirserver that supports operations of <b>type</b>.
  1134. *
  1135. * If there are no running dirservers in our routerlist and the
  1136. * <b>PDS_RETRY_IF_NO_SERVERS</b> flag is set, set all the authoritative ones
  1137. * as running again, and pick one.
  1138. *
  1139. * If the <b>PDS_IGNORE_FASCISTFIREWALL</b> flag is set, then include
  1140. * dirservers that we can't reach.
  1141. *
  1142. * If the <b>PDS_ALLOW_SELF</b> flag is not set, then don't include ourself
  1143. * (if we're a dirserver).
  1144. *
  1145. * Don't pick an authority if any non-authority is viable; try to avoid using
  1146. * servers that have returned 503 recently.
  1147. */
  1148. const routerstatus_t *
  1149. router_pick_directory_server(dirinfo_type_t type, int flags)
  1150. {
  1151. const routerstatus_t *choice;
  1152. if (!routerlist)
  1153. return NULL;
  1154. choice = router_pick_directory_server_impl(type, flags);
  1155. if (choice || !(flags & PDS_RETRY_IF_NO_SERVERS))
  1156. return choice;
  1157. log_info(LD_DIR,
  1158. "No reachable router entries for dirservers. "
  1159. "Trying them all again.");
  1160. /* mark all authdirservers as up again */
  1161. mark_all_dirservers_up(fallback_dir_servers);
  1162. /* try again */
  1163. choice = router_pick_directory_server_impl(type, flags);
  1164. return choice;
  1165. }
  1166. /** Return the dir_server_t for the directory authority whose identity
  1167. * key hashes to <b>digest</b>, or NULL if no such authority is known.
  1168. */
  1169. dir_server_t *
  1170. router_get_trusteddirserver_by_digest(const char *digest)
  1171. {
  1172. if (!trusted_dir_servers)
  1173. return NULL;
  1174. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ds,
  1175. {
  1176. if (tor_memeq(ds->digest, digest, DIGEST_LEN))
  1177. return ds;
  1178. });
  1179. return NULL;
  1180. }
  1181. /** Return the dir_server_t for the fallback dirserver whose identity
  1182. * key hashes to <b>digest</b>, or NULL if no such authority is known.
  1183. */
  1184. dir_server_t *
  1185. router_get_fallback_dirserver_by_digest(const char *digest)
  1186. {
  1187. if (!trusted_dir_servers)
  1188. return NULL;
  1189. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ds,
  1190. {
  1191. if (tor_memeq(ds->digest, digest, DIGEST_LEN))
  1192. return ds;
  1193. });
  1194. return NULL;
  1195. }
  1196. /** Return the dir_server_t for the directory authority whose
  1197. * v3 identity key hashes to <b>digest</b>, or NULL if no such authority
  1198. * is known.
  1199. */
  1200. dir_server_t *
  1201. trusteddirserver_get_by_v3_auth_digest(const char *digest)
  1202. {
  1203. if (!trusted_dir_servers)
  1204. return NULL;
  1205. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ds,
  1206. {
  1207. if (tor_memeq(ds->v3_identity_digest, digest, DIGEST_LEN) &&
  1208. (ds->type & V3_DIRINFO))
  1209. return ds;
  1210. });
  1211. return NULL;
  1212. }
  1213. /** Try to find a running directory authority. Flags are as for
  1214. * router_pick_directory_server.
  1215. */
  1216. const routerstatus_t *
  1217. router_pick_trusteddirserver(dirinfo_type_t type, int flags)
  1218. {
  1219. return router_pick_dirserver_generic(trusted_dir_servers, type, flags);
  1220. }
  1221. /** Try to find a running fallback directory. Flags are as for
  1222. * router_pick_directory_server.
  1223. */
  1224. const routerstatus_t *
  1225. router_pick_fallback_dirserver(dirinfo_type_t type, int flags)
  1226. {
  1227. return router_pick_dirserver_generic(fallback_dir_servers, type, flags);
  1228. }
  1229. /** Try to find a running fallback directory. Flags are as for
  1230. * router_pick_directory_server.
  1231. */
  1232. static const routerstatus_t *
  1233. router_pick_dirserver_generic(smartlist_t *sourcelist,
  1234. dirinfo_type_t type, int flags)
  1235. {
  1236. const routerstatus_t *choice;
  1237. int busy = 0;
  1238. choice = router_pick_trusteddirserver_impl(sourcelist, type, flags, &busy);
  1239. if (choice || !(flags & PDS_RETRY_IF_NO_SERVERS))
  1240. return choice;
  1241. if (busy) {
  1242. /* If the reason that we got no server is that servers are "busy",
  1243. * we must be excluding good servers because we already have serverdesc
  1244. * fetches with them. Do not mark down servers up because of this. */
  1245. tor_assert((flags & (PDS_NO_EXISTING_SERVERDESC_FETCH|
  1246. PDS_NO_EXISTING_MICRODESC_FETCH)));
  1247. return NULL;
  1248. }
  1249. log_info(LD_DIR,
  1250. "No dirservers are reachable. Trying them all again.");
  1251. mark_all_dirservers_up(sourcelist);
  1252. return router_pick_trusteddirserver_impl(sourcelist, type, flags, NULL);
  1253. }
  1254. /** How long do we avoid using a directory server after it's given us a 503? */
  1255. #define DIR_503_TIMEOUT (60*60)
  1256. /** Pick a random running valid directory server/mirror from our
  1257. * routerlist. Arguments are as for router_pick_directory_server(), except
  1258. * that RETRY_IF_NO_SERVERS is ignored.
  1259. */
  1260. static const routerstatus_t *
  1261. router_pick_directory_server_impl(dirinfo_type_t type, int flags)
  1262. {
  1263. const or_options_t *options = get_options();
  1264. const node_t *result;
  1265. smartlist_t *direct, *tunnel;
  1266. smartlist_t *trusted_direct, *trusted_tunnel;
  1267. smartlist_t *overloaded_direct, *overloaded_tunnel;
  1268. time_t now = time(NULL);
  1269. const networkstatus_t *consensus = networkstatus_get_latest_consensus();
  1270. int requireother = ! (flags & PDS_ALLOW_SELF);
  1271. int fascistfirewall = ! (flags & PDS_IGNORE_FASCISTFIREWALL);
  1272. int for_guard = (flags & PDS_FOR_GUARD);
  1273. int try_excluding = 1, n_excluded = 0;
  1274. if (!consensus)
  1275. return NULL;
  1276. retry_without_exclude:
  1277. direct = smartlist_new();
  1278. tunnel = smartlist_new();
  1279. trusted_direct = smartlist_new();
  1280. trusted_tunnel = smartlist_new();
  1281. overloaded_direct = smartlist_new();
  1282. overloaded_tunnel = smartlist_new();
  1283. /* Find all the running dirservers we know about. */
  1284. SMARTLIST_FOREACH_BEGIN(nodelist_get_list(), const node_t *, node) {
  1285. int is_trusted, is_trusted_extrainfo;
  1286. int is_overloaded;
  1287. tor_addr_t addr;
  1288. const routerstatus_t *status = node->rs;
  1289. const country_t country = node->country;
  1290. if (!status)
  1291. continue;
  1292. if (!node->is_running || !status->dir_port || !node->is_valid)
  1293. continue;
  1294. if (requireother && router_digest_is_me(node->identity))
  1295. continue;
  1296. is_trusted = router_digest_is_trusted_dir(node->identity);
  1297. is_trusted_extrainfo = router_digest_is_trusted_dir_type(
  1298. node->identity, EXTRAINFO_DIRINFO);
  1299. if ((type & EXTRAINFO_DIRINFO) &&
  1300. !router_supports_extrainfo(node->identity, is_trusted_extrainfo))
  1301. continue;
  1302. if ((type & MICRODESC_DIRINFO) && !is_trusted &&
  1303. !node->rs->version_supports_microdesc_cache)
  1304. continue;
  1305. if (for_guard && node->using_as_guard)
  1306. continue; /* Don't make the same node a guard twice. */
  1307. if (try_excluding &&
  1308. routerset_contains_routerstatus(options->ExcludeNodes, status,
  1309. country)) {
  1310. ++n_excluded;
  1311. continue;
  1312. }
  1313. /* XXXX IP6 proposal 118 */
  1314. tor_addr_from_ipv4h(&addr, node->rs->addr);
  1315. is_overloaded = status->last_dir_503_at + DIR_503_TIMEOUT > now;
  1316. if ((!fascistfirewall ||
  1317. fascist_firewall_allows_address_or(&addr, status->or_port)))
  1318. smartlist_add(is_trusted ? trusted_tunnel :
  1319. is_overloaded ? overloaded_tunnel : tunnel, (void*)node);
  1320. else if (!fascistfirewall ||
  1321. fascist_firewall_allows_address_dir(&addr, status->dir_port))
  1322. smartlist_add(is_trusted ? trusted_direct :
  1323. is_overloaded ? overloaded_direct : direct, (void*)node);
  1324. } SMARTLIST_FOREACH_END(node);
  1325. if (smartlist_len(tunnel)) {
  1326. result = node_sl_choose_by_bandwidth(tunnel, WEIGHT_FOR_DIR);
  1327. } else if (smartlist_len(overloaded_tunnel)) {
  1328. result = node_sl_choose_by_bandwidth(overloaded_tunnel,
  1329. WEIGHT_FOR_DIR);
  1330. } else if (smartlist_len(trusted_tunnel)) {
  1331. /* FFFF We don't distinguish between trusteds and overloaded trusteds
  1332. * yet. Maybe one day we should. */
  1333. /* FFFF We also don't load balance over authorities yet. I think this
  1334. * is a feature, but it could easily be a bug. -RD */
  1335. result = smartlist_choose(trusted_tunnel);
  1336. } else if (smartlist_len(direct)) {
  1337. result = node_sl_choose_by_bandwidth(direct, WEIGHT_FOR_DIR);
  1338. } else if (smartlist_len(overloaded_direct)) {
  1339. result = node_sl_choose_by_bandwidth(overloaded_direct,
  1340. WEIGHT_FOR_DIR);
  1341. } else {
  1342. result = smartlist_choose(trusted_direct);
  1343. }
  1344. smartlist_free(direct);
  1345. smartlist_free(tunnel);
  1346. smartlist_free(trusted_direct);
  1347. smartlist_free(trusted_tunnel);
  1348. smartlist_free(overloaded_direct);
  1349. smartlist_free(overloaded_tunnel);
  1350. if (result == NULL && try_excluding && !options->StrictNodes && n_excluded) {
  1351. /* If we got no result, and we are excluding nodes, and StrictNodes is
  1352. * not set, try again without excluding nodes. */
  1353. try_excluding = 0;
  1354. n_excluded = 0;
  1355. goto retry_without_exclude;
  1356. }
  1357. return result ? result->rs : NULL;
  1358. }
  1359. /** Pick a random element from a list of dir_server_t, weighting by their
  1360. * <b>weight</b> field. */
  1361. static const dir_server_t *
  1362. dirserver_choose_by_weight(const smartlist_t *servers, double authority_weight)
  1363. {
  1364. int n = smartlist_len(servers);
  1365. int i;
  1366. u64_dbl_t *weights;
  1367. const dir_server_t *ds;
  1368. weights = tor_calloc(n, sizeof(u64_dbl_t));
  1369. for (i = 0; i < n; ++i) {
  1370. ds = smartlist_get(servers, i);
  1371. weights[i].dbl = ds->weight;
  1372. if (ds->is_authority)
  1373. weights[i].dbl *= authority_weight;
  1374. }
  1375. scale_array_elements_to_u64(weights, n, NULL);
  1376. i = choose_array_element_by_weight(weights, n);
  1377. tor_free(weights);
  1378. return (i < 0) ? NULL : smartlist_get(servers, i);
  1379. }
  1380. /** Choose randomly from among the dir_server_ts in sourcelist that
  1381. * are up. Flags are as for router_pick_directory_server_impl().
  1382. */
  1383. static const routerstatus_t *
  1384. router_pick_trusteddirserver_impl(const smartlist_t *sourcelist,
  1385. dirinfo_type_t type, int flags,
  1386. int *n_busy_out)
  1387. {
  1388. const or_options_t *options = get_options();
  1389. smartlist_t *direct, *tunnel;
  1390. smartlist_t *overloaded_direct, *overloaded_tunnel;
  1391. const routerinfo_t *me = router_get_my_routerinfo();
  1392. const routerstatus_t *result = NULL;
  1393. time_t now = time(NULL);
  1394. const int requireother = ! (flags & PDS_ALLOW_SELF);
  1395. const int fascistfirewall = ! (flags & PDS_IGNORE_FASCISTFIREWALL);
  1396. const int no_serverdesc_fetching =(flags & PDS_NO_EXISTING_SERVERDESC_FETCH);
  1397. const int no_microdesc_fetching =(flags & PDS_NO_EXISTING_MICRODESC_FETCH);
  1398. const double auth_weight = (sourcelist == fallback_dir_servers) ?
  1399. options->DirAuthorityFallbackRate : 1.0;
  1400. smartlist_t *pick_from;
  1401. int n_busy = 0;
  1402. int try_excluding = 1, n_excluded = 0;
  1403. if (!sourcelist)
  1404. return NULL;
  1405. retry_without_exclude:
  1406. direct = smartlist_new();
  1407. tunnel = smartlist_new();
  1408. overloaded_direct = smartlist_new();
  1409. overloaded_tunnel = smartlist_new();
  1410. SMARTLIST_FOREACH_BEGIN(sourcelist, const dir_server_t *, d)
  1411. {
  1412. int is_overloaded =
  1413. d->fake_status.last_dir_503_at + DIR_503_TIMEOUT > now;
  1414. tor_addr_t addr;
  1415. if (!d->is_running) continue;
  1416. if ((type & d->type) == 0)
  1417. continue;
  1418. if ((type & EXTRAINFO_DIRINFO) &&
  1419. !router_supports_extrainfo(d->digest, 1))
  1420. continue;
  1421. if (requireother && me && router_digest_is_me(d->digest))
  1422. continue;
  1423. if (try_excluding &&
  1424. routerset_contains_routerstatus(options->ExcludeNodes,
  1425. &d->fake_status, -1)) {
  1426. ++n_excluded;
  1427. continue;
  1428. }
  1429. /* XXXX IP6 proposal 118 */
  1430. tor_addr_from_ipv4h(&addr, d->addr);
  1431. if (no_serverdesc_fetching) {
  1432. if (connection_get_by_type_addr_port_purpose(
  1433. CONN_TYPE_DIR, &addr, d->dir_port, DIR_PURPOSE_FETCH_SERVERDESC)
  1434. || connection_get_by_type_addr_port_purpose(
  1435. CONN_TYPE_DIR, &addr, d->dir_port, DIR_PURPOSE_FETCH_EXTRAINFO)) {
  1436. //log_debug(LD_DIR, "We have an existing connection to fetch "
  1437. // "descriptor from %s; delaying",d->description);
  1438. ++n_busy;
  1439. continue;
  1440. }
  1441. }
  1442. if (no_microdesc_fetching) {
  1443. if (connection_get_by_type_addr_port_purpose(
  1444. CONN_TYPE_DIR, &addr, d->dir_port, DIR_PURPOSE_FETCH_MICRODESC)) {
  1445. ++n_busy;
  1446. continue;
  1447. }
  1448. }
  1449. if (d->or_port &&
  1450. (!fascistfirewall ||
  1451. fascist_firewall_allows_address_or(&addr, d->or_port)))
  1452. smartlist_add(is_overloaded ? overloaded_tunnel : tunnel, (void*)d);
  1453. else if (!fascistfirewall ||
  1454. fascist_firewall_allows_address_dir(&addr, d->dir_port))
  1455. smartlist_add(is_overloaded ? overloaded_direct : direct, (void*)d);
  1456. }
  1457. SMARTLIST_FOREACH_END(d);
  1458. if (smartlist_len(tunnel)) {
  1459. pick_from = tunnel;
  1460. } else if (smartlist_len(overloaded_tunnel)) {
  1461. pick_from = overloaded_tunnel;
  1462. } else if (smartlist_len(direct)) {
  1463. pick_from = direct;
  1464. } else {
  1465. pick_from = overloaded_direct;
  1466. }
  1467. {
  1468. const dir_server_t *selection =
  1469. dirserver_choose_by_weight(pick_from, auth_weight);
  1470. if (selection)
  1471. result = &selection->fake_status;
  1472. }
  1473. if (n_busy_out)
  1474. *n_busy_out = n_busy;
  1475. smartlist_free(direct);
  1476. smartlist_free(tunnel);
  1477. smartlist_free(overloaded_direct);
  1478. smartlist_free(overloaded_tunnel);
  1479. if (result == NULL && try_excluding && !options->StrictNodes && n_excluded) {
  1480. /* If we got no result, and we are excluding nodes, and StrictNodes is
  1481. * not set, try again without excluding nodes. */
  1482. try_excluding = 0;
  1483. n_excluded = 0;
  1484. goto retry_without_exclude;
  1485. }
  1486. return result;
  1487. }
  1488. /** Mark as running every dir_server_t in <b>server_list</b>. */
  1489. static void
  1490. mark_all_dirservers_up(smartlist_t *server_list)
  1491. {
  1492. if (server_list) {
  1493. SMARTLIST_FOREACH_BEGIN(server_list, dir_server_t *, dir) {
  1494. routerstatus_t *rs;
  1495. node_t *node;
  1496. dir->is_running = 1;
  1497. node = node_get_mutable_by_id(dir->digest);
  1498. if (node)
  1499. node->is_running = 1;
  1500. rs = router_get_mutable_consensus_status_by_id(dir->digest);
  1501. if (rs) {
  1502. rs->last_dir_503_at = 0;
  1503. control_event_networkstatus_changed_single(rs);
  1504. }
  1505. } SMARTLIST_FOREACH_END(dir);
  1506. }
  1507. router_dir_info_changed();
  1508. }
  1509. /** Return true iff r1 and r2 have the same address and OR port. */
  1510. int
  1511. routers_have_same_or_addrs(const routerinfo_t *r1, const routerinfo_t *r2)
  1512. {
  1513. return r1->addr == r2->addr && r1->or_port == r2->or_port &&
  1514. tor_addr_eq(&r1->ipv6_addr, &r2->ipv6_addr) &&
  1515. r1->ipv6_orport == r2->ipv6_orport;
  1516. }
  1517. /** Reset all internal variables used to count failed downloads of network
  1518. * status objects. */
  1519. void
  1520. router_reset_status_download_failures(void)
  1521. {
  1522. mark_all_dirservers_up(fallback_dir_servers);
  1523. }
  1524. /** Given a <b>router</b>, add every node_t in its family (including the
  1525. * node itself!) to <b>sl</b>.
  1526. *
  1527. * Note the type mismatch: This function takes a routerinfo, but adds nodes
  1528. * to the smartlist!
  1529. */
  1530. static void
  1531. routerlist_add_node_and_family(smartlist_t *sl, const routerinfo_t *router)
  1532. {
  1533. /* XXXX MOVE ? */
  1534. node_t fake_node;
  1535. const node_t *node = node_get_by_id(router->cache_info.identity_digest);;
  1536. if (node == NULL) {
  1537. memset(&fake_node, 0, sizeof(fake_node));
  1538. fake_node.ri = (routerinfo_t *)router;
  1539. memcpy(fake_node.identity, router->cache_info.identity_digest, DIGEST_LEN);
  1540. node = &fake_node;
  1541. }
  1542. nodelist_add_node_and_family(sl, node);
  1543. }
  1544. /** Add every suitable node from our nodelist to <b>sl</b>, so that
  1545. * we can pick a node for a circuit.
  1546. */
  1547. static void
  1548. router_add_running_nodes_to_smartlist(smartlist_t *sl, int allow_invalid,
  1549. int need_uptime, int need_capacity,
  1550. int need_guard, int need_desc)
  1551. { /* XXXX MOVE */
  1552. SMARTLIST_FOREACH_BEGIN(nodelist_get_list(), const node_t *, node) {
  1553. if (!node->is_running ||
  1554. (!node->is_valid && !allow_invalid))
  1555. continue;
  1556. if (need_desc && !(node->ri || (node->rs && node->md)))
  1557. continue;
  1558. if (node->ri && node->ri->purpose != ROUTER_PURPOSE_GENERAL)
  1559. continue;
  1560. if (node_is_unreliable(node, need_uptime, need_capacity, need_guard))
  1561. continue;
  1562. smartlist_add(sl, (void *)node);
  1563. } SMARTLIST_FOREACH_END(node);
  1564. }
  1565. /** Look through the routerlist until we find a router that has my key.
  1566. Return it. */
  1567. const routerinfo_t *
  1568. routerlist_find_my_routerinfo(void)
  1569. {
  1570. if (!routerlist)
  1571. return NULL;
  1572. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, router,
  1573. {
  1574. if (router_is_me(router))
  1575. return router;
  1576. });
  1577. return NULL;
  1578. }
  1579. /** Return the smaller of the router's configured BandwidthRate
  1580. * and its advertised capacity. */
  1581. uint32_t
  1582. router_get_advertised_bandwidth(const routerinfo_t *router)
  1583. {
  1584. if (router->bandwidthcapacity < router->bandwidthrate)
  1585. return router->bandwidthcapacity;
  1586. return router->bandwidthrate;
  1587. }
  1588. /** Do not weight any declared bandwidth more than this much when picking
  1589. * routers by bandwidth. */
  1590. #define DEFAULT_MAX_BELIEVABLE_BANDWIDTH 10000000 /* 10 MB/sec */
  1591. /** Return the smaller of the router's configured BandwidthRate
  1592. * and its advertised capacity, capped by max-believe-bw. */
  1593. uint32_t
  1594. router_get_advertised_bandwidth_capped(const routerinfo_t *router)
  1595. {
  1596. uint32_t result = router->bandwidthcapacity;
  1597. if (result > router->bandwidthrate)
  1598. result = router->bandwidthrate;
  1599. if (result > DEFAULT_MAX_BELIEVABLE_BANDWIDTH)
  1600. result = DEFAULT_MAX_BELIEVABLE_BANDWIDTH;
  1601. return result;
  1602. }
  1603. /** Given an array of double/uint64_t unions that are currently being used as
  1604. * doubles, convert them to uint64_t, and try to scale them linearly so as to
  1605. * much of the range of uint64_t. If <b>total_out</b> is provided, set it to
  1606. * the sum of all elements in the array _before_ scaling. */
  1607. STATIC void
  1608. scale_array_elements_to_u64(u64_dbl_t *entries, int n_entries,
  1609. uint64_t *total_out)
  1610. {
  1611. double total = 0.0;
  1612. double scale_factor = 0.0;
  1613. int i;
  1614. /* big, but far away from overflowing an int64_t */
  1615. #define SCALE_TO_U64_MAX ((int64_t) (INT64_MAX / 4))
  1616. for (i = 0; i < n_entries; ++i)
  1617. total += entries[i].dbl;
  1618. if (total > 0.0)
  1619. scale_factor = SCALE_TO_U64_MAX / total;
  1620. for (i = 0; i < n_entries; ++i)
  1621. entries[i].u64 = tor_llround(entries[i].dbl * scale_factor);
  1622. if (total_out)
  1623. *total_out = (uint64_t) total;
  1624. #undef SCALE_TO_U64_MAX
  1625. }
  1626. /** Time-invariant 64-bit greater-than; works on two integers in the range
  1627. * (0,INT64_MAX). */
  1628. #if SIZEOF_VOID_P == 8
  1629. #define gt_i64_timei(a,b) ((a) > (b))
  1630. #else
  1631. static INLINE int
  1632. gt_i64_timei(uint64_t a, uint64_t b)
  1633. {
  1634. int64_t diff = (int64_t) (b - a);
  1635. int res = diff >> 63;
  1636. return res & 1;
  1637. }
  1638. #endif
  1639. /** Pick a random element of <b>n_entries</b>-element array <b>entries</b>,
  1640. * choosing each element with a probability proportional to its (uint64_t)
  1641. * value, and return the index of that element. If all elements are 0, choose
  1642. * an index at random. Return -1 on error.
  1643. */
  1644. STATIC int
  1645. choose_array_element_by_weight(const u64_dbl_t *entries, int n_entries)
  1646. {
  1647. int i, i_chosen=-1, n_chosen=0;
  1648. uint64_t total_so_far = 0;
  1649. uint64_t rand_val;
  1650. uint64_t total = 0;
  1651. for (i = 0; i < n_entries; ++i)
  1652. total += entries[i].u64;
  1653. if (n_entries < 1)
  1654. return -1;
  1655. if (total == 0)
  1656. return crypto_rand_int(n_entries);
  1657. tor_assert(total < INT64_MAX);
  1658. rand_val = crypto_rand_uint64(total);
  1659. for (i = 0; i < n_entries; ++i) {
  1660. total_so_far += entries[i].u64;
  1661. if (gt_i64_timei(total_so_far, rand_val)) {
  1662. i_chosen = i;
  1663. n_chosen++;
  1664. /* Set rand_val to INT64_MAX rather than stopping the loop. This way,
  1665. * the time we spend in the loop does not leak which element we chose. */
  1666. rand_val = INT64_MAX;
  1667. }
  1668. }
  1669. tor_assert(total_so_far == total);
  1670. tor_assert(n_chosen == 1);
  1671. tor_assert(i_chosen >= 0);
  1672. tor_assert(i_chosen < n_entries);
  1673. return i_chosen;
  1674. }
  1675. /** When weighting bridges, enforce these values as lower and upper
  1676. * bound for believable bandwidth, because there is no way for us
  1677. * to verify a bridge's bandwidth currently. */
  1678. #define BRIDGE_MIN_BELIEVABLE_BANDWIDTH 20000 /* 20 kB/sec */
  1679. #define BRIDGE_MAX_BELIEVABLE_BANDWIDTH 100000 /* 100 kB/sec */
  1680. /** Return the smaller of the router's configured BandwidthRate
  1681. * and its advertised capacity, making sure to stay within the
  1682. * interval between bridge-min-believe-bw and
  1683. * bridge-max-believe-bw. */
  1684. static uint32_t
  1685. bridge_get_advertised_bandwidth_bounded(routerinfo_t *router)
  1686. {
  1687. uint32_t result = router->bandwidthcapacity;
  1688. if (result > router->bandwidthrate)
  1689. result = router->bandwidthrate;
  1690. if (result > BRIDGE_MAX_BELIEVABLE_BANDWIDTH)
  1691. result = BRIDGE_MAX_BELIEVABLE_BANDWIDTH;
  1692. else if (result < BRIDGE_MIN_BELIEVABLE_BANDWIDTH)
  1693. result = BRIDGE_MIN_BELIEVABLE_BANDWIDTH;
  1694. return result;
  1695. }
  1696. /** Return bw*1000, unless bw*1000 would overflow, in which case return
  1697. * INT32_MAX. */
  1698. static INLINE int32_t
  1699. kb_to_bytes(uint32_t bw)
  1700. {
  1701. return (bw > (INT32_MAX/1000)) ? INT32_MAX : bw*1000;
  1702. }
  1703. /** Helper function:
  1704. * choose a random element of smartlist <b>sl</b> of nodes, weighted by
  1705. * the advertised bandwidth of each element using the consensus
  1706. * bandwidth weights.
  1707. *
  1708. * If <b>rule</b>==WEIGHT_FOR_EXIT. we're picking an exit node: consider all
  1709. * nodes' bandwidth equally regardless of their Exit status, since there may
  1710. * be some in the list because they exit to obscure ports. If
  1711. * <b>rule</b>==NO_WEIGHTING, we're picking a non-exit node: weight
  1712. * exit-node's bandwidth less depending on the smallness of the fraction of
  1713. * Exit-to-total bandwidth. If <b>rule</b>==WEIGHT_FOR_GUARD, we're picking a
  1714. * guard node: consider all guard's bandwidth equally. Otherwise, weight
  1715. * guards proportionally less.
  1716. */
  1717. static const node_t *
  1718. smartlist_choose_node_by_bandwidth_weights(const smartlist_t *sl,
  1719. bandwidth_weight_rule_t rule)
  1720. {
  1721. u64_dbl_t *bandwidths=NULL;
  1722. if (compute_weighted_bandwidths(sl, rule, &bandwidths) < 0)
  1723. return NULL;
  1724. scale_array_elements_to_u64(bandwidths, smartlist_len(sl), NULL);
  1725. {
  1726. int idx = choose_array_element_by_weight(bandwidths,
  1727. smartlist_len(sl));
  1728. tor_free(bandwidths);
  1729. return idx < 0 ? NULL : smartlist_get(sl, idx);
  1730. }
  1731. }
  1732. /** Given a list of routers and a weighting rule as in
  1733. * smartlist_choose_node_by_bandwidth_weights, compute weighted bandwidth
  1734. * values for each node and store them in a freshly allocated
  1735. * *<b>bandwidths_out</b> of the same length as <b>sl</b>, and holding results
  1736. * as doubles. Return 0 on success, -1 on failure. */
  1737. static int
  1738. compute_weighted_bandwidths(const smartlist_t *sl,
  1739. bandwidth_weight_rule_t rule,
  1740. u64_dbl_t **bandwidths_out)
  1741. {
  1742. int64_t weight_scale;
  1743. double Wg = -1, Wm = -1, We = -1, Wd = -1;
  1744. double Wgb = -1, Wmb = -1, Web = -1, Wdb = -1;
  1745. uint64_t weighted_bw = 0;
  1746. u64_dbl_t *bandwidths;
  1747. /* Can't choose exit and guard at same time */
  1748. tor_assert(rule == NO_WEIGHTING ||
  1749. rule == WEIGHT_FOR_EXIT ||
  1750. rule == WEIGHT_FOR_GUARD ||
  1751. rule == WEIGHT_FOR_MID ||
  1752. rule == WEIGHT_FOR_DIR);
  1753. if (smartlist_len(sl) == 0) {
  1754. log_info(LD_CIRC,
  1755. "Empty routerlist passed in to consensus weight node "
  1756. "selection for rule %s",
  1757. bandwidth_weight_rule_to_string(rule));
  1758. return -1;
  1759. }
  1760. weight_scale = networkstatus_get_weight_scale_param(NULL);
  1761. if (rule == WEIGHT_FOR_GUARD) {
  1762. Wg = networkstatus_get_bw_weight(NULL, "Wgg", -1);
  1763. Wm = networkstatus_get_bw_weight(NULL, "Wgm", -1); /* Bridges */
  1764. We = 0;
  1765. Wd = networkstatus_get_bw_weight(NULL, "Wgd", -1);
  1766. Wgb = networkstatus_get_bw_weight(NULL, "Wgb", -1);
  1767. Wmb = networkstatus_get_bw_weight(NULL, "Wmb", -1);
  1768. Web = networkstatus_get_bw_weight(NULL, "Web", -1);
  1769. Wdb = networkstatus_get_bw_weight(NULL, "Wdb", -1);
  1770. } else if (rule == WEIGHT_FOR_MID) {
  1771. Wg = networkstatus_get_bw_weight(NULL, "Wmg", -1);
  1772. Wm = networkstatus_get_bw_weight(NULL, "Wmm", -1);
  1773. We = networkstatus_get_bw_weight(NULL, "Wme", -1);
  1774. Wd = networkstatus_get_bw_weight(NULL, "Wmd", -1);
  1775. Wgb = networkstatus_get_bw_weight(NULL, "Wgb", -1);
  1776. Wmb = networkstatus_get_bw_weight(NULL, "Wmb", -1);
  1777. Web = networkstatus_get_bw_weight(NULL, "Web", -1);
  1778. Wdb = networkstatus_get_bw_weight(NULL, "Wdb", -1);
  1779. } else if (rule == WEIGHT_FOR_EXIT) {
  1780. // Guards CAN be exits if they have weird exit policies
  1781. // They are d then I guess...
  1782. We = networkstatus_get_bw_weight(NULL, "Wee", -1);
  1783. Wm = networkstatus_get_bw_weight(NULL, "Wem", -1); /* Odd exit policies */
  1784. Wd = networkstatus_get_bw_weight(NULL, "Wed", -1);
  1785. Wg = networkstatus_get_bw_weight(NULL, "Weg", -1); /* Odd exit policies */
  1786. Wgb = networkstatus_get_bw_weight(NULL, "Wgb", -1);
  1787. Wmb = networkstatus_get_bw_weight(NULL, "Wmb", -1);
  1788. Web = networkstatus_get_bw_weight(NULL, "Web", -1);
  1789. Wdb = networkstatus_get_bw_weight(NULL, "Wdb", -1);
  1790. } else if (rule == WEIGHT_FOR_DIR) {
  1791. We = networkstatus_get_bw_weight(NULL, "Wbe", -1);
  1792. Wm = networkstatus_get_bw_weight(NULL, "Wbm", -1);
  1793. Wd = networkstatus_get_bw_weight(NULL, "Wbd", -1);
  1794. Wg = networkstatus_get_bw_weight(NULL, "Wbg", -1);
  1795. Wgb = Wmb = Web = Wdb = weight_scale;
  1796. } else if (rule == NO_WEIGHTING) {
  1797. Wg = Wm = We = Wd = weight_scale;
  1798. Wgb = Wmb = Web = Wdb = weight_scale;
  1799. }
  1800. if (Wg < 0 || Wm < 0 || We < 0 || Wd < 0 || Wgb < 0 || Wmb < 0 || Wdb < 0
  1801. || Web < 0) {
  1802. log_debug(LD_CIRC,
  1803. "Got negative bandwidth weights. Defaulting to old selection"
  1804. " algorithm.");
  1805. return -1; // Use old algorithm.
  1806. }
  1807. Wg /= weight_scale;
  1808. Wm /= weight_scale;
  1809. We /= weight_scale;
  1810. Wd /= weight_scale;
  1811. Wgb /= weight_scale;
  1812. Wmb /= weight_scale;
  1813. Web /= weight_scale;
  1814. Wdb /= weight_scale;
  1815. bandwidths = tor_calloc(smartlist_len(sl), sizeof(u64_dbl_t));
  1816. // Cycle through smartlist and total the bandwidth.
  1817. SMARTLIST_FOREACH_BEGIN(sl, const node_t *, node) {
  1818. int is_exit = 0, is_guard = 0, is_dir = 0, this_bw = 0;
  1819. double weight = 1;
  1820. is_exit = node->is_exit && ! node->is_bad_exit;
  1821. is_guard = node->is_possible_guard;
  1822. is_dir = node_is_dir(node);
  1823. if (node->rs) {
  1824. if (!node->rs->has_bandwidth) {
  1825. tor_free(bandwidths);
  1826. /* This should never happen, unless all the authorites downgrade
  1827. * to 0.2.0 or rogue routerstatuses get inserted into our consensus. */
  1828. log_warn(LD_BUG,
  1829. "Consensus is not listing bandwidths. Defaulting back to "
  1830. "old router selection algorithm.");
  1831. return -1;
  1832. }
  1833. this_bw = kb_to_bytes(node->rs->bandwidth_kb);
  1834. } else if (node->ri) {
  1835. /* bridge or other descriptor not in our consensus */
  1836. this_bw = bridge_get_advertised_bandwidth_bounded(node->ri);
  1837. } else {
  1838. /* We can't use this one. */
  1839. continue;
  1840. }
  1841. if (is_guard && is_exit) {
  1842. weight = (is_dir ? Wdb*Wd : Wd);
  1843. } else if (is_guard) {
  1844. weight = (is_dir ? Wgb*Wg : Wg);
  1845. } else if (is_exit) {
  1846. weight = (is_dir ? Web*We : We);
  1847. } else { // middle
  1848. weight = (is_dir ? Wmb*Wm : Wm);
  1849. }
  1850. /* These should be impossible; but overflows here would be bad, so let's
  1851. * make sure. */
  1852. if (this_bw < 0)
  1853. this_bw = 0;
  1854. if (weight < 0.0)
  1855. weight = 0.0;
  1856. bandwidths[node_sl_idx].dbl = weight*this_bw + 0.5;
  1857. } SMARTLIST_FOREACH_END(node);
  1858. log_debug(LD_CIRC, "Generated weighted bandwidths for rule %s based "
  1859. "on weights "
  1860. "Wg=%f Wm=%f We=%f Wd=%f with total bw "U64_FORMAT,
  1861. bandwidth_weight_rule_to_string(rule),
  1862. Wg, Wm, We, Wd, U64_PRINTF_ARG(weighted_bw));
  1863. *bandwidths_out = bandwidths;
  1864. return 0;
  1865. }
  1866. /** For all nodes in <b>sl</b>, return the fraction of those nodes, weighted
  1867. * by their weighted bandwidths with rule <b>rule</b>, for which we have
  1868. * descriptors. */
  1869. double
  1870. frac_nodes_with_descriptors(const smartlist_t *sl,
  1871. bandwidth_weight_rule_t rule)
  1872. {
  1873. u64_dbl_t *bandwidths = NULL;
  1874. double total, present;
  1875. if (smartlist_len(sl) == 0)
  1876. return 0.0;
  1877. if (compute_weighted_bandwidths(sl, rule, &bandwidths) < 0) {
  1878. int n_with_descs = 0;
  1879. SMARTLIST_FOREACH(sl, const node_t *, node, {
  1880. if (node_has_descriptor(node))
  1881. n_with_descs++;
  1882. });
  1883. return ((double)n_with_descs) / (double)smartlist_len(sl);
  1884. }
  1885. total = present = 0.0;
  1886. SMARTLIST_FOREACH_BEGIN(sl, const node_t *, node) {
  1887. const double bw = bandwidths[node_sl_idx].dbl;
  1888. total += bw;
  1889. if (node_has_descriptor(node))
  1890. present += bw;
  1891. } SMARTLIST_FOREACH_END(node);
  1892. tor_free(bandwidths);
  1893. if (total < 1.0)
  1894. return 0;
  1895. return present / total;
  1896. }
  1897. /** Helper function:
  1898. * choose a random node_t element of smartlist <b>sl</b>, weighted by
  1899. * the advertised bandwidth of each element.
  1900. *
  1901. * If <b>rule</b>==WEIGHT_FOR_EXIT. we're picking an exit node: consider all
  1902. * nodes' bandwidth equally regardless of their Exit status, since there may
  1903. * be some in the list because they exit to obscure ports. If
  1904. * <b>rule</b>==NO_WEIGHTING, we're picking a non-exit node: weight
  1905. * exit-node's bandwidth less depending on the smallness of the fraction of
  1906. * Exit-to-total bandwidth. If <b>rule</b>==WEIGHT_FOR_GUARD, we're picking a
  1907. * guard node: consider all guard's bandwidth equally. Otherwise, weight
  1908. * guards proportionally less.
  1909. */
  1910. static const node_t *
  1911. smartlist_choose_node_by_bandwidth(const smartlist_t *sl,
  1912. bandwidth_weight_rule_t rule)
  1913. {
  1914. unsigned int i;
  1915. u64_dbl_t *bandwidths;
  1916. int is_exit;
  1917. int is_guard;
  1918. int is_fast;
  1919. double total_nonexit_bw = 0, total_exit_bw = 0;
  1920. double total_nonguard_bw = 0, total_guard_bw = 0;
  1921. double exit_weight;
  1922. double guard_weight;
  1923. int n_unknown = 0;
  1924. bitarray_t *fast_bits;
  1925. bitarray_t *exit_bits;
  1926. bitarray_t *guard_bits;
  1927. // This function does not support WEIGHT_FOR_DIR
  1928. // or WEIGHT_FOR_MID
  1929. if (rule == WEIGHT_FOR_DIR || rule == WEIGHT_FOR_MID) {
  1930. rule = NO_WEIGHTING;
  1931. }
  1932. /* Can't choose exit and guard at same time */
  1933. tor_assert(rule == NO_WEIGHTING ||
  1934. rule == WEIGHT_FOR_EXIT ||
  1935. rule == WEIGHT_FOR_GUARD);
  1936. if (smartlist_len(sl) == 0) {
  1937. log_info(LD_CIRC,
  1938. "Empty routerlist passed in to old node selection for rule %s",
  1939. bandwidth_weight_rule_to_string(rule));
  1940. return NULL;
  1941. }
  1942. /* First count the total bandwidth weight, and make a list
  1943. * of each value. We use UINT64_MAX to indicate "unknown". */
  1944. bandwidths = tor_calloc(smartlist_len(sl), sizeof(u64_dbl_t));
  1945. fast_bits = bitarray_init_zero(smartlist_len(sl));
  1946. exit_bits = bitarray_init_zero(smartlist_len(sl));
  1947. guard_bits = bitarray_init_zero(smartlist_len(sl));
  1948. /* Iterate over all the routerinfo_t or routerstatus_t, and */
  1949. SMARTLIST_FOREACH_BEGIN(sl, const node_t *, node) {
  1950. /* first, learn what bandwidth we think i has */
  1951. int is_known = 1;
  1952. uint32_t this_bw = 0;
  1953. i = node_sl_idx;
  1954. is_exit = node_is_good_exit(node);
  1955. is_guard = node->is_possible_guard;
  1956. if (node->rs) {
  1957. if (node->rs->has_bandwidth) {
  1958. this_bw = kb_to_bytes(node->rs->bandwidth_kb);
  1959. } else { /* guess */
  1960. is_known = 0;
  1961. }
  1962. } else if (node->ri) {
  1963. /* Must be a bridge if we're willing to use it */
  1964. this_bw = bridge_get_advertised_bandwidth_bounded(node->ri);
  1965. }
  1966. if (is_exit)
  1967. bitarray_set(exit_bits, i);
  1968. if (is_guard)
  1969. bitarray_set(guard_bits, i);
  1970. if (node->is_fast)
  1971. bitarray_set(fast_bits, i);
  1972. if (is_known) {
  1973. bandwidths[i].dbl = this_bw;
  1974. if (is_guard)
  1975. total_guard_bw += this_bw;
  1976. else
  1977. total_nonguard_bw += this_bw;
  1978. if (is_exit)
  1979. total_exit_bw += this_bw;
  1980. else
  1981. total_nonexit_bw += this_bw;
  1982. } else {
  1983. ++n_unknown;
  1984. bandwidths[i].dbl = -1.0;
  1985. }
  1986. } SMARTLIST_FOREACH_END(node);
  1987. #define EPSILON .1
  1988. /* Now, fill in the unknown values. */
  1989. if (n_unknown) {
  1990. int32_t avg_fast, avg_slow;
  1991. if (total_exit_bw+total_nonexit_bw < EPSILON) {
  1992. /* if there's some bandwidth, there's at least one known router,
  1993. * so no worries about div by 0 here */
  1994. int n_known = smartlist_len(sl)-n_unknown;
  1995. avg_fast = avg_slow = (int32_t)
  1996. ((total_exit_bw+total_nonexit_bw)/((uint64_t) n_known));
  1997. } else {
  1998. avg_fast = 40000;
  1999. avg_slow = 20000;
  2000. }
  2001. for (i=0; i<(unsigned)smartlist_len(sl); ++i) {
  2002. if (bandwidths[i].dbl >= 0.0)
  2003. continue;
  2004. is_fast = bitarray_is_set(fast_bits, i);
  2005. is_exit = bitarray_is_set(exit_bits, i);
  2006. is_guard = bitarray_is_set(guard_bits, i);
  2007. bandwidths[i].dbl = is_fast ? avg_fast : avg_slow;
  2008. if (is_exit)
  2009. total_exit_bw += bandwidths[i].dbl;
  2010. else
  2011. total_nonexit_bw += bandwidths[i].dbl;
  2012. if (is_guard)
  2013. total_guard_bw += bandwidths[i].dbl;
  2014. else
  2015. total_nonguard_bw += bandwidths[i].dbl;
  2016. }
  2017. }
  2018. /* If there's no bandwidth at all, pick at random. */
  2019. if (total_exit_bw+total_nonexit_bw < EPSILON) {
  2020. tor_free(bandwidths);
  2021. tor_free(fast_bits);
  2022. tor_free(exit_bits);
  2023. tor_free(guard_bits);
  2024. return smartlist_choose(sl);
  2025. }
  2026. /* Figure out how to weight exits and guards */
  2027. {
  2028. double all_bw = U64_TO_DBL(total_exit_bw+total_nonexit_bw);
  2029. double exit_bw = U64_TO_DBL(total_exit_bw);
  2030. double guard_bw = U64_TO_DBL(total_guard_bw);
  2031. /*
  2032. * For detailed derivation of this formula, see
  2033. * http://archives.seul.org/or/dev/Jul-2007/msg00056.html
  2034. */
  2035. if (rule == WEIGHT_FOR_EXIT || total_exit_bw<EPSILON)
  2036. exit_weight = 1.0;
  2037. else
  2038. exit_weight = 1.0 - all_bw/(3.0*exit_bw);
  2039. if (rule == WEIGHT_FOR_GUARD || total_guard_bw<EPSILON)
  2040. guard_weight = 1.0;
  2041. else
  2042. guard_weight = 1.0 - all_bw/(3.0*guard_bw);
  2043. if (exit_weight <= 0.0)
  2044. exit_weight = 0.0;
  2045. if (guard_weight <= 0.0)
  2046. guard_weight = 0.0;
  2047. for (i=0; i < (unsigned)smartlist_len(sl); i++) {
  2048. tor_assert(bandwidths[i].dbl >= 0.0);
  2049. is_exit = bitarray_is_set(exit_bits, i);
  2050. is_guard = bitarray_is_set(guard_bits, i);
  2051. if (is_exit && is_guard)
  2052. bandwidths[i].dbl *= exit_weight * guard_weight;
  2053. else if (is_guard)
  2054. bandwidths[i].dbl *= guard_weight;
  2055. else if (is_exit)
  2056. bandwidths[i].dbl *= exit_weight;
  2057. }
  2058. }
  2059. #if 0
  2060. log_debug(LD_CIRC, "Total weighted bw = "U64_FORMAT
  2061. ", exit bw = "U64_FORMAT
  2062. ", nonexit bw = "U64_FORMAT", exit weight = %f "
  2063. "(for exit == %d)"
  2064. ", guard bw = "U64_FORMAT
  2065. ", nonguard bw = "U64_FORMAT", guard weight = %f "
  2066. "(for guard == %d)",
  2067. U64_PRINTF_ARG(total_bw),
  2068. U64_PRINTF_ARG(total_exit_bw), U64_PRINTF_ARG(total_nonexit_bw),
  2069. exit_weight, (int)(rule == WEIGHT_FOR_EXIT),
  2070. U64_PRINTF_ARG(total_guard_bw), U64_PRINTF_ARG(total_nonguard_bw),
  2071. guard_weight, (int)(rule == WEIGHT_FOR_GUARD));
  2072. #endif
  2073. scale_array_elements_to_u64(bandwidths, smartlist_len(sl), NULL);
  2074. {
  2075. int idx = choose_array_element_by_weight(bandwidths,
  2076. smartlist_len(sl));
  2077. tor_free(bandwidths);
  2078. tor_free(fast_bits);
  2079. tor_free(exit_bits);
  2080. tor_free(guard_bits);
  2081. return idx < 0 ? NULL : smartlist_get(sl, idx);
  2082. }
  2083. }
  2084. /** Choose a random element of status list <b>sl</b>, weighted by
  2085. * the advertised bandwidth of each node */
  2086. const node_t *
  2087. node_sl_choose_by_bandwidth(const smartlist_t *sl,
  2088. bandwidth_weight_rule_t rule)
  2089. { /*XXXX MOVE */
  2090. const node_t *ret;
  2091. if ((ret = smartlist_choose_node_by_bandwidth_weights(sl, rule))) {
  2092. return ret;
  2093. } else {
  2094. return smartlist_choose_node_by_bandwidth(sl, rule);
  2095. }
  2096. }
  2097. /** Return a random running node from the nodelist. Never
  2098. * pick a node that is in
  2099. * <b>excludedsmartlist</b>, or which matches <b>excludedset</b>,
  2100. * even if they are the only nodes available.
  2101. * If <b>CRN_NEED_UPTIME</b> is set in flags and any router has more than
  2102. * a minimum uptime, return one of those.
  2103. * If <b>CRN_NEED_CAPACITY</b> is set in flags, weight your choice by the
  2104. * advertised capacity of each router.
  2105. * If <b>CRN_ALLOW_INVALID</b> is not set in flags, consider only Valid
  2106. * routers.
  2107. * If <b>CRN_NEED_GUARD</b> is set in flags, consider only Guard routers.
  2108. * If <b>CRN_WEIGHT_AS_EXIT</b> is set in flags, we weight bandwidths as if
  2109. * picking an exit node, otherwise we weight bandwidths for picking a relay
  2110. * node (that is, possibly discounting exit nodes).
  2111. * If <b>CRN_NEED_DESC</b> is set in flags, we only consider nodes that
  2112. * have a routerinfo or microdescriptor -- that is, enough info to be
  2113. * used to build a circuit.
  2114. */
  2115. const node_t *
  2116. router_choose_random_node(smartlist_t *excludedsmartlist,
  2117. routerset_t *excludedset,
  2118. router_crn_flags_t flags)
  2119. { /* XXXX MOVE */
  2120. const int need_uptime = (flags & CRN_NEED_UPTIME) != 0;
  2121. const int need_capacity = (flags & CRN_NEED_CAPACITY) != 0;
  2122. const int need_guard = (flags & CRN_NEED_GUARD) != 0;
  2123. const int allow_invalid = (flags & CRN_ALLOW_INVALID) != 0;
  2124. const int weight_for_exit = (flags & CRN_WEIGHT_AS_EXIT) != 0;
  2125. const int need_desc = (flags & CRN_NEED_DESC) != 0;
  2126. smartlist_t *sl=smartlist_new(),
  2127. *excludednodes=smartlist_new();
  2128. const node_t *choice = NULL;
  2129. const routerinfo_t *r;
  2130. bandwidth_weight_rule_t rule;
  2131. tor_assert(!(weight_for_exit && need_guard));
  2132. rule = weight_for_exit ? WEIGHT_FOR_EXIT :
  2133. (need_guard ? WEIGHT_FOR_GUARD : WEIGHT_FOR_MID);
  2134. /* Exclude relays that allow single hop exit circuits, if the user
  2135. * wants to (such relays might be risky) */
  2136. if (get_options()->ExcludeSingleHopRelays) {
  2137. SMARTLIST_FOREACH(nodelist_get_list(), node_t *, node,
  2138. if (node_allows_single_hop_exits(node)) {
  2139. smartlist_add(excludednodes, node);
  2140. });
  2141. }
  2142. if ((r = routerlist_find_my_routerinfo()))
  2143. routerlist_add_node_and_family(excludednodes, r);
  2144. router_add_running_nodes_to_smartlist(sl, allow_invalid,
  2145. need_uptime, need_capacity,
  2146. need_guard, need_desc);
  2147. smartlist_subtract(sl,excludednodes);
  2148. if (excludedsmartlist)
  2149. smartlist_subtract(sl,excludedsmartlist);
  2150. if (excludedset)
  2151. routerset_subtract_nodes(sl,excludedset);
  2152. // Always weight by bandwidth
  2153. choice = node_sl_choose_by_bandwidth(sl, rule);
  2154. smartlist_free(sl);
  2155. if (!choice && (need_uptime || need_capacity || need_guard)) {
  2156. /* try once more -- recurse but with fewer restrictions. */
  2157. log_info(LD_CIRC,
  2158. "We couldn't find any live%s%s%s routers; falling back "
  2159. "to list of all routers.",
  2160. need_capacity?", fast":"",
  2161. need_uptime?", stable":"",
  2162. need_guard?", guard":"");
  2163. flags &= ~ (CRN_NEED_UPTIME|CRN_NEED_CAPACITY|CRN_NEED_GUARD);
  2164. choice = router_choose_random_node(
  2165. excludedsmartlist, excludedset, flags);
  2166. }
  2167. smartlist_free(excludednodes);
  2168. if (!choice) {
  2169. log_warn(LD_CIRC,
  2170. "No available nodes when trying to choose node. Failing.");
  2171. }
  2172. return choice;
  2173. }
  2174. /** Helper: given an extended nickname in <b>hexdigest</b> try to decode it.
  2175. * Return 0 on success, -1 on failure. Store the result into the
  2176. * DIGEST_LEN-byte buffer at <b>digest_out</b>, the single character at
  2177. * <b>nickname_qualifier_char_out</b>, and the MAXNICKNAME_LEN+1-byte buffer
  2178. * at <b>nickname_out</b>.
  2179. *
  2180. * The recognized format is:
  2181. * HexName = Dollar? HexDigest NamePart?
  2182. * Dollar = '?'
  2183. * HexDigest = HexChar*20
  2184. * HexChar = 'a'..'f' | 'A'..'F' | '0'..'9'
  2185. * NamePart = QualChar Name
  2186. * QualChar = '=' | '~'
  2187. * Name = NameChar*(1..MAX_NICKNAME_LEN)
  2188. * NameChar = Any ASCII alphanumeric character
  2189. */
  2190. int
  2191. hex_digest_nickname_decode(const char *hexdigest,
  2192. char *digest_out,
  2193. char *nickname_qualifier_char_out,
  2194. char *nickname_out)
  2195. {
  2196. size_t len;
  2197. tor_assert(hexdigest);
  2198. if (hexdigest[0] == '$')
  2199. ++hexdigest;
  2200. len = strlen(hexdigest);
  2201. if (len < HEX_DIGEST_LEN) {
  2202. return -1;
  2203. } else if (len > HEX_DIGEST_LEN && (hexdigest[HEX_DIGEST_LEN] == '=' ||
  2204. hexdigest[HEX_DIGEST_LEN] == '~') &&
  2205. len <= HEX_DIGEST_LEN+1+MAX_NICKNAME_LEN) {
  2206. *nickname_qualifier_char_out = hexdigest[HEX_DIGEST_LEN];
  2207. strlcpy(nickname_out, hexdigest+HEX_DIGEST_LEN+1 , MAX_NICKNAME_LEN+1);
  2208. } else if (len == HEX_DIGEST_LEN) {
  2209. ;
  2210. } else {
  2211. return -1;
  2212. }
  2213. if (base16_decode(digest_out, DIGEST_LEN, hexdigest, HEX_DIGEST_LEN)<0)
  2214. return -1;
  2215. return 0;
  2216. }
  2217. /** Helper: Return true iff the <b>identity_digest</b> and <b>nickname</b>
  2218. * combination of a router, encoded in hexadecimal, matches <b>hexdigest</b>
  2219. * (which is optionally prefixed with a single dollar sign). Return false if
  2220. * <b>hexdigest</b> is malformed, or it doesn't match. */
  2221. int
  2222. hex_digest_nickname_matches(const char *hexdigest, const char *identity_digest,
  2223. const char *nickname, int is_named)
  2224. {
  2225. char digest[DIGEST_LEN];
  2226. char nn_char='\0';
  2227. char nn_buf[MAX_NICKNAME_LEN+1];
  2228. if (hex_digest_nickname_decode(hexdigest, digest, &nn_char, nn_buf) == -1)
  2229. return 0;
  2230. if (nn_char == '=' || nn_char == '~') {
  2231. if (!nickname)
  2232. return 0;
  2233. if (strcasecmp(nn_buf, nickname))
  2234. return 0;
  2235. if (nn_char == '=' && !is_named)
  2236. return 0;
  2237. }
  2238. return tor_memeq(digest, identity_digest, DIGEST_LEN);
  2239. }
  2240. /** Return true iff <b>router</b> is listed as named in the current
  2241. * consensus. */
  2242. int
  2243. router_is_named(const routerinfo_t *router)
  2244. {
  2245. const char *digest =
  2246. networkstatus_get_router_digest_by_nickname(router->nickname);
  2247. return (digest &&
  2248. tor_memeq(digest, router->cache_info.identity_digest, DIGEST_LEN));
  2249. }
  2250. /** Return true iff <b>digest</b> is the digest of the identity key of a
  2251. * trusted directory matching at least one bit of <b>type</b>. If <b>type</b>
  2252. * is zero (NO_DIRINFO), or ALL_DIRINFO, any authority is okay. */
  2253. int
  2254. router_digest_is_trusted_dir_type(const char *digest, dirinfo_type_t type)
  2255. {
  2256. if (!trusted_dir_servers)
  2257. return 0;
  2258. if (authdir_mode(get_options()) && router_digest_is_me(digest))
  2259. return 1;
  2260. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ent,
  2261. if (tor_memeq(digest, ent->digest, DIGEST_LEN)) {
  2262. return (!type) || ((type & ent->type) != 0);
  2263. });
  2264. return 0;
  2265. }
  2266. /** Return true iff <b>addr</b> is the address of one of our trusted
  2267. * directory authorities. */
  2268. int
  2269. router_addr_is_trusted_dir(uint32_t addr)
  2270. {
  2271. if (!trusted_dir_servers)
  2272. return 0;
  2273. SMARTLIST_FOREACH(trusted_dir_servers, dir_server_t *, ent,
  2274. if (ent->addr == addr)
  2275. return 1;
  2276. );
  2277. return 0;
  2278. }
  2279. /** If hexdigest is correctly formed, base16_decode it into
  2280. * digest, which must have DIGEST_LEN space in it.
  2281. * Return 0 on success, -1 on failure.
  2282. */
  2283. int
  2284. hexdigest_to_digest(const char *hexdigest, char *digest)
  2285. {
  2286. if (hexdigest[0]=='$')
  2287. ++hexdigest;
  2288. if (strlen(hexdigest) < HEX_DIGEST_LEN ||
  2289. base16_decode(digest,DIGEST_LEN,hexdigest,HEX_DIGEST_LEN) < 0)
  2290. return -1;
  2291. return 0;
  2292. }
  2293. /** As router_get_by_id_digest,but return a pointer that you're allowed to
  2294. * modify */
  2295. routerinfo_t *
  2296. router_get_mutable_by_digest(const char *digest)
  2297. {
  2298. tor_assert(digest);
  2299. if (!routerlist) return NULL;
  2300. // routerlist_assert_ok(routerlist);
  2301. return rimap_get(routerlist->identity_map, digest);
  2302. }
  2303. /** Return the router in our routerlist whose 20-byte key digest
  2304. * is <b>digest</b>. Return NULL if no such router is known. */
  2305. const routerinfo_t *
  2306. router_get_by_id_digest(const char *digest)
  2307. {
  2308. return router_get_mutable_by_digest(digest);
  2309. }
  2310. /** Return the router in our routerlist whose 20-byte descriptor
  2311. * is <b>digest</b>. Return NULL if no such router is known. */
  2312. signed_descriptor_t *
  2313. router_get_by_descriptor_digest(const char *digest)
  2314. {
  2315. tor_assert(digest);
  2316. if (!routerlist) return NULL;
  2317. return sdmap_get(routerlist->desc_digest_map, digest);
  2318. }
  2319. /** Return the signed descriptor for the router in our routerlist whose
  2320. * 20-byte extra-info digest is <b>digest</b>. Return NULL if no such router
  2321. * is known. */
  2322. MOCK_IMPL(signed_descriptor_t *,
  2323. router_get_by_extrainfo_digest,(const char *digest))
  2324. {
  2325. tor_assert(digest);
  2326. if (!routerlist) return NULL;
  2327. return sdmap_get(routerlist->desc_by_eid_map, digest);
  2328. }
  2329. /** Return the signed descriptor for the extrainfo_t in our routerlist whose
  2330. * extra-info-digest is <b>digest</b>. Return NULL if no such extra-info
  2331. * document is known. */
  2332. signed_descriptor_t *
  2333. extrainfo_get_by_descriptor_digest(const char *digest)
  2334. {
  2335. extrainfo_t *ei;
  2336. tor_assert(digest);
  2337. if (!routerlist) return NULL;
  2338. ei = eimap_get(routerlist->extra_info_map, digest);
  2339. return ei ? &ei->cache_info : NULL;
  2340. }
  2341. /** Return a pointer to the signed textual representation of a descriptor.
  2342. * The returned string is not guaranteed to be NUL-terminated: the string's
  2343. * length will be in desc-\>signed_descriptor_len.
  2344. *
  2345. * If <b>with_annotations</b> is set, the returned string will include
  2346. * the annotations
  2347. * (if any) preceding the descriptor. This will increase the length of the
  2348. * string by desc-\>annotations_len.
  2349. *
  2350. * The caller must not free the string returned.
  2351. */
  2352. static const char *
  2353. signed_descriptor_get_body_impl(const signed_descriptor_t *desc,
  2354. int with_annotations)
  2355. {
  2356. const char *r = NULL;
  2357. size_t len = desc->signed_descriptor_len;
  2358. off_t offset = desc->saved_offset;
  2359. if (with_annotations)
  2360. len += desc->annotations_len;
  2361. else
  2362. offset += desc->annotations_len;
  2363. tor_assert(len > 32);
  2364. if (desc->saved_location == SAVED_IN_CACHE && routerlist) {
  2365. desc_store_t *store = desc_get_store(router_get_routerlist(), desc);
  2366. if (store && store->mmap) {
  2367. tor_assert(desc->saved_offset + len <= store->mmap->size);
  2368. r = store->mmap->data + offset;
  2369. } else if (store) {
  2370. log_err(LD_DIR, "We couldn't read a descriptor that is supposedly "
  2371. "mmaped in our cache. Is another process running in our data "
  2372. "directory? Exiting.");
  2373. exit(1);
  2374. }
  2375. }
  2376. if (!r) /* no mmap, or not in cache. */
  2377. r = desc->signed_descriptor_body +
  2378. (with_annotations ? 0 : desc->annotations_len);
  2379. tor_assert(r);
  2380. if (!with_annotations) {
  2381. if (fast_memcmp("router ", r, 7) && fast_memcmp("extra-info ", r, 11)) {
  2382. char *cp = tor_strndup(r, 64);
  2383. log_err(LD_DIR, "descriptor at %p begins with unexpected string %s. "
  2384. "Is another process running in our data directory? Exiting.",
  2385. desc, escaped(cp));
  2386. exit(1);
  2387. }
  2388. }
  2389. return r;
  2390. }
  2391. /** Return a pointer to the signed textual representation of a descriptor.
  2392. * The returned string is not guaranteed to be NUL-terminated: the string's
  2393. * length will be in desc-\>signed_descriptor_len.
  2394. *
  2395. * The caller must not free the string returned.
  2396. */
  2397. const char *
  2398. signed_descriptor_get_body(const signed_descriptor_t *desc)
  2399. {
  2400. return signed_descriptor_get_body_impl(desc, 0);
  2401. }
  2402. /** As signed_descriptor_get_body(), but points to the beginning of the
  2403. * annotations section rather than the beginning of the descriptor. */
  2404. const char *
  2405. signed_descriptor_get_annotations(const signed_descriptor_t *desc)
  2406. {
  2407. return signed_descriptor_get_body_impl(desc, 1);
  2408. }
  2409. /** Return the current list of all known routers. */
  2410. routerlist_t *
  2411. router_get_routerlist(void)
  2412. {
  2413. if (PREDICT_UNLIKELY(!routerlist)) {
  2414. routerlist = tor_malloc_zero(sizeof(routerlist_t));
  2415. routerlist->routers = smartlist_new();
  2416. routerlist->old_routers = smartlist_new();
  2417. routerlist->identity_map = rimap_new();
  2418. routerlist->desc_digest_map = sdmap_new();
  2419. routerlist->desc_by_eid_map = sdmap_new();
  2420. routerlist->extra_info_map = eimap_new();
  2421. routerlist->desc_store.fname_base = "cached-descriptors";
  2422. routerlist->extrainfo_store.fname_base = "cached-extrainfo";
  2423. routerlist->desc_store.type = ROUTER_STORE;
  2424. routerlist->extrainfo_store.type = EXTRAINFO_STORE;
  2425. routerlist->desc_store.description = "router descriptors";
  2426. routerlist->extrainfo_store.description = "extra-info documents";
  2427. }
  2428. return routerlist;
  2429. }
  2430. /** Free all storage held by <b>router</b>. */
  2431. void
  2432. routerinfo_free(routerinfo_t *router)
  2433. {
  2434. if (!router)
  2435. return;
  2436. tor_free(router->cache_info.signed_descriptor_body);
  2437. tor_free(router->nickname);
  2438. tor_free(router->platform);
  2439. tor_free(router->contact_info);
  2440. if (router->onion_pkey)
  2441. crypto_pk_free(router->onion_pkey);
  2442. tor_free(router->onion_curve25519_pkey);
  2443. if (router->identity_pkey)
  2444. crypto_pk_free(router->identity_pkey);
  2445. if (router->declared_family) {
  2446. SMARTLIST_FOREACH(router->declared_family, char *, s, tor_free(s));
  2447. smartlist_free(router->declared_family);
  2448. }
  2449. addr_policy_list_free(router->exit_policy);
  2450. short_policy_free(router->ipv6_exit_policy);
  2451. memset(router, 77, sizeof(routerinfo_t));
  2452. tor_free(router);
  2453. }
  2454. /** Release all storage held by <b>extrainfo</b> */
  2455. void
  2456. extrainfo_free(extrainfo_t *extrainfo)
  2457. {
  2458. if (!extrainfo)
  2459. return;
  2460. tor_free(extrainfo->cache_info.signed_descriptor_body);
  2461. tor_free(extrainfo->pending_sig);
  2462. memset(extrainfo, 88, sizeof(extrainfo_t)); /* debug bad memory usage */
  2463. tor_free(extrainfo);
  2464. }
  2465. /** Release storage held by <b>sd</b>. */
  2466. static void
  2467. signed_descriptor_free(signed_descriptor_t *sd)
  2468. {
  2469. if (!sd)
  2470. return;
  2471. tor_free(sd->signed_descriptor_body);
  2472. memset(sd, 99, sizeof(signed_descriptor_t)); /* Debug bad mem usage */
  2473. tor_free(sd);
  2474. }
  2475. /** Extract a signed_descriptor_t from a general routerinfo, and free the
  2476. * routerinfo.
  2477. */
  2478. static signed_descriptor_t *
  2479. signed_descriptor_from_routerinfo(routerinfo_t *ri)
  2480. {
  2481. signed_descriptor_t *sd;
  2482. tor_assert(ri->purpose == ROUTER_PURPOSE_GENERAL);
  2483. sd = tor_malloc_zero(sizeof(signed_descriptor_t));
  2484. memcpy(sd, &(ri->cache_info), sizeof(signed_descriptor_t));
  2485. sd->routerlist_index = -1;
  2486. ri->cache_info.signed_descriptor_body = NULL;
  2487. routerinfo_free(ri);
  2488. return sd;
  2489. }
  2490. /** Helper: free the storage held by the extrainfo_t in <b>e</b>. */
  2491. static void
  2492. extrainfo_free_(void *e)
  2493. {
  2494. extrainfo_free(e);
  2495. }
  2496. /** Free all storage held by a routerlist <b>rl</b>. */
  2497. void
  2498. routerlist_free(routerlist_t *rl)
  2499. {
  2500. if (!rl)
  2501. return;
  2502. rimap_free(rl->identity_map, NULL);
  2503. sdmap_free(rl->desc_digest_map, NULL);
  2504. sdmap_free(rl->desc_by_eid_map, NULL);
  2505. eimap_free(rl->extra_info_map, extrainfo_free_);
  2506. SMARTLIST_FOREACH(rl->routers, routerinfo_t *, r,
  2507. routerinfo_free(r));
  2508. SMARTLIST_FOREACH(rl->old_routers, signed_descriptor_t *, sd,
  2509. signed_descriptor_free(sd));
  2510. smartlist_free(rl->routers);
  2511. smartlist_free(rl->old_routers);
  2512. if (rl->desc_store.mmap) {
  2513. int res = tor_munmap_file(routerlist->desc_store.mmap);
  2514. if (res != 0) {
  2515. log_warn(LD_FS, "Failed to munmap routerlist->desc_store.mmap");
  2516. }
  2517. }
  2518. if (rl->extrainfo_store.mmap) {
  2519. int res = tor_munmap_file(routerlist->extrainfo_store.mmap);
  2520. if (res != 0) {
  2521. log_warn(LD_FS, "Failed to munmap routerlist->extrainfo_store.mmap");
  2522. }
  2523. }
  2524. tor_free(rl);
  2525. router_dir_info_changed();
  2526. }
  2527. /** Log information about how much memory is being used for routerlist,
  2528. * at log level <b>severity</b>. */
  2529. void
  2530. dump_routerlist_mem_usage(int severity)
  2531. {
  2532. uint64_t livedescs = 0;
  2533. uint64_t olddescs = 0;
  2534. if (!routerlist)
  2535. return;
  2536. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, r,
  2537. livedescs += r->cache_info.signed_descriptor_len);
  2538. SMARTLIST_FOREACH(routerlist->old_routers, signed_descriptor_t *, sd,
  2539. olddescs += sd->signed_descriptor_len);
  2540. tor_log(severity, LD_DIR,
  2541. "In %d live descriptors: "U64_FORMAT" bytes. "
  2542. "In %d old descriptors: "U64_FORMAT" bytes.",
  2543. smartlist_len(routerlist->routers), U64_PRINTF_ARG(livedescs),
  2544. smartlist_len(routerlist->old_routers), U64_PRINTF_ARG(olddescs));
  2545. }
  2546. /** Debugging helper: If <b>idx</b> is nonnegative, assert that <b>ri</b> is
  2547. * in <b>sl</b> at position <b>idx</b>. Otherwise, search <b>sl</b> for
  2548. * <b>ri</b>. Return the index of <b>ri</b> in <b>sl</b>, or -1 if <b>ri</b>
  2549. * is not in <b>sl</b>. */
  2550. static INLINE int
  2551. routerlist_find_elt_(smartlist_t *sl, void *ri, int idx)
  2552. {
  2553. if (idx < 0) {
  2554. idx = -1;
  2555. SMARTLIST_FOREACH(sl, routerinfo_t *, r,
  2556. if (r == ri) {
  2557. idx = r_sl_idx;
  2558. break;
  2559. });
  2560. } else {
  2561. tor_assert(idx < smartlist_len(sl));
  2562. tor_assert(smartlist_get(sl, idx) == ri);
  2563. };
  2564. return idx;
  2565. }
  2566. /** Insert an item <b>ri</b> into the routerlist <b>rl</b>, updating indices
  2567. * as needed. There must be no previous member of <b>rl</b> with the same
  2568. * identity digest as <b>ri</b>: If there is, call routerlist_replace
  2569. * instead.
  2570. */
  2571. static void
  2572. routerlist_insert(routerlist_t *rl, routerinfo_t *ri)
  2573. {
  2574. routerinfo_t *ri_old;
  2575. signed_descriptor_t *sd_old;
  2576. {
  2577. const routerinfo_t *ri_generated = router_get_my_routerinfo();
  2578. tor_assert(ri_generated != ri);
  2579. }
  2580. tor_assert(ri->cache_info.routerlist_index == -1);
  2581. ri_old = rimap_set(rl->identity_map, ri->cache_info.identity_digest, ri);
  2582. tor_assert(!ri_old);
  2583. sd_old = sdmap_set(rl->desc_digest_map,
  2584. ri->cache_info.signed_descriptor_digest,
  2585. &(ri->cache_info));
  2586. if (sd_old) {
  2587. int idx = sd_old->routerlist_index;
  2588. sd_old->routerlist_index = -1;
  2589. smartlist_del(rl->old_routers, idx);
  2590. if (idx < smartlist_len(rl->old_routers)) {
  2591. signed_descriptor_t *d = smartlist_get(rl->old_routers, idx);
  2592. d->routerlist_index = idx;
  2593. }
  2594. rl->desc_store.bytes_dropped += sd_old->signed_descriptor_len;
  2595. sdmap_remove(rl->desc_by_eid_map, sd_old->extra_info_digest);
  2596. signed_descriptor_free(sd_old);
  2597. }
  2598. if (!tor_digest_is_zero(ri->cache_info.extra_info_digest))
  2599. sdmap_set(rl->desc_by_eid_map, ri->cache_info.extra_info_digest,
  2600. &ri->cache_info);
  2601. smartlist_add(rl->routers, ri);
  2602. ri->cache_info.routerlist_index = smartlist_len(rl->routers) - 1;
  2603. nodelist_set_routerinfo(ri, NULL);
  2604. router_dir_info_changed();
  2605. #ifdef DEBUG_ROUTERLIST
  2606. routerlist_assert_ok(rl);
  2607. #endif
  2608. }
  2609. /** Adds the extrainfo_t <b>ei</b> to the routerlist <b>rl</b>, if there is a
  2610. * corresponding router in rl-\>routers or rl-\>old_routers. Return the status
  2611. * of inserting <b>ei</b>. Free <b>ei</b> if it isn't inserted. */
  2612. MOCK_IMPL(STATIC was_router_added_t,
  2613. extrainfo_insert,(routerlist_t *rl, extrainfo_t *ei))
  2614. {
  2615. was_router_added_t r;
  2616. const char *compatibility_error_msg;
  2617. routerinfo_t *ri = rimap_get(rl->identity_map,
  2618. ei->cache_info.identity_digest);
  2619. signed_descriptor_t *sd =
  2620. sdmap_get(rl->desc_by_eid_map, ei->cache_info.signed_descriptor_digest);
  2621. extrainfo_t *ei_tmp;
  2622. {
  2623. extrainfo_t *ei_generated = router_get_my_extrainfo();
  2624. tor_assert(ei_generated != ei);
  2625. }
  2626. if (!ri) {
  2627. /* This router is unknown; we can't even verify the signature. Give up.*/
  2628. r = ROUTER_NOT_IN_CONSENSUS;
  2629. goto done;
  2630. }
  2631. if (routerinfo_incompatible_with_extrainfo(ri, ei, sd,
  2632. &compatibility_error_msg)) {
  2633. r = (ri->cache_info.extrainfo_is_bogus) ?
  2634. ROUTER_BAD_EI : ROUTER_NOT_IN_CONSENSUS;
  2635. log_warn(LD_DIR,"router info incompatible with extra info (reason: %s)",
  2636. compatibility_error_msg);
  2637. goto done;
  2638. }
  2639. /* Okay, if we make it here, we definitely have a router corresponding to
  2640. * this extrainfo. */
  2641. ei_tmp = eimap_set(rl->extra_info_map,
  2642. ei->cache_info.signed_descriptor_digest,
  2643. ei);
  2644. r = ROUTER_ADDED_SUCCESSFULLY;
  2645. if (ei_tmp) {
  2646. rl->extrainfo_store.bytes_dropped +=
  2647. ei_tmp->cache_info.signed_descriptor_len;
  2648. extrainfo_free(ei_tmp);
  2649. }
  2650. done:
  2651. if (r != ROUTER_ADDED_SUCCESSFULLY)
  2652. extrainfo_free(ei);
  2653. #ifdef DEBUG_ROUTERLIST
  2654. routerlist_assert_ok(rl);
  2655. #endif
  2656. return r;
  2657. }
  2658. #define should_cache_old_descriptors() \
  2659. directory_caches_dir_info(get_options())
  2660. /** If we're a directory cache and routerlist <b>rl</b> doesn't have
  2661. * a copy of router <b>ri</b> yet, add it to the list of old (not
  2662. * recommended but still served) descriptors. Else free it. */
  2663. static void
  2664. routerlist_insert_old(routerlist_t *rl, routerinfo_t *ri)
  2665. {
  2666. {
  2667. const routerinfo_t *ri_generated = router_get_my_routerinfo();
  2668. tor_assert(ri_generated != ri);
  2669. }
  2670. tor_assert(ri->cache_info.routerlist_index == -1);
  2671. if (should_cache_old_descriptors() &&
  2672. ri->purpose == ROUTER_PURPOSE_GENERAL &&
  2673. !sdmap_get(rl->desc_digest_map,
  2674. ri->cache_info.signed_descriptor_digest)) {
  2675. signed_descriptor_t *sd = signed_descriptor_from_routerinfo(ri);
  2676. sdmap_set(rl->desc_digest_map, sd->signed_descriptor_digest, sd);
  2677. smartlist_add(rl->old_routers, sd);
  2678. sd->routerlist_index = smartlist_len(rl->old_routers)-1;
  2679. if (!tor_digest_is_zero(sd->extra_info_digest))
  2680. sdmap_set(rl->desc_by_eid_map, sd->extra_info_digest, sd);
  2681. } else {
  2682. routerinfo_free(ri);
  2683. }
  2684. #ifdef DEBUG_ROUTERLIST
  2685. routerlist_assert_ok(rl);
  2686. #endif
  2687. }
  2688. /** Remove an item <b>ri</b> from the routerlist <b>rl</b>, updating indices
  2689. * as needed. If <b>idx</b> is nonnegative and smartlist_get(rl-&gt;routers,
  2690. * idx) == ri, we don't need to do a linear search over the list to decide
  2691. * which to remove. We fill the gap in rl-&gt;routers with a later element in
  2692. * the list, if any exists. <b>ri</b> is freed.
  2693. *
  2694. * If <b>make_old</b> is true, instead of deleting the router, we try adding
  2695. * it to rl-&gt;old_routers. */
  2696. void
  2697. routerlist_remove(routerlist_t *rl, routerinfo_t *ri, int make_old, time_t now)
  2698. {
  2699. routerinfo_t *ri_tmp;
  2700. extrainfo_t *ei_tmp;
  2701. int idx = ri->cache_info.routerlist_index;
  2702. tor_assert(0 <= idx && idx < smartlist_len(rl->routers));
  2703. tor_assert(smartlist_get(rl->routers, idx) == ri);
  2704. nodelist_remove_routerinfo(ri);
  2705. /* make sure the rephist module knows that it's not running */
  2706. rep_hist_note_router_unreachable(ri->cache_info.identity_digest, now);
  2707. ri->cache_info.routerlist_index = -1;
  2708. smartlist_del(rl->routers, idx);
  2709. if (idx < smartlist_len(rl->routers)) {
  2710. routerinfo_t *r = smartlist_get(rl->routers, idx);
  2711. r->cache_info.routerlist_index = idx;
  2712. }
  2713. ri_tmp = rimap_remove(rl->identity_map, ri->cache_info.identity_digest);
  2714. router_dir_info_changed();
  2715. tor_assert(ri_tmp == ri);
  2716. if (make_old && should_cache_old_descriptors() &&
  2717. ri->purpose == ROUTER_PURPOSE_GENERAL) {
  2718. signed_descriptor_t *sd;
  2719. sd = signed_descriptor_from_routerinfo(ri);
  2720. smartlist_add(rl->old_routers, sd);
  2721. sd->routerlist_index = smartlist_len(rl->old_routers)-1;
  2722. sdmap_set(rl->desc_digest_map, sd->signed_descriptor_digest, sd);
  2723. if (!tor_digest_is_zero(sd->extra_info_digest))
  2724. sdmap_set(rl->desc_by_eid_map, sd->extra_info_digest, sd);
  2725. } else {
  2726. signed_descriptor_t *sd_tmp;
  2727. sd_tmp = sdmap_remove(rl->desc_digest_map,
  2728. ri->cache_info.signed_descriptor_digest);
  2729. tor_assert(sd_tmp == &(ri->cache_info));
  2730. rl->desc_store.bytes_dropped += ri->cache_info.signed_descriptor_len;
  2731. ei_tmp = eimap_remove(rl->extra_info_map,
  2732. ri->cache_info.extra_info_digest);
  2733. if (ei_tmp) {
  2734. rl->extrainfo_store.bytes_dropped +=
  2735. ei_tmp->cache_info.signed_descriptor_len;
  2736. extrainfo_free(ei_tmp);
  2737. }
  2738. if (!tor_digest_is_zero(ri->cache_info.extra_info_digest))
  2739. sdmap_remove(rl->desc_by_eid_map, ri->cache_info.extra_info_digest);
  2740. routerinfo_free(ri);
  2741. }
  2742. #ifdef DEBUG_ROUTERLIST
  2743. routerlist_assert_ok(rl);
  2744. #endif
  2745. }
  2746. /** Remove a signed_descriptor_t <b>sd</b> from <b>rl</b>-\>old_routers, and
  2747. * adjust <b>rl</b> as appropriate. <b>idx</b> is -1, or the index of
  2748. * <b>sd</b>. */
  2749. static void
  2750. routerlist_remove_old(routerlist_t *rl, signed_descriptor_t *sd, int idx)
  2751. {
  2752. signed_descriptor_t *sd_tmp;
  2753. extrainfo_t *ei_tmp;
  2754. desc_store_t *store;
  2755. if (idx == -1) {
  2756. idx = sd->routerlist_index;
  2757. }
  2758. tor_assert(0 <= idx && idx < smartlist_len(rl->old_routers));
  2759. /* XXXX edmanm's bridge relay triggered the following assert while
  2760. * running 0.2.0.12-alpha. If anybody triggers this again, see if we
  2761. * can get a backtrace. */
  2762. tor_assert(smartlist_get(rl->old_routers, idx) == sd);
  2763. tor_assert(idx == sd->routerlist_index);
  2764. sd->routerlist_index = -1;
  2765. smartlist_del(rl->old_routers, idx);
  2766. if (idx < smartlist_len(rl->old_routers)) {
  2767. signed_descriptor_t *d = smartlist_get(rl->old_routers, idx);
  2768. d->routerlist_index = idx;
  2769. }
  2770. sd_tmp = sdmap_remove(rl->desc_digest_map,
  2771. sd->signed_descriptor_digest);
  2772. tor_assert(sd_tmp == sd);
  2773. store = desc_get_store(rl, sd);
  2774. if (store)
  2775. store->bytes_dropped += sd->signed_descriptor_len;
  2776. ei_tmp = eimap_remove(rl->extra_info_map,
  2777. sd->extra_info_digest);
  2778. if (ei_tmp) {
  2779. rl->extrainfo_store.bytes_dropped +=
  2780. ei_tmp->cache_info.signed_descriptor_len;
  2781. extrainfo_free(ei_tmp);
  2782. }
  2783. if (!tor_digest_is_zero(sd->extra_info_digest))
  2784. sdmap_remove(rl->desc_by_eid_map, sd->extra_info_digest);
  2785. signed_descriptor_free(sd);
  2786. #ifdef DEBUG_ROUTERLIST
  2787. routerlist_assert_ok(rl);
  2788. #endif
  2789. }
  2790. /** Remove <b>ri_old</b> from the routerlist <b>rl</b>, and replace it with
  2791. * <b>ri_new</b>, updating all index info. If <b>idx</b> is nonnegative and
  2792. * smartlist_get(rl-&gt;routers, idx) == ri, we don't need to do a linear
  2793. * search over the list to decide which to remove. We put ri_new in the same
  2794. * index as ri_old, if possible. ri is freed as appropriate.
  2795. *
  2796. * If should_cache_descriptors() is true, instead of deleting the router,
  2797. * we add it to rl-&gt;old_routers. */
  2798. static void
  2799. routerlist_replace(routerlist_t *rl, routerinfo_t *ri_old,
  2800. routerinfo_t *ri_new)
  2801. {
  2802. int idx;
  2803. int same_descriptors;
  2804. routerinfo_t *ri_tmp;
  2805. extrainfo_t *ei_tmp;
  2806. {
  2807. const routerinfo_t *ri_generated = router_get_my_routerinfo();
  2808. tor_assert(ri_generated != ri_new);
  2809. }
  2810. tor_assert(ri_old != ri_new);
  2811. tor_assert(ri_new->cache_info.routerlist_index == -1);
  2812. idx = ri_old->cache_info.routerlist_index;
  2813. tor_assert(0 <= idx && idx < smartlist_len(rl->routers));
  2814. tor_assert(smartlist_get(rl->routers, idx) == ri_old);
  2815. {
  2816. routerinfo_t *ri_old_tmp=NULL;
  2817. nodelist_set_routerinfo(ri_new, &ri_old_tmp);
  2818. tor_assert(ri_old == ri_old_tmp);
  2819. }
  2820. router_dir_info_changed();
  2821. if (idx >= 0) {
  2822. smartlist_set(rl->routers, idx, ri_new);
  2823. ri_old->cache_info.routerlist_index = -1;
  2824. ri_new->cache_info.routerlist_index = idx;
  2825. /* Check that ri_old is not in rl->routers anymore: */
  2826. tor_assert( routerlist_find_elt_(rl->routers, ri_old, -1) == -1 );
  2827. } else {
  2828. log_warn(LD_BUG, "Appending entry from routerlist_replace.");
  2829. routerlist_insert(rl, ri_new);
  2830. return;
  2831. }
  2832. if (tor_memneq(ri_old->cache_info.identity_digest,
  2833. ri_new->cache_info.identity_digest, DIGEST_LEN)) {
  2834. /* digests don't match; digestmap_set won't replace */
  2835. rimap_remove(rl->identity_map, ri_old->cache_info.identity_digest);
  2836. }
  2837. ri_tmp = rimap_set(rl->identity_map,
  2838. ri_new->cache_info.identity_digest, ri_new);
  2839. tor_assert(!ri_tmp || ri_tmp == ri_old);
  2840. sdmap_set(rl->desc_digest_map,
  2841. ri_new->cache_info.signed_descriptor_digest,
  2842. &(ri_new->cache_info));
  2843. if (!tor_digest_is_zero(ri_new->cache_info.extra_info_digest)) {
  2844. sdmap_set(rl->desc_by_eid_map, ri_new->cache_info.extra_info_digest,
  2845. &ri_new->cache_info);
  2846. }
  2847. same_descriptors = tor_memeq(ri_old->cache_info.signed_descriptor_digest,
  2848. ri_new->cache_info.signed_descriptor_digest,
  2849. DIGEST_LEN);
  2850. if (should_cache_old_descriptors() &&
  2851. ri_old->purpose == ROUTER_PURPOSE_GENERAL &&
  2852. !same_descriptors) {
  2853. /* ri_old is going to become a signed_descriptor_t and go into
  2854. * old_routers */
  2855. signed_descriptor_t *sd = signed_descriptor_from_routerinfo(ri_old);
  2856. smartlist_add(rl->old_routers, sd);
  2857. sd->routerlist_index = smartlist_len(rl->old_routers)-1;
  2858. sdmap_set(rl->desc_digest_map, sd->signed_descriptor_digest, sd);
  2859. if (!tor_digest_is_zero(sd->extra_info_digest))
  2860. sdmap_set(rl->desc_by_eid_map, sd->extra_info_digest, sd);
  2861. } else {
  2862. /* We're dropping ri_old. */
  2863. if (!same_descriptors) {
  2864. /* digests don't match; The sdmap_set above didn't replace */
  2865. sdmap_remove(rl->desc_digest_map,
  2866. ri_old->cache_info.signed_descriptor_digest);
  2867. if (tor_memneq(ri_old->cache_info.extra_info_digest,
  2868. ri_new->cache_info.extra_info_digest, DIGEST_LEN)) {
  2869. ei_tmp = eimap_remove(rl->extra_info_map,
  2870. ri_old->cache_info.extra_info_digest);
  2871. if (ei_tmp) {
  2872. rl->extrainfo_store.bytes_dropped +=
  2873. ei_tmp->cache_info.signed_descriptor_len;
  2874. extrainfo_free(ei_tmp);
  2875. }
  2876. }
  2877. if (!tor_digest_is_zero(ri_old->cache_info.extra_info_digest)) {
  2878. sdmap_remove(rl->desc_by_eid_map,
  2879. ri_old->cache_info.extra_info_digest);
  2880. }
  2881. }
  2882. rl->desc_store.bytes_dropped += ri_old->cache_info.signed_descriptor_len;
  2883. routerinfo_free(ri_old);
  2884. }
  2885. #ifdef DEBUG_ROUTERLIST
  2886. routerlist_assert_ok(rl);
  2887. #endif
  2888. }
  2889. /** Extract the descriptor <b>sd</b> from old_routerlist, and re-parse
  2890. * it as a fresh routerinfo_t. */
  2891. static routerinfo_t *
  2892. routerlist_reparse_old(routerlist_t *rl, signed_descriptor_t *sd)
  2893. {
  2894. routerinfo_t *ri;
  2895. const char *body;
  2896. body = signed_descriptor_get_annotations(sd);
  2897. ri = router_parse_entry_from_string(body,
  2898. body+sd->signed_descriptor_len+sd->annotations_len,
  2899. 0, 1, NULL, NULL);
  2900. if (!ri)
  2901. return NULL;
  2902. memcpy(&ri->cache_info, sd, sizeof(signed_descriptor_t));
  2903. sd->signed_descriptor_body = NULL; /* Steal reference. */
  2904. ri->cache_info.routerlist_index = -1;
  2905. routerlist_remove_old(rl, sd, -1);
  2906. return ri;
  2907. }
  2908. /** Free all memory held by the routerlist module. */
  2909. void
  2910. routerlist_free_all(void)
  2911. {
  2912. routerlist_free(routerlist);
  2913. routerlist = NULL;
  2914. if (warned_nicknames) {
  2915. SMARTLIST_FOREACH(warned_nicknames, char *, cp, tor_free(cp));
  2916. smartlist_free(warned_nicknames);
  2917. warned_nicknames = NULL;
  2918. }
  2919. clear_dir_servers();
  2920. smartlist_free(trusted_dir_servers);
  2921. smartlist_free(fallback_dir_servers);
  2922. trusted_dir_servers = fallback_dir_servers = NULL;
  2923. if (trusted_dir_certs) {
  2924. digestmap_free(trusted_dir_certs, cert_list_free_);
  2925. trusted_dir_certs = NULL;
  2926. }
  2927. }
  2928. /** Forget that we have issued any router-related warnings, so that we'll
  2929. * warn again if we see the same errors. */
  2930. void
  2931. routerlist_reset_warnings(void)
  2932. {
  2933. if (!warned_nicknames)
  2934. warned_nicknames = smartlist_new();
  2935. SMARTLIST_FOREACH(warned_nicknames, char *, cp, tor_free(cp));
  2936. smartlist_clear(warned_nicknames); /* now the list is empty. */
  2937. networkstatus_reset_warnings();
  2938. }
  2939. /** Return 1 if the signed descriptor of this router is older than
  2940. * <b>seconds</b> seconds. Otherwise return 0. */
  2941. MOCK_IMPL(int,
  2942. router_descriptor_is_older_than,(const routerinfo_t *router, int seconds))
  2943. {
  2944. return router->cache_info.published_on < approx_time() - seconds;
  2945. }
  2946. /** Add <b>router</b> to the routerlist, if we don't already have it. Replace
  2947. * older entries (if any) with the same key. Note: Callers should not hold
  2948. * their pointers to <b>router</b> if this function fails; <b>router</b>
  2949. * will either be inserted into the routerlist or freed. Similarly, even
  2950. * if this call succeeds, they should not hold their pointers to
  2951. * <b>router</b> after subsequent calls with other routerinfo's -- they
  2952. * might cause the original routerinfo to get freed.
  2953. *
  2954. * Returns the status for the operation. Might set *<b>msg</b> if it wants
  2955. * the poster of the router to know something.
  2956. *
  2957. * If <b>from_cache</b>, this descriptor came from our disk cache. If
  2958. * <b>from_fetch</b>, we received it in response to a request we made.
  2959. * (If both are false, that means it was uploaded to us as an auth dir
  2960. * server or via the controller.)
  2961. *
  2962. * This function should be called *after*
  2963. * routers_update_status_from_consensus_networkstatus; subsequently, you
  2964. * should call router_rebuild_store and routerlist_descriptors_added.
  2965. */
  2966. was_router_added_t
  2967. router_add_to_routerlist(routerinfo_t *router, const char **msg,
  2968. int from_cache, int from_fetch)
  2969. {
  2970. const char *id_digest;
  2971. const or_options_t *options = get_options();
  2972. int authdir = authdir_mode_handles_descs(options, router->purpose);
  2973. int authdir_believes_valid = 0;
  2974. routerinfo_t *old_router;
  2975. networkstatus_t *consensus =
  2976. networkstatus_get_latest_consensus_by_flavor(FLAV_NS);
  2977. int in_consensus = 0;
  2978. tor_assert(msg);
  2979. if (!routerlist)
  2980. router_get_routerlist();
  2981. id_digest = router->cache_info.identity_digest;
  2982. old_router = router_get_mutable_by_digest(id_digest);
  2983. /* Make sure that we haven't already got this exact descriptor. */
  2984. if (sdmap_get(routerlist->desc_digest_map,
  2985. router->cache_info.signed_descriptor_digest)) {
  2986. /* If we have this descriptor already and the new descriptor is a bridge
  2987. * descriptor, replace it. If we had a bridge descriptor before and the
  2988. * new one is not a bridge descriptor, don't replace it. */
  2989. /* Only members of routerlist->identity_map can be bridges; we don't
  2990. * put bridges in old_routers. */
  2991. const int was_bridge = old_router &&
  2992. old_router->purpose == ROUTER_PURPOSE_BRIDGE;
  2993. if (routerinfo_is_a_configured_bridge(router) &&
  2994. router->purpose == ROUTER_PURPOSE_BRIDGE &&
  2995. !was_bridge) {
  2996. log_info(LD_DIR, "Replacing non-bridge descriptor with bridge "
  2997. "descriptor for router %s",
  2998. router_describe(router));
  2999. } else {
  3000. log_info(LD_DIR,
  3001. "Dropping descriptor that we already have for router %s",
  3002. router_describe(router));
  3003. *msg = "Router descriptor was not new.";
  3004. routerinfo_free(router);
  3005. return ROUTER_IS_ALREADY_KNOWN;
  3006. }
  3007. }
  3008. if (authdir) {
  3009. if (authdir_wants_to_reject_router(router, msg,
  3010. !from_cache && !from_fetch,
  3011. &authdir_believes_valid)) {
  3012. tor_assert(*msg);
  3013. routerinfo_free(router);
  3014. return ROUTER_AUTHDIR_REJECTS;
  3015. }
  3016. } else if (from_fetch) {
  3017. /* Only check the descriptor digest against the network statuses when
  3018. * we are receiving in response to a fetch. */
  3019. if (!signed_desc_digest_is_recognized(&router->cache_info) &&
  3020. !routerinfo_is_a_configured_bridge(router)) {
  3021. /* We asked for it, so some networkstatus must have listed it when we
  3022. * did. Save it if we're a cache in case somebody else asks for it. */
  3023. log_info(LD_DIR,
  3024. "Received a no-longer-recognized descriptor for router %s",
  3025. router_describe(router));
  3026. *msg = "Router descriptor is not referenced by any network-status.";
  3027. /* Only journal this desc if we'll be serving it. */
  3028. if (!from_cache && should_cache_old_descriptors())
  3029. signed_desc_append_to_journal(&router->cache_info,
  3030. &routerlist->desc_store);
  3031. routerlist_insert_old(routerlist, router);
  3032. return ROUTER_NOT_IN_CONSENSUS_OR_NETWORKSTATUS;
  3033. }
  3034. }
  3035. /* We no longer need a router with this descriptor digest. */
  3036. if (consensus) {
  3037. routerstatus_t *rs = networkstatus_vote_find_mutable_entry(
  3038. consensus, id_digest);
  3039. if (rs && tor_memeq(rs->descriptor_digest,
  3040. router->cache_info.signed_descriptor_digest,
  3041. DIGEST_LEN)) {
  3042. in_consensus = 1;
  3043. }
  3044. }
  3045. if (router->purpose == ROUTER_PURPOSE_GENERAL &&
  3046. consensus && !in_consensus && !authdir) {
  3047. /* If it's a general router not listed in the consensus, then don't
  3048. * consider replacing the latest router with it. */
  3049. if (!from_cache && should_cache_old_descriptors())
  3050. signed_desc_append_to_journal(&router->cache_info,
  3051. &routerlist->desc_store);
  3052. routerlist_insert_old(routerlist, router);
  3053. *msg = "Skipping router descriptor: not in consensus.";
  3054. return ROUTER_NOT_IN_CONSENSUS;
  3055. }
  3056. /* If we're reading a bridge descriptor from our cache, and we don't
  3057. * recognize it as one of our currently configured bridges, drop the
  3058. * descriptor. Otherwise we could end up using it as one of our entry
  3059. * guards even if it isn't in our Bridge config lines. */
  3060. if (router->purpose == ROUTER_PURPOSE_BRIDGE && from_cache &&
  3061. !authdir_mode_bridge(options) &&
  3062. !routerinfo_is_a_configured_bridge(router)) {
  3063. log_info(LD_DIR, "Dropping bridge descriptor for %s because we have "
  3064. "no bridge configured at that address.",
  3065. safe_str_client(router_describe(router)));
  3066. *msg = "Router descriptor was not a configured bridge.";
  3067. routerinfo_free(router);
  3068. return ROUTER_WAS_NOT_WANTED;
  3069. }
  3070. /* If we have a router with the same identity key, choose the newer one. */
  3071. if (old_router) {
  3072. if (!in_consensus && (router->cache_info.published_on <=
  3073. old_router->cache_info.published_on)) {
  3074. /* Same key, but old. This one is not listed in the consensus. */
  3075. log_debug(LD_DIR, "Not-new descriptor for router %s",
  3076. router_describe(router));
  3077. /* Only journal this desc if we'll be serving it. */
  3078. if (!from_cache && should_cache_old_descriptors())
  3079. signed_desc_append_to_journal(&router->cache_info,
  3080. &routerlist->desc_store);
  3081. routerlist_insert_old(routerlist, router);
  3082. *msg = "Router descriptor was not new.";
  3083. return ROUTER_IS_ALREADY_KNOWN;
  3084. } else {
  3085. /* Same key, and either new, or listed in the consensus. */
  3086. log_debug(LD_DIR, "Replacing entry for router %s",
  3087. router_describe(router));
  3088. routerlist_replace(routerlist, old_router, router);
  3089. if (!from_cache) {
  3090. signed_desc_append_to_journal(&router->cache_info,
  3091. &routerlist->desc_store);
  3092. }
  3093. *msg = authdir_believes_valid ? "Valid server updated" :
  3094. ("Invalid server updated. (This dirserver is marking your "
  3095. "server as unapproved.)");
  3096. return ROUTER_ADDED_SUCCESSFULLY;
  3097. }
  3098. }
  3099. if (!in_consensus && from_cache &&
  3100. router_descriptor_is_older_than(router, OLD_ROUTER_DESC_MAX_AGE)) {
  3101. *msg = "Router descriptor was really old.";
  3102. routerinfo_free(router);
  3103. return ROUTER_WAS_TOO_OLD;
  3104. }
  3105. /* We haven't seen a router with this identity before. Add it to the end of
  3106. * the list. */
  3107. routerlist_insert(routerlist, router);
  3108. if (!from_cache) {
  3109. signed_desc_append_to_journal(&router->cache_info,
  3110. &routerlist->desc_store);
  3111. }
  3112. return ROUTER_ADDED_SUCCESSFULLY;
  3113. }
  3114. /** Insert <b>ei</b> into the routerlist, or free it. Other arguments are
  3115. * as for router_add_to_routerlist(). Return ROUTER_ADDED_SUCCESSFULLY iff
  3116. * we actually inserted it, ROUTER_BAD_EI otherwise.
  3117. */
  3118. was_router_added_t
  3119. router_add_extrainfo_to_routerlist(extrainfo_t *ei, const char **msg,
  3120. int from_cache, int from_fetch)
  3121. {
  3122. was_router_added_t inserted;
  3123. (void)from_fetch;
  3124. if (msg) *msg = NULL;
  3125. /*XXXX023 Do something with msg */
  3126. inserted = extrainfo_insert(router_get_routerlist(), ei);
  3127. if (WRA_WAS_ADDED(inserted) && !from_cache)
  3128. signed_desc_append_to_journal(&ei->cache_info,
  3129. &routerlist->extrainfo_store);
  3130. return inserted;
  3131. }
  3132. /** Sorting helper: return &lt;0, 0, or &gt;0 depending on whether the
  3133. * signed_descriptor_t* in *<b>a</b> has an identity digest preceding, equal
  3134. * to, or later than that of *<b>b</b>. */
  3135. static int
  3136. compare_old_routers_by_identity_(const void **_a, const void **_b)
  3137. {
  3138. int i;
  3139. const signed_descriptor_t *r1 = *_a, *r2 = *_b;
  3140. if ((i = fast_memcmp(r1->identity_digest, r2->identity_digest, DIGEST_LEN)))
  3141. return i;
  3142. return (int)(r1->published_on - r2->published_on);
  3143. }
  3144. /** Internal type used to represent how long an old descriptor was valid,
  3145. * where it appeared in the list of old descriptors, and whether it's extra
  3146. * old. Used only by routerlist_remove_old_cached_routers_with_id(). */
  3147. struct duration_idx_t {
  3148. int duration;
  3149. int idx;
  3150. int old;
  3151. };
  3152. /** Sorting helper: compare two duration_idx_t by their duration. */
  3153. static int
  3154. compare_duration_idx_(const void *_d1, const void *_d2)
  3155. {
  3156. const struct duration_idx_t *d1 = _d1;
  3157. const struct duration_idx_t *d2 = _d2;
  3158. return d1->duration - d2->duration;
  3159. }
  3160. /** The range <b>lo</b> through <b>hi</b> inclusive of routerlist->old_routers
  3161. * must contain routerinfo_t with the same identity and with publication time
  3162. * in ascending order. Remove members from this range until there are no more
  3163. * than max_descriptors_per_router() remaining. Start by removing the oldest
  3164. * members from before <b>cutoff</b>, then remove members which were current
  3165. * for the lowest amount of time. The order of members of old_routers at
  3166. * indices <b>lo</b> or higher may be changed.
  3167. */
  3168. static void
  3169. routerlist_remove_old_cached_routers_with_id(time_t now,
  3170. time_t cutoff, int lo, int hi,
  3171. digestset_t *retain)
  3172. {
  3173. int i, n = hi-lo+1;
  3174. unsigned n_extra, n_rmv = 0;
  3175. struct duration_idx_t *lifespans;
  3176. uint8_t *rmv, *must_keep;
  3177. smartlist_t *lst = routerlist->old_routers;
  3178. #if 1
  3179. const char *ident;
  3180. tor_assert(hi < smartlist_len(lst));
  3181. tor_assert(lo <= hi);
  3182. ident = ((signed_descriptor_t*)smartlist_get(lst, lo))->identity_digest;
  3183. for (i = lo+1; i <= hi; ++i) {
  3184. signed_descriptor_t *r = smartlist_get(lst, i);
  3185. tor_assert(tor_memeq(ident, r->identity_digest, DIGEST_LEN));
  3186. }
  3187. #endif
  3188. /* Check whether we need to do anything at all. */
  3189. {
  3190. int mdpr = directory_caches_dir_info(get_options()) ? 2 : 1;
  3191. if (n <= mdpr)
  3192. return;
  3193. n_extra = n - mdpr;
  3194. }
  3195. lifespans = tor_calloc(n, sizeof(struct duration_idx_t));
  3196. rmv = tor_calloc(n, sizeof(uint8_t));
  3197. must_keep = tor_calloc(n, sizeof(uint8_t));
  3198. /* Set lifespans to contain the lifespan and index of each server. */
  3199. /* Set rmv[i-lo]=1 if we're going to remove a server for being too old. */
  3200. for (i = lo; i <= hi; ++i) {
  3201. signed_descriptor_t *r = smartlist_get(lst, i);
  3202. signed_descriptor_t *r_next;
  3203. lifespans[i-lo].idx = i;
  3204. if (r->last_listed_as_valid_until >= now ||
  3205. (retain && digestset_contains(retain, r->signed_descriptor_digest))) {
  3206. must_keep[i-lo] = 1;
  3207. }
  3208. if (i < hi) {
  3209. r_next = smartlist_get(lst, i+1);
  3210. tor_assert(r->published_on <= r_next->published_on);
  3211. lifespans[i-lo].duration = (int)(r_next->published_on - r->published_on);
  3212. } else {
  3213. r_next = NULL;
  3214. lifespans[i-lo].duration = INT_MAX;
  3215. }
  3216. if (!must_keep[i-lo] && r->published_on < cutoff && n_rmv < n_extra) {
  3217. ++n_rmv;
  3218. lifespans[i-lo].old = 1;
  3219. rmv[i-lo] = 1;
  3220. }
  3221. }
  3222. if (n_rmv < n_extra) {
  3223. /**
  3224. * We aren't removing enough servers for being old. Sort lifespans by
  3225. * the duration of liveness, and remove the ones we're not already going to
  3226. * remove based on how long they were alive.
  3227. **/
  3228. qsort(lifespans, n, sizeof(struct duration_idx_t), compare_duration_idx_);
  3229. for (i = 0; i < n && n_rmv < n_extra; ++i) {
  3230. if (!must_keep[lifespans[i].idx-lo] && !lifespans[i].old) {
  3231. rmv[lifespans[i].idx-lo] = 1;
  3232. ++n_rmv;
  3233. }
  3234. }
  3235. }
  3236. i = hi;
  3237. do {
  3238. if (rmv[i-lo])
  3239. routerlist_remove_old(routerlist, smartlist_get(lst, i), i);
  3240. } while (--i >= lo);
  3241. tor_free(must_keep);
  3242. tor_free(rmv);
  3243. tor_free(lifespans);
  3244. }
  3245. /** Deactivate any routers from the routerlist that are more than
  3246. * ROUTER_MAX_AGE seconds old and not recommended by any networkstatuses;
  3247. * remove old routers from the list of cached routers if we have too many.
  3248. */
  3249. void
  3250. routerlist_remove_old_routers(void)
  3251. {
  3252. int i, hi=-1;
  3253. const char *cur_id = NULL;
  3254. time_t now = time(NULL);
  3255. time_t cutoff;
  3256. routerinfo_t *router;
  3257. signed_descriptor_t *sd;
  3258. digestset_t *retain;
  3259. const networkstatus_t *consensus = networkstatus_get_latest_consensus();
  3260. trusted_dirs_remove_old_certs();
  3261. if (!routerlist || !consensus)
  3262. return;
  3263. // routerlist_assert_ok(routerlist);
  3264. /* We need to guess how many router descriptors we will wind up wanting to
  3265. retain, so that we can be sure to allocate a large enough Bloom filter
  3266. to hold the digest set. Overestimating is fine; underestimating is bad.
  3267. */
  3268. {
  3269. /* We'll probably retain everything in the consensus. */
  3270. int n_max_retain = smartlist_len(consensus->routerstatus_list);
  3271. retain = digestset_new(n_max_retain);
  3272. }
  3273. cutoff = now - OLD_ROUTER_DESC_MAX_AGE;
  3274. /* Retain anything listed in the consensus. */
  3275. if (consensus) {
  3276. SMARTLIST_FOREACH(consensus->routerstatus_list, routerstatus_t *, rs,
  3277. if (rs->published_on >= cutoff)
  3278. digestset_add(retain, rs->descriptor_digest));
  3279. }
  3280. /* If we have a consensus, we should consider pruning current routers that
  3281. * are too old and that nobody recommends. (If we don't have a consensus,
  3282. * then we should get one before we decide to kill routers.) */
  3283. if (consensus) {
  3284. cutoff = now - ROUTER_MAX_AGE;
  3285. /* Remove too-old unrecommended members of routerlist->routers. */
  3286. for (i = 0; i < smartlist_len(routerlist->routers); ++i) {
  3287. router = smartlist_get(routerlist->routers, i);
  3288. if (router->cache_info.published_on <= cutoff &&
  3289. router->cache_info.last_listed_as_valid_until < now &&
  3290. !digestset_contains(retain,
  3291. router->cache_info.signed_descriptor_digest)) {
  3292. /* Too old: remove it. (If we're a cache, just move it into
  3293. * old_routers.) */
  3294. log_info(LD_DIR,
  3295. "Forgetting obsolete (too old) routerinfo for router %s",
  3296. router_describe(router));
  3297. routerlist_remove(routerlist, router, 1, now);
  3298. i--;
  3299. }
  3300. }
  3301. }
  3302. //routerlist_assert_ok(routerlist);
  3303. /* Remove far-too-old members of routerlist->old_routers. */
  3304. cutoff = now - OLD_ROUTER_DESC_MAX_AGE;
  3305. for (i = 0; i < smartlist_len(routerlist->old_routers); ++i) {
  3306. sd = smartlist_get(routerlist->old_routers, i);
  3307. if (sd->published_on <= cutoff &&
  3308. sd->last_listed_as_valid_until < now &&
  3309. !digestset_contains(retain, sd->signed_descriptor_digest)) {
  3310. /* Too old. Remove it. */
  3311. routerlist_remove_old(routerlist, sd, i--);
  3312. }
  3313. }
  3314. //routerlist_assert_ok(routerlist);
  3315. log_info(LD_DIR, "We have %d live routers and %d old router descriptors.",
  3316. smartlist_len(routerlist->routers),
  3317. smartlist_len(routerlist->old_routers));
  3318. /* Now we might have to look at routerlist->old_routers for extraneous
  3319. * members. (We'd keep all the members if we could, but we need to save
  3320. * space.) First, check whether we have too many router descriptors, total.
  3321. * We're okay with having too many for some given router, so long as the
  3322. * total number doesn't approach max_descriptors_per_router()*len(router).
  3323. */
  3324. if (smartlist_len(routerlist->old_routers) <
  3325. smartlist_len(routerlist->routers))
  3326. goto done;
  3327. /* Sort by identity, then fix indices. */
  3328. smartlist_sort(routerlist->old_routers, compare_old_routers_by_identity_);
  3329. /* Fix indices. */
  3330. for (i = 0; i < smartlist_len(routerlist->old_routers); ++i) {
  3331. signed_descriptor_t *r = smartlist_get(routerlist->old_routers, i);
  3332. r->routerlist_index = i;
  3333. }
  3334. /* Iterate through the list from back to front, so when we remove descriptors
  3335. * we don't mess up groups we haven't gotten to. */
  3336. for (i = smartlist_len(routerlist->old_routers)-1; i >= 0; --i) {
  3337. signed_descriptor_t *r = smartlist_get(routerlist->old_routers, i);
  3338. if (!cur_id) {
  3339. cur_id = r->identity_digest;
  3340. hi = i;
  3341. }
  3342. if (tor_memneq(cur_id, r->identity_digest, DIGEST_LEN)) {
  3343. routerlist_remove_old_cached_routers_with_id(now,
  3344. cutoff, i+1, hi, retain);
  3345. cur_id = r->identity_digest;
  3346. hi = i;
  3347. }
  3348. }
  3349. if (hi>=0)
  3350. routerlist_remove_old_cached_routers_with_id(now, cutoff, 0, hi, retain);
  3351. //routerlist_assert_ok(routerlist);
  3352. done:
  3353. digestset_free(retain);
  3354. router_rebuild_store(RRS_DONT_REMOVE_OLD, &routerlist->desc_store);
  3355. router_rebuild_store(RRS_DONT_REMOVE_OLD,&routerlist->extrainfo_store);
  3356. }
  3357. /** We just added a new set of descriptors. Take whatever extra steps
  3358. * we need. */
  3359. void
  3360. routerlist_descriptors_added(smartlist_t *sl, int from_cache)
  3361. {
  3362. tor_assert(sl);
  3363. control_event_descriptors_changed(sl);
  3364. SMARTLIST_FOREACH_BEGIN(sl, routerinfo_t *, ri) {
  3365. if (ri->purpose == ROUTER_PURPOSE_BRIDGE)
  3366. learned_bridge_descriptor(ri, from_cache);
  3367. if (ri->needs_retest_if_added) {
  3368. ri->needs_retest_if_added = 0;
  3369. dirserv_single_reachability_test(approx_time(), ri);
  3370. }
  3371. } SMARTLIST_FOREACH_END(ri);
  3372. }
  3373. /**
  3374. * Code to parse a single router descriptor and insert it into the
  3375. * routerlist. Return -1 if the descriptor was ill-formed; 0 if the
  3376. * descriptor was well-formed but could not be added; and 1 if the
  3377. * descriptor was added.
  3378. *
  3379. * If we don't add it and <b>msg</b> is not NULL, then assign to
  3380. * *<b>msg</b> a static string describing the reason for refusing the
  3381. * descriptor.
  3382. *
  3383. * This is used only by the controller.
  3384. */
  3385. int
  3386. router_load_single_router(const char *s, uint8_t purpose, int cache,
  3387. const char **msg)
  3388. {
  3389. routerinfo_t *ri;
  3390. was_router_added_t r;
  3391. smartlist_t *lst;
  3392. char annotation_buf[ROUTER_ANNOTATION_BUF_LEN];
  3393. tor_assert(msg);
  3394. *msg = NULL;
  3395. tor_snprintf(annotation_buf, sizeof(annotation_buf),
  3396. "@source controller\n"
  3397. "@purpose %s\n", router_purpose_to_string(purpose));
  3398. if (!(ri = router_parse_entry_from_string(s, NULL, 1, 0,
  3399. annotation_buf, NULL))) {
  3400. log_warn(LD_DIR, "Error parsing router descriptor; dropping.");
  3401. *msg = "Couldn't parse router descriptor.";
  3402. return -1;
  3403. }
  3404. tor_assert(ri->purpose == purpose);
  3405. if (router_is_me(ri)) {
  3406. log_warn(LD_DIR, "Router's identity key matches mine; dropping.");
  3407. *msg = "Router's identity key matches mine.";
  3408. routerinfo_free(ri);
  3409. return 0;
  3410. }
  3411. if (!cache) /* obey the preference of the controller */
  3412. ri->cache_info.do_not_cache = 1;
  3413. lst = smartlist_new();
  3414. smartlist_add(lst, ri);
  3415. routers_update_status_from_consensus_networkstatus(lst, 0);
  3416. r = router_add_to_routerlist(ri, msg, 0, 0);
  3417. if (!WRA_WAS_ADDED(r)) {
  3418. /* we've already assigned to *msg now, and ri is already freed */
  3419. tor_assert(*msg);
  3420. if (r == ROUTER_AUTHDIR_REJECTS)
  3421. log_warn(LD_DIR, "Couldn't add router to list: %s Dropping.", *msg);
  3422. smartlist_free(lst);
  3423. return 0;
  3424. } else {
  3425. routerlist_descriptors_added(lst, 0);
  3426. smartlist_free(lst);
  3427. log_debug(LD_DIR, "Added router to list");
  3428. return 1;
  3429. }
  3430. }
  3431. /** Given a string <b>s</b> containing some routerdescs, parse it and put the
  3432. * routers into our directory. If saved_location is SAVED_NOWHERE, the routers
  3433. * are in response to a query to the network: cache them by adding them to
  3434. * the journal.
  3435. *
  3436. * Return the number of routers actually added.
  3437. *
  3438. * If <b>requested_fingerprints</b> is provided, it must contain a list of
  3439. * uppercased fingerprints. Do not update any router whose
  3440. * fingerprint is not on the list; after updating a router, remove its
  3441. * fingerprint from the list.
  3442. *
  3443. * If <b>descriptor_digests</b> is non-zero, then the requested_fingerprints
  3444. * are descriptor digests. Otherwise they are identity digests.
  3445. */
  3446. int
  3447. router_load_routers_from_string(const char *s, const char *eos,
  3448. saved_location_t saved_location,
  3449. smartlist_t *requested_fingerprints,
  3450. int descriptor_digests,
  3451. const char *prepend_annotations)
  3452. {
  3453. smartlist_t *routers = smartlist_new(), *changed = smartlist_new();
  3454. char fp[HEX_DIGEST_LEN+1];
  3455. const char *msg;
  3456. int from_cache = (saved_location != SAVED_NOWHERE);
  3457. int allow_annotations = (saved_location != SAVED_NOWHERE);
  3458. int any_changed = 0;
  3459. smartlist_t *invalid_digests = smartlist_new();
  3460. router_parse_list_from_string(&s, eos, routers, saved_location, 0,
  3461. allow_annotations, prepend_annotations,
  3462. invalid_digests);
  3463. routers_update_status_from_consensus_networkstatus(routers, !from_cache);
  3464. log_info(LD_DIR, "%d elements to add", smartlist_len(routers));
  3465. SMARTLIST_FOREACH_BEGIN(routers, routerinfo_t *, ri) {
  3466. was_router_added_t r;
  3467. char d[DIGEST_LEN];
  3468. if (requested_fingerprints) {
  3469. base16_encode(fp, sizeof(fp), descriptor_digests ?
  3470. ri->cache_info.signed_descriptor_digest :
  3471. ri->cache_info.identity_digest,
  3472. DIGEST_LEN);
  3473. if (smartlist_contains_string(requested_fingerprints, fp)) {
  3474. smartlist_string_remove(requested_fingerprints, fp);
  3475. } else {
  3476. char *requested =
  3477. smartlist_join_strings(requested_fingerprints," ",0,NULL);
  3478. log_warn(LD_DIR,
  3479. "We received a router descriptor with a fingerprint (%s) "
  3480. "that we never requested. (We asked for: %s.) Dropping.",
  3481. fp, requested);
  3482. tor_free(requested);
  3483. routerinfo_free(ri);
  3484. continue;
  3485. }
  3486. }
  3487. memcpy(d, ri->cache_info.signed_descriptor_digest, DIGEST_LEN);
  3488. r = router_add_to_routerlist(ri, &msg, from_cache, !from_cache);
  3489. if (WRA_WAS_ADDED(r)) {
  3490. any_changed++;
  3491. smartlist_add(changed, ri);
  3492. routerlist_descriptors_added(changed, from_cache);
  3493. smartlist_clear(changed);
  3494. } else if (WRA_NEVER_DOWNLOADABLE(r)) {
  3495. download_status_t *dl_status;
  3496. dl_status = router_get_dl_status_by_descriptor_digest(d);
  3497. if (dl_status) {
  3498. log_info(LD_GENERAL, "Marking router %s as never downloadable",
  3499. hex_str(d, DIGEST_LEN));
  3500. download_status_mark_impossible(dl_status);
  3501. }
  3502. }
  3503. } SMARTLIST_FOREACH_END(ri);
  3504. SMARTLIST_FOREACH_BEGIN(invalid_digests, const uint8_t *, bad_digest) {
  3505. /* This digest is never going to be parseable. */
  3506. base16_encode(fp, sizeof(fp), (char*)bad_digest, DIGEST_LEN);
  3507. if (requested_fingerprints && descriptor_digests) {
  3508. if (! smartlist_contains_string(requested_fingerprints, fp)) {
  3509. /* But we didn't ask for it, so we should assume shennanegans. */
  3510. continue;
  3511. }
  3512. smartlist_string_remove(requested_fingerprints, fp);
  3513. }
  3514. download_status_t *dls;
  3515. dls = router_get_dl_status_by_descriptor_digest((char*)bad_digest);
  3516. if (dls) {
  3517. log_info(LD_GENERAL, "Marking router with descriptor %s as unparseable, "
  3518. "and therefore undownloadable", fp);
  3519. download_status_mark_impossible(dls);
  3520. }
  3521. } SMARTLIST_FOREACH_END(bad_digest);
  3522. SMARTLIST_FOREACH(invalid_digests, uint8_t *, d, tor_free(d));
  3523. smartlist_free(invalid_digests);
  3524. routerlist_assert_ok(routerlist);
  3525. if (any_changed)
  3526. router_rebuild_store(0, &routerlist->desc_store);
  3527. smartlist_free(routers);
  3528. smartlist_free(changed);
  3529. return any_changed;
  3530. }
  3531. /** Parse one or more extrainfos from <b>s</b> (ending immediately before
  3532. * <b>eos</b> if <b>eos</b> is present). Other arguments are as for
  3533. * router_load_routers_from_string(). */
  3534. void
  3535. router_load_extrainfo_from_string(const char *s, const char *eos,
  3536. saved_location_t saved_location,
  3537. smartlist_t *requested_fingerprints,
  3538. int descriptor_digests)
  3539. {
  3540. smartlist_t *extrainfo_list = smartlist_new();
  3541. const char *msg;
  3542. int from_cache = (saved_location != SAVED_NOWHERE);
  3543. smartlist_t *invalid_digests = smartlist_new();
  3544. router_parse_list_from_string(&s, eos, extrainfo_list, saved_location, 1, 0,
  3545. NULL, invalid_digests);
  3546. log_info(LD_DIR, "%d elements to add", smartlist_len(extrainfo_list));
  3547. SMARTLIST_FOREACH_BEGIN(extrainfo_list, extrainfo_t *, ei) {
  3548. uint8_t d[DIGEST_LEN];
  3549. memcpy(d, ei->cache_info.signed_descriptor_digest, DIGEST_LEN);
  3550. was_router_added_t added =
  3551. router_add_extrainfo_to_routerlist(ei, &msg, from_cache, !from_cache);
  3552. if (WRA_WAS_ADDED(added) && requested_fingerprints) {
  3553. char fp[HEX_DIGEST_LEN+1];
  3554. base16_encode(fp, sizeof(fp), descriptor_digests ?
  3555. ei->cache_info.signed_descriptor_digest :
  3556. ei->cache_info.identity_digest,
  3557. DIGEST_LEN);
  3558. smartlist_string_remove(requested_fingerprints, fp);
  3559. /* We silently let people stuff us with extrainfos we didn't ask for,
  3560. * so long as we would have wanted them anyway. Since we always fetch
  3561. * all the extrainfos we want, and we never actually act on them
  3562. * inside Tor, this should be harmless. */
  3563. } else if (WRA_NEVER_DOWNLOADABLE(added)) {
  3564. signed_descriptor_t *sd = router_get_by_extrainfo_digest((char*)d);
  3565. if (sd) {
  3566. log_info(LD_GENERAL, "Marking extrainfo with descriptor %s as "
  3567. "unparseable, and therefore undownloadable",
  3568. hex_str((char*)d,DIGEST_LEN));
  3569. download_status_mark_impossible(&sd->ei_dl_status);
  3570. }
  3571. }
  3572. } SMARTLIST_FOREACH_END(ei);
  3573. SMARTLIST_FOREACH_BEGIN(invalid_digests, const uint8_t *, bad_digest) {
  3574. /* This digest is never going to be parseable. */
  3575. char fp[HEX_DIGEST_LEN+1];
  3576. base16_encode(fp, sizeof(fp), (char*)bad_digest, DIGEST_LEN);
  3577. if (requested_fingerprints) {
  3578. if (! smartlist_contains_string(requested_fingerprints, fp)) {
  3579. /* But we didn't ask for it, so we should assume shennanegans. */
  3580. continue;
  3581. }
  3582. smartlist_string_remove(requested_fingerprints, fp);
  3583. }
  3584. signed_descriptor_t *sd =
  3585. router_get_by_extrainfo_digest((char*)bad_digest);
  3586. if (sd) {
  3587. log_info(LD_GENERAL, "Marking extrainfo with descriptor %s as "
  3588. "unparseable, and therefore undownloadable", fp);
  3589. download_status_mark_impossible(&sd->ei_dl_status);
  3590. }
  3591. } SMARTLIST_FOREACH_END(bad_digest);
  3592. SMARTLIST_FOREACH(invalid_digests, uint8_t *, d, tor_free(d));
  3593. smartlist_free(invalid_digests);
  3594. routerlist_assert_ok(routerlist);
  3595. router_rebuild_store(0, &router_get_routerlist()->extrainfo_store);
  3596. smartlist_free(extrainfo_list);
  3597. }
  3598. /** Return true iff any networkstatus includes a descriptor whose digest
  3599. * is that of <b>desc</b>. */
  3600. static int
  3601. signed_desc_digest_is_recognized(signed_descriptor_t *desc)
  3602. {
  3603. const routerstatus_t *rs;
  3604. networkstatus_t *consensus = networkstatus_get_latest_consensus();
  3605. if (consensus) {
  3606. rs = networkstatus_vote_find_entry(consensus, desc->identity_digest);
  3607. if (rs && tor_memeq(rs->descriptor_digest,
  3608. desc->signed_descriptor_digest, DIGEST_LEN))
  3609. return 1;
  3610. }
  3611. return 0;
  3612. }
  3613. /** Update downloads for router descriptors and/or microdescriptors as
  3614. * appropriate. */
  3615. void
  3616. update_all_descriptor_downloads(time_t now)
  3617. {
  3618. if (get_options()->DisableNetwork)
  3619. return;
  3620. update_router_descriptor_downloads(now);
  3621. update_microdesc_downloads(now);
  3622. launch_dummy_descriptor_download_as_needed(now, get_options());
  3623. }
  3624. /** Clear all our timeouts for fetching v3 directory stuff, and then
  3625. * give it all a try again. */
  3626. void
  3627. routerlist_retry_directory_downloads(time_t now)
  3628. {
  3629. router_reset_status_download_failures();
  3630. router_reset_descriptor_download_failures();
  3631. if (get_options()->DisableNetwork)
  3632. return;
  3633. update_networkstatus_downloads(now);
  3634. update_all_descriptor_downloads(now);
  3635. }
  3636. /** Return true iff <b>router</b> does not permit exit streams.
  3637. */
  3638. int
  3639. router_exit_policy_rejects_all(const routerinfo_t *router)
  3640. {
  3641. return router->policy_is_reject_star;
  3642. }
  3643. /** Create an directory server at <b>address</b>:<b>port</b>, with OR identity
  3644. * key <b>digest</b>. If <b>address</b> is NULL, add ourself. If
  3645. * <b>is_authority</b>, this is a directory authority. Return the new
  3646. * directory server entry on success or NULL on failure. */
  3647. static dir_server_t *
  3648. dir_server_new(int is_authority,
  3649. const char *nickname,
  3650. const tor_addr_t *addr,
  3651. const char *hostname,
  3652. uint16_t dir_port, uint16_t or_port,
  3653. const char *digest, const char *v3_auth_digest,
  3654. dirinfo_type_t type,
  3655. double weight)
  3656. {
  3657. dir_server_t *ent;
  3658. uint32_t a;
  3659. char *hostname_ = NULL;
  3660. if (weight < 0)
  3661. return NULL;
  3662. if (tor_addr_family(addr) == AF_INET)
  3663. a = tor_addr_to_ipv4h(addr);
  3664. else
  3665. return NULL; /*XXXX Support IPv6 */
  3666. if (!hostname)
  3667. hostname_ = tor_dup_addr(addr);
  3668. else
  3669. hostname_ = tor_strdup(hostname);
  3670. ent = tor_malloc_zero(sizeof(dir_server_t));
  3671. ent->nickname = nickname ? tor_strdup(nickname) : NULL;
  3672. ent->address = hostname_;
  3673. ent->addr = a;
  3674. ent->dir_port = dir_port;
  3675. ent->or_port = or_port;
  3676. ent->is_running = 1;
  3677. ent->is_authority = is_authority;
  3678. ent->type = type;
  3679. ent->weight = weight;
  3680. memcpy(ent->digest, digest, DIGEST_LEN);
  3681. if (v3_auth_digest && (type & V3_DIRINFO))
  3682. memcpy(ent->v3_identity_digest, v3_auth_digest, DIGEST_LEN);
  3683. if (nickname)
  3684. tor_asprintf(&ent->description, "directory server \"%s\" at %s:%d",
  3685. nickname, hostname, (int)dir_port);
  3686. else
  3687. tor_asprintf(&ent->description, "directory server at %s:%d",
  3688. hostname, (int)dir_port);
  3689. ent->fake_status.addr = ent->addr;
  3690. memcpy(ent->fake_status.identity_digest, digest, DIGEST_LEN);
  3691. if (nickname)
  3692. strlcpy(ent->fake_status.nickname, nickname,
  3693. sizeof(ent->fake_status.nickname));
  3694. else
  3695. ent->fake_status.nickname[0] = '\0';
  3696. ent->fake_status.dir_port = ent->dir_port;
  3697. ent->fake_status.or_port = ent->or_port;
  3698. return ent;
  3699. }
  3700. /** Create an authoritative directory server at
  3701. * <b>address</b>:<b>port</b>, with identity key <b>digest</b>. If
  3702. * <b>address</b> is NULL, add ourself. Return the new trusted directory
  3703. * server entry on success or NULL if we couldn't add it. */
  3704. dir_server_t *
  3705. trusted_dir_server_new(const char *nickname, const char *address,
  3706. uint16_t dir_port, uint16_t or_port,
  3707. const char *digest, const char *v3_auth_digest,
  3708. dirinfo_type_t type, double weight)
  3709. {
  3710. uint32_t a;
  3711. tor_addr_t addr;
  3712. char *hostname=NULL;
  3713. dir_server_t *result;
  3714. if (!address) { /* The address is us; we should guess. */
  3715. if (resolve_my_address(LOG_WARN, get_options(),
  3716. &a, NULL, &hostname) < 0) {
  3717. log_warn(LD_CONFIG,
  3718. "Couldn't find a suitable address when adding ourself as a "
  3719. "trusted directory server.");
  3720. return NULL;
  3721. }
  3722. if (!hostname)
  3723. hostname = tor_dup_ip(a);
  3724. } else {
  3725. if (tor_lookup_hostname(address, &a)) {
  3726. log_warn(LD_CONFIG,
  3727. "Unable to lookup address for directory server at '%s'",
  3728. address);
  3729. return NULL;
  3730. }
  3731. hostname = tor_strdup(address);
  3732. }
  3733. tor_addr_from_ipv4h(&addr, a);
  3734. result = dir_server_new(1, nickname, &addr, hostname,
  3735. dir_port, or_port, digest,
  3736. v3_auth_digest, type, weight);
  3737. tor_free(hostname);
  3738. return result;
  3739. }
  3740. /** Return a new dir_server_t for a fallback directory server at
  3741. * <b>addr</b>:<b>or_port</b>/<b>dir_port</b>, with identity key digest
  3742. * <b>id_digest</b> */
  3743. dir_server_t *
  3744. fallback_dir_server_new(const tor_addr_t *addr,
  3745. uint16_t dir_port, uint16_t or_port,
  3746. const char *id_digest, double weight)
  3747. {
  3748. return dir_server_new(0, NULL, addr, NULL, dir_port, or_port, id_digest,
  3749. NULL, ALL_DIRINFO, weight);
  3750. }
  3751. /** Add a directory server to the global list(s). */
  3752. void
  3753. dir_server_add(dir_server_t *ent)
  3754. {
  3755. if (!trusted_dir_servers)
  3756. trusted_dir_servers = smartlist_new();
  3757. if (!fallback_dir_servers)
  3758. fallback_dir_servers = smartlist_new();
  3759. if (ent->is_authority)
  3760. smartlist_add(trusted_dir_servers, ent);
  3761. smartlist_add(fallback_dir_servers, ent);
  3762. router_dir_info_changed();
  3763. }
  3764. /** Free storage held in <b>cert</b>. */
  3765. void
  3766. authority_cert_free(authority_cert_t *cert)
  3767. {
  3768. if (!cert)
  3769. return;
  3770. tor_free(cert->cache_info.signed_descriptor_body);
  3771. crypto_pk_free(cert->signing_key);
  3772. crypto_pk_free(cert->identity_key);
  3773. tor_free(cert);
  3774. }
  3775. /** Free storage held in <b>ds</b>. */
  3776. static void
  3777. dir_server_free(dir_server_t *ds)
  3778. {
  3779. if (!ds)
  3780. return;
  3781. tor_free(ds->nickname);
  3782. tor_free(ds->description);
  3783. tor_free(ds->address);
  3784. tor_free(ds);
  3785. }
  3786. /** Remove all members from the list of dir servers. */
  3787. void
  3788. clear_dir_servers(void)
  3789. {
  3790. if (fallback_dir_servers) {
  3791. SMARTLIST_FOREACH(fallback_dir_servers, dir_server_t *, ent,
  3792. dir_server_free(ent));
  3793. smartlist_clear(fallback_dir_servers);
  3794. } else {
  3795. fallback_dir_servers = smartlist_new();
  3796. }
  3797. if (trusted_dir_servers) {
  3798. smartlist_clear(trusted_dir_servers);
  3799. } else {
  3800. trusted_dir_servers = smartlist_new();
  3801. }
  3802. router_dir_info_changed();
  3803. }
  3804. /** For every current directory connection whose purpose is <b>purpose</b>,
  3805. * and where the resource being downloaded begins with <b>prefix</b>, split
  3806. * rest of the resource into base16 fingerprints (or base64 fingerprints if
  3807. * purpose==DIR_PURPPOSE_FETCH_MICRODESC), decode them, and set the
  3808. * corresponding elements of <b>result</b> to a nonzero value.
  3809. */
  3810. static void
  3811. list_pending_downloads(digestmap_t *result, digest256map_t *result256,
  3812. int purpose, const char *prefix)
  3813. {
  3814. const size_t p_len = strlen(prefix);
  3815. smartlist_t *tmp = smartlist_new();
  3816. smartlist_t *conns = get_connection_array();
  3817. int flags = DSR_HEX;
  3818. if (purpose == DIR_PURPOSE_FETCH_MICRODESC)
  3819. flags = DSR_DIGEST256|DSR_BASE64;
  3820. tor_assert(result || result256);
  3821. SMARTLIST_FOREACH_BEGIN(conns, connection_t *, conn) {
  3822. if (conn->type == CONN_TYPE_DIR &&
  3823. conn->purpose == purpose &&
  3824. !conn->marked_for_close) {
  3825. const char *resource = TO_DIR_CONN(conn)->requested_resource;
  3826. if (!strcmpstart(resource, prefix))
  3827. dir_split_resource_into_fingerprints(resource + p_len,
  3828. tmp, NULL, flags);
  3829. }
  3830. } SMARTLIST_FOREACH_END(conn);
  3831. if (result) {
  3832. SMARTLIST_FOREACH(tmp, char *, d,
  3833. {
  3834. digestmap_set(result, d, (void*)1);
  3835. tor_free(d);
  3836. });
  3837. } else if (result256) {
  3838. SMARTLIST_FOREACH(tmp, uint8_t *, d,
  3839. {
  3840. digest256map_set(result256, d, (void*)1);
  3841. tor_free(d);
  3842. });
  3843. }
  3844. smartlist_free(tmp);
  3845. }
  3846. /** For every router descriptor (or extra-info document if <b>extrainfo</b> is
  3847. * true) we are currently downloading by descriptor digest, set result[d] to
  3848. * (void*)1. */
  3849. static void
  3850. list_pending_descriptor_downloads(digestmap_t *result, int extrainfo)
  3851. {
  3852. int purpose =
  3853. extrainfo ? DIR_PURPOSE_FETCH_EXTRAINFO : DIR_PURPOSE_FETCH_SERVERDESC;
  3854. list_pending_downloads(result, NULL, purpose, "d/");
  3855. }
  3856. /** For every microdescriptor we are currently downloading by descriptor
  3857. * digest, set result[d] to (void*)1.
  3858. */
  3859. void
  3860. list_pending_microdesc_downloads(digest256map_t *result)
  3861. {
  3862. list_pending_downloads(NULL, result, DIR_PURPOSE_FETCH_MICRODESC, "d/");
  3863. }
  3864. /** For every certificate we are currently downloading by (identity digest,
  3865. * signing key digest) pair, set result[fp_pair] to (void *1).
  3866. */
  3867. static void
  3868. list_pending_fpsk_downloads(fp_pair_map_t *result)
  3869. {
  3870. const char *pfx = "fp-sk/";
  3871. smartlist_t *tmp;
  3872. smartlist_t *conns;
  3873. const char *resource;
  3874. tor_assert(result);
  3875. tmp = smartlist_new();
  3876. conns = get_connection_array();
  3877. SMARTLIST_FOREACH_BEGIN(conns, connection_t *, conn) {
  3878. if (conn->type == CONN_TYPE_DIR &&
  3879. conn->purpose == DIR_PURPOSE_FETCH_CERTIFICATE &&
  3880. !conn->marked_for_close) {
  3881. resource = TO_DIR_CONN(conn)->requested_resource;
  3882. if (!strcmpstart(resource, pfx))
  3883. dir_split_resource_into_fingerprint_pairs(resource + strlen(pfx),
  3884. tmp);
  3885. }
  3886. } SMARTLIST_FOREACH_END(conn);
  3887. SMARTLIST_FOREACH_BEGIN(tmp, fp_pair_t *, fp) {
  3888. fp_pair_map_set(result, fp, (void*)1);
  3889. tor_free(fp);
  3890. } SMARTLIST_FOREACH_END(fp);
  3891. smartlist_free(tmp);
  3892. }
  3893. /** Launch downloads for all the descriptors whose digests or digests256
  3894. * are listed as digests[i] for lo <= i < hi. (Lo and hi may be out of
  3895. * range.) If <b>source</b> is given, download from <b>source</b>;
  3896. * otherwise, download from an appropriate random directory server.
  3897. */
  3898. static void
  3899. initiate_descriptor_downloads(const routerstatus_t *source,
  3900. int purpose,
  3901. smartlist_t *digests,
  3902. int lo, int hi, int pds_flags)
  3903. {
  3904. int i, n = hi-lo;
  3905. char *resource, *cp;
  3906. size_t r_len;
  3907. int digest_len = DIGEST_LEN, enc_digest_len = HEX_DIGEST_LEN;
  3908. char sep = '+';
  3909. int b64_256 = 0;
  3910. if (purpose == DIR_PURPOSE_FETCH_MICRODESC) {
  3911. /* Microdescriptors are downloaded by "-"-separated base64-encoded
  3912. * 256-bit digests. */
  3913. digest_len = DIGEST256_LEN;
  3914. enc_digest_len = BASE64_DIGEST256_LEN;
  3915. sep = '-';
  3916. b64_256 = 1;
  3917. }
  3918. if (n <= 0)
  3919. return;
  3920. if (lo < 0)
  3921. lo = 0;
  3922. if (hi > smartlist_len(digests))
  3923. hi = smartlist_len(digests);
  3924. r_len = 8 + (enc_digest_len+1)*n;
  3925. cp = resource = tor_malloc(r_len);
  3926. memcpy(cp, "d/", 2);
  3927. cp += 2;
  3928. for (i = lo; i < hi; ++i) {
  3929. if (b64_256) {
  3930. digest256_to_base64(cp, smartlist_get(digests, i));
  3931. } else {
  3932. base16_encode(cp, r_len-(cp-resource),
  3933. smartlist_get(digests,i), digest_len);
  3934. }
  3935. cp += enc_digest_len;
  3936. *cp++ = sep;
  3937. }
  3938. memcpy(cp-1, ".z", 3);
  3939. if (source) {
  3940. /* We know which authority we want. */
  3941. directory_initiate_command_routerstatus(source, purpose,
  3942. ROUTER_PURPOSE_GENERAL,
  3943. DIRIND_ONEHOP,
  3944. resource, NULL, 0, 0);
  3945. } else {
  3946. directory_get_from_dirserver(purpose, ROUTER_PURPOSE_GENERAL, resource,
  3947. pds_flags);
  3948. }
  3949. tor_free(resource);
  3950. }
  3951. /** Max amount of hashes to download per request.
  3952. * Since squid does not like URLs >= 4096 bytes we limit it to 96.
  3953. * 4096 - strlen(http://255.255.255.255/tor/server/d/.z) == 4058
  3954. * 4058/41 (40 for the hash and 1 for the + that separates them) => 98
  3955. * So use 96 because it's a nice number.
  3956. */
  3957. #define MAX_DL_PER_REQUEST 96
  3958. #define MAX_MICRODESC_DL_PER_REQUEST 92
  3959. /** Don't split our requests so finely that we are requesting fewer than
  3960. * this number per server. */
  3961. #define MIN_DL_PER_REQUEST 4
  3962. /** To prevent a single screwy cache from confusing us by selective reply,
  3963. * try to split our requests into at least this many requests. */
  3964. #define MIN_REQUESTS 3
  3965. /** If we want fewer than this many descriptors, wait until we
  3966. * want more, or until TestingClientMaxIntervalWithoutRequest has passed. */
  3967. #define MAX_DL_TO_DELAY 16
  3968. /** Given a <b>purpose</b> (FETCH_MICRODESC or FETCH_SERVERDESC) and a list of
  3969. * router descriptor digests or microdescriptor digest256s in
  3970. * <b>downloadable</b>, decide whether to delay fetching until we have more.
  3971. * If we don't want to delay, launch one or more requests to the appropriate
  3972. * directory authorities.
  3973. */
  3974. void
  3975. launch_descriptor_downloads(int purpose,
  3976. smartlist_t *downloadable,
  3977. const routerstatus_t *source, time_t now)
  3978. {
  3979. int should_delay = 0, n_downloadable;
  3980. const or_options_t *options = get_options();
  3981. const char *descname;
  3982. tor_assert(purpose == DIR_PURPOSE_FETCH_SERVERDESC ||
  3983. purpose == DIR_PURPOSE_FETCH_MICRODESC);
  3984. descname = (purpose == DIR_PURPOSE_FETCH_SERVERDESC) ?
  3985. "routerdesc" : "microdesc";
  3986. n_downloadable = smartlist_len(downloadable);
  3987. if (!directory_fetches_dir_info_early(options)) {
  3988. if (n_downloadable >= MAX_DL_TO_DELAY) {
  3989. log_debug(LD_DIR,
  3990. "There are enough downloadable %ss to launch requests.",
  3991. descname);
  3992. should_delay = 0;
  3993. } else {
  3994. should_delay = (last_descriptor_download_attempted +
  3995. options->TestingClientMaxIntervalWithoutRequest) > now;
  3996. if (!should_delay && n_downloadable) {
  3997. if (last_descriptor_download_attempted) {
  3998. log_info(LD_DIR,
  3999. "There are not many downloadable %ss, but we've "
  4000. "been waiting long enough (%d seconds). Downloading.",
  4001. descname,
  4002. (int)(now-last_descriptor_download_attempted));
  4003. } else {
  4004. log_info(LD_DIR,
  4005. "There are not many downloadable %ss, but we haven't "
  4006. "tried downloading descriptors recently. Downloading.",
  4007. descname);
  4008. }
  4009. }
  4010. }
  4011. }
  4012. if (! should_delay && n_downloadable) {
  4013. int i, n_per_request;
  4014. const char *req_plural = "", *rtr_plural = "";
  4015. int pds_flags = PDS_RETRY_IF_NO_SERVERS;
  4016. if (! authdir_mode_any_nonhidserv(options)) {
  4017. /* If we wind up going to the authorities, we want to only open one
  4018. * connection to each authority at a time, so that we don't overload
  4019. * them. We do this by setting PDS_NO_EXISTING_SERVERDESC_FETCH
  4020. * regardless of whether we're a cache or not; it gets ignored if we're
  4021. * not calling router_pick_trusteddirserver.
  4022. *
  4023. * Setting this flag can make initiate_descriptor_downloads() ignore
  4024. * requests. We need to make sure that we do in fact call
  4025. * update_router_descriptor_downloads() later on, once the connections
  4026. * have succeeded or failed.
  4027. */
  4028. pds_flags |= (purpose == DIR_PURPOSE_FETCH_MICRODESC) ?
  4029. PDS_NO_EXISTING_MICRODESC_FETCH :
  4030. PDS_NO_EXISTING_SERVERDESC_FETCH;
  4031. }
  4032. n_per_request = CEIL_DIV(n_downloadable, MIN_REQUESTS);
  4033. if (purpose == DIR_PURPOSE_FETCH_MICRODESC) {
  4034. if (n_per_request > MAX_MICRODESC_DL_PER_REQUEST)
  4035. n_per_request = MAX_MICRODESC_DL_PER_REQUEST;
  4036. } else {
  4037. if (n_per_request > MAX_DL_PER_REQUEST)
  4038. n_per_request = MAX_DL_PER_REQUEST;
  4039. }
  4040. if (n_per_request < MIN_DL_PER_REQUEST)
  4041. n_per_request = MIN_DL_PER_REQUEST;
  4042. if (n_downloadable > n_per_request)
  4043. req_plural = rtr_plural = "s";
  4044. else if (n_downloadable > 1)
  4045. rtr_plural = "s";
  4046. log_info(LD_DIR,
  4047. "Launching %d request%s for %d %s%s, %d at a time",
  4048. CEIL_DIV(n_downloadable, n_per_request), req_plural,
  4049. n_downloadable, descname, rtr_plural, n_per_request);
  4050. smartlist_sort_digests(downloadable);
  4051. for (i=0; i < n_downloadable; i += n_per_request) {
  4052. initiate_descriptor_downloads(source, purpose,
  4053. downloadable, i, i+n_per_request,
  4054. pds_flags);
  4055. }
  4056. last_descriptor_download_attempted = now;
  4057. }
  4058. }
  4059. /** For any descriptor that we want that's currently listed in
  4060. * <b>consensus</b>, download it as appropriate. */
  4061. void
  4062. update_consensus_router_descriptor_downloads(time_t now, int is_vote,
  4063. networkstatus_t *consensus)
  4064. {
  4065. const or_options_t *options = get_options();
  4066. digestmap_t *map = NULL;
  4067. smartlist_t *no_longer_old = smartlist_new();
  4068. smartlist_t *downloadable = smartlist_new();
  4069. routerstatus_t *source = NULL;
  4070. int authdir = authdir_mode(options);
  4071. int n_delayed=0, n_have=0, n_would_reject=0, n_wouldnt_use=0,
  4072. n_inprogress=0, n_in_oldrouters=0;
  4073. if (directory_too_idle_to_fetch_descriptors(options, now))
  4074. goto done;
  4075. if (!consensus)
  4076. goto done;
  4077. if (is_vote) {
  4078. /* where's it from, so we know whom to ask for descriptors */
  4079. dir_server_t *ds;
  4080. networkstatus_voter_info_t *voter = smartlist_get(consensus->voters, 0);
  4081. tor_assert(voter);
  4082. ds = trusteddirserver_get_by_v3_auth_digest(voter->identity_digest);
  4083. if (ds)
  4084. source = &(ds->fake_status);
  4085. else
  4086. log_warn(LD_DIR, "couldn't lookup source from vote?");
  4087. }
  4088. map = digestmap_new();
  4089. list_pending_descriptor_downloads(map, 0);
  4090. SMARTLIST_FOREACH_BEGIN(consensus->routerstatus_list, void *, rsp) {
  4091. routerstatus_t *rs =
  4092. is_vote ? &(((vote_routerstatus_t *)rsp)->status) : rsp;
  4093. signed_descriptor_t *sd;
  4094. if ((sd = router_get_by_descriptor_digest(rs->descriptor_digest))) {
  4095. const routerinfo_t *ri;
  4096. ++n_have;
  4097. if (!(ri = router_get_by_id_digest(rs->identity_digest)) ||
  4098. tor_memneq(ri->cache_info.signed_descriptor_digest,
  4099. sd->signed_descriptor_digest, DIGEST_LEN)) {
  4100. /* We have a descriptor with this digest, but either there is no
  4101. * entry in routerlist with the same ID (!ri), or there is one,
  4102. * but the identity digest differs (memneq).
  4103. */
  4104. smartlist_add(no_longer_old, sd);
  4105. ++n_in_oldrouters; /* We have it in old_routers. */
  4106. }
  4107. continue; /* We have it already. */
  4108. }
  4109. if (digestmap_get(map, rs->descriptor_digest)) {
  4110. ++n_inprogress;
  4111. continue; /* We have an in-progress download. */
  4112. }
  4113. if (!download_status_is_ready(&rs->dl_status, now,
  4114. options->TestingDescriptorMaxDownloadTries)) {
  4115. ++n_delayed; /* Not ready for retry. */
  4116. continue;
  4117. }
  4118. if (authdir && dirserv_would_reject_router(rs)) {
  4119. ++n_would_reject;
  4120. continue; /* We would throw it out immediately. */
  4121. }
  4122. if (!directory_caches_dir_info(options) &&
  4123. !client_would_use_router(rs, now, options)) {
  4124. ++n_wouldnt_use;
  4125. continue; /* We would never use it ourself. */
  4126. }
  4127. if (is_vote && source) {
  4128. char time_bufnew[ISO_TIME_LEN+1];
  4129. char time_bufold[ISO_TIME_LEN+1];
  4130. const routerinfo_t *oldrouter;
  4131. oldrouter = router_get_by_id_digest(rs->identity_digest);
  4132. format_iso_time(time_bufnew, rs->published_on);
  4133. if (oldrouter)
  4134. format_iso_time(time_bufold, oldrouter->cache_info.published_on);
  4135. log_info(LD_DIR, "Learned about %s (%s vs %s) from %s's vote (%s)",
  4136. routerstatus_describe(rs),
  4137. time_bufnew,
  4138. oldrouter ? time_bufold : "none",
  4139. source->nickname, oldrouter ? "known" : "unknown");
  4140. }
  4141. smartlist_add(downloadable, rs->descriptor_digest);
  4142. } SMARTLIST_FOREACH_END(rsp);
  4143. if (!authdir_mode_handles_descs(options, ROUTER_PURPOSE_GENERAL)
  4144. && smartlist_len(no_longer_old)) {
  4145. routerlist_t *rl = router_get_routerlist();
  4146. log_info(LD_DIR, "%d router descriptors listed in consensus are "
  4147. "currently in old_routers; making them current.",
  4148. smartlist_len(no_longer_old));
  4149. SMARTLIST_FOREACH_BEGIN(no_longer_old, signed_descriptor_t *, sd) {
  4150. const char *msg;
  4151. was_router_added_t r;
  4152. routerinfo_t *ri = routerlist_reparse_old(rl, sd);
  4153. if (!ri) {
  4154. log_warn(LD_BUG, "Failed to re-parse a router.");
  4155. continue;
  4156. }
  4157. r = router_add_to_routerlist(ri, &msg, 1, 0);
  4158. if (WRA_WAS_OUTDATED(r)) {
  4159. log_warn(LD_DIR, "Couldn't add re-parsed router: %s",
  4160. msg?msg:"???");
  4161. }
  4162. } SMARTLIST_FOREACH_END(sd);
  4163. routerlist_assert_ok(rl);
  4164. }
  4165. log_info(LD_DIR,
  4166. "%d router descriptors downloadable. %d delayed; %d present "
  4167. "(%d of those were in old_routers); %d would_reject; "
  4168. "%d wouldnt_use; %d in progress.",
  4169. smartlist_len(downloadable), n_delayed, n_have, n_in_oldrouters,
  4170. n_would_reject, n_wouldnt_use, n_inprogress);
  4171. launch_descriptor_downloads(DIR_PURPOSE_FETCH_SERVERDESC,
  4172. downloadable, source, now);
  4173. digestmap_free(map, NULL);
  4174. done:
  4175. smartlist_free(downloadable);
  4176. smartlist_free(no_longer_old);
  4177. }
  4178. /** How often should we launch a server/authority request to be sure of getting
  4179. * a guess for our IP? */
  4180. /*XXXX024 this info should come from netinfo cells or something, or we should
  4181. * do this only when we aren't seeing incoming data. see bug 652. */
  4182. #define DUMMY_DOWNLOAD_INTERVAL (20*60)
  4183. /** As needed, launch a dummy router descriptor fetch to see if our
  4184. * address has changed. */
  4185. static void
  4186. launch_dummy_descriptor_download_as_needed(time_t now,
  4187. const or_options_t *options)
  4188. {
  4189. static time_t last_dummy_download = 0;
  4190. /* XXXX024 we could be smarter here; see notes on bug 652. */
  4191. /* If we're a server that doesn't have a configured address, we rely on
  4192. * directory fetches to learn when our address changes. So if we haven't
  4193. * tried to get any routerdescs in a long time, try a dummy fetch now. */
  4194. if (!options->Address &&
  4195. server_mode(options) &&
  4196. last_descriptor_download_attempted + DUMMY_DOWNLOAD_INTERVAL < now &&
  4197. last_dummy_download + DUMMY_DOWNLOAD_INTERVAL < now) {
  4198. last_dummy_download = now;
  4199. directory_get_from_dirserver(DIR_PURPOSE_FETCH_SERVERDESC,
  4200. ROUTER_PURPOSE_GENERAL, "authority.z",
  4201. PDS_RETRY_IF_NO_SERVERS);
  4202. }
  4203. }
  4204. /** Launch downloads for router status as needed. */
  4205. void
  4206. update_router_descriptor_downloads(time_t now)
  4207. {
  4208. const or_options_t *options = get_options();
  4209. if (should_delay_dir_fetches(options, NULL))
  4210. return;
  4211. if (!we_fetch_router_descriptors(options))
  4212. return;
  4213. update_consensus_router_descriptor_downloads(now, 0,
  4214. networkstatus_get_reasonably_live_consensus(now, FLAV_NS));
  4215. }
  4216. /** Launch extrainfo downloads as needed. */
  4217. void
  4218. update_extrainfo_downloads(time_t now)
  4219. {
  4220. const or_options_t *options = get_options();
  4221. routerlist_t *rl;
  4222. smartlist_t *wanted;
  4223. digestmap_t *pending;
  4224. int old_routers, i;
  4225. int n_no_ei = 0, n_pending = 0, n_have = 0, n_delay = 0;
  4226. if (! options->DownloadExtraInfo)
  4227. return;
  4228. if (should_delay_dir_fetches(options, NULL))
  4229. return;
  4230. if (!router_have_minimum_dir_info())
  4231. return;
  4232. pending = digestmap_new();
  4233. list_pending_descriptor_downloads(pending, 1);
  4234. rl = router_get_routerlist();
  4235. wanted = smartlist_new();
  4236. for (old_routers = 0; old_routers < 2; ++old_routers) {
  4237. smartlist_t *lst = old_routers ? rl->old_routers : rl->routers;
  4238. for (i = 0; i < smartlist_len(lst); ++i) {
  4239. signed_descriptor_t *sd;
  4240. char *d;
  4241. if (old_routers)
  4242. sd = smartlist_get(lst, i);
  4243. else
  4244. sd = &((routerinfo_t*)smartlist_get(lst, i))->cache_info;
  4245. if (sd->is_extrainfo)
  4246. continue; /* This should never happen. */
  4247. if (old_routers && !router_get_by_id_digest(sd->identity_digest))
  4248. continue; /* Couldn't check the signature if we got it. */
  4249. if (sd->extrainfo_is_bogus)
  4250. continue;
  4251. d = sd->extra_info_digest;
  4252. if (tor_digest_is_zero(d)) {
  4253. ++n_no_ei;
  4254. continue;
  4255. }
  4256. if (eimap_get(rl->extra_info_map, d)) {
  4257. ++n_have;
  4258. continue;
  4259. }
  4260. if (!download_status_is_ready(&sd->ei_dl_status, now,
  4261. options->TestingDescriptorMaxDownloadTries)) {
  4262. ++n_delay;
  4263. continue;
  4264. }
  4265. if (digestmap_get(pending, d)) {
  4266. ++n_pending;
  4267. continue;
  4268. }
  4269. smartlist_add(wanted, d);
  4270. }
  4271. }
  4272. digestmap_free(pending, NULL);
  4273. log_info(LD_DIR, "Extrainfo download status: %d router with no ei, %d "
  4274. "with present ei, %d delaying, %d pending, %d downloadable.",
  4275. n_no_ei, n_have, n_delay, n_pending, smartlist_len(wanted));
  4276. smartlist_shuffle(wanted);
  4277. for (i = 0; i < smartlist_len(wanted); i += MAX_DL_PER_REQUEST) {
  4278. initiate_descriptor_downloads(NULL, DIR_PURPOSE_FETCH_EXTRAINFO,
  4279. wanted, i, i + MAX_DL_PER_REQUEST,
  4280. PDS_RETRY_IF_NO_SERVERS|PDS_NO_EXISTING_SERVERDESC_FETCH);
  4281. }
  4282. smartlist_free(wanted);
  4283. }
  4284. /** Reset the descriptor download failure count on all routers, so that we
  4285. * can retry any long-failed routers immediately.
  4286. */
  4287. void
  4288. router_reset_descriptor_download_failures(void)
  4289. {
  4290. networkstatus_reset_download_failures();
  4291. last_descriptor_download_attempted = 0;
  4292. if (!routerlist)
  4293. return;
  4294. SMARTLIST_FOREACH(routerlist->routers, routerinfo_t *, ri,
  4295. {
  4296. download_status_reset(&ri->cache_info.ei_dl_status);
  4297. });
  4298. SMARTLIST_FOREACH(routerlist->old_routers, signed_descriptor_t *, sd,
  4299. {
  4300. download_status_reset(&sd->ei_dl_status);
  4301. });
  4302. }
  4303. /** Any changes in a router descriptor's publication time larger than this are
  4304. * automatically non-cosmetic. */
  4305. #define ROUTER_MAX_COSMETIC_TIME_DIFFERENCE (2*60*60)
  4306. /** We allow uptime to vary from how much it ought to be by this much. */
  4307. #define ROUTER_ALLOW_UPTIME_DRIFT (6*60*60)
  4308. /** Return true iff the only differences between r1 and r2 are such that
  4309. * would not cause a recent (post 0.1.1.6) dirserver to republish.
  4310. */
  4311. int
  4312. router_differences_are_cosmetic(const routerinfo_t *r1, const routerinfo_t *r2)
  4313. {
  4314. time_t r1pub, r2pub;
  4315. long time_difference;
  4316. tor_assert(r1 && r2);
  4317. /* r1 should be the one that was published first. */
  4318. if (r1->cache_info.published_on > r2->cache_info.published_on) {
  4319. const routerinfo_t *ri_tmp = r2;
  4320. r2 = r1;
  4321. r1 = ri_tmp;
  4322. }
  4323. /* If any key fields differ, they're different. */
  4324. if (r1->addr != r2->addr ||
  4325. strcasecmp(r1->nickname, r2->nickname) ||
  4326. r1->or_port != r2->or_port ||
  4327. !tor_addr_eq(&r1->ipv6_addr, &r2->ipv6_addr) ||
  4328. r1->ipv6_orport != r2->ipv6_orport ||
  4329. r1->dir_port != r2->dir_port ||
  4330. r1->purpose != r2->purpose ||
  4331. !crypto_pk_eq_keys(r1->onion_pkey, r2->onion_pkey) ||
  4332. !crypto_pk_eq_keys(r1->identity_pkey, r2->identity_pkey) ||
  4333. strcasecmp(r1->platform, r2->platform) ||
  4334. (r1->contact_info && !r2->contact_info) || /* contact_info is optional */
  4335. (!r1->contact_info && r2->contact_info) ||
  4336. (r1->contact_info && r2->contact_info &&
  4337. strcasecmp(r1->contact_info, r2->contact_info)) ||
  4338. r1->is_hibernating != r2->is_hibernating ||
  4339. cmp_addr_policies(r1->exit_policy, r2->exit_policy))
  4340. return 0;
  4341. if ((r1->declared_family == NULL) != (r2->declared_family == NULL))
  4342. return 0;
  4343. if (r1->declared_family && r2->declared_family) {
  4344. int i, n;
  4345. if (smartlist_len(r1->declared_family)!=smartlist_len(r2->declared_family))
  4346. return 0;
  4347. n = smartlist_len(r1->declared_family);
  4348. for (i=0; i < n; ++i) {
  4349. if (strcasecmp(smartlist_get(r1->declared_family, i),
  4350. smartlist_get(r2->declared_family, i)))
  4351. return 0;
  4352. }
  4353. }
  4354. /* Did bandwidth change a lot? */
  4355. if ((r1->bandwidthcapacity < r2->bandwidthcapacity/2) ||
  4356. (r2->bandwidthcapacity < r1->bandwidthcapacity/2))
  4357. return 0;
  4358. /* Did the bandwidthrate or bandwidthburst change? */
  4359. if ((r1->bandwidthrate != r2->bandwidthrate) ||
  4360. (r1->bandwidthburst != r2->bandwidthburst))
  4361. return 0;
  4362. /* Did more than 12 hours pass? */
  4363. if (r1->cache_info.published_on + ROUTER_MAX_COSMETIC_TIME_DIFFERENCE
  4364. < r2->cache_info.published_on)
  4365. return 0;
  4366. /* Did uptime fail to increase by approximately the amount we would think,
  4367. * give or take some slop? */
  4368. r1pub = r1->cache_info.published_on;
  4369. r2pub = r2->cache_info.published_on;
  4370. time_difference = labs(r2->uptime - (r1->uptime + (r2pub - r1pub)));
  4371. if (time_difference > ROUTER_ALLOW_UPTIME_DRIFT &&
  4372. time_difference > r1->uptime * .05 &&
  4373. time_difference > r2->uptime * .05)
  4374. return 0;
  4375. /* Otherwise, the difference is cosmetic. */
  4376. return 1;
  4377. }
  4378. /** Check whether <b>ri</b> (a.k.a. sd) is a router compatible with the
  4379. * extrainfo document
  4380. * <b>ei</b>. If no router is compatible with <b>ei</b>, <b>ei</b> should be
  4381. * dropped. Return 0 for "compatible", return 1 for "reject, and inform
  4382. * whoever uploaded <b>ei</b>, and return -1 for "reject silently.". If
  4383. * <b>msg</b> is present, set *<b>msg</b> to a description of the
  4384. * incompatibility (if any).
  4385. **/
  4386. int
  4387. routerinfo_incompatible_with_extrainfo(const routerinfo_t *ri,
  4388. extrainfo_t *ei,
  4389. signed_descriptor_t *sd,
  4390. const char **msg)
  4391. {
  4392. int digest_matches, r=1;
  4393. tor_assert(ri);
  4394. tor_assert(ei);
  4395. if (!sd)
  4396. sd = (signed_descriptor_t*)&ri->cache_info;
  4397. if (ei->bad_sig) {
  4398. if (msg) *msg = "Extrainfo signature was bad, or signed with wrong key.";
  4399. return 1;
  4400. }
  4401. digest_matches = tor_memeq(ei->cache_info.signed_descriptor_digest,
  4402. sd->extra_info_digest, DIGEST_LEN);
  4403. /* The identity must match exactly to have been generated at the same time
  4404. * by the same router. */
  4405. if (tor_memneq(ri->cache_info.identity_digest,
  4406. ei->cache_info.identity_digest,
  4407. DIGEST_LEN)) {
  4408. if (msg) *msg = "Extrainfo nickname or identity did not match routerinfo";
  4409. goto err; /* different servers */
  4410. }
  4411. if (ei->pending_sig) {
  4412. char signed_digest[128];
  4413. if (crypto_pk_public_checksig(ri->identity_pkey,
  4414. signed_digest, sizeof(signed_digest),
  4415. ei->pending_sig, ei->pending_sig_len) != DIGEST_LEN ||
  4416. tor_memneq(signed_digest, ei->cache_info.signed_descriptor_digest,
  4417. DIGEST_LEN)) {
  4418. ei->bad_sig = 1;
  4419. tor_free(ei->pending_sig);
  4420. if (msg) *msg = "Extrainfo signature bad, or signed with wrong key";
  4421. goto err; /* Bad signature, or no match. */
  4422. }
  4423. ei->cache_info.send_unencrypted = ri->cache_info.send_unencrypted;
  4424. tor_free(ei->pending_sig);
  4425. }
  4426. if (ei->cache_info.published_on < sd->published_on) {
  4427. if (msg) *msg = "Extrainfo published time did not match routerdesc";
  4428. goto err;
  4429. } else if (ei->cache_info.published_on > sd->published_on) {
  4430. if (msg) *msg = "Extrainfo published time did not match routerdesc";
  4431. r = -1;
  4432. goto err;
  4433. }
  4434. if (!digest_matches) {
  4435. if (msg) *msg = "Extrainfo digest did not match value from routerdesc";
  4436. goto err; /* Digest doesn't match declared value. */
  4437. }
  4438. return 0;
  4439. err:
  4440. if (digest_matches) {
  4441. /* This signature was okay, and the digest was right: This is indeed the
  4442. * corresponding extrainfo. But insanely, it doesn't match the routerinfo
  4443. * that lists it. Don't try to fetch this one again. */
  4444. sd->extrainfo_is_bogus = 1;
  4445. }
  4446. return r;
  4447. }
  4448. /** Assert that the internal representation of <b>rl</b> is
  4449. * self-consistent. */
  4450. void
  4451. routerlist_assert_ok(const routerlist_t *rl)
  4452. {
  4453. routerinfo_t *r2;
  4454. signed_descriptor_t *sd2;
  4455. if (!rl)
  4456. return;
  4457. SMARTLIST_FOREACH_BEGIN(rl->routers, routerinfo_t *, r) {
  4458. r2 = rimap_get(rl->identity_map, r->cache_info.identity_digest);
  4459. tor_assert(r == r2);
  4460. sd2 = sdmap_get(rl->desc_digest_map,
  4461. r->cache_info.signed_descriptor_digest);
  4462. tor_assert(&(r->cache_info) == sd2);
  4463. tor_assert(r->cache_info.routerlist_index == r_sl_idx);
  4464. /* XXXX
  4465. *
  4466. * Hoo boy. We need to fix this one, and the fix is a bit tricky, so
  4467. * commenting this out is just a band-aid.
  4468. *
  4469. * The problem is that, although well-behaved router descriptors
  4470. * should never have the same value for their extra_info_digest, it's
  4471. * possible for ill-behaved routers to claim whatever they like there.
  4472. *
  4473. * The real answer is to trash desc_by_eid_map and instead have
  4474. * something that indicates for a given extra-info digest we want,
  4475. * what its download status is. We'll do that as a part of routerlist
  4476. * refactoring once consensus directories are in. For now,
  4477. * this rep violation is probably harmless: an adversary can make us
  4478. * reset our retry count for an extrainfo, but that's not the end
  4479. * of the world. Changing the representation in 0.2.0.x would just
  4480. * destabilize the codebase.
  4481. if (!tor_digest_is_zero(r->cache_info.extra_info_digest)) {
  4482. signed_descriptor_t *sd3 =
  4483. sdmap_get(rl->desc_by_eid_map, r->cache_info.extra_info_digest);
  4484. tor_assert(sd3 == &(r->cache_info));
  4485. }
  4486. */
  4487. } SMARTLIST_FOREACH_END(r);
  4488. SMARTLIST_FOREACH_BEGIN(rl->old_routers, signed_descriptor_t *, sd) {
  4489. r2 = rimap_get(rl->identity_map, sd->identity_digest);
  4490. tor_assert(!r2 || sd != &(r2->cache_info));
  4491. sd2 = sdmap_get(rl->desc_digest_map, sd->signed_descriptor_digest);
  4492. tor_assert(sd == sd2);
  4493. tor_assert(sd->routerlist_index == sd_sl_idx);
  4494. /* XXXX see above.
  4495. if (!tor_digest_is_zero(sd->extra_info_digest)) {
  4496. signed_descriptor_t *sd3 =
  4497. sdmap_get(rl->desc_by_eid_map, sd->extra_info_digest);
  4498. tor_assert(sd3 == sd);
  4499. }
  4500. */
  4501. } SMARTLIST_FOREACH_END(sd);
  4502. RIMAP_FOREACH(rl->identity_map, d, r) {
  4503. tor_assert(tor_memeq(r->cache_info.identity_digest, d, DIGEST_LEN));
  4504. } DIGESTMAP_FOREACH_END;
  4505. SDMAP_FOREACH(rl->desc_digest_map, d, sd) {
  4506. tor_assert(tor_memeq(sd->signed_descriptor_digest, d, DIGEST_LEN));
  4507. } DIGESTMAP_FOREACH_END;
  4508. SDMAP_FOREACH(rl->desc_by_eid_map, d, sd) {
  4509. tor_assert(!tor_digest_is_zero(d));
  4510. tor_assert(sd);
  4511. tor_assert(tor_memeq(sd->extra_info_digest, d, DIGEST_LEN));
  4512. } DIGESTMAP_FOREACH_END;
  4513. EIMAP_FOREACH(rl->extra_info_map, d, ei) {
  4514. signed_descriptor_t *sd;
  4515. tor_assert(tor_memeq(ei->cache_info.signed_descriptor_digest,
  4516. d, DIGEST_LEN));
  4517. sd = sdmap_get(rl->desc_by_eid_map,
  4518. ei->cache_info.signed_descriptor_digest);
  4519. // tor_assert(sd); // XXXX see above
  4520. if (sd) {
  4521. tor_assert(tor_memeq(ei->cache_info.signed_descriptor_digest,
  4522. sd->extra_info_digest, DIGEST_LEN));
  4523. }
  4524. } DIGESTMAP_FOREACH_END;
  4525. }
  4526. /** Allocate and return a new string representing the contact info
  4527. * and platform string for <b>router</b>,
  4528. * surrounded by quotes and using standard C escapes.
  4529. *
  4530. * THIS FUNCTION IS NOT REENTRANT. Don't call it from outside the main
  4531. * thread. Also, each call invalidates the last-returned value, so don't
  4532. * try log_warn(LD_GENERAL, "%s %s", esc_router_info(a), esc_router_info(b));
  4533. *
  4534. * If <b>router</b> is NULL, it just frees its internal memory and returns.
  4535. */
  4536. const char *
  4537. esc_router_info(const routerinfo_t *router)
  4538. {
  4539. static char *info=NULL;
  4540. char *esc_contact, *esc_platform;
  4541. tor_free(info);
  4542. if (!router)
  4543. return NULL; /* we're exiting; just free the memory we use */
  4544. esc_contact = esc_for_log(router->contact_info);
  4545. esc_platform = esc_for_log(router->platform);
  4546. tor_asprintf(&info, "Contact %s, Platform %s", esc_contact, esc_platform);
  4547. tor_free(esc_contact);
  4548. tor_free(esc_platform);
  4549. return info;
  4550. }
  4551. /** Helper for sorting: compare two routerinfos by their identity
  4552. * digest. */
  4553. static int
  4554. compare_routerinfo_by_id_digest_(const void **a, const void **b)
  4555. {
  4556. routerinfo_t *first = *(routerinfo_t **)a, *second = *(routerinfo_t **)b;
  4557. return fast_memcmp(first->cache_info.identity_digest,
  4558. second->cache_info.identity_digest,
  4559. DIGEST_LEN);
  4560. }
  4561. /** Sort a list of routerinfo_t in ascending order of identity digest. */
  4562. void
  4563. routers_sort_by_identity(smartlist_t *routers)
  4564. {
  4565. smartlist_sort(routers, compare_routerinfo_by_id_digest_);
  4566. }
  4567. /** Called when we change a node set, or when we reload the geoip IPv4 list:
  4568. * recompute all country info in all configuration node sets and in the
  4569. * routerlist. */
  4570. void
  4571. refresh_all_country_info(void)
  4572. {
  4573. const or_options_t *options = get_options();
  4574. if (options->EntryNodes)
  4575. routerset_refresh_countries(options->EntryNodes);
  4576. if (options->ExitNodes)
  4577. routerset_refresh_countries(options->ExitNodes);
  4578. if (options->ExcludeNodes)
  4579. routerset_refresh_countries(options->ExcludeNodes);
  4580. if (options->ExcludeExitNodes)
  4581. routerset_refresh_countries(options->ExcludeExitNodes);
  4582. if (options->ExcludeExitNodesUnion_)
  4583. routerset_refresh_countries(options->ExcludeExitNodesUnion_);
  4584. nodelist_refresh_countries();
  4585. }
  4586. /** Determine the routers that are responsible for <b>id</b> (binary) and
  4587. * add pointers to those routers' routerstatus_t to <b>responsible_dirs</b>.
  4588. * Return -1 if we're returning an empty smartlist, else return 0.
  4589. */
  4590. int
  4591. hid_serv_get_responsible_directories(smartlist_t *responsible_dirs,
  4592. const char *id)
  4593. {
  4594. int start, found, n_added = 0, i;
  4595. networkstatus_t *c = networkstatus_get_latest_consensus();
  4596. if (!c || !smartlist_len(c->routerstatus_list)) {
  4597. log_warn(LD_REND, "We don't have a consensus, so we can't perform v2 "
  4598. "rendezvous operations.");
  4599. return -1;
  4600. }
  4601. tor_assert(id);
  4602. start = networkstatus_vote_find_entry_idx(c, id, &found);
  4603. if (start == smartlist_len(c->routerstatus_list)) start = 0;
  4604. i = start;
  4605. do {
  4606. routerstatus_t *r = smartlist_get(c->routerstatus_list, i);
  4607. if (r->is_hs_dir) {
  4608. smartlist_add(responsible_dirs, r);
  4609. if (++n_added == REND_NUMBER_OF_CONSECUTIVE_REPLICAS)
  4610. return 0;
  4611. }
  4612. if (++i == smartlist_len(c->routerstatus_list))
  4613. i = 0;
  4614. } while (i != start);
  4615. /* Even though we don't have the desired number of hidden service
  4616. * directories, be happy if we got any. */
  4617. return smartlist_len(responsible_dirs) ? 0 : -1;
  4618. }
  4619. /** Return true if this node is currently acting as hidden service
  4620. * directory, false otherwise. */
  4621. int
  4622. hid_serv_acting_as_directory(void)
  4623. {
  4624. const routerinfo_t *me = router_get_my_routerinfo();
  4625. if (!me)
  4626. return 0;
  4627. if (!get_options()->HidServDirectoryV2) {
  4628. log_info(LD_REND, "We are not acting as hidden service directory, "
  4629. "because we have not been configured as such.");
  4630. return 0;
  4631. }
  4632. return 1;
  4633. }
  4634. /** Return true if this node is responsible for storing the descriptor ID
  4635. * in <b>query</b> and false otherwise. */
  4636. int
  4637. hid_serv_responsible_for_desc_id(const char *query)
  4638. {
  4639. const routerinfo_t *me;
  4640. routerstatus_t *last_rs;
  4641. const char *my_id, *last_id;
  4642. int result;
  4643. smartlist_t *responsible;
  4644. if (!hid_serv_acting_as_directory())
  4645. return 0;
  4646. if (!(me = router_get_my_routerinfo()))
  4647. return 0; /* This is redundant, but let's be paranoid. */
  4648. my_id = me->cache_info.identity_digest;
  4649. responsible = smartlist_new();
  4650. if (hid_serv_get_responsible_directories(responsible, query) < 0) {
  4651. smartlist_free(responsible);
  4652. return 0;
  4653. }
  4654. last_rs = smartlist_get(responsible, smartlist_len(responsible)-1);
  4655. last_id = last_rs->identity_digest;
  4656. result = rend_id_is_in_interval(my_id, query, last_id);
  4657. smartlist_free(responsible);
  4658. return result;
  4659. }